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