originator.c 20.2 KB
Newer Older
1
/* Copyright (C) 2009-2013 B.A.T.M.A.N. contributors:
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
 *
 * 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"
21
#include "distributed-arp-table.h"
22 23 24 25 26 27 28
#include "originator.h"
#include "hash.h"
#include "translation-table.h"
#include "routing.h"
#include "gateway_client.h"
#include "hard-interface.h"
#include "soft-interface.h"
29
#include "bridge_loop_avoidance.h"
30
#include "network-coding.h"
31
#include "fragmentation.h"
32

33 34 35
/* hash class keys */
static struct lock_class_key batadv_orig_hash_lock_class_key;

36
static void batadv_purge_orig(struct work_struct *work);
37

38
/* returns 1 if they are the same originator */
39
static int batadv_compare_orig(const struct hlist_node *node, const void *data2)
40
{
41 42
	const void *data1 = container_of(node, struct batadv_orig_node,
					 hash_entry);
43 44 45 46

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

47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128
/**
 * batadv_orig_node_vlan_get - get an orig_node_vlan object
 * @orig_node: the originator serving the VLAN
 * @vid: the VLAN identifier
 *
 * Returns the vlan object identified by vid and belonging to orig_node or NULL
 * if it does not exist.
 */
struct batadv_orig_node_vlan *
batadv_orig_node_vlan_get(struct batadv_orig_node *orig_node,
			  unsigned short vid)
{
	struct batadv_orig_node_vlan *vlan = NULL, *tmp;

	rcu_read_lock();
	list_for_each_entry_rcu(tmp, &orig_node->vlan_list, list) {
		if (tmp->vid != vid)
			continue;

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

		vlan = tmp;

		break;
	}
	rcu_read_unlock();

	return vlan;
}

/**
 * batadv_orig_node_vlan_new - search and possibly create an orig_node_vlan
 *  object
 * @orig_node: the originator serving the VLAN
 * @vid: the VLAN identifier
 *
 * Returns NULL in case of failure or the vlan object identified by vid and
 * belonging to orig_node otherwise. The object is created and added to the list
 * if it does not exist.
 *
 * The object is returned with refcounter increased by 1.
 */
struct batadv_orig_node_vlan *
batadv_orig_node_vlan_new(struct batadv_orig_node *orig_node,
			  unsigned short vid)
{
	struct batadv_orig_node_vlan *vlan;

	spin_lock_bh(&orig_node->vlan_list_lock);

	/* first look if an object for this vid already exists */
	vlan = batadv_orig_node_vlan_get(orig_node, vid);
	if (vlan)
		goto out;

	vlan = kzalloc(sizeof(*vlan), GFP_ATOMIC);
	if (!vlan)
		goto out;

	atomic_set(&vlan->refcount, 2);
	vlan->vid = vid;

	list_add_rcu(&vlan->list, &orig_node->vlan_list);

out:
	spin_unlock_bh(&orig_node->vlan_list_lock);

	return vlan;
}

/**
 * batadv_orig_node_vlan_free_ref - decrement the refcounter and possibly free
 *  the originator-vlan object
 * @orig_vlan: the originator-vlan object to release
 */
void batadv_orig_node_vlan_free_ref(struct batadv_orig_node_vlan *orig_vlan)
{
	if (atomic_dec_and_test(&orig_vlan->refcount))
		kfree_rcu(orig_vlan, rcu);
}

129
int batadv_originator_init(struct batadv_priv *bat_priv)
130 131
{
	if (bat_priv->orig_hash)
132
		return 0;
133

134
	bat_priv->orig_hash = batadv_hash_new(1024);
135 136 137 138

	if (!bat_priv->orig_hash)
		goto err;

139 140 141
	batadv_hash_set_lock_class(bat_priv->orig_hash,
				   &batadv_orig_hash_lock_class_key);

142 143 144 145 146
	INIT_DELAYED_WORK(&bat_priv->orig_work, batadv_purge_orig);
	queue_delayed_work(batadv_event_workqueue,
			   &bat_priv->orig_work,
			   msecs_to_jiffies(BATADV_ORIG_WORK_PERIOD));

147
	return 0;
148 149

err:
150
	return -ENOMEM;
151 152
}

153
void batadv_neigh_node_free_ref(struct batadv_neigh_node *neigh_node)
154
{
155
	if (atomic_dec_and_test(&neigh_node->refcount))
156
		kfree_rcu(neigh_node, rcu);
157 158
}

159
/* increases the refcounter of a found router */
160 161
struct batadv_neigh_node *
batadv_orig_node_get_router(struct batadv_orig_node *orig_node)
162
{
163
	struct batadv_neigh_node *router;
164 165 166 167 168 169 170 171 172 173 174

	rcu_read_lock();
	router = rcu_dereference(orig_node->router);

	if (router && !atomic_inc_not_zero(&router->refcount))
		router = NULL;

	rcu_read_unlock();
	return router;
}

175 176
struct batadv_neigh_node *
batadv_neigh_node_new(struct batadv_hard_iface *hard_iface,
177
		      const uint8_t *neigh_addr)
178
{
179 180
	struct batadv_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
	struct batadv_neigh_node *neigh_node;
181

182
	neigh_node = kzalloc(sizeof(*neigh_node), GFP_ATOMIC);
183
	if (!neigh_node)
184
		goto out;
185

186
	INIT_HLIST_NODE(&neigh_node->list);
187

188
	memcpy(neigh_node->addr, neigh_addr, ETH_ALEN);
189
	spin_lock_init(&neigh_node->lq_update_lock);
190 191 192

	/* extra reference for return */
	atomic_set(&neigh_node->refcount, 2);
193

194
	batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
195 196
		   "Creating new neighbor %pM on interface %s\n", neigh_addr,
		   hard_iface->net_dev->name);
197 198

out:
199 200 201
	return neigh_node;
}

