1 /* Copyright (C) 2009-2013 B.A.T.M.A.N. contributors:
3 * Marek Lindner, Simon Wunderlich
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of version 2 of the GNU General Public
7 * License as published by the Free Software Foundation.
9 * This program is distributed in the hope that it will be useful, but
10 * WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
21 #include "distributed-arp-table.h"
22 #include "originator.h"
24 #include "translation-table.h"
26 #include "gateway_client.h"
27 #include "hard-interface.h"
28 #include "soft-interface.h"
29 #include "bridge_loop_avoidance.h"
30 #include "network-coding.h"
31 #include "fragmentation.h"
34 static struct lock_class_key batadv_orig_hash_lock_class_key;
36 static void batadv_purge_orig(struct work_struct *work);
38 /* returns 1 if they are the same originator */
39 static int batadv_compare_orig(const struct hlist_node *node, const void *data2)
41 const void *data1 = container_of(node, struct batadv_orig_node,
44 return (memcmp(data1, data2, ETH_ALEN) == 0 ? 1 : 0);
47 int batadv_originator_init(struct batadv_priv *bat_priv)
49 if (bat_priv->orig_hash)
52 bat_priv->orig_hash = batadv_hash_new(1024);
54 if (!bat_priv->orig_hash)
57 batadv_hash_set_lock_class(bat_priv->orig_hash,
58 &batadv_orig_hash_lock_class_key);
60 INIT_DELAYED_WORK(&bat_priv->orig_work, batadv_purge_orig);
61 queue_delayed_work(batadv_event_workqueue,
63 msecs_to_jiffies(BATADV_ORIG_WORK_PERIOD));
71 void batadv_neigh_node_free_ref(struct batadv_neigh_node *neigh_node)
73 if (atomic_dec_and_test(&neigh_node->refcount))
74 kfree_rcu(neigh_node, rcu);
77 /* increases the refcounter of a found router */
78 struct batadv_neigh_node *
79 batadv_orig_node_get_router(struct batadv_orig_node *orig_node)
81 struct batadv_neigh_node *router;
84 router = rcu_dereference(orig_node->router);
86 if (router && !atomic_inc_not_zero(&router->refcount))
93 struct batadv_neigh_node *
94 batadv_neigh_node_new(struct batadv_hard_iface *hard_iface,
95 const uint8_t *neigh_addr)
97 struct batadv_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
98 struct batadv_neigh_node *neigh_node;
100 neigh_node = kzalloc(sizeof(*neigh_node), GFP_ATOMIC);
104 INIT_HLIST_NODE(&neigh_node->list);
106 memcpy(neigh_node->addr, neigh_addr, ETH_ALEN);
107 spin_lock_init(&neigh_node->lq_update_lock);
109 /* extra reference for return */
110 atomic_set(&neigh_node->refcount, 2);
112 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
113 "Creating new neighbor %pM on interface %s\n", neigh_addr,
114 hard_iface->net_dev->name);
120 static void batadv_orig_node_free_rcu(struct rcu_head *rcu)
122 struct hlist_node *node_tmp;
123 struct batadv_neigh_node *neigh_node, *tmp_neigh_node;
124 struct batadv_orig_node *orig_node;
126 orig_node = container_of(rcu, struct batadv_orig_node, rcu);
128 spin_lock_bh(&orig_node->neigh_list_lock);
130 /* for all bonding members ... */
131 list_for_each_entry_safe(neigh_node, tmp_neigh_node,
132 &orig_node->bond_list, bonding_list) {
133 list_del_rcu(&neigh_node->bonding_list);
134 batadv_neigh_node_free_ref(neigh_node);
137 /* for all neighbors towards this originator ... */
138 hlist_for_each_entry_safe(neigh_node, node_tmp,
139 &orig_node->neigh_list, list) {
140 hlist_del_rcu(&neigh_node->list);
141 batadv_neigh_node_free_ref(neigh_node);
144 spin_unlock_bh(&orig_node->neigh_list_lock);
147 batadv_nc_purge_orig(orig_node->bat_priv, orig_node, NULL);
149 batadv_frag_purge_orig(orig_node, NULL);
151 batadv_tt_global_del_orig(orig_node->bat_priv, orig_node,
152 "originator timed out");
154 kfree(orig_node->tt_buff);
155 kfree(orig_node->bcast_own);
156 kfree(orig_node->bcast_own_sum);
161 * batadv_orig_node_free_ref - decrement the orig node refcounter and possibly
162 * schedule an rcu callback for freeing it
163 * @orig_node: the orig node to free
165 void batadv_orig_node_free_ref(struct batadv_orig_node *orig_node)
167 if (atomic_dec_and_test(&orig_node->refcount))
168 call_rcu(&orig_node->rcu, batadv_orig_node_free_rcu);
172 * batadv_orig_node_free_ref_now - decrement the orig node refcounter and
173 * possibly free it (without rcu callback)
174 * @orig_node: the orig node to free
176 void batadv_orig_node_free_ref_now(struct batadv_orig_node *orig_node)
178 if (atomic_dec_and_test(&orig_node->refcount))
179 batadv_orig_node_free_rcu(&orig_node->rcu);
182 void batadv_originator_free(struct batadv_priv *bat_priv)
184 struct batadv_hashtable *hash = bat_priv->orig_hash;
185 struct hlist_node *node_tmp;
186 struct hlist_head *head;
187 spinlock_t *list_lock; /* spinlock to protect write access */
188 struct batadv_orig_node *orig_node;
194 cancel_delayed_work_sync(&bat_priv->orig_work);
196 bat_priv->orig_hash = NULL;
198 for (i = 0; i < hash->size; i++) {
199 head = &hash->table[i];
200 list_lock = &hash->list_locks[i];
202 spin_lock_bh(list_lock);
203 hlist_for_each_entry_safe(orig_node, node_tmp,
205 hlist_del_rcu(&orig_node->hash_entry);
206 batadv_orig_node_free_ref(orig_node);
208 spin_unlock_bh(list_lock);
211 batadv_hash_destroy(hash);
214 /* this function finds or creates an originator entry for the given
215 * address if it does not exits
217 struct batadv_orig_node *batadv_get_orig_node(struct batadv_priv *bat_priv,
220 struct batadv_orig_node *orig_node;
223 unsigned long reset_time;
225 orig_node = batadv_orig_hash_find(bat_priv, addr);
229 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
230 "Creating new originator: %pM\n", addr);
232 orig_node = kzalloc(sizeof(*orig_node), GFP_ATOMIC);
236 INIT_HLIST_HEAD(&orig_node->neigh_list);
237 INIT_LIST_HEAD(&orig_node->bond_list);
238 spin_lock_init(&orig_node->ogm_cnt_lock);
239 spin_lock_init(&orig_node->bcast_seqno_lock);
240 spin_lock_init(&orig_node->neigh_list_lock);
241 spin_lock_init(&orig_node->tt_buff_lock);
242 spin_lock_init(&orig_node->tt_lock);
244 batadv_nc_init_orig(orig_node);
246 /* extra reference for return */
247 atomic_set(&orig_node->refcount, 2);
249 orig_node->tt_initialised = false;
250 orig_node->bat_priv = bat_priv;
251 memcpy(orig_node->orig, addr, ETH_ALEN);
252 batadv_dat_init_orig_node_addr(orig_node);
253 orig_node->router = NULL;
254 orig_node->tt_crc = 0;
255 atomic_set(&orig_node->last_ttvn, 0);
256 orig_node->tt_buff = NULL;
257 orig_node->tt_buff_len = 0;
258 atomic_set(&orig_node->tt_size, 0);
259 reset_time = jiffies - 1 - msecs_to_jiffies(BATADV_RESET_PROTECTION_MS);
260 orig_node->bcast_seqno_reset = reset_time;
261 orig_node->batman_seqno_reset = reset_time;
263 atomic_set(&orig_node->bond_candidates, 0);
265 size = bat_priv->num_ifaces * sizeof(unsigned long) * BATADV_NUM_WORDS;
267 orig_node->bcast_own = kzalloc(size, GFP_ATOMIC);
268 if (!orig_node->bcast_own)
271 size = bat_priv->num_ifaces * sizeof(uint8_t);
272 orig_node->bcast_own_sum = kzalloc(size, GFP_ATOMIC);
274 for (i = 0; i < BATADV_FRAG_BUFFER_COUNT; i++) {
275 INIT_HLIST_HEAD(&orig_node->fragments[i].head);
276 spin_lock_init(&orig_node->fragments[i].lock);
277 orig_node->fragments[i].size = 0;
280 if (!orig_node->bcast_own_sum)
283 hash_added = batadv_hash_add(bat_priv->orig_hash, batadv_compare_orig,
284 batadv_choose_orig, orig_node,
285 &orig_node->hash_entry);
287 goto free_bcast_own_sum;
291 kfree(orig_node->bcast_own_sum);
293 kfree(orig_node->bcast_own);
300 batadv_purge_orig_neighbors(struct batadv_priv *bat_priv,
301 struct batadv_orig_node *orig_node,
302 struct batadv_neigh_node **best_neigh_node)
304 struct hlist_node *node_tmp;
305 struct batadv_neigh_node *neigh_node;
306 bool neigh_purged = false;
307 unsigned long last_seen;
308 struct batadv_hard_iface *if_incoming;
310 *best_neigh_node = NULL;
312 spin_lock_bh(&orig_node->neigh_list_lock);
314 /* for all neighbors towards this originator ... */
315 hlist_for_each_entry_safe(neigh_node, node_tmp,
316 &orig_node->neigh_list, list) {
317 last_seen = neigh_node->last_seen;
318 if_incoming = neigh_node->if_incoming;
320 if ((batadv_has_timed_out(last_seen, BATADV_PURGE_TIMEOUT)) ||
321 (if_incoming->if_status == BATADV_IF_INACTIVE) ||
322 (if_incoming->if_status == BATADV_IF_NOT_IN_USE) ||
323 (if_incoming->if_status == BATADV_IF_TO_BE_REMOVED)) {
324 if ((if_incoming->if_status == BATADV_IF_INACTIVE) ||
325 (if_incoming->if_status == BATADV_IF_NOT_IN_USE) ||
326 (if_incoming->if_status == BATADV_IF_TO_BE_REMOVED))
327 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
328 "neighbor purge: originator %pM, neighbor: %pM, iface: %s\n",
329 orig_node->orig, neigh_node->addr,
330 if_incoming->net_dev->name);
332 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
333 "neighbor timeout: originator %pM, neighbor: %pM, last_seen: %u\n",
334 orig_node->orig, neigh_node->addr,
335 jiffies_to_msecs(last_seen));
339 hlist_del_rcu(&neigh_node->list);
340 batadv_bonding_candidate_del(orig_node, neigh_node);
341 batadv_neigh_node_free_ref(neigh_node);
343 if ((!*best_neigh_node) ||
344 (neigh_node->tq_avg > (*best_neigh_node)->tq_avg))
345 *best_neigh_node = neigh_node;
349 spin_unlock_bh(&orig_node->neigh_list_lock);
353 static bool batadv_purge_orig_node(struct batadv_priv *bat_priv,
354 struct batadv_orig_node *orig_node)
356 struct batadv_neigh_node *best_neigh_node;
358 if (batadv_has_timed_out(orig_node->last_seen,
359 2 * BATADV_PURGE_TIMEOUT)) {
360 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
361 "Originator timeout: originator %pM, last_seen %u\n",
363 jiffies_to_msecs(orig_node->last_seen));
366 if (batadv_purge_orig_neighbors(bat_priv, orig_node,
368 batadv_update_route(bat_priv, orig_node,
375 static void _batadv_purge_orig(struct batadv_priv *bat_priv)
377 struct batadv_hashtable *hash = bat_priv->orig_hash;
378 struct hlist_node *node_tmp;
379 struct hlist_head *head;
380 spinlock_t *list_lock; /* spinlock to protect write access */
381 struct batadv_orig_node *orig_node;
387 /* for all origins... */
388 for (i = 0; i < hash->size; i++) {
389 head = &hash->table[i];
390 list_lock = &hash->list_locks[i];
392 spin_lock_bh(list_lock);
393 hlist_for_each_entry_safe(orig_node, node_tmp,
395 if (batadv_purge_orig_node(bat_priv, orig_node)) {
396 batadv_gw_node_delete(bat_priv, orig_node);
397 hlist_del_rcu(&orig_node->hash_entry);
398 batadv_orig_node_free_ref(orig_node);
402 batadv_frag_purge_orig(orig_node,
403 batadv_frag_check_entry);
405 spin_unlock_bh(list_lock);
408 batadv_gw_node_purge(bat_priv);
409 batadv_gw_election(bat_priv);
412 static void batadv_purge_orig(struct work_struct *work)
414 struct delayed_work *delayed_work;
415 struct batadv_priv *bat_priv;
417 delayed_work = container_of(work, struct delayed_work, work);
418 bat_priv = container_of(delayed_work, struct batadv_priv, orig_work);
419 _batadv_purge_orig(bat_priv);
420 queue_delayed_work(batadv_event_workqueue,
421 &bat_priv->orig_work,
422 msecs_to_jiffies(BATADV_ORIG_WORK_PERIOD));
425 void batadv_purge_orig_ref(struct batadv_priv *bat_priv)
427 _batadv_purge_orig(bat_priv);
430 int batadv_orig_seq_print_text(struct seq_file *seq, void *offset)
432 struct net_device *net_dev = (struct net_device *)seq->private;
433 struct batadv_priv *bat_priv = netdev_priv(net_dev);
434 struct batadv_hashtable *hash = bat_priv->orig_hash;
435 struct hlist_head *head;
436 struct batadv_hard_iface *primary_if;
437 struct batadv_orig_node *orig_node;
438 struct batadv_neigh_node *neigh_node, *neigh_node_tmp;
439 int batman_count = 0;
442 unsigned long last_seen_jiffies;
445 primary_if = batadv_seq_print_text_primary_if_get(seq);
449 seq_printf(seq, "[B.A.T.M.A.N. adv %s, MainIF/MAC: %s/%pM (%s)]\n",
450 BATADV_SOURCE_VERSION, primary_if->net_dev->name,
451 primary_if->net_dev->dev_addr, net_dev->name);
452 seq_printf(seq, " %-15s %s (%s/%i) %17s [%10s]: %20s ...\n",
453 "Originator", "last-seen", "#", BATADV_TQ_MAX_VALUE,
454 "Nexthop", "outgoingIF", "Potential nexthops");
456 for (i = 0; i < hash->size; i++) {
457 head = &hash->table[i];
460 hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
461 neigh_node = batadv_orig_node_get_router(orig_node);
465 if (neigh_node->tq_avg == 0)
468 last_seen_jiffies = jiffies - orig_node->last_seen;
469 last_seen_msecs = jiffies_to_msecs(last_seen_jiffies);
470 last_seen_secs = last_seen_msecs / 1000;
471 last_seen_msecs = last_seen_msecs % 1000;
473 seq_printf(seq, "%pM %4i.%03is (%3i) %pM [%10s]:",
474 orig_node->orig, last_seen_secs,
475 last_seen_msecs, neigh_node->tq_avg,
477 neigh_node->if_incoming->net_dev->name);
479 hlist_for_each_entry_rcu(neigh_node_tmp,
480 &orig_node->neigh_list, list) {
481 seq_printf(seq, " %pM (%3i)",
482 neigh_node_tmp->addr,
483 neigh_node_tmp->tq_avg);
490 batadv_neigh_node_free_ref(neigh_node);
495 if (batman_count == 0)
496 seq_puts(seq, "No batman nodes in range ...\n");
500 batadv_hardif_free_ref(primary_if);
504 static int batadv_orig_node_add_if(struct batadv_orig_node *orig_node,
508 size_t data_size, old_size;
510 data_size = max_if_num * sizeof(unsigned long) * BATADV_NUM_WORDS;
511 old_size = (max_if_num - 1) * sizeof(unsigned long) * BATADV_NUM_WORDS;
512 data_ptr = kmalloc(data_size, GFP_ATOMIC);
516 memcpy(data_ptr, orig_node->bcast_own, old_size);
517 kfree(orig_node->bcast_own);
518 orig_node->bcast_own = data_ptr;
520 data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
524 memcpy(data_ptr, orig_node->bcast_own_sum,
525 (max_if_num - 1) * sizeof(uint8_t));
526 kfree(orig_node->bcast_own_sum);
527 orig_node->bcast_own_sum = data_ptr;
532 int batadv_orig_hash_add_if(struct batadv_hard_iface *hard_iface,
535 struct batadv_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
536 struct batadv_hashtable *hash = bat_priv->orig_hash;
537 struct hlist_head *head;
538 struct batadv_orig_node *orig_node;
542 /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
545 for (i = 0; i < hash->size; i++) {
546 head = &hash->table[i];
549 hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
550 spin_lock_bh(&orig_node->ogm_cnt_lock);
551 ret = batadv_orig_node_add_if(orig_node, max_if_num);
552 spin_unlock_bh(&orig_node->ogm_cnt_lock);
567 static int batadv_orig_node_del_if(struct batadv_orig_node *orig_node,
568 int max_if_num, int del_if_num)
570 void *data_ptr = NULL;
573 /* last interface was removed */
577 chunk_size = sizeof(unsigned long) * BATADV_NUM_WORDS;
578 data_ptr = kmalloc(max_if_num * chunk_size, GFP_ATOMIC);
582 /* copy first part */
583 memcpy(data_ptr, orig_node->bcast_own, del_if_num * chunk_size);
585 /* copy second part */
586 memcpy((char *)data_ptr + del_if_num * chunk_size,
587 orig_node->bcast_own + ((del_if_num + 1) * chunk_size),
588 (max_if_num - del_if_num) * chunk_size);
591 kfree(orig_node->bcast_own);
592 orig_node->bcast_own = data_ptr;
597 data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
601 memcpy(data_ptr, orig_node->bcast_own_sum,
602 del_if_num * sizeof(uint8_t));
604 memcpy((char *)data_ptr + del_if_num * sizeof(uint8_t),
605 orig_node->bcast_own_sum + ((del_if_num + 1) * sizeof(uint8_t)),
606 (max_if_num - del_if_num) * sizeof(uint8_t));
609 kfree(orig_node->bcast_own_sum);
610 orig_node->bcast_own_sum = data_ptr;
615 int batadv_orig_hash_del_if(struct batadv_hard_iface *hard_iface,
618 struct batadv_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
619 struct batadv_hashtable *hash = bat_priv->orig_hash;
620 struct hlist_head *head;
621 struct batadv_hard_iface *hard_iface_tmp;
622 struct batadv_orig_node *orig_node;
626 /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
629 for (i = 0; i < hash->size; i++) {
630 head = &hash->table[i];
633 hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
634 spin_lock_bh(&orig_node->ogm_cnt_lock);
635 ret = batadv_orig_node_del_if(orig_node, max_if_num,
637 spin_unlock_bh(&orig_node->ogm_cnt_lock);
645 /* renumber remaining batman interfaces _inside_ of orig_hash_lock */
647 list_for_each_entry_rcu(hard_iface_tmp, &batadv_hardif_list, list) {
648 if (hard_iface_tmp->if_status == BATADV_IF_NOT_IN_USE)
651 if (hard_iface == hard_iface_tmp)
654 if (hard_iface->soft_iface != hard_iface_tmp->soft_iface)
657 if (hard_iface_tmp->if_num > hard_iface->if_num)
658 hard_iface_tmp->if_num--;
662 hard_iface->if_num = -1;