Commit | Line | Data |
---|---|---|
c6c8fea2 | 1 | /* |
64afe353 | 2 | * Copyright (C) 2009-2011 B.A.T.M.A.N. contributors: |
c6c8fea2 SE |
3 | * |
4 | * Marek Lindner, Simon Wunderlich | |
5 | * | |
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. | |
9 | * | |
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. | |
14 | * | |
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 | |
18 | * 02110-1301, USA | |
19 | * | |
20 | */ | |
21 | ||
c6c8fea2 SE |
22 | #include "main.h" |
23 | #include "originator.h" | |
24 | #include "hash.h" | |
25 | #include "translation-table.h" | |
26 | #include "routing.h" | |
27 | #include "gateway_client.h" | |
28 | #include "hard-interface.h" | |
29 | #include "unicast.h" | |
30 | #include "soft-interface.h" | |
31 | ||
32 | static void purge_orig(struct work_struct *work); | |
33 | ||
34 | static void start_purge_timer(struct bat_priv *bat_priv) | |
35 | { | |
36 | INIT_DELAYED_WORK(&bat_priv->orig_work, purge_orig); | |
37 | queue_delayed_work(bat_event_workqueue, &bat_priv->orig_work, 1 * HZ); | |
38 | } | |
39 | ||
b8e2dd13 SE |
40 | /* returns 1 if they are the same originator */ |
41 | static int compare_orig(const struct hlist_node *node, const void *data2) | |
42 | { | |
43 | const void *data1 = container_of(node, struct orig_node, hash_entry); | |
44 | ||
45 | return (memcmp(data1, data2, ETH_ALEN) == 0 ? 1 : 0); | |
46 | } | |
47 | ||
c6c8fea2 SE |
48 | int originator_init(struct bat_priv *bat_priv) |
49 | { | |
50 | if (bat_priv->orig_hash) | |
51 | return 1; | |
52 | ||
c6c8fea2 SE |
53 | bat_priv->orig_hash = hash_new(1024); |
54 | ||
55 | if (!bat_priv->orig_hash) | |
56 | goto err; | |
57 | ||
c6c8fea2 SE |
58 | start_purge_timer(bat_priv); |
59 | return 1; | |
60 | ||
61 | err: | |
c6c8fea2 SE |
62 | return 0; |
63 | } | |
64 | ||
44524fcd | 65 | void neigh_node_free_ref(struct neigh_node *neigh_node) |
a4c135c5 | 66 | { |
44524fcd | 67 | if (atomic_dec_and_test(&neigh_node->refcount)) |
ae179ae4 | 68 | kfree_rcu(neigh_node, rcu); |
a4c135c5 SW |
69 | } |
70 | ||
e1a5382f LL |
71 | /* increases the refcounter of a found router */ |
72 | struct neigh_node *orig_node_get_router(struct orig_node *orig_node) | |
73 | { | |
74 | struct neigh_node *router; | |
75 | ||
76 | rcu_read_lock(); | |
77 | router = rcu_dereference(orig_node->router); | |
78 | ||
79 | if (router && !atomic_inc_not_zero(&router->refcount)) | |
80 | router = NULL; | |
81 | ||
82 | rcu_read_unlock(); | |
83 | return router; | |
84 | } | |
85 | ||
a8e7f4bc ML |
86 | struct neigh_node *create_neighbor(struct orig_node *orig_node, |
87 | struct orig_node *orig_neigh_node, | |
747e4221 | 88 | const uint8_t *neigh, |
e6c10f43 | 89 | struct hard_iface *if_incoming) |
c6c8fea2 SE |
90 | { |
91 | struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface); | |
92 | struct neigh_node *neigh_node; | |
93 | ||
94 | bat_dbg(DBG_BATMAN, bat_priv, | |
95 | "Creating new last-hop neighbor of originator\n"); | |
96 | ||
704509b8 | 97 | neigh_node = kzalloc(sizeof(*neigh_node), GFP_ATOMIC); |
c6c8fea2 SE |
98 | if (!neigh_node) |
99 | return NULL; | |
100 | ||
9591a79f | 101 | INIT_HLIST_NODE(&neigh_node->list); |
a4c135c5 | 102 | INIT_LIST_HEAD(&neigh_node->bonding_list); |
68003903 | 103 | spin_lock_init(&neigh_node->tq_lock); |
c6c8fea2 SE |
104 | |
105 | memcpy(neigh_node->addr, neigh, ETH_ALEN); | |
106 | neigh_node->orig_node = orig_neigh_node; | |
107 | neigh_node->if_incoming = if_incoming; | |
1605d0d6 ML |
108 | |
109 | /* extra reference for return */ | |
110 | atomic_set(&neigh_node->refcount, 2); | |
c6c8fea2 | 111 | |
f987ed6e ML |
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); | |
c6c8fea2 SE |
115 | return neigh_node; |
116 | } | |
117 | ||
7b36e8ee | 118 | static void orig_node_free_rcu(struct rcu_head *rcu) |
c6c8fea2 | 119 | { |
9591a79f | 120 | struct hlist_node *node, *node_tmp; |
a4c135c5 | 121 | struct neigh_node *neigh_node, *tmp_neigh_node; |
16b1aba8 ML |
122 | struct orig_node *orig_node; |
123 | ||
7b36e8ee | 124 | orig_node = container_of(rcu, struct orig_node, rcu); |
c6c8fea2 | 125 | |
f987ed6e ML |
126 | spin_lock_bh(&orig_node->neigh_list_lock); |
127 | ||
a4c135c5 SW |
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); | |
44524fcd | 132 | neigh_node_free_ref(neigh_node); |
a4c135c5 SW |
133 | } |
134 | ||
c6c8fea2 | 135 | /* for all neighbors towards this originator ... */ |
9591a79f ML |
136 | hlist_for_each_entry_safe(neigh_node, node, node_tmp, |
137 | &orig_node->neigh_list, list) { | |
f987ed6e | 138 | hlist_del_rcu(&neigh_node->list); |
44524fcd | 139 | neigh_node_free_ref(neigh_node); |
c6c8fea2 SE |
140 | } |
141 | ||
f987ed6e ML |
142 | spin_unlock_bh(&orig_node->neigh_list_lock); |
143 | ||
c6c8fea2 | 144 | frag_list_free(&orig_node->frag_list); |
2dafb49d | 145 | tt_global_del_orig(orig_node->bat_priv, orig_node, |
16b1aba8 | 146 | "originator timed out"); |
c6c8fea2 | 147 | |
a73105b8 | 148 | kfree(orig_node->tt_buff); |
c6c8fea2 SE |
149 | kfree(orig_node->bcast_own); |
150 | kfree(orig_node->bcast_own_sum); | |
151 | kfree(orig_node); | |
152 | } | |
153 | ||
7b36e8ee ML |
154 | void orig_node_free_ref(struct orig_node *orig_node) |
155 | { | |
156 | if (atomic_dec_and_test(&orig_node->refcount)) | |
157 | call_rcu(&orig_node->rcu, orig_node_free_rcu); | |
158 | } | |
159 | ||
c6c8fea2 SE |
160 | void originator_free(struct bat_priv *bat_priv) |
161 | { | |
16b1aba8 | 162 | struct hashtable_t *hash = bat_priv->orig_hash; |
7aadf889 | 163 | struct hlist_node *node, *node_tmp; |
16b1aba8 | 164 | struct hlist_head *head; |
16b1aba8 ML |
165 | spinlock_t *list_lock; /* spinlock to protect write access */ |
166 | struct orig_node *orig_node; | |
167 | int i; | |
168 | ||
169 | if (!hash) | |
c6c8fea2 SE |
170 | return; |
171 | ||
172 | cancel_delayed_work_sync(&bat_priv->orig_work); | |
173 | ||
c6c8fea2 | 174 | bat_priv->orig_hash = NULL; |
16b1aba8 ML |
175 | |
176 | for (i = 0; i < hash->size; i++) { | |
177 | head = &hash->table[i]; | |
178 | list_lock = &hash->list_locks[i]; | |
179 | ||
180 | spin_lock_bh(list_lock); | |
7aadf889 ML |
181 | hlist_for_each_entry_safe(orig_node, node, node_tmp, |
182 | head, hash_entry) { | |
16b1aba8 | 183 | |
7aadf889 | 184 | hlist_del_rcu(node); |
7b36e8ee | 185 | orig_node_free_ref(orig_node); |
16b1aba8 ML |
186 | } |
187 | spin_unlock_bh(list_lock); | |
188 | } | |
189 | ||
190 | hash_destroy(hash); | |
c6c8fea2 SE |
191 | } |
192 | ||
193 | /* this function finds or creates an originator entry for the given | |
194 | * address if it does not exits */ | |
747e4221 | 195 | struct orig_node *get_orig_node(struct bat_priv *bat_priv, const uint8_t *addr) |
c6c8fea2 SE |
196 | { |
197 | struct orig_node *orig_node; | |
198 | int size; | |
199 | int hash_added; | |
200 | ||
7aadf889 ML |
201 | orig_node = orig_hash_find(bat_priv, addr); |
202 | if (orig_node) | |
c6c8fea2 SE |
203 | return orig_node; |
204 | ||
205 | bat_dbg(DBG_BATMAN, bat_priv, | |
206 | "Creating new originator: %pM\n", addr); | |
207 | ||
704509b8 | 208 | orig_node = kzalloc(sizeof(*orig_node), GFP_ATOMIC); |
c6c8fea2 SE |
209 | if (!orig_node) |
210 | return NULL; | |
211 | ||
9591a79f | 212 | INIT_HLIST_HEAD(&orig_node->neigh_list); |
a4c135c5 | 213 | INIT_LIST_HEAD(&orig_node->bond_list); |
2ae2daf6 | 214 | spin_lock_init(&orig_node->ogm_cnt_lock); |
f3e0008f | 215 | spin_lock_init(&orig_node->bcast_seqno_lock); |
f987ed6e | 216 | spin_lock_init(&orig_node->neigh_list_lock); |
a73105b8 | 217 | spin_lock_init(&orig_node->tt_buff_lock); |
7b36e8ee ML |
218 | |
219 | /* extra reference for return */ | |
220 | atomic_set(&orig_node->refcount, 2); | |
c6c8fea2 | 221 | |
cc47f66e | 222 | orig_node->tt_poss_change = false; |
16b1aba8 | 223 | orig_node->bat_priv = bat_priv; |
c6c8fea2 SE |
224 | memcpy(orig_node->orig, addr, ETH_ALEN); |
225 | orig_node->router = NULL; | |
2dafb49d | 226 | orig_node->tt_buff = NULL; |
a73105b8 AQ |
227 | orig_node->tt_buff_len = 0; |
228 | atomic_set(&orig_node->tt_size, 0); | |
c6c8fea2 SE |
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); | |
233 | ||
a4c135c5 SW |
234 | atomic_set(&orig_node->bond_candidates, 0); |
235 | ||
c6c8fea2 SE |
236 | size = bat_priv->num_ifaces * sizeof(unsigned long) * NUM_WORDS; |
237 | ||
238 | orig_node->bcast_own = kzalloc(size, GFP_ATOMIC); | |
239 | if (!orig_node->bcast_own) | |
240 | goto free_orig_node; | |
241 | ||
242 | size = bat_priv->num_ifaces * sizeof(uint8_t); | |
243 | orig_node->bcast_own_sum = kzalloc(size, GFP_ATOMIC); | |
244 | ||
245 | INIT_LIST_HEAD(&orig_node->frag_list); | |
246 | orig_node->last_frag_packet = 0; | |
247 | ||
248 | if (!orig_node->bcast_own_sum) | |
249 | goto free_bcast_own; | |
250 | ||
7aadf889 ML |
251 | hash_added = hash_add(bat_priv->orig_hash, compare_orig, |
252 | choose_orig, orig_node, &orig_node->hash_entry); | |
c6c8fea2 SE |
253 | if (hash_added < 0) |
254 | goto free_bcast_own_sum; | |
255 | ||
256 | return orig_node; | |
257 | free_bcast_own_sum: | |
258 | kfree(orig_node->bcast_own_sum); | |
259 | free_bcast_own: | |
260 | kfree(orig_node->bcast_own); | |
261 | free_orig_node: | |
262 | kfree(orig_node); | |
263 | return NULL; | |
264 | } | |
265 | ||
266 | static bool purge_orig_neighbors(struct bat_priv *bat_priv, | |
267 | struct orig_node *orig_node, | |
268 | struct neigh_node **best_neigh_node) | |
269 | { | |
9591a79f | 270 | struct hlist_node *node, *node_tmp; |
c6c8fea2 SE |
271 | struct neigh_node *neigh_node; |
272 | bool neigh_purged = false; | |
273 | ||
274 | *best_neigh_node = NULL; | |
275 | ||
f987ed6e ML |
276 | spin_lock_bh(&orig_node->neigh_list_lock); |
277 | ||
c6c8fea2 | 278 | /* for all neighbors towards this originator ... */ |
9591a79f ML |
279 | hlist_for_each_entry_safe(neigh_node, node, node_tmp, |
280 | &orig_node->neigh_list, list) { | |
c6c8fea2 SE |
281 | |
282 | if ((time_after(jiffies, | |
283 | neigh_node->last_valid + PURGE_TIMEOUT * HZ)) || | |
284 | (neigh_node->if_incoming->if_status == IF_INACTIVE) || | |
1a241a57 | 285 | (neigh_node->if_incoming->if_status == IF_NOT_IN_USE) || |
c6c8fea2 SE |
286 | (neigh_node->if_incoming->if_status == IF_TO_BE_REMOVED)) { |
287 | ||
1a241a57 ML |
288 | if ((neigh_node->if_incoming->if_status == |
289 | IF_INACTIVE) || | |
290 | (neigh_node->if_incoming->if_status == | |
291 | IF_NOT_IN_USE) || | |
292 | (neigh_node->if_incoming->if_status == | |
293 | IF_TO_BE_REMOVED)) | |
c6c8fea2 SE |
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); | |
299 | else | |
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)); | |
305 | ||
306 | neigh_purged = true; | |
9591a79f | 307 | |
f987ed6e | 308 | hlist_del_rcu(&neigh_node->list); |
a4c135c5 | 309 | bonding_candidate_del(orig_node, neigh_node); |
44524fcd | 310 | neigh_node_free_ref(neigh_node); |
c6c8fea2 SE |
311 | } else { |
312 | if ((!*best_neigh_node) || | |
313 | (neigh_node->tq_avg > (*best_neigh_node)->tq_avg)) | |
314 | *best_neigh_node = neigh_node; | |
315 | } | |
316 | } | |
f987ed6e ML |
317 | |
318 | spin_unlock_bh(&orig_node->neigh_list_lock); | |
c6c8fea2 SE |
319 | return neigh_purged; |
320 | } | |
321 | ||
322 | static bool purge_orig_node(struct bat_priv *bat_priv, | |
323 | struct orig_node *orig_node) | |
324 | { | |
325 | struct neigh_node *best_neigh_node; | |
326 | ||
327 | if (time_after(jiffies, | |
328 | orig_node->last_valid + 2 * PURGE_TIMEOUT * HZ)) { | |
329 | ||
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)); | |
333 | return true; | |
334 | } else { | |
335 | if (purge_orig_neighbors(bat_priv, orig_node, | |
336 | &best_neigh_node)) { | |
337 | update_routes(bat_priv, orig_node, | |
a73105b8 | 338 | best_neigh_node); |
c6c8fea2 SE |
339 | } |
340 | } | |
341 | ||
342 | return false; | |
343 | } | |
344 | ||
345 | static void _purge_orig(struct bat_priv *bat_priv) | |
346 | { | |
347 | struct hashtable_t *hash = bat_priv->orig_hash; | |
7aadf889 | 348 | struct hlist_node *node, *node_tmp; |
c6c8fea2 | 349 | struct hlist_head *head; |
fb778ea1 | 350 | spinlock_t *list_lock; /* spinlock to protect write access */ |
c6c8fea2 SE |
351 | struct orig_node *orig_node; |
352 | int i; | |
353 | ||
354 | if (!hash) | |
355 | return; | |
356 | ||
c6c8fea2 SE |
357 | /* for all origins... */ |
358 | for (i = 0; i < hash->size; i++) { | |
359 | head = &hash->table[i]; | |
fb778ea1 | 360 | list_lock = &hash->list_locks[i]; |
c6c8fea2 | 361 | |
fb778ea1 | 362 | spin_lock_bh(list_lock); |
7aadf889 ML |
363 | hlist_for_each_entry_safe(orig_node, node, node_tmp, |
364 | head, hash_entry) { | |
c6c8fea2 SE |
365 | if (purge_orig_node(bat_priv, orig_node)) { |
366 | if (orig_node->gw_flags) | |
367 | gw_node_delete(bat_priv, orig_node); | |
7aadf889 | 368 | hlist_del_rcu(node); |
7b36e8ee | 369 | orig_node_free_ref(orig_node); |
fb778ea1 | 370 | continue; |
c6c8fea2 SE |
371 | } |
372 | ||
373 | if (time_after(jiffies, orig_node->last_frag_packet + | |
374 | msecs_to_jiffies(FRAG_TIMEOUT))) | |
375 | frag_list_free(&orig_node->frag_list); | |
376 | } | |
fb778ea1 | 377 | spin_unlock_bh(list_lock); |
c6c8fea2 SE |
378 | } |
379 | ||
c6c8fea2 SE |
380 | gw_node_purge(bat_priv); |
381 | gw_election(bat_priv); | |
382 | ||
383 | softif_neigh_purge(bat_priv); | |
384 | } | |
385 | ||
386 | static void purge_orig(struct work_struct *work) | |
387 | { | |
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); | |
392 | ||
393 | _purge_orig(bat_priv); | |
394 | start_purge_timer(bat_priv); | |
395 | } | |
396 | ||
397 | void purge_orig_ref(struct bat_priv *bat_priv) | |
398 | { | |
399 | _purge_orig(bat_priv); | |
400 | } | |
401 | ||
402 | int orig_seq_print_text(struct seq_file *seq, void *offset) | |
403 | { | |
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; | |
7aadf889 | 407 | struct hlist_node *node, *node_tmp; |
c6c8fea2 | 408 | struct hlist_head *head; |
32ae9b22 | 409 | struct hard_iface *primary_if; |
c6c8fea2 | 410 | struct orig_node *orig_node; |
e1a5382f | 411 | struct neigh_node *neigh_node, *neigh_node_tmp; |
c6c8fea2 SE |
412 | int batman_count = 0; |
413 | int last_seen_secs; | |
414 | int last_seen_msecs; | |
32ae9b22 ML |
415 | int i, ret = 0; |
416 | ||
417 | primary_if = primary_if_get_selected(bat_priv); | |
c6c8fea2 | 418 | |
32ae9b22 ML |
419 | if (!primary_if) { |
420 | ret = seq_printf(seq, "BATMAN mesh %s disabled - " | |
421 | "please specify interfaces to enable it\n", | |
422 | net_dev->name); | |
423 | goto out; | |
424 | } | |
c6c8fea2 | 425 | |
32ae9b22 ML |
426 | if (primary_if->if_status != IF_ACTIVE) { |
427 | ret = seq_printf(seq, "BATMAN mesh %s " | |
428 | "disabled - primary interface not active\n", | |
429 | net_dev->name); | |
430 | goto out; | |
c6c8fea2 SE |
431 | } |
432 | ||
44c4349a SE |
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, | |
32ae9b22 | 435 | primary_if->net_dev->dev_addr, net_dev->name); |
c6c8fea2 SE |
436 | seq_printf(seq, " %-15s %s (%s/%i) %17s [%10s]: %20s ...\n", |
437 | "Originator", "last-seen", "#", TQ_MAX_VALUE, "Nexthop", | |
438 | "outgoingIF", "Potential nexthops"); | |
439 | ||
c6c8fea2 SE |
440 | for (i = 0; i < hash->size; i++) { |
441 | head = &hash->table[i]; | |
442 | ||
fb778ea1 | 443 | rcu_read_lock(); |
7aadf889 | 444 | hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) { |
e1a5382f LL |
445 | neigh_node = orig_node_get_router(orig_node); |
446 | if (!neigh_node) | |
c6c8fea2 SE |
447 | continue; |
448 | ||
e1a5382f LL |
449 | if (neigh_node->tq_avg == 0) |
450 | goto next; | |
c6c8fea2 SE |
451 | |
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; | |
456 | ||
c6c8fea2 SE |
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, | |
460 | neigh_node->addr, | |
461 | neigh_node->if_incoming->net_dev->name); | |
462 | ||
e1a5382f | 463 | hlist_for_each_entry_rcu(neigh_node_tmp, node_tmp, |
f987ed6e | 464 | &orig_node->neigh_list, list) { |
e1a5382f LL |
465 | seq_printf(seq, " %pM (%3i)", |
466 | neigh_node_tmp->addr, | |
467 | neigh_node_tmp->tq_avg); | |
c6c8fea2 SE |
468 | } |
469 | ||
470 | seq_printf(seq, "\n"); | |
471 | batman_count++; | |
e1a5382f LL |
472 | |
473 | next: | |
474 | neigh_node_free_ref(neigh_node); | |
c6c8fea2 | 475 | } |
fb778ea1 | 476 | rcu_read_unlock(); |
c6c8fea2 SE |
477 | } |
478 | ||
e1a5382f | 479 | if (batman_count == 0) |
c6c8fea2 SE |
480 | seq_printf(seq, "No batman nodes in range ...\n"); |
481 | ||
32ae9b22 ML |
482 | out: |
483 | if (primary_if) | |
484 | hardif_free_ref(primary_if); | |
485 | return ret; | |
c6c8fea2 SE |
486 | } |
487 | ||
488 | static int orig_node_add_if(struct orig_node *orig_node, int max_if_num) | |
489 | { | |
490 | void *data_ptr; | |
491 | ||
492 | data_ptr = kmalloc(max_if_num * sizeof(unsigned long) * NUM_WORDS, | |
493 | GFP_ATOMIC); | |
494 | if (!data_ptr) { | |
495 | pr_err("Can't resize orig: out of memory\n"); | |
496 | return -1; | |
497 | } | |
498 | ||
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; | |
503 | ||
504 | data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC); | |
505 | if (!data_ptr) { | |
506 | pr_err("Can't resize orig: out of memory\n"); | |
507 | return -1; | |
508 | } | |
509 | ||
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; | |
514 | ||
515 | return 0; | |
516 | } | |
517 | ||
e6c10f43 | 518 | int orig_hash_add_if(struct hard_iface *hard_iface, int max_if_num) |
c6c8fea2 | 519 | { |
e6c10f43 | 520 | struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface); |
c6c8fea2 | 521 | struct hashtable_t *hash = bat_priv->orig_hash; |
7aadf889 | 522 | struct hlist_node *node; |
c6c8fea2 | 523 | struct hlist_head *head; |
c6c8fea2 | 524 | struct orig_node *orig_node; |
2ae2daf6 | 525 | int i, ret; |
c6c8fea2 SE |
526 | |
527 | /* resize all orig nodes because orig_node->bcast_own(_sum) depend on | |
528 | * if_num */ | |
c6c8fea2 SE |
529 | for (i = 0; i < hash->size; i++) { |
530 | head = &hash->table[i]; | |
531 | ||
fb778ea1 | 532 | rcu_read_lock(); |
7aadf889 | 533 | hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) { |
2ae2daf6 ML |
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); | |
537 | ||
538 | if (ret == -1) | |
c6c8fea2 SE |
539 | goto err; |
540 | } | |
fb778ea1 | 541 | rcu_read_unlock(); |
c6c8fea2 SE |
542 | } |
543 | ||
c6c8fea2 SE |
544 | return 0; |
545 | ||
546 | err: | |
fb778ea1 | 547 | rcu_read_unlock(); |
c6c8fea2 SE |
548 | return -ENOMEM; |
549 | } | |
550 | ||
551 | static int orig_node_del_if(struct orig_node *orig_node, | |
552 | int max_if_num, int del_if_num) | |
553 | { | |
554 | void *data_ptr = NULL; | |
555 | int chunk_size; | |
556 | ||
557 | /* last interface was removed */ | |
558 | if (max_if_num == 0) | |
559 | goto free_bcast_own; | |
560 | ||
561 | chunk_size = sizeof(unsigned long) * NUM_WORDS; | |
562 | data_ptr = kmalloc(max_if_num * chunk_size, GFP_ATOMIC); | |
563 | if (!data_ptr) { | |
564 | pr_err("Can't resize orig: out of memory\n"); | |
565 | return -1; | |
566 | } | |
567 | ||
568 | /* copy first part */ | |
569 | memcpy(data_ptr, orig_node->bcast_own, del_if_num * chunk_size); | |
570 | ||
571 | /* copy second part */ | |
38e3c5f0 | 572 | memcpy((char *)data_ptr + del_if_num * chunk_size, |
c6c8fea2 SE |
573 | orig_node->bcast_own + ((del_if_num + 1) * chunk_size), |
574 | (max_if_num - del_if_num) * chunk_size); | |
575 | ||
576 | free_bcast_own: | |
577 | kfree(orig_node->bcast_own); | |
578 | orig_node->bcast_own = data_ptr; | |
579 | ||
580 | if (max_if_num == 0) | |
581 | goto free_own_sum; | |
582 | ||
583 | data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC); | |
584 | if (!data_ptr) { | |
585 | pr_err("Can't resize orig: out of memory\n"); | |
586 | return -1; | |
587 | } | |
588 | ||
589 | memcpy(data_ptr, orig_node->bcast_own_sum, | |
590 | del_if_num * sizeof(uint8_t)); | |
591 | ||
38e3c5f0 | 592 | memcpy((char *)data_ptr + del_if_num * sizeof(uint8_t), |
c6c8fea2 SE |
593 | orig_node->bcast_own_sum + ((del_if_num + 1) * sizeof(uint8_t)), |
594 | (max_if_num - del_if_num) * sizeof(uint8_t)); | |
595 | ||
596 | free_own_sum: | |
597 | kfree(orig_node->bcast_own_sum); | |
598 | orig_node->bcast_own_sum = data_ptr; | |
599 | ||
600 | return 0; | |
601 | } | |
602 | ||
e6c10f43 | 603 | int orig_hash_del_if(struct hard_iface *hard_iface, int max_if_num) |
c6c8fea2 | 604 | { |
e6c10f43 | 605 | struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface); |
c6c8fea2 | 606 | struct hashtable_t *hash = bat_priv->orig_hash; |
7aadf889 | 607 | struct hlist_node *node; |
c6c8fea2 | 608 | struct hlist_head *head; |
e6c10f43 | 609 | struct hard_iface *hard_iface_tmp; |
c6c8fea2 SE |
610 | struct orig_node *orig_node; |
611 | int i, ret; | |
612 | ||
613 | /* resize all orig nodes because orig_node->bcast_own(_sum) depend on | |
614 | * if_num */ | |
c6c8fea2 SE |
615 | for (i = 0; i < hash->size; i++) { |
616 | head = &hash->table[i]; | |
617 | ||
fb778ea1 | 618 | rcu_read_lock(); |
7aadf889 | 619 | hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) { |
2ae2daf6 | 620 | spin_lock_bh(&orig_node->ogm_cnt_lock); |
c6c8fea2 | 621 | ret = orig_node_del_if(orig_node, max_if_num, |
e6c10f43 | 622 | hard_iface->if_num); |
2ae2daf6 | 623 | spin_unlock_bh(&orig_node->ogm_cnt_lock); |
c6c8fea2 SE |
624 | |
625 | if (ret == -1) | |
626 | goto err; | |
627 | } | |
fb778ea1 | 628 | rcu_read_unlock(); |
c6c8fea2 SE |
629 | } |
630 | ||
631 | /* renumber remaining batman interfaces _inside_ of orig_hash_lock */ | |
632 | rcu_read_lock(); | |
e6c10f43 ML |
633 | list_for_each_entry_rcu(hard_iface_tmp, &hardif_list, list) { |
634 | if (hard_iface_tmp->if_status == IF_NOT_IN_USE) | |
c6c8fea2 SE |
635 | continue; |
636 | ||
e6c10f43 | 637 | if (hard_iface == hard_iface_tmp) |
c6c8fea2 SE |
638 | continue; |
639 | ||
e6c10f43 | 640 | if (hard_iface->soft_iface != hard_iface_tmp->soft_iface) |
c6c8fea2 SE |
641 | continue; |
642 | ||
e6c10f43 ML |
643 | if (hard_iface_tmp->if_num > hard_iface->if_num) |
644 | hard_iface_tmp->if_num--; | |
c6c8fea2 SE |
645 | } |
646 | rcu_read_unlock(); | |
647 | ||
e6c10f43 | 648 | hard_iface->if_num = -1; |
c6c8fea2 SE |
649 | return 0; |
650 | ||
651 | err: | |
fb778ea1 | 652 | rcu_read_unlock(); |
c6c8fea2 SE |
653 | return -ENOMEM; |
654 | } |