1 /* Copyright (C) 2009-2012 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 "originator.h"
23 #include "translation-table.h"
25 #include "gateway_client.h"
26 #include "hard-interface.h"
28 #include "soft-interface.h"
29 #include "bridge_loop_avoidance.h"
31 static void batadv_purge_orig(struct work_struct *work);
33 static void batadv_start_purge_timer(struct bat_priv *bat_priv)
35 INIT_DELAYED_WORK(&bat_priv->orig_work, batadv_purge_orig);
36 queue_delayed_work(batadv_event_workqueue,
37 &bat_priv->orig_work, msecs_to_jiffies(1000));
40 /* returns 1 if they are the same originator */
41 static int batadv_compare_orig(const struct hlist_node *node, const void *data2)
43 const void *data1 = container_of(node, struct orig_node, hash_entry);
45 return (memcmp(data1, data2, ETH_ALEN) == 0 ? 1 : 0);
48 int batadv_originator_init(struct bat_priv *bat_priv)
50 if (bat_priv->orig_hash)
53 bat_priv->orig_hash = batadv_hash_new(1024);
55 if (!bat_priv->orig_hash)
58 batadv_start_purge_timer(bat_priv);
65 void batadv_neigh_node_free_ref(struct neigh_node *neigh_node)
67 if (atomic_dec_and_test(&neigh_node->refcount))
68 kfree_rcu(neigh_node, rcu);
71 /* increases the refcounter of a found router */
72 struct neigh_node *batadv_orig_node_get_router(struct orig_node *orig_node)
74 struct neigh_node *router;
77 router = rcu_dereference(orig_node->router);
79 if (router && !atomic_inc_not_zero(&router->refcount))
86 struct neigh_node *batadv_neigh_node_new(struct hard_iface *hard_iface,
87 const uint8_t *neigh_addr,
90 struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
91 struct neigh_node *neigh_node;
93 neigh_node = kzalloc(sizeof(*neigh_node), GFP_ATOMIC);
97 INIT_HLIST_NODE(&neigh_node->list);
99 memcpy(neigh_node->addr, neigh_addr, ETH_ALEN);
100 spin_lock_init(&neigh_node->lq_update_lock);
102 /* extra reference for return */
103 atomic_set(&neigh_node->refcount, 2);
105 batadv_dbg(DBG_BATMAN, bat_priv,
106 "Creating new neighbor %pM, initial seqno %d\n",
113 static void batadv_orig_node_free_rcu(struct rcu_head *rcu)
115 struct hlist_node *node, *node_tmp;
116 struct neigh_node *neigh_node, *tmp_neigh_node;
117 struct orig_node *orig_node;
119 orig_node = container_of(rcu, struct orig_node, rcu);
121 spin_lock_bh(&orig_node->neigh_list_lock);
123 /* for all bonding members ... */
124 list_for_each_entry_safe(neigh_node, tmp_neigh_node,
125 &orig_node->bond_list, bonding_list) {
126 list_del_rcu(&neigh_node->bonding_list);
127 batadv_neigh_node_free_ref(neigh_node);
130 /* for all neighbors towards this originator ... */
131 hlist_for_each_entry_safe(neigh_node, node, node_tmp,
132 &orig_node->neigh_list, list) {
133 hlist_del_rcu(&neigh_node->list);
134 batadv_neigh_node_free_ref(neigh_node);
137 spin_unlock_bh(&orig_node->neigh_list_lock);
139 batadv_frag_list_free(&orig_node->frag_list);
140 batadv_tt_global_del_orig(orig_node->bat_priv, orig_node,
141 "originator timed out");
143 kfree(orig_node->tt_buff);
144 kfree(orig_node->bcast_own);
145 kfree(orig_node->bcast_own_sum);
149 void batadv_orig_node_free_ref(struct orig_node *orig_node)
151 if (atomic_dec_and_test(&orig_node->refcount))
152 call_rcu(&orig_node->rcu, batadv_orig_node_free_rcu);
155 void batadv_originator_free(struct bat_priv *bat_priv)
157 struct hashtable_t *hash = bat_priv->orig_hash;
158 struct hlist_node *node, *node_tmp;
159 struct hlist_head *head;
160 spinlock_t *list_lock; /* spinlock to protect write access */
161 struct orig_node *orig_node;
167 cancel_delayed_work_sync(&bat_priv->orig_work);
169 bat_priv->orig_hash = NULL;
171 for (i = 0; i < hash->size; i++) {
172 head = &hash->table[i];
173 list_lock = &hash->list_locks[i];
175 spin_lock_bh(list_lock);
176 hlist_for_each_entry_safe(orig_node, node, node_tmp,
180 batadv_orig_node_free_ref(orig_node);
182 spin_unlock_bh(list_lock);
185 batadv_hash_destroy(hash);
188 /* this function finds or creates an originator entry for the given
189 * address if it does not exits
191 struct orig_node *batadv_get_orig_node(struct bat_priv *bat_priv,
194 struct orig_node *orig_node;
198 orig_node = batadv_orig_hash_find(bat_priv, addr);
202 batadv_dbg(DBG_BATMAN, bat_priv, "Creating new originator: %pM\n",
205 orig_node = kzalloc(sizeof(*orig_node), GFP_ATOMIC);
209 INIT_HLIST_HEAD(&orig_node->neigh_list);
210 INIT_LIST_HEAD(&orig_node->bond_list);
211 spin_lock_init(&orig_node->ogm_cnt_lock);
212 spin_lock_init(&orig_node->bcast_seqno_lock);
213 spin_lock_init(&orig_node->neigh_list_lock);
214 spin_lock_init(&orig_node->tt_buff_lock);
216 /* extra reference for return */
217 atomic_set(&orig_node->refcount, 2);
219 orig_node->tt_initialised = false;
220 orig_node->tt_poss_change = false;
221 orig_node->bat_priv = bat_priv;
222 memcpy(orig_node->orig, addr, ETH_ALEN);
223 orig_node->router = NULL;
224 orig_node->tt_crc = 0;
225 atomic_set(&orig_node->last_ttvn, 0);
226 orig_node->tt_buff = NULL;
227 orig_node->tt_buff_len = 0;
228 atomic_set(&orig_node->tt_size, 0);
229 orig_node->bcast_seqno_reset = jiffies - 1
230 - msecs_to_jiffies(RESET_PROTECTION_MS);
231 orig_node->batman_seqno_reset = jiffies - 1
232 - msecs_to_jiffies(RESET_PROTECTION_MS);
234 atomic_set(&orig_node->bond_candidates, 0);
236 size = bat_priv->num_ifaces * sizeof(unsigned long) * NUM_WORDS;
238 orig_node->bcast_own = kzalloc(size, GFP_ATOMIC);
239 if (!orig_node->bcast_own)
242 size = bat_priv->num_ifaces * sizeof(uint8_t);
243 orig_node->bcast_own_sum = kzalloc(size, GFP_ATOMIC);
245 INIT_LIST_HEAD(&orig_node->frag_list);
246 orig_node->last_frag_packet = 0;
248 if (!orig_node->bcast_own_sum)
251 hash_added = batadv_hash_add(bat_priv->orig_hash, batadv_compare_orig,
252 batadv_choose_orig, orig_node,
253 &orig_node->hash_entry);
255 goto free_bcast_own_sum;
259 kfree(orig_node->bcast_own_sum);
261 kfree(orig_node->bcast_own);
267 static bool batadv_purge_orig_neighbors(struct bat_priv *bat_priv,
268 struct orig_node *orig_node,
269 struct neigh_node **best_neigh_node)
271 struct hlist_node *node, *node_tmp;
272 struct neigh_node *neigh_node;
273 bool neigh_purged = false;
274 unsigned long last_seen;
275 struct hard_iface *if_incoming;
277 *best_neigh_node = NULL;
279 spin_lock_bh(&orig_node->neigh_list_lock);
281 /* for all neighbors towards this originator ... */
282 hlist_for_each_entry_safe(neigh_node, node, node_tmp,
283 &orig_node->neigh_list, list) {
285 last_seen = neigh_node->last_seen;
286 if_incoming = neigh_node->if_incoming;
288 if ((batadv_has_timed_out(last_seen, PURGE_TIMEOUT)) ||
289 (if_incoming->if_status == IF_INACTIVE) ||
290 (if_incoming->if_status == IF_NOT_IN_USE) ||
291 (if_incoming->if_status == IF_TO_BE_REMOVED)) {
293 if ((if_incoming->if_status == IF_INACTIVE) ||
294 (if_incoming->if_status == IF_NOT_IN_USE) ||
295 (if_incoming->if_status == IF_TO_BE_REMOVED))
296 batadv_dbg(DBG_BATMAN, bat_priv,
297 "neighbor purge: originator %pM, neighbor: %pM, iface: %s\n",
298 orig_node->orig, neigh_node->addr,
299 if_incoming->net_dev->name);
301 batadv_dbg(DBG_BATMAN, bat_priv,
302 "neighbor timeout: originator %pM, neighbor: %pM, last_seen: %u\n",
303 orig_node->orig, neigh_node->addr,
304 jiffies_to_msecs(last_seen));
308 hlist_del_rcu(&neigh_node->list);
309 batadv_bonding_candidate_del(orig_node, neigh_node);
310 batadv_neigh_node_free_ref(neigh_node);
312 if ((!*best_neigh_node) ||
313 (neigh_node->tq_avg > (*best_neigh_node)->tq_avg))
314 *best_neigh_node = neigh_node;
318 spin_unlock_bh(&orig_node->neigh_list_lock);
322 static bool batadv_purge_orig_node(struct bat_priv *bat_priv,
323 struct orig_node *orig_node)
325 struct neigh_node *best_neigh_node;
327 if (batadv_has_timed_out(orig_node->last_seen, 2 * PURGE_TIMEOUT)) {
328 batadv_dbg(DBG_BATMAN, bat_priv,
329 "Originator timeout: originator %pM, last_seen %u\n",
331 jiffies_to_msecs(orig_node->last_seen));
334 if (batadv_purge_orig_neighbors(bat_priv, orig_node,
336 batadv_update_route(bat_priv, orig_node,
343 static void _batadv_purge_orig(struct bat_priv *bat_priv)
345 struct hashtable_t *hash = bat_priv->orig_hash;
346 struct hlist_node *node, *node_tmp;
347 struct hlist_head *head;
348 spinlock_t *list_lock; /* spinlock to protect write access */
349 struct orig_node *orig_node;
355 /* for all origins... */
356 for (i = 0; i < hash->size; i++) {
357 head = &hash->table[i];
358 list_lock = &hash->list_locks[i];
360 spin_lock_bh(list_lock);
361 hlist_for_each_entry_safe(orig_node, node, node_tmp,
363 if (batadv_purge_orig_node(bat_priv, orig_node)) {
364 if (orig_node->gw_flags)
365 batadv_gw_node_delete(bat_priv,
368 batadv_orig_node_free_ref(orig_node);
372 if (batadv_has_timed_out(orig_node->last_frag_packet,
374 batadv_frag_list_free(&orig_node->frag_list);
376 spin_unlock_bh(list_lock);
379 batadv_gw_node_purge(bat_priv);
380 batadv_gw_election(bat_priv);
383 static void batadv_purge_orig(struct work_struct *work)
385 struct delayed_work *delayed_work =
386 container_of(work, struct delayed_work, work);
387 struct bat_priv *bat_priv =
388 container_of(delayed_work, struct bat_priv, orig_work);
390 _batadv_purge_orig(bat_priv);
391 batadv_start_purge_timer(bat_priv);
394 void batadv_purge_orig_ref(struct bat_priv *bat_priv)
396 _batadv_purge_orig(bat_priv);
399 int batadv_orig_seq_print_text(struct seq_file *seq, void *offset)
401 struct net_device *net_dev = (struct net_device *)seq->private;
402 struct bat_priv *bat_priv = netdev_priv(net_dev);
403 struct hashtable_t *hash = bat_priv->orig_hash;
404 struct hlist_node *node, *node_tmp;
405 struct hlist_head *head;
406 struct hard_iface *primary_if;
407 struct orig_node *orig_node;
408 struct neigh_node *neigh_node, *neigh_node_tmp;
409 int batman_count = 0;
415 primary_if = batadv_primary_if_get_selected(bat_priv);
418 ret = seq_printf(seq,
419 "BATMAN mesh %s disabled - please specify interfaces to enable it\n",
424 if (primary_if->if_status != IF_ACTIVE) {
425 ret = seq_printf(seq,
426 "BATMAN mesh %s disabled - primary interface not active\n",
431 seq_printf(seq, "[B.A.T.M.A.N. adv %s, MainIF/MAC: %s/%pM (%s)]\n",
432 SOURCE_VERSION, primary_if->net_dev->name,
433 primary_if->net_dev->dev_addr, net_dev->name);
434 seq_printf(seq, " %-15s %s (%s/%i) %17s [%10s]: %20s ...\n",
435 "Originator", "last-seen", "#", TQ_MAX_VALUE, "Nexthop",
436 "outgoingIF", "Potential nexthops");
438 for (i = 0; i < hash->size; i++) {
439 head = &hash->table[i];
442 hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
443 neigh_node = batadv_orig_node_get_router(orig_node);
447 if (neigh_node->tq_avg == 0)
450 last_seen_secs = jiffies_to_msecs(jiffies -
451 orig_node->last_seen) / 1000;
452 last_seen_msecs = jiffies_to_msecs(jiffies -
453 orig_node->last_seen) % 1000;
455 seq_printf(seq, "%pM %4i.%03is (%3i) %pM [%10s]:",
456 orig_node->orig, last_seen_secs,
457 last_seen_msecs, neigh_node->tq_avg,
459 neigh_node->if_incoming->net_dev->name);
461 hlist_for_each_entry_rcu(neigh_node_tmp, node_tmp,
462 &orig_node->neigh_list, list) {
463 seq_printf(seq, " %pM (%3i)",
464 neigh_node_tmp->addr,
465 neigh_node_tmp->tq_avg);
468 seq_printf(seq, "\n");
472 batadv_neigh_node_free_ref(neigh_node);
477 if (batman_count == 0)
478 seq_printf(seq, "No batman nodes in range ...\n");
482 batadv_hardif_free_ref(primary_if);
486 static int batadv_orig_node_add_if(struct orig_node *orig_node, int max_if_num)
490 data_ptr = kmalloc(max_if_num * sizeof(unsigned long) * NUM_WORDS,
495 memcpy(data_ptr, orig_node->bcast_own,
496 (max_if_num - 1) * sizeof(unsigned long) * NUM_WORDS);
497 kfree(orig_node->bcast_own);
498 orig_node->bcast_own = data_ptr;
500 data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
504 memcpy(data_ptr, orig_node->bcast_own_sum,
505 (max_if_num - 1) * sizeof(uint8_t));
506 kfree(orig_node->bcast_own_sum);
507 orig_node->bcast_own_sum = data_ptr;
512 int batadv_orig_hash_add_if(struct hard_iface *hard_iface, int max_if_num)
514 struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
515 struct hashtable_t *hash = bat_priv->orig_hash;
516 struct hlist_node *node;
517 struct hlist_head *head;
518 struct orig_node *orig_node;
522 /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
525 for (i = 0; i < hash->size; i++) {
526 head = &hash->table[i];
529 hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
530 spin_lock_bh(&orig_node->ogm_cnt_lock);
531 ret = batadv_orig_node_add_if(orig_node, max_if_num);
532 spin_unlock_bh(&orig_node->ogm_cnt_lock);
547 static int batadv_orig_node_del_if(struct orig_node *orig_node,
548 int max_if_num, int del_if_num)
550 void *data_ptr = NULL;
553 /* last interface was removed */
557 chunk_size = sizeof(unsigned long) * NUM_WORDS;
558 data_ptr = kmalloc(max_if_num * chunk_size, GFP_ATOMIC);
562 /* copy first part */
563 memcpy(data_ptr, orig_node->bcast_own, del_if_num * chunk_size);
565 /* copy second part */
566 memcpy((char *)data_ptr + del_if_num * chunk_size,
567 orig_node->bcast_own + ((del_if_num + 1) * chunk_size),
568 (max_if_num - del_if_num) * chunk_size);
571 kfree(orig_node->bcast_own);
572 orig_node->bcast_own = data_ptr;
577 data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
581 memcpy(data_ptr, orig_node->bcast_own_sum,
582 del_if_num * sizeof(uint8_t));
584 memcpy((char *)data_ptr + del_if_num * sizeof(uint8_t),
585 orig_node->bcast_own_sum + ((del_if_num + 1) * sizeof(uint8_t)),
586 (max_if_num - del_if_num) * sizeof(uint8_t));
589 kfree(orig_node->bcast_own_sum);
590 orig_node->bcast_own_sum = data_ptr;
595 int batadv_orig_hash_del_if(struct hard_iface *hard_iface, int max_if_num)
597 struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
598 struct hashtable_t *hash = bat_priv->orig_hash;
599 struct hlist_node *node;
600 struct hlist_head *head;
601 struct hard_iface *hard_iface_tmp;
602 struct orig_node *orig_node;
606 /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
609 for (i = 0; i < hash->size; i++) {
610 head = &hash->table[i];
613 hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
614 spin_lock_bh(&orig_node->ogm_cnt_lock);
615 ret = batadv_orig_node_del_if(orig_node, max_if_num,
617 spin_unlock_bh(&orig_node->ogm_cnt_lock);
625 /* renumber remaining batman interfaces _inside_ of orig_hash_lock */
627 list_for_each_entry_rcu(hard_iface_tmp, &batadv_hardif_list, list) {
628 if (hard_iface_tmp->if_status == IF_NOT_IN_USE)
631 if (hard_iface == hard_iface_tmp)
634 if (hard_iface->soft_iface != hard_iface_tmp->soft_iface)
637 if (hard_iface_tmp->if_num > hard_iface->if_num)
638 hard_iface_tmp->if_num--;
642 hard_iface->if_num = -1;