diff options
Diffstat (limited to 'net/batman-adv/routing.c')
-rw-r--r-- | net/batman-adv/routing.c | 669 |
1 files changed, 21 insertions, 648 deletions
diff --git a/net/batman-adv/routing.c b/net/batman-adv/routing.c index 0f32c818874d..f961cc5eade5 100644 --- a/net/batman-adv/routing.c +++ b/net/batman-adv/routing.c | |||
@@ -22,18 +22,14 @@ | |||
22 | #include "main.h" | 22 | #include "main.h" |
23 | #include "routing.h" | 23 | #include "routing.h" |
24 | #include "send.h" | 24 | #include "send.h" |
25 | #include "hash.h" | ||
26 | #include "soft-interface.h" | 25 | #include "soft-interface.h" |
27 | #include "hard-interface.h" | 26 | #include "hard-interface.h" |
28 | #include "icmp_socket.h" | 27 | #include "icmp_socket.h" |
29 | #include "translation-table.h" | 28 | #include "translation-table.h" |
30 | #include "originator.h" | 29 | #include "originator.h" |
31 | #include "ring_buffer.h" | ||
32 | #include "vis.h" | 30 | #include "vis.h" |
33 | #include "aggregation.h" | ||
34 | #include "gateway_common.h" | ||
35 | #include "gateway_client.h" | ||
36 | #include "unicast.h" | 31 | #include "unicast.h" |
32 | #include "bat_ogm.h" | ||
37 | 33 | ||
38 | void slide_own_bcast_window(struct hard_iface *hard_iface) | 34 | void slide_own_bcast_window(struct hard_iface *hard_iface) |
39 | { | 35 | { |
@@ -64,69 +60,9 @@ void slide_own_bcast_window(struct hard_iface *hard_iface) | |||
64 | } | 60 | } |
65 | } | 61 | } |
66 | 62 | ||
67 | static void update_transtable(struct bat_priv *bat_priv, | 63 | static void _update_route(struct bat_priv *bat_priv, |
68 | struct orig_node *orig_node, | 64 | struct orig_node *orig_node, |
69 | const unsigned char *tt_buff, | 65 | struct neigh_node *neigh_node) |
70 | uint8_t tt_num_changes, uint8_t ttvn, | ||
71 | uint16_t tt_crc) | ||
72 | { | ||
73 | uint8_t orig_ttvn = (uint8_t)atomic_read(&orig_node->last_ttvn); | ||
74 | bool full_table = true; | ||
75 | |||
76 | /* the ttvn increased by one -> we can apply the attached changes */ | ||
77 | if (ttvn - orig_ttvn == 1) { | ||
78 | /* the OGM could not contain the changes because they were too | ||
79 | * many to fit in one frame or because they have already been | ||
80 | * sent TT_OGM_APPEND_MAX times. In this case send a tt | ||
81 | * request */ | ||
82 | if (!tt_num_changes) { | ||
83 | full_table = false; | ||
84 | goto request_table; | ||
85 | } | ||
86 | |||
87 | tt_update_changes(bat_priv, orig_node, tt_num_changes, ttvn, | ||
88 | (struct tt_change *)tt_buff); | ||
89 | |||
90 | /* Even if we received the crc into the OGM, we prefer | ||
91 | * to recompute it to spot any possible inconsistency | ||
92 | * in the global table */ | ||
93 | orig_node->tt_crc = tt_global_crc(bat_priv, orig_node); | ||
94 | |||
95 | /* The ttvn alone is not enough to guarantee consistency | ||
96 | * because a single value could repesent different states | ||
97 | * (due to the wrap around). Thus a node has to check whether | ||
98 | * the resulting table (after applying the changes) is still | ||
99 | * consistent or not. E.g. a node could disconnect while its | ||
100 | * ttvn is X and reconnect on ttvn = X + TTVN_MAX: in this case | ||
101 | * checking the CRC value is mandatory to detect the | ||
102 | * inconsistency */ | ||
103 | if (orig_node->tt_crc != tt_crc) | ||
104 | goto request_table; | ||
105 | |||
106 | /* Roaming phase is over: tables are in sync again. I can | ||
107 | * unset the flag */ | ||
108 | orig_node->tt_poss_change = false; | ||
109 | } else { | ||
110 | /* if we missed more than one change or our tables are not | ||
111 | * in sync anymore -> request fresh tt data */ | ||
112 | if (ttvn != orig_ttvn || orig_node->tt_crc != tt_crc) { | ||
113 | request_table: | ||
114 | bat_dbg(DBG_TT, bat_priv, "TT inconsistency for %pM. " | ||
115 | "Need to retrieve the correct information " | ||
116 | "(ttvn: %u last_ttvn: %u crc: %u last_crc: " | ||
117 | "%u num_changes: %u)\n", orig_node->orig, ttvn, | ||
118 | orig_ttvn, tt_crc, orig_node->tt_crc, | ||
119 | tt_num_changes); | ||
120 | send_tt_request(bat_priv, orig_node, ttvn, tt_crc, | ||
121 | full_table); | ||
122 | return; | ||
123 | } | ||
124 | } | ||
125 | } | ||
126 | |||
127 | static void update_route(struct bat_priv *bat_priv, | ||
128 | struct orig_node *orig_node, | ||
129 | struct neigh_node *neigh_node) | ||
130 | { | 66 | { |
131 | struct neigh_node *curr_router; | 67 | struct neigh_node *curr_router; |
132 | 68 | ||
@@ -170,8 +106,8 @@ static void update_route(struct bat_priv *bat_priv, | |||
170 | neigh_node_free_ref(curr_router); | 106 | neigh_node_free_ref(curr_router); |
171 | } | 107 | } |
172 | 108 | ||
173 | void update_routes(struct bat_priv *bat_priv, struct orig_node *orig_node, | 109 | void update_route(struct bat_priv *bat_priv, struct orig_node *orig_node, |
174 | struct neigh_node *neigh_node) | 110 | struct neigh_node *neigh_node) |
175 | { | 111 | { |
176 | struct neigh_node *router = NULL; | 112 | struct neigh_node *router = NULL; |
177 | 113 | ||
@@ -181,116 +117,13 @@ void update_routes(struct bat_priv *bat_priv, struct orig_node *orig_node, | |||
181 | router = orig_node_get_router(orig_node); | 117 | router = orig_node_get_router(orig_node); |
182 | 118 | ||
183 | if (router != neigh_node) | 119 | if (router != neigh_node) |
184 | update_route(bat_priv, orig_node, neigh_node); | 120 | _update_route(bat_priv, orig_node, neigh_node); |
185 | 121 | ||
186 | out: | 122 | out: |
187 | if (router) | 123 | if (router) |
188 | neigh_node_free_ref(router); | 124 | neigh_node_free_ref(router); |
189 | } | 125 | } |
190 | 126 | ||
191 | static int is_bidirectional_neigh(struct orig_node *orig_node, | ||
192 | struct orig_node *orig_neigh_node, | ||
193 | struct batman_packet *batman_packet, | ||
194 | struct hard_iface *if_incoming) | ||
195 | { | ||
196 | struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface); | ||
197 | struct neigh_node *neigh_node = NULL, *tmp_neigh_node; | ||
198 | struct hlist_node *node; | ||
199 | uint8_t total_count; | ||
200 | uint8_t orig_eq_count, neigh_rq_count, tq_own; | ||
201 | int tq_asym_penalty, ret = 0; | ||
202 | |||
203 | /* find corresponding one hop neighbor */ | ||
204 | rcu_read_lock(); | ||
205 | hlist_for_each_entry_rcu(tmp_neigh_node, node, | ||
206 | &orig_neigh_node->neigh_list, list) { | ||
207 | |||
208 | if (!compare_eth(tmp_neigh_node->addr, orig_neigh_node->orig)) | ||
209 | continue; | ||
210 | |||
211 | if (tmp_neigh_node->if_incoming != if_incoming) | ||
212 | continue; | ||
213 | |||
214 | if (!atomic_inc_not_zero(&tmp_neigh_node->refcount)) | ||
215 | continue; | ||
216 | |||
217 | neigh_node = tmp_neigh_node; | ||
218 | break; | ||
219 | } | ||
220 | rcu_read_unlock(); | ||
221 | |||
222 | if (!neigh_node) | ||
223 | neigh_node = create_neighbor(orig_neigh_node, | ||
224 | orig_neigh_node, | ||
225 | orig_neigh_node->orig, | ||
226 | if_incoming); | ||
227 | |||
228 | if (!neigh_node) | ||
229 | goto out; | ||
230 | |||
231 | /* if orig_node is direct neighbour update neigh_node last_valid */ | ||
232 | if (orig_node == orig_neigh_node) | ||
233 | neigh_node->last_valid = jiffies; | ||
234 | |||
235 | orig_node->last_valid = jiffies; | ||
236 | |||
237 | /* find packet count of corresponding one hop neighbor */ | ||
238 | spin_lock_bh(&orig_node->ogm_cnt_lock); | ||
239 | orig_eq_count = orig_neigh_node->bcast_own_sum[if_incoming->if_num]; | ||
240 | neigh_rq_count = neigh_node->real_packet_count; | ||
241 | spin_unlock_bh(&orig_node->ogm_cnt_lock); | ||
242 | |||
243 | /* pay attention to not get a value bigger than 100 % */ | ||
244 | total_count = (orig_eq_count > neigh_rq_count ? | ||
245 | neigh_rq_count : orig_eq_count); | ||
246 | |||
247 | /* if we have too few packets (too less data) we set tq_own to zero */ | ||
248 | /* if we receive too few packets it is not considered bidirectional */ | ||
249 | if ((total_count < TQ_LOCAL_BIDRECT_SEND_MINIMUM) || | ||
250 | (neigh_rq_count < TQ_LOCAL_BIDRECT_RECV_MINIMUM)) | ||
251 | tq_own = 0; | ||
252 | else | ||
253 | /* neigh_node->real_packet_count is never zero as we | ||
254 | * only purge old information when getting new | ||
255 | * information */ | ||
256 | tq_own = (TQ_MAX_VALUE * total_count) / neigh_rq_count; | ||
257 | |||
258 | /* | ||
259 | * 1 - ((1-x) ** 3), normalized to TQ_MAX_VALUE this does | ||
260 | * affect the nearly-symmetric links only a little, but | ||
261 | * punishes asymmetric links more. This will give a value | ||
262 | * between 0 and TQ_MAX_VALUE | ||
263 | */ | ||
264 | tq_asym_penalty = TQ_MAX_VALUE - (TQ_MAX_VALUE * | ||
265 | (TQ_LOCAL_WINDOW_SIZE - neigh_rq_count) * | ||
266 | (TQ_LOCAL_WINDOW_SIZE - neigh_rq_count) * | ||
267 | (TQ_LOCAL_WINDOW_SIZE - neigh_rq_count)) / | ||
268 | (TQ_LOCAL_WINDOW_SIZE * | ||
269 | TQ_LOCAL_WINDOW_SIZE * | ||
270 | TQ_LOCAL_WINDOW_SIZE); | ||
271 | |||
272 | batman_packet->tq = ((batman_packet->tq * tq_own * tq_asym_penalty) / | ||
273 | (TQ_MAX_VALUE * TQ_MAX_VALUE)); | ||
274 | |||
275 | bat_dbg(DBG_BATMAN, bat_priv, | ||
276 | "bidirectional: " | ||
277 | "orig = %-15pM neigh = %-15pM => own_bcast = %2i, " | ||
278 | "real recv = %2i, local tq: %3i, asym_penalty: %3i, " | ||
279 | "total tq: %3i\n", | ||
280 | orig_node->orig, orig_neigh_node->orig, total_count, | ||
281 | neigh_rq_count, tq_own, tq_asym_penalty, batman_packet->tq); | ||
282 | |||
283 | /* if link has the minimum required transmission quality | ||
284 | * consider it bidirectional */ | ||
285 | if (batman_packet->tq >= TQ_TOTAL_BIDRECT_LIMIT) | ||
286 | ret = 1; | ||
287 | |||
288 | out: | ||
289 | if (neigh_node) | ||
290 | neigh_node_free_ref(neigh_node); | ||
291 | return ret; | ||
292 | } | ||
293 | |||
294 | /* caller must hold the neigh_list_lock */ | 127 | /* caller must hold the neigh_list_lock */ |
295 | void bonding_candidate_del(struct orig_node *orig_node, | 128 | void bonding_candidate_del(struct orig_node *orig_node, |
296 | struct neigh_node *neigh_node) | 129 | struct neigh_node *neigh_node) |
@@ -308,8 +141,8 @@ out: | |||
308 | return; | 141 | return; |
309 | } | 142 | } |
310 | 143 | ||
311 | static void bonding_candidate_add(struct orig_node *orig_node, | 144 | void bonding_candidate_add(struct orig_node *orig_node, |
312 | struct neigh_node *neigh_node) | 145 | struct neigh_node *neigh_node) |
313 | { | 146 | { |
314 | struct hlist_node *node; | 147 | struct hlist_node *node; |
315 | struct neigh_node *tmp_neigh_node, *router = NULL; | 148 | struct neigh_node *tmp_neigh_node, *router = NULL; |
@@ -379,162 +212,23 @@ out: | |||
379 | } | 212 | } |
380 | 213 | ||
381 | /* copy primary address for bonding */ | 214 | /* copy primary address for bonding */ |
382 | static void bonding_save_primary(const struct orig_node *orig_node, | 215 | void bonding_save_primary(const struct orig_node *orig_node, |
383 | struct orig_node *orig_neigh_node, | 216 | struct orig_node *orig_neigh_node, |
384 | const struct batman_packet *batman_packet) | 217 | const struct batman_ogm_packet *batman_ogm_packet) |
385 | { | 218 | { |
386 | if (!(batman_packet->flags & PRIMARIES_FIRST_HOP)) | 219 | if (!(batman_ogm_packet->flags & PRIMARIES_FIRST_HOP)) |
387 | return; | 220 | return; |
388 | 221 | ||
389 | memcpy(orig_neigh_node->primary_addr, orig_node->orig, ETH_ALEN); | 222 | memcpy(orig_neigh_node->primary_addr, orig_node->orig, ETH_ALEN); |
390 | } | 223 | } |
391 | 224 | ||
392 | static void update_orig(struct bat_priv *bat_priv, struct orig_node *orig_node, | ||
393 | const struct ethhdr *ethhdr, | ||
394 | const struct batman_packet *batman_packet, | ||
395 | struct hard_iface *if_incoming, | ||
396 | const unsigned char *tt_buff, int is_duplicate) | ||
397 | { | ||
398 | struct neigh_node *neigh_node = NULL, *tmp_neigh_node = NULL; | ||
399 | struct neigh_node *router = NULL; | ||
400 | struct orig_node *orig_node_tmp; | ||
401 | struct hlist_node *node; | ||
402 | uint8_t bcast_own_sum_orig, bcast_own_sum_neigh; | ||
403 | |||
404 | bat_dbg(DBG_BATMAN, bat_priv, "update_originator(): " | ||
405 | "Searching and updating originator entry of received packet\n"); | ||
406 | |||
407 | rcu_read_lock(); | ||
408 | hlist_for_each_entry_rcu(tmp_neigh_node, node, | ||
409 | &orig_node->neigh_list, list) { | ||
410 | if (compare_eth(tmp_neigh_node->addr, ethhdr->h_source) && | ||
411 | (tmp_neigh_node->if_incoming == if_incoming) && | ||
412 | atomic_inc_not_zero(&tmp_neigh_node->refcount)) { | ||
413 | if (neigh_node) | ||
414 | neigh_node_free_ref(neigh_node); | ||
415 | neigh_node = tmp_neigh_node; | ||
416 | continue; | ||
417 | } | ||
418 | |||
419 | if (is_duplicate) | ||
420 | continue; | ||
421 | |||
422 | spin_lock_bh(&tmp_neigh_node->tq_lock); | ||
423 | ring_buffer_set(tmp_neigh_node->tq_recv, | ||
424 | &tmp_neigh_node->tq_index, 0); | ||
425 | tmp_neigh_node->tq_avg = | ||
426 | ring_buffer_avg(tmp_neigh_node->tq_recv); | ||
427 | spin_unlock_bh(&tmp_neigh_node->tq_lock); | ||
428 | } | ||
429 | |||
430 | if (!neigh_node) { | ||
431 | struct orig_node *orig_tmp; | ||
432 | |||
433 | orig_tmp = get_orig_node(bat_priv, ethhdr->h_source); | ||
434 | if (!orig_tmp) | ||
435 | goto unlock; | ||
436 | |||
437 | neigh_node = create_neighbor(orig_node, orig_tmp, | ||
438 | ethhdr->h_source, if_incoming); | ||
439 | |||
440 | orig_node_free_ref(orig_tmp); | ||
441 | if (!neigh_node) | ||
442 | goto unlock; | ||
443 | } else | ||
444 | bat_dbg(DBG_BATMAN, bat_priv, | ||
445 | "Updating existing last-hop neighbor of originator\n"); | ||
446 | |||
447 | rcu_read_unlock(); | ||
448 | |||
449 | orig_node->flags = batman_packet->flags; | ||
450 | neigh_node->last_valid = jiffies; | ||
451 | |||
452 | spin_lock_bh(&neigh_node->tq_lock); | ||
453 | ring_buffer_set(neigh_node->tq_recv, | ||
454 | &neigh_node->tq_index, | ||
455 | batman_packet->tq); | ||
456 | neigh_node->tq_avg = ring_buffer_avg(neigh_node->tq_recv); | ||
457 | spin_unlock_bh(&neigh_node->tq_lock); | ||
458 | |||
459 | if (!is_duplicate) { | ||
460 | orig_node->last_ttl = batman_packet->ttl; | ||
461 | neigh_node->last_ttl = batman_packet->ttl; | ||
462 | } | ||
463 | |||
464 | bonding_candidate_add(orig_node, neigh_node); | ||
465 | |||
466 | /* if this neighbor already is our next hop there is nothing | ||
467 | * to change */ | ||
468 | router = orig_node_get_router(orig_node); | ||
469 | if (router == neigh_node) | ||
470 | goto update_tt; | ||
471 | |||
472 | /* if this neighbor does not offer a better TQ we won't consider it */ | ||
473 | if (router && (router->tq_avg > neigh_node->tq_avg)) | ||
474 | goto update_tt; | ||
475 | |||
476 | /* if the TQ is the same and the link not more symetric we | ||
477 | * won't consider it either */ | ||
478 | if (router && (neigh_node->tq_avg == router->tq_avg)) { | ||
479 | orig_node_tmp = router->orig_node; | ||
480 | spin_lock_bh(&orig_node_tmp->ogm_cnt_lock); | ||
481 | bcast_own_sum_orig = | ||
482 | orig_node_tmp->bcast_own_sum[if_incoming->if_num]; | ||
483 | spin_unlock_bh(&orig_node_tmp->ogm_cnt_lock); | ||
484 | |||
485 | orig_node_tmp = neigh_node->orig_node; | ||
486 | spin_lock_bh(&orig_node_tmp->ogm_cnt_lock); | ||
487 | bcast_own_sum_neigh = | ||
488 | orig_node_tmp->bcast_own_sum[if_incoming->if_num]; | ||
489 | spin_unlock_bh(&orig_node_tmp->ogm_cnt_lock); | ||
490 | |||
491 | if (bcast_own_sum_orig >= bcast_own_sum_neigh) | ||
492 | goto update_tt; | ||
493 | } | ||
494 | |||
495 | update_routes(bat_priv, orig_node, neigh_node); | ||
496 | |||
497 | update_tt: | ||
498 | /* I have to check for transtable changes only if the OGM has been | ||
499 | * sent through a primary interface */ | ||
500 | if (((batman_packet->orig != ethhdr->h_source) && | ||
501 | (batman_packet->ttl > 2)) || | ||
502 | (batman_packet->flags & PRIMARIES_FIRST_HOP)) | ||
503 | update_transtable(bat_priv, orig_node, tt_buff, | ||
504 | batman_packet->tt_num_changes, | ||
505 | batman_packet->ttvn, | ||
506 | batman_packet->tt_crc); | ||
507 | |||
508 | if (orig_node->gw_flags != batman_packet->gw_flags) | ||
509 | gw_node_update(bat_priv, orig_node, batman_packet->gw_flags); | ||
510 | |||
511 | orig_node->gw_flags = batman_packet->gw_flags; | ||
512 | |||
513 | /* restart gateway selection if fast or late switching was enabled */ | ||
514 | if ((orig_node->gw_flags) && | ||
515 | (atomic_read(&bat_priv->gw_mode) == GW_MODE_CLIENT) && | ||
516 | (atomic_read(&bat_priv->gw_sel_class) > 2)) | ||
517 | gw_check_election(bat_priv, orig_node); | ||
518 | |||
519 | goto out; | ||
520 | |||
521 | unlock: | ||
522 | rcu_read_unlock(); | ||
523 | out: | ||
524 | if (neigh_node) | ||
525 | neigh_node_free_ref(neigh_node); | ||
526 | if (router) | ||
527 | neigh_node_free_ref(router); | ||
528 | } | ||
529 | |||
530 | /* checks whether the host restarted and is in the protection time. | 225 | /* checks whether the host restarted and is in the protection time. |
531 | * returns: | 226 | * returns: |
532 | * 0 if the packet is to be accepted | 227 | * 0 if the packet is to be accepted |
533 | * 1 if the packet is to be ignored. | 228 | * 1 if the packet is to be ignored. |
534 | */ | 229 | */ |
535 | static int window_protected(struct bat_priv *bat_priv, | 230 | int window_protected(struct bat_priv *bat_priv, int32_t seq_num_diff, |
536 | int32_t seq_num_diff, | 231 | unsigned long *last_reset) |
537 | unsigned long *last_reset) | ||
538 | { | 232 | { |
539 | if ((seq_num_diff <= -TQ_LOCAL_WINDOW_SIZE) | 233 | if ((seq_num_diff <= -TQ_LOCAL_WINDOW_SIZE) |
540 | || (seq_num_diff >= EXPECTED_SEQNO_RANGE)) { | 234 | || (seq_num_diff >= EXPECTED_SEQNO_RANGE)) { |
@@ -552,330 +246,12 @@ static int window_protected(struct bat_priv *bat_priv, | |||
552 | return 0; | 246 | return 0; |
553 | } | 247 | } |
554 | 248 | ||
555 | /* processes a batman packet for all interfaces, adjusts the sequence number and | 249 | int recv_bat_ogm_packet(struct sk_buff *skb, struct hard_iface *hard_iface) |
556 | * finds out whether it is a duplicate. | ||
557 | * returns: | ||
558 | * 1 the packet is a duplicate | ||
559 | * 0 the packet has not yet been received | ||
560 | * -1 the packet is old and has been received while the seqno window | ||
561 | * was protected. Caller should drop it. | ||
562 | */ | ||
563 | static int count_real_packets(const struct ethhdr *ethhdr, | ||
564 | const struct batman_packet *batman_packet, | ||
565 | const struct hard_iface *if_incoming) | ||
566 | { | ||
567 | struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface); | ||
568 | struct orig_node *orig_node; | ||
569 | struct neigh_node *tmp_neigh_node; | ||
570 | struct hlist_node *node; | ||
571 | int is_duplicate = 0; | ||
572 | int32_t seq_diff; | ||
573 | int need_update = 0; | ||
574 | int set_mark, ret = -1; | ||
575 | |||
576 | orig_node = get_orig_node(bat_priv, batman_packet->orig); | ||
577 | if (!orig_node) | ||
578 | return 0; | ||
579 | |||
580 | spin_lock_bh(&orig_node->ogm_cnt_lock); | ||
581 | seq_diff = batman_packet->seqno - orig_node->last_real_seqno; | ||
582 | |||
583 | /* signalize caller that the packet is to be dropped. */ | ||
584 | if (window_protected(bat_priv, seq_diff, | ||
585 | &orig_node->batman_seqno_reset)) | ||
586 | goto out; | ||
587 | |||
588 | rcu_read_lock(); | ||
589 | hlist_for_each_entry_rcu(tmp_neigh_node, node, | ||
590 | &orig_node->neigh_list, list) { | ||
591 | |||
592 | is_duplicate |= get_bit_status(tmp_neigh_node->real_bits, | ||
593 | orig_node->last_real_seqno, | ||
594 | batman_packet->seqno); | ||
595 | |||
596 | if (compare_eth(tmp_neigh_node->addr, ethhdr->h_source) && | ||
597 | (tmp_neigh_node->if_incoming == if_incoming)) | ||
598 | set_mark = 1; | ||
599 | else | ||
600 | set_mark = 0; | ||
601 | |||
602 | /* if the window moved, set the update flag. */ | ||
603 | need_update |= bit_get_packet(bat_priv, | ||
604 | tmp_neigh_node->real_bits, | ||
605 | seq_diff, set_mark); | ||
606 | |||
607 | tmp_neigh_node->real_packet_count = | ||
608 | bit_packet_count(tmp_neigh_node->real_bits); | ||
609 | } | ||
610 | rcu_read_unlock(); | ||
611 | |||
612 | if (need_update) { | ||
613 | bat_dbg(DBG_BATMAN, bat_priv, | ||
614 | "updating last_seqno: old %d, new %d\n", | ||
615 | orig_node->last_real_seqno, batman_packet->seqno); | ||
616 | orig_node->last_real_seqno = batman_packet->seqno; | ||
617 | } | ||
618 | |||
619 | ret = is_duplicate; | ||
620 | |||
621 | out: | ||
622 | spin_unlock_bh(&orig_node->ogm_cnt_lock); | ||
623 | orig_node_free_ref(orig_node); | ||
624 | return ret; | ||
625 | } | ||
626 | |||
627 | void receive_bat_packet(const struct ethhdr *ethhdr, | ||
628 | struct batman_packet *batman_packet, | ||
629 | const unsigned char *tt_buff, | ||
630 | struct hard_iface *if_incoming) | ||
631 | { | ||
632 | struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface); | ||
633 | struct hard_iface *hard_iface; | ||
634 | struct orig_node *orig_neigh_node, *orig_node; | ||
635 | struct neigh_node *router = NULL, *router_router = NULL; | ||
636 | struct neigh_node *orig_neigh_router = NULL; | ||
637 | int has_directlink_flag; | ||
638 | int is_my_addr = 0, is_my_orig = 0, is_my_oldorig = 0; | ||
639 | int is_broadcast = 0, is_bidirectional, is_single_hop_neigh; | ||
640 | int is_duplicate; | ||
641 | uint32_t if_incoming_seqno; | ||
642 | |||
643 | /* Silently drop when the batman packet is actually not a | ||
644 | * correct packet. | ||
645 | * | ||
646 | * This might happen if a packet is padded (e.g. Ethernet has a | ||
647 | * minimum frame length of 64 byte) and the aggregation interprets | ||
648 | * it as an additional length. | ||
649 | * | ||
650 | * TODO: A more sane solution would be to have a bit in the | ||
651 | * batman_packet to detect whether the packet is the last | ||
652 | * packet in an aggregation. Here we expect that the padding | ||
653 | * is always zero (or not 0x01) | ||
654 | */ | ||
655 | if (batman_packet->packet_type != BAT_PACKET) | ||
656 | return; | ||
657 | |||
658 | /* could be changed by schedule_own_packet() */ | ||
659 | if_incoming_seqno = atomic_read(&if_incoming->seqno); | ||
660 | |||
661 | has_directlink_flag = (batman_packet->flags & DIRECTLINK ? 1 : 0); | ||
662 | |||
663 | is_single_hop_neigh = (compare_eth(ethhdr->h_source, | ||
664 | batman_packet->orig) ? 1 : 0); | ||
665 | |||
666 | bat_dbg(DBG_BATMAN, bat_priv, | ||
667 | "Received BATMAN packet via NB: %pM, IF: %s [%pM] " | ||
668 | "(from OG: %pM, via prev OG: %pM, seqno %d, ttvn %u, " | ||
669 | "crc %u, changes %u, td %d, TTL %d, V %d, IDF %d)\n", | ||
670 | ethhdr->h_source, if_incoming->net_dev->name, | ||
671 | if_incoming->net_dev->dev_addr, batman_packet->orig, | ||
672 | batman_packet->prev_sender, batman_packet->seqno, | ||
673 | batman_packet->ttvn, batman_packet->tt_crc, | ||
674 | batman_packet->tt_num_changes, batman_packet->tq, | ||
675 | batman_packet->ttl, batman_packet->version, | ||
676 | has_directlink_flag); | ||
677 | |||
678 | rcu_read_lock(); | ||
679 | list_for_each_entry_rcu(hard_iface, &hardif_list, list) { | ||
680 | if (hard_iface->if_status != IF_ACTIVE) | ||
681 | continue; | ||
682 | |||
683 | if (hard_iface->soft_iface != if_incoming->soft_iface) | ||
684 | continue; | ||
685 | |||
686 | if (compare_eth(ethhdr->h_source, | ||
687 | hard_iface->net_dev->dev_addr)) | ||
688 | is_my_addr = 1; | ||
689 | |||
690 | if (compare_eth(batman_packet->orig, | ||
691 | hard_iface->net_dev->dev_addr)) | ||
692 | is_my_orig = 1; | ||
693 | |||
694 | if (compare_eth(batman_packet->prev_sender, | ||
695 | hard_iface->net_dev->dev_addr)) | ||
696 | is_my_oldorig = 1; | ||
697 | |||
698 | if (is_broadcast_ether_addr(ethhdr->h_source)) | ||
699 | is_broadcast = 1; | ||
700 | } | ||
701 | rcu_read_unlock(); | ||
702 | |||
703 | if (batman_packet->version != COMPAT_VERSION) { | ||
704 | bat_dbg(DBG_BATMAN, bat_priv, | ||
705 | "Drop packet: incompatible batman version (%i)\n", | ||
706 | batman_packet->version); | ||
707 | return; | ||
708 | } | ||
709 | |||
710 | if (is_my_addr) { | ||
711 | bat_dbg(DBG_BATMAN, bat_priv, | ||
712 | "Drop packet: received my own broadcast (sender: %pM" | ||
713 | ")\n", | ||
714 | ethhdr->h_source); | ||
715 | return; | ||
716 | } | ||
717 | |||
718 | if (is_broadcast) { | ||
719 | bat_dbg(DBG_BATMAN, bat_priv, "Drop packet: " | ||
720 | "ignoring all packets with broadcast source addr (sender: %pM" | ||
721 | ")\n", ethhdr->h_source); | ||
722 | return; | ||
723 | } | ||
724 | |||
725 | if (is_my_orig) { | ||
726 | unsigned long *word; | ||
727 | int offset; | ||
728 | |||
729 | orig_neigh_node = get_orig_node(bat_priv, ethhdr->h_source); | ||
730 | if (!orig_neigh_node) | ||
731 | return; | ||
732 | |||
733 | /* neighbor has to indicate direct link and it has to | ||
734 | * come via the corresponding interface */ | ||
735 | /* save packet seqno for bidirectional check */ | ||
736 | if (has_directlink_flag && | ||
737 | compare_eth(if_incoming->net_dev->dev_addr, | ||
738 | batman_packet->orig)) { | ||
739 | offset = if_incoming->if_num * NUM_WORDS; | ||
740 | |||
741 | spin_lock_bh(&orig_neigh_node->ogm_cnt_lock); | ||
742 | word = &(orig_neigh_node->bcast_own[offset]); | ||
743 | bit_mark(word, | ||
744 | if_incoming_seqno - batman_packet->seqno - 2); | ||
745 | orig_neigh_node->bcast_own_sum[if_incoming->if_num] = | ||
746 | bit_packet_count(word); | ||
747 | spin_unlock_bh(&orig_neigh_node->ogm_cnt_lock); | ||
748 | } | ||
749 | |||
750 | bat_dbg(DBG_BATMAN, bat_priv, "Drop packet: " | ||
751 | "originator packet from myself (via neighbor)\n"); | ||
752 | orig_node_free_ref(orig_neigh_node); | ||
753 | return; | ||
754 | } | ||
755 | |||
756 | if (is_my_oldorig) { | ||
757 | bat_dbg(DBG_BATMAN, bat_priv, | ||
758 | "Drop packet: ignoring all rebroadcast echos (sender: " | ||
759 | "%pM)\n", ethhdr->h_source); | ||
760 | return; | ||
761 | } | ||
762 | |||
763 | orig_node = get_orig_node(bat_priv, batman_packet->orig); | ||
764 | if (!orig_node) | ||
765 | return; | ||
766 | |||
767 | is_duplicate = count_real_packets(ethhdr, batman_packet, if_incoming); | ||
768 | |||
769 | if (is_duplicate == -1) { | ||
770 | bat_dbg(DBG_BATMAN, bat_priv, | ||
771 | "Drop packet: packet within seqno protection time " | ||
772 | "(sender: %pM)\n", ethhdr->h_source); | ||
773 | goto out; | ||
774 | } | ||
775 | |||
776 | if (batman_packet->tq == 0) { | ||
777 | bat_dbg(DBG_BATMAN, bat_priv, | ||
778 | "Drop packet: originator packet with tq equal 0\n"); | ||
779 | goto out; | ||
780 | } | ||
781 | |||
782 | router = orig_node_get_router(orig_node); | ||
783 | if (router) | ||
784 | router_router = orig_node_get_router(router->orig_node); | ||
785 | |||
786 | /* avoid temporary routing loops */ | ||
787 | if (router && router_router && | ||
788 | (compare_eth(router->addr, batman_packet->prev_sender)) && | ||
789 | !(compare_eth(batman_packet->orig, batman_packet->prev_sender)) && | ||
790 | (compare_eth(router->addr, router_router->addr))) { | ||
791 | bat_dbg(DBG_BATMAN, bat_priv, | ||
792 | "Drop packet: ignoring all rebroadcast packets that " | ||
793 | "may make me loop (sender: %pM)\n", ethhdr->h_source); | ||
794 | goto out; | ||
795 | } | ||
796 | |||
797 | /* if sender is a direct neighbor the sender mac equals | ||
798 | * originator mac */ | ||
799 | orig_neigh_node = (is_single_hop_neigh ? | ||
800 | orig_node : | ||
801 | get_orig_node(bat_priv, ethhdr->h_source)); | ||
802 | if (!orig_neigh_node) | ||
803 | goto out; | ||
804 | |||
805 | orig_neigh_router = orig_node_get_router(orig_neigh_node); | ||
806 | |||
807 | /* drop packet if sender is not a direct neighbor and if we | ||
808 | * don't route towards it */ | ||
809 | if (!is_single_hop_neigh && (!orig_neigh_router)) { | ||
810 | bat_dbg(DBG_BATMAN, bat_priv, | ||
811 | "Drop packet: OGM via unknown neighbor!\n"); | ||
812 | goto out_neigh; | ||
813 | } | ||
814 | |||
815 | is_bidirectional = is_bidirectional_neigh(orig_node, orig_neigh_node, | ||
816 | batman_packet, if_incoming); | ||
817 | |||
818 | bonding_save_primary(orig_node, orig_neigh_node, batman_packet); | ||
819 | |||
820 | /* update ranking if it is not a duplicate or has the same | ||
821 | * seqno and similar ttl as the non-duplicate */ | ||
822 | if (is_bidirectional && | ||
823 | (!is_duplicate || | ||
824 | ((orig_node->last_real_seqno == batman_packet->seqno) && | ||
825 | (orig_node->last_ttl - 3 <= batman_packet->ttl)))) | ||
826 | update_orig(bat_priv, orig_node, ethhdr, batman_packet, | ||
827 | if_incoming, tt_buff, is_duplicate); | ||
828 | |||
829 | /* is single hop (direct) neighbor */ | ||
830 | if (is_single_hop_neigh) { | ||
831 | |||
832 | /* mark direct link on incoming interface */ | ||
833 | schedule_forward_packet(orig_node, ethhdr, batman_packet, | ||
834 | 1, if_incoming); | ||
835 | |||
836 | bat_dbg(DBG_BATMAN, bat_priv, "Forwarding packet: " | ||
837 | "rebroadcast neighbor packet with direct link flag\n"); | ||
838 | goto out_neigh; | ||
839 | } | ||
840 | |||
841 | /* multihop originator */ | ||
842 | if (!is_bidirectional) { | ||
843 | bat_dbg(DBG_BATMAN, bat_priv, | ||
844 | "Drop packet: not received via bidirectional link\n"); | ||
845 | goto out_neigh; | ||
846 | } | ||
847 | |||
848 | if (is_duplicate) { | ||
849 | bat_dbg(DBG_BATMAN, bat_priv, | ||
850 | "Drop packet: duplicate packet received\n"); | ||
851 | goto out_neigh; | ||
852 | } | ||
853 | |||
854 | bat_dbg(DBG_BATMAN, bat_priv, | ||
855 | "Forwarding packet: rebroadcast originator packet\n"); | ||
856 | schedule_forward_packet(orig_node, ethhdr, batman_packet, | ||
857 | 0, if_incoming); | ||
858 | |||
859 | out_neigh: | ||
860 | if ((orig_neigh_node) && (!is_single_hop_neigh)) | ||
861 | orig_node_free_ref(orig_neigh_node); | ||
862 | out: | ||
863 | if (router) | ||
864 | neigh_node_free_ref(router); | ||
865 | if (router_router) | ||
866 | neigh_node_free_ref(router_router); | ||
867 | if (orig_neigh_router) | ||
868 | neigh_node_free_ref(orig_neigh_router); | ||
869 | |||
870 | orig_node_free_ref(orig_node); | ||
871 | } | ||
872 | |||
873 | int recv_bat_packet(struct sk_buff *skb, struct hard_iface *hard_iface) | ||
874 | { | 250 | { |
875 | struct ethhdr *ethhdr; | 251 | struct ethhdr *ethhdr; |
876 | 252 | ||
877 | /* drop packet if it has not necessary minimum size */ | 253 | /* drop packet if it has not necessary minimum size */ |
878 | if (unlikely(!pskb_may_pull(skb, sizeof(struct batman_packet)))) | 254 | if (unlikely(!pskb_may_pull(skb, BATMAN_OGM_LEN))) |
879 | return NET_RX_DROP; | 255 | return NET_RX_DROP; |
880 | 256 | ||
881 | ethhdr = (struct ethhdr *)skb_mac_header(skb); | 257 | ethhdr = (struct ethhdr *)skb_mac_header(skb); |
@@ -898,10 +274,7 @@ int recv_bat_packet(struct sk_buff *skb, struct hard_iface *hard_iface) | |||
898 | 274 | ||
899 | ethhdr = (struct ethhdr *)skb_mac_header(skb); | 275 | ethhdr = (struct ethhdr *)skb_mac_header(skb); |
900 | 276 | ||
901 | receive_aggr_bat_packet(ethhdr, | 277 | bat_ogm_receive(ethhdr, skb->data, skb_headlen(skb), hard_iface); |
902 | skb->data, | ||
903 | skb_headlen(skb), | ||
904 | hard_iface); | ||
905 | 278 | ||
906 | kfree_skb(skb); | 279 | kfree_skb(skb); |
907 | return NET_RX_SUCCESS; | 280 | return NET_RX_SUCCESS; |
@@ -1243,7 +616,7 @@ int recv_tt_query(struct sk_buff *skb, struct hard_iface *recv_if) | |||
1243 | } | 616 | } |
1244 | break; | 617 | break; |
1245 | case TT_RESPONSE: | 618 | case TT_RESPONSE: |
1246 | /* packet needs to be linearised to access the TT changes */ | 619 | /* packet needs to be linearized to access the TT changes */ |
1247 | if (skb_linearize(skb) < 0) | 620 | if (skb_linearize(skb) < 0) |
1248 | goto out; | 621 | goto out; |
1249 | 622 | ||
@@ -1300,7 +673,7 @@ int recv_roam_adv(struct sk_buff *skb, struct hard_iface *recv_if) | |||
1300 | roam_adv_packet->client); | 673 | roam_adv_packet->client); |
1301 | 674 | ||
1302 | tt_global_add(bat_priv, orig_node, roam_adv_packet->client, | 675 | tt_global_add(bat_priv, orig_node, roam_adv_packet->client, |
1303 | atomic_read(&orig_node->last_ttvn) + 1, true); | 676 | atomic_read(&orig_node->last_ttvn) + 1, true, false); |
1304 | 677 | ||
1305 | /* Roaming phase starts: I have new information but the ttvn has not | 678 | /* Roaming phase starts: I have new information but the ttvn has not |
1306 | * been incremented yet. This flag will make me check all the incoming | 679 | * been incremented yet. This flag will make me check all the incoming |
@@ -1536,7 +909,7 @@ static int check_unicast_ttvn(struct bat_priv *bat_priv, | |||
1536 | 909 | ||
1537 | ethhdr = (struct ethhdr *)(skb->data + | 910 | ethhdr = (struct ethhdr *)(skb->data + |
1538 | sizeof(struct unicast_packet)); | 911 | sizeof(struct unicast_packet)); |
1539 | orig_node = transtable_search(bat_priv, ethhdr->h_dest); | 912 | orig_node = transtable_search(bat_priv, NULL, ethhdr->h_dest); |
1540 | 913 | ||
1541 | if (!orig_node) { | 914 | if (!orig_node) { |
1542 | if (!is_my_client(bat_priv, ethhdr->h_dest)) | 915 | if (!is_my_client(bat_priv, ethhdr->h_dest)) |