2 * Copyright (c) 2005-2017 Lev Walkin <vlm@lionet.info>. All rights reserved.
\r
3 * Redistribution and modifications are permitted subject to BSD license.
\r
5 #include <asn_system.h>
\r
6 #include <asn_internal.h>
\r
7 #include <per_support.h>
\r
10 * X.691-201508 #10.9 General rules for encoding a length determinant.
\r
11 * Get the optionally constrained length "n" from the stream.
\r
14 uper_get_length(asn_per_data_t *pd, int ebits, size_t lower_bound,
\r
20 /* #11.9.4.1 Encoding if constrained (according to effective bits) */
\r
21 if(ebits >= 0 && ebits <= 16) {
\r
22 value = per_get_few_bits(pd, ebits);
\r
23 if(value >= 0) value += lower_bound;
\r
27 value = per_get_few_bits(pd, 8);
\r
28 if((value & 0x80) == 0) { /* #11.9.3.6 */
\r
29 return (value & 0x7F);
\r
30 } else if((value & 0x40) == 0) { /* #11.9.3.7 */
\r
31 /* bit 8 ... set to 1 and bit 7 ... set to zero */
\r
32 value = ((value & 0x3f) << 8) | per_get_few_bits(pd, 8);
\r
33 return value; /* potential -1 from per_get_few_bits passes through. */
\r
34 } else if(value < 0) {
\r
35 ASN_DEBUG("END of stream reached for PER");
\r
38 value &= 0x3f; /* this is "m" from X.691, #11.9.3.8 */
\r
39 if(value < 1 || value > 4) {
\r
40 return -1; /* Prohibited by #11.9.3.8 */
\r
43 return (16384 * value);
\r
47 * Get the normally small length "n".
\r
48 * This procedure used to decode length of extensions bit-maps
\r
49 * for SET and SEQUENCE types.
\r
52 uper_get_nslength(asn_per_data_t *pd) {
\r
55 ASN_DEBUG("Getting normally small length");
\r
57 if(per_get_few_bits(pd, 1) == 0) {
\r
58 length = per_get_few_bits(pd, 6) + 1;
\r
59 if(length <= 0) return -1;
\r
60 ASN_DEBUG("l=%d", (int)length);
\r
64 length = uper_get_length(pd, -1, 0, &repeat);
\r
65 if(length >= 0 && !repeat) return length;
\r
66 return -1; /* Error, or do not support >16K extensions */
\r
71 * Get the normally small non-negative whole number.
\r
75 uper_get_nsnnwn(asn_per_data_t *pd) {
\r
78 value = per_get_few_bits(pd, 7);
\r
79 if(value & 64) { /* implicit (value < 0) */
\r
82 value |= per_get_few_bits(pd, 2);
\r
83 if(value & 128) /* implicit (value < 0) */
\r
89 value = per_get_few_bits(pd, 8 * value);
\r
97 * X.691-11/2008, #11.6
\r
98 * Encoding of a normally small non-negative whole number
\r
101 uper_put_nsnnwn(asn_per_outp_t *po, int n) {
\r
105 if(n < 0) return -1;
\r
106 return per_put_few_bits(po, n, 7);
\r
112 else if(n < 256 * 65536)
\r
115 return -1; /* This is not a "normally small" value */
\r
116 if(per_put_few_bits(po, bytes, 8))
\r
119 return per_put_few_bits(po, n, 8 * bytes);
\r
123 /* X.691-2008/11, #11.5.6 -> #11.3 */
\r
124 int uper_get_constrained_whole_number(asn_per_data_t *pd, unsigned long *out_value, int nbits) {
\r
125 unsigned long lhalf; /* Lower half of the number*/
\r
129 half = per_get_few_bits(pd, nbits);
\r
130 if(half < 0) return -1;
\r
135 if((size_t)nbits > 8 * sizeof(*out_value))
\r
136 return -1; /* RANGE */
\r
138 half = per_get_few_bits(pd, 31);
\r
139 if(half < 0) return -1;
\r
141 if(uper_get_constrained_whole_number(pd, &lhalf, nbits - 31))
\r
144 *out_value = ((unsigned long)half << (nbits - 31)) | lhalf;
\r
149 /* X.691-2008/11, #11.5.6 -> #11.3 */
\r
151 uper_put_constrained_whole_number_u(asn_per_outp_t *po, unsigned long v,
\r
154 return per_put_few_bits(po, v, nbits);
\r
156 /* Put higher portion first, followed by lower 31-bit */
\r
157 if(uper_put_constrained_whole_number_u(po, v >> 31, nbits - 31))
\r
159 return per_put_few_bits(po, v, 31);
\r
164 * X.691 (08/2015) #11.9 "General rules for encoding a length determinant"
\r
165 * Put the length "n" (or part of it) into the stream.
\r
168 uper_put_length(asn_per_outp_t *po, size_t length, int *need_eom) {
\r
170 if(!need_eom) need_eom = &dummy;
\r
172 if(length <= 127) { /* #11.9.3.6 */
\r
174 return per_put_few_bits(po, length, 8)
\r
175 ? -1 : (ssize_t)length;
\r
176 } else if(length < 16384) { /* #10.9.3.7 */
\r
178 return per_put_few_bits(po, length|0x8000, 16)
\r
179 ? -1 : (ssize_t)length;
\r
182 *need_eom = 0 == (length & 16383);
\r
189 return per_put_few_bits(po, 0xC0 | length, 8)
\r
190 ? -1 : (ssize_t)(length << 14);
\r
196 * Put the normally small length "n" into the stream.
\r
197 * This procedure used to encode length of extensions bit-maps
\r
198 * for SET and SEQUENCE types.
\r
201 uper_put_nslength(asn_per_outp_t *po, size_t length) {
\r
204 if(length == 0) return -1;
\r
205 return per_put_few_bits(po, length - 1, 7) ? -1 : 0;
\r
208 if(uper_put_length(po, length, &need_eom) != (ssize_t)length
\r
210 /* This might happen in case of >16K extensions */
\r
219 per__long_range(long lb, long ub, unsigned long *range_r) {
\r
220 unsigned long bounds_range;
\r
221 if((ub < 0) == (lb < 0)) {
\r
222 bounds_range = ub - lb;
\r
223 } else if(lb < 0) {
\r
225 bounds_range = 1 + ((unsigned long)ub + (unsigned long)-(lb + 1));
\r
227 assert(!"Unreachable");
\r
230 *range_r = bounds_range;
\r
235 per_long_range_rebase(long v, long lb, long ub, unsigned long *output) {
\r
236 unsigned long range;
\r
240 if(v < lb || v > ub || per__long_range(lb, ub, &range) < 0) {
\r
246 * Fundamentally what we're doing is returning (v-lb).
\r
247 * However, this triggers undefined behavior when the word width
\r
248 * of signed (v) is the same as the size of unsigned (*output).
\r
249 * In practice, it triggers the UndefinedSanitizer. Therefore we shall
\r
250 * compute the ranges accurately to avoid C's undefined behavior.
\r
252 if((v < 0) == (lb < 0)) {
\r
256 unsigned long rebased = 1 + (unsigned long)-(v+1) + (unsigned long)lb;
\r
257 assert(rebased <= range); /* By construction */
\r
260 } else if(lb < 0) {
\r
261 unsigned long rebased = 1 + (unsigned long)-(lb+1) + (unsigned long)v;
\r
262 assert(rebased <= range); /* By construction */
\r
266 assert(!"Unreachable");
\r
272 per_long_range_unrebase(unsigned long inp, long lb, long ub, long *outp) {
\r
273 unsigned long range;
\r
275 if(per__long_range(lb, ub, &range) != 0) {
\r
281 * We can encode something in the given number of bits that technically
\r
282 * exceeds the range. This is an avenue for security errors,
\r
283 * so we don't allow that.
\r
288 if(inp <= LONG_MAX) {
\r
289 *outp = (long)inp + lb;
\r
291 *outp = (lb + LONG_MAX + 1) + (long)((inp - LONG_MAX) - 1);
\r
298 aper_get_align(asn_per_data_t *pd) {
\r
300 if(pd->nboff & 0x7) {
\r
301 ASN_DEBUG("Aligning %ld bits", 8 - ((unsigned long)pd->nboff & 0x7));
\r
302 return per_get_few_bits(pd, 8 - (pd->nboff & 0x7));
\r
308 aper_get_length(asn_per_data_t *pd, int range, int ebits, int *repeat) {
\r
313 if (range <= 65536 && range >= 0)
\r
314 return aper_get_nsnnwn(pd, range);
\r
316 if (aper_get_align(pd) < 0)
\r
319 if(ebits >= 0) return per_get_few_bits(pd, ebits);
\r
321 value = per_get_few_bits(pd, 8);
\r
322 if(value < 0) return -1;
\r
323 if((value & 128) == 0) /* #10.9.3.6 */
\r
324 return (value & 0x7F);
\r
325 if((value & 64) == 0) { /* #10.9.3.7 */
\r
326 value = ((value & 63) << 8) | per_get_few_bits(pd, 8);
\r
327 if(value < 0) return -1;
\r
330 value &= 63; /* this is "m" from X.691, #10.9.3.8 */
\r
331 if(value < 1 || value > 4)
\r
334 return (16384 * value);
\r
338 aper_get_nslength(asn_per_data_t *pd) {
\r
341 ASN_DEBUG("Getting normally small length");
\r
343 if(per_get_few_bits(pd, 1) == 0) {
\r
344 length = per_get_few_bits(pd, 6) + 1;
\r
345 if(length <= 0) return -1;
\r
346 ASN_DEBUG("l=%ld", length);
\r
350 length = aper_get_length(pd, -1, -1, &repeat);
\r
351 if(length >= 0 && !repeat) return length;
\r
352 return -1; /* Error, or do not support >16K extensions */
\r
357 aper_get_nsnnwn(asn_per_data_t *pd, int range) {
\r
361 ASN_DEBUG("getting nsnnwn with range %d", range);
\r
366 if (range < 0) return -1;
\r
368 for (i = 1; i <= 8; i++) {
\r
369 int upper = 1 << i;
\r
370 if (upper >= range)
\r
373 value = per_get_few_bits(pd, i);
\r
375 } else if (range == 256){
\r
378 } else if (range <= 65536) {
\r
384 if (aper_get_align(pd) < 0)
\r
386 value = per_get_few_bits(pd, 8 * bytes);
\r
390 int aper_put_align(asn_per_outp_t *po) {
\r
392 if(po->nboff & 0x7) {
\r
393 ASN_DEBUG("Aligning %ld bits", 8 - ((unsigned long)po->nboff & 0x7));
\r
394 if(per_put_few_bits(po, 0x00, (8 - (po->nboff & 0x7))))
\r
401 aper_put_length(asn_per_outp_t *po, int range, size_t length) {
\r
403 ASN_DEBUG("APER put length %zu with range %d", length, range);
\r
405 /* 10.9 X.691 Note 2 */
\r
406 if (range <= 65536 && range >= 0)
\r
407 return aper_put_nsnnwn(po, range, length);
\r
409 if (aper_put_align(po) < 0)
\r
412 if(length <= 127) /* #10.9.3.6 */{
\r
413 return per_put_few_bits(po, length, 8)
\r
414 ? -1 : (ssize_t)length;
\r
416 else if(length < 16384) /* #10.9.3.7 */
\r
417 return per_put_few_bits(po, length|0x8000, 16)
\r
418 ? -1 : (ssize_t)length;
\r
421 if(length > 4) length = 4;
\r
423 return per_put_few_bits(po, 0xC0 | length, 8)
\r
424 ? -1 : (ssize_t)(length << 14);
\r
429 aper_put_nslength(asn_per_outp_t *po, size_t length) {
\r
433 if(length == 0) return -1;
\r
434 return per_put_few_bits(po, length-1, 7) ? -1 : 0;
\r
436 if(aper_put_length(po, -1, length) != (ssize_t)length) {
\r
437 /* This might happen in case of >16K extensions */
\r
446 aper_put_nsnnwn(asn_per_outp_t *po, int range, int number) {
\r
449 ASN_DEBUG("aper put nsnnwn %d with range %d", number, range);
\r
450 /* 10.5.7.1 X.691 */
\r
453 for (i = 1; ; i++) {
\r
454 int bits = 1 << (8 * i);
\r
455 if (number <= bits)
\r
463 for (i = 1; i <= 8; i++) {
\r
468 return per_put_few_bits(po, number, i);
\r
469 } else if(range == 256) {
\r
471 } else if(range <= 65536) {
\r
473 } else { /* Ranges > 64K */
\r
475 for (i = 1; ; i++) {
\r
476 int bits = 1 << (8 * i);
\r
483 if(aper_put_align(po) < 0) /* Aligning on octet */
\r
485 /* if(per_put_few_bits(po, bytes, 8))
\r
488 return per_put_few_bits(po, number, 8 * bytes);
\r