diff options
author | Sven Eckelmann <sven@narfation.org> | 2011-01-25 17:02:31 -0500 |
---|---|---|
committer | Sven Eckelmann <sven@narfation.org> | 2011-01-31 08:57:08 -0500 |
commit | ae361ce19fa135035c6b83ac1f07090b72fd4b8f (patch) | |
tree | 00410704b2dd5f0d7310f5cb9796385d7e8b7e91 /net/batman-adv/unicast.h | |
parent | 5c77d8bb8aeb4ec6804b6c32061109ba2ea6988d (diff) |
batman-adv: Calculate correct size for merged packets
The routing algorithm must be able to decide if a fragment can be merged with
the missing part and still be passed to a forwarding interface. The fragments
can only differ by one byte in case that the original payload had an uneven
length. In that situation the sender has to inform all possible receivers that
the tail is one byte longer using the flag UNI_FRAG_LARGETAIL.
The combination of UNI_FRAG_LARGETAIL and UNI_FRAG_HEAD flag makes it possible
to calculate the correct length for even and uneven sized payloads.
The original formula missed to add the unicast header at all and forgot to
remove the fragment header of the second fragment. This made the results highly
unreliable and only useful for machines with large differences between the
configured MTUs.
Reported-by: Russell Senior <russell@personaltelco.net>
Reported-by: Marek Lindner <lindner_marek@yahoo.de>
Signed-off-by: Sven Eckelmann <sven@narfation.org>
Diffstat (limited to 'net/batman-adv/unicast.h')
-rw-r--r-- | net/batman-adv/unicast.h | 23 |
1 files changed, 23 insertions, 0 deletions
diff --git a/net/batman-adv/unicast.h b/net/batman-adv/unicast.h index e32b7867a9a4..e7211c279201 100644 --- a/net/batman-adv/unicast.h +++ b/net/batman-adv/unicast.h | |||
@@ -22,6 +22,8 @@ | |||
22 | #ifndef _NET_BATMAN_ADV_UNICAST_H_ | 22 | #ifndef _NET_BATMAN_ADV_UNICAST_H_ |
23 | #define _NET_BATMAN_ADV_UNICAST_H_ | 23 | #define _NET_BATMAN_ADV_UNICAST_H_ |
24 | 24 | ||
25 | #include "packet.h" | ||
26 | |||
25 | #define FRAG_TIMEOUT 10000 /* purge frag list entrys after time in ms */ | 27 | #define FRAG_TIMEOUT 10000 /* purge frag list entrys after time in ms */ |
26 | #define FRAG_BUFFER_SIZE 6 /* number of list elements in buffer */ | 28 | #define FRAG_BUFFER_SIZE 6 /* number of list elements in buffer */ |
27 | 29 | ||
@@ -32,4 +34,25 @@ int unicast_send_skb(struct sk_buff *skb, struct bat_priv *bat_priv); | |||
32 | int frag_send_skb(struct sk_buff *skb, struct bat_priv *bat_priv, | 34 | int frag_send_skb(struct sk_buff *skb, struct bat_priv *bat_priv, |
33 | struct batman_if *batman_if, uint8_t dstaddr[]); | 35 | struct batman_if *batman_if, uint8_t dstaddr[]); |
34 | 36 | ||
37 | static inline int frag_can_reassemble(struct sk_buff *skb, int mtu) | ||
38 | { | ||
39 | struct unicast_frag_packet *unicast_packet; | ||
40 | int uneven_correction = 0; | ||
41 | unsigned int merged_size; | ||
42 | |||
43 | unicast_packet = (struct unicast_frag_packet *)skb->data; | ||
44 | |||
45 | if (unicast_packet->flags & UNI_FRAG_LARGETAIL) { | ||
46 | if (unicast_packet->flags & UNI_FRAG_HEAD) | ||
47 | uneven_correction = 1; | ||
48 | else | ||
49 | uneven_correction = -1; | ||
50 | } | ||
51 | |||
52 | merged_size = (skb->len - sizeof(struct unicast_frag_packet)) * 2; | ||
53 | merged_size += sizeof(struct unicast_packet) + uneven_correction; | ||
54 | |||
55 | return merged_size <= mtu; | ||
56 | } | ||
57 | |||
35 | #endif /* _NET_BATMAN_ADV_UNICAST_H_ */ | 58 | #endif /* _NET_BATMAN_ADV_UNICAST_H_ */ |