202
static void batadv_orig_node_free_rcu(struct rcu_head *rcu)
203
{
204
	struct hlist_node *node_tmp;
205 206
	struct batadv_neigh_node *neigh_node, *tmp_neigh_node;
	struct batadv_orig_node *orig_node;
207

208
	orig_node = container_of(rcu, struct batadv_orig_node, rcu);
209

210 211
	spin_lock_bh(&orig_node->neigh_list_lock);

212 213 214 215
	/* for all bonding members ... */
	list_for_each_entry_safe(neigh_node, tmp_neigh_node,
				 &orig_node->bond_list, bonding_list) {
		list_del_rcu(&neigh_node->bonding_list);
216
		batadv_neigh_node_free_ref(neigh_node);
217 218
	}

219
	/* for all neighbors towards this originator ... */
220
	hlist_for_each_entry_safe(neigh_node, node_tmp,
221
				  &orig_node->neigh_list, list) {
222
		hlist_del_rcu(&neigh_node->list);
223
		batadv_neigh_node_free_ref(neigh_node);
224 225
	}

226 227
	spin_unlock_bh(&orig_node->neigh_list_lock);

228 229 230
	/* Free nc_nodes */
	batadv_nc_purge_orig(orig_node->bat_priv, orig_node, NULL);

231 232
	batadv_frag_purge_orig(orig_node, NULL);

233 234
	batadv_tt_global_del_orig(orig_node->bat_priv, orig_node,
				  "originator timed out");
235

236
	kfree(orig_node->tt_buff);
237 238 239 240 241
	kfree(orig_node->bcast_own);
	kfree(orig_node->bcast_own_sum);
	kfree(orig_node);
}

242 243 244 245 246
/**
 * batadv_orig_node_free_ref - decrement the orig node refcounter and possibly
 * schedule an rcu callback for freeing it
 * @orig_node: the orig node to free
 */
247
void batadv_orig_node_free_ref(struct batadv_orig_node *orig_node)
248 249
{
	if (atomic_dec_and_test(&orig_node->refcount))
250
		call_rcu(&orig_node->rcu, batadv_orig_node_free_rcu);
251 252
}

