--- /dev/null
+/*\r
+ * Copyright (c) 2003-2017 Lev Walkin <vlm@lionet.info>.\r
+ * All rights reserved.\r
+ * Redistribution and modifications are permitted subject to BSD license.\r
+ */\r
+#include <asn_internal.h>\r
+#include <constr_SEQUENCE.h>\r
+#include <OPEN_TYPE.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
+#undef PHASE_OUT\r
+#define NEXT_PHASE(ctx) do { \\r
+ ctx->phase++; \\r
+ ctx->step = 0; \\r
+ } while(0)\r
+#define PHASE_OUT(ctx) do { ctx->phase = 10; } 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
+ * Check whether we are inside the extensions group.\r
+ */\r
+#define IN_EXTENSION_GROUP(specs, memb_idx) \\r
+ ((specs)->first_extension >= 0 \\r
+ && (unsigned)(specs)->first_extension <= (memb_idx))\r
+\r
+/*\r
+ * Tags are canonically sorted in the tag2element map.\r
+ */\r
+static int\r
+_t2e_cmp(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
+ if(a->el_no > b->el_no)\r
+ return 1;\r
+ /*\r
+ * Important: we do not check\r
+ * for a->el_no <= b->el_no!\r
+ */\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
+/*\r
+ * The decoder of the SEQUENCE type.\r
+ */\r
+asn_dec_rval_t\r
+SEQUENCE_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_SEQUENCE_specifics_t *specs = (const asn_SEQUENCE_specifics_t *)td->specifics;\r
+ const 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
+ asn_dec_rval_t rval; /* Return code from subparsers */\r
+\r
+ ssize_t consumed_myself = 0; /* Consumed bytes from ptr */\r
+ size_t edx; /* SEQUENCE element's index */\r
+\r
+ ASN_DEBUG("Decoding %s as SEQUENCE", 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
+ 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
+ ctx->left += rval.consumed; /* ?Substracted below! */\r
+ ADVANCE(rval.consumed);\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
+ * PHASE 1.\r
+ * From the place where we've left it previously,\r
+ * try to decode the next member from the list of\r
+ * this structure's elements.\r
+ * (ctx->step) stores the member being processed\r
+ * between invocations and the microphase {0,1} of parsing\r
+ * that member:\r
+ * step = (<member_number> * 2 + <microphase>).\r
+ */\r
+ for(edx = ((size_t)ctx->step >> 1); edx < td->elements_count;\r
+ edx++, ctx->step = (ctx->step & ~1) + 2) {\r
+ void *memb_ptr; /* Pointer to the member */\r
+ void **memb_ptr2; /* Pointer to that pointer */\r
+ ssize_t tag_len; /* Length of TLV's T */\r
+ size_t opt_edx_end; /* Next non-optional element */\r
+ size_t n;\r
+ int use_bsearch;\r
+\r
+ if(ctx->step & 1)\r
+ goto microphase2;\r
+\r
+ /*\r
+ * MICROPHASE 1: Synchronize decoding.\r
+ */\r
+ ASN_DEBUG("In %s SEQUENCE left %d, edx=%" ASN_PRI_SIZE " flags=%d"\r
+ " opt=%d ec=%d",\r
+ td->name, (int)ctx->left, edx,\r
+ elements[edx].flags, elements[edx].optional,\r
+ td->elements_count);\r
+\r
+ if(ctx->left == 0 /* No more stuff is expected */\r
+ && (\r
+ /* Explicit OPTIONAL specification reaches the end */\r
+ (edx + elements[edx].optional == td->elements_count) ||\r
+ /* All extensions are optional */\r
+ IN_EXTENSION_GROUP(specs, edx))) {\r
+ ASN_DEBUG("End of SEQUENCE %s", td->name);\r
+ /*\r
+ * Found the legitimate end of the structure.\r
+ */\r
+ PHASE_OUT(ctx);\r
+ RETURN(RC_OK);\r
+ }\r
+\r
+ /*\r
+ * Fetch the T from TLV.\r
+ */\r
+ tag_len = ber_fetch_tag(ptr, LEFT, &tlv_tag);\r
+ ASN_DEBUG("Current tag in %s SEQUENCE for element %" ASN_PRI_SIZE " "\r
+ "(%s) is %s encoded in %d bytes, of frame %ld",\r
+ td->name, edx, elements[edx].name,\r
+ ber_tlv_tag_string(tlv_tag), (int)tag_len, (long)LEFT);\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
+ if(ctx->left < 0 && ((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
+ }\r
+ } else if(((const uint8_t *)ptr)[1] == 0) {\r
+ ASN_DEBUG("edx = %" ASN_PRI_SIZE ", opt = %d, ec=%d", edx,\r
+ elements[edx].optional, td->elements_count);\r
+ if((edx + elements[edx].optional == td->elements_count)\r
+ || IN_EXTENSION_GROUP(specs, edx)) {\r
+ /*\r
+ * Yeah, baby! Found the terminator\r
+ * of the indefinite length structure.\r
+ */\r
+ /*\r
+ * Proceed to the canonical\r
+ * finalization function.\r
+ * No advancing is necessary.\r
+ */\r
+ goto phase3;\r
+ }\r
+ }\r
+ }\r
+\r
+ /*\r
+ * Find the next available type with this tag.\r
+ */\r
+ use_bsearch = 0;\r
+ opt_edx_end = edx + elements[edx].optional + 1;\r
+ if(opt_edx_end > td->elements_count)\r
+ opt_edx_end = td->elements_count; /* Cap */\r
+ else if(opt_edx_end - edx > 8) {\r
+ /* Limit the scope of linear search... */\r
+ opt_edx_end = edx + 8;\r
+ use_bsearch = 1;\r
+ /* ... and resort to bsearch() */\r
+ }\r
+ for(n = edx; n < opt_edx_end; n++) {\r
+ if(BER_TAGS_EQUAL(tlv_tag, elements[n].tag)) {\r
+ /*\r
+ * Found element corresponding to the tag\r
+ * being looked at.\r
+ * Reposition over the right element.\r
+ */\r
+ edx = n;\r
+ ctx->step = 1 + 2 * edx; /* Remember! */\r
+ goto microphase2;\r
+ } else if(elements[n].flags & ATF_ANY_TYPE) {\r
+ /*\r
+ * This is the ANY type, which may bear\r
+ * any flag whatsoever.\r
+ */\r
+ edx = n;\r
+ ctx->step = 1 + 2 * edx; /* Remember! */\r
+ goto microphase2;\r
+ } else if(elements[n].tag == (ber_tlv_tag_t)-1) {\r
+ use_bsearch = 1;\r
+ break;\r
+ }\r
+ }\r
+ if(use_bsearch) {\r
+ /*\r
+ * Resort to a binary search over\r
+ * sorted array of tags.\r
+ */\r
+ const asn_TYPE_tag2member_t *t2m;\r
+ asn_TYPE_tag2member_t key = {0, 0, 0, 0};\r
+ key.el_tag = tlv_tag;\r
+ key.el_no = edx;\r
+ t2m = (const asn_TYPE_tag2member_t *)bsearch(&key,\r
+ specs->tag2el, specs->tag2el_count,\r
+ sizeof(specs->tag2el[0]), _t2e_cmp);\r
+ if(t2m) {\r
+ const asn_TYPE_tag2member_t *best = 0;\r
+ const asn_TYPE_tag2member_t *t2m_f, *t2m_l;\r
+ size_t edx_max = edx + elements[edx].optional;\r
+ /*\r
+ * Rewind to the first element with that tag,\r
+ * `cause bsearch() does not guarantee order.\r
+ */\r
+ t2m_f = t2m + t2m->toff_first;\r
+ t2m_l = t2m + t2m->toff_last;\r
+ for(t2m = t2m_f; t2m <= t2m_l; t2m++) {\r
+ if(t2m->el_no > edx_max) break;\r
+ if(t2m->el_no < edx) continue;\r
+ best = t2m;\r
+ }\r
+ if(best) {\r
+ edx = best->el_no;\r
+ ctx->step = 1 + 2 * edx;\r
+ goto microphase2;\r
+ }\r
+ }\r
+ n = opt_edx_end;\r
+ }\r
+ if(n == opt_edx_end) {\r
+ /*\r
+ * If tag is unknown, it may be either\r
+ * an unknown (thus, incorrect) tag,\r
+ * or an extension (...),\r
+ * or an end of the indefinite-length structure.\r
+ */\r
+ if(!IN_EXTENSION_GROUP(specs,\r
+ edx + elements[edx].optional)) {\r
+ ASN_DEBUG("Unexpected tag %s (at %" ASN_PRI_SIZE ")",\r
+ ber_tlv_tag_string(tlv_tag), edx);\r
+ ASN_DEBUG("Expected tag %s (%s)%s",\r
+ ber_tlv_tag_string(elements[edx].tag),\r
+ elements[edx].name,\r
+ elements[edx].optional\r
+ ?" or alternatives":"");\r
+ RETURN(RC_FAIL);\r
+ } else {\r
+ /* Skip this tag */\r
+ ssize_t skip;\r
+ edx += elements[edx].optional;\r
+\r
+ ASN_DEBUG("Skipping unexpected %s (at %" ASN_PRI_SIZE ")",\r
+ ber_tlv_tag_string(tlv_tag), edx);\r
+ skip = ber_skip_length(opt_codec_ctx,\r
+ BER_TLV_CONSTRUCTED(ptr),\r
+ (const char *)ptr + tag_len,\r
+ LEFT - tag_len);\r
+ ASN_DEBUG("Skip length %d in %s",\r
+ (int)skip, td->name);\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
+ ctx->step -= 2;\r
+ edx--;\r
+ continue; /* Try again with the next tag */\r
+ }\r
+ }\r
+\r
+ /*\r
+ * MICROPHASE 2: Invoke the member-specific decoder.\r
+ */\r
+ ctx->step |= 1; /* Confirm entering next microphase */\r
+ microphase2:\r
+ ASN_DEBUG("Inside SEQUENCE %s MF2", td->name);\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(elements[edx].flags & ATF_POINTER) {\r
+ /* Member is a pointer to another structure */\r
+ memb_ptr2 = (void **)((char *)st + elements[edx].memb_offset);\r
+ } else {\r
+ /*\r
+ * A pointer to a pointer\r
+ * holding the start of the structure\r
+ */\r
+ memb_ptr = (char *)st + elements[edx].memb_offset;\r
+ memb_ptr2 = &memb_ptr;\r
+ }\r
+ /*\r
+ * Invoke the member fetch routine according to member's type\r
+ */\r
+ if(elements[edx].flags & ATF_OPEN_TYPE) {\r
+ rval = OPEN_TYPE_ber_get(opt_codec_ctx, td, st, &elements[edx], ptr, LEFT);\r
+ } else {\r
+ rval = elements[edx].type->op->ber_decoder(opt_codec_ctx,\r
+ elements[edx].type,\r
+ memb_ptr2, ptr, LEFT,\r
+ elements[edx].tag_mode);\r
+ }\r
+ ASN_DEBUG("In %s SEQUENCE decoded %" ASN_PRI_SIZE " %s of %d "\r
+ "in %d bytes rval.code %d, size=%d",\r
+ td->name, edx, elements[edx].type->name,\r
+ (int)LEFT, (int)rval.consumed, rval.code, (int)size);\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
+ ASN_DEBUG("Size violation (c->l=%ld <= s=%ld)",\r
+ (long)ctx->left, (long)size);\r
+ /* Fall through */\r
+ case RC_FAIL: /* Fatal error */\r
+ RETURN(RC_FAIL);\r
+ } /* switch(rval) */\r
+ \r
+ ADVANCE(rval.consumed);\r
+ } /* for(all structure members) */\r
+\r
+ phase3:\r
+ ctx->phase = 3;\r
+ /* Fall through */\r
+ case 3: /* 00 and other tags expected */\r
+ case 4: /* only 00's expected */\r
+\r
+ ASN_DEBUG("SEQUENCE %s Leftover: %ld, size = %ld",\r
+ td->name, (long)ctx->left, (long)size);\r
+\r
+ /*\r
+ * Skip everything until the end of the SEQUENCE.\r
+ */\r
+ while(ctx->left) {\r
+ ssize_t tl, ll;\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
+ * If expected <0><0>...\r
+ */\r
+ if(ctx->left < 0\r
+ && ((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
+ ctx->phase = 4;\r
+ continue;\r
+ }\r
+ }\r
+\r
+ if(!IN_EXTENSION_GROUP(specs, td->elements_count)\r
+ || ctx->phase == 4) {\r
+ ASN_DEBUG("Unexpected continuation "\r
+ "of a non-extensible type "\r
+ "%s (SEQUENCE): %s",\r
+ td->name,\r
+ ber_tlv_tag_string(tlv_tag));\r
+ RETURN(RC_FAIL);\r
+ }\r
+\r
+ ll = ber_skip_length(opt_codec_ctx,\r
+ BER_TLV_CONSTRUCTED(ptr),\r
+ (const char *)ptr + tl, LEFT - tl);\r
+ switch(ll) {\r
+ case 0: if(!SIZE_VIOLATION) RETURN(RC_WMORE);\r
+ /* Fall through */\r
+ case -1: RETURN(RC_FAIL);\r
+ }\r
+\r
+ ADVANCE(tl + ll);\r
+ }\r
+\r
+ PHASE_OUT(ctx);\r
+ }\r
+ \r
+ RETURN(RC_OK);\r
+}\r
+\r
+\r
+/*\r
+ * The DER encoder of the SEQUENCE type.\r
+ */\r
+asn_enc_rval_t\r
+SEQUENCE_encode_der(const asn_TYPE_descriptor_t *td, const void *sptr,\r
+ int tag_mode, ber_tlv_tag_t tag,\r
+ asn_app_consume_bytes_f *cb, void *app_key) {\r
+ size_t computed_size = 0;\r
+ asn_enc_rval_t erval = {0,0,0};\r
+ ssize_t ret;\r
+ size_t edx;\r
+\r
+ ASN_DEBUG("%s %s as SEQUENCE",\r
+ cb?"Encoding":"Estimating", td->name);\r
+\r
+ /*\r
+ * Gather the length of the underlying members sequence.\r
+ */\r
+ for(edx = 0; edx < td->elements_count; edx++) {\r
+ asn_TYPE_member_t *elm = &td->elements[edx];\r
+\r
+ const void *memb_ptr; /* Pointer to the member */\r
+ const void *const *memb_ptr2; /* Pointer to that pointer */\r
+\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr2 =\r
+ (const void *const *)((const char *)sptr + elm->memb_offset);\r
+ if(!*memb_ptr2) {\r
+ ASN_DEBUG("Element %s %" ASN_PRI_SIZE " not present",\r
+ elm->name, edx);\r
+ if(elm->optional)\r
+ continue;\r
+ /* Mandatory element is missing */\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+ } else {\r
+ memb_ptr = (const void *)((const char *)sptr + elm->memb_offset);\r
+ memb_ptr2 = &memb_ptr;\r
+ }\r
+\r
+ /* Eliminate default values */\r
+ if(elm->default_value_cmp && elm->default_value_cmp(*memb_ptr2) == 0)\r
+ continue;\r
+\r
+ erval = elm->type->op->der_encoder(elm->type, *memb_ptr2,\r
+ elm->tag_mode, elm->tag,\r
+ 0, 0);\r
+ if(erval.encoded == -1)\r
+ return erval;\r
+ computed_size += erval.encoded;\r
+ ASN_DEBUG("Member %" ASN_PRI_SIZE " %s estimated %ld bytes",\r
+ edx, elm->name, (long)erval.encoded);\r
+ }\r
+\r
+ /*\r
+ * Encode the TLV for the sequence itself.\r
+ */\r
+ ret = der_write_tags(td, computed_size, tag_mode, 1, tag, cb, app_key);\r
+ ASN_DEBUG("Wrote tags: %ld (+%ld)", (long)ret, (long)computed_size);\r
+ if(ret == -1)\r
+ ASN__ENCODE_FAILED;\r
+ erval.encoded = computed_size + ret;\r
+\r
+ if(!cb) ASN__ENCODED_OK(erval);\r
+\r
+ /*\r
+ * Encode all members.\r
+ */\r
+ for(edx = 0; edx < td->elements_count; edx++) {\r
+ asn_TYPE_member_t *elm = &td->elements[edx];\r
+ asn_enc_rval_t tmperval = {0,0,0};\r
+ const void *memb_ptr; /* Pointer to the member */\r
+ const void *const *memb_ptr2; /* Pointer to that pointer */\r
+\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr2 =\r
+ (const void *const *)((const char *)sptr + elm->memb_offset);\r
+ if(!*memb_ptr2) continue;\r
+ } else {\r
+ memb_ptr = (const void *)((const char *)sptr + elm->memb_offset);\r
+ memb_ptr2 = &memb_ptr;\r
+ }\r
+\r
+ /* Eliminate default values */\r
+ if(elm->default_value_cmp && elm->default_value_cmp(*memb_ptr2) == 0)\r
+ continue;\r
+\r
+ tmperval = elm->type->op->der_encoder(elm->type, *memb_ptr2,\r
+ elm->tag_mode, elm->tag, cb, app_key);\r
+ if(tmperval.encoded == -1)\r
+ return tmperval;\r
+ computed_size -= tmperval.encoded;\r
+ ASN_DEBUG("Member %" ASN_PRI_SIZE " %s of SEQUENCE %s encoded in %ld bytes",\r
+ edx, elm->name, td->name, (long)tmperval.encoded);\r
+ }\r
+\r
+ if(computed_size != 0)\r
+ /*\r
+ * Encoded size is not equal to the computed size.\r
+ */\r
+ ASN__ENCODE_FAILED;\r
+\r
+ ASN__ENCODED_OK(erval);\r
+}\r
+\r
+\r
+#undef XER_ADVANCE\r
+#define XER_ADVANCE(num_bytes) \\r
+ do { \\r
+ size_t num = (num_bytes); \\r
+ ptr = ((const char *)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
+SEQUENCE_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 *ptr, size_t size) {\r
+ /*\r
+ * Bring closer parts of structure description.\r
+ */\r
+ const asn_SEQUENCE_specifics_t *specs\r
+ = (const asn_SEQUENCE_specifics_t *)td->specifics;\r
+ asn_TYPE_member_t *elements = td->elements;\r
+ const char *xml_tag = opt_mname ? opt_mname : td->xml_tag;\r
+\r
+ /*\r
+ * ... and 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 from 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
+\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: Skipping unknown extensions.\r
+ * Phase 4: PHASED OUT\r
+ */\r
+ for(edx = ctx->step; ctx->phase <= 3;) {\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 inner member of a sequence.\r
+ */\r
+ if(ctx->phase == 2) {\r
+ asn_dec_rval_t tmprval;\r
+ void *memb_ptr_dontuse; /* Pointer to the member */\r
+ void **memb_ptr2; /* Pointer to that pointer */\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 + elm->memb_offset);\r
+ } else {\r
+ memb_ptr_dontuse = (char *)st + elm->memb_offset;\r
+ memb_ptr2 = &memb_ptr_dontuse; /* Only use of memb_ptr_dontuse */\r
+ }\r
+\r
+ if(elm->flags & ATF_OPEN_TYPE) {\r
+ tmprval = OPEN_TYPE_xer_get(opt_codec_ctx, td, st, elm, ptr, size);\r
+ } else {\r
+ /* Invoke the inner type decoder, m.b. multiple times */\r
+ tmprval = elm->type->op->xer_decoder(opt_codec_ctx,\r
+ elm->type, memb_ptr2, elm->name,\r
+ ptr, size);\r
+ }\r
+ XER_ADVANCE(tmprval.consumed);\r
+ if(tmprval.code != RC_OK)\r
+ RETURN(tmprval.code);\r
+ ctx->phase = 1; /* Back to body processing */\r
+ ctx->step = ++edx;\r
+ ASN_DEBUG("XER/SEQUENCE phase => %d, step => %d",\r
+ ctx->phase, ctx->step);\r
+ /* Fall through */\r
+ }\r
+\r
+ /*\r
+ * Get the next part of the XML stream.\r
+ */\r
+ ch_size = xer_next_token(&ctx->context, ptr, size,\r
+ &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(ptr, ch_size, xml_tag);\r
+ ASN_DEBUG("XER/SEQUENCE: tcv = %d, ph=%d [%s]",\r
+ tcv, ctx->phase, xml_tag);\r
+\r
+ /* Skip the extensions section */\r
+ if(ctx->phase == 3) {\r
+ switch(xer_skip_unknown(tcv, &ctx->left)) {\r
+ case -1:\r
+ ctx->phase = 4;\r
+ RETURN(RC_FAIL);\r
+ case 0:\r
+ XER_ADVANCE(ch_size);\r
+ continue;\r
+ case 1:\r
+ XER_ADVANCE(ch_size);\r
+ ctx->phase = 1;\r
+ continue;\r
+ case 2:\r
+ ctx->phase = 1;\r
+ break;\r
+ }\r
+ }\r
+\r
+ switch(tcv) {\r
+ case XCT_CLOSING:\r
+ if(ctx->phase == 0) break;\r
+ ctx->phase = 0;\r
+ /* Fall through */\r
+ case XCT_BOTH:\r
+ if(ctx->phase == 0) {\r
+ if(edx >= td->elements_count ||\r
+ /* Explicit OPTIONAL specs reaches the end */\r
+ (edx + elements[edx].optional == td->elements_count) ||\r
+ /* All extensions are optional */\r
+ IN_EXTENSION_GROUP(specs, edx)) {\r
+ XER_ADVANCE(ch_size);\r
+ ctx->phase = 4; /* Phase out */\r
+ RETURN(RC_OK);\r
+ } else {\r
+ ASN_DEBUG("Premature end of XER SEQUENCE");\r
+ RETURN(RC_FAIL);\r
+ }\r
+ }\r
+ /* Fall through */\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
+ ASN_DEBUG("XER/SEQUENCE: tcv=%d, ph=%d, edx=%" ASN_PRI_SIZE "",\r
+ tcv, ctx->phase, edx);\r
+ if(ctx->phase != 1) {\r
+ break; /* Really unexpected */\r
+ }\r
+\r
+ if(edx < td->elements_count) {\r
+ /*\r
+ * Search which member corresponds to this tag.\r
+ */\r
+ size_t n;\r
+ size_t edx_end = edx + elements[edx].optional + 1;\r
+ if(edx_end > td->elements_count)\r
+ edx_end = td->elements_count;\r
+ for(n = edx; n < edx_end; n++) {\r
+ elm = &td->elements[n];\r
+ tcv = xer_check_tag(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 = n;\r
+ ctx->phase = 2;\r
+ break;\r
+ case XCT_UNKNOWN_OP:\r
+ case XCT_UNKNOWN_BO:\r
+ continue;\r
+ default:\r
+ n = edx_end;\r
+ break; /* Phase out */\r
+ }\r
+ break;\r
+ }\r
+ if(n != edx_end)\r
+ continue;\r
+ } else {\r
+ ASN_DEBUG("Out of defined members: %" ASN_PRI_SIZE "/%u",\r
+ edx, td->elements_count);\r
+ }\r
+\r
+ /* It is expected extension */\r
+ if(IN_EXTENSION_GROUP(specs,\r
+ edx + (edx < td->elements_count\r
+ ? elements[edx].optional : 0))) {\r
+ ASN_DEBUG("Got anticipated extension at %" ASN_PRI_SIZE "",\r
+ edx);\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
+ } else {\r
+ ctx->left = 1;\r
+ ctx->phase = 3; /* 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 in SEQUENCE [%c%c%c%c%c%c]",\r
+ size>0?((const char *)ptr)[0]:'.',\r
+ size>1?((const char *)ptr)[1]:'.',\r
+ size>2?((const char *)ptr)[2]:'.',\r
+ size>3?((const char *)ptr)[3]:'.',\r
+ size>4?((const char *)ptr)[4]:'.',\r
+ size>5?((const char *)ptr)[5]:'.');\r
+ break;\r
+ }\r
+\r
+ ctx->phase = 4; /* "Phase out" on hard failure */\r
+ RETURN(RC_FAIL);\r
+}\r
+\r
+asn_enc_rval_t\r
+SEQUENCE_encode_xer(const asn_TYPE_descriptor_t *td, const void *sptr,\r
+ int ilevel, enum xer_encoder_flags_e flags,\r
+ asn_app_consume_bytes_f *cb, void *app_key) {\r
+ asn_enc_rval_t er = {0,0,0};\r
+ int xcan = (flags & XER_F_CANONICAL);\r
+ asn_TYPE_descriptor_t *tmp_def_val_td = 0;\r
+ void *tmp_def_val = 0;\r
+ size_t edx;\r
+\r
+ if(!sptr) ASN__ENCODE_FAILED;\r
+\r
+ er.encoded = 0;\r
+\r
+ for(edx = 0; edx < td->elements_count; edx++) {\r
+ asn_enc_rval_t tmper = {0,0,0};\r
+ asn_TYPE_member_t *elm = &td->elements[edx];\r
+ const void *memb_ptr;\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) {\r
+ assert(tmp_def_val == 0);\r
+ if(elm->default_value_set) {\r
+ if(elm->default_value_set(&tmp_def_val)) {\r
+ ASN__ENCODE_FAILED;\r
+ } else {\r
+ memb_ptr = tmp_def_val;\r
+ tmp_def_val_td = elm->type;\r
+ }\r
+ } else if(elm->optional) {\r
+ continue;\r
+ } else {\r
+ /* Mandatory element is missing */\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+ }\r
+ } else {\r
+ memb_ptr = (const void *)((const char *)sptr + elm->memb_offset);\r
+ }\r
+\r
+ if(!xcan) ASN__TEXT_INDENT(1, ilevel);\r
+ ASN__CALLBACK3("<", 1, mname, mlen, ">", 1);\r
+\r
+ /* Print the member itself */\r
+ tmper = elm->type->op->xer_encoder(elm->type, memb_ptr, ilevel + 1,\r
+ flags, cb, app_key);\r
+ if(tmp_def_val) {\r
+ ASN_STRUCT_FREE(*tmp_def_val_td, tmp_def_val);\r
+ tmp_def_val = 0;\r
+ }\r
+ if(tmper.encoded == -1) return tmper;\r
+ er.encoded += tmper.encoded;\r
+\r
+ ASN__CALLBACK3("</", 2, mname, mlen, ">", 1);\r
+ }\r
+\r
+ if(!xcan) ASN__TEXT_INDENT(1, ilevel - 1);\r
+\r
+ ASN__ENCODED_OK(er);\r
+cb_failed:\r
+ if(tmp_def_val) ASN_STRUCT_FREE(*tmp_def_val_td, tmp_def_val);\r
+ ASN__ENCODE_FAILED;\r
+}\r
+\r
+int\r
+SEQUENCE_print(const asn_TYPE_descriptor_t *td, const void *sptr, int ilevel,\r
+ asn_app_consume_bytes_f *cb, void *app_key) {\r
+ size_t edx;\r
+ int ret;\r
+\r
+ if(!sptr) return (cb("<absent>", 8, app_key) < 0) ? -1 : 0;\r
+\r
+ /* Dump preamble */\r
+ if(cb(td->name, strlen(td->name), app_key) < 0\r
+ || cb(" ::= {", 6, app_key) < 0)\r
+ return -1;\r
+\r
+ for(edx = 0; edx < td->elements_count; edx++) {\r
+ asn_TYPE_member_t *elm = &td->elements[edx];\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) continue;\r
+ /* Print <absent> line */\r
+ /* Fall through */\r
+ }\r
+ } else {\r
+ memb_ptr = (const void *)((const char *)sptr + elm->memb_offset);\r
+ }\r
+\r
+ /* Indentation */\r
+ _i_INDENT(1);\r
+\r
+ /* Print the member's name and stuff */\r
+ if(cb(elm->name, strlen(elm->name), app_key) < 0\r
+ || cb(": ", 2, app_key) < 0)\r
+ return -1;\r
+\r
+ /* Print the member itself */\r
+ ret = elm->type->op->print_struct(elm->type, memb_ptr, ilevel + 1,\r
+ cb, app_key);\r
+ if(ret) return ret;\r
+ }\r
+\r
+ ilevel--;\r
+ _i_INDENT(1);\r
+\r
+ return (cb("}", 1, app_key) < 0) ? -1 : 0;\r
+}\r
+\r
+void\r
+SEQUENCE_free(const asn_TYPE_descriptor_t *td, void *sptr,\r
+ enum asn_struct_free_method method) {\r
+ size_t edx;\r
+ const asn_SEQUENCE_specifics_t *specs =\r
+ (const asn_SEQUENCE_specifics_t *)td->specifics;\r
+ asn_struct_ctx_t *ctx; /* Decoder context */\r
+\r
+ if(!td || !sptr)\r
+ return;\r
+\r
+ ASN_DEBUG("Freeing %s as SEQUENCE", td->name);\r
+\r
+ for(edx = 0; edx < td->elements_count; edx++) {\r
+ asn_TYPE_member_t *elm = &td->elements[edx];\r
+ void *memb_ptr;\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr = *(void **)((char *)sptr + elm->memb_offset);\r
+ if(memb_ptr)\r
+ ASN_STRUCT_FREE(*elm->type, memb_ptr);\r
+ } else {\r
+ memb_ptr = (void *)((char *)sptr + elm->memb_offset);\r
+ ASN_STRUCT_FREE_CONTENTS_ONLY(*elm->type, memb_ptr);\r
+ }\r
+ }\r
+\r
+ /* Clean parsing context */\r
+ ctx = (asn_struct_ctx_t *)((char *)sptr + specs->ctx_offset);\r
+ FREEMEM(ctx->ptr);\r
+\r
+ switch(method) {\r
+ case ASFM_FREE_EVERYTHING:\r
+ FREEMEM(sptr);\r
+ break;\r
+ case ASFM_FREE_UNDERLYING:\r
+ break;\r
+ case ASFM_FREE_UNDERLYING_AND_RESET:\r
+ memset(\r
+ sptr, 0,\r
+ ((const asn_SEQUENCE_specifics_t *)(td->specifics))->struct_size);\r
+ break;\r
+ }\r
+}\r
+\r
+int\r
+SEQUENCE_constraint(const asn_TYPE_descriptor_t *td, const void *sptr,\r
+ asn_app_constraint_failed_f *ctfailcb, void *app_key) {\r
+ size_t edx;\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
+ * Iterate over structure members and check their validity.\r
+ */\r
+ for(edx = 0; edx < td->elements_count; edx++) {\r
+ asn_TYPE_member_t *elm = &td->elements[edx];\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
+ continue;\r
+ ASN__CTFAIL(app_key, td, sptr,\r
+ "%s: mandatory 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
+ int ret = elm->encoding_constraints.general_constraints(elm->type, memb_ptr,\r
+ ctfailcb, app_key);\r
+ if(ret) return ret;\r
+ } else {\r
+ return elm->type->encoding_constraints.general_constraints(elm->type,\r
+ memb_ptr, ctfailcb, app_key);\r
+ }\r
+ }\r
+\r
+ return 0;\r
+}\r
+\r
+#ifndef ASN_DISABLE_PER_SUPPORT\r
+\r
+asn_dec_rval_t\r
+SEQUENCE_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_SEQUENCE_specifics_t *specs = (const asn_SEQUENCE_specifics_t *)td->specifics;\r
+ void *st = *sptr; /* Target structure. */\r
+ int extpresent; /* Extension additions are present */\r
+ uint8_t *opres; /* Presence of optional root members */\r
+ asn_per_data_t opmd;\r
+ asn_dec_rval_t rv;\r
+ size_t edx;\r
+\r
+ (void)constraints;\r
+\r
+ if(ASN__STACK_OVERFLOW_CHECK(opt_codec_ctx))\r
+ ASN__DECODE_FAILED;\r
+\r
+ if(!st) {\r
+ st = *sptr = CALLOC(1, specs->struct_size);\r
+ if(!st) ASN__DECODE_FAILED;\r
+ }\r
+\r
+ ASN_DEBUG("Decoding %s as SEQUENCE (UPER)", td->name);\r
+\r
+ /* Handle extensions */\r
+ if(specs->first_extension < 0) {\r
+ extpresent = 0;\r
+ } else {\r
+ extpresent = per_get_few_bits(pd, 1);\r
+ if(extpresent < 0) ASN__DECODE_STARVED;\r
+ }\r
+\r
+ /* Prepare a place and read-in the presence bitmap */\r
+ memset(&opmd, 0, sizeof(opmd));\r
+ if(specs->roms_count) {\r
+ opres = (uint8_t *)MALLOC(((specs->roms_count + 7) >> 3) + 1);\r
+ if(!opres) ASN__DECODE_FAILED;\r
+ /* Get the presence map */\r
+ if(per_get_many_bits(pd, opres, 0, specs->roms_count)) {\r
+ FREEMEM(opres);\r
+ ASN__DECODE_STARVED;\r
+ }\r
+ opmd.buffer = opres;\r
+ opmd.nbits = specs->roms_count;\r
+ ASN_DEBUG("Read in presence bitmap for %s of %d bits (%x..)",\r
+ td->name, specs->roms_count, *opres);\r
+ } else {\r
+ opres = 0;\r
+ }\r
+\r
+ /*\r
+ * Get the sequence ROOT elements.\r
+ */\r
+ for(edx = 0;\r
+ edx < (specs->first_extension < 0 ? td->elements_count\r
+ : (size_t)specs->first_extension);\r
+ edx++) {\r
+ asn_TYPE_member_t *elm = &td->elements[edx];\r
+ void *memb_ptr; /* Pointer to the member */\r
+ void **memb_ptr2; /* Pointer to that pointer */\r
+\r
+ assert(!IN_EXTENSION_GROUP(specs, edx));\r
+\r
+ /* Fetch the pointer to this member */\r
+ if(elm->flags & ATF_POINTER) {\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
+ /* Deal with optionality */\r
+ if(elm->optional) {\r
+ int present = per_get_few_bits(&opmd, 1);\r
+ ASN_DEBUG("Member %s->%s is optional, p=%d (%d->%d)",\r
+ td->name, elm->name, present,\r
+ (int)opmd.nboff, (int)opmd.nbits);\r
+ if(present == 0) {\r
+ /* This element is not present */\r
+ if(elm->default_value_set) {\r
+ /* Fill-in DEFAULT */\r
+ if(elm->default_value_set(memb_ptr2)) {\r
+ FREEMEM(opres);\r
+ ASN__DECODE_FAILED;\r
+ }\r
+ ASN_DEBUG("Filled-in default");\r
+ }\r
+ /* The member is just not present */\r
+ continue;\r
+ }\r
+ /* Fall through */\r
+ }\r
+\r
+ /* Fetch the member from the stream */\r
+ ASN_DEBUG("Decoding member \"%s\" in %s", elm->name, td->name);\r
+\r
+ if(elm->flags & ATF_OPEN_TYPE) {\r
+ rv = OPEN_TYPE_uper_get(opt_codec_ctx, td, st, elm, pd);\r
+ } else {\r
+ rv = elm->type->op->uper_decoder(opt_codec_ctx, elm->type,\r
+ elm->encoding_constraints.per_constraints, memb_ptr2, pd);\r
+ }\r
+ if(rv.code != RC_OK) {\r
+ ASN_DEBUG("Failed decode %s in %s",\r
+ elm->name, td->name);\r
+ FREEMEM(opres);\r
+ return rv;\r
+ }\r
+ }\r
+\r
+ /* Optionality map is not needed anymore */\r
+ FREEMEM(opres);\r
+\r
+ /*\r
+ * Deal with extensions.\r
+ */\r
+ if(extpresent) {\r
+ ssize_t bmlength;\r
+ uint8_t *epres; /* Presence of extension members */\r
+ asn_per_data_t epmd;\r
+\r
+ bmlength = uper_get_nslength(pd);\r
+ if(bmlength < 0) ASN__DECODE_STARVED;\r
+\r
+ ASN_DEBUG("Extensions %" ASN_PRI_SSIZE " present in %s", bmlength, td->name);\r
+\r
+ epres = (uint8_t *)MALLOC((bmlength + 15) >> 3);\r
+ if(!epres) ASN__DECODE_STARVED;\r
+\r
+ /* Get the extensions map */\r
+ if(per_get_many_bits(pd, epres, 0, bmlength)) {\r
+ FREEMEM(epres);\r
+ ASN__DECODE_STARVED;\r
+ }\r
+\r
+ memset(&epmd, 0, sizeof(epmd));\r
+ epmd.buffer = epres;\r
+ epmd.nbits = bmlength;\r
+ ASN_DEBUG("Read in extensions bitmap for %s of %ld bits (%x..)",\r
+ td->name, (long)bmlength, *epres);\r
+\r
+ /* Go over extensions and read them in */\r
+ for(edx = specs->first_extension; edx < td->elements_count; edx++) {\r
+ asn_TYPE_member_t *elm = &td->elements[edx];\r
+ void *memb_ptr; /* Pointer to the member */\r
+ void **memb_ptr2; /* Pointer to that pointer */\r
+ int present;\r
+\r
+ /* Fetch the pointer to this member */\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr2 = (void **)((char *)st + elm->memb_offset);\r
+ } else {\r
+ memb_ptr = (void *)((char *)st + elm->memb_offset);\r
+ memb_ptr2 = &memb_ptr;\r
+ }\r
+\r
+ present = per_get_few_bits(&epmd, 1);\r
+ if(present <= 0) {\r
+ if(present < 0) break; /* No more extensions */\r
+ continue;\r
+ }\r
+\r
+ ASN_DEBUG("Decoding member %s in %s %p", elm->name, td->name,\r
+ *memb_ptr2);\r
+ rv = uper_open_type_get(opt_codec_ctx, elm->type,\r
+ elm->encoding_constraints.per_constraints,\r
+ memb_ptr2, pd);\r
+ if(rv.code != RC_OK) {\r
+ FREEMEM(epres);\r
+ return rv;\r
+ }\r
+ }\r
+\r
+ /* Skip over overflow extensions which aren't present\r
+ * in this system's version of the protocol */\r
+ for(;;) {\r
+ ASN_DEBUG("Getting overflow extensions");\r
+ switch(per_get_few_bits(&epmd, 1)) {\r
+ case -1: break;\r
+ case 0: continue;\r
+ default:\r
+ if(uper_open_type_skip(opt_codec_ctx, pd)) {\r
+ FREEMEM(epres);\r
+ ASN__DECODE_STARVED;\r
+ }\r
+ ASN_DEBUG("Skipped overflow extension");\r
+ continue;\r
+ }\r
+ break;\r
+ }\r
+\r
+ FREEMEM(epres);\r
+ }\r
+\r
+ if(specs->first_extension >= 0) {\r
+ unsigned i;\r
+ /* Fill DEFAULT members in extensions */\r
+ for(i = specs->roms_count; i < specs->roms_count + specs->aoms_count;\r
+ i++) {\r
+ asn_TYPE_member_t *elm;\r
+ void **memb_ptr2; /* Pointer to member pointer */\r
+\r
+ edx = specs->oms[i];\r
+ elm = &td->elements[edx];\r
+\r
+ if(!elm->default_value_set) continue;\r
+\r
+ /* Fetch the pointer to this member */\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr2 = (void **)((char *)st + elm->memb_offset);\r
+ if(*memb_ptr2) continue;\r
+ } else {\r
+ continue; /* Extensions are all optionals */\r
+ }\r
+\r
+ /* Set default value */\r
+ if(elm->default_value_set(memb_ptr2)) {\r
+ ASN__DECODE_FAILED;\r
+ }\r
+ }\r
+ }\r
+\r
+ rv.consumed = 0;\r
+ rv.code = RC_OK;\r
+ return rv;\r
+}\r
+\r
+static int\r
+SEQUENCE__handle_extensions(const asn_TYPE_descriptor_t *td, const void *sptr,\r
+ asn_per_outp_t *po1, asn_per_outp_t *po2) {\r
+ const asn_SEQUENCE_specifics_t *specs =\r
+ (const asn_SEQUENCE_specifics_t *)td->specifics;\r
+ int exts_present = 0;\r
+ int exts_count = 0;\r
+ size_t edx;\r
+\r
+ if(specs->first_extension < 0) {\r
+ return 0;\r
+ }\r
+\r
+ /* Find out which extensions are present */\r
+ for(edx = specs->first_extension; edx < td->elements_count; edx++) {\r
+ asn_TYPE_member_t *elm = &td->elements[edx];\r
+ const void *memb_ptr; /* Pointer to the member */\r
+ const void *const *memb_ptr2; /* Pointer to that pointer */\r
+ int present;\r
+\r
+ /* Fetch the pointer to this member */\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr2 =\r
+ (const void *const *)((const char *)sptr + elm->memb_offset);\r
+ present = (*memb_ptr2 != 0);\r
+ } else {\r
+ memb_ptr = (const void *)((const char *)sptr + elm->memb_offset);\r
+ memb_ptr2 = &memb_ptr;\r
+ present = 1;\r
+ }\r
+\r
+ ASN_DEBUG("checking %s:%s (@%" ASN_PRI_SIZE ") present => %d", elm->name,\r
+ elm->type->name, edx, present);\r
+ exts_count++;\r
+ exts_present += present;\r
+\r
+ /* Encode as presence marker */\r
+ if(po1 && per_put_few_bits(po1, present, 1)) {\r
+ return -1;\r
+ }\r
+ /* Encode as open type field */\r
+ if(po2 && present\r
+ && uper_open_type_put(elm->type,\r
+ elm->encoding_constraints.per_constraints,\r
+ *memb_ptr2, po2))\r
+ return -1;\r
+ }\r
+\r
+ return exts_present ? exts_count : 0;\r
+}\r
+\r
+asn_enc_rval_t\r
+SEQUENCE_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_SEQUENCE_specifics_t *specs\r
+ = (const asn_SEQUENCE_specifics_t *)td->specifics;\r
+ asn_enc_rval_t er = {0,0,0};\r
+ int n_extensions;\r
+ size_t edx;\r
+ size_t i;\r
+\r
+ (void)constraints;\r
+\r
+ if(!sptr)\r
+ ASN__ENCODE_FAILED;\r
+\r
+ er.encoded = 0;\r
+\r
+ ASN_DEBUG("Encoding %s as SEQUENCE (UPER)", td->name);\r
+\r
+ /*\r
+ * X.691#18.1 Whether structure is extensible\r
+ * and whether to encode extensions\r
+ */\r
+ if(specs->first_extension < 0) {\r
+ n_extensions = 0; /* There are no extensions to encode */\r
+ } else {\r
+ n_extensions = SEQUENCE__handle_extensions(td, sptr, 0, 0);\r
+ if(n_extensions < 0) ASN__ENCODE_FAILED;\r
+ if(per_put_few_bits(po, n_extensions ? 1 : 0, 1)) {\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+ }\r
+\r
+ /* Encode a presence bitmap */\r
+ for(i = 0; i < specs->roms_count; i++) {\r
+ asn_TYPE_member_t *elm;\r
+ const void *memb_ptr; /* Pointer to the member */\r
+ const void *const *memb_ptr2; /* Pointer to that pointer */\r
+ int present;\r
+\r
+ edx = specs->oms[i];\r
+ elm = &td->elements[edx];\r
+\r
+ /* Fetch the pointer to this member */\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr2 =\r
+ (const void *const *)((const char *)sptr + elm->memb_offset);\r
+ present = (*memb_ptr2 != 0);\r
+ } else {\r
+ memb_ptr = (const void *)((const char *)sptr + elm->memb_offset);\r
+ memb_ptr2 = &memb_ptr;\r
+ present = 1;\r
+ }\r
+\r
+ /* Eliminate default values */\r
+ if(present && elm->default_value_cmp\r
+ && elm->default_value_cmp(*memb_ptr2) == 0)\r
+ present = 0;\r
+\r
+ ASN_DEBUG("Element %s %s %s->%s is %s",\r
+ elm->flags & ATF_POINTER ? "ptr" : "inline",\r
+ elm->default_value_cmp ? "def" : "wtv",\r
+ td->name, elm->name, present ? "present" : "absent");\r
+ if(per_put_few_bits(po, present, 1))\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+\r
+ /*\r
+ * Encode the sequence ROOT elements.\r
+ */\r
+ ASN_DEBUG("first_extension = %d, elements = %d", specs->first_extension,\r
+ td->elements_count);\r
+ for(edx = 0;\r
+ edx < ((specs->first_extension < 0) ? td->elements_count\r
+ : (size_t)specs->first_extension);\r
+ edx++) {\r
+ asn_TYPE_member_t *elm = &td->elements[edx];\r
+ const void *memb_ptr; /* Pointer to the member */\r
+ const void *const *memb_ptr2; /* Pointer to that pointer */\r
+\r
+ ASN_DEBUG("About to encode %s", elm->type->name);\r
+\r
+ /* Fetch the pointer to this member */\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr2 =\r
+ (const void *const *)((const char *)sptr + elm->memb_offset);\r
+ if(!*memb_ptr2) {\r
+ ASN_DEBUG("Element %s %" ASN_PRI_SIZE " not present",\r
+ elm->name, edx);\r
+ if(elm->optional)\r
+ continue;\r
+ /* Mandatory element is missing */\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+ } else {\r
+ memb_ptr = (const void *)((const char *)sptr + elm->memb_offset);\r
+ memb_ptr2 = &memb_ptr;\r
+ }\r
+\r
+ /* Eliminate default values */\r
+ if(elm->default_value_cmp && elm->default_value_cmp(*memb_ptr2) == 0)\r
+ continue;\r
+\r
+ ASN_DEBUG("Encoding %s->%s:%s", td->name, elm->name, elm->type->name);\r
+ er = elm->type->op->uper_encoder(\r
+ elm->type, elm->encoding_constraints.per_constraints, *memb_ptr2,\r
+ po);\r
+ if(er.encoded == -1) return er;\r
+ }\r
+\r
+ /* No extensions to encode */\r
+ if(!n_extensions) ASN__ENCODED_OK(er);\r
+\r
+ ASN_DEBUG("Length of extensions %d bit-map", n_extensions);\r
+ /* #18.8. Write down the presence bit-map length. */\r
+ if(uper_put_nslength(po, n_extensions))\r
+ ASN__ENCODE_FAILED;\r
+\r
+ ASN_DEBUG("Bit-map of %d elements", n_extensions);\r
+ /* #18.7. Encoding the extensions presence bit-map. */\r
+ /* TODO: act upon NOTE in #18.7 for canonical PER */\r
+ if(SEQUENCE__handle_extensions(td, sptr, po, 0) != n_extensions)\r
+ ASN__ENCODE_FAILED;\r
+\r
+ ASN_DEBUG("Writing %d extensions", n_extensions);\r
+ /* #18.9. Encode extensions as open type fields. */\r
+ if(SEQUENCE__handle_extensions(td, sptr, 0, po) != n_extensions)\r
+ ASN__ENCODE_FAILED;\r
+\r
+ ASN__ENCODED_OK(er);\r
+}\r
+\r
+asn_dec_rval_t\r
+SEQUENCE_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_SEQUENCE_specifics_t *specs = (const asn_SEQUENCE_specifics_t *)td->specifics;\r
+ void *st = *sptr; /* Target structure. */\r
+ int extpresent; /* Extension additions are present */\r
+ uint8_t *opres; /* Presence of optional root members */\r
+ asn_per_data_t opmd;\r
+ asn_dec_rval_t rv;\r
+ size_t edx;\r
+\r
+ (void)constraints;\r
+\r
+ if(ASN__STACK_OVERFLOW_CHECK(opt_codec_ctx))\r
+ ASN__DECODE_FAILED;\r
+\r
+ if(!st) {\r
+ st = *sptr = CALLOC(1, specs->struct_size);\r
+ if(!st) ASN__DECODE_FAILED;\r
+ }\r
+\r
+ ASN_DEBUG("Decoding %s as SEQUENCE (APER)", td->name);\r
+\r
+ /* Handle extensions */\r
+ if(specs->first_extension < 0) {\r
+ extpresent = 0;\r
+ } else {\r
+ extpresent = per_get_few_bits(pd, 1);\r
+ if(extpresent < 0) ASN__DECODE_STARVED;\r
+ }\r
+\r
+ /* Prepare a place and read-in the presence bitmap */\r
+ memset(&opmd, 0, sizeof(opmd));\r
+ if(specs->roms_count) {\r
+ opres = (uint8_t *)MALLOC(((specs->roms_count + 7) >> 3) + 1);\r
+ if(!opres) ASN__DECODE_FAILED;\r
+ /* Get the presence map */\r
+ if(per_get_many_bits(pd, opres, 0, specs->roms_count)) {\r
+ FREEMEM(opres);\r
+ ASN__DECODE_STARVED;\r
+ }\r
+ opmd.buffer = opres;\r
+ opmd.nbits = specs->roms_count;\r
+ ASN_DEBUG("Read in presence bitmap for %s of %d bits (%x..)",\r
+ td->name, specs->roms_count, *opres);\r
+ } else {\r
+ opres = 0;\r
+ }\r
+\r
+ /*\r
+ * Get the sequence ROOT elements.\r
+ */\r
+ for(edx = 0; edx < td->elements_count; edx++) {\r
+ asn_TYPE_member_t *elm = &td->elements[edx];\r
+ void *memb_ptr; /* Pointer to the member */\r
+ void **memb_ptr2; /* Pointer to that pointer */\r
+#if 0\r
+ int padding;\r
+#endif\r
+\r
+ if(IN_EXTENSION_GROUP(specs, edx))\r
+ continue;\r
+\r
+ /* Fetch the pointer to this member */\r
+ if(elm->flags & ATF_POINTER) {\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
+#if 0\r
+ /* Get Padding */\r
+ padding = (8 - (pd->moved % 8)) % 8;\r
+ if(padding > 0)\r
+ ASN_DEBUG("For element %s,offset= %ld Padding bits = %d", td->name, pd->moved, padding);\r
+#if 0 /* old way of removing padding */\r
+ per_get_few_bits(pd, padding);\r
+#else /* Experimental fix proposed by @mhanna123 */\r
+ if(edx != (td->elements_count-1))\r
+ per_get_few_bits(pd, padding);\r
+ else {\r
+ if(specs->roms_count && (padding > 0))\r
+ ASN_DEBUG(">>>>> not skipping padding of %d bits for element:%ld out of %d", padding, edx, td->elements_count);\r
+ else\r
+ per_get_few_bits(pd, padding);\r
+ }\r
+#endif /* dealing with padding */\r
+#endif\r
+ /* Deal with optionality */\r
+ if(elm->optional) {\r
+ int present = per_get_few_bits(&opmd, 1);\r
+ ASN_DEBUG("Member %s->%s is optional, p=%d (%d->%d)",\r
+ td->name, elm->name, present,\r
+ (int)opmd.nboff, (int)opmd.nbits);\r
+ if(present == 0) {\r
+ /* This element is not present */\r
+ if(elm->default_value_set) {\r
+ /* Fill-in DEFAULT */\r
+ if(elm->default_value_set(memb_ptr2)) {\r
+ FREEMEM(opres);\r
+ ASN__DECODE_FAILED;\r
+ }\r
+ ASN_DEBUG("Filled-in default");\r
+ }\r
+ /* The member is just not present */\r
+ continue;\r
+ }\r
+ /* Fall through */\r
+ }\r
+\r
+ /* Fetch the member from the stream */\r
+ ASN_DEBUG("Decoding member \"%s\" in %s", elm->name, td->name);\r
+\r
+ if(elm->flags & ATF_OPEN_TYPE) {\r
+ rv = OPEN_TYPE_aper_get(opt_codec_ctx, td, st, elm, pd);\r
+ } else {\r
+ rv = elm->type->op->aper_decoder(opt_codec_ctx, elm->type,\r
+ elm->encoding_constraints.per_constraints, memb_ptr2, pd);\r
+ }\r
+ if(rv.code != RC_OK) {\r
+ ASN_DEBUG("Failed decode %s in %s",\r
+ elm->name, td->name);\r
+ FREEMEM(opres);\r
+ return rv;\r
+ }\r
+ }\r
+\r
+ /* Optionality map is not needed anymore */\r
+ FREEMEM(opres);\r
+\r
+ /*\r
+ * Deal with extensions.\r
+ */\r
+ if(extpresent) {\r
+ ssize_t bmlength;\r
+ uint8_t *epres; /* Presence of extension members */\r
+ asn_per_data_t epmd;\r
+\r
+ bmlength = aper_get_nslength(pd);\r
+ if(bmlength < 0) ASN__DECODE_STARVED;\r
+\r
+ ASN_DEBUG("Extensions %" ASN_PRI_SSIZE " present in %s", bmlength, td->name);\r
+\r
+ epres = (uint8_t *)MALLOC((bmlength + 15) >> 3);\r
+ if(!epres) ASN__DECODE_STARVED;\r
+\r
+ /* Get the extensions map */\r
+ if(per_get_many_bits(pd, epres, 0, bmlength))\r
+ ASN__DECODE_STARVED;\r
+\r
+ memset(&epmd, 0, sizeof(epmd));\r
+ epmd.buffer = epres;\r
+ epmd.nbits = bmlength;\r
+ ASN_DEBUG("Read in extensions bitmap for %s of %ld bits (%x..)",\r
+ td->name, bmlength, *epres);\r
+\r
+ /* Go over extensions and read them in */\r
+ for(edx = specs->first_extension; edx < td->elements_count; edx++) {\r
+ asn_TYPE_member_t *elm = &td->elements[edx];\r
+ void *memb_ptr; /* Pointer to the member */\r
+ void **memb_ptr2; /* Pointer to that pointer */\r
+ int present;\r
+\r
+ if(!IN_EXTENSION_GROUP(specs, edx)) {\r
+ ASN_DEBUG("%ld is not extension", edx);\r
+ continue;\r
+ }\r
+\r
+ /* Fetch the pointer to this member */\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr2 = (void **)((char *)st + elm->memb_offset);\r
+ } else {\r
+ memb_ptr = (void *)((char *)st + elm->memb_offset);\r
+ memb_ptr2 = &memb_ptr;\r
+ }\r
+\r
+ present = per_get_few_bits(&epmd, 1);\r
+ if(present <= 0) {\r
+ if(present < 0) break; /* No more extensions */\r
+ continue;\r
+ }\r
+\r
+ ASN_DEBUG("Decoding member %s in %s %p", elm->name, td->name, *memb_ptr2);\r
+ rv = aper_open_type_get(opt_codec_ctx, elm->type,\r
+ elm->encoding_constraints.per_constraints, memb_ptr2, pd);\r
+ if(rv.code != RC_OK) {\r
+ FREEMEM(epres);\r
+ return rv;\r
+ }\r
+ }\r
+\r
+ /* Skip over overflow extensions which aren't present\r
+ * in this system's version of the protocol */\r
+ for(;;) {\r
+ ASN_DEBUG("Getting overflow extensions");\r
+ switch(per_get_few_bits(&epmd, 1)) {\r
+ case -1:\r
+ break;\r
+ case 0:\r
+ continue;\r
+ default:\r
+ if(aper_open_type_skip(opt_codec_ctx, pd)) {\r
+ FREEMEM(epres);\r
+ ASN__DECODE_STARVED;\r
+ }\r
+ }\r
+ break;\r
+ }\r
+\r
+ FREEMEM(epres);\r
+ }\r
+\r
+ /* Fill DEFAULT members in extensions */\r
+ for(edx = specs->roms_count; edx < specs->roms_count\r
+ + specs->aoms_count; edx++) {\r
+ asn_TYPE_member_t *elm = &td->elements[edx];\r
+ void **memb_ptr2; /* Pointer to member pointer */\r
+\r
+ if(!elm->default_value_set) continue;\r
+\r
+ /* Fetch the pointer to this member */\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr2 = (void **)((char *)st\r
+ + elm->memb_offset);\r
+ if(*memb_ptr2) continue;\r
+ } else {\r
+ continue; /* Extensions are all optionals */\r
+ }\r
+\r
+ /* Set default value */\r
+ if(elm->default_value_set(memb_ptr2)) {\r
+ ASN__DECODE_FAILED;\r
+ }\r
+ }\r
+\r
+ rv.consumed = 0;\r
+ rv.code = RC_OK;\r
+ return rv;\r
+}\r
+\r
+static int\r
+SEQUENCE_handle_extensions_aper(const asn_TYPE_descriptor_t *td,\r
+ const void *sptr,\r
+ asn_per_outp_t *po1, asn_per_outp_t *po2) {\r
+ const asn_SEQUENCE_specifics_t *specs\r
+ = (const asn_SEQUENCE_specifics_t *)td->specifics;\r
+ int exts_present = 0;\r
+ int exts_count = 0;\r
+ size_t edx;\r
+\r
+ if(specs->first_extension < 0) {\r
+ return 0;\r
+ }\r
+\r
+ /* Find out which extensions are present */\r
+ for(edx = specs->first_extension; edx < td->elements_count; edx++) {\r
+ asn_TYPE_member_t *elm = &td->elements[edx];\r
+ const void *memb_ptr; /* Pointer to the member */\r
+ const void * const *memb_ptr2; /* Pointer to that pointer */\r
+ int present;\r
+\r
+ if(!IN_EXTENSION_GROUP(specs, edx)) {\r
+ ASN_DEBUG("%s (@%ld) is not extension", elm->type->name, edx);\r
+ continue;\r
+ }\r
+\r
+ /* Fetch the pointer to this member */\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr2 = (const void * const *)((const char *)sptr + elm->memb_offset);\r
+ present = (*memb_ptr2 != 0);\r
+ } else {\r
+ memb_ptr = (const void *)((const char *)sptr + elm->memb_offset);\r
+ memb_ptr2 = &memb_ptr;\r
+ present = 1;\r
+ }\r
+\r
+ ASN_DEBUG("checking %s (@%ld) present => %d",\r
+ elm->type->name, edx, present);\r
+ exts_count++;\r
+ exts_present += present;\r
+\r
+ /* Encode as presence marker */\r
+ if(po1 && per_put_few_bits(po1, present, 1))\r
+ return -1;\r
+ /* Encode as open type field */\r
+ if(po2 && present && aper_open_type_put(elm->type,\r
+ elm->encoding_constraints.per_constraints, *memb_ptr2, po2))\r
+ return -1;\r
+\r
+ }\r
+\r
+ return exts_present ? exts_count : 0;\r
+}\r
+\r
+asn_enc_rval_t\r
+SEQUENCE_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_SEQUENCE_specifics_t *specs\r
+ = (const asn_SEQUENCE_specifics_t *)td->specifics;\r
+ asn_enc_rval_t er = {0,0,0};\r
+ int n_extensions;\r
+ size_t edx;\r
+ size_t i;\r
+\r
+ (void)constraints;\r
+\r
+ if(!sptr)\r
+ ASN__ENCODE_FAILED;\r
+\r
+ er.encoded = 0;\r
+\r
+ ASN_DEBUG("Encoding %s as SEQUENCE (APER)", td->name);\r
+\r
+ /*\r
+ * X.691#18.1 Whether structure is extensible\r
+ * and whether to encode extensions\r
+ */\r
+ if(specs->first_extension < 0) {\r
+ n_extensions = 0; /* There are no extensions to encode */\r
+ } else {\r
+ n_extensions = SEQUENCE_handle_extensions_aper(td, sptr, 0, 0);\r
+ if(n_extensions < 0) ASN__ENCODE_FAILED;\r
+ if(per_put_few_bits(po, n_extensions ? 1 : 0, 1)) {\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+ }\r
+\r
+ /* Encode a presence bitmap */\r
+ for(i = 0; i < specs->roms_count; i++) {\r
+ asn_TYPE_member_t *elm;\r
+ const void *memb_ptr; /* Pointer to the member */\r
+ const void * const *memb_ptr2; /* Pointer to that pointer */\r
+ int present;\r
+\r
+ edx = specs->oms[i];\r
+ elm = &td->elements[edx];\r
+\r
+ /* Fetch the pointer to this member */\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr2 = (const void * const *)((const char *)sptr + elm->memb_offset);\r
+ present = (*memb_ptr2 != 0);\r
+ } else {\r
+ memb_ptr = (const void *)((const char *)sptr + elm->memb_offset);\r
+ memb_ptr2 = &memb_ptr;\r
+ present = 1;\r
+ }\r
+\r
+ /* Eliminate default values */\r
+ if(present && elm->default_value_cmp\r
+ && elm->default_value_cmp(memb_ptr2) == 1)\r
+ present = 0;\r
+\r
+ ASN_DEBUG("Element %s %s %s->%s is %s",\r
+ elm->flags & ATF_POINTER ? "ptr" : "inline",\r
+ elm->default_value_cmp ? "def" : "wtv",\r
+ td->name, elm->name, present ? "present" : "absent");\r
+ if(per_put_few_bits(po, present, 1))\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+\r
+ /*\r
+ * Encode the sequence ROOT elements.\r
+ */\r
+ ASN_DEBUG("first_extension = %d, elements = %d", specs->first_extension,\r
+ td->elements_count);\r
+ for(edx = 0;\r
+ edx < ((specs->first_extension < 0) ? td->elements_count\r
+ : (size_t)specs->first_extension);\r
+ edx++) {\r
+ asn_TYPE_member_t *elm = &td->elements[edx];\r
+ const void *memb_ptr; /* Pointer to the member */\r
+ const void * const *memb_ptr2; /* Pointer to that pointer */\r
+\r
+ if(IN_EXTENSION_GROUP(specs, edx))\r
+ continue;\r
+\r
+ ASN_DEBUG("About to encode %s", elm->type->name);\r
+\r
+ /* Fetch the pointer to this member */\r
+ if(elm->flags & ATF_POINTER) {\r
+ memb_ptr2 = (const void * const *)((const char *)sptr + elm->memb_offset);\r
+ if(!*memb_ptr2) {\r
+ ASN_DEBUG("Element %s %ld not present",\r
+ elm->name, edx);\r
+ if(elm->optional)\r
+ continue;\r
+ /* Mandatory element is missing */\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+ } else {\r
+ memb_ptr = (const void *)((const char *)sptr + elm->memb_offset);\r
+ memb_ptr2 = &memb_ptr;\r
+ }\r
+\r
+ /* Eliminate default values */\r
+ if(elm->default_value_cmp && elm->default_value_cmp(memb_ptr2) == 1)\r
+ continue;\r
+\r
+ ASN_DEBUG("Encoding %s->%s", td->name, elm->name);\r
+ er = elm->type->op->aper_encoder(elm->type, elm->encoding_constraints.per_constraints,\r
+ *memb_ptr2, po);\r
+ if(er.encoded == -1)\r
+ return er;\r
+ }\r
+\r
+ /* No extensions to encode */\r
+ if(!n_extensions) ASN__ENCODED_OK(er);\r
+\r
+ ASN_DEBUG("Length of %d bit-map", n_extensions);\r
+ /* #18.8. Write down the presence bit-map length. */\r
+ if(aper_put_nslength(po, n_extensions))\r
+ ASN__ENCODE_FAILED;\r
+\r
+ ASN_DEBUG("Bit-map of %d elements", n_extensions);\r
+ /* #18.7. Encoding the extensions presence bit-map. */\r
+ /* TODO: act upon NOTE in #18.7 for canonical PER */\r
+ if(SEQUENCE_handle_extensions_aper(td, sptr, po, 0) != n_extensions)\r
+ ASN__ENCODE_FAILED;\r
+\r
+ ASN_DEBUG("Writing %d extensions", n_extensions);\r
+ /* #18.9. Encode extensions as open type fields. */\r
+ if(SEQUENCE_handle_extensions_aper(td, sptr, 0, po) != n_extensions)\r
+ ASN__ENCODE_FAILED;\r
+\r
+ ASN__ENCODED_OK(er);\r
+}\r
+\r
+#endif /* ASN_DISABLE_PER_SUPPORT */\r
+\r
+int\r
+SEQUENCE_compare(const asn_TYPE_descriptor_t *td, const void *aptr,\r
+ const void *bptr) {\r
+ size_t edx;\r
+\r
+ for(edx = 0; edx < td->elements_count; edx++) {\r
+ asn_TYPE_member_t *elm = &td->elements[edx];\r
+ const void *amemb;\r
+ const void *bmemb;\r
+ int ret;\r
+\r
+ if(elm->flags & ATF_POINTER) {\r
+ amemb =\r
+ *(const void *const *)((const char *)aptr + elm->memb_offset);\r
+ bmemb =\r
+ *(const void *const *)((const char *)bptr + elm->memb_offset);\r
+ if(!amemb) {\r
+ if(!bmemb) continue;\r
+ if(elm->default_value_cmp\r
+ && elm->default_value_cmp(bmemb) == 0) {\r
+ /* A is absent, but B is present and equal to DEFAULT */\r
+ continue;\r
+ }\r
+ return -1;\r
+ } else if(!bmemb) {\r
+ if(elm->default_value_cmp\r
+ && elm->default_value_cmp(amemb) == 0) {\r
+ /* B is absent, but A is present and equal to DEFAULT */\r
+ continue;\r
+ }\r
+ return 1;\r
+ }\r
+ } else {\r
+ amemb = (const void *)((const char *)aptr + elm->memb_offset);\r
+ bmemb = (const void *)((const char *)bptr + elm->memb_offset);\r
+ }\r
+\r
+ ret = elm->type->op->compare_struct(elm->type, amemb, bmemb);\r
+ if(ret != 0) return ret;\r
+ }\r
+\r
+ return 0;\r
+}\r
+\r
+asn_TYPE_operation_t asn_OP_SEQUENCE = {\r
+ SEQUENCE_free,\r
+ SEQUENCE_print,\r
+ SEQUENCE_compare,\r
+ SEQUENCE_decode_ber,\r
+ SEQUENCE_encode_der,\r
+ SEQUENCE_decode_xer,\r
+ SEQUENCE_encode_xer,\r
+#ifdef ASN_DISABLE_OER_SUPPORT\r
+ 0,\r
+ 0,\r
+#else\r
+ SEQUENCE_decode_oer,\r
+ SEQUENCE_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
+ SEQUENCE_decode_uper,\r
+ SEQUENCE_encode_uper,\r
+ SEQUENCE_decode_aper,\r
+ SEQUENCE_encode_aper,\r
+#endif /* ASN_DISABLE_PER_SUPPORT */\r
+ SEQUENCE_random_fill,\r
+ 0 /* Use generic outmost tag fetcher */\r
+};\r
+\r
+\r
+asn_random_fill_result_t\r
+SEQUENCE_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_SEQUENCE_specifics_t *specs =\r
+ (const asn_SEQUENCE_specifics_t *)td->specifics;\r
+ asn_random_fill_result_t result_ok = {ARFILL_OK, 0};\r
+ asn_random_fill_result_t result_failed = {ARFILL_FAILED, 0};\r
+ asn_random_fill_result_t result_skipped = {ARFILL_SKIPPED, 0};\r
+ void *st = *sptr;\r
+ size_t edx;\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
+ for(edx = 0; edx < td->elements_count; edx++) {\r
+ const asn_TYPE_member_t *elm = &td->elements[edx];\r
+ void *memb_ptr; /* Pointer to the member */\r
+ void **memb_ptr2; /* Pointer to that pointer */\r
+ asn_random_fill_result_t tmpres;\r
+\r
+ if(elm->optional && asn_random_between(0, 4) == 2) {\r
+ /* Sometimes decide not to fill the optional value */\r
+ continue;\r
+ }\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
+ tmpres = elm->type->op->random_fill(\r
+ elm->type, memb_ptr2, &elm->encoding_constraints,\r
+ max_length > result_ok.length ? max_length - result_ok.length : 0);\r
+ switch(tmpres.code) {\r
+ case ARFILL_OK:\r
+ result_ok.length += tmpres.length;\r
+ continue;\r
+ case ARFILL_SKIPPED:\r
+ assert(!(elm->flags & ATF_POINTER) || *memb_ptr2 == NULL);\r
+ continue;\r
+ case ARFILL_FAILED:\r
+ if(st == *sptr) {\r
+ ASN_STRUCT_RESET(*td, st);\r
+ } else {\r
+ ASN_STRUCT_FREE(*td, st);\r
+ }\r
+ return tmpres;\r
+ }\r
+ }\r
+\r
+ *sptr = st;\r
+\r
+ return result_ok;\r
+}\r
+\r
Code Review / ric-app / kpimon.git / blobdiff