translation-table.c 58.4 KB
Newer Older
1
/*
2
 * Copyright (C) 2007-2012 B.A.T.M.A.N. contributors:
3
 *
4
 * Marek Lindner, Simon Wunderlich, Antonio Quartulli
5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
 *
 * 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 "translation-table.h"
#include "soft-interface.h"
25
#include "hard-interface.h"
26
#include "send.h"
27 28
#include "hash.h"
#include "originator.h"
29
#include "routing.h"
30
#include "bridge_loop_avoidance.h"
31

32 33
#include <linux/crc16.h>

34 35
static void send_roam_adv(struct bat_priv *bat_priv, uint8_t *client,
			  struct orig_node *orig_node);
36
static void tt_purge(struct work_struct *work);
37
static void tt_global_del_orig_list(struct tt_global_entry *tt_global_entry);
38

39
/* returns 1 if they are the same mac addr */
40
static int compare_tt(const struct hlist_node *node, const void *data2)
41
{
42
	const void *data1 = container_of(node, struct tt_common_entry,
43
					 hash_entry);
44 45 46 47

	return (memcmp(data1, data2, ETH_ALEN) == 0 ? 1 : 0);
}

48
static void tt_start_timer(struct bat_priv *bat_priv)
49
{
50 51 52
	INIT_DELAYED_WORK(&bat_priv->tt_work, tt_purge);
	queue_delayed_work(bat_event_workqueue, &bat_priv->tt_work,
			   msecs_to_jiffies(5000));
53 54
}

55 56
static struct tt_common_entry *tt_hash_find(struct hashtable_t *hash,
					    const void *data)
57 58 59
{
	struct hlist_head *head;
	struct hlist_node *node;
60
	struct tt_common_entry *tt_common_entry, *tt_common_entry_tmp = NULL;
61
	uint32_t index;
62 63 64 65 66 67 68 69

	if (!hash)
		return NULL;

	index = choose_orig(data, hash->size);
	head = &hash->table[index];

	rcu_read_lock();
70 71
	hlist_for_each_entry_rcu(tt_common_entry, node, head, hash_entry) {
		if (!compare_eth(tt_common_entry, data))
72 73
			continue;

74
		if (!atomic_inc_not_zero(&tt_common_entry->refcount))
75 76
			continue;

77
		tt_common_entry_tmp = tt_common_entry;
78 79 80 81
		break;
	}
	rcu_read_unlock();

82
	return tt_common_entry_tmp;
83 84
}

85 86
static struct tt_local_entry *tt_local_hash_find(struct bat_priv *bat_priv,
						 const void *data)
87
{
88 89
	struct tt_common_entry *tt_common_entry;
	struct tt_local_entry *tt_local_entry = NULL;
90

91 92 93 94 95 96
	tt_common_entry = tt_hash_find(bat_priv->tt_local_hash, data);
	if (tt_common_entry)
		tt_local_entry = container_of(tt_common_entry,
					      struct tt_local_entry, common);
	return tt_local_entry;
}
97

98 99 100 101 102
static struct tt_global_entry *tt_global_hash_find(struct bat_priv *bat_priv,
						   const void *data)
{
	struct tt_common_entry *tt_common_entry;
	struct tt_global_entry *tt_global_entry = NULL;
103

104 105 106 107 108
	tt_common_entry = tt_hash_find(bat_priv->tt_global_hash, data);
	if (tt_common_entry)
		tt_global_entry = container_of(tt_common_entry,
					       struct tt_global_entry, common);
	return tt_global_entry;
109 110 111

}

112 113
static void tt_local_entry_free_ref(struct tt_local_entry *tt_local_entry)
{
114 115
	if (atomic_dec_and_test(&tt_local_entry->common.refcount))
		kfree_rcu(tt_local_entry, common.rcu);
116 117
}

118 119
static void tt_global_entry_free_rcu(struct rcu_head *rcu)
{
120
	struct tt_common_entry *tt_common_entry;
121 122
	struct tt_global_entry *tt_global_entry;

123 124 125
	tt_common_entry = container_of(rcu, struct tt_common_entry, rcu);
	tt_global_entry = container_of(tt_common_entry, struct tt_global_entry,
				       common);
126 127 128 129

	kfree(tt_global_entry);
}

130 131
static void tt_global_entry_free_ref(struct tt_global_entry *tt_global_entry)
{
132 133
	if (atomic_dec_and_test(&tt_global_entry->common.refcount)) {
		tt_global_del_orig_list(tt_global_entry);
134 135
		call_rcu(&tt_global_entry->common.rcu,
			 tt_global_entry_free_rcu);
136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151
	}
}

static void tt_orig_list_entry_free_rcu(struct rcu_head *rcu)
{
	struct tt_orig_list_entry *orig_entry;

	orig_entry = container_of(rcu, struct tt_orig_list_entry, rcu);
	atomic_dec(&orig_entry->orig_node->tt_size);
	orig_node_free_ref(orig_entry->orig_node);
	kfree(orig_entry);
}

static void tt_orig_list_entry_free_ref(struct tt_orig_list_entry *orig_entry)
{
	call_rcu(&orig_entry->rcu, tt_orig_list_entry_free_rcu);
152 153
}

154 155
static void tt_local_event(struct bat_priv *bat_priv, const uint8_t *addr,
			   uint8_t flags)
156 157 158 159 160 161 162 163
{
	struct tt_change_node *tt_change_node;

	tt_change_node = kmalloc(sizeof(*tt_change_node), GFP_ATOMIC);

	if (!tt_change_node)
		return;

164
	tt_change_node->change.flags = flags;
165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181
	memcpy(tt_change_node->change.addr, addr, ETH_ALEN);

	spin_lock_bh(&bat_priv->tt_changes_list_lock);
	/* track the change in the OGMinterval list */
	list_add_tail(&tt_change_node->list, &bat_priv->tt_changes_list);
	atomic_inc(&bat_priv->tt_local_changes);
	spin_unlock_bh(&bat_priv->tt_changes_list_lock);

	atomic_set(&bat_priv->tt_ogm_append_cnt, 0);
}

int tt_len(int changes_num)
{
	return changes_num * sizeof(struct tt_change);
}

static int tt_local_init(struct bat_priv *bat_priv)
182
{
183
	if (bat_priv->tt_local_hash)
184
		return 0;
185

186
	bat_priv->tt_local_hash = hash_new(1024);
187

188
	if (!bat_priv->tt_local_hash)
189
		return -ENOMEM;
190

191
	return 0;
192 193
}

194 195
void tt_local_add(struct net_device *soft_iface, const uint8_t *addr,
		  int ifindex)
196 197
{
	struct bat_priv *bat_priv = netdev_priv(soft_iface);
198 199
	struct tt_local_entry *tt_local_entry = NULL;
	struct tt_global_entry *tt_global_entry = NULL;
200 201 202
	struct hlist_head *head;
	struct hlist_node *node;
	struct tt_orig_list_entry *orig_entry;
203
	int hash_added;
204

205
	tt_local_entry = tt_local_hash_find(bat_priv, addr);
206

207 208
	if (tt_local_entry) {
		tt_local_entry->last_seen = jiffies;
209 210
		/* possibly unset the TT_CLIENT_PENDING flag */
		tt_local_entry->common.flags &= ~TT_CLIENT_PENDING;
211
		goto out;
212 213
	}

214
	tt_local_entry = kmalloc(sizeof(*tt_local_entry), GFP_ATOMIC);
215
	if (!tt_local_entry)
216
		goto out;
217 218 219 220

	bat_dbg(DBG_TT, bat_priv,
		"Creating new local tt entry: %pM (ttvn: %d)\n", addr,
		(uint8_t)atomic_read(&bat_priv->ttvn));
221

222 223
	memcpy(tt_local_entry->common.addr, addr, ETH_ALEN);
	tt_local_entry->common.flags = NO_FLAGS;
224
	if (is_wifi_iface(ifindex))
225 226 227
		tt_local_entry->common.flags |= TT_CLIENT_WIFI;
	atomic_set(&tt_local_entry->common.refcount, 2);
	tt_local_entry->last_seen = jiffies;
228 229

	/* the batman interface mac address should never be purged */
230
	if (compare_eth(addr, soft_iface->dev_addr))
231
		tt_local_entry->common.flags |= TT_CLIENT_NOPURGE;
232

233 234 235 236 237
	/* The local entry has to be marked as NEW to avoid to send it in
	 * a full table response going out before the next ttvn increment
	 * (consistency check) */
	tt_local_entry->common.flags |= TT_CLIENT_NEW;

238 239 240 241 242 243 244 245 246 247
	hash_added = hash_add(bat_priv->tt_local_hash, compare_tt, choose_orig,
			 &tt_local_entry->common,
			 &tt_local_entry->common.hash_entry);

	if (unlikely(hash_added != 0)) {
		/* remove the reference for the hash */
		tt_local_entry_free_ref(tt_local_entry);
		goto out;
	}

248
	tt_local_event(bat_priv, addr, tt_local_entry->common.flags);
249

250
	/* remove address from global hash if present */
251
	tt_global_entry = tt_global_hash_find(bat_priv, addr);
252

253 254
	/* Check whether it is a roaming! */
	if (tt_global_entry) {
255 256 257 258 259 260 261 262 263 264 265 266 267
		/* These node are probably going to update their tt table */
		head = &tt_global_entry->orig_list;
		rcu_read_lock();
		hlist_for_each_entry_rcu(orig_entry, node, head, list) {
			orig_entry->orig_node->tt_poss_change = true;

			send_roam_adv(bat_priv, tt_global_entry->common.addr,
				      orig_entry->orig_node);
		}
		rcu_read_unlock();
		/* The global entry has to be marked as ROAMING and
		 * has to be kept for consistency purpose
		 */
D
David S. Miller 已提交
268
		tt_global_entry->common.flags |= TT_CLIENT_ROAM;
269
		tt_global_entry->roam_at = jiffies;
270 271 272 273 274 275
	}
out:
	if (tt_local_entry)
		tt_local_entry_free_ref(tt_local_entry);
	if (tt_global_entry)
		tt_global_entry_free_ref(tt_global_entry);
276 277
}

