routing.c 47.1 KB
Newer Older
1
/*
2
 * Copyright (C) 2007-2011 B.A.T.M.A.N. contributors:
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37
 *
 * Marek Lindner, Simon Wunderlich
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of version 2 of the GNU General Public
 * License as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
 * General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
 * 02110-1301, USA
 *
 */

#include "main.h"
#include "routing.h"
#include "send.h"
#include "hash.h"
#include "soft-interface.h"
#include "hard-interface.h"
#include "icmp_socket.h"
#include "translation-table.h"
#include "originator.h"
#include "ring_buffer.h"
#include "vis.h"
#include "aggregation.h"
#include "gateway_common.h"
#include "gateway_client.h"
#include "unicast.h"

38
void slide_own_bcast_window(struct hard_iface *hard_iface)
39
{
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 44 45 46 47 48 49 50 51
	struct hlist_head *head;
	struct orig_node *orig_node;
	unsigned long *word;
	int i;
	size_t word_index;

	for (i = 0; i < hash->size; i++) {
		head = &hash->table[i];

52
		rcu_read_lock();
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 57 58
			word = &(orig_node->bcast_own[word_index]);

			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);
62
		}
63
		rcu_read_unlock();
64 65 66
	}
}

67 68 69 70 71
static void update_transtable(struct bat_priv *bat_priv,
			      struct orig_node *orig_node,
			      const unsigned char *tt_buff,
			      uint8_t tt_num_changes, uint8_t ttvn,
			      uint16_t tt_crc)
72
{
73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93
	uint8_t orig_ttvn = (uint8_t)atomic_read(&orig_node->last_ttvn);
	bool full_table = true;

	/* the ttvn increased by one -> we can apply the attached changes */
	if (ttvn - orig_ttvn == 1) {
		/* the OGM could not contain the changes because they were too
		 * many to fit in one frame or because they have already been
		 * sent TT_OGM_APPEND_MAX times. In this case send a tt
		 * request */
		if (!tt_num_changes) {
			full_table = false;
			goto request_table;
		}

		tt_update_changes(bat_priv, orig_node, tt_num_changes, ttvn,
				  (struct tt_change *)tt_buff);

		/* Even if we received the crc into the OGM, we prefer
		 * to recompute it to spot any possible inconsistency
		 * in the global table */
		orig_node->tt_crc = tt_global_crc(bat_priv, orig_node);
94 95 96
		/* Roaming phase is over: tables are in sync again. I can
		 * unset the flag */
		orig_node->tt_poss_change = false;
97 98 99 100 101 102 103 104 105 106 107 108 109 110 111
	} else {
		/* if we missed more than one change or our tables are not
		 * in sync anymore -> request fresh tt data */
		if (ttvn != orig_ttvn || orig_node->tt_crc != tt_crc) {
request_table:
			bat_dbg(DBG_TT, bat_priv, "TT inconsistency for %pM. "
				"Need to retrieve the correct information "
				"(ttvn: %u last_ttvn: %u crc: %u last_crc: "
				"%u num_changes: %u)\n", orig_node->orig, ttvn,
				orig_ttvn, tt_crc, orig_node->tt_crc,
				tt_num_changes);
			send_tt_request(bat_priv, orig_node, ttvn, tt_crc,
					full_table);
			return;
		}
112 113 114
	}
}

115 116 117
static void update_route(struct bat_priv *bat_priv,
			 struct orig_node *orig_node,
			 struct neigh_node *neigh_node)
118
{
119 120 121
	struct neigh_node *curr_router;

	curr_router = orig_node_get_router(orig_node);
122

123
	/* route deleted */
124
	if ((curr_router) && (!neigh_node)) {
125 126
		bat_dbg(DBG_ROUTES, bat_priv, "Deleting route towards: %pM\n",
			orig_node->orig);
127
		tt_global_del_orig(bat_priv, orig_node,
128
				    "Deleted route towards originator");
129

130 131
	/* route added */
	} else if ((!curr_router) && (neigh_node)) {
132 133 134 135

		bat_dbg(DBG_ROUTES, bat_priv,
			"Adding route towards: %pM (via %pM)\n",
			orig_node->orig, neigh_node->addr);
136
	/* route changed */
137
	} else if (neigh_node && curr_router) {
138 139 140 141
		bat_dbg(DBG_ROUTES, bat_priv,
			"Changing route towards: %pM "
			"(now via %pM - was via %pM)\n",
			orig_node->orig, neigh_node->addr,
142
			curr_router->addr);
143 144
	}

145 146 147 148
	if (curr_router)
		neigh_node_free_ref(curr_router);

	/* increase refcount of new best neighbor */
149 150
	if (neigh_node && !atomic_inc_not_zero(&neigh_node->refcount))
		neigh_node = NULL;
151 152 153 154 155 156 157 158

	spin_lock_bh(&orig_node->neigh_list_lock);
	rcu_assign_pointer(orig_node->router, neigh_node);
	spin_unlock_bh(&orig_node->neigh_list_lock);

	/* decrease refcount of previous best neighbor */
	if (curr_router)
		neigh_node_free_ref(curr_router);
159 160 161
}

void update_routes(struct bat_priv *bat_priv, struct orig_node *orig_node,
162
		   struct neigh_node *neigh_node)
163
{
164
	struct neigh_node *router = NULL;
165 166

	if (!orig_node)
167 168 169
		goto out;

	router = orig_node_get_router(orig_node);
170

171
	if (router != neigh_node)
172
		update_route(bat_priv, orig_node, neigh_node);
173 174 175 176

out:
	if (router)
		neigh_node_free_ref(router);
177 178 179 180 181
}

static int is_bidirectional_neigh(struct orig_node *orig_node,
				struct orig_node *orig_neigh_node,
				struct batman_packet *batman_packet,
182
				struct hard_iface *if_incoming)
183 184
{
	struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface);
185
	struct neigh_node *neigh_node = NULL, *tmp_neigh_node;
186
	struct hlist_node *node;
187
	uint8_t total_count;
188 189
	uint8_t orig_eq_count, neigh_rq_count, tq_own;
	int tq_asym_penalty, ret = 0;
190

191 192 193 194
	/* find corresponding one hop neighbor */
	rcu_read_lock();
	hlist_for_each_entry_rcu(tmp_neigh_node, node,
				 &orig_neigh_node->neigh_list, list) {
195

196 197
		if (!compare_eth(tmp_neigh_node->addr, orig_neigh_node->orig))
			continue;
198

199 200
		if (tmp_neigh_node->if_incoming != if_incoming)
			continue;
201

202 203
		if (!atomic_inc_not_zero(&tmp_neigh_node->refcount))
			continue;
204

205 206 207 208
		neigh_node = tmp_neigh_node;
		break;
	}
	rcu_read_unlock();
209

210 211 212 213 214
	if (!neigh_node)
		neigh_node = create_neighbor(orig_neigh_node,
					     orig_neigh_node,
					     orig_neigh_node->orig,
					     if_incoming);
215

216 217
	if (!neigh_node)
		goto out;
218

219 220 221
	/* if orig_node is direct neighbour update neigh_node last_valid */
	if (orig_node == orig_neigh_node)
		neigh_node->last_valid = jiffies;
222 223 224

	orig_node->last_valid = jiffies;

225
	/* find packet count of corresponding one hop neighbor */
226 227 228 229 230
	spin_lock_bh(&orig_node->ogm_cnt_lock);
	orig_eq_count = orig_neigh_node->bcast_own_sum[if_incoming->if_num];
	neigh_rq_count = neigh_node->real_packet_count;
	spin_unlock_bh(&orig_node->ogm_cnt_lock);

231
	/* pay attention to not get a value bigger than 100 % */
232 233
	total_count = (orig_eq_count > neigh_rq_count ?
		       neigh_rq_count : orig_eq_count);
234 235 236 237

	/* if we have too few packets (too less data) we set tq_own to zero */
	/* if we receive too few packets it is not considered bidirectional */
	if ((total_count < TQ_LOCAL_BIDRECT_SEND_MINIMUM) ||
238 239
	    (neigh_rq_count < TQ_LOCAL_BIDRECT_RECV_MINIMUM))
		tq_own = 0;