253 254 255 256 257 258 259 260 261 262 263
/**
 * batadv_orig_node_free_ref_now - decrement the orig node refcounter and
 * possibly free it (without rcu callback)
 * @orig_node: the orig node to free
 */
void batadv_orig_node_free_ref_now(struct batadv_orig_node *orig_node)
{
	if (atomic_dec_and_test(&orig_node->refcount))
		batadv_orig_node_free_rcu(&orig_node->rcu);
}

264
void batadv_originator_free(struct batadv_priv *bat_priv)
265
{
266
	struct batadv_hashtable *hash = bat_priv->orig_hash;
267
	struct hlist_node *node_tmp;
268 269
	struct hlist_head *head;
	spinlock_t *list_lock; /* spinlock to protect write access */
270
	struct batadv_orig_node *orig_node;
271
	uint32_t i;
272 273

	if (!hash)
274 275 276 277 278
		return;

	cancel_delayed_work_sync(&bat_priv->orig_work);

	bat_priv->orig_hash = NULL;
279 280 281 282 283 284

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

		spin_lock_bh(list_lock);
285
		hlist_for_each_entry_safe(orig_node, node_tmp,
286
					  head, hash_entry) {
287
			hlist_del_rcu(&orig_node->hash_entry);
288
			batadv_orig_node_free_ref(orig_node);
289 290 291 292
		}
		spin_unlock_bh(list_lock);
	}

293
	batadv_hash_destroy(hash);
294 295 296
}

/* this function finds or creates an originator entry for the given
297 298
 * address if it does not exits
 */
299 300
struct batadv_orig_node *batadv_get_orig_node(struct batadv_priv *bat_priv,
					      const uint8_t *addr)
301
{
302
	struct batadv_orig_node *orig_node;
303
	struct batadv_orig_node_vlan *vlan;
304
	int size, i;
305
	int hash_added;
306
	unsigned long reset_time;
307

308
	orig_node = batadv_orig_hash_find(bat_priv, addr);
309
	if (orig_node)
310 311
		return orig_node;

312 313
	batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
		   "Creating new originator: %pM\n", addr);
314

315
	orig_node = kzalloc(sizeof(*orig_node), GFP_ATOMIC);
316 317 318
	if (!orig_node)
		return NULL;

319
	INIT_HLIST_HEAD(&orig_node->neigh_list);
320
	INIT_LIST_HEAD(&orig_node->bond_list);
321
	INIT_LIST_HEAD(&orig_node->vlan_list);
322
	spin_lock_init(&orig_node->ogm_cnt_lock);
323
	spin_lock_init(&orig_node->bcast_seqno_lock);
324
	spin_lock_init(&orig_node->neigh_list_lock);
325
	spin_lock_init(&orig_node->tt_buff_lock);
326
	spin_lock_init(&orig_node->tt_lock);
327
	spin_lock_init(&orig_node->vlan_list_lock);
328

329 330
	batadv_nc_init_orig(orig_node);

331 332
	/* extra reference for return */
	atomic_set(&orig_node->refcount, 2);
333

334
	orig_node->tt_initialised = false;
335
	orig_node->bat_priv = bat_priv;
336
	memcpy(orig_node->orig, addr, ETH_ALEN);
337
	batadv_dat_init_orig_node_addr(orig_node);
338
	orig_node->router = NULL;
339
	atomic_set(&orig_node->last_ttvn, 0);
340
	orig_node->tt_buff = NULL;
341
	orig_node->tt_buff_len = 0;
342 343 344
	reset_time = jiffies - 1 - msecs_to_jiffies(BATADV_RESET_PROTECTION_MS);
	orig_node->bcast_seqno_reset = reset_time;
	orig_node->batman_seqno_reset = reset_time;
345

346 347
	atomic_set(&orig_node->bond_candidates, 0);

348 349 350 351 352 353 354 355 356 357
	/* create a vlan object for the "untagged" LAN */
	vlan = batadv_orig_node_vlan_new(orig_node, BATADV_NO_FLAGS);
	if (!vlan)
		goto free_orig_node;
	/* batadv_orig_node_vlan_new() increases the refcounter.
	 * Immediately release vlan since it is not needed anymore in this
	 * context
	 */
	batadv_orig_node_vlan_free_ref(vlan);

