]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * Copyright (C) 2007-2011 B.A.T.M.A.N. contributors: | |
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 | ||
22 | #include "main.h" | |
23 | #include "routing.h" | |
24 | #include "send.h" | |
25 | #include "hash.h" | |
26 | #include "soft-interface.h" | |
27 | #include "hard-interface.h" | |
28 | #include "icmp_socket.h" | |
29 | #include "translation-table.h" | |
30 | #include "originator.h" | |
31 | #include "ring_buffer.h" | |
32 | #include "vis.h" | |
33 | #include "aggregation.h" | |
34 | #include "gateway_common.h" | |
35 | #include "gateway_client.h" | |
36 | #include "unicast.h" | |
37 | ||
38 | void slide_own_bcast_window(struct hard_iface *hard_iface) | |
39 | { | |
40 | struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface); | |
41 | struct hashtable_t *hash = bat_priv->orig_hash; | |
42 | struct hlist_node *node; | |
43 | struct hlist_head *head; | |
44 | struct orig_node *orig_node; | |
45 | unsigned long *word; | |
46 | int i; | |
47 | size_t word_index; | |
48 | ||
49 | for (i = 0; i < hash->size; i++) { | |
50 | head = &hash->table[i]; | |
51 | ||
52 | rcu_read_lock(); | |
53 | hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) { | |
54 | spin_lock_bh(&orig_node->ogm_cnt_lock); | |
55 | word_index = hard_iface->if_num * NUM_WORDS; | |
56 | word = &(orig_node->bcast_own[word_index]); | |
57 | ||
58 | bit_get_packet(bat_priv, word, 1, 0); | |
59 | orig_node->bcast_own_sum[hard_iface->if_num] = | |
60 | bit_packet_count(word); | |
61 | spin_unlock_bh(&orig_node->ogm_cnt_lock); | |
62 | } | |
63 | rcu_read_unlock(); | |
64 | } | |
65 | } | |
66 | ||
67 | static void update_TT(struct bat_priv *bat_priv, struct orig_node *orig_node, | |
68 | unsigned char *tt_buff, int tt_buff_len) | |
69 | { | |
70 | if ((tt_buff_len != orig_node->tt_buff_len) || | |
71 | ((tt_buff_len > 0) && | |
72 | (orig_node->tt_buff_len > 0) && | |
73 | (memcmp(orig_node->tt_buff, tt_buff, tt_buff_len) != 0))) { | |
74 | ||
75 | if (orig_node->tt_buff_len > 0) | |
76 | tt_global_del_orig(bat_priv, orig_node, | |
77 | "originator changed tt"); | |
78 | ||
79 | if ((tt_buff_len > 0) && (tt_buff)) | |
80 | tt_global_add_orig(bat_priv, orig_node, | |
81 | tt_buff, tt_buff_len); | |
82 | } | |
83 | } | |
84 | ||
85 | static void update_route(struct bat_priv *bat_priv, | |
86 | struct orig_node *orig_node, | |
87 | struct neigh_node *neigh_node, | |
88 | unsigned char *tt_buff, int tt_buff_len) | |
89 | { | |
90 | struct neigh_node *curr_router; | |
91 | ||
92 | curr_router = orig_node_get_router(orig_node); | |
93 | ||
94 | /* route deleted */ | |
95 | if ((curr_router) && (!neigh_node)) { | |
96 | ||
97 | bat_dbg(DBG_ROUTES, bat_priv, "Deleting route towards: %pM\n", | |
98 | orig_node->orig); | |
99 | tt_global_del_orig(bat_priv, orig_node, | |
100 | "originator timed out"); | |
101 | ||
102 | /* route added */ | |
103 | } else if ((!curr_router) && (neigh_node)) { | |
104 | ||
105 | bat_dbg(DBG_ROUTES, bat_priv, | |
106 | "Adding route towards: %pM (via %pM)\n", | |
107 | orig_node->orig, neigh_node->addr); | |
108 | tt_global_add_orig(bat_priv, orig_node, | |
109 | tt_buff, tt_buff_len); | |
110 | ||
111 | /* route changed */ | |
112 | } else { | |
113 | bat_dbg(DBG_ROUTES, bat_priv, | |
114 | "Changing route towards: %pM " | |
115 | "(now via %pM - was via %pM)\n", | |
116 | orig_node->orig, neigh_node->addr, | |
117 | curr_router->addr); | |
118 | } | |
119 | ||
120 | if (curr_router) | |
121 | neigh_node_free_ref(curr_router); | |
122 | ||
123 | /* increase refcount of new best neighbor */ | |
124 | if (neigh_node && !atomic_inc_not_zero(&neigh_node->refcount)) | |
125 | neigh_node = NULL; | |
126 | ||
127 | spin_lock_bh(&orig_node->neigh_list_lock); | |
128 | rcu_assign_pointer(orig_node->router, neigh_node); | |
129 | spin_unlock_bh(&orig_node->neigh_list_lock); | |
130 | ||
131 | /* decrease refcount of previous best neighbor */ | |
132 | if (curr_router) | |
133 | neigh_node_free_ref(curr_router); | |
134 | } | |
135 | ||
136 | ||
137 | void update_routes(struct bat_priv *bat_priv, struct orig_node *orig_node, | |
138 | struct neigh_node *neigh_node, unsigned char *tt_buff, | |
139 | int tt_buff_len) | |
140 | { | |
141 | struct neigh_node *router = NULL; | |
142 | ||
143 | if (!orig_node) | |
144 | goto out; | |
145 | ||
146 | router = orig_node_get_router(orig_node); | |
147 | ||
148 | if (router != neigh_node) | |
149 | update_route(bat_priv, orig_node, neigh_node, | |
150 | tt_buff, tt_buff_len); | |
151 | /* may be just TT changed */ | |
152 | else | |
153 | update_TT(bat_priv, orig_node, tt_buff, tt_buff_len); | |
154 | ||
155 | out: | |
156 | if (router) | |
157 | neigh_node_free_ref(router); | |
158 | } | |
159 | ||
160 | static int is_bidirectional_neigh(struct orig_node *orig_node, | |
161 | struct orig_node *orig_neigh_node, | |
162 | struct batman_packet *batman_packet, | |
163 | struct hard_iface *if_incoming) | |
164 | { | |
165 | struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface); | |
166 | struct neigh_node *neigh_node = NULL, *tmp_neigh_node; | |
167 | struct hlist_node *node; | |
168 | unsigned char total_count; | |
169 | uint8_t orig_eq_count, neigh_rq_count, tq_own; | |
170 | int tq_asym_penalty, ret = 0; | |
171 | ||
172 | if (orig_node == orig_neigh_node) { | |
173 | rcu_read_lock(); | |
174 | hlist_for_each_entry_rcu(tmp_neigh_node, node, | |
175 | &orig_node->neigh_list, list) { | |
176 | ||
177 | if (!compare_eth(tmp_neigh_node->addr, | |
178 | orig_neigh_node->orig)) | |
179 | continue; | |
180 | ||
181 | if (tmp_neigh_node->if_incoming != if_incoming) | |
182 | continue; | |
183 | ||
184 | if (!atomic_inc_not_zero(&tmp_neigh_node->refcount)) | |
185 | continue; | |
186 | ||
187 | neigh_node = tmp_neigh_node; | |
188 | } | |
189 | rcu_read_unlock(); | |
190 | ||
191 | if (!neigh_node) | |
192 | neigh_node = create_neighbor(orig_node, | |
193 | orig_neigh_node, | |
194 | orig_neigh_node->orig, | |
195 | if_incoming); | |
196 | if (!neigh_node) | |
197 | goto out; | |
198 | ||
199 | neigh_node->last_valid = jiffies; | |
200 | } else { | |
201 | /* find packet count of corresponding one hop neighbor */ | |
202 | rcu_read_lock(); | |
203 | hlist_for_each_entry_rcu(tmp_neigh_node, node, | |
204 | &orig_neigh_node->neigh_list, list) { | |
205 | ||
206 | if (!compare_eth(tmp_neigh_node->addr, | |
207 | orig_neigh_node->orig)) | |
208 | continue; | |
209 | ||
210 | if (tmp_neigh_node->if_incoming != if_incoming) | |
211 | continue; | |
212 | ||
213 | if (!atomic_inc_not_zero(&tmp_neigh_node->refcount)) | |
214 | continue; | |
215 | ||
216 | neigh_node = tmp_neigh_node; | |
217 | } | |
218 | rcu_read_unlock(); | |
219 | ||
220 | if (!neigh_node) | |
221 | neigh_node = create_neighbor(orig_neigh_node, | |
222 | orig_neigh_node, | |
223 | orig_neigh_node->orig, | |
224 | if_incoming); | |
225 | if (!neigh_node) | |
226 | goto out; | |
227 | } | |
228 | ||
229 | orig_node->last_valid = jiffies; | |
230 | ||
231 | spin_lock_bh(&orig_node->ogm_cnt_lock); | |
232 | orig_eq_count = orig_neigh_node->bcast_own_sum[if_incoming->if_num]; | |
233 | neigh_rq_count = neigh_node->real_packet_count; | |
234 | spin_unlock_bh(&orig_node->ogm_cnt_lock); | |
235 | ||
236 | /* pay attention to not get a value bigger than 100 % */ | |
237 | total_count = (orig_eq_count > neigh_rq_count ? | |
238 | neigh_rq_count : orig_eq_count); | |
239 | ||
240 | /* if we have too few packets (too less data) we set tq_own to zero */ | |
241 | /* if we receive too few packets it is not considered bidirectional */ | |
242 | if ((total_count < TQ_LOCAL_BIDRECT_SEND_MINIMUM) || | |
243 | (neigh_rq_count < TQ_LOCAL_BIDRECT_RECV_MINIMUM)) | |
244 | tq_own = 0; | |
245 | else | |
246 | /* neigh_node->real_packet_count is never zero as we | |
247 | * only purge old information when getting new | |
248 | * information */ | |
249 | tq_own = (TQ_MAX_VALUE * total_count) / neigh_rq_count; | |
250 | ||
251 | /* | |
252 | * 1 - ((1-x) ** 3), normalized to TQ_MAX_VALUE this does | |
253 | * affect the nearly-symmetric links only a little, but | |
254 | * punishes asymmetric links more. This will give a value | |
255 | * between 0 and TQ_MAX_VALUE | |
256 | */ | |
257 | tq_asym_penalty = TQ_MAX_VALUE - (TQ_MAX_VALUE * | |
258 | (TQ_LOCAL_WINDOW_SIZE - neigh_rq_count) * | |
259 | (TQ_LOCAL_WINDOW_SIZE - neigh_rq_count) * | |
260 | (TQ_LOCAL_WINDOW_SIZE - neigh_rq_count)) / | |
261 | (TQ_LOCAL_WINDOW_SIZE * | |
262 | TQ_LOCAL_WINDOW_SIZE * | |
263 | TQ_LOCAL_WINDOW_SIZE); | |
264 | ||
265 | batman_packet->tq = ((batman_packet->tq * tq_own * tq_asym_penalty) / | |
266 | (TQ_MAX_VALUE * TQ_MAX_VALUE)); | |
267 | ||
268 | bat_dbg(DBG_BATMAN, bat_priv, | |
269 | "bidirectional: " | |
270 | "orig = %-15pM neigh = %-15pM => own_bcast = %2i, " | |
271 | "real recv = %2i, local tq: %3i, asym_penalty: %3i, " | |
272 | "total tq: %3i\n", | |
273 | orig_node->orig, orig_neigh_node->orig, total_count, | |
274 | neigh_rq_count, tq_own, tq_asym_penalty, batman_packet->tq); | |
275 | ||
276 | /* if link has the minimum required transmission quality | |
277 | * consider it bidirectional */ | |
278 | if (batman_packet->tq >= TQ_TOTAL_BIDRECT_LIMIT) | |
279 | ret = 1; | |
280 | ||
281 | out: | |
282 | if (neigh_node) | |
283 | neigh_node_free_ref(neigh_node); | |
284 | return ret; | |
285 | } | |
286 | ||
287 | /* caller must hold the neigh_list_lock */ | |
288 | void bonding_candidate_del(struct orig_node *orig_node, | |
289 | struct neigh_node *neigh_node) | |
290 | { | |
291 | /* this neighbor is not part of our candidate list */ | |
292 | if (list_empty(&neigh_node->bonding_list)) | |
293 | goto out; | |
294 | ||
295 | list_del_rcu(&neigh_node->bonding_list); | |
296 | INIT_LIST_HEAD(&neigh_node->bonding_list); | |
297 | neigh_node_free_ref(neigh_node); | |
298 | atomic_dec(&orig_node->bond_candidates); | |
299 | ||
300 | out: | |
301 | return; | |
302 | } | |
303 | ||
304 | static void bonding_candidate_add(struct orig_node *orig_node, | |
305 | struct neigh_node *neigh_node) | |
306 | { | |
307 | struct hlist_node *node; | |
308 | struct neigh_node *tmp_neigh_node, *router = NULL; | |
309 | uint8_t interference_candidate = 0; | |
310 | ||
311 | spin_lock_bh(&orig_node->neigh_list_lock); | |
312 | ||
313 | /* only consider if it has the same primary address ... */ | |
314 | if (!compare_eth(orig_node->orig, | |
315 | neigh_node->orig_node->primary_addr)) | |
316 | goto candidate_del; | |
317 | ||
318 | router = orig_node_get_router(orig_node); | |
319 | if (!router) | |
320 | goto candidate_del; | |
321 | ||
322 | /* ... and is good enough to be considered */ | |
323 | if (neigh_node->tq_avg < router->tq_avg - BONDING_TQ_THRESHOLD) | |
324 | goto candidate_del; | |
325 | ||
326 | /** | |
327 | * check if we have another candidate with the same mac address or | |
328 | * interface. If we do, we won't select this candidate because of | |
329 | * possible interference. | |
330 | */ | |
331 | hlist_for_each_entry_rcu(tmp_neigh_node, node, | |
332 | &orig_node->neigh_list, list) { | |
333 | ||
334 | if (tmp_neigh_node == neigh_node) | |
335 | continue; | |
336 | ||
337 | /* we only care if the other candidate is even | |
338 | * considered as candidate. */ | |
339 | if (list_empty(&tmp_neigh_node->bonding_list)) | |
340 | continue; | |
341 | ||
342 | if ((neigh_node->if_incoming == tmp_neigh_node->if_incoming) || | |
343 | (compare_eth(neigh_node->addr, tmp_neigh_node->addr))) { | |
344 | interference_candidate = 1; | |
345 | break; | |
346 | } | |
347 | } | |
348 | ||
349 | /* don't care further if it is an interference candidate */ | |
350 | if (interference_candidate) | |
351 | goto candidate_del; | |
352 | ||
353 | /* this neighbor already is part of our candidate list */ | |
354 | if (!list_empty(&neigh_node->bonding_list)) | |
355 | goto out; | |
356 | ||
357 | if (!atomic_inc_not_zero(&neigh_node->refcount)) | |
358 | goto out; | |
359 | ||
360 | list_add_rcu(&neigh_node->bonding_list, &orig_node->bond_list); | |
361 | atomic_inc(&orig_node->bond_candidates); | |
362 | goto out; | |
363 | ||
364 | candidate_del: | |
365 | bonding_candidate_del(orig_node, neigh_node); | |
366 | ||
367 | out: | |
368 | spin_unlock_bh(&orig_node->neigh_list_lock); | |
369 | ||
370 | if (router) | |
371 | neigh_node_free_ref(router); | |
372 | } | |
373 | ||
374 | /* copy primary address for bonding */ | |
375 | static void bonding_save_primary(struct orig_node *orig_node, | |
376 | struct orig_node *orig_neigh_node, | |
377 | struct batman_packet *batman_packet) | |
378 | { | |
379 | if (!(batman_packet->flags & PRIMARIES_FIRST_HOP)) | |
380 | return; | |
381 | ||
382 | memcpy(orig_neigh_node->primary_addr, orig_node->orig, ETH_ALEN); | |
383 | } | |
384 | ||
385 | static void update_orig(struct bat_priv *bat_priv, | |
386 | struct orig_node *orig_node, | |
387 | struct ethhdr *ethhdr, | |
388 | struct batman_packet *batman_packet, | |
389 | struct hard_iface *if_incoming, | |
390 | unsigned char *tt_buff, int tt_buff_len, | |
391 | char is_duplicate) | |
392 | { | |
393 | struct neigh_node *neigh_node = NULL, *tmp_neigh_node = NULL; | |
394 | struct neigh_node *router = NULL; | |
395 | struct orig_node *orig_node_tmp; | |
396 | struct hlist_node *node; | |
397 | int tmp_tt_buff_len; | |
398 | uint8_t bcast_own_sum_orig, bcast_own_sum_neigh; | |
399 | ||
400 | bat_dbg(DBG_BATMAN, bat_priv, "update_originator(): " | |
401 | "Searching and updating originator entry of received packet\n"); | |
402 | ||
403 | rcu_read_lock(); | |
404 | hlist_for_each_entry_rcu(tmp_neigh_node, node, | |
405 | &orig_node->neigh_list, list) { | |
406 | if (compare_eth(tmp_neigh_node->addr, ethhdr->h_source) && | |
407 | (tmp_neigh_node->if_incoming == if_incoming) && | |
408 | atomic_inc_not_zero(&tmp_neigh_node->refcount)) { | |
409 | if (neigh_node) | |
410 | neigh_node_free_ref(neigh_node); | |
411 | neigh_node = tmp_neigh_node; | |
412 | continue; | |
413 | } | |
414 | ||
415 | if (is_duplicate) | |
416 | continue; | |
417 | ||
418 | spin_lock_bh(&tmp_neigh_node->tq_lock); | |
419 | ring_buffer_set(tmp_neigh_node->tq_recv, | |
420 | &tmp_neigh_node->tq_index, 0); | |
421 | tmp_neigh_node->tq_avg = | |
422 | ring_buffer_avg(tmp_neigh_node->tq_recv); | |
423 | spin_unlock_bh(&tmp_neigh_node->tq_lock); | |
424 | } | |
425 | ||
426 | if (!neigh_node) { | |
427 | struct orig_node *orig_tmp; | |
428 | ||
429 | orig_tmp = get_orig_node(bat_priv, ethhdr->h_source); | |
430 | if (!orig_tmp) | |
431 | goto unlock; | |
432 | ||
433 | neigh_node = create_neighbor(orig_node, orig_tmp, | |
434 | ethhdr->h_source, if_incoming); | |
435 | ||
436 | orig_node_free_ref(orig_tmp); | |
437 | if (!neigh_node) | |
438 | goto unlock; | |
439 | } else | |
440 | bat_dbg(DBG_BATMAN, bat_priv, | |
441 | "Updating existing last-hop neighbor of originator\n"); | |
442 | ||
443 | rcu_read_unlock(); | |
444 | ||
445 | orig_node->flags = batman_packet->flags; | |
446 | neigh_node->last_valid = jiffies; | |
447 | ||
448 | spin_lock_bh(&neigh_node->tq_lock); | |
449 | ring_buffer_set(neigh_node->tq_recv, | |
450 | &neigh_node->tq_index, | |
451 | batman_packet->tq); | |
452 | neigh_node->tq_avg = ring_buffer_avg(neigh_node->tq_recv); | |
453 | spin_unlock_bh(&neigh_node->tq_lock); | |
454 | ||
455 | if (!is_duplicate) { | |
456 | orig_node->last_ttl = batman_packet->ttl; | |
457 | neigh_node->last_ttl = batman_packet->ttl; | |
458 | } | |
459 | ||
460 | bonding_candidate_add(orig_node, neigh_node); | |
461 | ||
462 | tmp_tt_buff_len = (tt_buff_len > batman_packet->num_tt * ETH_ALEN ? | |
463 | batman_packet->num_tt * ETH_ALEN : tt_buff_len); | |
464 | ||
465 | /* if this neighbor already is our next hop there is nothing | |
466 | * to change */ | |
467 | router = orig_node_get_router(orig_node); | |
468 | if (router == neigh_node) | |
469 | goto update_tt; | |
470 | ||
471 | /* if this neighbor does not offer a better TQ we won't consider it */ | |
472 | if (router && (router->tq_avg > neigh_node->tq_avg)) | |
473 | goto update_tt; | |
474 | ||
475 | /* if the TQ is the same and the link not more symetric we | |
476 | * won't consider it either */ | |
477 | if (router && (neigh_node->tq_avg == router->tq_avg)) { | |
478 | orig_node_tmp = router->orig_node; | |
479 | spin_lock_bh(&orig_node_tmp->ogm_cnt_lock); | |
480 | bcast_own_sum_orig = | |
481 | orig_node_tmp->bcast_own_sum[if_incoming->if_num]; | |
482 | spin_unlock_bh(&orig_node_tmp->ogm_cnt_lock); | |
483 | ||
484 | orig_node_tmp = neigh_node->orig_node; | |
485 | spin_lock_bh(&orig_node_tmp->ogm_cnt_lock); | |
486 | bcast_own_sum_neigh = | |
487 | orig_node_tmp->bcast_own_sum[if_incoming->if_num]; | |
488 | spin_unlock_bh(&orig_node_tmp->ogm_cnt_lock); | |
489 | ||
490 | if (bcast_own_sum_orig >= bcast_own_sum_neigh) | |
491 | goto update_tt; | |
492 | } | |
493 | ||
494 | update_routes(bat_priv, orig_node, neigh_node, | |
495 | tt_buff, tmp_tt_buff_len); | |
496 | goto update_gw; | |
497 | ||
498 | update_tt: | |
499 | update_routes(bat_priv, orig_node, router, | |
500 | tt_buff, tmp_tt_buff_len); | |
501 | ||
502 | update_gw: | |
503 | if (orig_node->gw_flags != batman_packet->gw_flags) | |
504 | gw_node_update(bat_priv, orig_node, batman_packet->gw_flags); | |
505 | ||
506 | orig_node->gw_flags = batman_packet->gw_flags; | |
507 | ||
508 | /* restart gateway selection if fast or late switching was enabled */ | |
509 | if ((orig_node->gw_flags) && | |
510 | (atomic_read(&bat_priv->gw_mode) == GW_MODE_CLIENT) && | |
511 | (atomic_read(&bat_priv->gw_sel_class) > 2)) | |
512 | gw_check_election(bat_priv, orig_node); | |
513 | ||
514 | goto out; | |
515 | ||
516 | unlock: | |
517 | rcu_read_unlock(); | |
518 | out: | |
519 | if (neigh_node) | |
520 | neigh_node_free_ref(neigh_node); | |
521 | if (router) | |
522 | neigh_node_free_ref(router); | |
523 | } | |
524 | ||
525 | /* checks whether the host restarted and is in the protection time. | |
526 | * returns: | |
527 | * 0 if the packet is to be accepted | |
528 | * 1 if the packet is to be ignored. | |
529 | */ | |
530 | static int window_protected(struct bat_priv *bat_priv, | |
531 | int32_t seq_num_diff, | |
532 | unsigned long *last_reset) | |
533 | { | |
534 | if ((seq_num_diff <= -TQ_LOCAL_WINDOW_SIZE) | |
535 | || (seq_num_diff >= EXPECTED_SEQNO_RANGE)) { | |
536 | if (time_after(jiffies, *last_reset + | |
537 | msecs_to_jiffies(RESET_PROTECTION_MS))) { | |
538 | ||
539 | *last_reset = jiffies; | |
540 | bat_dbg(DBG_BATMAN, bat_priv, | |
541 | "old packet received, start protection\n"); | |
542 | ||
543 | return 0; | |
544 | } else | |
545 | return 1; | |
546 | } | |
547 | return 0; | |
548 | } | |
549 | ||
550 | /* processes a batman packet for all interfaces, adjusts the sequence number and | |
551 | * finds out whether it is a duplicate. | |
552 | * returns: | |
553 | * 1 the packet is a duplicate | |
554 | * 0 the packet has not yet been received | |
555 | * -1 the packet is old and has been received while the seqno window | |
556 | * was protected. Caller should drop it. | |
557 | */ | |
558 | static char count_real_packets(struct ethhdr *ethhdr, | |
559 | struct batman_packet *batman_packet, | |
560 | struct hard_iface *if_incoming) | |
561 | { | |
562 | struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface); | |
563 | struct orig_node *orig_node; | |
564 | struct neigh_node *tmp_neigh_node; | |
565 | struct hlist_node *node; | |
566 | char is_duplicate = 0; | |
567 | int32_t seq_diff; | |
568 | int need_update = 0; | |
569 | int set_mark, ret = -1; | |
570 | ||
571 | orig_node = get_orig_node(bat_priv, batman_packet->orig); | |
572 | if (!orig_node) | |
573 | return 0; | |
574 | ||
575 | spin_lock_bh(&orig_node->ogm_cnt_lock); | |
576 | seq_diff = batman_packet->seqno - orig_node->last_real_seqno; | |
577 | ||
578 | /* signalize caller that the packet is to be dropped. */ | |
579 | if (window_protected(bat_priv, seq_diff, | |
580 | &orig_node->batman_seqno_reset)) | |
581 | goto out; | |
582 | ||
583 | rcu_read_lock(); | |
584 | hlist_for_each_entry_rcu(tmp_neigh_node, node, | |
585 | &orig_node->neigh_list, list) { | |
586 | ||
587 | is_duplicate |= get_bit_status(tmp_neigh_node->real_bits, | |
588 | orig_node->last_real_seqno, | |
589 | batman_packet->seqno); | |
590 | ||
591 | if (compare_eth(tmp_neigh_node->addr, ethhdr->h_source) && | |
592 | (tmp_neigh_node->if_incoming == if_incoming)) | |
593 | set_mark = 1; | |
594 | else | |
595 | set_mark = 0; | |
596 | ||
597 | /* if the window moved, set the update flag. */ | |
598 | need_update |= bit_get_packet(bat_priv, | |
599 | tmp_neigh_node->real_bits, | |
600 | seq_diff, set_mark); | |
601 | ||
602 | tmp_neigh_node->real_packet_count = | |
603 | bit_packet_count(tmp_neigh_node->real_bits); | |
604 | } | |
605 | rcu_read_unlock(); | |
606 | ||
607 | if (need_update) { | |
608 | bat_dbg(DBG_BATMAN, bat_priv, | |
609 | "updating last_seqno: old %d, new %d\n", | |
610 | orig_node->last_real_seqno, batman_packet->seqno); | |
611 | orig_node->last_real_seqno = batman_packet->seqno; | |
612 | } | |
613 | ||
614 | ret = is_duplicate; | |
615 | ||
616 | out: | |
617 | spin_unlock_bh(&orig_node->ogm_cnt_lock); | |
618 | orig_node_free_ref(orig_node); | |
619 | return ret; | |
620 | } | |
621 | ||
622 | void receive_bat_packet(struct ethhdr *ethhdr, | |
623 | struct batman_packet *batman_packet, | |
624 | unsigned char *tt_buff, int tt_buff_len, | |
625 | struct hard_iface *if_incoming) | |
626 | { | |
627 | struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface); | |
628 | struct hard_iface *hard_iface; | |
629 | struct orig_node *orig_neigh_node, *orig_node; | |
630 | struct neigh_node *router = NULL, *router_router = NULL; | |
631 | struct neigh_node *orig_neigh_router = NULL; | |
632 | char has_directlink_flag; | |
633 | char is_my_addr = 0, is_my_orig = 0, is_my_oldorig = 0; | |
634 | char is_broadcast = 0, is_bidirectional, is_single_hop_neigh; | |
635 | char is_duplicate; | |
636 | uint32_t if_incoming_seqno; | |
637 | ||
638 | /* Silently drop when the batman packet is actually not a | |
639 | * correct packet. | |
640 | * | |
641 | * This might happen if a packet is padded (e.g. Ethernet has a | |
642 | * minimum frame length of 64 byte) and the aggregation interprets | |
643 | * it as an additional length. | |
644 | * | |
645 | * TODO: A more sane solution would be to have a bit in the | |
646 | * batman_packet to detect whether the packet is the last | |
647 | * packet in an aggregation. Here we expect that the padding | |
648 | * is always zero (or not 0x01) | |
649 | */ | |
650 | if (batman_packet->packet_type != BAT_PACKET) | |
651 | return; | |
652 | ||
653 | /* could be changed by schedule_own_packet() */ | |
654 | if_incoming_seqno = atomic_read(&if_incoming->seqno); | |
655 | ||
656 | has_directlink_flag = (batman_packet->flags & DIRECTLINK ? 1 : 0); | |
657 | ||
658 | is_single_hop_neigh = (compare_eth(ethhdr->h_source, | |
659 | batman_packet->orig) ? 1 : 0); | |
660 | ||
661 | bat_dbg(DBG_BATMAN, bat_priv, | |
662 | "Received BATMAN packet via NB: %pM, IF: %s [%pM] " | |
663 | "(from OG: %pM, via prev OG: %pM, seqno %d, tq %d, " | |
664 | "TTL %d, V %d, IDF %d)\n", | |
665 | ethhdr->h_source, if_incoming->net_dev->name, | |
666 | if_incoming->net_dev->dev_addr, batman_packet->orig, | |
667 | batman_packet->prev_sender, batman_packet->seqno, | |
668 | batman_packet->tq, batman_packet->ttl, batman_packet->version, | |
669 | has_directlink_flag); | |
670 | ||
671 | rcu_read_lock(); | |
672 | list_for_each_entry_rcu(hard_iface, &hardif_list, list) { | |
673 | if (hard_iface->if_status != IF_ACTIVE) | |
674 | continue; | |
675 | ||
676 | if (hard_iface->soft_iface != if_incoming->soft_iface) | |
677 | continue; | |
678 | ||
679 | if (compare_eth(ethhdr->h_source, | |
680 | hard_iface->net_dev->dev_addr)) | |
681 | is_my_addr = 1; | |
682 | ||
683 | if (compare_eth(batman_packet->orig, | |
684 | hard_iface->net_dev->dev_addr)) | |
685 | is_my_orig = 1; | |
686 | ||
687 | if (compare_eth(batman_packet->prev_sender, | |
688 | hard_iface->net_dev->dev_addr)) | |
689 | is_my_oldorig = 1; | |
690 | ||
691 | if (compare_eth(ethhdr->h_source, broadcast_addr)) | |
692 | is_broadcast = 1; | |
693 | } | |
694 | rcu_read_unlock(); | |
695 | ||
696 | if (batman_packet->version != COMPAT_VERSION) { | |
697 | bat_dbg(DBG_BATMAN, bat_priv, | |
698 | "Drop packet: incompatible batman version (%i)\n", | |
699 | batman_packet->version); | |
700 | return; | |
701 | } | |
702 | ||
703 | if (is_my_addr) { | |
704 | bat_dbg(DBG_BATMAN, bat_priv, | |
705 | "Drop packet: received my own broadcast (sender: %pM" | |
706 | ")\n", | |
707 | ethhdr->h_source); | |
708 | return; | |
709 | } | |
710 | ||
711 | if (is_broadcast) { | |
712 | bat_dbg(DBG_BATMAN, bat_priv, "Drop packet: " | |
713 | "ignoring all packets with broadcast source addr (sender: %pM" | |
714 | ")\n", ethhdr->h_source); | |
715 | return; | |
716 | } | |
717 | ||
718 | if (is_my_orig) { | |
719 | unsigned long *word; | |
720 | int offset; | |
721 | ||
722 | orig_neigh_node = get_orig_node(bat_priv, ethhdr->h_source); | |
723 | if (!orig_neigh_node) | |
724 | return; | |
725 | ||
726 | /* neighbor has to indicate direct link and it has to | |
727 | * come via the corresponding interface */ | |
728 | /* if received seqno equals last send seqno save new | |
729 | * seqno for bidirectional check */ | |
730 | if (has_directlink_flag && | |
731 | compare_eth(if_incoming->net_dev->dev_addr, | |
732 | batman_packet->orig) && | |
733 | (batman_packet->seqno - if_incoming_seqno + 2 == 0)) { | |
734 | offset = if_incoming->if_num * NUM_WORDS; | |
735 | ||
736 | spin_lock_bh(&orig_neigh_node->ogm_cnt_lock); | |
737 | word = &(orig_neigh_node->bcast_own[offset]); | |
738 | bit_mark(word, 0); | |
739 | orig_neigh_node->bcast_own_sum[if_incoming->if_num] = | |
740 | bit_packet_count(word); | |
741 | spin_unlock_bh(&orig_neigh_node->ogm_cnt_lock); | |
742 | } | |
743 | ||
744 | bat_dbg(DBG_BATMAN, bat_priv, "Drop packet: " | |
745 | "originator packet from myself (via neighbor)\n"); | |
746 | orig_node_free_ref(orig_neigh_node); | |
747 | return; | |
748 | } | |
749 | ||
750 | if (is_my_oldorig) { | |
751 | bat_dbg(DBG_BATMAN, bat_priv, | |
752 | "Drop packet: ignoring all rebroadcast echos (sender: " | |
753 | "%pM)\n", ethhdr->h_source); | |
754 | return; | |
755 | } | |
756 | ||
757 | orig_node = get_orig_node(bat_priv, batman_packet->orig); | |
758 | if (!orig_node) | |
759 | return; | |
760 | ||
761 | is_duplicate = count_real_packets(ethhdr, batman_packet, if_incoming); | |
762 | ||
763 | if (is_duplicate == -1) { | |
764 | bat_dbg(DBG_BATMAN, bat_priv, | |
765 | "Drop packet: packet within seqno protection time " | |
766 | "(sender: %pM)\n", ethhdr->h_source); | |
767 | goto out; | |
768 | } | |
769 | ||
770 | if (batman_packet->tq == 0) { | |
771 | bat_dbg(DBG_BATMAN, bat_priv, | |
772 | "Drop packet: originator packet with tq equal 0\n"); | |
773 | goto out; | |
774 | } | |
775 | ||
776 | router = orig_node_get_router(orig_node); | |
777 | if (router) | |
778 | router_router = orig_node_get_router(router->orig_node); | |
779 | ||
780 | /* avoid temporary routing loops */ | |
781 | if (router && router_router && | |
782 | (compare_eth(router->addr, batman_packet->prev_sender)) && | |
783 | !(compare_eth(batman_packet->orig, batman_packet->prev_sender)) && | |
784 | (compare_eth(router->addr, router_router->addr))) { | |
785 | bat_dbg(DBG_BATMAN, bat_priv, | |
786 | "Drop packet: ignoring all rebroadcast packets that " | |
787 | "may make me loop (sender: %pM)\n", ethhdr->h_source); | |
788 | goto out; | |
789 | } | |
790 | ||
791 | /* if sender is a direct neighbor the sender mac equals | |
792 | * originator mac */ | |
793 | orig_neigh_node = (is_single_hop_neigh ? | |
794 | orig_node : | |
795 | get_orig_node(bat_priv, ethhdr->h_source)); | |
796 | if (!orig_neigh_node) | |
797 | goto out; | |
798 | ||
799 | orig_neigh_router = orig_node_get_router(orig_neigh_node); | |
800 | ||
801 | /* drop packet if sender is not a direct neighbor and if we | |
802 | * don't route towards it */ | |
803 | if (!is_single_hop_neigh && (!orig_neigh_router)) { | |
804 | bat_dbg(DBG_BATMAN, bat_priv, | |
805 | "Drop packet: OGM via unknown neighbor!\n"); | |
806 | goto out_neigh; | |
807 | } | |
808 | ||
809 | is_bidirectional = is_bidirectional_neigh(orig_node, orig_neigh_node, | |
810 | batman_packet, if_incoming); | |
811 | ||
812 | bonding_save_primary(orig_node, orig_neigh_node, batman_packet); | |
813 | ||
814 | /* update ranking if it is not a duplicate or has the same | |
815 | * seqno and similar ttl as the non-duplicate */ | |
816 | if (is_bidirectional && | |
817 | (!is_duplicate || | |
818 | ((orig_node->last_real_seqno == batman_packet->seqno) && | |
819 | (orig_node->last_ttl - 3 <= batman_packet->ttl)))) | |
820 | update_orig(bat_priv, orig_node, ethhdr, batman_packet, | |
821 | if_incoming, tt_buff, tt_buff_len, is_duplicate); | |
822 | ||
823 | /* is single hop (direct) neighbor */ | |
824 | if (is_single_hop_neigh) { | |
825 | ||
826 | /* mark direct link on incoming interface */ | |
827 | schedule_forward_packet(orig_node, ethhdr, batman_packet, | |
828 | 1, tt_buff_len, if_incoming); | |
829 | ||
830 | bat_dbg(DBG_BATMAN, bat_priv, "Forwarding packet: " | |
831 | "rebroadcast neighbor packet with direct link flag\n"); | |
832 | goto out_neigh; | |
833 | } | |
834 | ||
835 | /* multihop originator */ | |
836 | if (!is_bidirectional) { | |
837 | bat_dbg(DBG_BATMAN, bat_priv, | |
838 | "Drop packet: not received via bidirectional link\n"); | |
839 | goto out_neigh; | |
840 | } | |
841 | ||
842 | if (is_duplicate) { | |
843 | bat_dbg(DBG_BATMAN, bat_priv, | |
844 | "Drop packet: duplicate packet received\n"); | |
845 | goto out_neigh; | |
846 | } | |
847 | ||
848 | bat_dbg(DBG_BATMAN, bat_priv, | |
849 | "Forwarding packet: rebroadcast originator packet\n"); | |
850 | schedule_forward_packet(orig_node, ethhdr, batman_packet, | |
851 | 0, tt_buff_len, if_incoming); | |
852 | ||
853 | out_neigh: | |
854 | if ((orig_neigh_node) && (!is_single_hop_neigh)) | |
855 | orig_node_free_ref(orig_neigh_node); | |
856 | out: | |
857 | if (router) | |
858 | neigh_node_free_ref(router); | |
859 | if (router_router) | |
860 | neigh_node_free_ref(router_router); | |
861 | if (orig_neigh_router) | |
862 | neigh_node_free_ref(orig_neigh_router); | |
863 | ||
864 | orig_node_free_ref(orig_node); | |
865 | } | |
866 | ||
867 | int recv_bat_packet(struct sk_buff *skb, struct hard_iface *hard_iface) | |
868 | { | |
869 | struct ethhdr *ethhdr; | |
870 | ||
871 | /* drop packet if it has not necessary minimum size */ | |
872 | if (unlikely(!pskb_may_pull(skb, sizeof(struct batman_packet)))) | |
873 | return NET_RX_DROP; | |
874 | ||
875 | ethhdr = (struct ethhdr *)skb_mac_header(skb); | |
876 | ||
877 | /* packet with broadcast indication but unicast recipient */ | |
878 | if (!is_broadcast_ether_addr(ethhdr->h_dest)) | |
879 | return NET_RX_DROP; | |
880 | ||
881 | /* packet with broadcast sender address */ | |
882 | if (is_broadcast_ether_addr(ethhdr->h_source)) | |
883 | return NET_RX_DROP; | |
884 | ||
885 | /* create a copy of the skb, if needed, to modify it. */ | |
886 | if (skb_cow(skb, 0) < 0) | |
887 | return NET_RX_DROP; | |
888 | ||
889 | /* keep skb linear */ | |
890 | if (skb_linearize(skb) < 0) | |
891 | return NET_RX_DROP; | |
892 | ||
893 | ethhdr = (struct ethhdr *)skb_mac_header(skb); | |
894 | ||
895 | receive_aggr_bat_packet(ethhdr, | |
896 | skb->data, | |
897 | skb_headlen(skb), | |
898 | hard_iface); | |
899 | ||
900 | kfree_skb(skb); | |
901 | return NET_RX_SUCCESS; | |
902 | } | |
903 | ||
904 | static int recv_my_icmp_packet(struct bat_priv *bat_priv, | |
905 | struct sk_buff *skb, size_t icmp_len) | |
906 | { | |
907 | struct hard_iface *primary_if = NULL; | |
908 | struct orig_node *orig_node = NULL; | |
909 | struct neigh_node *router = NULL; | |
910 | struct icmp_packet_rr *icmp_packet; | |
911 | int ret = NET_RX_DROP; | |
912 | ||
913 | icmp_packet = (struct icmp_packet_rr *)skb->data; | |
914 | ||
915 | /* add data to device queue */ | |
916 | if (icmp_packet->msg_type != ECHO_REQUEST) { | |
917 | bat_socket_receive_packet(icmp_packet, icmp_len); | |
918 | goto out; | |
919 | } | |
920 | ||
921 | primary_if = primary_if_get_selected(bat_priv); | |
922 | if (!primary_if) | |
923 | goto out; | |
924 | ||
925 | /* answer echo request (ping) */ | |
926 | /* get routing information */ | |
927 | orig_node = orig_hash_find(bat_priv, icmp_packet->orig); | |
928 | if (!orig_node) | |
929 | goto out; | |
930 | ||
931 | router = orig_node_get_router(orig_node); | |
932 | if (!router) | |
933 | goto out; | |
934 | ||
935 | /* create a copy of the skb, if needed, to modify it. */ | |
936 | if (skb_cow(skb, sizeof(struct ethhdr)) < 0) | |
937 | goto out; | |
938 | ||
939 | icmp_packet = (struct icmp_packet_rr *)skb->data; | |
940 | ||
941 | memcpy(icmp_packet->dst, icmp_packet->orig, ETH_ALEN); | |
942 | memcpy(icmp_packet->orig, primary_if->net_dev->dev_addr, ETH_ALEN); | |
943 | icmp_packet->msg_type = ECHO_REPLY; | |
944 | icmp_packet->ttl = TTL; | |
945 | ||
946 | send_skb_packet(skb, router->if_incoming, router->addr); | |
947 | ret = NET_RX_SUCCESS; | |
948 | ||
949 | out: | |
950 | if (primary_if) | |
951 | hardif_free_ref(primary_if); | |
952 | if (router) | |
953 | neigh_node_free_ref(router); | |
954 | if (orig_node) | |
955 | orig_node_free_ref(orig_node); | |
956 | return ret; | |
957 | } | |
958 | ||
959 | static int recv_icmp_ttl_exceeded(struct bat_priv *bat_priv, | |
960 | struct sk_buff *skb) | |
961 | { | |
962 | struct hard_iface *primary_if = NULL; | |
963 | struct orig_node *orig_node = NULL; | |
964 | struct neigh_node *router = NULL; | |
965 | struct icmp_packet *icmp_packet; | |
966 | int ret = NET_RX_DROP; | |
967 | ||
968 | icmp_packet = (struct icmp_packet *)skb->data; | |
969 | ||
970 | /* send TTL exceeded if packet is an echo request (traceroute) */ | |
971 | if (icmp_packet->msg_type != ECHO_REQUEST) { | |
972 | pr_debug("Warning - can't forward icmp packet from %pM to " | |
973 | "%pM: ttl exceeded\n", icmp_packet->orig, | |
974 | icmp_packet->dst); | |
975 | goto out; | |
976 | } | |
977 | ||
978 | primary_if = primary_if_get_selected(bat_priv); | |
979 | if (!primary_if) | |
980 | goto out; | |
981 | ||
982 | /* get routing information */ | |
983 | orig_node = orig_hash_find(bat_priv, icmp_packet->orig); | |
984 | if (!orig_node) | |
985 | goto out; | |
986 | ||
987 | router = orig_node_get_router(orig_node); | |
988 | if (!router) | |
989 | goto out; | |
990 | ||
991 | /* create a copy of the skb, if needed, to modify it. */ | |
992 | if (skb_cow(skb, sizeof(struct ethhdr)) < 0) | |
993 | goto out; | |
994 | ||
995 | icmp_packet = (struct icmp_packet *)skb->data; | |
996 | ||
997 | memcpy(icmp_packet->dst, icmp_packet->orig, ETH_ALEN); | |
998 | memcpy(icmp_packet->orig, primary_if->net_dev->dev_addr, ETH_ALEN); | |
999 | icmp_packet->msg_type = TTL_EXCEEDED; | |
1000 | icmp_packet->ttl = TTL; | |
1001 | ||
1002 | send_skb_packet(skb, router->if_incoming, router->addr); | |
1003 | ret = NET_RX_SUCCESS; | |
1004 | ||
1005 | out: | |
1006 | if (primary_if) | |
1007 | hardif_free_ref(primary_if); | |
1008 | if (router) | |
1009 | neigh_node_free_ref(router); | |
1010 | if (orig_node) | |
1011 | orig_node_free_ref(orig_node); | |
1012 | return ret; | |
1013 | } | |
1014 | ||
1015 | ||
1016 | int recv_icmp_packet(struct sk_buff *skb, struct hard_iface *recv_if) | |
1017 | { | |
1018 | struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface); | |
1019 | struct icmp_packet_rr *icmp_packet; | |
1020 | struct ethhdr *ethhdr; | |
1021 | struct orig_node *orig_node = NULL; | |
1022 | struct neigh_node *router = NULL; | |
1023 | int hdr_size = sizeof(struct icmp_packet); | |
1024 | int ret = NET_RX_DROP; | |
1025 | ||
1026 | /** | |
1027 | * we truncate all incoming icmp packets if they don't match our size | |
1028 | */ | |
1029 | if (skb->len >= sizeof(struct icmp_packet_rr)) | |
1030 | hdr_size = sizeof(struct icmp_packet_rr); | |
1031 | ||
1032 | /* drop packet if it has not necessary minimum size */ | |
1033 | if (unlikely(!pskb_may_pull(skb, hdr_size))) | |
1034 | goto out; | |
1035 | ||
1036 | ethhdr = (struct ethhdr *)skb_mac_header(skb); | |
1037 | ||
1038 | /* packet with unicast indication but broadcast recipient */ | |
1039 | if (is_broadcast_ether_addr(ethhdr->h_dest)) | |
1040 | goto out; | |
1041 | ||
1042 | /* packet with broadcast sender address */ | |
1043 | if (is_broadcast_ether_addr(ethhdr->h_source)) | |
1044 | goto out; | |
1045 | ||
1046 | /* not for me */ | |
1047 | if (!is_my_mac(ethhdr->h_dest)) | |
1048 | goto out; | |
1049 | ||
1050 | icmp_packet = (struct icmp_packet_rr *)skb->data; | |
1051 | ||
1052 | /* add record route information if not full */ | |
1053 | if ((hdr_size == sizeof(struct icmp_packet_rr)) && | |
1054 | (icmp_packet->rr_cur < BAT_RR_LEN)) { | |
1055 | memcpy(&(icmp_packet->rr[icmp_packet->rr_cur]), | |
1056 | ethhdr->h_dest, ETH_ALEN); | |
1057 | icmp_packet->rr_cur++; | |
1058 | } | |
1059 | ||
1060 | /* packet for me */ | |
1061 | if (is_my_mac(icmp_packet->dst)) | |
1062 | return recv_my_icmp_packet(bat_priv, skb, hdr_size); | |
1063 | ||
1064 | /* TTL exceeded */ | |
1065 | if (icmp_packet->ttl < 2) | |
1066 | return recv_icmp_ttl_exceeded(bat_priv, skb); | |
1067 | ||
1068 | /* get routing information */ | |
1069 | orig_node = orig_hash_find(bat_priv, icmp_packet->dst); | |
1070 | if (!orig_node) | |
1071 | goto out; | |
1072 | ||
1073 | router = orig_node_get_router(orig_node); | |
1074 | if (!router) | |
1075 | goto out; | |
1076 | ||
1077 | /* create a copy of the skb, if needed, to modify it. */ | |
1078 | if (skb_cow(skb, sizeof(struct ethhdr)) < 0) | |
1079 | goto out; | |
1080 | ||
1081 | icmp_packet = (struct icmp_packet_rr *)skb->data; | |
1082 | ||
1083 | /* decrement ttl */ | |
1084 | icmp_packet->ttl--; | |
1085 | ||
1086 | /* route it */ | |
1087 | send_skb_packet(skb, router->if_incoming, router->addr); | |
1088 | ret = NET_RX_SUCCESS; | |
1089 | ||
1090 | out: | |
1091 | if (router) | |
1092 | neigh_node_free_ref(router); | |
1093 | if (orig_node) | |
1094 | orig_node_free_ref(orig_node); | |
1095 | return ret; | |
1096 | } | |
1097 | ||
1098 | /* In the bonding case, send the packets in a round | |
1099 | * robin fashion over the remaining interfaces. | |
1100 | * | |
1101 | * This method rotates the bonding list and increases the | |
1102 | * returned router's refcount. */ | |
1103 | static struct neigh_node *find_bond_router(struct orig_node *primary_orig, | |
1104 | struct hard_iface *recv_if) | |
1105 | { | |
1106 | struct neigh_node *tmp_neigh_node; | |
1107 | struct neigh_node *router = NULL, *first_candidate = NULL; | |
1108 | ||
1109 | rcu_read_lock(); | |
1110 | list_for_each_entry_rcu(tmp_neigh_node, &primary_orig->bond_list, | |
1111 | bonding_list) { | |
1112 | if (!first_candidate) | |
1113 | first_candidate = tmp_neigh_node; | |
1114 | ||
1115 | /* recv_if == NULL on the first node. */ | |
1116 | if (tmp_neigh_node->if_incoming == recv_if) | |
1117 | continue; | |
1118 | ||
1119 | if (!atomic_inc_not_zero(&tmp_neigh_node->refcount)) | |
1120 | continue; | |
1121 | ||
1122 | router = tmp_neigh_node; | |
1123 | break; | |
1124 | } | |
1125 | ||
1126 | /* use the first candidate if nothing was found. */ | |
1127 | if (!router && first_candidate && | |
1128 | atomic_inc_not_zero(&first_candidate->refcount)) | |
1129 | router = first_candidate; | |
1130 | ||
1131 | if (!router) | |
1132 | goto out; | |
1133 | ||
1134 | /* selected should point to the next element | |
1135 | * after the current router */ | |
1136 | spin_lock_bh(&primary_orig->neigh_list_lock); | |
1137 | /* this is a list_move(), which unfortunately | |
1138 | * does not exist as rcu version */ | |
1139 | list_del_rcu(&primary_orig->bond_list); | |
1140 | list_add_rcu(&primary_orig->bond_list, | |
1141 | &router->bonding_list); | |
1142 | spin_unlock_bh(&primary_orig->neigh_list_lock); | |
1143 | ||
1144 | out: | |
1145 | rcu_read_unlock(); | |
1146 | return router; | |
1147 | } | |
1148 | ||
1149 | /* Interface Alternating: Use the best of the | |
1150 | * remaining candidates which are not using | |
1151 | * this interface. | |
1152 | * | |
1153 | * Increases the returned router's refcount */ | |
1154 | static struct neigh_node *find_ifalter_router(struct orig_node *primary_orig, | |
1155 | struct hard_iface *recv_if) | |
1156 | { | |
1157 | struct neigh_node *tmp_neigh_node; | |
1158 | struct neigh_node *router = NULL, *first_candidate = NULL; | |
1159 | ||
1160 | rcu_read_lock(); | |
1161 | list_for_each_entry_rcu(tmp_neigh_node, &primary_orig->bond_list, | |
1162 | bonding_list) { | |
1163 | if (!first_candidate) | |
1164 | first_candidate = tmp_neigh_node; | |
1165 | ||
1166 | /* recv_if == NULL on the first node. */ | |
1167 | if (tmp_neigh_node->if_incoming == recv_if) | |
1168 | continue; | |
1169 | ||
1170 | if (!atomic_inc_not_zero(&tmp_neigh_node->refcount)) | |
1171 | continue; | |
1172 | ||
1173 | /* if we don't have a router yet | |
1174 | * or this one is better, choose it. */ | |
1175 | if ((!router) || | |
1176 | (tmp_neigh_node->tq_avg > router->tq_avg)) { | |
1177 | /* decrement refcount of | |
1178 | * previously selected router */ | |
1179 | if (router) | |
1180 | neigh_node_free_ref(router); | |
1181 | ||
1182 | router = tmp_neigh_node; | |
1183 | atomic_inc_not_zero(&router->refcount); | |
1184 | } | |
1185 | ||
1186 | neigh_node_free_ref(tmp_neigh_node); | |
1187 | } | |
1188 | ||
1189 | /* use the first candidate if nothing was found. */ | |
1190 | if (!router && first_candidate && | |
1191 | atomic_inc_not_zero(&first_candidate->refcount)) | |
1192 | router = first_candidate; | |
1193 | ||
1194 | rcu_read_unlock(); | |
1195 | return router; | |
1196 | } | |
1197 | ||
1198 | /* find a suitable router for this originator, and use | |
1199 | * bonding if possible. increases the found neighbors | |
1200 | * refcount.*/ | |
1201 | struct neigh_node *find_router(struct bat_priv *bat_priv, | |
1202 | struct orig_node *orig_node, | |
1203 | struct hard_iface *recv_if) | |
1204 | { | |
1205 | struct orig_node *primary_orig_node; | |
1206 | struct orig_node *router_orig; | |
1207 | struct neigh_node *router; | |
1208 | static uint8_t zero_mac[ETH_ALEN] = {0, 0, 0, 0, 0, 0}; | |
1209 | int bonding_enabled; | |
1210 | ||
1211 | if (!orig_node) | |
1212 | return NULL; | |
1213 | ||
1214 | router = orig_node_get_router(orig_node); | |
1215 | if (!router) | |
1216 | goto err; | |
1217 | ||
1218 | /* without bonding, the first node should | |
1219 | * always choose the default router. */ | |
1220 | bonding_enabled = atomic_read(&bat_priv->bonding); | |
1221 | ||
1222 | rcu_read_lock(); | |
1223 | /* select default router to output */ | |
1224 | router_orig = router->orig_node; | |
1225 | if (!router_orig) | |
1226 | goto err_unlock; | |
1227 | ||
1228 | if ((!recv_if) && (!bonding_enabled)) | |
1229 | goto return_router; | |
1230 | ||
1231 | /* if we have something in the primary_addr, we can search | |
1232 | * for a potential bonding candidate. */ | |
1233 | if (compare_eth(router_orig->primary_addr, zero_mac)) | |
1234 | goto return_router; | |
1235 | ||
1236 | /* find the orig_node which has the primary interface. might | |
1237 | * even be the same as our router_orig in many cases */ | |
1238 | ||
1239 | if (compare_eth(router_orig->primary_addr, router_orig->orig)) { | |
1240 | primary_orig_node = router_orig; | |
1241 | } else { | |
1242 | primary_orig_node = orig_hash_find(bat_priv, | |
1243 | router_orig->primary_addr); | |
1244 | if (!primary_orig_node) | |
1245 | goto return_router; | |
1246 | ||
1247 | orig_node_free_ref(primary_orig_node); | |
1248 | } | |
1249 | ||
1250 | /* with less than 2 candidates, we can't do any | |
1251 | * bonding and prefer the original router. */ | |
1252 | if (atomic_read(&primary_orig_node->bond_candidates) < 2) | |
1253 | goto return_router; | |
1254 | ||
1255 | /* all nodes between should choose a candidate which | |
1256 | * is is not on the interface where the packet came | |
1257 | * in. */ | |
1258 | ||
1259 | neigh_node_free_ref(router); | |
1260 | ||
1261 | if (bonding_enabled) | |
1262 | router = find_bond_router(primary_orig_node, recv_if); | |
1263 | else | |
1264 | router = find_ifalter_router(primary_orig_node, recv_if); | |
1265 | ||
1266 | return_router: | |
1267 | rcu_read_unlock(); | |
1268 | return router; | |
1269 | err_unlock: | |
1270 | rcu_read_unlock(); | |
1271 | err: | |
1272 | if (router) | |
1273 | neigh_node_free_ref(router); | |
1274 | return NULL; | |
1275 | } | |
1276 | ||
1277 | static int check_unicast_packet(struct sk_buff *skb, int hdr_size) | |
1278 | { | |
1279 | struct ethhdr *ethhdr; | |
1280 | ||
1281 | /* drop packet if it has not necessary minimum size */ | |
1282 | if (unlikely(!pskb_may_pull(skb, hdr_size))) | |
1283 | return -1; | |
1284 | ||
1285 | ethhdr = (struct ethhdr *)skb_mac_header(skb); | |
1286 | ||
1287 | /* packet with unicast indication but broadcast recipient */ | |
1288 | if (is_broadcast_ether_addr(ethhdr->h_dest)) | |
1289 | return -1; | |
1290 | ||
1291 | /* packet with broadcast sender address */ | |
1292 | if (is_broadcast_ether_addr(ethhdr->h_source)) | |
1293 | return -1; | |
1294 | ||
1295 | /* not for me */ | |
1296 | if (!is_my_mac(ethhdr->h_dest)) | |
1297 | return -1; | |
1298 | ||
1299 | return 0; | |
1300 | } | |
1301 | ||
1302 | int route_unicast_packet(struct sk_buff *skb, struct hard_iface *recv_if) | |
1303 | { | |
1304 | struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface); | |
1305 | struct orig_node *orig_node = NULL; | |
1306 | struct neigh_node *neigh_node = NULL; | |
1307 | struct unicast_packet *unicast_packet; | |
1308 | struct ethhdr *ethhdr = (struct ethhdr *)skb_mac_header(skb); | |
1309 | int ret = NET_RX_DROP; | |
1310 | struct sk_buff *new_skb; | |
1311 | ||
1312 | unicast_packet = (struct unicast_packet *)skb->data; | |
1313 | ||
1314 | /* TTL exceeded */ | |
1315 | if (unicast_packet->ttl < 2) { | |
1316 | pr_debug("Warning - can't forward unicast packet from %pM to " | |
1317 | "%pM: ttl exceeded\n", ethhdr->h_source, | |
1318 | unicast_packet->dest); | |
1319 | goto out; | |
1320 | } | |
1321 | ||
1322 | /* get routing information */ | |
1323 | orig_node = orig_hash_find(bat_priv, unicast_packet->dest); | |
1324 | ||
1325 | if (!orig_node) | |
1326 | goto out; | |
1327 | ||
1328 | /* find_router() increases neigh_nodes refcount if found. */ | |
1329 | neigh_node = find_router(bat_priv, orig_node, recv_if); | |
1330 | ||
1331 | if (!neigh_node) | |
1332 | goto out; | |
1333 | ||
1334 | /* create a copy of the skb, if needed, to modify it. */ | |
1335 | if (skb_cow(skb, sizeof(struct ethhdr)) < 0) | |
1336 | goto out; | |
1337 | ||
1338 | unicast_packet = (struct unicast_packet *)skb->data; | |
1339 | ||
1340 | if (unicast_packet->packet_type == BAT_UNICAST && | |
1341 | atomic_read(&bat_priv->fragmentation) && | |
1342 | skb->len > neigh_node->if_incoming->net_dev->mtu) { | |
1343 | ret = frag_send_skb(skb, bat_priv, | |
1344 | neigh_node->if_incoming, neigh_node->addr); | |
1345 | goto out; | |
1346 | } | |
1347 | ||
1348 | if (unicast_packet->packet_type == BAT_UNICAST_FRAG && | |
1349 | frag_can_reassemble(skb, neigh_node->if_incoming->net_dev->mtu)) { | |
1350 | ||
1351 | ret = frag_reassemble_skb(skb, bat_priv, &new_skb); | |
1352 | ||
1353 | if (ret == NET_RX_DROP) | |
1354 | goto out; | |
1355 | ||
1356 | /* packet was buffered for late merge */ | |
1357 | if (!new_skb) { | |
1358 | ret = NET_RX_SUCCESS; | |
1359 | goto out; | |
1360 | } | |
1361 | ||
1362 | skb = new_skb; | |
1363 | unicast_packet = (struct unicast_packet *)skb->data; | |
1364 | } | |
1365 | ||
1366 | /* decrement ttl */ | |
1367 | unicast_packet->ttl--; | |
1368 | ||
1369 | /* route it */ | |
1370 | send_skb_packet(skb, neigh_node->if_incoming, neigh_node->addr); | |
1371 | ret = NET_RX_SUCCESS; | |
1372 | ||
1373 | out: | |
1374 | if (neigh_node) | |
1375 | neigh_node_free_ref(neigh_node); | |
1376 | if (orig_node) | |
1377 | orig_node_free_ref(orig_node); | |
1378 | return ret; | |
1379 | } | |
1380 | ||
1381 | int recv_unicast_packet(struct sk_buff *skb, struct hard_iface *recv_if) | |
1382 | { | |
1383 | struct unicast_packet *unicast_packet; | |
1384 | int hdr_size = sizeof(struct unicast_packet); | |
1385 | ||
1386 | if (check_unicast_packet(skb, hdr_size) < 0) | |
1387 | return NET_RX_DROP; | |
1388 | ||
1389 | unicast_packet = (struct unicast_packet *)skb->data; | |
1390 | ||
1391 | /* packet for me */ | |
1392 | if (is_my_mac(unicast_packet->dest)) { | |
1393 | interface_rx(recv_if->soft_iface, skb, recv_if, hdr_size); | |
1394 | return NET_RX_SUCCESS; | |
1395 | } | |
1396 | ||
1397 | return route_unicast_packet(skb, recv_if); | |
1398 | } | |
1399 | ||
1400 | int recv_ucast_frag_packet(struct sk_buff *skb, struct hard_iface *recv_if) | |
1401 | { | |
1402 | struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface); | |
1403 | struct unicast_frag_packet *unicast_packet; | |
1404 | int hdr_size = sizeof(struct unicast_frag_packet); | |
1405 | struct sk_buff *new_skb = NULL; | |
1406 | int ret; | |
1407 | ||
1408 | if (check_unicast_packet(skb, hdr_size) < 0) | |
1409 | return NET_RX_DROP; | |
1410 | ||
1411 | unicast_packet = (struct unicast_frag_packet *)skb->data; | |
1412 | ||
1413 | /* packet for me */ | |
1414 | if (is_my_mac(unicast_packet->dest)) { | |
1415 | ||
1416 | ret = frag_reassemble_skb(skb, bat_priv, &new_skb); | |
1417 | ||
1418 | if (ret == NET_RX_DROP) | |
1419 | return NET_RX_DROP; | |
1420 | ||
1421 | /* packet was buffered for late merge */ | |
1422 | if (!new_skb) | |
1423 | return NET_RX_SUCCESS; | |
1424 | ||
1425 | interface_rx(recv_if->soft_iface, new_skb, recv_if, | |
1426 | sizeof(struct unicast_packet)); | |
1427 | return NET_RX_SUCCESS; | |
1428 | } | |
1429 | ||
1430 | return route_unicast_packet(skb, recv_if); | |
1431 | } | |
1432 | ||
1433 | ||
1434 | int recv_bcast_packet(struct sk_buff *skb, struct hard_iface *recv_if) | |
1435 | { | |
1436 | struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface); | |
1437 | struct orig_node *orig_node = NULL; | |
1438 | struct bcast_packet *bcast_packet; | |
1439 | struct ethhdr *ethhdr; | |
1440 | int hdr_size = sizeof(struct bcast_packet); | |
1441 | int ret = NET_RX_DROP; | |
1442 | int32_t seq_diff; | |
1443 | ||
1444 | /* drop packet if it has not necessary minimum size */ | |
1445 | if (unlikely(!pskb_may_pull(skb, hdr_size))) | |
1446 | goto out; | |
1447 | ||
1448 | ethhdr = (struct ethhdr *)skb_mac_header(skb); | |
1449 | ||
1450 | /* packet with broadcast indication but unicast recipient */ | |
1451 | if (!is_broadcast_ether_addr(ethhdr->h_dest)) | |
1452 | goto out; | |
1453 | ||
1454 | /* packet with broadcast sender address */ | |
1455 | if (is_broadcast_ether_addr(ethhdr->h_source)) | |
1456 | goto out; | |
1457 | ||
1458 | /* ignore broadcasts sent by myself */ | |
1459 | if (is_my_mac(ethhdr->h_source)) | |
1460 | goto out; | |
1461 | ||
1462 | bcast_packet = (struct bcast_packet *)skb->data; | |
1463 | ||
1464 | /* ignore broadcasts originated by myself */ | |
1465 | if (is_my_mac(bcast_packet->orig)) | |
1466 | goto out; | |
1467 | ||
1468 | if (bcast_packet->ttl < 2) | |
1469 | goto out; | |
1470 | ||
1471 | orig_node = orig_hash_find(bat_priv, bcast_packet->orig); | |
1472 | ||
1473 | if (!orig_node) | |
1474 | goto out; | |
1475 | ||
1476 | spin_lock_bh(&orig_node->bcast_seqno_lock); | |
1477 | ||
1478 | /* check whether the packet is a duplicate */ | |
1479 | if (get_bit_status(orig_node->bcast_bits, orig_node->last_bcast_seqno, | |
1480 | ntohl(bcast_packet->seqno))) | |
1481 | goto spin_unlock; | |
1482 | ||
1483 | seq_diff = ntohl(bcast_packet->seqno) - orig_node->last_bcast_seqno; | |
1484 | ||
1485 | /* check whether the packet is old and the host just restarted. */ | |
1486 | if (window_protected(bat_priv, seq_diff, | |
1487 | &orig_node->bcast_seqno_reset)) | |
1488 | goto spin_unlock; | |
1489 | ||
1490 | /* mark broadcast in flood history, update window position | |
1491 | * if required. */ | |
1492 | if (bit_get_packet(bat_priv, orig_node->bcast_bits, seq_diff, 1)) | |
1493 | orig_node->last_bcast_seqno = ntohl(bcast_packet->seqno); | |
1494 | ||
1495 | spin_unlock_bh(&orig_node->bcast_seqno_lock); | |
1496 | ||
1497 | /* rebroadcast packet */ | |
1498 | add_bcast_packet_to_list(bat_priv, skb); | |
1499 | ||
1500 | /* broadcast for me */ | |
1501 | interface_rx(recv_if->soft_iface, skb, recv_if, hdr_size); | |
1502 | ret = NET_RX_SUCCESS; | |
1503 | goto out; | |
1504 | ||
1505 | spin_unlock: | |
1506 | spin_unlock_bh(&orig_node->bcast_seqno_lock); | |
1507 | out: | |
1508 | if (orig_node) | |
1509 | orig_node_free_ref(orig_node); | |
1510 | return ret; | |
1511 | } | |
1512 | ||
1513 | int recv_vis_packet(struct sk_buff *skb, struct hard_iface *recv_if) | |
1514 | { | |
1515 | struct vis_packet *vis_packet; | |
1516 | struct ethhdr *ethhdr; | |
1517 | struct bat_priv *bat_priv = netdev_priv(recv_if->soft_iface); | |
1518 | int hdr_size = sizeof(struct vis_packet); | |
1519 | ||
1520 | /* keep skb linear */ | |
1521 | if (skb_linearize(skb) < 0) | |
1522 | return NET_RX_DROP; | |
1523 | ||
1524 | if (unlikely(!pskb_may_pull(skb, hdr_size))) | |
1525 | return NET_RX_DROP; | |
1526 | ||
1527 | vis_packet = (struct vis_packet *)skb->data; | |
1528 | ethhdr = (struct ethhdr *)skb_mac_header(skb); | |
1529 | ||
1530 | /* not for me */ | |
1531 | if (!is_my_mac(ethhdr->h_dest)) | |
1532 | return NET_RX_DROP; | |
1533 | ||
1534 | /* ignore own packets */ | |
1535 | if (is_my_mac(vis_packet->vis_orig)) | |
1536 | return NET_RX_DROP; | |
1537 | ||
1538 | if (is_my_mac(vis_packet->sender_orig)) | |
1539 | return NET_RX_DROP; | |
1540 | ||
1541 | switch (vis_packet->vis_type) { | |
1542 | case VIS_TYPE_SERVER_SYNC: | |
1543 | receive_server_sync_packet(bat_priv, vis_packet, | |
1544 | skb_headlen(skb)); | |
1545 | break; | |
1546 | ||
1547 | case VIS_TYPE_CLIENT_UPDATE: | |
1548 | receive_client_update_packet(bat_priv, vis_packet, | |
1549 | skb_headlen(skb)); | |
1550 | break; | |
1551 | ||
1552 | default: /* ignore unknown packet */ | |
1553 | break; | |
1554 | } | |
1555 | ||
1556 | /* We take a copy of the data in the packet, so we should | |
1557 | always free the skbuf. */ | |
1558 | return NET_RX_DROP; | |
1559 | } |