Harald Welte | 43ab79f | 2018-10-03 23:34:21 +0200 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (c) 2005-2014 Lev Walkin <vlm@lionet.info>. |
| 3 | * All rights reserved. |
| 4 | * Redistribution and modifications are permitted subject to BSD license. |
| 5 | */ |
| 6 | #include <asn_system.h> |
| 7 | #include <asn_internal.h> |
| 8 | #include <per_support.h> |
| 9 | |
| 10 | char * |
| 11 | per_data_string(asn_per_data_t *pd) { |
| 12 | static char buf[2][32]; |
| 13 | static int n; |
| 14 | n = (n+1) % 2; |
| 15 | snprintf(buf[n], sizeof(buf), |
| 16 | "{m=%ld span %+ld[%d..%d] (%d)}", |
| 17 | (long)pd->moved, |
| 18 | (((long)pd->buffer) & 0xf), |
| 19 | (int)pd->nboff, (int)pd->nbits, |
| 20 | (int)(pd->nbits - pd->nboff)); |
| 21 | return buf[n]; |
| 22 | } |
| 23 | |
| 24 | void |
| 25 | per_get_undo(asn_per_data_t *pd, int nbits) { |
| 26 | if((ssize_t)pd->nboff < nbits) { |
| 27 | assert((ssize_t)pd->nboff < nbits); |
| 28 | } else { |
| 29 | pd->nboff -= nbits; |
| 30 | pd->moved -= nbits; |
| 31 | } |
| 32 | } |
| 33 | |
| 34 | int32_t |
| 35 | aper_get_align(asn_per_data_t *pd) { |
| 36 | |
| 37 | if(pd->nboff & 0x7) { |
| 38 | ASN_DEBUG("Aligning %d bits", 8 - (pd->nboff & 0x7)); |
| 39 | return per_get_few_bits(pd, 8 - (pd->nboff & 0x7)); |
| 40 | } |
| 41 | return 0; |
| 42 | } |
| 43 | |
| 44 | /* |
| 45 | * Extract a small number of bits (<= 31) from the specified PER data pointer. |
| 46 | */ |
| 47 | int32_t |
| 48 | per_get_few_bits(asn_per_data_t *pd, int nbits) { |
| 49 | size_t off; /* Next after last bit offset */ |
| 50 | ssize_t nleft; /* Number of bits left in this stream */ |
| 51 | uint32_t accum; |
| 52 | const uint8_t *buf; |
| 53 | |
| 54 | if(nbits < 0) |
| 55 | return -1; |
| 56 | |
| 57 | nleft = pd->nbits - pd->nboff; |
| 58 | if(nbits > nleft) { |
| 59 | int32_t tailv, vhead; |
| 60 | if(!pd->refill || nbits > 31) return -1; |
| 61 | /* Accumulate unused bytes before refill */ |
| 62 | ASN_DEBUG("Obtain the rest %d bits (want %d)", |
| 63 | (int)nleft, (int)nbits); |
| 64 | tailv = per_get_few_bits(pd, nleft); |
| 65 | if(tailv < 0) return -1; |
| 66 | /* Refill (replace pd contents with new data) */ |
| 67 | if(pd->refill(pd)) |
| 68 | return -1; |
| 69 | nbits -= nleft; |
| 70 | vhead = per_get_few_bits(pd, nbits); |
| 71 | /* Combine the rest of previous pd with the head of new one */ |
| 72 | tailv = (tailv << nbits) | vhead; /* Could == -1 */ |
| 73 | return tailv; |
| 74 | } |
| 75 | |
| 76 | /* |
| 77 | * Normalize position indicator. |
| 78 | */ |
| 79 | if(pd->nboff >= 8) { |
| 80 | pd->buffer += (pd->nboff >> 3); |
| 81 | pd->nbits -= (pd->nboff & ~0x07); |
| 82 | pd->nboff &= 0x07; |
| 83 | } |
| 84 | pd->moved += nbits; |
| 85 | pd->nboff += nbits; |
| 86 | off = pd->nboff; |
| 87 | buf = pd->buffer; |
| 88 | |
| 89 | /* |
| 90 | * Extract specified number of bits. |
| 91 | */ |
| 92 | if(off <= 8) |
| 93 | accum = nbits ? (buf[0]) >> (8 - off) : 0; |
| 94 | else if(off <= 16) |
| 95 | accum = ((buf[0] << 8) + buf[1]) >> (16 - off); |
| 96 | else if(off <= 24) |
| 97 | accum = ((buf[0] << 16) + (buf[1] << 8) + buf[2]) >> (24 - off); |
| 98 | else if(off <= 31) |
| 99 | accum = ((buf[0] << 24) + (buf[1] << 16) |
| 100 | + (buf[2] << 8) + (buf[3])) >> (32 - off); |
| 101 | else if(nbits <= 31) { |
| 102 | asn_per_data_t tpd = *pd; |
| 103 | /* Here are we with our 31-bits limit plus 1..7 bits offset. */ |
| 104 | per_get_undo(&tpd, nbits); |
| 105 | /* The number of available bits in the stream allow |
| 106 | * for the following operations to take place without |
| 107 | * invoking the ->refill() function */ |
| 108 | accum = per_get_few_bits(&tpd, nbits - 24) << 24; |
| 109 | accum |= per_get_few_bits(&tpd, 24); |
| 110 | } else { |
| 111 | per_get_undo(pd, nbits); |
| 112 | return -1; |
| 113 | } |
| 114 | |
| 115 | accum &= (((uint32_t)1 << nbits) - 1); |
| 116 | |
| 117 | ASN_DEBUG(" [PER got %2d<=%2d bits => span %d %+ld[%d..%d]:%02x (%d) => 0x%02x]", |
| 118 | (int)nbits, (int)nleft, |
| 119 | (int)pd->moved, |
| 120 | (((long)pd->buffer) & 0xf), |
| 121 | (int)pd->nboff, (int)pd->nbits, |
| 122 | pd->buffer[0], |
| 123 | (int)(pd->nbits - pd->nboff), |
| 124 | (int)accum); |
| 125 | |
| 126 | return accum; |
| 127 | } |
| 128 | |
| 129 | /* |
| 130 | * Extract a large number of bits from the specified PER data pointer. |
| 131 | */ |
| 132 | int |
| 133 | per_get_many_bits(asn_per_data_t *pd, uint8_t *dst, int alright, int nbits) { |
| 134 | int32_t value; |
| 135 | |
| 136 | ASN_DEBUG("align: %s, nbits %d", alright ? "YES":"NO", nbits); |
| 137 | |
| 138 | if(alright && (nbits & 7)) { |
| 139 | /* Perform right alignment of a first few bits */ |
| 140 | value = per_get_few_bits(pd, nbits & 0x07); |
| 141 | if(value < 0) return -1; |
| 142 | *dst++ = value; /* value is already right-aligned */ |
| 143 | nbits &= ~7; |
| 144 | } |
| 145 | |
| 146 | while(nbits) { |
| 147 | if(nbits >= 24) { |
| 148 | value = per_get_few_bits(pd, 24); |
| 149 | if(value < 0) return -1; |
| 150 | *(dst++) = value >> 16; |
| 151 | *(dst++) = value >> 8; |
| 152 | *(dst++) = value; |
| 153 | nbits -= 24; |
| 154 | } else { |
| 155 | value = per_get_few_bits(pd, nbits); |
| 156 | if(value < 0) return -1; |
| 157 | if(nbits & 7) { /* implies left alignment */ |
| 158 | value <<= 8 - (nbits & 7), |
| 159 | nbits += 8 - (nbits & 7); |
| 160 | if(nbits > 24) |
| 161 | *dst++ = value >> 24; |
| 162 | } |
| 163 | if(nbits > 16) |
| 164 | *dst++ = value >> 16; |
| 165 | if(nbits > 8) |
| 166 | *dst++ = value >> 8; |
| 167 | *dst++ = value; |
| 168 | break; |
| 169 | } |
| 170 | } |
| 171 | |
| 172 | return 0; |
| 173 | } |
| 174 | |
| 175 | /* |
| 176 | * Get the length "n" from the stream. |
| 177 | */ |
| 178 | ssize_t |
| 179 | uper_get_length(asn_per_data_t *pd, int ebits, int *repeat) { |
| 180 | ssize_t value; |
| 181 | |
| 182 | *repeat = 0; |
| 183 | |
| 184 | if(ebits >= 0) return per_get_few_bits(pd, ebits); |
| 185 | |
| 186 | value = per_get_few_bits(pd, 8); |
| 187 | if(value < 0) return -1; |
| 188 | if((value & 128) == 0) /* #10.9.3.6 */ |
| 189 | return (value & 0x7F); |
| 190 | if((value & 64) == 0) { /* #10.9.3.7 */ |
| 191 | value = ((value & 63) << 8) | per_get_few_bits(pd, 8); |
| 192 | if(value < 0) return -1; |
| 193 | return value; |
| 194 | } |
| 195 | value &= 63; /* this is "m" from X.691, #10.9.3.8 */ |
| 196 | if(value < 1 || value > 4) |
| 197 | return -1; |
| 198 | *repeat = 1; |
| 199 | return (16384 * value); |
| 200 | } |
| 201 | |
| 202 | ssize_t |
| 203 | aper_get_length(asn_per_data_t *pd, int range, int ebits, int *repeat) { |
| 204 | ssize_t value; |
| 205 | |
| 206 | *repeat = 0; |
| 207 | |
| 208 | if (range <= 65536 && range >= 0) |
| 209 | return aper_get_nsnnwn(pd, range); |
| 210 | |
| 211 | if (aper_get_align(pd) < 0) |
| 212 | return -1; |
| 213 | |
| 214 | if(ebits >= 0) return per_get_few_bits(pd, ebits); |
| 215 | |
| 216 | value = per_get_few_bits(pd, 8); |
| 217 | if(value < 0) return -1; |
| 218 | if((value & 128) == 0) /* #10.9.3.6 */ |
| 219 | return (value & 0x7F); |
| 220 | if((value & 64) == 0) { /* #10.9.3.7 */ |
| 221 | value = ((value & 63) << 8) | per_get_few_bits(pd, 8); |
| 222 | if(value < 0) return -1; |
| 223 | return value; |
| 224 | } |
| 225 | value &= 63; /* this is "m" from X.691, #10.9.3.8 */ |
| 226 | if(value < 1 || value > 4) |
| 227 | return -1; |
| 228 | *repeat = 1; |
| 229 | return (16384 * value); |
| 230 | } |
| 231 | |
| 232 | /* |
| 233 | * Get the normally small length "n". |
| 234 | * This procedure used to decode length of extensions bit-maps |
| 235 | * for SET and SEQUENCE types. |
| 236 | */ |
| 237 | ssize_t |
| 238 | uper_get_nslength(asn_per_data_t *pd) { |
| 239 | ssize_t length; |
| 240 | |
| 241 | ASN_DEBUG("Getting normally small length"); |
| 242 | |
| 243 | if(per_get_few_bits(pd, 1) == 0) { |
| 244 | length = per_get_few_bits(pd, 6) + 1; |
| 245 | if(length <= 0) return -1; |
| 246 | ASN_DEBUG("l=%d", (int)length); |
| 247 | return length; |
| 248 | } else { |
| 249 | int repeat; |
| 250 | length = uper_get_length(pd, -1, &repeat); |
| 251 | if(length >= 0 && !repeat) return length; |
| 252 | return -1; /* Error, or do not support >16K extensions */ |
| 253 | } |
| 254 | } |
| 255 | |
| 256 | ssize_t |
| 257 | aper_get_nslength(asn_per_data_t *pd) { |
| 258 | ssize_t length; |
| 259 | |
| 260 | ASN_DEBUG("Getting normally small length"); |
| 261 | |
| 262 | if(per_get_few_bits(pd, 1) == 0) { |
| 263 | length = per_get_few_bits(pd, 6) + 1; |
| 264 | if(length <= 0) return -1; |
| 265 | ASN_DEBUG("l=%d", length); |
| 266 | return length; |
| 267 | } else { |
| 268 | int repeat; |
| 269 | length = aper_get_length(pd, -1, -1, &repeat); |
| 270 | if(length >= 0 && !repeat) return length; |
| 271 | return -1; /* Error, or do not support >16K extensions */ |
| 272 | } |
| 273 | } |
| 274 | |
| 275 | /* |
| 276 | * Get the normally small non-negative whole number. |
| 277 | * X.691, #10.6 |
| 278 | */ |
| 279 | ssize_t |
| 280 | uper_get_nsnnwn(asn_per_data_t *pd) { |
| 281 | ssize_t value; |
| 282 | |
| 283 | value = per_get_few_bits(pd, 7); |
| 284 | if(value & 64) { /* implicit (value < 0) */ |
| 285 | value &= 63; |
| 286 | value <<= 2; |
| 287 | value |= per_get_few_bits(pd, 2); |
| 288 | if(value & 128) /* implicit (value < 0) */ |
| 289 | return -1; |
| 290 | if(value == 0) |
| 291 | return 0; |
| 292 | if(value >= 3) |
| 293 | return -1; |
| 294 | value = per_get_few_bits(pd, 8 * value); |
| 295 | return value; |
| 296 | } |
| 297 | |
| 298 | return value; |
| 299 | } |
| 300 | |
| 301 | ssize_t |
| 302 | aper_get_nsnnwn(asn_per_data_t *pd, int range) { |
| 303 | ssize_t value; |
| 304 | int bytes = 0; |
| 305 | |
| 306 | ASN_DEBUG("getting nsnnwn with range %d", range); |
| 307 | |
| 308 | if(range <= 255) { |
| 309 | if (range < 0) return -1; |
| 310 | /* 1 -> 8 bits */ |
| 311 | int i; |
| 312 | for (i = 1; i <= 8; i++) { |
| 313 | int upper = 1 << i; |
| 314 | if (upper >= range) |
| 315 | break; |
| 316 | } |
| 317 | value = per_get_few_bits(pd, i); |
| 318 | return value; |
| 319 | } else if (range == 256){ |
| 320 | /* 1 byte */ |
| 321 | bytes = 1; |
| 322 | return -1; |
| 323 | } else if (range <= 65536) { |
| 324 | /* 2 bytes */ |
| 325 | bytes = 2; |
| 326 | } else { |
| 327 | return -1; |
| 328 | } |
| 329 | if (aper_get_align(pd) < 0) |
| 330 | return -1; |
| 331 | value = per_get_few_bits(pd, 8 * bytes); |
| 332 | return value; |
| 333 | } |
| 334 | |
| 335 | /* |
| 336 | * X.691-11/2008, #11.6 |
| 337 | * Encoding of a normally small non-negative whole number |
| 338 | */ |
| 339 | int |
| 340 | uper_put_nsnnwn(asn_per_outp_t *po, int n) { |
| 341 | int bytes; |
| 342 | |
| 343 | ASN_DEBUG("uper put nsnnwn n %d", n); |
| 344 | if(n <= 63) { |
| 345 | if(n < 0) return -1; |
| 346 | return per_put_few_bits(po, n, 7); |
| 347 | } |
| 348 | if(n < 256) |
| 349 | bytes = 1; |
| 350 | else if(n < 65536) |
| 351 | bytes = 2; |
| 352 | else if(n < 256 * 65536) |
| 353 | bytes = 3; |
| 354 | else |
| 355 | return -1; /* This is not a "normally small" value */ |
| 356 | if(per_put_few_bits(po, bytes, 8)) |
| 357 | return -1; |
| 358 | |
| 359 | return per_put_few_bits(po, n, 8 * bytes); |
| 360 | } |
| 361 | |
| 362 | |
| 363 | /* X.691-2008/11, #11.5.6 -> #11.3 */ |
| 364 | int uper_get_constrained_whole_number(asn_per_data_t *pd, unsigned long *out_value, int nbits) { |
| 365 | unsigned long lhalf; /* Lower half of the number*/ |
| 366 | long half; |
| 367 | |
| 368 | if(nbits <= 31) { |
| 369 | half = per_get_few_bits(pd, nbits); |
| 370 | if(half < 0) return -1; |
| 371 | *out_value = half; |
| 372 | return 0; |
| 373 | } |
| 374 | |
| 375 | if((size_t)nbits > 8 * sizeof(*out_value)) |
| 376 | return -1; /* RANGE */ |
| 377 | |
| 378 | half = per_get_few_bits(pd, 31); |
| 379 | if(half < 0) return -1; |
| 380 | |
| 381 | if(uper_get_constrained_whole_number(pd, &lhalf, nbits - 31)) |
| 382 | return -1; |
| 383 | |
| 384 | *out_value = ((unsigned long)half << (nbits - 31)) | lhalf; |
| 385 | return 0; |
| 386 | } |
| 387 | |
| 388 | |
| 389 | /* X.691-2008/11, #11.5.6 -> #11.3 */ |
| 390 | int uper_put_constrained_whole_number_s(asn_per_outp_t *po, long v, int nbits) { |
| 391 | /* |
| 392 | * Assume signed number can be safely coerced into |
| 393 | * unsigned of the same range. |
| 394 | * The following testing code will likely be optimized out |
| 395 | * by compiler if it is true. |
| 396 | */ |
| 397 | unsigned long uvalue1 = ULONG_MAX; |
| 398 | long svalue = uvalue1; |
| 399 | unsigned long uvalue2 = svalue; |
| 400 | assert(uvalue1 == uvalue2); |
| 401 | return uper_put_constrained_whole_number_u(po, v, nbits); |
| 402 | } |
| 403 | |
| 404 | int uper_put_constrained_whole_number_u(asn_per_outp_t *po, unsigned long v, int nbits) { |
| 405 | if(nbits <= 31) { |
| 406 | return per_put_few_bits(po, v, nbits); |
| 407 | } else { |
| 408 | /* Put higher portion first, followed by lower 31-bit */ |
| 409 | if(uper_put_constrained_whole_number_u(po, v >> 31, nbits - 31)) |
| 410 | return -1; |
| 411 | return per_put_few_bits(po, v, 31); |
| 412 | } |
| 413 | } |
| 414 | |
| 415 | /* |
| 416 | * Put a small number of bits (<= 31). |
| 417 | */ |
| 418 | int |
| 419 | per_put_few_bits(asn_per_outp_t *po, uint32_t bits, int obits) { |
| 420 | size_t off; /* Next after last bit offset */ |
| 421 | size_t omsk; /* Existing last byte meaningful bits mask */ |
| 422 | uint8_t *buf; |
| 423 | |
| 424 | if(obits <= 0 || obits >= 32) return obits ? -1 : 0; |
| 425 | |
| 426 | ASN_DEBUG("[PER put %d bits %x to %p+%d bits]", |
| 427 | obits, (int)bits, po->buffer, (int)po->nboff); |
| 428 | |
| 429 | /* |
| 430 | * Normalize position indicator. |
| 431 | */ |
| 432 | if(po->nboff >= 8) { |
| 433 | po->buffer += (po->nboff >> 3); |
| 434 | po->nbits -= (po->nboff & ~0x07); |
| 435 | po->nboff &= 0x07; |
| 436 | } |
| 437 | |
| 438 | /* |
| 439 | * Flush whole-bytes output, if necessary. |
| 440 | */ |
| 441 | if(po->nboff + obits > po->nbits) { |
| 442 | int complete_bytes = (po->buffer - po->tmpspace); |
| 443 | ASN_DEBUG("[PER output %ld complete + %ld]", |
| 444 | (long)complete_bytes, (long)po->flushed_bytes); |
| 445 | if(po->outper(po->tmpspace, complete_bytes, po->op_key) < 0) |
| 446 | return -1; |
| 447 | if(po->nboff) |
| 448 | po->tmpspace[0] = po->buffer[0]; |
| 449 | po->buffer = po->tmpspace; |
| 450 | po->nbits = 8 * sizeof(po->tmpspace); |
| 451 | po->flushed_bytes += complete_bytes; |
| 452 | } |
| 453 | |
| 454 | /* |
| 455 | * Now, due to sizeof(tmpspace), we are guaranteed large enough space. |
| 456 | */ |
| 457 | buf = po->buffer; |
| 458 | omsk = ~((1 << (8 - po->nboff)) - 1); |
| 459 | off = (po->nboff + obits); |
| 460 | |
| 461 | /* Clear data of debris before meaningful bits */ |
| 462 | bits &= (((uint32_t)1 << obits) - 1); |
| 463 | |
| 464 | ASN_DEBUG("[PER out %d %u/%x (t=%d,o=%d) %x&%x=%x]", obits, |
| 465 | (int)bits, (int)bits, |
| 466 | (int)po->nboff, (int)off, |
| 467 | buf[0], (int)(omsk&0xff), |
| 468 | (int)(buf[0] & omsk)); |
| 469 | |
| 470 | if(off <= 8) /* Completely within 1 byte */ |
| 471 | po->nboff = off, |
| 472 | bits <<= (8 - off), |
| 473 | buf[0] = (buf[0] & omsk) | bits; |
| 474 | else if(off <= 16) |
| 475 | po->nboff = off, |
| 476 | bits <<= (16 - off), |
| 477 | buf[0] = (buf[0] & omsk) | (bits >> 8), |
| 478 | buf[1] = bits; |
| 479 | else if(off <= 24) |
| 480 | po->nboff = off, |
| 481 | bits <<= (24 - off), |
| 482 | buf[0] = (buf[0] & omsk) | (bits >> 16), |
| 483 | buf[1] = bits >> 8, |
| 484 | buf[2] = bits; |
| 485 | else if(off <= 31) |
| 486 | po->nboff = off, |
| 487 | bits <<= (32 - off), |
| 488 | buf[0] = (buf[0] & omsk) | (bits >> 24), |
| 489 | buf[1] = bits >> 16, |
| 490 | buf[2] = bits >> 8, |
| 491 | buf[3] = bits; |
| 492 | else { |
| 493 | per_put_few_bits(po, bits >> (obits - 24), 24); |
| 494 | per_put_few_bits(po, bits, obits - 24); |
| 495 | } |
| 496 | |
| 497 | ASN_DEBUG("[PER out %u/%x => %02x buf+%ld]", |
| 498 | (int)bits, (int)bits, buf[0], |
| 499 | (long)(po->buffer - po->tmpspace)); |
| 500 | |
| 501 | return 0; |
| 502 | } |
| 503 | |
| 504 | int |
| 505 | aper_put_nsnnwn(asn_per_outp_t *po, int range, int number) { |
| 506 | int bytes; |
| 507 | |
| 508 | ASN_DEBUG("aper put nsnnwn %d with range %d", number, range); |
| 509 | /* 10.5.7.1 X.691 */ |
| 510 | if(range < 0) { |
| 511 | int i; |
| 512 | for (i = 1; ; i++) { |
| 513 | int bits = 1 << (8 * i); |
| 514 | if (number <= bits) |
| 515 | break; |
| 516 | } |
| 517 | bytes = i; |
| 518 | assert(i <= 4); |
| 519 | } |
| 520 | if(range <= 255) { |
| 521 | int i; |
| 522 | for (i = 1; i <= 8; i++) { |
| 523 | int bits = 1 << i; |
| 524 | if (range <= bits) |
| 525 | break; |
| 526 | } |
| 527 | return per_put_few_bits(po, number, i); |
| 528 | } else if(range == 256) { |
| 529 | bytes = 1; |
| 530 | } else if(range <= 65536) { |
| 531 | bytes = 2; |
| 532 | } else { /* Ranges > 64K */ |
| 533 | int i; |
| 534 | for (i = 1; ; i++) { |
| 535 | int bits = 1 << (8 * i); |
| 536 | if (range <= bits) |
| 537 | break; |
| 538 | } |
| 539 | assert(i <= 4); |
| 540 | bytes = i; |
| 541 | } |
| 542 | if(aper_put_align(po) < 0) /* Aligning on octet */ |
| 543 | return -1; |
| 544 | // if(per_put_few_bits(po, bytes, 8)) |
| 545 | // return -1; |
| 546 | |
| 547 | return per_put_few_bits(po, number, 8 * bytes); |
| 548 | } |
| 549 | |
| 550 | int aper_put_align(asn_per_outp_t *po) { |
| 551 | |
| 552 | if(po->nboff & 0x7) { |
| 553 | ASN_DEBUG("Aligning %d bits", 8 - (po->nboff & 0x7)); |
| 554 | if(per_put_few_bits(po, 0x00, (8 - (po->nboff & 0x7)))) |
| 555 | return -1; |
| 556 | } |
| 557 | return 0; |
| 558 | } |
| 559 | |
| 560 | /* |
| 561 | * Output a large number of bits. |
| 562 | */ |
| 563 | int |
| 564 | per_put_many_bits(asn_per_outp_t *po, const uint8_t *src, int nbits) { |
| 565 | |
| 566 | while(nbits) { |
| 567 | uint32_t value; |
| 568 | |
| 569 | if(nbits >= 24) { |
| 570 | value = (src[0] << 16) | (src[1] << 8) | src[2]; |
| 571 | src += 3; |
| 572 | nbits -= 24; |
| 573 | if(per_put_few_bits(po, value, 24)) |
| 574 | return -1; |
| 575 | } else { |
| 576 | value = src[0]; |
| 577 | if(nbits > 8) |
| 578 | value = (value << 8) | src[1]; |
| 579 | if(nbits > 16) |
| 580 | value = (value << 8) | src[2]; |
| 581 | if(nbits & 0x07) |
| 582 | value >>= (8 - (nbits & 0x07)); |
| 583 | if(per_put_few_bits(po, value, nbits)) |
| 584 | return -1; |
| 585 | break; |
| 586 | } |
| 587 | } |
| 588 | |
| 589 | return 0; |
| 590 | } |
| 591 | |
| 592 | /* |
| 593 | * Put the length "n" (or part of it) into the stream. |
| 594 | */ |
| 595 | ssize_t |
| 596 | uper_put_length(asn_per_outp_t *po, size_t length) { |
| 597 | |
| 598 | ASN_DEBUG("UPER put length %d", length); |
| 599 | |
| 600 | if(length <= 127) /* #10.9.3.6 */ |
| 601 | return per_put_few_bits(po, length, 8) |
| 602 | ? -1 : (ssize_t)length; |
| 603 | else if(length < 16384) /* #10.9.3.7 */ |
| 604 | return per_put_few_bits(po, length|0x8000, 16) |
| 605 | ? -1 : (ssize_t)length; |
| 606 | |
| 607 | length >>= 14; |
| 608 | if(length > 4) length = 4; |
| 609 | |
| 610 | return per_put_few_bits(po, 0xC0 | length, 8) |
| 611 | ? -1 : (ssize_t)(length << 14); |
| 612 | } |
| 613 | |
| 614 | ssize_t |
| 615 | aper_put_length(asn_per_outp_t *po, int range, size_t length) { |
| 616 | |
| 617 | ASN_DEBUG("APER put length %d with range %d", length, range); |
| 618 | |
| 619 | /* 10.9 X.691 Note 2 */ |
| 620 | if (range <= 65536 && range >= 0) |
| 621 | return aper_put_nsnnwn(po, range, length); |
| 622 | |
| 623 | if (aper_put_align(po) < 0) |
| 624 | return -1; |
| 625 | |
| 626 | if(length <= 127) /* #10.9.3.6 */{ |
| 627 | return per_put_few_bits(po, length, 8) |
| 628 | ? -1 : (ssize_t)length; |
| 629 | } |
| 630 | else if(length < 16384) /* #10.9.3.7 */ |
| 631 | return per_put_few_bits(po, length|0x8000, 16) |
| 632 | ? -1 : (ssize_t)length; |
| 633 | |
| 634 | length >>= 14; |
| 635 | if(length > 4) length = 4; |
| 636 | |
| 637 | return per_put_few_bits(po, 0xC0 | length, 8) |
| 638 | ? -1 : (ssize_t)(length << 14); |
| 639 | } |
| 640 | |
| 641 | |
| 642 | /* |
| 643 | * Put the normally small length "n" into the stream. |
| 644 | * This procedure used to encode length of extensions bit-maps |
| 645 | * for SET and SEQUENCE types. |
| 646 | */ |
| 647 | int |
| 648 | uper_put_nslength(asn_per_outp_t *po, size_t length) { |
| 649 | |
| 650 | if(length <= 64) { |
| 651 | /* #10.9.3.4 */ |
| 652 | if(length == 0) return -1; |
| 653 | return per_put_few_bits(po, length-1, 7) ? -1 : 0; |
| 654 | } else { |
| 655 | if(uper_put_length(po, length) != (ssize_t)length) { |
| 656 | /* This might happen in case of >16K extensions */ |
| 657 | return -1; |
| 658 | } |
| 659 | } |
| 660 | |
| 661 | return 0; |
| 662 | } |
| 663 | |
| 664 | int |
| 665 | aper_put_nslength(asn_per_outp_t *po, size_t length) { |
| 666 | |
| 667 | if(length <= 64) { |
| 668 | /* #10.9.3.4 */ |
| 669 | if(length == 0) return -1; |
| 670 | return per_put_few_bits(po, length-1, 7) ? -1 : 0; |
| 671 | } else { |
| 672 | if(aper_put_length(po, -1, length) != (ssize_t)length) { |
| 673 | /* This might happen in case of >16K extensions */ |
| 674 | return -1; |
| 675 | } |
| 676 | } |
| 677 | |
| 678 | return 0; |
| 679 | } |