--- /dev/null
+/*\r
+ * Copyright (c) 2003-2017 Lev Walkin <vlm@lionet.info>. All rights reserved.\r
+ * Redistribution and modifications are permitted subject to BSD license.\r
+ */\r
+#include <asn_internal.h>\r
+#include <constr_CHOICE.h>\r
+#include <per_opentype.h>\r
+\r
+/*\r
+ * Number of bytes left for this structure.\r
+ * (ctx->left) indicates the number of bytes _transferred_ for the structure.\r
+ * (size) contains the number of bytes in the buffer passed.\r
+ */\r
+#define LEFT ((size<(size_t)ctx->left)?size:(size_t)ctx->left)\r
+\r
+/*\r
+ * If the subprocessor function returns with an indication that it wants\r
+ * more data, it may well be a fatal decoding problem, because the\r
+ * size is constrained by the <TLV>'s L, even if the buffer size allows\r
+ * reading more data.\r
+ * For example, consider the buffer containing the following TLVs:\r
+ * <T:5><L:1><V> <T:6>...\r
+ * The TLV length clearly indicates that one byte is expected in V, but\r
+ * if the V processor returns with "want more data" even if the buffer\r
+ * contains way more data than the V processor have seen.\r
+ */\r
+#define SIZE_VIOLATION (ctx->left >= 0 && (size_t)ctx->left <= size)\r
+\r
+/*\r
+ * This macro "eats" the part of the buffer which is definitely "consumed",\r
+ * i.e. was correctly converted into local representation or rightfully skipped.\r
+ */\r
+#undef ADVANCE\r
+#define ADVANCE(num_bytes) do { \\r
+ size_t num = num_bytes; \\r
+ ptr = ((const char *)ptr) + num;\\r
+ size -= num; \\r
+ if(ctx->left >= 0) \\r
+ ctx->left -= num; \\r
+ consumed_myself += num; \\r
+ } while(0)\r
+\r
+/*\r
+ * Switch to the next phase of parsing.\r
+ */\r
+#undef NEXT_PHASE\r
+#define NEXT_PHASE(ctx) do { \\r
+ ctx->phase++; \\r
+ ctx->step = 0; \\r
+ } while(0)\r
+\r
+/*\r
+ * Return a standardized complex structure.\r
+ */\r
+#undef RETURN\r
+#define RETURN(_code) do { \\r
+ rval.code = _code; \\r
+ rval.consumed = consumed_myself;\\r
+ return rval; \\r
+ } while(0)\r
+\r
+/*\r
+ * See the definitions.\r
+ */\r
+static unsigned _fetch_present_idx(const void *struct_ptr, unsigned off,\r
+ unsigned size);\r
+static void _set_present_idx(void *sptr, unsigned offset, unsigned size,\r
+ unsigned pres);\r
+static const void *_get_member_ptr(const asn_TYPE_descriptor_t *,\r
+ const void *sptr, asn_TYPE_member_t **elm,\r
+ unsigned *present);\r
+\r
+/*\r
+ * Tags are canonically sorted in the tag to member table.\r
+ */\r
+static int\r
+_search4tag(const void *ap, const void *bp) {\r
+ const asn_TYPE_tag2member_t *a = (const asn_TYPE_tag2member_t *)ap;\r
+ const asn_TYPE_tag2member_t *b = (const asn_TYPE_tag2member_t *)bp;\r
+\r
+ int a_class = BER_TAG_CLASS(a->el_tag);\r
+ int b_class = BER_TAG_CLASS(b->el_tag);\r
+\r
+ if(a_class == b_class) {\r
+ ber_tlv_tag_t a_value = BER_TAG_VALUE(a->el_tag);\r
+ ber_tlv_tag_t b_value = BER_TAG_VALUE(b->el_tag);\r
+\r
+ if(a_value == b_value)\r
+ return 0;\r
+ else if(a_value < b_value)\r
+ return -1;\r
+ else\r
+ return 1;\r
+ } else if(a_class < b_class) {\r
+ return -1;\r
+ } else {\r
+ return 1;\r
+ }\r
+}\r
+\r
+/*\r
+ * The decoder of the CHOICE type.\r
+ */\r
+asn_dec_rval_t\r
+CHOICE_decode_ber(const asn_codec_ctx_t *opt_codec_ctx,\r
+ const asn_TYPE_descriptor_t *td, void **struct_ptr,\r
+ const void *ptr, size_t size, int tag_mode) {\r
+ /*\r
+ * Bring closer parts of structure description.\r
+ */\r
+ const asn_CHOICE_specifics_t *specs =\r
+ (const asn_CHOICE_specifics_t *)td->specifics;\r
+ asn_TYPE_member_t *elements = td->elements;\r
+\r
+ /*\r
+ * Parts of the structure being constructed.\r
+ */\r
+ void *st = *struct_ptr; /* Target structure. */\r
+ asn_struct_ctx_t *ctx; /* Decoder context */\r
+\r
+ ber_tlv_tag_t tlv_tag; /* T from TLV */\r
+ ssize_t tag_len; /* Length of TLV's T */\r
+ asn_dec_rval_t rval; /* Return code from subparsers */\r
+\r
+ ssize_t consumed_myself = 0; /* Consumed bytes from ptr */\r
+\r
+ ASN_DEBUG("Decoding %s as CHOICE", td->name);\r
+\r
+ /*\r
+ * Create the target structure if it is not present already.\r
+ */\r
+ if(st == 0) {\r
+ st = *struct_ptr = CALLOC(1, specs->struct_size);\r
+ if(st == 0) {\r
+ RETURN(RC_FAIL);\r
+ }\r
+ }\r
+\r
+ /*\r
+ * Restore parsing context.\r
+ */\r
+ ctx = (asn_struct_ctx_t *)((char *)st + specs->ctx_offset);\r
+ \r
+ /*\r
+ * Start to parse where left previously\r
+ */\r
+ switch(ctx->phase) {\r
+ case 0:\r
+ /*\r
+ * PHASE 0.\r
+ * Check that the set of tags associated with given structure\r
+ * perfectly fits our expectations.\r
+ */\r
+\r
+ if(tag_mode || td->tags_count) {\r
+ rval = ber_check_tags(opt_codec_ctx, td, ctx, ptr, size,\r
+ tag_mode, -1, &ctx->left, 0);\r
+ if(rval.code != RC_OK) {\r
+ ASN_DEBUG("%s tagging check failed: %d",\r
+ td->name, rval.code);\r
+ return rval;\r
+ }\r
+\r
+ if(ctx->left >= 0) {\r
+ /* ?Substracted below! */\r
+ ctx->left += rval.consumed;\r
+ }\r
+ ADVANCE(rval.consumed);\r
+ } else {\r
+ ctx->left = -1;\r
+ }\r
+\r
+ NEXT_PHASE(ctx);\r
+\r
+ ASN_DEBUG("Structure consumes %ld bytes, buffer %ld",\r
+ (long)ctx->left, (long)size);\r
+\r
+ /* Fall through */\r
+ case 1:\r
+ /*\r
+ * Fetch the T from TLV.\r
+ */\r
+ tag_len = ber_fetch_tag(ptr, LEFT, &tlv_tag);\r
+ ASN_DEBUG("In %s CHOICE tag length %d", td->name, (int)tag_len);\r
+ switch(tag_len) {\r
+ case 0: if(!SIZE_VIOLATION) RETURN(RC_WMORE);\r
+ /* Fall through */\r
+ case -1: RETURN(RC_FAIL);\r
+ }\r
+\r
+ do {\r
+ const asn_TYPE_tag2member_t *t2m;\r
+ asn_TYPE_tag2member_t key;\r
+\r
+ key.el_tag = tlv_tag;\r
+ t2m = (const asn_TYPE_tag2member_t *)bsearch(&key,\r
+ specs->tag2el, specs->tag2el_count,\r
+ sizeof(specs->tag2el[0]), _search4tag);\r
+ if(t2m) {\r
+ /*\r
+ * Found the element corresponding to the tag.\r
+ */\r
+ NEXT_PHASE(ctx);\r
+ ctx->step = t2m->el_no;\r
+ break;\r
+ } else if(specs->ext_start == -1) {\r
+ ASN_DEBUG("Unexpected tag %s "\r
+ "in non-extensible CHOICE %s",\r
+ ber_tlv_tag_string(tlv_tag), td->name);\r
+ RETURN(RC_FAIL);\r
+ } else {\r
+ /* Skip this tag */\r
+ ssize_t skip;\r
+\r
+ ASN_DEBUG("Skipping unknown tag %s",\r
+ ber_tlv_tag_string(tlv_tag));\r
+\r
+ skip = ber_skip_length(opt_codec_ctx,\r
+ BER_TLV_CONSTRUCTED(ptr),\r
+ (const char *)ptr + tag_len,\r
+ LEFT - tag_len);\r
+\r
+ switch(skip) {\r
+ case 0: if(!SIZE_VIOLATION) RETURN(RC_WMORE);\r
+ /* Fall through */\r
+ case -1: RETURN(RC_FAIL);\r
+ }\r
+\r
+ ADVANCE(skip + tag_len);\r
+ RETURN(RC_OK);\r
+ }\r
+ } while(0);\r
+\r
+ case 2:\r
+ /*\r
+ * PHASE 2.\r
+ * Read in the element.\r
+ */\r
+ do {\r
+ asn_TYPE_member_t *elm;/* CHOICE's element */\r
+ void *memb_ptr; /* Pointer to the member */\r
+ void **memb_ptr2; /* Pointer to that pointer */\r
+\r
+ elm = &elements[ctx->step];\r
+\r
+ /*\r
+ * Compute the position of the member inside a structure,\r
+ * and also a type of containment (it may be contained\r
+ * as pointer or using inline inclusion).\r
+ */\r
+ if(elm->flags & ATF_POINTER) {\r
+ /* Member is a pointer to another structure */\r
+ memb_ptr2 = (void **)((char *)st + elm->memb_offset);\r
+ } else {\r
+ /*\r
+ * A pointer to a pointer\r
+ * holding the start of the structure\r
+ */\r
+ memb_ptr = (char *)st + elm->memb_offset;\r
+ memb_ptr2 = &memb_ptr;\r
+ }\r
+ /* Set presence to be able to free it properly at any time */\r
+ _set_present_idx(st, specs->pres_offset,\r
+ specs->pres_size, ctx->step + 1);\r
+ /*\r
+ * Invoke the member fetch routine according to member's type\r
+ */\r
+ rval = elm->type->op->ber_decoder(opt_codec_ctx, elm->type,\r
+ memb_ptr2, ptr, LEFT, elm->tag_mode);\r
+ switch(rval.code) {\r
+ case RC_OK:\r
+ break;\r
+ case RC_WMORE: /* More data expected */\r
+ if(!SIZE_VIOLATION) {\r
+ ADVANCE(rval.consumed);\r
+ RETURN(RC_WMORE);\r
+ }\r
+ RETURN(RC_FAIL);\r
+ case RC_FAIL: /* Fatal error */\r
+ RETURN(rval.code);\r
+ } /* switch(rval) */\r
+ \r
+ ADVANCE(rval.consumed);\r
+ } while(0);\r
+\r
+ NEXT_PHASE(ctx);\r
+\r
+ /* Fall through */\r
+ case 3:\r
+ ASN_DEBUG("CHOICE %s Leftover: %ld, size = %ld, tm=%d, tc=%d",\r
+ td->name, (long)ctx->left, (long)size,\r
+ tag_mode, td->tags_count);\r
+\r
+ if(ctx->left > 0) {\r
+ /*\r
+ * The type must be fully decoded\r
+ * by the CHOICE member-specific decoder.\r
+ */\r
+ RETURN(RC_FAIL);\r
+ }\r
+\r
+ if(ctx->left == -1\r
+ && !(tag_mode || td->tags_count)) {\r
+ /*\r
+ * This is an untagged CHOICE.\r
+ * It doesn't contain nothing\r
+ * except for the member itself, including all its tags.\r
+ * The decoding is completed.\r
+ */\r
+ NEXT_PHASE(ctx);\r
+ break;\r
+ }\r
+\r
+ /*\r
+ * Read in the "end of data chunks"'s.\r
+ */\r
+ while(ctx->left < 0) {\r
+ ssize_t tl;\r
+\r
+ tl = ber_fetch_tag(ptr, LEFT, &tlv_tag);\r
+ switch(tl) {\r
+ case 0: if(!SIZE_VIOLATION) RETURN(RC_WMORE);\r
+ /* Fall through */\r
+ case -1: RETURN(RC_FAIL);\r
+ }\r
+\r
+ /*\r
+ * Expected <0><0>...\r
+ */\r
+ if(((const uint8_t *)ptr)[0] == 0) {\r
+ if(LEFT < 2) {\r
+ if(SIZE_VIOLATION)\r
+ RETURN(RC_FAIL);\r
+ else\r
+ RETURN(RC_WMORE);\r
+ } else if(((const uint8_t *)ptr)[1] == 0) {\r
+ /*\r
+ * Correctly finished with <0><0>.\r
+ */\r
+ ADVANCE(2);\r
+ ctx->left++;\r
+ continue;\r
+ }\r
+ } else {\r
+ ASN_DEBUG("Unexpected continuation in %s",\r
+ td->name);\r
+ RETURN(RC_FAIL);\r
+ }\r
+\r
+ /* UNREACHABLE */\r
+ }\r
+\r
+ NEXT_PHASE(ctx);\r
+ case 4:\r
+ /* No meaningful work here */\r
+ break;\r
+ }\r
+ \r
+ RETURN(RC_OK);\r
+}\r
+\r
+asn_enc_rval_t\r
+CHOICE_encode_der(const asn_TYPE_descriptor_t *td, const void *sptr,\r
+ int tag_mode, ber_tlv_tag_t tag, asn_app_consume_bytes_f *cb,\r
+ void *app_key) {\r
+ const asn_CHOICE_specifics_t *specs = (const asn_CHOICE_specifics_t *)td->specifics;\r
+ asn_TYPE_member_t *elm; /* CHOICE element */\r
+ asn_enc_rval_t erval = {0,0,0};\r
+ const void *memb_ptr;\r
+ size_t computed_size = 0;\r
+ unsigned present;\r
+\r
+ if(!sptr) ASN__ENCODE_FAILED;\r
+\r
+ ASN_DEBUG("%s %s as CHOICE",\r
+ cb?"Encoding":"Estimating", td->name);\r
+\r
+ present = _fetch_present_idx(sptr,\r
+ specs->pres_offset, specs->pres_size);\r
+\r
+ /*\r
+ * If the structure was not initialized, it cannot be encoded:\r
+ * can't deduce what to encode in the choice type.\r
+ */\r
+ if(present == 0 || present > td->elements_count) {\r
+ if(present == 0 && td->elements_count == 0) {\r
+ /* The CHOICE is empty?! */\r
+ erval.encoded = 0;\r
+ ASN__ENCODED_OK(erval);\r
+ }\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+\r
+ /*\r
+ * Seek over the present member of the structure.\r
+ */\r
+ elm = &td->elements[present-1];\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr =\r
+ *(const void *const *)((const char *)sptr + elm->memb_offset);\r
+ if(memb_ptr == 0) {\r
+ if(elm->optional) {\r
+ erval.encoded = 0;\r
+ ASN__ENCODED_OK(erval);\r
+ }\r
+ /* Mandatory element absent */\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+ } else {\r
+ memb_ptr = (const void *)((const char *)sptr + elm->memb_offset);\r
+ }\r
+\r
+ /*\r
+ * If the CHOICE itself is tagged EXPLICIT:\r
+ * T ::= [2] EXPLICIT CHOICE { ... }\r
+ * Then emit the appropriate tags.\r
+ */\r
+ if(tag_mode == 1 || td->tags_count) {\r
+ /*\r
+ * For this, we need to pre-compute the member.\r
+ */\r
+ ssize_t ret;\r
+\r
+ /* Encode member with its tag */\r
+ erval = elm->type->op->der_encoder(elm->type, memb_ptr,\r
+ elm->tag_mode, elm->tag, 0, 0);\r
+ if(erval.encoded == -1)\r
+ return erval;\r
+\r
+ /* Encode CHOICE with parent or my own tag */\r
+ ret = der_write_tags(td, erval.encoded, tag_mode, 1, tag,\r
+ cb, app_key);\r
+ if(ret == -1)\r
+ ASN__ENCODE_FAILED;\r
+ computed_size += ret;\r
+ }\r
+\r
+ /*\r
+ * Encode the single underlying member.\r
+ */\r
+ erval = elm->type->op->der_encoder(elm->type, memb_ptr,\r
+ elm->tag_mode, elm->tag, cb, app_key);\r
+ if(erval.encoded == -1)\r
+ return erval;\r
+\r
+ ASN_DEBUG("Encoded CHOICE member in %ld bytes (+%ld)",\r
+ (long)erval.encoded, (long)computed_size);\r
+\r
+ erval.encoded += computed_size;\r
+\r
+ return erval;\r
+}\r
+\r
+ber_tlv_tag_t\r
+CHOICE_outmost_tag(const asn_TYPE_descriptor_t *td, const void *ptr, int tag_mode, ber_tlv_tag_t tag) {\r
+ const asn_CHOICE_specifics_t *specs = (const asn_CHOICE_specifics_t *)td->specifics;\r
+ unsigned present;\r
+\r
+ assert(tag_mode == 0); (void)tag_mode;\r
+ assert(tag == 0); (void)tag;\r
+\r
+ /*\r
+ * Figure out which CHOICE element is encoded.\r
+ */\r
+ present = _fetch_present_idx(ptr, specs->pres_offset, specs->pres_size);\r
+\r
+ if(present > 0 && present <= td->elements_count) {\r
+ const asn_TYPE_member_t *elm = &td->elements[present-1];\r
+ const void *memb_ptr;\r
+\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr = *(const void * const *)\r
+ ((const char *)ptr + elm->memb_offset);\r
+ } else {\r
+ memb_ptr = (const void *)\r
+ ((const char *)ptr + elm->memb_offset);\r
+ }\r
+\r
+ return asn_TYPE_outmost_tag(elm->type, memb_ptr,\r
+ elm->tag_mode, elm->tag);\r
+ } else {\r
+ return (ber_tlv_tag_t)-1;\r
+ }\r
+}\r
+\r
+int\r
+CHOICE_constraint(const asn_TYPE_descriptor_t *td, const void *sptr,\r
+ asn_app_constraint_failed_f *ctfailcb, void *app_key) {\r
+ const asn_CHOICE_specifics_t *specs =\r
+ (const asn_CHOICE_specifics_t *)td->specifics;\r
+ unsigned present;\r
+\r
+ if(!sptr) {\r
+ ASN__CTFAIL(app_key, td, sptr,\r
+ "%s: value not given (%s:%d)",\r
+ td->name, __FILE__, __LINE__);\r
+ return -1;\r
+ }\r
+\r
+ /*\r
+ * Figure out which CHOICE element is encoded.\r
+ */\r
+ present = _fetch_present_idx(sptr, specs->pres_offset,specs->pres_size);\r
+ if(present > 0 && present <= td->elements_count) {\r
+ asn_TYPE_member_t *elm = &td->elements[present-1];\r
+ const void *memb_ptr;\r
+\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr = *(const void * const *)((const char *)sptr + elm->memb_offset);\r
+ if(!memb_ptr) {\r
+ if(elm->optional)\r
+ return 0;\r
+ ASN__CTFAIL(app_key, td, sptr,\r
+ "%s: mandatory CHOICE element %s absent (%s:%d)",\r
+ td->name, elm->name, __FILE__, __LINE__);\r
+ return -1;\r
+ }\r
+ } else {\r
+ memb_ptr = (const void *)((const char *)sptr + elm->memb_offset);\r
+ }\r
+\r
+ if(elm->encoding_constraints.general_constraints) {\r
+ return elm->encoding_constraints.general_constraints(elm->type, memb_ptr,\r
+ ctfailcb, app_key);\r
+ } else {\r
+ return elm->type->encoding_constraints.general_constraints(elm->type,\r
+ memb_ptr, ctfailcb, app_key);\r
+ }\r
+ } else {\r
+ ASN__CTFAIL(app_key, td, sptr,\r
+ "%s: no CHOICE element given (%s:%d)",\r
+ td->name, __FILE__, __LINE__);\r
+ return -1;\r
+ }\r
+}\r
+\r
+#undef XER_ADVANCE\r
+#define XER_ADVANCE(num_bytes) do { \\r
+ size_t num = num_bytes; \\r
+ buf_ptr = (const void *)(((const char *)buf_ptr) + num); \\r
+ size -= num; \\r
+ consumed_myself += num; \\r
+ } while(0)\r
+\r
+/*\r
+ * Decode the XER (XML) data.\r
+ */\r
+asn_dec_rval_t\r
+CHOICE_decode_xer(const asn_codec_ctx_t *opt_codec_ctx,\r
+ const asn_TYPE_descriptor_t *td, void **struct_ptr,\r
+ const char *opt_mname, const void *buf_ptr, size_t size) {\r
+ /*\r
+ * Bring closer parts of structure description.\r
+ */\r
+ const asn_CHOICE_specifics_t *specs = (const asn_CHOICE_specifics_t *)td->specifics;\r
+ const char *xml_tag = opt_mname ? opt_mname : td->xml_tag;\r
+\r
+ /*\r
+ * Parts of the structure being constructed.\r
+ */\r
+ void *st = *struct_ptr; /* Target structure. */\r
+ asn_struct_ctx_t *ctx; /* Decoder context */\r
+\r
+ asn_dec_rval_t rval; /* Return value of a decoder */\r
+ ssize_t consumed_myself = 0; /* Consumed bytes from ptr */\r
+ size_t edx; /* Element index */\r
+\r
+ /*\r
+ * Create the target structure if it is not present already.\r
+ */\r
+ if(st == 0) {\r
+ st = *struct_ptr = CALLOC(1, specs->struct_size);\r
+ if(st == 0) RETURN(RC_FAIL);\r
+ }\r
+\r
+ /*\r
+ * Restore parsing context.\r
+ */\r
+ ctx = (asn_struct_ctx_t *)((char *)st + specs->ctx_offset);\r
+ if(ctx->phase == 0 && !*xml_tag)\r
+ ctx->phase = 1; /* Skip the outer tag checking phase */\r
+\r
+ /*\r
+ * Phases of XER/XML processing:\r
+ * Phase 0: Check that the opening tag matches our expectations.\r
+ * Phase 1: Processing body and reacting on closing tag.\r
+ * Phase 2: Processing inner type.\r
+ * Phase 3: Only waiting for closing tag.\r
+ * Phase 4: Skipping unknown extensions.\r
+ * Phase 5: PHASED OUT\r
+ */\r
+ for(edx = ctx->step; ctx->phase <= 4;) {\r
+ pxer_chunk_type_e ch_type; /* XER chunk type */\r
+ ssize_t ch_size; /* Chunk size */\r
+ xer_check_tag_e tcv; /* Tag check value */\r
+ asn_TYPE_member_t *elm;\r
+\r
+ /*\r
+ * Go inside the member.\r
+ */\r
+ if(ctx->phase == 2) {\r
+ asn_dec_rval_t tmprval;\r
+ void *memb_ptr; /* Pointer to the member */\r
+ void **memb_ptr2; /* Pointer to that pointer */\r
+ unsigned old_present;\r
+\r
+ elm = &td->elements[edx];\r
+\r
+ if(elm->flags & ATF_POINTER) {\r
+ /* Member is a pointer to another structure */\r
+ memb_ptr2 = (void **)((char *)st\r
+ + elm->memb_offset);\r
+ } else {\r
+ memb_ptr = (char *)st + elm->memb_offset;\r
+ memb_ptr2 = &memb_ptr;\r
+ }\r
+\r
+ /* Start/Continue decoding the inner member */\r
+ tmprval = elm->type->op->xer_decoder(opt_codec_ctx,\r
+ elm->type, memb_ptr2, elm->name,\r
+ buf_ptr, size);\r
+ XER_ADVANCE(tmprval.consumed);\r
+ ASN_DEBUG("XER/CHOICE: itdf: [%s] code=%d",\r
+ elm->type->name, tmprval.code);\r
+ old_present = _fetch_present_idx(st,\r
+ specs->pres_offset, specs->pres_size);\r
+ assert(old_present == 0 || old_present == edx + 1);\r
+ /* Record what we've got */\r
+ _set_present_idx(st,\r
+ specs->pres_offset, specs->pres_size, edx + 1);\r
+ if(tmprval.code != RC_OK)\r
+ RETURN(tmprval.code);\r
+ ctx->phase = 3;\r
+ /* Fall through */\r
+ }\r
+\r
+ /* No need to wait for closing tag; special mode. */\r
+ if(ctx->phase == 3 && !*xml_tag) {\r
+ ctx->phase = 5; /* Phase out */\r
+ RETURN(RC_OK);\r
+ }\r
+\r
+ /*\r
+ * Get the next part of the XML stream.\r
+ */\r
+ ch_size = xer_next_token(&ctx->context, buf_ptr, size, &ch_type);\r
+ if(ch_size == -1) {\r
+ RETURN(RC_FAIL);\r
+ } else {\r
+ switch(ch_type) {\r
+ case PXER_WMORE:\r
+ RETURN(RC_WMORE);\r
+ case PXER_COMMENT: /* Got XML comment */\r
+ case PXER_TEXT: /* Ignore free-standing text */\r
+ XER_ADVANCE(ch_size); /* Skip silently */\r
+ continue;\r
+ case PXER_TAG:\r
+ break; /* Check the rest down there */\r
+ }\r
+ }\r
+\r
+ tcv = xer_check_tag(buf_ptr, ch_size, xml_tag);\r
+ ASN_DEBUG("XER/CHOICE checked [%c%c%c%c] vs [%s], tcv=%d",\r
+ ch_size>0?((const uint8_t *)buf_ptr)[0]:'?',\r
+ ch_size>1?((const uint8_t *)buf_ptr)[1]:'?',\r
+ ch_size>2?((const uint8_t *)buf_ptr)[2]:'?',\r
+ ch_size>3?((const uint8_t *)buf_ptr)[3]:'?',\r
+ xml_tag, tcv);\r
+\r
+ /* Skip the extensions section */\r
+ if(ctx->phase == 4) {\r
+ ASN_DEBUG("skip_unknown(%d, %ld)",\r
+ tcv, (long)ctx->left);\r
+ switch(xer_skip_unknown(tcv, &ctx->left)) {\r
+ case -1:\r
+ ctx->phase = 5;\r
+ RETURN(RC_FAIL);\r
+ case 1:\r
+ ctx->phase = 3;\r
+ /* Fall through */\r
+ case 0:\r
+ XER_ADVANCE(ch_size);\r
+ continue;\r
+ case 2:\r
+ ctx->phase = 3;\r
+ break;\r
+ }\r
+ }\r
+\r
+ switch(tcv) {\r
+ case XCT_BOTH:\r
+ break; /* No CHOICE? */\r
+ case XCT_CLOSING:\r
+ if(ctx->phase != 3)\r
+ break;\r
+ XER_ADVANCE(ch_size);\r
+ ctx->phase = 5; /* Phase out */\r
+ RETURN(RC_OK);\r
+ case XCT_OPENING:\r
+ if(ctx->phase == 0) {\r
+ XER_ADVANCE(ch_size);\r
+ ctx->phase = 1; /* Processing body phase */\r
+ continue;\r
+ }\r
+ /* Fall through */\r
+ case XCT_UNKNOWN_OP:\r
+ case XCT_UNKNOWN_BO:\r
+\r
+ if(ctx->phase != 1)\r
+ break; /* Really unexpected */\r
+\r
+ /*\r
+ * Search which inner member corresponds to this tag.\r
+ */\r
+ for(edx = 0; edx < td->elements_count; edx++) {\r
+ elm = &td->elements[edx];\r
+ tcv = xer_check_tag(buf_ptr,ch_size,elm->name);\r
+ switch(tcv) {\r
+ case XCT_BOTH:\r
+ case XCT_OPENING:\r
+ /*\r
+ * Process this member.\r
+ */\r
+ ctx->step = edx;\r
+ ctx->phase = 2;\r
+ break;\r
+ case XCT_UNKNOWN_OP:\r
+ case XCT_UNKNOWN_BO:\r
+ continue;\r
+ default:\r
+ edx = td->elements_count;\r
+ break; /* Phase out */\r
+ }\r
+ break;\r
+ }\r
+ if(edx != td->elements_count)\r
+ continue;\r
+\r
+ /* It is expected extension */\r
+ if(specs->ext_start != -1) {\r
+ ASN_DEBUG("Got anticipated extension");\r
+ /*\r
+ * Check for (XCT_BOTH or XCT_UNKNOWN_BO)\r
+ * By using a mask. Only record a pure\r
+ * <opening> tags.\r
+ */\r
+ if(tcv & XCT_CLOSING) {\r
+ /* Found </extension> without body */\r
+ ctx->phase = 3; /* Terminating */\r
+ } else {\r
+ ctx->left = 1;\r
+ ctx->phase = 4; /* Skip ...'s */\r
+ }\r
+ XER_ADVANCE(ch_size);\r
+ continue;\r
+ }\r
+\r
+ /* Fall through */\r
+ default:\r
+ break;\r
+ }\r
+\r
+ ASN_DEBUG("Unexpected XML tag [%c%c%c%c] in CHOICE [%s]"\r
+ " (ph=%d, tag=%s)",\r
+ ch_size>0?((const uint8_t *)buf_ptr)[0]:'?',\r
+ ch_size>1?((const uint8_t *)buf_ptr)[1]:'?',\r
+ ch_size>2?((const uint8_t *)buf_ptr)[2]:'?',\r
+ ch_size>3?((const uint8_t *)buf_ptr)[3]:'?',\r
+ td->name, ctx->phase, xml_tag);\r
+ break;\r
+ }\r
+\r
+ ctx->phase = 5; /* Phase out, just in case */\r
+ RETURN(RC_FAIL);\r
+}\r
+\r
+\r
+asn_enc_rval_t\r
+CHOICE_encode_xer(const asn_TYPE_descriptor_t *td, const void *sptr, int ilevel,\r
+ enum xer_encoder_flags_e flags, asn_app_consume_bytes_f *cb,\r
+ void *app_key) {\r
+ const asn_CHOICE_specifics_t *specs =\r
+ (const asn_CHOICE_specifics_t *)td->specifics;\r
+ asn_enc_rval_t er = {0,0,0};\r
+ unsigned present = 0;\r
+\r
+ if(!sptr)\r
+ ASN__ENCODE_FAILED;\r
+\r
+ /*\r
+ * Figure out which CHOICE element is encoded.\r
+ */\r
+ present = _fetch_present_idx(sptr, specs->pres_offset,specs->pres_size);\r
+\r
+ if(present == 0 || present > td->elements_count) {\r
+ ASN__ENCODE_FAILED;\r
+ } else {\r
+ asn_enc_rval_t tmper = {0,0,0};\r
+ asn_TYPE_member_t *elm = &td->elements[present-1];\r
+ const void *memb_ptr = NULL;\r
+ const char *mname = elm->name;\r
+ unsigned int mlen = strlen(mname);\r
+\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr =\r
+ *(const void *const *)((const char *)sptr + elm->memb_offset);\r
+ if(!memb_ptr) ASN__ENCODE_FAILED;\r
+ } else {\r
+ memb_ptr = (const void *)((const char *)sptr + elm->memb_offset);\r
+ }\r
+\r
+ er.encoded = 0;\r
+\r
+ if(!(flags & XER_F_CANONICAL)) ASN__TEXT_INDENT(1, ilevel);\r
+ ASN__CALLBACK3("<", 1, mname, mlen, ">", 1);\r
+\r
+ tmper = elm->type->op->xer_encoder(elm->type, memb_ptr,\r
+ ilevel + 1, flags, cb, app_key);\r
+ if(tmper.encoded == -1) return tmper;\r
+ er.encoded += tmper.encoded;\r
+\r
+ ASN__CALLBACK3("</", 2, mname, mlen, ">", 1);\r
+ }\r
+\r
+ if(!(flags & XER_F_CANONICAL)) ASN__TEXT_INDENT(1, ilevel - 1);\r
+\r
+ ASN__ENCODED_OK(er);\r
+cb_failed:\r
+ ASN__ENCODE_FAILED;\r
+}\r
+\r
+asn_dec_rval_t\r
+CHOICE_decode_uper(const asn_codec_ctx_t *opt_codec_ctx,\r
+ const asn_TYPE_descriptor_t *td,\r
+ const asn_per_constraints_t *constraints, void **sptr,\r
+ asn_per_data_t *pd) {\r
+ const asn_CHOICE_specifics_t *specs =\r
+ (const asn_CHOICE_specifics_t *)td->specifics;\r
+ asn_dec_rval_t rv;\r
+ const asn_per_constraint_t *ct;\r
+ asn_TYPE_member_t *elm; /* CHOICE's element */\r
+ void *memb_ptr;\r
+ void **memb_ptr2;\r
+ void *st = *sptr;\r
+ int value;\r
+\r
+ if(ASN__STACK_OVERFLOW_CHECK(opt_codec_ctx))\r
+ ASN__DECODE_FAILED;\r
+\r
+ /*\r
+ * Create the target structure if it is not present already.\r
+ */\r
+ if(!st) {\r
+ st = *sptr = CALLOC(1, specs->struct_size);\r
+ if(!st) ASN__DECODE_FAILED;\r
+ }\r
+\r
+ if(constraints) ct = &constraints->value;\r
+ else if(td->encoding_constraints.per_constraints) ct = &td->encoding_constraints.per_constraints->value;\r
+ else ct = 0;\r
+\r
+ if(ct && ct->flags & APC_EXTENSIBLE) {\r
+ value = per_get_few_bits(pd, 1);\r
+ if(value < 0) ASN__DECODE_STARVED;\r
+ if(value) ct = 0; /* Not restricted */\r
+ }\r
+\r
+ if(ct && ct->range_bits >= 0) {\r
+ value = per_get_few_bits(pd, ct->range_bits);\r
+ if(value < 0) ASN__DECODE_STARVED;\r
+ ASN_DEBUG("CHOICE %s got index %d in range %d",\r
+ td->name, value, ct->range_bits);\r
+ if(value > ct->upper_bound)\r
+ ASN__DECODE_FAILED;\r
+ } else {\r
+ if(specs->ext_start == -1)\r
+ ASN__DECODE_FAILED;\r
+ value = uper_get_nsnnwn(pd);\r
+ if(value < 0) ASN__DECODE_STARVED;\r
+ value += specs->ext_start;\r
+ if((unsigned)value >= td->elements_count)\r
+ ASN__DECODE_FAILED;\r
+ }\r
+\r
+ /* Adjust if canonical order is different from natural order */\r
+ if(specs->from_canonical_order) {\r
+ ASN_DEBUG("CHOICE presence from wire %d", value);\r
+ value = specs->from_canonical_order[value];\r
+ ASN_DEBUG("CHOICE presence index effective %d", value);\r
+ }\r
+\r
+ /* Set presence to be able to free it later */\r
+ _set_present_idx(st, specs->pres_offset, specs->pres_size, value + 1);\r
+\r
+ elm = &td->elements[value];\r
+ if(elm->flags & ATF_POINTER) {\r
+ /* Member is a pointer to another structure */\r
+ memb_ptr2 = (void **)((char *)st + elm->memb_offset);\r
+ } else {\r
+ memb_ptr = (char *)st + elm->memb_offset;\r
+ memb_ptr2 = &memb_ptr;\r
+ }\r
+ ASN_DEBUG("Discovered CHOICE %s encodes %s", td->name, elm->name);\r
+\r
+ if(ct && ct->range_bits >= 0) {\r
+ rv = elm->type->op->uper_decoder(opt_codec_ctx, elm->type,\r
+ elm->encoding_constraints.per_constraints, memb_ptr2, pd);\r
+ } else {\r
+ rv = uper_open_type_get(opt_codec_ctx, elm->type,\r
+ elm->encoding_constraints.per_constraints, memb_ptr2, pd);\r
+ }\r
+\r
+ if(rv.code != RC_OK)\r
+ ASN_DEBUG("Failed to decode %s in %s (CHOICE) %d",\r
+ elm->name, td->name, rv.code);\r
+ return rv;\r
+}\r
+\r
+asn_enc_rval_t\r
+CHOICE_encode_uper(const asn_TYPE_descriptor_t *td,\r
+ const asn_per_constraints_t *constraints, const void *sptr,\r
+ asn_per_outp_t *po) {\r
+ const asn_CHOICE_specifics_t *specs = (const asn_CHOICE_specifics_t *)td->specifics;\r
+ asn_TYPE_member_t *elm; /* CHOICE's element */\r
+ const asn_per_constraint_t *ct;\r
+ const void *memb_ptr;\r
+ unsigned present;\r
+ int present_enc;\r
+\r
+ if(!sptr) ASN__ENCODE_FAILED;\r
+\r
+ ASN_DEBUG("Encoding %s as CHOICE", td->name);\r
+\r
+ if(constraints) ct = &constraints->value;\r
+ else if(td->encoding_constraints.per_constraints)\r
+ ct = &td->encoding_constraints.per_constraints->value;\r
+ else ct = 0;\r
+\r
+ present = _fetch_present_idx(sptr, specs->pres_offset, specs->pres_size);\r
+\r
+ /*\r
+ * If the structure was not initialized properly, it cannot be encoded:\r
+ * can't deduce what to encode in the choice type.\r
+ */\r
+ if(present == 0 || present > td->elements_count)\r
+ ASN__ENCODE_FAILED;\r
+ else\r
+ present--;\r
+\r
+ ASN_DEBUG("Encoding %s CHOICE element %d", td->name, present);\r
+\r
+ /* Adjust if canonical order is different from natural order */\r
+ if(specs->to_canonical_order)\r
+ present_enc = specs->to_canonical_order[present];\r
+ else\r
+ present_enc = present;\r
+\r
+ if(ct && ct->range_bits >= 0) {\r
+ if(present_enc < ct->lower_bound\r
+ || present_enc > ct->upper_bound) {\r
+ if(ct->flags & APC_EXTENSIBLE) {\r
+ ASN_DEBUG(\r
+ "CHOICE member %d (enc %d) is an extension (%ld..%ld)",\r
+ present, present_enc, ct->lower_bound, ct->upper_bound);\r
+ if(per_put_few_bits(po, 1, 1))\r
+ ASN__ENCODE_FAILED;\r
+ } else {\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+ ct = 0;\r
+ }\r
+ }\r
+ if(ct && ct->flags & APC_EXTENSIBLE) {\r
+ ASN_DEBUG("CHOICE member %d (enc %d) is not an extension (%ld..%ld)",\r
+ present, present_enc, ct->lower_bound, ct->upper_bound);\r
+ if(per_put_few_bits(po, 0, 1))\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+\r
+\r
+ elm = &td->elements[present];\r
+ ASN_DEBUG("CHOICE member \"%s\" %d (as %d)", elm->name, present,\r
+ present_enc);\r
+ if(elm->flags & ATF_POINTER) {\r
+ /* Member is a pointer to another structure */\r
+ memb_ptr =\r
+ *(const void *const *)((const char *)sptr + elm->memb_offset);\r
+ if(!memb_ptr) ASN__ENCODE_FAILED;\r
+ } else {\r
+ memb_ptr = (const char *)sptr + elm->memb_offset;\r
+ }\r
+\r
+ if(ct && ct->range_bits >= 0) {\r
+ if(per_put_few_bits(po, present_enc, ct->range_bits))\r
+ ASN__ENCODE_FAILED;\r
+\r
+ return elm->type->op->uper_encoder(\r
+ elm->type, elm->encoding_constraints.per_constraints, memb_ptr, po);\r
+ } else {\r
+ asn_enc_rval_t rval = {0,0,0};\r
+ if(specs->ext_start == -1) ASN__ENCODE_FAILED;\r
+ if(uper_put_nsnnwn(po, present_enc - specs->ext_start))\r
+ ASN__ENCODE_FAILED;\r
+ if(uper_open_type_put(elm->type,\r
+ elm->encoding_constraints.per_constraints,\r
+ memb_ptr, po))\r
+ ASN__ENCODE_FAILED;\r
+ rval.encoded = 0;\r
+ ASN__ENCODED_OK(rval);\r
+ }\r
+}\r
+\r
+asn_dec_rval_t\r
+CHOICE_decode_aper(const asn_codec_ctx_t *opt_codec_ctx,\r
+ const asn_TYPE_descriptor_t *td,\r
+ const asn_per_constraints_t *constraints, void **sptr, asn_per_data_t *pd) {\r
+ const asn_CHOICE_specifics_t *specs = (const asn_CHOICE_specifics_t *)td->specifics;\r
+ asn_dec_rval_t rv;\r
+ const asn_per_constraint_t *ct;\r
+ asn_TYPE_member_t *elm; /* CHOICE's element */\r
+ void *memb_ptr;\r
+ void **memb_ptr2;\r
+ void *st = *sptr;\r
+ int value;\r
+\r
+ if(ASN__STACK_OVERFLOW_CHECK(opt_codec_ctx))\r
+ ASN__DECODE_FAILED;\r
+\r
+ /*\r
+ * Create the target structure if it is not present already.\r
+ */\r
+ if(!st) {\r
+ st = *sptr = CALLOC(1, specs->struct_size);\r
+ if(!st) ASN__DECODE_FAILED;\r
+ }\r
+\r
+ if(constraints) ct = &constraints->value;\r
+ else if(td->encoding_constraints.per_constraints)\r
+ ct = &td->encoding_constraints.per_constraints->value;\r
+ else ct = 0;\r
+\r
+ if(ct && ct->flags & APC_EXTENSIBLE) {\r
+ value = per_get_few_bits(pd, 1);\r
+ if(value < 0) ASN__DECODE_STARVED;\r
+ if(value) ct = 0; /* Not restricted */\r
+ }\r
+\r
+ if(ct && ct->range_bits >= 0) {\r
+ value = per_get_few_bits(pd, ct->range_bits);\r
+ if(value < 0) ASN__DECODE_STARVED;\r
+ ASN_DEBUG("CHOICE %s got index %d in range %d",\r
+ td->name, value, ct->range_bits);\r
+ if(value > ct->upper_bound)\r
+ ASN__DECODE_FAILED;\r
+ } else {\r
+ if(specs->ext_start == -1)\r
+ ASN__DECODE_FAILED;\r
+ value = uper_get_nsnnwn(pd);\r
+ if(value < 0) ASN__DECODE_STARVED;\r
+ value += specs->ext_start;\r
+ if((unsigned)value >= td->elements_count)\r
+ ASN__DECODE_FAILED;\r
+ }\r
+\r
+ /* Adjust if canonical order is different from natural order */\r
+ if(specs->from_canonical_order)\r
+ value = specs->from_canonical_order[value];\r
+\r
+ /* Set presence to be able to free it later */\r
+ _set_present_idx(st, specs->pres_offset, specs->pres_size, value + 1);\r
+\r
+ elm = &td->elements[value];\r
+ if(elm->flags & ATF_POINTER) {\r
+ /* Member is a pointer to another structure */\r
+ memb_ptr2 = (void **)((char *)st + elm->memb_offset);\r
+ } else {\r
+ memb_ptr = (char *)st + elm->memb_offset;\r
+ memb_ptr2 = &memb_ptr;\r
+ }\r
+ ASN_DEBUG("Discovered CHOICE %s encodes %s", td->name, elm->name);\r
+\r
+ if(ct && ct->range_bits >= 0) {\r
+ rv = elm->type->op->aper_decoder(opt_codec_ctx, elm->type,\r
+ elm->encoding_constraints.per_constraints, memb_ptr2, pd);\r
+ } else {\r
+ rv = uper_open_type_get(opt_codec_ctx, elm->type,\r
+ elm->encoding_constraints.per_constraints, memb_ptr2, pd);\r
+ }\r
+\r
+ if(rv.code != RC_OK)\r
+ ASN_DEBUG("Failed to decode %s in %s (CHOICE) %d",\r
+ elm->name, td->name, rv.code);\r
+ return rv;\r
+}\r
+\r
+asn_enc_rval_t\r
+CHOICE_encode_aper(const asn_TYPE_descriptor_t *td,\r
+ const asn_per_constraints_t *constraints,\r
+ const void *sptr, asn_per_outp_t *po) {\r
+ const asn_CHOICE_specifics_t *specs = (const asn_CHOICE_specifics_t *)td->specifics;\r
+ const asn_TYPE_member_t *elm; /* CHOICE's element */\r
+ const asn_per_constraint_t *ct;\r
+ const void *memb_ptr;\r
+ int present;\r
+\r
+ if(!sptr) ASN__ENCODE_FAILED;\r
+\r
+ ASN_DEBUG("Encoding %s as CHOICE using ALIGNED PER", td->name);\r
+\r
+ if(constraints) ct = &constraints->value;\r
+ else if(td->encoding_constraints.per_constraints)\r
+ ct = &td->encoding_constraints.per_constraints->value;\r
+ else ct = 0;\r
+\r
+ present = _fetch_present_idx(sptr,\r
+ specs->pres_offset, specs->pres_size);\r
+\r
+ /*\r
+ * If the structure was not initialized properly, it cannot be encoded:\r
+ * can't deduce what to encode in the choice type.\r
+ */\r
+ if(present <= 0 || (unsigned)present > td->elements_count)\r
+ ASN__ENCODE_FAILED;\r
+ else\r
+ present--;\r
+\r
+ /* Adjust if canonical order is different from natural order */\r
+ if(specs->to_canonical_order)\r
+ present = specs->to_canonical_order[present];\r
+\r
+ ASN_DEBUG("Encoding %s CHOICE element %d", td->name, present);\r
+\r
+ if(ct && ct->range_bits >= 0) {\r
+ if(present < ct->lower_bound\r
+ || present > ct->upper_bound) {\r
+ if(ct->flags & APC_EXTENSIBLE) {\r
+ if(per_put_few_bits(po, 1, 1))\r
+ ASN__ENCODE_FAILED;\r
+ } else {\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+ ct = 0;\r
+ }\r
+ }\r
+ if(ct && ct->flags & APC_EXTENSIBLE) {\r
+ if(per_put_few_bits(po, 0, 1))\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+\r
+ elm = &td->elements[present];\r
+ if(elm->flags & ATF_POINTER) {\r
+ /* Member is a pointer to another structure */\r
+ memb_ptr = *(const void *const *)((const char *)sptr + elm->memb_offset);\r
+ if(!memb_ptr) ASN__ENCODE_FAILED;\r
+ } else {\r
+ memb_ptr = (const char *)sptr + elm->memb_offset;\r
+ }\r
+\r
+ if(ct && ct->range_bits >= 0) {\r
+ if(per_put_few_bits(po, present, ct->range_bits))\r
+ ASN__ENCODE_FAILED;\r
+\r
+ return elm->type->op->aper_encoder(elm->type, elm->encoding_constraints.per_constraints,\r
+ memb_ptr, po);\r
+ } else {\r
+ asn_enc_rval_t rval = {0,0,0};\r
+ if(specs->ext_start == -1)\r
+ ASN__ENCODE_FAILED;\r
+ if (ct) {\r
+ if(aper_put_nsnnwn(po, ct->range_bits, present - specs->ext_start))\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+ if(aper_open_type_put(elm->type, elm->encoding_constraints.per_constraints,\r
+ memb_ptr, po))\r
+ ASN__ENCODE_FAILED;\r
+ rval.encoded = 0;\r
+ ASN__ENCODED_OK(rval);\r
+ }\r
+}\r
+\r
+int\r
+CHOICE_print(const asn_TYPE_descriptor_t *td, const void *sptr, int ilevel,\r
+ asn_app_consume_bytes_f *cb, void *app_key) {\r
+ const asn_CHOICE_specifics_t *specs = (const asn_CHOICE_specifics_t *)td->specifics;\r
+ unsigned present;\r
+\r
+ if(!sptr) return (cb("<absent>", 8, app_key) < 0) ? -1 : 0;\r
+\r
+ /*\r
+ * Figure out which CHOICE element is encoded.\r
+ */\r
+ present = _fetch_present_idx(sptr, specs->pres_offset,specs->pres_size);\r
+\r
+ /*\r
+ * Print that element.\r
+ */\r
+ if(present > 0 && present <= td->elements_count) {\r
+ asn_TYPE_member_t *elm = &td->elements[present-1];\r
+ const void *memb_ptr;\r
+\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr = *(const void * const *)((const char *)sptr + elm->memb_offset);\r
+ if(!memb_ptr) return (cb("<absent>", 8, app_key) < 0) ? -1 : 0;\r
+ } else {\r
+ memb_ptr = (const void *)((const char *)sptr + elm->memb_offset);\r
+ }\r
+\r
+ /* Print member's name and stuff */\r
+ if(0) {\r
+ if(cb(elm->name, strlen(elm->name), app_key) < 0\r
+ || cb(": ", 2, app_key) < 0)\r
+ return -1;\r
+ }\r
+\r
+ return elm->type->op->print_struct(elm->type, memb_ptr, ilevel,\r
+ cb, app_key);\r
+ } else {\r
+ return (cb("<absent>", 8, app_key) < 0) ? -1 : 0;\r
+ }\r
+}\r
+\r
+void\r
+CHOICE_free(const asn_TYPE_descriptor_t *td, void *ptr,\r
+ enum asn_struct_free_method method) {\r
+ const asn_CHOICE_specifics_t *specs =\r
+ (const asn_CHOICE_specifics_t *)td->specifics;\r
+ unsigned present;\r
+\r
+ if(!td || !ptr)\r
+ return;\r
+\r
+ ASN_DEBUG("Freeing %s as CHOICE", td->name);\r
+\r
+ /*\r
+ * Figure out which CHOICE element is encoded.\r
+ */\r
+ present = _fetch_present_idx(ptr, specs->pres_offset, specs->pres_size);\r
+\r
+ /*\r
+ * Free that element.\r
+ */\r
+ if(present > 0 && present <= td->elements_count) {\r
+ asn_TYPE_member_t *elm = &td->elements[present-1];\r
+ void *memb_ptr;\r
+\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr = *(void **)((char *)ptr + elm->memb_offset);\r
+ if(memb_ptr)\r
+ ASN_STRUCT_FREE(*elm->type, memb_ptr);\r
+ } else {\r
+ memb_ptr = (void *)((char *)ptr + elm->memb_offset);\r
+ ASN_STRUCT_FREE_CONTENTS_ONLY(*elm->type, memb_ptr);\r
+ }\r
+ }\r
+\r
+ switch(method) {\r
+ case ASFM_FREE_EVERYTHING:\r
+ FREEMEM(ptr);\r
+ break;\r
+ case ASFM_FREE_UNDERLYING:\r
+ break;\r
+ case ASFM_FREE_UNDERLYING_AND_RESET:\r
+ memset(ptr, 0, specs->struct_size);\r
+ break;\r
+ }\r
+}\r
+\r
+\r
+/*\r
+ * The following functions functions offer protection against -fshort-enums,\r
+ * compatible with little- and big-endian machines.\r
+ * If assertion is triggered, either disable -fshort-enums, or add an entry\r
+ * here with the ->pres_size of your target stracture.\r
+ * Unless the target structure is packed, the ".present" member\r
+ * is guaranteed to be aligned properly. ASN.1 compiler itself does not\r
+ * produce packed code.\r
+ */\r
+static unsigned\r
+_fetch_present_idx(const void *struct_ptr, unsigned pres_offset,\r
+ unsigned pres_size) {\r
+ const void *present_ptr;\r
+ unsigned present;\r
+\r
+ present_ptr = ((const char *)struct_ptr) + pres_offset;\r
+\r
+ switch(pres_size) {\r
+ case sizeof(int): present = *(const unsigned int *)present_ptr; break;\r
+ case sizeof(short): present = *(const unsigned short *)present_ptr; break;\r
+ case sizeof(char): present = *(const unsigned char *)present_ptr; break;\r
+ default:\r
+ /* ANSI C mandates enum to be equivalent to integer */\r
+ assert(pres_size != sizeof(int));\r
+ return 0; /* If not aborted, pass back safe value */\r
+ }\r
+\r
+ return present;\r
+}\r
+\r
+static void\r
+_set_present_idx(void *struct_ptr, unsigned pres_offset, unsigned pres_size,\r
+ unsigned present) {\r
+ void *present_ptr;\r
+ present_ptr = ((char *)struct_ptr) + pres_offset;\r
+\r
+ switch(pres_size) {\r
+ case sizeof(int): *(unsigned int *)present_ptr = present; break;\r
+ case sizeof(short): *(unsigned short *)present_ptr = present; break;\r
+ case sizeof(char): *(unsigned char *)present_ptr = present; break;\r
+ default:\r
+ /* ANSI C mandates enum to be equivalent to integer */\r
+ assert(pres_size != sizeof(int));\r
+ }\r
+}\r
+\r
+static const void *\r
+_get_member_ptr(const asn_TYPE_descriptor_t *td, const void *sptr,\r
+ asn_TYPE_member_t **elm_ptr, unsigned *present_out) {\r
+ const asn_CHOICE_specifics_t *specs =\r
+ (const asn_CHOICE_specifics_t *)td->specifics;\r
+ unsigned present;\r
+\r
+ if(!sptr) {\r
+ *elm_ptr = NULL;\r
+ *present_out = 0;\r
+ return NULL;\r
+ }\r
+\r
+ /*\r
+ * Figure out which CHOICE element is encoded.\r
+ */\r
+ present = _fetch_present_idx(sptr, specs->pres_offset, specs->pres_size);\r
+ *present_out = present;\r
+\r
+ /*\r
+ * The presence index is intentionally 1-based to avoid\r
+ * treating zeroed structure as a valid one.\r
+ */\r
+ if(present > 0 && present <= td->elements_count) {\r
+ asn_TYPE_member_t *const elm = &td->elements[present - 1];\r
+ const void *memb_ptr;\r
+\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr =\r
+ *(const void *const *)((const char *)sptr + elm->memb_offset);\r
+ } else {\r
+ memb_ptr = (const void *)((const char *)sptr + elm->memb_offset);\r
+ }\r
+ *elm_ptr = elm;\r
+ return memb_ptr;\r
+ } else {\r
+ *elm_ptr = NULL;\r
+ return NULL;\r
+ }\r
+\r
+}\r
+\r
+int\r
+CHOICE_compare(const asn_TYPE_descriptor_t *td, const void *aptr, const void *bptr) {\r
+ asn_TYPE_member_t *aelm;\r
+ asn_TYPE_member_t *belm;\r
+ unsigned apresent = 0;\r
+ unsigned bpresent = 0;\r
+ const void *amember = _get_member_ptr(td, aptr, &aelm, &apresent);\r
+ const void *bmember = _get_member_ptr(td, bptr, &belm, &bpresent);\r
+\r
+ if(amember && bmember) {\r
+ if(apresent == bpresent) {\r
+ assert(aelm == belm);\r
+ return aelm->type->op->compare_struct(aelm->type, amember, bmember);\r
+ } else if(apresent < bpresent) {\r
+ return -1;\r
+ } else {\r
+ return 1;\r
+ }\r
+ } else if(!amember) {\r
+ return -1;\r
+ } else {\r
+ return 1;\r
+ }\r
+}\r
+\r
+/*\r
+ * Return the 1-based choice variant presence index.\r
+ * Returns 0 in case of error.\r
+ */\r
+unsigned\r
+CHOICE_variant_get_presence(const asn_TYPE_descriptor_t *td, const void *sptr) {\r
+ const asn_CHOICE_specifics_t *specs =\r
+ (const asn_CHOICE_specifics_t *)td->specifics;\r
+ return _fetch_present_idx(sptr, specs->pres_offset, specs->pres_size);\r
+}\r
+\r
+/*\r
+ * Sets or resets the 1-based choice variant presence index.\r
+ * In case a previous index is not zero, the currently selected structure\r
+ * member is freed and zeroed-out first.\r
+ * Returns 0 on success and -1 on error.\r
+ */\r
+int\r
+CHOICE_variant_set_presence(const asn_TYPE_descriptor_t *td, void *sptr,\r
+ unsigned present) {\r
+ const asn_CHOICE_specifics_t *specs =\r
+ (const asn_CHOICE_specifics_t *)td->specifics;\r
+ unsigned old_present;\r
+\r
+ if(!sptr) {\r
+ return -1;\r
+ }\r
+\r
+ if(present > td->elements_count)\r
+ return -1;\r
+\r
+ old_present =\r
+ _fetch_present_idx(sptr, specs->pres_offset, specs->pres_size);\r
+ if(present == old_present)\r
+ return 0;\r
+\r
+ if(old_present != 0) {\r
+ assert(old_present <= td->elements_count);\r
+ ASN_STRUCT_RESET(*td, sptr);\r
+ }\r
+\r
+ _set_present_idx(sptr, specs->pres_offset, specs->pres_size, present);\r
+\r
+ return 0;\r
+}\r
+\r
+\r
+asn_random_fill_result_t\r
+CHOICE_random_fill(const asn_TYPE_descriptor_t *td, void **sptr,\r
+ const asn_encoding_constraints_t *constr,\r
+ size_t max_length) {\r
+ const asn_CHOICE_specifics_t *specs =\r
+ (const asn_CHOICE_specifics_t *)td->specifics;\r
+ asn_random_fill_result_t res;\r
+ asn_random_fill_result_t result_failed = {ARFILL_FAILED, 0};\r
+ asn_random_fill_result_t result_skipped = {ARFILL_SKIPPED, 0};\r
+ const asn_TYPE_member_t *elm;\r
+ unsigned present;\r
+ void *memb_ptr; /* Pointer to the member */\r
+ void **memb_ptr2; /* Pointer to that pointer */\r
+ void *st = *sptr;\r
+\r
+ if(max_length == 0) return result_skipped;\r
+\r
+ (void)constr;\r
+\r
+ if(st == NULL) {\r
+ st = CALLOC(1, specs->struct_size);\r
+ if(st == NULL) {\r
+ return result_failed;\r
+ }\r
+ }\r
+\r
+ present = asn_random_between(1, td->elements_count);\r
+ elm = &td->elements[present - 1];\r
+\r
+ if(elm->flags & ATF_POINTER) {\r
+ /* Member is a pointer to another structure */\r
+ memb_ptr2 = (void **)((char *)st + elm->memb_offset);\r
+ } else {\r
+ memb_ptr = (char *)st + elm->memb_offset;\r
+ memb_ptr2 = &memb_ptr;\r
+ }\r
+\r
+ res = elm->type->op->random_fill(elm->type, memb_ptr2,\r
+ &elm->encoding_constraints, max_length);\r
+ _set_present_idx(st, specs->pres_offset, specs->pres_size, present);\r
+ if(res.code == ARFILL_OK) {\r
+ *sptr = st;\r
+ } else {\r
+ if(st == *sptr) {\r
+ ASN_STRUCT_RESET(*td, st);\r
+ } else {\r
+ ASN_STRUCT_FREE(*td, st);\r
+ }\r
+ }\r
+\r
+ return res;\r
+}\r
+\r
+\r
+asn_TYPE_operation_t asn_OP_CHOICE = {\r
+ CHOICE_free,\r
+ CHOICE_print,\r
+ CHOICE_compare,\r
+ CHOICE_decode_ber,\r
+ CHOICE_encode_der,\r
+ CHOICE_decode_xer,\r
+ CHOICE_encode_xer,\r
+#ifdef ASN_DISABLE_OER_SUPPORT\r
+ 0,\r
+ 0,\r
+#else\r
+ CHOICE_decode_oer,\r
+ CHOICE_encode_oer,\r
+#endif /* ASN_DISABLE_OER_SUPPORT */\r
+#ifdef ASN_DISABLE_PER_SUPPORT\r
+ 0,\r
+ 0,\r
+ 0,\r
+ 0,\r
+#else\r
+ CHOICE_decode_uper,\r
+ CHOICE_encode_uper,\r
+ CHOICE_decode_aper,\r
+ CHOICE_encode_aper,\r
+#endif /* ASN_DISABLE_PER_SUPPORT */\r
+ CHOICE_random_fill,\r
+ CHOICE_outmost_tag\r
+};\r
Code Review / ric-app / kpimon.git / blobdiff