358
	size = bat_priv->num_ifaces * sizeof(unsigned long) * BATADV_NUM_WORDS;
359 360 361

	orig_node->bcast_own = kzalloc(size, GFP_ATOMIC);
	if (!orig_node->bcast_own)
362
		goto free_vlan;
363 364 365 366

	size = bat_priv->num_ifaces * sizeof(uint8_t);
	orig_node->bcast_own_sum = kzalloc(size, GFP_ATOMIC);

367 368 369 370 371 372
	for (i = 0; i < BATADV_FRAG_BUFFER_COUNT; i++) {
		INIT_HLIST_HEAD(&orig_node->fragments[i].head);
		spin_lock_init(&orig_node->fragments[i].lock);
		orig_node->fragments[i].size = 0;
	}

373 374 375
	if (!orig_node->bcast_own_sum)
		goto free_bcast_own;

376
	hash_added = batadv_hash_add(bat_priv->orig_hash, batadv_compare_orig,
377
				     batadv_choose_orig, orig_node,
378
				     &orig_node->hash_entry);
379
	if (hash_added != 0)
380 381 382 383 384 385 386
		goto free_bcast_own_sum;

	return orig_node;
free_bcast_own_sum:
	kfree(orig_node->bcast_own_sum);
free_bcast_own:
	kfree(orig_node->bcast_own);
387 388
free_vlan:
	batadv_orig_node_vlan_free_ref(vlan);
389 390 391 392 393
free_orig_node:
	kfree(orig_node);
	return NULL;
}

394 395 396 397
static bool
batadv_purge_orig_neighbors(struct batadv_priv *bat_priv,
			    struct batadv_orig_node *orig_node,
			    struct batadv_neigh_node **best_neigh_node)
398
{
399
	struct hlist_node *node_tmp;
400
	struct batadv_neigh_node *neigh_node;
401
	bool neigh_purged = false;
402
	unsigned long last_seen;
403
	struct batadv_hard_iface *if_incoming;
404 405 406

	*best_neigh_node = NULL;

407 408
	spin_lock_bh(&orig_node->neigh_list_lock);

409
	/* for all neighbors towards this originator ... */
410
	hlist_for_each_entry_safe(neigh_node, node_tmp,
411
				  &orig_node->neigh_list, list) {
412 413 414
		last_seen = neigh_node->last_seen;
		if_incoming = neigh_node->if_incoming;

415
		if ((batadv_has_timed_out(last_seen, BATADV_PURGE_TIMEOUT)) ||
416 417 418 419 420 421
		    (if_incoming->if_status == BATADV_IF_INACTIVE) ||
		    (if_incoming->if_status == BATADV_IF_NOT_IN_USE) ||
		    (if_incoming->if_status == BATADV_IF_TO_BE_REMOVED)) {
			if ((if_incoming->if_status == BATADV_IF_INACTIVE) ||
			    (if_incoming->if_status == BATADV_IF_NOT_IN_USE) ||
			    (if_incoming->if_status == BATADV_IF_TO_BE_REMOVED))
422
				batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
423 424 425
					   "neighbor purge: originator %pM, neighbor: %pM, iface: %s\n",
					   orig_node->orig, neigh_node->addr,
					   if_incoming->net_dev->name);
426
			else
427
				batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
428 429 430
					   "neighbor timeout: originator %pM, neighbor: %pM, last_seen: %u\n",
					   orig_node->orig, neigh_node->addr,
					   jiffies_to_msecs(last_seen));
431 432

			neigh_purged = true;
433

434
			hlist_del_rcu(&neigh_node->list);
435
			batadv_bonding_candidate_del(orig_node, neigh_node);
436
			batadv_neigh_node_free_ref(neigh_node);
437 438 439 440 441 442
		} else {
			if ((!*best_neigh_node) ||
			    (neigh_node->tq_avg > (*best_neigh_node)->tq_avg))
				*best_neigh_node = neigh_node;
		}
	}