278 279
int tt_changes_fill_buffer(struct bat_priv *bat_priv,
			   unsigned char *buff, int buff_len)
280
{
281 282
	int count = 0, tot_changes = 0;
	struct tt_change_node *entry, *safe;
283

284 285
	if (buff_len > 0)
		tot_changes = buff_len / tt_len(1);
286

287 288
	spin_lock_bh(&bat_priv->tt_changes_list_lock);
	atomic_set(&bat_priv->tt_local_changes, 0);
289

290
	list_for_each_entry_safe(entry, safe, &bat_priv->tt_changes_list,
291
				 list) {
292 293 294
		if (count < tot_changes) {
			memcpy(buff + tt_len(count),
			       &entry->change, sizeof(struct tt_change));
295 296
			count++;
		}
297 298
		list_del(&entry->list);
		kfree(entry);
299
	}
300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320
	spin_unlock_bh(&bat_priv->tt_changes_list_lock);

	/* Keep the buffer for possible tt_request */
	spin_lock_bh(&bat_priv->tt_buff_lock);
	kfree(bat_priv->tt_buff);
	bat_priv->tt_buff_len = 0;
	bat_priv->tt_buff = NULL;
	/* We check whether this new OGM has no changes due to size
	 * problems */
	if (buff_len > 0) {
		/**
		 * if kmalloc() fails we will reply with the full table
		 * instead of providing the diff
		 */
		bat_priv->tt_buff = kmalloc(buff_len, GFP_ATOMIC);
		if (bat_priv->tt_buff) {
			memcpy(bat_priv->tt_buff, buff, buff_len);
			bat_priv->tt_buff_len = buff_len;
		}
	}
	spin_unlock_bh(&bat_priv->tt_buff_lock);
321

322
	return count;
323 324
}

325
int tt_local_seq_print_text(struct seq_file *seq, void *offset)
326 327 328
{
	struct net_device *net_dev = (struct net_device *)seq->private;
	struct bat_priv *bat_priv = netdev_priv(net_dev);
329
	struct hashtable_t *hash = bat_priv->tt_local_hash;
330
	struct tt_common_entry *tt_common_entry;
331
	struct hard_iface *primary_if;
332
	struct hlist_node *node;
333
	struct hlist_head *head;
334 335
	uint32_t i;
	int ret = 0;
336 337 338

	primary_if = primary_if_get_selected(bat_priv);
	if (!primary_if) {
339 340
		ret = seq_printf(seq,
				 "BATMAN mesh %s disabled - please specify interfaces to enable it\n",
341 342 343
				 net_dev->name);
		goto out;
	}
344

345
	if (primary_if->if_status != IF_ACTIVE) {
346 347
		ret = seq_printf(seq,
				 "BATMAN mesh %s disabled - primary interface not active\n",
348 349
				 net_dev->name);
		goto out;
350 351
	}

352 353
	seq_printf(seq,
		   "Locally retrieved addresses (from %s) announced via TT (TTVN: %u):\n",
354
		   net_dev->name, (uint8_t)atomic_read(&bat_priv->ttvn));
355 356 357 358

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

359
		rcu_read_lock();
360
		hlist_for_each_entry_rcu(tt_common_entry, node,
361
					 head, hash_entry) {
362
			seq_printf(seq, " * %pM [%c%c%c%c%c]\n",
363 364 365 366 367 368 369 370 371 372 373
				   tt_common_entry->addr,
				   (tt_common_entry->flags &
				    TT_CLIENT_ROAM ? 'R' : '.'),
				   (tt_common_entry->flags &
				    TT_CLIENT_NOPURGE ? 'P' : '.'),
				   (tt_common_entry->flags &
				    TT_CLIENT_NEW ? 'N' : '.'),
				   (tt_common_entry->flags &
				    TT_CLIENT_PENDING ? 'X' : '.'),
				   (tt_common_entry->flags &
				    TT_CLIENT_WIFI ? 'W' : '.'));
374
		}
375
		rcu_read_unlock();
376
	}
377 378 379 380
out:
	if (primary_if)
		hardif_free_ref(primary_if);
	return ret;
381 382
}

383 384
static void tt_local_set_pending(struct bat_priv *bat_priv,
				 struct tt_local_entry *tt_local_entry,
385
				 uint16_t flags, const char *message)
386
{
387 388
	tt_local_event(bat_priv, tt_local_entry->common.addr,
		       tt_local_entry->common.flags | flags);
389

390 391
	/* The local client has to be marked as "pending to be removed" but has
	 * to be kept in the table in order to send it in a full table
392
	 * response issued before the net ttvn increment (consistency check) */
393
	tt_local_entry->common.flags |= TT_CLIENT_PENDING;
394

395 396 397
	bat_dbg(DBG_TT, bat_priv,
		"Local tt entry (%pM) pending to be removed: %s\n",
		tt_local_entry->common.addr, message);
398 399
}

400
void tt_local_remove(struct bat_priv *bat_priv, const uint8_t *addr,
401
		     const char *message, bool roaming)
402
{
403
	struct tt_local_entry *tt_local_entry = NULL;
404

405
	tt_local_entry = tt_local_hash_find(bat_priv, addr);
406 407 408
	if (!tt_local_entry)
		goto out;

409
	tt_local_set_pending(bat_priv, tt_local_entry, TT_CLIENT_DEL |
410
			     (roaming ? TT_CLIENT_ROAM : NO_FLAGS), message);
411 412 413
out:
	if (tt_local_entry)
		tt_local_entry_free_ref(tt_local_entry);
414 415
}

416
static void tt_local_purge(struct bat_priv *bat_priv)
417
{
418 419
	struct hashtable_t *hash = bat_priv->tt_local_hash;
	struct tt_local_entry *tt_local_entry;
420
	struct tt_common_entry *tt_common_entry;
421
	struct hlist_node *node, *node_tmp;
422
	struct hlist_head *head;
423
	spinlock_t *list_lock; /* protects write access to the hash lists */
424
	uint32_t i;
425 426 427

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

430
		spin_lock_bh(list_lock);
431
		hlist_for_each_entry_safe(tt_common_entry, node, node_tmp,
432
					  head, hash_entry) {
433 434 435 436
			tt_local_entry = container_of(tt_common_entry,
						      struct tt_local_entry,
						      common);
			if (tt_local_entry->common.flags & TT_CLIENT_NOPURGE)
437
				continue;
438

439
			/* entry already marked for deletion */
440
			if (tt_local_entry->common.flags & TT_CLIENT_PENDING)
441 442
				continue;

443
			if (!has_timed_out(tt_local_entry->last_seen,
444
					   TT_LOCAL_TIMEOUT))
445 446
				continue;

447
			tt_local_set_pending(bat_priv, tt_local_entry,
448
					     TT_CLIENT_DEL, "timed out");
449
		}
450
		spin_unlock_bh(list_lock);
451 452 453 454
	}

}

455
static void tt_local_table_free(struct bat_priv *bat_priv)
456
{
457 458
	struct hashtable_t *hash;
	spinlock_t *list_lock; /* protects write access to the hash lists */
459
	struct tt_common_entry *tt_common_entry;
460
	struct tt_local_entry *tt_local_entry;
461 462
	struct hlist_node *node, *node_tmp;
	struct hlist_head *head;
463
	uint32_t i;
464

465
	if (!bat_priv->tt_local_hash)
466 467
		return;

468 469 470 471 472 473 474
	hash = bat_priv->tt_local_hash;

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

		spin_lock_bh(list_lock);
475
		hlist_for_each_entry_safe(tt_common_entry, node, node_tmp,
476 477
					  head, hash_entry) {
			hlist_del_rcu(node);
478 479 480
			tt_local_entry = container_of(tt_common_entry,
						      struct tt_local_entry,
						      common);
481
			tt_local_entry_free_ref(tt_local_entry);
482 483 484 485 486 487
		}
		spin_unlock_bh(list_lock);
	}

	hash_destroy(hash);

488
	bat_priv->tt_local_hash = NULL;
489 490
}

491
static int tt_global_init(struct bat_priv *bat_priv)
492
{
493
	if (bat_priv->tt_global_hash)
494
		return 0;
495

496
	bat_priv->tt_global_hash = hash_new(1024);
497

498
	if (!bat_priv->tt_global_hash)
499
		return -ENOMEM;
500

501
	return 0;
502 503
}

504
static void tt_changes_list_free(struct bat_priv *bat_priv)
505
{
506
	struct tt_change_node *entry, *safe;
507

508
	spin_lock_bh(&bat_priv->tt_changes_list_lock);
509

510 511 512 513 514
	list_for_each_entry_safe(entry, safe, &bat_priv->tt_changes_list,
				 list) {
		list_del(&entry->list);
		kfree(entry);
	}
515

516 517 518
	atomic_set(&bat_priv->tt_local_changes, 0);
	spin_unlock_bh(&bat_priv->tt_changes_list_lock);
}
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 551 552 553 554 555 556 557 558 559 560 561 562 563 564
/* find out if an orig_node is already in the list of a tt_global_entry.
 * returns 1 if found, 0 otherwise
 */
static bool tt_global_entry_has_orig(const struct tt_global_entry *entry,
				     const struct orig_node *orig_node)
{
	struct tt_orig_list_entry *tmp_orig_entry;
	const struct hlist_head *head;
	struct hlist_node *node;
	bool found = false;

	rcu_read_lock();
	head = &entry->orig_list;
	hlist_for_each_entry_rcu(tmp_orig_entry, node, head, list) {
		if (tmp_orig_entry->orig_node == orig_node) {
			found = true;
			break;
		}
	}
	rcu_read_unlock();
	return found;
}

