Donatien Garnier
ZG2100 Network interface source
lwip/core/ipv4/ip_frag.c@0:b802fc31f1db, 2010-07-09 (annotated)
- Committer:
- donatien
- Date:
- Fri Jul 09 15:37:23 2010 +0000
- Revision:
- 0:b802fc31f1db
- Child:
- 1:3a7c15057192
Who changed what in which revision?
| User | Revision | Line number | New contents of line |
|---|---|---|---|
| donatien | 0:b802fc31f1db | 1 | /** |
| donatien | 0:b802fc31f1db | 2 | * @file |
| donatien | 0:b802fc31f1db | 3 | * This is the IPv4 packet segmentation and reassembly implementation. |
| donatien | 0:b802fc31f1db | 4 | * |
| donatien | 0:b802fc31f1db | 5 | */ |
| donatien | 0:b802fc31f1db | 6 | |
| donatien | 0:b802fc31f1db | 7 | /* |
| donatien | 0:b802fc31f1db | 8 | * Copyright (c) 2001-2004 Swedish Institute of Computer Science. |
| donatien | 0:b802fc31f1db | 9 | * All rights reserved. |
| donatien | 0:b802fc31f1db | 10 | * |
| donatien | 0:b802fc31f1db | 11 | * Redistribution and use in source and binary forms, with or without modification, |
| donatien | 0:b802fc31f1db | 12 | * are permitted provided that the following conditions are met: |
| donatien | 0:b802fc31f1db | 13 | * |
| donatien | 0:b802fc31f1db | 14 | * 1. Redistributions of source code must retain the above copyright notice, |
| donatien | 0:b802fc31f1db | 15 | * this list of conditions and the following disclaimer. |
| donatien | 0:b802fc31f1db | 16 | * 2. Redistributions in binary form must reproduce the above copyright notice, |
| donatien | 0:b802fc31f1db | 17 | * this list of conditions and the following disclaimer in the documentation |
| donatien | 0:b802fc31f1db | 18 | * and/or other materials provided with the distribution. |
| donatien | 0:b802fc31f1db | 19 | * 3. The name of the author may not be used to endorse or promote products |
| donatien | 0:b802fc31f1db | 20 | * derived from this software without specific prior written permission. |
| donatien | 0:b802fc31f1db | 21 | * |
| donatien | 0:b802fc31f1db | 22 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
| donatien | 0:b802fc31f1db | 23 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF |
| donatien | 0:b802fc31f1db | 24 | * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT |
| donatien | 0:b802fc31f1db | 25 | * SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
| donatien | 0:b802fc31f1db | 26 | * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT |
| donatien | 0:b802fc31f1db | 27 | * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| donatien | 0:b802fc31f1db | 28 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| donatien | 0:b802fc31f1db | 29 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
| donatien | 0:b802fc31f1db | 30 | * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY |
| donatien | 0:b802fc31f1db | 31 | * OF SUCH DAMAGE. |
| donatien | 0:b802fc31f1db | 32 | * |
| donatien | 0:b802fc31f1db | 33 | * This file is part of the lwIP TCP/IP stack. |
| donatien | 0:b802fc31f1db | 34 | * |
| donatien | 0:b802fc31f1db | 35 | * Author: Jani Monoses <jani@iv.ro> |
| donatien | 0:b802fc31f1db | 36 | * Simon Goldschmidt |
| donatien | 0:b802fc31f1db | 37 | * original reassembly code by Adam Dunkels <adam@sics.se> |
| donatien | 0:b802fc31f1db | 38 | * |
| donatien | 0:b802fc31f1db | 39 | */ |
| donatien | 0:b802fc31f1db | 40 | |
| donatien | 0:b802fc31f1db | 41 | #include "lwip/opt.h" |
| donatien | 0:b802fc31f1db | 42 | #include "lwip/ip_frag.h" |
| donatien | 0:b802fc31f1db | 43 | #include "lwip/def.h" |
| donatien | 0:b802fc31f1db | 44 | #include "lwip/inet_chksum.h" |
| donatien | 0:b802fc31f1db | 45 | #include "lwip/netif.h" |
| donatien | 0:b802fc31f1db | 46 | #include "lwip/snmp.h" |
| donatien | 0:b802fc31f1db | 47 | #include "lwip/stats.h" |
| donatien | 0:b802fc31f1db | 48 | #include "lwip/icmp.h" |
| donatien | 0:b802fc31f1db | 49 | |
| donatien | 0:b802fc31f1db | 50 | #include <string.h> |
| donatien | 0:b802fc31f1db | 51 | |
| donatien | 0:b802fc31f1db | 52 | #if IP_REASSEMBLY |
| donatien | 0:b802fc31f1db | 53 | /** |
| donatien | 0:b802fc31f1db | 54 | * The IP reassembly code currently has the following limitations: |
| donatien | 0:b802fc31f1db | 55 | * - IP header options are not supported |
| donatien | 0:b802fc31f1db | 56 | * - fragments must not overlap (e.g. due to different routes), |
| donatien | 0:b802fc31f1db | 57 | * currently, overlapping or duplicate fragments are thrown away |
| donatien | 0:b802fc31f1db | 58 | * if IP_REASS_CHECK_OVERLAP=1 (the default)! |
| donatien | 0:b802fc31f1db | 59 | * |
| donatien | 0:b802fc31f1db | 60 | * @todo: work with IP header options |
| donatien | 0:b802fc31f1db | 61 | */ |
| donatien | 0:b802fc31f1db | 62 | |
| donatien | 0:b802fc31f1db | 63 | /** Setting this to 0, you can turn off checking the fragments for overlapping |
| donatien | 0:b802fc31f1db | 64 | * regions. The code gets a little smaller. Only use this if you know that |
| donatien | 0:b802fc31f1db | 65 | * overlapping won't occur on your network! */ |
| donatien | 0:b802fc31f1db | 66 | #ifndef IP_REASS_CHECK_OVERLAP |
| donatien | 0:b802fc31f1db | 67 | #define IP_REASS_CHECK_OVERLAP 1 |
| donatien | 0:b802fc31f1db | 68 | #endif /* IP_REASS_CHECK_OVERLAP */ |
| donatien | 0:b802fc31f1db | 69 | |
| donatien | 0:b802fc31f1db | 70 | /** Set to 0 to prevent freeing the oldest datagram when the reassembly buffer is |
| donatien | 0:b802fc31f1db | 71 | * full (IP_REASS_MAX_PBUFS pbufs are enqueued). The code gets a little smaller. |
| donatien | 0:b802fc31f1db | 72 | * Datagrams will be freed by timeout only. Especially useful when MEMP_NUM_REASSDATA |
| donatien | 0:b802fc31f1db | 73 | * is set to 1, so one datagram can be reassembled at a time, only. */ |
| donatien | 0:b802fc31f1db | 74 | #ifndef IP_REASS_FREE_OLDEST |
| donatien | 0:b802fc31f1db | 75 | #define IP_REASS_FREE_OLDEST 1 |
| donatien | 0:b802fc31f1db | 76 | #endif /* IP_REASS_FREE_OLDEST */ |
| donatien | 0:b802fc31f1db | 77 | |
| donatien | 0:b802fc31f1db | 78 | #define IP_REASS_FLAG_LASTFRAG 0x01 |
| donatien | 0:b802fc31f1db | 79 | |
| donatien | 0:b802fc31f1db | 80 | /** This is a helper struct which holds the starting |
| donatien | 0:b802fc31f1db | 81 | * offset and the ending offset of this fragment to |
| donatien | 0:b802fc31f1db | 82 | * easily chain the fragments. |
| donatien | 0:b802fc31f1db | 83 | * It has to be packed since it has to fit inside the IP header. |
| donatien | 0:b802fc31f1db | 84 | */ |
| donatien | 0:b802fc31f1db | 85 | #ifdef PACK_STRUCT_USE_INCLUDES |
| donatien | 0:b802fc31f1db | 86 | # include "arch/bpstruct.h" |
| donatien | 0:b802fc31f1db | 87 | #endif |
| donatien | 0:b802fc31f1db | 88 | PACK_STRUCT_BEGIN |
| donatien | 0:b802fc31f1db | 89 | struct ip_reass_helper { |
| donatien | 0:b802fc31f1db | 90 | PACK_STRUCT_FIELD(struct pbuf *next_pbuf); |
| donatien | 0:b802fc31f1db | 91 | PACK_STRUCT_FIELD(u16_t start); |
| donatien | 0:b802fc31f1db | 92 | PACK_STRUCT_FIELD(u16_t end); |
| donatien | 0:b802fc31f1db | 93 | } PACK_STRUCT_STRUCT; |
| donatien | 0:b802fc31f1db | 94 | PACK_STRUCT_END |
| donatien | 0:b802fc31f1db | 95 | #ifdef PACK_STRUCT_USE_INCLUDES |
| donatien | 0:b802fc31f1db | 96 | # include "arch/epstruct.h" |
| donatien | 0:b802fc31f1db | 97 | #endif |
| donatien | 0:b802fc31f1db | 98 | |
| donatien | 0:b802fc31f1db | 99 | #define IP_ADDRESSES_AND_ID_MATCH(iphdrA, iphdrB) \ |
| donatien | 0:b802fc31f1db | 100 | (ip_addr_cmp(&(iphdrA)->src, &(iphdrB)->src) && \ |
| donatien | 0:b802fc31f1db | 101 | ip_addr_cmp(&(iphdrA)->dest, &(iphdrB)->dest) && \ |
| donatien | 0:b802fc31f1db | 102 | IPH_ID(iphdrA) == IPH_ID(iphdrB)) ? 1 : 0 |
| donatien | 0:b802fc31f1db | 103 | |
| donatien | 0:b802fc31f1db | 104 | /* global variables */ |
| donatien | 0:b802fc31f1db | 105 | static struct ip_reassdata *reassdatagrams; |
| donatien | 0:b802fc31f1db | 106 | static u16_t ip_reass_pbufcount; |
| donatien | 0:b802fc31f1db | 107 | |
| donatien | 0:b802fc31f1db | 108 | /* function prototypes */ |
| donatien | 0:b802fc31f1db | 109 | static void ip_reass_dequeue_datagram(struct ip_reassdata *ipr, struct ip_reassdata *prev); |
| donatien | 0:b802fc31f1db | 110 | static int ip_reass_free_complete_datagram(struct ip_reassdata *ipr, struct ip_reassdata *prev); |
| donatien | 0:b802fc31f1db | 111 | |
| donatien | 0:b802fc31f1db | 112 | /** |
| donatien | 0:b802fc31f1db | 113 | * Reassembly timer base function |
| donatien | 0:b802fc31f1db | 114 | * for both NO_SYS == 0 and 1 (!). |
| donatien | 0:b802fc31f1db | 115 | * |
| donatien | 0:b802fc31f1db | 116 | * Should be called every 1000 msec (defined by IP_TMR_INTERVAL). |
| donatien | 0:b802fc31f1db | 117 | */ |
| donatien | 0:b802fc31f1db | 118 | void |
| donatien | 0:b802fc31f1db | 119 | ip_reass_tmr(void) |
| donatien | 0:b802fc31f1db | 120 | { |
| donatien | 0:b802fc31f1db | 121 | struct ip_reassdata *r, *prev = NULL; |
| donatien | 0:b802fc31f1db | 122 | |
| donatien | 0:b802fc31f1db | 123 | r = reassdatagrams; |
| donatien | 0:b802fc31f1db | 124 | while (r != NULL) { |
| donatien | 0:b802fc31f1db | 125 | /* Decrement the timer. Once it reaches 0, |
| donatien | 0:b802fc31f1db | 126 | * clean up the incomplete fragment assembly */ |
| donatien | 0:b802fc31f1db | 127 | if (r->timer > 0) { |
| donatien | 0:b802fc31f1db | 128 | r->timer--; |
| donatien | 0:b802fc31f1db | 129 | LWIP_DEBUGF(IP_REASS_DEBUG, ("ip_reass_tmr: timer dec %"U16_F"\n",(u16_t)r->timer)); |
| donatien | 0:b802fc31f1db | 130 | prev = r; |
| donatien | 0:b802fc31f1db | 131 | r = r->next; |
| donatien | 0:b802fc31f1db | 132 | } else { |
| donatien | 0:b802fc31f1db | 133 | /* reassembly timed out */ |
| donatien | 0:b802fc31f1db | 134 | struct ip_reassdata *tmp; |
| donatien | 0:b802fc31f1db | 135 | LWIP_DEBUGF(IP_REASS_DEBUG, ("ip_reass_tmr: timer timed out\n")); |
| donatien | 0:b802fc31f1db | 136 | tmp = r; |
| donatien | 0:b802fc31f1db | 137 | /* get the next pointer before freeing */ |
| donatien | 0:b802fc31f1db | 138 | r = r->next; |
| donatien | 0:b802fc31f1db | 139 | /* free the helper struct and all enqueued pbufs */ |
| donatien | 0:b802fc31f1db | 140 | ip_reass_free_complete_datagram(tmp, prev); |
| donatien | 0:b802fc31f1db | 141 | } |
| donatien | 0:b802fc31f1db | 142 | } |
| donatien | 0:b802fc31f1db | 143 | } |
| donatien | 0:b802fc31f1db | 144 | |
| donatien | 0:b802fc31f1db | 145 | /** |
| donatien | 0:b802fc31f1db | 146 | * Free a datagram (struct ip_reassdata) and all its pbufs. |
| donatien | 0:b802fc31f1db | 147 | * Updates the total count of enqueued pbufs (ip_reass_pbufcount), |
| donatien | 0:b802fc31f1db | 148 | * SNMP counters and sends an ICMP time exceeded packet. |
| donatien | 0:b802fc31f1db | 149 | * |
| donatien | 0:b802fc31f1db | 150 | * @param ipr datagram to free |
| donatien | 0:b802fc31f1db | 151 | * @param prev the previous datagram in the linked list |
| donatien | 0:b802fc31f1db | 152 | * @return the number of pbufs freed |
| donatien | 0:b802fc31f1db | 153 | */ |
| donatien | 0:b802fc31f1db | 154 | static int |
| donatien | 0:b802fc31f1db | 155 | ip_reass_free_complete_datagram(struct ip_reassdata *ipr, struct ip_reassdata *prev) |
| donatien | 0:b802fc31f1db | 156 | { |
| donatien | 0:b802fc31f1db | 157 | u16_t pbufs_freed = 0; |
| donatien | 0:b802fc31f1db | 158 | u8_t clen; |
| donatien | 0:b802fc31f1db | 159 | struct pbuf *p; |
| donatien | 0:b802fc31f1db | 160 | struct ip_reass_helper *iprh; |
| donatien | 0:b802fc31f1db | 161 | |
| donatien | 0:b802fc31f1db | 162 | LWIP_ASSERT("prev != ipr", prev != ipr); |
| donatien | 0:b802fc31f1db | 163 | if (prev != NULL) { |
| donatien | 0:b802fc31f1db | 164 | LWIP_ASSERT("prev->next == ipr", prev->next == ipr); |
| donatien | 0:b802fc31f1db | 165 | } |
| donatien | 0:b802fc31f1db | 166 | |
| donatien | 0:b802fc31f1db | 167 | snmp_inc_ipreasmfails(); |
| donatien | 0:b802fc31f1db | 168 | #if LWIP_ICMP |
| donatien | 0:b802fc31f1db | 169 | iprh = (struct ip_reass_helper *)ipr->p->payload; |
| donatien | 0:b802fc31f1db | 170 | if (iprh->start == 0) { |
| donatien | 0:b802fc31f1db | 171 | /* The first fragment was received, send ICMP time exceeded. */ |
| donatien | 0:b802fc31f1db | 172 | /* First, de-queue the first pbuf from r->p. */ |
| donatien | 0:b802fc31f1db | 173 | p = ipr->p; |
| donatien | 0:b802fc31f1db | 174 | ipr->p = iprh->next_pbuf; |
| donatien | 0:b802fc31f1db | 175 | /* Then, copy the original header into it. */ |
| donatien | 0:b802fc31f1db | 176 | SMEMCPY(p->payload, &ipr->iphdr, IP_HLEN); |
| donatien | 0:b802fc31f1db | 177 | icmp_time_exceeded(p, ICMP_TE_FRAG); |
| donatien | 0:b802fc31f1db | 178 | clen = pbuf_clen(p); |
| donatien | 0:b802fc31f1db | 179 | LWIP_ASSERT("pbufs_freed + clen <= 0xffff", pbufs_freed + clen <= 0xffff); |
| donatien | 0:b802fc31f1db | 180 | pbufs_freed += clen; |
| donatien | 0:b802fc31f1db | 181 | pbuf_free(p); |
| donatien | 0:b802fc31f1db | 182 | } |
| donatien | 0:b802fc31f1db | 183 | #endif /* LWIP_ICMP */ |
| donatien | 0:b802fc31f1db | 184 | |
| donatien | 0:b802fc31f1db | 185 | /* First, free all received pbufs. The individual pbufs need to be released |
| donatien | 0:b802fc31f1db | 186 | separately as they have not yet been chained */ |
| donatien | 0:b802fc31f1db | 187 | p = ipr->p; |
| donatien | 0:b802fc31f1db | 188 | while (p != NULL) { |
| donatien | 0:b802fc31f1db | 189 | struct pbuf *pcur; |
| donatien | 0:b802fc31f1db | 190 | iprh = (struct ip_reass_helper *)p->payload; |
| donatien | 0:b802fc31f1db | 191 | pcur = p; |
| donatien | 0:b802fc31f1db | 192 | /* get the next pointer before freeing */ |
| donatien | 0:b802fc31f1db | 193 | p = iprh->next_pbuf; |
| donatien | 0:b802fc31f1db | 194 | clen = pbuf_clen(pcur); |
| donatien | 0:b802fc31f1db | 195 | LWIP_ASSERT("pbufs_freed + clen <= 0xffff", pbufs_freed + clen <= 0xffff); |
| donatien | 0:b802fc31f1db | 196 | pbufs_freed += clen; |
| donatien | 0:b802fc31f1db | 197 | pbuf_free(pcur); |
| donatien | 0:b802fc31f1db | 198 | } |
| donatien | 0:b802fc31f1db | 199 | /* Then, unchain the struct ip_reassdata from the list and free it. */ |
| donatien | 0:b802fc31f1db | 200 | ip_reass_dequeue_datagram(ipr, prev); |
| donatien | 0:b802fc31f1db | 201 | LWIP_ASSERT("ip_reass_pbufcount >= clen", ip_reass_pbufcount >= pbufs_freed); |
| donatien | 0:b802fc31f1db | 202 | ip_reass_pbufcount -= pbufs_freed; |
| donatien | 0:b802fc31f1db | 203 | |
| donatien | 0:b802fc31f1db | 204 | return pbufs_freed; |
| donatien | 0:b802fc31f1db | 205 | } |
| donatien | 0:b802fc31f1db | 206 | |
| donatien | 0:b802fc31f1db | 207 | #if IP_REASS_FREE_OLDEST |
| donatien | 0:b802fc31f1db | 208 | /** |
| donatien | 0:b802fc31f1db | 209 | * Free the oldest datagram to make room for enqueueing new fragments. |
| donatien | 0:b802fc31f1db | 210 | * The datagram 'fraghdr' belongs to is not freed! |
| donatien | 0:b802fc31f1db | 211 | * |
| donatien | 0:b802fc31f1db | 212 | * @param fraghdr IP header of the current fragment |
| donatien | 0:b802fc31f1db | 213 | * @param pbufs_needed number of pbufs needed to enqueue |
| donatien | 0:b802fc31f1db | 214 | * (used for freeing other datagrams if not enough space) |
| donatien | 0:b802fc31f1db | 215 | * @return the number of pbufs freed |
| donatien | 0:b802fc31f1db | 216 | */ |
| donatien | 0:b802fc31f1db | 217 | static int |
| donatien | 0:b802fc31f1db | 218 | ip_reass_remove_oldest_datagram(struct ip_hdr *fraghdr, int pbufs_needed) |
| donatien | 0:b802fc31f1db | 219 | { |
| donatien | 0:b802fc31f1db | 220 | /* @todo Can't we simply remove the last datagram in the |
| donatien | 0:b802fc31f1db | 221 | * linked list behind reassdatagrams? |
| donatien | 0:b802fc31f1db | 222 | */ |
| donatien | 0:b802fc31f1db | 223 | struct ip_reassdata *r, *oldest, *prev; |
| donatien | 0:b802fc31f1db | 224 | int pbufs_freed = 0, pbufs_freed_current; |
| donatien | 0:b802fc31f1db | 225 | int other_datagrams; |
| donatien | 0:b802fc31f1db | 226 | |
| donatien | 0:b802fc31f1db | 227 | /* Free datagrams until being allowed to enqueue 'pbufs_needed' pbufs, |
| donatien | 0:b802fc31f1db | 228 | * but don't free the datagram that 'fraghdr' belongs to! */ |
| donatien | 0:b802fc31f1db | 229 | do { |
| donatien | 0:b802fc31f1db | 230 | oldest = NULL; |
| donatien | 0:b802fc31f1db | 231 | prev = NULL; |
| donatien | 0:b802fc31f1db | 232 | other_datagrams = 0; |
| donatien | 0:b802fc31f1db | 233 | r = reassdatagrams; |
| donatien | 0:b802fc31f1db | 234 | while (r != NULL) { |
| donatien | 0:b802fc31f1db | 235 | if (!IP_ADDRESSES_AND_ID_MATCH(&r->iphdr, fraghdr)) { |
| donatien | 0:b802fc31f1db | 236 | /* Not the same datagram as fraghdr */ |
| donatien | 0:b802fc31f1db | 237 | other_datagrams++; |
| donatien | 0:b802fc31f1db | 238 | if (oldest == NULL) { |
| donatien | 0:b802fc31f1db | 239 | oldest = r; |
| donatien | 0:b802fc31f1db | 240 | } else if (r->timer <= oldest->timer) { |
| donatien | 0:b802fc31f1db | 241 | /* older than the previous oldest */ |
| donatien | 0:b802fc31f1db | 242 | oldest = r; |
| donatien | 0:b802fc31f1db | 243 | } |
| donatien | 0:b802fc31f1db | 244 | } |
| donatien | 0:b802fc31f1db | 245 | if (r->next != NULL) { |
| donatien | 0:b802fc31f1db | 246 | prev = r; |
| donatien | 0:b802fc31f1db | 247 | } |
| donatien | 0:b802fc31f1db | 248 | r = r->next; |
| donatien | 0:b802fc31f1db | 249 | } |
| donatien | 0:b802fc31f1db | 250 | if (oldest != NULL) { |
| donatien | 0:b802fc31f1db | 251 | pbufs_freed_current = ip_reass_free_complete_datagram(oldest, prev); |
| donatien | 0:b802fc31f1db | 252 | pbufs_freed += pbufs_freed_current; |
| donatien | 0:b802fc31f1db | 253 | } |
| donatien | 0:b802fc31f1db | 254 | } while ((pbufs_freed < pbufs_needed) && (other_datagrams > 1)); |
| donatien | 0:b802fc31f1db | 255 | return pbufs_freed; |
| donatien | 0:b802fc31f1db | 256 | } |
| donatien | 0:b802fc31f1db | 257 | #endif /* IP_REASS_FREE_OLDEST */ |
| donatien | 0:b802fc31f1db | 258 | |
| donatien | 0:b802fc31f1db | 259 | /** |
| donatien | 0:b802fc31f1db | 260 | * Enqueues a new fragment into the fragment queue |
| donatien | 0:b802fc31f1db | 261 | * @param fraghdr points to the new fragments IP hdr |
| donatien | 0:b802fc31f1db | 262 | * @param clen number of pbufs needed to enqueue (used for freeing other datagrams if not enough space) |
| donatien | 0:b802fc31f1db | 263 | * @return A pointer to the queue location into which the fragment was enqueued |
| donatien | 0:b802fc31f1db | 264 | */ |
| donatien | 0:b802fc31f1db | 265 | static struct ip_reassdata* |
| donatien | 0:b802fc31f1db | 266 | ip_reass_enqueue_new_datagram(struct ip_hdr *fraghdr, int clen) |
| donatien | 0:b802fc31f1db | 267 | { |
| donatien | 0:b802fc31f1db | 268 | struct ip_reassdata* ipr; |
| donatien | 0:b802fc31f1db | 269 | /* No matching previous fragment found, allocate a new reassdata struct */ |
| donatien | 0:b802fc31f1db | 270 | ipr = (struct ip_reassdata*) memp_malloc(MEMP_REASSDATA); |
| donatien | 0:b802fc31f1db | 271 | if (ipr == NULL) { |
| donatien | 0:b802fc31f1db | 272 | #if IP_REASS_FREE_OLDEST |
| donatien | 0:b802fc31f1db | 273 | if (ip_reass_remove_oldest_datagram(fraghdr, clen) >= clen) { |
| donatien | 0:b802fc31f1db | 274 | ipr = (struct ip_reassdata*) memp_malloc(MEMP_REASSDATA); |
| donatien | 0:b802fc31f1db | 275 | } |
| donatien | 0:b802fc31f1db | 276 | if (ipr == NULL) |
| donatien | 0:b802fc31f1db | 277 | #endif /* IP_REASS_FREE_OLDEST */ |
| donatien | 0:b802fc31f1db | 278 | { |
| donatien | 0:b802fc31f1db | 279 | IPFRAG_STATS_INC(ip_frag.memerr); |
| donatien | 0:b802fc31f1db | 280 | LWIP_DEBUGF(IP_REASS_DEBUG,("Failed to alloc reassdata struct\n")); |
| donatien | 0:b802fc31f1db | 281 | return NULL; |
| donatien | 0:b802fc31f1db | 282 | } |
| donatien | 0:b802fc31f1db | 283 | } |
| donatien | 0:b802fc31f1db | 284 | memset(ipr, 0, sizeof(struct ip_reassdata)); |
| donatien | 0:b802fc31f1db | 285 | ipr->timer = IP_REASS_MAXAGE; |
| donatien | 0:b802fc31f1db | 286 | |
| donatien | 0:b802fc31f1db | 287 | /* enqueue the new structure to the front of the list */ |
| donatien | 0:b802fc31f1db | 288 | ipr->next = reassdatagrams; |
| donatien | 0:b802fc31f1db | 289 | reassdatagrams = ipr; |
| donatien | 0:b802fc31f1db | 290 | /* copy the ip header for later tests and input */ |
| donatien | 0:b802fc31f1db | 291 | /* @todo: no ip options supported? */ |
| donatien | 0:b802fc31f1db | 292 | SMEMCPY(&(ipr->iphdr), fraghdr, IP_HLEN); |
| donatien | 0:b802fc31f1db | 293 | return ipr; |
| donatien | 0:b802fc31f1db | 294 | } |
| donatien | 0:b802fc31f1db | 295 | |
| donatien | 0:b802fc31f1db | 296 | /** |
| donatien | 0:b802fc31f1db | 297 | * Dequeues a datagram from the datagram queue. Doesn't deallocate the pbufs. |
| donatien | 0:b802fc31f1db | 298 | * @param ipr points to the queue entry to dequeue |
| donatien | 0:b802fc31f1db | 299 | */ |
| donatien | 0:b802fc31f1db | 300 | static void |
| donatien | 0:b802fc31f1db | 301 | ip_reass_dequeue_datagram(struct ip_reassdata *ipr, struct ip_reassdata *prev) |
| donatien | 0:b802fc31f1db | 302 | { |
| donatien | 0:b802fc31f1db | 303 | |
| donatien | 0:b802fc31f1db | 304 | /* dequeue the reass struct */ |
| donatien | 0:b802fc31f1db | 305 | if (reassdatagrams == ipr) { |
| donatien | 0:b802fc31f1db | 306 | /* it was the first in the list */ |
| donatien | 0:b802fc31f1db | 307 | reassdatagrams = ipr->next; |
| donatien | 0:b802fc31f1db | 308 | } else { |
| donatien | 0:b802fc31f1db | 309 | /* it wasn't the first, so it must have a valid 'prev' */ |
| donatien | 0:b802fc31f1db | 310 | LWIP_ASSERT("sanity check linked list", prev != NULL); |
| donatien | 0:b802fc31f1db | 311 | prev->next = ipr->next; |
| donatien | 0:b802fc31f1db | 312 | } |
| donatien | 0:b802fc31f1db | 313 | |
| donatien | 0:b802fc31f1db | 314 | /* now we can free the ip_reass struct */ |
| donatien | 0:b802fc31f1db | 315 | memp_free(MEMP_REASSDATA, ipr); |
| donatien | 0:b802fc31f1db | 316 | } |
| donatien | 0:b802fc31f1db | 317 | |
| donatien | 0:b802fc31f1db | 318 | /** |
| donatien | 0:b802fc31f1db | 319 | * Chain a new pbuf into the pbuf list that composes the datagram. The pbuf list |
| donatien | 0:b802fc31f1db | 320 | * will grow over time as new pbufs are rx. |
| donatien | 0:b802fc31f1db | 321 | * Also checks that the datagram passes basic continuity checks (if the last |
| donatien | 0:b802fc31f1db | 322 | * fragment was received at least once). |
| donatien | 0:b802fc31f1db | 323 | * @param root_p points to the 'root' pbuf for the current datagram being assembled. |
| donatien | 0:b802fc31f1db | 324 | * @param new_p points to the pbuf for the current fragment |
| donatien | 0:b802fc31f1db | 325 | * @return 0 if invalid, >0 otherwise |
| donatien | 0:b802fc31f1db | 326 | */ |
| donatien | 0:b802fc31f1db | 327 | static int |
| donatien | 0:b802fc31f1db | 328 | ip_reass_chain_frag_into_datagram_and_validate(struct ip_reassdata *ipr, struct pbuf *new_p) |
| donatien | 0:b802fc31f1db | 329 | { |
| donatien | 0:b802fc31f1db | 330 | struct ip_reass_helper *iprh, *iprh_tmp, *iprh_prev=NULL; |
| donatien | 0:b802fc31f1db | 331 | struct pbuf *q; |
| donatien | 0:b802fc31f1db | 332 | u16_t offset,len; |
| donatien | 0:b802fc31f1db | 333 | struct ip_hdr *fraghdr; |
| donatien | 0:b802fc31f1db | 334 | int valid = 1; |
| donatien | 0:b802fc31f1db | 335 | |
| donatien | 0:b802fc31f1db | 336 | /* Extract length and fragment offset from current fragment */ |
| donatien | 0:b802fc31f1db | 337 | fraghdr = (struct ip_hdr*)new_p->payload; |
| donatien | 0:b802fc31f1db | 338 | len = ntohs(IPH_LEN(fraghdr)) - IPH_HL(fraghdr) * 4; |
| donatien | 0:b802fc31f1db | 339 | offset = (ntohs(IPH_OFFSET(fraghdr)) & IP_OFFMASK) * 8; |
| donatien | 0:b802fc31f1db | 340 | |
| donatien | 0:b802fc31f1db | 341 | /* overwrite the fragment's ip header from the pbuf with our helper struct, |
| donatien | 0:b802fc31f1db | 342 | * and setup the embedded helper structure. */ |
| donatien | 0:b802fc31f1db | 343 | /* make sure the struct ip_reass_helper fits into the IP header */ |
| donatien | 0:b802fc31f1db | 344 | LWIP_ASSERT("sizeof(struct ip_reass_helper) <= IP_HLEN", |
| donatien | 0:b802fc31f1db | 345 | sizeof(struct ip_reass_helper) <= IP_HLEN); |
| donatien | 0:b802fc31f1db | 346 | iprh = (struct ip_reass_helper*)new_p->payload; |
| donatien | 0:b802fc31f1db | 347 | iprh->next_pbuf = NULL; |
| donatien | 0:b802fc31f1db | 348 | iprh->start = offset; |
| donatien | 0:b802fc31f1db | 349 | iprh->end = offset + len; |
| donatien | 0:b802fc31f1db | 350 | |
| donatien | 0:b802fc31f1db | 351 | /* Iterate through until we either get to the end of the list (append), |
| donatien | 0:b802fc31f1db | 352 | * or we find on with a larger offset (insert). */ |
| donatien | 0:b802fc31f1db | 353 | for (q = ipr->p; q != NULL;) { |
| donatien | 0:b802fc31f1db | 354 | iprh_tmp = (struct ip_reass_helper*)q->payload; |
| donatien | 0:b802fc31f1db | 355 | if (iprh->start < iprh_tmp->start) { |
| donatien | 0:b802fc31f1db | 356 | /* the new pbuf should be inserted before this */ |
| donatien | 0:b802fc31f1db | 357 | iprh->next_pbuf = q; |
| donatien | 0:b802fc31f1db | 358 | if (iprh_prev != NULL) { |
| donatien | 0:b802fc31f1db | 359 | /* not the fragment with the lowest offset */ |
| donatien | 0:b802fc31f1db | 360 | #if IP_REASS_CHECK_OVERLAP |
| donatien | 0:b802fc31f1db | 361 | if ((iprh->start < iprh_prev->end) || (iprh->end > iprh_tmp->start)) { |
| donatien | 0:b802fc31f1db | 362 | /* fragment overlaps with previous or following, throw away */ |
| donatien | 0:b802fc31f1db | 363 | goto freepbuf; |
| donatien | 0:b802fc31f1db | 364 | } |
| donatien | 0:b802fc31f1db | 365 | #endif /* IP_REASS_CHECK_OVERLAP */ |
| donatien | 0:b802fc31f1db | 366 | iprh_prev->next_pbuf = new_p; |
| donatien | 0:b802fc31f1db | 367 | } else { |
| donatien | 0:b802fc31f1db | 368 | /* fragment with the lowest offset */ |
| donatien | 0:b802fc31f1db | 369 | ipr->p = new_p; |
| donatien | 0:b802fc31f1db | 370 | } |
| donatien | 0:b802fc31f1db | 371 | break; |
| donatien | 0:b802fc31f1db | 372 | } else if(iprh->start == iprh_tmp->start) { |
| donatien | 0:b802fc31f1db | 373 | /* received the same datagram twice: no need to keep the datagram */ |
| donatien | 0:b802fc31f1db | 374 | goto freepbuf; |
| donatien | 0:b802fc31f1db | 375 | #if IP_REASS_CHECK_OVERLAP |
| donatien | 0:b802fc31f1db | 376 | } else if(iprh->start < iprh_tmp->end) { |
| donatien | 0:b802fc31f1db | 377 | /* overlap: no need to keep the new datagram */ |
| donatien | 0:b802fc31f1db | 378 | goto freepbuf; |
| donatien | 0:b802fc31f1db | 379 | #endif /* IP_REASS_CHECK_OVERLAP */ |
| donatien | 0:b802fc31f1db | 380 | } else { |
| donatien | 0:b802fc31f1db | 381 | /* Check if the fragments received so far have no wholes. */ |
| donatien | 0:b802fc31f1db | 382 | if (iprh_prev != NULL) { |
| donatien | 0:b802fc31f1db | 383 | if (iprh_prev->end != iprh_tmp->start) { |
| donatien | 0:b802fc31f1db | 384 | /* There is a fragment missing between the current |
| donatien | 0:b802fc31f1db | 385 | * and the previous fragment */ |
| donatien | 0:b802fc31f1db | 386 | valid = 0; |
| donatien | 0:b802fc31f1db | 387 | } |
| donatien | 0:b802fc31f1db | 388 | } |
| donatien | 0:b802fc31f1db | 389 | } |
| donatien | 0:b802fc31f1db | 390 | q = iprh_tmp->next_pbuf; |
| donatien | 0:b802fc31f1db | 391 | iprh_prev = iprh_tmp; |
| donatien | 0:b802fc31f1db | 392 | } |
| donatien | 0:b802fc31f1db | 393 | |
| donatien | 0:b802fc31f1db | 394 | /* If q is NULL, then we made it to the end of the list. Determine what to do now */ |
| donatien | 0:b802fc31f1db | 395 | if (q == NULL) { |
| donatien | 0:b802fc31f1db | 396 | if (iprh_prev != NULL) { |
| donatien | 0:b802fc31f1db | 397 | /* this is (for now), the fragment with the highest offset: |
| donatien | 0:b802fc31f1db | 398 | * chain it to the last fragment */ |
| donatien | 0:b802fc31f1db | 399 | #if IP_REASS_CHECK_OVERLAP |
| donatien | 0:b802fc31f1db | 400 | LWIP_ASSERT("check fragments don't overlap", iprh_prev->end <= iprh->start); |
| donatien | 0:b802fc31f1db | 401 | #endif /* IP_REASS_CHECK_OVERLAP */ |
| donatien | 0:b802fc31f1db | 402 | iprh_prev->next_pbuf = new_p; |
| donatien | 0:b802fc31f1db | 403 | if (iprh_prev->end != iprh->start) { |
| donatien | 0:b802fc31f1db | 404 | valid = 0; |
| donatien | 0:b802fc31f1db | 405 | } |
| donatien | 0:b802fc31f1db | 406 | } else { |
| donatien | 0:b802fc31f1db | 407 | #if IP_REASS_CHECK_OVERLAP |
| donatien | 0:b802fc31f1db | 408 | LWIP_ASSERT("no previous fragment, this must be the first fragment!", |
| donatien | 0:b802fc31f1db | 409 | ipr->p == NULL); |
| donatien | 0:b802fc31f1db | 410 | #endif /* IP_REASS_CHECK_OVERLAP */ |
| donatien | 0:b802fc31f1db | 411 | /* this is the first fragment we ever received for this ip datagram */ |
| donatien | 0:b802fc31f1db | 412 | ipr->p = new_p; |
| donatien | 0:b802fc31f1db | 413 | } |
| donatien | 0:b802fc31f1db | 414 | } |
| donatien | 0:b802fc31f1db | 415 | |
| donatien | 0:b802fc31f1db | 416 | /* At this point, the validation part begins: */ |
| donatien | 0:b802fc31f1db | 417 | /* If we already received the last fragment */ |
| donatien | 0:b802fc31f1db | 418 | if ((ipr->flags & IP_REASS_FLAG_LASTFRAG) != 0) { |
| donatien | 0:b802fc31f1db | 419 | /* and had no wholes so far */ |
| donatien | 0:b802fc31f1db | 420 | if (valid) { |
| donatien | 0:b802fc31f1db | 421 | /* then check if the rest of the fragments is here */ |
| donatien | 0:b802fc31f1db | 422 | /* Check if the queue starts with the first datagram */ |
| donatien | 0:b802fc31f1db | 423 | if (((struct ip_reass_helper*)ipr->p->payload)->start != 0) { |
| donatien | 0:b802fc31f1db | 424 | valid = 0; |
| donatien | 0:b802fc31f1db | 425 | } else { |
| donatien | 0:b802fc31f1db | 426 | /* and check that there are no wholes after this datagram */ |
| donatien | 0:b802fc31f1db | 427 | iprh_prev = iprh; |
| donatien | 0:b802fc31f1db | 428 | q = iprh->next_pbuf; |
| donatien | 0:b802fc31f1db | 429 | while (q != NULL) { |
| donatien | 0:b802fc31f1db | 430 | iprh = (struct ip_reass_helper*)q->payload; |
| donatien | 0:b802fc31f1db | 431 | if (iprh_prev->end != iprh->start) { |
| donatien | 0:b802fc31f1db | 432 | valid = 0; |
| donatien | 0:b802fc31f1db | 433 | break; |
| donatien | 0:b802fc31f1db | 434 | } |
| donatien | 0:b802fc31f1db | 435 | iprh_prev = iprh; |
| donatien | 0:b802fc31f1db | 436 | q = iprh->next_pbuf; |
| donatien | 0:b802fc31f1db | 437 | } |
| donatien | 0:b802fc31f1db | 438 | /* if still valid, all fragments are received |
| donatien | 0:b802fc31f1db | 439 | * (because to the MF==0 already arrived */ |
| donatien | 0:b802fc31f1db | 440 | if (valid) { |
| donatien | 0:b802fc31f1db | 441 | LWIP_ASSERT("sanity check", ipr->p != NULL); |
| donatien | 0:b802fc31f1db | 442 | LWIP_ASSERT("sanity check", |
| donatien | 0:b802fc31f1db | 443 | ((struct ip_reass_helper*)ipr->p->payload) != iprh); |
| donatien | 0:b802fc31f1db | 444 | LWIP_ASSERT("validate_datagram:next_pbuf!=NULL", |
| donatien | 0:b802fc31f1db | 445 | iprh->next_pbuf == NULL); |
| donatien | 0:b802fc31f1db | 446 | LWIP_ASSERT("validate_datagram:datagram end!=datagram len", |
| donatien | 0:b802fc31f1db | 447 | iprh->end == ipr->datagram_len); |
| donatien | 0:b802fc31f1db | 448 | } |
| donatien | 0:b802fc31f1db | 449 | } |
| donatien | 0:b802fc31f1db | 450 | } |
| donatien | 0:b802fc31f1db | 451 | /* If valid is 0 here, there are some fragments missing in the middle |
| donatien | 0:b802fc31f1db | 452 | * (since MF == 0 has already arrived). Such datagrams simply time out if |
| donatien | 0:b802fc31f1db | 453 | * no more fragments are received... */ |
| donatien | 0:b802fc31f1db | 454 | return valid; |
| donatien | 0:b802fc31f1db | 455 | } |
| donatien | 0:b802fc31f1db | 456 | /* If we come here, not all fragments were received, yet! */ |
| donatien | 0:b802fc31f1db | 457 | return 0; /* not yet valid! */ |
| donatien | 0:b802fc31f1db | 458 | #if IP_REASS_CHECK_OVERLAP |
| donatien | 0:b802fc31f1db | 459 | freepbuf: |
| donatien | 0:b802fc31f1db | 460 | ip_reass_pbufcount -= pbuf_clen(new_p); |
| donatien | 0:b802fc31f1db | 461 | pbuf_free(new_p); |
| donatien | 0:b802fc31f1db | 462 | return 0; |
| donatien | 0:b802fc31f1db | 463 | #endif /* IP_REASS_CHECK_OVERLAP */ |
| donatien | 0:b802fc31f1db | 464 | } |
| donatien | 0:b802fc31f1db | 465 | |
| donatien | 0:b802fc31f1db | 466 | /** |
| donatien | 0:b802fc31f1db | 467 | * Reassembles incoming IP fragments into an IP datagram. |
| donatien | 0:b802fc31f1db | 468 | * |
| donatien | 0:b802fc31f1db | 469 | * @param p points to a pbuf chain of the fragment |
| donatien | 0:b802fc31f1db | 470 | * @return NULL if reassembly is incomplete, ? otherwise |
| donatien | 0:b802fc31f1db | 471 | */ |
| donatien | 0:b802fc31f1db | 472 | struct pbuf * |
| donatien | 0:b802fc31f1db | 473 | ip_reass(struct pbuf *p) |
| donatien | 0:b802fc31f1db | 474 | { |
| donatien | 0:b802fc31f1db | 475 | struct pbuf *r; |
| donatien | 0:b802fc31f1db | 476 | struct ip_hdr *fraghdr; |
| donatien | 0:b802fc31f1db | 477 | struct ip_reassdata *ipr; |
| donatien | 0:b802fc31f1db | 478 | struct ip_reass_helper *iprh; |
| donatien | 0:b802fc31f1db | 479 | u16_t offset, len; |
| donatien | 0:b802fc31f1db | 480 | u8_t clen; |
| donatien | 0:b802fc31f1db | 481 | struct ip_reassdata *ipr_prev = NULL; |
| donatien | 0:b802fc31f1db | 482 | |
| donatien | 0:b802fc31f1db | 483 | IPFRAG_STATS_INC(ip_frag.recv); |
| donatien | 0:b802fc31f1db | 484 | snmp_inc_ipreasmreqds(); |
| donatien | 0:b802fc31f1db | 485 | |
| donatien | 0:b802fc31f1db | 486 | fraghdr = (struct ip_hdr*)p->payload; |
| donatien | 0:b802fc31f1db | 487 | |
| donatien | 0:b802fc31f1db | 488 | if ((IPH_HL(fraghdr) * 4) != IP_HLEN) { |
| donatien | 0:b802fc31f1db | 489 | LWIP_DEBUGF(IP_REASS_DEBUG,("ip_reass: IP options currently not supported!\n")); |
| donatien | 0:b802fc31f1db | 490 | IPFRAG_STATS_INC(ip_frag.err); |
| donatien | 0:b802fc31f1db | 491 | goto nullreturn; |
| donatien | 0:b802fc31f1db | 492 | } |
| donatien | 0:b802fc31f1db | 493 | |
| donatien | 0:b802fc31f1db | 494 | offset = (ntohs(IPH_OFFSET(fraghdr)) & IP_OFFMASK) * 8; |
| donatien | 0:b802fc31f1db | 495 | len = ntohs(IPH_LEN(fraghdr)) - IPH_HL(fraghdr) * 4; |
| donatien | 0:b802fc31f1db | 496 | |
| donatien | 0:b802fc31f1db | 497 | /* Check if we are allowed to enqueue more datagrams. */ |
| donatien | 0:b802fc31f1db | 498 | clen = pbuf_clen(p); |
| donatien | 0:b802fc31f1db | 499 | if ((ip_reass_pbufcount + clen) > IP_REASS_MAX_PBUFS) { |
| donatien | 0:b802fc31f1db | 500 | #if IP_REASS_FREE_OLDEST |
| donatien | 0:b802fc31f1db | 501 | if (!ip_reass_remove_oldest_datagram(fraghdr, clen) || |
| donatien | 0:b802fc31f1db | 502 | ((ip_reass_pbufcount + clen) > IP_REASS_MAX_PBUFS)) |
| donatien | 0:b802fc31f1db | 503 | #endif /* IP_REASS_FREE_OLDEST */ |
| donatien | 0:b802fc31f1db | 504 | { |
| donatien | 0:b802fc31f1db | 505 | /* No datagram could be freed and still too many pbufs enqueued */ |
| donatien | 0:b802fc31f1db | 506 | LWIP_DEBUGF(IP_REASS_DEBUG,("ip_reass: Overflow condition: pbufct=%d, clen=%d, MAX=%d\n", |
| donatien | 0:b802fc31f1db | 507 | ip_reass_pbufcount, clen, IP_REASS_MAX_PBUFS)); |
| donatien | 0:b802fc31f1db | 508 | IPFRAG_STATS_INC(ip_frag.memerr); |
| donatien | 0:b802fc31f1db | 509 | /* @todo: send ICMP time exceeded here? */ |
| donatien | 0:b802fc31f1db | 510 | /* drop this pbuf */ |
| donatien | 0:b802fc31f1db | 511 | goto nullreturn; |
| donatien | 0:b802fc31f1db | 512 | } |
| donatien | 0:b802fc31f1db | 513 | } |
| donatien | 0:b802fc31f1db | 514 | |
| donatien | 0:b802fc31f1db | 515 | /* Look for the datagram the fragment belongs to in the current datagram queue, |
| donatien | 0:b802fc31f1db | 516 | * remembering the previous in the queue for later dequeueing. */ |
| donatien | 0:b802fc31f1db | 517 | for (ipr = reassdatagrams; ipr != NULL; ipr = ipr->next) { |
| donatien | 0:b802fc31f1db | 518 | /* Check if the incoming fragment matches the one currently present |
| donatien | 0:b802fc31f1db | 519 | in the reassembly buffer. If so, we proceed with copying the |
| donatien | 0:b802fc31f1db | 520 | fragment into the buffer. */ |
| donatien | 0:b802fc31f1db | 521 | if (IP_ADDRESSES_AND_ID_MATCH(&ipr->iphdr, fraghdr)) { |
| donatien | 0:b802fc31f1db | 522 | LWIP_DEBUGF(IP_REASS_DEBUG, ("ip_reass: matching previous fragment ID=%"X16_F"\n", |
| donatien | 0:b802fc31f1db | 523 | ntohs(IPH_ID(fraghdr)))); |
| donatien | 0:b802fc31f1db | 524 | IPFRAG_STATS_INC(ip_frag.cachehit); |
| donatien | 0:b802fc31f1db | 525 | break; |
| donatien | 0:b802fc31f1db | 526 | } |
| donatien | 0:b802fc31f1db | 527 | ipr_prev = ipr; |
| donatien | 0:b802fc31f1db | 528 | } |
| donatien | 0:b802fc31f1db | 529 | |
| donatien | 0:b802fc31f1db | 530 | if (ipr == NULL) { |
| donatien | 0:b802fc31f1db | 531 | /* Enqueue a new datagram into the datagram queue */ |
| donatien | 0:b802fc31f1db | 532 | ipr = ip_reass_enqueue_new_datagram(fraghdr, clen); |
| donatien | 0:b802fc31f1db | 533 | /* Bail if unable to enqueue */ |
| donatien | 0:b802fc31f1db | 534 | if(ipr == NULL) { |
| donatien | 0:b802fc31f1db | 535 | goto nullreturn; |
| donatien | 0:b802fc31f1db | 536 | } |
| donatien | 0:b802fc31f1db | 537 | } else { |
| donatien | 0:b802fc31f1db | 538 | if (((ntohs(IPH_OFFSET(fraghdr)) & IP_OFFMASK) == 0) && |
| donatien | 0:b802fc31f1db | 539 | ((ntohs(IPH_OFFSET(&ipr->iphdr)) & IP_OFFMASK) != 0)) { |
| donatien | 0:b802fc31f1db | 540 | /* ipr->iphdr is not the header from the first fragment, but fraghdr is |
| donatien | 0:b802fc31f1db | 541 | * -> copy fraghdr into ipr->iphdr since we want to have the header |
| donatien | 0:b802fc31f1db | 542 | * of the first fragment (for ICMP time exceeded and later, for copying |
| donatien | 0:b802fc31f1db | 543 | * all options, if supported)*/ |
| donatien | 0:b802fc31f1db | 544 | SMEMCPY(&ipr->iphdr, fraghdr, IP_HLEN); |
| donatien | 0:b802fc31f1db | 545 | } |
| donatien | 0:b802fc31f1db | 546 | } |
| donatien | 0:b802fc31f1db | 547 | /* Track the current number of pbufs current 'in-flight', in order to limit |
| donatien | 0:b802fc31f1db | 548 | the number of fragments that may be enqueued at any one time */ |
| donatien | 0:b802fc31f1db | 549 | ip_reass_pbufcount += clen; |
| donatien | 0:b802fc31f1db | 550 | |
| donatien | 0:b802fc31f1db | 551 | /* At this point, we have either created a new entry or pointing |
| donatien | 0:b802fc31f1db | 552 | * to an existing one */ |
| donatien | 0:b802fc31f1db | 553 | |
| donatien | 0:b802fc31f1db | 554 | /* check for 'no more fragments', and update queue entry*/ |
| donatien | 0:b802fc31f1db | 555 | if ((ntohs(IPH_OFFSET(fraghdr)) & IP_MF) == 0) { |
| donatien | 0:b802fc31f1db | 556 | ipr->flags |= IP_REASS_FLAG_LASTFRAG; |
| donatien | 0:b802fc31f1db | 557 | ipr->datagram_len = offset + len; |
| donatien | 0:b802fc31f1db | 558 | LWIP_DEBUGF(IP_REASS_DEBUG, |
| donatien | 0:b802fc31f1db | 559 | ("ip_reass: last fragment seen, total len %"S16_F"\n", |
| donatien | 0:b802fc31f1db | 560 | ipr->datagram_len)); |
| donatien | 0:b802fc31f1db | 561 | } |
| donatien | 0:b802fc31f1db | 562 | /* find the right place to insert this pbuf */ |
| donatien | 0:b802fc31f1db | 563 | /* @todo: trim pbufs if fragments are overlapping */ |
| donatien | 0:b802fc31f1db | 564 | if (ip_reass_chain_frag_into_datagram_and_validate(ipr, p)) { |
| donatien | 0:b802fc31f1db | 565 | /* the totally last fragment (flag more fragments = 0) was received at least |
| donatien | 0:b802fc31f1db | 566 | * once AND all fragments are received */ |
| donatien | 0:b802fc31f1db | 567 | ipr->datagram_len += IP_HLEN; |
| donatien | 0:b802fc31f1db | 568 | |
| donatien | 0:b802fc31f1db | 569 | /* save the second pbuf before copying the header over the pointer */ |
| donatien | 0:b802fc31f1db | 570 | r = ((struct ip_reass_helper*)ipr->p->payload)->next_pbuf; |
| donatien | 0:b802fc31f1db | 571 | |
| donatien | 0:b802fc31f1db | 572 | /* copy the original ip header back to the first pbuf */ |
| donatien | 0:b802fc31f1db | 573 | fraghdr = (struct ip_hdr*)(ipr->p->payload); |
| donatien | 0:b802fc31f1db | 574 | SMEMCPY(fraghdr, &ipr->iphdr, IP_HLEN); |
| donatien | 0:b802fc31f1db | 575 | IPH_LEN_SET(fraghdr, htons(ipr->datagram_len)); |
| donatien | 0:b802fc31f1db | 576 | IPH_OFFSET_SET(fraghdr, 0); |
| donatien | 0:b802fc31f1db | 577 | IPH_CHKSUM_SET(fraghdr, 0); |
| donatien | 0:b802fc31f1db | 578 | /* @todo: do we need to set calculate the correct checksum? */ |
| donatien | 0:b802fc31f1db | 579 | IPH_CHKSUM_SET(fraghdr, inet_chksum(fraghdr, IP_HLEN)); |
| donatien | 0:b802fc31f1db | 580 | |
| donatien | 0:b802fc31f1db | 581 | p = ipr->p; |
| donatien | 0:b802fc31f1db | 582 | |
| donatien | 0:b802fc31f1db | 583 | /* chain together the pbufs contained within the reass_data list. */ |
| donatien | 0:b802fc31f1db | 584 | while(r != NULL) { |
| donatien | 0:b802fc31f1db | 585 | iprh = (struct ip_reass_helper*)r->payload; |
| donatien | 0:b802fc31f1db | 586 | |
| donatien | 0:b802fc31f1db | 587 | /* hide the ip header for every succeding fragment */ |
| donatien | 0:b802fc31f1db | 588 | pbuf_header(r, -IP_HLEN); |
| donatien | 0:b802fc31f1db | 589 | pbuf_cat(p, r); |
| donatien | 0:b802fc31f1db | 590 | r = iprh->next_pbuf; |
| donatien | 0:b802fc31f1db | 591 | } |
| donatien | 0:b802fc31f1db | 592 | /* release the sources allocate for the fragment queue entry */ |
| donatien | 0:b802fc31f1db | 593 | ip_reass_dequeue_datagram(ipr, ipr_prev); |
| donatien | 0:b802fc31f1db | 594 | |
| donatien | 0:b802fc31f1db | 595 | /* and adjust the number of pbufs currently queued for reassembly. */ |
| donatien | 0:b802fc31f1db | 596 | ip_reass_pbufcount -= pbuf_clen(p); |
| donatien | 0:b802fc31f1db | 597 | |
| donatien | 0:b802fc31f1db | 598 | /* Return the pbuf chain */ |
| donatien | 0:b802fc31f1db | 599 | return p; |
| donatien | 0:b802fc31f1db | 600 | } |
| donatien | 0:b802fc31f1db | 601 | /* the datagram is not (yet?) reassembled completely */ |
| donatien | 0:b802fc31f1db | 602 | LWIP_DEBUGF(IP_REASS_DEBUG,("ip_reass_pbufcount: %d out\n", ip_reass_pbufcount)); |
| donatien | 0:b802fc31f1db | 603 | return NULL; |
| donatien | 0:b802fc31f1db | 604 | |
| donatien | 0:b802fc31f1db | 605 | nullreturn: |
| donatien | 0:b802fc31f1db | 606 | LWIP_DEBUGF(IP_REASS_DEBUG,("ip_reass: nullreturn\n")); |
| donatien | 0:b802fc31f1db | 607 | IPFRAG_STATS_INC(ip_frag.drop); |
| donatien | 0:b802fc31f1db | 608 | pbuf_free(p); |
| donatien | 0:b802fc31f1db | 609 | return NULL; |
| donatien | 0:b802fc31f1db | 610 | } |
| donatien | 0:b802fc31f1db | 611 | #endif /* IP_REASSEMBLY */ |
| donatien | 0:b802fc31f1db | 612 | |
| donatien | 0:b802fc31f1db | 613 | #if IP_FRAG |
| donatien | 0:b802fc31f1db | 614 | #if IP_FRAG_USES_STATIC_BUF |
| donatien | 0:b802fc31f1db | 615 | static u8_t buf[LWIP_MEM_ALIGN_SIZE(IP_FRAG_MAX_MTU + MEM_ALIGNMENT - 1)]; |
| donatien | 0:b802fc31f1db | 616 | #endif /* IP_FRAG_USES_STATIC_BUF */ |
| donatien | 0:b802fc31f1db | 617 | |
| donatien | 0:b802fc31f1db | 618 | /** |
| donatien | 0:b802fc31f1db | 619 | * Fragment an IP datagram if too large for the netif. |
| donatien | 0:b802fc31f1db | 620 | * |
| donatien | 0:b802fc31f1db | 621 | * Chop the datagram in MTU sized chunks and send them in order |
| donatien | 0:b802fc31f1db | 622 | * by using a fixed size static memory buffer (PBUF_REF) or |
| donatien | 0:b802fc31f1db | 623 | * point PBUF_REFs into p (depending on IP_FRAG_USES_STATIC_BUF). |
| donatien | 0:b802fc31f1db | 624 | * |
| donatien | 0:b802fc31f1db | 625 | * @param p ip packet to send |
| donatien | 0:b802fc31f1db | 626 | * @param netif the netif on which to send |
| donatien | 0:b802fc31f1db | 627 | * @param dest destination ip address to which to send |
| donatien | 0:b802fc31f1db | 628 | * |
| donatien | 0:b802fc31f1db | 629 | * @return ERR_OK if sent successfully, err_t otherwise |
| donatien | 0:b802fc31f1db | 630 | */ |
| donatien | 0:b802fc31f1db | 631 | err_t |
| donatien | 0:b802fc31f1db | 632 | ip_frag(struct pbuf *p, struct netif *netif, ip_addr_t *dest) |
| donatien | 0:b802fc31f1db | 633 | { |
| donatien | 0:b802fc31f1db | 634 | struct pbuf *rambuf; |
| donatien | 0:b802fc31f1db | 635 | #if IP_FRAG_USES_STATIC_BUF |
| donatien | 0:b802fc31f1db | 636 | struct pbuf *header; |
| donatien | 0:b802fc31f1db | 637 | #else |
| donatien | 0:b802fc31f1db | 638 | struct pbuf *newpbuf; |
| donatien | 0:b802fc31f1db | 639 | struct ip_hdr *original_iphdr; |
| donatien | 0:b802fc31f1db | 640 | #endif |
| donatien | 0:b802fc31f1db | 641 | struct ip_hdr *iphdr; |
| donatien | 0:b802fc31f1db | 642 | u16_t nfb; |
| donatien | 0:b802fc31f1db | 643 | u16_t left, cop; |
| donatien | 0:b802fc31f1db | 644 | u16_t mtu = netif->mtu; |
| donatien | 0:b802fc31f1db | 645 | u16_t ofo, omf; |
| donatien | 0:b802fc31f1db | 646 | u16_t last; |
| donatien | 0:b802fc31f1db | 647 | u16_t poff = IP_HLEN; |
| donatien | 0:b802fc31f1db | 648 | u16_t tmp; |
| donatien | 0:b802fc31f1db | 649 | #if !IP_FRAG_USES_STATIC_BUF |
| donatien | 0:b802fc31f1db | 650 | u16_t newpbuflen = 0; |
| donatien | 0:b802fc31f1db | 651 | u16_t left_to_copy; |
| donatien | 0:b802fc31f1db | 652 | #endif |
| donatien | 0:b802fc31f1db | 653 | |
| donatien | 0:b802fc31f1db | 654 | /* Get a RAM based MTU sized pbuf */ |
| donatien | 0:b802fc31f1db | 655 | #if IP_FRAG_USES_STATIC_BUF |
| donatien | 0:b802fc31f1db | 656 | /* When using a static buffer, we use a PBUF_REF, which we will |
| donatien | 0:b802fc31f1db | 657 | * use to reference the packet (without link header). |
| donatien | 0:b802fc31f1db | 658 | * Layer and length is irrelevant. |
| donatien | 0:b802fc31f1db | 659 | */ |
| donatien | 0:b802fc31f1db | 660 | rambuf = pbuf_alloc(PBUF_LINK, 0, PBUF_REF); |
| donatien | 0:b802fc31f1db | 661 | if (rambuf == NULL) { |
| donatien | 0:b802fc31f1db | 662 | LWIP_DEBUGF(IP_REASS_DEBUG, ("ip_frag: pbuf_alloc(PBUF_LINK, 0, PBUF_REF) failed\n")); |
| donatien | 0:b802fc31f1db | 663 | return ERR_MEM; |
| donatien | 0:b802fc31f1db | 664 | } |
| donatien | 0:b802fc31f1db | 665 | rambuf->tot_len = rambuf->len = mtu; |
| donatien | 0:b802fc31f1db | 666 | rambuf->payload = LWIP_MEM_ALIGN((void *)buf); |
| donatien | 0:b802fc31f1db | 667 | |
| donatien | 0:b802fc31f1db | 668 | /* Copy the IP header in it */ |
| donatien | 0:b802fc31f1db | 669 | iphdr = (struct ip_hdr*) rambuf->payload; |
| donatien | 0:b802fc31f1db | 670 | SMEMCPY(iphdr, p->payload, IP_HLEN); |
| donatien | 0:b802fc31f1db | 671 | #else /* IP_FRAG_USES_STATIC_BUF */ |
| donatien | 0:b802fc31f1db | 672 | original_iphdr = (struct ip_hdr*) p->payload; |
| donatien | 0:b802fc31f1db | 673 | iphdr = original_iphdr; |
| donatien | 0:b802fc31f1db | 674 | #endif /* IP_FRAG_USES_STATIC_BUF */ |
| donatien | 0:b802fc31f1db | 675 | |
| donatien | 0:b802fc31f1db | 676 | /* Save original offset */ |
| donatien | 0:b802fc31f1db | 677 | tmp = ntohs(IPH_OFFSET(iphdr)); |
| donatien | 0:b802fc31f1db | 678 | ofo = tmp & IP_OFFMASK; |
| donatien | 0:b802fc31f1db | 679 | omf = tmp & IP_MF; |
| donatien | 0:b802fc31f1db | 680 | |
| donatien | 0:b802fc31f1db | 681 | left = p->tot_len - IP_HLEN; |
| donatien | 0:b802fc31f1db | 682 | |
| donatien | 0:b802fc31f1db | 683 | nfb = (mtu - IP_HLEN) / 8; |
| donatien | 0:b802fc31f1db | 684 | |
| donatien | 0:b802fc31f1db | 685 | while (left) { |
| donatien | 0:b802fc31f1db | 686 | last = (left <= mtu - IP_HLEN); |
| donatien | 0:b802fc31f1db | 687 | |
| donatien | 0:b802fc31f1db | 688 | /* Set new offset and MF flag */ |
| donatien | 0:b802fc31f1db | 689 | tmp = omf | (IP_OFFMASK & (ofo)); |
| donatien | 0:b802fc31f1db | 690 | if (!last) { |
| donatien | 0:b802fc31f1db | 691 | tmp = tmp | IP_MF; |
| donatien | 0:b802fc31f1db | 692 | } |
| donatien | 0:b802fc31f1db | 693 | |
| donatien | 0:b802fc31f1db | 694 | /* Fill this fragment */ |
| donatien | 0:b802fc31f1db | 695 | cop = last ? left : nfb * 8; |
| donatien | 0:b802fc31f1db | 696 | |
| donatien | 0:b802fc31f1db | 697 | #if IP_FRAG_USES_STATIC_BUF |
| donatien | 0:b802fc31f1db | 698 | poff += pbuf_copy_partial(p, (u8_t*)iphdr + IP_HLEN, cop, poff); |
| donatien | 0:b802fc31f1db | 699 | #else /* IP_FRAG_USES_STATIC_BUF */ |
| donatien | 0:b802fc31f1db | 700 | /* When not using a static buffer, create a chain of pbufs. |
| donatien | 0:b802fc31f1db | 701 | * The first will be a PBUF_RAM holding the link and IP header. |
| donatien | 0:b802fc31f1db | 702 | * The rest will be PBUF_REFs mirroring the pbuf chain to be fragged, |
| donatien | 0:b802fc31f1db | 703 | * but limited to the size of an mtu. |
| donatien | 0:b802fc31f1db | 704 | */ |
| donatien | 0:b802fc31f1db | 705 | rambuf = pbuf_alloc(PBUF_LINK, IP_HLEN, PBUF_RAM); |
| donatien | 0:b802fc31f1db | 706 | if (rambuf == NULL) { |
| donatien | 0:b802fc31f1db | 707 | return ERR_MEM; |
| donatien | 0:b802fc31f1db | 708 | } |
| donatien | 0:b802fc31f1db | 709 | LWIP_ASSERT("this needs a pbuf in one piece!", |
| donatien | 0:b802fc31f1db | 710 | (p->len >= (IP_HLEN))); |
| donatien | 0:b802fc31f1db | 711 | SMEMCPY(rambuf->payload, original_iphdr, IP_HLEN); |
| donatien | 0:b802fc31f1db | 712 | iphdr = (struct ip_hdr*) rambuf->payload; |
| donatien | 0:b802fc31f1db | 713 | |
| donatien | 0:b802fc31f1db | 714 | /* Can just adjust p directly for needed offset. */ |
| donatien | 0:b802fc31f1db | 715 | p->payload = (u8_t *)p->payload + poff; |
| donatien | 0:b802fc31f1db | 716 | p->len -= poff; |
| donatien | 0:b802fc31f1db | 717 | |
| donatien | 0:b802fc31f1db | 718 | left_to_copy = cop; |
| donatien | 0:b802fc31f1db | 719 | while (left_to_copy) { |
| donatien | 0:b802fc31f1db | 720 | newpbuflen = (left_to_copy < p->len) ? left_to_copy : p->len; |
| donatien | 0:b802fc31f1db | 721 | /* Is this pbuf already empty? */ |
| donatien | 0:b802fc31f1db | 722 | if (!newpbuflen) { |
| donatien | 0:b802fc31f1db | 723 | p = p->next; |
| donatien | 0:b802fc31f1db | 724 | continue; |
| donatien | 0:b802fc31f1db | 725 | } |
| donatien | 0:b802fc31f1db | 726 | newpbuf = pbuf_alloc(PBUF_RAW, 0, PBUF_REF); |
| donatien | 0:b802fc31f1db | 727 | if (newpbuf == NULL) { |
| donatien | 0:b802fc31f1db | 728 | pbuf_free(rambuf); |
| donatien | 0:b802fc31f1db | 729 | return ERR_MEM; |
| donatien | 0:b802fc31f1db | 730 | } |
| donatien | 0:b802fc31f1db | 731 | /* Mirror this pbuf, although we might not need all of it. */ |
| donatien | 0:b802fc31f1db | 732 | newpbuf->payload = p->payload; |
| donatien | 0:b802fc31f1db | 733 | newpbuf->len = newpbuf->tot_len = newpbuflen; |
| donatien | 0:b802fc31f1db | 734 | /* Add it to end of rambuf's chain, but using pbuf_cat, not pbuf_chain |
| donatien | 0:b802fc31f1db | 735 | * so that it is removed when pbuf_dechain is later called on rambuf. |
| donatien | 0:b802fc31f1db | 736 | */ |
| donatien | 0:b802fc31f1db | 737 | pbuf_cat(rambuf, newpbuf); |
| donatien | 0:b802fc31f1db | 738 | left_to_copy -= newpbuflen; |
| donatien | 0:b802fc31f1db | 739 | if (left_to_copy) { |
| donatien | 0:b802fc31f1db | 740 | p = p->next; |
| donatien | 0:b802fc31f1db | 741 | } |
| donatien | 0:b802fc31f1db | 742 | } |
| donatien | 0:b802fc31f1db | 743 | poff = newpbuflen; |
| donatien | 0:b802fc31f1db | 744 | #endif /* IP_FRAG_USES_STATIC_BUF */ |
| donatien | 0:b802fc31f1db | 745 | |
| donatien | 0:b802fc31f1db | 746 | /* Correct header */ |
| donatien | 0:b802fc31f1db | 747 | IPH_OFFSET_SET(iphdr, htons(tmp)); |
| donatien | 0:b802fc31f1db | 748 | IPH_LEN_SET(iphdr, htons(cop + IP_HLEN)); |
| donatien | 0:b802fc31f1db | 749 | IPH_CHKSUM_SET(iphdr, 0); |
| donatien | 0:b802fc31f1db | 750 | IPH_CHKSUM_SET(iphdr, inet_chksum(iphdr, IP_HLEN)); |
| donatien | 0:b802fc31f1db | 751 | |
| donatien | 0:b802fc31f1db | 752 | #if IP_FRAG_USES_STATIC_BUF |
| donatien | 0:b802fc31f1db | 753 | if (last) { |
| donatien | 0:b802fc31f1db | 754 | pbuf_realloc(rambuf, left + IP_HLEN); |
| donatien | 0:b802fc31f1db | 755 | } |
| donatien | 0:b802fc31f1db | 756 | |
| donatien | 0:b802fc31f1db | 757 | /* This part is ugly: we alloc a RAM based pbuf for |
| donatien | 0:b802fc31f1db | 758 | * the link level header for each chunk and then |
| donatien | 0:b802fc31f1db | 759 | * free it.A PBUF_ROM style pbuf for which pbuf_header |
| donatien | 0:b802fc31f1db | 760 | * worked would make things simpler. |
| donatien | 0:b802fc31f1db | 761 | */ |
| donatien | 0:b802fc31f1db | 762 | header = pbuf_alloc(PBUF_LINK, 0, PBUF_RAM); |
| donatien | 0:b802fc31f1db | 763 | if (header != NULL) { |
| donatien | 0:b802fc31f1db | 764 | pbuf_chain(header, rambuf); |
| donatien | 0:b802fc31f1db | 765 | netif->output(netif, header, dest); |
| donatien | 0:b802fc31f1db | 766 | IPFRAG_STATS_INC(ip_frag.xmit); |
| donatien | 0:b802fc31f1db | 767 | snmp_inc_ipfragcreates(); |
| donatien | 0:b802fc31f1db | 768 | pbuf_free(header); |
| donatien | 0:b802fc31f1db | 769 | } else { |
| donatien | 0:b802fc31f1db | 770 | LWIP_DEBUGF(IP_REASS_DEBUG, ("ip_frag: pbuf_alloc() for header failed\n")); |
| donatien | 0:b802fc31f1db | 771 | pbuf_free(rambuf); |
| donatien | 0:b802fc31f1db | 772 | return ERR_MEM; |
| donatien | 0:b802fc31f1db | 773 | } |
| donatien | 0:b802fc31f1db | 774 | #else /* IP_FRAG_USES_STATIC_BUF */ |
| donatien | 0:b802fc31f1db | 775 | /* No need for separate header pbuf - we allowed room for it in rambuf |
| donatien | 0:b802fc31f1db | 776 | * when allocated. |
| donatien | 0:b802fc31f1db | 777 | */ |
| donatien | 0:b802fc31f1db | 778 | netif->output(netif, rambuf, dest); |
| donatien | 0:b802fc31f1db | 779 | IPFRAG_STATS_INC(ip_frag.xmit); |
| donatien | 0:b802fc31f1db | 780 | |
| donatien | 0:b802fc31f1db | 781 | /* Unfortunately we can't reuse rambuf - the hardware may still be |
| donatien | 0:b802fc31f1db | 782 | * using the buffer. Instead we free it (and the ensuing chain) and |
| donatien | 0:b802fc31f1db | 783 | * recreate it next time round the loop. If we're lucky the hardware |
| donatien | 0:b802fc31f1db | 784 | * will have already sent the packet, the free will really free, and |
| donatien | 0:b802fc31f1db | 785 | * there will be zero memory penalty. |
| donatien | 0:b802fc31f1db | 786 | */ |
| donatien | 0:b802fc31f1db | 787 | |
| donatien | 0:b802fc31f1db | 788 | pbuf_free(rambuf); |
| donatien | 0:b802fc31f1db | 789 | #endif /* IP_FRAG_USES_STATIC_BUF */ |
| donatien | 0:b802fc31f1db | 790 | left -= cop; |
| donatien | 0:b802fc31f1db | 791 | ofo += nfb; |
| donatien | 0:b802fc31f1db | 792 | } |
| donatien | 0:b802fc31f1db | 793 | #if IP_FRAG_USES_STATIC_BUF |
| donatien | 0:b802fc31f1db | 794 | pbuf_free(rambuf); |
| donatien | 0:b802fc31f1db | 795 | #endif /* IP_FRAG_USES_STATIC_BUF */ |
| donatien | 0:b802fc31f1db | 796 | snmp_inc_ipfragoks(); |
| donatien | 0:b802fc31f1db | 797 | return ERR_OK; |
| donatien | 0:b802fc31f1db | 798 | } |
| donatien | 0:b802fc31f1db | 799 | #endif /* IP_FRAG */ |