2 * Copyright (C) 2007-2011 B.A.T.M.A.N. contributors:
4 * Marek Lindner, Simon Wunderlich
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.
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.
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
26 #include "soft-interface.h"
27 #include "hard-interface.h"
28 #include "icmp_socket.h"
29 #include "translation-table.h"
30 #include "originator.h"
31 #include "ring_buffer.h"
33 #include "aggregation.h"
34 #include "gateway_common.h"
35 #include "gateway_client.h"
38 void slide_own_bcast_window(struct hard_iface *hard_iface)
40 struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
41 struct hashtable_t *hash = bat_priv->orig_hash;
42 struct hlist_node *node;
43 struct hlist_head *head;
44 struct orig_node *orig_node;
49 for (i = 0; i < hash->size; i++) {
50 head = &hash->table[i];
53 hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
54 spin_lock_bh(&orig_node->ogm_cnt_lock);
55 word_index = hard_iface->if_num * NUM_WORDS;
56 word = &(orig_node->bcast_own[word_index]);
58 bit_get_packet(bat_priv, word, 1, 0);
59 orig_node->bcast_own_sum[hard_iface->if_num] =
60 bit_packet_count(word);
61 spin_unlock_bh(&orig_node->ogm_cnt_lock);
67 static void update_TT(struct bat_priv *bat_priv, struct orig_node *orig_node,
68 const unsigned char *tt_buff, int tt_buff_len)
70 if ((tt_buff_len != orig_node->tt_buff_len) ||
72 (orig_node->tt_buff_len > 0) &&
73 (memcmp(orig_node->tt_buff, tt_buff, tt_buff_len) != 0))) {
75 if (orig_node->tt_buff_len > 0)
76 tt_global_del_orig(bat_priv, orig_node,
77 "originator changed tt");
79 if ((tt_buff_len > 0) && (tt_buff))
80 tt_global_add_orig(bat_priv, orig_node,
81 tt_buff, tt_buff_len);
85 static void update_route(struct bat_priv *bat_priv, struct orig_node *orig_node,
86 struct neigh_node *neigh_node,
87 const unsigned char *tt_buff, int tt_buff_len)
89 struct neigh_node *curr_router;
91 curr_router = orig_node_get_router(orig_node);
94 if ((curr_router) && (!neigh_node)) {
96 bat_dbg(DBG_ROUTES, bat_priv, "Deleting route towards: %pM\n",
98 tt_global_del_orig(bat_priv, orig_node,
99 "originator timed out");
102 } else if ((!curr_router) && (neigh_node)) {
104 bat_dbg(DBG_ROUTES, bat_priv,
105 "Adding route towards: %pM (via %pM)\n",
106 orig_node->orig, neigh_node->addr);
107 tt_global_add_orig(bat_priv, orig_node,
108 tt_buff, tt_buff_len);
112 bat_dbg(DBG_ROUTES, bat_priv,
113 "Changing route towards: %pM "
114 "(now via %pM - was via %pM)\n",
115 orig_node->orig, neigh_node->addr,
120 neigh_node_free_ref(curr_router);
122 /* increase refcount of new best neighbor */
123 if (neigh_node && !atomic_inc_not_zero(&neigh_node->refcount))
126 spin_lock_bh(&orig_node->neigh_list_lock);
127 rcu_assign_pointer(orig_node->router, neigh_node);
128 spin_unlock_bh(&orig_node->neigh_list_lock);
130 /* decrease refcount of previous best neighbor */
132 neigh_node_free_ref(curr_router);
135 void update_routes(struct bat_priv *bat_priv, struct orig_node *orig_node,
136 struct neigh_node *neigh_node, const unsigned char *tt_buff,
139 struct neigh_node *router = NULL;
144 router = orig_node_get_router(orig_node);
146 if (router != neigh_node)
147 update_route(bat_priv, orig_node, neigh_node,
148 tt_buff, tt_buff_len);
149 /* may be just TT changed */
151 update_TT(bat_priv, orig_node, tt_buff, tt_buff_len);
155 neigh_node_free_ref(router);
158 static int is_bidirectional_neigh(struct orig_node *orig_node,
159 struct orig_node *orig_neigh_node,
160 struct batman_packet *batman_packet,
161 struct hard_iface *if_incoming)
163 struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface);
164 struct neigh_node *neigh_node = NULL, *tmp_neigh_node;
165 struct hlist_node *node;
166 unsigned char total_count;
167 uint8_t orig_eq_count, neigh_rq_count, tq_own;
168 int tq_asym_penalty, ret = 0;
170 /* find corresponding one hop neighbor */
172 hlist_for_each_entry_rcu(tmp_neigh_node, node,
173 &orig_neigh_node->neigh_list, list) {
175 if (!compare_eth(tmp_neigh_node->addr, orig_neigh_node->orig))
178 if (tmp_neigh_node->if_incoming != if_incoming)
181 if (!atomic_inc_not_zero(&tmp_neigh_node->refcount))
184 neigh_node = tmp_neigh_node;
190 neigh_node = create_neighbor(orig_neigh_node,
192 orig_neigh_node->orig,
198 /* if orig_node is direct neighbour update neigh_node last_valid */
199 if (orig_node == orig_neigh_node)
200 neigh_node->last_valid = jiffies;
202 orig_node->last_valid = jiffies;
204 /* find packet count of corresponding one hop neighbor */
205 spin_lock_bh(&orig_node->ogm_cnt_lock);
206 orig_eq_count = orig_neigh_node->bcast_own_sum[if_incoming->if_num];
207 neigh_rq_count = neigh_node->real_packet_count;
208 spin_unlock_bh(&orig_node->ogm_cnt_lock);
210 /* pay attention to not get a value bigger than 100 % */
211 total_count = (orig_eq_count > neigh_rq_count ?
212 neigh_rq_count : orig_eq_count);
214 /* if we have too few packets (too less data) we set tq_own to zero */
215 /* if we receive too few packets it is not considered bidirectional */
216 if ((total_count < TQ_LOCAL_BIDRECT_SEND_MINIMUM) ||
217 (neigh_rq_count < TQ_LOCAL_BIDRECT_RECV_MINIMUM))
220 /* neigh_node->real_packet_count is never zero as we
221 * only purge old information when getting new
223 tq_own = (TQ_MAX_VALUE * total_count) / neigh_rq_count;
226 * 1 - ((1-x) ** 3), normalized to TQ_MAX_VALUE this does
227 * affect the nearly-symmetric links only a little, but
228 * punishes asymmetric links more. This will give a value
229 * between 0 and TQ_MAX_VALUE
231 tq_asym_penalty = TQ_MAX_VALUE - (TQ_MAX_VALUE *
232 (TQ_LOCAL_WINDOW_SIZE - neigh_rq_count) *
233 (TQ_LOCAL_WINDOW_SIZE - neigh_rq_count) *
234 (TQ_LOCAL_WINDOW_SIZE - neigh_rq_count)) /
235 (TQ_LOCAL_WINDOW_SIZE *
236 TQ_LOCAL_WINDOW_SIZE *
237 TQ_LOCAL_WINDOW_SIZE);
239 batman_packet->tq = ((batman_packet->tq * tq_own * tq_asym_penalty) /
240 (TQ_MAX_VALUE * TQ_MAX_VALUE));
242 bat_dbg(DBG_BATMAN, bat_priv,
244 "orig = %-15pM neigh = %-15pM => own_bcast = %2i, "
245 "real recv = %2i, local tq: %3i, asym_penalty: %3i, "
247 orig_node->orig, orig_neigh_node->orig, total_count,
248 neigh_rq_count, tq_own, tq_asym_penalty, batman_packet->tq);
250 /* if link has the minimum required transmission quality
251 * consider it bidirectional */
252 if (batman_packet->tq >= TQ_TOTAL_BIDRECT_LIMIT)
257 neigh_node_free_ref(neigh_node);
261 /* caller must hold the neigh_list_lock */
262 void bonding_candidate_del(struct orig_node *orig_node,
263 struct neigh_node *neigh_node)
265 /* this neighbor is not part of our candidate list */
266 if (list_empty(&neigh_node->bonding_list))
269 list_del_rcu(&neigh_node->bonding_list);
270 INIT_LIST_HEAD(&neigh_node->bonding_list);
271 neigh_node_free_ref(neigh_node);
272 atomic_dec(&orig_node->bond_candidates);
278 static void bonding_candidate_add(struct orig_node *orig_node,
279 struct neigh_node *neigh_node)
281 struct hlist_node *node;
282 struct neigh_node *tmp_neigh_node, *router = NULL;
283 uint8_t interference_candidate = 0;
285 spin_lock_bh(&orig_node->neigh_list_lock);
287 /* only consider if it has the same primary address ... */
288 if (!compare_eth(orig_node->orig,
289 neigh_node->orig_node->primary_addr))
292 router = orig_node_get_router(orig_node);
296 /* ... and is good enough to be considered */
297 if (neigh_node->tq_avg < router->tq_avg - BONDING_TQ_THRESHOLD)
301 * check if we have another candidate with the same mac address or
302 * interface. If we do, we won't select this candidate because of
303 * possible interference.
305 hlist_for_each_entry_rcu(tmp_neigh_node, node,
306 &orig_node->neigh_list, list) {
308 if (tmp_neigh_node == neigh_node)
311 /* we only care if the other candidate is even
312 * considered as candidate. */
313 if (list_empty(&tmp_neigh_node->bonding_list))
316 if ((neigh_node->if_incoming == tmp_neigh_node->if_incoming) ||
317 (compare_eth(neigh_node->addr, tmp_neigh_node->addr))) {
318 interference_candidate = 1;
323 /* don't care further if it is an interference candidate */
324 if (interference_candidate)
327 /* this neighbor already is part of our candidate list */
328 if (!list_empty(&neigh_node->bonding_list))
331 if (!atomic_inc_not_zero(&neigh_node->refcount))
334 list_add_rcu(&neigh_node->bonding_list, &orig_node->bond_list);
335 atomic_inc(&orig_node->bond_candidates);
339 bonding_candidate_del(orig_node, neigh_node);
342 spin_unlock_bh(&orig_node->neigh_list_lock);
345 neigh_node_free_ref(router);
348 /* copy primary address for bonding */
349 static void bonding_save_primary(const struct orig_node *orig_node,
350 struct orig_node *orig_neigh_node,
351 const struct batman_packet *batman_packet)
353 if (!(batman_packet->flags & PRIMARIES_FIRST_HOP))
356 memcpy(orig_neigh_node->primary_addr, orig_node->orig, ETH_ALEN);
359 static void update_orig(struct bat_priv *bat_priv, struct orig_node *orig_node,
360 const struct ethhdr *ethhdr,
361 const struct batman_packet *batman_packet,
362 struct hard_iface *if_incoming,
363 const unsigned char *tt_buff, int tt_buff_len,
366 struct neigh_node *neigh_node = NULL, *tmp_neigh_node = NULL;
367 struct neigh_node *router = NULL;
368 struct orig_node *orig_node_tmp;
369 struct hlist_node *node;
371 uint8_t bcast_own_sum_orig, bcast_own_sum_neigh;
373 bat_dbg(DBG_BATMAN, bat_priv, "update_originator(): "
374 "Searching and updating originator entry of received packet\n");
377 hlist_for_each_entry_rcu(tmp_neigh_node, node,
378 &orig_node->neigh_list, list) {
379 if (compare_eth(tmp_neigh_node->addr, ethhdr->h_source) &&
380 (tmp_neigh_node->if_incoming == if_incoming) &&
381 atomic_inc_not_zero(&tmp_neigh_node->refcount)) {
383 neigh_node_free_ref(neigh_node);
384 neigh_node = tmp_neigh_node;
391 spin_lock_bh(&tmp_neigh_node->tq_lock);
392 ring_buffer_set(tmp_neigh_node->tq_recv,
393 &tmp_neigh_node->tq_index, 0);
394 tmp_neigh_node->tq_avg =
395 ring_buffer_avg(tmp_neigh_node->tq_recv);
396 spin_unlock_bh(&tmp_neigh_node->tq_lock);
400 struct orig_node *orig_tmp;
402 orig_tmp = get_orig_node(bat_priv, ethhdr->h_source);
406 neigh_node = create_neighbor(orig_node, orig_tmp,
407 ethhdr->h_source, if_incoming);
409 orig_node_free_ref(orig_tmp);
413 bat_dbg(DBG_BATMAN, bat_priv,
414 "Updating existing last-hop neighbor of originator\n");
418 orig_node->flags = batman_packet->flags;
419 neigh_node->last_valid = jiffies;
421 spin_lock_bh(&neigh_node->tq_lock);
422 ring_buffer_set(neigh_node->tq_recv,
423 &neigh_node->tq_index,
425 neigh_node->tq_avg = ring_buffer_avg(neigh_node->tq_recv);
426 spin_unlock_bh(&neigh_node->tq_lock);
429 orig_node->last_ttl = batman_packet->ttl;
430 neigh_node->last_ttl = batman_packet->ttl;
433 bonding_candidate_add(orig_node, neigh_node);
435 tmp_tt_buff_len = (tt_buff_len > batman_packet->num_tt * ETH_ALEN ?
436 batman_packet->num_tt * ETH_ALEN : tt_buff_len);
438 /* if this neighbor already is our next hop there is nothing
440 router = orig_node_get_router(orig_node);
441 if (router == neigh_node)
444 /* if this neighbor does not offer a better TQ we won't consider it */
445 if (router && (router->tq_avg > neigh_node->tq_avg))
448 /* if the TQ is the same and the link not more symetric we
449 * won't consider it either */
450 if (router && (neigh_node->tq_avg == router->tq_avg)) {
451 orig_node_tmp = router->orig_node;
452 spin_lock_bh(&orig_node_tmp->ogm_cnt_lock);
454 orig_node_tmp->bcast_own_sum[if_incoming->if_num];
455 spin_unlock_bh(&orig_node_tmp->ogm_cnt_lock);
457 orig_node_tmp = neigh_node->orig_node;
458 spin_lock_bh(&orig_node_tmp->ogm_cnt_lock);
459 bcast_own_sum_neigh =
460 orig_node_tmp->bcast_own_sum[if_incoming->if_num];
461 spin_unlock_bh(&orig_node_tmp->ogm_cnt_lock);
463 if (bcast_own_sum_orig >= bcast_own_sum_neigh)
467 update_routes(bat_priv, orig_node, neigh_node,
468 tt_buff, tmp_tt_buff_len);
472 update_routes(bat_priv, orig_node, router,
473 tt_buff, tmp_tt_buff_len);
476 if (orig_node->gw_flags != batman_packet->gw_flags)
477 gw_node_update(bat_priv, orig_node, batman_packet->gw_flags);
479 orig_node->gw_flags = batman_packet->gw_flags;
481 /* restart gateway selection if fast or late switching was enabled */
482 if ((orig_node->gw_flags) &&
483 (atomic_read(&bat_priv->gw_mode) == GW_MODE_CLIENT) &&
484 (atomic_read(&bat_priv->gw_sel_class) > 2))
485 gw_check_election(bat_priv, orig_node);
493 neigh_node_free_ref(neigh_node);
495 neigh_node_free_ref(router);
498 /* checks whether the host restarted and is in the protection time.
500 * 0 if the packet is to be accepted
501 * 1 if the packet is to be ignored.
503 static int window_protected(struct bat_priv *bat_priv,
504 int32_t seq_num_diff,
505 unsigned long *last_reset)
507 if ((seq_num_diff <= -TQ_LOCAL_WINDOW_SIZE)
508 || (seq_num_diff >= EXPECTED_SEQNO_RANGE)) {
509 if (time_after(jiffies, *last_reset +
510 msecs_to_jiffies(RESET_PROTECTION_MS))) {
512 *last_reset = jiffies;
513 bat_dbg(DBG_BATMAN, bat_priv,
514 "old packet received, start protection\n");
523 /* processes a batman packet for all interfaces, adjusts the sequence number and
524 * finds out whether it is a duplicate.
526 * 1 the packet is a duplicate
527 * 0 the packet has not yet been received
528 * -1 the packet is old and has been received while the seqno window
529 * was protected. Caller should drop it.
531 static char count_real_packets(const struct ethhdr *ethhdr,
532 const struct batman_packet *batman_packet,
533 const struct hard_iface *if_incoming)
535 struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface);
536 struct orig_node *orig_node;
537 struct neigh_node *tmp_neigh_node;
538 struct hlist_node *node;
539 char is_duplicate = 0;
542 int set_mark, ret = -1;
544 orig_node = get_orig_node(bat_priv, batman_packet->orig);
548 spin_lock_bh(&orig_node->ogm_cnt_lock);
549 seq_diff = batman_packet->seqno - orig_node->last_real_seqno;
551 /* signalize caller that the packet is to be dropped. */
552 if (window_protected(bat_priv, seq_diff,
553 &orig_node->batman_seqno_reset))
557 hlist_for_each_entry_rcu(tmp_neigh_node, node,
558 &orig_node->neigh_list, list) {
560 is_duplicate |= get_bit_status(tmp_neigh_node->real_bits,
561 orig_node->last_real_seqno,
562 batman_packet->seqno);
564 if (compare_eth(tmp_neigh_node->addr, ethhdr->h_source) &&
565 (tmp_neigh_node->if_incoming == if_incoming))
570 /* if the window moved, set the update flag. */
571 need_update |= bit_get_packet(bat_priv,
572 tmp_neigh_node->real_bits,
575 tmp_neigh_node->real_packet_count =
576 bit_packet_count(tmp_neigh_node->real_bits);
581 bat_dbg(DBG_BATMAN, bat_priv,
582 "updating last_seqno: old %d, new %d\n",
583 orig_node->last_real_seqno, batman_packet->seqno);
584 orig_node->last_real_seqno = batman_packet->seqno;
590 spin_unlock_bh(&orig_node->ogm_cnt_lock);
591 orig_node_free_ref(orig_node);
595 void receive_bat_packet(const struct ethhdr *ethhdr,
596 struct batman_packet *batman_packet,
597 const unsigned char *tt_buff, int tt_buff_len,
598 struct hard_iface *if_incoming)
600 struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface);
601 struct hard_iface *hard_iface;
602 struct orig_node *orig_neigh_node, *orig_node;
603 struct neigh_node *router = NULL, *router_router = NULL;
604 struct neigh_node *orig_neigh_router = NULL;
605 char has_directlink_flag;
606 char is_my_addr = 0, is_my_orig = 0, is_my_oldorig = 0;
607 char is_broadcast = 0, is_bidirectional, is_single_hop_neigh;
609 uint32_t if_incoming_seqno;
611 /* Silently drop when the batman packet is actually not a
614 * This might happen if a packet is padded (e.g. Ethernet has a
615 * minimum frame length of 64 byte) and the aggregation interprets
616 * it as an additional length.
618 * TODO: A more sane solution would be to have a bit in the
619 * batman_packet to detect whether the packet is the last
620 * packet in an aggregation. Here we expect that the padding
621 * is always zero (or not 0x01)
623 if (batman_packet->packet_type != BAT_PACKET)
626 /* could be changed by schedule_own_packet() */
627 if_incoming_seqno = atomic_read(&if_incoming->seqno);
629 has_directlink_flag = (batman_packet->flags & DIRECTLINK ? 1 : 0);
631 is_single_hop_neigh = (compare_eth(ethhdr->h_source,
632 batman_packet->orig) ? 1 : 0);
634 bat_dbg(DBG_BATMAN, bat_priv,
635 "Received BATMAN packet via NB: %pM, IF: %s [%pM] "
636 "(from OG: %pM, via prev OG: %pM, seqno %d, tq %d, "
637 "TTL %d, V %d, IDF %d)\n",
638 ethhdr->h_source, if_incoming->net_dev->name,
639 if_incoming->net_dev->dev_addr, batman_packet->orig,
640 batman_packet->prev_sender, batman_packet->seqno,
641 batman_packet->tq, batman_packet->ttl, batman_packet->version,
642 has_directlink_flag);
645 list_for_each_entry_rcu(hard_iface, &hardif_list, list) {
646 if (hard_iface->if_status != IF_ACTIVE)
649 if (hard_iface->soft_iface != if_incoming->soft_iface)
652 if (compare_eth(ethhdr->h_source,
653 hard_iface->net_dev->dev_addr))
656 if (compare_eth(batman_packet->orig,
657 hard_iface->net_dev->dev_addr))
660 if (compare_eth(batman_packet->prev_sender,
661 hard_iface->net_dev->dev_addr))
664 if (is_broadcast_ether_addr(ethhdr->h_source))
669 if (batman_packet->version != COMPAT_VERSION) {
670 bat_dbg(DBG_BATMAN, bat_priv,
671 "Drop packet: incompatible batman version (%i)\n",
672 batman_packet->version);
677 bat_dbg(DBG_BATMAN, bat_priv,
678 "Drop packet: received my own broadcast (sender: %pM"
685 bat_dbg(DBG_BATMAN, bat_priv, "Drop packet: "
686 "ignoring all packets with broadcast source addr (sender: %pM"
687 ")\n", ethhdr->h_source);
695 orig_neigh_node = get_orig_node(bat_priv, ethhdr->h_source);
696 if (!orig_neigh_node)
699 /* neighbor has to indicate direct link and it has to
700 * come via the corresponding interface */
701 /* if received seqno equals last send seqno save new
702 * seqno for bidirectional check */
703 if (has_directlink_flag &&
704 compare_eth(if_incoming->net_dev->dev_addr,
705 batman_packet->orig) &&
706 (batman_packet->seqno - if_incoming_seqno + 2 == 0)) {
707 offset = if_incoming->if_num * NUM_WORDS;
709 spin_lock_bh(&orig_neigh_node->ogm_cnt_lock);
710 word = &(orig_neigh_node->bcast_own[offset]);
712 orig_neigh_node->bcast_own_sum[if_incoming->if_num] =
713 bit_packet_count(word);
714 spin_unlock_bh(&orig_neigh_node->ogm_cnt_lock);
717 bat_dbg(DBG_BATMAN, bat_priv, "Drop packet: "
718 "originator packet from myself (via neighbor)\n");
719 orig_node_free_ref(orig_neigh_node);
724 bat_dbg(DBG_BATMAN, bat_priv,
725 "Drop packet: ignoring all rebroadcast echos (sender: "
726 "%pM)\n", ethhdr->h_source);
730 orig_node = get_orig_node(bat_priv, batman_packet->orig);
734 is_duplicate = count_real_packets(ethhdr, batman_packet, if_incoming);
736 if (is_duplicate == -1) {
737 bat_dbg(DBG_BATMAN, bat_priv,
738 "Drop packet: packet within seqno protection time "
739 "(sender: %pM)\n", ethhdr->h_source);
743 if (batman_packet->tq == 0) {
744 bat_dbg(DBG_BATMAN, bat_priv,
745 "Drop packet: originator packet with tq equal 0\n");
749 router = orig_node_get_router(orig_node);
751 router_router = orig_node_get_router(router->orig_node);
753 /* avoid temporary routing loops */
754 if (router && router_router &&
755 (compare_eth(router->addr, batman_packet->prev_sender)) &&
756 !(compare_eth(batman_packet->orig, batman_packet->prev_sender)) &&
757 (compare_eth(router->addr, router_router->addr))) {
758 bat_dbg(DBG_BATMAN, bat_priv,
759 "Drop packet: ignoring all rebroadcast packets that "
760 "may make me loop (sender: %pM)\n", ethhdr->h_source);
764 /* if sender is a direct neighbor the sender mac equals
766 orig_neigh_node = (is_single_hop_neigh ?
768 get_orig_node(bat_priv, ethhdr->h_source));
769 if (!orig_neigh_node)
772 orig_neigh_router = orig_node_get_router(orig_neigh_node);
774 /* drop packet if sender is not a direct neighbor and if we
775 * don't route towards it */
776 if (!is_single_hop_neigh && (!orig_neigh_router)) {
777 bat_dbg(DBG_BATMAN, bat_priv,
778 "Drop packet: OGM via unknown neighbor!\n");
782 is_bidirectional = is_bidirectional_neigh(orig_node, orig_neigh_node,
783 batman_packet, if_incoming);
785 bonding_save_primary(orig_node, orig_neigh_node, batman_packet);
787 /* update ranking if it is not a duplicate or has the same
788 * seqno and similar ttl as the non-duplicate */
789 if (is_bidirectional &&
791 ((orig_node->last_real_seqno == batman_packet->seqno) &&
792 (orig_node->last_ttl - 3 <= batman_packet->ttl))))
793 update_orig(bat_priv, orig_node, ethhdr, batman_packet,
794 if_incoming, tt_buff, tt_buff_len, is_duplicate);
796 /* is single hop (direct) neighbor */
797 if (is_single_hop_neigh) {
799 /* mark direct link on incoming interface */
800 schedule_forward_packet(orig_node, ethhdr, batman_packet,
801 1, tt_buff_len, if_incoming);
803 bat_dbg(DBG_BATMAN, bat_priv, "Forwarding packet: "
804 "rebroadcast neighbor packet with direct link flag\n");
808 /* multihop originator */
809 if (!is_bidirectional) {
810 bat_dbg(DBG_BATMAN, bat_priv,
811 "Drop packet: not received via bidirectional link\n");
816 bat_dbg(DBG_BATMAN, bat_priv,
817 "Drop packet: duplicate packet received\n");
821 bat_dbg(DBG_BATMAN, bat_priv,
822 "Forwarding packet: rebroadcast originator packet\n");
823 schedule_forward_packet(orig_node, ethhdr, batman_packet,
824 0, tt_buff_len, if_incoming);
827 if ((orig_neigh_node) && (!is_single_hop_neigh))
828 orig_node_free_ref(orig_neigh_node);
831 neigh_node_free_ref(router);
833 neigh_node_free_ref(router_router);
834 if (orig_neigh_router)
835 neigh_node_free_ref(orig_neigh_router);
837 orig_node_free_ref(orig_node);
840 int recv_bat_packet(struct sk_buff *skb, struct hard_iface *hard_iface)
842 struct ethhdr *ethhdr;
844 /* drop packet if it has not necessary minimum size */
845 if (unlikely(!pskb_may_pull(skb, sizeof(struct batman_packet))))
848 ethhdr = (struct ethhdr *)skb_mac_header(skb);
850 /* packet with broadcast indication but unicast recipient */
851 if (!is_broadcast_ether_addr(ethhdr->h_dest))
854 /* packet with broadcast sender address */
855 if (is_broadcast_ether_addr(ethhdr->h_source))
858 /* create a copy of the skb, if needed, to modify it. */
859 if (skb_cow(skb, 0) < 0)
862 /* keep skb linear */
863 if (skb_linearize(skb) < 0)
866 ethhdr = (struct ethhdr *)skb_mac_header(skb);
868 receive_aggr_bat_packet(ethhdr,
874 return NET_RX_SUCCESS;
877 static int recv_my_icmp_packet(struct bat_priv *bat_priv,
878 struct sk_buff *skb, size_t icmp_len)
880 struct hard_iface *primary_if = NULL;
881 struct orig_node *orig_node = NULL;
882 struct neigh_node *router = NULL;
883 struct icmp_packet_rr *icmp_packet;
884 int ret = NET_RX_DROP;
886 icmp_packet = (struct icmp_packet_rr *)skb->data;
888 /* add data to device queue */
889 if (icmp_packet->msg_type != ECHO_REQUEST) {
890 bat_socket_receive_packet(icmp_packet, icmp_len);
894 primary_if = primary_if_get_selected(bat_priv);
898 /* answer echo request (ping) */
899 /* get routing information */
900 orig_node = orig_hash_find(bat_priv, icmp_packet->orig);
904 router = orig_node_get_router(orig_node);
908 /* create a copy of the skb, if needed, to modify it. */
909 if (skb_cow(skb, sizeof(struct ethhdr)) < 0)
912 icmp_packet = (struct icmp_packet_rr *)skb->data;
914 memcpy(icmp_packet->dst, icmp_packet->orig, ETH_ALEN);
915 memcpy(icmp_packet->orig, primary_if->net_dev->dev_addr, ETH_ALEN);
916 icmp_packet->msg_type = ECHO_REPLY;
917 icmp_packet->ttl = TTL;
919 send_skb_packet(skb, router->if_incoming, router->addr);
920 ret = NET_RX_SUCCESS;
924 hardif_free_ref(primary_if);
926 neigh_node_free_ref(router);
928 orig_node_free_ref(orig_node);
932 static int recv_icmp_ttl_exceeded(struct bat_priv *bat_priv,
935 struct hard_iface *primary_if = NULL;
936 struct orig_node *orig_node = NULL;
937 struct neigh_node *router = NULL;
938 struct icmp_packet *icmp_packet;
939 int ret = NET_RX_DROP;
941 icmp_packet = (struct icmp_packet *)skb->data;
943 /* send TTL exceeded if packet is an echo request (traceroute) */
944 if (icmp_packet->msg_type != ECHO_REQUEST) {
945 pr_debug("Warning - can't forward icmp packet from %pM to "
946 "%pM: ttl exceeded\n", icmp_packet->orig,
951 primary_if = primary_if_get_selected(bat_priv);
955 /* get routing information */
956 orig_node = orig_hash_find(bat_priv, icmp_packet->orig);
960 router = orig_node_get_router(orig_node);
964 /* create a copy of the skb, if needed, to modify it. */
965 if (skb_cow(skb, sizeof(struct ethhdr)) < 0)
968 icmp_packet = (struct icmp_packet *)skb->data;
970 memcpy(icmp_packet->dst, icmp_packet->orig, ETH_ALEN);
971 memcpy(icmp_packet->orig, primary_if->net_dev->dev_addr, ETH_ALEN);
972 icmp_packet->msg_type = TTL_EXCEEDED;
973 icmp_packet->ttl = TTL;
975 send_skb_packet(skb, router->if_incoming, router->addr);
976 ret = NET_RX_SUCCESS;
980 hardif_free_ref(primary_if);
982 neigh_node_free_ref(router);
984 orig_node_free_ref(orig_node);
989 int recv_icmp_packet(struct sk_buff *skb, struct hard_iface *recv_if)
991 struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
992 struct icmp_packet_rr *icmp_packet;
993 struct ethhdr *ethhdr;
994 struct orig_node *orig_node = NULL;
995 struct neigh_node *router = NULL;
996 int hdr_size = sizeof(struct icmp_packet);
997 int ret = NET_RX_DROP;
1000 * we truncate all incoming icmp packets if they don't match our size
1002 if (skb->len >= sizeof(struct icmp_packet_rr))
1003 hdr_size = sizeof(struct icmp_packet_rr);
1005 /* drop packet if it has not necessary minimum size */
1006 if (unlikely(!pskb_may_pull(skb, hdr_size)))
1009 ethhdr = (struct ethhdr *)skb_mac_header(skb);
1011 /* packet with unicast indication but broadcast recipient */
1012 if (is_broadcast_ether_addr(ethhdr->h_dest))
1015 /* packet with broadcast sender address */
1016 if (is_broadcast_ether_addr(ethhdr->h_source))
1020 if (!is_my_mac(ethhdr->h_dest))
1023 icmp_packet = (struct icmp_packet_rr *)skb->data;
1025 /* add record route information if not full */
1026 if ((hdr_size == sizeof(struct icmp_packet_rr)) &&
1027 (icmp_packet->rr_cur < BAT_RR_LEN)) {
1028 memcpy(&(icmp_packet->rr[icmp_packet->rr_cur]),
1029 ethhdr->h_dest, ETH_ALEN);
1030 icmp_packet->rr_cur++;
1034 if (is_my_mac(icmp_packet->dst))
1035 return recv_my_icmp_packet(bat_priv, skb, hdr_size);
1038 if (icmp_packet->ttl < 2)
1039 return recv_icmp_ttl_exceeded(bat_priv, skb);
1041 /* get routing information */
1042 orig_node = orig_hash_find(bat_priv, icmp_packet->dst);
1046 router = orig_node_get_router(orig_node);
1050 /* create a copy of the skb, if needed, to modify it. */
1051 if (skb_cow(skb, sizeof(struct ethhdr)) < 0)
1054 icmp_packet = (struct icmp_packet_rr *)skb->data;
1060 send_skb_packet(skb, router->if_incoming, router->addr);
1061 ret = NET_RX_SUCCESS;
1065 neigh_node_free_ref(router);
1067 orig_node_free_ref(orig_node);
1071 /* In the bonding case, send the packets in a round
1072 * robin fashion over the remaining interfaces.
1074 * This method rotates the bonding list and increases the
1075 * returned router's refcount. */
1076 static struct neigh_node *find_bond_router(struct orig_node *primary_orig,
1077 const struct hard_iface *recv_if)
1079 struct neigh_node *tmp_neigh_node;
1080 struct neigh_node *router = NULL, *first_candidate = NULL;
1083 list_for_each_entry_rcu(tmp_neigh_node, &primary_orig->bond_list,
1085 if (!first_candidate)
1086 first_candidate = tmp_neigh_node;
1088 /* recv_if == NULL on the first node. */
1089 if (tmp_neigh_node->if_incoming == recv_if)
1092 if (!atomic_inc_not_zero(&tmp_neigh_node->refcount))
1095 router = tmp_neigh_node;
1099 /* use the first candidate if nothing was found. */
1100 if (!router && first_candidate &&
1101 atomic_inc_not_zero(&first_candidate->refcount))
1102 router = first_candidate;
1107 /* selected should point to the next element
1108 * after the current router */
1109 spin_lock_bh(&primary_orig->neigh_list_lock);
1110 /* this is a list_move(), which unfortunately
1111 * does not exist as rcu version */
1112 list_del_rcu(&primary_orig->bond_list);
1113 list_add_rcu(&primary_orig->bond_list,
1114 &router->bonding_list);
1115 spin_unlock_bh(&primary_orig->neigh_list_lock);
1122 /* Interface Alternating: Use the best of the
1123 * remaining candidates which are not using
1126 * Increases the returned router's refcount */
1127 static struct neigh_node *find_ifalter_router(struct orig_node *primary_orig,
1128 const struct hard_iface *recv_if)
1130 struct neigh_node *tmp_neigh_node;
1131 struct neigh_node *router = NULL, *first_candidate = NULL;
1134 list_for_each_entry_rcu(tmp_neigh_node, &primary_orig->bond_list,
1136 if (!first_candidate)
1137 first_candidate = tmp_neigh_node;
1139 /* recv_if == NULL on the first node. */
1140 if (tmp_neigh_node->if_incoming == recv_if)
1143 if (!atomic_inc_not_zero(&tmp_neigh_node->refcount))
1146 /* if we don't have a router yet
1147 * or this one is better, choose it. */
1149 (tmp_neigh_node->tq_avg > router->tq_avg)) {
1150 /* decrement refcount of
1151 * previously selected router */
1153 neigh_node_free_ref(router);
1155 router = tmp_neigh_node;
1156 atomic_inc_not_zero(&router->refcount);
1159 neigh_node_free_ref(tmp_neigh_node);
1162 /* use the first candidate if nothing was found. */
1163 if (!router && first_candidate &&
1164 atomic_inc_not_zero(&first_candidate->refcount))
1165 router = first_candidate;
1171 /* find a suitable router for this originator, and use
1172 * bonding if possible. increases the found neighbors
1174 struct neigh_node *find_router(struct bat_priv *bat_priv,
1175 struct orig_node *orig_node,
1176 const struct hard_iface *recv_if)
1178 struct orig_node *primary_orig_node;
1179 struct orig_node *router_orig;
1180 struct neigh_node *router;
1181 static uint8_t zero_mac[ETH_ALEN] = {0, 0, 0, 0, 0, 0};
1182 int bonding_enabled;
1187 router = orig_node_get_router(orig_node);
1191 /* without bonding, the first node should
1192 * always choose the default router. */
1193 bonding_enabled = atomic_read(&bat_priv->bonding);
1196 /* select default router to output */
1197 router_orig = router->orig_node;
1201 if ((!recv_if) && (!bonding_enabled))
1204 /* if we have something in the primary_addr, we can search
1205 * for a potential bonding candidate. */
1206 if (compare_eth(router_orig->primary_addr, zero_mac))
1209 /* find the orig_node which has the primary interface. might
1210 * even be the same as our router_orig in many cases */
1212 if (compare_eth(router_orig->primary_addr, router_orig->orig)) {
1213 primary_orig_node = router_orig;
1215 primary_orig_node = orig_hash_find(bat_priv,
1216 router_orig->primary_addr);
1217 if (!primary_orig_node)
1220 orig_node_free_ref(primary_orig_node);
1223 /* with less than 2 candidates, we can't do any
1224 * bonding and prefer the original router. */
1225 if (atomic_read(&primary_orig_node->bond_candidates) < 2)
1228 /* all nodes between should choose a candidate which
1229 * is is not on the interface where the packet came
1232 neigh_node_free_ref(router);
1234 if (bonding_enabled)
1235 router = find_bond_router(primary_orig_node, recv_if);
1237 router = find_ifalter_router(primary_orig_node, recv_if);
1240 if (router && router->if_incoming->if_status != IF_ACTIVE)
1249 neigh_node_free_ref(router);
1253 static int check_unicast_packet(struct sk_buff *skb, int hdr_size)
1255 struct ethhdr *ethhdr;
1257 /* drop packet if it has not necessary minimum size */
1258 if (unlikely(!pskb_may_pull(skb, hdr_size)))
1261 ethhdr = (struct ethhdr *)skb_mac_header(skb);
1263 /* packet with unicast indication but broadcast recipient */
1264 if (is_broadcast_ether_addr(ethhdr->h_dest))
1267 /* packet with broadcast sender address */
1268 if (is_broadcast_ether_addr(ethhdr->h_source))
1272 if (!is_my_mac(ethhdr->h_dest))
1278 int route_unicast_packet(struct sk_buff *skb, struct hard_iface *recv_if)
1280 struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
1281 struct orig_node *orig_node = NULL;
1282 struct neigh_node *neigh_node = NULL;
1283 struct unicast_packet *unicast_packet;
1284 struct ethhdr *ethhdr = (struct ethhdr *)skb_mac_header(skb);
1285 int ret = NET_RX_DROP;
1286 struct sk_buff *new_skb;
1288 unicast_packet = (struct unicast_packet *)skb->data;
1291 if (unicast_packet->ttl < 2) {
1292 pr_debug("Warning - can't forward unicast packet from %pM to "
1293 "%pM: ttl exceeded\n", ethhdr->h_source,
1294 unicast_packet->dest);
1298 /* get routing information */
1299 orig_node = orig_hash_find(bat_priv, unicast_packet->dest);
1304 /* find_router() increases neigh_nodes refcount if found. */
1305 neigh_node = find_router(bat_priv, orig_node, recv_if);
1310 /* create a copy of the skb, if needed, to modify it. */
1311 if (skb_cow(skb, sizeof(struct ethhdr)) < 0)
1314 unicast_packet = (struct unicast_packet *)skb->data;
1316 if (unicast_packet->packet_type == BAT_UNICAST &&
1317 atomic_read(&bat_priv->fragmentation) &&
1318 skb->len > neigh_node->if_incoming->net_dev->mtu) {
1319 ret = frag_send_skb(skb, bat_priv,
1320 neigh_node->if_incoming, neigh_node->addr);
1324 if (unicast_packet->packet_type == BAT_UNICAST_FRAG &&
1325 frag_can_reassemble(skb, neigh_node->if_incoming->net_dev->mtu)) {
1327 ret = frag_reassemble_skb(skb, bat_priv, &new_skb);
1329 if (ret == NET_RX_DROP)
1332 /* packet was buffered for late merge */
1334 ret = NET_RX_SUCCESS;
1339 unicast_packet = (struct unicast_packet *)skb->data;
1343 unicast_packet->ttl--;
1346 send_skb_packet(skb, neigh_node->if_incoming, neigh_node->addr);
1347 ret = NET_RX_SUCCESS;
1351 neigh_node_free_ref(neigh_node);
1353 orig_node_free_ref(orig_node);
1357 int recv_unicast_packet(struct sk_buff *skb, struct hard_iface *recv_if)
1359 struct unicast_packet *unicast_packet;
1360 int hdr_size = sizeof(*unicast_packet);
1362 if (check_unicast_packet(skb, hdr_size) < 0)
1365 unicast_packet = (struct unicast_packet *)skb->data;
1368 if (is_my_mac(unicast_packet->dest)) {
1369 interface_rx(recv_if->soft_iface, skb, recv_if, hdr_size);
1370 return NET_RX_SUCCESS;
1373 return route_unicast_packet(skb, recv_if);
1376 int recv_ucast_frag_packet(struct sk_buff *skb, struct hard_iface *recv_if)
1378 struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
1379 struct unicast_frag_packet *unicast_packet;
1380 int hdr_size = sizeof(*unicast_packet);
1381 struct sk_buff *new_skb = NULL;
1384 if (check_unicast_packet(skb, hdr_size) < 0)
1387 unicast_packet = (struct unicast_frag_packet *)skb->data;
1390 if (is_my_mac(unicast_packet->dest)) {
1392 ret = frag_reassemble_skb(skb, bat_priv, &new_skb);
1394 if (ret == NET_RX_DROP)
1397 /* packet was buffered for late merge */
1399 return NET_RX_SUCCESS;
1401 interface_rx(recv_if->soft_iface, new_skb, recv_if,
1402 sizeof(struct unicast_packet));
1403 return NET_RX_SUCCESS;
1406 return route_unicast_packet(skb, recv_if);
1410 int recv_bcast_packet(struct sk_buff *skb, struct hard_iface *recv_if)
1412 struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
1413 struct orig_node *orig_node = NULL;
1414 struct bcast_packet *bcast_packet;
1415 struct ethhdr *ethhdr;
1416 int hdr_size = sizeof(*bcast_packet);
1417 int ret = NET_RX_DROP;
1420 /* drop packet if it has not necessary minimum size */
1421 if (unlikely(!pskb_may_pull(skb, hdr_size)))
1424 ethhdr = (struct ethhdr *)skb_mac_header(skb);
1426 /* packet with broadcast indication but unicast recipient */
1427 if (!is_broadcast_ether_addr(ethhdr->h_dest))
1430 /* packet with broadcast sender address */
1431 if (is_broadcast_ether_addr(ethhdr->h_source))
1434 /* ignore broadcasts sent by myself */
1435 if (is_my_mac(ethhdr->h_source))
1438 bcast_packet = (struct bcast_packet *)skb->data;
1440 /* ignore broadcasts originated by myself */
1441 if (is_my_mac(bcast_packet->orig))
1444 if (bcast_packet->ttl < 2)
1447 orig_node = orig_hash_find(bat_priv, bcast_packet->orig);
1452 spin_lock_bh(&orig_node->bcast_seqno_lock);
1454 /* check whether the packet is a duplicate */
1455 if (get_bit_status(orig_node->bcast_bits, orig_node->last_bcast_seqno,
1456 ntohl(bcast_packet->seqno)))
1459 seq_diff = ntohl(bcast_packet->seqno) - orig_node->last_bcast_seqno;
1461 /* check whether the packet is old and the host just restarted. */
1462 if (window_protected(bat_priv, seq_diff,
1463 &orig_node->bcast_seqno_reset))
1466 /* mark broadcast in flood history, update window position
1468 if (bit_get_packet(bat_priv, orig_node->bcast_bits, seq_diff, 1))
1469 orig_node->last_bcast_seqno = ntohl(bcast_packet->seqno);
1471 spin_unlock_bh(&orig_node->bcast_seqno_lock);
1473 /* rebroadcast packet */
1474 add_bcast_packet_to_list(bat_priv, skb);
1476 /* broadcast for me */
1477 interface_rx(recv_if->soft_iface, skb, recv_if, hdr_size);
1478 ret = NET_RX_SUCCESS;
1482 spin_unlock_bh(&orig_node->bcast_seqno_lock);
1485 orig_node_free_ref(orig_node);
1489 int recv_vis_packet(struct sk_buff *skb, struct hard_iface *recv_if)
1491 struct vis_packet *vis_packet;
1492 struct ethhdr *ethhdr;
1493 struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
1494 int hdr_size = sizeof(*vis_packet);
1496 /* keep skb linear */
1497 if (skb_linearize(skb) < 0)
1500 if (unlikely(!pskb_may_pull(skb, hdr_size)))
1503 vis_packet = (struct vis_packet *)skb->data;
1504 ethhdr = (struct ethhdr *)skb_mac_header(skb);
1507 if (!is_my_mac(ethhdr->h_dest))
1510 /* ignore own packets */
1511 if (is_my_mac(vis_packet->vis_orig))
1514 if (is_my_mac(vis_packet->sender_orig))
1517 switch (vis_packet->vis_type) {
1518 case VIS_TYPE_SERVER_SYNC:
1519 receive_server_sync_packet(bat_priv, vis_packet,
1523 case VIS_TYPE_CLIENT_UPDATE:
1524 receive_client_update_packet(bat_priv, vis_packet,
1528 default: /* ignore unknown packet */
1532 /* We take a copy of the data in the packet, so we should
1533 always free the skbuf. */