Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 1 | /* |
Lev Walkin | 6c52784 | 2014-02-09 04:34:54 -0800 | [diff] [blame] | 2 | * Copyright (c) 2005-2014 Lev Walkin <vlm@lionet.info>. |
Lev Walkin | 9218bc1 | 2007-06-27 04:09:37 +0000 | [diff] [blame] | 3 | * All rights reserved. |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 4 | * Redistribution and modifications are permitted subject to BSD license. |
| 5 | */ |
| 6 | #include <asn_system.h> |
Lev Walkin | 9f5bb3a | 2006-08-18 01:46:46 +0000 | [diff] [blame] | 7 | #include <asn_internal.h> |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 8 | #include <per_support.h> |
| 9 | |
Lev Walkin | 88acdd7 | 2007-06-29 02:28:05 +0000 | [diff] [blame] | 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; |
Lev Walkin | 034ee19 | 2016-03-14 02:28:33 -0700 | [diff] [blame] | 15 | snprintf(buf[n], sizeof(buf[n]), |
Lev Walkin | 2e76399 | 2011-07-21 01:17:37 +0400 | [diff] [blame] | 16 | "{m=%ld span %+ld[%d..%d] (%d)}", |
Lev Walkin | fe1ffaf | 2010-10-25 21:07:59 -0700 | [diff] [blame] | 17 | (long)pd->moved, |
Lev Walkin | 2e76399 | 2011-07-21 01:17:37 +0400 | [diff] [blame] | 18 | (((long)pd->buffer) & 0xf), |
Lev Walkin | fe1ffaf | 2010-10-25 21:07:59 -0700 | [diff] [blame] | 19 | (int)pd->nboff, (int)pd->nbits, |
| 20 | (int)(pd->nbits - pd->nboff)); |
Lev Walkin | 88acdd7 | 2007-06-29 02:28:05 +0000 | [diff] [blame] | 21 | return buf[n]; |
| 22 | } |
| 23 | |
Lev Walkin | d00657f | 2007-06-26 02:51:10 +0000 | [diff] [blame] | 24 | void |
| 25 | per_get_undo(asn_per_data_t *pd, int nbits) { |
Lev Walkin | 5ce11fd | 2007-06-26 03:16:35 +0000 | [diff] [blame] | 26 | if((ssize_t)pd->nboff < nbits) { |
| 27 | assert((ssize_t)pd->nboff < nbits); |
Lev Walkin | d00657f | 2007-06-26 02:51:10 +0000 | [diff] [blame] | 28 | } else { |
| 29 | pd->nboff -= nbits; |
| 30 | pd->moved -= nbits; |
| 31 | } |
| 32 | } |
| 33 | |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 34 | /* |
Lev Walkin | 6036488 | 2005-11-28 06:58:11 +0000 | [diff] [blame] | 35 | * Extract a small number of bits (<= 31) from the specified PER data pointer. |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 36 | */ |
| 37 | int32_t |
| 38 | per_get_few_bits(asn_per_data_t *pd, int nbits) { |
| 39 | size_t off; /* Next after last bit offset */ |
Lev Walkin | d00657f | 2007-06-26 02:51:10 +0000 | [diff] [blame] | 40 | ssize_t nleft; /* Number of bits left in this stream */ |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 41 | uint32_t accum; |
Lev Walkin | 1d9e8dd | 2005-12-07 05:46:03 +0000 | [diff] [blame] | 42 | const uint8_t *buf; |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 43 | |
Lev Walkin | 5b78e1c | 2007-06-24 06:26:47 +0000 | [diff] [blame] | 44 | if(nbits < 0) |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 45 | return -1; |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 46 | |
Lev Walkin | 5b78e1c | 2007-06-24 06:26:47 +0000 | [diff] [blame] | 47 | nleft = pd->nbits - pd->nboff; |
| 48 | if(nbits > nleft) { |
| 49 | int32_t tailv, vhead; |
| 50 | if(!pd->refill || nbits > 31) return -1; |
| 51 | /* Accumulate unused bytes before refill */ |
Lev Walkin | fe1ffaf | 2010-10-25 21:07:59 -0700 | [diff] [blame] | 52 | ASN_DEBUG("Obtain the rest %d bits (want %d)", |
| 53 | (int)nleft, (int)nbits); |
Lev Walkin | 5b78e1c | 2007-06-24 06:26:47 +0000 | [diff] [blame] | 54 | tailv = per_get_few_bits(pd, nleft); |
| 55 | if(tailv < 0) return -1; |
| 56 | /* Refill (replace pd contents with new data) */ |
| 57 | if(pd->refill(pd)) |
| 58 | return -1; |
| 59 | nbits -= nleft; |
| 60 | vhead = per_get_few_bits(pd, nbits); |
| 61 | /* Combine the rest of previous pd with the head of new one */ |
| 62 | tailv = (tailv << nbits) | vhead; /* Could == -1 */ |
| 63 | return tailv; |
| 64 | } |
| 65 | |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 66 | /* |
| 67 | * Normalize position indicator. |
| 68 | */ |
| 69 | if(pd->nboff >= 8) { |
| 70 | pd->buffer += (pd->nboff >> 3); |
| 71 | pd->nbits -= (pd->nboff & ~0x07); |
| 72 | pd->nboff &= 0x07; |
| 73 | } |
Lev Walkin | d00657f | 2007-06-26 02:51:10 +0000 | [diff] [blame] | 74 | pd->moved += nbits; |
| 75 | pd->nboff += nbits; |
| 76 | off = pd->nboff; |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 77 | buf = pd->buffer; |
| 78 | |
| 79 | /* |
| 80 | * Extract specified number of bits. |
| 81 | */ |
| 82 | if(off <= 8) |
Lev Walkin | 6036488 | 2005-11-28 06:58:11 +0000 | [diff] [blame] | 83 | accum = nbits ? (buf[0]) >> (8 - off) : 0; |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 84 | else if(off <= 16) |
| 85 | accum = ((buf[0] << 8) + buf[1]) >> (16 - off); |
| 86 | else if(off <= 24) |
| 87 | accum = ((buf[0] << 16) + (buf[1] << 8) + buf[2]) >> (24 - off); |
| 88 | else if(off <= 31) |
| 89 | accum = ((buf[0] << 24) + (buf[1] << 16) |
| 90 | + (buf[2] << 8) + (buf[3])) >> (32 - off); |
Lev Walkin | 6036488 | 2005-11-28 06:58:11 +0000 | [diff] [blame] | 91 | else if(nbits <= 31) { |
| 92 | asn_per_data_t tpd = *pd; |
| 93 | /* Here are we with our 31-bits limit plus 1..7 bits offset. */ |
Lev Walkin | d00657f | 2007-06-26 02:51:10 +0000 | [diff] [blame] | 94 | per_get_undo(&tpd, nbits); |
| 95 | /* The number of available bits in the stream allow |
| 96 | * for the following operations to take place without |
| 97 | * invoking the ->refill() function */ |
Lev Walkin | 6036488 | 2005-11-28 06:58:11 +0000 | [diff] [blame] | 98 | accum = per_get_few_bits(&tpd, nbits - 24) << 24; |
| 99 | accum |= per_get_few_bits(&tpd, 24); |
| 100 | } else { |
Lev Walkin | d00657f | 2007-06-26 02:51:10 +0000 | [diff] [blame] | 101 | per_get_undo(pd, nbits); |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 102 | return -1; |
| 103 | } |
| 104 | |
Lev Walkin | a2987ea | 2007-06-26 23:56:54 +0000 | [diff] [blame] | 105 | accum &= (((uint32_t)1 << nbits) - 1); |
| 106 | |
Lev Walkin | 2e76399 | 2011-07-21 01:17:37 +0400 | [diff] [blame] | 107 | ASN_DEBUG(" [PER got %2d<=%2d bits => span %d %+ld[%d..%d]:%02x (%d) => 0x%x]", |
Lev Walkin | fe1ffaf | 2010-10-25 21:07:59 -0700 | [diff] [blame] | 108 | (int)nbits, (int)nleft, |
| 109 | (int)pd->moved, |
Lev Walkin | 2e76399 | 2011-07-21 01:17:37 +0400 | [diff] [blame] | 110 | (((long)pd->buffer) & 0xf), |
Lev Walkin | fe1ffaf | 2010-10-25 21:07:59 -0700 | [diff] [blame] | 111 | (int)pd->nboff, (int)pd->nbits, |
devjoa | 878c8b7 | 2015-12-17 11:01:56 +0100 | [diff] [blame] | 112 | ((pd->buffer != NULL)?pd->buffer[0]:0), |
Lev Walkin | fe1ffaf | 2010-10-25 21:07:59 -0700 | [diff] [blame] | 113 | (int)(pd->nbits - pd->nboff), |
Lev Walkin | 8b5ccc4 | 2007-06-29 16:01:51 +0000 | [diff] [blame] | 114 | (int)accum); |
Lev Walkin | a2987ea | 2007-06-26 23:56:54 +0000 | [diff] [blame] | 115 | |
| 116 | return accum; |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 117 | } |
| 118 | |
| 119 | /* |
| 120 | * Extract a large number of bits from the specified PER data pointer. |
| 121 | */ |
| 122 | int |
| 123 | per_get_many_bits(asn_per_data_t *pd, uint8_t *dst, int alright, int nbits) { |
| 124 | int32_t value; |
| 125 | |
| 126 | if(alright && (nbits & 7)) { |
| 127 | /* Perform right alignment of a first few bits */ |
| 128 | value = per_get_few_bits(pd, nbits & 0x07); |
| 129 | if(value < 0) return -1; |
| 130 | *dst++ = value; /* value is already right-aligned */ |
| 131 | nbits &= ~7; |
| 132 | } |
| 133 | |
| 134 | while(nbits) { |
| 135 | if(nbits >= 24) { |
| 136 | value = per_get_few_bits(pd, 24); |
| 137 | if(value < 0) return -1; |
| 138 | *(dst++) = value >> 16; |
| 139 | *(dst++) = value >> 8; |
| 140 | *(dst++) = value; |
| 141 | nbits -= 24; |
| 142 | } else { |
| 143 | value = per_get_few_bits(pd, nbits); |
| 144 | if(value < 0) return -1; |
Lev Walkin | 523de9e | 2006-08-18 01:34:18 +0000 | [diff] [blame] | 145 | if(nbits & 7) { /* implies left alignment */ |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 146 | value <<= 8 - (nbits & 7), |
| 147 | nbits += 8 - (nbits & 7); |
| 148 | if(nbits > 24) |
| 149 | *dst++ = value >> 24; |
| 150 | } |
| 151 | if(nbits > 16) |
| 152 | *dst++ = value >> 16; |
| 153 | if(nbits > 8) |
| 154 | *dst++ = value >> 8; |
| 155 | *dst++ = value; |
| 156 | break; |
| 157 | } |
| 158 | } |
| 159 | |
| 160 | return 0; |
| 161 | } |
| 162 | |
| 163 | /* |
Lev Walkin | 5d20588 | 2017-08-06 00:03:46 -0700 | [diff] [blame] | 164 | * X.691-201508 #10.9 General rules for encoding a length determinant. |
| 165 | * Get the optionally constrained length "n" from the stream. |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 166 | */ |
| 167 | ssize_t |
| 168 | uper_get_length(asn_per_data_t *pd, int ebits, int *repeat) { |
Lev Walkin | 5d20588 | 2017-08-06 00:03:46 -0700 | [diff] [blame] | 169 | ssize_t value; |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 170 | |
Lev Walkin | 5d20588 | 2017-08-06 00:03:46 -0700 | [diff] [blame] | 171 | *repeat = 0; |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 172 | |
Lev Walkin | 5d20588 | 2017-08-06 00:03:46 -0700 | [diff] [blame] | 173 | /* #11.9.4.1 Encoding if constrained (according to effective bits) */ |
| 174 | if(ebits >= 0 && ebits <= 16) { |
| 175 | return per_get_few_bits(pd, ebits); |
| 176 | } |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 177 | |
| 178 | value = per_get_few_bits(pd, 8); |
Lev Walkin | 5d20588 | 2017-08-06 00:03:46 -0700 | [diff] [blame] | 179 | if((value & 0x80) == 0) { /* #11.9.3.6 */ |
| 180 | return (value & 0x7F); |
| 181 | } else if((value & 0x40) == 0) { /* #11.9.3.7 */ |
| 182 | /* bit 8 ... set to 1 and bit 7 ... set to zero */ |
| 183 | value = ((value & 0x3f) << 8) | per_get_few_bits(pd, 8); |
| 184 | return value; /* potential -1 from per_get_few_bits passes through. */ |
| 185 | } else if(value < 0) { |
| 186 | return -1; |
| 187 | } |
| 188 | value &= 0x3f; /* this is "m" from X.691, #11.9.3.8 */ |
| 189 | if(value < 1 || value > 4) { |
| 190 | return -1; /* Prohibited by #11.9.3.8 */ |
| 191 | } |
| 192 | *repeat = 1; |
| 193 | return (16384 * value); |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 194 | } |
| 195 | |
| 196 | /* |
Lev Walkin | 5b78e1c | 2007-06-24 06:26:47 +0000 | [diff] [blame] | 197 | * Get the normally small length "n". |
| 198 | * This procedure used to decode length of extensions bit-maps |
| 199 | * for SET and SEQUENCE types. |
| 200 | */ |
| 201 | ssize_t |
| 202 | uper_get_nslength(asn_per_data_t *pd) { |
| 203 | ssize_t length; |
| 204 | |
Lev Walkin | a2987ea | 2007-06-26 23:56:54 +0000 | [diff] [blame] | 205 | ASN_DEBUG("Getting normally small length"); |
| 206 | |
Lev Walkin | 5b78e1c | 2007-06-24 06:26:47 +0000 | [diff] [blame] | 207 | if(per_get_few_bits(pd, 1) == 0) { |
Lev Walkin | a2987ea | 2007-06-26 23:56:54 +0000 | [diff] [blame] | 208 | length = per_get_few_bits(pd, 6) + 1; |
| 209 | if(length <= 0) return -1; |
Lev Walkin | fe1ffaf | 2010-10-25 21:07:59 -0700 | [diff] [blame] | 210 | ASN_DEBUG("l=%d", (int)length); |
Lev Walkin | a2987ea | 2007-06-26 23:56:54 +0000 | [diff] [blame] | 211 | return length; |
Lev Walkin | 5b78e1c | 2007-06-24 06:26:47 +0000 | [diff] [blame] | 212 | } else { |
| 213 | int repeat; |
| 214 | length = uper_get_length(pd, -1, &repeat); |
| 215 | if(length >= 0 && !repeat) return length; |
| 216 | return -1; /* Error, or do not support >16K extensions */ |
| 217 | } |
| 218 | } |
| 219 | |
| 220 | /* |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 221 | * Get the normally small non-negative whole number. |
| 222 | * X.691, #10.6 |
| 223 | */ |
| 224 | ssize_t |
| 225 | uper_get_nsnnwn(asn_per_data_t *pd) { |
| 226 | ssize_t value; |
| 227 | |
| 228 | value = per_get_few_bits(pd, 7); |
| 229 | if(value & 64) { /* implicit (value < 0) */ |
| 230 | value &= 63; |
| 231 | value <<= 2; |
| 232 | value |= per_get_few_bits(pd, 2); |
| 233 | if(value & 128) /* implicit (value < 0) */ |
| 234 | return -1; |
| 235 | if(value == 0) |
| 236 | return 0; |
| 237 | if(value >= 3) |
| 238 | return -1; |
| 239 | value = per_get_few_bits(pd, 8 * value); |
| 240 | return value; |
| 241 | } |
| 242 | |
| 243 | return value; |
| 244 | } |
Lev Walkin | 523de9e | 2006-08-18 01:34:18 +0000 | [diff] [blame] | 245 | |
| 246 | /* |
Lev Walkin | 6c52784 | 2014-02-09 04:34:54 -0800 | [diff] [blame] | 247 | * X.691-11/2008, #11.6 |
| 248 | * Encoding of a normally small non-negative whole number |
Lev Walkin | 523de9e | 2006-08-18 01:34:18 +0000 | [diff] [blame] | 249 | */ |
| 250 | int |
| 251 | uper_put_nsnnwn(asn_per_outp_t *po, int n) { |
| 252 | int bytes; |
| 253 | |
| 254 | if(n <= 63) { |
| 255 | if(n < 0) return -1; |
| 256 | return per_put_few_bits(po, n, 7); |
| 257 | } |
| 258 | if(n < 256) |
| 259 | bytes = 1; |
| 260 | else if(n < 65536) |
| 261 | bytes = 2; |
| 262 | else if(n < 256 * 65536) |
| 263 | bytes = 3; |
| 264 | else |
| 265 | return -1; /* This is not a "normally small" value */ |
| 266 | if(per_put_few_bits(po, bytes, 8)) |
| 267 | return -1; |
| 268 | |
| 269 | return per_put_few_bits(po, n, 8 * bytes); |
| 270 | } |
| 271 | |
| 272 | |
Lev Walkin | 6c52784 | 2014-02-09 04:34:54 -0800 | [diff] [blame] | 273 | /* X.691-2008/11, #11.5.6 -> #11.3 */ |
| 274 | int uper_get_constrained_whole_number(asn_per_data_t *pd, unsigned long *out_value, int nbits) { |
| 275 | unsigned long lhalf; /* Lower half of the number*/ |
| 276 | long half; |
| 277 | |
| 278 | if(nbits <= 31) { |
| 279 | half = per_get_few_bits(pd, nbits); |
| 280 | if(half < 0) return -1; |
| 281 | *out_value = half; |
| 282 | return 0; |
| 283 | } |
| 284 | |
| 285 | if((size_t)nbits > 8 * sizeof(*out_value)) |
| 286 | return -1; /* RANGE */ |
| 287 | |
| 288 | half = per_get_few_bits(pd, 31); |
| 289 | if(half < 0) return -1; |
| 290 | |
| 291 | if(uper_get_constrained_whole_number(pd, &lhalf, nbits - 31)) |
| 292 | return -1; |
| 293 | |
| 294 | *out_value = ((unsigned long)half << (nbits - 31)) | lhalf; |
| 295 | return 0; |
| 296 | } |
| 297 | |
| 298 | |
| 299 | /* X.691-2008/11, #11.5.6 -> #11.3 */ |
| 300 | int uper_put_constrained_whole_number_s(asn_per_outp_t *po, long v, int nbits) { |
| 301 | /* |
| 302 | * Assume signed number can be safely coerced into |
| 303 | * unsigned of the same range. |
| 304 | * The following testing code will likely be optimized out |
| 305 | * by compiler if it is true. |
| 306 | */ |
| 307 | unsigned long uvalue1 = ULONG_MAX; |
| 308 | long svalue = uvalue1; |
| 309 | unsigned long uvalue2 = svalue; |
| 310 | assert(uvalue1 == uvalue2); |
| 311 | return uper_put_constrained_whole_number_u(po, v, nbits); |
| 312 | } |
| 313 | |
| 314 | int uper_put_constrained_whole_number_u(asn_per_outp_t *po, unsigned long v, int nbits) { |
| 315 | if(nbits <= 31) { |
| 316 | return per_put_few_bits(po, v, nbits); |
| 317 | } else { |
| 318 | /* Put higher portion first, followed by lower 31-bit */ |
| 319 | if(uper_put_constrained_whole_number_u(po, v >> 31, nbits - 31)) |
| 320 | return -1; |
| 321 | return per_put_few_bits(po, v, 31); |
| 322 | } |
| 323 | } |
| 324 | |
Lev Walkin | 3fd85d8 | 2017-07-24 00:30:06 +0400 | [diff] [blame] | 325 | int |
| 326 | per_put_aligned_flush(asn_per_outp_t *po) { |
| 327 | uint32_t unused_bits = (0x7 & (8 - (po->nboff & 0x07))); |
| 328 | size_t complete_bytes = |
| 329 | (po->buffer ? po->buffer - po->tmpspace : 0) + ((po->nboff + 7) >> 3); |
| 330 | |
| 331 | if(unused_bits) { |
| 332 | po->buffer[po->nboff >> 3] &= ~0 << unused_bits; |
| 333 | } |
| 334 | |
| 335 | if(po->outper(po->tmpspace, complete_bytes, po->op_key) < 0) { |
| 336 | return -1; |
| 337 | } else { |
| 338 | po->buffer = po->tmpspace; |
| 339 | po->nboff = 0; |
| 340 | po->nbits = 8 * sizeof(po->tmpspace); |
| 341 | po->flushed_bytes += complete_bytes; |
| 342 | return 0; |
| 343 | } |
| 344 | } |
| 345 | |
Lev Walkin | 523de9e | 2006-08-18 01:34:18 +0000 | [diff] [blame] | 346 | /* |
| 347 | * Put a small number of bits (<= 31). |
| 348 | */ |
| 349 | int |
| 350 | per_put_few_bits(asn_per_outp_t *po, uint32_t bits, int obits) { |
| 351 | size_t off; /* Next after last bit offset */ |
| 352 | size_t omsk; /* Existing last byte meaningful bits mask */ |
| 353 | uint8_t *buf; |
| 354 | |
| 355 | if(obits <= 0 || obits >= 32) return obits ? -1 : 0; |
| 356 | |
Lev Walkin | 8b8381f | 2006-09-28 07:45:14 +0000 | [diff] [blame] | 357 | ASN_DEBUG("[PER put %d bits %x to %p+%d bits]", |
Lev Walkin | fe1ffaf | 2010-10-25 21:07:59 -0700 | [diff] [blame] | 358 | obits, (int)bits, po->buffer, (int)po->nboff); |
Lev Walkin | 0a8aa60 | 2006-09-18 20:05:55 +0000 | [diff] [blame] | 359 | |
Lev Walkin | 523de9e | 2006-08-18 01:34:18 +0000 | [diff] [blame] | 360 | /* |
| 361 | * Normalize position indicator. |
| 362 | */ |
| 363 | if(po->nboff >= 8) { |
| 364 | po->buffer += (po->nboff >> 3); |
| 365 | po->nbits -= (po->nboff & ~0x07); |
| 366 | po->nboff &= 0x07; |
| 367 | } |
| 368 | |
| 369 | /* |
| 370 | * Flush whole-bytes output, if necessary. |
| 371 | */ |
| 372 | if(po->nboff + obits > po->nbits) { |
Lev Walkin | 3fd85d8 | 2017-07-24 00:30:06 +0400 | [diff] [blame] | 373 | size_t complete_bytes; |
| 374 | if(!po->buffer) po->buffer = po->tmpspace; |
| 375 | complete_bytes = (po->buffer - po->tmpspace); |
Lev Walkin | fe1ffaf | 2010-10-25 21:07:59 -0700 | [diff] [blame] | 376 | ASN_DEBUG("[PER output %ld complete + %ld]", |
| 377 | (long)complete_bytes, (long)po->flushed_bytes); |
Lev Walkin | 8b8381f | 2006-09-28 07:45:14 +0000 | [diff] [blame] | 378 | if(po->outper(po->tmpspace, complete_bytes, po->op_key) < 0) |
Lev Walkin | 523de9e | 2006-08-18 01:34:18 +0000 | [diff] [blame] | 379 | return -1; |
| 380 | if(po->nboff) |
| 381 | po->tmpspace[0] = po->buffer[0]; |
| 382 | po->buffer = po->tmpspace; |
| 383 | po->nbits = 8 * sizeof(po->tmpspace); |
Lev Walkin | bc69177 | 2006-09-17 11:02:53 +0000 | [diff] [blame] | 384 | po->flushed_bytes += complete_bytes; |
Lev Walkin | 523de9e | 2006-08-18 01:34:18 +0000 | [diff] [blame] | 385 | } |
| 386 | |
| 387 | /* |
| 388 | * Now, due to sizeof(tmpspace), we are guaranteed large enough space. |
| 389 | */ |
| 390 | buf = po->buffer; |
| 391 | omsk = ~((1 << (8 - po->nboff)) - 1); |
Lev Walkin | 109ade5 | 2010-10-24 20:48:05 -0700 | [diff] [blame] | 392 | off = (po->nboff + obits); |
Lev Walkin | 523de9e | 2006-08-18 01:34:18 +0000 | [diff] [blame] | 393 | |
| 394 | /* Clear data of debris before meaningful bits */ |
| 395 | bits &= (((uint32_t)1 << obits) - 1); |
| 396 | |
Lev Walkin | 8b5ccc4 | 2007-06-29 16:01:51 +0000 | [diff] [blame] | 397 | ASN_DEBUG("[PER out %d %u/%x (t=%d,o=%d) %x&%x=%x]", obits, |
| 398 | (int)bits, (int)bits, |
Lev Walkin | fe1ffaf | 2010-10-25 21:07:59 -0700 | [diff] [blame] | 399 | (int)po->nboff, (int)off, |
| 400 | buf[0], (int)(omsk&0xff), |
| 401 | (int)(buf[0] & omsk)); |
Lev Walkin | 523de9e | 2006-08-18 01:34:18 +0000 | [diff] [blame] | 402 | |
| 403 | if(off <= 8) /* Completely within 1 byte */ |
Lev Walkin | 109ade5 | 2010-10-24 20:48:05 -0700 | [diff] [blame] | 404 | po->nboff = off, |
Lev Walkin | 523de9e | 2006-08-18 01:34:18 +0000 | [diff] [blame] | 405 | bits <<= (8 - off), |
| 406 | buf[0] = (buf[0] & omsk) | bits; |
| 407 | else if(off <= 16) |
Lev Walkin | 109ade5 | 2010-10-24 20:48:05 -0700 | [diff] [blame] | 408 | po->nboff = off, |
Lev Walkin | 523de9e | 2006-08-18 01:34:18 +0000 | [diff] [blame] | 409 | bits <<= (16 - off), |
| 410 | buf[0] = (buf[0] & omsk) | (bits >> 8), |
| 411 | buf[1] = bits; |
| 412 | else if(off <= 24) |
Lev Walkin | 109ade5 | 2010-10-24 20:48:05 -0700 | [diff] [blame] | 413 | po->nboff = off, |
Lev Walkin | 523de9e | 2006-08-18 01:34:18 +0000 | [diff] [blame] | 414 | bits <<= (24 - off), |
| 415 | buf[0] = (buf[0] & omsk) | (bits >> 16), |
| 416 | buf[1] = bits >> 8, |
| 417 | buf[2] = bits; |
| 418 | else if(off <= 31) |
Lev Walkin | 109ade5 | 2010-10-24 20:48:05 -0700 | [diff] [blame] | 419 | po->nboff = off, |
Lev Walkin | 523de9e | 2006-08-18 01:34:18 +0000 | [diff] [blame] | 420 | bits <<= (32 - off), |
| 421 | buf[0] = (buf[0] & omsk) | (bits >> 24), |
| 422 | buf[1] = bits >> 16, |
| 423 | buf[2] = bits >> 8, |
| 424 | buf[3] = bits; |
| 425 | else { |
Simo Sorce | e6b650a | 2016-07-25 04:35:04 -0400 | [diff] [blame] | 426 | if(per_put_few_bits(po, bits >> (obits - 24), 24)) return -1; |
| 427 | if(per_put_few_bits(po, bits, obits - 24)) return -1; |
Lev Walkin | 523de9e | 2006-08-18 01:34:18 +0000 | [diff] [blame] | 428 | } |
| 429 | |
Lev Walkin | fe1ffaf | 2010-10-25 21:07:59 -0700 | [diff] [blame] | 430 | ASN_DEBUG("[PER out %u/%x => %02x buf+%ld]", |
| 431 | (int)bits, (int)bits, buf[0], |
| 432 | (long)(po->buffer - po->tmpspace)); |
Lev Walkin | 523de9e | 2006-08-18 01:34:18 +0000 | [diff] [blame] | 433 | |
| 434 | return 0; |
| 435 | } |
| 436 | |
| 437 | |
| 438 | /* |
| 439 | * Output a large number of bits. |
| 440 | */ |
| 441 | int |
| 442 | per_put_many_bits(asn_per_outp_t *po, const uint8_t *src, int nbits) { |
| 443 | |
| 444 | while(nbits) { |
| 445 | uint32_t value; |
| 446 | |
| 447 | if(nbits >= 24) { |
| 448 | value = (src[0] << 16) | (src[1] << 8) | src[2]; |
| 449 | src += 3; |
| 450 | nbits -= 24; |
| 451 | if(per_put_few_bits(po, value, 24)) |
| 452 | return -1; |
| 453 | } else { |
| 454 | value = src[0]; |
| 455 | if(nbits > 8) |
| 456 | value = (value << 8) | src[1]; |
| 457 | if(nbits > 16) |
| 458 | value = (value << 8) | src[2]; |
| 459 | if(nbits & 0x07) |
| 460 | value >>= (8 - (nbits & 0x07)); |
| 461 | if(per_put_few_bits(po, value, nbits)) |
| 462 | return -1; |
| 463 | break; |
| 464 | } |
| 465 | } |
| 466 | |
| 467 | return 0; |
| 468 | } |
| 469 | |
| 470 | /* |
| 471 | * Put the length "n" (or part of it) into the stream. |
| 472 | */ |
| 473 | ssize_t |
| 474 | uper_put_length(asn_per_outp_t *po, size_t length) { |
| 475 | |
| 476 | if(length <= 127) /* #10.9.3.6 */ |
| 477 | return per_put_few_bits(po, length, 8) |
| 478 | ? -1 : (ssize_t)length; |
| 479 | else if(length < 16384) /* #10.9.3.7 */ |
| 480 | return per_put_few_bits(po, length|0x8000, 16) |
| 481 | ? -1 : (ssize_t)length; |
| 482 | |
| 483 | length >>= 14; |
| 484 | if(length > 4) length = 4; |
| 485 | |
| 486 | return per_put_few_bits(po, 0xC0 | length, 8) |
| 487 | ? -1 : (ssize_t)(length << 14); |
| 488 | } |
| 489 | |
Lev Walkin | 62258e2 | 2007-06-23 23:50:25 +0000 | [diff] [blame] | 490 | |
| 491 | /* |
| 492 | * Put the normally small length "n" into the stream. |
| 493 | * This procedure used to encode length of extensions bit-maps |
| 494 | * for SET and SEQUENCE types. |
| 495 | */ |
| 496 | int |
| 497 | uper_put_nslength(asn_per_outp_t *po, size_t length) { |
| 498 | |
| 499 | if(length <= 64) { |
| 500 | /* #10.9.3.4 */ |
| 501 | if(length == 0) return -1; |
| 502 | return per_put_few_bits(po, length-1, 7) ? -1 : 0; |
| 503 | } else { |
Lev Walkin | 5ce11fd | 2007-06-26 03:16:35 +0000 | [diff] [blame] | 504 | if(uper_put_length(po, length) != (ssize_t)length) { |
Lev Walkin | 62258e2 | 2007-06-23 23:50:25 +0000 | [diff] [blame] | 505 | /* This might happen in case of >16K extensions */ |
| 506 | return -1; |
| 507 | } |
| 508 | } |
| 509 | |
| 510 | return 0; |
| 511 | } |
| 512 | |