static void tt_global_add_orig_entry(struct tt_global_entry *tt_global_entry,
				     struct orig_node *orig_node,
				     int ttvn)
{
	struct tt_orig_list_entry *orig_entry;

	orig_entry = kzalloc(sizeof(*orig_entry), GFP_ATOMIC);
	if (!orig_entry)
		return;

	INIT_HLIST_NODE(&orig_entry->list);
	atomic_inc(&orig_node->refcount);
	atomic_inc(&orig_node->tt_size);
	orig_entry->orig_node = orig_node;
	orig_entry->ttvn = ttvn;

	spin_lock_bh(&tt_global_entry->list_lock);
	hlist_add_head_rcu(&orig_entry->list,
			   &tt_global_entry->orig_list);
	spin_unlock_bh(&tt_global_entry->list_lock);
}

565 566
/* caller must hold orig_node refcount */
int tt_global_add(struct bat_priv *bat_priv, struct orig_node *orig_node,
567 568
		  const unsigned char *tt_addr, uint8_t ttvn, bool roaming,
		  bool wifi)
569
{
570
	struct tt_global_entry *tt_global_entry = NULL;
571
	int ret = 0;
572
	int hash_added;
573

574 575 576
	tt_global_entry = tt_global_hash_find(bat_priv, tt_addr);

	if (!tt_global_entry) {
577 578
		tt_global_entry = kzalloc(sizeof(*tt_global_entry),
					  GFP_ATOMIC);
579
		if (!tt_global_entry)
580 581
			goto out;

582
		memcpy(tt_global_entry->common.addr, tt_addr, ETH_ALEN);
583

584
		tt_global_entry->common.flags = NO_FLAGS;
585
		tt_global_entry->roam_at = 0;
586 587 588 589
		atomic_set(&tt_global_entry->common.refcount, 2);

		INIT_HLIST_HEAD(&tt_global_entry->orig_list);
		spin_lock_init(&tt_global_entry->list_lock);
590

591 592 593 594 595 596 597 598 599
		hash_added = hash_add(bat_priv->tt_global_hash, compare_tt,
				 choose_orig, &tt_global_entry->common,
				 &tt_global_entry->common.hash_entry);

		if (unlikely(hash_added != 0)) {
			/* remove the reference for the hash */
			tt_global_entry_free_ref(tt_global_entry);
			goto out_remove;
		}
600 601

		tt_global_add_orig_entry(tt_global_entry, orig_node, ttvn);
602
	} else {
603 604 605 606 607 608 609 610 611 612 613 614 615
		/* there is already a global entry, use this one. */

		/* If there is the TT_CLIENT_ROAM flag set, there is only one
		 * originator left in the list and we previously received a
		 * delete + roaming change for this originator.
		 *
		 * We should first delete the old originator before adding the
		 * new one.
		 */
		if (tt_global_entry->common.flags & TT_CLIENT_ROAM) {
			tt_global_del_orig_list(tt_global_entry);
			tt_global_entry->common.flags &= ~TT_CLIENT_ROAM;
			tt_global_entry->roam_at = 0;
616
		}
617 618 619 620

		if (!tt_global_entry_has_orig(tt_global_entry, orig_node))
			tt_global_add_orig_entry(tt_global_entry, orig_node,
						 ttvn);
621
	}
622

623
	if (wifi)
624
		tt_global_entry->common.flags |= TT_CLIENT_WIFI;
625

626 627
	bat_dbg(DBG_TT, bat_priv,
		"Creating new global tt entry: %pM (via %pM)\n",
628
		tt_global_entry->common.addr, orig_node->orig);
629

630
out_remove:
631
	/* remove address from local hash if present */
632
	tt_local_remove(bat_priv, tt_global_entry->common.addr,
633 634 635 636 637 638
			"global tt received", roaming);
	ret = 1;
out:
	if (tt_global_entry)
		tt_global_entry_free_ref(tt_global_entry);
	return ret;
639 640
}

641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668
/* print all orig nodes who announce the address for this global entry.
 * it is assumed that the caller holds rcu_read_lock();
 */
static void tt_global_print_entry(struct tt_global_entry *tt_global_entry,
				  struct seq_file *seq)
{
	struct hlist_head *head;
	struct hlist_node *node;
	struct tt_orig_list_entry *orig_entry;
	struct tt_common_entry *tt_common_entry;
	uint16_t flags;
	uint8_t last_ttvn;

	tt_common_entry = &tt_global_entry->common;

	head = &tt_global_entry->orig_list;

	hlist_for_each_entry_rcu(orig_entry, node, head, list) {
		flags = tt_common_entry->flags;
		last_ttvn = atomic_read(&orig_entry->orig_node->last_ttvn);
		seq_printf(seq, " * %pM  (%3u) via %pM     (%3u)   [%c%c]\n",
			   tt_global_entry->common.addr, orig_entry->ttvn,
			   orig_entry->orig_node->orig, last_ttvn,
			   (flags & TT_CLIENT_ROAM ? 'R' : '.'),
			   (flags & TT_CLIENT_WIFI ? 'W' : '.'));
	}
}

669
int tt_global_seq_print_text(struct seq_file *seq, void *offset)
670 671 672
{
	struct net_device *net_dev = (struct net_device *)seq->private;
	struct bat_priv *bat_priv = netdev_priv(net_dev);
673
	struct hashtable_t *hash = bat_priv->tt_global_hash;
674
	struct tt_common_entry *tt_common_entry;
675
	struct tt_global_entry *tt_global_entry;
676
	struct hard_iface *primary_if;
677
	struct hlist_node *node;
678
	struct hlist_head *head;
679 680
	uint32_t i;
	int ret = 0;
681 682 683

	primary_if = primary_if_get_selected(bat_priv);
	if (!primary_if) {
684 685
		ret = seq_printf(seq,
				 "BATMAN mesh %s disabled - please specify interfaces to enable it\n",
686 687 688
				 net_dev->name);
		goto out;
	}
689

690
	if (primary_if->if_status != IF_ACTIVE) {
691 692
		ret = seq_printf(seq,
				 "BATMAN mesh %s disabled - primary interface not active\n",
693 694
				 net_dev->name);
		goto out;
695 696
	}

697 698
	seq_printf(seq,
		   "Globally announced TT entries received via the mesh %s\n",
699
		   net_dev->name);
700 701
	seq_printf(seq, "       %-13s %s       %-15s %s %s\n",
		   "Client", "(TTVN)", "Originator", "(Curr TTVN)", "Flags");
702 703 704 705

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

706
		rcu_read_lock();
707
		hlist_for_each_entry_rcu(tt_common_entry, node,
708
					 head, hash_entry) {
709 710 711
			tt_global_entry = container_of(tt_common_entry,
						       struct tt_global_entry,
						       common);
712
			tt_global_print_entry(tt_global_entry, seq);
713
		}
714
		rcu_read_unlock();
715
	}
716 717 718 719
out:
	if (primary_if)
		hardif_free_ref(primary_if);
	return ret;
720 721
}

722 723
/* deletes the orig list of a tt_global_entry */
static void tt_global_del_orig_list(struct tt_global_entry *tt_global_entry)
724
{
725 726 727
	struct hlist_head *head;
	struct hlist_node *node, *safe;
	struct tt_orig_list_entry *orig_entry;
728

729 730 731 732 733 734 735
	spin_lock_bh(&tt_global_entry->list_lock);
	head = &tt_global_entry->orig_list;
	hlist_for_each_entry_safe(orig_entry, node, safe, head, list) {
		hlist_del_rcu(node);
		tt_orig_list_entry_free_ref(orig_entry);
	}
	spin_unlock_bh(&tt_global_entry->list_lock);
736

737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769
}

static void tt_global_del_orig_entry(struct bat_priv *bat_priv,
				     struct tt_global_entry *tt_global_entry,
				     struct orig_node *orig_node,
				     const char *message)
{
	struct hlist_head *head;
	struct hlist_node *node, *safe;
	struct tt_orig_list_entry *orig_entry;

	spin_lock_bh(&tt_global_entry->list_lock);
	head = &tt_global_entry->orig_list;
	hlist_for_each_entry_safe(orig_entry, node, safe, head, list) {
		if (orig_entry->orig_node == orig_node) {
			bat_dbg(DBG_TT, bat_priv,
				"Deleting %pM from global tt entry %pM: %s\n",
				orig_node->orig, tt_global_entry->common.addr,
				message);
			hlist_del_rcu(node);
			tt_orig_list_entry_free_ref(orig_entry);
		}
	}
	spin_unlock_bh(&tt_global_entry->list_lock);
}

static void tt_global_del_struct(struct bat_priv *bat_priv,
				 struct tt_global_entry *tt_global_entry,
				 const char *message)
{
	bat_dbg(DBG_TT, bat_priv,
		"Deleting global tt entry %pM: %s\n",
		tt_global_entry->common.addr, message);
770

771 772
	hash_remove(bat_priv->tt_global_hash, compare_tt, choose_orig,
		    tt_global_entry->common.addr);
773 774
	tt_global_entry_free_ref(tt_global_entry);

775 776
}

777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818
/* If the client is to be deleted, we check if it is the last origantor entry
 * within tt_global entry. If yes, we set the TT_CLIENT_ROAM flag and the timer,
 * otherwise we simply remove the originator scheduled for deletion.
 */
static void tt_global_del_roaming(struct bat_priv *bat_priv,
				  struct tt_global_entry *tt_global_entry,
				  struct orig_node *orig_node,
				  const char *message)
{
	bool last_entry = true;
	struct hlist_head *head;
	struct hlist_node *node;
	struct tt_orig_list_entry *orig_entry;

	/* no local entry exists, case 1:
	 * Check if this is the last one or if other entries exist.
	 */

	rcu_read_lock();
	head = &tt_global_entry->orig_list;
	hlist_for_each_entry_rcu(orig_entry, node, head, list) {
		if (orig_entry->orig_node != orig_node) {
			last_entry = false;
			break;
		}
	}
	rcu_read_unlock();

	if (last_entry) {
		/* its the last one, mark for roaming. */
		tt_global_entry->common.flags |= TT_CLIENT_ROAM;
		tt_global_entry->roam_at = jiffies;
	} else
		/* there is another entry, we can simply delete this
		 * one and can still use the other one.
		 */
		tt_global_del_orig_entry(bat_priv, tt_global_entry,
					 orig_node, message);
}



