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"
29 #include "soft-interface.h"
30 #include "bridge_loop_avoidance.h"
33 static struct lock_class_key batadv_orig_hash_lock_class_key;
35 static void batadv_purge_orig(struct work_struct *work);
37 /* returns 1 if they are the same originator */
38 static int batadv_compare_orig(const struct hlist_node *node, const void *data2)
40 const void *data1 = container_of(node, struct batadv_orig_node,
43 return (memcmp(data1, data2, ETH_ALEN) == 0 ? 1 : 0);
46 int batadv_originator_init(struct batadv_priv *bat_priv)
48 if (bat_priv->orig_hash)
51 bat_priv->orig_hash = batadv_hash_new(1024);
53 if (!bat_priv->orig_hash)
56 batadv_hash_set_lock_class(bat_priv->orig_hash,
57 &batadv_orig_hash_lock_class_key);
59 INIT_DELAYED_WORK(&bat_priv->orig_work, batadv_purge_orig);
60 queue_delayed_work(batadv_event_workqueue,
62 msecs_to_jiffies(BATADV_ORIG_WORK_PERIOD));
70 void batadv_neigh_node_free_ref(struct batadv_neigh_node *neigh_node)
72 if (atomic_dec_and_test(&neigh_node->refcount))
73 kfree_rcu(neigh_node, rcu);
76 /* increases the refcounter of a found router */
77 struct batadv_neigh_node *
78 batadv_orig_node_get_router(struct batadv_orig_node *orig_node)
80 struct batadv_neigh_node *router;
83 router = rcu_dereference(orig_node->router);
85 if (router && !atomic_inc_not_zero(&router->refcount))
92 struct batadv_neigh_node *
93 batadv_neigh_node_new(struct batadv_hard_iface *hard_iface,
94 const uint8_t *neigh_addr, uint32_t seqno)
96 struct batadv_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
97 struct batadv_neigh_node *neigh_node;
99 neigh_node = kzalloc(sizeof(*neigh_node), GFP_ATOMIC);
103 INIT_HLIST_NODE(&neigh_node->list);
105 memcpy(neigh_node->addr, neigh_addr, ETH_ALEN);
106 spin_lock_init(&neigh_node->lq_update_lock);
108 /* extra reference for return */
109 atomic_set(&neigh_node->refcount, 2);
111 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
112 "Creating new neighbor %pM, initial seqno %d\n",
119 static void batadv_orig_node_free_rcu(struct rcu_head *rcu)
121 struct hlist_node *node, *node_tmp;
122 struct batadv_neigh_node *neigh_node, *tmp_neigh_node;
123 struct batadv_orig_node *orig_node;
125 orig_node = container_of(rcu, struct batadv_orig_node, rcu);
127 spin_lock_bh(&orig_node->neigh_list_lock);
129 /* for all bonding members ... */
130 list_for_each_entry_safe(neigh_node, tmp_neigh_node,
131 &orig_node->bond_list, bonding_list) {
132 list_del_rcu(&neigh_node->bonding_list);
133 batadv_neigh_node_free_ref(neigh_node);
136 /* for all neighbors towards this originator ... */
137 hlist_for_each_entry_safe(neigh_node, node, node_tmp,
138 &orig_node->neigh_list, list) {
139 hlist_del_rcu(&neigh_node->list);
140 batadv_neigh_node_free_ref(neigh_node);
143 spin_unlock_bh(&orig_node->neigh_list_lock);
145 batadv_frag_list_free(&orig_node->frag_list);
146 batadv_tt_global_del_orig(orig_node->bat_priv, orig_node,
147 "originator timed out");
149 kfree(orig_node->tt_buff);
150 kfree(orig_node->bcast_own);
151 kfree(orig_node->bcast_own_sum);
155 void batadv_orig_node_free_ref(struct batadv_orig_node *orig_node)
157 if (atomic_dec_and_test(&orig_node->refcount))
158 call_rcu(&orig_node->rcu, batadv_orig_node_free_rcu);
161 void batadv_originator_free(struct batadv_priv *bat_priv)
163 struct batadv_hashtable *hash = bat_priv->orig_hash;
164 struct hlist_node *node, *node_tmp;
165 struct hlist_head *head;
166 spinlock_t *list_lock; /* spinlock to protect write access */
167 struct batadv_orig_node *orig_node;
173 cancel_delayed_work_sync(&bat_priv->orig_work);
175 bat_priv->orig_hash = NULL;
177 for (i = 0; i < hash->size; i++) {
178 head = &hash->table[i];
179 list_lock = &hash->list_locks[i];
181 spin_lock_bh(list_lock);
182 hlist_for_each_entry_safe(orig_node, node, node_tmp,
185 batadv_orig_node_free_ref(orig_node);
187 spin_unlock_bh(list_lock);
190 batadv_hash_destroy(hash);
193 /* this function finds or creates an originator entry for the given
194 * address if it does not exits
196 struct batadv_orig_node *batadv_get_orig_node(struct batadv_priv *bat_priv,
199 struct batadv_orig_node *orig_node;
202 unsigned long reset_time;
204 orig_node = batadv_orig_hash_find(bat_priv, addr);
208 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
209 "Creating new originator: %pM\n", addr);
211 orig_node = kzalloc(sizeof(*orig_node), GFP_ATOMIC);
215 INIT_HLIST_HEAD(&orig_node->neigh_list);
216 INIT_LIST_HEAD(&orig_node->bond_list);
217 spin_lock_init(&orig_node->ogm_cnt_lock);
218 spin_lock_init(&orig_node->bcast_seqno_lock);
219 spin_lock_init(&orig_node->neigh_list_lock);
220 spin_lock_init(&orig_node->tt_buff_lock);
222 /* extra reference for return */
223 atomic_set(&orig_node->refcount, 2);
225 orig_node->tt_initialised = false;
226 orig_node->bat_priv = bat_priv;
227 memcpy(orig_node->orig, addr, ETH_ALEN);
228 batadv_dat_init_orig_node_addr(orig_node);
229 orig_node->router = NULL;
230 orig_node->tt_crc = 0;
231 atomic_set(&orig_node->last_ttvn, 0);
232 orig_node->tt_buff = NULL;
233 orig_node->tt_buff_len = 0;
234 atomic_set(&orig_node->tt_size, 0);
235 reset_time = jiffies - 1 - msecs_to_jiffies(BATADV_RESET_PROTECTION_MS);
236 orig_node->bcast_seqno_reset = reset_time;
237 orig_node->batman_seqno_reset = reset_time;
239 atomic_set(&orig_node->bond_candidates, 0);
241 size = bat_priv->num_ifaces * sizeof(unsigned long) * BATADV_NUM_WORDS;
243 orig_node->bcast_own = kzalloc(size, GFP_ATOMIC);
244 if (!orig_node->bcast_own)
247 size = bat_priv->num_ifaces * sizeof(uint8_t);
248 orig_node->bcast_own_sum = kzalloc(size, GFP_ATOMIC);
250 INIT_LIST_HEAD(&orig_node->frag_list);
251 orig_node->last_frag_packet = 0;
253 if (!orig_node->bcast_own_sum)
256 hash_added = batadv_hash_add(bat_priv->orig_hash, batadv_compare_orig,
257 batadv_choose_orig, orig_node,
258 &orig_node->hash_entry);
260 goto free_bcast_own_sum;
264 kfree(orig_node->bcast_own_sum);
266 kfree(orig_node->bcast_own);
273 batadv_purge_orig_neighbors(struct batadv_priv *bat_priv,
274 struct batadv_orig_node *orig_node,
275 struct batadv_neigh_node **best_neigh_node)
277 struct hlist_node *node, *node_tmp;
278 struct batadv_neigh_node *neigh_node;
279 bool neigh_purged = false;
280 unsigned long last_seen;
281 struct batadv_hard_iface *if_incoming;
283 *best_neigh_node = NULL;
285 spin_lock_bh(&orig_node->neigh_list_lock);
287 /* for all neighbors towards this originator ... */
288 hlist_for_each_entry_safe(neigh_node, node, node_tmp,
289 &orig_node->neigh_list, list) {
290 last_seen = neigh_node->last_seen;
291 if_incoming = neigh_node->if_incoming;
293 if ((batadv_has_timed_out(last_seen, BATADV_PURGE_TIMEOUT)) ||
294 (if_incoming->if_status == BATADV_IF_INACTIVE) ||
295 (if_incoming->if_status == BATADV_IF_NOT_IN_USE) ||
296 (if_incoming->if_status == BATADV_IF_TO_BE_REMOVED)) {
297 if ((if_incoming->if_status == BATADV_IF_INACTIVE) ||
298 (if_incoming->if_status == BATADV_IF_NOT_IN_USE) ||
299 (if_incoming->if_status == BATADV_IF_TO_BE_REMOVED))
300 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
301 "neighbor purge: originator %pM, neighbor: %pM, iface: %s\n",
302 orig_node->orig, neigh_node->addr,
303 if_incoming->net_dev->name);
305 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
306 "neighbor timeout: originator %pM, neighbor: %pM, last_seen: %u\n",
307 orig_node->orig, neigh_node->addr,
308 jiffies_to_msecs(last_seen));
312 hlist_del_rcu(&neigh_node->list);
313 batadv_bonding_candidate_del(orig_node, neigh_node);
314 batadv_neigh_node_free_ref(neigh_node);
316 if ((!*best_neigh_node) ||
317 (neigh_node->tq_avg > (*best_neigh_node)->tq_avg))
318 *best_neigh_node = neigh_node;
322 spin_unlock_bh(&orig_node->neigh_list_lock);
326 static bool batadv_purge_orig_node(struct batadv_priv *bat_priv,
327 struct batadv_orig_node *orig_node)
329 struct batadv_neigh_node *best_neigh_node;
331 if (batadv_has_timed_out(orig_node->last_seen,
332 2 * BATADV_PURGE_TIMEOUT)) {
333 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
334 "Originator timeout: originator %pM, last_seen %u\n",
336 jiffies_to_msecs(orig_node->last_seen));
339 if (batadv_purge_orig_neighbors(bat_priv, orig_node,
341 batadv_update_route(bat_priv, orig_node,
348 static void _batadv_purge_orig(struct batadv_priv *bat_priv)
350 struct batadv_hashtable *hash = bat_priv->orig_hash;
351 struct hlist_node *node, *node_tmp;
352 struct hlist_head *head;
353 spinlock_t *list_lock; /* spinlock to protect write access */
354 struct batadv_orig_node *orig_node;
360 /* for all origins... */
361 for (i = 0; i < hash->size; i++) {
362 head = &hash->table[i];
363 list_lock = &hash->list_locks[i];
365 spin_lock_bh(list_lock);
366 hlist_for_each_entry_safe(orig_node, node, node_tmp,
368 if (batadv_purge_orig_node(bat_priv, orig_node)) {
369 if (orig_node->gw_flags)
370 batadv_gw_node_delete(bat_priv,
373 batadv_orig_node_free_ref(orig_node);
377 if (batadv_has_timed_out(orig_node->last_frag_packet,
378 BATADV_FRAG_TIMEOUT))
379 batadv_frag_list_free(&orig_node->frag_list);
381 spin_unlock_bh(list_lock);
384 batadv_gw_node_purge(bat_priv);
385 batadv_gw_election(bat_priv);
388 static void batadv_purge_orig(struct work_struct *work)
390 struct delayed_work *delayed_work;
391 struct batadv_priv *bat_priv;
393 delayed_work = container_of(work, struct delayed_work, work);
394 bat_priv = container_of(delayed_work, struct batadv_priv, orig_work);
395 _batadv_purge_orig(bat_priv);
396 queue_delayed_work(batadv_event_workqueue,
397 &bat_priv->orig_work,
398 msecs_to_jiffies(BATADV_ORIG_WORK_PERIOD));
401 void batadv_purge_orig_ref(struct batadv_priv *bat_priv)
403 _batadv_purge_orig(bat_priv);
406 int batadv_orig_seq_print_text(struct seq_file *seq, void *offset)
408 struct net_device *net_dev = (struct net_device *)seq->private;
409 struct batadv_priv *bat_priv = netdev_priv(net_dev);
410 struct batadv_hashtable *hash = bat_priv->orig_hash;
411 struct hlist_node *node, *node_tmp;
412 struct hlist_head *head;
413 struct batadv_hard_iface *primary_if;
414 struct batadv_orig_node *orig_node;
415 struct batadv_neigh_node *neigh_node, *neigh_node_tmp;
416 int batman_count = 0;
419 unsigned long last_seen_jiffies;
422 primary_if = batadv_seq_print_text_primary_if_get(seq);
426 seq_printf(seq, "[B.A.T.M.A.N. adv %s, MainIF/MAC: %s/%pM (%s)]\n",
427 BATADV_SOURCE_VERSION, primary_if->net_dev->name,
428 primary_if->net_dev->dev_addr, net_dev->name);
429 seq_printf(seq, " %-15s %s (%s/%i) %17s [%10s]: %20s ...\n",
430 "Originator", "last-seen", "#", BATADV_TQ_MAX_VALUE,
431 "Nexthop", "outgoingIF", "Potential nexthops");
433 for (i = 0; i < hash->size; i++) {
434 head = &hash->table[i];
437 hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
438 neigh_node = batadv_orig_node_get_router(orig_node);
442 if (neigh_node->tq_avg == 0)
445 last_seen_jiffies = jiffies - orig_node->last_seen;
446 last_seen_msecs = jiffies_to_msecs(last_seen_jiffies);
447 last_seen_secs = last_seen_msecs / 1000;
448 last_seen_msecs = last_seen_msecs % 1000;
450 seq_printf(seq, "%pM %4i.%03is (%3i) %pM [%10s]:",
451 orig_node->orig, last_seen_secs,
452 last_seen_msecs, neigh_node->tq_avg,
454 neigh_node->if_incoming->net_dev->name);
456 hlist_for_each_entry_rcu(neigh_node_tmp, node_tmp,
457 &orig_node->neigh_list, list) {
458 seq_printf(seq, " %pM (%3i)",
459 neigh_node_tmp->addr,
460 neigh_node_tmp->tq_avg);
463 seq_printf(seq, "\n");
467 batadv_neigh_node_free_ref(neigh_node);
472 if (batman_count == 0)
473 seq_printf(seq, "No batman nodes in range ...\n");
477 batadv_hardif_free_ref(primary_if);
481 static int batadv_orig_node_add_if(struct batadv_orig_node *orig_node,
485 size_t data_size, old_size;
487 data_size = max_if_num * sizeof(unsigned long) * BATADV_NUM_WORDS;
488 old_size = (max_if_num - 1) * sizeof(unsigned long) * BATADV_NUM_WORDS;
489 data_ptr = kmalloc(data_size, GFP_ATOMIC);
493 memcpy(data_ptr, orig_node->bcast_own, old_size);
494 kfree(orig_node->bcast_own);
495 orig_node->bcast_own = data_ptr;
497 data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
501 memcpy(data_ptr, orig_node->bcast_own_sum,
502 (max_if_num - 1) * sizeof(uint8_t));
503 kfree(orig_node->bcast_own_sum);
504 orig_node->bcast_own_sum = data_ptr;
509 int batadv_orig_hash_add_if(struct batadv_hard_iface *hard_iface,
512 struct batadv_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
513 struct batadv_hashtable *hash = bat_priv->orig_hash;
514 struct hlist_node *node;
515 struct hlist_head *head;
516 struct batadv_orig_node *orig_node;
520 /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
523 for (i = 0; i < hash->size; i++) {
524 head = &hash->table[i];
527 hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
528 spin_lock_bh(&orig_node->ogm_cnt_lock);
529 ret = batadv_orig_node_add_if(orig_node, max_if_num);
530 spin_unlock_bh(&orig_node->ogm_cnt_lock);
545 static int batadv_orig_node_del_if(struct batadv_orig_node *orig_node,
546 int max_if_num, int del_if_num)
548 void *data_ptr = NULL;
551 /* last interface was removed */
555 chunk_size = sizeof(unsigned long) * BATADV_NUM_WORDS;
556 data_ptr = kmalloc(max_if_num * chunk_size, GFP_ATOMIC);
560 /* copy first part */
561 memcpy(data_ptr, orig_node->bcast_own, del_if_num * chunk_size);
563 /* copy second part */
564 memcpy((char *)data_ptr + del_if_num * chunk_size,
565 orig_node->bcast_own + ((del_if_num + 1) * chunk_size),
566 (max_if_num - del_if_num) * chunk_size);
569 kfree(orig_node->bcast_own);
570 orig_node->bcast_own = data_ptr;
575 data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
579 memcpy(data_ptr, orig_node->bcast_own_sum,
580 del_if_num * sizeof(uint8_t));
582 memcpy((char *)data_ptr + del_if_num * sizeof(uint8_t),
583 orig_node->bcast_own_sum + ((del_if_num + 1) * sizeof(uint8_t)),
584 (max_if_num - del_if_num) * sizeof(uint8_t));
587 kfree(orig_node->bcast_own_sum);
588 orig_node->bcast_own_sum = data_ptr;
593 int batadv_orig_hash_del_if(struct batadv_hard_iface *hard_iface,
596 struct batadv_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
597 struct batadv_hashtable *hash = bat_priv->orig_hash;
598 struct hlist_node *node;
599 struct hlist_head *head;
600 struct batadv_hard_iface *hard_iface_tmp;
601 struct batadv_orig_node *orig_node;
605 /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
608 for (i = 0; i < hash->size; i++) {
609 head = &hash->table[i];
612 hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
613 spin_lock_bh(&orig_node->ogm_cnt_lock);
614 ret = batadv_orig_node_del_if(orig_node, max_if_num,
616 spin_unlock_bh(&orig_node->ogm_cnt_lock);
624 /* renumber remaining batman interfaces _inside_ of orig_hash_lock */
626 list_for_each_entry_rcu(hard_iface_tmp, &batadv_hardif_list, list) {
627 if (hard_iface_tmp->if_status == BATADV_IF_NOT_IN_USE)
630 if (hard_iface == hard_iface_tmp)
633 if (hard_iface->soft_iface != hard_iface_tmp->soft_iface)
636 if (hard_iface_tmp->if_num > hard_iface->if_num)
637 hard_iface_tmp->if_num--;
641 hard_iface->if_num = -1;