Adam Green / EthernetInterface

Deprecated fork of old network stack source from github. Please use official library instead: https://mbed.org/users/mbed_official/code/EthernetInterface/

lwip/core/pbuf.c@1:eadc868c2acf, 2013-10-26 (annotated)

Committer:
AdamGreen
Date:
Sat Oct 26 08:51:36 2013 +0000
Revision:
1:eadc868c2acf
Parent:
0:3b00827bb0b7 
Fix TCP checksum bug and stranded large TCP segments.

Who changed what in which revision?

UserRevisionLine numberNew contents of line
AdamGreen 0:3b00827bb0b7 1 /**
AdamGreen 0:3b00827bb0b7 2 * @file
AdamGreen 0:3b00827bb0b7 3 * Packet buffer management
AdamGreen 0:3b00827bb0b7 4 *
AdamGreen 0:3b00827bb0b7 5 * Packets are built from the pbuf data structure. It supports dynamic
AdamGreen 0:3b00827bb0b7 6 * memory allocation for packet contents or can reference externally
AdamGreen 0:3b00827bb0b7 7 * managed packet contents both in RAM and ROM. Quick allocation for
AdamGreen 0:3b00827bb0b7 8 * incoming packets is provided through pools with fixed sized pbufs.
AdamGreen 0:3b00827bb0b7 9 *
AdamGreen 0:3b00827bb0b7 10 * A packet may span over multiple pbufs, chained as a singly linked
AdamGreen 0:3b00827bb0b7 11 * list. This is called a "pbuf chain".
AdamGreen 0:3b00827bb0b7 12 *
AdamGreen 0:3b00827bb0b7 13 * Multiple packets may be queued, also using this singly linked list.
AdamGreen 0:3b00827bb0b7 14 * This is called a "packet queue".
AdamGreen 0:3b00827bb0b7 15 *
AdamGreen 0:3b00827bb0b7 16 * So, a packet queue consists of one or more pbuf chains, each of
AdamGreen 0:3b00827bb0b7 17 * which consist of one or more pbufs. CURRENTLY, PACKET QUEUES ARE
AdamGreen 0:3b00827bb0b7 18 * NOT SUPPORTED!!! Use helper structs to queue multiple packets.
AdamGreen 0:3b00827bb0b7 19 *
AdamGreen 0:3b00827bb0b7 20 * The differences between a pbuf chain and a packet queue are very
AdamGreen 0:3b00827bb0b7 21 * precise but subtle.
AdamGreen 0:3b00827bb0b7 22 *
AdamGreen 0:3b00827bb0b7 23 * The last pbuf of a packet has a ->tot_len field that equals the
AdamGreen 0:3b00827bb0b7 24 * ->len field. It can be found by traversing the list. If the last
AdamGreen 0:3b00827bb0b7 25 * pbuf of a packet has a ->next field other than NULL, more packets
AdamGreen 0:3b00827bb0b7 26 * are on the queue.
AdamGreen 0:3b00827bb0b7 27 *
AdamGreen 0:3b00827bb0b7 28 * Therefore, looping through a pbuf of a single packet, has an
AdamGreen 0:3b00827bb0b7 29 * loop end condition (tot_len == p->len), NOT (next == NULL).
AdamGreen 0:3b00827bb0b7 30 */
AdamGreen 0:3b00827bb0b7 31
AdamGreen 0:3b00827bb0b7 32 /*
AdamGreen 0:3b00827bb0b7 33 * Copyright (c) 2001-2004 Swedish Institute of Computer Science.
AdamGreen 0:3b00827bb0b7 34 * All rights reserved.
AdamGreen 0:3b00827bb0b7 35 *
AdamGreen 0:3b00827bb0b7 36 * Redistribution and use in source and binary forms, with or without modification,
AdamGreen 0:3b00827bb0b7 37 * are permitted provided that the following conditions are met:
AdamGreen 0:3b00827bb0b7 38 *
AdamGreen 0:3b00827bb0b7 39 * 1. Redistributions of source code must retain the above copyright notice,
AdamGreen 0:3b00827bb0b7 40 * this list of conditions and the following disclaimer.
AdamGreen 0:3b00827bb0b7 41 * 2. Redistributions in binary form must reproduce the above copyright notice,
AdamGreen 0:3b00827bb0b7 42 * this list of conditions and the following disclaimer in the documentation
AdamGreen 0:3b00827bb0b7 43 * and/or other materials provided with the distribution.
AdamGreen 0:3b00827bb0b7 44 * 3. The name of the author may not be used to endorse or promote products
AdamGreen 0:3b00827bb0b7 45 * derived from this software without specific prior written permission.
AdamGreen 0:3b00827bb0b7 46 *
AdamGreen 0:3b00827bb0b7 47 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
AdamGreen 0:3b00827bb0b7 48 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
AdamGreen 0:3b00827bb0b7 49 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
AdamGreen 0:3b00827bb0b7 50 * SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
AdamGreen 0:3b00827bb0b7 51 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
AdamGreen 0:3b00827bb0b7 52 * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
AdamGreen 0:3b00827bb0b7 53 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
AdamGreen 0:3b00827bb0b7 54 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
AdamGreen 0:3b00827bb0b7 55 * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
AdamGreen 0:3b00827bb0b7 56 * OF SUCH DAMAGE.
AdamGreen 0:3b00827bb0b7 57 *
AdamGreen 0:3b00827bb0b7 58 * This file is part of the lwIP TCP/IP stack.
AdamGreen 0:3b00827bb0b7 59 *
AdamGreen 0:3b00827bb0b7 60 * Author: Adam Dunkels <adam@sics.se>
AdamGreen 0:3b00827bb0b7 61 *
AdamGreen 0:3b00827bb0b7 62 */
AdamGreen 0:3b00827bb0b7 63
AdamGreen 0:3b00827bb0b7 64 #include "lwip/opt.h"
AdamGreen 0:3b00827bb0b7 65
AdamGreen 0:3b00827bb0b7 66 #include "lwip/stats.h"
AdamGreen 0:3b00827bb0b7 67 #include "lwip/def.h"
AdamGreen 0:3b00827bb0b7 68 #include "lwip/mem.h"
AdamGreen 0:3b00827bb0b7 69 #include "lwip/memp.h"
AdamGreen 0:3b00827bb0b7 70 #include "lwip/pbuf.h"
AdamGreen 0:3b00827bb0b7 71 #include "lwip/sys.h"
AdamGreen 0:3b00827bb0b7 72 #include "arch/perf.h"
AdamGreen 0:3b00827bb0b7 73 #if TCP_QUEUE_OOSEQ
AdamGreen 0:3b00827bb0b7 74 #include "lwip/tcp_impl.h"
AdamGreen 0:3b00827bb0b7 75 #endif
AdamGreen 0:3b00827bb0b7 76 #if LWIP_CHECKSUM_ON_COPY
AdamGreen 0:3b00827bb0b7 77 #include "lwip/inet_chksum.h"
AdamGreen 0:3b00827bb0b7 78 #endif
AdamGreen 0:3b00827bb0b7 79
AdamGreen 0:3b00827bb0b7 80 #include <string.h>
AdamGreen 0:3b00827bb0b7 81
AdamGreen 0:3b00827bb0b7 82 #define SIZEOF_STRUCT_PBUF LWIP_MEM_ALIGN_SIZE(sizeof(struct pbuf))
AdamGreen 0:3b00827bb0b7 83 /* Since the pool is created in memp, PBUF_POOL_BUFSIZE will be automatically
AdamGreen 0:3b00827bb0b7 84 aligned there. Therefore, PBUF_POOL_BUFSIZE_ALIGNED can be used here. */
AdamGreen 0:3b00827bb0b7 85 #define PBUF_POOL_BUFSIZE_ALIGNED LWIP_MEM_ALIGN_SIZE(PBUF_POOL_BUFSIZE)
AdamGreen 0:3b00827bb0b7 86
AdamGreen 0:3b00827bb0b7 87 #if !LWIP_TCP || !TCP_QUEUE_OOSEQ || NO_SYS
AdamGreen 0:3b00827bb0b7 88 #define PBUF_POOL_IS_EMPTY()
AdamGreen 0:3b00827bb0b7 89 #else /* !LWIP_TCP || !TCP_QUEUE_OOSEQ || NO_SYS */
AdamGreen 0:3b00827bb0b7 90 /** Define this to 0 to prevent freeing ooseq pbufs when the PBUF_POOL is empty */
AdamGreen 0:3b00827bb0b7 91 #ifndef PBUF_POOL_FREE_OOSEQ
AdamGreen 0:3b00827bb0b7 92 #define PBUF_POOL_FREE_OOSEQ 1
AdamGreen 0:3b00827bb0b7 93 #endif /* PBUF_POOL_FREE_OOSEQ */
AdamGreen 0:3b00827bb0b7 94
AdamGreen 0:3b00827bb0b7 95 #if PBUF_POOL_FREE_OOSEQ
AdamGreen 0:3b00827bb0b7 96 #include "lwip/tcpip.h"
AdamGreen 0:3b00827bb0b7 97 #define PBUF_POOL_IS_EMPTY() pbuf_pool_is_empty()
AdamGreen 0:3b00827bb0b7 98 static u8_t pbuf_free_ooseq_queued;
AdamGreen 0:3b00827bb0b7 99 /**
AdamGreen 0:3b00827bb0b7 100 * Attempt to reclaim some memory from queued out-of-sequence TCP segments
AdamGreen 0:3b00827bb0b7 101 * if we run out of pool pbufs. It's better to give priority to new packets
AdamGreen 0:3b00827bb0b7 102 * if we're running out.
AdamGreen 0:3b00827bb0b7 103 *
AdamGreen 0:3b00827bb0b7 104 * This must be done in the correct thread context therefore this function
AdamGreen 0:3b00827bb0b7 105 * can only be used with NO_SYS=0 and through tcpip_callback.
AdamGreen 0:3b00827bb0b7 106 */
AdamGreen 0:3b00827bb0b7 107 static void
AdamGreen 0:3b00827bb0b7 108 pbuf_free_ooseq(void* arg)
AdamGreen 0:3b00827bb0b7 109 {
AdamGreen 0:3b00827bb0b7 110 struct tcp_pcb* pcb;
AdamGreen 0:3b00827bb0b7 111 SYS_ARCH_DECL_PROTECT(old_level);
AdamGreen 0:3b00827bb0b7 112 LWIP_UNUSED_ARG(arg);
AdamGreen 0:3b00827bb0b7 113
AdamGreen 0:3b00827bb0b7 114 SYS_ARCH_PROTECT(old_level);
AdamGreen 0:3b00827bb0b7 115 pbuf_free_ooseq_queued = 0;
AdamGreen 0:3b00827bb0b7 116 SYS_ARCH_UNPROTECT(old_level);
AdamGreen 0:3b00827bb0b7 117
AdamGreen 0:3b00827bb0b7 118 for (pcb = tcp_active_pcbs; NULL != pcb; pcb = pcb->next) {
AdamGreen 0:3b00827bb0b7 119 if (NULL != pcb->ooseq) {
AdamGreen 0:3b00827bb0b7 120 /** Free the ooseq pbufs of one PCB only */
AdamGreen 0:3b00827bb0b7 121 LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE, ("pbuf_free_ooseq: freeing out-of-sequence pbufs\n"));
AdamGreen 0:3b00827bb0b7 122 tcp_segs_free(pcb->ooseq);
AdamGreen 0:3b00827bb0b7 123 pcb->ooseq = NULL;
AdamGreen 0:3b00827bb0b7 124 return;
AdamGreen 0:3b00827bb0b7 125 }
AdamGreen 0:3b00827bb0b7 126 }
AdamGreen 0:3b00827bb0b7 127 }
AdamGreen 0:3b00827bb0b7 128
AdamGreen 0:3b00827bb0b7 129 /** Queue a call to pbuf_free_ooseq if not already queued. */
AdamGreen 0:3b00827bb0b7 130 static void
AdamGreen 0:3b00827bb0b7 131 pbuf_pool_is_empty(void)
AdamGreen 0:3b00827bb0b7 132 {
AdamGreen 0:3b00827bb0b7 133 u8_t queued;
AdamGreen 0:3b00827bb0b7 134 SYS_ARCH_DECL_PROTECT(old_level);
AdamGreen 0:3b00827bb0b7 135
AdamGreen 0:3b00827bb0b7 136 SYS_ARCH_PROTECT(old_level);
AdamGreen 0:3b00827bb0b7 137 queued = pbuf_free_ooseq_queued;
AdamGreen 0:3b00827bb0b7 138 pbuf_free_ooseq_queued = 1;
AdamGreen 0:3b00827bb0b7 139 SYS_ARCH_UNPROTECT(old_level);
AdamGreen 0:3b00827bb0b7 140
AdamGreen 0:3b00827bb0b7 141 if(!queued) {
AdamGreen 0:3b00827bb0b7 142 /* queue a call to pbuf_free_ooseq if not already queued */
AdamGreen 0:3b00827bb0b7 143 if(tcpip_callback_with_block(pbuf_free_ooseq, NULL, 0) != ERR_OK) {
AdamGreen 0:3b00827bb0b7 144 SYS_ARCH_PROTECT(old_level);
AdamGreen 0:3b00827bb0b7 145 pbuf_free_ooseq_queued = 0;
AdamGreen 0:3b00827bb0b7 146 SYS_ARCH_UNPROTECT(old_level);
AdamGreen 0:3b00827bb0b7 147 }
AdamGreen 0:3b00827bb0b7 148 }
AdamGreen 0:3b00827bb0b7 149 }
AdamGreen 0:3b00827bb0b7 150 #endif /* PBUF_POOL_FREE_OOSEQ */
AdamGreen 0:3b00827bb0b7 151 #endif /* !LWIP_TCP || !TCP_QUEUE_OOSEQ || NO_SYS */
AdamGreen 0:3b00827bb0b7 152
AdamGreen 0:3b00827bb0b7 153 /**
AdamGreen 0:3b00827bb0b7 154 * Allocates a pbuf of the given type (possibly a chain for PBUF_POOL type).
AdamGreen 0:3b00827bb0b7 155 *
AdamGreen 0:3b00827bb0b7 156 * The actual memory allocated for the pbuf is determined by the
AdamGreen 0:3b00827bb0b7 157 * layer at which the pbuf is allocated and the requested size
AdamGreen 0:3b00827bb0b7 158 * (from the size parameter).
AdamGreen 0:3b00827bb0b7 159 *
AdamGreen 0:3b00827bb0b7 160 * @param layer flag to define header size
AdamGreen 0:3b00827bb0b7 161 * @param length size of the pbuf's payload
AdamGreen 0:3b00827bb0b7 162 * @param type this parameter decides how and where the pbuf
AdamGreen 0:3b00827bb0b7 163 * should be allocated as follows:
AdamGreen 0:3b00827bb0b7 164 *
AdamGreen 0:3b00827bb0b7 165 * - PBUF_RAM: buffer memory for pbuf is allocated as one large
AdamGreen 0:3b00827bb0b7 166 * chunk. This includes protocol headers as well.
AdamGreen 0:3b00827bb0b7 167 * - PBUF_ROM: no buffer memory is allocated for the pbuf, even for
AdamGreen 0:3b00827bb0b7 168 * protocol headers. Additional headers must be prepended
AdamGreen 0:3b00827bb0b7 169 * by allocating another pbuf and chain in to the front of
AdamGreen 0:3b00827bb0b7 170 * the ROM pbuf. It is assumed that the memory used is really
AdamGreen 0:3b00827bb0b7 171 * similar to ROM in that it is immutable and will not be
AdamGreen 0:3b00827bb0b7 172 * changed. Memory which is dynamic should generally not
AdamGreen 0:3b00827bb0b7 173 * be attached to PBUF_ROM pbufs. Use PBUF_REF instead.
AdamGreen 0:3b00827bb0b7 174 * - PBUF_REF: no buffer memory is allocated for the pbuf, even for
AdamGreen 0:3b00827bb0b7 175 * protocol headers. It is assumed that the pbuf is only
AdamGreen 0:3b00827bb0b7 176 * being used in a single thread. If the pbuf gets queued,
AdamGreen 0:3b00827bb0b7 177 * then pbuf_take should be called to copy the buffer.
AdamGreen 0:3b00827bb0b7 178 * - PBUF_POOL: the pbuf is allocated as a pbuf chain, with pbufs from
AdamGreen 0:3b00827bb0b7 179 * the pbuf pool that is allocated during pbuf_init().
AdamGreen 0:3b00827bb0b7 180 *
AdamGreen 0:3b00827bb0b7 181 * @return the allocated pbuf. If multiple pbufs where allocated, this
AdamGreen 0:3b00827bb0b7 182 * is the first pbuf of a pbuf chain.
AdamGreen 0:3b00827bb0b7 183 */
AdamGreen 0:3b00827bb0b7 184 struct pbuf *
AdamGreen 0:3b00827bb0b7 185 pbuf_alloc(pbuf_layer layer, u16_t length, pbuf_type type)
AdamGreen 0:3b00827bb0b7 186 {
AdamGreen 0:3b00827bb0b7 187 struct pbuf *p, *q, *r;
AdamGreen 0:3b00827bb0b7 188 u16_t offset;
AdamGreen 0:3b00827bb0b7 189 s32_t rem_len; /* remaining length */
AdamGreen 0:3b00827bb0b7 190 LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE, ("pbuf_alloc(length=%"U16_F")\n", length));
AdamGreen 0:3b00827bb0b7 191
AdamGreen 0:3b00827bb0b7 192 /* determine header offset */
AdamGreen 0:3b00827bb0b7 193 offset = 0;
AdamGreen 0:3b00827bb0b7 194 switch (layer) {
AdamGreen 0:3b00827bb0b7 195 case PBUF_TRANSPORT:
AdamGreen 0:3b00827bb0b7 196 /* add room for transport (often TCP) layer header */
AdamGreen 0:3b00827bb0b7 197 offset += PBUF_TRANSPORT_HLEN;
AdamGreen 0:3b00827bb0b7 198 /* FALLTHROUGH */
AdamGreen 0:3b00827bb0b7 199 case PBUF_IP:
AdamGreen 0:3b00827bb0b7 200 /* add room for IP layer header */
AdamGreen 0:3b00827bb0b7 201 offset += PBUF_IP_HLEN;
AdamGreen 0:3b00827bb0b7 202 /* FALLTHROUGH */
AdamGreen 0:3b00827bb0b7 203 case PBUF_LINK:
AdamGreen 0:3b00827bb0b7 204 /* add room for link layer header */
AdamGreen 0:3b00827bb0b7 205 offset += PBUF_LINK_HLEN;
AdamGreen 0:3b00827bb0b7 206 break;
AdamGreen 0:3b00827bb0b7 207 case PBUF_RAW:
AdamGreen 0:3b00827bb0b7 208 break;
AdamGreen 0:3b00827bb0b7 209 default:
AdamGreen 0:3b00827bb0b7 210 LWIP_ASSERT("pbuf_alloc: bad pbuf layer", 0);
AdamGreen 0:3b00827bb0b7 211 return NULL;
AdamGreen 0:3b00827bb0b7 212 }
AdamGreen 0:3b00827bb0b7 213
AdamGreen 0:3b00827bb0b7 214 switch (type) {
AdamGreen 0:3b00827bb0b7 215 case PBUF_POOL:
AdamGreen 0:3b00827bb0b7 216 /* allocate head of pbuf chain into p */
AdamGreen 0:3b00827bb0b7 217 p = (struct pbuf *)memp_malloc(MEMP_PBUF_POOL);
AdamGreen 0:3b00827bb0b7 218 LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE, ("pbuf_alloc: allocated pbuf %p\n", (void *)p));
AdamGreen 0:3b00827bb0b7 219 if (p == NULL) {
AdamGreen 0:3b00827bb0b7 220 PBUF_POOL_IS_EMPTY();
AdamGreen 0:3b00827bb0b7 221 return NULL;
AdamGreen 0:3b00827bb0b7 222 }
AdamGreen 0:3b00827bb0b7 223 p->type = type;
AdamGreen 0:3b00827bb0b7 224 p->next = NULL;
AdamGreen 0:3b00827bb0b7 225
AdamGreen 0:3b00827bb0b7 226 /* make the payload pointer point 'offset' bytes into pbuf data memory */
AdamGreen 0:3b00827bb0b7 227 p->payload = LWIP_MEM_ALIGN((void *)((u8_t *)p + (SIZEOF_STRUCT_PBUF + offset)));
AdamGreen 0:3b00827bb0b7 228 LWIP_ASSERT("pbuf_alloc: pbuf p->payload properly aligned",
AdamGreen 0:3b00827bb0b7 229 ((mem_ptr_t)p->payload % MEM_ALIGNMENT) == 0);
AdamGreen 0:3b00827bb0b7 230 /* the total length of the pbuf chain is the requested size */
AdamGreen 0:3b00827bb0b7 231 p->tot_len = length;
AdamGreen 0:3b00827bb0b7 232 /* set the length of the first pbuf in the chain */
AdamGreen 0:3b00827bb0b7 233 p->len = LWIP_MIN(length, PBUF_POOL_BUFSIZE_ALIGNED - LWIP_MEM_ALIGN_SIZE(offset));
AdamGreen 0:3b00827bb0b7 234 LWIP_ASSERT("check p->payload + p->len does not overflow pbuf",
AdamGreen 0:3b00827bb0b7 235 ((u8_t*)p->payload + p->len <=
AdamGreen 0:3b00827bb0b7 236 (u8_t*)p + SIZEOF_STRUCT_PBUF + PBUF_POOL_BUFSIZE_ALIGNED));
AdamGreen 0:3b00827bb0b7 237 LWIP_ASSERT("PBUF_POOL_BUFSIZE must be bigger than MEM_ALIGNMENT",
AdamGreen 0:3b00827bb0b7 238 (PBUF_POOL_BUFSIZE_ALIGNED - LWIP_MEM_ALIGN_SIZE(offset)) > 0 );
AdamGreen 0:3b00827bb0b7 239 /* set reference count (needed here in case we fail) */
AdamGreen 0:3b00827bb0b7 240 p->ref = 1;
AdamGreen 0:3b00827bb0b7 241
AdamGreen 0:3b00827bb0b7 242 /* now allocate the tail of the pbuf chain */
AdamGreen 0:3b00827bb0b7 243
AdamGreen 0:3b00827bb0b7 244 /* remember first pbuf for linkage in next iteration */
AdamGreen 0:3b00827bb0b7 245 r = p;
AdamGreen 0:3b00827bb0b7 246 /* remaining length to be allocated */
AdamGreen 0:3b00827bb0b7 247 rem_len = length - p->len;
AdamGreen 0:3b00827bb0b7 248 /* any remaining pbufs to be allocated? */
AdamGreen 0:3b00827bb0b7 249 while (rem_len > 0) {
AdamGreen 0:3b00827bb0b7 250 q = (struct pbuf *)memp_malloc(MEMP_PBUF_POOL);
AdamGreen 0:3b00827bb0b7 251 if (q == NULL) {
AdamGreen 0:3b00827bb0b7 252 PBUF_POOL_IS_EMPTY();
AdamGreen 0:3b00827bb0b7 253 /* free chain so far allocated */
AdamGreen 0:3b00827bb0b7 254 pbuf_free(p);
AdamGreen 0:3b00827bb0b7 255 /* bail out unsuccesfully */
AdamGreen 0:3b00827bb0b7 256 return NULL;
AdamGreen 0:3b00827bb0b7 257 }
AdamGreen 0:3b00827bb0b7 258 q->type = type;
AdamGreen 0:3b00827bb0b7 259 q->flags = 0;
AdamGreen 0:3b00827bb0b7 260 q->next = NULL;
AdamGreen 0:3b00827bb0b7 261 /* make previous pbuf point to this pbuf */
AdamGreen 0:3b00827bb0b7 262 r->next = q;
AdamGreen 0:3b00827bb0b7 263 /* set total length of this pbuf and next in chain */
AdamGreen 0:3b00827bb0b7 264 LWIP_ASSERT("rem_len < max_u16_t", rem_len < 0xffff);
AdamGreen 0:3b00827bb0b7 265 q->tot_len = (u16_t)rem_len;
AdamGreen 0:3b00827bb0b7 266 /* this pbuf length is pool size, unless smaller sized tail */
AdamGreen 0:3b00827bb0b7 267 q->len = LWIP_MIN((u16_t)rem_len, PBUF_POOL_BUFSIZE_ALIGNED);
AdamGreen 0:3b00827bb0b7 268 q->payload = (void *)((u8_t *)q + SIZEOF_STRUCT_PBUF);
AdamGreen 0:3b00827bb0b7 269 LWIP_ASSERT("pbuf_alloc: pbuf q->payload properly aligned",
AdamGreen 0:3b00827bb0b7 270 ((mem_ptr_t)q->payload % MEM_ALIGNMENT) == 0);
AdamGreen 0:3b00827bb0b7 271 LWIP_ASSERT("check p->payload + p->len does not overflow pbuf",
AdamGreen 0:3b00827bb0b7 272 ((u8_t*)p->payload + p->len <=
AdamGreen 0:3b00827bb0b7 273 (u8_t*)p + SIZEOF_STRUCT_PBUF + PBUF_POOL_BUFSIZE_ALIGNED));
AdamGreen 0:3b00827bb0b7 274 q->ref = 1;
AdamGreen 0:3b00827bb0b7 275 /* calculate remaining length to be allocated */
AdamGreen 0:3b00827bb0b7 276 rem_len -= q->len;
AdamGreen 0:3b00827bb0b7 277 /* remember this pbuf for linkage in next iteration */
AdamGreen 0:3b00827bb0b7 278 r = q;
AdamGreen 0:3b00827bb0b7 279 }
AdamGreen 0:3b00827bb0b7 280 /* end of chain */
AdamGreen 0:3b00827bb0b7 281 /*r->next = NULL;*/
AdamGreen 0:3b00827bb0b7 282
AdamGreen 0:3b00827bb0b7 283 break;
AdamGreen 0:3b00827bb0b7 284 case PBUF_RAM:
AdamGreen 0:3b00827bb0b7 285 /* If pbuf is to be allocated in RAM, allocate memory for it. */
AdamGreen 0:3b00827bb0b7 286 p = (struct pbuf*)mem_malloc(LWIP_MEM_ALIGN_SIZE(SIZEOF_STRUCT_PBUF + offset) + LWIP_MEM_ALIGN_SIZE(length));
AdamGreen 0:3b00827bb0b7 287 if (p == NULL) {
AdamGreen 0:3b00827bb0b7 288 return NULL;
AdamGreen 0:3b00827bb0b7 289 }
AdamGreen 0:3b00827bb0b7 290 /* Set up internal structure of the pbuf. */
AdamGreen 0:3b00827bb0b7 291 p->payload = LWIP_MEM_ALIGN((void *)((u8_t *)p + SIZEOF_STRUCT_PBUF + offset));
AdamGreen 0:3b00827bb0b7 292 p->len = p->tot_len = length;
AdamGreen 0:3b00827bb0b7 293 p->next = NULL;
AdamGreen 0:3b00827bb0b7 294 p->type = type;
AdamGreen 0:3b00827bb0b7 295
AdamGreen 0:3b00827bb0b7 296 LWIP_ASSERT("pbuf_alloc: pbuf->payload properly aligned",
AdamGreen 0:3b00827bb0b7 297 ((mem_ptr_t)p->payload % MEM_ALIGNMENT) == 0);
AdamGreen 0:3b00827bb0b7 298 break;
AdamGreen 0:3b00827bb0b7 299 /* pbuf references existing (non-volatile static constant) ROM payload? */
AdamGreen 0:3b00827bb0b7 300 case PBUF_ROM:
AdamGreen 0:3b00827bb0b7 301 /* pbuf references existing (externally allocated) RAM payload? */
AdamGreen 0:3b00827bb0b7 302 case PBUF_REF:
AdamGreen 0:3b00827bb0b7 303 /* only allocate memory for the pbuf structure */
AdamGreen 0:3b00827bb0b7 304 p = (struct pbuf *)memp_malloc(MEMP_PBUF);
AdamGreen 0:3b00827bb0b7 305 if (p == NULL) {
AdamGreen 0:3b00827bb0b7 306 LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_LEVEL_SERIOUS,
AdamGreen 0:3b00827bb0b7 307 ("pbuf_alloc: Could not allocate MEMP_PBUF for PBUF_%s.\n",
AdamGreen 0:3b00827bb0b7 308 (type == PBUF_ROM) ? "ROM" : "REF"));
AdamGreen 0:3b00827bb0b7 309 return NULL;
AdamGreen 0:3b00827bb0b7 310 }
AdamGreen 0:3b00827bb0b7 311 /* caller must set this field properly, afterwards */
AdamGreen 0:3b00827bb0b7 312 p->payload = NULL;
AdamGreen 0:3b00827bb0b7 313 p->len = p->tot_len = length;
AdamGreen 0:3b00827bb0b7 314 p->next = NULL;
AdamGreen 0:3b00827bb0b7 315 p->type = type;
AdamGreen 0:3b00827bb0b7 316 break;
AdamGreen 0:3b00827bb0b7 317 default:
AdamGreen 0:3b00827bb0b7 318 LWIP_ASSERT("pbuf_alloc: erroneous type", 0);
AdamGreen 0:3b00827bb0b7 319 return NULL;
AdamGreen 0:3b00827bb0b7 320 }
AdamGreen 0:3b00827bb0b7 321 /* set reference count */
AdamGreen 0:3b00827bb0b7 322 p->ref = 1;
AdamGreen 0:3b00827bb0b7 323 /* set flags */
AdamGreen 0:3b00827bb0b7 324 p->flags = 0;
AdamGreen 0:3b00827bb0b7 325 LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE, ("pbuf_alloc(length=%"U16_F") == %p\n", length, (void *)p));
AdamGreen 0:3b00827bb0b7 326 return p;
AdamGreen 0:3b00827bb0b7 327 }
AdamGreen 0:3b00827bb0b7 328
AdamGreen 0:3b00827bb0b7 329 #if LWIP_SUPPORT_CUSTOM_PBUF
AdamGreen 0:3b00827bb0b7 330 /** Initialize a custom pbuf (already allocated).
AdamGreen 0:3b00827bb0b7 331 *
AdamGreen 0:3b00827bb0b7 332 * @param layer flag to define header size
AdamGreen 0:3b00827bb0b7 333 * @param length size of the pbuf's payload
AdamGreen 0:3b00827bb0b7 334 * @param type type of the pbuf (only used to treat the pbuf accordingly, as
AdamGreen 0:3b00827bb0b7 335 * this function allocates no memory)
AdamGreen 0:3b00827bb0b7 336 * @param p pointer to the custom pbuf to initialize (already allocated)
AdamGreen 0:3b00827bb0b7 337 * @param payload_mem pointer to the buffer that is used for payload and headers,
AdamGreen 0:3b00827bb0b7 338 * must be at least big enough to hold 'length' plus the header size,
AdamGreen 0:3b00827bb0b7 339 * may be NULL if set later
AdamGreen 0:3b00827bb0b7 340 * @param payload_mem_len the size of the 'payload_mem' buffer, must be at least
AdamGreen 0:3b00827bb0b7 341 * big enough to hold 'length' plus the header size
AdamGreen 0:3b00827bb0b7 342 */
AdamGreen 0:3b00827bb0b7 343 struct pbuf*
AdamGreen 0:3b00827bb0b7 344 pbuf_alloced_custom(pbuf_layer l, u16_t length, pbuf_type type, struct pbuf_custom *p,
AdamGreen 0:3b00827bb0b7 345 void *payload_mem, u16_t payload_mem_len)
AdamGreen 0:3b00827bb0b7 346 {
AdamGreen 0:3b00827bb0b7 347 u16_t offset;
AdamGreen 0:3b00827bb0b7 348 LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE, ("pbuf_alloced_custom(length=%"U16_F")\n", length));
AdamGreen 0:3b00827bb0b7 349
AdamGreen 0:3b00827bb0b7 350 /* determine header offset */
AdamGreen 0:3b00827bb0b7 351 offset = 0;
AdamGreen 0:3b00827bb0b7 352 switch (l) {
AdamGreen 0:3b00827bb0b7 353 case PBUF_TRANSPORT:
AdamGreen 0:3b00827bb0b7 354 /* add room for transport (often TCP) layer header */
AdamGreen 0:3b00827bb0b7 355 offset += PBUF_TRANSPORT_HLEN;
AdamGreen 0:3b00827bb0b7 356 /* FALLTHROUGH */
AdamGreen 0:3b00827bb0b7 357 case PBUF_IP:
AdamGreen 0:3b00827bb0b7 358 /* add room for IP layer header */
AdamGreen 0:3b00827bb0b7 359 offset += PBUF_IP_HLEN;
AdamGreen 0:3b00827bb0b7 360 /* FALLTHROUGH */
AdamGreen 0:3b00827bb0b7 361 case PBUF_LINK:
AdamGreen 0:3b00827bb0b7 362 /* add room for link layer header */
AdamGreen 0:3b00827bb0b7 363 offset += PBUF_LINK_HLEN;
AdamGreen 0:3b00827bb0b7 364 break;
AdamGreen 0:3b00827bb0b7 365 case PBUF_RAW:
AdamGreen 0:3b00827bb0b7 366 break;
AdamGreen 0:3b00827bb0b7 367 default:
AdamGreen 0:3b00827bb0b7 368 LWIP_ASSERT("pbuf_alloced_custom: bad pbuf layer", 0);
AdamGreen 0:3b00827bb0b7 369 return NULL;
AdamGreen 0:3b00827bb0b7 370 }
AdamGreen 0:3b00827bb0b7 371
AdamGreen 0:3b00827bb0b7 372 if (LWIP_MEM_ALIGN_SIZE(offset) + length < payload_mem_len) {
AdamGreen 0:3b00827bb0b7 373 LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_LEVEL_WARNING, ("pbuf_alloced_custom(length=%"U16_F") buffer too short\n", length));
AdamGreen 0:3b00827bb0b7 374 return NULL;
AdamGreen 0:3b00827bb0b7 375 }
AdamGreen 0:3b00827bb0b7 376
AdamGreen 0:3b00827bb0b7 377 p->pbuf.next = NULL;
AdamGreen 0:3b00827bb0b7 378 if (payload_mem != NULL) {
AdamGreen 0:3b00827bb0b7 379 p->pbuf.payload = (void *)((u8_t *)payload_mem + offset);
AdamGreen 0:3b00827bb0b7 380 } else {
AdamGreen 0:3b00827bb0b7 381 p->pbuf.payload = NULL;
AdamGreen 0:3b00827bb0b7 382 }
AdamGreen 0:3b00827bb0b7 383 p->pbuf.flags = PBUF_FLAG_IS_CUSTOM;
AdamGreen 0:3b00827bb0b7 384 p->pbuf.len = p->pbuf.tot_len = length;
AdamGreen 0:3b00827bb0b7 385 p->pbuf.type = type;
AdamGreen 0:3b00827bb0b7 386 p->pbuf.ref = 1;
AdamGreen 0:3b00827bb0b7 387 return &p->pbuf;
AdamGreen 0:3b00827bb0b7 388 }
AdamGreen 0:3b00827bb0b7 389 #endif /* LWIP_SUPPORT_CUSTOM_PBUF */
AdamGreen 0:3b00827bb0b7 390
AdamGreen 0:3b00827bb0b7 391 /**
AdamGreen 0:3b00827bb0b7 392 * Shrink a pbuf chain to a desired length.
AdamGreen 0:3b00827bb0b7 393 *
AdamGreen 0:3b00827bb0b7 394 * @param p pbuf to shrink.
AdamGreen 0:3b00827bb0b7 395 * @param new_len desired new length of pbuf chain
AdamGreen 0:3b00827bb0b7 396 *
AdamGreen 0:3b00827bb0b7 397 * Depending on the desired length, the first few pbufs in a chain might
AdamGreen 0:3b00827bb0b7 398 * be skipped and left unchanged. The new last pbuf in the chain will be
AdamGreen 0:3b00827bb0b7 399 * resized, and any remaining pbufs will be freed.
AdamGreen 0:3b00827bb0b7 400 *
AdamGreen 0:3b00827bb0b7 401 * @note If the pbuf is ROM/REF, only the ->tot_len and ->len fields are adjusted.
AdamGreen 0:3b00827bb0b7 402 * @note May not be called on a packet queue.
AdamGreen 0:3b00827bb0b7 403 *
AdamGreen 0:3b00827bb0b7 404 * @note Despite its name, pbuf_realloc cannot grow the size of a pbuf (chain).
AdamGreen 0:3b00827bb0b7 405 */
AdamGreen 0:3b00827bb0b7 406 void
AdamGreen 0:3b00827bb0b7 407 pbuf_realloc(struct pbuf *p, u16_t new_len)
AdamGreen 0:3b00827bb0b7 408 {
AdamGreen 0:3b00827bb0b7 409 struct pbuf *q;
AdamGreen 0:3b00827bb0b7 410 u16_t rem_len; /* remaining length */
AdamGreen 0:3b00827bb0b7 411 s32_t grow;
AdamGreen 0:3b00827bb0b7 412
AdamGreen 0:3b00827bb0b7 413 LWIP_ASSERT("pbuf_realloc: p != NULL", p != NULL);
AdamGreen 0:3b00827bb0b7 414 LWIP_ASSERT("pbuf_realloc: sane p->type", p->type == PBUF_POOL ||
AdamGreen 0:3b00827bb0b7 415 p->type == PBUF_ROM ||
AdamGreen 0:3b00827bb0b7 416 p->type == PBUF_RAM ||
AdamGreen 0:3b00827bb0b7 417 p->type == PBUF_REF);
AdamGreen 0:3b00827bb0b7 418
AdamGreen 0:3b00827bb0b7 419 /* desired length larger than current length? */
AdamGreen 0:3b00827bb0b7 420 if (new_len >= p->tot_len) {
AdamGreen 0:3b00827bb0b7 421 /* enlarging not yet supported */
AdamGreen 0:3b00827bb0b7 422 return;
AdamGreen 0:3b00827bb0b7 423 }
AdamGreen 0:3b00827bb0b7 424
AdamGreen 0:3b00827bb0b7 425 /* the pbuf chain grows by (new_len - p->tot_len) bytes
AdamGreen 0:3b00827bb0b7 426 * (which may be negative in case of shrinking) */
AdamGreen 0:3b00827bb0b7 427 grow = new_len - p->tot_len;
AdamGreen 0:3b00827bb0b7 428
AdamGreen 0:3b00827bb0b7 429 /* first, step over any pbufs that should remain in the chain */
AdamGreen 0:3b00827bb0b7 430 rem_len = new_len;
AdamGreen 0:3b00827bb0b7 431 q = p;
AdamGreen 0:3b00827bb0b7 432 /* should this pbuf be kept? */
AdamGreen 0:3b00827bb0b7 433 while (rem_len > q->len) {
AdamGreen 0:3b00827bb0b7 434 /* decrease remaining length by pbuf length */
AdamGreen 0:3b00827bb0b7 435 rem_len -= q->len;
AdamGreen 0:3b00827bb0b7 436 /* decrease total length indicator */
AdamGreen 0:3b00827bb0b7 437 LWIP_ASSERT("grow < max_u16_t", grow < 0xffff);
AdamGreen 0:3b00827bb0b7 438 q->tot_len += (u16_t)grow;
AdamGreen 0:3b00827bb0b7 439 /* proceed to next pbuf in chain */
AdamGreen 0:3b00827bb0b7 440 q = q->next;
AdamGreen 0:3b00827bb0b7 441 LWIP_ASSERT("pbuf_realloc: q != NULL", q != NULL);
AdamGreen 0:3b00827bb0b7 442 }
AdamGreen 0:3b00827bb0b7 443 /* we have now reached the new last pbuf (in q) */
AdamGreen 0:3b00827bb0b7 444 /* rem_len == desired length for pbuf q */
AdamGreen 0:3b00827bb0b7 445
AdamGreen 0:3b00827bb0b7 446 /* shrink allocated memory for PBUF_RAM */
AdamGreen 0:3b00827bb0b7 447 /* (other types merely adjust their length fields */
AdamGreen 0:3b00827bb0b7 448 if ((q->type == PBUF_RAM) && (rem_len != q->len)) {
AdamGreen 0:3b00827bb0b7 449 /* reallocate and adjust the length of the pbuf that will be split */
AdamGreen 0:3b00827bb0b7 450 q = (struct pbuf *)mem_trim(q, (u16_t)((u8_t *)q->payload - (u8_t *)q) + rem_len);
AdamGreen 0:3b00827bb0b7 451 LWIP_ASSERT("mem_trim returned q == NULL", q != NULL);
AdamGreen 0:3b00827bb0b7 452 }
AdamGreen 0:3b00827bb0b7 453 /* adjust length fields for new last pbuf */
AdamGreen 0:3b00827bb0b7 454 q->len = rem_len;
AdamGreen 0:3b00827bb0b7 455 q->tot_len = q->len;
AdamGreen 0:3b00827bb0b7 456
AdamGreen 0:3b00827bb0b7 457 /* any remaining pbufs in chain? */
AdamGreen 0:3b00827bb0b7 458 if (q->next != NULL) {
AdamGreen 0:3b00827bb0b7 459 /* free remaining pbufs in chain */
AdamGreen 0:3b00827bb0b7 460 pbuf_free(q->next);
AdamGreen 0:3b00827bb0b7 461 }
AdamGreen 0:3b00827bb0b7 462 /* q is last packet in chain */
AdamGreen 0:3b00827bb0b7 463 q->next = NULL;
AdamGreen 0:3b00827bb0b7 464
AdamGreen 0:3b00827bb0b7 465 }
AdamGreen 0:3b00827bb0b7 466
AdamGreen 0:3b00827bb0b7 467 /**
AdamGreen 0:3b00827bb0b7 468 * Adjusts the payload pointer to hide or reveal headers in the payload.
AdamGreen 0:3b00827bb0b7 469 *
AdamGreen 0:3b00827bb0b7 470 * Adjusts the ->payload pointer so that space for a header
AdamGreen 0:3b00827bb0b7 471 * (dis)appears in the pbuf payload.
AdamGreen 0:3b00827bb0b7 472 *
AdamGreen 0:3b00827bb0b7 473 * The ->payload, ->tot_len and ->len fields are adjusted.
AdamGreen 0:3b00827bb0b7 474 *
AdamGreen 0:3b00827bb0b7 475 * @param p pbuf to change the header size.
AdamGreen 0:3b00827bb0b7 476 * @param header_size_increment Number of bytes to increment header size which
AdamGreen 0:3b00827bb0b7 477 * increases the size of the pbuf. New space is on the front.
AdamGreen 0:3b00827bb0b7 478 * (Using a negative value decreases the header size.)
AdamGreen 0:3b00827bb0b7 479 * If hdr_size_inc is 0, this function does nothing and returns succesful.
AdamGreen 0:3b00827bb0b7 480 *
AdamGreen 0:3b00827bb0b7 481 * PBUF_ROM and PBUF_REF type buffers cannot have their sizes increased, so
AdamGreen 0:3b00827bb0b7 482 * the call will fail. A check is made that the increase in header size does
AdamGreen 0:3b00827bb0b7 483 * not move the payload pointer in front of the start of the buffer.
AdamGreen 0:3b00827bb0b7 484 * @return non-zero on failure, zero on success.
AdamGreen 0:3b00827bb0b7 485 *
AdamGreen 0:3b00827bb0b7 486 */
AdamGreen 0:3b00827bb0b7 487 u8_t
AdamGreen 0:3b00827bb0b7 488 pbuf_header(struct pbuf *p, s16_t header_size_increment)
AdamGreen 0:3b00827bb0b7 489 {
AdamGreen 0:3b00827bb0b7 490 u16_t type;
AdamGreen 0:3b00827bb0b7 491 void *payload;
AdamGreen 0:3b00827bb0b7 492 u16_t increment_magnitude;
AdamGreen 0:3b00827bb0b7 493
AdamGreen 0:3b00827bb0b7 494 LWIP_ASSERT("p != NULL", p != NULL);
AdamGreen 0:3b00827bb0b7 495 if ((header_size_increment == 0) || (p == NULL)) {
AdamGreen 0:3b00827bb0b7 496 return 0;
AdamGreen 0:3b00827bb0b7 497 }
AdamGreen 0:3b00827bb0b7 498
AdamGreen 0:3b00827bb0b7 499 if (header_size_increment < 0){
AdamGreen 0:3b00827bb0b7 500 increment_magnitude = -header_size_increment;
AdamGreen 0:3b00827bb0b7 501 /* Check that we aren't going to move off the end of the pbuf */
AdamGreen 0:3b00827bb0b7 502 LWIP_ERROR("increment_magnitude <= p->len", (increment_magnitude <= p->len), return 1;);
AdamGreen 0:3b00827bb0b7 503 } else {
AdamGreen 0:3b00827bb0b7 504 increment_magnitude = header_size_increment;
AdamGreen 0:3b00827bb0b7 505 #if 0
AdamGreen 0:3b00827bb0b7 506 /* Can't assert these as some callers speculatively call
AdamGreen 0:3b00827bb0b7 507 pbuf_header() to see if it's OK. Will return 1 below instead. */
AdamGreen 0:3b00827bb0b7 508 /* Check that we've got the correct type of pbuf to work with */
AdamGreen 0:3b00827bb0b7 509 LWIP_ASSERT("p->type == PBUF_RAM || p->type == PBUF_POOL",
AdamGreen 0:3b00827bb0b7 510 p->type == PBUF_RAM || p->type == PBUF_POOL);
AdamGreen 0:3b00827bb0b7 511 /* Check that we aren't going to move off the beginning of the pbuf */
AdamGreen 0:3b00827bb0b7 512 LWIP_ASSERT("p->payload - increment_magnitude >= p + SIZEOF_STRUCT_PBUF",
AdamGreen 0:3b00827bb0b7 513 (u8_t *)p->payload - increment_magnitude >= (u8_t *)p + SIZEOF_STRUCT_PBUF);
AdamGreen 0:3b00827bb0b7 514 #endif
AdamGreen 0:3b00827bb0b7 515 }
AdamGreen 0:3b00827bb0b7 516
AdamGreen 0:3b00827bb0b7 517 type = p->type;
AdamGreen 0:3b00827bb0b7 518 /* remember current payload pointer */
AdamGreen 0:3b00827bb0b7 519 payload = p->payload;
AdamGreen 0:3b00827bb0b7 520
AdamGreen 0:3b00827bb0b7 521 /* pbuf types containing payloads? */
AdamGreen 0:3b00827bb0b7 522 if (type == PBUF_RAM || type == PBUF_POOL) {
AdamGreen 0:3b00827bb0b7 523 /* set new payload pointer */
AdamGreen 0:3b00827bb0b7 524 p->payload = (u8_t *)p->payload - header_size_increment;
AdamGreen 0:3b00827bb0b7 525 /* boundary check fails? */
AdamGreen 0:3b00827bb0b7 526 if ((u8_t *)p->payload < (u8_t *)p + SIZEOF_STRUCT_PBUF) {
AdamGreen 0:3b00827bb0b7 527 LWIP_DEBUGF( PBUF_DEBUG | LWIP_DBG_LEVEL_SERIOUS,
AdamGreen 0:3b00827bb0b7 528 ("pbuf_header: failed as %p < %p (not enough space for new header size)\n",
AdamGreen 0:3b00827bb0b7 529 (void *)p->payload, (void *)(p + 1)));
AdamGreen 0:3b00827bb0b7 530 /* restore old payload pointer */
AdamGreen 0:3b00827bb0b7 531 p->payload = payload;
AdamGreen 0:3b00827bb0b7 532 /* bail out unsuccesfully */
AdamGreen 0:3b00827bb0b7 533 return 1;
AdamGreen 0:3b00827bb0b7 534 }
AdamGreen 0:3b00827bb0b7 535 /* pbuf types refering to external payloads? */
AdamGreen 0:3b00827bb0b7 536 } else if (type == PBUF_REF || type == PBUF_ROM) {
AdamGreen 0:3b00827bb0b7 537 /* hide a header in the payload? */
AdamGreen 0:3b00827bb0b7 538 if ((header_size_increment < 0) && (increment_magnitude <= p->len)) {
AdamGreen 0:3b00827bb0b7 539 /* increase payload pointer */
AdamGreen 0:3b00827bb0b7 540 p->payload = (u8_t *)p->payload - header_size_increment;
AdamGreen 0:3b00827bb0b7 541 } else {
AdamGreen 0:3b00827bb0b7 542 /* cannot expand payload to front (yet!)
AdamGreen 0:3b00827bb0b7 543 * bail out unsuccesfully */
AdamGreen 0:3b00827bb0b7 544 return 1;
AdamGreen 0:3b00827bb0b7 545 }
AdamGreen 0:3b00827bb0b7 546 } else {
AdamGreen 0:3b00827bb0b7 547 /* Unknown type */
AdamGreen 0:3b00827bb0b7 548 LWIP_ASSERT("bad pbuf type", 0);
AdamGreen 0:3b00827bb0b7 549 return 1;
AdamGreen 0:3b00827bb0b7 550 }
AdamGreen 0:3b00827bb0b7 551 /* modify pbuf length fields */
AdamGreen 0:3b00827bb0b7 552 p->len += header_size_increment;
AdamGreen 0:3b00827bb0b7 553 p->tot_len += header_size_increment;
AdamGreen 0:3b00827bb0b7 554
AdamGreen 0:3b00827bb0b7 555 LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE, ("pbuf_header: old %p new %p (%"S16_F")\n",
AdamGreen 0:3b00827bb0b7 556 (void *)payload, (void *)p->payload, header_size_increment));
AdamGreen 0:3b00827bb0b7 557
AdamGreen 0:3b00827bb0b7 558 return 0;
AdamGreen 0:3b00827bb0b7 559 }
AdamGreen 0:3b00827bb0b7 560
AdamGreen 0:3b00827bb0b7 561 /**
AdamGreen 0:3b00827bb0b7 562 * Dereference a pbuf chain or queue and deallocate any no-longer-used
AdamGreen 0:3b00827bb0b7 563 * pbufs at the head of this chain or queue.
AdamGreen 0:3b00827bb0b7 564 *
AdamGreen 0:3b00827bb0b7 565 * Decrements the pbuf reference count. If it reaches zero, the pbuf is
AdamGreen 0:3b00827bb0b7 566 * deallocated.
AdamGreen 0:3b00827bb0b7 567 *
AdamGreen 0:3b00827bb0b7 568 * For a pbuf chain, this is repeated for each pbuf in the chain,
AdamGreen 0:3b00827bb0b7 569 * up to the first pbuf which has a non-zero reference count after
AdamGreen 0:3b00827bb0b7 570 * decrementing. So, when all reference counts are one, the whole
AdamGreen 0:3b00827bb0b7 571 * chain is free'd.
AdamGreen 0:3b00827bb0b7 572 *
AdamGreen 0:3b00827bb0b7 573 * @param p The pbuf (chain) to be dereferenced.
AdamGreen 0:3b00827bb0b7 574 *
AdamGreen 0:3b00827bb0b7 575 * @return the number of pbufs that were de-allocated
AdamGreen 0:3b00827bb0b7 576 * from the head of the chain.
AdamGreen 0:3b00827bb0b7 577 *
AdamGreen 0:3b00827bb0b7 578 * @note MUST NOT be called on a packet queue (Not verified to work yet).
AdamGreen 0:3b00827bb0b7 579 * @note the reference counter of a pbuf equals the number of pointers
AdamGreen 0:3b00827bb0b7 580 * that refer to the pbuf (or into the pbuf).
AdamGreen 0:3b00827bb0b7 581 *
AdamGreen 0:3b00827bb0b7 582 * @internal examples:
AdamGreen 0:3b00827bb0b7 583 *
AdamGreen 0:3b00827bb0b7 584 * Assuming existing chains a->b->c with the following reference
AdamGreen 0:3b00827bb0b7 585 * counts, calling pbuf_free(a) results in:
AdamGreen 0:3b00827bb0b7 586 *
AdamGreen 0:3b00827bb0b7 587 * 1->2->3 becomes ...1->3
AdamGreen 0:3b00827bb0b7 588 * 3->3->3 becomes 2->3->3
AdamGreen 0:3b00827bb0b7 589 * 1->1->2 becomes ......1
AdamGreen 0:3b00827bb0b7 590 * 2->1->1 becomes 1->1->1
AdamGreen 0:3b00827bb0b7 591 * 1->1->1 becomes .......
AdamGreen 0:3b00827bb0b7 592 *
AdamGreen 0:3b00827bb0b7 593 */
AdamGreen 0:3b00827bb0b7 594 u8_t
AdamGreen 0:3b00827bb0b7 595 pbuf_free(struct pbuf *p)
AdamGreen 0:3b00827bb0b7 596 {
AdamGreen 0:3b00827bb0b7 597 u16_t type;
AdamGreen 0:3b00827bb0b7 598 struct pbuf *q;
AdamGreen 0:3b00827bb0b7 599 u8_t count;
AdamGreen 0:3b00827bb0b7 600
AdamGreen 0:3b00827bb0b7 601 if (p == NULL) {
AdamGreen 0:3b00827bb0b7 602 LWIP_ASSERT("p != NULL", p != NULL);
AdamGreen 0:3b00827bb0b7 603 /* if assertions are disabled, proceed with debug output */
AdamGreen 0:3b00827bb0b7 604 LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_LEVEL_SERIOUS,
AdamGreen 0:3b00827bb0b7 605 ("pbuf_free(p == NULL) was called.\n"));
AdamGreen 0:3b00827bb0b7 606 return 0;
AdamGreen 0:3b00827bb0b7 607 }
AdamGreen 0:3b00827bb0b7 608 LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE, ("pbuf_free(%p)\n", (void *)p));
AdamGreen 0:3b00827bb0b7 609
AdamGreen 0:3b00827bb0b7 610 PERF_START;
AdamGreen 0:3b00827bb0b7 611
AdamGreen 0:3b00827bb0b7 612 LWIP_ASSERT("pbuf_free: sane type",
AdamGreen 0:3b00827bb0b7 613 p->type == PBUF_RAM || p->type == PBUF_ROM ||
AdamGreen 0:3b00827bb0b7 614 p->type == PBUF_REF || p->type == PBUF_POOL);
AdamGreen 0:3b00827bb0b7 615
AdamGreen 0:3b00827bb0b7 616 count = 0;
AdamGreen 0:3b00827bb0b7 617 /* de-allocate all consecutive pbufs from the head of the chain that
AdamGreen 0:3b00827bb0b7 618 * obtain a zero reference count after decrementing*/
AdamGreen 0:3b00827bb0b7 619 while (p != NULL) {
AdamGreen 0:3b00827bb0b7 620 u16_t ref;
AdamGreen 0:3b00827bb0b7 621 SYS_ARCH_DECL_PROTECT(old_level);
AdamGreen 0:3b00827bb0b7 622 /* Since decrementing ref cannot be guaranteed to be a single machine operation
AdamGreen 0:3b00827bb0b7 623 * we must protect it. We put the new ref into a local variable to prevent
AdamGreen 0:3b00827bb0b7 624 * further protection. */
AdamGreen 0:3b00827bb0b7 625 SYS_ARCH_PROTECT(old_level);
AdamGreen 0:3b00827bb0b7 626 /* all pbufs in a chain are referenced at least once */
AdamGreen 0:3b00827bb0b7 627 LWIP_ASSERT("pbuf_free: p->ref > 0", p->ref > 0);
AdamGreen 0:3b00827bb0b7 628 /* decrease reference count (number of pointers to pbuf) */
AdamGreen 0:3b00827bb0b7 629 ref = --(p->ref);
AdamGreen 0:3b00827bb0b7 630 SYS_ARCH_UNPROTECT(old_level);
AdamGreen 0:3b00827bb0b7 631 /* this pbuf is no longer referenced to? */
AdamGreen 0:3b00827bb0b7 632 if (ref == 0) {
AdamGreen 0:3b00827bb0b7 633 /* remember next pbuf in chain for next iteration */
AdamGreen 0:3b00827bb0b7 634 q = p->next;
AdamGreen 0:3b00827bb0b7 635 LWIP_DEBUGF( PBUF_DEBUG | LWIP_DBG_TRACE, ("pbuf_free: deallocating %p\n", (void *)p));
AdamGreen 0:3b00827bb0b7 636 type = p->type;
AdamGreen 0:3b00827bb0b7 637 #if LWIP_SUPPORT_CUSTOM_PBUF
AdamGreen 0:3b00827bb0b7 638 /* is this a custom pbuf? */
AdamGreen 0:3b00827bb0b7 639 if ((p->flags & PBUF_FLAG_IS_CUSTOM) != 0) {
AdamGreen 0:3b00827bb0b7 640 struct pbuf_custom *pc = (struct pbuf_custom*)p;
AdamGreen 0:3b00827bb0b7 641 LWIP_ASSERT("pc->custom_free_function != NULL", pc->custom_free_function != NULL);
AdamGreen 0:3b00827bb0b7 642 pc->custom_free_function(p);
AdamGreen 0:3b00827bb0b7 643 } else
AdamGreen 0:3b00827bb0b7 644 #endif /* LWIP_SUPPORT_CUSTOM_PBUF */
AdamGreen 0:3b00827bb0b7 645 {
AdamGreen 0:3b00827bb0b7 646 /* is this a pbuf from the pool? */
AdamGreen 0:3b00827bb0b7 647 if (type == PBUF_POOL) {
AdamGreen 0:3b00827bb0b7 648 memp_free(MEMP_PBUF_POOL, p);
AdamGreen 0:3b00827bb0b7 649 /* is this a ROM or RAM referencing pbuf? */
AdamGreen 0:3b00827bb0b7 650 } else if (type == PBUF_ROM || type == PBUF_REF) {
AdamGreen 0:3b00827bb0b7 651 memp_free(MEMP_PBUF, p);
AdamGreen 0:3b00827bb0b7 652 /* type == PBUF_RAM */
AdamGreen 0:3b00827bb0b7 653 } else {
AdamGreen 0:3b00827bb0b7 654 mem_free(p);
AdamGreen 0:3b00827bb0b7 655 }
AdamGreen 0:3b00827bb0b7 656 }
AdamGreen 0:3b00827bb0b7 657 count++;
AdamGreen 0:3b00827bb0b7 658 /* proceed to next pbuf */
AdamGreen 0:3b00827bb0b7 659 p = q;
AdamGreen 0:3b00827bb0b7 660 /* p->ref > 0, this pbuf is still referenced to */
AdamGreen 0:3b00827bb0b7 661 /* (and so the remaining pbufs in chain as well) */
AdamGreen 0:3b00827bb0b7 662 } else {
AdamGreen 0:3b00827bb0b7 663 LWIP_DEBUGF( PBUF_DEBUG | LWIP_DBG_TRACE, ("pbuf_free: %p has ref %"U16_F", ending here.\n", (void *)p, ref));
AdamGreen 0:3b00827bb0b7 664 /* stop walking through the chain */
AdamGreen 0:3b00827bb0b7 665 p = NULL;
AdamGreen 0:3b00827bb0b7 666 }
AdamGreen 0:3b00827bb0b7 667 }
AdamGreen 0:3b00827bb0b7 668 PERF_STOP("pbuf_free");
AdamGreen 0:3b00827bb0b7 669 /* return number of de-allocated pbufs */
AdamGreen 0:3b00827bb0b7 670 return count;
AdamGreen 0:3b00827bb0b7 671 }
AdamGreen 0:3b00827bb0b7 672
AdamGreen 0:3b00827bb0b7 673 /**
AdamGreen 0:3b00827bb0b7 674 * Count number of pbufs in a chain
AdamGreen 0:3b00827bb0b7 675 *
AdamGreen 0:3b00827bb0b7 676 * @param p first pbuf of chain
AdamGreen 0:3b00827bb0b7 677 * @return the number of pbufs in a chain
AdamGreen 0:3b00827bb0b7 678 */
AdamGreen 0:3b00827bb0b7 679
AdamGreen 0:3b00827bb0b7 680 u8_t
AdamGreen 0:3b00827bb0b7 681 pbuf_clen(struct pbuf *p)
AdamGreen 0:3b00827bb0b7 682 {
AdamGreen 0:3b00827bb0b7 683 u8_t len;
AdamGreen 0:3b00827bb0b7 684
AdamGreen 0:3b00827bb0b7 685 len = 0;
AdamGreen 0:3b00827bb0b7 686 while (p != NULL) {
AdamGreen 0:3b00827bb0b7 687 ++len;
AdamGreen 0:3b00827bb0b7 688 p = p->next;
AdamGreen 0:3b00827bb0b7 689 }
AdamGreen 0:3b00827bb0b7 690 return len;
AdamGreen 0:3b00827bb0b7 691 }
AdamGreen 0:3b00827bb0b7 692
AdamGreen 0:3b00827bb0b7 693 /**
AdamGreen 0:3b00827bb0b7 694 * Increment the reference count of the pbuf.
AdamGreen 0:3b00827bb0b7 695 *
AdamGreen 0:3b00827bb0b7 696 * @param p pbuf to increase reference counter of
AdamGreen 0:3b00827bb0b7 697 *
AdamGreen 0:3b00827bb0b7 698 */
AdamGreen 0:3b00827bb0b7 699 void
AdamGreen 0:3b00827bb0b7 700 pbuf_ref(struct pbuf *p)
AdamGreen 0:3b00827bb0b7 701 {
AdamGreen 0:3b00827bb0b7 702 SYS_ARCH_DECL_PROTECT(old_level);
AdamGreen 0:3b00827bb0b7 703 /* pbuf given? */
AdamGreen 0:3b00827bb0b7 704 if (p != NULL) {
AdamGreen 0:3b00827bb0b7 705 SYS_ARCH_PROTECT(old_level);
AdamGreen 0:3b00827bb0b7 706 ++(p->ref);
AdamGreen 0:3b00827bb0b7 707 SYS_ARCH_UNPROTECT(old_level);
AdamGreen 0:3b00827bb0b7 708 }
AdamGreen 0:3b00827bb0b7 709 }
AdamGreen 0:3b00827bb0b7 710
AdamGreen 0:3b00827bb0b7 711 /**
AdamGreen 0:3b00827bb0b7 712 * Concatenate two pbufs (each may be a pbuf chain) and take over
AdamGreen 0:3b00827bb0b7 713 * the caller's reference of the tail pbuf.
AdamGreen 0:3b00827bb0b7 714 *
AdamGreen 0:3b00827bb0b7 715 * @note The caller MAY NOT reference the tail pbuf afterwards.
AdamGreen 0:3b00827bb0b7 716 * Use pbuf_chain() for that purpose.
AdamGreen 0:3b00827bb0b7 717 *
AdamGreen 0:3b00827bb0b7 718 * @see pbuf_chain()
AdamGreen 0:3b00827bb0b7 719 */
AdamGreen 0:3b00827bb0b7 720
AdamGreen 0:3b00827bb0b7 721 void
AdamGreen 0:3b00827bb0b7 722 pbuf_cat(struct pbuf *h, struct pbuf *t)
AdamGreen 0:3b00827bb0b7 723 {
AdamGreen 0:3b00827bb0b7 724 struct pbuf *p;
AdamGreen 0:3b00827bb0b7 725
AdamGreen 0:3b00827bb0b7 726 LWIP_ERROR("(h != NULL) && (t != NULL) (programmer violates API)",
AdamGreen 0:3b00827bb0b7 727 ((h != NULL) && (t != NULL)), return;);
AdamGreen 0:3b00827bb0b7 728
AdamGreen 0:3b00827bb0b7 729 /* proceed to last pbuf of chain */
AdamGreen 0:3b00827bb0b7 730 for (p = h; p->next != NULL; p = p->next) {
AdamGreen 0:3b00827bb0b7 731 /* add total length of second chain to all totals of first chain */
AdamGreen 0:3b00827bb0b7 732 p->tot_len += t->tot_len;
AdamGreen 0:3b00827bb0b7 733 }
AdamGreen 0:3b00827bb0b7 734 /* { p is last pbuf of first h chain, p->next == NULL } */
AdamGreen 0:3b00827bb0b7 735 LWIP_ASSERT("p->tot_len == p->len (of last pbuf in chain)", p->tot_len == p->len);
AdamGreen 0:3b00827bb0b7 736 LWIP_ASSERT("p->next == NULL", p->next == NULL);
AdamGreen 0:3b00827bb0b7 737 /* add total length of second chain to last pbuf total of first chain */
AdamGreen 0:3b00827bb0b7 738 p->tot_len += t->tot_len;
AdamGreen 0:3b00827bb0b7 739 /* chain last pbuf of head (p) with first of tail (t) */
AdamGreen 0:3b00827bb0b7 740 p->next = t;
AdamGreen 0:3b00827bb0b7 741 /* p->next now references t, but the caller will drop its reference to t,
AdamGreen 0:3b00827bb0b7 742 * so netto there is no change to the reference count of t.
AdamGreen 0:3b00827bb0b7 743 */
AdamGreen 0:3b00827bb0b7 744 }
AdamGreen 0:3b00827bb0b7 745
AdamGreen 0:3b00827bb0b7 746 /**
AdamGreen 0:3b00827bb0b7 747 * Chain two pbufs (or pbuf chains) together.
AdamGreen 0:3b00827bb0b7 748 *
AdamGreen 0:3b00827bb0b7 749 * The caller MUST call pbuf_free(t) once it has stopped
AdamGreen 0:3b00827bb0b7 750 * using it. Use pbuf_cat() instead if you no longer use t.
AdamGreen 0:3b00827bb0b7 751 *
AdamGreen 0:3b00827bb0b7 752 * @param h head pbuf (chain)
AdamGreen 0:3b00827bb0b7 753 * @param t tail pbuf (chain)
AdamGreen 0:3b00827bb0b7 754 * @note The pbufs MUST belong to the same packet.
AdamGreen 0:3b00827bb0b7 755 * @note MAY NOT be called on a packet queue.
AdamGreen 0:3b00827bb0b7 756 *
AdamGreen 0:3b00827bb0b7 757 * The ->tot_len fields of all pbufs of the head chain are adjusted.
AdamGreen 0:3b00827bb0b7 758 * The ->next field of the last pbuf of the head chain is adjusted.
AdamGreen 0:3b00827bb0b7 759 * The ->ref field of the first pbuf of the tail chain is adjusted.
AdamGreen 0:3b00827bb0b7 760 *
AdamGreen 0:3b00827bb0b7 761 */
AdamGreen 0:3b00827bb0b7 762 void
AdamGreen 0:3b00827bb0b7 763 pbuf_chain(struct pbuf *h, struct pbuf *t)
AdamGreen 0:3b00827bb0b7 764 {
AdamGreen 0:3b00827bb0b7 765 pbuf_cat(h, t);
AdamGreen 0:3b00827bb0b7 766 /* t is now referenced by h */
AdamGreen 0:3b00827bb0b7 767 pbuf_ref(t);
AdamGreen 0:3b00827bb0b7 768 LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE, ("pbuf_chain: %p references %p\n", (void *)h, (void *)t));
AdamGreen 0:3b00827bb0b7 769 }
AdamGreen 0:3b00827bb0b7 770
AdamGreen 0:3b00827bb0b7 771 /**
AdamGreen 0:3b00827bb0b7 772 * Dechains the first pbuf from its succeeding pbufs in the chain.
AdamGreen 0:3b00827bb0b7 773 *
AdamGreen 0:3b00827bb0b7 774 * Makes p->tot_len field equal to p->len.
AdamGreen 0:3b00827bb0b7 775 * @param p pbuf to dechain
AdamGreen 0:3b00827bb0b7 776 * @return remainder of the pbuf chain, or NULL if it was de-allocated.
AdamGreen 0:3b00827bb0b7 777 * @note May not be called on a packet queue.
AdamGreen 0:3b00827bb0b7 778 */
AdamGreen 0:3b00827bb0b7 779 struct pbuf *
AdamGreen 0:3b00827bb0b7 780 pbuf_dechain(struct pbuf *p)
AdamGreen 0:3b00827bb0b7 781 {
AdamGreen 0:3b00827bb0b7 782 struct pbuf *q;
AdamGreen 0:3b00827bb0b7 783 u8_t tail_gone = 1;
AdamGreen 0:3b00827bb0b7 784 /* tail */
AdamGreen 0:3b00827bb0b7 785 q = p->next;
AdamGreen 0:3b00827bb0b7 786 /* pbuf has successor in chain? */
AdamGreen 0:3b00827bb0b7 787 if (q != NULL) {
AdamGreen 0:3b00827bb0b7 788 /* assert tot_len invariant: (p->tot_len == p->len + (p->next? p->next->tot_len: 0) */
AdamGreen 0:3b00827bb0b7 789 LWIP_ASSERT("p->tot_len == p->len + q->tot_len", q->tot_len == p->tot_len - p->len);
AdamGreen 0:3b00827bb0b7 790 /* enforce invariant if assertion is disabled */
AdamGreen 0:3b00827bb0b7 791 q->tot_len = p->tot_len - p->len;
AdamGreen 0:3b00827bb0b7 792 /* decouple pbuf from remainder */
AdamGreen 0:3b00827bb0b7 793 p->next = NULL;
AdamGreen 0:3b00827bb0b7 794 /* total length of pbuf p is its own length only */
AdamGreen 0:3b00827bb0b7 795 p->tot_len = p->len;
AdamGreen 0:3b00827bb0b7 796 /* q is no longer referenced by p, free it */
AdamGreen 0:3b00827bb0b7 797 LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE, ("pbuf_dechain: unreferencing %p\n", (void *)q));
AdamGreen 0:3b00827bb0b7 798 tail_gone = pbuf_free(q);
AdamGreen 0:3b00827bb0b7 799 if (tail_gone > 0) {
AdamGreen 0:3b00827bb0b7 800 LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE,
AdamGreen 0:3b00827bb0b7 801 ("pbuf_dechain: deallocated %p (as it is no longer referenced)\n", (void *)q));
AdamGreen 0:3b00827bb0b7 802 }
AdamGreen 0:3b00827bb0b7 803 /* return remaining tail or NULL if deallocated */
AdamGreen 0:3b00827bb0b7 804 }
AdamGreen 0:3b00827bb0b7 805 /* assert tot_len invariant: (p->tot_len == p->len + (p->next? p->next->tot_len: 0) */
AdamGreen 0:3b00827bb0b7 806 LWIP_ASSERT("p->tot_len == p->len", p->tot_len == p->len);
AdamGreen 0:3b00827bb0b7 807 return ((tail_gone > 0) ? NULL : q);
AdamGreen 0:3b00827bb0b7 808 }
AdamGreen 0:3b00827bb0b7 809
AdamGreen 0:3b00827bb0b7 810 /**
AdamGreen 0:3b00827bb0b7 811 *
AdamGreen 0:3b00827bb0b7 812 * Create PBUF_RAM copies of pbufs.
AdamGreen 0:3b00827bb0b7 813 *
AdamGreen 0:3b00827bb0b7 814 * Used to queue packets on behalf of the lwIP stack, such as
AdamGreen 0:3b00827bb0b7 815 * ARP based queueing.
AdamGreen 0:3b00827bb0b7 816 *
AdamGreen 0:3b00827bb0b7 817 * @note You MUST explicitly use p = pbuf_take(p);
AdamGreen 0:3b00827bb0b7 818 *
AdamGreen 0:3b00827bb0b7 819 * @note Only one packet is copied, no packet queue!
AdamGreen 0:3b00827bb0b7 820 *
AdamGreen 0:3b00827bb0b7 821 * @param p_to pbuf destination of the copy
AdamGreen 0:3b00827bb0b7 822 * @param p_from pbuf source of the copy
AdamGreen 0:3b00827bb0b7 823 *
AdamGreen 0:3b00827bb0b7 824 * @return ERR_OK if pbuf was copied
AdamGreen 0:3b00827bb0b7 825 * ERR_ARG if one of the pbufs is NULL or p_to is not big
AdamGreen 0:3b00827bb0b7 826 * enough to hold p_from
AdamGreen 0:3b00827bb0b7 827 */
AdamGreen 0:3b00827bb0b7 828 err_t
AdamGreen 0:3b00827bb0b7 829 pbuf_copy(struct pbuf *p_to, struct pbuf *p_from)
AdamGreen 0:3b00827bb0b7 830 {
AdamGreen 0:3b00827bb0b7 831 u16_t offset_to=0, offset_from=0, len;
AdamGreen 0:3b00827bb0b7 832
AdamGreen 0:3b00827bb0b7 833 LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE, ("pbuf_copy(%p, %p)\n",
AdamGreen 0:3b00827bb0b7 834 (void*)p_to, (void*)p_from));
AdamGreen 0:3b00827bb0b7 835
AdamGreen 0:3b00827bb0b7 836 /* is the target big enough to hold the source? */
AdamGreen 0:3b00827bb0b7 837 LWIP_ERROR("pbuf_copy: target not big enough to hold source", ((p_to != NULL) &&
AdamGreen 0:3b00827bb0b7 838 (p_from != NULL) && (p_to->tot_len >= p_from->tot_len)), return ERR_ARG;);
AdamGreen 0:3b00827bb0b7 839
AdamGreen 0:3b00827bb0b7 840 /* iterate through pbuf chain */
AdamGreen 0:3b00827bb0b7 841 do
AdamGreen 0:3b00827bb0b7 842 {
AdamGreen 0:3b00827bb0b7 843 LWIP_ASSERT("p_to != NULL", p_to != NULL);
AdamGreen 0:3b00827bb0b7 844 /* copy one part of the original chain */
AdamGreen 0:3b00827bb0b7 845 if ((p_to->len - offset_to) >= (p_from->len - offset_from)) {
AdamGreen 0:3b00827bb0b7 846 /* complete current p_from fits into current p_to */
AdamGreen 0:3b00827bb0b7 847 len = p_from->len - offset_from;
AdamGreen 0:3b00827bb0b7 848 } else {
AdamGreen 0:3b00827bb0b7 849 /* current p_from does not fit into current p_to */
AdamGreen 0:3b00827bb0b7 850 len = p_to->len - offset_to;
AdamGreen 0:3b00827bb0b7 851 }
AdamGreen 0:3b00827bb0b7 852 MEMCPY((u8_t*)p_to->payload + offset_to, (u8_t*)p_from->payload + offset_from, len);
AdamGreen 0:3b00827bb0b7 853 offset_to += len;
AdamGreen 0:3b00827bb0b7 854 offset_from += len;
AdamGreen 0:3b00827bb0b7 855 LWIP_ASSERT("offset_to <= p_to->len", offset_to <= p_to->len);
AdamGreen 0:3b00827bb0b7 856 if (offset_to == p_to->len) {
AdamGreen 0:3b00827bb0b7 857 /* on to next p_to (if any) */
AdamGreen 0:3b00827bb0b7 858 offset_to = 0;
AdamGreen 0:3b00827bb0b7 859 p_to = p_to->next;
AdamGreen 0:3b00827bb0b7 860 }
AdamGreen 0:3b00827bb0b7 861 LWIP_ASSERT("offset_from <= p_from->len", offset_from <= p_from->len);
AdamGreen 0:3b00827bb0b7 862 if (offset_from >= p_from->len) {
AdamGreen 0:3b00827bb0b7 863 /* on to next p_from (if any) */
AdamGreen 0:3b00827bb0b7 864 offset_from = 0;
AdamGreen 0:3b00827bb0b7 865 p_from = p_from->next;
AdamGreen 0:3b00827bb0b7 866 }
AdamGreen 0:3b00827bb0b7 867
AdamGreen 0:3b00827bb0b7 868 if((p_from != NULL) && (p_from->len == p_from->tot_len)) {
AdamGreen 0:3b00827bb0b7 869 /* don't copy more than one packet! */
AdamGreen 0:3b00827bb0b7 870 LWIP_ERROR("pbuf_copy() does not allow packet queues!\n",
AdamGreen 0:3b00827bb0b7 871 (p_from->next == NULL), return ERR_VAL;);
AdamGreen 0:3b00827bb0b7 872 }
AdamGreen 0:3b00827bb0b7 873 if((p_to != NULL) && (p_to->len == p_to->tot_len)) {
AdamGreen 0:3b00827bb0b7 874 /* don't copy more than one packet! */
AdamGreen 0:3b00827bb0b7 875 LWIP_ERROR("pbuf_copy() does not allow packet queues!\n",
AdamGreen 0:3b00827bb0b7 876 (p_to->next == NULL), return ERR_VAL;);
AdamGreen 0:3b00827bb0b7 877 }
AdamGreen 0:3b00827bb0b7 878 } while (p_from);
AdamGreen 0:3b00827bb0b7 879 LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE, ("pbuf_copy: end of chain reached.\n"));
AdamGreen 0:3b00827bb0b7 880 return ERR_OK;
AdamGreen 0:3b00827bb0b7 881 }
AdamGreen 0:3b00827bb0b7 882
AdamGreen 0:3b00827bb0b7 883 /**
AdamGreen 0:3b00827bb0b7 884 * Copy (part of) the contents of a packet buffer
AdamGreen 0:3b00827bb0b7 885 * to an application supplied buffer.
AdamGreen 0:3b00827bb0b7 886 *
AdamGreen 0:3b00827bb0b7 887 * @param buf the pbuf from which to copy data
AdamGreen 0:3b00827bb0b7 888 * @param dataptr the application supplied buffer
AdamGreen 0:3b00827bb0b7 889 * @param len length of data to copy (dataptr must be big enough). No more
AdamGreen 0:3b00827bb0b7 890 * than buf->tot_len will be copied, irrespective of len
AdamGreen 0:3b00827bb0b7 891 * @param offset offset into the packet buffer from where to begin copying len bytes
AdamGreen 0:3b00827bb0b7 892 * @return the number of bytes copied, or 0 on failure
AdamGreen 0:3b00827bb0b7 893 */
AdamGreen 0:3b00827bb0b7 894 u16_t
AdamGreen 0:3b00827bb0b7 895 pbuf_copy_partial(struct pbuf *buf, void *dataptr, u16_t len, u16_t offset)
AdamGreen 0:3b00827bb0b7 896 {
AdamGreen 0:3b00827bb0b7 897 struct pbuf *p;
AdamGreen 0:3b00827bb0b7 898 u16_t left;
AdamGreen 0:3b00827bb0b7 899 u16_t buf_copy_len;
AdamGreen 0:3b00827bb0b7 900 u16_t copied_total = 0;
AdamGreen 0:3b00827bb0b7 901
AdamGreen 0:3b00827bb0b7 902 LWIP_ERROR("pbuf_copy_partial: invalid buf", (buf != NULL), return 0;);
AdamGreen 0:3b00827bb0b7 903 LWIP_ERROR("pbuf_copy_partial: invalid dataptr", (dataptr != NULL), return 0;);
AdamGreen 0:3b00827bb0b7 904
AdamGreen 0:3b00827bb0b7 905 left = 0;
AdamGreen 0:3b00827bb0b7 906
AdamGreen 0:3b00827bb0b7 907 if((buf == NULL) || (dataptr == NULL)) {
AdamGreen 0:3b00827bb0b7 908 return 0;
AdamGreen 0:3b00827bb0b7 909 }
AdamGreen 0:3b00827bb0b7 910
AdamGreen 0:3b00827bb0b7 911 /* Note some systems use byte copy if dataptr or one of the pbuf payload pointers are unaligned. */
AdamGreen 0:3b00827bb0b7 912 for(p = buf; len != 0 && p != NULL; p = p->next) {
AdamGreen 0:3b00827bb0b7 913 if ((offset != 0) && (offset >= p->len)) {
AdamGreen 0:3b00827bb0b7 914 /* don't copy from this buffer -> on to the next */
AdamGreen 0:3b00827bb0b7 915 offset -= p->len;
AdamGreen 0:3b00827bb0b7 916 } else {
AdamGreen 0:3b00827bb0b7 917 /* copy from this buffer. maybe only partially. */
AdamGreen 0:3b00827bb0b7 918 buf_copy_len = p->len - offset;
AdamGreen 0:3b00827bb0b7 919 if (buf_copy_len > len)
AdamGreen 0:3b00827bb0b7 920 buf_copy_len = len;
AdamGreen 0:3b00827bb0b7 921 /* copy the necessary parts of the buffer */
AdamGreen 0:3b00827bb0b7 922 MEMCPY(&((char*)dataptr)[left], &((char*)p->payload)[offset], buf_copy_len);
AdamGreen 0:3b00827bb0b7 923 copied_total += buf_copy_len;
AdamGreen 0:3b00827bb0b7 924 left += buf_copy_len;
AdamGreen 0:3b00827bb0b7 925 len -= buf_copy_len;
AdamGreen 0:3b00827bb0b7 926 offset = 0;
AdamGreen 0:3b00827bb0b7 927 }
AdamGreen 0:3b00827bb0b7 928 }
AdamGreen 0:3b00827bb0b7 929 return copied_total;
AdamGreen 0:3b00827bb0b7 930 }
AdamGreen 0:3b00827bb0b7 931
AdamGreen 0:3b00827bb0b7 932 /**
AdamGreen 0:3b00827bb0b7 933 * Copy application supplied data into a pbuf.
AdamGreen 0:3b00827bb0b7 934 * This function can only be used to copy the equivalent of buf->tot_len data.
AdamGreen 0:3b00827bb0b7 935 *
AdamGreen 0:3b00827bb0b7 936 * @param buf pbuf to fill with data
AdamGreen 0:3b00827bb0b7 937 * @param dataptr application supplied data buffer
AdamGreen 0:3b00827bb0b7 938 * @param len length of the application supplied data buffer
AdamGreen 0:3b00827bb0b7 939 *
AdamGreen 0:3b00827bb0b7 940 * @return ERR_OK if successful, ERR_MEM if the pbuf is not big enough
AdamGreen 0:3b00827bb0b7 941 */
AdamGreen 0:3b00827bb0b7 942 err_t
AdamGreen 0:3b00827bb0b7 943 pbuf_take(struct pbuf *buf, const void *dataptr, u16_t len)
AdamGreen 0:3b00827bb0b7 944 {
AdamGreen 0:3b00827bb0b7 945 struct pbuf *p;
AdamGreen 0:3b00827bb0b7 946 u16_t buf_copy_len;
AdamGreen 0:3b00827bb0b7 947 u16_t total_copy_len = len;
AdamGreen 0:3b00827bb0b7 948 u16_t copied_total = 0;
AdamGreen 0:3b00827bb0b7 949
AdamGreen 0:3b00827bb0b7 950 LWIP_ERROR("pbuf_take: invalid buf", (buf != NULL), return 0;);
AdamGreen 0:3b00827bb0b7 951 LWIP_ERROR("pbuf_take: invalid dataptr", (dataptr != NULL), return 0;);
AdamGreen 0:3b00827bb0b7 952
AdamGreen 0:3b00827bb0b7 953 if ((buf == NULL) || (dataptr == NULL) || (buf->tot_len < len)) {
AdamGreen 0:3b00827bb0b7 954 return ERR_ARG;
AdamGreen 0:3b00827bb0b7 955 }
AdamGreen 0:3b00827bb0b7 956
AdamGreen 0:3b00827bb0b7 957 /* Note some systems use byte copy if dataptr or one of the pbuf payload pointers are unaligned. */
AdamGreen 0:3b00827bb0b7 958 for(p = buf; total_copy_len != 0; p = p->next) {
AdamGreen 0:3b00827bb0b7 959 LWIP_ASSERT("pbuf_take: invalid pbuf", p != NULL);
AdamGreen 0:3b00827bb0b7 960 buf_copy_len = total_copy_len;
AdamGreen 0:3b00827bb0b7 961 if (buf_copy_len > p->len) {
AdamGreen 0:3b00827bb0b7 962 /* this pbuf cannot hold all remaining data */
AdamGreen 0:3b00827bb0b7 963 buf_copy_len = p->len;
AdamGreen 0:3b00827bb0b7 964 }
AdamGreen 0:3b00827bb0b7 965 /* copy the necessary parts of the buffer */
AdamGreen 0:3b00827bb0b7 966 MEMCPY(p->payload, &((char*)dataptr)[copied_total], buf_copy_len);
AdamGreen 0:3b00827bb0b7 967 total_copy_len -= buf_copy_len;
AdamGreen 0:3b00827bb0b7 968 copied_total += buf_copy_len;
AdamGreen 0:3b00827bb0b7 969 }
AdamGreen 0:3b00827bb0b7 970 LWIP_ASSERT("did not copy all data", total_copy_len == 0 && copied_total == len);
AdamGreen 0:3b00827bb0b7 971 return ERR_OK;
AdamGreen 0:3b00827bb0b7 972 }
AdamGreen 0:3b00827bb0b7 973
AdamGreen 0:3b00827bb0b7 974 /**
AdamGreen 0:3b00827bb0b7 975 * Creates a single pbuf out of a queue of pbufs.
AdamGreen 0:3b00827bb0b7 976 *
AdamGreen 0:3b00827bb0b7 977 * @remark: Either the source pbuf 'p' is freed by this function or the original
AdamGreen 0:3b00827bb0b7 978 * pbuf 'p' is returned, therefore the caller has to check the result!
AdamGreen 0:3b00827bb0b7 979 *
AdamGreen 0:3b00827bb0b7 980 * @param p the source pbuf
AdamGreen 0:3b00827bb0b7 981 * @param layer pbuf_layer of the new pbuf
AdamGreen 0:3b00827bb0b7 982 *
AdamGreen 0:3b00827bb0b7 983 * @return a new, single pbuf (p->next is NULL)
AdamGreen 0:3b00827bb0b7 984 * or the old pbuf if allocation fails
AdamGreen 0:3b00827bb0b7 985 */
AdamGreen 0:3b00827bb0b7 986 struct pbuf*
AdamGreen 0:3b00827bb0b7 987 pbuf_coalesce(struct pbuf *p, pbuf_layer layer)
AdamGreen 0:3b00827bb0b7 988 {
AdamGreen 0:3b00827bb0b7 989 struct pbuf *q;
AdamGreen 0:3b00827bb0b7 990 err_t err;
AdamGreen 0:3b00827bb0b7 991 if (p->next == NULL) {
AdamGreen 0:3b00827bb0b7 992 return p;
AdamGreen 0:3b00827bb0b7 993 }
AdamGreen 0:3b00827bb0b7 994 q = pbuf_alloc(layer, p->tot_len, PBUF_RAM);
AdamGreen 0:3b00827bb0b7 995 if (q == NULL) {
AdamGreen 0:3b00827bb0b7 996 /* @todo: what do we do now? */
AdamGreen 0:3b00827bb0b7 997 return p;
AdamGreen 0:3b00827bb0b7 998 }
AdamGreen 0:3b00827bb0b7 999 err = pbuf_copy(q, p);
AdamGreen 0:3b00827bb0b7 1000 LWIP_ASSERT("pbuf_copy failed", err == ERR_OK);
AdamGreen 0:3b00827bb0b7 1001 /* next line references err variable even if LWIP_ASSERT is ignored. */
AdamGreen 0:3b00827bb0b7 1002 (void)err;
AdamGreen 0:3b00827bb0b7 1003 pbuf_free(p);
AdamGreen 0:3b00827bb0b7 1004 return q;
AdamGreen 0:3b00827bb0b7 1005 }
AdamGreen 0:3b00827bb0b7 1006
AdamGreen 0:3b00827bb0b7 1007 #if LWIP_CHECKSUM_ON_COPY
AdamGreen 0:3b00827bb0b7 1008 /**
AdamGreen 0:3b00827bb0b7 1009 * Copies data into a single pbuf (*not* into a pbuf queue!) and updates
AdamGreen 0:3b00827bb0b7 1010 * the checksum while copying
AdamGreen 0:3b00827bb0b7 1011 *
AdamGreen 0:3b00827bb0b7 1012 * @param p the pbuf to copy data into
AdamGreen 0:3b00827bb0b7 1013 * @param start_offset offset of p->payload where to copy the data to
AdamGreen 0:3b00827bb0b7 1014 * @param dataptr data to copy into the pbuf
AdamGreen 0:3b00827bb0b7 1015 * @param len length of data to copy into the pbuf
AdamGreen 0:3b00827bb0b7 1016 * @param chksum pointer to the checksum which is updated
AdamGreen 0:3b00827bb0b7 1017 * @return ERR_OK if successful, another error if the data does not fit
AdamGreen 0:3b00827bb0b7 1018 * within the (first) pbuf (no pbuf queues!)
AdamGreen 0:3b00827bb0b7 1019 */
AdamGreen 0:3b00827bb0b7 1020 err_t
AdamGreen 0:3b00827bb0b7 1021 pbuf_fill_chksum(struct pbuf *p, u16_t start_offset, const void *dataptr,
AdamGreen 0:3b00827bb0b7 1022 u16_t len, u16_t *chksum)
AdamGreen 0:3b00827bb0b7 1023 {
AdamGreen 0:3b00827bb0b7 1024 u32_t acc;
AdamGreen 0:3b00827bb0b7 1025 u16_t copy_chksum;
AdamGreen 0:3b00827bb0b7 1026 char *dst_ptr;
AdamGreen 0:3b00827bb0b7 1027 LWIP_ASSERT("p != NULL", p != NULL);
AdamGreen 0:3b00827bb0b7 1028 LWIP_ASSERT("dataptr != NULL", dataptr != NULL);
AdamGreen 0:3b00827bb0b7 1029 LWIP_ASSERT("chksum != NULL", chksum != NULL);
AdamGreen 0:3b00827bb0b7 1030 LWIP_ASSERT("len != 0", len != 0);
AdamGreen 0:3b00827bb0b7 1031
AdamGreen 0:3b00827bb0b7 1032 if ((start_offset >= p->len) || (start_offset + len > p->len)) {
AdamGreen 0:3b00827bb0b7 1033 return ERR_ARG;
AdamGreen 0:3b00827bb0b7 1034 }
AdamGreen 0:3b00827bb0b7 1035
AdamGreen 0:3b00827bb0b7 1036 dst_ptr = ((char*)p->payload) + start_offset;
AdamGreen 0:3b00827bb0b7 1037 copy_chksum = LWIP_CHKSUM_COPY(dst_ptr, dataptr, len);
AdamGreen 0:3b00827bb0b7 1038 if ((start_offset & 1) != 0) {
AdamGreen 0:3b00827bb0b7 1039 copy_chksum = SWAP_BYTES_IN_WORD(copy_chksum);
AdamGreen 0:3b00827bb0b7 1040 }
AdamGreen 0:3b00827bb0b7 1041 acc = *chksum;
AdamGreen 0:3b00827bb0b7 1042 acc += copy_chksum;
AdamGreen 0:3b00827bb0b7 1043 *chksum = FOLD_U32T(acc);
AdamGreen 0:3b00827bb0b7 1044 return ERR_OK;
AdamGreen 0:3b00827bb0b7 1045 }
AdamGreen 0:3b00827bb0b7 1046 #endif /* LWIP_CHECKSUM_ON_COPY */
AdamGreen 0:3b00827bb0b7 1047
AdamGreen 0:3b00827bb0b7 1048 /** Get one byte from the specified position in a pbuf
AdamGreen 0:3b00827bb0b7 1049 * WARNING: returns zero for offset >= p->tot_len
AdamGreen 0:3b00827bb0b7 1050 *
AdamGreen 0:3b00827bb0b7 1051 * @param p pbuf to parse
AdamGreen 0:3b00827bb0b7 1052 * @param offset offset into p of the byte to return
AdamGreen 0:3b00827bb0b7 1053 * @return byte at an offset into p OR ZERO IF 'offset' >= p->tot_len
AdamGreen 0:3b00827bb0b7 1054 */
AdamGreen 0:3b00827bb0b7 1055 u8_t
AdamGreen 0:3b00827bb0b7 1056 pbuf_get_at(struct pbuf* p, u16_t offset)
AdamGreen 0:3b00827bb0b7 1057 {
AdamGreen 0:3b00827bb0b7 1058 u16_t copy_from = offset;
AdamGreen 0:3b00827bb0b7 1059 struct pbuf* q = p;
AdamGreen 0:3b00827bb0b7 1060
AdamGreen 0:3b00827bb0b7 1061 /* get the correct pbuf */
AdamGreen 0:3b00827bb0b7 1062 while ((q != NULL) && (q->len <= copy_from)) {
AdamGreen 0:3b00827bb0b7 1063 copy_from -= q->len;
AdamGreen 0:3b00827bb0b7 1064 q = q->next;
AdamGreen 0:3b00827bb0b7 1065 }
AdamGreen 0:3b00827bb0b7 1066 /* return requested data if pbuf is OK */
AdamGreen 0:3b00827bb0b7 1067 if ((q != NULL) && (q->len > copy_from)) {
AdamGreen 0:3b00827bb0b7 1068 return ((u8_t*)q->payload)[copy_from];
AdamGreen 0:3b00827bb0b7 1069 }
AdamGreen 0:3b00827bb0b7 1070 return 0;
AdamGreen 0:3b00827bb0b7 1071 }
AdamGreen 0:3b00827bb0b7 1072
AdamGreen 0:3b00827bb0b7 1073 /** Compare pbuf contents at specified offset with memory s2, both of length n
AdamGreen 0:3b00827bb0b7 1074 *
AdamGreen 0:3b00827bb0b7 1075 * @param p pbuf to compare
AdamGreen 0:3b00827bb0b7 1076 * @param offset offset into p at wich to start comparing
AdamGreen 0:3b00827bb0b7 1077 * @param s2 buffer to compare
AdamGreen 0:3b00827bb0b7 1078 * @param n length of buffer to compare
AdamGreen 0:3b00827bb0b7 1079 * @return zero if equal, nonzero otherwise
AdamGreen 0:3b00827bb0b7 1080 * (0xffff if p is too short, diffoffset+1 otherwise)
AdamGreen 0:3b00827bb0b7 1081 */
AdamGreen 0:3b00827bb0b7 1082 u16_t
AdamGreen 0:3b00827bb0b7 1083 pbuf_memcmp(struct pbuf* p, u16_t offset, const void* s2, u16_t n)
AdamGreen 0:3b00827bb0b7 1084 {
AdamGreen 0:3b00827bb0b7 1085 u16_t start = offset;
AdamGreen 0:3b00827bb0b7 1086 struct pbuf* q = p;
AdamGreen 0:3b00827bb0b7 1087
AdamGreen 0:3b00827bb0b7 1088 /* get the correct pbuf */
AdamGreen 0:3b00827bb0b7 1089 while ((q != NULL) && (q->len <= start)) {
AdamGreen 0:3b00827bb0b7 1090 start -= q->len;
AdamGreen 0:3b00827bb0b7 1091 q = q->next;
AdamGreen 0:3b00827bb0b7 1092 }
AdamGreen 0:3b00827bb0b7 1093 /* return requested data if pbuf is OK */
AdamGreen 0:3b00827bb0b7 1094 if ((q != NULL) && (q->len > start)) {
AdamGreen 0:3b00827bb0b7 1095 u16_t i;
AdamGreen 0:3b00827bb0b7 1096 for(i = 0; i < n; i++) {
AdamGreen 0:3b00827bb0b7 1097 u8_t a = pbuf_get_at(q, start + i);
AdamGreen 0:3b00827bb0b7 1098 u8_t b = ((u8_t*)s2)[i];
AdamGreen 0:3b00827bb0b7 1099 if (a != b) {
AdamGreen 0:3b00827bb0b7 1100 return i+1;
AdamGreen 0:3b00827bb0b7 1101 }
AdamGreen 0:3b00827bb0b7 1102 }
AdamGreen 0:3b00827bb0b7 1103 return 0;
AdamGreen 0:3b00827bb0b7 1104 }
AdamGreen 0:3b00827bb0b7 1105 return 0xffff;
AdamGreen 0:3b00827bb0b7 1106 }
AdamGreen 0:3b00827bb0b7 1107
AdamGreen 0:3b00827bb0b7 1108 /** Find occurrence of mem (with length mem_len) in pbuf p, starting at offset
AdamGreen 0:3b00827bb0b7 1109 * start_offset.
AdamGreen 0:3b00827bb0b7 1110 *
AdamGreen 0:3b00827bb0b7 1111 * @param p pbuf to search, maximum length is 0xFFFE since 0xFFFF is used as
AdamGreen 0:3b00827bb0b7 1112 * return value 'not found'
AdamGreen 0:3b00827bb0b7 1113 * @param mem search for the contents of this buffer
AdamGreen 0:3b00827bb0b7 1114 * @param mem_len length of 'mem'
AdamGreen 0:3b00827bb0b7 1115 * @param start_offset offset into p at which to start searching
AdamGreen 0:3b00827bb0b7 1116 * @return 0xFFFF if substr was not found in p or the index where it was found
AdamGreen 0:3b00827bb0b7 1117 */
AdamGreen 0:3b00827bb0b7 1118 u16_t
AdamGreen 0:3b00827bb0b7 1119 pbuf_memfind(struct pbuf* p, const void* mem, u16_t mem_len, u16_t start_offset)
AdamGreen 0:3b00827bb0b7 1120 {
AdamGreen 0:3b00827bb0b7 1121 u16_t i;
AdamGreen 0:3b00827bb0b7 1122 u16_t max = p->tot_len - mem_len;
AdamGreen 0:3b00827bb0b7 1123 if (p->tot_len >= mem_len + start_offset) {
AdamGreen 0:3b00827bb0b7 1124 for(i = start_offset; i <= max; ) {
AdamGreen 0:3b00827bb0b7 1125 u16_t plus = pbuf_memcmp(p, i, mem, mem_len);
AdamGreen 0:3b00827bb0b7 1126 if (plus == 0) {
AdamGreen 0:3b00827bb0b7 1127 return i;
AdamGreen 0:3b00827bb0b7 1128 } else {
AdamGreen 0:3b00827bb0b7 1129 i += plus;
AdamGreen 0:3b00827bb0b7 1130 }
AdamGreen 0:3b00827bb0b7 1131 }
AdamGreen 0:3b00827bb0b7 1132 }
AdamGreen 0:3b00827bb0b7 1133 return 0xFFFF;
AdamGreen 0:3b00827bb0b7 1134 }
AdamGreen 0:3b00827bb0b7 1135
AdamGreen 0:3b00827bb0b7 1136 /** Find occurrence of substr with length substr_len in pbuf p, start at offset
AdamGreen 0:3b00827bb0b7 1137 * start_offset
AdamGreen 0:3b00827bb0b7 1138 * WARNING: in contrast to strstr(), this one does not stop at the first \0 in
AdamGreen 0:3b00827bb0b7 1139 * the pbuf/source string!
AdamGreen 0:3b00827bb0b7 1140 *
AdamGreen 0:3b00827bb0b7 1141 * @param p pbuf to search, maximum length is 0xFFFE since 0xFFFF is used as
AdamGreen 0:3b00827bb0b7 1142 * return value 'not found'
AdamGreen 0:3b00827bb0b7 1143 * @param substr string to search for in p, maximum length is 0xFFFE
AdamGreen 0:3b00827bb0b7 1144 * @return 0xFFFF if substr was not found in p or the index where it was found
AdamGreen 0:3b00827bb0b7 1145 */
AdamGreen 0:3b00827bb0b7 1146 u16_t
AdamGreen 0:3b00827bb0b7 1147 pbuf_strstr(struct pbuf* p, const char* substr)
AdamGreen 0:3b00827bb0b7 1148 {
AdamGreen 0:3b00827bb0b7 1149 size_t substr_len;
AdamGreen 0:3b00827bb0b7 1150 if ((substr == NULL) || (substr[0] == 0) || (p->tot_len == 0xFFFF)) {
AdamGreen 0:3b00827bb0b7 1151 return 0xFFFF;
AdamGreen 0:3b00827bb0b7 1152 }
AdamGreen 0:3b00827bb0b7 1153 substr_len = strlen(substr);
AdamGreen 0:3b00827bb0b7 1154 if (substr_len >= 0xFFFF) {
AdamGreen 0:3b00827bb0b7 1155 return 0xFFFF;
AdamGreen 0:3b00827bb0b7 1156 }
AdamGreen 0:3b00827bb0b7 1157 return pbuf_memfind(p, substr, (u16_t)substr_len, 0);
AdamGreen 0:3b00827bb0b7 1158 }