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"
31 #include "network-coding.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, uint32_t seqno)
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, initial seqno %d\n",
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_list_free(&orig_node->frag_list);
150 batadv_tt_global_del_orig(orig_node->bat_priv, orig_node,
151 "originator timed out");
153 kfree(orig_node->tt_buff);
154 kfree(orig_node->bcast_own);
155 kfree(orig_node->bcast_own_sum);
159 void batadv_orig_node_free_ref(struct batadv_orig_node *orig_node)
161 if (atomic_dec_and_test(&orig_node->refcount))
162 call_rcu(&orig_node->rcu, batadv_orig_node_free_rcu);
165 void batadv_originator_free(struct batadv_priv *bat_priv)
167 struct batadv_hashtable *hash = bat_priv->orig_hash;
168 struct hlist_node *node_tmp;
169 struct hlist_head *head;
170 spinlock_t *list_lock; /* spinlock to protect write access */
171 struct batadv_orig_node *orig_node;
177 cancel_delayed_work_sync(&bat_priv->orig_work);
179 bat_priv->orig_hash = NULL;
181 for (i = 0; i < hash->size; i++) {
182 head = &hash->table[i];
183 list_lock = &hash->list_locks[i];
185 spin_lock_bh(list_lock);
186 hlist_for_each_entry_safe(orig_node, node_tmp,
188 hlist_del_rcu(&orig_node->hash_entry);
189 batadv_orig_node_free_ref(orig_node);
191 spin_unlock_bh(list_lock);
194 batadv_hash_destroy(hash);
197 /* this function finds or creates an originator entry for the given
198 * address if it does not exits
200 struct batadv_orig_node *batadv_get_orig_node(struct batadv_priv *bat_priv,
203 struct batadv_orig_node *orig_node;
206 unsigned long reset_time;
208 orig_node = batadv_orig_hash_find(bat_priv, addr);
212 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
213 "Creating new originator: %pM\n", addr);
215 orig_node = kzalloc(sizeof(*orig_node), GFP_ATOMIC);
219 INIT_HLIST_HEAD(&orig_node->neigh_list);
220 INIT_LIST_HEAD(&orig_node->bond_list);
221 spin_lock_init(&orig_node->ogm_cnt_lock);
222 spin_lock_init(&orig_node->bcast_seqno_lock);
223 spin_lock_init(&orig_node->neigh_list_lock);
224 spin_lock_init(&orig_node->tt_buff_lock);
226 batadv_nc_init_orig(orig_node);
228 /* extra reference for return */
229 atomic_set(&orig_node->refcount, 2);
231 orig_node->tt_initialised = false;
232 orig_node->bat_priv = bat_priv;
233 memcpy(orig_node->orig, addr, ETH_ALEN);
234 batadv_dat_init_orig_node_addr(orig_node);
235 orig_node->router = NULL;
236 orig_node->tt_crc = 0;
237 atomic_set(&orig_node->last_ttvn, 0);
238 orig_node->tt_buff = NULL;
239 orig_node->tt_buff_len = 0;
240 atomic_set(&orig_node->tt_size, 0);
241 reset_time = jiffies - 1 - msecs_to_jiffies(BATADV_RESET_PROTECTION_MS);
242 orig_node->bcast_seqno_reset = reset_time;
243 orig_node->batman_seqno_reset = reset_time;
245 atomic_set(&orig_node->bond_candidates, 0);
247 size = bat_priv->num_ifaces * sizeof(unsigned long) * BATADV_NUM_WORDS;
249 orig_node->bcast_own = kzalloc(size, GFP_ATOMIC);
250 if (!orig_node->bcast_own)
253 size = bat_priv->num_ifaces * sizeof(uint8_t);
254 orig_node->bcast_own_sum = kzalloc(size, GFP_ATOMIC);
256 INIT_LIST_HEAD(&orig_node->frag_list);
257 orig_node->last_frag_packet = 0;
259 if (!orig_node->bcast_own_sum)
262 hash_added = batadv_hash_add(bat_priv->orig_hash, batadv_compare_orig,
263 batadv_choose_orig, orig_node,
264 &orig_node->hash_entry);
266 goto free_bcast_own_sum;
270 kfree(orig_node->bcast_own_sum);
272 kfree(orig_node->bcast_own);
279 batadv_purge_orig_neighbors(struct batadv_priv *bat_priv,
280 struct batadv_orig_node *orig_node,
281 struct batadv_neigh_node **best_neigh_node)
283 struct hlist_node *node_tmp;
284 struct batadv_neigh_node *neigh_node;
285 bool neigh_purged = false;
286 unsigned long last_seen;
287 struct batadv_hard_iface *if_incoming;
289 *best_neigh_node = NULL;
291 spin_lock_bh(&orig_node->neigh_list_lock);
293 /* for all neighbors towards this originator ... */
294 hlist_for_each_entry_safe(neigh_node, node_tmp,
295 &orig_node->neigh_list, list) {
296 last_seen = neigh_node->last_seen;
297 if_incoming = neigh_node->if_incoming;
299 if ((batadv_has_timed_out(last_seen, BATADV_PURGE_TIMEOUT)) ||
300 (if_incoming->if_status == BATADV_IF_INACTIVE) ||
301 (if_incoming->if_status == BATADV_IF_NOT_IN_USE) ||
302 (if_incoming->if_status == BATADV_IF_TO_BE_REMOVED)) {
303 if ((if_incoming->if_status == BATADV_IF_INACTIVE) ||
304 (if_incoming->if_status == BATADV_IF_NOT_IN_USE) ||
305 (if_incoming->if_status == BATADV_IF_TO_BE_REMOVED))
306 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
307 "neighbor purge: originator %pM, neighbor: %pM, iface: %s\n",
308 orig_node->orig, neigh_node->addr,
309 if_incoming->net_dev->name);
311 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
312 "neighbor timeout: originator %pM, neighbor: %pM, last_seen: %u\n",
313 orig_node->orig, neigh_node->addr,
314 jiffies_to_msecs(last_seen));
318 hlist_del_rcu(&neigh_node->list);
319 batadv_bonding_candidate_del(orig_node, neigh_node);
320 batadv_neigh_node_free_ref(neigh_node);
322 if ((!*best_neigh_node) ||
323 (neigh_node->tq_avg > (*best_neigh_node)->tq_avg))
324 *best_neigh_node = neigh_node;
328 spin_unlock_bh(&orig_node->neigh_list_lock);
332 static bool batadv_purge_orig_node(struct batadv_priv *bat_priv,
333 struct batadv_orig_node *orig_node)
335 struct batadv_neigh_node *best_neigh_node;
337 if (batadv_has_timed_out(orig_node->last_seen,
338 2 * BATADV_PURGE_TIMEOUT)) {
339 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
340 "Originator timeout: originator %pM, last_seen %u\n",
342 jiffies_to_msecs(orig_node->last_seen));
345 if (batadv_purge_orig_neighbors(bat_priv, orig_node,
347 batadv_update_route(bat_priv, orig_node,
354 static void _batadv_purge_orig(struct batadv_priv *bat_priv)
356 struct batadv_hashtable *hash = bat_priv->orig_hash;
357 struct hlist_node *node_tmp;
358 struct hlist_head *head;
359 spinlock_t *list_lock; /* spinlock to protect write access */
360 struct batadv_orig_node *orig_node;
366 /* for all origins... */
367 for (i = 0; i < hash->size; i++) {
368 head = &hash->table[i];
369 list_lock = &hash->list_locks[i];
371 spin_lock_bh(list_lock);
372 hlist_for_each_entry_safe(orig_node, node_tmp,
374 if (batadv_purge_orig_node(bat_priv, orig_node)) {
375 if (orig_node->gw_flags)
376 batadv_gw_node_delete(bat_priv,
378 hlist_del_rcu(&orig_node->hash_entry);
379 batadv_orig_node_free_ref(orig_node);
383 if (batadv_has_timed_out(orig_node->last_frag_packet,
384 BATADV_FRAG_TIMEOUT))
385 batadv_frag_list_free(&orig_node->frag_list);
387 spin_unlock_bh(list_lock);
390 batadv_gw_node_purge(bat_priv);
391 batadv_gw_election(bat_priv);
394 static void batadv_purge_orig(struct work_struct *work)
396 struct delayed_work *delayed_work;
397 struct batadv_priv *bat_priv;
399 delayed_work = container_of(work, struct delayed_work, work);
400 bat_priv = container_of(delayed_work, struct batadv_priv, orig_work);
401 _batadv_purge_orig(bat_priv);
402 queue_delayed_work(batadv_event_workqueue,
403 &bat_priv->orig_work,
404 msecs_to_jiffies(BATADV_ORIG_WORK_PERIOD));
407 void batadv_purge_orig_ref(struct batadv_priv *bat_priv)
409 _batadv_purge_orig(bat_priv);
412 int batadv_orig_seq_print_text(struct seq_file *seq, void *offset)
414 struct net_device *net_dev = (struct net_device *)seq->private;
415 struct batadv_priv *bat_priv = netdev_priv(net_dev);
416 struct batadv_hashtable *hash = bat_priv->orig_hash;
417 struct hlist_head *head;
418 struct batadv_hard_iface *primary_if;
419 struct batadv_orig_node *orig_node;
420 struct batadv_neigh_node *neigh_node, *neigh_node_tmp;
421 int batman_count = 0;
424 unsigned long last_seen_jiffies;
427 primary_if = batadv_seq_print_text_primary_if_get(seq);
431 seq_printf(seq, "[B.A.T.M.A.N. adv %s, MainIF/MAC: %s/%pM (%s)]\n",
432 BATADV_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", "#", BATADV_TQ_MAX_VALUE,
436 "Nexthop", "outgoingIF", "Potential nexthops");
438 for (i = 0; i < hash->size; i++) {
439 head = &hash->table[i];
442 hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
443 neigh_node = batadv_orig_node_get_router(orig_node);
447 if (neigh_node->tq_avg == 0)
450 last_seen_jiffies = jiffies - orig_node->last_seen;
451 last_seen_msecs = jiffies_to_msecs(last_seen_jiffies);
452 last_seen_secs = last_seen_msecs / 1000;
453 last_seen_msecs = last_seen_msecs % 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,
462 &orig_node->neigh_list, list) {
463 seq_printf(seq, " %pM (%3i)",
464 neigh_node_tmp->addr,
465 neigh_node_tmp->tq_avg);
472 batadv_neigh_node_free_ref(neigh_node);
477 if (batman_count == 0)
478 seq_puts(seq, "No batman nodes in range ...\n");
482 batadv_hardif_free_ref(primary_if);
486 static int batadv_orig_node_add_if(struct batadv_orig_node *orig_node,
490 size_t data_size, old_size;
492 data_size = max_if_num * sizeof(unsigned long) * BATADV_NUM_WORDS;
493 old_size = (max_if_num - 1) * sizeof(unsigned long) * BATADV_NUM_WORDS;
494 data_ptr = kmalloc(data_size, GFP_ATOMIC);
498 memcpy(data_ptr, orig_node->bcast_own, old_size);
499 kfree(orig_node->bcast_own);
500 orig_node->bcast_own = data_ptr;
502 data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
506 memcpy(data_ptr, orig_node->bcast_own_sum,
507 (max_if_num - 1) * sizeof(uint8_t));
508 kfree(orig_node->bcast_own_sum);
509 orig_node->bcast_own_sum = data_ptr;
514 int batadv_orig_hash_add_if(struct batadv_hard_iface *hard_iface,
517 struct batadv_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
518 struct batadv_hashtable *hash = bat_priv->orig_hash;
519 struct hlist_head *head;
520 struct batadv_orig_node *orig_node;
524 /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
527 for (i = 0; i < hash->size; i++) {
528 head = &hash->table[i];
531 hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
532 spin_lock_bh(&orig_node->ogm_cnt_lock);
533 ret = batadv_orig_node_add_if(orig_node, max_if_num);
534 spin_unlock_bh(&orig_node->ogm_cnt_lock);
549 static int batadv_orig_node_del_if(struct batadv_orig_node *orig_node,
550 int max_if_num, int del_if_num)
552 void *data_ptr = NULL;
555 /* last interface was removed */
559 chunk_size = sizeof(unsigned long) * BATADV_NUM_WORDS;
560 data_ptr = kmalloc(max_if_num * chunk_size, GFP_ATOMIC);
564 /* copy first part */
565 memcpy(data_ptr, orig_node->bcast_own, del_if_num * chunk_size);
567 /* copy second part */
568 memcpy((char *)data_ptr + del_if_num * chunk_size,
569 orig_node->bcast_own + ((del_if_num + 1) * chunk_size),
570 (max_if_num - del_if_num) * chunk_size);
573 kfree(orig_node->bcast_own);
574 orig_node->bcast_own = data_ptr;
579 data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
583 memcpy(data_ptr, orig_node->bcast_own_sum,
584 del_if_num * sizeof(uint8_t));
586 memcpy((char *)data_ptr + del_if_num * sizeof(uint8_t),
587 orig_node->bcast_own_sum + ((del_if_num + 1) * sizeof(uint8_t)),
588 (max_if_num - del_if_num) * sizeof(uint8_t));
591 kfree(orig_node->bcast_own_sum);
592 orig_node->bcast_own_sum = data_ptr;
597 int batadv_orig_hash_del_if(struct batadv_hard_iface *hard_iface,
600 struct batadv_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
601 struct batadv_hashtable *hash = bat_priv->orig_hash;
602 struct hlist_head *head;
603 struct batadv_hard_iface *hard_iface_tmp;
604 struct batadv_orig_node *orig_node;
608 /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
611 for (i = 0; i < hash->size; i++) {
612 head = &hash->table[i];
615 hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
616 spin_lock_bh(&orig_node->ogm_cnt_lock);
617 ret = batadv_orig_node_del_if(orig_node, max_if_num,
619 spin_unlock_bh(&orig_node->ogm_cnt_lock);
627 /* renumber remaining batman interfaces _inside_ of orig_hash_lock */
629 list_for_each_entry_rcu(hard_iface_tmp, &batadv_hardif_list, list) {
630 if (hard_iface_tmp->if_status == BATADV_IF_NOT_IN_USE)
633 if (hard_iface == hard_iface_tmp)
636 if (hard_iface->soft_iface != hard_iface_tmp->soft_iface)
639 if (hard_iface_tmp->if_num > hard_iface->if_num)
640 hard_iface_tmp->if_num--;
644 hard_iface->if_num = -1;