| File: | asn1/asn1c/constr_SET_OF.c |
| Warning: | line 399, column 5 1st function call argument is an uninitialized value |
Press '?' to see keyboard shortcuts
Keyboard shortcuts:
| 1 | /*- | ||||||
| 2 | * Copyright (c) 2003, 2004, 2005 Lev Walkin <vlm@lionet.info>. | ||||||
| 3 | * All rights reserved. | ||||||
| 4 | * Redistribution and modifications are permitted subject to BSD license. | ||||||
| 5 | */ | ||||||
| 6 | #include <asn_internal.h> | ||||||
| 7 | #include <constr_SET_OF.h> | ||||||
| 8 | #include <asn_SET_OF.h> | ||||||
| 9 | |||||||
| 10 | /* | ||||||
| 11 | * Number of bytes left for this structure. | ||||||
| 12 | * (ctx->left) indicates the number of bytes _transferred_ for the structure. | ||||||
| 13 | * (size) contains the number of bytes in the buffer passed. | ||||||
| 14 | */ | ||||||
| 15 | #define LEFT((size<(size_t)ctx->left)?size:(size_t)ctx->left) ((size<(size_t)ctx->left)?size:(size_t)ctx->left) | ||||||
| 16 | |||||||
| 17 | /* | ||||||
| 18 | * If the subprocessor function returns with an indication that it wants | ||||||
| 19 | * more data, it may well be a fatal decoding problem, because the | ||||||
| 20 | * size is constrained by the <TLV>'s L, even if the buffer size allows | ||||||
| 21 | * reading more data. | ||||||
| 22 | * For example, consider the buffer containing the following TLVs: | ||||||
| 23 | * <T:5><L:1><V> <T:6>... | ||||||
| 24 | * The TLV length clearly indicates that one byte is expected in V, but | ||||||
| 25 | * if the V processor returns with "want more data" even if the buffer | ||||||
| 26 | * contains way more data than the V processor have seen. | ||||||
| 27 | */ | ||||||
| 28 | #define SIZE_VIOLATION(ctx->left >= 0 && (size_t)ctx->left <= size ) (ctx->left >= 0 && (size_t)ctx->left <= size) | ||||||
| 29 | |||||||
| 30 | /* | ||||||
| 31 | * This macro "eats" the part of the buffer which is definitely "consumed", | ||||||
| 32 | * i.e. was correctly converted into local representation or rightfully skipped. | ||||||
| 33 | */ | ||||||
| 34 | #undef ADVANCE | ||||||
| 35 | #define ADVANCE(num_bytes)do { size_t num = num_bytes; ptr = ((const char *)ptr) + num; size -= num; if(ctx->left >= 0) ctx->left -= num; consumed_myself += num; } while(0) do { \ | ||||||
| 36 | size_t num = num_bytes; \ | ||||||
| 37 | ptr = ((const char *)ptr) + num;\ | ||||||
| 38 | size -= num; \ | ||||||
| 39 | if(ctx->left >= 0) \ | ||||||
| 40 | ctx->left -= num; \ | ||||||
| 41 | consumed_myself += num; \ | ||||||
| 42 | } while(0) | ||||||
| 43 | |||||||
| 44 | /* | ||||||
| 45 | * Switch to the next phase of parsing. | ||||||
| 46 | */ | ||||||
| 47 | #undef NEXT_PHASE | ||||||
| 48 | #undef PHASE_OUT | ||||||
| 49 | #define NEXT_PHASE(ctx)do { ctx->phase++; ctx->step = 0; } while(0) do { \ | ||||||
| 50 | ctx->phase++; \ | ||||||
| 51 | ctx->step = 0; \ | ||||||
| 52 | } while(0) | ||||||
| 53 | #define PHASE_OUT(ctx)do { ctx->phase = 10; } while(0) do { ctx->phase = 10; } while(0) | ||||||
| 54 | |||||||
| 55 | /* | ||||||
| 56 | * Return a standardized complex structure. | ||||||
| 57 | */ | ||||||
| 58 | #undef RETURN | ||||||
| 59 | #define RETURN(_code)do { rval.code = _code; rval.consumed = consumed_myself; return rval; } while(0) do { \ | ||||||
| 60 | rval.code = _code; \ | ||||||
| 61 | rval.consumed = consumed_myself;\ | ||||||
| 62 | return rval; \ | ||||||
| 63 | } while(0) | ||||||
| 64 | |||||||
| 65 | /* | ||||||
| 66 | * The decoder of the SET OF type. | ||||||
| 67 | */ | ||||||
| 68 | asn_dec_rval_t | ||||||
| 69 | SET_OF_decode_ber(asn_codec_ctx_t *opt_codec_ctx, asn_TYPE_descriptor_t *td, | ||||||
| 70 | void **struct_ptr, const void *ptr, size_t size, int tag_mode) { | ||||||
| 71 | /* | ||||||
| 72 | * Bring closer parts of structure description. | ||||||
| 73 | */ | ||||||
| 74 | asn_SET_OF_specifics_t *specs = (asn_SET_OF_specifics_t *)td->specifics; | ||||||
| 75 | asn_TYPE_member_t *elm = td->elements; /* Single one */ | ||||||
| 76 | |||||||
| 77 | /* | ||||||
| 78 | * Parts of the structure being constructed. | ||||||
| 79 | */ | ||||||
| 80 | void *st = *struct_ptr; /* Target structure. */ | ||||||
| 81 | asn_struct_ctx_t *ctx; /* Decoder context */ | ||||||
| 82 | |||||||
| 83 | ber_tlv_tag_t tlv_tag; /* T from TLV */ | ||||||
| 84 | asn_dec_rval_t rval; /* Return code from subparsers */ | ||||||
| 85 | |||||||
| 86 | ssize_t consumed_myself = 0; /* Consumed bytes from ptr */ | ||||||
| 87 | |||||||
| 88 | ASN_DEBUG("Decoding %s as SET OF", td->name); | ||||||
| 89 | |||||||
| 90 | /* | ||||||
| 91 | * Create the target structure if it is not present already. | ||||||
| 92 | */ | ||||||
| 93 | if(st == 0) { | ||||||
| 94 | st = *struct_ptr = CALLOC(1, specs->struct_size)calloc(1, specs->struct_size); | ||||||
| 95 | if(st == 0) { | ||||||
| 96 | RETURN(RC_FAIL)do { rval.code = RC_FAIL; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 97 | } | ||||||
| 98 | } | ||||||
| 99 | |||||||
| 100 | /* | ||||||
| 101 | * Restore parsing context. | ||||||
| 102 | */ | ||||||
| 103 | ctx = (asn_struct_ctx_t *)((char *)st + specs->ctx_offset); | ||||||
| 104 | |||||||
| 105 | /* | ||||||
| 106 | * Start to parse where left previously | ||||||
| 107 | */ | ||||||
| 108 | switch(ctx->phase) { | ||||||
| 109 | case 0: | ||||||
| 110 | /* | ||||||
| 111 | * PHASE 0. | ||||||
| 112 | * Check that the set of tags associated with given structure | ||||||
| 113 | * perfectly fits our expectations. | ||||||
| 114 | */ | ||||||
| 115 | |||||||
| 116 | rval = ber_check_tags(opt_codec_ctx, td, ctx, ptr, size, | ||||||
| 117 | tag_mode, 1, &ctx->left, 0); | ||||||
| 118 | if(rval.code != RC_OK) { | ||||||
| 119 | ASN_DEBUG("%s tagging check failed: %d", | ||||||
| 120 | td->name, rval.code); | ||||||
| 121 | return rval; | ||||||
| 122 | } | ||||||
| 123 | |||||||
| 124 | if(ctx->left >= 0) | ||||||
| 125 | ctx->left += rval.consumed; /* ?Substracted below! */ | ||||||
| 126 | ADVANCE(rval.consumed)do { size_t num = rval.consumed; ptr = ((const char *)ptr) + num ; size -= num; if(ctx->left >= 0) ctx->left -= num; consumed_myself += num; } while(0); | ||||||
| 127 | |||||||
| 128 | ASN_DEBUG("Structure consumes %ld bytes, " | ||||||
| 129 | "buffer %ld", (long)ctx->left, (long)size); | ||||||
| 130 | |||||||
| 131 | NEXT_PHASE(ctx)do { ctx->phase++; ctx->step = 0; } while(0); | ||||||
| 132 | /* Fall through */ | ||||||
| 133 | case 1: | ||||||
| 134 | /* | ||||||
| 135 | * PHASE 1. | ||||||
| 136 | * From the place where we've left it previously, | ||||||
| 137 | * try to decode the next item. | ||||||
| 138 | */ | ||||||
| 139 | for(;; ctx->step = 0) { | ||||||
| 140 | ssize_t tag_len; /* Length of TLV's T */ | ||||||
| 141 | |||||||
| 142 | if(ctx->step & 1) | ||||||
| 143 | goto microphase2; | ||||||
| 144 | |||||||
| 145 | /* | ||||||
| 146 | * MICROPHASE 1: Synchronize decoding. | ||||||
| 147 | */ | ||||||
| 148 | |||||||
| 149 | if(ctx->left == 0) { | ||||||
| 150 | ASN_DEBUG("End of SET OF %s", td->name); | ||||||
| 151 | /* | ||||||
| 152 | * No more things to decode. | ||||||
| 153 | * Exit out of here. | ||||||
| 154 | */ | ||||||
| 155 | PHASE_OUT(ctx)do { ctx->phase = 10; } while(0); | ||||||
| 156 | RETURN(RC_OK)do { rval.code = RC_OK; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 157 | } | ||||||
| 158 | |||||||
| 159 | /* | ||||||
| 160 | * Fetch the T from TLV. | ||||||
| 161 | */ | ||||||
| 162 | tag_len = ber_fetch_tag(ptr, LEFT((size<(size_t)ctx->left)?size:(size_t)ctx->left), &tlv_tag); | ||||||
| 163 | switch(tag_len) { | ||||||
| 164 | case 0: if(!SIZE_VIOLATION(ctx->left >= 0 && (size_t)ctx->left <= size )) RETURN(RC_WMORE)do { rval.code = RC_WMORE; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 165 | /* Fall through */ | ||||||
| 166 | case -1: RETURN(RC_FAIL)do { rval.code = RC_FAIL; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 167 | } | ||||||
| 168 | |||||||
| 169 | if(ctx->left < 0 && ((const uint8_t *)ptr)[0] == 0) { | ||||||
| 170 | if(LEFT((size<(size_t)ctx->left)?size:(size_t)ctx->left) < 2) { | ||||||
| 171 | if(SIZE_VIOLATION(ctx->left >= 0 && (size_t)ctx->left <= size )) | ||||||
| 172 | RETURN(RC_FAIL)do { rval.code = RC_FAIL; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 173 | else | ||||||
| 174 | RETURN(RC_WMORE)do { rval.code = RC_WMORE; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 175 | } else if(((const uint8_t *)ptr)[1] == 0) { | ||||||
| 176 | /* | ||||||
| 177 | * Found the terminator of the | ||||||
| 178 | * indefinite length structure. | ||||||
| 179 | */ | ||||||
| 180 | break; | ||||||
| 181 | } | ||||||
| 182 | } | ||||||
| 183 | |||||||
| 184 | /* Outmost tag may be unknown and cannot be fetched/compared */ | ||||||
| 185 | if(elm->tag != (ber_tlv_tag_t)-1) { | ||||||
| 186 | if(BER_TAGS_EQUAL(tlv_tag, elm->tag)((tlv_tag) == (elm->tag))) { | ||||||
| 187 | /* | ||||||
| 188 | * The new list member of expected type has arrived. | ||||||
| 189 | */ | ||||||
| 190 | } else { | ||||||
| 191 | ASN_DEBUG("Unexpected tag %s fixed SET OF %s", | ||||||
| 192 | ber_tlv_tag_string(tlv_tag), td->name); | ||||||
| 193 | ASN_DEBUG("%s SET OF has tag %s", | ||||||
| 194 | td->name, ber_tlv_tag_string(elm->tag)); | ||||||
| 195 | RETURN(RC_FAIL)do { rval.code = RC_FAIL; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 196 | } | ||||||
| 197 | } | ||||||
| 198 | |||||||
| 199 | /* | ||||||
| 200 | * MICROPHASE 2: Invoke the member-specific decoder. | ||||||
| 201 | */ | ||||||
| 202 | ctx->step |= 1; /* Confirm entering next microphase */ | ||||||
| 203 | microphase2: | ||||||
| 204 | |||||||
| 205 | /* | ||||||
| 206 | * Invoke the member fetch routine according to member's type | ||||||
| 207 | */ | ||||||
| 208 | rval = elm->type->ber_decoder(opt_codec_ctx, | ||||||
| 209 | elm->type, &ctx->ptr, ptr, LEFT((size<(size_t)ctx->left)?size:(size_t)ctx->left), 0); | ||||||
| 210 | ASN_DEBUG("In %s SET OF %s code %d consumed %d", | ||||||
| 211 | td->name, elm->type->name, | ||||||
| 212 | rval.code, (int)rval.consumed); | ||||||
| 213 | switch(rval.code) { | ||||||
| 214 | case RC_OK: | ||||||
| 215 | { | ||||||
| 216 | asn_anonymous_set_ *list = _A_SET_FROM_VOID(st)((asn_anonymous_set_ *)(st)); | ||||||
| 217 | if(ASN_SET_ADD(list, ctx->ptr)asn_set_add((list), (ctx->ptr)) != 0) | ||||||
| 218 | RETURN(RC_FAIL)do { rval.code = RC_FAIL; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 219 | else | ||||||
| 220 | ctx->ptr = 0; | ||||||
| 221 | } | ||||||
| 222 | break; | ||||||
| 223 | case RC_WMORE: /* More data expected */ | ||||||
| 224 | if(!SIZE_VIOLATION(ctx->left >= 0 && (size_t)ctx->left <= size )) { | ||||||
| 225 | ADVANCE(rval.consumed)do { size_t num = rval.consumed; ptr = ((const char *)ptr) + num ; size -= num; if(ctx->left >= 0) ctx->left -= num; consumed_myself += num; } while(0); | ||||||
| 226 | RETURN(RC_WMORE)do { rval.code = RC_WMORE; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 227 | } | ||||||
| 228 | /* Fall through */ | ||||||
| 229 | case RC_FAIL: /* Fatal error */ | ||||||
| 230 | ASN_STRUCT_FREE(*elm->type, ctx->ptr)(*elm->type).free_struct(&(*elm->type),ctx->ptr, 0); | ||||||
| 231 | ctx->ptr = 0; | ||||||
| 232 | RETURN(RC_FAIL)do { rval.code = RC_FAIL; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 233 | } /* switch(rval) */ | ||||||
| 234 | |||||||
| 235 | ADVANCE(rval.consumed)do { size_t num = rval.consumed; ptr = ((const char *)ptr) + num ; size -= num; if(ctx->left >= 0) ctx->left -= num; consumed_myself += num; } while(0); | ||||||
| 236 | } /* for(all list members) */ | ||||||
| 237 | |||||||
| 238 | NEXT_PHASE(ctx)do { ctx->phase++; ctx->step = 0; } while(0); | ||||||
| 239 | case 2: | ||||||
| 240 | /* | ||||||
| 241 | * Read in all "end of content" TLVs. | ||||||
| 242 | */ | ||||||
| 243 | while(ctx->left < 0) { | ||||||
| 244 | if(LEFT((size<(size_t)ctx->left)?size:(size_t)ctx->left) < 2) { | ||||||
| 245 | if(LEFT((size<(size_t)ctx->left)?size:(size_t)ctx->left) > 0 && ((const char *)ptr)[0] != 0) { | ||||||
| 246 | /* Unexpected tag */ | ||||||
| 247 | RETURN(RC_FAIL)do { rval.code = RC_FAIL; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 248 | } else { | ||||||
| 249 | RETURN(RC_WMORE)do { rval.code = RC_WMORE; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 250 | } | ||||||
| 251 | } | ||||||
| 252 | if(((const char *)ptr)[0] == 0 | ||||||
| 253 | && ((const char *)ptr)[1] == 0) { | ||||||
| 254 | ADVANCE(2)do { size_t num = 2; ptr = ((const char *)ptr) + num; size -= num; if(ctx->left >= 0) ctx->left -= num; consumed_myself += num; } while(0); | ||||||
| 255 | ctx->left++; | ||||||
| 256 | } else { | ||||||
| 257 | RETURN(RC_FAIL)do { rval.code = RC_FAIL; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 258 | } | ||||||
| 259 | } | ||||||
| 260 | |||||||
| 261 | PHASE_OUT(ctx)do { ctx->phase = 10; } while(0); | ||||||
| 262 | } | ||||||
| 263 | |||||||
| 264 | RETURN(RC_OK)do { rval.code = RC_OK; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 265 | } | ||||||
| 266 | |||||||
| 267 | /* | ||||||
| 268 | * Internally visible buffer holding a single encoded element. | ||||||
| 269 | */ | ||||||
| 270 | struct _el_buffer { | ||||||
| 271 | uint8_t *buf; | ||||||
| 272 | size_t length; | ||||||
| 273 | size_t size; | ||||||
| 274 | }; | ||||||
| 275 | /* Append bytes to the above structure */ | ||||||
| 276 | static int _el_addbytes(const void *buffer, size_t size, void *el_buf_ptr) { | ||||||
| 277 | struct _el_buffer *el_buf = (struct _el_buffer *)el_buf_ptr; | ||||||
| 278 | |||||||
| 279 | if(el_buf->length + size > el_buf->size) | ||||||
| 280 | return -1; | ||||||
| 281 | |||||||
| 282 | memcpy(el_buf->buf + el_buf->length, buffer, size); | ||||||
| 283 | |||||||
| 284 | el_buf->length += size; | ||||||
| 285 | return 0; | ||||||
| 286 | } | ||||||
| 287 | static int _el_buf_cmp(const void *ap, const void *bp) { | ||||||
| 288 | const struct _el_buffer *a = (const struct _el_buffer *)ap; | ||||||
| 289 | const struct _el_buffer *b = (const struct _el_buffer *)bp; | ||||||
| 290 | int ret; | ||||||
| 291 | size_t common_len; | ||||||
| 292 | |||||||
| 293 | if(a->length < b->length) | ||||||
| 294 | common_len = a->length; | ||||||
| 295 | else | ||||||
| 296 | common_len = b->length; | ||||||
| 297 | |||||||
| 298 | ret = memcmp(a->buf, b->buf, common_len); | ||||||
| 299 | if(ret == 0) { | ||||||
| 300 | if(a->length < b->length) | ||||||
| 301 | ret = -1; | ||||||
| 302 | else if(a->length > b->length) | ||||||
| 303 | ret = 1; | ||||||
| 304 | } | ||||||
| 305 | |||||||
| 306 | return ret; | ||||||
| 307 | } | ||||||
| 308 | |||||||
| 309 | /* | ||||||
| 310 | * The DER encoder of the SET OF type. | ||||||
| 311 | */ | ||||||
| 312 | asn_enc_rval_t | ||||||
| 313 | SET_OF_encode_der(asn_TYPE_descriptor_t *td, void *ptr, | ||||||
| 314 | int tag_mode, ber_tlv_tag_t tag, | ||||||
| 315 | asn_app_consume_bytes_f *cb, void *app_key) { | ||||||
| 316 | asn_TYPE_member_t *elm = td->elements; | ||||||
| 317 | asn_TYPE_descriptor_t *elm_type = elm->type; | ||||||
| 318 | der_type_encoder_f *der_encoder = elm_type->der_encoder; | ||||||
| 319 | asn_anonymous_set_ *list = _A_SET_FROM_VOID(ptr)((asn_anonymous_set_ *)(ptr)); | ||||||
| 320 | size_t computed_size = 0; | ||||||
| 321 | ssize_t encoding_size = 0; | ||||||
| 322 | struct _el_buffer *encoded_els; | ||||||
| 323 | ssize_t eels_count = 0; | ||||||
| 324 | size_t max_encoded_len = 1; | ||||||
| 325 | asn_enc_rval_t erval; | ||||||
| 326 | int ret; | ||||||
| 327 | int edx; | ||||||
| 328 | |||||||
| 329 | ASN_DEBUG("Estimating size for SET OF %s", td->name); | ||||||
| 330 | |||||||
| 331 | /* | ||||||
| 332 | * Gather the length of the underlying members sequence. | ||||||
| 333 | */ | ||||||
| 334 | for(edx = 0; edx < list->count; edx++) { | ||||||
| |||||||
| 335 | void *memb_ptr = list->array[edx]; | ||||||
| 336 | if(!memb_ptr) continue; | ||||||
| 337 | erval = der_encoder(elm_type, memb_ptr, 0, elm->tag, 0, 0); | ||||||
| 338 | if(erval.encoded == -1) | ||||||
| 339 | return erval; | ||||||
| 340 | computed_size += erval.encoded; | ||||||
| 341 | |||||||
| 342 | /* Compute maximum encoding's size */ | ||||||
| 343 | if(max_encoded_len < (size_t)erval.encoded) | ||||||
| 344 | max_encoded_len = erval.encoded; | ||||||
| 345 | } | ||||||
| 346 | |||||||
| 347 | /* | ||||||
| 348 | * Encode the TLV for the sequence itself. | ||||||
| 349 | */ | ||||||
| 350 | encoding_size = der_write_tags(td, computed_size, tag_mode, 1, tag, | ||||||
| 351 | cb, app_key); | ||||||
| 352 | if(encoding_size == -1) { | ||||||
| 353 | erval.encoded = -1; | ||||||
| 354 | erval.failed_type = td; | ||||||
| 355 | erval.structure_ptr = ptr; | ||||||
| 356 | return erval; | ||||||
| 357 | } | ||||||
| 358 | computed_size += encoding_size; | ||||||
| 359 | |||||||
| 360 | if(!cb || list->count
| ||||||
| 361 | erval.encoded = computed_size; | ||||||
| 362 | ASN__ENCODED_OK(erval)do { erval.structure_ptr = 0; erval.failed_type = 0; return erval ; } while(0); | ||||||
| 363 | } | ||||||
| 364 | |||||||
| 365 | /* | ||||||
| 366 | * DER mandates dynamic sorting of the SET OF elements | ||||||
| 367 | * according to their encodings. Build an array of the | ||||||
| 368 | * encoded elements. | ||||||
| 369 | */ | ||||||
| 370 | encoded_els = (struct _el_buffer *)MALLOC(malloc(list->count * sizeof(encoded_els[0])) | ||||||
| 371 | list->count * sizeof(encoded_els[0]))malloc(list->count * sizeof(encoded_els[0])); | ||||||
| 372 | if(encoded_els == NULL((void*)0)) { | ||||||
| 373 | erval.encoded = -1; | ||||||
| 374 | erval.failed_type = td; | ||||||
| 375 | erval.structure_ptr = ptr; | ||||||
| 376 | return erval; | ||||||
| 377 | } | ||||||
| 378 | |||||||
| 379 | ASN_DEBUG("Encoding members of %s SET OF", td->name); | ||||||
| 380 | |||||||
| 381 | /* | ||||||
| 382 | * Encode all members. | ||||||
| 383 | */ | ||||||
| 384 | for(edx = 0; edx < list->count; edx++) { | ||||||
| 385 | void *memb_ptr = list->array[edx]; | ||||||
| 386 | struct _el_buffer *encoded_el = &encoded_els[eels_count]; | ||||||
| 387 | |||||||
| 388 | if(!memb_ptr
| ||||||
| 389 | |||||||
| 390 | /* | ||||||
| 391 | * Prepare space for encoding. | ||||||
| 392 | */ | ||||||
| 393 | encoded_el->buf = (uint8_t *)MALLOC(max_encoded_len)malloc(max_encoded_len); | ||||||
| 394 | if(encoded_el->buf) { | ||||||
| 395 | encoded_el->length = 0; | ||||||
| 396 | encoded_el->size = max_encoded_len; | ||||||
| 397 | } else { | ||||||
| 398 | for(edx--; edx >= 0; edx--) | ||||||
| 399 | FREEMEM(encoded_els[edx].buf)free(encoded_els[edx].buf); | ||||||
| |||||||
| 400 | FREEMEM(encoded_els)free(encoded_els); | ||||||
| 401 | erval.encoded = -1; | ||||||
| 402 | erval.failed_type = td; | ||||||
| 403 | erval.structure_ptr = ptr; | ||||||
| 404 | return erval; | ||||||
| 405 | } | ||||||
| 406 | |||||||
| 407 | /* | ||||||
| 408 | * Encode the member into the prepared space. | ||||||
| 409 | */ | ||||||
| 410 | erval = der_encoder(elm_type, memb_ptr, 0, elm->tag, | ||||||
| 411 | _el_addbytes, encoded_el); | ||||||
| 412 | if(erval.encoded == -1) { | ||||||
| 413 | for(; edx >= 0; edx--) | ||||||
| 414 | FREEMEM(encoded_els[edx].buf)free(encoded_els[edx].buf); | ||||||
| 415 | FREEMEM(encoded_els)free(encoded_els); | ||||||
| 416 | return erval; | ||||||
| 417 | } | ||||||
| 418 | encoding_size += erval.encoded; | ||||||
| 419 | eels_count++; | ||||||
| 420 | } | ||||||
| 421 | |||||||
| 422 | /* | ||||||
| 423 | * Sort the encoded elements according to their encoding. | ||||||
| 424 | */ | ||||||
| 425 | qsort(encoded_els, eels_count, sizeof(encoded_els[0]), _el_buf_cmp); | ||||||
| 426 | |||||||
| 427 | /* | ||||||
| 428 | * Report encoded elements to the application. | ||||||
| 429 | * Dispose of temporary sorted members table. | ||||||
| 430 | */ | ||||||
| 431 | ret = 0; | ||||||
| 432 | for(edx = 0; edx < eels_count; edx++) { | ||||||
| 433 | struct _el_buffer *encoded_el = &encoded_els[edx]; | ||||||
| 434 | /* Report encoded chunks to the application */ | ||||||
| 435 | if(ret == 0 | ||||||
| 436 | && cb(encoded_el->buf, encoded_el->length, app_key) < 0) | ||||||
| 437 | ret = -1; | ||||||
| 438 | FREEMEM(encoded_el->buf)free(encoded_el->buf); | ||||||
| 439 | } | ||||||
| 440 | FREEMEM(encoded_els)free(encoded_els); | ||||||
| 441 | |||||||
| 442 | if(ret || computed_size != (size_t)encoding_size) { | ||||||
| 443 | /* | ||||||
| 444 | * Standard callback failed, or | ||||||
| 445 | * encoded size is not equal to the computed size. | ||||||
| 446 | */ | ||||||
| 447 | erval.encoded = -1; | ||||||
| 448 | erval.failed_type = td; | ||||||
| 449 | erval.structure_ptr = ptr; | ||||||
| 450 | } else { | ||||||
| 451 | erval.encoded = computed_size; | ||||||
| 452 | } | ||||||
| 453 | |||||||
| 454 | ASN__ENCODED_OK(erval)do { erval.structure_ptr = 0; erval.failed_type = 0; return erval ; } while(0); | ||||||
| 455 | } | ||||||
| 456 | |||||||
| 457 | #undef XER_ADVANCE | ||||||
| 458 | #define XER_ADVANCE(num_bytes)do { size_t num = num_bytes; buf_ptr = ((const char *)buf_ptr ) + num; size -= num; consumed_myself += num; } while(0) do { \ | ||||||
| 459 | size_t num = num_bytes; \ | ||||||
| 460 | buf_ptr = ((const char *)buf_ptr) + num;\ | ||||||
| 461 | size -= num; \ | ||||||
| 462 | consumed_myself += num; \ | ||||||
| 463 | } while(0) | ||||||
| 464 | |||||||
| 465 | /* | ||||||
| 466 | * Decode the XER (XML) data. | ||||||
| 467 | */ | ||||||
| 468 | asn_dec_rval_t | ||||||
| 469 | SET_OF_decode_xer(asn_codec_ctx_t *opt_codec_ctx, asn_TYPE_descriptor_t *td, | ||||||
| 470 | void **struct_ptr, const char *opt_mname, | ||||||
| 471 | const void *buf_ptr, size_t size) { | ||||||
| 472 | /* | ||||||
| 473 | * Bring closer parts of structure description. | ||||||
| 474 | */ | ||||||
| 475 | asn_SET_OF_specifics_t *specs = (asn_SET_OF_specifics_t *)td->specifics; | ||||||
| 476 | asn_TYPE_member_t *element = td->elements; | ||||||
| 477 | const char *elm_tag; | ||||||
| 478 | const char *xml_tag = opt_mname ? opt_mname : td->xml_tag; | ||||||
| 479 | |||||||
| 480 | /* | ||||||
| 481 | * ... and parts of the structure being constructed. | ||||||
| 482 | */ | ||||||
| 483 | void *st = *struct_ptr; /* Target structure. */ | ||||||
| 484 | asn_struct_ctx_t *ctx; /* Decoder context */ | ||||||
| 485 | |||||||
| 486 | asn_dec_rval_t rval; /* Return value from a decoder */ | ||||||
| 487 | ssize_t consumed_myself = 0; /* Consumed bytes from ptr */ | ||||||
| 488 | |||||||
| 489 | /* | ||||||
| 490 | * Create the target structure if it is not present already. | ||||||
| 491 | */ | ||||||
| 492 | if(st == 0) { | ||||||
| 493 | st = *struct_ptr = CALLOC(1, specs->struct_size)calloc(1, specs->struct_size); | ||||||
| 494 | if(st == 0) RETURN(RC_FAIL)do { rval.code = RC_FAIL; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 495 | } | ||||||
| 496 | |||||||
| 497 | /* Which tag is expected for the downstream */ | ||||||
| 498 | if(specs->as_XMLValueList) { | ||||||
| 499 | elm_tag = (specs->as_XMLValueList == 1) ? 0 : ""; | ||||||
| 500 | } else { | ||||||
| 501 | elm_tag = (*element->name) | ||||||
| 502 | ? element->name : element->type->xml_tag; | ||||||
| 503 | } | ||||||
| 504 | |||||||
| 505 | /* | ||||||
| 506 | * Restore parsing context. | ||||||
| 507 | */ | ||||||
| 508 | ctx = (asn_struct_ctx_t *)((char *)st + specs->ctx_offset); | ||||||
| 509 | |||||||
| 510 | /* | ||||||
| 511 | * Phases of XER/XML processing: | ||||||
| 512 | * Phase 0: Check that the opening tag matches our expectations. | ||||||
| 513 | * Phase 1: Processing body and reacting on closing tag. | ||||||
| 514 | * Phase 2: Processing inner type. | ||||||
| 515 | */ | ||||||
| 516 | for(; ctx->phase <= 2;) { | ||||||
| 517 | pxer_chunk_type_e ch_type; /* XER chunk type */ | ||||||
| 518 | ssize_t ch_size; /* Chunk size */ | ||||||
| 519 | xer_check_tag_e tcv; /* Tag check value */ | ||||||
| 520 | |||||||
| 521 | /* | ||||||
| 522 | * Go inside the inner member of a set. | ||||||
| 523 | */ | ||||||
| 524 | if(ctx->phase == 2) { | ||||||
| 525 | asn_dec_rval_t tmprval; | ||||||
| 526 | |||||||
| 527 | /* Invoke the inner type decoder, m.b. multiple times */ | ||||||
| 528 | ASN_DEBUG("XER/SET OF element [%s]", elm_tag); | ||||||
| 529 | tmprval = element->type->xer_decoder(opt_codec_ctx, | ||||||
| 530 | element->type, &ctx->ptr, elm_tag, | ||||||
| 531 | buf_ptr, size); | ||||||
| 532 | if(tmprval.code == RC_OK) { | ||||||
| 533 | asn_anonymous_set_ *list = _A_SET_FROM_VOID(st)((asn_anonymous_set_ *)(st)); | ||||||
| 534 | if(ASN_SET_ADD(list, ctx->ptr)asn_set_add((list), (ctx->ptr)) != 0) | ||||||
| 535 | RETURN(RC_FAIL)do { rval.code = RC_FAIL; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 536 | ctx->ptr = 0; | ||||||
| 537 | XER_ADVANCE(tmprval.consumed)do { size_t num = tmprval.consumed; buf_ptr = ((const char *) buf_ptr) + num; size -= num; consumed_myself += num; } while( 0); | ||||||
| 538 | } else { | ||||||
| 539 | XER_ADVANCE(tmprval.consumed)do { size_t num = tmprval.consumed; buf_ptr = ((const char *) buf_ptr) + num; size -= num; consumed_myself += num; } while( 0); | ||||||
| 540 | RETURN(tmprval.code)do { rval.code = tmprval.code; rval.consumed = consumed_myself ; return rval; } while(0); | ||||||
| 541 | } | ||||||
| 542 | ctx->phase = 1; /* Back to body processing */ | ||||||
| 543 | ASN_DEBUG("XER/SET OF phase => %d", ctx->phase); | ||||||
| 544 | /* Fall through */ | ||||||
| 545 | } | ||||||
| 546 | |||||||
| 547 | /* | ||||||
| 548 | * Get the next part of the XML stream. | ||||||
| 549 | */ | ||||||
| 550 | ch_size = xer_next_token(&ctx->context, | ||||||
| 551 | buf_ptr, size, &ch_type); | ||||||
| 552 | if(ch_size == -1) { | ||||||
| 553 | RETURN(RC_FAIL)do { rval.code = RC_FAIL; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 554 | } else { | ||||||
| 555 | switch(ch_type) { | ||||||
| 556 | case PXER_WMORE: | ||||||
| 557 | RETURN(RC_WMORE)do { rval.code = RC_WMORE; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 558 | case PXER_COMMENT: /* Got XML comment */ | ||||||
| 559 | case PXER_TEXT: /* Ignore free-standing text */ | ||||||
| 560 | XER_ADVANCE(ch_size)do { size_t num = ch_size; buf_ptr = ((const char *)buf_ptr) + num; size -= num; consumed_myself += num; } while(0); /* Skip silently */ | ||||||
| 561 | continue; | ||||||
| 562 | case PXER_TAG: | ||||||
| 563 | break; /* Check the rest down there */ | ||||||
| 564 | } | ||||||
| 565 | } | ||||||
| 566 | |||||||
| 567 | tcv = xer_check_tag(buf_ptr, ch_size, xml_tag); | ||||||
| 568 | ASN_DEBUG("XER/SET OF: tcv = %d, ph=%d t=%s", | ||||||
| 569 | tcv, ctx->phase, xml_tag); | ||||||
| 570 | switch(tcv) { | ||||||
| 571 | case XCT_CLOSING: | ||||||
| 572 | if(ctx->phase == 0) break; | ||||||
| 573 | ctx->phase = 0; | ||||||
| 574 | /* Fall through */ | ||||||
| 575 | case XCT_BOTH: | ||||||
| 576 | if(ctx->phase == 0) { | ||||||
| 577 | /* No more things to decode */ | ||||||
| 578 | XER_ADVANCE(ch_size)do { size_t num = ch_size; buf_ptr = ((const char *)buf_ptr) + num; size -= num; consumed_myself += num; } while(0); | ||||||
| 579 | ctx->phase = 3; /* Phase out */ | ||||||
| 580 | RETURN(RC_OK)do { rval.code = RC_OK; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 581 | } | ||||||
| 582 | /* Fall through */ | ||||||
| 583 | case XCT_OPENING: | ||||||
| 584 | if(ctx->phase == 0) { | ||||||
| 585 | XER_ADVANCE(ch_size)do { size_t num = ch_size; buf_ptr = ((const char *)buf_ptr) + num; size -= num; consumed_myself += num; } while(0); | ||||||
| 586 | ctx->phase = 1; /* Processing body phase */ | ||||||
| 587 | continue; | ||||||
| 588 | } | ||||||
| 589 | /* Fall through */ | ||||||
| 590 | case XCT_UNKNOWN_OP: | ||||||
| 591 | case XCT_UNKNOWN_BO: | ||||||
| 592 | |||||||
| 593 | ASN_DEBUG("XER/SET OF: tcv=%d, ph=%d", tcv, ctx->phase); | ||||||
| 594 | if(ctx->phase == 1) { | ||||||
| 595 | /* | ||||||
| 596 | * Process a single possible member. | ||||||
| 597 | */ | ||||||
| 598 | ctx->phase = 2; | ||||||
| 599 | continue; | ||||||
| 600 | } | ||||||
| 601 | /* Fall through */ | ||||||
| 602 | default: | ||||||
| 603 | break; | ||||||
| 604 | } | ||||||
| 605 | |||||||
| 606 | ASN_DEBUG("Unexpected XML tag in SET OF"); | ||||||
| 607 | break; | ||||||
| 608 | } | ||||||
| 609 | |||||||
| 610 | ctx->phase = 3; /* "Phase out" on hard failure */ | ||||||
| 611 | RETURN(RC_FAIL)do { rval.code = RC_FAIL; rval.consumed = consumed_myself; return rval; } while(0); | ||||||
| 612 | } | ||||||
| 613 | |||||||
| 614 | |||||||
| 615 | |||||||
| 616 | typedef struct xer_tmp_enc_s { | ||||||
| 617 | void *buffer; | ||||||
| 618 | size_t offset; | ||||||
| 619 | size_t size; | ||||||
| 620 | } xer_tmp_enc_t; | ||||||
| 621 | static int | ||||||
| 622 | SET_OF_encode_xer_callback(const void *buffer, size_t size, void *key) { | ||||||
| 623 | xer_tmp_enc_t *t = (xer_tmp_enc_t *)key; | ||||||
| 624 | if(t->offset + size >= t->size) { | ||||||
| 625 | size_t newsize = (t->size << 2) + size; | ||||||
| 626 | void *p = REALLOC(t->buffer, newsize)realloc(t->buffer, newsize); | ||||||
| 627 | if(!p) return -1; | ||||||
| 628 | t->buffer = p; | ||||||
| 629 | t->size = newsize; | ||||||
| 630 | } | ||||||
| 631 | memcpy((char *)t->buffer + t->offset, buffer, size); | ||||||
| 632 | t->offset += size; | ||||||
| 633 | return 0; | ||||||
| 634 | } | ||||||
| 635 | static int | ||||||
| 636 | SET_OF_xer_order(const void *aptr, const void *bptr) { | ||||||
| 637 | const xer_tmp_enc_t *a = (const xer_tmp_enc_t *)aptr; | ||||||
| 638 | const xer_tmp_enc_t *b = (const xer_tmp_enc_t *)bptr; | ||||||
| 639 | size_t minlen = a->offset; | ||||||
| 640 | int ret; | ||||||
| 641 | if(b->offset < minlen) minlen = b->offset; | ||||||
| 642 | /* Well-formed UTF-8 has this nice lexicographical property... */ | ||||||
| 643 | ret = memcmp(a->buffer, b->buffer, minlen); | ||||||
| 644 | if(ret != 0) return ret; | ||||||
| 645 | if(a->offset == b->offset) | ||||||
| 646 | return 0; | ||||||
| 647 | if(a->offset == minlen) | ||||||
| 648 | return -1; | ||||||
| 649 | return 1; | ||||||
| 650 | } | ||||||
| 651 | |||||||
| 652 | |||||||
| 653 | asn_enc_rval_t | ||||||
| 654 | SET_OF_encode_xer(asn_TYPE_descriptor_t *td, void *sptr, | ||||||
| 655 | int ilevel, enum xer_encoder_flags_e flags, | ||||||
| 656 | asn_app_consume_bytes_f *cb, void *app_key) { | ||||||
| 657 | asn_enc_rval_t er; | ||||||
| 658 | asn_SET_OF_specifics_t *specs = (asn_SET_OF_specifics_t *)td->specifics; | ||||||
| 659 | asn_TYPE_member_t *elm = td->elements; | ||||||
| 660 | asn_anonymous_set_ *list = _A_SET_FROM_VOID(sptr)((asn_anonymous_set_ *)(sptr)); | ||||||
| 661 | const char *mname = specs->as_XMLValueList | ||||||
| 662 | ? 0 : ((*elm->name) ? elm->name : elm->type->xml_tag); | ||||||
| 663 | size_t mlen = mname ? strlen(mname) : 0; | ||||||
| 664 | int xcan = (flags & XER_F_CANONICAL); | ||||||
| 665 | xer_tmp_enc_t *encs = 0; | ||||||
| 666 | size_t encs_count = 0; | ||||||
| 667 | void *original_app_key = app_key; | ||||||
| 668 | asn_app_consume_bytes_f *original_cb = cb; | ||||||
| 669 | int i; | ||||||
| 670 | |||||||
| 671 | if(!sptr) ASN__ENCODE_FAILEDdo { asn_enc_rval_t tmp_error; tmp_error.encoded = -1; tmp_error .failed_type = td; tmp_error.structure_ptr = sptr; ASN_DEBUG( "Failed to encode element %s", td ? td->name : ""); return tmp_error; } while(0); | ||||||
| 672 | |||||||
| 673 | if(xcan) { | ||||||
| 674 | encs = (xer_tmp_enc_t *)MALLOC(list->count * sizeof(encs[0]))malloc(list->count * sizeof(encs[0])); | ||||||
| 675 | if(!encs) ASN__ENCODE_FAILEDdo { asn_enc_rval_t tmp_error; tmp_error.encoded = -1; tmp_error .failed_type = td; tmp_error.structure_ptr = sptr; ASN_DEBUG( "Failed to encode element %s", td ? td->name : ""); return tmp_error; } while(0); | ||||||
| 676 | cb = SET_OF_encode_xer_callback; | ||||||
| 677 | } | ||||||
| 678 | |||||||
| 679 | er.encoded = 0; | ||||||
| 680 | |||||||
| 681 | for(i = 0; i < list->count; i++) { | ||||||
| 682 | asn_enc_rval_t tmper; | ||||||
| 683 | |||||||
| 684 | void *memb_ptr = list->array[i]; | ||||||
| 685 | if(!memb_ptr) continue; | ||||||
| 686 | |||||||
| 687 | if(encs) { | ||||||
| 688 | memset(&encs[encs_count], 0, sizeof(encs[0])); | ||||||
| 689 | app_key = &encs[encs_count]; | ||||||
| 690 | encs_count++; | ||||||
| 691 | } | ||||||
| 692 | |||||||
| 693 | if(mname) { | ||||||
| 694 | if(!xcan) ASN__TEXT_INDENT(1, ilevel)do { int tmp_level = (ilevel); int tmp_nl = ((1) != 0); int tmp_i ; if(tmp_nl) do { if((cb(("\n"), (1), app_key) < 0)) goto cb_failed ; } while(0); if(tmp_level < 0) tmp_level = 0; for(tmp_i = 0; tmp_i < tmp_level; tmp_i++) do { if((cb((" "), (4), app_key) < 0)) goto cb_failed; } while(0); er.encoded += tmp_nl + 4 * tmp_level; } while(0); | ||||||
| 695 | ASN__CALLBACK3("<", 1, mname, mlen, ">", 1)do { if((cb(("<"), (1), app_key) < 0) || (cb((mname), ( mlen), app_key) < 0) || (cb((">"), (1), app_key) < 0 )) goto cb_failed; } while(0); | ||||||
| 696 | } | ||||||
| 697 | |||||||
| 698 | if(!xcan && specs->as_XMLValueList == 1) | ||||||
| 699 | ASN__TEXT_INDENT(1, ilevel + 1)do { int tmp_level = (ilevel + 1); int tmp_nl = ((1) != 0); int tmp_i; if(tmp_nl) do { if((cb(("\n"), (1), app_key) < 0)) goto cb_failed; } while(0); if(tmp_level < 0) tmp_level = 0; for(tmp_i = 0; tmp_i < tmp_level; tmp_i++) do { if((cb ((" "), (4), app_key) < 0)) goto cb_failed; } while(0); er.encoded += tmp_nl + 4 * tmp_level; } while(0); | ||||||
| 700 | tmper = elm->type->xer_encoder(elm->type, memb_ptr, | ||||||
| 701 | ilevel + (specs->as_XMLValueList != 2), | ||||||
| 702 | flags, cb, app_key); | ||||||
| 703 | if(tmper.encoded == -1) { | ||||||
| 704 | td = tmper.failed_type; | ||||||
| 705 | sptr = tmper.structure_ptr; | ||||||
| 706 | goto cb_failed; | ||||||
| 707 | } | ||||||
| 708 | if(tmper.encoded == 0 && specs->as_XMLValueList) { | ||||||
| 709 | const char *name = elm->type->xml_tag; | ||||||
| 710 | size_t len = strlen(name); | ||||||
| 711 | ASN__CALLBACK3("<", 1, name, len, "/>", 2)do { if((cb(("<"), (1), app_key) < 0) || (cb((name), (len ), app_key) < 0) || (cb(("/>"), (2), app_key) < 0)) goto cb_failed; } while(0); | ||||||
| 712 | } | ||||||
| 713 | |||||||
| 714 | if(mname) { | ||||||
| 715 | ASN__CALLBACK3("</", 2, mname, mlen, ">", 1)do { if((cb(("</"), (2), app_key) < 0) || (cb((mname), ( mlen), app_key) < 0) || (cb((">"), (1), app_key) < 0 )) goto cb_failed; } while(0); | ||||||
| 716 | er.encoded += 5; | ||||||
| 717 | } | ||||||
| 718 | |||||||
| 719 | er.encoded += (2 * mlen) + tmper.encoded; | ||||||
| 720 | } | ||||||
| 721 | |||||||
| 722 | if(!xcan) ASN__TEXT_INDENT(1, ilevel - 1)do { int tmp_level = (ilevel - 1); int tmp_nl = ((1) != 0); int tmp_i; if(tmp_nl) do { if((cb(("\n"), (1), app_key) < 0)) goto cb_failed; } while(0); if(tmp_level < 0) tmp_level = 0; for(tmp_i = 0; tmp_i < tmp_level; tmp_i++) do { if((cb ((" "), (4), app_key) < 0)) goto cb_failed; } while(0); er.encoded += tmp_nl + 4 * tmp_level; } while(0); | ||||||
| 723 | |||||||
| 724 | if(encs) { | ||||||
| 725 | xer_tmp_enc_t *enc = encs; | ||||||
| 726 | xer_tmp_enc_t *end = encs + encs_count; | ||||||
| 727 | ssize_t control_size = 0; | ||||||
| 728 | |||||||
| 729 | cb = original_cb; | ||||||
| 730 | app_key = original_app_key; | ||||||
| 731 | qsort(encs, encs_count, sizeof(encs[0]), SET_OF_xer_order); | ||||||
| 732 | |||||||
| 733 | for(; enc < end; enc++) { | ||||||
| 734 | ASN__CALLBACK(enc->buffer, enc->offset)do { if((cb((enc->buffer), (enc->offset), app_key) < 0)) goto cb_failed; } while(0); | ||||||
| 735 | FREEMEM(enc->buffer)free(enc->buffer); | ||||||
| 736 | enc->buffer = 0; | ||||||
| 737 | control_size += enc->offset; | ||||||
| 738 | } | ||||||
| 739 | assert(control_size == er.encoded)((void) sizeof ((control_size == er.encoded) ? 1 : 0), __extension__ ({ if (control_size == er.encoded) ; else __assert_fail ("control_size == er.encoded" , "constr_SET_OF.c", 739, __extension__ __PRETTY_FUNCTION__); })); | ||||||
| 740 | } | ||||||
| 741 | |||||||
| 742 | goto cleanup; | ||||||
| 743 | cb_failed: | ||||||
| 744 | er.encoded = -1; | ||||||
| 745 | er.failed_type = td; | ||||||
| 746 | er.structure_ptr = sptr; | ||||||
| 747 | cleanup: | ||||||
| 748 | if(encs) { | ||||||
| 749 | while(encs_count-- > 0) { | ||||||
| 750 | if(encs[encs_count].buffer) | ||||||
| 751 | FREEMEM(encs[encs_count].buffer)free(encs[encs_count].buffer); | ||||||
| 752 | } | ||||||
| 753 | FREEMEM(encs)free(encs); | ||||||
| 754 | } | ||||||
| 755 | ASN__ENCODED_OK(er)do { er.structure_ptr = 0; er.failed_type = 0; return er; } while (0); | ||||||
| 756 | } | ||||||
| 757 | |||||||
| 758 | int | ||||||
| 759 | SET_OF_print(asn_TYPE_descriptor_t *td, const void *sptr, int ilevel, | ||||||
| 760 | asn_app_consume_bytes_f *cb, void *app_key) { | ||||||
| 761 | asn_TYPE_member_t *elm = td->elements; | ||||||
| 762 | const asn_anonymous_set_ *list = _A_CSET_FROM_VOID(sptr)((const asn_anonymous_set_ *)(sptr)); | ||||||
| 763 | int ret; | ||||||
| 764 | int i; | ||||||
| 765 | |||||||
| 766 | if(!sptr) return (cb("<absent>", 8, app_key) < 0) ? -1 : 0; | ||||||
| 767 | |||||||
| 768 | /* Dump preamble */ | ||||||
| 769 | if(cb(td->name, strlen(td->name), app_key) < 0 | ||||||
| 770 | || cb(" ::= {", 6, app_key) < 0) | ||||||
| 771 | return -1; | ||||||
| 772 | |||||||
| 773 | for(i = 0; i < list->count; i++) { | ||||||
| 774 | const void *memb_ptr = list->array[i]; | ||||||
| 775 | if(!memb_ptr) continue; | ||||||
| 776 | |||||||
| 777 | _i_INDENT(1)do { int tmp_i; if((1) && cb("\n", 1, app_key) < 0 ) return -1; for(tmp_i = 0; tmp_i < ilevel; tmp_i++) if(cb (" ", 4, app_key) < 0) return -1; } while(0); | ||||||
| 778 | |||||||
| 779 | ret = elm->type->print_struct(elm->type, memb_ptr, | ||||||
| 780 | ilevel + 1, cb, app_key); | ||||||
| 781 | if(ret) return ret; | ||||||
| 782 | } | ||||||
| 783 | |||||||
| 784 | ilevel--; | ||||||
| 785 | _i_INDENT(1)do { int tmp_i; if((1) && cb("\n", 1, app_key) < 0 ) return -1; for(tmp_i = 0; tmp_i < ilevel; tmp_i++) if(cb (" ", 4, app_key) < 0) return -1; } while(0); | ||||||
| 786 | |||||||
| 787 | return (cb("}", 1, app_key) < 0) ? -1 : 0; | ||||||
| 788 | } | ||||||
| 789 | |||||||
| 790 | void | ||||||
| 791 | SET_OF_free(asn_TYPE_descriptor_t *td, void *ptr, int contents_only) { | ||||||
| 792 | if(td && ptr) { | ||||||
| 793 | asn_SET_OF_specifics_t *specs; | ||||||
| 794 | asn_TYPE_member_t *elm = td->elements; | ||||||
| 795 | asn_anonymous_set_ *list = _A_SET_FROM_VOID(ptr)((asn_anonymous_set_ *)(ptr)); | ||||||
| 796 | asn_struct_ctx_t *ctx; /* Decoder context */ | ||||||
| 797 | int i; | ||||||
| 798 | |||||||
| 799 | /* | ||||||
| 800 | * Could not use set_of_empty() because of (*free) | ||||||
| 801 | * incompatibility. | ||||||
| 802 | */ | ||||||
| 803 | for(i = 0; i < list->count; i++) { | ||||||
| 804 | void *memb_ptr = list->array[i]; | ||||||
| 805 | if(memb_ptr) | ||||||
| 806 | ASN_STRUCT_FREE(*elm->type, memb_ptr)(*elm->type).free_struct(&(*elm->type),memb_ptr,0); | ||||||
| 807 | } | ||||||
| 808 | list->count = 0; /* No meaningful elements left */ | ||||||
| 809 | |||||||
| 810 | asn_set_empty(list); /* Remove (list->array) */ | ||||||
| 811 | |||||||
| 812 | specs = (asn_SET_OF_specifics_t *)td->specifics; | ||||||
| 813 | ctx = (asn_struct_ctx_t *)((char *)ptr + specs->ctx_offset); | ||||||
| 814 | if(ctx->ptr) { | ||||||
| 815 | ASN_STRUCT_FREE(*elm->type, ctx->ptr)(*elm->type).free_struct(&(*elm->type),ctx->ptr, 0); | ||||||
| 816 | ctx->ptr = 0; | ||||||
| 817 | } | ||||||
| 818 | |||||||
| 819 | if(!contents_only) { | ||||||
| 820 | FREEMEM(ptr)free(ptr); | ||||||
| 821 | } | ||||||
| 822 | } | ||||||
| 823 | } | ||||||
| 824 | |||||||
| 825 | int | ||||||
| 826 | SET_OF_constraint(asn_TYPE_descriptor_t *td, const void *sptr, | ||||||
| 827 | asn_app_constraint_failed_f *ctfailcb, void *app_key) { | ||||||
| 828 | asn_TYPE_member_t *elm = td->elements; | ||||||
| 829 | asn_constr_check_f *constr; | ||||||
| 830 | const asn_anonymous_set_ *list = _A_CSET_FROM_VOID(sptr)((const asn_anonymous_set_ *)(sptr)); | ||||||
| 831 | int i; | ||||||
| 832 | |||||||
| 833 | if(!sptr) { | ||||||
| 834 | ASN__CTFAILif(ctfailcb) ctfailcb(app_key, td, sptr, | ||||||
| 835 | "%s: value not given (%s:%d)", | ||||||
| 836 | td->name, __FILE__"constr_SET_OF.c", __LINE__836); | ||||||
| 837 | return -1; | ||||||
| 838 | } | ||||||
| 839 | |||||||
| 840 | constr = elm->memb_constraints; | ||||||
| 841 | if(!constr) constr = elm->type->check_constraints; | ||||||
| 842 | |||||||
| 843 | /* | ||||||
| 844 | * Iterate over the members of an array. | ||||||
| 845 | * Validate each in turn, until one fails. | ||||||
| 846 | */ | ||||||
| 847 | for(i = 0; i < list->count; i++) { | ||||||
| 848 | const void *memb_ptr = list->array[i]; | ||||||
| 849 | int ret; | ||||||
| 850 | |||||||
| 851 | if(!memb_ptr) continue; | ||||||
| 852 | |||||||
| 853 | ret = constr(elm->type, memb_ptr, ctfailcb, app_key); | ||||||
| 854 | if(ret) return ret; | ||||||
| 855 | } | ||||||
| 856 | |||||||
| 857 | /* | ||||||
| 858 | * Cannot inherit it earlier: | ||||||
| 859 | * need to make sure we get the updated version. | ||||||
| 860 | */ | ||||||
| 861 | if(!elm->memb_constraints) | ||||||
| 862 | elm->memb_constraints = elm->type->check_constraints; | ||||||
| 863 | |||||||
| 864 | return 0; | ||||||
| 865 | } | ||||||
| 866 | |||||||
| 867 | asn_dec_rval_t | ||||||
| 868 | SET_OF_decode_uper(asn_codec_ctx_t *opt_codec_ctx, asn_TYPE_descriptor_t *td, | ||||||
| 869 | asn_per_constraints_t *constraints, void **sptr, asn_per_data_t *pd) { | ||||||
| 870 | asn_dec_rval_t rv; | ||||||
| 871 | asn_SET_OF_specifics_t *specs = (asn_SET_OF_specifics_t *)td->specifics; | ||||||
| 872 | asn_TYPE_member_t *elm = td->elements; /* Single one */ | ||||||
| 873 | void *st = *sptr; | ||||||
| 874 | asn_anonymous_set_ *list; | ||||||
| 875 | asn_per_constraint_t *ct; | ||||||
| 876 | int repeat = 0; | ||||||
| 877 | ssize_t nelems; | ||||||
| 878 | |||||||
| 879 | if(ASN__STACK_OVERFLOW_CHECK(opt_codec_ctx)) | ||||||
| 880 | ASN__DECODE_FAILEDdo { asn_dec_rval_t tmp_error; tmp_error.code = RC_FAIL; tmp_error .consumed = 0; ASN_DEBUG("Failed to decode element %s", td ? td ->name : ""); return tmp_error; } while(0); | ||||||
| 881 | |||||||
| 882 | /* | ||||||
| 883 | * Create the target structure if it is not present already. | ||||||
| 884 | */ | ||||||
| 885 | if(!st) { | ||||||
| 886 | st = *sptr = CALLOC(1, specs->struct_size)calloc(1, specs->struct_size); | ||||||
| 887 | if(!st) ASN__DECODE_FAILEDdo { asn_dec_rval_t tmp_error; tmp_error.code = RC_FAIL; tmp_error .consumed = 0; ASN_DEBUG("Failed to decode element %s", td ? td ->name : ""); return tmp_error; } while(0); | ||||||
| 888 | } | ||||||
| 889 | list = _A_SET_FROM_VOID(st)((asn_anonymous_set_ *)(st)); | ||||||
| 890 | |||||||
| 891 | /* Figure out which constraints to use */ | ||||||
| 892 | if(constraints) ct = &constraints->size; | ||||||
| 893 | else if(td->per_constraints) ct = &td->per_constraints->size; | ||||||
| 894 | else ct = 0; | ||||||
| 895 | |||||||
| 896 | if(ct && ct->flags & APC_EXTENSIBLE) { | ||||||
| 897 | int value = per_get_few_bits(pd, 1); | ||||||
| 898 | if(value < 0) ASN__DECODE_STARVEDdo { asn_dec_rval_t tmp_error; tmp_error.code = RC_WMORE; tmp_error .consumed = 0; return tmp_error; } while(0); | ||||||
| 899 | if(value) ct = 0; /* Not restricted! */ | ||||||
| 900 | } | ||||||
| 901 | |||||||
| 902 | if(ct && ct->effective_bits >= 0) { | ||||||
| 903 | /* X.691, #19.5: No length determinant */ | ||||||
| 904 | nelems = per_get_few_bits(pd, ct->effective_bits); | ||||||
| 905 | ASN_DEBUG("Preparing to fetch %ld+%ld elements from %s", | ||||||
| 906 | (long)nelems, ct->lower_bound, td->name); | ||||||
| 907 | if(nelems < 0) ASN__DECODE_STARVEDdo { asn_dec_rval_t tmp_error; tmp_error.code = RC_WMORE; tmp_error .consumed = 0; return tmp_error; } while(0); | ||||||
| 908 | nelems += ct->lower_bound; | ||||||
| 909 | } else { | ||||||
| 910 | nelems = -1; | ||||||
| 911 | } | ||||||
| 912 | |||||||
| 913 | do { | ||||||
| 914 | int i; | ||||||
| 915 | if(nelems < 0) { | ||||||
| 916 | nelems = uper_get_length(pd, | ||||||
| 917 | ct ? ct->effective_bits : -1, &repeat); | ||||||
| 918 | ASN_DEBUG("Got to decode %d elements (eff %d)", | ||||||
| 919 | (int)nelems, (int)(ct ? ct->effective_bits : -1)); | ||||||
| 920 | if(nelems < 0) ASN__DECODE_STARVEDdo { asn_dec_rval_t tmp_error; tmp_error.code = RC_WMORE; tmp_error .consumed = 0; return tmp_error; } while(0); | ||||||
| 921 | } | ||||||
| 922 | |||||||
| 923 | for(i = 0; i < nelems; i++) { | ||||||
| 924 | void *ptr = 0; | ||||||
| 925 | ASN_DEBUG("SET OF %s decoding", elm->type->name); | ||||||
| 926 | rv = elm->type->uper_decoder(opt_codec_ctx, elm->type, | ||||||
| 927 | elm->per_constraints, &ptr, pd); | ||||||
| 928 | ASN_DEBUG("%s SET OF %s decoded %d, %p", | ||||||
| 929 | td->name, elm->type->name, rv.code, ptr); | ||||||
| 930 | if(rv.code == RC_OK) { | ||||||
| 931 | if(ASN_SET_ADD(list, ptr)asn_set_add((list), (ptr)) == 0) | ||||||
| 932 | continue; | ||||||
| 933 | ASN_DEBUG("Failed to add element into %s", | ||||||
| 934 | td->name); | ||||||
| 935 | /* Fall through */ | ||||||
| 936 | rv.code = RC_FAIL; | ||||||
| 937 | } else { | ||||||
| 938 | ASN_DEBUG("Failed decoding %s of %s (SET OF)", | ||||||
| 939 | elm->type->name, td->name); | ||||||
| 940 | } | ||||||
| 941 | if(ptr) ASN_STRUCT_FREE(*elm->type, ptr)(*elm->type).free_struct(&(*elm->type),ptr,0); | ||||||
| 942 | return rv; | ||||||
| 943 | } | ||||||
| 944 | |||||||
| 945 | nelems = -1; /* Allow uper_get_length() */ | ||||||
| 946 | } while(repeat); | ||||||
| 947 | |||||||
| 948 | ASN_DEBUG("Decoded %s as SET OF", td->name); | ||||||
| 949 | |||||||
| 950 | rv.code = RC_OK; | ||||||
| 951 | rv.consumed = 0; | ||||||
| 952 | return rv; | ||||||
| 953 | } | ||||||
| 954 |