240 241 242 243
	else
		/* neigh_node->real_packet_count is never zero as we
		 * only purge old information when getting new
		 * information */
244
		tq_own = (TQ_MAX_VALUE * total_count) /	neigh_rq_count;
245 246 247 248 249 250 251

	/*
	 * 1 - ((1-x) ** 3), normalized to TQ_MAX_VALUE this does
	 * affect the nearly-symmetric links only a little, but
	 * punishes asymmetric links more.  This will give a value
	 * between 0 and TQ_MAX_VALUE
	 */
252 253 254 255 256 257 258 259 260 261
	tq_asym_penalty = TQ_MAX_VALUE - (TQ_MAX_VALUE *
				(TQ_LOCAL_WINDOW_SIZE - neigh_rq_count) *
				(TQ_LOCAL_WINDOW_SIZE - neigh_rq_count) *
				(TQ_LOCAL_WINDOW_SIZE - neigh_rq_count)) /
					(TQ_LOCAL_WINDOW_SIZE *
					 TQ_LOCAL_WINDOW_SIZE *
					 TQ_LOCAL_WINDOW_SIZE);

	batman_packet->tq = ((batman_packet->tq * tq_own * tq_asym_penalty) /
						(TQ_MAX_VALUE * TQ_MAX_VALUE));
262 263 264 265 266 267 268

	bat_dbg(DBG_BATMAN, bat_priv,
		"bidirectional: "
		"orig = %-15pM neigh = %-15pM => own_bcast = %2i, "
		"real recv = %2i, local tq: %3i, asym_penalty: %3i, "
		"total tq: %3i\n",
		orig_node->orig, orig_neigh_node->orig, total_count,
269
		neigh_rq_count, tq_own,	tq_asym_penalty, batman_packet->tq);
270 271 272 273

	/* if link has the minimum required transmission quality
	 * consider it bidirectional */
	if (batman_packet->tq >= TQ_TOTAL_BIDRECT_LIMIT)
274 275 276 277
		ret = 1;

out:
	if (neigh_node)
278
		neigh_node_free_ref(neigh_node);
279
	return ret;
280 281
}

282 283 284 285 286 287 288 289 290 291
/* caller must hold the neigh_list_lock */
void bonding_candidate_del(struct orig_node *orig_node,
			   struct neigh_node *neigh_node)
{
	/* this neighbor is not part of our candidate list */
	if (list_empty(&neigh_node->bonding_list))
		goto out;

	list_del_rcu(&neigh_node->bonding_list);
	INIT_LIST_HEAD(&neigh_node->bonding_list);
292
	neigh_node_free_ref(neigh_node);
293 294 295 296 297 298 299 300 301 302
	atomic_dec(&orig_node->bond_candidates);

out:
	return;
}

static void bonding_candidate_add(struct orig_node *orig_node,
				  struct neigh_node *neigh_node)
{
	struct hlist_node *node;
303 304
	struct neigh_node *tmp_neigh_node, *router = NULL;
	uint8_t interference_candidate = 0;
305 306 307 308

	spin_lock_bh(&orig_node->neigh_list_lock);

	/* only consider if it has the same primary address ...  */
309 310
	if (!compare_eth(orig_node->orig,
			 neigh_node->orig_node->primary_addr))
311 312
		goto candidate_del;

313 314
	router = orig_node_get_router(orig_node);
	if (!router)
315 316 317
		goto candidate_del;

	/* ... and is good enough to be considered */
318
	if (neigh_node->tq_avg < router->tq_avg - BONDING_TQ_THRESHOLD)
319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337
		goto candidate_del;

	/**
	 * check if we have another candidate with the same mac address or
	 * interface. If we do, we won't select this candidate because of
	 * possible interference.
	 */
	hlist_for_each_entry_rcu(tmp_neigh_node, node,
				 &orig_node->neigh_list, list) {

		if (tmp_neigh_node == neigh_node)
			continue;

		/* we only care if the other candidate is even
		* considered as candidate. */
		if (list_empty(&tmp_neigh_node->bonding_list))
			continue;

		if ((neigh_node->if_incoming == tmp_neigh_node->if_incoming) ||
338
		    (compare_eth(neigh_node->addr, tmp_neigh_node->addr))) {
339 340 341 342 343 344 345 346 347 348 349 350 351
			interference_candidate = 1;
			break;
		}
	}

	/* don't care further if it is an interference candidate */
	if (interference_candidate)
		goto candidate_del;

	/* this neighbor already is part of our candidate list */
	if (!list_empty(&neigh_node->bonding_list))
		goto out;

352 353 354
	if (!atomic_inc_not_zero(&neigh_node->refcount))
		goto out;

355 356 357 358 359 360 361 362 363
	list_add_rcu(&neigh_node->bonding_list, &orig_node->bond_list);
	atomic_inc(&orig_node->bond_candidates);
	goto out;

candidate_del:
	bonding_candidate_del(orig_node, neigh_node);

out:
	spin_unlock_bh(&orig_node->neigh_list_lock);
364 365 366

	if (router)
		neigh_node_free_ref(router);
367 368 369
}

/* copy primary address for bonding */
370
static void bonding_save_primary(const struct orig_node *orig_node,
371
				 struct orig_node *orig_neigh_node,
372
				 const struct batman_packet *batman_packet)
373 374 375 376 377 378 379
{
	if (!(batman_packet->flags & PRIMARIES_FIRST_HOP))
		return;

	memcpy(orig_neigh_node->primary_addr, orig_node->orig, ETH_ALEN);
}

380 381 382
static void update_orig(struct bat_priv *bat_priv, struct orig_node *orig_node,
			const struct ethhdr *ethhdr,
			const struct batman_packet *batman_packet,
383
			struct hard_iface *if_incoming,
384
			const unsigned char *tt_buff, int is_duplicate)
