Nino Der Kinderen / Mbed 2 deprecated InetTest

Embedded C project:18/12/2014

Dependencies:   DS1307 TextLCD mbed

NetServices/lwip/core/pbuf.c@0:8d87bc453349, 2014-12-18 (annotated)

Committer:
ninoderkinderen
Date:
Thu Dec 18 09:35:49 2014 +0000
Revision:
0:8d87bc453349
Programma embedded C

Who changed what in which revision?

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