routing.c 30 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167
  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 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. 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 = 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. 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. 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. neigh_node_free_ref(curr_router);
  94. }
  95. void 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 = 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. neigh_node_free_ref(router);
  107. }
  108. /* caller must hold the neigh_list_lock */
  109. void 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. neigh_node_free_ref(neigh_node);
  118. atomic_dec(&orig_node->bond_candidates);
  119. out:
  120. return;
  121. }
  122. void 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 = 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. bonding_candidate_del(orig_node, neigh_node);
  171. out:
  172. spin_unlock_bh(&orig_node->neigh_list_lock);
  173. if (router)
  174. neigh_node_free_ref(router);
  175. }
  176. /* copy primary address for bonding */
  177. void bonding_save_primary(const struct orig_node *orig_node,
  178. struct orig_node *orig_neigh_node,
  179. const struct batman_ogm_packet *batman_ogm_packet)
  180. {
  181. if (!(batman_ogm_packet->flags & PRIMARIES_FIRST_HOP))
  182. return;
  183. memcpy(orig_neigh_node->primary_addr, orig_node->orig, ETH_ALEN);
  184. }
  185. /* checks whether the host restarted and is in the protection time.
  186. * returns:
  187. * 0 if the packet is to be accepted
  188. * 1 if the packet is to be ignored.
  189. */
  190. int window_protected(struct bat_priv *bat_priv, int32_t seq_num_diff,
  191. unsigned long *last_reset)
  192. {
  193. if ((seq_num_diff <= -TQ_LOCAL_WINDOW_SIZE) ||
  194. (seq_num_diff >= EXPECTED_SEQNO_RANGE)) {
  195. if (!has_timed_out(*last_reset, RESET_PROTECTION_MS))
  196. return 1;
  197. *last_reset = jiffies;
  198. bat_dbg(DBG_BATMAN, bat_priv,
  199. "old packet received, start protection\n");
  200. }
  201. return 0;
  202. }
  203. bool check_management_packet(struct sk_buff *skb,
  204. struct hard_iface *hard_iface,
  205. int header_len)
  206. {
  207. struct ethhdr *ethhdr;
  208. /* drop packet if it has not necessary minimum size */
  209. if (unlikely(!pskb_may_pull(skb, header_len)))
  210. return false;
  211. ethhdr = (struct ethhdr *)skb_mac_header(skb);
  212. /* packet with broadcast indication but unicast recipient */
  213. if (!is_broadcast_ether_addr(ethhdr->h_dest))
  214. return false;
  215. /* packet with broadcast sender address */
  216. if (is_broadcast_ether_addr(ethhdr->h_source))
  217. return false;
  218. /* create a copy of the skb, if needed, to modify it. */
  219. if (skb_cow(skb, 0) < 0)
  220. return false;
  221. /* keep skb linear */
  222. if (skb_linearize(skb) < 0)
  223. return false;
  224. return true;
  225. }
  226. static int recv_my_icmp_packet(struct bat_priv *bat_priv,
  227. struct sk_buff *skb, size_t icmp_len)
  228. {
  229. struct hard_iface *primary_if = NULL;
  230. struct orig_node *orig_node = NULL;
  231. struct neigh_node *router = NULL;
  232. struct icmp_packet_rr *icmp_packet;
  233. int ret = NET_RX_DROP;
  234. icmp_packet = (struct icmp_packet_rr *)skb->data;
  235. /* add data to device queue */
  236. if (icmp_packet->msg_type != ECHO_REQUEST) {
  237. bat_socket_receive_packet(icmp_packet, icmp_len);
  238. goto out;
  239. }
  240. primary_if = primary_if_get_selected(bat_priv);
  241. if (!primary_if)
  242. goto out;
  243. /* answer echo request (ping) */
  244. /* get routing information */
  245. orig_node = orig_hash_find(bat_priv, icmp_packet->orig);
  246. if (!orig_node)
  247. goto out;
  248. router = orig_node_get_router(orig_node);
  249. if (!router)
  250. goto out;
  251. /* create a copy of the skb, if needed, to modify it. */
  252. if (skb_cow(skb, ETH_HLEN) < 0)
  253. goto out;
  254. icmp_packet = (struct icmp_packet_rr *)skb->data;
  255. memcpy(icmp_packet->dst, icmp_packet->orig, ETH_ALEN);
  256. memcpy(icmp_packet->orig, primary_if->net_dev->dev_addr, ETH_ALEN);
  257. icmp_packet->msg_type = ECHO_REPLY;
  258. icmp_packet->header.ttl = TTL;
  259. send_skb_packet(skb, router->if_incoming, router->addr);
  260. ret = NET_RX_SUCCESS;
  261. out:
  262. if (primary_if)
  263. hardif_free_ref(primary_if);
  264. if (router)
  265. neigh_node_free_ref(router);
  266. if (orig_node)
  267. orig_node_free_ref(orig_node);
  268. return ret;
  269. }
  270. static int recv_icmp_ttl_exceeded(struct bat_priv *bat_priv,
  271. struct sk_buff *skb)
  272. {
  273. struct hard_iface *primary_if = NULL;
  274. struct orig_node *orig_node = NULL;
  275. struct neigh_node *router = NULL;
  276. struct icmp_packet *icmp_packet;
  277. int ret = NET_RX_DROP;
  278. icmp_packet = (struct icmp_packet *)skb->data;
  279. /* send TTL exceeded if packet is an echo request (traceroute) */
  280. if (icmp_packet->msg_type != ECHO_REQUEST) {
  281. pr_debug("Warning - can't forward icmp packet from %pM to %pM: ttl exceeded\n",
  282. icmp_packet->orig, icmp_packet->dst);
  283. goto out;
  284. }
  285. primary_if = primary_if_get_selected(bat_priv);
  286. if (!primary_if)
  287. goto out;
  288. /* get routing information */
  289. orig_node = orig_hash_find(bat_priv, icmp_packet->orig);
  290. if (!orig_node)
  291. goto out;
  292. router = orig_node_get_router(orig_node);
  293. if (!router)
  294. goto out;
  295. /* create a copy of the skb, if needed, to modify it. */
  296. if (skb_cow(skb, ETH_HLEN) < 0)
  297. goto out;
  298. icmp_packet = (struct icmp_packet *)skb->data;
  299. memcpy(icmp_packet->dst, icmp_packet->orig, ETH_ALEN);
  300. memcpy(icmp_packet->orig, primary_if->net_dev->dev_addr, ETH_ALEN);
  301. icmp_packet->msg_type = TTL_EXCEEDED;
  302. icmp_packet->header.ttl = TTL;
  303. send_skb_packet(skb, router->if_incoming, router->addr);
  304. ret = NET_RX_SUCCESS;
  305. out:
  306. if (primary_if)
  307. hardif_free_ref(primary_if);
  308. if (router)
  309. neigh_node_free_ref(router);
  310. if (orig_node)
  311. orig_node_free_ref(orig_node);
  312. return ret;
  313. }
  314. int recv_icmp_packet(struct sk_buff *skb, struct hard_iface *recv_if)
  315. {
  316. struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
  317. struct icmp_packet_rr *icmp_packet;
  318. struct ethhdr *ethhdr;
  319. struct orig_node *orig_node = NULL;
  320. struct neigh_node *router = NULL;
  321. int hdr_size = sizeof(struct icmp_packet);
  322. int ret = NET_RX_DROP;
  323. /**
  324. * we truncate all incoming icmp packets if they don't match our size
  325. */
  326. if (skb->len >= sizeof(struct icmp_packet_rr))
  327. hdr_size = sizeof(struct icmp_packet_rr);
  328. /* drop packet if it has not necessary minimum size */
  329. if (unlikely(!pskb_may_pull(skb, hdr_size)))
  330. goto out;
  331. ethhdr = (struct ethhdr *)skb_mac_header(skb);
  332. /* packet with unicast indication but broadcast recipient */
  333. if (is_broadcast_ether_addr(ethhdr->h_dest))
  334. goto out;
  335. /* packet with broadcast sender address */
  336. if (is_broadcast_ether_addr(ethhdr->h_source))
  337. goto out;
  338. /* not for me */
  339. if (!is_my_mac(ethhdr->h_dest))
  340. goto out;
  341. icmp_packet = (struct icmp_packet_rr *)skb->data;
  342. /* add record route information if not full */
  343. if ((hdr_size == sizeof(struct icmp_packet_rr)) &&
  344. (icmp_packet->rr_cur < BAT_RR_LEN)) {
  345. memcpy(&(icmp_packet->rr[icmp_packet->rr_cur]),
  346. ethhdr->h_dest, ETH_ALEN);
  347. icmp_packet->rr_cur++;
  348. }
  349. /* packet for me */
  350. if (is_my_mac(icmp_packet->dst))
  351. return recv_my_icmp_packet(bat_priv, skb, hdr_size);
  352. /* TTL exceeded */
  353. if (icmp_packet->header.ttl < 2)
  354. return recv_icmp_ttl_exceeded(bat_priv, skb);
  355. /* get routing information */
  356. orig_node = orig_hash_find(bat_priv, icmp_packet->dst);
  357. if (!orig_node)
  358. goto out;
  359. router = orig_node_get_router(orig_node);
  360. if (!router)
  361. goto out;
  362. /* create a copy of the skb, if needed, to modify it. */
  363. if (skb_cow(skb, ETH_HLEN) < 0)
  364. goto out;
  365. icmp_packet = (struct icmp_packet_rr *)skb->data;
  366. /* decrement ttl */
  367. icmp_packet->header.ttl--;
  368. /* route it */
  369. send_skb_packet(skb, router->if_incoming, router->addr);
  370. ret = NET_RX_SUCCESS;
  371. out:
  372. if (router)
  373. neigh_node_free_ref(router);
  374. if (orig_node)
  375. orig_node_free_ref(orig_node);
  376. return ret;
  377. }
  378. /* In the bonding case, send the packets in a round
  379. * robin fashion over the remaining interfaces.
  380. *
  381. * This method rotates the bonding list and increases the
  382. * returned router's refcount. */
  383. static struct neigh_node *find_bond_router(struct orig_node *primary_orig,
  384. const struct hard_iface *recv_if)
  385. {
  386. struct neigh_node *tmp_neigh_node;
  387. struct neigh_node *router = NULL, *first_candidate = NULL;
  388. rcu_read_lock();
  389. list_for_each_entry_rcu(tmp_neigh_node, &primary_orig->bond_list,
  390. bonding_list) {
  391. if (!first_candidate)
  392. first_candidate = tmp_neigh_node;
  393. /* recv_if == NULL on the first node. */
  394. if (tmp_neigh_node->if_incoming == recv_if)
  395. continue;
  396. if (!atomic_inc_not_zero(&tmp_neigh_node->refcount))
  397. continue;
  398. router = tmp_neigh_node;
  399. break;
  400. }
  401. /* use the first candidate if nothing was found. */
  402. if (!router && first_candidate &&
  403. atomic_inc_not_zero(&first_candidate->refcount))
  404. router = first_candidate;
  405. if (!router)
  406. goto out;
  407. /* selected should point to the next element
  408. * after the current router */
  409. spin_lock_bh(&primary_orig->neigh_list_lock);
  410. /* this is a list_move(), which unfortunately
  411. * does not exist as rcu version */
  412. list_del_rcu(&primary_orig->bond_list);
  413. list_add_rcu(&primary_orig->bond_list,
  414. &router->bonding_list);
  415. spin_unlock_bh(&primary_orig->neigh_list_lock);
  416. out:
  417. rcu_read_unlock();
  418. return router;
  419. }
  420. /* Interface Alternating: Use the best of the
  421. * remaining candidates which are not using
  422. * this interface.
  423. *
  424. * Increases the returned router's refcount */
  425. static struct neigh_node *find_ifalter_router(struct orig_node *primary_orig,
  426. const struct hard_iface *recv_if)
  427. {
  428. struct neigh_node *tmp_neigh_node;
  429. struct neigh_node *router = NULL, *first_candidate = NULL;
  430. rcu_read_lock();
  431. list_for_each_entry_rcu(tmp_neigh_node, &primary_orig->bond_list,
  432. bonding_list) {
  433. if (!first_candidate)
  434. first_candidate = tmp_neigh_node;
  435. /* recv_if == NULL on the first node. */
  436. if (tmp_neigh_node->if_incoming == recv_if)
  437. continue;
  438. if (!atomic_inc_not_zero(&tmp_neigh_node->refcount))
  439. continue;
  440. /* if we don't have a router yet
  441. * or this one is better, choose it. */
  442. if ((!router) ||
  443. (tmp_neigh_node->tq_avg > router->tq_avg)) {
  444. /* decrement refcount of
  445. * previously selected router */
  446. if (router)
  447. neigh_node_free_ref(router);
  448. router = tmp_neigh_node;
  449. atomic_inc_not_zero(&router->refcount);
  450. }
  451. neigh_node_free_ref(tmp_neigh_node);
  452. }
  453. /* use the first candidate if nothing was found. */
  454. if (!router && first_candidate &&
  455. atomic_inc_not_zero(&first_candidate->refcount))
  456. router = first_candidate;
  457. rcu_read_unlock();
  458. return router;
  459. }
  460. int recv_tt_query(struct sk_buff *skb, struct hard_iface *recv_if)
  461. {
  462. struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
  463. struct tt_query_packet *tt_query;
  464. uint16_t tt_len;
  465. struct ethhdr *ethhdr;
  466. /* drop packet if it has not necessary minimum size */
  467. if (unlikely(!pskb_may_pull(skb, sizeof(struct tt_query_packet))))
  468. goto out;
  469. /* I could need to modify it */
  470. if (skb_cow(skb, sizeof(struct tt_query_packet)) < 0)
  471. goto out;
  472. ethhdr = (struct ethhdr *)skb_mac_header(skb);
  473. /* packet with unicast indication but broadcast recipient */
  474. if (is_broadcast_ether_addr(ethhdr->h_dest))
  475. goto out;
  476. /* packet with broadcast sender address */
  477. if (is_broadcast_ether_addr(ethhdr->h_source))
  478. goto out;
  479. tt_query = (struct tt_query_packet *)skb->data;
  480. tt_query->tt_data = ntohs(tt_query->tt_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 (!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. tt_query->tt_data = htons(tt_query->tt_data);
  492. return route_unicast_packet(skb, recv_if);
  493. }
  494. break;
  495. case TT_RESPONSE:
  496. batadv_inc_counter(bat_priv, BAT_CNT_TT_RESPONSE_RX);
  497. if (is_my_mac(tt_query->dst)) {
  498. /* packet needs to be linearized to access the TT
  499. * changes */
  500. if (skb_linearize(skb) < 0)
  501. goto out;
  502. /* skb_linearize() possibly changed skb->data */
  503. tt_query = (struct tt_query_packet *)skb->data;
  504. tt_len = tt_query->tt_data * sizeof(struct tt_change);
  505. /* Ensure we have all the claimed data */
  506. if (unlikely(skb_headlen(skb) <
  507. sizeof(struct tt_query_packet) + tt_len))
  508. goto out;
  509. handle_tt_response(bat_priv, tt_query);
  510. } else {
  511. bat_dbg(DBG_TT, bat_priv,
  512. "Routing TT_RESPONSE to %pM [%c]\n",
  513. tt_query->dst,
  514. (tt_query->flags & TT_FULL_TABLE ? 'F' : '.'));
  515. tt_query->tt_data = htons(tt_query->tt_data);
  516. return route_unicast_packet(skb, recv_if);
  517. }
  518. break;
  519. }
  520. out:
  521. /* returning NET_RX_DROP will make the caller function kfree the skb */
  522. return NET_RX_DROP;
  523. }
  524. int recv_roam_adv(struct sk_buff *skb, struct hard_iface *recv_if)
  525. {
  526. struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
  527. struct roam_adv_packet *roam_adv_packet;
  528. struct orig_node *orig_node;
  529. struct ethhdr *ethhdr;
  530. /* drop packet if it has not necessary minimum size */
  531. if (unlikely(!pskb_may_pull(skb, sizeof(struct roam_adv_packet))))
  532. goto out;
  533. ethhdr = (struct ethhdr *)skb_mac_header(skb);
  534. /* packet with unicast indication but broadcast recipient */
  535. if (is_broadcast_ether_addr(ethhdr->h_dest))
  536. goto out;
  537. /* packet with broadcast sender address */
  538. if (is_broadcast_ether_addr(ethhdr->h_source))
  539. goto out;
  540. batadv_inc_counter(bat_priv, BAT_CNT_TT_ROAM_ADV_RX);
  541. roam_adv_packet = (struct roam_adv_packet *)skb->data;
  542. if (!is_my_mac(roam_adv_packet->dst))
  543. return route_unicast_packet(skb, recv_if);
  544. /* check if it is a backbone gateway. we don't accept
  545. * roaming advertisement from it, as it has the same
  546. * entries as we have.
  547. */
  548. if (bla_is_backbone_gw_orig(bat_priv, roam_adv_packet->src))
  549. goto out;
  550. orig_node = orig_hash_find(bat_priv, roam_adv_packet->src);
  551. if (!orig_node)
  552. goto out;
  553. bat_dbg(DBG_TT, bat_priv,
  554. "Received ROAMING_ADV from %pM (client %pM)\n",
  555. roam_adv_packet->src, roam_adv_packet->client);
  556. tt_global_add(bat_priv, orig_node, roam_adv_packet->client,
  557. atomic_read(&orig_node->last_ttvn) + 1, true, false);
  558. /* Roaming phase starts: I have new information but the ttvn has not
  559. * been incremented yet. This flag will make me check all the incoming
  560. * packets for the correct destination. */
  561. bat_priv->tt_poss_change = true;
  562. orig_node_free_ref(orig_node);
  563. out:
  564. /* returning NET_RX_DROP will make the caller function kfree the skb */
  565. return NET_RX_DROP;
  566. }
  567. /* find a suitable router for this originator, and use
  568. * bonding if possible. increases the found neighbors
  569. * refcount.*/
  570. struct neigh_node *find_router(struct bat_priv *bat_priv,
  571. struct orig_node *orig_node,
  572. const struct hard_iface *recv_if)
  573. {
  574. struct orig_node *primary_orig_node;
  575. struct orig_node *router_orig;
  576. struct neigh_node *router;
  577. static uint8_t zero_mac[ETH_ALEN] = {0, 0, 0, 0, 0, 0};
  578. int bonding_enabled;
  579. if (!orig_node)
  580. return NULL;
  581. router = orig_node_get_router(orig_node);
  582. if (!router)
  583. goto err;
  584. /* without bonding, the first node should
  585. * always choose the default router. */
  586. bonding_enabled = atomic_read(&bat_priv->bonding);
  587. rcu_read_lock();
  588. /* select default router to output */
  589. router_orig = router->orig_node;
  590. if (!router_orig)
  591. goto err_unlock;
  592. if ((!recv_if) && (!bonding_enabled))
  593. goto return_router;
  594. /* if we have something in the primary_addr, we can search
  595. * for a potential bonding candidate. */
  596. if (compare_eth(router_orig->primary_addr, zero_mac))
  597. goto return_router;
  598. /* find the orig_node which has the primary interface. might
  599. * even be the same as our router_orig in many cases */
  600. if (compare_eth(router_orig->primary_addr, router_orig->orig)) {
  601. primary_orig_node = router_orig;
  602. } else {
  603. primary_orig_node = orig_hash_find(bat_priv,
  604. router_orig->primary_addr);
  605. if (!primary_orig_node)
  606. goto return_router;
  607. orig_node_free_ref(primary_orig_node);
  608. }
  609. /* with less than 2 candidates, we can't do any
  610. * bonding and prefer the original router. */
  611. if (atomic_read(&primary_orig_node->bond_candidates) < 2)
  612. goto return_router;
  613. /* all nodes between should choose a candidate which
  614. * is is not on the interface where the packet came
  615. * in. */
  616. neigh_node_free_ref(router);
  617. if (bonding_enabled)
  618. router = find_bond_router(primary_orig_node, recv_if);
  619. else
  620. router = find_ifalter_router(primary_orig_node, recv_if);
  621. return_router:
  622. if (router && router->if_incoming->if_status != IF_ACTIVE)
  623. goto err_unlock;
  624. rcu_read_unlock();
  625. return router;
  626. err_unlock:
  627. rcu_read_unlock();
  628. err:
  629. if (router)
  630. neigh_node_free_ref(router);
  631. return NULL;
  632. }
  633. static int check_unicast_packet(struct sk_buff *skb, int hdr_size)
  634. {
  635. struct ethhdr *ethhdr;
  636. /* drop packet if it has not necessary minimum size */
  637. if (unlikely(!pskb_may_pull(skb, hdr_size)))
  638. return -1;
  639. ethhdr = (struct ethhdr *)skb_mac_header(skb);
  640. /* packet with unicast indication but broadcast recipient */
  641. if (is_broadcast_ether_addr(ethhdr->h_dest))
  642. return -1;
  643. /* packet with broadcast sender address */
  644. if (is_broadcast_ether_addr(ethhdr->h_source))
  645. return -1;
  646. /* not for me */
  647. if (!is_my_mac(ethhdr->h_dest))
  648. return -1;
  649. return 0;
  650. }
  651. static int route_unicast_packet(struct sk_buff *skb, struct hard_iface *recv_if)
  652. {
  653. struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
  654. struct orig_node *orig_node = NULL;
  655. struct neigh_node *neigh_node = NULL;
  656. struct unicast_packet *unicast_packet;
  657. struct ethhdr *ethhdr = (struct ethhdr *)skb_mac_header(skb);
  658. int ret = NET_RX_DROP;
  659. struct sk_buff *new_skb;
  660. unicast_packet = (struct unicast_packet *)skb->data;
  661. /* TTL exceeded */
  662. if (unicast_packet->header.ttl < 2) {
  663. pr_debug("Warning - can't forward unicast packet from %pM to %pM: ttl exceeded\n",
  664. ethhdr->h_source, unicast_packet->dest);
  665. goto out;
  666. }
  667. /* get routing information */
  668. orig_node = orig_hash_find(bat_priv, unicast_packet->dest);
  669. if (!orig_node)
  670. goto out;
  671. /* find_router() increases neigh_nodes refcount if found. */
  672. neigh_node = find_router(bat_priv, orig_node, recv_if);
  673. if (!neigh_node)
  674. goto out;
  675. /* create a copy of the skb, if needed, to modify it. */
  676. if (skb_cow(skb, ETH_HLEN) < 0)
  677. goto out;
  678. unicast_packet = (struct unicast_packet *)skb->data;
  679. if (unicast_packet->header.packet_type == BAT_UNICAST &&
  680. atomic_read(&bat_priv->fragmentation) &&
  681. skb->len > neigh_node->if_incoming->net_dev->mtu) {
  682. ret = frag_send_skb(skb, bat_priv,
  683. neigh_node->if_incoming, neigh_node->addr);
  684. goto out;
  685. }
  686. if (unicast_packet->header.packet_type == BAT_UNICAST_FRAG &&
  687. frag_can_reassemble(skb, neigh_node->if_incoming->net_dev->mtu)) {
  688. ret = frag_reassemble_skb(skb, bat_priv, &new_skb);
  689. if (ret == NET_RX_DROP)
  690. goto out;
  691. /* packet was buffered for late merge */
  692. if (!new_skb) {
  693. ret = NET_RX_SUCCESS;
  694. goto out;
  695. }
  696. skb = new_skb;
  697. unicast_packet = (struct unicast_packet *)skb->data;
  698. }
  699. /* decrement ttl */
  700. unicast_packet->header.ttl--;
  701. /* Update stats counter */
  702. batadv_inc_counter(bat_priv, BAT_CNT_FORWARD);
  703. batadv_add_counter(bat_priv, BAT_CNT_FORWARD_BYTES,
  704. skb->len + ETH_HLEN);
  705. /* route it */
  706. send_skb_packet(skb, neigh_node->if_incoming, neigh_node->addr);
  707. ret = NET_RX_SUCCESS;
  708. out:
  709. if (neigh_node)
  710. neigh_node_free_ref(neigh_node);
  711. if (orig_node)
  712. orig_node_free_ref(orig_node);
  713. return ret;
  714. }
  715. static int check_unicast_ttvn(struct bat_priv *bat_priv,
  716. struct sk_buff *skb) {
  717. uint8_t curr_ttvn;
  718. struct orig_node *orig_node;
  719. struct ethhdr *ethhdr;
  720. struct hard_iface *primary_if;
  721. struct unicast_packet *unicast_packet;
  722. bool tt_poss_change;
  723. /* I could need to modify it */
  724. if (skb_cow(skb, sizeof(struct unicast_packet)) < 0)
  725. return 0;
  726. unicast_packet = (struct unicast_packet *)skb->data;
  727. if (is_my_mac(unicast_packet->dest)) {
  728. tt_poss_change = bat_priv->tt_poss_change;
  729. curr_ttvn = (uint8_t)atomic_read(&bat_priv->ttvn);
  730. } else {
  731. orig_node = orig_hash_find(bat_priv, unicast_packet->dest);
  732. if (!orig_node)
  733. return 0;
  734. curr_ttvn = (uint8_t)atomic_read(&orig_node->last_ttvn);
  735. tt_poss_change = orig_node->tt_poss_change;
  736. orig_node_free_ref(orig_node);
  737. }
  738. /* Check whether I have to reroute the packet */
  739. if (seq_before(unicast_packet->ttvn, curr_ttvn) || tt_poss_change) {
  740. /* check if there is enough data before accessing it */
  741. if (pskb_may_pull(skb, sizeof(struct unicast_packet) +
  742. ETH_HLEN) < 0)
  743. return 0;
  744. ethhdr = (struct ethhdr *)(skb->data +
  745. sizeof(struct unicast_packet));
  746. /* we don't have an updated route for this client, so we should
  747. * not try to reroute the packet!!
  748. */
  749. if (tt_global_client_is_roaming(bat_priv, ethhdr->h_dest))
  750. return 1;
  751. orig_node = transtable_search(bat_priv, NULL, ethhdr->h_dest);
  752. if (!orig_node) {
  753. if (!is_my_client(bat_priv, ethhdr->h_dest))
  754. return 0;
  755. primary_if = primary_if_get_selected(bat_priv);
  756. if (!primary_if)
  757. return 0;
  758. memcpy(unicast_packet->dest,
  759. primary_if->net_dev->dev_addr, ETH_ALEN);
  760. hardif_free_ref(primary_if);
  761. } else {
  762. memcpy(unicast_packet->dest, orig_node->orig,
  763. ETH_ALEN);
  764. curr_ttvn = (uint8_t)
  765. atomic_read(&orig_node->last_ttvn);
  766. orig_node_free_ref(orig_node);
  767. }
  768. bat_dbg(DBG_ROUTES, bat_priv,
  769. "TTVN mismatch (old_ttvn %u new_ttvn %u)! Rerouting unicast packet (for %pM) to %pM\n",
  770. unicast_packet->ttvn, curr_ttvn, ethhdr->h_dest,
  771. unicast_packet->dest);
  772. unicast_packet->ttvn = curr_ttvn;
  773. }
  774. return 1;
  775. }
  776. int recv_unicast_packet(struct sk_buff *skb, struct hard_iface *recv_if)
  777. {
  778. struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
  779. struct unicast_packet *unicast_packet;
  780. int hdr_size = sizeof(*unicast_packet);
  781. if (check_unicast_packet(skb, hdr_size) < 0)
  782. return NET_RX_DROP;
  783. if (!check_unicast_ttvn(bat_priv, skb))
  784. return NET_RX_DROP;
  785. unicast_packet = (struct unicast_packet *)skb->data;
  786. /* packet for me */
  787. if (is_my_mac(unicast_packet->dest)) {
  788. interface_rx(recv_if->soft_iface, skb, recv_if, hdr_size);
  789. return NET_RX_SUCCESS;
  790. }
  791. return route_unicast_packet(skb, recv_if);
  792. }
  793. int recv_ucast_frag_packet(struct sk_buff *skb, struct hard_iface *recv_if)
  794. {
  795. struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
  796. struct unicast_frag_packet *unicast_packet;
  797. int hdr_size = sizeof(*unicast_packet);
  798. struct sk_buff *new_skb = NULL;
  799. int ret;
  800. if (check_unicast_packet(skb, hdr_size) < 0)
  801. return NET_RX_DROP;
  802. if (!check_unicast_ttvn(bat_priv, skb))
  803. return NET_RX_DROP;
  804. unicast_packet = (struct unicast_frag_packet *)skb->data;
  805. /* packet for me */
  806. if (is_my_mac(unicast_packet->dest)) {
  807. ret = frag_reassemble_skb(skb, bat_priv, &new_skb);
  808. if (ret == NET_RX_DROP)
  809. return NET_RX_DROP;
  810. /* packet was buffered for late merge */
  811. if (!new_skb)
  812. return NET_RX_SUCCESS;
  813. interface_rx(recv_if->soft_iface, new_skb, recv_if,
  814. sizeof(struct unicast_packet));
  815. return NET_RX_SUCCESS;
  816. }
  817. return route_unicast_packet(skb, recv_if);
  818. }
  819. int recv_bcast_packet(struct sk_buff *skb, struct hard_iface *recv_if)
  820. {
  821. struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
  822. struct orig_node *orig_node = NULL;
  823. struct bcast_packet *bcast_packet;
  824. struct ethhdr *ethhdr;
  825. int hdr_size = sizeof(*bcast_packet);
  826. int ret = NET_RX_DROP;
  827. int32_t seq_diff;
  828. /* drop packet if it has not necessary minimum size */
  829. if (unlikely(!pskb_may_pull(skb, hdr_size)))
  830. goto out;
  831. ethhdr = (struct ethhdr *)skb_mac_header(skb);
  832. /* packet with broadcast indication but unicast recipient */
  833. if (!is_broadcast_ether_addr(ethhdr->h_dest))
  834. goto out;
  835. /* packet with broadcast sender address */
  836. if (is_broadcast_ether_addr(ethhdr->h_source))
  837. goto out;
  838. /* ignore broadcasts sent by myself */
  839. if (is_my_mac(ethhdr->h_source))
  840. goto out;
  841. bcast_packet = (struct bcast_packet *)skb->data;
  842. /* ignore broadcasts originated by myself */
  843. if (is_my_mac(bcast_packet->orig))
  844. goto out;
  845. if (bcast_packet->header.ttl < 2)
  846. goto out;
  847. orig_node = orig_hash_find(bat_priv, bcast_packet->orig);
  848. if (!orig_node)
  849. goto out;
  850. spin_lock_bh(&orig_node->bcast_seqno_lock);
  851. /* check whether the packet is a duplicate */
  852. if (bat_test_bit(orig_node->bcast_bits, orig_node->last_bcast_seqno,
  853. ntohl(bcast_packet->seqno)))
  854. goto spin_unlock;
  855. seq_diff = ntohl(bcast_packet->seqno) - orig_node->last_bcast_seqno;
  856. /* check whether the packet is old and the host just restarted. */
  857. if (window_protected(bat_priv, seq_diff,
  858. &orig_node->bcast_seqno_reset))
  859. goto spin_unlock;
  860. /* mark broadcast in flood history, update window position
  861. * if required. */
  862. if (bit_get_packet(bat_priv, orig_node->bcast_bits, seq_diff, 1))
  863. orig_node->last_bcast_seqno = ntohl(bcast_packet->seqno);
  864. spin_unlock_bh(&orig_node->bcast_seqno_lock);
  865. /* check whether this has been sent by another originator before */
  866. if (bla_check_bcast_duplist(bat_priv, bcast_packet, hdr_size))
  867. goto out;
  868. /* rebroadcast packet */
  869. add_bcast_packet_to_list(bat_priv, skb, 1);
  870. /* don't hand the broadcast up if it is from an originator
  871. * from the same backbone.
  872. */
  873. if (bla_is_backbone_gw(skb, orig_node, hdr_size))
  874. goto out;
  875. /* broadcast for me */
  876. interface_rx(recv_if->soft_iface, skb, recv_if, hdr_size);
  877. ret = NET_RX_SUCCESS;
  878. goto out;
  879. spin_unlock:
  880. spin_unlock_bh(&orig_node->bcast_seqno_lock);
  881. out:
  882. if (orig_node)
  883. orig_node_free_ref(orig_node);
  884. return ret;
  885. }
  886. int recv_vis_packet(struct sk_buff *skb, struct hard_iface *recv_if)
  887. {
  888. struct vis_packet *vis_packet;
  889. struct ethhdr *ethhdr;
  890. struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
  891. int hdr_size = sizeof(*vis_packet);
  892. /* keep skb linear */
  893. if (skb_linearize(skb) < 0)
  894. return NET_RX_DROP;
  895. if (unlikely(!pskb_may_pull(skb, hdr_size)))
  896. return NET_RX_DROP;
  897. vis_packet = (struct vis_packet *)skb->data;
  898. ethhdr = (struct ethhdr *)skb_mac_header(skb);
  899. /* not for me */
  900. if (!is_my_mac(ethhdr->h_dest))
  901. return NET_RX_DROP;
  902. /* ignore own packets */
  903. if (is_my_mac(vis_packet->vis_orig))
  904. return NET_RX_DROP;
  905. if (is_my_mac(vis_packet->sender_orig))
  906. return NET_RX_DROP;
  907. switch (vis_packet->vis_type) {
  908. case VIS_TYPE_SERVER_SYNC:
  909. receive_server_sync_packet(bat_priv, vis_packet,
  910. skb_headlen(skb));
  911. break;
  912. case VIS_TYPE_CLIENT_UPDATE:
  913. receive_client_update_packet(bat_priv, vis_packet,
  914. skb_headlen(skb));
  915. break;
  916. default: /* ignore unknown packet */
  917. break;
  918. }
  919. /* We take a copy of the data in the packet, so we should
  920. always free the skbuf. */
  921. return NET_RX_DROP;
  922. }