385 386
{
	struct neigh_node *neigh_node = NULL, *tmp_neigh_node = NULL;
387
	struct neigh_node *router = NULL;
388
	struct orig_node *orig_node_tmp;
389
	struct hlist_node *node;
390
	uint8_t bcast_own_sum_orig, bcast_own_sum_neigh;
391 392 393 394

	bat_dbg(DBG_BATMAN, bat_priv, "update_originator(): "
		"Searching and updating originator entry of received packet\n");

395 396 397
	rcu_read_lock();
	hlist_for_each_entry_rcu(tmp_neigh_node, node,
				 &orig_node->neigh_list, list) {
398
		if (compare_eth(tmp_neigh_node->addr, ethhdr->h_source) &&
399 400 401 402
		    (tmp_neigh_node->if_incoming == if_incoming) &&
		     atomic_inc_not_zero(&tmp_neigh_node->refcount)) {
			if (neigh_node)
				neigh_node_free_ref(neigh_node);
403 404 405 406 407 408 409
			neigh_node = tmp_neigh_node;
			continue;
		}

		if (is_duplicate)
			continue;

410
		spin_lock_bh(&tmp_neigh_node->tq_lock);
411 412 413 414
		ring_buffer_set(tmp_neigh_node->tq_recv,
				&tmp_neigh_node->tq_index, 0);
		tmp_neigh_node->tq_avg =
			ring_buffer_avg(tmp_neigh_node->tq_recv);
415
		spin_unlock_bh(&tmp_neigh_node->tq_lock);
416 417 418 419 420 421 422
	}

	if (!neigh_node) {
		struct orig_node *orig_tmp;

		orig_tmp = get_orig_node(bat_priv, ethhdr->h_source);
		if (!orig_tmp)
423
			goto unlock;
424 425 426

		neigh_node = create_neighbor(orig_node, orig_tmp,
					     ethhdr->h_source, if_incoming);
427

428
		orig_node_free_ref(orig_tmp);
429
		if (!neigh_node)
430
			goto unlock;
431 432 433 434
	} else
		bat_dbg(DBG_BATMAN, bat_priv,
			"Updating existing last-hop neighbor of originator\n");

435 436
	rcu_read_unlock();

437 438 439
	orig_node->flags = batman_packet->flags;
	neigh_node->last_valid = jiffies;

440
	spin_lock_bh(&neigh_node->tq_lock);
441 442 443 444
	ring_buffer_set(neigh_node->tq_recv,
			&neigh_node->tq_index,
			batman_packet->tq);
	neigh_node->tq_avg = ring_buffer_avg(neigh_node->tq_recv);
445
	spin_unlock_bh(&neigh_node->tq_lock);
446 447 448 449 450 451

	if (!is_duplicate) {
		orig_node->last_ttl = batman_packet->ttl;
		neigh_node->last_ttl = batman_packet->ttl;
	}

452 453
	bonding_candidate_add(orig_node, neigh_node);

454 455
	/* if this neighbor already is our next hop there is nothing
	 * to change */
456 457
	router = orig_node_get_router(orig_node);
	if (router == neigh_node)
458
		goto update_tt;
459 460

	/* if this neighbor does not offer a better TQ we won't consider it */
461
	if (router && (router->tq_avg > neigh_node->tq_avg))
462
		goto update_tt;
463 464 465

	/* if the TQ is the same and the link not more symetric we
	 * won't consider it either */
466 467
	if (router && (neigh_node->tq_avg == router->tq_avg)) {
		orig_node_tmp = router->orig_node;
468 469 470 471 472 473 474 475 476 477 478 479
		spin_lock_bh(&orig_node_tmp->ogm_cnt_lock);
		bcast_own_sum_orig =
			orig_node_tmp->bcast_own_sum[if_incoming->if_num];
		spin_unlock_bh(&orig_node_tmp->ogm_cnt_lock);

		orig_node_tmp = neigh_node->orig_node;
		spin_lock_bh(&orig_node_tmp->ogm_cnt_lock);
		bcast_own_sum_neigh =
			orig_node_tmp->bcast_own_sum[if_incoming->if_num];
		spin_unlock_bh(&orig_node_tmp->ogm_cnt_lock);

		if (bcast_own_sum_orig >= bcast_own_sum_neigh)
480
			goto update_tt;
481
	}
482

483
	update_routes(bat_priv, orig_node, neigh_node);
484

485
update_tt:
486 487 488 489 490 491 492 493 494
	/* I have to check for transtable changes only if the OGM has been
	 * sent through a primary interface */
	if (((batman_packet->orig != ethhdr->h_source) &&
				(batman_packet->ttl > 2)) ||
				(batman_packet->flags & PRIMARIES_FIRST_HOP))
		update_transtable(bat_priv, orig_node, tt_buff,
				  batman_packet->tt_num_changes,
				  batman_packet->ttvn,
				  batman_packet->tt_crc);
495 496 497 498 499 500 501 502 503 504 505

	if (orig_node->gw_flags != batman_packet->gw_flags)
		gw_node_update(bat_priv, orig_node, batman_packet->gw_flags);

	orig_node->gw_flags = batman_packet->gw_flags;

	/* restart gateway selection if fast or late switching was enabled */
	if ((orig_node->gw_flags) &&
	    (atomic_read(&bat_priv->gw_mode) == GW_MODE_CLIENT) &&
	    (atomic_read(&bat_priv->gw_sel_class) > 2))
		gw_check_election(bat_priv, orig_node);
506 507 508 509 510 511 512

	goto out;

unlock:
	rcu_read_unlock();
out:
	if (neigh_node)
513
		neigh_node_free_ref(neigh_node);
514 515
	if (router)
		neigh_node_free_ref(router);
516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550
}

/* checks whether the host restarted and is in the protection time.
 * returns:
 *  0 if the packet is to be accepted
 *  1 if the packet is to be ignored.
 */
static int window_protected(struct bat_priv *bat_priv,
			    int32_t seq_num_diff,
			    unsigned long *last_reset)
{
	if ((seq_num_diff <= -TQ_LOCAL_WINDOW_SIZE)
		|| (seq_num_diff >= EXPECTED_SEQNO_RANGE)) {
		if (time_after(jiffies, *last_reset +
			msecs_to_jiffies(RESET_PROTECTION_MS))) {

			*last_reset = jiffies;
			bat_dbg(DBG_BATMAN, bat_priv,
				"old packet received, start protection\n");

			return 0;
		} else
			return 1;
	}
	return 0;
}

/* processes a batman packet for all interfaces, adjusts the sequence number and
 * finds out whether it is a duplicate.
 * returns:
 *   1 the packet is a duplicate
 *   0 the packet has not yet been received
 *  -1 the packet is old and has been received while the seqno window
 *     was protected. Caller should drop it.
 */
551
static int count_real_packets(const struct ethhdr *ethhdr,
552 553
			       const struct batman_packet *batman_packet,
			       const struct hard_iface *if_incoming)
554 555 556 557
{
	struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface);
	struct orig_node *orig_node;
	struct neigh_node *tmp_neigh_node;
558
	struct hlist_node *node;
559
	int is_duplicate = 0;
560 561
	int32_t seq_diff;
	int need_update = 0;
562
	int set_mark, ret = -1;
563 564 565 566 567

	orig_node = get_orig_node(bat_priv, batman_packet->orig);
	if (!orig_node)
		return 0;

568
	spin_lock_bh(&orig_node->ogm_cnt_lock);
569 570 571 572 573
	seq_diff = batman_packet->seqno - orig_node->last_real_seqno;

	/* signalize caller that the packet is to be dropped. */
	if (window_protected(bat_priv, seq_diff,
			     &orig_node->batman_seqno_reset))
574
		goto out;
575

576 577 578
	rcu_read_lock();
	hlist_for_each_entry_rcu(tmp_neigh_node, node,
				 &orig_node->neigh_list, list) {
579 580 581 582 583

		is_duplicate |= get_bit_status(tmp_neigh_node->real_bits,
					       orig_node->last_real_seqno,
					       batman_packet->seqno);

584
		if (compare_eth(tmp_neigh_node->addr, ethhdr->h_source) &&
585 586 587 588 589 590 591 592 593 594 595 596 597
		    (tmp_neigh_node->if_incoming == if_incoming))
			set_mark = 1;
		else
			set_mark = 0;

		/* if the window moved, set the update flag. */
		need_update |= bit_get_packet(bat_priv,
					      tmp_neigh_node->real_bits,
					      seq_diff, set_mark);

		tmp_neigh_node->real_packet_count =
			bit_packet_count(tmp_neigh_node->real_bits);
	}
598
	rcu_read_unlock();
599 600 601 602 603 604 605 606

	if (need_update) {
		bat_dbg(DBG_BATMAN, bat_priv,
			"updating last_seqno: old %d, new %d\n",
			orig_node->last_real_seqno, batman_packet->seqno);
		orig_node->last_real_seqno = batman_packet->seqno;
	}

607
	ret = is_duplicate;
608

609 610
out:
	spin_unlock_bh(&orig_node->ogm_cnt_lock);
611
	orig_node_free_ref(orig_node);
612
	return ret;
613 614
}

615
void receive_bat_packet(const struct ethhdr *ethhdr,
616
			struct batman_packet *batman_packet,
617
			const unsigned char *tt_buff,
618
			struct hard_iface *if_incoming)
619 620
{
	struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface);
621
	struct hard_iface *hard_iface;
622
	struct orig_node *orig_neigh_node, *orig_node;
623 624
	struct neigh_node *router = NULL, *router_router = NULL;
	struct neigh_node *orig_neigh_router = NULL;
625 626 627
	int has_directlink_flag;
	int is_my_addr = 0, is_my_orig = 0, is_my_oldorig = 0;
	int is_broadcast = 0, is_bidirectional, is_single_hop_neigh;
628
	int is_duplicate;
629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650
	uint32_t if_incoming_seqno;

	/* Silently drop when the batman packet is actually not a
	 * correct packet.
	 *
	 * This might happen if a packet is padded (e.g. Ethernet has a
	 * minimum frame length of 64 byte) and the aggregation interprets
	 * it as an additional length.
	 *
	 * TODO: A more sane solution would be to have a bit in the
	 * batman_packet to detect whether the packet is the last
	 * packet in an aggregation.  Here we expect that the padding
	 * is always zero (or not 0x01)
	 */
	if (batman_packet->packet_type != BAT_PACKET)
		return;

	/* could be changed by schedule_own_packet() */
	if_incoming_seqno = atomic_read(&if_incoming->seqno);

	has_directlink_flag = (batman_packet->flags & DIRECTLINK ? 1 : 0);