819 820 821 822
static void tt_global_del(struct bat_priv *bat_priv,
			  struct orig_node *orig_node,
			  const unsigned char *addr,
			  const char *message, bool roaming)
823
{
824
	struct tt_global_entry *tt_global_entry = NULL;
825
	struct tt_local_entry *tt_local_entry = NULL;
826 827

	tt_global_entry = tt_global_hash_find(bat_priv, addr);
828
	if (!tt_global_entry)
829
		goto out;
830

831 832 833 834 835 836 837 838 839 840
	if (!roaming) {
		tt_global_del_orig_entry(bat_priv, tt_global_entry, orig_node,
					 message);

		if (hlist_empty(&tt_global_entry->orig_list))
			tt_global_del_struct(bat_priv, tt_global_entry,
					     message);

		goto out;
	}
841 842 843

	/* if we are deleting a global entry due to a roam
	 * event, there are two possibilities:
844 845
	 * 1) the client roamed from node A to node B => if there
	 *    is only one originator left for this client, we mark
846 847 848
	 *    it with TT_CLIENT_ROAM, we start a timer and we
	 *    wait for node B to claim it. In case of timeout
	 *    the entry is purged.
849 850 851
	 *
	 *    If there are other originators left, we directly delete
	 *    the originator.
852 853
	 * 2) the client roamed to us => we can directly delete
	 *    the global entry, since it is useless now. */
854

855 856
	tt_local_entry = tt_local_hash_find(bat_priv,
					    tt_global_entry->common.addr);
857 858 859 860 861 862 863 864
	if (tt_local_entry) {
		/* local entry exists, case 2: client roamed to us. */
		tt_global_del_orig_list(tt_global_entry);
		tt_global_del_struct(bat_priv, tt_global_entry, message);
	} else
		/* no local entry exists, case 1: check for roaming */
		tt_global_del_roaming(bat_priv, tt_global_entry, orig_node,
				      message);
865 866


867
out:
868 869
	if (tt_global_entry)
		tt_global_entry_free_ref(tt_global_entry);
870 871
	if (tt_local_entry)
		tt_local_entry_free_ref(tt_local_entry);
872 873
}

874
void tt_global_del_orig(struct bat_priv *bat_priv,
875
			struct orig_node *orig_node, const char *message)
876
{
877
	struct tt_global_entry *tt_global_entry;
878
	struct tt_common_entry *tt_common_entry;
879
	uint32_t i;
880 881 882
	struct hashtable_t *hash = bat_priv->tt_global_hash;
	struct hlist_node *node, *safe;
	struct hlist_head *head;
883
	spinlock_t *list_lock; /* protects write access to the hash lists */
884

885 886 887
	if (!hash)
		return;

888 889
	for (i = 0; i < hash->size; i++) {
		head = &hash->table[i];
890
		list_lock = &hash->list_locks[i];
891

892
		spin_lock_bh(list_lock);
893
		hlist_for_each_entry_safe(tt_common_entry, node, safe,
894
					  head, hash_entry) {
895 896 897
			tt_global_entry = container_of(tt_common_entry,
						       struct tt_global_entry,
						       common);
898 899 900 901 902

			tt_global_del_orig_entry(bat_priv, tt_global_entry,
						 orig_node, message);

			if (hlist_empty(&tt_global_entry->orig_list)) {
903
				bat_dbg(DBG_TT, bat_priv,
904
					"Deleting global tt entry %pM: %s\n",
905
					tt_global_entry->common.addr,
906
					message);
907 908 909
				hlist_del_rcu(node);
				tt_global_entry_free_ref(tt_global_entry);
			}
910
		}
911
		spin_unlock_bh(list_lock);
912
	}
913
	atomic_set(&orig_node->tt_size, 0);
914
	orig_node->tt_initialised = false;
915 916
}

917 918 919
static void tt_global_roam_purge(struct bat_priv *bat_priv)
{
	struct hashtable_t *hash = bat_priv->tt_global_hash;
920
	struct tt_common_entry *tt_common_entry;
921 922 923
	struct tt_global_entry *tt_global_entry;
	struct hlist_node *node, *node_tmp;
	struct hlist_head *head;
924
	spinlock_t *list_lock; /* protects write access to the hash lists */
925
	uint32_t i;
926 927 928

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

931
		spin_lock_bh(list_lock);
932
		hlist_for_each_entry_safe(tt_common_entry, node, node_tmp,
933
					  head, hash_entry) {
934 935 936 937
			tt_global_entry = container_of(tt_common_entry,
						       struct tt_global_entry,
						       common);
			if (!(tt_global_entry->common.flags & TT_CLIENT_ROAM))
938
				continue;
939
			if (!has_timed_out(tt_global_entry->roam_at,
940
					   TT_CLIENT_ROAM_TIMEOUT))
941 942
				continue;

943 944
			bat_dbg(DBG_TT, bat_priv,
				"Deleting global tt entry (%pM): Roaming timeout\n",
945
				tt_global_entry->common.addr);
946

947 948
			hlist_del_rcu(node);
			tt_global_entry_free_ref(tt_global_entry);
949
		}
950
		spin_unlock_bh(list_lock);
951 952 953 954
	}

}

955
static void tt_global_table_free(struct bat_priv *bat_priv)
956
{
957 958
	struct hashtable_t *hash;
	spinlock_t *list_lock; /* protects write access to the hash lists */
959
	struct tt_common_entry *tt_common_entry;
960 961 962
	struct tt_global_entry *tt_global_entry;
	struct hlist_node *node, *node_tmp;
	struct hlist_head *head;
963
	uint32_t i;
964

965
	if (!bat_priv->tt_global_hash)
966 967
		return;

968 969 970 971 972 973 974
	hash = bat_priv->tt_global_hash;

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

		spin_lock_bh(list_lock);
975
		hlist_for_each_entry_safe(tt_common_entry, node, node_tmp,
976 977
					  head, hash_entry) {
			hlist_del_rcu(node);
978 979 980
			tt_global_entry = container_of(tt_common_entry,
						       struct tt_global_entry,
						       common);
981 982 983 984 985 986 987
			tt_global_entry_free_ref(tt_global_entry);
		}
		spin_unlock_bh(list_lock);
	}

	hash_destroy(hash);

988
	bat_priv->tt_global_hash = NULL;
989 990
}

991 992 993 994 995
static bool _is_ap_isolated(struct tt_local_entry *tt_local_entry,
			    struct tt_global_entry *tt_global_entry)
{
	bool ret = false;

996 997
	if (tt_local_entry->common.flags & TT_CLIENT_WIFI &&
	    tt_global_entry->common.flags & TT_CLIENT_WIFI)
998 999 1000 1001 1002
		ret = true;

	return ret;
}

1003
struct orig_node *transtable_search(struct bat_priv *bat_priv,
1004
				    const uint8_t *src, const uint8_t *addr)
1005
{
1006 1007
	struct tt_local_entry *tt_local_entry = NULL;
	struct tt_global_entry *tt_global_entry = NULL;
1008
	struct orig_node *orig_node = NULL;
1009 1010 1011 1012 1013
	struct neigh_node *router = NULL;
	struct hlist_head *head;
	struct hlist_node *node;
	struct tt_orig_list_entry *orig_entry;
	int best_tq;
1014

1015 1016 1017 1018 1019
	if (src && atomic_read(&bat_priv->ap_isolation)) {
		tt_local_entry = tt_local_hash_find(bat_priv, src);
		if (!tt_local_entry)
			goto out;
	}
1020

1021
	tt_global_entry = tt_global_hash_find(bat_priv, addr);
1022
	if (!tt_global_entry)
1023
		goto out;
1024

1025 1026 1027 1028 1029
	/* check whether the clients should not communicate due to AP
	 * isolation */
	if (tt_local_entry && _is_ap_isolated(tt_local_entry, tt_global_entry))
		goto out;

1030
	best_tq = 0;
1031

1032 1033 1034 1035 1036 1037
	rcu_read_lock();
	head = &tt_global_entry->orig_list;
	hlist_for_each_entry_rcu(orig_entry, node, head, list) {
		router = orig_node_get_router(orig_entry->orig_node);
		if (!router)
			continue;
1038

1039 1040 1041 1042 1043 1044 1045 1046 1047 1048
		if (router->tq_avg > best_tq) {
			orig_node = orig_entry->orig_node;
			best_tq = router->tq_avg;
		}
		neigh_node_free_ref(router);
	}
	/* found anything? */
	if (orig_node && !atomic_inc_not_zero(&orig_node->refcount))
		orig_node = NULL;
	rcu_read_unlock();
1049
out:
1050 1051 1052 1053 1054
	if (tt_global_entry)
		tt_global_entry_free_ref(tt_global_entry);
	if (tt_local_entry)
		tt_local_entry_free_ref(tt_local_entry);

1055
	return orig_node;
1056
}
1057 1058

/* Calculates the checksum of the local table of a given orig_node */
1059 1060
static uint16_t tt_global_crc(struct bat_priv *bat_priv,
			      struct orig_node *orig_node)