443 444

	spin_unlock_bh(&orig_node->neigh_list_lock);
445 446 447
	return neigh_purged;
}

448 449
static bool batadv_purge_orig_node(struct batadv_priv *bat_priv,
				   struct batadv_orig_node *orig_node)
450
{
451
	struct batadv_neigh_node *best_neigh_node;
452

453 454
	if (batadv_has_timed_out(orig_node->last_seen,
				 2 * BATADV_PURGE_TIMEOUT)) {
455
		batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
456 457 458
			   "Originator timeout: originator %pM, last_seen %u\n",
			   orig_node->orig,
			   jiffies_to_msecs(orig_node->last_seen));
459 460
		return true;
	} else {
461 462
		if (batadv_purge_orig_neighbors(bat_priv, orig_node,
						&best_neigh_node))
463 464
			batadv_update_route(bat_priv, orig_node,
					    best_neigh_node);
465 466 467 468 469
	}

	return false;
}

470
static void _batadv_purge_orig(struct batadv_priv *bat_priv)
471
{
472
	struct batadv_hashtable *hash = bat_priv->orig_hash;
473
	struct hlist_node *node_tmp;
474
	struct hlist_head *head;
475
	spinlock_t *list_lock; /* spinlock to protect write access */
476
	struct batadv_orig_node *orig_node;
477
	uint32_t i;
478 479 480 481 482 483 484

	if (!hash)
		return;

	/* for all origins... */
	for (i = 0; i < hash->size; i++) {
		head = &hash->table[i];
485
		list_lock = &hash->list_locks[i];
486

487
		spin_lock_bh(list_lock);
488
		hlist_for_each_entry_safe(orig_node, node_tmp,
489
					  head, hash_entry) {
490
			if (batadv_purge_orig_node(bat_priv, orig_node)) {
491
				batadv_gw_node_delete(bat_priv, orig_node);
492
				hlist_del_rcu(&orig_node->hash_entry);
493
				batadv_orig_node_free_ref(orig_node);
494
				continue;
495
			}
496 497 498

			batadv_frag_purge_orig(orig_node,
					       batadv_frag_check_entry);
499
		}
500
		spin_unlock_bh(list_lock);
501 502
	}

503 504
	batadv_gw_node_purge(bat_priv);
	batadv_gw_election(bat_priv);
505 506
}

507
static void batadv_purge_orig(struct work_struct *work)
508
{
509 510
	struct delayed_work *delayed_work;
	struct batadv_priv *bat_priv;
511

512 513
	delayed_work = container_of(work, struct delayed_work, work);
	bat_priv = container_of(delayed_work, struct batadv_priv, orig_work);
514
	_batadv_purge_orig(bat_priv);
515 516 517
	queue_delayed_work(batadv_event_workqueue,
			   &bat_priv->orig_work,
			   msecs_to_jiffies(BATADV_ORIG_WORK_PERIOD));
518 519
}

520
void batadv_purge_orig_ref(struct batadv_priv *bat_priv)
521
{
522
	_batadv_purge_orig(bat_priv);
523 524
}