651 652
	is_single_hop_neigh = (compare_eth(ethhdr->h_source,
					   batman_packet->orig) ? 1 : 0);
653 654 655

	bat_dbg(DBG_BATMAN, bat_priv,
		"Received BATMAN packet via NB: %pM, IF: %s [%pM] "
656 657
		"(from OG: %pM, via prev OG: %pM, seqno %d, ttvn %u, "
		"crc %u, changes %u, td %d, TTL %d, V %d, IDF %d)\n",
658 659 660
		ethhdr->h_source, if_incoming->net_dev->name,
		if_incoming->net_dev->dev_addr, batman_packet->orig,
		batman_packet->prev_sender, batman_packet->seqno,
661 662 663
		batman_packet->ttvn, batman_packet->tt_crc,
		batman_packet->tt_num_changes, batman_packet->tq,
		batman_packet->ttl, batman_packet->version,
664 665 666
		has_directlink_flag);

	rcu_read_lock();
667 668
	list_for_each_entry_rcu(hard_iface, &hardif_list, list) {
		if (hard_iface->if_status != IF_ACTIVE)
669 670
			continue;

671
		if (hard_iface->soft_iface != if_incoming->soft_iface)
672 673
			continue;

674
		if (compare_eth(ethhdr->h_source,
675
				hard_iface->net_dev->dev_addr))
676 677
			is_my_addr = 1;

678
		if (compare_eth(batman_packet->orig,
679
				hard_iface->net_dev->dev_addr))
680 681
			is_my_orig = 1;

682
		if (compare_eth(batman_packet->prev_sender,
683
				hard_iface->net_dev->dev_addr))
684 685
			is_my_oldorig = 1;

686
		if (is_broadcast_ether_addr(ethhdr->h_source))
687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722
			is_broadcast = 1;
	}
	rcu_read_unlock();

	if (batman_packet->version != COMPAT_VERSION) {
		bat_dbg(DBG_BATMAN, bat_priv,
			"Drop packet: incompatible batman version (%i)\n",
			batman_packet->version);
		return;
	}

	if (is_my_addr) {
		bat_dbg(DBG_BATMAN, bat_priv,
			"Drop packet: received my own broadcast (sender: %pM"
			")\n",
			ethhdr->h_source);
		return;
	}

	if (is_broadcast) {
		bat_dbg(DBG_BATMAN, bat_priv, "Drop packet: "
		"ignoring all packets with broadcast source addr (sender: %pM"
		")\n", ethhdr->h_source);
		return;
	}

	if (is_my_orig) {
		unsigned long *word;
		int offset;

		orig_neigh_node = get_orig_node(bat_priv, ethhdr->h_source);
		if (!orig_neigh_node)
			return;

		/* neighbor has to indicate direct link and it has to
		 * come via the corresponding interface */
723
		/* save packet seqno for bidirectional check */
724
		if (has_directlink_flag &&
725
		    compare_eth(if_incoming->net_dev->dev_addr,
726
				batman_packet->orig)) {
727
			offset = if_incoming->if_num * NUM_WORDS;
728 729

			spin_lock_bh(&orig_neigh_node->ogm_cnt_lock);
730
			word = &(orig_neigh_node->bcast_own[offset]);
731 732
			bit_mark(word,
				 if_incoming_seqno - batman_packet->seqno - 2);
733 734
			orig_neigh_node->bcast_own_sum[if_incoming->if_num] =
				bit_packet_count(word);
735
			spin_unlock_bh(&orig_neigh_node->ogm_cnt_lock);
736 737 738 739
		}

		bat_dbg(DBG_BATMAN, bat_priv, "Drop packet: "
			"originator packet from myself (via neighbor)\n");
740
		orig_node_free_ref(orig_neigh_node);
741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760
		return;
	}

	if (is_my_oldorig) {
		bat_dbg(DBG_BATMAN, bat_priv,
			"Drop packet: ignoring all rebroadcast echos (sender: "
			"%pM)\n", ethhdr->h_source);
		return;
	}

	orig_node = get_orig_node(bat_priv, batman_packet->orig);
	if (!orig_node)
		return;

	is_duplicate = count_real_packets(ethhdr, batman_packet, if_incoming);

	if (is_duplicate == -1) {
		bat_dbg(DBG_BATMAN, bat_priv,
			"Drop packet: packet within seqno protection time "
			"(sender: %pM)\n", ethhdr->h_source);
761
		goto out;
762 763 764 765 766
	}

	if (batman_packet->tq == 0) {
		bat_dbg(DBG_BATMAN, bat_priv,
			"Drop packet: originator packet with tq equal 0\n");
767
		goto out;
768 769
	}

770 771 772 773
	router = orig_node_get_router(orig_node);
	if (router)
		router_router = orig_node_get_router(router->orig_node);

774
	/* avoid temporary routing loops */
775 776
	if (router && router_router &&
	    (compare_eth(router->addr, batman_packet->prev_sender)) &&
777
	    !(compare_eth(batman_packet->orig, batman_packet->prev_sender)) &&
778
	    (compare_eth(router->addr, router_router->addr))) {
779 780 781
		bat_dbg(DBG_BATMAN, bat_priv,
			"Drop packet: ignoring all rebroadcast packets that "
			"may make me loop (sender: %pM)\n", ethhdr->h_source);
782
		goto out;
783 784 785 786 787 788 789 790
	}

	/* if sender is a direct neighbor the sender mac equals
	 * originator mac */
	orig_neigh_node = (is_single_hop_neigh ?
			   orig_node :
			   get_orig_node(bat_priv, ethhdr->h_source));
	if (!orig_neigh_node)
791
		goto out;
792

793 794
	orig_neigh_router = orig_node_get_router(orig_neigh_node);

795 796
	/* drop packet if sender is not a direct neighbor and if we
	 * don't route towards it */
797
	if (!is_single_hop_neigh && (!orig_neigh_router)) {
798 799
		bat_dbg(DBG_BATMAN, bat_priv,
			"Drop packet: OGM via unknown neighbor!\n");
800
		goto out_neigh;
801 802 803 804 805
	}

	is_bidirectional = is_bidirectional_neigh(orig_node, orig_neigh_node,
						batman_packet, if_incoming);

806 807
	bonding_save_primary(orig_node, orig_neigh_node, batman_packet);

808 809 810 811 812 813 814
	/* update ranking if it is not a duplicate or has the same
	 * seqno and similar ttl as the non-duplicate */
	if (is_bidirectional &&
	    (!is_duplicate ||
	     ((orig_node->last_real_seqno == batman_packet->seqno) &&
	      (orig_node->last_ttl - 3 <= batman_packet->ttl))))
		update_orig(bat_priv, orig_node, ethhdr, batman_packet,
815
			    if_incoming, tt_buff, is_duplicate);
816 817 818 819 820 821

	/* is single hop (direct) neighbor */
	if (is_single_hop_neigh) {

		/* mark direct link on incoming interface */
		schedule_forward_packet(orig_node, ethhdr, batman_packet,
822
					1, if_incoming);
823 824 825

		bat_dbg(DBG_BATMAN, bat_priv, "Forwarding packet: "
			"rebroadcast neighbor packet with direct link flag\n");
826
		goto out_neigh;
827 828 829 830 831 832
	}

	/* multihop originator */
	if (!is_bidirectional) {
		bat_dbg(DBG_BATMAN, bat_priv,
			"Drop packet: not received via bidirectional link\n");
833
		goto out_neigh;
834 835 836 837 838
	}

	if (is_duplicate) {
		bat_dbg(DBG_BATMAN, bat_priv,
			"Drop packet: duplicate packet received\n");
839
		goto out_neigh;
840 841 842 843 844
	}

	bat_dbg(DBG_BATMAN, bat_priv,
		"Forwarding packet: rebroadcast originator packet\n");
	schedule_forward_packet(orig_node, ethhdr, batman_packet,
845
				0, if_incoming);
