Harald Welte | d523a69 | 2015-08-30 23:11:19 +0200 | [diff] [blame] | 1 | /*- |
| 2 | * Copyright (c) 2003, 2004, 2006 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_SEQUENCE_OF.h> |
| 8 | #include <asn_SEQUENCE_OF.h> |
| 9 | |
| 10 | /* |
| 11 | * The DER encoder of the SEQUENCE OF type. |
| 12 | */ |
| 13 | asn_enc_rval_t |
| 14 | SEQUENCE_OF_encode_der(asn_TYPE_descriptor_t *td, void *ptr, |
| 15 | int tag_mode, ber_tlv_tag_t tag, |
| 16 | asn_app_consume_bytes_f *cb, void *app_key) { |
| 17 | asn_TYPE_member_t *elm = td->elements; |
| 18 | asn_anonymous_sequence_ *list = _A_SEQUENCE_FROM_VOID(ptr); |
| 19 | size_t computed_size = 0; |
| 20 | ssize_t encoding_size = 0; |
| 21 | asn_enc_rval_t erval; |
| 22 | int edx; |
| 23 | |
| 24 | ASN_DEBUG("Estimating size of SEQUENCE OF %s", td->name); |
| 25 | |
| 26 | /* |
| 27 | * Gather the length of the underlying members sequence. |
| 28 | */ |
| 29 | for(edx = 0; edx < list->count; edx++) { |
| 30 | void *memb_ptr = list->array[edx]; |
| 31 | if(!memb_ptr) continue; |
| 32 | erval = elm->type->der_encoder(elm->type, memb_ptr, |
| 33 | 0, elm->tag, |
| 34 | 0, 0); |
| 35 | if(erval.encoded == -1) |
| 36 | return erval; |
| 37 | computed_size += erval.encoded; |
| 38 | } |
| 39 | |
| 40 | /* |
| 41 | * Encode the TLV for the sequence itself. |
| 42 | */ |
| 43 | encoding_size = der_write_tags(td, computed_size, tag_mode, 1, tag, |
| 44 | cb, app_key); |
| 45 | if(encoding_size == -1) { |
| 46 | erval.encoded = -1; |
| 47 | erval.failed_type = td; |
| 48 | erval.structure_ptr = ptr; |
| 49 | return erval; |
| 50 | } |
| 51 | |
| 52 | computed_size += encoding_size; |
| 53 | if(!cb) { |
| 54 | erval.encoded = computed_size; |
| 55 | _ASN_ENCODED_OK(erval); |
| 56 | } |
| 57 | |
| 58 | ASN_DEBUG("Encoding members of SEQUENCE OF %s", td->name); |
| 59 | |
| 60 | /* |
| 61 | * Encode all members. |
| 62 | */ |
| 63 | for(edx = 0; edx < list->count; edx++) { |
| 64 | void *memb_ptr = list->array[edx]; |
| 65 | if(!memb_ptr) continue; |
| 66 | erval = elm->type->der_encoder(elm->type, memb_ptr, |
| 67 | 0, elm->tag, |
| 68 | cb, app_key); |
| 69 | if(erval.encoded == -1) |
| 70 | return erval; |
| 71 | encoding_size += erval.encoded; |
| 72 | } |
| 73 | |
| 74 | if(computed_size != (size_t)encoding_size) { |
| 75 | /* |
| 76 | * Encoded size is not equal to the computed size. |
| 77 | */ |
| 78 | erval.encoded = -1; |
| 79 | erval.failed_type = td; |
| 80 | erval.structure_ptr = ptr; |
| 81 | } else { |
| 82 | erval.encoded = computed_size; |
| 83 | erval.structure_ptr = 0; |
| 84 | erval.failed_type = 0; |
| 85 | } |
| 86 | |
| 87 | return erval; |
| 88 | } |
| 89 | |
| 90 | asn_enc_rval_t |
| 91 | SEQUENCE_OF_encode_xer(asn_TYPE_descriptor_t *td, void *sptr, |
| 92 | int ilevel, enum xer_encoder_flags_e flags, |
| 93 | asn_app_consume_bytes_f *cb, void *app_key) { |
| 94 | asn_enc_rval_t er; |
| 95 | asn_SET_OF_specifics_t *specs = (asn_SET_OF_specifics_t *)td->specifics; |
| 96 | asn_TYPE_member_t *elm = td->elements; |
| 97 | asn_anonymous_sequence_ *list = _A_SEQUENCE_FROM_VOID(sptr); |
| 98 | const char *mname = specs->as_XMLValueList |
| 99 | ? 0 : ((*elm->name) ? elm->name : elm->type->xml_tag); |
| 100 | unsigned int mlen = mname ? strlen(mname) : 0; |
| 101 | int xcan = (flags & XER_F_CANONICAL); |
| 102 | int i; |
| 103 | |
| 104 | if(!sptr) _ASN_ENCODE_FAILED; |
| 105 | |
| 106 | er.encoded = 0; |
| 107 | |
| 108 | for(i = 0; i < list->count; i++) { |
| 109 | asn_enc_rval_t tmper; |
| 110 | void *memb_ptr = list->array[i]; |
| 111 | if(!memb_ptr) continue; |
| 112 | |
| 113 | if(mname) { |
| 114 | if(!xcan) _i_ASN_TEXT_INDENT(1, ilevel); |
| 115 | _ASN_CALLBACK3("<", 1, mname, mlen, ">", 1); |
| 116 | } |
| 117 | |
| 118 | tmper = elm->type->xer_encoder(elm->type, memb_ptr, |
| 119 | ilevel + 1, flags, cb, app_key); |
| 120 | if(tmper.encoded == -1) return tmper; |
| 121 | if(tmper.encoded == 0 && specs->as_XMLValueList) { |
| 122 | const char *name = elm->type->xml_tag; |
| 123 | size_t len = strlen(name); |
| 124 | if(!xcan) _i_ASN_TEXT_INDENT(1, ilevel + 1); |
| 125 | _ASN_CALLBACK3("<", 1, name, len, "/>", 2); |
| 126 | } |
| 127 | |
| 128 | if(mname) { |
| 129 | _ASN_CALLBACK3("</", 2, mname, mlen, ">", 1); |
| 130 | er.encoded += 5; |
| 131 | } |
| 132 | |
| 133 | er.encoded += (2 * mlen) + tmper.encoded; |
| 134 | } |
| 135 | |
| 136 | if(!xcan) _i_ASN_TEXT_INDENT(1, ilevel - 1); |
| 137 | |
| 138 | _ASN_ENCODED_OK(er); |
| 139 | cb_failed: |
| 140 | _ASN_ENCODE_FAILED; |
| 141 | } |
| 142 | |
| 143 | asn_enc_rval_t |
| 144 | SEQUENCE_OF_encode_uper(asn_TYPE_descriptor_t *td, |
| 145 | asn_per_constraints_t *constraints, void *sptr, asn_per_outp_t *po) { |
| 146 | asn_anonymous_sequence_ *list; |
| 147 | asn_per_constraint_t *ct; |
| 148 | asn_enc_rval_t er; |
| 149 | asn_TYPE_member_t *elm = td->elements; |
| 150 | int seq; |
| 151 | |
| 152 | if(!sptr) _ASN_ENCODE_FAILED; |
| 153 | list = _A_SEQUENCE_FROM_VOID(sptr); |
| 154 | |
| 155 | er.encoded = 0; |
| 156 | |
| 157 | ASN_DEBUG("Encoding %s as SEQUENCE OF (%d)", td->name, list->count); |
| 158 | |
| 159 | if(constraints) ct = &constraints->size; |
| 160 | else if(td->per_constraints) ct = &td->per_constraints->size; |
| 161 | else ct = 0; |
| 162 | |
| 163 | /* If extensible constraint, check if size is in root */ |
| 164 | if(ct) { |
| 165 | int not_in_root = (list->count < ct->lower_bound |
| 166 | || list->count > ct->upper_bound); |
| 167 | ASN_DEBUG("lb %lld ub %lld %s", |
| 168 | ct->lower_bound, ct->upper_bound, |
| 169 | ct->flags & APC_EXTENSIBLE ? "ext" : "fix"); |
| 170 | if(ct->flags & APC_EXTENSIBLE) { |
| 171 | /* Declare whether size is in extension root */ |
| 172 | if(per_put_few_bits(po, not_in_root, 1)) |
| 173 | _ASN_ENCODE_FAILED; |
| 174 | if(not_in_root) ct = 0; |
| 175 | } else if(not_in_root && ct->effective_bits >= 0) |
| 176 | _ASN_ENCODE_FAILED; |
| 177 | } |
| 178 | |
| 179 | if(ct && ct->effective_bits >= 0) { |
| 180 | /* X.691, #19.5: No length determinant */ |
| 181 | if(per_put_few_bits(po, list->count - ct->lower_bound, |
| 182 | ct->effective_bits)) |
| 183 | _ASN_ENCODE_FAILED; |
| 184 | } |
| 185 | |
| 186 | for(seq = -1; seq < list->count;) { |
| 187 | ssize_t mayEncode; |
| 188 | if(seq < 0) seq = 0; |
| 189 | if(ct && ct->effective_bits >= 0) { |
| 190 | mayEncode = list->count; |
| 191 | } else { |
| 192 | mayEncode = uper_put_length(po, list->count - seq); |
| 193 | if(mayEncode < 0) _ASN_ENCODE_FAILED; |
| 194 | } |
| 195 | |
| 196 | while(mayEncode--) { |
| 197 | void *memb_ptr = list->array[seq++]; |
| 198 | if(!memb_ptr) _ASN_ENCODE_FAILED; |
| 199 | er = elm->type->uper_encoder(elm->type, |
| 200 | elm->per_constraints, memb_ptr, po); |
| 201 | if(er.encoded == -1) |
| 202 | _ASN_ENCODE_FAILED; |
| 203 | } |
| 204 | } |
| 205 | |
| 206 | _ASN_ENCODED_OK(er); |
| 207 | } |
| 208 | |
| 209 | asn_enc_rval_t |
| 210 | SEQUENCE_OF_encode_aper(asn_TYPE_descriptor_t *td, |
| 211 | asn_per_constraints_t *constraints, void *sptr, asn_per_outp_t *po) { |
| 212 | asn_anonymous_sequence_ *list; |
| 213 | asn_per_constraint_t *ct; |
| 214 | asn_enc_rval_t er; |
| 215 | asn_TYPE_member_t *elm = td->elements; |
| 216 | int seq; |
| 217 | |
| 218 | if(!sptr) _ASN_ENCODE_FAILED; |
| 219 | list = _A_SEQUENCE_FROM_VOID(sptr); |
| 220 | |
| 221 | er.encoded = 0; |
| 222 | |
| 223 | ASN_DEBUG("Encoding %s as SEQUENCE OF size (%d) using ALIGNED PER", td->name, list->count); |
| 224 | |
| 225 | if(constraints) ct = &constraints->size; |
| 226 | else if(td->per_constraints) ct = &td->per_constraints->size; |
| 227 | else ct = 0; |
| 228 | |
| 229 | /* If extensible constraint, check if size is in root */ |
| 230 | if(ct) { |
| 231 | int not_in_root = (list->count < ct->lower_bound |
| 232 | || list->count > ct->upper_bound); |
| 233 | ASN_DEBUG("lb %lld ub %lld %s", |
| 234 | ct->lower_bound, ct->upper_bound, |
| 235 | ct->flags & APC_EXTENSIBLE ? "ext" : "fix"); |
| 236 | if(ct->flags & APC_EXTENSIBLE) { |
| 237 | /* Declare whether size is in extension root */ |
| 238 | if(per_put_few_bits(po, not_in_root, 1)) |
| 239 | _ASN_ENCODE_FAILED; |
| 240 | if(not_in_root) ct = 0; |
| 241 | } else if(not_in_root && ct->effective_bits >= 0) |
| 242 | _ASN_ENCODE_FAILED; |
| 243 | } |
| 244 | |
| 245 | if(ct && ct->effective_bits >= 0) { |
| 246 | /* X.691, #19.5: No length determinant */ |
| 247 | // if(per_put_few_bits(po, list->count - ct->lower_bound, |
| 248 | // ct->effective_bits)) |
| 249 | // _ASN_ENCODE_FAILED; |
| 250 | if (aper_put_length(po, ct->upper_bound - ct->lower_bound + 1, list->count - ct->lower_bound) < 0) |
| 251 | _ASN_ENCODE_FAILED; |
| 252 | } |
| 253 | |
| 254 | for(seq = -1; seq < list->count;) { |
| 255 | ssize_t mayEncode; |
| 256 | if(seq < 0) seq = 0; |
| 257 | if(ct && ct->effective_bits >= 0) { |
| 258 | mayEncode = list->count; |
| 259 | } else { |
| 260 | mayEncode = aper_put_length(po, -1, list->count - seq); |
| 261 | if(mayEncode < 0) _ASN_ENCODE_FAILED; |
| 262 | } |
| 263 | |
| 264 | while(mayEncode--) { |
| 265 | void *memb_ptr = list->array[seq++]; |
| 266 | if(!memb_ptr) _ASN_ENCODE_FAILED; |
| 267 | er = elm->type->aper_encoder(elm->type, |
| 268 | elm->per_constraints, memb_ptr, po); |
| 269 | if(er.encoded == -1) |
| 270 | _ASN_ENCODE_FAILED; |
| 271 | } |
| 272 | } |
| 273 | |
| 274 | _ASN_ENCODED_OK(er); |
| 275 | } |