routing.c 31 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169
  1. /*
  2. * Copyright (C) 2007-2012 B.A.T.M.A.N. contributors:
  3. *
  4. * Marek Lindner, Simon Wunderlich
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of version 2 of the GNU General Public
  8. * License as published by the Free Software Foundation.
  9. *
  10. * This program is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. * General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program; if not, write to the Free Software
  17. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
  18. * 02110-1301, USA
  19. *
  20. */
  21. #include "main.h"
  22. #include "routing.h"
  23. #include "send.h"
  24. #include "soft-interface.h"
  25. #include "hard-interface.h"
  26. #include "icmp_socket.h"
  27. #include "translation-table.h"
  28. #include "originator.h"
  29. #include "vis.h"
  30. #include "unicast.h"
  31. #include "bridge_loop_avoidance.h"
  32. static int route_unicast_packet(struct sk_buff *skb,
  33. struct hard_iface *recv_if);
  34. void batadv_slide_own_bcast_window(struct hard_iface *hard_iface)
  35. {
  36. struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
  37. struct hashtable_t *hash = bat_priv->orig_hash;
  38. struct hlist_node *node;
  39. struct hlist_head *head;
  40. struct orig_node *orig_node;
  41. unsigned long *word;
  42. uint32_t i;
  43. size_t word_index;
  44. for (i = 0; i < hash->size; i++) {
  45. head = &hash->table[i];
  46. rcu_read_lock();
  47. hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
  48. spin_lock_bh(&orig_node->ogm_cnt_lock);
  49. word_index = hard_iface->if_num * NUM_WORDS;
  50. word = &(orig_node->bcast_own[word_index]);
  51. batadv_bit_get_packet(bat_priv, word, 1, 0);
  52. orig_node->bcast_own_sum[hard_iface->if_num] =
  53. bitmap_weight(word, TQ_LOCAL_WINDOW_SIZE);
  54. spin_unlock_bh(&orig_node->ogm_cnt_lock);
  55. }
  56. rcu_read_unlock();
  57. }
  58. }
  59. static void _update_route(struct bat_priv *bat_priv,
  60. struct orig_node *orig_node,
  61. struct neigh_node *neigh_node)
  62. {
  63. struct neigh_node *curr_router;
  64. curr_router = batadv_orig_node_get_router(orig_node);
  65. /* route deleted */
  66. if ((curr_router) && (!neigh_node)) {
  67. bat_dbg(DBG_ROUTES, bat_priv, "Deleting route towards: %pM\n",
  68. orig_node->orig);
  69. batadv_tt_global_del_orig(bat_priv, orig_node,
  70. "Deleted route towards originator");
  71. /* route added */
  72. } else if ((!curr_router) && (neigh_node)) {
  73. bat_dbg(DBG_ROUTES, bat_priv,
  74. "Adding route towards: %pM (via %pM)\n",
  75. orig_node->orig, neigh_node->addr);
  76. /* route changed */
  77. } else if (neigh_node && curr_router) {
  78. bat_dbg(DBG_ROUTES, bat_priv,
  79. "Changing route towards: %pM (now via %pM - was via %pM)\n",
  80. orig_node->orig, neigh_node->addr,
  81. curr_router->addr);
  82. }
  83. if (curr_router)
  84. batadv_neigh_node_free_ref(curr_router);
  85. /* increase refcount of new best neighbor */
  86. if (neigh_node && !atomic_inc_not_zero(&neigh_node->refcount))
  87. neigh_node = NULL;
  88. spin_lock_bh(&orig_node->neigh_list_lock);
  89. rcu_assign_pointer(orig_node->router, neigh_node);
  90. spin_unlock_bh(&orig_node->neigh_list_lock);
  91. /* decrease refcount of previous best neighbor */
  92. if (curr_router)
  93. batadv_neigh_node_free_ref(curr_router);
  94. }
  95. void batadv_update_route(struct bat_priv *bat_priv, struct orig_node *orig_node,
  96. struct neigh_node *neigh_node)
  97. {
  98. struct neigh_node *router = NULL;
  99. if (!orig_node)
  100. goto out;
  101. router = batadv_orig_node_get_router(orig_node);
  102. if (router != neigh_node)
  103. _update_route(bat_priv, orig_node, neigh_node);
  104. out:
  105. if (router)
  106. batadv_neigh_node_free_ref(router);
  107. }
  108. /* caller must hold the neigh_list_lock */
  109. void batadv_bonding_candidate_del(struct orig_node *orig_node,
  110. struct neigh_node *neigh_node)
  111. {
  112. /* this neighbor is not part of our candidate list */
  113. if (list_empty(&neigh_node->bonding_list))
  114. goto out;
  115. list_del_rcu(&neigh_node->bonding_list);
  116. INIT_LIST_HEAD(&neigh_node->bonding_list);
  117. batadv_neigh_node_free_ref(neigh_node);
  118. atomic_dec(&orig_node->bond_candidates);
  119. out:
  120. return;
  121. }
  122. void batadv_bonding_candidate_add(struct orig_node *orig_node,
  123. struct neigh_node *neigh_node)
  124. {
  125. struct hlist_node *node;
  126. struct neigh_node *tmp_neigh_node, *router = NULL;
  127. uint8_t interference_candidate = 0;
  128. spin_lock_bh(&orig_node->neigh_list_lock);
  129. /* only consider if it has the same primary address ... */
  130. if (!compare_eth(orig_node->orig,
  131. neigh_node->orig_node->primary_addr))
  132. goto candidate_del;
  133. router = batadv_orig_node_get_router(orig_node);
  134. if (!router)
  135. goto candidate_del;
  136. /* ... and is good enough to be considered */
  137. if (neigh_node->tq_avg < router->tq_avg - BONDING_TQ_THRESHOLD)
  138. goto candidate_del;
  139. /**
  140. * check if we have another candidate with the same mac address or
  141. * interface. If we do, we won't select this candidate because of
  142. * possible interference.
  143. */
  144. hlist_for_each_entry_rcu(tmp_neigh_node, node,
  145. &orig_node->neigh_list, list) {
  146. if (tmp_neigh_node == neigh_node)
  147. continue;
  148. /* we only care if the other candidate is even
  149. * considered as candidate. */
  150. if (list_empty(&tmp_neigh_node->bonding_list))
  151. continue;
  152. if ((neigh_node->if_incoming == tmp_neigh_node->if_incoming) ||
  153. (compare_eth(neigh_node->addr, tmp_neigh_node->addr))) {
  154. interference_candidate = 1;
  155. break;
  156. }
  157. }
  158. /* don't care further if it is an interference candidate */
  159. if (interference_candidate)
  160. goto candidate_del;
  161. /* this neighbor already is part of our candidate list */
  162. if (!list_empty(&neigh_node->bonding_list))
  163. goto out;
  164. if (!atomic_inc_not_zero(&neigh_node->refcount))
  165. goto out;
  166. list_add_rcu(&neigh_node->bonding_list, &orig_node->bond_list);
  167. atomic_inc(&orig_node->bond_candidates);
  168. goto out;
  169. candidate_del:
  170. batadv_bonding_candidate_del(orig_node, neigh_node);
  171. out:
  172. spin_unlock_bh(&orig_node->neigh_list_lock);
  173. if (router)
  174. batadv_neigh_node_free_ref(router);
  175. }
  176. /* copy primary address for bonding */
  177. void
  178. batadv_bonding_save_primary(const struct orig_node *orig_node,
  179. struct orig_node *orig_neigh_node,
  180. const struct batman_ogm_packet *batman_ogm_packet)
  181. {
  182. if (!(batman_ogm_packet->flags & PRIMARIES_FIRST_HOP))
  183. return;
  184. memcpy(orig_neigh_node->primary_addr, orig_node->orig, ETH_ALEN);
  185. }
  186. /* checks whether the host restarted and is in the protection time.
  187. * returns:
  188. * 0 if the packet is to be accepted
  189. * 1 if the packet is to be ignored.
  190. */
  191. int batadv_window_protected(struct bat_priv *bat_priv, int32_t seq_num_diff,
  192. unsigned long *last_reset)
  193. {
  194. if ((seq_num_diff <= -TQ_LOCAL_WINDOW_SIZE) ||
  195. (seq_num_diff >= EXPECTED_SEQNO_RANGE)) {
  196. if (!has_timed_out(*last_reset, RESET_PROTECTION_MS))
  197. return 1;
  198. *last_reset = jiffies;
  199. bat_dbg(DBG_BATMAN, bat_priv,
  200. "old packet received, start protection\n");
  201. }
  202. return 0;
  203. }
  204. bool batadv_check_management_packet(struct sk_buff *skb,
  205. struct hard_iface *hard_iface,
  206. int header_len)
  207. {
  208. struct ethhdr *ethhdr;
  209. /* drop packet if it has not necessary minimum size */
  210. if (unlikely(!pskb_may_pull(skb, header_len)))
  211. return false;
  212. ethhdr = (struct ethhdr *)skb_mac_header(skb);
  213. /* packet with broadcast indication but unicast recipient */
  214. if (!is_broadcast_ether_addr(ethhdr->h_dest))
  215. return false;
  216. /* packet with broadcast sender address */
  217. if (is_broadcast_ether_addr(ethhdr->h_source))
  218. return false;
  219. /* create a copy of the skb, if needed, to modify it. */
  220. if (skb_cow(skb, 0) < 0)
  221. return false;
  222. /* keep skb linear */
  223. if (skb_linearize(skb) < 0)
  224. return false;
  225. return true;
  226. }
  227. static int recv_my_icmp_packet(struct bat_priv *bat_priv,
  228. struct sk_buff *skb, size_t icmp_len)
  229. {
  230. struct hard_iface *primary_if = NULL;
  231. struct orig_node *orig_node = NULL;
  232. struct neigh_node *router = NULL;
  233. struct icmp_packet_rr *icmp_packet;
  234. int ret = NET_RX_DROP;
  235. icmp_packet = (struct icmp_packet_rr *)skb->data;
  236. /* add data to device queue */
  237. if (icmp_packet->msg_type != ECHO_REQUEST) {
  238. batadv_socket_receive_packet(icmp_packet, icmp_len);
  239. goto out;
  240. }
  241. primary_if = primary_if_get_selected(bat_priv);
  242. if (!primary_if)
  243. goto out;
  244. /* answer echo request (ping) */
  245. /* get routing information */
  246. orig_node = orig_hash_find(bat_priv, icmp_packet->orig);
  247. if (!orig_node)
  248. goto out;
  249. router = batadv_orig_node_get_router(orig_node);
  250. if (!router)
  251. goto out;
  252. /* create a copy of the skb, if needed, to modify it. */
  253. if (skb_cow(skb, ETH_HLEN) < 0)
  254. goto out;
  255. icmp_packet = (struct icmp_packet_rr *)skb->data;
  256. memcpy(icmp_packet->dst, icmp_packet->orig, ETH_ALEN);
  257. memcpy(icmp_packet->orig, primary_if->net_dev->dev_addr, ETH_ALEN);
  258. icmp_packet->msg_type = ECHO_REPLY;
  259. icmp_packet->header.ttl = TTL;
  260. batadv_send_skb_packet(skb, router->if_incoming, router->addr);
  261. ret = NET_RX_SUCCESS;
  262. out:
  263. if (primary_if)
  264. hardif_free_ref(primary_if);
  265. if (router)
  266. batadv_neigh_node_free_ref(router);
  267. if (orig_node)
  268. batadv_orig_node_free_ref(orig_node);
  269. return ret;
  270. }
  271. static int recv_icmp_ttl_exceeded(struct bat_priv *bat_priv,
  272. struct sk_buff *skb)
  273. {
  274. struct hard_iface *primary_if = NULL;
  275. struct orig_node *orig_node = NULL;
  276. struct neigh_node *router = NULL;
  277. struct icmp_packet *icmp_packet;
  278. int ret = NET_RX_DROP;
  279. icmp_packet = (struct icmp_packet *)skb->data;
  280. /* send TTL exceeded if packet is an echo request (traceroute) */
  281. if (icmp_packet->msg_type != ECHO_REQUEST) {
  282. pr_debug("Warning - can't forward icmp packet from %pM to %pM: ttl exceeded\n",
  283. icmp_packet->orig, icmp_packet->dst);
  284. goto out;
  285. }
  286. primary_if = primary_if_get_selected(bat_priv);
  287. if (!primary_if)
  288. goto out;
  289. /* get routing information */
  290. orig_node = orig_hash_find(bat_priv, icmp_packet->orig);
  291. if (!orig_node)
  292. goto out;
  293. router = batadv_orig_node_get_router(orig_node);
  294. if (!router)
  295. goto out;
  296. /* create a copy of the skb, if needed, to modify it. */
  297. if (skb_cow(skb, ETH_HLEN) < 0)
  298. goto out;
  299. icmp_packet = (struct icmp_packet *)skb->data;
  300. memcpy(icmp_packet->dst, icmp_packet->orig, ETH_ALEN);
  301. memcpy(icmp_packet->orig, primary_if->net_dev->dev_addr, ETH_ALEN);
  302. icmp_packet->msg_type = TTL_EXCEEDED;
  303. icmp_packet->header.ttl = TTL;
  304. batadv_send_skb_packet(skb, router->if_incoming, router->addr);
  305. ret = NET_RX_SUCCESS;
  306. out:
  307. if (primary_if)
  308. hardif_free_ref(primary_if);
  309. if (router)
  310. batadv_neigh_node_free_ref(router);
  311. if (orig_node)
  312. batadv_orig_node_free_ref(orig_node);
  313. return ret;
  314. }
  315. int batadv_recv_icmp_packet(struct sk_buff *skb, struct hard_iface *recv_if)
  316. {
  317. struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
  318. struct icmp_packet_rr *icmp_packet;
  319. struct ethhdr *ethhdr;
  320. struct orig_node *orig_node = NULL;
  321. struct neigh_node *router = NULL;
  322. int hdr_size = sizeof(struct icmp_packet);
  323. int ret = NET_RX_DROP;
  324. /**
  325. * we truncate all incoming icmp packets if they don't match our size
  326. */
  327. if (skb->len >= sizeof(struct icmp_packet_rr))
  328. hdr_size = sizeof(struct icmp_packet_rr);
  329. /* drop packet if it has not necessary minimum size */
  330. if (unlikely(!pskb_may_pull(skb, hdr_size)))
  331. goto out;
  332. ethhdr = (struct ethhdr *)skb_mac_header(skb);
  333. /* packet with unicast indication but broadcast recipient */
  334. if (is_broadcast_ether_addr(ethhdr->h_dest))
  335. goto out;
  336. /* packet with broadcast sender address */
  337. if (is_broadcast_ether_addr(ethhdr->h_source))
  338. goto out;
  339. /* not for me */
  340. if (!is_my_mac(ethhdr->h_dest))
  341. goto out;
  342. icmp_packet = (struct icmp_packet_rr *)skb->data;
  343. /* add record route information if not full */
  344. if ((hdr_size == sizeof(struct icmp_packet_rr)) &&
  345. (icmp_packet->rr_cur < BAT_RR_LEN)) {
  346. memcpy(&(icmp_packet->rr[icmp_packet->rr_cur]),
  347. ethhdr->h_dest, ETH_ALEN);
  348. icmp_packet->rr_cur++;
  349. }
  350. /* packet for me */
  351. if (is_my_mac(icmp_packet->dst))
  352. return recv_my_icmp_packet(bat_priv, skb, hdr_size);
  353. /* TTL exceeded */
  354. if (icmp_packet->header.ttl < 2)
  355. return recv_icmp_ttl_exceeded(bat_priv, skb);
  356. /* get routing information */
  357. orig_node = orig_hash_find(bat_priv, icmp_packet->dst);
  358. if (!orig_node)
  359. goto out;
  360. router = batadv_orig_node_get_router(orig_node);
  361. if (!router)
  362. goto out;
  363. /* create a copy of the skb, if needed, to modify it. */
  364. if (skb_cow(skb, ETH_HLEN) < 0)
  365. goto out;
  366. icmp_packet = (struct icmp_packet_rr *)skb->data;
  367. /* decrement ttl */
  368. icmp_packet->header.ttl--;
  369. /* route it */
  370. batadv_send_skb_packet(skb, router->if_incoming, router->addr);
  371. ret = NET_RX_SUCCESS;
  372. out:
  373. if (router)
  374. batadv_neigh_node_free_ref(router);
  375. if (orig_node)
  376. batadv_orig_node_free_ref(orig_node);
  377. return ret;
  378. }
  379. /* In the bonding case, send the packets in a round
  380. * robin fashion over the remaining interfaces.
  381. *
  382. * This method rotates the bonding list and increases the
  383. * returned router's refcount. */
  384. static struct neigh_node *find_bond_router(struct orig_node *primary_orig,
  385. const struct hard_iface *recv_if)
  386. {
  387. struct neigh_node *tmp_neigh_node;
  388. struct neigh_node *router = NULL, *first_candidate = NULL;
  389. rcu_read_lock();
  390. list_for_each_entry_rcu(tmp_neigh_node, &primary_orig->bond_list,
  391. bonding_list) {
  392. if (!first_candidate)
  393. first_candidate = tmp_neigh_node;
  394. /* recv_if == NULL on the first node. */
  395. if (tmp_neigh_node->if_incoming == recv_if)
  396. continue;
  397. if (!atomic_inc_not_zero(&tmp_neigh_node->refcount))
  398. continue;
  399. router = tmp_neigh_node;
  400. break;
  401. }
  402. /* use the first candidate if nothing was found. */
  403. if (!router && first_candidate &&
  404. atomic_inc_not_zero(&first_candidate->refcount))
  405. router = first_candidate;
  406. if (!router)
  407. goto out;
  408. /* selected should point to the next element
  409. * after the current router */
  410. spin_lock_bh(&primary_orig->neigh_list_lock);
  411. /* this is a list_move(), which unfortunately
  412. * does not exist as rcu version */
  413. list_del_rcu(&primary_orig->bond_list);
  414. list_add_rcu(&primary_orig->bond_list,
  415. &router->bonding_list);
  416. spin_unlock_bh(&primary_orig->neigh_list_lock);
  417. out:
  418. rcu_read_unlock();
  419. return router;
  420. }
  421. /* Interface Alternating: Use the best of the
  422. * remaining candidates which are not using
  423. * this interface.
  424. *
  425. * Increases the returned router's refcount */
  426. static struct neigh_node *find_ifalter_router(struct orig_node *primary_orig,
  427. const struct hard_iface *recv_if)
  428. {
  429. struct neigh_node *tmp_neigh_node;
  430. struct neigh_node *router = NULL, *first_candidate = NULL;
  431. rcu_read_lock();
  432. list_for_each_entry_rcu(tmp_neigh_node, &primary_orig->bond_list,
  433. bonding_list) {
  434. if (!first_candidate)
  435. first_candidate = tmp_neigh_node;
  436. /* recv_if == NULL on the first node. */
  437. if (tmp_neigh_node->if_incoming == recv_if)
  438. continue;
  439. if (!atomic_inc_not_zero(&tmp_neigh_node->refcount))
  440. continue;
  441. /* if we don't have a router yet
  442. * or this one is better, choose it. */
  443. if ((!router) ||
  444. (tmp_neigh_node->tq_avg > router->tq_avg)) {
  445. /* decrement refcount of
  446. * previously selected router */
  447. if (router)
  448. batadv_neigh_node_free_ref(router);
  449. router = tmp_neigh_node;
  450. atomic_inc_not_zero(&router->refcount);
  451. }
  452. batadv_neigh_node_free_ref(tmp_neigh_node);
  453. }
  454. /* use the first candidate if nothing was found. */
  455. if (!router && first_candidate &&
  456. atomic_inc_not_zero(&first_candidate->refcount))
  457. router = first_candidate;
  458. rcu_read_unlock();
  459. return router;
  460. }
  461. int batadv_recv_tt_query(struct sk_buff *skb, struct hard_iface *recv_if)
  462. {
  463. struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
  464. struct tt_query_packet *tt_query;
  465. uint16_t tt_size;
  466. struct ethhdr *ethhdr;
  467. /* drop packet if it has not necessary minimum size */
  468. if (unlikely(!pskb_may_pull(skb, sizeof(struct tt_query_packet))))
  469. goto out;
  470. /* I could need to modify it */
  471. if (skb_cow(skb, sizeof(struct tt_query_packet)) < 0)
  472. goto out;
  473. ethhdr = (struct ethhdr *)skb_mac_header(skb);
  474. /* packet with unicast indication but broadcast recipient */
  475. if (is_broadcast_ether_addr(ethhdr->h_dest))
  476. goto out;
  477. /* packet with broadcast sender address */
  478. if (is_broadcast_ether_addr(ethhdr->h_source))
  479. goto out;
  480. tt_query = (struct tt_query_packet *)skb->data;
  481. switch (tt_query->flags & TT_QUERY_TYPE_MASK) {
  482. case TT_REQUEST:
  483. batadv_inc_counter(bat_priv, BAT_CNT_TT_REQUEST_RX);
  484. /* If we cannot provide an answer the tt_request is
  485. * forwarded */
  486. if (!batadv_send_tt_response(bat_priv, tt_query)) {
  487. bat_dbg(DBG_TT, bat_priv,
  488. "Routing TT_REQUEST to %pM [%c]\n",
  489. tt_query->dst,
  490. (tt_query->flags & TT_FULL_TABLE ? 'F' : '.'));
  491. return route_unicast_packet(skb, recv_if);
  492. }
  493. break;
  494. case TT_RESPONSE:
  495. batadv_inc_counter(bat_priv, BAT_CNT_TT_RESPONSE_RX);
  496. if (is_my_mac(tt_query->dst)) {
  497. /* packet needs to be linearized to access the TT
  498. * changes */
  499. if (skb_linearize(skb) < 0)
  500. goto out;
  501. /* skb_linearize() possibly changed skb->data */
  502. tt_query = (struct tt_query_packet *)skb->data;
  503. tt_size = batadv_tt_len(ntohs(tt_query->tt_data));
  504. /* Ensure we have all the claimed data */
  505. if (unlikely(skb_headlen(skb) <
  506. sizeof(struct tt_query_packet) + tt_size))
  507. goto out;
  508. batadv_handle_tt_response(bat_priv, tt_query);
  509. } else {
  510. bat_dbg(DBG_TT, bat_priv,
  511. "Routing TT_RESPONSE to %pM [%c]\n",
  512. tt_query->dst,
  513. (tt_query->flags & TT_FULL_TABLE ? 'F' : '.'));
  514. return route_unicast_packet(skb, recv_if);
  515. }
  516. break;
  517. }
  518. out:
  519. /* returning NET_RX_DROP will make the caller function kfree the skb */
  520. return NET_RX_DROP;
  521. }
  522. int batadv_recv_roam_adv(struct sk_buff *skb, struct hard_iface *recv_if)
  523. {
  524. struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
  525. struct roam_adv_packet *roam_adv_packet;
  526. struct orig_node *orig_node;
  527. struct ethhdr *ethhdr;
  528. /* drop packet if it has not necessary minimum size */
  529. if (unlikely(!pskb_may_pull(skb, sizeof(struct roam_adv_packet))))
  530. goto out;
  531. ethhdr = (struct ethhdr *)skb_mac_header(skb);
  532. /* packet with unicast indication but broadcast recipient */
  533. if (is_broadcast_ether_addr(ethhdr->h_dest))
  534. goto out;
  535. /* packet with broadcast sender address */
  536. if (is_broadcast_ether_addr(ethhdr->h_source))
  537. goto out;
  538. batadv_inc_counter(bat_priv, BAT_CNT_TT_ROAM_ADV_RX);
  539. roam_adv_packet = (struct roam_adv_packet *)skb->data;
  540. if (!is_my_mac(roam_adv_packet->dst))
  541. return route_unicast_packet(skb, recv_if);
  542. /* check if it is a backbone gateway. we don't accept
  543. * roaming advertisement from it, as it has the same
  544. * entries as we have.
  545. */
  546. if (batadv_bla_is_backbone_gw_orig(bat_priv, roam_adv_packet->src))
  547. goto out;
  548. orig_node = orig_hash_find(bat_priv, roam_adv_packet->src);
  549. if (!orig_node)
  550. goto out;
  551. bat_dbg(DBG_TT, bat_priv,
  552. "Received ROAMING_ADV from %pM (client %pM)\n",
  553. roam_adv_packet->src, roam_adv_packet->client);
  554. batadv_tt_global_add(bat_priv, orig_node, roam_adv_packet->client,
  555. atomic_read(&orig_node->last_ttvn) + 1, true,
  556. false);
  557. /* Roaming phase starts: I have new information but the ttvn has not
  558. * been incremented yet. This flag will make me check all the incoming
  559. * packets for the correct destination. */
  560. bat_priv->tt_poss_change = true;
  561. batadv_orig_node_free_ref(orig_node);
  562. out:
  563. /* returning NET_RX_DROP will make the caller function kfree the skb */
  564. return NET_RX_DROP;
  565. }
  566. /* find a suitable router for this originator, and use
  567. * bonding if possible. increases the found neighbors
  568. * refcount.*/
  569. struct neigh_node *batadv_find_router(struct bat_priv *bat_priv,
  570. struct orig_node *orig_node,
  571. const struct hard_iface *recv_if)
  572. {
  573. struct orig_node *primary_orig_node;
  574. struct orig_node *router_orig;
  575. struct neigh_node *router;
  576. static uint8_t zero_mac[ETH_ALEN] = {0, 0, 0, 0, 0, 0};
  577. int bonding_enabled;
  578. if (!orig_node)
  579. return NULL;
  580. router = batadv_orig_node_get_router(orig_node);
  581. if (!router)
  582. goto err;
  583. /* without bonding, the first node should
  584. * always choose the default router. */
  585. bonding_enabled = atomic_read(&bat_priv->bonding);
  586. rcu_read_lock();
  587. /* select default router to output */
  588. router_orig = router->orig_node;
  589. if (!router_orig)
  590. goto err_unlock;
  591. if ((!recv_if) && (!bonding_enabled))
  592. goto return_router;
  593. /* if we have something in the primary_addr, we can search
  594. * for a potential bonding candidate. */
  595. if (compare_eth(router_orig->primary_addr, zero_mac))
  596. goto return_router;
  597. /* find the orig_node which has the primary interface. might
  598. * even be the same as our router_orig in many cases */
  599. if (compare_eth(router_orig->primary_addr, router_orig->orig)) {
  600. primary_orig_node = router_orig;
  601. } else {
  602. primary_orig_node = orig_hash_find(bat_priv,
  603. router_orig->primary_addr);
  604. if (!primary_orig_node)
  605. goto return_router;
  606. batadv_orig_node_free_ref(primary_orig_node);
  607. }
  608. /* with less than 2 candidates, we can't do any
  609. * bonding and prefer the original router. */
  610. if (atomic_read(&primary_orig_node->bond_candidates) < 2)
  611. goto return_router;
  612. /* all nodes between should choose a candidate which
  613. * is is not on the interface where the packet came
  614. * in. */
  615. batadv_neigh_node_free_ref(router);
  616. if (bonding_enabled)
  617. router = find_bond_router(primary_orig_node, recv_if);
  618. else
  619. router = find_ifalter_router(primary_orig_node, recv_if);
  620. return_router:
  621. if (router && router->if_incoming->if_status != IF_ACTIVE)
  622. goto err_unlock;
  623. rcu_read_unlock();
  624. return router;
  625. err_unlock:
  626. rcu_read_unlock();
  627. err:
  628. if (router)
  629. batadv_neigh_node_free_ref(router);
  630. return NULL;
  631. }
  632. static int check_unicast_packet(struct sk_buff *skb, int hdr_size)
  633. {
  634. struct ethhdr *ethhdr;
  635. /* drop packet if it has not necessary minimum size */
  636. if (unlikely(!pskb_may_pull(skb, hdr_size)))
  637. return -1;
  638. ethhdr = (struct ethhdr *)skb_mac_header(skb);
  639. /* packet with unicast indication but broadcast recipient */
  640. if (is_broadcast_ether_addr(ethhdr->h_dest))
  641. return -1;
  642. /* packet with broadcast sender address */
  643. if (is_broadcast_ether_addr(ethhdr->h_source))
  644. return -1;
  645. /* not for me */
  646. if (!is_my_mac(ethhdr->h_dest))
  647. return -1;
  648. return 0;
  649. }
  650. static int route_unicast_packet(struct sk_buff *skb, struct hard_iface *recv_if)
  651. {
  652. struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
  653. struct orig_node *orig_node = NULL;
  654. struct neigh_node *neigh_node = NULL;
  655. struct unicast_packet *unicast_packet;
  656. struct ethhdr *ethhdr = (struct ethhdr *)skb_mac_header(skb);
  657. int ret = NET_RX_DROP;
  658. struct sk_buff *new_skb;
  659. unicast_packet = (struct unicast_packet *)skb->data;
  660. /* TTL exceeded */
  661. if (unicast_packet->header.ttl < 2) {
  662. pr_debug("Warning - can't forward unicast packet from %pM to %pM: ttl exceeded\n",
  663. ethhdr->h_source, unicast_packet->dest);
  664. goto out;
  665. }
  666. /* get routing information */
  667. orig_node = orig_hash_find(bat_priv, unicast_packet->dest);
  668. if (!orig_node)
  669. goto out;
  670. /* find_router() increases neigh_nodes refcount if found. */
  671. neigh_node = batadv_find_router(bat_priv, orig_node, recv_if);
  672. if (!neigh_node)
  673. goto out;
  674. /* create a copy of the skb, if needed, to modify it. */
  675. if (skb_cow(skb, ETH_HLEN) < 0)
  676. goto out;
  677. unicast_packet = (struct unicast_packet *)skb->data;
  678. if (unicast_packet->header.packet_type == BAT_UNICAST &&
  679. atomic_read(&bat_priv->fragmentation) &&
  680. skb->len > neigh_node->if_incoming->net_dev->mtu) {
  681. ret = frag_send_skb(skb, bat_priv,
  682. neigh_node->if_incoming, neigh_node->addr);
  683. goto out;
  684. }
  685. if (unicast_packet->header.packet_type == BAT_UNICAST_FRAG &&
  686. frag_can_reassemble(skb, neigh_node->if_incoming->net_dev->mtu)) {
  687. ret = frag_reassemble_skb(skb, bat_priv, &new_skb);
  688. if (ret == NET_RX_DROP)
  689. goto out;
  690. /* packet was buffered for late merge */
  691. if (!new_skb) {
  692. ret = NET_RX_SUCCESS;
  693. goto out;
  694. }
  695. skb = new_skb;
  696. unicast_packet = (struct unicast_packet *)skb->data;
  697. }
  698. /* decrement ttl */
  699. unicast_packet->header.ttl--;
  700. /* Update stats counter */
  701. batadv_inc_counter(bat_priv, BAT_CNT_FORWARD);
  702. batadv_add_counter(bat_priv, BAT_CNT_FORWARD_BYTES,
  703. skb->len + ETH_HLEN);
  704. /* route it */
  705. batadv_send_skb_packet(skb, neigh_node->if_incoming, neigh_node->addr);
  706. ret = NET_RX_SUCCESS;
  707. out:
  708. if (neigh_node)
  709. batadv_neigh_node_free_ref(neigh_node);
  710. if (orig_node)
  711. batadv_orig_node_free_ref(orig_node);
  712. return ret;
  713. }
  714. static int check_unicast_ttvn(struct bat_priv *bat_priv,
  715. struct sk_buff *skb) {
  716. uint8_t curr_ttvn;
  717. struct orig_node *orig_node;
  718. struct ethhdr *ethhdr;
  719. struct hard_iface *primary_if;
  720. struct unicast_packet *unicast_packet;
  721. bool tt_poss_change;
  722. /* I could need to modify it */
  723. if (skb_cow(skb, sizeof(struct unicast_packet)) < 0)
  724. return 0;
  725. unicast_packet = (struct unicast_packet *)skb->data;
  726. if (is_my_mac(unicast_packet->dest)) {
  727. tt_poss_change = bat_priv->tt_poss_change;
  728. curr_ttvn = (uint8_t)atomic_read(&bat_priv->ttvn);
  729. } else {
  730. orig_node = orig_hash_find(bat_priv, unicast_packet->dest);
  731. if (!orig_node)
  732. return 0;
  733. curr_ttvn = (uint8_t)atomic_read(&orig_node->last_ttvn);
  734. tt_poss_change = orig_node->tt_poss_change;
  735. batadv_orig_node_free_ref(orig_node);
  736. }
  737. /* Check whether I have to reroute the packet */
  738. if (seq_before(unicast_packet->ttvn, curr_ttvn) || tt_poss_change) {
  739. /* check if there is enough data before accessing it */
  740. if (pskb_may_pull(skb, sizeof(struct unicast_packet) +
  741. ETH_HLEN) < 0)
  742. return 0;
  743. ethhdr = (struct ethhdr *)(skb->data +
  744. sizeof(struct unicast_packet));
  745. /* we don't have an updated route for this client, so we should
  746. * not try to reroute the packet!!
  747. */
  748. if (batadv_tt_global_client_is_roaming(bat_priv,
  749. ethhdr->h_dest))
  750. return 1;
  751. orig_node = batadv_transtable_search(bat_priv, NULL,
  752. ethhdr->h_dest);
  753. if (!orig_node) {
  754. if (!batadv_is_my_client(bat_priv, ethhdr->h_dest))
  755. return 0;
  756. primary_if = primary_if_get_selected(bat_priv);
  757. if (!primary_if)
  758. return 0;
  759. memcpy(unicast_packet->dest,
  760. primary_if->net_dev->dev_addr, ETH_ALEN);
  761. hardif_free_ref(primary_if);
  762. } else {
  763. memcpy(unicast_packet->dest, orig_node->orig,
  764. ETH_ALEN);
  765. curr_ttvn = (uint8_t)
  766. atomic_read(&orig_node->last_ttvn);
  767. batadv_orig_node_free_ref(orig_node);
  768. }
  769. bat_dbg(DBG_ROUTES, bat_priv,
  770. "TTVN mismatch (old_ttvn %u new_ttvn %u)! Rerouting unicast packet (for %pM) to %pM\n",
  771. unicast_packet->ttvn, curr_ttvn, ethhdr->h_dest,
  772. unicast_packet->dest);
  773. unicast_packet->ttvn = curr_ttvn;
  774. }
  775. return 1;
  776. }
  777. int batadv_recv_unicast_packet(struct sk_buff *skb, struct hard_iface *recv_if)
  778. {
  779. struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
  780. struct unicast_packet *unicast_packet;
  781. int hdr_size = sizeof(*unicast_packet);
  782. if (check_unicast_packet(skb, hdr_size) < 0)
  783. return NET_RX_DROP;
  784. if (!check_unicast_ttvn(bat_priv, skb))
  785. return NET_RX_DROP;
  786. unicast_packet = (struct unicast_packet *)skb->data;
  787. /* packet for me */
  788. if (is_my_mac(unicast_packet->dest)) {
  789. batadv_interface_rx(recv_if->soft_iface, skb, recv_if,
  790. hdr_size);
  791. return NET_RX_SUCCESS;
  792. }
  793. return route_unicast_packet(skb, recv_if);
  794. }
  795. int batadv_recv_ucast_frag_packet(struct sk_buff *skb,
  796. struct hard_iface *recv_if)
  797. {
  798. struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
  799. struct unicast_frag_packet *unicast_packet;
  800. int hdr_size = sizeof(*unicast_packet);
  801. struct sk_buff *new_skb = NULL;
  802. int ret;
  803. if (check_unicast_packet(skb, hdr_size) < 0)
  804. return NET_RX_DROP;
  805. if (!check_unicast_ttvn(bat_priv, skb))
  806. return NET_RX_DROP;
  807. unicast_packet = (struct unicast_frag_packet *)skb->data;
  808. /* packet for me */
  809. if (is_my_mac(unicast_packet->dest)) {
  810. ret = frag_reassemble_skb(skb, bat_priv, &new_skb);
  811. if (ret == NET_RX_DROP)
  812. return NET_RX_DROP;
  813. /* packet was buffered for late merge */
  814. if (!new_skb)
  815. return NET_RX_SUCCESS;
  816. batadv_interface_rx(recv_if->soft_iface, new_skb, recv_if,
  817. sizeof(struct unicast_packet));
  818. return NET_RX_SUCCESS;
  819. }
  820. return route_unicast_packet(skb, recv_if);
  821. }
  822. int batadv_recv_bcast_packet(struct sk_buff *skb, struct hard_iface *recv_if)
  823. {
  824. struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
  825. struct orig_node *orig_node = NULL;
  826. struct bcast_packet *bcast_packet;
  827. struct ethhdr *ethhdr;
  828. int hdr_size = sizeof(*bcast_packet);
  829. int ret = NET_RX_DROP;
  830. int32_t seq_diff;
  831. /* drop packet if it has not necessary minimum size */
  832. if (unlikely(!pskb_may_pull(skb, hdr_size)))
  833. goto out;
  834. ethhdr = (struct ethhdr *)skb_mac_header(skb);
  835. /* packet with broadcast indication but unicast recipient */
  836. if (!is_broadcast_ether_addr(ethhdr->h_dest))
  837. goto out;
  838. /* packet with broadcast sender address */
  839. if (is_broadcast_ether_addr(ethhdr->h_source))
  840. goto out;
  841. /* ignore broadcasts sent by myself */
  842. if (is_my_mac(ethhdr->h_source))
  843. goto out;
  844. bcast_packet = (struct bcast_packet *)skb->data;
  845. /* ignore broadcasts originated by myself */
  846. if (is_my_mac(bcast_packet->orig))
  847. goto out;
  848. if (bcast_packet->header.ttl < 2)
  849. goto out;
  850. orig_node = orig_hash_find(bat_priv, bcast_packet->orig);
  851. if (!orig_node)
  852. goto out;
  853. spin_lock_bh(&orig_node->bcast_seqno_lock);
  854. /* check whether the packet is a duplicate */
  855. if (bat_test_bit(orig_node->bcast_bits, orig_node->last_bcast_seqno,
  856. ntohl(bcast_packet->seqno)))
  857. goto spin_unlock;
  858. seq_diff = ntohl(bcast_packet->seqno) - orig_node->last_bcast_seqno;
  859. /* check whether the packet is old and the host just restarted. */
  860. if (batadv_window_protected(bat_priv, seq_diff,
  861. &orig_node->bcast_seqno_reset))
  862. goto spin_unlock;
  863. /* mark broadcast in flood history, update window position
  864. * if required. */
  865. if (batadv_bit_get_packet(bat_priv, orig_node->bcast_bits, seq_diff, 1))
  866. orig_node->last_bcast_seqno = ntohl(bcast_packet->seqno);
  867. spin_unlock_bh(&orig_node->bcast_seqno_lock);
  868. /* check whether this has been sent by another originator before */
  869. if (batadv_bla_check_bcast_duplist(bat_priv, bcast_packet, hdr_size))
  870. goto out;
  871. /* rebroadcast packet */
  872. batadv_add_bcast_packet_to_list(bat_priv, skb, 1);
  873. /* don't hand the broadcast up if it is from an originator
  874. * from the same backbone.
  875. */
  876. if (batadv_bla_is_backbone_gw(skb, orig_node, hdr_size))
  877. goto out;
  878. /* broadcast for me */
  879. batadv_interface_rx(recv_if->soft_iface, skb, recv_if, hdr_size);
  880. ret = NET_RX_SUCCESS;
  881. goto out;
  882. spin_unlock:
  883. spin_unlock_bh(&orig_node->bcast_seqno_lock);
  884. out:
  885. if (orig_node)
  886. batadv_orig_node_free_ref(orig_node);
  887. return ret;
  888. }
  889. int batadv_recv_vis_packet(struct sk_buff *skb, struct hard_iface *recv_if)
  890. {
  891. struct vis_packet *vis_packet;
  892. struct ethhdr *ethhdr;
  893. struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
  894. int hdr_size = sizeof(*vis_packet);
  895. /* keep skb linear */
  896. if (skb_linearize(skb) < 0)
  897. return NET_RX_DROP;
  898. if (unlikely(!pskb_may_pull(skb, hdr_size)))
  899. return NET_RX_DROP;
  900. vis_packet = (struct vis_packet *)skb->data;
  901. ethhdr = (struct ethhdr *)skb_mac_header(skb);
  902. /* not for me */
  903. if (!is_my_mac(ethhdr->h_dest))
  904. return NET_RX_DROP;
  905. /* ignore own packets */
  906. if (is_my_mac(vis_packet->vis_orig))
  907. return NET_RX_DROP;
  908. if (is_my_mac(vis_packet->sender_orig))
  909. return NET_RX_DROP;
  910. switch (vis_packet->vis_type) {
  911. case VIS_TYPE_SERVER_SYNC:
  912. receive_server_sync_packet(bat_priv, vis_packet,
  913. skb_headlen(skb));
  914. break;
  915. case VIS_TYPE_CLIENT_UPDATE:
  916. receive_client_update_packet(bat_priv, vis_packet,
  917. skb_headlen(skb));
  918. break;
  919. default: /* ignore unknown packet */
  920. break;
  921. }
  922. /* We take a copy of the data in the packet, so we should
  923. always free the skbuf. */
  924. return NET_RX_DROP;
  925. }