--- /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 <OCTET_STRING.h>\r
+#include <BIT_STRING.h> /* for .bits_unused member */\r
+#include <errno.h>\r
+\r
+/*\r
+ * OCTET STRING basic type description.\r
+ */\r
+static const ber_tlv_tag_t asn_DEF_OCTET_STRING_tags[] = {\r
+ (ASN_TAG_CLASS_UNIVERSAL | (4 << 2))\r
+};\r
+asn_OCTET_STRING_specifics_t asn_SPC_OCTET_STRING_specs = {\r
+ sizeof(OCTET_STRING_t),\r
+ offsetof(OCTET_STRING_t, _asn_ctx),\r
+ ASN_OSUBV_STR\r
+};\r
+\r
+asn_TYPE_operation_t asn_OP_OCTET_STRING = {\r
+ OCTET_STRING_free,\r
+ OCTET_STRING_print, /* OCTET STRING generally means a non-ascii sequence */\r
+ OCTET_STRING_compare,\r
+ OCTET_STRING_decode_ber,\r
+ OCTET_STRING_encode_der,\r
+ OCTET_STRING_decode_xer_hex,\r
+ OCTET_STRING_encode_xer,\r
+#ifdef ASN_DISABLE_OER_SUPPORT\r
+ 0,\r
+ 0,\r
+#else\r
+ OCTET_STRING_decode_oer,\r
+ OCTET_STRING_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
+ OCTET_STRING_decode_uper, /* Unaligned PER decoder */\r
+ OCTET_STRING_encode_uper, /* Unaligned PER encoder */\r
+ OCTET_STRING_decode_aper, /* Aligned PER decoder */\r
+ OCTET_STRING_encode_aper, /* Aligned PER encoder */\r
+#endif /* ASN_DISABLE_PER_SUPPORT */\r
+ OCTET_STRING_random_fill,\r
+ 0 /* Use generic outmost tag fetcher */\r
+};\r
+asn_TYPE_descriptor_t asn_DEF_OCTET_STRING = {\r
+ "OCTET STRING", /* Canonical name */\r
+ "OCTET_STRING", /* XML tag name */\r
+ &asn_OP_OCTET_STRING,\r
+ asn_DEF_OCTET_STRING_tags,\r
+ sizeof(asn_DEF_OCTET_STRING_tags)\r
+ / sizeof(asn_DEF_OCTET_STRING_tags[0]),\r
+ asn_DEF_OCTET_STRING_tags, /* Same as above */\r
+ sizeof(asn_DEF_OCTET_STRING_tags)\r
+ / sizeof(asn_DEF_OCTET_STRING_tags[0]),\r
+ { 0, 0, asn_generic_no_constraint },\r
+ 0, 0, /* No members */\r
+ &asn_SPC_OCTET_STRING_specs\r
+};\r
+\r
+#undef _CH_PHASE\r
+#undef NEXT_PHASE\r
+#undef PREV_PHASE\r
+#define _CH_PHASE(ctx, inc) do { \\r
+ if(ctx->phase == 0) \\r
+ ctx->context = 0; \\r
+ ctx->phase += inc; \\r
+ } while(0)\r
+#define NEXT_PHASE(ctx) _CH_PHASE(ctx, +1)\r
+#define PREV_PHASE(ctx) _CH_PHASE(ctx, -1)\r
+\r
+#undef ADVANCE\r
+#define ADVANCE(num_bytes) do { \\r
+ size_t num = (num_bytes); \\r
+ buf_ptr = ((const char *)buf_ptr) + num; \\r
+ size -= num; \\r
+ consumed_myself += num; \\r
+ } while(0)\r
+\r
+#undef RETURN\r
+#define RETURN(_code) do { \\r
+ asn_dec_rval_t tmprval; \\r
+ tmprval.code = _code; \\r
+ tmprval.consumed = consumed_myself; \\r
+ return tmprval; \\r
+ } while(0)\r
+\r
+#undef APPEND\r
+#define APPEND(bufptr, bufsize) do { \\r
+ size_t _bs = (bufsize); /* Append size */ \\r
+ size_t _ns = ctx->context; /* Allocated now */ \\r
+ size_t _es = st->size + _bs; /* Expected size */ \\r
+ /* int is really a typeof(st->size): */ \\r
+ if((int)_es < 0) RETURN(RC_FAIL); \\r
+ if(_ns <= _es) { \\r
+ void *ptr; \\r
+ /* Be nice and round to the memory allocator */ \\r
+ do { _ns = _ns ? _ns << 1 : 16; } \\r
+ while(_ns <= _es); \\r
+ /* int is really a typeof(st->size): */ \\r
+ if((int)_ns < 0) RETURN(RC_FAIL); \\r
+ ptr = REALLOC(st->buf, _ns); \\r
+ if(ptr) { \\r
+ st->buf = (uint8_t *)ptr; \\r
+ ctx->context = _ns; \\r
+ } else { \\r
+ RETURN(RC_FAIL); \\r
+ } \\r
+ ASN_DEBUG("Reallocating into %ld", (long)_ns); \\r
+ } \\r
+ memcpy(st->buf + st->size, bufptr, _bs); \\r
+ /* Convenient nul-termination */ \\r
+ st->buf[_es] = '\0'; \\r
+ st->size = _es; \\r
+ } while(0)\r
+\r
+/*\r
+ * The main reason why ASN.1 is still alive is that too much time and effort\r
+ * is necessary for learning it more or less adequately, thus creating a gut\r
+ * necessity to demonstrate that aquired skill everywhere afterwards.\r
+ * No, I am not going to explain what the following stuff is.\r
+ */\r
+struct _stack_el {\r
+ ber_tlv_len_t left; /* What's left to read (or -1) */\r
+ ber_tlv_len_t got; /* What was actually processed */\r
+ unsigned cont_level; /* Depth of subcontainment */\r
+ int want_nulls; /* Want null "end of content" octets? */\r
+ int bits_chopped; /* Flag in BIT STRING mode */\r
+ ber_tlv_tag_t tag; /* For debugging purposes */\r
+ struct _stack_el *prev;\r
+ struct _stack_el *next;\r
+};\r
+struct _stack {\r
+ struct _stack_el *tail;\r
+ struct _stack_el *cur_ptr;\r
+};\r
+\r
+static struct _stack_el *\r
+OS__add_stack_el(struct _stack *st) {\r
+ struct _stack_el *nel;\r
+\r
+ /*\r
+ * Reuse the old stack frame or allocate a new one.\r
+ */\r
+ if(st->cur_ptr && st->cur_ptr->next) {\r
+ nel = st->cur_ptr->next;\r
+ nel->bits_chopped = 0;\r
+ nel->got = 0;\r
+ /* Retain the nel->cont_level, it's correct. */\r
+ } else {\r
+ nel = (struct _stack_el *)CALLOC(1, sizeof(struct _stack_el));\r
+ if(nel == NULL)\r
+ return NULL;\r
+ \r
+ if(st->tail) {\r
+ /* Increase a subcontainment depth */\r
+ nel->cont_level = st->tail->cont_level + 1;\r
+ st->tail->next = nel;\r
+ }\r
+ nel->prev = st->tail;\r
+ st->tail = nel;\r
+ }\r
+\r
+ st->cur_ptr = nel;\r
+\r
+ return nel;\r
+}\r
+\r
+static struct _stack *\r
+_new_stack(void) {\r
+ return (struct _stack *)CALLOC(1, sizeof(struct _stack));\r
+}\r
+\r
+/*\r
+ * Decode OCTET STRING type.\r
+ */\r
+asn_dec_rval_t\r
+OCTET_STRING_decode_ber(const asn_codec_ctx_t *opt_codec_ctx,\r
+ const asn_TYPE_descriptor_t *td, void **sptr,\r
+ const void *buf_ptr, size_t size, int tag_mode) {\r
+ const asn_OCTET_STRING_specifics_t *specs = td->specifics\r
+ ? (const asn_OCTET_STRING_specifics_t *)td->specifics\r
+ : &asn_SPC_OCTET_STRING_specs;\r
+ BIT_STRING_t *st = (BIT_STRING_t *)*sptr;\r
+ asn_dec_rval_t rval;\r
+ asn_struct_ctx_t *ctx;\r
+ ssize_t consumed_myself = 0;\r
+ struct _stack *stck; /* Expectations stack structure */\r
+ struct _stack_el *sel = 0; /* Stack element */\r
+ int tlv_constr;\r
+ enum asn_OS_Subvariant type_variant = specs->subvariant;\r
+\r
+ ASN_DEBUG("Decoding %s as %s (frame %ld)",\r
+ td->name,\r
+ (type_variant == ASN_OSUBV_STR) ?\r
+ "OCTET STRING" : "OS-SpecialCase",\r
+ (long)size);\r
+\r
+ /*\r
+ * Create the string if does not exist.\r
+ */\r
+ if(st == NULL) {\r
+ st = (BIT_STRING_t *)(*sptr = CALLOC(1, specs->struct_size));\r
+ if(st == NULL) RETURN(RC_FAIL);\r
+ }\r
+\r
+ /* Restore parsing context */\r
+ ctx = (asn_struct_ctx_t *)((char *)st + specs->ctx_offset);\r
+\r
+ switch(ctx->phase) {\r
+ case 0:\r
+ /*\r
+ * Check tags.\r
+ */\r
+ rval = ber_check_tags(opt_codec_ctx, td, ctx,\r
+ buf_ptr, size, tag_mode, -1,\r
+ &ctx->left, &tlv_constr);\r
+ if(rval.code != RC_OK)\r
+ return rval;\r
+\r
+ if(tlv_constr) {\r
+ /*\r
+ * Complex operation, requires stack of expectations.\r
+ */\r
+ ctx->ptr = _new_stack();\r
+ if(!ctx->ptr) {\r
+ RETURN(RC_FAIL);\r
+ }\r
+ } else {\r
+ /*\r
+ * Jump into stackless primitive decoding.\r
+ */\r
+ _CH_PHASE(ctx, 3);\r
+ if(type_variant == ASN_OSUBV_ANY && tag_mode != 1)\r
+ APPEND(buf_ptr, rval.consumed);\r
+ ADVANCE(rval.consumed);\r
+ goto phase3;\r
+ }\r
+\r
+ NEXT_PHASE(ctx);\r
+ /* Fall through */\r
+ case 1:\r
+ phase1:\r
+ /*\r
+ * Fill the stack with expectations.\r
+ */\r
+ stck = (struct _stack *)ctx->ptr;\r
+ sel = stck->cur_ptr;\r
+ do {\r
+ ber_tlv_tag_t tlv_tag;\r
+ ber_tlv_len_t tlv_len;\r
+ ber_tlv_tag_t expected_tag;\r
+ ssize_t tl, ll, tlvl;\r
+ /* This one works even if (sel->left == -1) */\r
+ size_t Left = ((!sel||(size_t)sel->left >= size)\r
+ ?size:(size_t)sel->left);\r
+\r
+\r
+ ASN_DEBUG("%p, s->l=%ld, s->wn=%ld, s->g=%ld\n", (void *)sel,\r
+ (long)(sel?sel->left:0),\r
+ (long)(sel?sel->want_nulls:0),\r
+ (long)(sel?sel->got:0)\r
+ );\r
+ if(sel && sel->left <= 0 && sel->want_nulls == 0) {\r
+ if(sel->prev) {\r
+ struct _stack_el *prev = sel->prev;\r
+ if(prev->left != -1) {\r
+ if(prev->left < sel->got)\r
+ RETURN(RC_FAIL);\r
+ prev->left -= sel->got;\r
+ }\r
+ prev->got += sel->got;\r
+ sel = stck->cur_ptr = prev;\r
+ if(!sel) break;\r
+ tlv_constr = 1;\r
+ continue;\r
+ } else {\r
+ sel = stck->cur_ptr = 0;\r
+ break; /* Nothing to wait */\r
+ }\r
+ }\r
+\r
+ tl = ber_fetch_tag(buf_ptr, Left, &tlv_tag);\r
+ ASN_DEBUG("fetch tag(size=%ld,L=%ld), %sstack, left=%ld, wn=%ld, tl=%ld",\r
+ (long)size, (long)Left, sel?"":"!",\r
+ (long)(sel?sel->left:0),\r
+ (long)(sel?sel->want_nulls:0),\r
+ (long)tl);\r
+ switch(tl) {\r
+ case -1: RETURN(RC_FAIL);\r
+ case 0: RETURN(RC_WMORE);\r
+ }\r
+\r
+ tlv_constr = BER_TLV_CONSTRUCTED(buf_ptr);\r
+\r
+ ll = ber_fetch_length(tlv_constr,\r
+ (const char *)buf_ptr + tl,Left - tl,&tlv_len);\r
+ ASN_DEBUG("Got tag=%s, tc=%d, left=%ld, tl=%ld, len=%ld, ll=%ld",\r
+ ber_tlv_tag_string(tlv_tag), tlv_constr,\r
+ (long)Left, (long)tl, (long)tlv_len, (long)ll);\r
+ switch(ll) {\r
+ case -1: RETURN(RC_FAIL);\r
+ case 0: RETURN(RC_WMORE);\r
+ }\r
+\r
+ if(sel && sel->want_nulls\r
+ && ((const uint8_t *)buf_ptr)[0] == 0\r
+ && ((const uint8_t *)buf_ptr)[1] == 0)\r
+ {\r
+\r
+ ASN_DEBUG("Eat EOC; wn=%d--", sel->want_nulls);\r
+\r
+ if(type_variant == ASN_OSUBV_ANY\r
+ && (tag_mode != 1 || sel->cont_level))\r
+ APPEND("\0\0", 2);\r
+\r
+ ADVANCE(2);\r
+ sel->got += 2;\r
+ if(sel->left != -1) {\r
+ sel->left -= 2; /* assert(sel->left >= 2) */\r
+ }\r
+\r
+ sel->want_nulls--;\r
+ if(sel->want_nulls == 0) {\r
+ /* Move to the next expectation */\r
+ sel->left = 0;\r
+ tlv_constr = 1;\r
+ }\r
+\r
+ continue;\r
+ }\r
+\r
+ /*\r
+ * Set up expected tags,\r
+ * depending on ASN.1 type being decoded.\r
+ */\r
+ switch(type_variant) {\r
+ case ASN_OSUBV_BIT:\r
+ /* X.690: 8.6.4.1, NOTE 2 */\r
+ /* Fall through */\r
+ case ASN_OSUBV_STR:\r
+ default:\r
+ if(sel) {\r
+ unsigned level = sel->cont_level;\r
+ if(level < td->all_tags_count) {\r
+ expected_tag = td->all_tags[level];\r
+ break;\r
+ } else if(td->all_tags_count) {\r
+ expected_tag = td->all_tags\r
+ [td->all_tags_count - 1];\r
+ break;\r
+ }\r
+ /* else, Fall through */\r
+ }\r
+ /* Fall through */\r
+ case ASN_OSUBV_ANY:\r
+ expected_tag = tlv_tag;\r
+ break;\r
+ }\r
+\r
+\r
+ if(tlv_tag != expected_tag) {\r
+ char buf[2][32];\r
+ ber_tlv_tag_snprint(tlv_tag,\r
+ buf[0], sizeof(buf[0]));\r
+ ber_tlv_tag_snprint(td->tags[td->tags_count-1],\r
+ buf[1], sizeof(buf[1]));\r
+ ASN_DEBUG("Tag does not match expectation: %s != %s",\r
+ buf[0], buf[1]);\r
+ RETURN(RC_FAIL);\r
+ }\r
+\r
+ tlvl = tl + ll; /* Combined length of T and L encoding */\r
+ if((tlv_len + tlvl) < 0) {\r
+ /* tlv_len value is too big */\r
+ ASN_DEBUG("TLV encoding + length (%ld) is too big",\r
+ (long)tlv_len);\r
+ RETURN(RC_FAIL);\r
+ }\r
+\r
+ /*\r
+ * Append a new expectation.\r
+ */\r
+ sel = OS__add_stack_el(stck);\r
+ if(!sel) RETURN(RC_FAIL);\r
+\r
+ sel->tag = tlv_tag;\r
+\r
+ sel->want_nulls = (tlv_len==-1);\r
+ if(sel->prev && sel->prev->left != -1) {\r
+ /* Check that the parent frame is big enough */\r
+ if(sel->prev->left < tlvl + (tlv_len==-1?0:tlv_len))\r
+ RETURN(RC_FAIL);\r
+ if(tlv_len == -1)\r
+ sel->left = sel->prev->left - tlvl;\r
+ else\r
+ sel->left = tlv_len;\r
+ } else {\r
+ sel->left = tlv_len;\r
+ }\r
+ if(type_variant == ASN_OSUBV_ANY\r
+ && (tag_mode != 1 || sel->cont_level))\r
+ APPEND(buf_ptr, tlvl);\r
+ sel->got += tlvl;\r
+ ADVANCE(tlvl);\r
+\r
+ ASN_DEBUG("+EXPECT2 got=%ld left=%ld, wn=%d, clvl=%u",\r
+ (long)sel->got, (long)sel->left,\r
+ sel->want_nulls, sel->cont_level);\r
+\r
+ } while(tlv_constr);\r
+ if(sel == NULL) {\r
+ /* Finished operation, "phase out" */\r
+ ASN_DEBUG("Phase out");\r
+ _CH_PHASE(ctx, +3);\r
+ break;\r
+ }\r
+\r
+ NEXT_PHASE(ctx);\r
+ /* Fall through */\r
+ case 2:\r
+ stck = (struct _stack *)ctx->ptr;\r
+ sel = stck->cur_ptr;\r
+ ASN_DEBUG("Phase 2: Need %ld bytes, size=%ld, alrg=%ld, wn=%d",\r
+ (long)sel->left, (long)size, (long)sel->got,\r
+ sel->want_nulls);\r
+ {\r
+ ber_tlv_len_t len;\r
+\r
+ assert(sel->left >= 0);\r
+\r
+ len = ((ber_tlv_len_t)size < sel->left)\r
+ ? (ber_tlv_len_t)size : sel->left;\r
+ if(len > 0) {\r
+ if(type_variant == ASN_OSUBV_BIT\r
+ && sel->bits_chopped == 0) {\r
+ /* Put the unused-bits-octet away */\r
+ st->bits_unused = *(const uint8_t *)buf_ptr;\r
+ APPEND(((const char *)buf_ptr+1), (len - 1));\r
+ sel->bits_chopped = 1;\r
+ } else {\r
+ APPEND(buf_ptr, len);\r
+ }\r
+ ADVANCE(len);\r
+ sel->left -= len;\r
+ sel->got += len;\r
+ }\r
+\r
+ if(sel->left) {\r
+ ASN_DEBUG("OS left %ld, size = %ld, wn=%d\n",\r
+ (long)sel->left, (long)size, sel->want_nulls);\r
+ RETURN(RC_WMORE);\r
+ }\r
+\r
+ PREV_PHASE(ctx);\r
+ goto phase1;\r
+ }\r
+ break;\r
+ case 3:\r
+ phase3:\r
+ /*\r
+ * Primitive form, no stack required.\r
+ */\r
+ assert(ctx->left >= 0);\r
+\r
+ if(size < (size_t)ctx->left) {\r
+ if(!size) RETURN(RC_WMORE);\r
+ if(type_variant == ASN_OSUBV_BIT && !ctx->context) {\r
+ st->bits_unused = *(const uint8_t *)buf_ptr;\r
+ ctx->left--;\r
+ ADVANCE(1);\r
+ }\r
+ APPEND(buf_ptr, size);\r
+ assert(ctx->context > 0);\r
+ ctx->left -= size;\r
+ ADVANCE(size);\r
+ RETURN(RC_WMORE);\r
+ } else {\r
+ if(type_variant == ASN_OSUBV_BIT\r
+ && !ctx->context && ctx->left) {\r
+ st->bits_unused = *(const uint8_t *)buf_ptr;\r
+ ctx->left--;\r
+ ADVANCE(1);\r
+ }\r
+ APPEND(buf_ptr, ctx->left);\r
+ ADVANCE(ctx->left);\r
+ ctx->left = 0;\r
+\r
+ NEXT_PHASE(ctx);\r
+ }\r
+ break;\r
+ }\r
+\r
+ if(sel) {\r
+ ASN_DEBUG("3sel p=%p, wn=%d, l=%ld, g=%ld, size=%ld",\r
+ (void *)sel->prev, sel->want_nulls,\r
+ (long)sel->left, (long)sel->got, (long)size);\r
+ if(sel->prev || sel->want_nulls > 1 || sel->left > 0) {\r
+ RETURN(RC_WMORE);\r
+ }\r
+ }\r
+\r
+ /*\r
+ * BIT STRING-specific processing.\r
+ */\r
+ if(type_variant == ASN_OSUBV_BIT) {\r
+ if(st->size) {\r
+ if(st->bits_unused < 0 || st->bits_unused > 7) {\r
+ RETURN(RC_FAIL);\r
+ }\r
+ /* Finalize BIT STRING: zero out unused bits. */\r
+ st->buf[st->size-1] &= 0xff << st->bits_unused;\r
+ } else {\r
+ if(st->bits_unused) {\r
+ RETURN(RC_FAIL);\r
+ }\r
+ }\r
+ }\r
+\r
+ ASN_DEBUG("Took %ld bytes to encode %s: [%s]:%ld",\r
+ (long)consumed_myself, td->name,\r
+ (type_variant == ASN_OSUBV_STR) ? (char *)st->buf : "<data>",\r
+ (long)st->size);\r
+\r
+\r
+ RETURN(RC_OK);\r
+}\r
+\r
+/*\r
+ * Encode OCTET STRING type using DER.\r
+ */\r
+asn_enc_rval_t\r
+OCTET_STRING_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
+ asn_enc_rval_t er = { 0, 0, 0 };\r
+ const asn_OCTET_STRING_specifics_t *specs = td->specifics\r
+ ? (const asn_OCTET_STRING_specifics_t *)td->specifics\r
+ : &asn_SPC_OCTET_STRING_specs;\r
+ const BIT_STRING_t *st = (const BIT_STRING_t *)sptr;\r
+ enum asn_OS_Subvariant type_variant = specs->subvariant;\r
+ int fix_last_byte = 0;\r
+\r
+ ASN_DEBUG("%s %s as OCTET STRING",\r
+ cb?"Estimating":"Encoding", td->name);\r
+\r
+ /*\r
+ * Write tags.\r
+ */\r
+ if(type_variant != ASN_OSUBV_ANY || tag_mode == 1) {\r
+ er.encoded = der_write_tags(td,\r
+ (type_variant == ASN_OSUBV_BIT) + st->size,\r
+ tag_mode, type_variant == ASN_OSUBV_ANY, tag,\r
+ cb, app_key);\r
+ if(er.encoded == -1) {\r
+ er.failed_type = td;\r
+ er.structure_ptr = sptr;\r
+ return er;\r
+ }\r
+ } else {\r
+ /* Disallow: [<tag>] IMPLICIT ANY */\r
+ assert(type_variant != ASN_OSUBV_ANY || tag_mode != -1);\r
+ er.encoded = 0;\r
+ }\r
+\r
+ if(!cb) {\r
+ er.encoded += (type_variant == ASN_OSUBV_BIT) + st->size;\r
+ ASN__ENCODED_OK(er);\r
+ }\r
+\r
+ /*\r
+ * Prepare to deal with the last octet of BIT STRING.\r
+ */\r
+ if(type_variant == ASN_OSUBV_BIT) {\r
+ uint8_t b = st->bits_unused & 0x07;\r
+ if(b && st->size) fix_last_byte = 1;\r
+ ASN__CALLBACK(&b, 1);\r
+ }\r
+\r
+ /* Invoke callback for the main part of the buffer */\r
+ ASN__CALLBACK(st->buf, st->size - fix_last_byte);\r
+\r
+ /* The last octet should be stripped off the unused bits */\r
+ if(fix_last_byte) {\r
+ uint8_t b = st->buf[st->size-1] & (0xff << st->bits_unused);\r
+ ASN__CALLBACK(&b, 1);\r
+ }\r
+\r
+ ASN__ENCODED_OK(er);\r
+cb_failed:\r
+ ASN__ENCODE_FAILED;\r
+}\r
+\r
+asn_enc_rval_t\r
+OCTET_STRING_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
+ const char * const h2c = "0123456789ABCDEF";\r
+ const OCTET_STRING_t *st = (const OCTET_STRING_t *)sptr;\r
+ asn_enc_rval_t er = { 0, 0, 0 };\r
+ char scratch[16 * 3 + 4];\r
+ char *p = scratch;\r
+ uint8_t *buf;\r
+ uint8_t *end;\r
+ size_t i;\r
+\r
+ if(!st || (!st->buf && st->size))\r
+ ASN__ENCODE_FAILED;\r
+\r
+ er.encoded = 0;\r
+\r
+ /*\r
+ * Dump the contents of the buffer in hexadecimal.\r
+ */\r
+ buf = st->buf;\r
+ end = buf + st->size;\r
+ if(flags & XER_F_CANONICAL) {\r
+ char *scend = scratch + (sizeof(scratch) - 2);\r
+ for(; buf < end; buf++) {\r
+ if(p >= scend) {\r
+ ASN__CALLBACK(scratch, p - scratch);\r
+ p = scratch;\r
+ }\r
+ *p++ = h2c[(*buf >> 4) & 0x0F];\r
+ *p++ = h2c[*buf & 0x0F];\r
+ }\r
+\r
+ ASN__CALLBACK(scratch, p-scratch); /* Dump the rest */\r
+ } else {\r
+ for(i = 0; buf < end; buf++, i++) {\r
+ if(!(i % 16) && (i || st->size > 16)) {\r
+ ASN__CALLBACK(scratch, p-scratch);\r
+ p = scratch;\r
+ ASN__TEXT_INDENT(1, ilevel);\r
+ }\r
+ *p++ = h2c[(*buf >> 4) & 0x0F];\r
+ *p++ = h2c[*buf & 0x0F];\r
+ *p++ = 0x20;\r
+ }\r
+ if(p - scratch) {\r
+ p--; /* Remove the tail space */\r
+ ASN__CALLBACK(scratch, p-scratch); /* Dump the rest */\r
+ if(st->size > 16)\r
+ ASN__TEXT_INDENT(1, ilevel-1);\r
+ }\r
+ }\r
+\r
+ ASN__ENCODED_OK(er);\r
+cb_failed:\r
+ ASN__ENCODE_FAILED;\r
+}\r
+\r
+static const struct OCTET_STRING__xer_escape_table_s {\r
+ const char *string;\r
+ int size;\r
+} OCTET_STRING__xer_escape_table[] = {\r
+#define OSXET(s) { s, sizeof(s) - 1 }\r
+ OSXET("\074\156\165\154\057\076"), /* <nul/> */\r
+ OSXET("\074\163\157\150\057\076"), /* <soh/> */\r
+ OSXET("\074\163\164\170\057\076"), /* <stx/> */\r
+ OSXET("\074\145\164\170\057\076"), /* <etx/> */\r
+ OSXET("\074\145\157\164\057\076"), /* <eot/> */\r
+ OSXET("\074\145\156\161\057\076"), /* <enq/> */\r
+ OSXET("\074\141\143\153\057\076"), /* <ack/> */\r
+ OSXET("\074\142\145\154\057\076"), /* <bel/> */\r
+ OSXET("\074\142\163\057\076"), /* <bs/> */\r
+ OSXET("\011"), /* \t */\r
+ OSXET("\012"), /* \n */\r
+ OSXET("\074\166\164\057\076"), /* <vt/> */\r
+ OSXET("\074\146\146\057\076"), /* <ff/> */\r
+ OSXET("\015"), /* \r */\r
+ OSXET("\074\163\157\057\076"), /* <so/> */\r
+ OSXET("\074\163\151\057\076"), /* <si/> */\r
+ OSXET("\074\144\154\145\057\076"), /* <dle/> */\r
+ OSXET("\074\144\143\061\057\076"), /* <de1/> */\r
+ OSXET("\074\144\143\062\057\076"), /* <de2/> */\r
+ OSXET("\074\144\143\063\057\076"), /* <de3/> */\r
+ OSXET("\074\144\143\064\057\076"), /* <de4/> */\r
+ OSXET("\074\156\141\153\057\076"), /* <nak/> */\r
+ OSXET("\074\163\171\156\057\076"), /* <syn/> */\r
+ OSXET("\074\145\164\142\057\076"), /* <etb/> */\r
+ OSXET("\074\143\141\156\057\076"), /* <can/> */\r
+ OSXET("\074\145\155\057\076"), /* <em/> */\r
+ OSXET("\074\163\165\142\057\076"), /* <sub/> */\r
+ OSXET("\074\145\163\143\057\076"), /* <esc/> */\r
+ OSXET("\074\151\163\064\057\076"), /* <is4/> */\r
+ OSXET("\074\151\163\063\057\076"), /* <is3/> */\r
+ OSXET("\074\151\163\062\057\076"), /* <is2/> */\r
+ OSXET("\074\151\163\061\057\076"), /* <is1/> */\r
+ { 0, 0 }, /* " " */\r
+ { 0, 0 }, /* ! */\r
+ { 0, 0 }, /* \" */\r
+ { 0, 0 }, /* # */\r
+ { 0, 0 }, /* $ */\r
+ { 0, 0 }, /* % */\r
+ OSXET("\046\141\155\160\073"), /* & */\r
+ { 0, 0 }, /* ' */\r
+ {0,0},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, /* ()*+,-./ */\r
+ {0,0},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, /* 01234567 */\r
+ {0,0},{0,0},{0,0},{0,0}, /* 89:; */\r
+ OSXET("\046\154\164\073"), /* < */\r
+ { 0, 0 }, /* = */\r
+ OSXET("\046\147\164\073"), /* > */\r
+};\r
+\r
+static int\r
+OS__check_escaped_control_char(const void *buf, int size) {\r
+ size_t i;\r
+ /*\r
+ * Inefficient algorithm which translates the escape sequences\r
+ * defined above into characters. Returns -1 if not found.\r
+ * TODO: replace by a faster algorithm (bsearch(), hash or\r
+ * nested table lookups).\r
+ */\r
+ for(i = 0; i < 32 /* Don't spend time on the bottom half */; i++) {\r
+ const struct OCTET_STRING__xer_escape_table_s *el;\r
+ el = &OCTET_STRING__xer_escape_table[i];\r
+ if(el->size == size && memcmp(buf, el->string, size) == 0)\r
+ return i;\r
+ }\r
+ return -1;\r
+}\r
+\r
+static int\r
+OCTET_STRING__handle_control_chars(void *struct_ptr, const void *chunk_buf, size_t chunk_size) {\r
+ /*\r
+ * This might be one of the escape sequences\r
+ * for control characters. Check it out.\r
+ * #11.15.5\r
+ */\r
+ int control_char = OS__check_escaped_control_char(chunk_buf,chunk_size);\r
+ if(control_char >= 0) {\r
+ OCTET_STRING_t *st = (OCTET_STRING_t *)struct_ptr;\r
+ void *p = REALLOC(st->buf, st->size + 2);\r
+ if(p) {\r
+ st->buf = (uint8_t *)p;\r
+ st->buf[st->size++] = control_char;\r
+ st->buf[st->size] = '\0'; /* nul-termination */\r
+ return 0;\r
+ }\r
+ }\r
+ \r
+ return -1; /* No, it's not */\r
+}\r
+\r
+asn_enc_rval_t\r
+OCTET_STRING_encode_xer_utf8(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
+ const OCTET_STRING_t *st = (const OCTET_STRING_t *)sptr;\r
+ asn_enc_rval_t er = { 0, 0, 0 };\r
+ uint8_t *buf, *end;\r
+ uint8_t *ss; /* Sequence start */\r
+ ssize_t encoded_len = 0;\r
+\r
+ (void)ilevel; /* Unused argument */\r
+ (void)flags; /* Unused argument */\r
+\r
+ if(!st || (!st->buf && st->size))\r
+ ASN__ENCODE_FAILED;\r
+\r
+ buf = st->buf;\r
+ end = buf + st->size;\r
+ for(ss = buf; buf < end; buf++) {\r
+ unsigned int ch = *buf;\r
+ int s_len; /* Special encoding sequence length */\r
+\r
+ /*\r
+ * Escape certain characters: X.680/11.15\r
+ */\r
+ if(ch < sizeof(OCTET_STRING__xer_escape_table)\r
+ /sizeof(OCTET_STRING__xer_escape_table[0])\r
+ && (s_len = OCTET_STRING__xer_escape_table[ch].size)) {\r
+ if(((buf - ss) && cb(ss, buf - ss, app_key) < 0)\r
+ || cb(OCTET_STRING__xer_escape_table[ch].string, s_len,\r
+ app_key) < 0)\r
+ ASN__ENCODE_FAILED;\r
+ encoded_len += (buf - ss) + s_len;\r
+ ss = buf + 1;\r
+ }\r
+ }\r
+\r
+ encoded_len += (buf - ss);\r
+ if((buf - ss) && cb(ss, buf - ss, app_key) < 0)\r
+ ASN__ENCODE_FAILED;\r
+\r
+ er.encoded = encoded_len;\r
+ ASN__ENCODED_OK(er);\r
+}\r
+\r
+/*\r
+ * Convert from hexadecimal format (cstring): "AB CD EF"\r
+ */\r
+static ssize_t OCTET_STRING__convert_hexadecimal(void *sptr, const void *chunk_buf, size_t chunk_size, int have_more) {\r
+ OCTET_STRING_t *st = (OCTET_STRING_t *)sptr;\r
+ const char *chunk_stop = (const char *)chunk_buf;\r
+ const char *p = chunk_stop;\r
+ const char *pend = p + chunk_size;\r
+ unsigned int clv = 0;\r
+ int half = 0; /* Half bit */\r
+ uint8_t *buf;\r
+\r
+ /* Reallocate buffer according to high cap estimation */\r
+ size_t new_size = st->size + (chunk_size + 1) / 2;\r
+ void *nptr = REALLOC(st->buf, new_size + 1);\r
+ if(!nptr) return -1;\r
+ st->buf = (uint8_t *)nptr;\r
+ buf = st->buf + st->size;\r
+\r
+ /*\r
+ * If something like " a b c " appears here, the " a b":3 will be\r
+ * converted, and the rest skipped. That is, unless buf_size is greater\r
+ * than chunk_size, then it'll be equivalent to "ABC0".\r
+ */\r
+ for(; p < pend; p++) {\r
+ int ch = *(const unsigned char *)p;\r
+ switch(ch) {\r
+ case 0x09: case 0x0a: case 0x0c: case 0x0d:\r
+ case 0x20:\r
+ /* Ignore whitespace */\r
+ continue;\r
+ case 0x30: case 0x31: case 0x32: case 0x33: case 0x34: /*01234*/\r
+ case 0x35: case 0x36: case 0x37: case 0x38: case 0x39: /*56789*/\r
+ clv = (clv << 4) + (ch - 0x30);\r
+ break;\r
+ case 0x41: case 0x42: case 0x43: /* ABC */\r
+ case 0x44: case 0x45: case 0x46: /* DEF */\r
+ clv = (clv << 4) + (ch - 0x41 + 10);\r
+ break;\r
+ case 0x61: case 0x62: case 0x63: /* abc */\r
+ case 0x64: case 0x65: case 0x66: /* def */\r
+ clv = (clv << 4) + (ch - 0x61 + 10);\r
+ break;\r
+ default:\r
+ *buf = 0; /* JIC */\r
+ return -1;\r
+ }\r
+ if(half++) {\r
+ half = 0;\r
+ *buf++ = clv;\r
+ chunk_stop = p + 1;\r
+ }\r
+ }\r
+\r
+ /*\r
+ * Check partial decoding.\r
+ */\r
+ if(half) {\r
+ if(have_more) {\r
+ /*\r
+ * Partial specification is fine,\r
+ * because no more more PXER_TEXT data is available.\r
+ */\r
+ *buf++ = clv << 4;\r
+ chunk_stop = p;\r
+ }\r
+ } else {\r
+ chunk_stop = p;\r
+ }\r
+\r
+ st->size = buf - st->buf; /* Adjust the buffer size */\r
+ assert(st->size <= new_size);\r
+ st->buf[st->size] = 0; /* Courtesy termination */\r
+\r
+ return (chunk_stop - (const char *)chunk_buf); /* Converted size */\r
+}\r
+\r
+/*\r
+ * Convert from binary format: "00101011101"\r
+ */\r
+static ssize_t OCTET_STRING__convert_binary(void *sptr, const void *chunk_buf, size_t chunk_size, int have_more) {\r
+ BIT_STRING_t *st = (BIT_STRING_t *)sptr;\r
+ const char *p = (const char *)chunk_buf;\r
+ const char *pend = p + chunk_size;\r
+ int bits_unused = st->bits_unused & 0x7;\r
+ uint8_t *buf;\r
+\r
+ /* Reallocate buffer according to high cap estimation */\r
+ size_t new_size = st->size + (chunk_size + 7) / 8;\r
+ void *nptr = REALLOC(st->buf, new_size + 1);\r
+ if(!nptr) return -1;\r
+ st->buf = (uint8_t *)nptr;\r
+ buf = st->buf + st->size;\r
+\r
+ (void)have_more;\r
+\r
+ if(bits_unused == 0)\r
+ bits_unused = 8;\r
+ else if(st->size)\r
+ buf--;\r
+\r
+ /*\r
+ * Convert series of 0 and 1 into the octet string.\r
+ */\r
+ for(; p < pend; p++) {\r
+ int ch = *(const unsigned char *)p;\r
+ switch(ch) {\r
+ case 0x09: case 0x0a: case 0x0c: case 0x0d:\r
+ case 0x20:\r
+ /* Ignore whitespace */\r
+ break;\r
+ case 0x30:\r
+ case 0x31:\r
+ if(bits_unused-- <= 0) {\r
+ *++buf = 0; /* Clean the cell */\r
+ bits_unused = 7;\r
+ }\r
+ *buf |= (ch&1) << bits_unused;\r
+ break;\r
+ default:\r
+ st->bits_unused = bits_unused;\r
+ return -1;\r
+ }\r
+ }\r
+\r
+ if(bits_unused == 8) {\r
+ st->size = buf - st->buf;\r
+ st->bits_unused = 0;\r
+ } else {\r
+ st->size = buf - st->buf + 1;\r
+ st->bits_unused = bits_unused;\r
+ }\r
+\r
+ assert(st->size <= new_size);\r
+ st->buf[st->size] = 0; /* Courtesy termination */\r
+\r
+ return chunk_size; /* Converted in full */\r
+}\r
+\r
+/*\r
+ * Something like strtod(), but with stricter rules.\r
+ */\r
+static int\r
+OS__strtoent(int base, const char *buf, const char *end, int32_t *ret_value) {\r
+ const int32_t last_unicode_codepoint = 0x10ffff;\r
+ int32_t val = 0;\r
+ const char *p;\r
+\r
+ for(p = buf; p < end; p++) {\r
+ int ch = *p;\r
+\r
+ switch(ch) {\r
+ case 0x30: case 0x31: case 0x32: case 0x33: case 0x34: /*01234*/\r
+ case 0x35: case 0x36: case 0x37: case 0x38: case 0x39: /*56789*/\r
+ val = val * base + (ch - 0x30);\r
+ break;\r
+ case 0x41: case 0x42: case 0x43: /* ABC */\r
+ case 0x44: case 0x45: case 0x46: /* DEF */\r
+ val = val * base + (ch - 0x41 + 10);\r
+ break;\r
+ case 0x61: case 0x62: case 0x63: /* abc */\r
+ case 0x64: case 0x65: case 0x66: /* def */\r
+ val = val * base + (ch - 0x61 + 10);\r
+ break;\r
+ case 0x3b: /* ';' */\r
+ *ret_value = val;\r
+ return (p - buf) + 1;\r
+ default:\r
+ return -1; /* Character set error */\r
+ }\r
+\r
+ /* Value exceeds the Unicode range. */\r
+ if(val > last_unicode_codepoint) {\r
+ return -1;\r
+ }\r
+ }\r
+\r
+ *ret_value = -1;\r
+ return (p - buf);\r
+}\r
+\r
+/*\r
+ * Convert from the plain UTF-8 format, expanding entity references: "2 < 3"\r
+ */\r
+static ssize_t\r
+OCTET_STRING__convert_entrefs(void *sptr, const void *chunk_buf,\r
+ size_t chunk_size, int have_more) {\r
+ OCTET_STRING_t *st = (OCTET_STRING_t *)sptr;\r
+ const char *p = (const char *)chunk_buf;\r
+ const char *pend = p + chunk_size;\r
+ uint8_t *buf;\r
+\r
+ /* Reallocate buffer */\r
+ size_t new_size = st->size + chunk_size;\r
+ void *nptr = REALLOC(st->buf, new_size + 1);\r
+ if(!nptr) return -1;\r
+ st->buf = (uint8_t *)nptr;\r
+ buf = st->buf + st->size;\r
+\r
+ /*\r
+ * Convert series of 0 and 1 into the octet string.\r
+ */\r
+ for(; p < pend; p++) {\r
+ int ch = *(const unsigned char *)p;\r
+ int len; /* Length of the rest of the chunk */\r
+\r
+ if(ch != 0x26 /* '&' */) {\r
+ *buf++ = ch;\r
+ continue; /* That was easy... */\r
+ }\r
+\r
+ /*\r
+ * Process entity reference.\r
+ */\r
+ len = chunk_size - (p - (const char *)chunk_buf);\r
+ if(len == 1 /* "&" */) goto want_more;\r
+ if(p[1] == 0x23 /* '#' */) {\r
+ const char *pval; /* Pointer to start of digits */\r
+ int32_t val = 0; /* Entity reference value */\r
+ int base;\r
+\r
+ if(len == 2 /* "&#" */) goto want_more;\r
+ if(p[2] == 0x78 /* 'x' */)\r
+ pval = p + 3, base = 16;\r
+ else\r
+ pval = p + 2, base = 10;\r
+ len = OS__strtoent(base, pval, p + len, &val);\r
+ if(len == -1) {\r
+ /* Invalid charset. Just copy verbatim. */\r
+ *buf++ = ch;\r
+ continue;\r
+ }\r
+ if(!len || pval[len-1] != 0x3b) goto want_more;\r
+ assert(val > 0);\r
+ p += (pval - p) + len - 1; /* Advance past entref */\r
+\r
+ if(val < 0x80) {\r
+ *buf++ = (char)val;\r
+ } else if(val < 0x800) {\r
+ *buf++ = 0xc0 | ((val >> 6));\r
+ *buf++ = 0x80 | ((val & 0x3f));\r
+ } else if(val < 0x10000) {\r
+ *buf++ = 0xe0 | ((val >> 12));\r
+ *buf++ = 0x80 | ((val >> 6) & 0x3f);\r
+ *buf++ = 0x80 | ((val & 0x3f));\r
+ } else if(val < 0x200000) {\r
+ *buf++ = 0xf0 | ((val >> 18));\r
+ *buf++ = 0x80 | ((val >> 12) & 0x3f);\r
+ *buf++ = 0x80 | ((val >> 6) & 0x3f);\r
+ *buf++ = 0x80 | ((val & 0x3f));\r
+ } else if(val < 0x4000000) {\r
+ *buf++ = 0xf8 | ((val >> 24));\r
+ *buf++ = 0x80 | ((val >> 18) & 0x3f);\r
+ *buf++ = 0x80 | ((val >> 12) & 0x3f);\r
+ *buf++ = 0x80 | ((val >> 6) & 0x3f);\r
+ *buf++ = 0x80 | ((val & 0x3f));\r
+ } else {\r
+ *buf++ = 0xfc | ((val >> 30) & 0x1);\r
+ *buf++ = 0x80 | ((val >> 24) & 0x3f);\r
+ *buf++ = 0x80 | ((val >> 18) & 0x3f);\r
+ *buf++ = 0x80 | ((val >> 12) & 0x3f);\r
+ *buf++ = 0x80 | ((val >> 6) & 0x3f);\r
+ *buf++ = 0x80 | ((val & 0x3f));\r
+ }\r
+ } else {\r
+ /*\r
+ * Ugly, limited parsing of & > <\r
+ */\r
+ char *sc = (char *)memchr(p, 0x3b, len > 5 ? 5 : len);\r
+ if(!sc) goto want_more;\r
+ if((sc - p) == 4\r
+ && p[1] == 0x61 /* 'a' */\r
+ && p[2] == 0x6d /* 'm' */\r
+ && p[3] == 0x70 /* 'p' */) {\r
+ *buf++ = 0x26;\r
+ p = sc;\r
+ continue;\r
+ }\r
+ if((sc - p) == 3) {\r
+ if(p[1] == 0x6c) {\r
+ *buf = 0x3c; /* '<' */\r
+ } else if(p[1] == 0x67) {\r
+ *buf = 0x3e; /* '>' */\r
+ } else {\r
+ /* Unsupported entity reference */\r
+ *buf++ = ch;\r
+ continue;\r
+ }\r
+ if(p[2] != 0x74) {\r
+ /* Unsupported entity reference */\r
+ *buf++ = ch;\r
+ continue;\r
+ }\r
+ buf++;\r
+ p = sc;\r
+ continue;\r
+ }\r
+ /* Unsupported entity reference */\r
+ *buf++ = ch;\r
+ }\r
+\r
+ continue;\r
+ want_more:\r
+ if(have_more) {\r
+ /*\r
+ * We know that no more data (of the same type)\r
+ * is coming. Copy the rest verbatim.\r
+ */\r
+ *buf++ = ch;\r
+ continue;\r
+ }\r
+ chunk_size = (p - (const char *)chunk_buf);\r
+ /* Processing stalled: need more data */\r
+ break;\r
+ }\r
+\r
+ st->size = buf - st->buf;\r
+ assert(st->size <= new_size);\r
+ st->buf[st->size] = 0; /* Courtesy termination */\r
+\r
+ return chunk_size; /* Converted in full */\r
+}\r
+\r
+/*\r
+ * Decode OCTET STRING from the XML element's body.\r
+ */\r
+static asn_dec_rval_t\r
+OCTET_STRING__decode_xer(\r
+ const asn_codec_ctx_t *opt_codec_ctx, const asn_TYPE_descriptor_t *td,\r
+ void **sptr, const char *opt_mname, const void *buf_ptr, size_t size,\r
+ int (*opt_unexpected_tag_decoder)(void *struct_ptr, const void *chunk_buf,\r
+ size_t chunk_size),\r
+ ssize_t (*body_receiver)(void *struct_ptr, const void *chunk_buf,\r
+ size_t chunk_size, int have_more)) {\r
+ OCTET_STRING_t *st = (OCTET_STRING_t *)*sptr;\r
+ const asn_OCTET_STRING_specifics_t *specs = td->specifics\r
+ ? (const asn_OCTET_STRING_specifics_t *)td->specifics\r
+ : &asn_SPC_OCTET_STRING_specs;\r
+ const char *xml_tag = opt_mname ? opt_mname : td->xml_tag;\r
+ asn_struct_ctx_t *ctx; /* Per-structure parser context */\r
+ asn_dec_rval_t rval; /* Return value from the decoder */\r
+ int st_allocated;\r
+\r
+ /*\r
+ * Create the string if does not exist.\r
+ */\r
+ if(!st) {\r
+ st = (OCTET_STRING_t *)CALLOC(1, specs->struct_size);\r
+ *sptr = (void *)st;\r
+ if(!st) goto sta_failed;\r
+ st_allocated = 1;\r
+ } else {\r
+ st_allocated = 0;\r
+ }\r
+ if(!st->buf) {\r
+ /* This is separate from above section */\r
+ st->buf = (uint8_t *)CALLOC(1, 1);\r
+ if(!st->buf) {\r
+ if(st_allocated) {\r
+ *sptr = 0;\r
+ goto stb_failed;\r
+ } else {\r
+ goto sta_failed;\r
+ }\r
+ }\r
+ }\r
+\r
+ /* Restore parsing context */\r
+ ctx = (asn_struct_ctx_t *)(((char *)*sptr) + specs->ctx_offset);\r
+\r
+ return xer_decode_general(opt_codec_ctx, ctx, *sptr, xml_tag,\r
+ buf_ptr, size, opt_unexpected_tag_decoder, body_receiver);\r
+\r
+stb_failed:\r
+ FREEMEM(st);\r
+sta_failed:\r
+ rval.code = RC_FAIL;\r
+ rval.consumed = 0;\r
+ return rval;\r
+}\r
+\r
+/*\r
+ * Decode OCTET STRING from the hexadecimal data.\r
+ */\r
+asn_dec_rval_t\r
+OCTET_STRING_decode_xer_hex(const asn_codec_ctx_t *opt_codec_ctx,\r
+ const asn_TYPE_descriptor_t *td, void **sptr,\r
+ const char *opt_mname, const void *buf_ptr,\r
+ size_t size) {\r
+ return OCTET_STRING__decode_xer(opt_codec_ctx, td, sptr, opt_mname,\r
+ buf_ptr, size, 0, OCTET_STRING__convert_hexadecimal);\r
+}\r
+\r
+/*\r
+ * Decode OCTET STRING from the binary (0/1) data.\r
+ */\r
+asn_dec_rval_t\r
+OCTET_STRING_decode_xer_binary(const asn_codec_ctx_t *opt_codec_ctx,\r
+ const asn_TYPE_descriptor_t *td, void **sptr,\r
+ const char *opt_mname, const void *buf_ptr,\r
+ size_t size) {\r
+ return OCTET_STRING__decode_xer(opt_codec_ctx, td, sptr, opt_mname,\r
+ buf_ptr, size, 0, OCTET_STRING__convert_binary);\r
+}\r
+\r
+/*\r
+ * Decode OCTET STRING from the string (ASCII/UTF-8) data.\r
+ */\r
+asn_dec_rval_t\r
+OCTET_STRING_decode_xer_utf8(const asn_codec_ctx_t *opt_codec_ctx,\r
+ const asn_TYPE_descriptor_t *td, void **sptr,\r
+ const char *opt_mname, const void *buf_ptr,\r
+ size_t size) {\r
+ return OCTET_STRING__decode_xer(opt_codec_ctx, td, sptr, opt_mname,\r
+ buf_ptr, size,\r
+ OCTET_STRING__handle_control_chars,\r
+ OCTET_STRING__convert_entrefs);\r
+}\r
+\r
+#ifndef ASN_DISABLE_PER_SUPPORT\r
+\r
+static int\r
+OCTET_STRING_per_get_characters(asn_per_data_t *po, uint8_t *buf,\r
+ size_t units, unsigned int bpc, unsigned int unit_bits,\r
+ long lb, long ub, const asn_per_constraints_t *pc) {\r
+ uint8_t *end = buf + units * bpc;\r
+\r
+ ASN_DEBUG("Expanding %d characters into (%ld..%ld):%d",\r
+ (int)units, lb, ub, unit_bits);\r
+\r
+ /* X.691: 27.5.4 */\r
+ if((unsigned long)ub <= ((unsigned long)2 << (unit_bits - 1))) {\r
+ /* Decode without translation */\r
+ lb = 0;\r
+ } else if(pc && pc->code2value) {\r
+ if(unit_bits > 16)\r
+ return 1; /* FATAL: can't have constrained\r
+ * UniversalString with more than\r
+ * 16 million code points */\r
+ for(; buf < end; buf += bpc) {\r
+ int value;\r
+ int code = per_get_few_bits(po, unit_bits);\r
+ if(code < 0) return -1; /* WMORE */\r
+ value = pc->code2value(code);\r
+ if(value < 0) {\r
+ ASN_DEBUG("Code %d (0x%02x) is"\r
+ " not in map (%ld..%ld)",\r
+ code, code, lb, ub);\r
+ return 1; /* FATAL */\r
+ }\r
+ switch(bpc) {\r
+ case 1: *buf = value; break;\r
+ case 2: buf[0] = value >> 8; buf[1] = value; break;\r
+ case 4: buf[0] = value >> 24; buf[1] = value >> 16;\r
+ buf[2] = value >> 8; buf[3] = value; break;\r
+ }\r
+ }\r
+ return 0;\r
+ }\r
+\r
+ /* Shortcut the no-op copying to the aligned structure */\r
+ if(lb == 0 && (unit_bits == 8 * bpc)) {\r
+ return per_get_many_bits(po, buf, 0, unit_bits * units);\r
+ }\r
+\r
+ for(; buf < end; buf += bpc) {\r
+ int32_t code = per_get_few_bits(po, unit_bits);\r
+ int32_t ch = code + lb;\r
+ if(code < 0) return -1; /* WMORE */\r
+ if(ch > ub) {\r
+ ASN_DEBUG("Code %d is out of range (%ld..%ld)",\r
+ ch, lb, ub);\r
+ return 1; /* FATAL */\r
+ }\r
+ switch(bpc) {\r
+ case 1: *buf = ch; break;\r
+ case 2: buf[0] = ch >> 8; buf[1] = ch; break;\r
+ case 4: buf[0] = ch >> 24; buf[1] = ch >> 16;\r
+ buf[2] = ch >> 8; buf[3] = ch; break;\r
+ }\r
+ }\r
+\r
+ return 0;\r
+}\r
+\r
+static int\r
+OCTET_STRING_per_put_characters(asn_per_outp_t *po, const uint8_t *buf,\r
+ size_t units, unsigned int bpc, unsigned int unit_bits,\r
+ long lb, long ub, const asn_per_constraints_t *pc) {\r
+ const uint8_t *end = buf + units * bpc;\r
+\r
+ ASN_DEBUG("Squeezing %d characters into (%ld..%ld):%d (%d bpc)",\r
+ (int)units, lb, ub, unit_bits, bpc);\r
+\r
+ /* X.691: 27.5.4 */\r
+ if((unsigned long)ub <= ((unsigned long)2 << (unit_bits - 1))) {\r
+ /* Encode as is */\r
+ lb = 0;\r
+ } else if(pc && pc->value2code) {\r
+ for(; buf < end; buf += bpc) {\r
+ int code;\r
+ uint32_t value;\r
+ switch(bpc) {\r
+ case 1: value = *(const uint8_t *)buf; break;\r
+ case 2: value = (buf[0] << 8) | buf[1]; break;\r
+ case 4: value = (buf[0] << 24) | (buf[1] << 16)\r
+ | (buf[2] << 8) | buf[3]; break;\r
+ default: return -1;\r
+ }\r
+ code = pc->value2code(value);\r
+ if(code < 0) {\r
+ ASN_DEBUG("Character %d (0x%02x) is"\r
+ " not in map (%ld..%ld)",\r
+ *buf, *buf, lb, ub);\r
+ return -1;\r
+ }\r
+ if(per_put_few_bits(po, code, unit_bits))\r
+ return -1;\r
+ }\r
+ }\r
+\r
+ /* Shortcut the no-op copying to the aligned structure */\r
+ if(lb == 0 && (unit_bits == 8 * bpc)) {\r
+ return per_put_many_bits(po, buf, unit_bits * units);\r
+ }\r
+\r
+ for(ub -= lb; buf < end; buf += bpc) {\r
+ int ch;\r
+ uint32_t value;\r
+ switch(bpc) {\r
+ case 1:\r
+ value = *(const uint8_t *)buf;\r
+ break;\r
+ case 2:\r
+ value = (buf[0] << 8) | buf[1];\r
+ break;\r
+ case 4:\r
+ value = (buf[0] << 24) | (buf[1] << 16) | (buf[2] << 8) | buf[3];\r
+ break;\r
+ default:\r
+ return -1;\r
+ }\r
+ ch = value - lb;\r
+ if(ch < 0 || ch > ub) {\r
+ ASN_DEBUG("Character %d (0x%02x) is out of range (%ld..%ld)", *buf,\r
+ value, lb, ub + lb);\r
+ return -1;\r
+ }\r
+ if(per_put_few_bits(po, ch, unit_bits)) return -1;\r
+ }\r
+\r
+ return 0;\r
+}\r
+\r
+static asn_per_constraints_t asn_DEF_OCTET_STRING_constraints = {\r
+ { APC_CONSTRAINED, 8, 8, 0, 255 },\r
+ { APC_SEMI_CONSTRAINED, -1, -1, 0, 0 },\r
+ 0, 0\r
+};\r
+\r
+asn_dec_rval_t\r
+OCTET_STRING_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_OCTET_STRING_specifics_t *specs = td->specifics\r
+ ? (const asn_OCTET_STRING_specifics_t *)td->specifics\r
+ : &asn_SPC_OCTET_STRING_specs;\r
+ const asn_per_constraints_t *pc =\r
+ constraints ? constraints : td->encoding_constraints.per_constraints;\r
+ const asn_per_constraint_t *cval;\r
+ const asn_per_constraint_t *csiz;\r
+ asn_dec_rval_t rval = { RC_OK, 0 };\r
+ OCTET_STRING_t *st = (OCTET_STRING_t *)*sptr;\r
+ ssize_t consumed_myself = 0;\r
+ int repeat;\r
+ enum {\r
+ OS__BPC_CHAR = 1,\r
+ OS__BPC_U16 = 2,\r
+ OS__BPC_U32 = 4\r
+ } bpc; /* Bytes per character */\r
+ unsigned int unit_bits;\r
+ unsigned int canonical_unit_bits;\r
+\r
+ (void)opt_codec_ctx;\r
+\r
+ if(pc) {\r
+ cval = &pc->value;\r
+ csiz = &pc->size;\r
+ } else {\r
+ cval = &asn_DEF_OCTET_STRING_constraints.value;\r
+ csiz = &asn_DEF_OCTET_STRING_constraints.size;\r
+ }\r
+\r
+ switch(specs->subvariant) {\r
+ default:\r
+ case ASN_OSUBV_ANY:\r
+ case ASN_OSUBV_BIT:\r
+ ASN_DEBUG("Unrecognized subvariant %d", specs->subvariant);\r
+ RETURN(RC_FAIL);\r
+ break;\r
+ case ASN_OSUBV_STR:\r
+ canonical_unit_bits = unit_bits = 8;\r
+ if(cval->flags & APC_CONSTRAINED)\r
+ unit_bits = cval->range_bits;\r
+ bpc = OS__BPC_CHAR;\r
+ break;\r
+ case ASN_OSUBV_U16:\r
+ canonical_unit_bits = unit_bits = 16;\r
+ if(cval->flags & APC_CONSTRAINED)\r
+ unit_bits = cval->range_bits;\r
+ bpc = OS__BPC_U16;\r
+ break;\r
+ case ASN_OSUBV_U32:\r
+ canonical_unit_bits = unit_bits = 32;\r
+ if(cval->flags & APC_CONSTRAINED)\r
+ unit_bits = cval->range_bits;\r
+ bpc = OS__BPC_U32;\r
+ break;\r
+ }\r
+\r
+ /*\r
+ * Allocate the string.\r
+ */\r
+ if(!st) {\r
+ st = (OCTET_STRING_t *)(*sptr = CALLOC(1, specs->struct_size));\r
+ if(!st) RETURN(RC_FAIL);\r
+ }\r
+\r
+ ASN_DEBUG("PER Decoding %s size %ld .. %ld bits %d",\r
+ csiz->flags & APC_EXTENSIBLE ? "extensible" : "non-extensible",\r
+ csiz->lower_bound, csiz->upper_bound, csiz->effective_bits);\r
+\r
+ if(csiz->flags & APC_EXTENSIBLE) {\r
+ int inext = per_get_few_bits(pd, 1);\r
+ if(inext < 0) RETURN(RC_WMORE);\r
+ if(inext) {\r
+ csiz = &asn_DEF_OCTET_STRING_constraints.size;\r
+ unit_bits = canonical_unit_bits;\r
+ }\r
+ }\r
+\r
+ if(csiz->effective_bits >= 0) {\r
+ FREEMEM(st->buf);\r
+ if(bpc) {\r
+ st->size = csiz->upper_bound * bpc;\r
+ } else {\r
+ st->size = (csiz->upper_bound + 7) >> 3;\r
+ }\r
+ st->buf = (uint8_t *)MALLOC(st->size + 1);\r
+ if(!st->buf) { st->size = 0; RETURN(RC_FAIL); }\r
+ }\r
+\r
+ /* X.691, #16.5: zero-length encoding */\r
+ /* X.691, #16.6: short fixed length encoding (up to 2 octets) */\r
+ /* X.691, #16.7: long fixed length encoding (up to 64K octets) */\r
+ if(csiz->effective_bits == 0) {\r
+ int ret;\r
+ if(bpc) {\r
+ ASN_DEBUG("Encoding OCTET STRING size %ld",\r
+ csiz->upper_bound);\r
+ ret = OCTET_STRING_per_get_characters(pd, st->buf,\r
+ csiz->upper_bound, bpc, unit_bits,\r
+ cval->lower_bound, cval->upper_bound, pc);\r
+ if(ret > 0) RETURN(RC_FAIL);\r
+ } else {\r
+ ASN_DEBUG("Encoding BIT STRING size %ld",\r
+ csiz->upper_bound);\r
+ ret = per_get_many_bits(pd, st->buf, 0,\r
+ unit_bits * csiz->upper_bound);\r
+ }\r
+ if(ret < 0) RETURN(RC_WMORE);\r
+ consumed_myself += unit_bits * csiz->upper_bound;\r
+ st->buf[st->size] = 0;\r
+ RETURN(RC_OK);\r
+ }\r
+\r
+ st->size = 0;\r
+ do {\r
+ ssize_t raw_len;\r
+ ssize_t len_bytes;\r
+ void *p;\r
+ int ret;\r
+\r
+ /* Get the PER length */\r
+ raw_len = uper_get_length(pd, csiz->effective_bits, csiz->lower_bound,\r
+ &repeat);\r
+ if(raw_len < 0) RETURN(RC_WMORE);\r
+ if(raw_len == 0 && st->buf) break;\r
+\r
+ ASN_DEBUG("Got PER length eb %ld, len %ld, %s (%s)",\r
+ (long)csiz->effective_bits, (long)raw_len,\r
+ repeat ? "repeat" : "once", td->name);\r
+ len_bytes = raw_len * bpc;\r
+ p = REALLOC(st->buf, st->size + len_bytes + 1);\r
+ if(!p) RETURN(RC_FAIL);\r
+ st->buf = (uint8_t *)p;\r
+\r
+ ret = OCTET_STRING_per_get_characters(pd, &st->buf[st->size], raw_len,\r
+ bpc, unit_bits, cval->lower_bound,\r
+ cval->upper_bound, pc);\r
+ if(ret > 0) RETURN(RC_FAIL);\r
+ if(ret < 0) RETURN(RC_WMORE);\r
+ st->size += len_bytes;\r
+ } while(repeat);\r
+ st->buf[st->size] = 0; /* nul-terminate */\r
+\r
+ return rval;\r
+}\r
+\r
+asn_enc_rval_t\r
+OCTET_STRING_encode_uper(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_OCTET_STRING_specifics_t *specs = td->specifics\r
+ ? (const asn_OCTET_STRING_specifics_t *)td->specifics\r
+ : &asn_SPC_OCTET_STRING_specs;\r
+ const asn_per_constraints_t *pc = constraints ? constraints\r
+ : td->encoding_constraints.per_constraints;\r
+ const asn_per_constraint_t *cval;\r
+ const asn_per_constraint_t *csiz;\r
+ const OCTET_STRING_t *st = (const OCTET_STRING_t *)sptr;\r
+ asn_enc_rval_t er = { 0, 0, 0 };\r
+ int inext = 0; /* Lies not within extension root */\r
+ unsigned int unit_bits;\r
+ unsigned int canonical_unit_bits;\r
+ size_t size_in_units;\r
+ const uint8_t *buf;\r
+ int ret;\r
+ enum {\r
+ OS__BPC_CHAR = 1,\r
+ OS__BPC_U16 = 2,\r
+ OS__BPC_U32 = 4\r
+ } bpc; /* Bytes per character */\r
+ int ct_extensible;\r
+\r
+ if(!st || (!st->buf && st->size))\r
+ ASN__ENCODE_FAILED;\r
+\r
+ if(pc) {\r
+ cval = &pc->value;\r
+ csiz = &pc->size;\r
+ } else {\r
+ cval = &asn_DEF_OCTET_STRING_constraints.value;\r
+ csiz = &asn_DEF_OCTET_STRING_constraints.size;\r
+ }\r
+ ct_extensible = csiz->flags & APC_EXTENSIBLE;\r
+\r
+ switch(specs->subvariant) {\r
+ default:\r
+ case ASN_OSUBV_ANY:\r
+ case ASN_OSUBV_BIT:\r
+ ASN__ENCODE_FAILED;\r
+ case ASN_OSUBV_STR:\r
+ canonical_unit_bits = unit_bits = 8;\r
+ if(cval->flags & APC_CONSTRAINED)\r
+ unit_bits = cval->range_bits;\r
+ bpc = OS__BPC_CHAR;\r
+ size_in_units = st->size;\r
+ break;\r
+ case ASN_OSUBV_U16:\r
+ canonical_unit_bits = unit_bits = 16;\r
+ if(cval->flags & APC_CONSTRAINED)\r
+ unit_bits = cval->range_bits;\r
+ bpc = OS__BPC_U16;\r
+ size_in_units = st->size >> 1;\r
+ if(st->size & 1) {\r
+ ASN_DEBUG("%s string size is not modulo 2", td->name);\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+ break;\r
+ case ASN_OSUBV_U32:\r
+ canonical_unit_bits = unit_bits = 32;\r
+ if(cval->flags & APC_CONSTRAINED)\r
+ unit_bits = cval->range_bits;\r
+ bpc = OS__BPC_U32;\r
+ size_in_units = st->size >> 2;\r
+ if(st->size & 3) {\r
+ ASN_DEBUG("%s string size is not modulo 4", td->name);\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+ break;\r
+ }\r
+\r
+ ASN_DEBUG("Encoding %s into %" ASN_PRI_SIZE " units of %d bits"\r
+ " (%ld..%ld, effective %d)%s",\r
+ td->name, size_in_units, unit_bits,\r
+ csiz->lower_bound, csiz->upper_bound,\r
+ csiz->effective_bits, ct_extensible ? " EXT" : "");\r
+\r
+ /* Figure out whether size lies within PER visible constraint */\r
+\r
+ if(csiz->effective_bits >= 0) {\r
+ if((ssize_t)size_in_units < csiz->lower_bound\r
+ || (ssize_t)size_in_units > csiz->upper_bound) {\r
+ if(ct_extensible) {\r
+ csiz = &asn_DEF_OCTET_STRING_constraints.size;\r
+ unit_bits = canonical_unit_bits;\r
+ inext = 1;\r
+ } else {\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+ }\r
+ } else {\r
+ inext = 0;\r
+ }\r
+\r
+ if(ct_extensible) {\r
+ /* Declare whether length is [not] within extension root */\r
+ if(per_put_few_bits(po, inext, 1))\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+\r
+ if(csiz->effective_bits >= 0 && !inext) {\r
+ ASN_DEBUG("Encoding %" ASN_PRI_SIZE " bytes (%ld), length in %d bits", st->size,\r
+ size_in_units - csiz->lower_bound, csiz->effective_bits);\r
+ ret = per_put_few_bits(po, size_in_units - csiz->lower_bound,\r
+ csiz->effective_bits);\r
+ if(ret) ASN__ENCODE_FAILED;\r
+ ret = OCTET_STRING_per_put_characters(po, st->buf, size_in_units, bpc,\r
+ unit_bits, cval->lower_bound,\r
+ cval->upper_bound, pc);\r
+ if(ret) ASN__ENCODE_FAILED;\r
+ ASN__ENCODED_OK(er);\r
+ }\r
+\r
+ ASN_DEBUG("Encoding %" ASN_PRI_SIZE " bytes", st->size);\r
+\r
+ buf = st->buf;\r
+ ASN_DEBUG("Encoding %" ASN_PRI_SIZE " in units", size_in_units);\r
+ do {\r
+ int need_eom = 0;\r
+ ssize_t may_save = uper_put_length(po, size_in_units, &need_eom);\r
+ if(may_save < 0) ASN__ENCODE_FAILED;\r
+\r
+ ASN_DEBUG("Encoding %" ASN_PRI_SSIZE " of %" ASN_PRI_SIZE "%s", may_save, size_in_units,\r
+ need_eom ? ",+EOM" : "");\r
+\r
+ ret = OCTET_STRING_per_put_characters(po, buf, may_save, bpc, unit_bits,\r
+ cval->lower_bound,\r
+ cval->upper_bound, pc);\r
+ if(ret) ASN__ENCODE_FAILED;\r
+\r
+ buf += may_save * bpc;\r
+ size_in_units -= may_save;\r
+ assert(!(may_save & 0x07) || !size_in_units);\r
+ if(need_eom && uper_put_length(po, 0, 0))\r
+ ASN__ENCODE_FAILED; /* End of Message length */\r
+ } while(size_in_units);\r
+\r
+ ASN__ENCODED_OK(er);\r
+}\r
+\r
+asn_dec_rval_t\r
+OCTET_STRING_decode_aper(const asn_codec_ctx_t *opt_codec_ctx,\r
+ const asn_TYPE_descriptor_t *td,\r
+ const asn_per_constraints_t *constraints,\r
+ void **sptr, asn_per_data_t *pd) {\r
+\r
+ const asn_OCTET_STRING_specifics_t *specs = td->specifics\r
+ ? (const asn_OCTET_STRING_specifics_t *)td->specifics\r
+ : &asn_SPC_OCTET_STRING_specs;\r
+ const asn_per_constraints_t *pc = constraints ? constraints\r
+ : td->encoding_constraints.per_constraints;\r
+ const asn_per_constraint_t *cval;\r
+ const asn_per_constraint_t *csiz;\r
+ asn_dec_rval_t rval = { RC_OK, 0 };\r
+ BIT_STRING_t *st = (BIT_STRING_t *)*sptr;\r
+ ssize_t consumed_myself = 0;\r
+ int repeat;\r
+ enum {\r
+ OS__BPC_BIT = 0,\r
+ OS__BPC_CHAR = 1,\r
+ OS__BPC_U16 = 2,\r
+ OS__BPC_U32 = 4\r
+ } bpc; /* Bytes per character */\r
+ unsigned int unit_bits;\r
+ unsigned int canonical_unit_bits;\r
+\r
+ (void)opt_codec_ctx;\r
+\r
+ if(pc) {\r
+ cval = &pc->value;\r
+ csiz = &pc->size;\r
+ } else {\r
+ cval = &asn_DEF_OCTET_STRING_constraints.value;\r
+ csiz = &asn_DEF_OCTET_STRING_constraints.size;\r
+ }\r
+\r
+ switch(specs->subvariant) {\r
+ default:\r
+/* case ASN_OSUBV_ANY:\r
+ ASN_DEBUG("Unrecognized subvariant %d", specs->subvariant);\r
+ RETURN(RC_FAIL);\r
+*/\r
+ case ASN_OSUBV_BIT:\r
+ canonical_unit_bits = unit_bits = 1;\r
+ bpc = OS__BPC_BIT;\r
+ break;\r
+ case ASN_OSUBV_ANY:\r
+ case ASN_OSUBV_STR:\r
+ canonical_unit_bits = unit_bits = 8;\r
+/* if(cval->flags & APC_CONSTRAINED)\r
+ unit_bits = cval->range_bits;\r
+*/\r
+ bpc = OS__BPC_CHAR;\r
+ break;\r
+ case ASN_OSUBV_U16:\r
+ canonical_unit_bits = unit_bits = 16;\r
+ if(cval->flags & APC_CONSTRAINED)\r
+ unit_bits = cval->range_bits;\r
+ bpc = OS__BPC_U16;\r
+ break;\r
+ case ASN_OSUBV_U32:\r
+ canonical_unit_bits = unit_bits = 32;\r
+ if(cval->flags & APC_CONSTRAINED)\r
+ unit_bits = cval->range_bits;\r
+ bpc = OS__BPC_U32;\r
+ break;\r
+ }\r
+\r
+ /*\r
+ * Allocate the string.\r
+ */\r
+ if(!st) {\r
+ st = (BIT_STRING_t *)(*sptr = CALLOC(1, specs->struct_size));\r
+ if(!st) RETURN(RC_FAIL);\r
+ }\r
+\r
+ ASN_DEBUG("PER Decoding %s size %ld .. %ld bits %d",\r
+ csiz->flags & APC_EXTENSIBLE ? "extensible" : "non-extensible",\r
+ csiz->lower_bound, csiz->upper_bound, csiz->effective_bits);\r
+\r
+ if(csiz->flags & APC_EXTENSIBLE) {\r
+ int inext = per_get_few_bits(pd, 1);\r
+ if(inext < 0) RETURN(RC_WMORE);\r
+ if(inext) {\r
+ csiz = &asn_DEF_OCTET_STRING_constraints.size;\r
+ cval = &asn_DEF_OCTET_STRING_constraints.value;\r
+ unit_bits = canonical_unit_bits;\r
+ }\r
+ }\r
+\r
+ if(csiz->effective_bits >= 0) {\r
+ FREEMEM(st->buf);\r
+ if(bpc) {\r
+ st->size = csiz->upper_bound * bpc;\r
+ } else {\r
+ st->size = (csiz->upper_bound + 7) >> 3;\r
+ }\r
+ st->buf = (uint8_t *)MALLOC(st->size + 1);\r
+ if(!st->buf) { st->size = 0; RETURN(RC_FAIL); }\r
+ }\r
+\r
+ /* X.691, #16.5: zero-length encoding */\r
+ /* X.691, #16.6: short fixed length encoding (up to 2 octets) */\r
+ /* X.691, #16.7: long fixed length encoding (up to 64K octets) */\r
+ if(csiz->effective_bits == 0) {\r
+ int ret;\r
+ if (st->size > 2) { /* X.691 #16 NOTE 1 */\r
+ if (aper_get_align(pd) < 0)\r
+ RETURN(RC_FAIL);\r
+ }\r
+ if(bpc) {\r
+ ASN_DEBUG("Decoding OCTET STRING size %ld",\r
+ csiz->upper_bound);\r
+ ret = OCTET_STRING_per_get_characters(pd, st->buf,\r
+ csiz->upper_bound, bpc, unit_bits,\r
+ cval->lower_bound, cval->upper_bound, pc);\r
+ if(ret > 0) RETURN(RC_FAIL);\r
+ } else {\r
+ ASN_DEBUG("Decoding BIT STRING size %ld",\r
+ csiz->upper_bound);\r
+ ret = per_get_many_bits(pd, st->buf, 0,\r
+ unit_bits * csiz->upper_bound);\r
+ }\r
+ if(ret < 0) RETURN(RC_WMORE);\r
+ consumed_myself += unit_bits * csiz->upper_bound;\r
+ st->buf[st->size] = 0;\r
+ if(bpc == 0) {\r
+ int ubs = (csiz->upper_bound & 0x7);\r
+ st->bits_unused = ubs ? 8 - ubs : 0;\r
+ }\r
+ RETURN(RC_OK);\r
+ }\r
+\r
+ st->size = 0;\r
+ do {\r
+ ssize_t raw_len;\r
+ ssize_t len_bytes;\r
+ ssize_t len_bits;\r
+ void *p;\r
+ int ret;\r
+\r
+ /* Get the PER length */\r
+ if (csiz->upper_bound - csiz->lower_bound == 0)\r
+ /* Indefinite length case */\r
+ raw_len = aper_get_length(pd, -1, csiz->effective_bits, &repeat);\r
+ else\r
+ raw_len = aper_get_length(pd, csiz->upper_bound - csiz->lower_bound + 1, csiz->effective_bits, &repeat);\r
+ repeat = 0;\r
+ if(raw_len < 0) RETURN(RC_WMORE);\r
+ raw_len += csiz->lower_bound;\r
+\r
+ ASN_DEBUG("Got PER length eb %ld, len %ld, %s (%s)",\r
+ (long)csiz->effective_bits, (long)raw_len,\r
+ repeat ? "repeat" : "once", td->name);\r
+\r
+ if (raw_len > 2) { /* X.691 #16 NOTE 1 */\r
+ if (aper_get_align(pd) < 0)\r
+ RETURN(RC_FAIL);\r
+ }\r
+\r
+ if(bpc) {\r
+ len_bytes = raw_len * bpc;\r
+ len_bits = len_bytes * unit_bits;\r
+ } else {\r
+ len_bits = raw_len;\r
+ len_bytes = (len_bits + 7) >> 3;\r
+ if(len_bits & 0x7)\r
+ st->bits_unused = 8 - (len_bits & 0x7);\r
+ /* len_bits be multiple of 16K if repeat is set */\r
+ }\r
+ p = REALLOC(st->buf, st->size + len_bytes + 1);\r
+ if(!p) RETURN(RC_FAIL);\r
+ st->buf = (uint8_t *)p;\r
+\r
+ if(bpc) {\r
+ ret = OCTET_STRING_per_get_characters(pd,\r
+ &st->buf[st->size], raw_len, bpc, unit_bits,\r
+ cval->lower_bound, cval->upper_bound, pc);\r
+ if(ret > 0) RETURN(RC_FAIL);\r
+ } else {\r
+ ret = per_get_many_bits(pd, &st->buf[st->size],\r
+ 0, len_bits);\r
+ }\r
+ if(ret < 0) RETURN(RC_WMORE);\r
+ st->size += len_bytes;\r
+ } while(repeat);\r
+ st->buf[st->size] = 0; /* nul-terminate */\r
+\r
+ return rval;\r
+}\r
+\r
+asn_enc_rval_t\r
+OCTET_STRING_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
+\r
+ const asn_OCTET_STRING_specifics_t *specs = td->specifics\r
+ ? (const asn_OCTET_STRING_specifics_t *)td->specifics\r
+ : &asn_SPC_OCTET_STRING_specs;\r
+ const asn_per_constraints_t *pc = constraints ? constraints\r
+ : td->encoding_constraints.per_constraints;\r
+ const asn_per_constraint_t *cval;\r
+ const asn_per_constraint_t *csiz;\r
+ const BIT_STRING_t *st = (const BIT_STRING_t *)sptr;\r
+ asn_enc_rval_t er = { 0, 0, 0 };\r
+ int inext = 0; /* Lies not within extension root */\r
+ unsigned int unit_bits;\r
+ unsigned int canonical_unit_bits;\r
+ unsigned int sizeinunits;\r
+ const uint8_t *buf;\r
+ int ret;\r
+ enum {\r
+ OS__BPC_BIT = 0,\r
+ OS__BPC_CHAR = 1,\r
+ OS__BPC_U16 = 2,\r
+ OS__BPC_U32 = 4\r
+ } bpc; /* Bytes per character */\r
+ int ct_extensible;\r
+\r
+ if(!st || (!st->buf && st->size))\r
+ ASN__ENCODE_FAILED;\r
+\r
+ if(pc) {\r
+ cval = &pc->value;\r
+ csiz = &pc->size;\r
+ } else {\r
+ cval = &asn_DEF_OCTET_STRING_constraints.value;\r
+ csiz = &asn_DEF_OCTET_STRING_constraints.size;\r
+ }\r
+ ct_extensible = csiz->flags & APC_EXTENSIBLE;\r
+\r
+ switch(specs->subvariant) {\r
+ default:\r
+ /* case ASN_OSUBV_ANY:\r
+ ASN__ENCODE_FAILED;\r
+ */\r
+ case ASN_OSUBV_BIT:\r
+ canonical_unit_bits = unit_bits = 1;\r
+ bpc = OS__BPC_BIT;\r
+ sizeinunits = st->size * 8 - (st->bits_unused & 0x07);\r
+ ASN_DEBUG("BIT STRING of %d bytes",\r
+ sizeinunits);\r
+ break;\r
+ case ASN_OSUBV_ANY:\r
+ case ASN_OSUBV_STR:\r
+ canonical_unit_bits = unit_bits = 8;\r
+/* if(cval->flags & APC_CONSTRAINED)\r
+ unit_bits = 8;\r
+*/\r
+ bpc = OS__BPC_CHAR;\r
+ sizeinunits = st->size;\r
+ break;\r
+ case ASN_OSUBV_U16:\r
+ canonical_unit_bits = unit_bits = 16;\r
+ if(cval->flags & APC_CONSTRAINED)\r
+ unit_bits = cval->range_bits;\r
+ bpc = OS__BPC_U16;\r
+ sizeinunits = st->size / 2;\r
+ break;\r
+ case ASN_OSUBV_U32:\r
+ canonical_unit_bits = unit_bits = 32;\r
+ if(cval->flags & APC_CONSTRAINED)\r
+ unit_bits = cval->range_bits;\r
+ bpc = OS__BPC_U32;\r
+ sizeinunits = st->size / 4;\r
+ break;\r
+ }\r
+\r
+ ASN_DEBUG("Encoding %s into %d units of %d bits"\r
+ " (%ld..%ld, effective %d)%s",\r
+ td->name, sizeinunits, unit_bits,\r
+ csiz->lower_bound, csiz->upper_bound,\r
+ csiz->effective_bits, ct_extensible ? " EXT" : "");\r
+\r
+ /* Figure out wheter size lies within PER visible constraint */\r
+\r
+ if(csiz->effective_bits >= 0) {\r
+ if((int)sizeinunits < csiz->lower_bound\r
+ || (int)sizeinunits > csiz->upper_bound) {\r
+ if(ct_extensible) {\r
+ cval = &asn_DEF_OCTET_STRING_constraints.value;\r
+ csiz = &asn_DEF_OCTET_STRING_constraints.size;\r
+ unit_bits = canonical_unit_bits;\r
+ inext = 1;\r
+ } else\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+ } else {\r
+ inext = 0;\r
+ }\r
+\r
+\r
+ if(ct_extensible) {\r
+ /* Declare whether length is [not] within extension root */\r
+ if(per_put_few_bits(po, inext, 1))\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+\r
+ /* X.691, #16.5: zero-length encoding */\r
+ /* X.691, #16.6: short fixed length encoding (up to 2 octets) */\r
+ /* X.691, #16.7: long fixed length encoding (up to 64K octets) */\r
+ if(csiz->effective_bits >= 0) {\r
+ ASN_DEBUG("Encoding %lu bytes (%ld), length in %d bits",\r
+ st->size, sizeinunits - csiz->lower_bound,\r
+ csiz->effective_bits);\r
+ if (csiz->effective_bits > 0) {\r
+ ret = aper_put_length(po, csiz->upper_bound - csiz->lower_bound + 1, sizeinunits - csiz->lower_bound);\r
+ if(ret) ASN__ENCODE_FAILED;\r
+ }\r
+ if (st->size > 2) { /* X.691 #16 NOTE 1 */\r
+ if (aper_put_align(po) < 0)\r
+ ASN__ENCODE_FAILED;\r
+ }\r
+ if(bpc) {\r
+ ret = OCTET_STRING_per_put_characters(po, st->buf,\r
+ sizeinunits, bpc, unit_bits,\r
+ cval->lower_bound, cval->upper_bound, pc);\r
+ } else {\r
+ ret = per_put_many_bits(po, st->buf,\r
+ sizeinunits * unit_bits);\r
+ }\r
+ if(ret) ASN__ENCODE_FAILED;\r
+ ASN__ENCODED_OK(er);\r
+ }\r
+\r
+ ASN_DEBUG("Encoding %lu bytes", st->size);\r
+\r
+ if(sizeinunits == 0) {\r
+ if(aper_put_length(po, -1, 0))\r
+ ASN__ENCODE_FAILED;\r
+ ASN__ENCODED_OK(er);\r
+ }\r
+\r
+ buf = st->buf;\r
+ while(sizeinunits) {\r
+ ssize_t maySave = aper_put_length(po, -1, sizeinunits);\r
+\r
+ if(maySave < 0) ASN__ENCODE_FAILED;\r
+\r
+ ASN_DEBUG("Encoding %ld of %ld",\r
+ (long)maySave, (long)sizeinunits);\r
+\r
+ if(bpc) {\r
+ ret = OCTET_STRING_per_put_characters(po, buf,\r
+ maySave, bpc, unit_bits,\r
+ cval->lower_bound, cval->upper_bound, pc);\r
+ } else {\r
+ ret = per_put_many_bits(po, buf, maySave * unit_bits);\r
+ }\r
+ if(ret) ASN__ENCODE_FAILED;\r
+\r
+ if(bpc)\r
+ buf += maySave * bpc;\r
+ else\r
+ buf += maySave >> 3;\r
+ sizeinunits -= maySave;\r
+ assert(!(maySave & 0x07) || !sizeinunits);\r
+ }\r
+\r
+ ASN__ENCODED_OK(er);\r
+}\r
+\r
+#endif /* ASN_DISABLE_PER_SUPPORT */\r
+\r
+int\r
+OCTET_STRING_print(const asn_TYPE_descriptor_t *td, const void *sptr,\r
+ int ilevel, asn_app_consume_bytes_f *cb, void *app_key) {\r
+ const char * const h2c = "0123456789ABCDEF";\r
+ const OCTET_STRING_t *st = (const OCTET_STRING_t *)sptr;\r
+ char scratch[16 * 3 + 4];\r
+ char *p = scratch;\r
+ uint8_t *buf;\r
+ uint8_t *end;\r
+ size_t i;\r
+\r
+ (void)td; /* Unused argument */\r
+\r
+ if(!st || (!st->buf && st->size))\r
+ return (cb("<absent>", 8, app_key) < 0) ? -1 : 0;\r
+\r
+ /*\r
+ * Dump the contents of the buffer in hexadecimal.\r
+ */\r
+ buf = st->buf;\r
+ end = buf + st->size;\r
+ for(i = 0; buf < end; buf++, i++) {\r
+ if(!(i % 16) && (i || st->size > 16)) {\r
+ if(cb(scratch, p - scratch, app_key) < 0)\r
+ return -1;\r
+ _i_INDENT(1);\r
+ p = scratch;\r
+ }\r
+ *p++ = h2c[(*buf >> 4) & 0x0F];\r
+ *p++ = h2c[*buf & 0x0F];\r
+ *p++ = 0x20;\r
+ }\r
+\r
+ if(p > scratch) {\r
+ p--; /* Remove the tail space */\r
+ if(cb(scratch, p - scratch, app_key) < 0)\r
+ return -1;\r
+ }\r
+\r
+ return 0;\r
+}\r
+\r
+int\r
+OCTET_STRING_print_utf8(const asn_TYPE_descriptor_t *td, const void *sptr,\r
+ int ilevel, asn_app_consume_bytes_f *cb,\r
+ void *app_key) {\r
+ const OCTET_STRING_t *st = (const OCTET_STRING_t *)sptr;\r
+\r
+ (void)td; /* Unused argument */\r
+ (void)ilevel; /* Unused argument */\r
+\r
+ if(st && (st->buf || !st->size)) {\r
+ return (cb(st->buf, st->size, app_key) < 0) ? -1 : 0;\r
+ } else {\r
+ return (cb("<absent>", 8, app_key) < 0) ? -1 : 0;\r
+ }\r
+}\r
+\r
+void\r
+OCTET_STRING_free(const asn_TYPE_descriptor_t *td, void *sptr,\r
+ enum asn_struct_free_method method) {\r
+ OCTET_STRING_t *st = (OCTET_STRING_t *)sptr;\r
+ const asn_OCTET_STRING_specifics_t *specs;\r
+ asn_struct_ctx_t *ctx;\r
+ struct _stack *stck;\r
+\r
+ if(!td || !st)\r
+ return;\r
+\r
+ specs = td->specifics\r
+ ? (const asn_OCTET_STRING_specifics_t *)td->specifics\r
+ : &asn_SPC_OCTET_STRING_specs;\r
+ ctx = (asn_struct_ctx_t *)((char *)st + specs->ctx_offset);\r
+\r
+ ASN_DEBUG("Freeing %s as OCTET STRING", td->name);\r
+\r
+ if(st->buf) {\r
+ FREEMEM(st->buf);\r
+ st->buf = 0;\r
+ }\r
+\r
+ /*\r
+ * Remove decode-time stack.\r
+ */\r
+ stck = (struct _stack *)ctx->ptr;\r
+ if(stck) {\r
+ while(stck->tail) {\r
+ struct _stack_el *sel = stck->tail;\r
+ stck->tail = sel->prev;\r
+ FREEMEM(sel);\r
+ }\r
+ FREEMEM(stck);\r
+ }\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(sptr, 0,\r
+ td->specifics\r
+ ? ((const asn_OCTET_STRING_specifics_t *)(td->specifics))\r
+ ->struct_size\r
+ : sizeof(OCTET_STRING_t));\r
+ break;\r
+ }\r
+}\r
+\r
+/*\r
+ * Conversion routines.\r
+ */\r
+int\r
+OCTET_STRING_fromBuf(OCTET_STRING_t *st, const char *str, int len) {\r
+ void *buf;\r
+\r
+ if(st == 0 || (str == 0 && len)) {\r
+ errno = EINVAL;\r
+ return -1;\r
+ }\r
+\r
+ /*\r
+ * Clear the OCTET STRING.\r
+ */\r
+ if(str == NULL) {\r
+ FREEMEM(st->buf);\r
+ st->buf = 0;\r
+ st->size = 0;\r
+ return 0;\r
+ }\r
+\r
+ /* Determine the original string size, if not explicitly given */\r
+ if(len < 0)\r
+ len = strlen(str);\r
+\r
+ /* Allocate and fill the memory */\r
+ buf = MALLOC(len + 1);\r
+ if(buf == NULL)\r
+ return -1;\r
+\r
+ memcpy(buf, str, len);\r
+ ((uint8_t *)buf)[len] = '\0'; /* Couldn't use memcpy(len+1)! */\r
+ FREEMEM(st->buf);\r
+ st->buf = (uint8_t *)buf;\r
+ st->size = len;\r
+\r
+ return 0;\r
+}\r
+\r
+OCTET_STRING_t *\r
+OCTET_STRING_new_fromBuf(const asn_TYPE_descriptor_t *td, const char *str,\r
+ int len) {\r
+ const asn_OCTET_STRING_specifics_t *specs =\r
+ td->specifics ? (const asn_OCTET_STRING_specifics_t *)td->specifics\r
+ : &asn_SPC_OCTET_STRING_specs;\r
+ OCTET_STRING_t *st;\r
+\r
+ st = (OCTET_STRING_t *)CALLOC(1, specs->struct_size);\r
+ if(st && str && OCTET_STRING_fromBuf(st, str, len)) {\r
+ FREEMEM(st);\r
+ st = NULL;\r
+ }\r
+\r
+ return st;\r
+}\r
+\r
+/*\r
+ * Lexicographically compare the common prefix of both strings,\r
+ * and if it is the same return -1 for the smallest string.\r
+ */\r
+int\r
+OCTET_STRING_compare(const asn_TYPE_descriptor_t *td, const void *aptr,\r
+ const void *bptr) {\r
+ const asn_OCTET_STRING_specifics_t *specs = td->specifics;\r
+ const OCTET_STRING_t *a = aptr;\r
+ const OCTET_STRING_t *b = bptr;\r
+\r
+ assert(!specs || specs->subvariant != ASN_OSUBV_BIT);\r
+\r
+ if(a && b) {\r
+ size_t common_prefix_size = a->size <= b->size ? a->size : b->size;\r
+ int ret = memcmp(a->buf, b->buf, common_prefix_size);\r
+ if(ret == 0) {\r
+ /* Figure out which string with equal prefixes is longer. */\r
+ if(a->size < b->size) {\r
+ return -1;\r
+ } else if(a->size > b->size) {\r
+ return 1;\r
+ } else {\r
+ return 0;\r
+ }\r
+ } else {\r
+ return ret < 0 ? -1 : 1;\r
+ }\r
+ } else if(!a && !b) {\r
+ return 0;\r
+ } else if(!a) {\r
+ return -1;\r
+ } else {\r
+ return 1;\r
+ }\r
+\r
+}\r
+\r
+/*\r
+ * Biased function for randomizing character values around their limits.\r
+ */\r
+static uint32_t\r
+OCTET_STRING__random_char(unsigned long lb, unsigned long ub) {\r
+ assert(lb <= ub);\r
+ switch(asn_random_between(0, 16)) {\r
+ case 0:\r
+ if(lb < ub) return lb + 1;\r
+ /* Fall through */\r
+ case 1:\r
+ return lb;\r
+ case 2:\r
+ if(lb < ub) return ub - 1;\r
+ /* Fall through */\r
+ case 3:\r
+ return ub;\r
+ default:\r
+ return asn_random_between(lb, ub);\r
+ }\r
+}\r
+\r
+\r
+size_t\r
+OCTET_STRING_random_length_constrained(\r
+ const asn_TYPE_descriptor_t *td,\r
+ const asn_encoding_constraints_t *constraints, size_t max_length) {\r
+ const unsigned lengths[] = {0, 1, 2, 3, 4, 8,\r
+ 126, 127, 128, 16383, 16384, 16385,\r
+ 65534, 65535, 65536, 65537};\r
+ size_t rnd_len;\r
+\r
+ /* Figure out how far we should go */\r
+ rnd_len = lengths[asn_random_between(\r
+ 0, sizeof(lengths) / sizeof(lengths[0]) - 1)];\r
+\r
+ if(!constraints || !constraints->per_constraints)\r
+ constraints = &td->encoding_constraints;\r
+ if(constraints->per_constraints) {\r
+ const asn_per_constraint_t *pc = &constraints->per_constraints->size;\r
+ if(pc->flags & APC_CONSTRAINED) {\r
+ long suggested_upper_bound = pc->upper_bound < (ssize_t)max_length\r
+ ? pc->upper_bound\r
+ : (ssize_t)max_length;\r
+ if(max_length <= (size_t)pc->lower_bound) {\r
+ return pc->lower_bound;\r
+ }\r
+ if(pc->flags & APC_EXTENSIBLE) {\r
+ switch(asn_random_between(0, 5)) {\r
+ case 0:\r
+ if(pc->lower_bound > 0) {\r
+ rnd_len = pc->lower_bound - 1;\r
+ break;\r
+ }\r
+ /* Fall through */\r
+ case 1:\r
+ rnd_len = pc->upper_bound + 1;\r
+ break;\r
+ case 2:\r
+ /* Keep rnd_len from the table */\r
+ if(rnd_len <= max_length) {\r
+ break;\r
+ }\r
+ /* Fall through */\r
+ default:\r
+ rnd_len = asn_random_between(pc->lower_bound,\r
+ suggested_upper_bound);\r
+ }\r
+ } else {\r
+ rnd_len =\r
+ asn_random_between(pc->lower_bound, suggested_upper_bound);\r
+ }\r
+ } else {\r
+ rnd_len = asn_random_between(0, max_length);\r
+ }\r
+ } else if(rnd_len > max_length) {\r
+ rnd_len = asn_random_between(0, max_length);\r
+ }\r
+\r
+ return rnd_len;\r
+}\r
+\r
+asn_random_fill_result_t\r
+OCTET_STRING_random_fill(const asn_TYPE_descriptor_t *td, void **sptr,\r
+ const asn_encoding_constraints_t *constraints,\r
+ size_t max_length) {\r
+ const asn_OCTET_STRING_specifics_t *specs = td->specifics\r
+ ? (const asn_OCTET_STRING_specifics_t *)td->specifics\r
+ : &asn_SPC_OCTET_STRING_specs;\r
+ asn_random_fill_result_t result_ok = {ARFILL_OK, 1};\r
+ asn_random_fill_result_t result_failed = {ARFILL_FAILED, 0};\r
+ asn_random_fill_result_t result_skipped = {ARFILL_SKIPPED, 0};\r
+ unsigned int unit_bytes = 1;\r
+ unsigned long clb = 0; /* Lower bound on char */\r
+ unsigned long cub = 255; /* Higher bound on char value */\r
+ uint8_t *buf;\r
+ uint8_t *bend;\r
+ uint8_t *b;\r
+ size_t rnd_len;\r
+ OCTET_STRING_t *st;\r
+\r
+ if(max_length == 0 && !*sptr) return result_skipped;\r
+\r
+ switch(specs->subvariant) {\r
+ default:\r
+ case ASN_OSUBV_ANY:\r
+ return result_failed;\r
+ case ASN_OSUBV_BIT:\r
+ /* Handled by BIT_STRING itself. */\r
+ return result_failed;\r
+ case ASN_OSUBV_STR:\r
+ unit_bytes = 1;\r
+ clb = 0;\r
+ cub = 255;\r
+ break;\r
+ case ASN_OSUBV_U16:\r
+ unit_bytes = 2;\r
+ clb = 0;\r
+ cub = 65535;\r
+ break;\r
+ case ASN_OSUBV_U32:\r
+ unit_bytes = 4;\r
+ clb = 0;\r
+ cub = 0x10FFFF;\r
+ break;\r
+ }\r
+\r
+ if(!constraints || !constraints->per_constraints)\r
+ constraints = &td->encoding_constraints;\r
+ if(constraints->per_constraints) {\r
+ const asn_per_constraint_t *pc = &constraints->per_constraints->value;\r
+ if(pc->flags & APC_SEMI_CONSTRAINED) {\r
+ clb = pc->lower_bound;\r
+ } else if(pc->flags & APC_CONSTRAINED) {\r
+ clb = pc->lower_bound;\r
+ cub = pc->upper_bound;\r
+ }\r
+ }\r
+\r
+ rnd_len =\r
+ OCTET_STRING_random_length_constrained(td, constraints, max_length);\r
+\r
+ buf = CALLOC(unit_bytes, rnd_len + 1);\r
+ if(!buf) return result_failed;\r
+\r
+ bend = &buf[unit_bytes * rnd_len];\r
+\r
+ switch(unit_bytes) {\r
+ case 1:\r
+ for(b = buf; b < bend; b += unit_bytes) {\r
+ *(uint8_t *)b = OCTET_STRING__random_char(clb, cub);\r
+ }\r
+ *(uint8_t *)b = 0;\r
+ break;\r
+ case 2:\r
+ for(b = buf; b < bend; b += unit_bytes) {\r
+ uint32_t code = OCTET_STRING__random_char(clb, cub);\r
+ b[0] = code >> 8;\r
+ b[1] = code;\r
+ }\r
+ *(uint16_t *)b = 0;\r
+ break;\r
+ case 4:\r
+ for(b = buf; b < bend; b += unit_bytes) {\r
+ uint32_t code = OCTET_STRING__random_char(clb, cub);\r
+ b[0] = code >> 24;\r
+ b[1] = code >> 16;\r
+ b[2] = code >> 8;\r
+ b[3] = code;\r
+ }\r
+ *(uint32_t *)b = 0;\r
+ break;\r
+ }\r
+\r
+ if(*sptr) {\r
+ st = *sptr;\r
+ FREEMEM(st->buf);\r
+ } else {\r
+ st = (OCTET_STRING_t *)(*sptr = CALLOC(1, specs->struct_size));\r
+ if(!st) {\r
+ FREEMEM(buf);\r
+ return result_failed;\r
+ }\r
+ }\r
+\r
+ st->buf = buf;\r
+ st->size = unit_bytes * rnd_len;\r
+\r
+ result_ok.length = st->size;\r
+ return result_ok;\r
+}\r
Code Review / ric-app / kpimon.git / blobdiff