846 847

out_neigh:
848 849
	if ((orig_neigh_node) && (!is_single_hop_neigh))
		orig_node_free_ref(orig_neigh_node);
850
out:
851 852 853 854 855 856 857
	if (router)
		neigh_node_free_ref(router);
	if (router_router)
		neigh_node_free_ref(router_router);
	if (orig_neigh_router)
		neigh_node_free_ref(orig_neigh_router);

858
	orig_node_free_ref(orig_node);
859 860
}

861
int recv_bat_packet(struct sk_buff *skb, struct hard_iface *hard_iface)
862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891
{
	struct ethhdr *ethhdr;

	/* drop packet if it has not necessary minimum size */
	if (unlikely(!pskb_may_pull(skb, sizeof(struct batman_packet))))
		return NET_RX_DROP;

	ethhdr = (struct ethhdr *)skb_mac_header(skb);

	/* packet with broadcast indication but unicast recipient */
	if (!is_broadcast_ether_addr(ethhdr->h_dest))
		return NET_RX_DROP;

	/* packet with broadcast sender address */
	if (is_broadcast_ether_addr(ethhdr->h_source))
		return NET_RX_DROP;

	/* create a copy of the skb, if needed, to modify it. */
	if (skb_cow(skb, 0) < 0)
		return NET_RX_DROP;

	/* keep skb linear */
	if (skb_linearize(skb) < 0)
		return NET_RX_DROP;

	ethhdr = (struct ethhdr *)skb_mac_header(skb);

	receive_aggr_bat_packet(ethhdr,
				skb->data,
				skb_headlen(skb),
892
				hard_iface);
893 894 895 896 897 898 899 900

	kfree_skb(skb);
	return NET_RX_SUCCESS;
}

static int recv_my_icmp_packet(struct bat_priv *bat_priv,
			       struct sk_buff *skb, size_t icmp_len)
{
901
	struct hard_iface *primary_if = NULL;
902
	struct orig_node *orig_node = NULL;
903
	struct neigh_node *router = NULL;
904
	struct icmp_packet_rr *icmp_packet;
905
	int ret = NET_RX_DROP;
906 907 908 909 910 911

	icmp_packet = (struct icmp_packet_rr *)skb->data;

	/* add data to device queue */
	if (icmp_packet->msg_type != ECHO_REQUEST) {
		bat_socket_receive_packet(icmp_packet, icmp_len);
912
		goto out;
913 914
	}

915 916
	primary_if = primary_if_get_selected(bat_priv);
	if (!primary_if)
917
		goto out;
918 919 920

	/* answer echo request (ping) */
	/* get routing information */
921
	orig_node = orig_hash_find(bat_priv, icmp_packet->orig);
922
	if (!orig_node)
923
		goto out;
924

925 926 927
	router = orig_node_get_router(orig_node);
	if (!router)
		goto out;
928

929 930 931 932 933 934 935
	/* create a copy of the skb, if needed, to modify it. */
	if (skb_cow(skb, sizeof(struct ethhdr)) < 0)
		goto out;

	icmp_packet = (struct icmp_packet_rr *)skb->data;

	memcpy(icmp_packet->dst, icmp_packet->orig, ETH_ALEN);
936
	memcpy(icmp_packet->orig, primary_if->net_dev->dev_addr, ETH_ALEN);
937 938 939
	icmp_packet->msg_type = ECHO_REPLY;
	icmp_packet->ttl = TTL;

940
	send_skb_packet(skb, router->if_incoming, router->addr);
941
	ret = NET_RX_SUCCESS;
942

943
out:
944 945
	if (primary_if)
		hardif_free_ref(primary_if);
946 947
	if (router)
		neigh_node_free_ref(router);
948
	if (orig_node)
949
		orig_node_free_ref(orig_node);
950 951 952 953
	return ret;
}

static int recv_icmp_ttl_exceeded(struct bat_priv *bat_priv,
954
				  struct sk_buff *skb)
955
{
956
	struct hard_iface *primary_if = NULL;
957
	struct orig_node *orig_node = NULL;
958
	struct neigh_node *router = NULL;
959
	struct icmp_packet *icmp_packet;
960
	int ret = NET_RX_DROP;
961 962 963 964 965 966 967 968

	icmp_packet = (struct icmp_packet *)skb->data;

	/* send TTL exceeded if packet is an echo request (traceroute) */
	if (icmp_packet->msg_type != ECHO_REQUEST) {
		pr_debug("Warning - can't forward icmp packet from %pM to "
			 "%pM: ttl exceeded\n", icmp_packet->orig,
			 icmp_packet->dst);
969
		goto out;
970 971
	}

972 973
	primary_if = primary_if_get_selected(bat_priv);
	if (!primary_if)
974
		goto out;
975 976

	/* get routing information */
977
	orig_node = orig_hash_find(bat_priv, icmp_packet->orig);
978
	if (!orig_node)
979
		goto out;
980

981 982 983
	router = orig_node_get_router(orig_node);
	if (!router)
		goto out;
984

985 986 987
	/* create a copy of the skb, if needed, to modify it. */
	if (skb_cow(skb, sizeof(struct ethhdr)) < 0)
		goto out;
988

989
	icmp_packet = (struct icmp_packet *)skb->data;
990

991
	memcpy(icmp_packet->dst, icmp_packet->orig, ETH_ALEN);
992
	memcpy(icmp_packet->orig, primary_if->net_dev->dev_addr, ETH_ALEN);
993 994 995
	icmp_packet->msg_type = TTL_EXCEEDED;
	icmp_packet->ttl = TTL;

996
	send_skb_packet(skb, router->if_incoming, router->addr);
997
	ret = NET_RX_SUCCESS;
998

999
out:
1000 1001
	if (primary_if)
		hardif_free_ref(primary_if);
1002 1003
	if (router)
		neigh_node_free_ref(router);
1004
	if (orig_node)
1005
		orig_node_free_ref(orig_node);
1006 1007 1008 1009
	return ret;
}


1010
int recv_icmp_packet(struct sk_buff *skb, struct hard_iface *recv_if)
1011 1012 1013 1014
{
	struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
	struct icmp_packet_rr *icmp_packet;
	struct ethhdr *ethhdr;
1015
	struct orig_node *orig_node = NULL;
1016
	struct neigh_node *router = NULL;
1017
	int hdr_size = sizeof(struct icmp_packet);
1018
	int ret = NET_RX_DROP;
1019 1020 1021 1022 1023 1024 1025 1026 1027

	/**
	 * we truncate all incoming icmp packets if they don't match our size
	 */
	if (skb->len >= sizeof(struct icmp_packet_rr))
		hdr_size = sizeof(struct icmp_packet_rr);

	/* drop packet if it has not necessary minimum size */
	if (unlikely(!pskb_may_pull(skb, hdr_size)))
1028
		goto out;
1029 1030 1031 1032 1033

	ethhdr = (struct ethhdr *)skb_mac_header(skb);

	/* packet with unicast indication but broadcast recipient */
	if (is_broadcast_ether_addr(ethhdr->h_dest))
1034
		goto out;
1035 1036 1037

	/* packet with broadcast sender address */
	if (is_broadcast_ether_addr(ethhdr->h_source))
1038
		goto out;
1039 1040 1041

	/* not for me */
	if (!is_my_mac(ethhdr->h_dest))
1042
		goto out;
1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059

	icmp_packet = (struct icmp_packet_rr *)skb->data;

	/* add record route information if not full */
	if ((hdr_size == sizeof(struct icmp_packet_rr)) &&
	    (icmp_packet->rr_cur < BAT_RR_LEN)) {
		memcpy(&(icmp_packet->rr[icmp_packet->rr_cur]),
			ethhdr->h_dest, ETH_ALEN);
		icmp_packet->rr_cur++;
	}

	/* packet for me */
	if (is_my_mac(icmp_packet->dst))
		return recv_my_icmp_packet(bat_priv, skb, hdr_size);

	/* TTL exceeded */
	if (icmp_packet->ttl < 2)
1060
		return recv_icmp_ttl_exceeded(bat_priv, skb);
1061 1062

	/* get routing information */
1063
	orig_node = orig_hash_find(bat_priv, icmp_packet->dst);
1064
	if (!orig_node)
1065
		goto out;
1066

1067 1068 1069
	router = orig_node_get_router(orig_node);
	if (!router)
		goto out;
1070

1071 1072 1073
	/* create a copy of the skb, if needed, to modify it. */
	if (skb_cow(skb, sizeof(struct ethhdr)) < 0)
		goto out;
1074

1075
	icmp_packet = (struct icmp_packet_rr *)skb->data;
1076

1077 1078 1079 1080
	/* decrement ttl */
	icmp_packet->ttl--;

	/* route it */
1081
	send_skb_packet(skb, router->if_incoming, router->addr);
1082
	ret = NET_RX_SUCCESS;
1083

1084
out:
1085 1086
	if (router)
		neigh_node_free_ref(router);
1087
	if (orig_node)
1088
		orig_node_free_ref(orig_node);
1089 1090 1091
	return ret;
}

