1: /*************************************************************************
2: * (C) 2013 AITNET ltd - Sofia/Bulgaria - <misho@aitnet.org>
3: * by Michael Pounov <misho@elwix.org>
4: *
5: * $Author: misho $
6: * $Id: apack.h,v 1.8.2.4 2014/02/13 14:38:52 misho Exp $
7: *
8: **************************************************************************
9: The ELWIX and AITNET software is distributed under the following
10: terms:
11:
12: All of the documentation and software included in the ELWIX and AITNET
13: Releases is copyrighted by ELWIX - Sofia/Bulgaria <info@elwix.org>
14:
15: Copyright 2004 - 2014
16: by Michael Pounov <misho@elwix.org>. All rights reserved.
17:
18: Redistribution and use in source and binary forms, with or without
19: modification, are permitted provided that the following conditions
20: are met:
21: 1. Redistributions of source code must retain the above copyright
22: notice, this list of conditions and the following disclaimer.
23: 2. Redistributions in binary form must reproduce the above copyright
24: notice, this list of conditions and the following disclaimer in the
25: documentation and/or other materials provided with the distribution.
26: 3. All advertising materials mentioning features or use of this software
27: must display the following acknowledgement:
28: This product includes software developed by Michael Pounov <misho@elwix.org>
29: ELWIX - Embedded LightWeight unIX and its contributors.
30: 4. Neither the name of AITNET nor the names of its contributors
31: may be used to endorse or promote products derived from this software
32: without specific prior written permission.
33:
34: THIS SOFTWARE IS PROVIDED BY AITNET AND CONTRIBUTORS ``AS IS'' AND
35: ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
36: IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
37: ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
38: FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
39: DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
40: OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
41: HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
42: LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
43: OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
44: SUCH DAMAGE.
45: */
46: #ifndef __APACK_H
47: #define __APACK_H
48:
49:
50: typedef struct tagRawPacket {
51: size_t r_len;
52: uint8_t *r_buf;
53: uint8_t *r_next;
54: } rpack_t;
55:
56: #define RPACK_INITIALIZER { .r_len = 0, .r_buf = NULL, .r_next = NULL }
57: #define RPACK_FREE(x) (assert((x)), memset((x), 0, sizeof(rpack_t)))
58: #define RPACK_INIT(x, b, l) do { assert((x)); RPACK_FREE(x); \
59: (x)->r_buf = (b); \
60: (x)->r_len = (l); \
61: (x)->r_next = (x)->r_buf; \
62: } while (0)
63: #define RPACK_SANITY(x) ((x) && (x)->r_buf && (x)->r_next && (x)->r_next >= (x)->r_buf)
64: #define RPACK_BUF(x) (assert((x)), (x)->r_buf)
65: #define RPACK_NEXT(x) (assert((x)), (x)->r_next)
66: #define RPACK_LEN(x) (assert((x)), (x)->r_len)
67: #define RPACK_REWIND(x) (assert((x)), (x)->r_next = (x)->r_buf)
68: #define RPACK_OFF(x) (assert((x)), (x)->r_next - (x)->r_buf)
69: #define RPACK_REMAIN(x) (assert((x)), (x)->r_len - ((x)->r_next - (x)->r_buf))
70:
71: #define RPACK_SET_16(x, n) do { assert((x)); \
72: *((uint8_t *) (x) + 1) = *((const uint8_t *) (n) + 1); \
73: *((uint8_t *) (x) + 0) = *((const uint8_t *) (n) + 0); \
74: } while (0)
75: #define RPACK_SET_24(x, n) do { assert((x)); \
76: *((uint8_t *) (x) + 2) = *((const uint8_t *) (n) + 2); \
77: *((uint8_t *) (x) + 1) = *((const uint8_t *) (n) + 1); \
78: *((uint8_t *) (x) + 0) = *((const uint8_t *) (n) + 0); \
79: } while (0)
80: #define RPACK_SET_32(x, n) do { assert((x)); \
81: *((uint8_t *) (x) + 3) = *((const uint8_t *) (n) + 3); \
82: *((uint8_t *) (x) + 2) = *((const uint8_t *) (n) + 2); \
83: *((uint8_t *) (x) + 1) = *((const uint8_t *) (n) + 1); \
84: *((uint8_t *) (x) + 0) = *((const uint8_t *) (n) + 0); \
85: } while (0)
86: #define RPACK_SET_64(x, n) do { assert((x)); \
87: *((uint8_t *) (x) + 7) = *((const uint8_t *) (n) + 7); \
88: *((uint8_t *) (x) + 6) = *((const uint8_t *) (n) + 6); \
89: *((uint8_t *) (x) + 5) = *((const uint8_t *) (n) + 5); \
90: *((uint8_t *) (x) + 4) = *((const uint8_t *) (n) + 4); \
91: *((uint8_t *) (x) + 3) = *((const uint8_t *) (n) + 3); \
92: *((uint8_t *) (x) + 2) = *((const uint8_t *) (n) + 2); \
93: *((uint8_t *) (x) + 1) = *((const uint8_t *) (n) + 1); \
94: *((uint8_t *) (x) + 0) = *((const uint8_t *) (n) + 0); \
95: } while (0)
96:
97: #define EXTRACT_LE_8(x) (assert((x)), *(x))
98: #define EXTRACT_LE_16(x) (assert((x)), (u_int16_t) ( \
99: (uint16_t) *((const uint8_t *) (x) + 1) << 8 | \
100: (uint16_t) *((const uint8_t *) (x) + 0) \
101: ))
102: #define EXTRACT_LE_24(x) (assert((x)), (u_int32_t) ( \
103: (uint32_t) *((const uint8_t *) (x) + 2) << 16 | \
104: (uint32_t) *((const uint8_t *) (x) + 1) << 8 | \
105: (uint32_t) *((const uint8_t *) (x) + 0) \
106: ))
107: #define EXTRACT_LE_32(x) (assert((x)), (u_int32_t) ( \
108: (uint32_t) *((const uint8_t *) (x) + 3) << 24 | \
109: (uint32_t) *((const uint8_t *) (x) + 2) << 16 | \
110: (uint32_t) *((const uint8_t *) (x) + 1) << 8 | \
111: (uint32_t) *((const uint8_t *) (x) + 0) \
112: ))
113: #define EXTRACT_LE_64(x) (assert((x)), (u_int64_t) ( \
114: (uint64_t) *((const uint8_t *) (x) + 7) << 56 | \
115: (uint64_t) *((const uint8_t *) (x) + 6) << 48 | \
116: (uint64_t) *((const uint8_t *) (x) + 5) << 40 | \
117: (uint64_t) *((const uint8_t *) (x) + 4) << 32 | \
118: (uint64_t) *((const uint8_t *) (x) + 3) << 24 | \
119: (uint64_t) *((const uint8_t *) (x) + 2) << 16 | \
120: (uint64_t) *((const uint8_t *) (x) + 1) << 8 | \
121: (uint64_t) *((const uint8_t *) (x) + 0) \
122: ))
123:
124: #define EXTRACT_BE_8(x) (assert((x)), *(x))
125: #define EXTRACT_BE_16(x) (assert((x)), (u_int16_t) ( \
126: (uint16_t) *((const uint8_t *) (x) + 0) << 8 | \
127: (uint16_t) *((const uint8_t *) (x) + 1) \
128: ))
129: #define EXTRACT_BE_24(x) (assert((x)), (u_int32_t) ( \
130: (uint32_t) *((const uint8_t *) (x) + 0) << 16 | \
131: (uint32_t) *((const uint8_t *) (x) + 1) << 8 | \
132: (uint32_t) *((const uint8_t *) (x) + 2) \
133: ))
134: #define EXTRACT_BE_32(x) (assert((x)), (u_int32_t) ( \
135: (uint32_t) *((const uint8_t *) (x) + 0) << 24 | \
136: (uint32_t) *((const uint8_t *) (x) + 1) << 16 | \
137: (uint32_t) *((const uint8_t *) (x) + 2) << 8 | \
138: (uint32_t) *((const uint8_t *) (x) + 3) \
139: ))
140: #define EXTRACT_BE_64(x) (assert((x)), (u_int64_t) ( \
141: (uint64_t) *((const uint8_t *) (x) + 0) << 56 | \
142: (uint64_t) *((const uint8_t *) (x) + 1) << 48 | \
143: (uint64_t) *((const uint8_t *) (x) + 2) << 40 | \
144: (uint64_t) *((const uint8_t *) (x) + 3) << 32 | \
145: (uint64_t) *((const uint8_t *) (x) + 4) << 24 | \
146: (uint64_t) *((const uint8_t *) (x) + 5) << 16 | \
147: (uint64_t) *((const uint8_t *) (x) + 6) << 8 | \
148: (uint64_t) *((const uint8_t *) (x) + 7) \
149: ))
150:
151:
152: /*
153: * rpack_align_and_reserve() - Align & reserve space
154: *
155: * @rp = raw buffer
156: * @siz = need size
157: * return: NULL error or not enough space, !=NULL next position
158: */
159: uint8_t *rpack_align_and_reserve(rpack_t * __restrict rp, size_t siz);
160:
161: /*
162: * rpack_create() - Allocate & init raw packet structure
163: *
164: * @buf = buffer
165: * @buflen = length of buffer
166: * return: NULL error or !=NULL raw packet, should be freed by rpack_destroy()
167: */
168: rpack_t *rpack_create(void * __restrict buf, size_t buflen);
169: /*
170: * rpack_destroy() - Release & free raw packet structure
171: *
172: * @rp = raw packet
173: * return: none
174: */
175: void rpack_destroy(rpack_t ** __restrict rp);
176:
177: /*
178: * rpack_attach() - Attach dynamic allocating buffer at packet
179: *
180: * @rp = raw packet;
181: * @len = allocate bytes
182: * return: -1 error or 0 ok, should be detached with rpack_detach()
183: * before call rpack_destroy() after use!
184: */
185: int rpack_attach(rpack_t * __restrict rp, size_t len);
186: /*
187: * rpack_resize() - Resize dynamic allocated buffer at packet
188: *
189: * @rp = raw packet
190: * @newlen = resize buffer to bytes
191: * return: -1 error or 0 ok, should be detached with rpack_detach()
192: * before call rpack_destroy() after use!
193: */
194: int rpack_resize(rpack_t * __restrict rp, size_t newlen);
195: /*
196: * rpack_detach() - Detach and free dynamic allocated buffer from packet
197: *
198: * @rp = raw packet
199: * return: none
200: */
201: void rpack_detach(rpack_t * __restrict rp);
202:
203: /*
204: * rpack_uint8() - Pack/Unpack 8bit value
205: *
206: * @rp = raw buffer
207: * @n = set value if !=NULL
208: * return: -1 error or get value
209: */
210: uint8_t rpack_uint8(rpack_t * __restrict rp, uint8_t * __restrict n);
211: /*
212: * rpack_uint16() - Pack/Unpack 16bit value
213: *
214: * @rp = raw buffer
215: * @n = set value if !=NULL
216: * @be = extract in big-endian
217: * return: -1 error or get value
218: */
219: uint16_t rpack_uint16(rpack_t * __restrict rp, uint16_t * __restrict n, int be);
220: /*
221: * rpack_ruint16() - Pack/Unpack raw 16bit value
222: *
223: * @rp = raw buffer
224: * @n = set value if !=NULL
225: * @be = extract in big-endian
226: * return: -1 error or get value
227: */
228: uint16_t rpack_ruint16(rpack_t * __restrict rp, uint16_t * __restrict n, int be);
229: /*
230: * rpack_uint24() - Pack/Unpack 24bit value
231: *
232: * @rp = raw buffer
233: * @n = set value if !=NULL
234: * @be = extract in big-endian
235: * return: -1 error or get value
236: */
237: uint32_t rpack_uint24(rpack_t * __restrict rp, uint32_t * __restrict n, int be);
238: /*
239: * rpack_ruint24() - Pack/Unpack raw 24bit value
240: *
241: * @rp = raw buffer
242: * @n = set value if !=NULL
243: * @be = extract in big-endian
244: * return: -1 error or get value
245: */
246: uint32_t rpack_ruint24(rpack_t * __restrict rp, uint32_t * __restrict n, int be);
247: /*
248: * rpack_uint32() - Pack/Unpack 32bit value
249: *
250: * @rp = raw buffer
251: * @n = set value if !=NULL
252: * @be = extract in big-endian
253: * return: -1 error or get value
254: */
255: uint32_t rpack_uint32(rpack_t * __restrict rp, uint32_t * __restrict n, int be);
256: /*
257: * rpack_ruint32() - Pack/Unpack raw 32bit value
258: *
259: * @rp = raw buffer
260: * @n = set value if !=NULL
261: * @be = extract in big-endian
262: * return: -1 error or get value
263: */
264: uint32_t rpack_ruint32(rpack_t * __restrict rp, uint32_t * __restrict n, int be);
265: /*
266: * rpack_uint64() - Pack/Unpack 64bit value
267: *
268: * @rp = raw buffer
269: * @n = set value if !=NULL
270: * @be = extract in big-endian
271: * return: -1 error or get value
272: */
273: uint64_t rpack_uint64(rpack_t * __restrict rp, uint64_t * __restrict n, int be);
274: /*
275: * rpack_ruint64() - Pack/Unpack raw 64bit value
276: *
277: * @rp = raw buffer
278: * @n = set value if !=NULL
279: * @be = extract in big-endian
280: * return: -1 error or get value
281: */
282: uint64_t rpack_ruint64(rpack_t * __restrict rp, uint64_t * __restrict n, int be);
283: /*
284: * rpack_data() - Pack/Unpack align data
285: *
286: * @rp = raw buffer
287: * @dat = data
288: * @datlen = data length
289: * return: NULL error or != NULL get data, must be e_free() after use!
290: */
291: void *rpack_data(rpack_t * __restrict rp, void * __restrict dat, size_t datlen);
292: /*
293: * rpack_rdata() - Pack/Unpack raw data
294: *
295: * @rp = raw buffer
296: * @dat = data
297: * @datlen = data length
298: * return: NULL error or != NULL get data, must be e_free() after use!
299: */
300: void *rpack_rdata(rpack_t * __restrict rp, void * __restrict dat, size_t datlen);
301:
302:
303: #endif
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to apack.h CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [ELWIX - Embedded LightWeight unIX -] / libelwix / inc / elwix