blob: a637d575ff2c044160ee9b9249cf0a7ac0457892 [file] [log] [blame]
Ivan Kluchnikov487a1412011-12-21 13:17:53 +03001/* csn1.h
2 * Declarations and types for CSN1 dissection in wireshark.
3 * By Vincent Helfre, based on original code by Jari Sassi
4 * with the gracious authorization of STE
5 * Copyright (c) 2011 ST-Ericsson
6 *
7 * $Id: packet-csn1.h 36306 2011-03-24 09:20:14Z etxrab $
8 *
9 * Wireshark - Network traffic analyzer
10 * By Gerald Combs <gerald@wireshark.org>
11 * Copyright 1998 Gerald Combs
12 *
13 * This program is free software; you can redistribute it and/or
14 * modify it under the terms of the GNU General Public License
15 * as published by the Free Software Foundation; either version 2
16 * of the License, or (at your option) any later version.
17 *
18 * This program is distributed in the hope that it will be useful,
19 * but WITHOUT ANY WARRANTY; without even the implied warranty of
20 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
21 * GNU General Public License for more details.
22 *
23 * You should have received a copy of the GNU General Public License
24 * along with this program; if not, write to the Free Software
25 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
26 */
27
Max910a3872018-01-30 13:29:38 +010028#ifndef _PACKET_CSN1_H_
29#define _PACKET_CSN1_H_
30
Alexander Couzensccde5c92017-02-04 03:10:08 +010031#include <osmocom/core/bitvec.h>
Pau Espin Pedrolb2653fe2020-03-26 15:14:01 +010032#include "wireshark_compat.h"
Ivan Kluchnikov487a1412011-12-21 13:17:53 +030033
34/* Error codes */
35#define CSN_OK 0
36#define CSN_ERROR_GENERAL -1
37#define CSN_ERROR_DATA_NOT_VALID -2
38#define CSN_ERROR_IN_SCRIPT -3
39#define CSN_ERROR_INVALID_UNION_INDEX -4
40#define CSN_ERROR_NEED_MORE_BITS_TO_UNPACK -5
41#define CSN_ERROR_ILLEGAL_BIT_VALUE -6
42#define CSN_ERROR_INTERNAL -7
43#define CSN_ERROR_STREAM_NOT_SUPPORTED -8
44#define CSN_ERROR_MESSAGE_TOO_LONG -9
45#define CSN_ERROR_ -10
46
Ivan Kluchnikov487a1412011-12-21 13:17:53 +030047/* CallBack return status */
48typedef gint16 CSN_CallBackStatus_t;
49
50#define CSNCBS_OK 0
51#define CSNCBS_NOT_OK -10
52#define CSNCBS_NOT_TO_US -11
53#define CSNCBS_NOT_COMPLETE -12
54
55#define CSNCBS_REVISION_LIMIT_STOP -20 /* Stop packing/unpacking - revision limit */
56#define CSNCBS_NOT_SUPPORTED_IE -21 /* Handling of the unpacked IE is not supported by MS-software */
57
58
59
60#ifndef ElementsOf
61#define ElementsOf(array) (sizeof(array) / sizeof(array[0]))
62#endif
Pau Espin Pedrol5b716972020-01-24 17:24:01 +010063typedef void(*void_fn_t)(void);
Ivan Kluchnikov487a1412011-12-21 13:17:53 +030064
65/* Context holding CSN1 parameters */
66typedef struct
67{
68 gint remaining_bits_len; /* IN to an csn stream operation */
69 gint bit_offset; /* IN/OUT to an csn stream operation */
70 gint direction; /* 0 - decode; 1 - encode */
71} csnStream_t;
72
Vadim Yanitskiy39a65052020-01-25 01:24:59 +070073typedef gint16 (*StreamSerializeFcn_t)(csnStream_t* ar, struct bitvec *vector, unsigned *readIndex, void* data);
Ivan Kluchnikov487a1412011-12-21 13:17:53 +030074typedef enum
75{
76 CSN_END = 0,
77 CSN_BIT,
78 CSN_UINT,
79 CSN_TYPE,
80 CSN_CHOICE,
81 CSN_UNION,
82 CSN_UNION_LH,
83 CSN_UINT_ARRAY,
84 CSN_TYPE_ARRAY,
85 CSN_BITMAP, /* Bitmap with constant: <bitmap: bit(64)> */
86 CSN_VARIABLE_BITMAP, /* <N: bit (5)> <bitmap: bit(N + offset)> */
87 CSN_VARIABLE_BITMAP_1, /* <bitmap: bit**> i.e. to the end of message (R99) */
88 CSN_LEFT_ALIGNED_VAR_BMP, /* As variable bitmap but the result is left aligned (R99) */
89 CSN_LEFT_ALIGNED_VAR_BMP_1,/* As above only size is to the end of message (R99) */
Ivan Kluchnikov701d9f82012-10-10 19:43:37 +040090 CSN_PADDING_BITS, /* Padding bits fill to the end of the buffer */
Ivan Kluchnikov487a1412011-12-21 13:17:53 +030091 CSN_VARIABLE_ARRAY, /* Array with length specified in parameter: <N: bit(4)> <list: octet(N + offset)> */
92 CSN_VARIABLE_TARRAY, /* Type Array with length specified in parameter: <N: bit(x)> <Type>*N */
93 CSN_VARIABLE_TARRAY_OFFSET,/* As above but with offset. The offset is stored as third parameter of CSN_DESCR (descr.value) */
94 CSN_RECURSIVE_ARRAY, /* Recursive way to specify an array of uint: <list> ::= {1 <number: bit(4) <list>|0}; */
95 CSN_RECURSIVE_TARRAY, /* Recursive way to specify an array of type: <list> ::= {1 <type>} ** 0 ; */
96 CSN_RECURSIVE_TARRAY_1, /* same as above but first element always exist:<list> ::= <type> {1 <type>} ** 0 ; */
97 CSN_RECURSIVE_TARRAY_2, /* same as above but with reversed separators :<lists> ::= <type> { 0 <type> } ** 1 ; */
98 CSN_EXIST,
99 CSN_EXIST_LH,
100 CSN_NEXT_EXIST,
101 CSN_NEXT_EXIST_LH,
102 CSN_NULL,
103 CSN_FIXED,
104 CSN_CALLBACK,
105 CSN_UINT_OFFSET, /* unpack will add offset, inverse pack will subtract offset */
106 CSN_UINT_LH, /* Low High extraction of int */
107 CSN_SERIALIZE,
108 CSN_TRAP_ERROR
109} csn_type_t;
110
111/******************************************************************************************
112 * CSN_DESCR structure:
113 *
114 * type:
115 * This is the CSN type. All existing types are specified in the section above.
116 *
117 * i:
118 * Depending on the contents of the type parameter, the parameter "i" may have following meaning:
Ivan Kluchnikov701d9f82012-10-10 19:43:37 +0400119 * - specifies the number of bits for the CSN_UINT or CSN_UINT_OR_NULL types
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300120 * - the offset for an array size by which the size is incremented
121 * for the CSN_VAR_ARRAY type
122 * - the length of each element of an array for the CSN_REC_ARRAY type
123 * - the number of the elements in an array for the CSN_TYPE_ARRAY type
124 * - the offset to the variable keeping the number of elements of an array for in the CSN_VAR_TARRAY type
125 * - the number of different data types in a union for the CSN_UNION, CSN_UNION_LH, and for the CSN_CHOICE types
126 * - the length in bits of the fixed number defined for the CSN_FIXED type
127 * - the number of lines to skip in the CSN_DESCR type specified for the CSN_NEXT_EXIST, CSN_NEXT_EXIST_LH,
128 * CSN_NEXT_EXIST_OR_NULL, and CSN_NEXT_EXIST_OR_NULL_LH types
129 * - the number of bits in a bitmap for the CSN_BITMAP type
130 * - the value by which the number of bits in a bitmap has to be incremented or decremented for the
131 * CSN_VAR_BITMAP, CSN_LEFT_VAR_BMP, and CSN_LEFT_BMP_1 types
132 * - the offset to param1 for the CSN_CALLBACK type
133 * - ERRORCODE used by the CSN_ERROR type
Ivan Kluchnikov701d9f82012-10-10 19:43:37 +0400134 * - the bit-length of the LENGTH field in a CSN_SERIALISE type
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300135 *
136 * descr
137 * This parameter has different meaning depending on the value of the type parameter:
138 * - the offset for the CSN_UINT_OFFSET type
139 * - the number of the elements in an array of the CSN_UINT_ARRAY type
140 * - the offset to the parameter where the size of the array has to be stored for the CSN_REC_ARRAY type
141 * - the address of the internal structure, describing the member type (by means of the CSN_DESCR type) in the
142 * CSN_TYPE_ARRAY, CSN_VAR_TARRAY, and CSN_TYPE types
143 * - the address of the variable of type CSN_ChoiceElement_t describing all elements in the CSN_CHOICE type union
144 * - the offset to the variable where the number of bits has to be or is stored for the CSN_VAR_BITMAP,
145 * CSN_LEFT_VAR_BMP, and CSN_LEFT_BMP_1 types
146 * - the function number (case number) for the CSN_CALLBACK and CSN_CALLBACK_NO_ARGS types
147 * - the free text used by the CSN_TRAP_ERROR
148 *
149 * offset
150 * This is an offset to the _MEMBER parameter counting from the beginning of struct
151 * where the unpacked or packed value shall be stored or fetched. The meaning of the _MEMBER parameter
152 * varies depending on the type which is specified and so is the meaning of the offset parameter.
153 * Some types (and corresponding macros) do not have the _MEMBER parameter and then the offset parameter
154 * is not used or is different from the offset to the _MEMBER.
155 * - the fixed value for the CSN_FIXED type
156 * - an offset to the variable UnionType for CSN_UNION and CSN_UNION_LH types
157 * - an offset to the variable Exist for CSN_NEXT_EXIST and CSN_NEXT_EXIST_LH types
158 * - an offset to param2 in the CSN_CALLBACK type
159 *
Ivan Kluchnikov701d9f82012-10-10 19:43:37 +0400160 * may_be_null
161 * TRUE: if dissection may be attempted at an offset beyond the length of existing data bits
162 * FALSE: othewise
163 *
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300164 * sz
165 * - is the name of the parameter within the descr where their unpacked or packed value shall be stored or fetched.
166 * This paramater is pointed out by the offset parameter in the same CSN_DESCR variable as the sz.
167 * - the free text used by the CSN_TRAP_ERROR (the same as parameter "i")
168 *
169 * serialize
170 * - stores the size of _MEMBER type in case of the M_TYPE_ARRAY and M_VAR_TARRAY,
171 * - the address of the function which is provided by the M_SERIALIZE type.
172 ******************************************************************************************/
173
174
175typedef struct
176{
177 gint16 type;
178 gint16 i;
179 union
180 {
Pau Espin Pedrol5b716972020-01-24 17:24:01 +0100181 const void* ptr;
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300182 guint32 value;
183 } descr;
Ivan Kluchnikov9b06ff02012-06-15 10:13:30 +0400184 unsigned offset;
Ivan Kluchnikov701d9f82012-10-10 19:43:37 +0400185 gboolean may_be_null;
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300186 const char* sz;
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100187 guint32 value;
Pau Espin Pedrol5b716972020-01-24 17:24:01 +0100188 void_fn_t aux_fn;
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300189} CSN_DESCR;
190
191typedef struct
192{
193 guint8 bits;
194 guint8 value;
Pau Espin Pedrol7cce8252020-01-24 16:41:14 +0100195 gboolean keep_bits;
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300196 CSN_DESCR descr;
197} CSN_ChoiceElement_t;
198
199void csnStreamInit(csnStream_t* ar,gint BitOffset,gint BitCount);
200
201/******************************************************************************
202* FUNCTION: csnStreamDecoder
203* DESCRIPTION:
204* UnPacks data from bit stream. According to CSN description.
205* ARGS:
206* ar stream will hold the parameters to the pack function
207* ar->remaining_bits_len [IN] Number of bits to unpack [OUT] number of bits left to unpack.
208* ar->bit_offset [IN/OUT] is the current bit where to proceed with the next bit to unpack.
209
210* pDescr CSN description.
211* tvb buffer containing the bit stream to unpack.
212* data unpacked data.
213* ett_csn1 tree
214*
215* RETURNS: int Number of bits left to be unpacked. Negative Error code if failed to unpack all bits
216******************************************************************************/
217
Vadim Yanitskiy39a65052020-01-25 01:24:59 +0700218gint16 csnStreamDecoder(csnStream_t* ar, const CSN_DESCR* pDescr, struct bitvec *vector, unsigned *readIndex, void* data);
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300219
Vadim Yanitskiy39a65052020-01-25 01:24:59 +0700220gint16 csnStreamEncoder(csnStream_t* ar, const CSN_DESCR* pDescr, struct bitvec *vector, unsigned *writeIndex, void* data);
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300221
222/* CSN struct macro's */
223#define CSN_DESCR_BEGIN(_STRUCT)\
224 CSN_DESCR CSNDESCR_##_STRUCT[] = {
225
226#define CSN_DESCR_END(_STRUCT)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100227 {CSN_END, 0, {0}, 0, FALSE, "", 0, NULL} };
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300228
229/******************************************************************************
230 * CSN_ERROR(Par1, Par2, Par3)
231 * May be called at any time when an abort of packing or unpacking of a message
232 * is desired
233 * Par1: C structure name
234 * Par2: free text which will appear in the error handler
235 * Par3: Error code
236 *****************************************************************************/
237#define CSN_ERROR(_STRUCT, _Text, _ERRCODE)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100238 {CSN_TRAP_ERROR, _ERRCODE, {_Text}, 0, FALSE, _Text, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300239
240/******************************************************************************
241 * M_BIT(Par1, Par2)
242 * Defines one bit element in the CSN1 syntax.
243 * Par1: C structure name
244 * Par2: C structure element name
245 *****************************************************************************/
246#define M_BIT(_STRUCT, _MEMBER)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100247 {CSN_BIT, 0, {0}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, 0, NULL}
Ivan Kluchnikov701d9f82012-10-10 19:43:37 +0400248
249/******************************************************************************
250 * M_BIT_OR_NULL(Par1, Par2)
251 * Similar to the M_BIT except that not only bit 0 or 1 but also the
252 * end of the message may be encountered when looking for the next element in
253 * the message.
254 * Covers the case {null | 0 | 1}
255 *****************************************************************************/
256 #define M_BIT_OR_NULL(_STRUCT, _MEMBER)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100257 {CSN_BIT, 0, {0}, offsetof(_STRUCT, _MEMBER), TRUE, #_MEMBER, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300258
259/******************************************************************************
260 * M_NEXT_EXIST(Par1, Par2, Par3)
Pau Espin Pedrol5b716972020-01-24 17:24:01 +0100261 * Indicates whether the next element or a group of elements defined in the
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300262 * structure is present or not.
263 * Par1: C structure name
264 * Par2: C structure element name
265 * Par3: number of lines to skip in the CSN_DESCR type specified if the
266 * element(s) does not exist
267 *****************************************************************************/
268#define M_NEXT_EXIST(_STRUCT, _MEMBER, _NoOfExisting)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100269 {CSN_NEXT_EXIST, _NoOfExisting, {0}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300270
271/******************************************************************************
272 * M_NEXT_EXIST_LH(Par1, Par2, Par3)
273 * similar to the M_NEXT_EXIST except that instead of bit 0/1 which is fetched
274 * from the message in order to find out whether the next element/elements are
Pau Espin Pedrole5e2f742020-03-26 15:14:17 +0100275 * present in the message, the logical operation XOR with the background
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300276 * pattern 0x2B is performed on the read bit before the decision is made.
277 *****************************************************************************/
278#define M_NEXT_EXIST_LH(_STRUCT, _MEMBER, _NoOfExisting)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100279 {CSN_NEXT_EXIST_LH, _NoOfExisting, {0}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300280
281/******************************************************************************
282 * M_NEXT_EXIST_OR_NULL(Par1, Par2, Par3)
283 * Similar to the M_NEXT_EXIST except that not only bit 0 or 1 but also the end
Pau Espin Pedrole5e2f742020-03-26 15:14:17 +0100284 * of the message may be encountered when looking for the next element in the
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300285 * message.
Pau Espin Pedrole5e2f742020-03-26 15:14:17 +0100286 * Covers the case {null | 0 | 1 < IE >}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300287 *****************************************************************************/
288#define M_NEXT_EXIST_OR_NULL(_STRUCT, _MEMBER, _NoOfExisting)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100289 {CSN_NEXT_EXIST, _NoOfExisting, {0}, offsetof(_STRUCT, _MEMBER), TRUE, #_MEMBER, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300290
291/******************************************************************************
292 * M_NEXT_EXIST_OR_NULL_LH(Par1, Par2, Par3)
293 * Similar to the M_NEXT_EXIST_LH except that not only bit 0 or 1 but also the
294 * end of the message may be encountered when looking for the next element in
295 * the message.
Pau Espin Pedrole5e2f742020-03-26 15:14:17 +0100296 * Covers the case {null | L | H < IE >}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300297 *****************************************************************************/
298#define M_NEXT_EXIST_OR_NULL_LH(_STRUCT, _MEMBER, _NoOfExisting)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100299 {CSN_NEXT_EXIST_LH, _NoOfExisting, {(void*)1}, offsetof(_STRUCT, _MEMBER), TRUE, #_MEMBER, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300300
301/******************************************************************************
302 * M_UINT(Par1, Par2, Par3)
303 * Defines an integer number.
304 * Par1: C structure name
305 * Par2: C structure element name
306 * Par3: number of bits used to code the element (between 1 and 32)
307 *****************************************************************************/
308#define M_UINT(_STRUCT, _MEMBER, _BITS)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100309 {CSN_UINT, _BITS, {0}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, 0, NULL}
Ivan Kluchnikov701d9f82012-10-10 19:43:37 +0400310
311 /******************************************************************************
312 * M_UINT_OR_NULL(Par1, Par2, Par3)
313 * Similar to the M_UINT except that not only the request set of bits but also the
314 * end of the message may be encountered when looking for the next element in
315 * the message.
316 * Covers the case {null | 0 | 1 < IE >}
317 *****************************************************************************/
318 #define M_UINT_OR_NULL(_STRUCT, _MEMBER, _BITS)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100319 {CSN_UINT, _BITS, {0}, offsetof(_STRUCT, _MEMBER), TRUE, #_MEMBER, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300320
321/******************************************************************************
322 * M_UINT(Par1, Par2, Par3)
323 * This macro has the same functionality as M_UINT except that in addition the
Pau Espin Pedrole5e2f742020-03-26 15:14:17 +0100324 * logical "exclusive or" operation with the background value "0x2B" is
325 * performed before the final value of the integer number is delivered from the
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300326 * received CSN.1 message
327 *****************************************************************************/
328#define M_UINT_LH(_STRUCT, _MEMBER, _BITS)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100329 {CSN_UINT_LH, _BITS, {0}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300330
331/******************************************************************************
332 * M_UINT_OFFSET(Par1, Par2, Par3, Par4)
333 * Defines an integer number.
334 * Par1: C structure name
335 * Par2: C structure element name
336 * Par3: number of bits used to code the element (between 1 and 32)
337 * Par4: value added to the returned integer (offset)
338 *****************************************************************************/
339#define M_UINT_OFFSET(_STRUCT, _MEMBER, _BITS, _OFFSET)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100340 {CSN_UINT_OFFSET, _BITS, {(void*)_OFFSET}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300341
342/******************************************************************************
343 * M_UINT_ARRAY(Par1, Par2, Par3, Par4)
344 * Defines an array of integer numbers. The size of the array is fixed.
345 * Par1: C structure name
346 * Par2: C structure element name
347 * Par3: number of bits used to code the each integer element (between 1 and 32)
348 * Par4: number of elements in the array (fixed integer value)
349 *****************************************************************************/
350#define M_UINT_ARRAY(_STRUCT, _MEMBER, _BITS, _ElementCount)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100351 {CSN_UINT_ARRAY, _BITS, {(void*)_ElementCount}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300352
353/******************************************************************************
354 * M_VAR_UINT_ARRAY(Par1, Par2, Par3, Par4)
355 * Defines an array of integer numbers. The size of the array is variable.
356 * Par1: C structure name
357 * Par2: C structure element name
358 * Par3: number of bits used to code the each integer element (between 1 and 32)
359 * Par4: number of elements in the array supplied by reference to the
360 * structure member holding the length value
361 *****************************************************************************/
362#define M_VAR_UINT_ARRAY(_STRUCT, _MEMBER, _BITS, _ElementCountField)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100363 {CSN_UINT_ARRAY, _BITS, {(void*)offsetof(_STRUCT, _ElementCountField)}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, 1, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300364
365/******************************************************************************
366 * M_VAR_ARRAY(Par1, Par2, Par3, Par4)
367 * Defines an array of 8 bit large integer numbers. The size of the array is variable.
368 * Par1: C structure name
369 * Par2: C structure element name
370 * Par3: name of the structure member holding the size of the array
371 * Par4: offset that is added to the Par3 to get the actual size of the array
372 *****************************************************************************/
373#define M_VAR_ARRAY(_STRUCT, _MEMBER, _ElementCountField, _OFFSET)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100374 {CSN_VARIABLE_ARRAY, _OFFSET, {(void*)offsetof(_STRUCT, _ElementCountField)}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300375
376/******************************************************************************
377 * M_VAR_TARRAY(Par1, Par2, Par3, Par4)
378 * Similar to M_TYPE_ARRAY except that the size of the array is variable.
379 * Par1: C structure name
380 * Par2: C structure element name
381 * Par3: the type of each element of the array
382 * Par4: name of the structure member holding the size of the array
383 *****************************************************************************/
384#define M_VAR_TARRAY(_STRUCT, _MEMBER, _MEMBER_TYPE, _ElementCountField)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100385 {CSN_VARIABLE_TARRAY, offsetof(_STRUCT, _ElementCountField), {(const void*)CSNDESCR_##_MEMBER_TYPE}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, sizeof(_MEMBER_TYPE), NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300386
387/******************************************************************************
388 * M_VAR_TARRAY_OFFSET(Par1, Par2, Par3, Par4)
389 * Same as M_VAR_TARRAY with offset
390 *****************************************************************************/
391#define M_VAR_TARRAY_OFFSET(_STRUCT, _MEMBER, _MEMBER_TYPE, _ElementCountField)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100392 {CSN_VARIABLE_TARRAY_OFFSET, offsetof(_STRUCT, _ElementCountField), {(const void*)CSNDESCR_##_MEMBER_TYPE}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, sizeof(_MEMBER_TYPE), NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300393
394/******************************************************************************
395 * M_REC_ARRAY(Par1, Par2, Par3, Par4)
Pau Espin Pedrole5e2f742020-03-26 15:14:17 +0100396 * similar to the M_VAR_ARRAY. The difference is that the size of the array is
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300397 * not known in advance and it has to be calculated during unpacking. Its value
Pau Espin Pedrole5e2f742020-03-26 15:14:17 +0100398 * is stored in a variable which belongs to the same structure as the array.
399 * A zero element terminates the array. The CSN.1 syntax describes it
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300400 * recursively as:
Pau Espin Pedrole5e2f742020-03-26 15:14:17 +0100401 * <array> ::={1 <element> <array>| 0}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300402 *
403 * Par1: C structure name
404 * Par2: C structure element name
Pau Espin Pedrole5e2f742020-03-26 15:14:17 +0100405 * Par3: name of the structure member where the calculated the size of the
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300406 * array will be stored
407 * Par4: length of each element in bits
408 *****************************************************************************/
409#define M_REC_ARRAY(_STRUCT, _MEMBER, _ElementCountField, _BITS)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100410 {CSN_RECURSIVE_ARRAY, _BITS, {(const void*)offsetof(_STRUCT, _ElementCountField)}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300411
412/******************************************************************************
413 * M_VAR_TYPE_ARRAY(Par1, Par2, Par3, Par4)
414 * Defines an array of structures. The size of the array is variable.
415 * Par1: C structure name
416 * Par2: C structure element name
417 * Par3: name of the structure
418 * Par4: number of elements in the array (fixed integer value)
419 *****************************************************************************/
420#define M_TYPE_ARRAY(_STRUCT, _MEMBER, _MEMBER_TYPE, _ElementCount)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100421 {CSN_TYPE_ARRAY, _ElementCount, {(const void*)CSNDESCR_##_MEMBER_TYPE}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, sizeof(_MEMBER_TYPE), NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300422
423/******************************************************************************
424 * M_REC_TARRAY(Par1, Par2, Par3, Par4)
425 * Defines an recursive array of structures. The size of the array is variable.
426 * <list> ::= {1 <type>} ** 0 ;
427 * Par1: C structure name
428 * Par2: C structure element name
429 * Par3: name of the structure
430 * Par4: will hold the number of element in the array after unpacking
431 *****************************************************************************/
432#define M_REC_TARRAY(_STRUCT, _MEMBER, _MEMBER_TYPE, _ElementCountField)\
Pau Espin Pedrolefad80b2020-03-23 14:35:26 +0100433 {CSN_RECURSIVE_TARRAY, offsetof(_STRUCT, _ElementCountField), {(const void*)CSNDESCR_##_MEMBER_TYPE}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, sizeof(_MEMBER_TYPE), (void_fn_t)ElementsOf(((_STRUCT*)0)->_MEMBER)}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300434
435/******************************************************************************
436 * M_REC_TARRAY1(Par1, Par2, Par3, Par4)
437 * Same as M_REC_TARRAY but first element always exist:
438 * <list> ::= <type> {1 <type>} ** 0 ;
439 *****************************************************************************/
440#define M_REC_TARRAY_1(_STRUCT, _MEMBER, _MEMBER_TYPE, _ElementCountField)\
Pau Espin Pedrolefad80b2020-03-23 14:35:26 +0100441 {CSN_RECURSIVE_TARRAY_1, offsetof(_STRUCT, _ElementCountField), {(const void*)CSNDESCR_##_MEMBER_TYPE}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, sizeof(_MEMBER_TYPE), (void_fn_t)ElementsOf(((_STRUCT*)0)->_MEMBER)}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300442
443/******************************************************************************
444 * M_REC_TARRAY2(Par1, Par2, Par3, Par4)
445 * Same as M_REC_TARRAY but with reversed separators :
446 * <lists> ::= <type> { 0 <type> } ** 1 ;
447 *****************************************************************************/
448#define M_REC_TARRAY_2(_STRUCT, _MEMBER, _MEMBER_TYPE, _ElementCountField)\
Pau Espin Pedrolefad80b2020-03-23 14:35:26 +0100449 {CSN_RECURSIVE_TARRAY_2, offsetof(_STRUCT, _ElementCountField), {(const void*)CSNDESCR_##_MEMBER_TYPE}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, sizeof(_MEMBER_TYPE), (void_fn_t)ElementsOf(((_STRUCT*)0)->_MEMBER)}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300450
451/******************************************************************************
452 * M_TYPE(Par1, Par2, Par3)
453 * Defines a reference to a structure which is described elsewhere
454 * <list> ::= {1 <type>} ** 0 ;
455 * Par1: C structure name
456 * Par2: C structure element name
457 * Par3: type of member
458 *****************************************************************************/
459#define M_TYPE(_STRUCT, _MEMBER, _MEMBER_TYPE)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100460 {CSN_TYPE, 0, {(const void*)CSNDESCR_##_MEMBER_TYPE}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300461
462/******************************************************************************
463 * M_UNION(Par1, Par2)
464 * Informs the CSN.1 library that a union follows and how many possible choices
465 * there are in the union. The actual value of the choice, which points out the
Pau Espin Pedrole5e2f742020-03-26 15:14:17 +0100466 * chosen element of the union is stored in the uint8 variable and is usually
467 * called UnionType. The elements of the union have to be listed directly after
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300468 * the M_UNION statement.
469 * Par1: C structure name
470 * Par2: number of possible choice in the union
471 *****************************************************************************/
472#define M_UNION(_STRUCT, _COUNT)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100473 {CSN_UNION, _COUNT, {0}, offsetof(_STRUCT, UnionType), FALSE, "UnionType", 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300474
475/******************************************************************************
476 * M_UNION_LH(Par1, Par2)
477 * Same as M_UNION but masked with background value 0x2B
478 *****************************************************************************/
479#define M_UNION_LH(_STRUCT, _COUNT)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100480 {CSN_UNION_LH, _COUNT, {0}, offsetof(_STRUCT, UnionType), FALSE, "UnionType", 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300481
482/******************************************************************************
483 * M_CHOICE(Par1, Par2, Par3, Par4)
Pau Espin Pedrole5e2f742020-03-26 15:14:17 +0100484 * Similar to the M_UNION. In the M_UNION the selected element of all possible
485 * choices in the union is referred as a sequential numbers, i.e., the first
486 * choice is addressed as choice 0 the second as choice 1, the third as choice
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300487 * 2 and so on, both in the encoded message and in the variable UnionType which
Pau Espin Pedrole5e2f742020-03-26 15:14:17 +0100488 * is the part of the message. In the CSN_CHOICE case, this rule does not
489 * apply. There is free but predefined mapping of the element of the union and
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300490 * the value which addresses this element.
491 * The value of the address is called a selector.
492 * After unpacking, this value is then converted to the sequential number of the
493 * element in the union and stored in the UnionType variable.
494 * Par1: C structure name
495 * Par2: C structure element name
496 * Par3: address of an array of type CSN_ChoiceElement_t where all possible
Pau Espin Pedrole5e2f742020-03-26 15:14:17 +0100497 * values of the selector are provided, together with the selector
498 * length expressed in bits and the address of the CSN_DESCR type
499 * where the element is defined. For every element in the union
500 * there is one line in the Choice variable. These lines have to
501 * appear in the _CHOICE in the same order as the elements in the
502 * union. The element of the union selected in the message through
503 * the _CHOICE parameter is after unpacking translated to the
504 * corresponding sequential number of this element and stored in
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300505 * the variable pointed out by the _MEMBER
506 * Par4: number of possible choices in the union
507 *****************************************************************************/
508#define M_CHOICE(_STRUCT, _MEMBER, _CHOICE, _ElementCount)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100509 {CSN_CHOICE, _ElementCount, {(const void*)_CHOICE}, offsetof(_STRUCT, _MEMBER), FALSE, #_CHOICE, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300510
511/******************************************************************************
512 * M_FIXED(Par1, Par2, Par3)
Pau Espin Pedrole5e2f742020-03-26 15:14:17 +0100513 * Defines a fixed value of type integer which should be fetched from or stored
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300514 * in the message
515 * Par1: C structure name
516 * Par2: gives the length of the fixed number in bits.
Pau Espin Pedrole5e2f742020-03-26 15:14:17 +0100517 * Par3: the value of the number. If the expected value is not present in
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300518* the message the unpacking procedure is aborted
519 *****************************************************************************/
520#define M_FIXED(_STRUCT, _BITS, _BITVALUE)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100521 {CSN_FIXED, _BITS, {0}, _BITVALUE, FALSE, #_BITVALUE, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300522
523/******************************************************************************
524 * M_SERIALIZE(Par1, Par2, Par3)
Pau Espin Pedrole5e2f742020-03-26 15:14:17 +0100525 * Allows using a complete free format of data being encoded or decoded.
Ivan Kluchnikov701d9f82012-10-10 19:43:37 +0400526 * When the M_SERIALIZE is encounted during encoding or decoding of a message
Pau Espin Pedrole5e2f742020-03-26 15:14:17 +0100527 * the CSNstream program passes the control over to the specified function
528 * together with all necessary parameters about the current position within
529 * the message being unpacked or packed. When transferring of "serialized"
530 * data to or from the message is finished by the function the CSNstream gets
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300531 * back control over the data stream and continues to work with the message.
532 *****************************************************************************/
Ivan Kluchnikov701d9f82012-10-10 19:43:37 +0400533#define M_SERIALIZE(_STRUCT, _MEMBER, _LENGTH_LEN, _SERIALIZEFCN)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100534 {CSN_SERIALIZE, _LENGTH_LEN, {0}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, 0, (void_fn_t)_SERIALIZEFCN}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300535
536#define M_CALLBACK(_STRUCT, _CSNCALLBACKFCN, _PARAM1, _PARAM2)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100537 {CSN_CALLBACK, offsetof(_STRUCT, _PARAM1), {0}, offsetof(_STRUCT, _PARAM2), FALSE, "CallBack_"#_CSNCALLBACKFCN, 0, (void_fn_t)_CSNCALLBACKFCN}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300538
539/******************************************************************************
540 * M_BITMAP(Par1, Par2, Par3)
Pau Espin Pedrole5e2f742020-03-26 15:14:17 +0100541 * Defines a type which consists of a bitmap. The size of the bitmap in bits
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300542 * is fixed and provided by the parameter Par3
543 * Par1: C structure name
544 * Par2: C structure element name
545 * Par3: length of the bitmap expressed in bits
546 *****************************************************************************/
547#define M_BITMAP(_STRUCT, _MEMBER, _BITS)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100548 {CSN_BITMAP, _BITS, {0}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300549
550/* variable length, right aligned bitmap i.e. _ElementCountField = 11 => 00000111 11111111 */
551#define M_VAR_BITMAP(_STRUCT, _MEMBER, _ElementCountField, _OFFSET)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100552 {CSN_VARIABLE_BITMAP, _OFFSET, {(void*)offsetof(_STRUCT, _ElementCountField)}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300553
554/* variable length, right aligned bitmap filling the rest of message
555 * - when unpacking the _ElementCountField will be set in runtime
556 * - when packing _ElementCountField contains the size of bitmap
557 */
558#define M_VAR_BITMAP_1(_STRUCT, _MEMBER, _ElementCountField, _OFFSET)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100559 {CSN_VARIABLE_BITMAP_1, _OFFSET, {(void*)offsetof(_STRUCT, _ElementCountField)}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300560
561/* variable length, left aligned bitmap i.e. _ElementCountField = 11 => 11111111 11100000 */
562#define M_LEFT_VAR_BMP(_STRUCT, _MEMBER, _ElementCountField, _OFFSET)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100563 {CSN_LEFT_ALIGNED_VAR_BMP, _OFFSET, {(void*)offsetof(_STRUCT, _ElementCountField)}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300564
565/* variable length, left aligned bitmap filling the rest of message
566 *- when unpacking the _ElementCountField will be set in runtime
567 * - when packing _ElementCountField contains the size of bitmap
568 */
569#define M_LEFT_VAR_BMP_1(_STRUCT, _MEMBER, _ElementCountField, _OFFSET)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100570 {CSN_LEFT_ALIGNED_VAR_BMP_1, _OFFSET, {(void*)offsetof(_STRUCT, _ElementCountField)}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, 0, NULL}
Ivan Kluchnikov701d9f82012-10-10 19:43:37 +0400571
572/* todo: dissect padding bits looking for unexpected extensions */
573#define M_PADDING_BITS(_STRUCT)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100574 {CSN_PADDING_BITS, 0, {0}, 0, TRUE, "Padding", 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300575
Anders Broman72c102a2020-01-24 14:31:15 +0100576#define M_NULL(_STRUCT, _MEMBER, _SKIP_BITS)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100577 {CSN_NULL, _SKIP_BITS, {0}, offsetof(_STRUCT, _MEMBER), FALSE, #_MEMBER, 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300578
579#define M_THIS_EXIST(_STRUCT)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100580 {CSN_EXIST, 0, {0}, offsetof(_STRUCT, Exist), FALSE, "Exist", 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300581
582#define M_THIS_EXIST_LH(_STRUCT)\
Pau Espin Pedrol900c2e22020-01-24 18:05:00 +0100583 {CSN_EXIST_LH, 0, {0}, offsetof(_STRUCT, Exist), FALSE, "Exist", 0, NULL}
Ivan Kluchnikov487a1412011-12-21 13:17:53 +0300584
585/* return value 0 if ok else discontionue the unpacking */
586typedef gint16 (*CsnCallBackFcn_t)(void* pv ,...);
587
588#define CSNDESCR(_FuncType) CSNDESCR_##_FuncType
589
590#endif /*_PACKET_CSN1_H_*/