2 * Copyright (C) 2009-2012 B.A.T.M.A.N. contributors:
4 * Marek Lindner, Simon Wunderlich
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of version 2 of the GNU General Public
8 * License as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
23 #include "originator.h"
25 #include "translation-table.h"
27 #include "gateway_client.h"
28 #include "hard-interface.h"
30 #include "soft-interface.h"
31 #include "bridge_loop_avoidance.h"
33 static void purge_orig(struct work_struct *work);
35 static void start_purge_timer(struct bat_priv *bat_priv)
37 INIT_DELAYED_WORK(&bat_priv->orig_work, purge_orig);
38 queue_delayed_work(bat_event_workqueue,
39 &bat_priv->orig_work, msecs_to_jiffies(1000));
42 /* returns 1 if they are the same originator */
43 static int compare_orig(const struct hlist_node *node, const void *data2)
45 const void *data1 = container_of(node, struct orig_node, hash_entry);
47 return (memcmp(data1, data2, ETH_ALEN) == 0 ? 1 : 0);
50 int originator_init(struct bat_priv *bat_priv)
52 if (bat_priv->orig_hash)
55 bat_priv->orig_hash = hash_new(1024);
57 if (!bat_priv->orig_hash)
60 start_purge_timer(bat_priv);
67 void neigh_node_free_ref(struct neigh_node *neigh_node)
69 if (atomic_dec_and_test(&neigh_node->refcount))
70 kfree_rcu(neigh_node, rcu);
73 /* increases the refcounter of a found router */
74 struct neigh_node *orig_node_get_router(struct orig_node *orig_node)
76 struct neigh_node *router;
79 router = rcu_dereference(orig_node->router);
81 if (router && !atomic_inc_not_zero(&router->refcount))
88 struct neigh_node *batadv_neigh_node_new(struct hard_iface *hard_iface,
89 const uint8_t *neigh_addr,
92 struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
93 struct neigh_node *neigh_node;
95 neigh_node = kzalloc(sizeof(*neigh_node), GFP_ATOMIC);
99 INIT_HLIST_NODE(&neigh_node->list);
101 memcpy(neigh_node->addr, neigh_addr, ETH_ALEN);
103 /* extra reference for return */
104 atomic_set(&neigh_node->refcount, 2);
106 bat_dbg(DBG_BATMAN, bat_priv,
107 "Creating new neighbor %pM, initial seqno %d\n",
114 static void orig_node_free_rcu(struct rcu_head *rcu)
116 struct hlist_node *node, *node_tmp;
117 struct neigh_node *neigh_node, *tmp_neigh_node;
118 struct orig_node *orig_node;
120 orig_node = container_of(rcu, struct orig_node, rcu);
122 spin_lock_bh(&orig_node->neigh_list_lock);
124 /* for all bonding members ... */
125 list_for_each_entry_safe(neigh_node, tmp_neigh_node,
126 &orig_node->bond_list, bonding_list) {
127 list_del_rcu(&neigh_node->bonding_list);
128 neigh_node_free_ref(neigh_node);
131 /* for all neighbors towards this originator ... */
132 hlist_for_each_entry_safe(neigh_node, node, node_tmp,
133 &orig_node->neigh_list, list) {
134 hlist_del_rcu(&neigh_node->list);
135 neigh_node_free_ref(neigh_node);
138 spin_unlock_bh(&orig_node->neigh_list_lock);
140 frag_list_free(&orig_node->frag_list);
141 tt_global_del_orig(orig_node->bat_priv, orig_node,
142 "originator timed out");
144 kfree(orig_node->tt_buff);
145 kfree(orig_node->bcast_own);
146 kfree(orig_node->bcast_own_sum);
150 void orig_node_free_ref(struct orig_node *orig_node)
152 if (atomic_dec_and_test(&orig_node->refcount))
153 call_rcu(&orig_node->rcu, orig_node_free_rcu);
156 void originator_free(struct bat_priv *bat_priv)
158 struct hashtable_t *hash = bat_priv->orig_hash;
159 struct hlist_node *node, *node_tmp;
160 struct hlist_head *head;
161 spinlock_t *list_lock; /* spinlock to protect write access */
162 struct orig_node *orig_node;
168 cancel_delayed_work_sync(&bat_priv->orig_work);
170 bat_priv->orig_hash = NULL;
172 for (i = 0; i < hash->size; i++) {
173 head = &hash->table[i];
174 list_lock = &hash->list_locks[i];
176 spin_lock_bh(list_lock);
177 hlist_for_each_entry_safe(orig_node, node, node_tmp,
181 orig_node_free_ref(orig_node);
183 spin_unlock_bh(list_lock);
189 /* this function finds or creates an originator entry for the given
190 * address if it does not exits */
191 struct orig_node *get_orig_node(struct bat_priv *bat_priv, const uint8_t *addr)
193 struct orig_node *orig_node;
197 orig_node = orig_hash_find(bat_priv, addr);
201 bat_dbg(DBG_BATMAN, bat_priv,
202 "Creating new originator: %pM\n", addr);
204 orig_node = kzalloc(sizeof(*orig_node), GFP_ATOMIC);
208 INIT_HLIST_HEAD(&orig_node->neigh_list);
209 INIT_LIST_HEAD(&orig_node->bond_list);
210 spin_lock_init(&orig_node->ogm_cnt_lock);
211 spin_lock_init(&orig_node->bcast_seqno_lock);
212 spin_lock_init(&orig_node->neigh_list_lock);
213 spin_lock_init(&orig_node->tt_buff_lock);
215 /* extra reference for return */
216 atomic_set(&orig_node->refcount, 2);
218 orig_node->tt_initialised = false;
219 orig_node->tt_poss_change = false;
220 orig_node->bat_priv = bat_priv;
221 memcpy(orig_node->orig, addr, ETH_ALEN);
222 orig_node->router = NULL;
223 orig_node->tt_crc = 0;
224 atomic_set(&orig_node->last_ttvn, 0);
225 orig_node->tt_buff = NULL;
226 orig_node->tt_buff_len = 0;
227 atomic_set(&orig_node->tt_size, 0);
228 orig_node->bcast_seqno_reset = jiffies - 1
229 - msecs_to_jiffies(RESET_PROTECTION_MS);
230 orig_node->batman_seqno_reset = jiffies - 1
231 - msecs_to_jiffies(RESET_PROTECTION_MS);
233 atomic_set(&orig_node->bond_candidates, 0);
235 size = bat_priv->num_ifaces * sizeof(unsigned long) * NUM_WORDS;
237 orig_node->bcast_own = kzalloc(size, GFP_ATOMIC);
238 if (!orig_node->bcast_own)
241 size = bat_priv->num_ifaces * sizeof(uint8_t);
242 orig_node->bcast_own_sum = kzalloc(size, GFP_ATOMIC);
244 INIT_LIST_HEAD(&orig_node->frag_list);
245 orig_node->last_frag_packet = 0;
247 if (!orig_node->bcast_own_sum)
250 hash_added = hash_add(bat_priv->orig_hash, compare_orig,
251 choose_orig, orig_node, &orig_node->hash_entry);
253 goto free_bcast_own_sum;
257 kfree(orig_node->bcast_own_sum);
259 kfree(orig_node->bcast_own);
265 static bool purge_orig_neighbors(struct bat_priv *bat_priv,
266 struct orig_node *orig_node,
267 struct neigh_node **best_neigh_node)
269 struct hlist_node *node, *node_tmp;
270 struct neigh_node *neigh_node;
271 bool neigh_purged = false;
272 unsigned long last_seen;
274 *best_neigh_node = NULL;
276 spin_lock_bh(&orig_node->neigh_list_lock);
278 /* for all neighbors towards this originator ... */
279 hlist_for_each_entry_safe(neigh_node, node, node_tmp,
280 &orig_node->neigh_list, list) {
282 if ((has_timed_out(neigh_node->last_seen, PURGE_TIMEOUT)) ||
283 (neigh_node->if_incoming->if_status == IF_INACTIVE) ||
284 (neigh_node->if_incoming->if_status == IF_NOT_IN_USE) ||
285 (neigh_node->if_incoming->if_status == IF_TO_BE_REMOVED)) {
287 last_seen = neigh_node->last_seen;
289 if ((neigh_node->if_incoming->if_status ==
291 (neigh_node->if_incoming->if_status ==
293 (neigh_node->if_incoming->if_status ==
295 bat_dbg(DBG_BATMAN, bat_priv,
296 "neighbor purge: originator %pM, neighbor: %pM, iface: %s\n",
297 orig_node->orig, neigh_node->addr,
298 neigh_node->if_incoming->net_dev->name);
300 bat_dbg(DBG_BATMAN, bat_priv,
301 "neighbor timeout: originator %pM, neighbor: %pM, last_seen: %u\n",
302 orig_node->orig, neigh_node->addr,
303 jiffies_to_msecs(last_seen));
307 hlist_del_rcu(&neigh_node->list);
308 bonding_candidate_del(orig_node, neigh_node);
309 neigh_node_free_ref(neigh_node);
311 if ((!*best_neigh_node) ||
312 (neigh_node->tq_avg > (*best_neigh_node)->tq_avg))
313 *best_neigh_node = neigh_node;
317 spin_unlock_bh(&orig_node->neigh_list_lock);
321 static bool purge_orig_node(struct bat_priv *bat_priv,
322 struct orig_node *orig_node)
324 struct neigh_node *best_neigh_node;
326 if (has_timed_out(orig_node->last_seen, 2 * PURGE_TIMEOUT)) {
327 bat_dbg(DBG_BATMAN, bat_priv,
328 "Originator timeout: originator %pM, last_seen %u\n",
330 jiffies_to_msecs(orig_node->last_seen));
333 if (purge_orig_neighbors(bat_priv, orig_node,
335 update_route(bat_priv, orig_node, best_neigh_node);
341 static void _purge_orig(struct bat_priv *bat_priv)
343 struct hashtable_t *hash = bat_priv->orig_hash;
344 struct hlist_node *node, *node_tmp;
345 struct hlist_head *head;
346 spinlock_t *list_lock; /* spinlock to protect write access */
347 struct orig_node *orig_node;
353 /* for all origins... */
354 for (i = 0; i < hash->size; i++) {
355 head = &hash->table[i];
356 list_lock = &hash->list_locks[i];
358 spin_lock_bh(list_lock);
359 hlist_for_each_entry_safe(orig_node, node, node_tmp,
361 if (purge_orig_node(bat_priv, orig_node)) {
362 if (orig_node->gw_flags)
363 gw_node_delete(bat_priv, orig_node);
365 orig_node_free_ref(orig_node);
369 if (has_timed_out(orig_node->last_frag_packet,
371 frag_list_free(&orig_node->frag_list);
373 spin_unlock_bh(list_lock);
376 gw_node_purge(bat_priv);
377 gw_election(bat_priv);
380 static void purge_orig(struct work_struct *work)
382 struct delayed_work *delayed_work =
383 container_of(work, struct delayed_work, work);
384 struct bat_priv *bat_priv =
385 container_of(delayed_work, struct bat_priv, orig_work);
387 _purge_orig(bat_priv);
388 start_purge_timer(bat_priv);
391 void purge_orig_ref(struct bat_priv *bat_priv)
393 _purge_orig(bat_priv);
396 int orig_seq_print_text(struct seq_file *seq, void *offset)
398 struct net_device *net_dev = (struct net_device *)seq->private;
399 struct bat_priv *bat_priv = netdev_priv(net_dev);
400 struct hashtable_t *hash = bat_priv->orig_hash;
401 struct hlist_node *node, *node_tmp;
402 struct hlist_head *head;
403 struct hard_iface *primary_if;
404 struct orig_node *orig_node;
405 struct neigh_node *neigh_node, *neigh_node_tmp;
406 int batman_count = 0;
412 primary_if = primary_if_get_selected(bat_priv);
415 ret = seq_printf(seq,
416 "BATMAN mesh %s disabled - please specify interfaces to enable it\n",
421 if (primary_if->if_status != IF_ACTIVE) {
422 ret = seq_printf(seq,
423 "BATMAN mesh %s disabled - primary interface not active\n",
428 seq_printf(seq, "[B.A.T.M.A.N. adv %s, MainIF/MAC: %s/%pM (%s)]\n",
429 SOURCE_VERSION, primary_if->net_dev->name,
430 primary_if->net_dev->dev_addr, net_dev->name);
431 seq_printf(seq, " %-15s %s (%s/%i) %17s [%10s]: %20s ...\n",
432 "Originator", "last-seen", "#", TQ_MAX_VALUE, "Nexthop",
433 "outgoingIF", "Potential nexthops");
435 for (i = 0; i < hash->size; i++) {
436 head = &hash->table[i];
439 hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
440 neigh_node = orig_node_get_router(orig_node);
444 if (neigh_node->tq_avg == 0)
447 last_seen_secs = jiffies_to_msecs(jiffies -
448 orig_node->last_seen) / 1000;
449 last_seen_msecs = jiffies_to_msecs(jiffies -
450 orig_node->last_seen) % 1000;
452 seq_printf(seq, "%pM %4i.%03is (%3i) %pM [%10s]:",
453 orig_node->orig, last_seen_secs,
454 last_seen_msecs, neigh_node->tq_avg,
456 neigh_node->if_incoming->net_dev->name);
458 hlist_for_each_entry_rcu(neigh_node_tmp, node_tmp,
459 &orig_node->neigh_list, list) {
460 seq_printf(seq, " %pM (%3i)",
461 neigh_node_tmp->addr,
462 neigh_node_tmp->tq_avg);
465 seq_printf(seq, "\n");
469 neigh_node_free_ref(neigh_node);
474 if (batman_count == 0)
475 seq_printf(seq, "No batman nodes in range ...\n");
479 hardif_free_ref(primary_if);
483 static int orig_node_add_if(struct orig_node *orig_node, int max_if_num)
487 data_ptr = kmalloc(max_if_num * sizeof(unsigned long) * NUM_WORDS,
492 memcpy(data_ptr, orig_node->bcast_own,
493 (max_if_num - 1) * sizeof(unsigned long) * NUM_WORDS);
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 orig_hash_add_if(struct hard_iface *hard_iface, int max_if_num)
511 struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
512 struct hashtable_t *hash = bat_priv->orig_hash;
513 struct hlist_node *node;
514 struct hlist_head *head;
515 struct orig_node *orig_node;
519 /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
521 for (i = 0; i < hash->size; i++) {
522 head = &hash->table[i];
525 hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
526 spin_lock_bh(&orig_node->ogm_cnt_lock);
527 ret = orig_node_add_if(orig_node, max_if_num);
528 spin_unlock_bh(&orig_node->ogm_cnt_lock);
543 static int orig_node_del_if(struct orig_node *orig_node,
544 int max_if_num, int del_if_num)
546 void *data_ptr = NULL;
549 /* last interface was removed */
553 chunk_size = sizeof(unsigned long) * NUM_WORDS;
554 data_ptr = kmalloc(max_if_num * chunk_size, GFP_ATOMIC);
558 /* copy first part */
559 memcpy(data_ptr, orig_node->bcast_own, del_if_num * chunk_size);
561 /* copy second part */
562 memcpy((char *)data_ptr + del_if_num * chunk_size,
563 orig_node->bcast_own + ((del_if_num + 1) * chunk_size),
564 (max_if_num - del_if_num) * chunk_size);
567 kfree(orig_node->bcast_own);
568 orig_node->bcast_own = data_ptr;
573 data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
577 memcpy(data_ptr, orig_node->bcast_own_sum,
578 del_if_num * sizeof(uint8_t));
580 memcpy((char *)data_ptr + del_if_num * sizeof(uint8_t),
581 orig_node->bcast_own_sum + ((del_if_num + 1) * sizeof(uint8_t)),
582 (max_if_num - del_if_num) * sizeof(uint8_t));
585 kfree(orig_node->bcast_own_sum);
586 orig_node->bcast_own_sum = data_ptr;
591 int orig_hash_del_if(struct hard_iface *hard_iface, int max_if_num)
593 struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
594 struct hashtable_t *hash = bat_priv->orig_hash;
595 struct hlist_node *node;
596 struct hlist_head *head;
597 struct hard_iface *hard_iface_tmp;
598 struct orig_node *orig_node;
602 /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
604 for (i = 0; i < hash->size; i++) {
605 head = &hash->table[i];
608 hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
609 spin_lock_bh(&orig_node->ogm_cnt_lock);
610 ret = orig_node_del_if(orig_node, max_if_num,
612 spin_unlock_bh(&orig_node->ogm_cnt_lock);
620 /* renumber remaining batman interfaces _inside_ of orig_hash_lock */
622 list_for_each_entry_rcu(hard_iface_tmp, &hardif_list, list) {
623 if (hard_iface_tmp->if_status == IF_NOT_IN_USE)
626 if (hard_iface == hard_iface_tmp)
629 if (hard_iface->soft_iface != hard_iface_tmp->soft_iface)
632 if (hard_iface_tmp->if_num > hard_iface->if_num)
633 hard_iface_tmp->if_num--;
637 hard_iface->if_num = -1;