525
int batadv_orig_seq_print_text(struct seq_file *seq, void *offset)
526 527
{
	struct net_device *net_dev = (struct net_device *)seq->private;
528
	struct batadv_priv *bat_priv = netdev_priv(net_dev);
529
	struct batadv_hashtable *hash = bat_priv->orig_hash;
530
	struct hlist_head *head;
531 532 533
	struct batadv_hard_iface *primary_if;
	struct batadv_orig_node *orig_node;
	struct batadv_neigh_node *neigh_node, *neigh_node_tmp;
534 535 536
	int batman_count = 0;
	int last_seen_secs;
	int last_seen_msecs;
537
	unsigned long last_seen_jiffies;
538
	uint32_t i;
539

540 541
	primary_if = batadv_seq_print_text_primary_if_get(seq);
	if (!primary_if)
542
		goto out;
543

544
	seq_printf(seq, "[B.A.T.M.A.N. adv %s, MainIF/MAC: %s/%pM (%s)]\n",
545
		   BATADV_SOURCE_VERSION, primary_if->net_dev->name,
546
		   primary_if->net_dev->dev_addr, net_dev->name);
547
	seq_printf(seq, "  %-15s %s (%s/%i) %17s [%10s]: %20s ...\n",
548 549
		   "Originator", "last-seen", "#", BATADV_TQ_MAX_VALUE,
		   "Nexthop", "outgoingIF", "Potential nexthops");
550 551 552 553

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

554
		rcu_read_lock();
555
		hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
556
			neigh_node = batadv_orig_node_get_router(orig_node);
557
			if (!neigh_node)
558 559
				continue;

560 561
			if (neigh_node->tq_avg == 0)
				goto next;
562

563 564 565 566
			last_seen_jiffies = jiffies - orig_node->last_seen;
			last_seen_msecs = jiffies_to_msecs(last_seen_jiffies);
			last_seen_secs = last_seen_msecs / 1000;
			last_seen_msecs = last_seen_msecs % 1000;
567 568 569 570 571 572 573

			seq_printf(seq, "%pM %4i.%03is   (%3i) %pM [%10s]:",
				   orig_node->orig, last_seen_secs,
				   last_seen_msecs, neigh_node->tq_avg,
				   neigh_node->addr,
				   neigh_node->if_incoming->net_dev->name);

574
			hlist_for_each_entry_rcu(neigh_node_tmp,
575
						 &orig_node->neigh_list, list) {
576 577 578
				seq_printf(seq, " %pM (%3i)",
					   neigh_node_tmp->addr,
					   neigh_node_tmp->tq_avg);
579 580
			}

581
			seq_puts(seq, "\n");
582
			batman_count++;
583 584

next:
585
			batadv_neigh_node_free_ref(neigh_node);
586
		}
587
		rcu_read_unlock();
588 589
	}

590
	if (batman_count == 0)
591
		seq_puts(seq, "No batman nodes in range ...\n");
592

593 594
out:
	if (primary_if)
595
		batadv_hardif_free_ref(primary_if);
596
	return 0;
597 598
}

599 600
static int batadv_orig_node_add_if(struct batadv_orig_node *orig_node,
				   int max_if_num)
601 602
{
	void *data_ptr;
603
	size_t data_size, old_size;
604

605 606 607
	data_size = max_if_num * sizeof(unsigned long) * BATADV_NUM_WORDS;
	old_size = (max_if_num - 1) * sizeof(unsigned long) * BATADV_NUM_WORDS;
	data_ptr = kmalloc(data_size, GFP_ATOMIC);
608
	if (!data_ptr)
609
		return -ENOMEM;
610

611
	memcpy(data_ptr, orig_node->bcast_own, old_size);
612 613 614 615
	kfree(orig_node->bcast_own);
	orig_node->bcast_own = data_ptr;

	data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
616
	if (!data_ptr)
617
		return -ENOMEM;
618 619 620 621 622 623 624 625 626

	memcpy(data_ptr, orig_node->bcast_own_sum,
	       (max_if_num - 1) * sizeof(uint8_t));
	kfree(orig_node->bcast_own_sum);
	orig_node->bcast_own_sum = data_ptr;

	return 0;
}

627 628
int batadv_orig_hash_add_if(struct batadv_hard_iface *hard_iface,
			    int max_if_num)
629
{
630
	struct batadv_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
631
	struct batadv_hashtable *hash = bat_priv->orig_hash;
632
	struct hlist_head *head;
633
	struct batadv_orig_node *orig_node;
634 635
	uint32_t i;
	int ret;
636 637

	/* resize all orig nodes because orig_node->bcast_own(_sum) depend on
638 639
	 * if_num
	 */
640 641 642
	for (i = 0; i < hash->size; i++) {
		head = &hash->table[i];

643
		rcu_read_lock();
644
		hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
645
			spin_lock_bh(&orig_node->ogm_cnt_lock);
646
			ret = batadv_orig_node_add_if(orig_node, max_if_num);
647 648
			spin_unlock_bh(&orig_node->ogm_cnt_lock);

649
			if (ret == -ENOMEM)
650 651
				goto err;
		}
652
		rcu_read_unlock();
653 654 655 656 657
	}

	return 0;