1092 1093 1094 1095 1096 1097
/* In the bonding case, send the packets in a round
 * robin fashion over the remaining interfaces.
 *
 * This method rotates the bonding list and increases the
 * returned router's refcount. */
static struct neigh_node *find_bond_router(struct orig_node *primary_orig,
1098
					   const struct hard_iface *recv_if)
1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148
{
	struct neigh_node *tmp_neigh_node;
	struct neigh_node *router = NULL, *first_candidate = NULL;

	rcu_read_lock();
	list_for_each_entry_rcu(tmp_neigh_node, &primary_orig->bond_list,
				bonding_list) {
		if (!first_candidate)
			first_candidate = tmp_neigh_node;

		/* recv_if == NULL on the first node. */
		if (tmp_neigh_node->if_incoming == recv_if)
			continue;

		if (!atomic_inc_not_zero(&tmp_neigh_node->refcount))
			continue;

		router = tmp_neigh_node;
		break;
	}

	/* use the first candidate if nothing was found. */
	if (!router && first_candidate &&
	    atomic_inc_not_zero(&first_candidate->refcount))
		router = first_candidate;

	if (!router)
		goto out;

	/* selected should point to the next element
	 * after the current router */
	spin_lock_bh(&primary_orig->neigh_list_lock);
	/* this is a list_move(), which unfortunately
	 * does not exist as rcu version */
	list_del_rcu(&primary_orig->bond_list);
	list_add_rcu(&primary_orig->bond_list,
		     &router->bonding_list);
	spin_unlock_bh(&primary_orig->neigh_list_lock);

out:
	rcu_read_unlock();
	return router;
}

/* Interface Alternating: Use the best of the
 * remaining candidates which are not using
 * this interface.
 *
 * Increases the returned router's refcount */
static struct neigh_node *find_ifalter_router(struct orig_node *primary_orig,
1149
					      const struct hard_iface *recv_if)
1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191
{
	struct neigh_node *tmp_neigh_node;
	struct neigh_node *router = NULL, *first_candidate = NULL;

	rcu_read_lock();
	list_for_each_entry_rcu(tmp_neigh_node, &primary_orig->bond_list,
				bonding_list) {
		if (!first_candidate)
			first_candidate = tmp_neigh_node;

		/* recv_if == NULL on the first node. */
		if (tmp_neigh_node->if_incoming == recv_if)
			continue;

		if (!atomic_inc_not_zero(&tmp_neigh_node->refcount))
			continue;

		/* if we don't have a router yet
		 * or this one is better, choose it. */
		if ((!router) ||
		    (tmp_neigh_node->tq_avg > router->tq_avg)) {
			/* decrement refcount of
			 * previously selected router */
			if (router)
				neigh_node_free_ref(router);

			router = tmp_neigh_node;
			atomic_inc_not_zero(&router->refcount);
		}

		neigh_node_free_ref(tmp_neigh_node);
	}

	/* use the first candidate if nothing was found. */
	if (!router && first_candidate &&
	    atomic_inc_not_zero(&first_candidate->refcount))
		router = first_candidate;

	rcu_read_unlock();
	return router;
}

1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255
int recv_tt_query(struct sk_buff *skb, struct hard_iface *recv_if)
{
	struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
	struct tt_query_packet *tt_query;
	struct ethhdr *ethhdr;

	/* drop packet if it has not necessary minimum size */
	if (unlikely(!pskb_may_pull(skb, sizeof(struct tt_query_packet))))
		goto out;

	/* I could need to modify it */
	if (skb_cow(skb, sizeof(struct tt_query_packet)) < 0)
		goto out;

	ethhdr = (struct ethhdr *)skb_mac_header(skb);

	/* packet with unicast indication but broadcast recipient */
	if (is_broadcast_ether_addr(ethhdr->h_dest))
		goto out;

	/* packet with broadcast sender address */
	if (is_broadcast_ether_addr(ethhdr->h_source))
		goto out;

	tt_query = (struct tt_query_packet *)skb->data;

	tt_query->tt_data = ntohs(tt_query->tt_data);

	switch (tt_query->flags & TT_QUERY_TYPE_MASK) {
	case TT_REQUEST:
		/* If we cannot provide an answer the tt_request is
		 * forwarded */
		if (!send_tt_response(bat_priv, tt_query)) {
			bat_dbg(DBG_TT, bat_priv,
				"Routing TT_REQUEST to %pM [%c]\n",
				tt_query->dst,
				(tt_query->flags & TT_FULL_TABLE ? 'F' : '.'));
			tt_query->tt_data = htons(tt_query->tt_data);
			return route_unicast_packet(skb, recv_if);
		}
		break;
	case TT_RESPONSE:
		/* packet needs to be linearised to access the TT changes */
		if (skb_linearize(skb) < 0)
			goto out;

		if (is_my_mac(tt_query->dst))
			handle_tt_response(bat_priv, tt_query);
		else {
			bat_dbg(DBG_TT, bat_priv,
				"Routing TT_RESPONSE to %pM [%c]\n",
				tt_query->dst,
				(tt_query->flags & TT_FULL_TABLE ? 'F' : '.'));
			tt_query->tt_data = htons(tt_query->tt_data);
			return route_unicast_packet(skb, recv_if);
		}
		break;
	}

out:
	/* returning NET_RX_DROP will make the caller function kfree the skb */
	return NET_RX_DROP;
}

1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303
int recv_roam_adv(struct sk_buff *skb, struct hard_iface *recv_if)
{
	struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
	struct roam_adv_packet *roam_adv_packet;
	struct orig_node *orig_node;
	struct ethhdr *ethhdr;

	/* drop packet if it has not necessary minimum size */
	if (unlikely(!pskb_may_pull(skb, sizeof(struct roam_adv_packet))))
		goto out;

	ethhdr = (struct ethhdr *)skb_mac_header(skb);

	/* packet with unicast indication but broadcast recipient */
	if (is_broadcast_ether_addr(ethhdr->h_dest))
		goto out;

	/* packet with broadcast sender address */
	if (is_broadcast_ether_addr(ethhdr->h_source))
		goto out;

	roam_adv_packet = (struct roam_adv_packet *)skb->data;

	if (!is_my_mac(roam_adv_packet->dst))
		return route_unicast_packet(skb, recv_if);

	orig_node = orig_hash_find(bat_priv, roam_adv_packet->src);
	if (!orig_node)
		goto out;

	bat_dbg(DBG_TT, bat_priv, "Received ROAMING_ADV from %pM "
		"(client %pM)\n", roam_adv_packet->src,
		roam_adv_packet->client);

	tt_global_add(bat_priv, orig_node, roam_adv_packet->client,
		      atomic_read(&orig_node->last_ttvn) + 1, true);

	/* Roaming phase starts: I have new information but the ttvn has not
	 * been incremented yet. This flag will make me check all the incoming
	 * packets for the correct destination. */
	bat_priv->tt_poss_change = true;

	orig_node_free_ref(orig_node);
out:
	/* returning NET_RX_DROP will make the caller function kfree the skb */
	return NET_RX_DROP;
}