1061 1062 1063
{
	uint16_t total = 0, total_one;
	struct hashtable_t *hash = bat_priv->tt_global_hash;
1064
	struct tt_common_entry *tt_common_entry;
1065 1066 1067
	struct tt_global_entry *tt_global_entry;
	struct hlist_node *node;
	struct hlist_head *head;
1068 1069
	uint32_t i;
	int j;
1070 1071 1072 1073 1074

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

		rcu_read_lock();
1075
		hlist_for_each_entry_rcu(tt_common_entry, node,
1076
					 head, hash_entry) {
1077 1078 1079
			tt_global_entry = container_of(tt_common_entry,
						       struct tt_global_entry,
						       common);
1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099
			/* Roaming clients are in the global table for
			 * consistency only. They don't have to be
			 * taken into account while computing the
			 * global crc
			 */
			if (tt_global_entry->common.flags & TT_CLIENT_ROAM)
				continue;

			/* find out if this global entry is announced by this
			 * originator
			 */
			if (!tt_global_entry_has_orig(tt_global_entry,
						      orig_node))
				continue;

			total_one = 0;
			for (j = 0; j < ETH_ALEN; j++)
				total_one = crc16_byte(total_one,
					tt_global_entry->common.addr[j]);
			total ^= total_one;
1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111
		}
		rcu_read_unlock();
	}

	return total;
}

/* Calculates the checksum of the local table */
uint16_t tt_local_crc(struct bat_priv *bat_priv)
{
	uint16_t total = 0, total_one;
	struct hashtable_t *hash = bat_priv->tt_local_hash;
1112
	struct tt_common_entry *tt_common_entry;
1113 1114
	struct hlist_node *node;
	struct hlist_head *head;
1115 1116
	uint32_t i;
	int j;
1117 1118 1119 1120 1121

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

		rcu_read_lock();
1122
		hlist_for_each_entry_rcu(tt_common_entry, node,
1123
					 head, hash_entry) {
1124 1125
			/* not yet committed clients have not to be taken into
			 * account while computing the CRC */
1126
			if (tt_common_entry->flags & TT_CLIENT_NEW)
1127
				continue;
1128 1129 1130
			total_one = 0;
			for (j = 0; j < ETH_ALEN; j++)
				total_one = crc16_byte(total_one,
1131
						   tt_common_entry->addr[j]);
1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153
			total ^= total_one;
		}
		rcu_read_unlock();
	}

	return total;
}

static void tt_req_list_free(struct bat_priv *bat_priv)
{
	struct tt_req_node *node, *safe;

	spin_lock_bh(&bat_priv->tt_req_list_lock);

	list_for_each_entry_safe(node, safe, &bat_priv->tt_req_list, list) {
		list_del(&node->list);
		kfree(node);
	}

	spin_unlock_bh(&bat_priv->tt_req_list_lock);
}

1154 1155 1156 1157
static void tt_save_orig_buffer(struct bat_priv *bat_priv,
				struct orig_node *orig_node,
				const unsigned char *tt_buff,
				uint8_t tt_num_changes)
1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181
{
	uint16_t tt_buff_len = tt_len(tt_num_changes);

	/* Replace the old buffer only if I received something in the
	 * last OGM (the OGM could carry no changes) */
	spin_lock_bh(&orig_node->tt_buff_lock);
	if (tt_buff_len > 0) {
		kfree(orig_node->tt_buff);
		orig_node->tt_buff_len = 0;
		orig_node->tt_buff = kmalloc(tt_buff_len, GFP_ATOMIC);
		if (orig_node->tt_buff) {
			memcpy(orig_node->tt_buff, tt_buff, tt_buff_len);
			orig_node->tt_buff_len = tt_buff_len;
		}
	}
	spin_unlock_bh(&orig_node->tt_buff_lock);
}

static void tt_req_purge(struct bat_priv *bat_priv)
{
	struct tt_req_node *node, *safe;

	spin_lock_bh(&bat_priv->tt_req_list_lock);
	list_for_each_entry_safe(node, safe, &bat_priv->tt_req_list, list) {
1182
		if (has_timed_out(node->issued_at, TT_REQUEST_TIMEOUT)) {
1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199
			list_del(&node->list);
			kfree(node);
		}
	}
	spin_unlock_bh(&bat_priv->tt_req_list_lock);
}

/* returns the pointer to the new tt_req_node struct if no request
 * has already been issued for this orig_node, NULL otherwise */
static struct tt_req_node *new_tt_req_node(struct bat_priv *bat_priv,
					  struct orig_node *orig_node)
{
	struct tt_req_node *tt_req_node_tmp, *tt_req_node = NULL;

	spin_lock_bh(&bat_priv->tt_req_list_lock);
	list_for_each_entry(tt_req_node_tmp, &bat_priv->tt_req_list, list) {
		if (compare_eth(tt_req_node_tmp, orig_node) &&
1200
		    !has_timed_out(tt_req_node_tmp->issued_at,
1201
				   TT_REQUEST_TIMEOUT))
1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217
			goto unlock;
	}

	tt_req_node = kmalloc(sizeof(*tt_req_node), GFP_ATOMIC);
	if (!tt_req_node)
		goto unlock;

	memcpy(tt_req_node->addr, orig_node->orig, ETH_ALEN);
	tt_req_node->issued_at = jiffies;

	list_add(&tt_req_node->list, &bat_priv->tt_req_list);
unlock:
	spin_unlock_bh(&bat_priv->tt_req_list_lock);
	return tt_req_node;
}

1218 1219 1220
/* data_ptr is useless here, but has to be kept to respect the prototype */
static int tt_local_valid_entry(const void *entry_ptr, const void *data_ptr)
{
1221
	const struct tt_common_entry *tt_common_entry = entry_ptr;
1222

1223
	if (tt_common_entry->flags & TT_CLIENT_NEW)
1224 1225 1226 1227
		return 0;
	return 1;
}

1228 1229
static int tt_global_valid_entry(const void *entry_ptr, const void *data_ptr)
{
1230 1231
	const struct tt_common_entry *tt_common_entry = entry_ptr;
	const struct tt_global_entry *tt_global_entry;
1232 1233
	const struct orig_node *orig_node = data_ptr;

1234
	if (tt_common_entry->flags & TT_CLIENT_ROAM)
1235 1236
		return 0;

1237 1238 1239
	tt_global_entry = container_of(tt_common_entry, struct tt_global_entry,
				       common);

1240
	return tt_global_entry_has_orig(tt_global_entry, orig_node);
1241 1242 1243 1244 1245 1246 1247 1248 1249
}

static struct sk_buff *tt_response_fill_table(uint16_t tt_len, uint8_t ttvn,
					      struct hashtable_t *hash,
					      struct hard_iface *primary_if,
					      int (*valid_cb)(const void *,
							      const void *),
					      void *cb_data)
{
1250
	struct tt_common_entry *tt_common_entry;
1251 1252 1253 1254 1255 1256 1257
	struct tt_query_packet *tt_response;
	struct tt_change *tt_change;
	struct hlist_node *node;
	struct hlist_head *head;
	struct sk_buff *skb = NULL;
	uint16_t tt_tot, tt_count;
	ssize_t tt_query_size = sizeof(struct tt_query_packet);
1258
	uint32_t i;
1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281

	if (tt_query_size + tt_len > primary_if->soft_iface->mtu) {
		tt_len = primary_if->soft_iface->mtu - tt_query_size;
		tt_len -= tt_len % sizeof(struct tt_change);
	}
	tt_tot = tt_len / sizeof(struct tt_change);

	skb = dev_alloc_skb(tt_query_size + tt_len + ETH_HLEN);
	if (!skb)
		goto out;

	skb_reserve(skb, ETH_HLEN);
	tt_response = (struct tt_query_packet *)skb_put(skb,
						     tt_query_size + tt_len);
	tt_response->ttvn = ttvn;

	tt_change = (struct tt_change *)(skb->data + tt_query_size);
	tt_count = 0;

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

1282
		hlist_for_each_entry_rcu(tt_common_entry, node,
1283 1284 1285 1286
					 head, hash_entry) {
			if (tt_count == tt_tot)
				break;

1287
			if ((valid_cb) && (!valid_cb(tt_common_entry, cb_data)))
1288 1289
				continue;

1290 1291
			memcpy(tt_change->addr, tt_common_entry->addr,
			       ETH_ALEN);
1292 1293 1294 1295 1296 1297 1298 1299
			tt_change->flags = NO_FLAGS;

			tt_count++;
			tt_change++;
		}
	}
	rcu_read_unlock();

1300 1301 1302 1303
	/* store in the message the number of entries we have successfully
	 * copied */
	tt_response->tt_data = htons(tt_count);

1304 1305 1306 1307
out:
	return skb;
}

1308 1309 1310
static int send_tt_request(struct bat_priv *bat_priv,
			   struct orig_node *dst_orig_node,
			   uint8_t ttvn, uint16_t tt_crc, bool full_table)
1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337
{
	struct sk_buff *skb = NULL;
	struct tt_query_packet *tt_request;
	struct neigh_node *neigh_node = NULL;
	struct hard_iface *primary_if;
	struct tt_req_node *tt_req_node = NULL;
	int ret = 1;

	primary_if = primary_if_get_selected(bat_priv);
	if (!primary_if)
		goto out;

	/* The new tt_req will be issued only if I'm not waiting for a
	 * reply from the same orig_node yet */
	tt_req_node = new_tt_req_node(bat_priv, dst_orig_node);
	if (!tt_req_node)
		goto out;

	skb = dev_alloc_skb(sizeof(struct tt_query_packet) + ETH_HLEN);
	if (!skb)
		goto out;

	skb_reserve(skb, ETH_HLEN);

	tt_request = (struct tt_query_packet *)skb_put(skb,
				sizeof(struct tt_query_packet));

1338 1339
	tt_request->header.packet_type = BAT_TT_QUERY;
	tt_request->header.version = COMPAT_VERSION;
1340 1341
	memcpy(tt_request->src, primary_if->net_dev->dev_addr, ETH_ALEN);
	memcpy(tt_request->dst, dst_orig_node->orig, ETH_ALEN);
1342
	tt_request->header.ttl = TTL;
1343
	tt_request->ttvn = ttvn;
1344
	tt_request->tt_data = htons(tt_crc);
1345 1346 1347 1348 1349 1350 1351 1352 1353
	tt_request->flags = TT_REQUEST;

	if (full_table)
		tt_request->flags |= TT_FULL_TABLE;

	neigh_node = orig_node_get_router(dst_orig_node);
	if (!neigh_node)
		goto out;

1354 1355 1356
	bat_dbg(DBG_TT, bat_priv,
		"Sending TT_REQUEST to %pM via %pM [%c]\n",
		dst_orig_node->orig, neigh_node->addr,
1357 1358
		(full_table ? 'F' : '.'));

1359 1360
	batadv_inc_counter(bat_priv, BAT_CNT_TT_REQUEST_TX);

1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394
	send_skb_packet(skb, neigh_node->if_incoming, neigh_node->addr);
	ret = 0;

out:
	if (neigh_node)
		neigh_node_free_ref(neigh_node);
	if (primary_if)
		hardif_free_ref(primary_if);
	if (ret)
		kfree_skb(skb);
	if (ret && tt_req_node) {
		spin_lock_bh(&bat_priv->tt_req_list_lock);
		list_del(&tt_req_node->list);
		spin_unlock_bh(&bat_priv->tt_req_list_lock);
		kfree(tt_req_node);
	}
	return ret;
}

