blob: 8f9b265cb46beb7f9c76c9d32cda6421757dadeb (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
/*-
* Copyright (c) 2003, 2004 Lev Walkin <vlm@lionet.info>. All rights reserved.
* Redistribution and modifications are permitted subject to BSD license.
*/
#ifndef _CONSTR_SET_H_
#define _CONSTR_SET_H_
#include <asn_application.h>
typedef struct asn_SET_specifics_s {
/*
* Target structure description.
*/
int struct_size; /* Size of the target structure. */
int ctx_offset; /* Offset of the asn_struct_ctx_t member */
int pres_offset; /* Offset of _presence_map member */
/*
* Tags to members mapping table (sorted).
*/
asn_TYPE_tag2member_t *tag2el;
int tag2el_count;
/*
* Extensions-related stuff.
*/
int extensible; /* Whether SET is extensible */
unsigned int *_mandatory_elements; /* Bitmask of mandatory ones */
} asn_SET_specifics_t;
/*
* A set specialized functions dealing with the SET type.
*/
asn_struct_free_f SET_free;
asn_struct_print_f SET_print;
asn_constr_check_f SET_constraint;
ber_type_decoder_f SET_decode_ber;
der_type_encoder_f SET_encode_der;
xer_type_encoder_f SET_encode_xer;
/***********************
* Some handy helpers. *
***********************/
/*
* Figure out whether the SET member indicated by PR_x has already been decoded.
* It is very simple bitfield test, despite its visual complexity.
*/
#define ASN_SET_ISPRESENT(set_ptr, PR_x) \
ASN_SET_ISPRESENT2(&((set_ptr)->_presence_map))
#define ASN_SET_ISPRESENT2(map_ptr, PR_x) \
(((unsigned int *)(map_ptr)) \
[(PR_x) / (8 * sizeof(unsigned int))] \
& (1 << ((8 * sizeof(unsigned int)) - 1 \
- ((PR_x) % (8 * sizeof(unsigned int))))))
#define ASN_SET_MKPRESENT(map_ptr, PR_x) \
(((unsigned int *)(map_ptr)) \
[(PR_x) / (8 * sizeof(unsigned int))] \
|= (1 << ((8 * sizeof(unsigned int)) - 1 \
- ((PR_x) % (8 * sizeof(unsigned int))))))
#endif /* _CONSTR_SET_H_ */
|
