User | Revision | Line number | New contents of line |
donatien |
0:0f5a52711275
|
1
|
/*
|
donatien |
0:0f5a52711275
|
2
|
* Copyright (c) 2001-2004 Swedish Institute of Computer Science.
|
donatien |
0:0f5a52711275
|
3
|
* All rights reserved.
|
donatien |
0:0f5a52711275
|
4
|
*
|
donatien |
0:0f5a52711275
|
5
|
* Redistribution and use in source and binary forms, with or without modification,
|
donatien |
0:0f5a52711275
|
6
|
* are permitted provided that the following conditions are met:
|
donatien |
0:0f5a52711275
|
7
|
*
|
donatien |
0:0f5a52711275
|
8
|
* 1. Redistributions of source code must retain the above copyright notice,
|
donatien |
0:0f5a52711275
|
9
|
* this list of conditions and the following disclaimer.
|
donatien |
0:0f5a52711275
|
10
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
donatien |
0:0f5a52711275
|
11
|
* this list of conditions and the following disclaimer in the documentation
|
donatien |
0:0f5a52711275
|
12
|
* and/or other materials provided with the distribution.
|
donatien |
0:0f5a52711275
|
13
|
* 3. The name of the author may not be used to endorse or promote products
|
donatien |
0:0f5a52711275
|
14
|
* derived from this software without specific prior written permission.
|
donatien |
0:0f5a52711275
|
15
|
*
|
donatien |
0:0f5a52711275
|
16
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
|
donatien |
0:0f5a52711275
|
17
|
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
donatien |
0:0f5a52711275
|
18
|
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
|
donatien |
0:0f5a52711275
|
19
|
* SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
donatien |
0:0f5a52711275
|
20
|
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
|
donatien |
0:0f5a52711275
|
21
|
* OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
donatien |
0:0f5a52711275
|
22
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
donatien |
0:0f5a52711275
|
23
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
|
donatien |
0:0f5a52711275
|
24
|
* IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
|
donatien |
0:0f5a52711275
|
25
|
* OF SUCH DAMAGE.
|
donatien |
0:0f5a52711275
|
26
|
*
|
donatien |
0:0f5a52711275
|
27
|
* This file is part of the lwIP TCP/IP stack.
|
donatien |
0:0f5a52711275
|
28
|
*
|
donatien |
0:0f5a52711275
|
29
|
* Author: Adam Dunkels <adam@sics.se>
|
donatien |
0:0f5a52711275
|
30
|
*
|
donatien |
0:0f5a52711275
|
31
|
*/
|
donatien |
0:0f5a52711275
|
32
|
|
donatien |
0:0f5a52711275
|
33
|
#ifndef __LWIP_PBUF_H__
|
donatien |
0:0f5a52711275
|
34
|
#define __LWIP_PBUF_H__
|
donatien |
0:0f5a52711275
|
35
|
|
donatien |
0:0f5a52711275
|
36
|
#include "lwip/opt.h"
|
donatien |
0:0f5a52711275
|
37
|
#include "lwip/err.h"
|
donatien |
0:0f5a52711275
|
38
|
|
donatien |
0:0f5a52711275
|
39
|
#ifdef __cplusplus
|
donatien |
0:0f5a52711275
|
40
|
extern "C" {
|
donatien |
0:0f5a52711275
|
41
|
#endif
|
donatien |
0:0f5a52711275
|
42
|
|
donatien |
0:0f5a52711275
|
43
|
#define PBUF_TRANSPORT_HLEN 20
|
donatien |
0:0f5a52711275
|
44
|
#define PBUF_IP_HLEN 20
|
donatien |
0:0f5a52711275
|
45
|
|
donatien |
0:0f5a52711275
|
46
|
typedef enum {
|
donatien |
0:0f5a52711275
|
47
|
PBUF_TRANSPORT,
|
donatien |
0:0f5a52711275
|
48
|
PBUF_IP,
|
donatien |
0:0f5a52711275
|
49
|
PBUF_LINK,
|
donatien |
0:0f5a52711275
|
50
|
PBUF_RAW
|
donatien |
0:0f5a52711275
|
51
|
} pbuf_layer;
|
donatien |
0:0f5a52711275
|
52
|
|
donatien |
0:0f5a52711275
|
53
|
typedef enum {
|
donatien |
0:0f5a52711275
|
54
|
PBUF_RAM, /* pbuf data is stored in RAM */
|
donatien |
0:0f5a52711275
|
55
|
PBUF_ROM, /* pbuf data is stored in ROM */
|
donatien |
0:0f5a52711275
|
56
|
PBUF_REF, /* pbuf comes from the pbuf pool */
|
donatien |
0:0f5a52711275
|
57
|
PBUF_POOL /* pbuf payload refers to RAM */
|
donatien |
0:0f5a52711275
|
58
|
} pbuf_type;
|
donatien |
0:0f5a52711275
|
59
|
|
donatien |
0:0f5a52711275
|
60
|
|
donatien |
0:0f5a52711275
|
61
|
/** indicates this packet's data should be immediately passed to the application */
|
donatien |
0:0f5a52711275
|
62
|
#define PBUF_FLAG_PUSH 0x01U
|
donatien |
0:0f5a52711275
|
63
|
|
donatien |
0:0f5a52711275
|
64
|
struct pbuf {
|
donatien |
0:0f5a52711275
|
65
|
/** next pbuf in singly linked pbuf chain */
|
donatien |
0:0f5a52711275
|
66
|
struct pbuf *next;
|
donatien |
0:0f5a52711275
|
67
|
|
donatien |
0:0f5a52711275
|
68
|
/** pointer to the actual data in the buffer */
|
donatien |
0:0f5a52711275
|
69
|
void *payload;
|
donatien |
0:0f5a52711275
|
70
|
|
donatien |
0:0f5a52711275
|
71
|
/**
|
donatien |
0:0f5a52711275
|
72
|
* total length of this buffer and all next buffers in chain
|
donatien |
0:0f5a52711275
|
73
|
* belonging to the same packet.
|
donatien |
0:0f5a52711275
|
74
|
*
|
donatien |
0:0f5a52711275
|
75
|
* For non-queue packet chains this is the invariant:
|
donatien |
0:0f5a52711275
|
76
|
* p->tot_len == p->len + (p->next? p->next->tot_len: 0)
|
donatien |
0:0f5a52711275
|
77
|
*/
|
donatien |
0:0f5a52711275
|
78
|
u16_t tot_len;
|
donatien |
0:0f5a52711275
|
79
|
|
donatien |
0:0f5a52711275
|
80
|
/** length of this buffer */
|
donatien |
0:0f5a52711275
|
81
|
u16_t len;
|
donatien |
0:0f5a52711275
|
82
|
|
donatien |
0:0f5a52711275
|
83
|
/** pbuf_type as u8_t instead of enum to save space */
|
donatien |
0:0f5a52711275
|
84
|
u8_t /*pbuf_type*/ type;
|
donatien |
0:0f5a52711275
|
85
|
|
donatien |
0:0f5a52711275
|
86
|
/** misc flags */
|
donatien |
0:0f5a52711275
|
87
|
u8_t flags;
|
donatien |
0:0f5a52711275
|
88
|
|
donatien |
0:0f5a52711275
|
89
|
/**
|
donatien |
0:0f5a52711275
|
90
|
* the reference count always equals the number of pointers
|
donatien |
0:0f5a52711275
|
91
|
* that refer to this pbuf. This can be pointers from an application,
|
donatien |
0:0f5a52711275
|
92
|
* the stack itself, or pbuf->next pointers from a chain.
|
donatien |
0:0f5a52711275
|
93
|
*/
|
donatien |
0:0f5a52711275
|
94
|
u16_t ref;
|
donatien |
0:0f5a52711275
|
95
|
|
donatien |
0:0f5a52711275
|
96
|
};
|
donatien |
0:0f5a52711275
|
97
|
|
donatien |
0:0f5a52711275
|
98
|
/* Initializes the pbuf module. This call is empty for now, but may not be in future. */
|
donatien |
0:0f5a52711275
|
99
|
#define pbuf_init()
|
donatien |
0:0f5a52711275
|
100
|
|
donatien |
0:0f5a52711275
|
101
|
struct pbuf *pbuf_alloc(pbuf_layer l, u16_t size, pbuf_type type);
|
donatien |
0:0f5a52711275
|
102
|
void pbuf_realloc(struct pbuf *p, u16_t size);
|
donatien |
0:0f5a52711275
|
103
|
u8_t pbuf_header(struct pbuf *p, s16_t header_size);
|
donatien |
0:0f5a52711275
|
104
|
void pbuf_ref(struct pbuf *p);
|
donatien |
0:0f5a52711275
|
105
|
void pbuf_ref_chain(struct pbuf *p);
|
donatien |
0:0f5a52711275
|
106
|
u8_t pbuf_free(struct pbuf *p);
|
donatien |
0:0f5a52711275
|
107
|
u8_t pbuf_clen(struct pbuf *p);
|
donatien |
0:0f5a52711275
|
108
|
void pbuf_cat(struct pbuf *head, struct pbuf *tail);
|
donatien |
0:0f5a52711275
|
109
|
void pbuf_chain(struct pbuf *head, struct pbuf *tail);
|
donatien |
0:0f5a52711275
|
110
|
struct pbuf *pbuf_dechain(struct pbuf *p);
|
donatien |
0:0f5a52711275
|
111
|
err_t pbuf_copy(struct pbuf *p_to, struct pbuf *p_from);
|
donatien |
0:0f5a52711275
|
112
|
u16_t pbuf_copy_partial(struct pbuf *p, void *dataptr, u16_t len, u16_t offset);
|
donatien |
0:0f5a52711275
|
113
|
err_t pbuf_take(struct pbuf *buf, const void *dataptr, u16_t len);
|
donatien |
0:0f5a52711275
|
114
|
struct pbuf *pbuf_coalesce(struct pbuf *p, pbuf_layer layer);
|
donatien |
0:0f5a52711275
|
115
|
|
donatien |
0:0f5a52711275
|
116
|
#ifdef __cplusplus
|
donatien |
0:0f5a52711275
|
117
|
}
|
donatien |
0:0f5a52711275
|
118
|
#endif
|
donatien |
0:0f5a52711275
|
119
|
|
donatien |
0:0f5a52711275
|
120
|
#endif /* __LWIP_PBUF_H__ */
|