John Lowe
/
WebSockets2
Important changes to repositories hosted on mbed.com
Mbed hosted mercurial repositories are deprecated and are due to be permanently deleted in July 2026.
To keep a copy of this software download the repository Zip archive or clone locally using Mercurial.
It is also possible to export all your personal repositories from the account settings page.
Core/lwIP/core/pbuf.c@0:6dee052a3fa4, 2011-07-26 (annotated)
- Committer:
- nandgate
- Date:
- Tue Jul 26 05:30:53 2011 +0000
- Revision:
- 0:6dee052a3fa4
Who changed what in which revision?
| User | Revision | Line number | New contents of line |
|---|---|---|---|
| nandgate | 0:6dee052a3fa4 | 1 | /** |
| nandgate | 0:6dee052a3fa4 | 2 | * @file |
| nandgate | 0:6dee052a3fa4 | 3 | * Packet buffer management |
| nandgate | 0:6dee052a3fa4 | 4 | * |
| nandgate | 0:6dee052a3fa4 | 5 | * Packets are built from the pbuf data structure. It supports dynamic |
| nandgate | 0:6dee052a3fa4 | 6 | * memory allocation for packet contents or can reference externally |
| nandgate | 0:6dee052a3fa4 | 7 | * managed packet contents both in RAM and ROM. Quick allocation for |
| nandgate | 0:6dee052a3fa4 | 8 | * incoming packets is provided through pools with fixed sized pbufs. |
| nandgate | 0:6dee052a3fa4 | 9 | * |
| nandgate | 0:6dee052a3fa4 | 10 | * A packet may span over multiple pbufs, chained as a singly linked |
| nandgate | 0:6dee052a3fa4 | 11 | * list. This is called a "pbuf chain". |
| nandgate | 0:6dee052a3fa4 | 12 | * |
| nandgate | 0:6dee052a3fa4 | 13 | * Multiple packets may be queued, also using this singly linked list. |
| nandgate | 0:6dee052a3fa4 | 14 | * This is called a "packet queue". |
| nandgate | 0:6dee052a3fa4 | 15 | * |
| nandgate | 0:6dee052a3fa4 | 16 | * So, a packet queue consists of one or more pbuf chains, each of |
| nandgate | 0:6dee052a3fa4 | 17 | * which consist of one or more pbufs. CURRENTLY, PACKET QUEUES ARE |
| nandgate | 0:6dee052a3fa4 | 18 | * NOT SUPPORTED!!! Use helper structs to queue multiple packets. |
| nandgate | 0:6dee052a3fa4 | 19 | * |
| nandgate | 0:6dee052a3fa4 | 20 | * The differences between a pbuf chain and a packet queue are very |
| nandgate | 0:6dee052a3fa4 | 21 | * precise but subtle. |
| nandgate | 0:6dee052a3fa4 | 22 | * |
| nandgate | 0:6dee052a3fa4 | 23 | * The last pbuf of a packet has a ->tot_len field that equals the |
| nandgate | 0:6dee052a3fa4 | 24 | * ->len field. It can be found by traversing the list. If the last |
| nandgate | 0:6dee052a3fa4 | 25 | * pbuf of a packet has a ->next field other than NULL, more packets |
| nandgate | 0:6dee052a3fa4 | 26 | * are on the queue. |
| nandgate | 0:6dee052a3fa4 | 27 | * |
| nandgate | 0:6dee052a3fa4 | 28 | * Therefore, looping through a pbuf of a single packet, has an |
| nandgate | 0:6dee052a3fa4 | 29 | * loop end condition (tot_len == p->len), NOT (next == NULL). |
| nandgate | 0:6dee052a3fa4 | 30 | */ |
| nandgate | 0:6dee052a3fa4 | 31 | |
| nandgate | 0:6dee052a3fa4 | 32 | /* |
| nandgate | 0:6dee052a3fa4 | 33 | * Copyright (c) 2001-2004 Swedish Institute of Computer Science. |
| nandgate | 0:6dee052a3fa4 | 34 | * All rights reserved. |
| nandgate | 0:6dee052a3fa4 | 35 | * |
| nandgate | 0:6dee052a3fa4 | 36 | * Redistribution and use in source and binary forms, with or without modification, |
| nandgate | 0:6dee052a3fa4 | 37 | * are permitted provided that the following conditions are met: |
| nandgate | 0:6dee052a3fa4 | 38 | * |
| nandgate | 0:6dee052a3fa4 | 39 | * 1. Redistributions of source code must retain the above copyright notice, |
| nandgate | 0:6dee052a3fa4 | 40 | * this list of conditions and the following disclaimer. |
| nandgate | 0:6dee052a3fa4 | 41 | * 2. Redistributions in binary form must reproduce the above copyright notice, |
| nandgate | 0:6dee052a3fa4 | 42 | * this list of conditions and the following disclaimer in the documentation |
| nandgate | 0:6dee052a3fa4 | 43 | * and/or other materials provided with the distribution. |
| nandgate | 0:6dee052a3fa4 | 44 | * 3. The name of the author may not be used to endorse or promote products |
| nandgate | 0:6dee052a3fa4 | 45 | * derived from this software without specific prior written permission. |
| nandgate | 0:6dee052a3fa4 | 46 | * |
| nandgate | 0:6dee052a3fa4 | 47 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
| nandgate | 0:6dee052a3fa4 | 48 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF |
| nandgate | 0:6dee052a3fa4 | 49 | * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT |
| nandgate | 0:6dee052a3fa4 | 50 | * SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
| nandgate | 0:6dee052a3fa4 | 51 | * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT |
| nandgate | 0:6dee052a3fa4 | 52 | * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| nandgate | 0:6dee052a3fa4 | 53 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| nandgate | 0:6dee052a3fa4 | 54 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
| nandgate | 0:6dee052a3fa4 | 55 | * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY |
| nandgate | 0:6dee052a3fa4 | 56 | * OF SUCH DAMAGE. |
| nandgate | 0:6dee052a3fa4 | 57 | * |
| nandgate | 0:6dee052a3fa4 | 58 | * This file is part of the lwIP TCP/IP stack. |
| nandgate | 0:6dee052a3fa4 | 59 | * |
| nandgate | 0:6dee052a3fa4 | 60 | * Author: Adam Dunkels <adam@sics.se> |
| nandgate | 0:6dee052a3fa4 | 61 | * |
| nandgate | 0:6dee052a3fa4 | 62 | */ |
| nandgate | 0:6dee052a3fa4 | 63 | |
| nandgate | 0:6dee052a3fa4 | 64 | #include "lwip/opt.h" |
| nandgate | 0:6dee052a3fa4 | 65 | |
| nandgate | 0:6dee052a3fa4 | 66 | #include "lwip/stats.h" |
| nandgate | 0:6dee052a3fa4 | 67 | #include "lwip/def.h" |
| nandgate | 0:6dee052a3fa4 | 68 | #include "lwip/mem.h" |
| nandgate | 0:6dee052a3fa4 | 69 | #include "lwip/memp.h" |
| nandgate | 0:6dee052a3fa4 | 70 | #include "lwip/pbuf.h" |
| nandgate | 0:6dee052a3fa4 | 71 | #include "lwip/sys.h" |
| nandgate | 0:6dee052a3fa4 | 72 | #include "arch/perf.h" |
| nandgate | 0:6dee052a3fa4 | 73 | #if TCP_QUEUE_OOSEQ |
| nandgate | 0:6dee052a3fa4 | 74 | #include "lwip/tcp.h" |
| nandgate | 0:6dee052a3fa4 | 75 | #endif |
| nandgate | 0:6dee052a3fa4 | 76 | |
| nandgate | 0:6dee052a3fa4 | 77 | #include <string.h> |
| nandgate | 0:6dee052a3fa4 | 78 | |
| nandgate | 0:6dee052a3fa4 | 79 | #define SIZEOF_STRUCT_PBUF LWIP_MEM_ALIGN_SIZE(sizeof(struct pbuf)) |
| nandgate | 0:6dee052a3fa4 | 80 | /* Since the pool is created in memp, PBUF_POOL_BUFSIZE will be automatically |
| nandgate | 0:6dee052a3fa4 | 81 | aligned there. Therefore, PBUF_POOL_BUFSIZE_ALIGNED can be used here. */ |
| nandgate | 0:6dee052a3fa4 | 82 | #define PBUF_POOL_BUFSIZE_ALIGNED LWIP_MEM_ALIGN_SIZE(PBUF_POOL_BUFSIZE) |
| nandgate | 0:6dee052a3fa4 | 83 | |
| nandgate | 0:6dee052a3fa4 | 84 | #if TCP_QUEUE_OOSEQ |
| nandgate | 0:6dee052a3fa4 | 85 | #define ALLOC_POOL_PBUF(p) do { (p) = alloc_pool_pbuf(); } while (0) |
| nandgate | 0:6dee052a3fa4 | 86 | #else |
| nandgate | 0:6dee052a3fa4 | 87 | #define ALLOC_POOL_PBUF(p) do { (p) = memp_malloc(MEMP_PBUF_POOL); } while (0) |
| nandgate | 0:6dee052a3fa4 | 88 | #endif |
| nandgate | 0:6dee052a3fa4 | 89 | |
| nandgate | 0:6dee052a3fa4 | 90 | |
| nandgate | 0:6dee052a3fa4 | 91 | #if TCP_QUEUE_OOSEQ |
| nandgate | 0:6dee052a3fa4 | 92 | /** |
| nandgate | 0:6dee052a3fa4 | 93 | * Attempt to reclaim some memory from queued out-of-sequence TCP segments |
| nandgate | 0:6dee052a3fa4 | 94 | * if we run out of pool pbufs. It's better to give priority to new packets |
| nandgate | 0:6dee052a3fa4 | 95 | * if we're running out. |
| nandgate | 0:6dee052a3fa4 | 96 | * |
| nandgate | 0:6dee052a3fa4 | 97 | * @return the allocated pbuf. |
| nandgate | 0:6dee052a3fa4 | 98 | */ |
| nandgate | 0:6dee052a3fa4 | 99 | static struct pbuf * |
| nandgate | 0:6dee052a3fa4 | 100 | alloc_pool_pbuf(void) |
| nandgate | 0:6dee052a3fa4 | 101 | { |
| nandgate | 0:6dee052a3fa4 | 102 | struct tcp_pcb *pcb; |
| nandgate | 0:6dee052a3fa4 | 103 | struct pbuf *p; |
| nandgate | 0:6dee052a3fa4 | 104 | |
| nandgate | 0:6dee052a3fa4 | 105 | retry: |
| nandgate | 0:6dee052a3fa4 | 106 | p = (struct pbuf *)memp_malloc(MEMP_PBUF_POOL); |
| nandgate | 0:6dee052a3fa4 | 107 | if (NULL == p) { |
| nandgate | 0:6dee052a3fa4 | 108 | for (pcb=tcp_active_pcbs; NULL != pcb; pcb = pcb->next) { |
| nandgate | 0:6dee052a3fa4 | 109 | if (NULL != pcb->ooseq) { |
| nandgate | 0:6dee052a3fa4 | 110 | tcp_segs_free(pcb->ooseq); |
| nandgate | 0:6dee052a3fa4 | 111 | pcb->ooseq = NULL; |
| nandgate | 0:6dee052a3fa4 | 112 | goto retry; |
| nandgate | 0:6dee052a3fa4 | 113 | } |
| nandgate | 0:6dee052a3fa4 | 114 | } |
| nandgate | 0:6dee052a3fa4 | 115 | } |
| nandgate | 0:6dee052a3fa4 | 116 | return p; |
| nandgate | 0:6dee052a3fa4 | 117 | } |
| nandgate | 0:6dee052a3fa4 | 118 | #endif /* TCP_QUEUE_OOSEQ */ |
| nandgate | 0:6dee052a3fa4 | 119 | |
| nandgate | 0:6dee052a3fa4 | 120 | /** |
| nandgate | 0:6dee052a3fa4 | 121 | * Allocates a pbuf of the given type (possibly a chain for PBUF_POOL type). |
| nandgate | 0:6dee052a3fa4 | 122 | * |
| nandgate | 0:6dee052a3fa4 | 123 | * The actual memory allocated for the pbuf is determined by the |
| nandgate | 0:6dee052a3fa4 | 124 | * layer at which the pbuf is allocated and the requested size |
| nandgate | 0:6dee052a3fa4 | 125 | * (from the size parameter). |
| nandgate | 0:6dee052a3fa4 | 126 | * |
| nandgate | 0:6dee052a3fa4 | 127 | * @param layer flag to define header size |
| nandgate | 0:6dee052a3fa4 | 128 | * @param length size of the pbuf's payload |
| nandgate | 0:6dee052a3fa4 | 129 | * @param type this parameter decides how and where the pbuf |
| nandgate | 0:6dee052a3fa4 | 130 | * should be allocated as follows: |
| nandgate | 0:6dee052a3fa4 | 131 | * |
| nandgate | 0:6dee052a3fa4 | 132 | * - PBUF_RAM: buffer memory for pbuf is allocated as one large |
| nandgate | 0:6dee052a3fa4 | 133 | * chunk. This includes protocol headers as well. |
| nandgate | 0:6dee052a3fa4 | 134 | * - PBUF_ROM: no buffer memory is allocated for the pbuf, even for |
| nandgate | 0:6dee052a3fa4 | 135 | * protocol headers. Additional headers must be prepended |
| nandgate | 0:6dee052a3fa4 | 136 | * by allocating another pbuf and chain in to the front of |
| nandgate | 0:6dee052a3fa4 | 137 | * the ROM pbuf. It is assumed that the memory used is really |
| nandgate | 0:6dee052a3fa4 | 138 | * similar to ROM in that it is immutable and will not be |
| nandgate | 0:6dee052a3fa4 | 139 | * changed. Memory which is dynamic should generally not |
| nandgate | 0:6dee052a3fa4 | 140 | * be attached to PBUF_ROM pbufs. Use PBUF_REF instead. |
| nandgate | 0:6dee052a3fa4 | 141 | * - PBUF_REF: no buffer memory is allocated for the pbuf, even for |
| nandgate | 0:6dee052a3fa4 | 142 | * protocol headers. It is assumed that the pbuf is only |
| nandgate | 0:6dee052a3fa4 | 143 | * being used in a single thread. If the pbuf gets queued, |
| nandgate | 0:6dee052a3fa4 | 144 | * then pbuf_take should be called to copy the buffer. |
| nandgate | 0:6dee052a3fa4 | 145 | * - PBUF_POOL: the pbuf is allocated as a pbuf chain, with pbufs from |
| nandgate | 0:6dee052a3fa4 | 146 | * the pbuf pool that is allocated during pbuf_init(). |
| nandgate | 0:6dee052a3fa4 | 147 | * |
| nandgate | 0:6dee052a3fa4 | 148 | * @return the allocated pbuf. If multiple pbufs where allocated, this |
| nandgate | 0:6dee052a3fa4 | 149 | * is the first pbuf of a pbuf chain. |
| nandgate | 0:6dee052a3fa4 | 150 | */ |
| nandgate | 0:6dee052a3fa4 | 151 | struct pbuf * |
| nandgate | 0:6dee052a3fa4 | 152 | pbuf_alloc(pbuf_layer layer, u16_t length, pbuf_type type) |
| nandgate | 0:6dee052a3fa4 | 153 | { |
| nandgate | 0:6dee052a3fa4 | 154 | struct pbuf *p, *q, *r; |
| nandgate | 0:6dee052a3fa4 | 155 | u16_t offset; |
| nandgate | 0:6dee052a3fa4 | 156 | s32_t rem_len; /* remaining length */ |
| nandgate | 0:6dee052a3fa4 | 157 | LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE | 3, ("pbuf_alloc(length=%"U16_F")\n", length)); |
| nandgate | 0:6dee052a3fa4 | 158 | |
| nandgate | 0:6dee052a3fa4 | 159 | /* determine header offset */ |
| nandgate | 0:6dee052a3fa4 | 160 | offset = 0; |
| nandgate | 0:6dee052a3fa4 | 161 | switch (layer) { |
| nandgate | 0:6dee052a3fa4 | 162 | case PBUF_TRANSPORT: |
| nandgate | 0:6dee052a3fa4 | 163 | /* add room for transport (often TCP) layer header */ |
| nandgate | 0:6dee052a3fa4 | 164 | offset += PBUF_TRANSPORT_HLEN; |
| nandgate | 0:6dee052a3fa4 | 165 | /* FALLTHROUGH */ |
| nandgate | 0:6dee052a3fa4 | 166 | case PBUF_IP: |
| nandgate | 0:6dee052a3fa4 | 167 | /* add room for IP layer header */ |
| nandgate | 0:6dee052a3fa4 | 168 | offset += PBUF_IP_HLEN; |
| nandgate | 0:6dee052a3fa4 | 169 | /* FALLTHROUGH */ |
| nandgate | 0:6dee052a3fa4 | 170 | case PBUF_LINK: |
| nandgate | 0:6dee052a3fa4 | 171 | /* add room for link layer header */ |
| nandgate | 0:6dee052a3fa4 | 172 | offset += PBUF_LINK_HLEN; |
| nandgate | 0:6dee052a3fa4 | 173 | break; |
| nandgate | 0:6dee052a3fa4 | 174 | case PBUF_RAW: |
| nandgate | 0:6dee052a3fa4 | 175 | break; |
| nandgate | 0:6dee052a3fa4 | 176 | default: |
| nandgate | 0:6dee052a3fa4 | 177 | LWIP_ASSERT("pbuf_alloc: bad pbuf layer", 0); |
| nandgate | 0:6dee052a3fa4 | 178 | return NULL; |
| nandgate | 0:6dee052a3fa4 | 179 | } |
| nandgate | 0:6dee052a3fa4 | 180 | |
| nandgate | 0:6dee052a3fa4 | 181 | switch (type) { |
| nandgate | 0:6dee052a3fa4 | 182 | case PBUF_POOL: |
| nandgate | 0:6dee052a3fa4 | 183 | /* allocate head of pbuf chain into p */ |
| nandgate | 0:6dee052a3fa4 | 184 | ALLOC_POOL_PBUF(p); |
| nandgate | 0:6dee052a3fa4 | 185 | LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE | 3, ("pbuf_alloc: allocated pbuf %p\n", (void *)p)); |
| nandgate | 0:6dee052a3fa4 | 186 | if (p == NULL) { |
| nandgate | 0:6dee052a3fa4 | 187 | return NULL; |
| nandgate | 0:6dee052a3fa4 | 188 | } |
| nandgate | 0:6dee052a3fa4 | 189 | p->type = type; |
| nandgate | 0:6dee052a3fa4 | 190 | p->next = NULL; |
| nandgate | 0:6dee052a3fa4 | 191 | |
| nandgate | 0:6dee052a3fa4 | 192 | /* make the payload pointer point 'offset' bytes into pbuf data memory */ |
| nandgate | 0:6dee052a3fa4 | 193 | p->payload = LWIP_MEM_ALIGN((void *)((u8_t *)p + (SIZEOF_STRUCT_PBUF + offset))); |
| nandgate | 0:6dee052a3fa4 | 194 | LWIP_ASSERT("pbuf_alloc: pbuf p->payload properly aligned", |
| nandgate | 0:6dee052a3fa4 | 195 | ((mem_ptr_t)p->payload % MEM_ALIGNMENT) == 0); |
| nandgate | 0:6dee052a3fa4 | 196 | /* the total length of the pbuf chain is the requested size */ |
| nandgate | 0:6dee052a3fa4 | 197 | p->tot_len = length; |
| nandgate | 0:6dee052a3fa4 | 198 | /* set the length of the first pbuf in the chain */ |
| nandgate | 0:6dee052a3fa4 | 199 | p->len = LWIP_MIN(length, PBUF_POOL_BUFSIZE_ALIGNED - LWIP_MEM_ALIGN_SIZE(offset)); |
| nandgate | 0:6dee052a3fa4 | 200 | LWIP_ASSERT("check p->payload + p->len does not overflow pbuf", |
| nandgate | 0:6dee052a3fa4 | 201 | ((u8_t*)p->payload + p->len <= |
| nandgate | 0:6dee052a3fa4 | 202 | (u8_t*)p + SIZEOF_STRUCT_PBUF + PBUF_POOL_BUFSIZE_ALIGNED)); |
| nandgate | 0:6dee052a3fa4 | 203 | LWIP_ASSERT("PBUF_POOL_BUFSIZE must be bigger than MEM_ALIGNMENT", |
| nandgate | 0:6dee052a3fa4 | 204 | (PBUF_POOL_BUFSIZE_ALIGNED - LWIP_MEM_ALIGN_SIZE(offset)) > 0 ); |
| nandgate | 0:6dee052a3fa4 | 205 | /* set reference count (needed here in case we fail) */ |
| nandgate | 0:6dee052a3fa4 | 206 | p->ref = 1; |
| nandgate | 0:6dee052a3fa4 | 207 | |
| nandgate | 0:6dee052a3fa4 | 208 | /* now allocate the tail of the pbuf chain */ |
| nandgate | 0:6dee052a3fa4 | 209 | |
| nandgate | 0:6dee052a3fa4 | 210 | /* remember first pbuf for linkage in next iteration */ |
| nandgate | 0:6dee052a3fa4 | 211 | r = p; |
| nandgate | 0:6dee052a3fa4 | 212 | /* remaining length to be allocated */ |
| nandgate | 0:6dee052a3fa4 | 213 | rem_len = length - p->len; |
| nandgate | 0:6dee052a3fa4 | 214 | /* any remaining pbufs to be allocated? */ |
| nandgate | 0:6dee052a3fa4 | 215 | while (rem_len > 0) { |
| nandgate | 0:6dee052a3fa4 | 216 | ALLOC_POOL_PBUF(q); |
| nandgate | 0:6dee052a3fa4 | 217 | if (q == NULL) { |
| nandgate | 0:6dee052a3fa4 | 218 | /* free chain so far allocated */ |
| nandgate | 0:6dee052a3fa4 | 219 | pbuf_free(p); |
| nandgate | 0:6dee052a3fa4 | 220 | /* bail out unsuccesfully */ |
| nandgate | 0:6dee052a3fa4 | 221 | return NULL; |
| nandgate | 0:6dee052a3fa4 | 222 | } |
| nandgate | 0:6dee052a3fa4 | 223 | q->type = type; |
| nandgate | 0:6dee052a3fa4 | 224 | q->flags = 0; |
| nandgate | 0:6dee052a3fa4 | 225 | q->next = NULL; |
| nandgate | 0:6dee052a3fa4 | 226 | /* make previous pbuf point to this pbuf */ |
| nandgate | 0:6dee052a3fa4 | 227 | r->next = q; |
| nandgate | 0:6dee052a3fa4 | 228 | /* set total length of this pbuf and next in chain */ |
| nandgate | 0:6dee052a3fa4 | 229 | LWIP_ASSERT("rem_len < max_u16_t", rem_len < 0xffff); |
| nandgate | 0:6dee052a3fa4 | 230 | q->tot_len = (u16_t)rem_len; |
| nandgate | 0:6dee052a3fa4 | 231 | /* this pbuf length is pool size, unless smaller sized tail */ |
| nandgate | 0:6dee052a3fa4 | 232 | q->len = LWIP_MIN((u16_t)rem_len, PBUF_POOL_BUFSIZE_ALIGNED); |
| nandgate | 0:6dee052a3fa4 | 233 | q->payload = (void *)((u8_t *)q + SIZEOF_STRUCT_PBUF); |
| nandgate | 0:6dee052a3fa4 | 234 | LWIP_ASSERT("pbuf_alloc: pbuf q->payload properly aligned", |
| nandgate | 0:6dee052a3fa4 | 235 | ((mem_ptr_t)q->payload % MEM_ALIGNMENT) == 0); |
| nandgate | 0:6dee052a3fa4 | 236 | LWIP_ASSERT("check p->payload + p->len does not overflow pbuf", |
| nandgate | 0:6dee052a3fa4 | 237 | ((u8_t*)p->payload + p->len <= |
| nandgate | 0:6dee052a3fa4 | 238 | (u8_t*)p + SIZEOF_STRUCT_PBUF + PBUF_POOL_BUFSIZE_ALIGNED)); |
| nandgate | 0:6dee052a3fa4 | 239 | q->ref = 1; |
| nandgate | 0:6dee052a3fa4 | 240 | /* calculate remaining length to be allocated */ |
| nandgate | 0:6dee052a3fa4 | 241 | rem_len -= q->len; |
| nandgate | 0:6dee052a3fa4 | 242 | /* remember this pbuf for linkage in next iteration */ |
| nandgate | 0:6dee052a3fa4 | 243 | r = q; |
| nandgate | 0:6dee052a3fa4 | 244 | } |
| nandgate | 0:6dee052a3fa4 | 245 | /* end of chain */ |
| nandgate | 0:6dee052a3fa4 | 246 | /*r->next = NULL;*/ |
| nandgate | 0:6dee052a3fa4 | 247 | |
| nandgate | 0:6dee052a3fa4 | 248 | break; |
| nandgate | 0:6dee052a3fa4 | 249 | case PBUF_RAM: |
| nandgate | 0:6dee052a3fa4 | 250 | /* If pbuf is to be allocated in RAM, allocate memory for it. */ |
| nandgate | 0:6dee052a3fa4 | 251 | p = (struct pbuf*)mem_malloc(LWIP_MEM_ALIGN_SIZE(SIZEOF_STRUCT_PBUF + offset) + LWIP_MEM_ALIGN_SIZE(length)); |
| nandgate | 0:6dee052a3fa4 | 252 | if (p == NULL) { |
| nandgate | 0:6dee052a3fa4 | 253 | return NULL; |
| nandgate | 0:6dee052a3fa4 | 254 | } |
| nandgate | 0:6dee052a3fa4 | 255 | /* Set up internal structure of the pbuf. */ |
| nandgate | 0:6dee052a3fa4 | 256 | p->payload = LWIP_MEM_ALIGN((void *)((u8_t *)p + SIZEOF_STRUCT_PBUF + offset)); |
| nandgate | 0:6dee052a3fa4 | 257 | p->len = p->tot_len = length; |
| nandgate | 0:6dee052a3fa4 | 258 | p->next = NULL; |
| nandgate | 0:6dee052a3fa4 | 259 | p->type = type; |
| nandgate | 0:6dee052a3fa4 | 260 | |
| nandgate | 0:6dee052a3fa4 | 261 | LWIP_ASSERT("pbuf_alloc: pbuf->payload properly aligned", |
| nandgate | 0:6dee052a3fa4 | 262 | ((mem_ptr_t)p->payload % MEM_ALIGNMENT) == 0); |
| nandgate | 0:6dee052a3fa4 | 263 | break; |
| nandgate | 0:6dee052a3fa4 | 264 | /* pbuf references existing (non-volatile static constant) ROM payload? */ |
| nandgate | 0:6dee052a3fa4 | 265 | case PBUF_ROM: |
| nandgate | 0:6dee052a3fa4 | 266 | /* pbuf references existing (externally allocated) RAM payload? */ |
| nandgate | 0:6dee052a3fa4 | 267 | case PBUF_REF: |
| nandgate | 0:6dee052a3fa4 | 268 | /* only allocate memory for the pbuf structure */ |
| nandgate | 0:6dee052a3fa4 | 269 | p = (struct pbuf *)memp_malloc(MEMP_PBUF); |
| nandgate | 0:6dee052a3fa4 | 270 | if (p == NULL) { |
| nandgate | 0:6dee052a3fa4 | 271 | LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE | 2, ("pbuf_alloc: Could not allocate MEMP_PBUF for PBUF_%s.\n", |
| nandgate | 0:6dee052a3fa4 | 272 | (type == PBUF_ROM) ? "ROM" : "REF")); |
| nandgate | 0:6dee052a3fa4 | 273 | return NULL; |
| nandgate | 0:6dee052a3fa4 | 274 | } |
| nandgate | 0:6dee052a3fa4 | 275 | /* caller must set this field properly, afterwards */ |
| nandgate | 0:6dee052a3fa4 | 276 | p->payload = NULL; |
| nandgate | 0:6dee052a3fa4 | 277 | p->len = p->tot_len = length; |
| nandgate | 0:6dee052a3fa4 | 278 | p->next = NULL; |
| nandgate | 0:6dee052a3fa4 | 279 | p->type = type; |
| nandgate | 0:6dee052a3fa4 | 280 | break; |
| nandgate | 0:6dee052a3fa4 | 281 | default: |
| nandgate | 0:6dee052a3fa4 | 282 | LWIP_ASSERT("pbuf_alloc: erroneous type", 0); |
| nandgate | 0:6dee052a3fa4 | 283 | return NULL; |
| nandgate | 0:6dee052a3fa4 | 284 | } |
| nandgate | 0:6dee052a3fa4 | 285 | /* set reference count */ |
| nandgate | 0:6dee052a3fa4 | 286 | p->ref = 1; |
| nandgate | 0:6dee052a3fa4 | 287 | /* set flags */ |
| nandgate | 0:6dee052a3fa4 | 288 | p->flags = 0; |
| nandgate | 0:6dee052a3fa4 | 289 | LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE | 3, ("pbuf_alloc(length=%"U16_F") == %p\n", length, (void *)p)); |
| nandgate | 0:6dee052a3fa4 | 290 | return p; |
| nandgate | 0:6dee052a3fa4 | 291 | } |
| nandgate | 0:6dee052a3fa4 | 292 | |
| nandgate | 0:6dee052a3fa4 | 293 | |
| nandgate | 0:6dee052a3fa4 | 294 | /** |
| nandgate | 0:6dee052a3fa4 | 295 | * Shrink a pbuf chain to a desired length. |
| nandgate | 0:6dee052a3fa4 | 296 | * |
| nandgate | 0:6dee052a3fa4 | 297 | * @param p pbuf to shrink. |
| nandgate | 0:6dee052a3fa4 | 298 | * @param new_len desired new length of pbuf chain |
| nandgate | 0:6dee052a3fa4 | 299 | * |
| nandgate | 0:6dee052a3fa4 | 300 | * Depending on the desired length, the first few pbufs in a chain might |
| nandgate | 0:6dee052a3fa4 | 301 | * be skipped and left unchanged. The new last pbuf in the chain will be |
| nandgate | 0:6dee052a3fa4 | 302 | * resized, and any remaining pbufs will be freed. |
| nandgate | 0:6dee052a3fa4 | 303 | * |
| nandgate | 0:6dee052a3fa4 | 304 | * @note If the pbuf is ROM/REF, only the ->tot_len and ->len fields are adjusted. |
| nandgate | 0:6dee052a3fa4 | 305 | * @note May not be called on a packet queue. |
| nandgate | 0:6dee052a3fa4 | 306 | * |
| nandgate | 0:6dee052a3fa4 | 307 | * @note Despite its name, pbuf_realloc cannot grow the size of a pbuf (chain). |
| nandgate | 0:6dee052a3fa4 | 308 | */ |
| nandgate | 0:6dee052a3fa4 | 309 | void |
| nandgate | 0:6dee052a3fa4 | 310 | pbuf_realloc(struct pbuf *p, u16_t new_len) |
| nandgate | 0:6dee052a3fa4 | 311 | { |
| nandgate | 0:6dee052a3fa4 | 312 | struct pbuf *q; |
| nandgate | 0:6dee052a3fa4 | 313 | u16_t rem_len; /* remaining length */ |
| nandgate | 0:6dee052a3fa4 | 314 | s32_t grow; |
| nandgate | 0:6dee052a3fa4 | 315 | |
| nandgate | 0:6dee052a3fa4 | 316 | LWIP_ASSERT("pbuf_realloc: p != NULL", p != NULL); |
| nandgate | 0:6dee052a3fa4 | 317 | LWIP_ASSERT("pbuf_realloc: sane p->type", p->type == PBUF_POOL || |
| nandgate | 0:6dee052a3fa4 | 318 | p->type == PBUF_ROM || |
| nandgate | 0:6dee052a3fa4 | 319 | p->type == PBUF_RAM || |
| nandgate | 0:6dee052a3fa4 | 320 | p->type == PBUF_REF); |
| nandgate | 0:6dee052a3fa4 | 321 | |
| nandgate | 0:6dee052a3fa4 | 322 | /* desired length larger than current length? */ |
| nandgate | 0:6dee052a3fa4 | 323 | if (new_len >= p->tot_len) { |
| nandgate | 0:6dee052a3fa4 | 324 | /* enlarging not yet supported */ |
| nandgate | 0:6dee052a3fa4 | 325 | return; |
| nandgate | 0:6dee052a3fa4 | 326 | } |
| nandgate | 0:6dee052a3fa4 | 327 | |
| nandgate | 0:6dee052a3fa4 | 328 | /* the pbuf chain grows by (new_len - p->tot_len) bytes |
| nandgate | 0:6dee052a3fa4 | 329 | * (which may be negative in case of shrinking) */ |
| nandgate | 0:6dee052a3fa4 | 330 | grow = new_len - p->tot_len; |
| nandgate | 0:6dee052a3fa4 | 331 | |
| nandgate | 0:6dee052a3fa4 | 332 | /* first, step over any pbufs that should remain in the chain */ |
| nandgate | 0:6dee052a3fa4 | 333 | rem_len = new_len; |
| nandgate | 0:6dee052a3fa4 | 334 | q = p; |
| nandgate | 0:6dee052a3fa4 | 335 | /* should this pbuf be kept? */ |
| nandgate | 0:6dee052a3fa4 | 336 | while (rem_len > q->len) { |
| nandgate | 0:6dee052a3fa4 | 337 | /* decrease remaining length by pbuf length */ |
| nandgate | 0:6dee052a3fa4 | 338 | rem_len -= q->len; |
| nandgate | 0:6dee052a3fa4 | 339 | /* decrease total length indicator */ |
| nandgate | 0:6dee052a3fa4 | 340 | LWIP_ASSERT("grow < max_u16_t", grow < 0xffff); |
| nandgate | 0:6dee052a3fa4 | 341 | q->tot_len += (u16_t)grow; |
| nandgate | 0:6dee052a3fa4 | 342 | /* proceed to next pbuf in chain */ |
| nandgate | 0:6dee052a3fa4 | 343 | q = q->next; |
| nandgate | 0:6dee052a3fa4 | 344 | LWIP_ASSERT("pbuf_realloc: q != NULL", q != NULL); |
| nandgate | 0:6dee052a3fa4 | 345 | } |
| nandgate | 0:6dee052a3fa4 | 346 | /* we have now reached the new last pbuf (in q) */ |
| nandgate | 0:6dee052a3fa4 | 347 | /* rem_len == desired length for pbuf q */ |
| nandgate | 0:6dee052a3fa4 | 348 | |
| nandgate | 0:6dee052a3fa4 | 349 | /* shrink allocated memory for PBUF_RAM */ |
| nandgate | 0:6dee052a3fa4 | 350 | /* (other types merely adjust their length fields */ |
| nandgate | 0:6dee052a3fa4 | 351 | if ((q->type == PBUF_RAM) && (rem_len != q->len)) { |
| nandgate | 0:6dee052a3fa4 | 352 | /* reallocate and adjust the length of the pbuf that will be split */ |
| nandgate | 0:6dee052a3fa4 | 353 | q = (struct pbuf *)mem_realloc(q, (u8_t *)q->payload - (u8_t *)q + rem_len); |
| nandgate | 0:6dee052a3fa4 | 354 | LWIP_ASSERT("mem_realloc give q == NULL", q != NULL); |
| nandgate | 0:6dee052a3fa4 | 355 | } |
| nandgate | 0:6dee052a3fa4 | 356 | /* adjust length fields for new last pbuf */ |
| nandgate | 0:6dee052a3fa4 | 357 | q->len = rem_len; |
| nandgate | 0:6dee052a3fa4 | 358 | q->tot_len = q->len; |
| nandgate | 0:6dee052a3fa4 | 359 | |
| nandgate | 0:6dee052a3fa4 | 360 | /* any remaining pbufs in chain? */ |
| nandgate | 0:6dee052a3fa4 | 361 | if (q->next != NULL) { |
| nandgate | 0:6dee052a3fa4 | 362 | /* free remaining pbufs in chain */ |
| nandgate | 0:6dee052a3fa4 | 363 | pbuf_free(q->next); |
| nandgate | 0:6dee052a3fa4 | 364 | } |
| nandgate | 0:6dee052a3fa4 | 365 | /* q is last packet in chain */ |
| nandgate | 0:6dee052a3fa4 | 366 | q->next = NULL; |
| nandgate | 0:6dee052a3fa4 | 367 | |
| nandgate | 0:6dee052a3fa4 | 368 | } |
| nandgate | 0:6dee052a3fa4 | 369 | |
| nandgate | 0:6dee052a3fa4 | 370 | /** |
| nandgate | 0:6dee052a3fa4 | 371 | * Adjusts the payload pointer to hide or reveal headers in the payload. |
| nandgate | 0:6dee052a3fa4 | 372 | * |
| nandgate | 0:6dee052a3fa4 | 373 | * Adjusts the ->payload pointer so that space for a header |
| nandgate | 0:6dee052a3fa4 | 374 | * (dis)appears in the pbuf payload. |
| nandgate | 0:6dee052a3fa4 | 375 | * |
| nandgate | 0:6dee052a3fa4 | 376 | * The ->payload, ->tot_len and ->len fields are adjusted. |
| nandgate | 0:6dee052a3fa4 | 377 | * |
| nandgate | 0:6dee052a3fa4 | 378 | * @param p pbuf to change the header size. |
| nandgate | 0:6dee052a3fa4 | 379 | * @param header_size_increment Number of bytes to increment header size which |
| nandgate | 0:6dee052a3fa4 | 380 | * increases the size of the pbuf. New space is on the front. |
| nandgate | 0:6dee052a3fa4 | 381 | * (Using a negative value decreases the header size.) |
| nandgate | 0:6dee052a3fa4 | 382 | * If hdr_size_inc is 0, this function does nothing and returns succesful. |
| nandgate | 0:6dee052a3fa4 | 383 | * |
| nandgate | 0:6dee052a3fa4 | 384 | * PBUF_ROM and PBUF_REF type buffers cannot have their sizes increased, so |
| nandgate | 0:6dee052a3fa4 | 385 | * the call will fail. A check is made that the increase in header size does |
| nandgate | 0:6dee052a3fa4 | 386 | * not move the payload pointer in front of the start of the buffer. |
| nandgate | 0:6dee052a3fa4 | 387 | * @return non-zero on failure, zero on success. |
| nandgate | 0:6dee052a3fa4 | 388 | * |
| nandgate | 0:6dee052a3fa4 | 389 | */ |
| nandgate | 0:6dee052a3fa4 | 390 | u8_t |
| nandgate | 0:6dee052a3fa4 | 391 | pbuf_header(struct pbuf *p, s16_t header_size_increment) |
| nandgate | 0:6dee052a3fa4 | 392 | { |
| nandgate | 0:6dee052a3fa4 | 393 | u16_t type; |
| nandgate | 0:6dee052a3fa4 | 394 | void *payload; |
| nandgate | 0:6dee052a3fa4 | 395 | u16_t increment_magnitude; |
| nandgate | 0:6dee052a3fa4 | 396 | |
| nandgate | 0:6dee052a3fa4 | 397 | LWIP_ASSERT("p != NULL", p != NULL); |
| nandgate | 0:6dee052a3fa4 | 398 | if ((header_size_increment == 0) || (p == NULL)) |
| nandgate | 0:6dee052a3fa4 | 399 | return 0; |
| nandgate | 0:6dee052a3fa4 | 400 | |
| nandgate | 0:6dee052a3fa4 | 401 | if (header_size_increment < 0){ |
| nandgate | 0:6dee052a3fa4 | 402 | increment_magnitude = -header_size_increment; |
| nandgate | 0:6dee052a3fa4 | 403 | /* Check that we aren't going to move off the end of the pbuf */ |
| nandgate | 0:6dee052a3fa4 | 404 | LWIP_ERROR("increment_magnitude <= p->len", (increment_magnitude <= p->len), return 1;); |
| nandgate | 0:6dee052a3fa4 | 405 | } else { |
| nandgate | 0:6dee052a3fa4 | 406 | increment_magnitude = header_size_increment; |
| nandgate | 0:6dee052a3fa4 | 407 | #if 0 |
| nandgate | 0:6dee052a3fa4 | 408 | /* Can't assert these as some callers speculatively call |
| nandgate | 0:6dee052a3fa4 | 409 | pbuf_header() to see if it's OK. Will return 1 below instead. */ |
| nandgate | 0:6dee052a3fa4 | 410 | /* Check that we've got the correct type of pbuf to work with */ |
| nandgate | 0:6dee052a3fa4 | 411 | LWIP_ASSERT("p->type == PBUF_RAM || p->type == PBUF_POOL", |
| nandgate | 0:6dee052a3fa4 | 412 | p->type == PBUF_RAM || p->type == PBUF_POOL); |
| nandgate | 0:6dee052a3fa4 | 413 | /* Check that we aren't going to move off the beginning of the pbuf */ |
| nandgate | 0:6dee052a3fa4 | 414 | LWIP_ASSERT("p->payload - increment_magnitude >= p + SIZEOF_STRUCT_PBUF", |
| nandgate | 0:6dee052a3fa4 | 415 | (u8_t *)p->payload - increment_magnitude >= (u8_t *)p + SIZEOF_STRUCT_PBUF); |
| nandgate | 0:6dee052a3fa4 | 416 | #endif |
| nandgate | 0:6dee052a3fa4 | 417 | } |
| nandgate | 0:6dee052a3fa4 | 418 | |
| nandgate | 0:6dee052a3fa4 | 419 | type = p->type; |
| nandgate | 0:6dee052a3fa4 | 420 | /* remember current payload pointer */ |
| nandgate | 0:6dee052a3fa4 | 421 | payload = p->payload; |
| nandgate | 0:6dee052a3fa4 | 422 | |
| nandgate | 0:6dee052a3fa4 | 423 | /* pbuf types containing payloads? */ |
| nandgate | 0:6dee052a3fa4 | 424 | if (type == PBUF_RAM || type == PBUF_POOL) { |
| nandgate | 0:6dee052a3fa4 | 425 | /* set new payload pointer */ |
| nandgate | 0:6dee052a3fa4 | 426 | p->payload = (u8_t *)p->payload - header_size_increment; |
| nandgate | 0:6dee052a3fa4 | 427 | /* boundary check fails? */ |
| nandgate | 0:6dee052a3fa4 | 428 | if ((u8_t *)p->payload < (u8_t *)p + SIZEOF_STRUCT_PBUF) { |
| nandgate | 0:6dee052a3fa4 | 429 | LWIP_DEBUGF( PBUF_DEBUG | 2, ("pbuf_header: failed as %p < %p (not enough space for new header size)\n", |
| nandgate | 0:6dee052a3fa4 | 430 | (void *)p->payload, |
| nandgate | 0:6dee052a3fa4 | 431 | (void *)(p + 1)));\ |
| nandgate | 0:6dee052a3fa4 | 432 | /* restore old payload pointer */ |
| nandgate | 0:6dee052a3fa4 | 433 | p->payload = payload; |
| nandgate | 0:6dee052a3fa4 | 434 | /* bail out unsuccesfully */ |
| nandgate | 0:6dee052a3fa4 | 435 | return 1; |
| nandgate | 0:6dee052a3fa4 | 436 | } |
| nandgate | 0:6dee052a3fa4 | 437 | /* pbuf types refering to external payloads? */ |
| nandgate | 0:6dee052a3fa4 | 438 | } else if (type == PBUF_REF || type == PBUF_ROM) { |
| nandgate | 0:6dee052a3fa4 | 439 | /* hide a header in the payload? */ |
| nandgate | 0:6dee052a3fa4 | 440 | if ((header_size_increment < 0) && (increment_magnitude <= p->len)) { |
| nandgate | 0:6dee052a3fa4 | 441 | /* increase payload pointer */ |
| nandgate | 0:6dee052a3fa4 | 442 | p->payload = (u8_t *)p->payload - header_size_increment; |
| nandgate | 0:6dee052a3fa4 | 443 | } else { |
| nandgate | 0:6dee052a3fa4 | 444 | /* cannot expand payload to front (yet!) |
| nandgate | 0:6dee052a3fa4 | 445 | * bail out unsuccesfully */ |
| nandgate | 0:6dee052a3fa4 | 446 | return 1; |
| nandgate | 0:6dee052a3fa4 | 447 | } |
| nandgate | 0:6dee052a3fa4 | 448 | } |
| nandgate | 0:6dee052a3fa4 | 449 | else { |
| nandgate | 0:6dee052a3fa4 | 450 | /* Unknown type */ |
| nandgate | 0:6dee052a3fa4 | 451 | LWIP_ASSERT("bad pbuf type", 0); |
| nandgate | 0:6dee052a3fa4 | 452 | return 1; |
| nandgate | 0:6dee052a3fa4 | 453 | } |
| nandgate | 0:6dee052a3fa4 | 454 | /* modify pbuf length fields */ |
| nandgate | 0:6dee052a3fa4 | 455 | p->len += header_size_increment; |
| nandgate | 0:6dee052a3fa4 | 456 | p->tot_len += header_size_increment; |
| nandgate | 0:6dee052a3fa4 | 457 | |
| nandgate | 0:6dee052a3fa4 | 458 | LWIP_DEBUGF(PBUF_DEBUG, ("pbuf_header: old %p new %p (%"S16_F")\n", |
| nandgate | 0:6dee052a3fa4 | 459 | (void *)payload, (void *)p->payload, header_size_increment)); |
| nandgate | 0:6dee052a3fa4 | 460 | |
| nandgate | 0:6dee052a3fa4 | 461 | return 0; |
| nandgate | 0:6dee052a3fa4 | 462 | } |
| nandgate | 0:6dee052a3fa4 | 463 | |
| nandgate | 0:6dee052a3fa4 | 464 | /** |
| nandgate | 0:6dee052a3fa4 | 465 | * Dereference a pbuf chain or queue and deallocate any no-longer-used |
| nandgate | 0:6dee052a3fa4 | 466 | * pbufs at the head of this chain or queue. |
| nandgate | 0:6dee052a3fa4 | 467 | * |
| nandgate | 0:6dee052a3fa4 | 468 | * Decrements the pbuf reference count. If it reaches zero, the pbuf is |
| nandgate | 0:6dee052a3fa4 | 469 | * deallocated. |
| nandgate | 0:6dee052a3fa4 | 470 | * |
| nandgate | 0:6dee052a3fa4 | 471 | * For a pbuf chain, this is repeated for each pbuf in the chain, |
| nandgate | 0:6dee052a3fa4 | 472 | * up to the first pbuf which has a non-zero reference count after |
| nandgate | 0:6dee052a3fa4 | 473 | * decrementing. So, when all reference counts are one, the whole |
| nandgate | 0:6dee052a3fa4 | 474 | * chain is free'd. |
| nandgate | 0:6dee052a3fa4 | 475 | * |
| nandgate | 0:6dee052a3fa4 | 476 | * @param p The pbuf (chain) to be dereferenced. |
| nandgate | 0:6dee052a3fa4 | 477 | * |
| nandgate | 0:6dee052a3fa4 | 478 | * @return the number of pbufs that were de-allocated |
| nandgate | 0:6dee052a3fa4 | 479 | * from the head of the chain. |
| nandgate | 0:6dee052a3fa4 | 480 | * |
| nandgate | 0:6dee052a3fa4 | 481 | * @note MUST NOT be called on a packet queue (Not verified to work yet). |
| nandgate | 0:6dee052a3fa4 | 482 | * @note the reference counter of a pbuf equals the number of pointers |
| nandgate | 0:6dee052a3fa4 | 483 | * that refer to the pbuf (or into the pbuf). |
| nandgate | 0:6dee052a3fa4 | 484 | * |
| nandgate | 0:6dee052a3fa4 | 485 | * @internal examples: |
| nandgate | 0:6dee052a3fa4 | 486 | * |
| nandgate | 0:6dee052a3fa4 | 487 | * Assuming existing chains a->b->c with the following reference |
| nandgate | 0:6dee052a3fa4 | 488 | * counts, calling pbuf_free(a) results in: |
| nandgate | 0:6dee052a3fa4 | 489 | * |
| nandgate | 0:6dee052a3fa4 | 490 | * 1->2->3 becomes ...1->3 |
| nandgate | 0:6dee052a3fa4 | 491 | * 3->3->3 becomes 2->3->3 |
| nandgate | 0:6dee052a3fa4 | 492 | * 1->1->2 becomes ......1 |
| nandgate | 0:6dee052a3fa4 | 493 | * 2->1->1 becomes 1->1->1 |
| nandgate | 0:6dee052a3fa4 | 494 | * 1->1->1 becomes ....... |
| nandgate | 0:6dee052a3fa4 | 495 | * |
| nandgate | 0:6dee052a3fa4 | 496 | */ |
| nandgate | 0:6dee052a3fa4 | 497 | u8_t |
| nandgate | 0:6dee052a3fa4 | 498 | pbuf_free(struct pbuf *p) |
| nandgate | 0:6dee052a3fa4 | 499 | { |
| nandgate | 0:6dee052a3fa4 | 500 | u16_t type; |
| nandgate | 0:6dee052a3fa4 | 501 | struct pbuf *q; |
| nandgate | 0:6dee052a3fa4 | 502 | u8_t count; |
| nandgate | 0:6dee052a3fa4 | 503 | |
| nandgate | 0:6dee052a3fa4 | 504 | if (p == NULL) { |
| nandgate | 0:6dee052a3fa4 | 505 | LWIP_ASSERT("p != NULL", p != NULL); |
| nandgate | 0:6dee052a3fa4 | 506 | /* if assertions are disabled, proceed with debug output */ |
| nandgate | 0:6dee052a3fa4 | 507 | LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE | 2, ("pbuf_free(p == NULL) was called.\n")); |
| nandgate | 0:6dee052a3fa4 | 508 | return 0; |
| nandgate | 0:6dee052a3fa4 | 509 | } |
| nandgate | 0:6dee052a3fa4 | 510 | LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE | 3, ("pbuf_free(%p)\n", (void *)p)); |
| nandgate | 0:6dee052a3fa4 | 511 | |
| nandgate | 0:6dee052a3fa4 | 512 | PERF_START; |
| nandgate | 0:6dee052a3fa4 | 513 | |
| nandgate | 0:6dee052a3fa4 | 514 | LWIP_ASSERT("pbuf_free: sane type", |
| nandgate | 0:6dee052a3fa4 | 515 | p->type == PBUF_RAM || p->type == PBUF_ROM || |
| nandgate | 0:6dee052a3fa4 | 516 | p->type == PBUF_REF || p->type == PBUF_POOL); |
| nandgate | 0:6dee052a3fa4 | 517 | |
| nandgate | 0:6dee052a3fa4 | 518 | count = 0; |
| nandgate | 0:6dee052a3fa4 | 519 | /* de-allocate all consecutive pbufs from the head of the chain that |
| nandgate | 0:6dee052a3fa4 | 520 | * obtain a zero reference count after decrementing*/ |
| nandgate | 0:6dee052a3fa4 | 521 | while (p != NULL) { |
| nandgate | 0:6dee052a3fa4 | 522 | u16_t ref; |
| nandgate | 0:6dee052a3fa4 | 523 | SYS_ARCH_DECL_PROTECT(old_level); |
| nandgate | 0:6dee052a3fa4 | 524 | /* Since decrementing ref cannot be guaranteed to be a single machine operation |
| nandgate | 0:6dee052a3fa4 | 525 | * we must protect it. We put the new ref into a local variable to prevent |
| nandgate | 0:6dee052a3fa4 | 526 | * further protection. */ |
| nandgate | 0:6dee052a3fa4 | 527 | SYS_ARCH_PROTECT(old_level); |
| nandgate | 0:6dee052a3fa4 | 528 | /* all pbufs in a chain are referenced at least once */ |
| nandgate | 0:6dee052a3fa4 | 529 | LWIP_ASSERT("pbuf_free: p->ref > 0", p->ref > 0); |
| nandgate | 0:6dee052a3fa4 | 530 | /* decrease reference count (number of pointers to pbuf) */ |
| nandgate | 0:6dee052a3fa4 | 531 | ref = --(p->ref); |
| nandgate | 0:6dee052a3fa4 | 532 | SYS_ARCH_UNPROTECT(old_level); |
| nandgate | 0:6dee052a3fa4 | 533 | /* this pbuf is no longer referenced to? */ |
| nandgate | 0:6dee052a3fa4 | 534 | if (ref == 0) { |
| nandgate | 0:6dee052a3fa4 | 535 | /* remember next pbuf in chain for next iteration */ |
| nandgate | 0:6dee052a3fa4 | 536 | q = p->next; |
| nandgate | 0:6dee052a3fa4 | 537 | LWIP_DEBUGF( PBUF_DEBUG | 2, ("pbuf_free: deallocating %p\n", (void *)p)); |
| nandgate | 0:6dee052a3fa4 | 538 | type = p->type; |
| nandgate | 0:6dee052a3fa4 | 539 | /* is this a pbuf from the pool? */ |
| nandgate | 0:6dee052a3fa4 | 540 | if (type == PBUF_POOL) { |
| nandgate | 0:6dee052a3fa4 | 541 | memp_free(MEMP_PBUF_POOL, p); |
| nandgate | 0:6dee052a3fa4 | 542 | /* is this a ROM or RAM referencing pbuf? */ |
| nandgate | 0:6dee052a3fa4 | 543 | } else if (type == PBUF_ROM || type == PBUF_REF) { |
| nandgate | 0:6dee052a3fa4 | 544 | memp_free(MEMP_PBUF, p); |
| nandgate | 0:6dee052a3fa4 | 545 | /* type == PBUF_RAM */ |
| nandgate | 0:6dee052a3fa4 | 546 | } else { |
| nandgate | 0:6dee052a3fa4 | 547 | mem_free(p); |
| nandgate | 0:6dee052a3fa4 | 548 | } |
| nandgate | 0:6dee052a3fa4 | 549 | count++; |
| nandgate | 0:6dee052a3fa4 | 550 | /* proceed to next pbuf */ |
| nandgate | 0:6dee052a3fa4 | 551 | p = q; |
| nandgate | 0:6dee052a3fa4 | 552 | /* p->ref > 0, this pbuf is still referenced to */ |
| nandgate | 0:6dee052a3fa4 | 553 | /* (and so the remaining pbufs in chain as well) */ |
| nandgate | 0:6dee052a3fa4 | 554 | } else { |
| nandgate | 0:6dee052a3fa4 | 555 | LWIP_DEBUGF( PBUF_DEBUG | 2, ("pbuf_free: %p has ref %"U16_F", ending here.\n", (void *)p, ref)); |
| nandgate | 0:6dee052a3fa4 | 556 | /* stop walking through the chain */ |
| nandgate | 0:6dee052a3fa4 | 557 | p = NULL; |
| nandgate | 0:6dee052a3fa4 | 558 | } |
| nandgate | 0:6dee052a3fa4 | 559 | } |
| nandgate | 0:6dee052a3fa4 | 560 | PERF_STOP("pbuf_free"); |
| nandgate | 0:6dee052a3fa4 | 561 | /* return number of de-allocated pbufs */ |
| nandgate | 0:6dee052a3fa4 | 562 | return count; |
| nandgate | 0:6dee052a3fa4 | 563 | } |
| nandgate | 0:6dee052a3fa4 | 564 | |
| nandgate | 0:6dee052a3fa4 | 565 | /** |
| nandgate | 0:6dee052a3fa4 | 566 | * Count number of pbufs in a chain |
| nandgate | 0:6dee052a3fa4 | 567 | * |
| nandgate | 0:6dee052a3fa4 | 568 | * @param p first pbuf of chain |
| nandgate | 0:6dee052a3fa4 | 569 | * @return the number of pbufs in a chain |
| nandgate | 0:6dee052a3fa4 | 570 | */ |
| nandgate | 0:6dee052a3fa4 | 571 | |
| nandgate | 0:6dee052a3fa4 | 572 | u8_t |
| nandgate | 0:6dee052a3fa4 | 573 | pbuf_clen(struct pbuf *p) |
| nandgate | 0:6dee052a3fa4 | 574 | { |
| nandgate | 0:6dee052a3fa4 | 575 | u8_t len; |
| nandgate | 0:6dee052a3fa4 | 576 | |
| nandgate | 0:6dee052a3fa4 | 577 | len = 0; |
| nandgate | 0:6dee052a3fa4 | 578 | while (p != NULL) { |
| nandgate | 0:6dee052a3fa4 | 579 | ++len; |
| nandgate | 0:6dee052a3fa4 | 580 | p = p->next; |
| nandgate | 0:6dee052a3fa4 | 581 | } |
| nandgate | 0:6dee052a3fa4 | 582 | return len; |
| nandgate | 0:6dee052a3fa4 | 583 | } |
| nandgate | 0:6dee052a3fa4 | 584 | |
| nandgate | 0:6dee052a3fa4 | 585 | /** |
| nandgate | 0:6dee052a3fa4 | 586 | * Increment the reference count of the pbuf. |
| nandgate | 0:6dee052a3fa4 | 587 | * |
| nandgate | 0:6dee052a3fa4 | 588 | * @param p pbuf to increase reference counter of |
| nandgate | 0:6dee052a3fa4 | 589 | * |
| nandgate | 0:6dee052a3fa4 | 590 | */ |
| nandgate | 0:6dee052a3fa4 | 591 | void |
| nandgate | 0:6dee052a3fa4 | 592 | pbuf_ref(struct pbuf *p) |
| nandgate | 0:6dee052a3fa4 | 593 | { |
| nandgate | 0:6dee052a3fa4 | 594 | SYS_ARCH_DECL_PROTECT(old_level); |
| nandgate | 0:6dee052a3fa4 | 595 | /* pbuf given? */ |
| nandgate | 0:6dee052a3fa4 | 596 | if (p != NULL) { |
| nandgate | 0:6dee052a3fa4 | 597 | SYS_ARCH_PROTECT(old_level); |
| nandgate | 0:6dee052a3fa4 | 598 | ++(p->ref); |
| nandgate | 0:6dee052a3fa4 | 599 | SYS_ARCH_UNPROTECT(old_level); |
| nandgate | 0:6dee052a3fa4 | 600 | } |
| nandgate | 0:6dee052a3fa4 | 601 | } |
| nandgate | 0:6dee052a3fa4 | 602 | |
| nandgate | 0:6dee052a3fa4 | 603 | /** |
| nandgate | 0:6dee052a3fa4 | 604 | * Concatenate two pbufs (each may be a pbuf chain) and take over |
| nandgate | 0:6dee052a3fa4 | 605 | * the caller's reference of the tail pbuf. |
| nandgate | 0:6dee052a3fa4 | 606 | * |
| nandgate | 0:6dee052a3fa4 | 607 | * @note The caller MAY NOT reference the tail pbuf afterwards. |
| nandgate | 0:6dee052a3fa4 | 608 | * Use pbuf_chain() for that purpose. |
| nandgate | 0:6dee052a3fa4 | 609 | * |
| nandgate | 0:6dee052a3fa4 | 610 | * @see pbuf_chain() |
| nandgate | 0:6dee052a3fa4 | 611 | */ |
| nandgate | 0:6dee052a3fa4 | 612 | |
| nandgate | 0:6dee052a3fa4 | 613 | void |
| nandgate | 0:6dee052a3fa4 | 614 | pbuf_cat(struct pbuf *h, struct pbuf *t) |
| nandgate | 0:6dee052a3fa4 | 615 | { |
| nandgate | 0:6dee052a3fa4 | 616 | struct pbuf *p; |
| nandgate | 0:6dee052a3fa4 | 617 | |
| nandgate | 0:6dee052a3fa4 | 618 | LWIP_ERROR("(h != NULL) && (t != NULL) (programmer violates API)", |
| nandgate | 0:6dee052a3fa4 | 619 | ((h != NULL) && (t != NULL)), return;); |
| nandgate | 0:6dee052a3fa4 | 620 | |
| nandgate | 0:6dee052a3fa4 | 621 | /* proceed to last pbuf of chain */ |
| nandgate | 0:6dee052a3fa4 | 622 | for (p = h; p->next != NULL; p = p->next) { |
| nandgate | 0:6dee052a3fa4 | 623 | /* add total length of second chain to all totals of first chain */ |
| nandgate | 0:6dee052a3fa4 | 624 | p->tot_len += t->tot_len; |
| nandgate | 0:6dee052a3fa4 | 625 | } |
| nandgate | 0:6dee052a3fa4 | 626 | /* { p is last pbuf of first h chain, p->next == NULL } */ |
| nandgate | 0:6dee052a3fa4 | 627 | LWIP_ASSERT("p->tot_len == p->len (of last pbuf in chain)", p->tot_len == p->len); |
| nandgate | 0:6dee052a3fa4 | 628 | LWIP_ASSERT("p->next == NULL", p->next == NULL); |
| nandgate | 0:6dee052a3fa4 | 629 | /* add total length of second chain to last pbuf total of first chain */ |
| nandgate | 0:6dee052a3fa4 | 630 | p->tot_len += t->tot_len; |
| nandgate | 0:6dee052a3fa4 | 631 | /* chain last pbuf of head (p) with first of tail (t) */ |
| nandgate | 0:6dee052a3fa4 | 632 | p->next = t; |
| nandgate | 0:6dee052a3fa4 | 633 | /* p->next now references t, but the caller will drop its reference to t, |
| nandgate | 0:6dee052a3fa4 | 634 | * so netto there is no change to the reference count of t. |
| nandgate | 0:6dee052a3fa4 | 635 | */ |
| nandgate | 0:6dee052a3fa4 | 636 | } |
| nandgate | 0:6dee052a3fa4 | 637 | |
| nandgate | 0:6dee052a3fa4 | 638 | /** |
| nandgate | 0:6dee052a3fa4 | 639 | * Chain two pbufs (or pbuf chains) together. |
| nandgate | 0:6dee052a3fa4 | 640 | * |
| nandgate | 0:6dee052a3fa4 | 641 | * The caller MUST call pbuf_free(t) once it has stopped |
| nandgate | 0:6dee052a3fa4 | 642 | * using it. Use pbuf_cat() instead if you no longer use t. |
| nandgate | 0:6dee052a3fa4 | 643 | * |
| nandgate | 0:6dee052a3fa4 | 644 | * @param h head pbuf (chain) |
| nandgate | 0:6dee052a3fa4 | 645 | * @param t tail pbuf (chain) |
| nandgate | 0:6dee052a3fa4 | 646 | * @note The pbufs MUST belong to the same packet. |
| nandgate | 0:6dee052a3fa4 | 647 | * @note MAY NOT be called on a packet queue. |
| nandgate | 0:6dee052a3fa4 | 648 | * |
| nandgate | 0:6dee052a3fa4 | 649 | * The ->tot_len fields of all pbufs of the head chain are adjusted. |
| nandgate | 0:6dee052a3fa4 | 650 | * The ->next field of the last pbuf of the head chain is adjusted. |
| nandgate | 0:6dee052a3fa4 | 651 | * The ->ref field of the first pbuf of the tail chain is adjusted. |
| nandgate | 0:6dee052a3fa4 | 652 | * |
| nandgate | 0:6dee052a3fa4 | 653 | */ |
| nandgate | 0:6dee052a3fa4 | 654 | void |
| nandgate | 0:6dee052a3fa4 | 655 | pbuf_chain(struct pbuf *h, struct pbuf *t) |
| nandgate | 0:6dee052a3fa4 | 656 | { |
| nandgate | 0:6dee052a3fa4 | 657 | pbuf_cat(h, t); |
| nandgate | 0:6dee052a3fa4 | 658 | /* t is now referenced by h */ |
| nandgate | 0:6dee052a3fa4 | 659 | pbuf_ref(t); |
| nandgate | 0:6dee052a3fa4 | 660 | LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_FRESH | 2, ("pbuf_chain: %p references %p\n", (void *)h, (void *)t)); |
| nandgate | 0:6dee052a3fa4 | 661 | } |
| nandgate | 0:6dee052a3fa4 | 662 | |
| nandgate | 0:6dee052a3fa4 | 663 | /** |
| nandgate | 0:6dee052a3fa4 | 664 | * Dechains the first pbuf from its succeeding pbufs in the chain. |
| nandgate | 0:6dee052a3fa4 | 665 | * |
| nandgate | 0:6dee052a3fa4 | 666 | * Makes p->tot_len field equal to p->len. |
| nandgate | 0:6dee052a3fa4 | 667 | * @param p pbuf to dechain |
| nandgate | 0:6dee052a3fa4 | 668 | * @return remainder of the pbuf chain, or NULL if it was de-allocated. |
| nandgate | 0:6dee052a3fa4 | 669 | * @note May not be called on a packet queue. |
| nandgate | 0:6dee052a3fa4 | 670 | */ |
| nandgate | 0:6dee052a3fa4 | 671 | struct pbuf * |
| nandgate | 0:6dee052a3fa4 | 672 | pbuf_dechain(struct pbuf *p) |
| nandgate | 0:6dee052a3fa4 | 673 | { |
| nandgate | 0:6dee052a3fa4 | 674 | struct pbuf *q; |
| nandgate | 0:6dee052a3fa4 | 675 | u8_t tail_gone = 1; |
| nandgate | 0:6dee052a3fa4 | 676 | /* tail */ |
| nandgate | 0:6dee052a3fa4 | 677 | q = p->next; |
| nandgate | 0:6dee052a3fa4 | 678 | /* pbuf has successor in chain? */ |
| nandgate | 0:6dee052a3fa4 | 679 | if (q != NULL) { |
| nandgate | 0:6dee052a3fa4 | 680 | /* assert tot_len invariant: (p->tot_len == p->len + (p->next? p->next->tot_len: 0) */ |
| nandgate | 0:6dee052a3fa4 | 681 | LWIP_ASSERT("p->tot_len == p->len + q->tot_len", q->tot_len == p->tot_len - p->len); |
| nandgate | 0:6dee052a3fa4 | 682 | /* enforce invariant if assertion is disabled */ |
| nandgate | 0:6dee052a3fa4 | 683 | q->tot_len = p->tot_len - p->len; |
| nandgate | 0:6dee052a3fa4 | 684 | /* decouple pbuf from remainder */ |
| nandgate | 0:6dee052a3fa4 | 685 | p->next = NULL; |
| nandgate | 0:6dee052a3fa4 | 686 | /* total length of pbuf p is its own length only */ |
| nandgate | 0:6dee052a3fa4 | 687 | p->tot_len = p->len; |
| nandgate | 0:6dee052a3fa4 | 688 | /* q is no longer referenced by p, free it */ |
| nandgate | 0:6dee052a3fa4 | 689 | LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_STATE, ("pbuf_dechain: unreferencing %p\n", (void *)q)); |
| nandgate | 0:6dee052a3fa4 | 690 | tail_gone = pbuf_free(q); |
| nandgate | 0:6dee052a3fa4 | 691 | if (tail_gone > 0) { |
| nandgate | 0:6dee052a3fa4 | 692 | LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_STATE, |
| nandgate | 0:6dee052a3fa4 | 693 | ("pbuf_dechain: deallocated %p (as it is no longer referenced)\n", (void *)q)); |
| nandgate | 0:6dee052a3fa4 | 694 | } |
| nandgate | 0:6dee052a3fa4 | 695 | /* return remaining tail or NULL if deallocated */ |
| nandgate | 0:6dee052a3fa4 | 696 | } |
| nandgate | 0:6dee052a3fa4 | 697 | /* assert tot_len invariant: (p->tot_len == p->len + (p->next? p->next->tot_len: 0) */ |
| nandgate | 0:6dee052a3fa4 | 698 | LWIP_ASSERT("p->tot_len == p->len", p->tot_len == p->len); |
| nandgate | 0:6dee052a3fa4 | 699 | return ((tail_gone > 0) ? NULL : q); |
| nandgate | 0:6dee052a3fa4 | 700 | } |
| nandgate | 0:6dee052a3fa4 | 701 | |
| nandgate | 0:6dee052a3fa4 | 702 | /** |
| nandgate | 0:6dee052a3fa4 | 703 | * |
| nandgate | 0:6dee052a3fa4 | 704 | * Create PBUF_RAM copies of pbufs. |
| nandgate | 0:6dee052a3fa4 | 705 | * |
| nandgate | 0:6dee052a3fa4 | 706 | * Used to queue packets on behalf of the lwIP stack, such as |
| nandgate | 0:6dee052a3fa4 | 707 | * ARP based queueing. |
| nandgate | 0:6dee052a3fa4 | 708 | * |
| nandgate | 0:6dee052a3fa4 | 709 | * @note You MUST explicitly use p = pbuf_take(p); |
| nandgate | 0:6dee052a3fa4 | 710 | * |
| nandgate | 0:6dee052a3fa4 | 711 | * @note Only one packet is copied, no packet queue! |
| nandgate | 0:6dee052a3fa4 | 712 | * |
| nandgate | 0:6dee052a3fa4 | 713 | * @param p_to pbuf destination of the copy |
| nandgate | 0:6dee052a3fa4 | 714 | * @param p_from pbuf source of the copy |
| nandgate | 0:6dee052a3fa4 | 715 | * |
| nandgate | 0:6dee052a3fa4 | 716 | * @return ERR_OK if pbuf was copied |
| nandgate | 0:6dee052a3fa4 | 717 | * ERR_ARG if one of the pbufs is NULL or p_to is not big |
| nandgate | 0:6dee052a3fa4 | 718 | * enough to hold p_from |
| nandgate | 0:6dee052a3fa4 | 719 | */ |
| nandgate | 0:6dee052a3fa4 | 720 | err_t |
| nandgate | 0:6dee052a3fa4 | 721 | pbuf_copy(struct pbuf *p_to, struct pbuf *p_from) |
| nandgate | 0:6dee052a3fa4 | 722 | { |
| nandgate | 0:6dee052a3fa4 | 723 | u16_t offset_to=0, offset_from=0, len; |
| nandgate | 0:6dee052a3fa4 | 724 | |
| nandgate | 0:6dee052a3fa4 | 725 | LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE | 3, ("pbuf_copy(%p, %p)\n", |
| nandgate | 0:6dee052a3fa4 | 726 | (void*)p_to, (void*)p_from)); |
| nandgate | 0:6dee052a3fa4 | 727 | |
| nandgate | 0:6dee052a3fa4 | 728 | /* is the target big enough to hold the source? */ |
| nandgate | 0:6dee052a3fa4 | 729 | LWIP_ERROR("pbuf_copy: target not big enough to hold source", ((p_to != NULL) && |
| nandgate | 0:6dee052a3fa4 | 730 | (p_from != NULL) && (p_to->tot_len >= p_from->tot_len)), return ERR_ARG;); |
| nandgate | 0:6dee052a3fa4 | 731 | |
| nandgate | 0:6dee052a3fa4 | 732 | /* iterate through pbuf chain */ |
| nandgate | 0:6dee052a3fa4 | 733 | do |
| nandgate | 0:6dee052a3fa4 | 734 | { |
| nandgate | 0:6dee052a3fa4 | 735 | LWIP_ASSERT("p_to != NULL", p_to != NULL); |
| nandgate | 0:6dee052a3fa4 | 736 | /* copy one part of the original chain */ |
| nandgate | 0:6dee052a3fa4 | 737 | if ((p_to->len - offset_to) >= (p_from->len - offset_from)) { |
| nandgate | 0:6dee052a3fa4 | 738 | /* complete current p_from fits into current p_to */ |
| nandgate | 0:6dee052a3fa4 | 739 | len = p_from->len - offset_from; |
| nandgate | 0:6dee052a3fa4 | 740 | } else { |
| nandgate | 0:6dee052a3fa4 | 741 | /* current p_from does not fit into current p_to */ |
| nandgate | 0:6dee052a3fa4 | 742 | len = p_to->len - offset_to; |
| nandgate | 0:6dee052a3fa4 | 743 | } |
| nandgate | 0:6dee052a3fa4 | 744 | MEMCPY((u8_t*)p_to->payload + offset_to, (u8_t*)p_from->payload + offset_from, len); |
| nandgate | 0:6dee052a3fa4 | 745 | offset_to += len; |
| nandgate | 0:6dee052a3fa4 | 746 | offset_from += len; |
| nandgate | 0:6dee052a3fa4 | 747 | LWIP_ASSERT("offset_to <= p_to->len", offset_to <= p_to->len); |
| nandgate | 0:6dee052a3fa4 | 748 | if (offset_to == p_to->len) { |
| nandgate | 0:6dee052a3fa4 | 749 | /* on to next p_to (if any) */ |
| nandgate | 0:6dee052a3fa4 | 750 | offset_to = 0; |
| nandgate | 0:6dee052a3fa4 | 751 | p_to = p_to->next; |
| nandgate | 0:6dee052a3fa4 | 752 | } |
| nandgate | 0:6dee052a3fa4 | 753 | LWIP_ASSERT("offset_from <= p_from->len", offset_from <= p_from->len); |
| nandgate | 0:6dee052a3fa4 | 754 | if (offset_from >= p_from->len) { |
| nandgate | 0:6dee052a3fa4 | 755 | /* on to next p_from (if any) */ |
| nandgate | 0:6dee052a3fa4 | 756 | offset_from = 0; |
| nandgate | 0:6dee052a3fa4 | 757 | p_from = p_from->next; |
| nandgate | 0:6dee052a3fa4 | 758 | } |
| nandgate | 0:6dee052a3fa4 | 759 | |
| nandgate | 0:6dee052a3fa4 | 760 | if((p_from != NULL) && (p_from->len == p_from->tot_len)) { |
| nandgate | 0:6dee052a3fa4 | 761 | /* don't copy more than one packet! */ |
| nandgate | 0:6dee052a3fa4 | 762 | LWIP_ERROR("pbuf_copy() does not allow packet queues!\n", |
| nandgate | 0:6dee052a3fa4 | 763 | (p_from->next == NULL), return ERR_VAL;); |
| nandgate | 0:6dee052a3fa4 | 764 | } |
| nandgate | 0:6dee052a3fa4 | 765 | if((p_to != NULL) && (p_to->len == p_to->tot_len)) { |
| nandgate | 0:6dee052a3fa4 | 766 | /* don't copy more than one packet! */ |
| nandgate | 0:6dee052a3fa4 | 767 | LWIP_ERROR("pbuf_copy() does not allow packet queues!\n", |
| nandgate | 0:6dee052a3fa4 | 768 | (p_to->next == NULL), return ERR_VAL;); |
| nandgate | 0:6dee052a3fa4 | 769 | } |
| nandgate | 0:6dee052a3fa4 | 770 | } while (p_from); |
| nandgate | 0:6dee052a3fa4 | 771 | LWIP_DEBUGF(PBUF_DEBUG | LWIP_DBG_TRACE | 1, ("pbuf_copy: end of chain reached.\n")); |
| nandgate | 0:6dee052a3fa4 | 772 | return ERR_OK; |
| nandgate | 0:6dee052a3fa4 | 773 | } |
| nandgate | 0:6dee052a3fa4 | 774 | |
| nandgate | 0:6dee052a3fa4 | 775 | /** |
| nandgate | 0:6dee052a3fa4 | 776 | * Copy (part of) the contents of a packet buffer |
| nandgate | 0:6dee052a3fa4 | 777 | * to an application supplied buffer. |
| nandgate | 0:6dee052a3fa4 | 778 | * |
| nandgate | 0:6dee052a3fa4 | 779 | * @param buf the pbuf from which to copy data |
| nandgate | 0:6dee052a3fa4 | 780 | * @param dataptr the application supplied buffer |
| nandgate | 0:6dee052a3fa4 | 781 | * @param len length of data to copy (dataptr must be big enough). No more |
| nandgate | 0:6dee052a3fa4 | 782 | * than buf->tot_len will be copied, irrespective of len |
| nandgate | 0:6dee052a3fa4 | 783 | * @param offset offset into the packet buffer from where to begin copying len bytes |
| nandgate | 0:6dee052a3fa4 | 784 | * @return the number of bytes copied, or 0 on failure |
| nandgate | 0:6dee052a3fa4 | 785 | */ |
| nandgate | 0:6dee052a3fa4 | 786 | u16_t |
| nandgate | 0:6dee052a3fa4 | 787 | pbuf_copy_partial(struct pbuf *buf, void *dataptr, u16_t len, u16_t offset) |
| nandgate | 0:6dee052a3fa4 | 788 | { |
| nandgate | 0:6dee052a3fa4 | 789 | struct pbuf *p; |
| nandgate | 0:6dee052a3fa4 | 790 | u16_t left; |
| nandgate | 0:6dee052a3fa4 | 791 | u16_t buf_copy_len; |
| nandgate | 0:6dee052a3fa4 | 792 | u16_t copied_total = 0; |
| nandgate | 0:6dee052a3fa4 | 793 | |
| nandgate | 0:6dee052a3fa4 | 794 | LWIP_ERROR("pbuf_copy_partial: invalid buf", (buf != NULL), return 0;); |
| nandgate | 0:6dee052a3fa4 | 795 | LWIP_ERROR("pbuf_copy_partial: invalid dataptr", (dataptr != NULL), return 0;); |
| nandgate | 0:6dee052a3fa4 | 796 | |
| nandgate | 0:6dee052a3fa4 | 797 | left = 0; |
| nandgate | 0:6dee052a3fa4 | 798 | |
| nandgate | 0:6dee052a3fa4 | 799 | if((buf == NULL) || (dataptr == NULL)) { |
| nandgate | 0:6dee052a3fa4 | 800 | return 0; |
| nandgate | 0:6dee052a3fa4 | 801 | } |
| nandgate | 0:6dee052a3fa4 | 802 | |
| nandgate | 0:6dee052a3fa4 | 803 | /* Note some systems use byte copy if dataptr or one of the pbuf payload pointers are unaligned. */ |
| nandgate | 0:6dee052a3fa4 | 804 | for(p = buf; len != 0 && p != NULL; p = p->next) { |
| nandgate | 0:6dee052a3fa4 | 805 | if ((offset != 0) && (offset >= p->len)) { |
| nandgate | 0:6dee052a3fa4 | 806 | /* don't copy from this buffer -> on to the next */ |
| nandgate | 0:6dee052a3fa4 | 807 | offset -= p->len; |
| nandgate | 0:6dee052a3fa4 | 808 | } else { |
| nandgate | 0:6dee052a3fa4 | 809 | /* copy from this buffer. maybe only partially. */ |
| nandgate | 0:6dee052a3fa4 | 810 | buf_copy_len = p->len - offset; |
| nandgate | 0:6dee052a3fa4 | 811 | if (buf_copy_len > len) |
| nandgate | 0:6dee052a3fa4 | 812 | buf_copy_len = len; |
| nandgate | 0:6dee052a3fa4 | 813 | /* copy the necessary parts of the buffer */ |
| nandgate | 0:6dee052a3fa4 | 814 | MEMCPY(&((char*)dataptr)[left], &((char*)p->payload)[offset], buf_copy_len); |
| nandgate | 0:6dee052a3fa4 | 815 | copied_total += buf_copy_len; |
| nandgate | 0:6dee052a3fa4 | 816 | left += buf_copy_len; |
| nandgate | 0:6dee052a3fa4 | 817 | len -= buf_copy_len; |
| nandgate | 0:6dee052a3fa4 | 818 | offset = 0; |
| nandgate | 0:6dee052a3fa4 | 819 | } |
| nandgate | 0:6dee052a3fa4 | 820 | } |
| nandgate | 0:6dee052a3fa4 | 821 | return copied_total; |
| nandgate | 0:6dee052a3fa4 | 822 | } |
| nandgate | 0:6dee052a3fa4 | 823 | |
| nandgate | 0:6dee052a3fa4 | 824 | /** |
| nandgate | 0:6dee052a3fa4 | 825 | * Copy application supplied data into a pbuf. |
| nandgate | 0:6dee052a3fa4 | 826 | * This function can only be used to copy the equivalent of buf->tot_len data. |
| nandgate | 0:6dee052a3fa4 | 827 | * |
| nandgate | 0:6dee052a3fa4 | 828 | * @param buf pbuf to fill with data |
| nandgate | 0:6dee052a3fa4 | 829 | * @param dataptr application supplied data buffer |
| nandgate | 0:6dee052a3fa4 | 830 | * @param len length of the application supplied data buffer |
| nandgate | 0:6dee052a3fa4 | 831 | * |
| nandgate | 0:6dee052a3fa4 | 832 | * @return ERR_OK if successful, ERR_MEM if the pbuf is not big enough |
| nandgate | 0:6dee052a3fa4 | 833 | */ |
| nandgate | 0:6dee052a3fa4 | 834 | err_t |
| nandgate | 0:6dee052a3fa4 | 835 | pbuf_take(struct pbuf *buf, const void *dataptr, u16_t len) |
| nandgate | 0:6dee052a3fa4 | 836 | { |
| nandgate | 0:6dee052a3fa4 | 837 | struct pbuf *p; |
| nandgate | 0:6dee052a3fa4 | 838 | u16_t buf_copy_len; |
| nandgate | 0:6dee052a3fa4 | 839 | u16_t total_copy_len = len; |
| nandgate | 0:6dee052a3fa4 | 840 | u16_t copied_total = 0; |
| nandgate | 0:6dee052a3fa4 | 841 | |
| nandgate | 0:6dee052a3fa4 | 842 | LWIP_ERROR("pbuf_take: invalid buf", (buf != NULL), return 0;); |
| nandgate | 0:6dee052a3fa4 | 843 | LWIP_ERROR("pbuf_take: invalid dataptr", (dataptr != NULL), return 0;); |
| nandgate | 0:6dee052a3fa4 | 844 | |
| nandgate | 0:6dee052a3fa4 | 845 | if ((buf == NULL) || (dataptr == NULL) || (buf->tot_len < len)) { |
| nandgate | 0:6dee052a3fa4 | 846 | return ERR_ARG; |
| nandgate | 0:6dee052a3fa4 | 847 | } |
| nandgate | 0:6dee052a3fa4 | 848 | |
| nandgate | 0:6dee052a3fa4 | 849 | /* Note some systems use byte copy if dataptr or one of the pbuf payload pointers are unaligned. */ |
| nandgate | 0:6dee052a3fa4 | 850 | for(p = buf; total_copy_len != 0; p = p->next) { |
| nandgate | 0:6dee052a3fa4 | 851 | LWIP_ASSERT("pbuf_take: invalid pbuf", p != NULL); |
| nandgate | 0:6dee052a3fa4 | 852 | buf_copy_len = total_copy_len; |
| nandgate | 0:6dee052a3fa4 | 853 | if (buf_copy_len > p->len) { |
| nandgate | 0:6dee052a3fa4 | 854 | /* this pbuf cannot hold all remaining data */ |
| nandgate | 0:6dee052a3fa4 | 855 | buf_copy_len = p->len; |
| nandgate | 0:6dee052a3fa4 | 856 | } |
| nandgate | 0:6dee052a3fa4 | 857 | /* copy the necessary parts of the buffer */ |
| nandgate | 0:6dee052a3fa4 | 858 | MEMCPY(p->payload, &((char*)dataptr)[copied_total], buf_copy_len); |
| nandgate | 0:6dee052a3fa4 | 859 | total_copy_len -= buf_copy_len; |
| nandgate | 0:6dee052a3fa4 | 860 | copied_total += buf_copy_len; |
| nandgate | 0:6dee052a3fa4 | 861 | } |
| nandgate | 0:6dee052a3fa4 | 862 | LWIP_ASSERT("did not copy all data", total_copy_len == 0 && copied_total == len); |
| nandgate | 0:6dee052a3fa4 | 863 | return ERR_OK; |
| nandgate | 0:6dee052a3fa4 | 864 | } |
| nandgate | 0:6dee052a3fa4 | 865 | |
| nandgate | 0:6dee052a3fa4 | 866 | /** |
| nandgate | 0:6dee052a3fa4 | 867 | * Creates a single pbuf out of a queue of pbufs. |
| nandgate | 0:6dee052a3fa4 | 868 | * |
| nandgate | 0:6dee052a3fa4 | 869 | * @remark: The source pbuf 'p' is not freed by this function because that can |
| nandgate | 0:6dee052a3fa4 | 870 | * be illegal in some places! |
| nandgate | 0:6dee052a3fa4 | 871 | * |
| nandgate | 0:6dee052a3fa4 | 872 | * @param p the source pbuf |
| nandgate | 0:6dee052a3fa4 | 873 | * @param layer pbuf_layer of the new pbuf |
| nandgate | 0:6dee052a3fa4 | 874 | * |
| nandgate | 0:6dee052a3fa4 | 875 | * @return a new, single pbuf (p->next is NULL) |
| nandgate | 0:6dee052a3fa4 | 876 | * or the old pbuf if allocation fails |
| nandgate | 0:6dee052a3fa4 | 877 | */ |
| nandgate | 0:6dee052a3fa4 | 878 | struct pbuf* |
| nandgate | 0:6dee052a3fa4 | 879 | pbuf_coalesce(struct pbuf *p, pbuf_layer layer) |
| nandgate | 0:6dee052a3fa4 | 880 | { |
| nandgate | 0:6dee052a3fa4 | 881 | struct pbuf *q; |
| nandgate | 0:6dee052a3fa4 | 882 | err_t err; |
| nandgate | 0:6dee052a3fa4 | 883 | if (p->next == NULL) { |
| nandgate | 0:6dee052a3fa4 | 884 | return p; |
| nandgate | 0:6dee052a3fa4 | 885 | } |
| nandgate | 0:6dee052a3fa4 | 886 | q = pbuf_alloc(layer, p->tot_len, PBUF_RAM); |
| nandgate | 0:6dee052a3fa4 | 887 | if (q == NULL) { |
| nandgate | 0:6dee052a3fa4 | 888 | /* @todo: what do we do now? */ |
| nandgate | 0:6dee052a3fa4 | 889 | return p; |
| nandgate | 0:6dee052a3fa4 | 890 | } |
| nandgate | 0:6dee052a3fa4 | 891 | err = pbuf_copy(q, p); |
| nandgate | 0:6dee052a3fa4 | 892 | LWIP_ASSERT("pbuf_copy failed", err == ERR_OK); |
| nandgate | 0:6dee052a3fa4 | 893 | pbuf_free(p); |
| nandgate | 0:6dee052a3fa4 | 894 | return q; |
| nandgate | 0:6dee052a3fa4 | 895 | } |