static bool send_other_tt_response(struct bat_priv *bat_priv,
				   struct tt_query_packet *tt_request)
{
	struct orig_node *req_dst_orig_node = NULL, *res_dst_orig_node = NULL;
	struct neigh_node *neigh_node = NULL;
	struct hard_iface *primary_if = NULL;
	uint8_t orig_ttvn, req_ttvn, ttvn;
	int ret = false;
	unsigned char *tt_buff;
	bool full_table;
	uint16_t tt_len, tt_tot;
	struct sk_buff *skb = NULL;
	struct tt_query_packet *tt_response;

	bat_dbg(DBG_TT, bat_priv,
1395 1396
		"Received TT_REQUEST from %pM for ttvn: %u (%pM) [%c]\n",
		tt_request->src, tt_request->ttvn, tt_request->dst,
1397 1398 1399
		(tt_request->flags & TT_FULL_TABLE ? 'F' : '.'));

	/* Let's get the orig node of the REAL destination */
1400
	req_dst_orig_node = orig_hash_find(bat_priv, tt_request->dst);
1401 1402 1403
	if (!req_dst_orig_node)
		goto out;

1404
	res_dst_orig_node = orig_hash_find(bat_priv, tt_request->src);
1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418
	if (!res_dst_orig_node)
		goto out;

	neigh_node = orig_node_get_router(res_dst_orig_node);
	if (!neigh_node)
		goto out;

	primary_if = primary_if_get_selected(bat_priv);
	if (!primary_if)
		goto out;

	orig_ttvn = (uint8_t)atomic_read(&req_dst_orig_node->last_ttvn);
	req_ttvn = tt_request->ttvn;

1419
	/* I don't have the requested data */
1420
	if (orig_ttvn != req_ttvn ||
1421
	    tt_request->tt_data != htons(req_dst_orig_node->tt_crc))
1422 1423
		goto out;

1424
	/* If the full table has been explicitly requested */
1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469
	if (tt_request->flags & TT_FULL_TABLE ||
	    !req_dst_orig_node->tt_buff)
		full_table = true;
	else
		full_table = false;

	/* In this version, fragmentation is not implemented, then
	 * I'll send only one packet with as much TT entries as I can */
	if (!full_table) {
		spin_lock_bh(&req_dst_orig_node->tt_buff_lock);
		tt_len = req_dst_orig_node->tt_buff_len;
		tt_tot = tt_len / sizeof(struct tt_change);

		skb = dev_alloc_skb(sizeof(struct tt_query_packet) +
				    tt_len + ETH_HLEN);
		if (!skb)
			goto unlock;

		skb_reserve(skb, ETH_HLEN);
		tt_response = (struct tt_query_packet *)skb_put(skb,
				sizeof(struct tt_query_packet) + tt_len);
		tt_response->ttvn = req_ttvn;
		tt_response->tt_data = htons(tt_tot);

		tt_buff = skb->data + sizeof(struct tt_query_packet);
		/* Copy the last orig_node's OGM buffer */
		memcpy(tt_buff, req_dst_orig_node->tt_buff,
		       req_dst_orig_node->tt_buff_len);

		spin_unlock_bh(&req_dst_orig_node->tt_buff_lock);
	} else {
		tt_len = (uint16_t)atomic_read(&req_dst_orig_node->tt_size) *
						sizeof(struct tt_change);
		ttvn = (uint8_t)atomic_read(&req_dst_orig_node->last_ttvn);

		skb = tt_response_fill_table(tt_len, ttvn,
					     bat_priv->tt_global_hash,
					     primary_if, tt_global_valid_entry,
					     req_dst_orig_node);
		if (!skb)
			goto out;

		tt_response = (struct tt_query_packet *)skb->data;
	}

1470 1471 1472
	tt_response->header.packet_type = BAT_TT_QUERY;
	tt_response->header.version = COMPAT_VERSION;
	tt_response->header.ttl = TTL;
1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484
	memcpy(tt_response->src, req_dst_orig_node->orig, ETH_ALEN);
	memcpy(tt_response->dst, tt_request->src, ETH_ALEN);
	tt_response->flags = TT_RESPONSE;

	if (full_table)
		tt_response->flags |= TT_FULL_TABLE;

	bat_dbg(DBG_TT, bat_priv,
		"Sending TT_RESPONSE %pM via %pM for %pM (ttvn: %u)\n",
		res_dst_orig_node->orig, neigh_node->addr,
		req_dst_orig_node->orig, req_ttvn);

1485 1486
	batadv_inc_counter(bat_priv, BAT_CNT_TT_RESPONSE_TX);

1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522
	send_skb_packet(skb, neigh_node->if_incoming, neigh_node->addr);
	ret = true;
	goto out;

unlock:
	spin_unlock_bh(&req_dst_orig_node->tt_buff_lock);

out:
	if (res_dst_orig_node)
		orig_node_free_ref(res_dst_orig_node);
	if (req_dst_orig_node)
		orig_node_free_ref(req_dst_orig_node);
	if (neigh_node)
		neigh_node_free_ref(neigh_node);
	if (primary_if)
		hardif_free_ref(primary_if);
	if (!ret)
		kfree_skb(skb);
	return ret;

}
static bool send_my_tt_response(struct bat_priv *bat_priv,
				struct tt_query_packet *tt_request)
{
	struct orig_node *orig_node = NULL;
	struct neigh_node *neigh_node = NULL;
	struct hard_iface *primary_if = NULL;
	uint8_t my_ttvn, req_ttvn, ttvn;
	int ret = false;
	unsigned char *tt_buff;
	bool full_table;
	uint16_t tt_len, tt_tot;
	struct sk_buff *skb = NULL;
	struct tt_query_packet *tt_response;

	bat_dbg(DBG_TT, bat_priv,
1523 1524
		"Received TT_REQUEST from %pM for ttvn: %u (me) [%c]\n",
		tt_request->src, tt_request->ttvn,
1525 1526 1527 1528 1529 1530
		(tt_request->flags & TT_FULL_TABLE ? 'F' : '.'));


	my_ttvn = (uint8_t)atomic_read(&bat_priv->ttvn);
	req_ttvn = tt_request->ttvn;

1531
	orig_node = orig_hash_find(bat_priv, tt_request->src);
1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579
	if (!orig_node)
		goto out;

	neigh_node = orig_node_get_router(orig_node);
	if (!neigh_node)
		goto out;

	primary_if = primary_if_get_selected(bat_priv);
	if (!primary_if)
		goto out;

	/* If the full table has been explicitly requested or the gap
	 * is too big send the whole local translation table */
	if (tt_request->flags & TT_FULL_TABLE || my_ttvn != req_ttvn ||
	    !bat_priv->tt_buff)
		full_table = true;
	else
		full_table = false;

	/* In this version, fragmentation is not implemented, then
	 * I'll send only one packet with as much TT entries as I can */
	if (!full_table) {
		spin_lock_bh(&bat_priv->tt_buff_lock);
		tt_len = bat_priv->tt_buff_len;
		tt_tot = tt_len / sizeof(struct tt_change);

		skb = dev_alloc_skb(sizeof(struct tt_query_packet) +
				    tt_len + ETH_HLEN);
		if (!skb)
			goto unlock;

		skb_reserve(skb, ETH_HLEN);
		tt_response = (struct tt_query_packet *)skb_put(skb,
				sizeof(struct tt_query_packet) + tt_len);
		tt_response->ttvn = req_ttvn;
		tt_response->tt_data = htons(tt_tot);

		tt_buff = skb->data + sizeof(struct tt_query_packet);
		memcpy(tt_buff, bat_priv->tt_buff,
		       bat_priv->tt_buff_len);
		spin_unlock_bh(&bat_priv->tt_buff_lock);
	} else {
		tt_len = (uint16_t)atomic_read(&bat_priv->num_local_tt) *
						sizeof(struct tt_change);
		ttvn = (uint8_t)atomic_read(&bat_priv->ttvn);

		skb = tt_response_fill_table(tt_len, ttvn,
					     bat_priv->tt_local_hash,
1580 1581
					     primary_if, tt_local_valid_entry,
					     NULL);
1582 1583 1584 1585 1586 1587
		if (!skb)
			goto out;

		tt_response = (struct tt_query_packet *)skb->data;
	}

1588 1589 1590
	tt_response->header.packet_type = BAT_TT_QUERY;
	tt_response->header.version = COMPAT_VERSION;
	tt_response->header.ttl = TTL;
1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602
	memcpy(tt_response->src, primary_if->net_dev->dev_addr, ETH_ALEN);
	memcpy(tt_response->dst, tt_request->src, ETH_ALEN);
	tt_response->flags = TT_RESPONSE;

	if (full_table)
		tt_response->flags |= TT_FULL_TABLE;