err:
658
	rcu_read_unlock();
659 660 661
	return -ENOMEM;
}

662
static int batadv_orig_node_del_if(struct batadv_orig_node *orig_node,
663
				   int max_if_num, int del_if_num)
664 665 666 667 668 669 670 671
{
	void *data_ptr = NULL;
	int chunk_size;

	/* last interface was removed */
	if (max_if_num == 0)
		goto free_bcast_own;

672
	chunk_size = sizeof(unsigned long) * BATADV_NUM_WORDS;
673
	data_ptr = kmalloc(max_if_num * chunk_size, GFP_ATOMIC);
674
	if (!data_ptr)
675
		return -ENOMEM;
676 677 678 679 680

	/* copy first part */
	memcpy(data_ptr, orig_node->bcast_own, del_if_num * chunk_size);

	/* copy second part */
681
	memcpy((char *)data_ptr + del_if_num * chunk_size,
682 683 684 685 686 687 688 689 690 691 692
	       orig_node->bcast_own + ((del_if_num + 1) * chunk_size),
	       (max_if_num - del_if_num) * chunk_size);

free_bcast_own:
	kfree(orig_node->bcast_own);
	orig_node->bcast_own = data_ptr;

	if (max_if_num == 0)
		goto free_own_sum;

	data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
693
	if (!data_ptr)
694
		return -ENOMEM;
695 696 697 698

	memcpy(data_ptr, orig_node->bcast_own_sum,
	       del_if_num * sizeof(uint8_t));

699
	memcpy((char *)data_ptr + del_if_num * sizeof(uint8_t),
700 701 702 703 704 705 706 707 708 709
	       orig_node->bcast_own_sum + ((del_if_num + 1) * sizeof(uint8_t)),
	       (max_if_num - del_if_num) * sizeof(uint8_t));

free_own_sum:
	kfree(orig_node->bcast_own_sum);
	orig_node->bcast_own_sum = data_ptr;

	return 0;
}

710 711
int batadv_orig_hash_del_if(struct batadv_hard_iface *hard_iface,
			    int max_if_num)
712
{
713
	struct batadv_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
714
	struct batadv_hashtable *hash = bat_priv->orig_hash;
715
	struct hlist_head *head;
716 717
	struct batadv_hard_iface *hard_iface_tmp;
	struct batadv_orig_node *orig_node;
718 719
	uint32_t i;
	int ret;
720 721

	/* resize all orig nodes because orig_node->bcast_own(_sum) depend on
722 723
	 * if_num
	 */
724 725 726
	for (i = 0; i < hash->size; i++) {
		head = &hash->table[i];

727
		rcu_read_lock();
728
		hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
729
			spin_lock_bh(&orig_node->ogm_cnt_lock);
730 731
			ret = batadv_orig_node_del_if(orig_node, max_if_num,
						      hard_iface->if_num);
732
			spin_unlock_bh(&orig_node->ogm_cnt_lock);
733

734
			if (ret == -ENOMEM)
735 736
				goto err;
		}
737
		rcu_read_unlock();
738 739 740 741
	}

	/* renumber remaining batman interfaces _inside_ of orig_hash_lock */
	rcu_read_lock();
742
	list_for_each_entry_rcu(hard_iface_tmp, &batadv_hardif_list, list) {
743
		if (hard_iface_tmp->if_status == BATADV_IF_NOT_IN_USE)
744 745
			continue;

746
		if (hard_iface == hard_iface_tmp)
747 748
			continue;

749
		if (hard_iface->soft_iface != hard_iface_tmp->soft_iface)
750 751
			continue;

752 753
		if (hard_iface_tmp->if_num > hard_iface->if_num)
			hard_iface_tmp->if_num--;
754 755 756
	}
	rcu_read_unlock();

757
	hard_iface->if_num = -1;
758 759 760
	return 0;

err:
761
	rcu_read_unlock();
762 763
	return -ENOMEM;
}