加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
克隆/下载
Bool.c 3.93 KB
一键复制 编辑 原始数据 按行查看 历史
eomer 提交于 2019-11-12 10:34 . init repo
/*
* Generated by asn1c-0.9.28 (http://lionet.info/asn1c)
* From ASN.1 module "DLT69845"
* found in "dlt698.45.asn1"
* `asn1c -gen-PER -pdu=all`
*/
#include "Bool.h"
int
Bool_constraint(asn_TYPE_descriptor_t *td, const void *sptr,
asn_app_constraint_failed_f *ctfailcb, void *app_key) {
/* Replace with underlying type checker */
td->check_constraints = asn_DEF_BOOLEAN.check_constraints;
return td->check_constraints(td, sptr, ctfailcb, app_key);
}
/*
* This type is implemented using BOOLEAN,
* so here we adjust the DEF accordingly.
*/
static void
Bool_1_inherit_TYPE_descriptor(asn_TYPE_descriptor_t *td) {
td->free_struct = asn_DEF_BOOLEAN.free_struct;
td->print_struct = asn_DEF_BOOLEAN.print_struct;
td->check_constraints = asn_DEF_BOOLEAN.check_constraints;
td->ber_decoder = asn_DEF_BOOLEAN.ber_decoder;
td->der_encoder = asn_DEF_BOOLEAN.der_encoder;
td->xer_decoder = asn_DEF_BOOLEAN.xer_decoder;
td->xer_encoder = asn_DEF_BOOLEAN.xer_encoder;
td->uper_decoder = asn_DEF_BOOLEAN.uper_decoder;
td->uper_encoder = asn_DEF_BOOLEAN.uper_encoder;
if(!td->per_constraints)
td->per_constraints = asn_DEF_BOOLEAN.per_constraints;
td->elements = asn_DEF_BOOLEAN.elements;
td->elements_count = asn_DEF_BOOLEAN.elements_count;
td->specifics = asn_DEF_BOOLEAN.specifics;
}
void
Bool_free(asn_TYPE_descriptor_t *td,
void *struct_ptr, int contents_only) {
Bool_1_inherit_TYPE_descriptor(td);
td->free_struct(td, struct_ptr, contents_only);
}
int
Bool_print(asn_TYPE_descriptor_t *td, const void *struct_ptr,
int ilevel, asn_app_consume_bytes_f *cb, void *app_key) {
Bool_1_inherit_TYPE_descriptor(td);
return td->print_struct(td, struct_ptr, ilevel, cb, app_key);
}
asn_dec_rval_t
Bool_decode_ber(asn_codec_ctx_t *opt_codec_ctx, asn_TYPE_descriptor_t *td,
void **structure, const void *bufptr, size_t size, int tag_mode) {
Bool_1_inherit_TYPE_descriptor(td);
return td->ber_decoder(opt_codec_ctx, td, structure, bufptr, size, tag_mode);
}
asn_enc_rval_t
Bool_encode_der(asn_TYPE_descriptor_t *td,
void *structure, int tag_mode, ber_tlv_tag_t tag,
asn_app_consume_bytes_f *cb, void *app_key) {
Bool_1_inherit_TYPE_descriptor(td);
return td->der_encoder(td, structure, tag_mode, tag, cb, app_key);
}
asn_dec_rval_t
Bool_decode_xer(asn_codec_ctx_t *opt_codec_ctx, asn_TYPE_descriptor_t *td,
void **structure, const char *opt_mname, const void *bufptr, size_t size) {
Bool_1_inherit_TYPE_descriptor(td);
return td->xer_decoder(opt_codec_ctx, td, structure, opt_mname, bufptr, size);
}
asn_enc_rval_t
Bool_encode_xer(asn_TYPE_descriptor_t *td, void *structure,
int ilevel, enum xer_encoder_flags_e flags,
asn_app_consume_bytes_f *cb, void *app_key) {
Bool_1_inherit_TYPE_descriptor(td);
return td->xer_encoder(td, structure, ilevel, flags, cb, app_key);
}
asn_dec_rval_t
Bool_decode_uper(asn_codec_ctx_t *opt_codec_ctx, asn_TYPE_descriptor_t *td,
asn_per_constraints_t *constraints, void **structure, asn_per_data_t *per_data) {
Bool_1_inherit_TYPE_descriptor(td);
return td->uper_decoder(opt_codec_ctx, td, constraints, structure, per_data);
}
asn_enc_rval_t
Bool_encode_uper(asn_TYPE_descriptor_t *td,
asn_per_constraints_t *constraints,
void *structure, asn_per_outp_t *per_out) {
Bool_1_inherit_TYPE_descriptor(td);
return td->uper_encoder(td, constraints, structure, per_out);
}
static const ber_tlv_tag_t asn_DEF_Bool_tags_1[] = {
(ASN_TAG_CLASS_UNIVERSAL | (1 << 2))
};
asn_TYPE_descriptor_t asn_DEF_Bool = {
"Bool",
"Bool",
Bool_free,
Bool_print,
Bool_constraint,
Bool_decode_ber,
Bool_encode_der,
Bool_decode_xer,
Bool_encode_xer,
Bool_decode_uper,
Bool_encode_uper,
0, /* Use generic outmost tag fetcher */
asn_DEF_Bool_tags_1,
sizeof(asn_DEF_Bool_tags_1)
/sizeof(asn_DEF_Bool_tags_1[0]), /* 1 */
asn_DEF_Bool_tags_1, /* Same as above */
sizeof(asn_DEF_Bool_tags_1)
/sizeof(asn_DEF_Bool_tags_1[0]), /* 1 */
0, /* No PER visible constraints */
0, 0, /* No members */
0 /* No specifics */
};
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化