bat_iv_ogm.c 37 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264
  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 "translation-table.h"
  23. #include "ring_buffer.h"
  24. #include "originator.h"
  25. #include "routing.h"
  26. #include "gateway_common.h"
  27. #include "gateway_client.h"
  28. #include "hard-interface.h"
  29. #include "send.h"
  30. #include "bat_algo.h"
  31. static struct neigh_node *bat_iv_ogm_neigh_new(struct hard_iface *hard_iface,
  32. const uint8_t *neigh_addr,
  33. struct orig_node *orig_node,
  34. struct orig_node *orig_neigh,
  35. uint32_t seqno)
  36. {
  37. struct neigh_node *neigh_node;
  38. neigh_node = batadv_neigh_node_new(hard_iface, neigh_addr, seqno);
  39. if (!neigh_node)
  40. goto out;
  41. INIT_LIST_HEAD(&neigh_node->bonding_list);
  42. spin_lock_init(&neigh_node->tq_lock);
  43. neigh_node->orig_node = orig_neigh;
  44. neigh_node->if_incoming = hard_iface;
  45. spin_lock_bh(&orig_node->neigh_list_lock);
  46. hlist_add_head_rcu(&neigh_node->list, &orig_node->neigh_list);
  47. spin_unlock_bh(&orig_node->neigh_list_lock);
  48. out:
  49. return neigh_node;
  50. }
  51. static int bat_iv_ogm_iface_enable(struct hard_iface *hard_iface)
  52. {
  53. struct batman_ogm_packet *batman_ogm_packet;
  54. uint32_t random_seqno;
  55. int res = -1;
  56. /* randomize initial seqno to avoid collision */
  57. get_random_bytes(&random_seqno, sizeof(random_seqno));
  58. atomic_set(&hard_iface->seqno, random_seqno);
  59. hard_iface->packet_len = BATMAN_OGM_HLEN;
  60. hard_iface->packet_buff = kmalloc(hard_iface->packet_len, GFP_ATOMIC);
  61. if (!hard_iface->packet_buff)
  62. goto out;
  63. batman_ogm_packet = (struct batman_ogm_packet *)hard_iface->packet_buff;
  64. batman_ogm_packet->header.packet_type = BAT_IV_OGM;
  65. batman_ogm_packet->header.version = COMPAT_VERSION;
  66. batman_ogm_packet->header.ttl = 2;
  67. batman_ogm_packet->flags = NO_FLAGS;
  68. batman_ogm_packet->tq = TQ_MAX_VALUE;
  69. batman_ogm_packet->tt_num_changes = 0;
  70. batman_ogm_packet->ttvn = 0;
  71. res = 0;
  72. out:
  73. return res;
  74. }
  75. static void bat_iv_ogm_iface_disable(struct hard_iface *hard_iface)
  76. {
  77. kfree(hard_iface->packet_buff);
  78. hard_iface->packet_buff = NULL;
  79. }
  80. static void bat_iv_ogm_primary_iface_set(struct hard_iface *hard_iface)
  81. {
  82. struct batman_ogm_packet *batman_ogm_packet;
  83. batman_ogm_packet = (struct batman_ogm_packet *)hard_iface->packet_buff;
  84. batman_ogm_packet->flags = PRIMARIES_FIRST_HOP;
  85. batman_ogm_packet->header.ttl = TTL;
  86. }
  87. static void bat_iv_ogm_update_mac(struct hard_iface *hard_iface)
  88. {
  89. struct batman_ogm_packet *batman_ogm_packet;
  90. batman_ogm_packet = (struct batman_ogm_packet *)hard_iface->packet_buff;
  91. memcpy(batman_ogm_packet->orig,
  92. hard_iface->net_dev->dev_addr, ETH_ALEN);
  93. memcpy(batman_ogm_packet->prev_sender,
  94. hard_iface->net_dev->dev_addr, ETH_ALEN);
  95. }
  96. /* when do we schedule our own ogm to be sent */
  97. static unsigned long bat_iv_ogm_emit_send_time(const struct bat_priv *bat_priv)
  98. {
  99. return jiffies + msecs_to_jiffies(
  100. atomic_read(&bat_priv->orig_interval) -
  101. JITTER + (random32() % 2*JITTER));
  102. }
  103. /* when do we schedule a ogm packet to be sent */
  104. static unsigned long bat_iv_ogm_fwd_send_time(void)
  105. {
  106. return jiffies + msecs_to_jiffies(random32() % (JITTER/2));
  107. }
  108. /* apply hop penalty for a normal link */
  109. static uint8_t hop_penalty(uint8_t tq, const struct bat_priv *bat_priv)
  110. {
  111. int hop_penalty = atomic_read(&bat_priv->hop_penalty);
  112. return (tq * (TQ_MAX_VALUE - hop_penalty)) / (TQ_MAX_VALUE);
  113. }
  114. /* is there another aggregated packet here? */
  115. static int bat_iv_ogm_aggr_packet(int buff_pos, int packet_len,
  116. int tt_num_changes)
  117. {
  118. int next_buff_pos = buff_pos + BATMAN_OGM_HLEN + tt_len(tt_num_changes);
  119. return (next_buff_pos <= packet_len) &&
  120. (next_buff_pos <= MAX_AGGREGATION_BYTES);
  121. }
  122. /* send a batman ogm to a given interface */
  123. static void bat_iv_ogm_send_to_if(struct forw_packet *forw_packet,
  124. struct hard_iface *hard_iface)
  125. {
  126. struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
  127. char *fwd_str;
  128. uint8_t packet_num;
  129. int16_t buff_pos;
  130. struct batman_ogm_packet *batman_ogm_packet;
  131. struct sk_buff *skb;
  132. if (hard_iface->if_status != IF_ACTIVE)
  133. return;
  134. packet_num = 0;
  135. buff_pos = 0;
  136. batman_ogm_packet = (struct batman_ogm_packet *)forw_packet->skb->data;
  137. /* adjust all flags and log packets */
  138. while (bat_iv_ogm_aggr_packet(buff_pos, forw_packet->packet_len,
  139. batman_ogm_packet->tt_num_changes)) {
  140. /* we might have aggregated direct link packets with an
  141. * ordinary base packet */
  142. if ((forw_packet->direct_link_flags & (1 << packet_num)) &&
  143. (forw_packet->if_incoming == hard_iface))
  144. batman_ogm_packet->flags |= DIRECTLINK;
  145. else
  146. batman_ogm_packet->flags &= ~DIRECTLINK;
  147. fwd_str = (packet_num > 0 ? "Forwarding" : (forw_packet->own ?
  148. "Sending own" :
  149. "Forwarding"));
  150. bat_dbg(DBG_BATMAN, bat_priv,
  151. "%s %spacket (originator %pM, seqno %u, TQ %d, TTL %d, IDF %s, ttvn %d) on interface %s [%pM]\n",
  152. fwd_str, (packet_num > 0 ? "aggregated " : ""),
  153. batman_ogm_packet->orig,
  154. ntohl(batman_ogm_packet->seqno),
  155. batman_ogm_packet->tq, batman_ogm_packet->header.ttl,
  156. (batman_ogm_packet->flags & DIRECTLINK ?
  157. "on" : "off"),
  158. batman_ogm_packet->ttvn, hard_iface->net_dev->name,
  159. hard_iface->net_dev->dev_addr);
  160. buff_pos += BATMAN_OGM_HLEN +
  161. tt_len(batman_ogm_packet->tt_num_changes);
  162. packet_num++;
  163. batman_ogm_packet = (struct batman_ogm_packet *)
  164. (forw_packet->skb->data + buff_pos);
  165. }
  166. /* create clone because function is called more than once */
  167. skb = skb_clone(forw_packet->skb, GFP_ATOMIC);
  168. if (skb)
  169. send_skb_packet(skb, hard_iface, broadcast_addr);
  170. }
  171. /* send a batman ogm packet */
  172. static void bat_iv_ogm_emit(struct forw_packet *forw_packet)
  173. {
  174. struct hard_iface *hard_iface;
  175. struct net_device *soft_iface;
  176. struct bat_priv *bat_priv;
  177. struct hard_iface *primary_if = NULL;
  178. struct batman_ogm_packet *batman_ogm_packet;
  179. unsigned char directlink;
  180. batman_ogm_packet = (struct batman_ogm_packet *)
  181. (forw_packet->skb->data);
  182. directlink = (batman_ogm_packet->flags & DIRECTLINK ? 1 : 0);
  183. if (!forw_packet->if_incoming) {
  184. pr_err("Error - can't forward packet: incoming iface not specified\n");
  185. goto out;
  186. }
  187. soft_iface = forw_packet->if_incoming->soft_iface;
  188. bat_priv = netdev_priv(soft_iface);
  189. if (forw_packet->if_incoming->if_status != IF_ACTIVE)
  190. goto out;
  191. primary_if = primary_if_get_selected(bat_priv);
  192. if (!primary_if)
  193. goto out;
  194. /* multihomed peer assumed */
  195. /* non-primary OGMs are only broadcasted on their interface */
  196. if ((directlink && (batman_ogm_packet->header.ttl == 1)) ||
  197. (forw_packet->own && (forw_packet->if_incoming != primary_if))) {
  198. /* FIXME: what about aggregated packets ? */
  199. bat_dbg(DBG_BATMAN, bat_priv,
  200. "%s packet (originator %pM, seqno %u, TTL %d) on interface %s [%pM]\n",
  201. (forw_packet->own ? "Sending own" : "Forwarding"),
  202. batman_ogm_packet->orig,
  203. ntohl(batman_ogm_packet->seqno),
  204. batman_ogm_packet->header.ttl,
  205. forw_packet->if_incoming->net_dev->name,
  206. forw_packet->if_incoming->net_dev->dev_addr);
  207. /* skb is only used once and than forw_packet is free'd */
  208. send_skb_packet(forw_packet->skb, forw_packet->if_incoming,
  209. broadcast_addr);
  210. forw_packet->skb = NULL;
  211. goto out;
  212. }
  213. /* broadcast on every interface */
  214. rcu_read_lock();
  215. list_for_each_entry_rcu(hard_iface, &hardif_list, list) {
  216. if (hard_iface->soft_iface != soft_iface)
  217. continue;
  218. bat_iv_ogm_send_to_if(forw_packet, hard_iface);
  219. }
  220. rcu_read_unlock();
  221. out:
  222. if (primary_if)
  223. hardif_free_ref(primary_if);
  224. }
  225. /* return true if new_packet can be aggregated with forw_packet */
  226. static bool bat_iv_ogm_can_aggregate(const struct batman_ogm_packet
  227. *new_batman_ogm_packet,
  228. struct bat_priv *bat_priv,
  229. int packet_len, unsigned long send_time,
  230. bool directlink,
  231. const struct hard_iface *if_incoming,
  232. const struct forw_packet *forw_packet)
  233. {
  234. struct batman_ogm_packet *batman_ogm_packet;
  235. int aggregated_bytes = forw_packet->packet_len + packet_len;
  236. struct hard_iface *primary_if = NULL;
  237. bool res = false;
  238. batman_ogm_packet = (struct batman_ogm_packet *)forw_packet->skb->data;
  239. /**
  240. * we can aggregate the current packet to this aggregated packet
  241. * if:
  242. *
  243. * - the send time is within our MAX_AGGREGATION_MS time
  244. * - the resulting packet wont be bigger than
  245. * MAX_AGGREGATION_BYTES
  246. */
  247. if (time_before(send_time, forw_packet->send_time) &&
  248. time_after_eq(send_time + msecs_to_jiffies(MAX_AGGREGATION_MS),
  249. forw_packet->send_time) &&
  250. (aggregated_bytes <= MAX_AGGREGATION_BYTES)) {
  251. /**
  252. * check aggregation compatibility
  253. * -> direct link packets are broadcasted on
  254. * their interface only
  255. * -> aggregate packet if the current packet is
  256. * a "global" packet as well as the base
  257. * packet
  258. */
  259. primary_if = primary_if_get_selected(bat_priv);
  260. if (!primary_if)
  261. goto out;
  262. /* packets without direct link flag and high TTL
  263. * are flooded through the net */
  264. if ((!directlink) &&
  265. (!(batman_ogm_packet->flags & DIRECTLINK)) &&
  266. (batman_ogm_packet->header.ttl != 1) &&
  267. /* own packets originating non-primary
  268. * interfaces leave only that interface */
  269. ((!forw_packet->own) ||
  270. (forw_packet->if_incoming == primary_if))) {
  271. res = true;
  272. goto out;
  273. }
  274. /* if the incoming packet is sent via this one
  275. * interface only - we still can aggregate */
  276. if ((directlink) &&
  277. (new_batman_ogm_packet->header.ttl == 1) &&
  278. (forw_packet->if_incoming == if_incoming) &&
  279. /* packets from direct neighbors or
  280. * own secondary interface packets
  281. * (= secondary interface packets in general) */
  282. (batman_ogm_packet->flags & DIRECTLINK ||
  283. (forw_packet->own &&
  284. forw_packet->if_incoming != primary_if))) {
  285. res = true;
  286. goto out;
  287. }
  288. }
  289. out:
  290. if (primary_if)
  291. hardif_free_ref(primary_if);
  292. return res;
  293. }
  294. /* create a new aggregated packet and add this packet to it */
  295. static void bat_iv_ogm_aggregate_new(const unsigned char *packet_buff,
  296. int packet_len, unsigned long send_time,
  297. bool direct_link,
  298. struct hard_iface *if_incoming,
  299. int own_packet)
  300. {
  301. struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface);
  302. struct forw_packet *forw_packet_aggr;
  303. unsigned char *skb_buff;
  304. if (!atomic_inc_not_zero(&if_incoming->refcount))
  305. return;
  306. /* own packet should always be scheduled */
  307. if (!own_packet) {
  308. if (!atomic_dec_not_zero(&bat_priv->batman_queue_left)) {
  309. bat_dbg(DBG_BATMAN, bat_priv,
  310. "batman packet queue full\n");
  311. goto out;
  312. }
  313. }
  314. forw_packet_aggr = kmalloc(sizeof(*forw_packet_aggr), GFP_ATOMIC);
  315. if (!forw_packet_aggr) {
  316. if (!own_packet)
  317. atomic_inc(&bat_priv->batman_queue_left);
  318. goto out;
  319. }
  320. if ((atomic_read(&bat_priv->aggregated_ogms)) &&
  321. (packet_len < MAX_AGGREGATION_BYTES))
  322. forw_packet_aggr->skb = dev_alloc_skb(MAX_AGGREGATION_BYTES +
  323. ETH_HLEN);
  324. else
  325. forw_packet_aggr->skb = dev_alloc_skb(packet_len + ETH_HLEN);
  326. if (!forw_packet_aggr->skb) {
  327. if (!own_packet)
  328. atomic_inc(&bat_priv->batman_queue_left);
  329. kfree(forw_packet_aggr);
  330. goto out;
  331. }
  332. skb_reserve(forw_packet_aggr->skb, ETH_HLEN);
  333. INIT_HLIST_NODE(&forw_packet_aggr->list);
  334. skb_buff = skb_put(forw_packet_aggr->skb, packet_len);
  335. forw_packet_aggr->packet_len = packet_len;
  336. memcpy(skb_buff, packet_buff, packet_len);
  337. forw_packet_aggr->own = own_packet;
  338. forw_packet_aggr->if_incoming = if_incoming;
  339. forw_packet_aggr->num_packets = 0;
  340. forw_packet_aggr->direct_link_flags = NO_FLAGS;
  341. forw_packet_aggr->send_time = send_time;
  342. /* save packet direct link flag status */
  343. if (direct_link)
  344. forw_packet_aggr->direct_link_flags |= 1;
  345. /* add new packet to packet list */
  346. spin_lock_bh(&bat_priv->forw_bat_list_lock);
  347. hlist_add_head(&forw_packet_aggr->list, &bat_priv->forw_bat_list);
  348. spin_unlock_bh(&bat_priv->forw_bat_list_lock);
  349. /* start timer for this packet */
  350. INIT_DELAYED_WORK(&forw_packet_aggr->delayed_work,
  351. send_outstanding_bat_ogm_packet);
  352. queue_delayed_work(bat_event_workqueue,
  353. &forw_packet_aggr->delayed_work,
  354. send_time - jiffies);
  355. return;
  356. out:
  357. hardif_free_ref(if_incoming);
  358. }
  359. /* aggregate a new packet into the existing ogm packet */
  360. static void bat_iv_ogm_aggregate(struct forw_packet *forw_packet_aggr,
  361. const unsigned char *packet_buff,
  362. int packet_len, bool direct_link)
  363. {
  364. unsigned char *skb_buff;
  365. skb_buff = skb_put(forw_packet_aggr->skb, packet_len);
  366. memcpy(skb_buff, packet_buff, packet_len);
  367. forw_packet_aggr->packet_len += packet_len;
  368. forw_packet_aggr->num_packets++;
  369. /* save packet direct link flag status */
  370. if (direct_link)
  371. forw_packet_aggr->direct_link_flags |=
  372. (1 << forw_packet_aggr->num_packets);
  373. }
  374. static void bat_iv_ogm_queue_add(struct bat_priv *bat_priv,
  375. unsigned char *packet_buff,
  376. int packet_len, struct hard_iface *if_incoming,
  377. int own_packet, unsigned long send_time)
  378. {
  379. /**
  380. * _aggr -> pointer to the packet we want to aggregate with
  381. * _pos -> pointer to the position in the queue
  382. */
  383. struct forw_packet *forw_packet_aggr = NULL, *forw_packet_pos = NULL;
  384. struct hlist_node *tmp_node;
  385. struct batman_ogm_packet *batman_ogm_packet;
  386. bool direct_link;
  387. batman_ogm_packet = (struct batman_ogm_packet *)packet_buff;
  388. direct_link = batman_ogm_packet->flags & DIRECTLINK ? 1 : 0;
  389. /* find position for the packet in the forward queue */
  390. spin_lock_bh(&bat_priv->forw_bat_list_lock);
  391. /* own packets are not to be aggregated */
  392. if ((atomic_read(&bat_priv->aggregated_ogms)) && (!own_packet)) {
  393. hlist_for_each_entry(forw_packet_pos, tmp_node,
  394. &bat_priv->forw_bat_list, list) {
  395. if (bat_iv_ogm_can_aggregate(batman_ogm_packet,
  396. bat_priv, packet_len,
  397. send_time, direct_link,
  398. if_incoming,
  399. forw_packet_pos)) {
  400. forw_packet_aggr = forw_packet_pos;
  401. break;
  402. }
  403. }
  404. }
  405. /* nothing to aggregate with - either aggregation disabled or no
  406. * suitable aggregation packet found */
  407. if (!forw_packet_aggr) {
  408. /* the following section can run without the lock */
  409. spin_unlock_bh(&bat_priv->forw_bat_list_lock);
  410. /**
  411. * if we could not aggregate this packet with one of the others
  412. * we hold it back for a while, so that it might be aggregated
  413. * later on
  414. */
  415. if ((!own_packet) &&
  416. (atomic_read(&bat_priv->aggregated_ogms)))
  417. send_time += msecs_to_jiffies(MAX_AGGREGATION_MS);
  418. bat_iv_ogm_aggregate_new(packet_buff, packet_len,
  419. send_time, direct_link,
  420. if_incoming, own_packet);
  421. } else {
  422. bat_iv_ogm_aggregate(forw_packet_aggr, packet_buff,
  423. packet_len, direct_link);
  424. spin_unlock_bh(&bat_priv->forw_bat_list_lock);
  425. }
  426. }
  427. static void bat_iv_ogm_forward(struct orig_node *orig_node,
  428. const struct ethhdr *ethhdr,
  429. struct batman_ogm_packet *batman_ogm_packet,
  430. bool is_single_hop_neigh,
  431. struct hard_iface *if_incoming)
  432. {
  433. struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface);
  434. struct neigh_node *router;
  435. uint8_t in_tq, in_ttl, tq_avg = 0;
  436. uint8_t tt_num_changes;
  437. if (batman_ogm_packet->header.ttl <= 1) {
  438. bat_dbg(DBG_BATMAN, bat_priv, "ttl exceeded\n");
  439. return;
  440. }
  441. router = orig_node_get_router(orig_node);
  442. in_tq = batman_ogm_packet->tq;
  443. in_ttl = batman_ogm_packet->header.ttl;
  444. tt_num_changes = batman_ogm_packet->tt_num_changes;
  445. batman_ogm_packet->header.ttl--;
  446. memcpy(batman_ogm_packet->prev_sender, ethhdr->h_source, ETH_ALEN);
  447. /* rebroadcast tq of our best ranking neighbor to ensure the rebroadcast
  448. * of our best tq value */
  449. if (router && router->tq_avg != 0) {
  450. /* rebroadcast ogm of best ranking neighbor as is */
  451. if (!compare_eth(router->addr, ethhdr->h_source)) {
  452. batman_ogm_packet->tq = router->tq_avg;
  453. if (router->last_ttl)
  454. batman_ogm_packet->header.ttl =
  455. router->last_ttl - 1;
  456. }
  457. tq_avg = router->tq_avg;
  458. }
  459. if (router)
  460. neigh_node_free_ref(router);
  461. /* apply hop penalty */
  462. batman_ogm_packet->tq = hop_penalty(batman_ogm_packet->tq, bat_priv);
  463. bat_dbg(DBG_BATMAN, bat_priv,
  464. "Forwarding packet: tq_orig: %i, tq_avg: %i, tq_forw: %i, ttl_orig: %i, ttl_forw: %i\n",
  465. in_tq, tq_avg, batman_ogm_packet->tq, in_ttl - 1,
  466. batman_ogm_packet->header.ttl);
  467. batman_ogm_packet->seqno = htonl(batman_ogm_packet->seqno);
  468. batman_ogm_packet->tt_crc = htons(batman_ogm_packet->tt_crc);
  469. /* switch of primaries first hop flag when forwarding */
  470. batman_ogm_packet->flags &= ~PRIMARIES_FIRST_HOP;
  471. if (is_single_hop_neigh)
  472. batman_ogm_packet->flags |= DIRECTLINK;
  473. else
  474. batman_ogm_packet->flags &= ~DIRECTLINK;
  475. bat_iv_ogm_queue_add(bat_priv, (unsigned char *)batman_ogm_packet,
  476. BATMAN_OGM_HLEN + tt_len(tt_num_changes),
  477. if_incoming, 0, bat_iv_ogm_fwd_send_time());
  478. }
  479. static void bat_iv_ogm_schedule(struct hard_iface *hard_iface,
  480. int tt_num_changes)
  481. {
  482. struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
  483. struct batman_ogm_packet *batman_ogm_packet;
  484. struct hard_iface *primary_if;
  485. int vis_server;
  486. vis_server = atomic_read(&bat_priv->vis_mode);
  487. primary_if = primary_if_get_selected(bat_priv);
  488. batman_ogm_packet = (struct batman_ogm_packet *)hard_iface->packet_buff;
  489. /* change sequence number to network order */
  490. batman_ogm_packet->seqno =
  491. htonl((uint32_t)atomic_read(&hard_iface->seqno));
  492. batman_ogm_packet->ttvn = atomic_read(&bat_priv->ttvn);
  493. batman_ogm_packet->tt_crc = htons((uint16_t)
  494. atomic_read(&bat_priv->tt_crc));
  495. if (tt_num_changes >= 0)
  496. batman_ogm_packet->tt_num_changes = tt_num_changes;
  497. if (vis_server == VIS_TYPE_SERVER_SYNC)
  498. batman_ogm_packet->flags |= VIS_SERVER;
  499. else
  500. batman_ogm_packet->flags &= ~VIS_SERVER;
  501. if ((hard_iface == primary_if) &&
  502. (atomic_read(&bat_priv->gw_mode) == GW_MODE_SERVER))
  503. batman_ogm_packet->gw_flags =
  504. (uint8_t)atomic_read(&bat_priv->gw_bandwidth);
  505. else
  506. batman_ogm_packet->gw_flags = NO_FLAGS;
  507. atomic_inc(&hard_iface->seqno);
  508. slide_own_bcast_window(hard_iface);
  509. bat_iv_ogm_queue_add(bat_priv, hard_iface->packet_buff,
  510. hard_iface->packet_len, hard_iface, 1,
  511. bat_iv_ogm_emit_send_time(bat_priv));
  512. if (primary_if)
  513. hardif_free_ref(primary_if);
  514. }
  515. static void bat_iv_ogm_orig_update(struct bat_priv *bat_priv,
  516. struct orig_node *orig_node,
  517. const struct ethhdr *ethhdr,
  518. const struct batman_ogm_packet
  519. *batman_ogm_packet,
  520. struct hard_iface *if_incoming,
  521. const unsigned char *tt_buff,
  522. int is_duplicate)
  523. {
  524. struct neigh_node *neigh_node = NULL, *tmp_neigh_node = NULL;
  525. struct neigh_node *router = NULL;
  526. struct orig_node *orig_node_tmp;
  527. struct hlist_node *node;
  528. uint8_t bcast_own_sum_orig, bcast_own_sum_neigh;
  529. bat_dbg(DBG_BATMAN, bat_priv,
  530. "update_originator(): Searching and updating originator entry of received packet\n");
  531. rcu_read_lock();
  532. hlist_for_each_entry_rcu(tmp_neigh_node, node,
  533. &orig_node->neigh_list, list) {
  534. if (compare_eth(tmp_neigh_node->addr, ethhdr->h_source) &&
  535. (tmp_neigh_node->if_incoming == if_incoming) &&
  536. atomic_inc_not_zero(&tmp_neigh_node->refcount)) {
  537. if (neigh_node)
  538. neigh_node_free_ref(neigh_node);
  539. neigh_node = tmp_neigh_node;
  540. continue;
  541. }
  542. if (is_duplicate)
  543. continue;
  544. spin_lock_bh(&tmp_neigh_node->tq_lock);
  545. ring_buffer_set(tmp_neigh_node->tq_recv,
  546. &tmp_neigh_node->tq_index, 0);
  547. tmp_neigh_node->tq_avg =
  548. ring_buffer_avg(tmp_neigh_node->tq_recv);
  549. spin_unlock_bh(&tmp_neigh_node->tq_lock);
  550. }
  551. if (!neigh_node) {
  552. struct orig_node *orig_tmp;
  553. orig_tmp = get_orig_node(bat_priv, ethhdr->h_source);
  554. if (!orig_tmp)
  555. goto unlock;
  556. neigh_node = bat_iv_ogm_neigh_new(if_incoming, ethhdr->h_source,
  557. orig_node, orig_tmp,
  558. batman_ogm_packet->seqno);
  559. orig_node_free_ref(orig_tmp);
  560. if (!neigh_node)
  561. goto unlock;
  562. } else
  563. bat_dbg(DBG_BATMAN, bat_priv,
  564. "Updating existing last-hop neighbor of originator\n");
  565. rcu_read_unlock();
  566. orig_node->flags = batman_ogm_packet->flags;
  567. neigh_node->last_seen = jiffies;
  568. spin_lock_bh(&neigh_node->tq_lock);
  569. ring_buffer_set(neigh_node->tq_recv,
  570. &neigh_node->tq_index,
  571. batman_ogm_packet->tq);
  572. neigh_node->tq_avg = ring_buffer_avg(neigh_node->tq_recv);
  573. spin_unlock_bh(&neigh_node->tq_lock);
  574. if (!is_duplicate) {
  575. orig_node->last_ttl = batman_ogm_packet->header.ttl;
  576. neigh_node->last_ttl = batman_ogm_packet->header.ttl;
  577. }
  578. bonding_candidate_add(orig_node, neigh_node);
  579. /* if this neighbor already is our next hop there is nothing
  580. * to change */
  581. router = orig_node_get_router(orig_node);
  582. if (router == neigh_node)
  583. goto update_tt;
  584. /* if this neighbor does not offer a better TQ we won't consider it */
  585. if (router && (router->tq_avg > neigh_node->tq_avg))
  586. goto update_tt;
  587. /* if the TQ is the same and the link not more symmetric we
  588. * won't consider it either */
  589. if (router && (neigh_node->tq_avg == router->tq_avg)) {
  590. orig_node_tmp = router->orig_node;
  591. spin_lock_bh(&orig_node_tmp->ogm_cnt_lock);
  592. bcast_own_sum_orig =
  593. orig_node_tmp->bcast_own_sum[if_incoming->if_num];
  594. spin_unlock_bh(&orig_node_tmp->ogm_cnt_lock);
  595. orig_node_tmp = neigh_node->orig_node;
  596. spin_lock_bh(&orig_node_tmp->ogm_cnt_lock);
  597. bcast_own_sum_neigh =
  598. orig_node_tmp->bcast_own_sum[if_incoming->if_num];
  599. spin_unlock_bh(&orig_node_tmp->ogm_cnt_lock);
  600. if (bcast_own_sum_orig >= bcast_own_sum_neigh)
  601. goto update_tt;
  602. }
  603. update_route(bat_priv, orig_node, neigh_node);
  604. update_tt:
  605. /* I have to check for transtable changes only if the OGM has been
  606. * sent through a primary interface */
  607. if (((batman_ogm_packet->orig != ethhdr->h_source) &&
  608. (batman_ogm_packet->header.ttl > 2)) ||
  609. (batman_ogm_packet->flags & PRIMARIES_FIRST_HOP))
  610. tt_update_orig(bat_priv, orig_node, tt_buff,
  611. batman_ogm_packet->tt_num_changes,
  612. batman_ogm_packet->ttvn,
  613. batman_ogm_packet->tt_crc);
  614. if (orig_node->gw_flags != batman_ogm_packet->gw_flags)
  615. gw_node_update(bat_priv, orig_node,
  616. batman_ogm_packet->gw_flags);
  617. orig_node->gw_flags = batman_ogm_packet->gw_flags;
  618. /* restart gateway selection if fast or late switching was enabled */
  619. if ((orig_node->gw_flags) &&
  620. (atomic_read(&bat_priv->gw_mode) == GW_MODE_CLIENT) &&
  621. (atomic_read(&bat_priv->gw_sel_class) > 2))
  622. gw_check_election(bat_priv, orig_node);
  623. goto out;
  624. unlock:
  625. rcu_read_unlock();
  626. out:
  627. if (neigh_node)
  628. neigh_node_free_ref(neigh_node);
  629. if (router)
  630. neigh_node_free_ref(router);
  631. }
  632. static int bat_iv_ogm_calc_tq(struct orig_node *orig_node,
  633. struct orig_node *orig_neigh_node,
  634. struct batman_ogm_packet *batman_ogm_packet,
  635. struct hard_iface *if_incoming)
  636. {
  637. struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface);
  638. struct neigh_node *neigh_node = NULL, *tmp_neigh_node;
  639. struct hlist_node *node;
  640. uint8_t total_count;
  641. uint8_t orig_eq_count, neigh_rq_count, tq_own;
  642. int tq_asym_penalty, ret = 0;
  643. /* find corresponding one hop neighbor */
  644. rcu_read_lock();
  645. hlist_for_each_entry_rcu(tmp_neigh_node, node,
  646. &orig_neigh_node->neigh_list, list) {
  647. if (!compare_eth(tmp_neigh_node->addr, orig_neigh_node->orig))
  648. continue;
  649. if (tmp_neigh_node->if_incoming != if_incoming)
  650. continue;
  651. if (!atomic_inc_not_zero(&tmp_neigh_node->refcount))
  652. continue;
  653. neigh_node = tmp_neigh_node;
  654. break;
  655. }
  656. rcu_read_unlock();
  657. if (!neigh_node)
  658. neigh_node = bat_iv_ogm_neigh_new(if_incoming,
  659. orig_neigh_node->orig,
  660. orig_neigh_node,
  661. orig_neigh_node,
  662. batman_ogm_packet->seqno);
  663. if (!neigh_node)
  664. goto out;
  665. /* if orig_node is direct neighbor update neigh_node last_seen */
  666. if (orig_node == orig_neigh_node)
  667. neigh_node->last_seen = jiffies;
  668. orig_node->last_seen = jiffies;
  669. /* find packet count of corresponding one hop neighbor */
  670. spin_lock_bh(&orig_node->ogm_cnt_lock);
  671. orig_eq_count = orig_neigh_node->bcast_own_sum[if_incoming->if_num];
  672. neigh_rq_count = neigh_node->real_packet_count;
  673. spin_unlock_bh(&orig_node->ogm_cnt_lock);
  674. /* pay attention to not get a value bigger than 100 % */
  675. total_count = (orig_eq_count > neigh_rq_count ?
  676. neigh_rq_count : orig_eq_count);
  677. /* if we have too few packets (too less data) we set tq_own to zero */
  678. /* if we receive too few packets it is not considered bidirectional */
  679. if ((total_count < TQ_LOCAL_BIDRECT_SEND_MINIMUM) ||
  680. (neigh_rq_count < TQ_LOCAL_BIDRECT_RECV_MINIMUM))
  681. tq_own = 0;
  682. else
  683. /* neigh_node->real_packet_count is never zero as we
  684. * only purge old information when getting new
  685. * information */
  686. tq_own = (TQ_MAX_VALUE * total_count) / neigh_rq_count;
  687. /* 1 - ((1-x) ** 3), normalized to TQ_MAX_VALUE this does
  688. * affect the nearly-symmetric links only a little, but
  689. * punishes asymmetric links more. This will give a value
  690. * between 0 and TQ_MAX_VALUE
  691. */
  692. tq_asym_penalty = TQ_MAX_VALUE - (TQ_MAX_VALUE *
  693. (TQ_LOCAL_WINDOW_SIZE - neigh_rq_count) *
  694. (TQ_LOCAL_WINDOW_SIZE - neigh_rq_count) *
  695. (TQ_LOCAL_WINDOW_SIZE - neigh_rq_count)) /
  696. (TQ_LOCAL_WINDOW_SIZE *
  697. TQ_LOCAL_WINDOW_SIZE *
  698. TQ_LOCAL_WINDOW_SIZE);
  699. batman_ogm_packet->tq = ((batman_ogm_packet->tq * tq_own
  700. * tq_asym_penalty) /
  701. (TQ_MAX_VALUE * TQ_MAX_VALUE));
  702. bat_dbg(DBG_BATMAN, bat_priv,
  703. "bidirectional: orig = %-15pM neigh = %-15pM => own_bcast = %2i, real recv = %2i, local tq: %3i, asym_penalty: %3i, total tq: %3i\n",
  704. orig_node->orig, orig_neigh_node->orig, total_count,
  705. neigh_rq_count, tq_own, tq_asym_penalty, batman_ogm_packet->tq);
  706. /* if link has the minimum required transmission quality
  707. * consider it bidirectional */
  708. if (batman_ogm_packet->tq >= TQ_TOTAL_BIDRECT_LIMIT)
  709. ret = 1;
  710. out:
  711. if (neigh_node)
  712. neigh_node_free_ref(neigh_node);
  713. return ret;
  714. }
  715. /* processes a batman packet for all interfaces, adjusts the sequence number and
  716. * finds out whether it is a duplicate.
  717. * returns:
  718. * 1 the packet is a duplicate
  719. * 0 the packet has not yet been received
  720. * -1 the packet is old and has been received while the seqno window
  721. * was protected. Caller should drop it.
  722. */
  723. static int bat_iv_ogm_update_seqnos(const struct ethhdr *ethhdr,
  724. const struct batman_ogm_packet
  725. *batman_ogm_packet,
  726. const struct hard_iface *if_incoming)
  727. {
  728. struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface);
  729. struct orig_node *orig_node;
  730. struct neigh_node *tmp_neigh_node;
  731. struct hlist_node *node;
  732. int is_duplicate = 0;
  733. int32_t seq_diff;
  734. int need_update = 0;
  735. int set_mark, ret = -1;
  736. orig_node = get_orig_node(bat_priv, batman_ogm_packet->orig);
  737. if (!orig_node)
  738. return 0;
  739. spin_lock_bh(&orig_node->ogm_cnt_lock);
  740. seq_diff = batman_ogm_packet->seqno - orig_node->last_real_seqno;
  741. /* signalize caller that the packet is to be dropped. */
  742. if (!hlist_empty(&orig_node->neigh_list) &&
  743. window_protected(bat_priv, seq_diff,
  744. &orig_node->batman_seqno_reset))
  745. goto out;
  746. rcu_read_lock();
  747. hlist_for_each_entry_rcu(tmp_neigh_node, node,
  748. &orig_node->neigh_list, list) {
  749. is_duplicate |= bat_test_bit(tmp_neigh_node->real_bits,
  750. orig_node->last_real_seqno,
  751. batman_ogm_packet->seqno);
  752. if (compare_eth(tmp_neigh_node->addr, ethhdr->h_source) &&
  753. (tmp_neigh_node->if_incoming == if_incoming))
  754. set_mark = 1;
  755. else
  756. set_mark = 0;
  757. /* if the window moved, set the update flag. */
  758. need_update |= bit_get_packet(bat_priv,
  759. tmp_neigh_node->real_bits,
  760. seq_diff, set_mark);
  761. tmp_neigh_node->real_packet_count =
  762. bitmap_weight(tmp_neigh_node->real_bits,
  763. TQ_LOCAL_WINDOW_SIZE);
  764. }
  765. rcu_read_unlock();
  766. if (need_update) {
  767. bat_dbg(DBG_BATMAN, bat_priv,
  768. "updating last_seqno: old %u, new %u\n",
  769. orig_node->last_real_seqno, batman_ogm_packet->seqno);
  770. orig_node->last_real_seqno = batman_ogm_packet->seqno;
  771. }
  772. ret = is_duplicate;
  773. out:
  774. spin_unlock_bh(&orig_node->ogm_cnt_lock);
  775. orig_node_free_ref(orig_node);
  776. return ret;
  777. }
  778. static void bat_iv_ogm_process(const struct ethhdr *ethhdr,
  779. struct batman_ogm_packet *batman_ogm_packet,
  780. const unsigned char *tt_buff,
  781. struct hard_iface *if_incoming)
  782. {
  783. struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface);
  784. struct hard_iface *hard_iface;
  785. struct orig_node *orig_neigh_node, *orig_node;
  786. struct neigh_node *router = NULL, *router_router = NULL;
  787. struct neigh_node *orig_neigh_router = NULL;
  788. int has_directlink_flag;
  789. int is_my_addr = 0, is_my_orig = 0, is_my_oldorig = 0;
  790. int is_broadcast = 0, is_bidirectional;
  791. bool is_single_hop_neigh = false;
  792. int is_duplicate;
  793. uint32_t if_incoming_seqno;
  794. /* Silently drop when the batman packet is actually not a
  795. * correct packet.
  796. *
  797. * This might happen if a packet is padded (e.g. Ethernet has a
  798. * minimum frame length of 64 byte) and the aggregation interprets
  799. * it as an additional length.
  800. *
  801. * TODO: A more sane solution would be to have a bit in the
  802. * batman_ogm_packet to detect whether the packet is the last
  803. * packet in an aggregation. Here we expect that the padding
  804. * is always zero (or not 0x01)
  805. */
  806. if (batman_ogm_packet->header.packet_type != BAT_IV_OGM)
  807. return;
  808. /* could be changed by schedule_own_packet() */
  809. if_incoming_seqno = atomic_read(&if_incoming->seqno);
  810. has_directlink_flag = (batman_ogm_packet->flags & DIRECTLINK ? 1 : 0);
  811. if (compare_eth(ethhdr->h_source, batman_ogm_packet->orig))
  812. is_single_hop_neigh = true;
  813. bat_dbg(DBG_BATMAN, bat_priv,
  814. "Received BATMAN packet via NB: %pM, IF: %s [%pM] (from OG: %pM, via prev OG: %pM, seqno %u, ttvn %u, crc %u, changes %u, td %d, TTL %d, V %d, IDF %d)\n",
  815. ethhdr->h_source, if_incoming->net_dev->name,
  816. if_incoming->net_dev->dev_addr, batman_ogm_packet->orig,
  817. batman_ogm_packet->prev_sender, batman_ogm_packet->seqno,
  818. batman_ogm_packet->ttvn, batman_ogm_packet->tt_crc,
  819. batman_ogm_packet->tt_num_changes, batman_ogm_packet->tq,
  820. batman_ogm_packet->header.ttl,
  821. batman_ogm_packet->header.version, has_directlink_flag);
  822. rcu_read_lock();
  823. list_for_each_entry_rcu(hard_iface, &hardif_list, list) {
  824. if (hard_iface->if_status != IF_ACTIVE)
  825. continue;
  826. if (hard_iface->soft_iface != if_incoming->soft_iface)
  827. continue;
  828. if (compare_eth(ethhdr->h_source,
  829. hard_iface->net_dev->dev_addr))
  830. is_my_addr = 1;
  831. if (compare_eth(batman_ogm_packet->orig,
  832. hard_iface->net_dev->dev_addr))
  833. is_my_orig = 1;
  834. if (compare_eth(batman_ogm_packet->prev_sender,
  835. hard_iface->net_dev->dev_addr))
  836. is_my_oldorig = 1;
  837. if (is_broadcast_ether_addr(ethhdr->h_source))
  838. is_broadcast = 1;
  839. }
  840. rcu_read_unlock();
  841. if (batman_ogm_packet->header.version != COMPAT_VERSION) {
  842. bat_dbg(DBG_BATMAN, bat_priv,
  843. "Drop packet: incompatible batman version (%i)\n",
  844. batman_ogm_packet->header.version);
  845. return;
  846. }
  847. if (is_my_addr) {
  848. bat_dbg(DBG_BATMAN, bat_priv,
  849. "Drop packet: received my own broadcast (sender: %pM)\n",
  850. ethhdr->h_source);
  851. return;
  852. }
  853. if (is_broadcast) {
  854. bat_dbg(DBG_BATMAN, bat_priv,
  855. "Drop packet: ignoring all packets with broadcast source addr (sender: %pM)\n",
  856. ethhdr->h_source);
  857. return;
  858. }
  859. if (is_my_orig) {
  860. unsigned long *word;
  861. int offset;
  862. orig_neigh_node = get_orig_node(bat_priv, ethhdr->h_source);
  863. if (!orig_neigh_node)
  864. return;
  865. /* neighbor has to indicate direct link and it has to
  866. * come via the corresponding interface */
  867. /* save packet seqno for bidirectional check */
  868. if (has_directlink_flag &&
  869. compare_eth(if_incoming->net_dev->dev_addr,
  870. batman_ogm_packet->orig)) {
  871. offset = if_incoming->if_num * NUM_WORDS;
  872. spin_lock_bh(&orig_neigh_node->ogm_cnt_lock);
  873. word = &(orig_neigh_node->bcast_own[offset]);
  874. bat_set_bit(word,
  875. if_incoming_seqno -
  876. batman_ogm_packet->seqno - 2);
  877. orig_neigh_node->bcast_own_sum[if_incoming->if_num] =
  878. bitmap_weight(word, TQ_LOCAL_WINDOW_SIZE);
  879. spin_unlock_bh(&orig_neigh_node->ogm_cnt_lock);
  880. }
  881. bat_dbg(DBG_BATMAN, bat_priv,
  882. "Drop packet: originator packet from myself (via neighbor)\n");
  883. orig_node_free_ref(orig_neigh_node);
  884. return;
  885. }
  886. if (is_my_oldorig) {
  887. bat_dbg(DBG_BATMAN, bat_priv,
  888. "Drop packet: ignoring all rebroadcast echos (sender: %pM)\n",
  889. ethhdr->h_source);
  890. return;
  891. }
  892. orig_node = get_orig_node(bat_priv, batman_ogm_packet->orig);
  893. if (!orig_node)
  894. return;
  895. is_duplicate = bat_iv_ogm_update_seqnos(ethhdr, batman_ogm_packet,
  896. if_incoming);
  897. if (is_duplicate == -1) {
  898. bat_dbg(DBG_BATMAN, bat_priv,
  899. "Drop packet: packet within seqno protection time (sender: %pM)\n",
  900. ethhdr->h_source);
  901. goto out;
  902. }
  903. if (batman_ogm_packet->tq == 0) {
  904. bat_dbg(DBG_BATMAN, bat_priv,
  905. "Drop packet: originator packet with tq equal 0\n");
  906. goto out;
  907. }
  908. router = orig_node_get_router(orig_node);
  909. if (router)
  910. router_router = orig_node_get_router(router->orig_node);
  911. /* avoid temporary routing loops */
  912. if (router && router_router &&
  913. (compare_eth(router->addr, batman_ogm_packet->prev_sender)) &&
  914. !(compare_eth(batman_ogm_packet->orig,
  915. batman_ogm_packet->prev_sender)) &&
  916. (compare_eth(router->addr, router_router->addr))) {
  917. bat_dbg(DBG_BATMAN, bat_priv,
  918. "Drop packet: ignoring all rebroadcast packets that may make me loop (sender: %pM)\n",
  919. ethhdr->h_source);
  920. goto out;
  921. }
  922. /* if sender is a direct neighbor the sender mac equals
  923. * originator mac */
  924. orig_neigh_node = (is_single_hop_neigh ?
  925. orig_node :
  926. get_orig_node(bat_priv, ethhdr->h_source));
  927. if (!orig_neigh_node)
  928. goto out;
  929. orig_neigh_router = orig_node_get_router(orig_neigh_node);
  930. /* drop packet if sender is not a direct neighbor and if we
  931. * don't route towards it */
  932. if (!is_single_hop_neigh && (!orig_neigh_router)) {
  933. bat_dbg(DBG_BATMAN, bat_priv,
  934. "Drop packet: OGM via unknown neighbor!\n");
  935. goto out_neigh;
  936. }
  937. is_bidirectional = bat_iv_ogm_calc_tq(orig_node, orig_neigh_node,
  938. batman_ogm_packet, if_incoming);
  939. bonding_save_primary(orig_node, orig_neigh_node, batman_ogm_packet);
  940. /* update ranking if it is not a duplicate or has the same
  941. * seqno and similar ttl as the non-duplicate */
  942. if (is_bidirectional &&
  943. (!is_duplicate ||
  944. ((orig_node->last_real_seqno == batman_ogm_packet->seqno) &&
  945. (orig_node->last_ttl - 3 <= batman_ogm_packet->header.ttl))))
  946. bat_iv_ogm_orig_update(bat_priv, orig_node, ethhdr,
  947. batman_ogm_packet, if_incoming,
  948. tt_buff, is_duplicate);
  949. /* is single hop (direct) neighbor */
  950. if (is_single_hop_neigh) {
  951. /* mark direct link on incoming interface */
  952. bat_iv_ogm_forward(orig_node, ethhdr, batman_ogm_packet,
  953. is_single_hop_neigh, if_incoming);
  954. bat_dbg(DBG_BATMAN, bat_priv,
  955. "Forwarding packet: rebroadcast neighbor packet with direct link flag\n");
  956. goto out_neigh;
  957. }
  958. /* multihop originator */
  959. if (!is_bidirectional) {
  960. bat_dbg(DBG_BATMAN, bat_priv,
  961. "Drop packet: not received via bidirectional link\n");
  962. goto out_neigh;
  963. }
  964. if (is_duplicate) {
  965. bat_dbg(DBG_BATMAN, bat_priv,
  966. "Drop packet: duplicate packet received\n");
  967. goto out_neigh;
  968. }
  969. bat_dbg(DBG_BATMAN, bat_priv,
  970. "Forwarding packet: rebroadcast originator packet\n");
  971. bat_iv_ogm_forward(orig_node, ethhdr, batman_ogm_packet,
  972. is_single_hop_neigh, if_incoming);
  973. out_neigh:
  974. if ((orig_neigh_node) && (!is_single_hop_neigh))
  975. orig_node_free_ref(orig_neigh_node);
  976. out:
  977. if (router)
  978. neigh_node_free_ref(router);
  979. if (router_router)
  980. neigh_node_free_ref(router_router);
  981. if (orig_neigh_router)
  982. neigh_node_free_ref(orig_neigh_router);
  983. orig_node_free_ref(orig_node);
  984. }
  985. static int bat_iv_ogm_receive(struct sk_buff *skb,
  986. struct hard_iface *if_incoming)
  987. {
  988. struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface);
  989. struct batman_ogm_packet *batman_ogm_packet;
  990. struct ethhdr *ethhdr;
  991. int buff_pos = 0, packet_len;
  992. unsigned char *tt_buff, *packet_buff;
  993. bool ret;
  994. ret = check_management_packet(skb, if_incoming, BATMAN_OGM_HLEN);
  995. if (!ret)
  996. return NET_RX_DROP;
  997. /* did we receive a B.A.T.M.A.N. IV OGM packet on an interface
  998. * that does not have B.A.T.M.A.N. IV enabled ?
  999. */
  1000. if (bat_priv->bat_algo_ops->bat_ogm_emit != bat_iv_ogm_emit)
  1001. return NET_RX_DROP;
  1002. packet_len = skb_headlen(skb);
  1003. ethhdr = (struct ethhdr *)skb_mac_header(skb);
  1004. packet_buff = skb->data;
  1005. batman_ogm_packet = (struct batman_ogm_packet *)packet_buff;
  1006. /* unpack the aggregated packets and process them one by one */
  1007. do {
  1008. /* network to host order for our 32bit seqno and the
  1009. orig_interval */
  1010. batman_ogm_packet->seqno = ntohl(batman_ogm_packet->seqno);
  1011. batman_ogm_packet->tt_crc = ntohs(batman_ogm_packet->tt_crc);
  1012. tt_buff = packet_buff + buff_pos + BATMAN_OGM_HLEN;
  1013. bat_iv_ogm_process(ethhdr, batman_ogm_packet,
  1014. tt_buff, if_incoming);
  1015. buff_pos += BATMAN_OGM_HLEN +
  1016. tt_len(batman_ogm_packet->tt_num_changes);
  1017. batman_ogm_packet = (struct batman_ogm_packet *)
  1018. (packet_buff + buff_pos);
  1019. } while (bat_iv_ogm_aggr_packet(buff_pos, packet_len,
  1020. batman_ogm_packet->tt_num_changes));
  1021. kfree_skb(skb);
  1022. return NET_RX_SUCCESS;
  1023. }
  1024. static struct bat_algo_ops batman_iv __read_mostly = {
  1025. .name = "BATMAN IV",
  1026. .bat_iface_enable = bat_iv_ogm_iface_enable,
  1027. .bat_iface_disable = bat_iv_ogm_iface_disable,
  1028. .bat_primary_iface_set = bat_iv_ogm_primary_iface_set,
  1029. .bat_ogm_update_mac = bat_iv_ogm_update_mac,
  1030. .bat_ogm_schedule = bat_iv_ogm_schedule,
  1031. .bat_ogm_emit = bat_iv_ogm_emit,
  1032. };
  1033. int __init bat_iv_init(void)
  1034. {
  1035. int ret;
  1036. /* batman originator packet */
  1037. ret = recv_handler_register(BAT_IV_OGM, bat_iv_ogm_receive);
  1038. if (ret < 0)
  1039. goto out;
  1040. ret = bat_algo_register(&batman_iv);
  1041. if (ret < 0)
  1042. goto handler_unregister;
  1043. goto out;
  1044. handler_unregister:
  1045. recv_handler_unregister(BAT_IV_OGM);
  1046. out:
  1047. return ret;
  1048. }