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 "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"
32 static void batadv_purge_orig(struct work_struct
*work
);
34 static void batadv_start_purge_timer(struct batadv_priv
*bat_priv
)
36 INIT_DELAYED_WORK(&bat_priv
->orig_work
, batadv_purge_orig
);
37 queue_delayed_work(batadv_event_workqueue
,
38 &bat_priv
->orig_work
, msecs_to_jiffies(1000));
41 /* returns 1 if they are the same originator */
42 static int batadv_compare_orig(const struct hlist_node
*node
, const void *data2
)
44 const void *data1
= container_of(node
, struct batadv_orig_node
,
47 return (memcmp(data1
, data2
, ETH_ALEN
) == 0 ? 1 : 0);
50 int batadv_originator_init(struct batadv_priv
*bat_priv
)
52 if (bat_priv
->orig_hash
)
55 bat_priv
->orig_hash
= batadv_hash_new(1024);
57 if (!bat_priv
->orig_hash
)
60 batadv_start_purge_timer(bat_priv
);
67 void batadv_neigh_node_free_ref(struct batadv_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 batadv_neigh_node
*
75 batadv_orig_node_get_router(struct batadv_orig_node
*orig_node
)
77 struct batadv_neigh_node
*router
;
80 router
= rcu_dereference(orig_node
->router
);
82 if (router
&& !atomic_inc_not_zero(&router
->refcount
))
89 struct batadv_neigh_node
*
90 batadv_neigh_node_new(struct batadv_hard_iface
*hard_iface
,
91 const uint8_t *neigh_addr
, uint32_t seqno
)
93 struct batadv_priv
*bat_priv
= netdev_priv(hard_iface
->soft_iface
);
94 struct batadv_neigh_node
*neigh_node
;
96 neigh_node
= kzalloc(sizeof(*neigh_node
), GFP_ATOMIC
);
100 INIT_HLIST_NODE(&neigh_node
->list
);
102 memcpy(neigh_node
->addr
, neigh_addr
, ETH_ALEN
);
103 spin_lock_init(&neigh_node
->lq_update_lock
);
105 /* extra reference for return */
106 atomic_set(&neigh_node
->refcount
, 2);
108 batadv_dbg(BATADV_DBG_BATMAN
, bat_priv
,
109 "Creating new neighbor %pM, initial seqno %d\n",
116 static void batadv_orig_node_free_rcu(struct rcu_head
*rcu
)
118 struct hlist_node
*node
, *node_tmp
;
119 struct batadv_neigh_node
*neigh_node
, *tmp_neigh_node
;
120 struct batadv_orig_node
*orig_node
;
122 orig_node
= container_of(rcu
, struct batadv_orig_node
, rcu
);
124 spin_lock_bh(&orig_node
->neigh_list_lock
);
126 /* for all bonding members ... */
127 list_for_each_entry_safe(neigh_node
, tmp_neigh_node
,
128 &orig_node
->bond_list
, bonding_list
) {
129 list_del_rcu(&neigh_node
->bonding_list
);
130 batadv_neigh_node_free_ref(neigh_node
);
133 /* for all neighbors towards this originator ... */
134 hlist_for_each_entry_safe(neigh_node
, node
, node_tmp
,
135 &orig_node
->neigh_list
, list
) {
136 hlist_del_rcu(&neigh_node
->list
);
137 batadv_neigh_node_free_ref(neigh_node
);
140 spin_unlock_bh(&orig_node
->neigh_list_lock
);
142 batadv_frag_list_free(&orig_node
->frag_list
);
143 batadv_tt_global_del_orig(orig_node
->bat_priv
, orig_node
,
144 "originator timed out");
146 kfree(orig_node
->tt_buff
);
147 kfree(orig_node
->bcast_own
);
148 kfree(orig_node
->bcast_own_sum
);
152 void batadv_orig_node_free_ref(struct batadv_orig_node
*orig_node
)
154 if (atomic_dec_and_test(&orig_node
->refcount
))
155 call_rcu(&orig_node
->rcu
, batadv_orig_node_free_rcu
);
158 void batadv_originator_free(struct batadv_priv
*bat_priv
)
160 struct batadv_hashtable
*hash
= bat_priv
->orig_hash
;
161 struct hlist_node
*node
, *node_tmp
;
162 struct hlist_head
*head
;
163 spinlock_t
*list_lock
; /* spinlock to protect write access */
164 struct batadv_orig_node
*orig_node
;
170 cancel_delayed_work_sync(&bat_priv
->orig_work
);
172 bat_priv
->orig_hash
= NULL
;
174 for (i
= 0; i
< hash
->size
; i
++) {
175 head
= &hash
->table
[i
];
176 list_lock
= &hash
->list_locks
[i
];
178 spin_lock_bh(list_lock
);
179 hlist_for_each_entry_safe(orig_node
, node
, node_tmp
,
183 batadv_orig_node_free_ref(orig_node
);
185 spin_unlock_bh(list_lock
);
188 batadv_hash_destroy(hash
);
191 /* this function finds or creates an originator entry for the given
192 * address if it does not exits
194 struct batadv_orig_node
*batadv_get_orig_node(struct batadv_priv
*bat_priv
,
197 struct batadv_orig_node
*orig_node
;
200 unsigned long reset_time
;
202 orig_node
= batadv_orig_hash_find(bat_priv
, addr
);
206 batadv_dbg(BATADV_DBG_BATMAN
, bat_priv
,
207 "Creating new originator: %pM\n", addr
);
209 orig_node
= kzalloc(sizeof(*orig_node
), GFP_ATOMIC
);
213 INIT_HLIST_HEAD(&orig_node
->neigh_list
);
214 INIT_LIST_HEAD(&orig_node
->bond_list
);
215 spin_lock_init(&orig_node
->ogm_cnt_lock
);
216 spin_lock_init(&orig_node
->bcast_seqno_lock
);
217 spin_lock_init(&orig_node
->neigh_list_lock
);
218 spin_lock_init(&orig_node
->tt_buff_lock
);
220 /* extra reference for return */
221 atomic_set(&orig_node
->refcount
, 2);
223 orig_node
->tt_initialised
= false;
224 orig_node
->bat_priv
= bat_priv
;
225 memcpy(orig_node
->orig
, addr
, ETH_ALEN
);
226 batadv_dat_init_orig_node_addr(orig_node
);
227 orig_node
->router
= NULL
;
228 orig_node
->tt_crc
= 0;
229 atomic_set(&orig_node
->last_ttvn
, 0);
230 orig_node
->tt_buff
= NULL
;
231 orig_node
->tt_buff_len
= 0;
232 atomic_set(&orig_node
->tt_size
, 0);
233 reset_time
= jiffies
- 1 - msecs_to_jiffies(BATADV_RESET_PROTECTION_MS
);
234 orig_node
->bcast_seqno_reset
= reset_time
;
235 orig_node
->batman_seqno_reset
= reset_time
;
237 atomic_set(&orig_node
->bond_candidates
, 0);
239 size
= bat_priv
->num_ifaces
* sizeof(unsigned long) * BATADV_NUM_WORDS
;
241 orig_node
->bcast_own
= kzalloc(size
, GFP_ATOMIC
);
242 if (!orig_node
->bcast_own
)
245 size
= bat_priv
->num_ifaces
* sizeof(uint8_t);
246 orig_node
->bcast_own_sum
= kzalloc(size
, GFP_ATOMIC
);
248 INIT_LIST_HEAD(&orig_node
->frag_list
);
249 orig_node
->last_frag_packet
= 0;
251 if (!orig_node
->bcast_own_sum
)
254 hash_added
= batadv_hash_add(bat_priv
->orig_hash
, batadv_compare_orig
,
255 batadv_choose_orig
, orig_node
,
256 &orig_node
->hash_entry
);
258 goto free_bcast_own_sum
;
262 kfree(orig_node
->bcast_own_sum
);
264 kfree(orig_node
->bcast_own
);
271 batadv_purge_orig_neighbors(struct batadv_priv
*bat_priv
,
272 struct batadv_orig_node
*orig_node
,
273 struct batadv_neigh_node
**best_neigh_node
)
275 struct hlist_node
*node
, *node_tmp
;
276 struct batadv_neigh_node
*neigh_node
;
277 bool neigh_purged
= false;
278 unsigned long last_seen
;
279 struct batadv_hard_iface
*if_incoming
;
281 *best_neigh_node
= NULL
;
283 spin_lock_bh(&orig_node
->neigh_list_lock
);
285 /* for all neighbors towards this originator ... */
286 hlist_for_each_entry_safe(neigh_node
, node
, node_tmp
,
287 &orig_node
->neigh_list
, list
) {
289 last_seen
= neigh_node
->last_seen
;
290 if_incoming
= neigh_node
->if_incoming
;
292 if ((batadv_has_timed_out(last_seen
, BATADV_PURGE_TIMEOUT
)) ||
293 (if_incoming
->if_status
== BATADV_IF_INACTIVE
) ||
294 (if_incoming
->if_status
== BATADV_IF_NOT_IN_USE
) ||
295 (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 batadv_start_purge_timer(bat_priv
);
399 void batadv_purge_orig_ref(struct batadv_priv
*bat_priv
)
401 _batadv_purge_orig(bat_priv
);
404 int batadv_orig_seq_print_text(struct seq_file
*seq
, void *offset
)
406 struct net_device
*net_dev
= (struct net_device
*)seq
->private;
407 struct batadv_priv
*bat_priv
= netdev_priv(net_dev
);
408 struct batadv_hashtable
*hash
= bat_priv
->orig_hash
;
409 struct hlist_node
*node
, *node_tmp
;
410 struct hlist_head
*head
;
411 struct batadv_hard_iface
*primary_if
;
412 struct batadv_orig_node
*orig_node
;
413 struct batadv_neigh_node
*neigh_node
, *neigh_node_tmp
;
414 int batman_count
= 0;
417 unsigned long last_seen_jiffies
;
420 primary_if
= batadv_seq_print_text_primary_if_get(seq
);
424 seq_printf(seq
, "[B.A.T.M.A.N. adv %s, MainIF/MAC: %s/%pM (%s)]\n",
425 BATADV_SOURCE_VERSION
, primary_if
->net_dev
->name
,
426 primary_if
->net_dev
->dev_addr
, net_dev
->name
);
427 seq_printf(seq
, " %-15s %s (%s/%i) %17s [%10s]: %20s ...\n",
428 "Originator", "last-seen", "#", BATADV_TQ_MAX_VALUE
,
429 "Nexthop", "outgoingIF", "Potential nexthops");
431 for (i
= 0; i
< hash
->size
; i
++) {
432 head
= &hash
->table
[i
];
435 hlist_for_each_entry_rcu(orig_node
, node
, head
, hash_entry
) {
436 neigh_node
= batadv_orig_node_get_router(orig_node
);
440 if (neigh_node
->tq_avg
== 0)
443 last_seen_jiffies
= jiffies
- orig_node
->last_seen
;
444 last_seen_msecs
= jiffies_to_msecs(last_seen_jiffies
);
445 last_seen_secs
= last_seen_msecs
/ 1000;
446 last_seen_msecs
= last_seen_msecs
% 1000;
448 seq_printf(seq
, "%pM %4i.%03is (%3i) %pM [%10s]:",
449 orig_node
->orig
, last_seen_secs
,
450 last_seen_msecs
, neigh_node
->tq_avg
,
452 neigh_node
->if_incoming
->net_dev
->name
);
454 hlist_for_each_entry_rcu(neigh_node_tmp
, node_tmp
,
455 &orig_node
->neigh_list
, list
) {
456 seq_printf(seq
, " %pM (%3i)",
457 neigh_node_tmp
->addr
,
458 neigh_node_tmp
->tq_avg
);
461 seq_printf(seq
, "\n");
465 batadv_neigh_node_free_ref(neigh_node
);
470 if (batman_count
== 0)
471 seq_printf(seq
, "No batman nodes in range ...\n");
475 batadv_hardif_free_ref(primary_if
);
479 static int batadv_orig_node_add_if(struct batadv_orig_node
*orig_node
,
483 size_t data_size
, old_size
;
485 data_size
= max_if_num
* sizeof(unsigned long) * BATADV_NUM_WORDS
;
486 old_size
= (max_if_num
- 1) * sizeof(unsigned long) * BATADV_NUM_WORDS
;
487 data_ptr
= kmalloc(data_size
, GFP_ATOMIC
);
491 memcpy(data_ptr
, orig_node
->bcast_own
, old_size
);
492 kfree(orig_node
->bcast_own
);
493 orig_node
->bcast_own
= data_ptr
;
495 data_ptr
= kmalloc(max_if_num
* sizeof(uint8_t), GFP_ATOMIC
);
499 memcpy(data_ptr
, orig_node
->bcast_own_sum
,
500 (max_if_num
- 1) * sizeof(uint8_t));
501 kfree(orig_node
->bcast_own_sum
);
502 orig_node
->bcast_own_sum
= data_ptr
;
507 int batadv_orig_hash_add_if(struct batadv_hard_iface
*hard_iface
,
510 struct batadv_priv
*bat_priv
= netdev_priv(hard_iface
->soft_iface
);
511 struct batadv_hashtable
*hash
= bat_priv
->orig_hash
;
512 struct hlist_node
*node
;
513 struct hlist_head
*head
;
514 struct batadv_orig_node
*orig_node
;
518 /* 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
= batadv_orig_node_add_if(orig_node
, max_if_num
);
528 spin_unlock_bh(&orig_node
->ogm_cnt_lock
);
543 static int batadv_orig_node_del_if(struct batadv_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) * BATADV_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 batadv_orig_hash_del_if(struct batadv_hard_iface
*hard_iface
,
594 struct batadv_priv
*bat_priv
= netdev_priv(hard_iface
->soft_iface
);
595 struct batadv_hashtable
*hash
= bat_priv
->orig_hash
;
596 struct hlist_node
*node
;
597 struct hlist_head
*head
;
598 struct batadv_hard_iface
*hard_iface_tmp
;
599 struct batadv_orig_node
*orig_node
;
603 /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
606 for (i
= 0; i
< hash
->size
; i
++) {
607 head
= &hash
->table
[i
];
610 hlist_for_each_entry_rcu(orig_node
, node
, head
, hash_entry
) {
611 spin_lock_bh(&orig_node
->ogm_cnt_lock
);
612 ret
= batadv_orig_node_del_if(orig_node
, max_if_num
,
614 spin_unlock_bh(&orig_node
->ogm_cnt_lock
);
622 /* renumber remaining batman interfaces _inside_ of orig_hash_lock */
624 list_for_each_entry_rcu(hard_iface_tmp
, &batadv_hardif_list
, list
) {
625 if (hard_iface_tmp
->if_status
== BATADV_IF_NOT_IN_USE
)
628 if (hard_iface
== hard_iface_tmp
)
631 if (hard_iface
->soft_iface
!= hard_iface_tmp
->soft_iface
)
634 if (hard_iface_tmp
->if_num
> hard_iface
->if_num
)
635 hard_iface_tmp
->if_num
--;
639 hard_iface
->if_num
= -1;