	bat_dbg(DBG_TT, bat_priv,
		"Sending TT_RESPONSE to %pM via %pM [%c]\n",
		orig_node->orig, neigh_node->addr,
		(tt_response->flags & TT_FULL_TABLE ? 'F' : '.'));

1603 1604
	batadv_inc_counter(bat_priv, BAT_CNT_TT_RESPONSE_TX);

1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626
	send_skb_packet(skb, neigh_node->if_incoming, neigh_node->addr);
	ret = true;
	goto out;

unlock:
	spin_unlock_bh(&bat_priv->tt_buff_lock);
out:
	if (orig_node)
		orig_node_free_ref(orig_node);
	if (neigh_node)
		neigh_node_free_ref(neigh_node);
	if (primary_if)
		hardif_free_ref(primary_if);
	if (!ret)
		kfree_skb(skb);
	/* This packet was for me, so it doesn't need to be re-routed */
	return true;
}

bool send_tt_response(struct bat_priv *bat_priv,
		      struct tt_query_packet *tt_request)
{
1627 1628 1629 1630 1631
	if (is_my_mac(tt_request->dst)) {
		/* don't answer backbone gws! */
		if (bla_is_backbone_gw_orig(bat_priv, tt_request->src))
			return true;

1632
		return send_my_tt_response(bat_priv, tt_request);
1633
	} else {
1634
		return send_other_tt_response(bat_priv, tt_request);
1635
	}
1636 1637 1638 1639 1640 1641 1642 1643 1644 1645
}

static void _tt_update_changes(struct bat_priv *bat_priv,
			       struct orig_node *orig_node,
			       struct tt_change *tt_change,
			       uint16_t tt_num_changes, uint8_t ttvn)
{
	int i;

	for (i = 0; i < tt_num_changes; i++) {
1646
		if ((tt_change + i)->flags & TT_CLIENT_DEL)
1647 1648
			tt_global_del(bat_priv, orig_node,
				      (tt_change + i)->addr,
1649 1650
				      "tt removed by changes",
				      (tt_change + i)->flags & TT_CLIENT_ROAM);
1651 1652
		else
			if (!tt_global_add(bat_priv, orig_node,
1653 1654 1655
					   (tt_change + i)->addr, ttvn, false,
					   (tt_change + i)->flags &
							TT_CLIENT_WIFI))
1656 1657 1658 1659 1660 1661 1662 1663
				/* In case of problem while storing a
				 * global_entry, we stop the updating
				 * procedure without committing the
				 * ttvn change. This will avoid to send
				 * corrupted data on tt_request
				 */
				return;
	}
1664
	orig_node->tt_initialised = true;
1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680
}

static void tt_fill_gtable(struct bat_priv *bat_priv,
			   struct tt_query_packet *tt_response)
{
	struct orig_node *orig_node = NULL;

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

	/* Purge the old table first.. */
	tt_global_del_orig(bat_priv, orig_node, "Received full table");

	_tt_update_changes(bat_priv, orig_node,
			   (struct tt_change *)(tt_response + 1),
1681
			   ntohs(tt_response->tt_data), tt_response->ttvn);
1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695

	spin_lock_bh(&orig_node->tt_buff_lock);
	kfree(orig_node->tt_buff);
	orig_node->tt_buff_len = 0;
	orig_node->tt_buff = NULL;
	spin_unlock_bh(&orig_node->tt_buff_lock);

	atomic_set(&orig_node->last_ttvn, tt_response->ttvn);

out:
	if (orig_node)
		orig_node_free_ref(orig_node);
}

1696 1697 1698 1699
static void tt_update_changes(struct bat_priv *bat_priv,
			      struct orig_node *orig_node,
			      uint16_t tt_num_changes, uint8_t ttvn,
			      struct tt_change *tt_change)
1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710
{
	_tt_update_changes(bat_priv, orig_node, tt_change, tt_num_changes,
			   ttvn);

	tt_save_orig_buffer(bat_priv, orig_node, (unsigned char *)tt_change,
			    tt_num_changes);
	atomic_set(&orig_node->last_ttvn, ttvn);
}

bool is_my_client(struct bat_priv *bat_priv, const uint8_t *addr)
{
1711 1712
	struct tt_local_entry *tt_local_entry = NULL;
	bool ret = false;
1713 1714

	tt_local_entry = tt_local_hash_find(bat_priv, addr);
1715 1716
	if (!tt_local_entry)
		goto out;
1717 1718
	/* Check if the client has been logically deleted (but is kept for
	 * consistency purpose) */
1719
	if (tt_local_entry->common.flags & TT_CLIENT_PENDING)
1720
		goto out;
1721 1722
	ret = true;
out:
1723
	if (tt_local_entry)
1724 1725
		tt_local_entry_free_ref(tt_local_entry);
	return ret;
1726 1727 1728 1729 1730 1731 1732 1733
}

void handle_tt_response(struct bat_priv *bat_priv,
			struct tt_query_packet *tt_response)
{
	struct tt_req_node *node, *safe;
	struct orig_node *orig_node = NULL;

1734 1735
	bat_dbg(DBG_TT, bat_priv,
		"Received TT_RESPONSE from %pM for ttvn %d t_size: %d [%c]\n",
1736 1737
		tt_response->src, tt_response->ttvn,
		ntohs(tt_response->tt_data),
1738 1739
		(tt_response->flags & TT_FULL_TABLE ? 'F' : '.'));

1740 1741 1742 1743
	/* we should have never asked a backbone gw */
	if (bla_is_backbone_gw_orig(bat_priv, tt_response->src))
		goto out;

1744 1745 1746 1747 1748 1749 1750
	orig_node = orig_hash_find(bat_priv, tt_response->src);
	if (!orig_node)
		goto out;

	if (tt_response->flags & TT_FULL_TABLE)
		tt_fill_gtable(bat_priv, tt_response);
	else
1751 1752
		tt_update_changes(bat_priv, orig_node,
				  ntohs(tt_response->tt_data),
1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767
				  tt_response->ttvn,
				  (struct tt_change *)(tt_response + 1));

	/* Delete the tt_req_node from pending tt_requests list */
	spin_lock_bh(&bat_priv->tt_req_list_lock);
	list_for_each_entry_safe(node, safe, &bat_priv->tt_req_list, list) {
		if (!compare_eth(node->addr, tt_response->src))
			continue;
		list_del(&node->list);
		kfree(node);
	}
	spin_unlock_bh(&bat_priv->tt_req_list_lock);

	/* Recalculate the CRC for this orig_node and store it */
	orig_node->tt_crc = tt_global_crc(bat_priv, orig_node);
1768 1769 1770
	/* Roaming phase is over: tables are in sync again. I can
	 * unset the flag */
	orig_node->tt_poss_change = false;
1771 1772 1773 1774 1775 1776 1777
out:
	if (orig_node)
		orig_node_free_ref(orig_node);
}

int tt_init(struct bat_priv *bat_priv)
{
1778
	int ret;
1779

1780 1781 1782 1783 1784 1785 1786
	ret = tt_local_init(bat_priv);
	if (ret < 0)
		return ret;

	ret = tt_global_init(bat_priv);
	if (ret < 0)
		return ret;
1787 1788 1789 1790 1791 1792

	tt_start_timer(bat_priv);

	return 1;
}

1793
static void tt_roam_list_free(struct bat_priv *bat_priv)
1794
{
1795
	struct tt_roam_node *node, *safe;
1796

1797
	spin_lock_bh(&bat_priv->tt_roam_list_lock);
1798

1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812
	list_for_each_entry_safe(node, safe, &bat_priv->tt_roam_list, list) {
		list_del(&node->list);
		kfree(node);
	}

	spin_unlock_bh(&bat_priv->tt_roam_list_lock);
}

static void tt_roam_purge(struct bat_priv *bat_priv)
{
	struct tt_roam_node *node, *safe;

	spin_lock_bh(&bat_priv->tt_roam_list_lock);
	list_for_each_entry_safe(node, safe, &bat_priv->tt_roam_list, list) {
1813
		if (!has_timed_out(node->first_time, ROAMING_MAX_TIME))
1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839
			continue;

		list_del(&node->list);
		kfree(node);
	}
	spin_unlock_bh(&bat_priv->tt_roam_list_lock);
}

/* This function checks whether the client already reached the
 * maximum number of possible roaming phases. In this case the ROAMING_ADV
 * will not be sent.
 *
 * returns true if the ROAMING_ADV can be sent, false otherwise */
static bool tt_check_roam_count(struct bat_priv *bat_priv,
				uint8_t *client)
{
	struct tt_roam_node *tt_roam_node;
	bool ret = false;

	spin_lock_bh(&bat_priv->tt_roam_list_lock);
	/* The new tt_req will be issued only if I'm not waiting for a
	 * reply from the same orig_node yet */
	list_for_each_entry(tt_roam_node, &bat_priv->tt_roam_list, list) {
		if (!compare_eth(tt_roam_node->addr, client))
			continue;

1840
		if (has_timed_out(tt_roam_node->first_time, ROAMING_MAX_TIME))
1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867
			continue;

		if (!atomic_dec_not_zero(&tt_roam_node->counter))
			/* Sorry, you roamed too many times! */
			goto unlock;
		ret = true;
		break;
	}

	if (!ret) {
		tt_roam_node = kmalloc(sizeof(*tt_roam_node), GFP_ATOMIC);
		if (!tt_roam_node)
			goto unlock;

		tt_roam_node->first_time = jiffies;
		atomic_set(&tt_roam_node->counter, ROAMING_MAX_COUNT - 1);
		memcpy(tt_roam_node->addr, client, ETH_ALEN);

		list_add(&tt_roam_node->list, &bat_priv->tt_roam_list);
		ret = true;
	}

unlock:
	spin_unlock_bh(&bat_priv->tt_roam_list_lock);
	return ret;
}

