blob: 4bafffef36a2e9105a1d5aff91053cabc4491686 [file] [log] [blame]
Lev Walkinf15320b2004-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
Lev Walkin11c3e172004-09-24 21:00:50 +00008#include <asn_application.h>
Lev Walkinf15320b2004-06-03 03:38:44 +00009
Lev Walkin21b41ac2005-07-24 09:03:44 +000010#ifdef __cplusplus
11extern "C" {
12#endif
13
Lev Walkinf15320b2004-06-03 03:38:44 +000014
Wim Lewisfb6344e2014-07-28 12:16:01 -070015typedef const struct asn_SET_specifics_s {
Lev Walkin494fb702017-08-07 20:07:00 -070016 /*
17 * Target structure description.
18 */
19 unsigned struct_size; /* Size of the target structure. */
20 unsigned ctx_offset; /* Offset of the asn_struct_ctx_t member */
21 unsigned pres_offset; /* Offset of _presence_map member */
Lev Walkinf15320b2004-06-03 03:38:44 +000022
Lev Walkin494fb702017-08-07 20:07:00 -070023 /*
24 * Tags to members mapping table (sorted).
25 * Sometimes suitable for DER encoding (untagged CHOICE is present);
26 * if so, tag2el_count will be greater than td->elements_count.
27 */
28 const asn_TYPE_tag2member_t *tag2el;
29 unsigned tag2el_count;
Lev Walkinf15320b2004-06-03 03:38:44 +000030
Lev Walkin494fb702017-08-07 20:07:00 -070031 /*
32 * Tags to members mapping table, second edition.
33 * Suitable for CANONICAL-XER encoding.
34 */
35 const asn_TYPE_tag2member_t *tag2el_cxer;
36 unsigned tag2el_cxer_count;
Lev Walkind5193802004-10-03 09:12:07 +000037
Lev Walkin494fb702017-08-07 20:07:00 -070038 /*
39 * Extensions-related stuff.
40 */
41 int extensible; /* Whether SET is extensible */
42 const unsigned int *_mandatory_elements; /* Bitmask of mandatory ones */
Lev Walkin5e033762004-09-29 13:26:15 +000043} asn_SET_specifics_t;
Lev Walkinf15320b2004-06-03 03:38:44 +000044
45/*
46 * A set specialized functions dealing with the SET type.
47 */
Lev Walkina9cc46e2004-09-22 16:06:28 +000048asn_struct_free_f SET_free;
49asn_struct_print_f SET_print;
Lev Walkincd2f48e2017-08-10 02:14:59 -070050asn_struct_compare_f SET_compare;
Lev Walkinf15320b2004-06-03 03:38:44 +000051asn_constr_check_f SET_constraint;
52ber_type_decoder_f SET_decode_ber;
53der_type_encoder_f SET_encode_der;
Lev Walkin6c0df202005-02-14 19:03:17 +000054xer_type_decoder_f SET_decode_xer;
Lev Walkina9cc46e2004-09-22 16:06:28 +000055xer_type_encoder_f SET_encode_xer;
Lev Walkinadf863f2006-09-05 16:18:34 +000056per_type_decoder_f SET_decode_uper;
57per_type_encoder_f SET_encode_uper;
Lev Walkinf15320b2004-06-03 03:38:44 +000058
59/***********************
60 * Some handy helpers. *
61 ***********************/
62
63/*
64 * Figure out whether the SET member indicated by PR_x has already been decoded.
65 * It is very simple bitfield test, despite its visual complexity.
66 */
67#define ASN_SET_ISPRESENT(set_ptr, PR_x) \
Lev Walkin57dabf12005-07-08 18:36:51 +000068 ASN_SET_ISPRESENT2(&((set_ptr)->_presence_map), PR_x)
Lev Walkinf15320b2004-06-03 03:38:44 +000069#define ASN_SET_ISPRESENT2(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#define ASN_SET_MKPRESENT(map_ptr, PR_x) \
76 (((unsigned int *)(map_ptr)) \
77 [(PR_x) / (8 * sizeof(unsigned int))] \
78 |= (1 << ((8 * sizeof(unsigned int)) - 1 \
79 - ((PR_x) % (8 * sizeof(unsigned int))))))
80
Lev Walkin21b41ac2005-07-24 09:03:44 +000081#ifdef __cplusplus
82}
83#endif
84
Lev Walkinf15320b2004-06-03 03:38:44 +000085#endif /* _CONSTR_SET_H_ */