asn1c/skeletons/constr_SET.h

64 lines
1.8 KiB
C
Raw Normal View History

2004-06-03 03:38:44 +00:00
/*-
* 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 <constr_TYPE.h>
typedef struct asn1_SET_specifics_s {
/*
* Target structure description.
*/
int struct_size; /* Size of the target structure. */
int ctx_offset; /* Offset of the ber_dec_ctx_t member */
int pres_offset; /* Offset of _presence_map member */
/*
* Tags to members mapping table (sorted).
*/
2004-06-06 07:20:02 +00:00
asn1_TYPE_tag2member_t *tag2el;
2004-06-03 03:38:44 +00:00
int tag2el_count;
/*
* Extensions-related stuff.
*/
int extensible; /* Whether SET is extensible */
unsigned int *_mandatory_elements; /* Bitmask of mandatory ones */
} asn1_SET_specifics_t;
/*
* A set specialized functions dealing with the SET type.
*/
asn_constr_check_f SET_constraint;
ber_type_decoder_f SET_decode_ber;
der_type_encoder_f SET_encode_der;
asn_struct_print_f SET_print;
asn_struct_free_f SET_free;
/***********************
* 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_ */