1304
/* find a suitable router for this originator, and use
1305 1306
 * bonding if possible. increases the found neighbors
 * refcount.*/
1307 1308
struct neigh_node *find_router(struct bat_priv *bat_priv,
			       struct orig_node *orig_node,
1309
			       const struct hard_iface *recv_if)
1310 1311 1312
{
	struct orig_node *primary_orig_node;
	struct orig_node *router_orig;
1313
	struct neigh_node *router;
1314 1315 1316 1317 1318 1319
	static uint8_t zero_mac[ETH_ALEN] = {0, 0, 0, 0, 0, 0};
	int bonding_enabled;

	if (!orig_node)
		return NULL;

1320 1321
	router = orig_node_get_router(orig_node);
	if (!router)
1322
		goto err;
1323 1324 1325 1326 1327

	/* without bonding, the first node should
	 * always choose the default router. */
	bonding_enabled = atomic_read(&bat_priv->bonding);

1328 1329
	rcu_read_lock();
	/* select default router to output */
1330
	router_orig = router->orig_node;
1331 1332
	if (!router_orig)
		goto err_unlock;
1333 1334 1335

	if ((!recv_if) && (!bonding_enabled))
		goto return_router;
1336 1337 1338

	/* if we have something in the primary_addr, we can search
	 * for a potential bonding candidate. */
1339
	if (compare_eth(router_orig->primary_addr, zero_mac))
1340
		goto return_router;
1341 1342 1343 1344

	/* find the orig_node which has the primary interface. might
	 * even be the same as our router_orig in many cases */

1345
	if (compare_eth(router_orig->primary_addr, router_orig->orig)) {
1346 1347
		primary_orig_node = router_orig;
	} else {
1348 1349
		primary_orig_node = orig_hash_find(bat_priv,
						   router_orig->primary_addr);
1350
		if (!primary_orig_node)
1351
			goto return_router;
1352

1353
		orig_node_free_ref(primary_orig_node);
1354 1355 1356 1357
	}

	/* with less than 2 candidates, we can't do any
	 * bonding and prefer the original router. */
1358 1359
	if (atomic_read(&primary_orig_node->bond_candidates) < 2)
		goto return_router;
1360 1361 1362 1363

	/* all nodes between should choose a candidate which
	 * is is not on the interface where the packet came
	 * in. */
1364

1365
	neigh_node_free_ref(router);
1366

1367 1368 1369 1370
	if (bonding_enabled)
		router = find_bond_router(primary_orig_node, recv_if);
	else
		router = find_ifalter_router(primary_orig_node, recv_if);
1371

1372
return_router:
1373 1374 1375
	if (router && router->if_incoming->if_status != IF_ACTIVE)
		goto err_unlock;

1376
	rcu_read_unlock();
1377
	return router;
1378 1379 1380 1381 1382 1383
err_unlock:
	rcu_read_unlock();
err:
	if (router)
		neigh_node_free_ref(router);
	return NULL;
1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410
}

static int check_unicast_packet(struct sk_buff *skb, int hdr_size)
{
	struct ethhdr *ethhdr;

	/* drop packet if it has not necessary minimum size */
	if (unlikely(!pskb_may_pull(skb, hdr_size)))
		return -1;

	ethhdr = (struct ethhdr *)skb_mac_header(skb);

	/* packet with unicast indication but broadcast recipient */
	if (is_broadcast_ether_addr(ethhdr->h_dest))
		return -1;

	/* packet with broadcast sender address */
	if (is_broadcast_ether_addr(ethhdr->h_source))
		return -1;

	/* not for me */
	if (!is_my_mac(ethhdr->h_dest))
		return -1;

	return 0;
}

1411
int route_unicast_packet(struct sk_buff *skb, struct hard_iface *recv_if)
1412 1413
{
	struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
1414 1415
	struct orig_node *orig_node = NULL;
	struct neigh_node *neigh_node = NULL;
1416 1417
	struct unicast_packet *unicast_packet;
	struct ethhdr *ethhdr = (struct ethhdr *)skb_mac_header(skb);
1418
	int ret = NET_RX_DROP;
1419 1420 1421 1422 1423 1424 1425 1426 1427
	struct sk_buff *new_skb;

	unicast_packet = (struct unicast_packet *)skb->data;

	/* TTL exceeded */
	if (unicast_packet->ttl < 2) {
		pr_debug("Warning - can't forward unicast packet from %pM to "
			 "%pM: ttl exceeded\n", ethhdr->h_source,
			 unicast_packet->dest);
1428
		goto out;
1429 1430 1431
	}

	/* get routing information */
1432 1433
	orig_node = orig_hash_find(bat_priv, unicast_packet->dest);

1434
	if (!orig_node)
1435
		goto out;
1436

1437
	/* find_router() increases neigh_nodes refcount if found. */
1438
	neigh_node = find_router(bat_priv, orig_node, recv_if);
1439

1440
	if (!neigh_node)
1441
		goto out;
1442 1443 1444

	/* create a copy of the skb, if needed, to modify it. */
	if (skb_cow(skb, sizeof(struct ethhdr)) < 0)
1445
		goto out;
1446 1447 1448 1449 1450

	unicast_packet = (struct unicast_packet *)skb->data;

	if (unicast_packet->packet_type == BAT_UNICAST &&
	    atomic_read(&bat_priv->fragmentation) &&
1451 1452 1453 1454 1455
	    skb->len > neigh_node->if_incoming->net_dev->mtu) {
		ret = frag_send_skb(skb, bat_priv,
				    neigh_node->if_incoming, neigh_node->addr);
		goto out;
	}
1456 1457

	if (unicast_packet->packet_type == BAT_UNICAST_FRAG &&
1458
	    frag_can_reassemble(skb, neigh_node->if_incoming->net_dev->mtu)) {
1459 1460 1461 1462

		ret = frag_reassemble_skb(skb, bat_priv, &new_skb);

		if (ret == NET_RX_DROP)
1463
			goto out;
1464 1465

		/* packet was buffered for late merge */
1466 1467 1468 1469
		if (!new_skb) {
			ret = NET_RX_SUCCESS;
			goto out;
		}
1470 1471 1472 1473 1474 1475 1476 1477 1478

		skb = new_skb;
		unicast_packet = (struct unicast_packet *)skb->data;
	}

	/* decrement ttl */
	unicast_packet->ttl--;

	/* route it */
1479
	send_skb_packet(skb, neigh_node->if_incoming, neigh_node->addr);
1480
	ret = NET_RX_SUCCESS;
1481

1482 1483 1484 1485
out:
	if (neigh_node)
		neigh_node_free_ref(neigh_node);
	if (orig_node)
1486
		orig_node_free_ref(orig_node);
1487
	return ret;
1488 1489
}

1490 1491 1492 1493 1494 1495 1496
static int check_unicast_ttvn(struct bat_priv *bat_priv,
			       struct sk_buff *skb) {
	uint8_t curr_ttvn;
	struct orig_node *orig_node;
	struct ethhdr *ethhdr;
	struct hard_iface *primary_if;
	struct unicast_packet *unicast_packet;
1497
	bool tt_poss_change;
1498 1499 1500 1501 1502 1503 1504

	/* I could need to modify it */
	if (skb_cow(skb, sizeof(struct unicast_packet)) < 0)
		return 0;

	unicast_packet = (struct unicast_packet *)skb->data;

1505 1506
	if (is_my_mac(unicast_packet->dest)) {
		tt_poss_change = bat_priv->tt_poss_change;
1507
		curr_ttvn = (uint8_t)atomic_read(&bat_priv->ttvn);
1508
	} else {
1509 1510 1511 1512 1513 1514
		orig_node = orig_hash_find(bat_priv, unicast_packet->dest);

		if (!orig_node)
			return 0;

		curr_ttvn = (uint8_t)atomic_read(&orig_node->last_ttvn);
1515
		tt_poss_change = orig_node->tt_poss_change;
1516 1517 1518 1519
		orig_node_free_ref(orig_node);
	}

	/* Check whether I have to reroute the packet */
1520
	if (seq_before(unicast_packet->ttvn, curr_ttvn) || tt_poss_change) {
1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555
		/* Linearize the skb before accessing it */
		if (skb_linearize(skb) < 0)
			return 0;

		ethhdr = (struct ethhdr *)(skb->data +
			sizeof(struct unicast_packet));
		orig_node = transtable_search(bat_priv, ethhdr->h_dest);

		if (!orig_node) {
			if (!is_my_client(bat_priv, ethhdr->h_dest))
				return 0;
			primary_if = primary_if_get_selected(bat_priv);
			if (!primary_if)
				return 0;
			memcpy(unicast_packet->dest,
			       primary_if->net_dev->dev_addr, ETH_ALEN);
			hardif_free_ref(primary_if);
		} else {
			memcpy(unicast_packet->dest, orig_node->orig,
			       ETH_ALEN);
			curr_ttvn = (uint8_t)
				atomic_read(&orig_node->last_ttvn);
			orig_node_free_ref(orig_node);
		}

		bat_dbg(DBG_ROUTES, bat_priv, "TTVN mismatch (old_ttvn %u "
			"new_ttvn %u)! Rerouting unicast packet (for %pM) to "
			"%pM\n", unicast_packet->ttvn, curr_ttvn,
			ethhdr->h_dest, unicast_packet->dest);

		unicast_packet->ttvn = curr_ttvn;
	}
	return 1;
}

