2 * Copyright (C) 2009-2011 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"
32 static void purge_orig(struct work_struct *work);
34 static void start_purge_timer(struct bat_priv *bat_priv)
36 INIT_DELAYED_WORK(&bat_priv->orig_work, purge_orig);
37 queue_delayed_work(bat_event_workqueue, &bat_priv->orig_work, 1 * HZ);
40 /* returns 1 if they are the same originator */
41 static int 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 originator_init(struct bat_priv *bat_priv)
50 if (bat_priv->orig_hash)
53 bat_priv->orig_hash = hash_new(1024);
55 if (!bat_priv->orig_hash)
58 start_purge_timer(bat_priv);
65 void 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 *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 *create_neighbor(struct orig_node *orig_node,
87 struct orig_node *orig_neigh_node,
89 struct hard_iface *if_incoming)
91 struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface);
92 struct neigh_node *neigh_node;
94 bat_dbg(DBG_BATMAN, bat_priv,
95 "Creating new last-hop neighbor of originator\n");
97 neigh_node = kzalloc(sizeof(*neigh_node), GFP_ATOMIC);
101 INIT_HLIST_NODE(&neigh_node->list);
102 INIT_LIST_HEAD(&neigh_node->bonding_list);
103 spin_lock_init(&neigh_node->tq_lock);
105 memcpy(neigh_node->addr, neigh, ETH_ALEN);
106 neigh_node->orig_node = orig_neigh_node;
107 neigh_node->if_incoming = if_incoming;
109 /* extra reference for return */
110 atomic_set(&neigh_node->refcount, 2);
112 spin_lock_bh(&orig_node->neigh_list_lock);
113 hlist_add_head_rcu(&neigh_node->list, &orig_node->neigh_list);
114 spin_unlock_bh(&orig_node->neigh_list_lock);
118 static void orig_node_free_rcu(struct rcu_head *rcu)
120 struct hlist_node *node, *node_tmp;
121 struct neigh_node *neigh_node, *tmp_neigh_node;
122 struct orig_node *orig_node;
124 orig_node = container_of(rcu, struct orig_node, rcu);
126 spin_lock_bh(&orig_node->neigh_list_lock);
128 /* for all bonding members ... */
129 list_for_each_entry_safe(neigh_node, tmp_neigh_node,
130 &orig_node->bond_list, bonding_list) {
131 list_del_rcu(&neigh_node->bonding_list);
132 neigh_node_free_ref(neigh_node);
135 /* for all neighbors towards this originator ... */
136 hlist_for_each_entry_safe(neigh_node, node, node_tmp,
137 &orig_node->neigh_list, list) {
138 hlist_del_rcu(&neigh_node->list);
139 neigh_node_free_ref(neigh_node);
142 spin_unlock_bh(&orig_node->neigh_list_lock);
144 frag_list_free(&orig_node->frag_list);
145 tt_global_del_orig(orig_node->bat_priv, orig_node,
146 "originator timed out");
148 kfree(orig_node->tt_buff);
149 kfree(orig_node->bcast_own);
150 kfree(orig_node->bcast_own_sum);
154 void orig_node_free_ref(struct orig_node *orig_node)
156 if (atomic_dec_and_test(&orig_node->refcount))
157 call_rcu(&orig_node->rcu, orig_node_free_rcu);
160 void originator_free(struct bat_priv *bat_priv)
162 struct hashtable_t *hash = bat_priv->orig_hash;
163 struct hlist_node *node, *node_tmp;
164 struct hlist_head *head;
165 spinlock_t *list_lock; /* spinlock to protect write access */
166 struct orig_node *orig_node;
172 cancel_delayed_work_sync(&bat_priv->orig_work);
174 bat_priv->orig_hash = NULL;
176 for (i = 0; i < hash->size; i++) {
177 head = &hash->table[i];
178 list_lock = &hash->list_locks[i];
180 spin_lock_bh(list_lock);
181 hlist_for_each_entry_safe(orig_node, node, node_tmp,
185 orig_node_free_ref(orig_node);
187 spin_unlock_bh(list_lock);
193 /* this function finds or creates an originator entry for the given
194 * address if it does not exits */
195 struct orig_node *get_orig_node(struct bat_priv *bat_priv, const uint8_t *addr)
197 struct orig_node *orig_node;
201 orig_node = orig_hash_find(bat_priv, addr);
205 bat_dbg(DBG_BATMAN, bat_priv,
206 "Creating new originator: %pM\n", addr);
208 orig_node = kzalloc(sizeof(*orig_node), GFP_ATOMIC);
212 INIT_HLIST_HEAD(&orig_node->neigh_list);
213 INIT_LIST_HEAD(&orig_node->bond_list);
214 spin_lock_init(&orig_node->ogm_cnt_lock);
215 spin_lock_init(&orig_node->bcast_seqno_lock);
216 spin_lock_init(&orig_node->neigh_list_lock);
217 spin_lock_init(&orig_node->tt_buff_lock);
219 /* extra reference for return */
220 atomic_set(&orig_node->refcount, 2);
222 orig_node->tt_poss_change = false;
223 orig_node->bat_priv = bat_priv;
224 memcpy(orig_node->orig, addr, ETH_ALEN);
225 orig_node->router = NULL;
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 = hash_add(bat_priv->orig_hash, compare_orig,
252 choose_orig, orig_node, &orig_node->hash_entry);
254 goto free_bcast_own_sum;
258 kfree(orig_node->bcast_own_sum);
260 kfree(orig_node->bcast_own);
266 static bool purge_orig_neighbors(struct bat_priv *bat_priv,
267 struct orig_node *orig_node,
268 struct neigh_node **best_neigh_node)
270 struct hlist_node *node, *node_tmp;
271 struct neigh_node *neigh_node;
272 bool neigh_purged = false;
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 ((time_after(jiffies,
283 neigh_node->last_valid + PURGE_TIMEOUT * HZ)) ||
284 (neigh_node->if_incoming->if_status == IF_INACTIVE) ||
285 (neigh_node->if_incoming->if_status == IF_NOT_IN_USE) ||
286 (neigh_node->if_incoming->if_status == IF_TO_BE_REMOVED)) {
288 if ((neigh_node->if_incoming->if_status ==
290 (neigh_node->if_incoming->if_status ==
292 (neigh_node->if_incoming->if_status ==
294 bat_dbg(DBG_BATMAN, bat_priv,
295 "neighbor purge: originator %pM, "
296 "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, "
302 "neighbor: %pM, last_valid: %lu\n",
303 orig_node->orig, neigh_node->addr,
304 (neigh_node->last_valid / HZ));
308 hlist_del_rcu(&neigh_node->list);
309 bonding_candidate_del(orig_node, neigh_node);
310 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 purge_orig_node(struct bat_priv *bat_priv,
323 struct orig_node *orig_node)
325 struct neigh_node *best_neigh_node;
327 if (time_after(jiffies,
328 orig_node->last_valid + 2 * PURGE_TIMEOUT * HZ)) {
330 bat_dbg(DBG_BATMAN, bat_priv,
331 "Originator timeout: originator %pM, last_valid %lu\n",
332 orig_node->orig, (orig_node->last_valid / HZ));
335 if (purge_orig_neighbors(bat_priv, orig_node,
337 update_routes(bat_priv, orig_node,
345 static void _purge_orig(struct bat_priv *bat_priv)
347 struct hashtable_t *hash = bat_priv->orig_hash;
348 struct hlist_node *node, *node_tmp;
349 struct hlist_head *head;
350 spinlock_t *list_lock; /* spinlock to protect write access */
351 struct orig_node *orig_node;
357 /* for all origins... */
358 for (i = 0; i < hash->size; i++) {
359 head = &hash->table[i];
360 list_lock = &hash->list_locks[i];
362 spin_lock_bh(list_lock);
363 hlist_for_each_entry_safe(orig_node, node, node_tmp,
365 if (purge_orig_node(bat_priv, orig_node)) {
366 if (orig_node->gw_flags)
367 gw_node_delete(bat_priv, orig_node);
369 orig_node_free_ref(orig_node);
373 if (time_after(jiffies, orig_node->last_frag_packet +
374 msecs_to_jiffies(FRAG_TIMEOUT)))
375 frag_list_free(&orig_node->frag_list);
377 spin_unlock_bh(list_lock);
380 gw_node_purge(bat_priv);
381 gw_election(bat_priv);
383 softif_neigh_purge(bat_priv);
386 static void purge_orig(struct work_struct *work)
388 struct delayed_work *delayed_work =
389 container_of(work, struct delayed_work, work);
390 struct bat_priv *bat_priv =
391 container_of(delayed_work, struct bat_priv, orig_work);
393 _purge_orig(bat_priv);
394 start_purge_timer(bat_priv);
397 void purge_orig_ref(struct bat_priv *bat_priv)
399 _purge_orig(bat_priv);
402 int orig_seq_print_text(struct seq_file *seq, void *offset)
404 struct net_device *net_dev = (struct net_device *)seq->private;
405 struct bat_priv *bat_priv = netdev_priv(net_dev);
406 struct hashtable_t *hash = bat_priv->orig_hash;
407 struct hlist_node *node, *node_tmp;
408 struct hlist_head *head;
409 struct hard_iface *primary_if;
410 struct orig_node *orig_node;
411 struct neigh_node *neigh_node, *neigh_node_tmp;
412 int batman_count = 0;
417 primary_if = primary_if_get_selected(bat_priv);
420 ret = seq_printf(seq, "BATMAN mesh %s disabled - "
421 "please specify interfaces to enable it\n",
426 if (primary_if->if_status != IF_ACTIVE) {
427 ret = seq_printf(seq, "BATMAN mesh %s "
428 "disabled - primary interface not active\n",
433 seq_printf(seq, "[B.A.T.M.A.N. adv %s, MainIF/MAC: %s/%pM (%s)]\n",
434 SOURCE_VERSION, primary_if->net_dev->name,
435 primary_if->net_dev->dev_addr, net_dev->name);
436 seq_printf(seq, " %-15s %s (%s/%i) %17s [%10s]: %20s ...\n",
437 "Originator", "last-seen", "#", TQ_MAX_VALUE, "Nexthop",
438 "outgoingIF", "Potential nexthops");
440 for (i = 0; i < hash->size; i++) {
441 head = &hash->table[i];
444 hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
445 neigh_node = orig_node_get_router(orig_node);
449 if (neigh_node->tq_avg == 0)
452 last_seen_secs = jiffies_to_msecs(jiffies -
453 orig_node->last_valid) / 1000;
454 last_seen_msecs = jiffies_to_msecs(jiffies -
455 orig_node->last_valid) % 1000;
457 seq_printf(seq, "%pM %4i.%03is (%3i) %pM [%10s]:",
458 orig_node->orig, last_seen_secs,
459 last_seen_msecs, neigh_node->tq_avg,
461 neigh_node->if_incoming->net_dev->name);
463 hlist_for_each_entry_rcu(neigh_node_tmp, node_tmp,
464 &orig_node->neigh_list, list) {
465 seq_printf(seq, " %pM (%3i)",
466 neigh_node_tmp->addr,
467 neigh_node_tmp->tq_avg);
470 seq_printf(seq, "\n");
474 neigh_node_free_ref(neigh_node);
479 if (batman_count == 0)
480 seq_printf(seq, "No batman nodes in range ...\n");
484 hardif_free_ref(primary_if);
488 static int orig_node_add_if(struct orig_node *orig_node, int max_if_num)
492 data_ptr = kmalloc(max_if_num * sizeof(unsigned long) * NUM_WORDS,
495 pr_err("Can't resize orig: out of memory\n");
499 memcpy(data_ptr, orig_node->bcast_own,
500 (max_if_num - 1) * sizeof(unsigned long) * NUM_WORDS);
501 kfree(orig_node->bcast_own);
502 orig_node->bcast_own = data_ptr;
504 data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
506 pr_err("Can't resize orig: out of memory\n");
510 memcpy(data_ptr, orig_node->bcast_own_sum,
511 (max_if_num - 1) * sizeof(uint8_t));
512 kfree(orig_node->bcast_own_sum);
513 orig_node->bcast_own_sum = data_ptr;
518 int orig_hash_add_if(struct hard_iface *hard_iface, int max_if_num)
520 struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
521 struct hashtable_t *hash = bat_priv->orig_hash;
522 struct hlist_node *node;
523 struct hlist_head *head;
524 struct orig_node *orig_node;
527 /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
529 for (i = 0; i < hash->size; i++) {
530 head = &hash->table[i];
533 hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
534 spin_lock_bh(&orig_node->ogm_cnt_lock);
535 ret = orig_node_add_if(orig_node, max_if_num);
536 spin_unlock_bh(&orig_node->ogm_cnt_lock);
551 static int orig_node_del_if(struct orig_node *orig_node,
552 int max_if_num, int del_if_num)
554 void *data_ptr = NULL;
557 /* last interface was removed */
561 chunk_size = sizeof(unsigned long) * NUM_WORDS;
562 data_ptr = kmalloc(max_if_num * chunk_size, GFP_ATOMIC);
564 pr_err("Can't resize orig: out of memory\n");
568 /* copy first part */
569 memcpy(data_ptr, orig_node->bcast_own, del_if_num * chunk_size);
571 /* copy second part */
572 memcpy((char *)data_ptr + del_if_num * chunk_size,
573 orig_node->bcast_own + ((del_if_num + 1) * chunk_size),
574 (max_if_num - del_if_num) * chunk_size);
577 kfree(orig_node->bcast_own);
578 orig_node->bcast_own = data_ptr;
583 data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
585 pr_err("Can't resize orig: out of memory\n");
589 memcpy(data_ptr, orig_node->bcast_own_sum,
590 del_if_num * sizeof(uint8_t));
592 memcpy((char *)data_ptr + del_if_num * sizeof(uint8_t),
593 orig_node->bcast_own_sum + ((del_if_num + 1) * sizeof(uint8_t)),
594 (max_if_num - del_if_num) * sizeof(uint8_t));
597 kfree(orig_node->bcast_own_sum);
598 orig_node->bcast_own_sum = data_ptr;
603 int orig_hash_del_if(struct hard_iface *hard_iface, int max_if_num)
605 struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
606 struct hashtable_t *hash = bat_priv->orig_hash;
607 struct hlist_node *node;
608 struct hlist_head *head;
609 struct hard_iface *hard_iface_tmp;
610 struct orig_node *orig_node;
613 /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
615 for (i = 0; i < hash->size; i++) {
616 head = &hash->table[i];
619 hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
620 spin_lock_bh(&orig_node->ogm_cnt_lock);
621 ret = orig_node_del_if(orig_node, max_if_num,
623 spin_unlock_bh(&orig_node->ogm_cnt_lock);
631 /* renumber remaining batman interfaces _inside_ of orig_hash_lock */
633 list_for_each_entry_rcu(hard_iface_tmp, &hardif_list, list) {
634 if (hard_iface_tmp->if_status == IF_NOT_IN_USE)
637 if (hard_iface == hard_iface_tmp)
640 if (hard_iface->soft_iface != hard_iface_tmp->soft_iface)
643 if (hard_iface_tmp->if_num > hard_iface->if_num)
644 hard_iface_tmp->if_num--;
648 hard_iface->if_num = -1;