blob: 73b8b5c5f74dda2d0b225c416a2d3400b509f2af [file] [log] [blame]
vlmfa67ddc2004-06-03 03:38:44 +00001/*-
2 * Copyright (c) 2003, 2004 Lev Walkin <vlm@lionet.info>. All rights reserved.
3 * Redistribution and modifications are permitted subject to BSD license.
4 */
5#ifndef _CONSTR_SET_H_
6#define _CONSTR_SET_H_
7
vlmd1579582004-09-24 21:00:50 +00008#include <asn_application.h>
vlmfa67ddc2004-06-03 03:38:44 +00009
vlmfa67ddc2004-06-03 03:38:44 +000010
vlmef6355b2004-09-29 13:26:15 +000011typedef struct asn_SET_specifics_s {
vlmfa67ddc2004-06-03 03:38:44 +000012 /*
13 * Target structure description.
14 */
15 int struct_size; /* Size of the target structure. */
vlmef6355b2004-09-29 13:26:15 +000016 int ctx_offset; /* Offset of the asn_struct_ctx_t member */
vlmfa67ddc2004-06-03 03:38:44 +000017 int pres_offset; /* Offset of _presence_map member */
18
19 /*
vlmfa67ddc2004-06-03 03:38:44 +000020 * Tags to members mapping table (sorted).
vlma3296662004-10-03 09:12:07 +000021 * Sometimes suitable for DER encoding (untagged CHOICE is present);
22 * if so, tag2el_count will be greater than td->elements_count.
vlmfa67ddc2004-06-03 03:38:44 +000023 */
vlmef6355b2004-09-29 13:26:15 +000024 asn_TYPE_tag2member_t *tag2el;
vlmfa67ddc2004-06-03 03:38:44 +000025 int tag2el_count;
26
27 /*
vlma3296662004-10-03 09:12:07 +000028 * Tags to members mapping table, second edition.
29 * Suitable for CANONICAL-XER encoding.
30 */
31 asn_TYPE_tag2member_t *tag2el_cxer;
32 int tag2el_cxer_count;
33
34 /*
vlmfa67ddc2004-06-03 03:38:44 +000035 * Extensions-related stuff.
36 */
37 int extensible; /* Whether SET is extensible */
38 unsigned int *_mandatory_elements; /* Bitmask of mandatory ones */
vlmef6355b2004-09-29 13:26:15 +000039} asn_SET_specifics_t;
vlmfa67ddc2004-06-03 03:38:44 +000040
41/*
42 * A set specialized functions dealing with the SET type.
43 */
vlm39ba4c42004-09-22 16:06:28 +000044asn_struct_free_f SET_free;
45asn_struct_print_f SET_print;
vlmfa67ddc2004-06-03 03:38:44 +000046asn_constr_check_f SET_constraint;
47ber_type_decoder_f SET_decode_ber;
48der_type_encoder_f SET_encode_der;
vlmc14611c2005-02-14 19:03:17 +000049xer_type_decoder_f SET_decode_xer;
vlm5f4f4a82005-02-14 20:15:40 +000050xer_type_decoder_f SET_decode_xer;
vlm39ba4c42004-09-22 16:06:28 +000051xer_type_encoder_f SET_encode_xer;
vlmfa67ddc2004-06-03 03:38:44 +000052
53/***********************
54 * Some handy helpers. *
55 ***********************/
56
57/*
58 * Figure out whether the SET member indicated by PR_x has already been decoded.
59 * It is very simple bitfield test, despite its visual complexity.
60 */
61#define ASN_SET_ISPRESENT(set_ptr, PR_x) \
62 ASN_SET_ISPRESENT2(&((set_ptr)->_presence_map))
63#define ASN_SET_ISPRESENT2(map_ptr, PR_x) \
64 (((unsigned int *)(map_ptr)) \
65 [(PR_x) / (8 * sizeof(unsigned int))] \
66 & (1 << ((8 * sizeof(unsigned int)) - 1 \
67 - ((PR_x) % (8 * sizeof(unsigned int))))))
68
69#define ASN_SET_MKPRESENT(map_ptr, PR_x) \
70 (((unsigned int *)(map_ptr)) \
71 [(PR_x) / (8 * sizeof(unsigned int))] \
72 |= (1 << ((8 * sizeof(unsigned int)) - 1 \
73 - ((PR_x) % (8 * sizeof(unsigned int))))))
74
75#endif /* _CONSTR_SET_H_ */