1868 1869
static void send_roam_adv(struct bat_priv *bat_priv, uint8_t *client,
			  struct orig_node *orig_node)
1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890
{
	struct neigh_node *neigh_node = NULL;
	struct sk_buff *skb = NULL;
	struct roam_adv_packet *roam_adv_packet;
	int ret = 1;
	struct hard_iface *primary_if;

	/* before going on we have to check whether the client has
	 * already roamed to us too many times */
	if (!tt_check_roam_count(bat_priv, client))
		goto out;

	skb = dev_alloc_skb(sizeof(struct roam_adv_packet) + ETH_HLEN);
	if (!skb)
		goto out;

	skb_reserve(skb, ETH_HLEN);

	roam_adv_packet = (struct roam_adv_packet *)skb_put(skb,
					sizeof(struct roam_adv_packet));

1891 1892 1893
	roam_adv_packet->header.packet_type = BAT_ROAM_ADV;
	roam_adv_packet->header.version = COMPAT_VERSION;
	roam_adv_packet->header.ttl = TTL;
1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909
	primary_if = primary_if_get_selected(bat_priv);
	if (!primary_if)
		goto out;
	memcpy(roam_adv_packet->src, primary_if->net_dev->dev_addr, ETH_ALEN);
	hardif_free_ref(primary_if);
	memcpy(roam_adv_packet->dst, orig_node->orig, ETH_ALEN);
	memcpy(roam_adv_packet->client, client, ETH_ALEN);

	neigh_node = orig_node_get_router(orig_node);
	if (!neigh_node)
		goto out;

	bat_dbg(DBG_TT, bat_priv,
		"Sending ROAMING_ADV to %pM (client %pM) via %pM\n",
		orig_node->orig, client, neigh_node->addr);

1910 1911
	batadv_inc_counter(bat_priv, BAT_CNT_TT_ROAM_ADV_TX);

1912 1913 1914 1915 1916 1917 1918 1919 1920
	send_skb_packet(skb, neigh_node->if_incoming, neigh_node->addr);
	ret = 0;

out:
	if (neigh_node)
		neigh_node_free_ref(neigh_node);
	if (ret)
		kfree_skb(skb);
	return;
1921 1922 1923 1924 1925 1926 1927 1928 1929 1930
}

static void tt_purge(struct work_struct *work)
{
	struct delayed_work *delayed_work =
		container_of(work, struct delayed_work, work);
	struct bat_priv *bat_priv =
		container_of(delayed_work, struct bat_priv, tt_work);

	tt_local_purge(bat_priv);
1931
	tt_global_roam_purge(bat_priv);
1932
	tt_req_purge(bat_priv);
1933
	tt_roam_purge(bat_priv);
1934 1935 1936

	tt_start_timer(bat_priv);
}
1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949

void tt_free(struct bat_priv *bat_priv)
{
	cancel_delayed_work_sync(&bat_priv->tt_work);

	tt_local_table_free(bat_priv);
	tt_global_table_free(bat_priv);
	tt_req_list_free(bat_priv);
	tt_changes_list_free(bat_priv);
	tt_roam_list_free(bat_priv);

	kfree(bat_priv->tt_buff);
}
1950

1951 1952 1953 1954
/* This function will enable or disable the specified flags for all the entries
 * in the given hash table and returns the number of modified entries */
static uint16_t tt_set_flags(struct hashtable_t *hash, uint16_t flags,
			     bool enable)
1955
{
1956
	uint32_t i;
1957
	uint16_t changed_num = 0;
1958 1959
	struct hlist_head *head;
	struct hlist_node *node;
1960
	struct tt_common_entry *tt_common_entry;
1961 1962

	if (!hash)
1963
		goto out;
1964 1965 1966 1967 1968

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

		rcu_read_lock();
1969
		hlist_for_each_entry_rcu(tt_common_entry, node,
1970
					 head, hash_entry) {
1971 1972 1973 1974 1975 1976 1977 1978 1979 1980
			if (enable) {
				if ((tt_common_entry->flags & flags) == flags)
					continue;
				tt_common_entry->flags |= flags;
			} else {
				if (!(tt_common_entry->flags & flags))
					continue;
				tt_common_entry->flags &= ~flags;
			}
			changed_num++;
1981 1982 1983
		}
		rcu_read_unlock();
	}
1984 1985
out:
	return changed_num;
1986 1987 1988 1989 1990 1991
}

/* Purge out all the tt local entries marked with TT_CLIENT_PENDING */
static void tt_local_purge_pending_clients(struct bat_priv *bat_priv)
{
	struct hashtable_t *hash = bat_priv->tt_local_hash;
1992
	struct tt_common_entry *tt_common_entry;
1993 1994 1995 1996
	struct tt_local_entry *tt_local_entry;
	struct hlist_node *node, *node_tmp;
	struct hlist_head *head;
	spinlock_t *list_lock; /* protects write access to the hash lists */
1997
	uint32_t i;
1998 1999 2000 2001 2002 2003 2004 2005 2006

	if (!hash)
		return;

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

		spin_lock_bh(list_lock);
2007
		hlist_for_each_entry_safe(tt_common_entry, node, node_tmp,
2008
					  head, hash_entry) {
2009
			if (!(tt_common_entry->flags & TT_CLIENT_PENDING))
2010 2011
				continue;

2012 2013 2014
			bat_dbg(DBG_TT, bat_priv,
				"Deleting local tt entry (%pM): pending\n",
				tt_common_entry->addr);
2015 2016 2017

			atomic_dec(&bat_priv->num_local_tt);
			hlist_del_rcu(node);
2018 2019 2020
			tt_local_entry = container_of(tt_common_entry,
						      struct tt_local_entry,
						      common);
2021 2022 2023 2024 2025 2026 2027 2028 2029
			tt_local_entry_free_ref(tt_local_entry);
		}
		spin_unlock_bh(list_lock);
	}

}

void tt_commit_changes(struct bat_priv *bat_priv)
{
2030 2031 2032 2033 2034
	uint16_t changed_num = tt_set_flags(bat_priv->tt_local_hash,
					    TT_CLIENT_NEW, false);
	/* all the reset entries have now to be effectively counted as local
	 * entries */
	atomic_add(changed_num, &bat_priv->num_local_tt);
2035 2036 2037 2038
	tt_local_purge_pending_clients(bat_priv);

	/* Increment the TTVN only once per OGM interval */
	atomic_inc(&bat_priv->ttvn);
2039 2040
	bat_dbg(DBG_TT, bat_priv, "Local changes committed, updating to ttvn %u\n",
		(uint8_t)atomic_read(&bat_priv->ttvn));
2041 2042
	bat_priv->tt_poss_change = false;
}
2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072

bool is_ap_isolated(struct bat_priv *bat_priv, uint8_t *src, uint8_t *dst)
{
	struct tt_local_entry *tt_local_entry = NULL;
	struct tt_global_entry *tt_global_entry = NULL;
	bool ret = true;

	if (!atomic_read(&bat_priv->ap_isolation))
		return false;

	tt_local_entry = tt_local_hash_find(bat_priv, dst);
	if (!tt_local_entry)
		goto out;

	tt_global_entry = tt_global_hash_find(bat_priv, src);
	if (!tt_global_entry)
		goto out;

	if (_is_ap_isolated(tt_local_entry, tt_global_entry))
		goto out;

	ret = false;

out:
	if (tt_global_entry)
		tt_global_entry_free_ref(tt_global_entry);
	if (tt_local_entry)
		tt_local_entry_free_ref(tt_local_entry);
	return ret;
}
2073 2074 2075 2076 2077 2078 2079 2080

void tt_update_orig(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)
{
	uint8_t orig_ttvn = (uint8_t)atomic_read(&orig_node->last_ttvn);
	bool full_table = true;

2081 2082 2083 2084
	/* don't care about a backbone gateways updates. */
	if (bla_is_backbone_gw_orig(bat_priv, orig_node->orig))
		return;

2085 2086 2087 2088
	/* orig table not initialised AND first diff is in the OGM OR the ttvn
	 * increased by one -> we can apply the attached changes */
	if ((!orig_node->tt_initialised && ttvn == 1) ||
	    ttvn - orig_ttvn == 1) {
2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121
		/* the OGM could not contain the changes due to their size 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 precomputed crc with 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);

		/* The ttvn alone is not enough to guarantee consistency
		 * because a single value could represent different states
		 * (due to the wrap around). Thus a node has to check whether
		 * the resulting table (after applying the changes) is still
		 * consistent or not. E.g. a node could disconnect while its
		 * ttvn is X and reconnect on ttvn = X + TTVN_MAX: in this case
		 * checking the CRC value is mandatory to detect the
		 * inconsistency */
		if (orig_node->tt_crc != tt_crc)
			goto request_table;

		/* Roaming phase is over: tables are in sync again. I can
		 * unset the flag */
		orig_node->tt_poss_change = false;
	} else {
		/* if we missed more than one change or our tables are not
		 * in sync anymore -> request fresh tt data */
2122

2123 2124
		if (!orig_node->tt_initialised || ttvn != orig_ttvn ||
		    orig_node->tt_crc != tt_crc) {
2125
request_table:
2126 2127 2128 2129
			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);
2130 2131 2132 2133 2134 2135
			send_tt_request(bat_priv, orig_node, ttvn, tt_crc,
					full_table);
			return;
		}
	}
}
2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154

/* returns true whether we know that the client has moved from its old
 * originator to another one. This entry is kept is still kept for consistency
 * purposes
 */
bool tt_global_client_is_roaming(struct bat_priv *bat_priv, uint8_t *addr)
{
	struct tt_global_entry *tt_global_entry;
	bool ret = false;

	tt_global_entry = tt_global_hash_find(bat_priv, addr);
	if (!tt_global_entry)
		goto out;

	ret = tt_global_entry->common.flags & TT_CLIENT_ROAM;
	tt_global_entry_free_ref(tt_global_entry);
out:
	return ret;
}