1556
int recv_unicast_packet(struct sk_buff *skb, struct hard_iface *recv_if)
1557
{
1558
	struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
1559
	struct unicast_packet *unicast_packet;
1560
	int hdr_size = sizeof(*unicast_packet);
1561 1562 1563 1564

	if (check_unicast_packet(skb, hdr_size) < 0)
		return NET_RX_DROP;

1565 1566 1567
	if (!check_unicast_ttvn(bat_priv, skb))
		return NET_RX_DROP;

1568 1569 1570 1571 1572 1573 1574 1575
	unicast_packet = (struct unicast_packet *)skb->data;

	/* packet for me */
	if (is_my_mac(unicast_packet->dest)) {
		interface_rx(recv_if->soft_iface, skb, recv_if, hdr_size);
		return NET_RX_SUCCESS;
	}

1576
	return route_unicast_packet(skb, recv_if);
1577 1578
}

1579
int recv_ucast_frag_packet(struct sk_buff *skb, struct hard_iface *recv_if)
1580 1581 1582
{
	struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
	struct unicast_frag_packet *unicast_packet;
1583
	int hdr_size = sizeof(*unicast_packet);
1584 1585 1586 1587 1588 1589
	struct sk_buff *new_skb = NULL;
	int ret;

	if (check_unicast_packet(skb, hdr_size) < 0)
		return NET_RX_DROP;

1590 1591 1592
	if (!check_unicast_ttvn(bat_priv, skb))
		return NET_RX_DROP;

1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611
	unicast_packet = (struct unicast_frag_packet *)skb->data;

	/* packet for me */
	if (is_my_mac(unicast_packet->dest)) {

		ret = frag_reassemble_skb(skb, bat_priv, &new_skb);

		if (ret == NET_RX_DROP)
			return NET_RX_DROP;

		/* packet was buffered for late merge */
		if (!new_skb)
			return NET_RX_SUCCESS;

		interface_rx(recv_if->soft_iface, new_skb, recv_if,
			     sizeof(struct unicast_packet));
		return NET_RX_SUCCESS;
	}

1612
	return route_unicast_packet(skb, recv_if);
1613 1614 1615
}


1616
int recv_bcast_packet(struct sk_buff *skb, struct hard_iface *recv_if)
1617 1618
{
	struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
1619
	struct orig_node *orig_node = NULL;
1620 1621
	struct bcast_packet *bcast_packet;
	struct ethhdr *ethhdr;
1622
	int hdr_size = sizeof(*bcast_packet);
1623
	int ret = NET_RX_DROP;
1624 1625 1626 1627
	int32_t seq_diff;

	/* drop packet if it has not necessary minimum size */
	if (unlikely(!pskb_may_pull(skb, hdr_size)))
1628
		goto out;
1629 1630 1631 1632 1633

	ethhdr = (struct ethhdr *)skb_mac_header(skb);

	/* packet with broadcast indication but unicast recipient */
	if (!is_broadcast_ether_addr(ethhdr->h_dest))
1634
		goto out;
1635 1636 1637

	/* packet with broadcast sender address */
	if (is_broadcast_ether_addr(ethhdr->h_source))
1638
		goto out;
1639 1640 1641

	/* ignore broadcasts sent by myself */
	if (is_my_mac(ethhdr->h_source))
1642
		goto out;
1643 1644 1645 1646 1647

	bcast_packet = (struct bcast_packet *)skb->data;

	/* ignore broadcasts originated by myself */
	if (is_my_mac(bcast_packet->orig))
1648
		goto out;
1649 1650

	if (bcast_packet->ttl < 2)
1651
		goto out;
1652

1653
	orig_node = orig_hash_find(bat_priv, bcast_packet->orig);
1654 1655

	if (!orig_node)
1656
		goto out;
1657

1658
	spin_lock_bh(&orig_node->bcast_seqno_lock);
1659 1660

	/* check whether the packet is a duplicate */
1661 1662 1663
	if (get_bit_status(orig_node->bcast_bits, orig_node->last_bcast_seqno,
			   ntohl(bcast_packet->seqno)))
		goto spin_unlock;
1664 1665 1666 1667 1668

	seq_diff = ntohl(bcast_packet->seqno) - orig_node->last_bcast_seqno;

	/* check whether the packet is old and the host just restarted. */
	if (window_protected(bat_priv, seq_diff,
1669 1670
			     &orig_node->bcast_seqno_reset))
		goto spin_unlock;
1671 1672 1673 1674 1675 1676

	/* mark broadcast in flood history, update window position
	 * if required. */
	if (bit_get_packet(bat_priv, orig_node->bcast_bits, seq_diff, 1))
		orig_node->last_bcast_seqno = ntohl(bcast_packet->seqno);

1677 1678
	spin_unlock_bh(&orig_node->bcast_seqno_lock);

1679 1680 1681 1682 1683
	/* rebroadcast packet */
	add_bcast_packet_to_list(bat_priv, skb);

	/* broadcast for me */
	interface_rx(recv_if->soft_iface, skb, recv_if, hdr_size);
1684 1685
	ret = NET_RX_SUCCESS;
	goto out;
1686

1687 1688 1689 1690
spin_unlock:
	spin_unlock_bh(&orig_node->bcast_seqno_lock);
out:
	if (orig_node)
1691
		orig_node_free_ref(orig_node);
1692
	return ret;
1693 1694
}

1695
int recv_vis_packet(struct sk_buff *skb, struct hard_iface *recv_if)
1696 1697 1698 1699
{
	struct vis_packet *vis_packet;
	struct ethhdr *ethhdr;
	struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface);
1700
	int hdr_size = sizeof(*vis_packet);
1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741

	/* keep skb linear */
	if (skb_linearize(skb) < 0)
		return NET_RX_DROP;

	if (unlikely(!pskb_may_pull(skb, hdr_size)))
		return NET_RX_DROP;

	vis_packet = (struct vis_packet *)skb->data;
	ethhdr = (struct ethhdr *)skb_mac_header(skb);

	/* not for me */
	if (!is_my_mac(ethhdr->h_dest))
		return NET_RX_DROP;

	/* ignore own packets */
	if (is_my_mac(vis_packet->vis_orig))
		return NET_RX_DROP;

	if (is_my_mac(vis_packet->sender_orig))
		return NET_RX_DROP;

	switch (vis_packet->vis_type) {
	case VIS_TYPE_SERVER_SYNC:
		receive_server_sync_packet(bat_priv, vis_packet,
					   skb_headlen(skb));
		break;

	case VIS_TYPE_CLIENT_UPDATE:
		receive_client_update_packet(bat_priv, vis_packet,
					     skb_headlen(skb));
		break;

	default:	/* ignore unknown packet */
		break;
	}

	/* We take a copy of the data in the packet, so we should
	   always free the skbuf. */
	return NET_RX_DROP;
}