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 | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 10 | /* |
Lev Walkin | 5d20588 | 2017-08-06 00:03:46 -0700 | [diff] [blame] | 11 | * X.691-201508 #10.9 General rules for encoding a length determinant. |
| 12 | * Get the optionally constrained length "n" from the stream. |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 13 | */ |
| 14 | ssize_t |
| 15 | uper_get_length(asn_per_data_t *pd, int ebits, int *repeat) { |
Lev Walkin | 5d20588 | 2017-08-06 00:03:46 -0700 | [diff] [blame] | 16 | ssize_t value; |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 17 | |
Lev Walkin | 5d20588 | 2017-08-06 00:03:46 -0700 | [diff] [blame] | 18 | *repeat = 0; |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 19 | |
Lev Walkin | 5d20588 | 2017-08-06 00:03:46 -0700 | [diff] [blame] | 20 | /* #11.9.4.1 Encoding if constrained (according to effective bits) */ |
| 21 | if(ebits >= 0 && ebits <= 16) { |
| 22 | return per_get_few_bits(pd, ebits); |
| 23 | } |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 24 | |
| 25 | value = per_get_few_bits(pd, 8); |
Lev Walkin | 5d20588 | 2017-08-06 00:03:46 -0700 | [diff] [blame] | 26 | if((value & 0x80) == 0) { /* #11.9.3.6 */ |
| 27 | return (value & 0x7F); |
| 28 | } else if((value & 0x40) == 0) { /* #11.9.3.7 */ |
| 29 | /* bit 8 ... set to 1 and bit 7 ... set to zero */ |
| 30 | value = ((value & 0x3f) << 8) | per_get_few_bits(pd, 8); |
| 31 | return value; /* potential -1 from per_get_few_bits passes through. */ |
| 32 | } else if(value < 0) { |
| 33 | return -1; |
| 34 | } |
| 35 | value &= 0x3f; /* this is "m" from X.691, #11.9.3.8 */ |
| 36 | if(value < 1 || value > 4) { |
| 37 | return -1; /* Prohibited by #11.9.3.8 */ |
| 38 | } |
| 39 | *repeat = 1; |
| 40 | return (16384 * value); |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 41 | } |
| 42 | |
| 43 | /* |
Lev Walkin | 5b78e1c | 2007-06-24 06:26:47 +0000 | [diff] [blame] | 44 | * Get the normally small length "n". |
| 45 | * This procedure used to decode length of extensions bit-maps |
| 46 | * for SET and SEQUENCE types. |
| 47 | */ |
| 48 | ssize_t |
| 49 | uper_get_nslength(asn_per_data_t *pd) { |
| 50 | ssize_t length; |
| 51 | |
Lev Walkin | a2987ea | 2007-06-26 23:56:54 +0000 | [diff] [blame] | 52 | ASN_DEBUG("Getting normally small length"); |
| 53 | |
Lev Walkin | 5b78e1c | 2007-06-24 06:26:47 +0000 | [diff] [blame] | 54 | if(per_get_few_bits(pd, 1) == 0) { |
Lev Walkin | a2987ea | 2007-06-26 23:56:54 +0000 | [diff] [blame] | 55 | length = per_get_few_bits(pd, 6) + 1; |
| 56 | if(length <= 0) return -1; |
Lev Walkin | fe1ffaf | 2010-10-25 21:07:59 -0700 | [diff] [blame] | 57 | ASN_DEBUG("l=%d", (int)length); |
Lev Walkin | a2987ea | 2007-06-26 23:56:54 +0000 | [diff] [blame] | 58 | return length; |
Lev Walkin | 5b78e1c | 2007-06-24 06:26:47 +0000 | [diff] [blame] | 59 | } else { |
| 60 | int repeat; |
| 61 | length = uper_get_length(pd, -1, &repeat); |
| 62 | if(length >= 0 && !repeat) return length; |
| 63 | return -1; /* Error, or do not support >16K extensions */ |
| 64 | } |
| 65 | } |
| 66 | |
| 67 | /* |
Lev Walkin | 59b176e | 2005-11-26 11:25:14 +0000 | [diff] [blame] | 68 | * Get the normally small non-negative whole number. |
| 69 | * X.691, #10.6 |
| 70 | */ |
| 71 | ssize_t |
| 72 | uper_get_nsnnwn(asn_per_data_t *pd) { |
| 73 | ssize_t value; |
| 74 | |
| 75 | value = per_get_few_bits(pd, 7); |
| 76 | if(value & 64) { /* implicit (value < 0) */ |
| 77 | value &= 63; |
| 78 | value <<= 2; |
| 79 | value |= per_get_few_bits(pd, 2); |
| 80 | if(value & 128) /* implicit (value < 0) */ |
| 81 | return -1; |
| 82 | if(value == 0) |
| 83 | return 0; |
| 84 | if(value >= 3) |
| 85 | return -1; |
| 86 | value = per_get_few_bits(pd, 8 * value); |
| 87 | return value; |
| 88 | } |
| 89 | |
| 90 | return value; |
| 91 | } |
Lev Walkin | 523de9e | 2006-08-18 01:34:18 +0000 | [diff] [blame] | 92 | |
| 93 | /* |
Lev Walkin | 6c52784 | 2014-02-09 04:34:54 -0800 | [diff] [blame] | 94 | * X.691-11/2008, #11.6 |
| 95 | * Encoding of a normally small non-negative whole number |
Lev Walkin | 523de9e | 2006-08-18 01:34:18 +0000 | [diff] [blame] | 96 | */ |
| 97 | int |
| 98 | uper_put_nsnnwn(asn_per_outp_t *po, int n) { |
| 99 | int bytes; |
| 100 | |
| 101 | if(n <= 63) { |
| 102 | if(n < 0) return -1; |
| 103 | return per_put_few_bits(po, n, 7); |
| 104 | } |
| 105 | if(n < 256) |
| 106 | bytes = 1; |
| 107 | else if(n < 65536) |
| 108 | bytes = 2; |
| 109 | else if(n < 256 * 65536) |
| 110 | bytes = 3; |
| 111 | else |
| 112 | return -1; /* This is not a "normally small" value */ |
| 113 | if(per_put_few_bits(po, bytes, 8)) |
| 114 | return -1; |
| 115 | |
| 116 | return per_put_few_bits(po, n, 8 * bytes); |
| 117 | } |
| 118 | |
| 119 | |
Lev Walkin | 6c52784 | 2014-02-09 04:34:54 -0800 | [diff] [blame] | 120 | /* X.691-2008/11, #11.5.6 -> #11.3 */ |
| 121 | int uper_get_constrained_whole_number(asn_per_data_t *pd, unsigned long *out_value, int nbits) { |
| 122 | unsigned long lhalf; /* Lower half of the number*/ |
| 123 | long half; |
| 124 | |
| 125 | if(nbits <= 31) { |
| 126 | half = per_get_few_bits(pd, nbits); |
| 127 | if(half < 0) return -1; |
| 128 | *out_value = half; |
| 129 | return 0; |
| 130 | } |
| 131 | |
| 132 | if((size_t)nbits > 8 * sizeof(*out_value)) |
| 133 | return -1; /* RANGE */ |
| 134 | |
| 135 | half = per_get_few_bits(pd, 31); |
| 136 | if(half < 0) return -1; |
| 137 | |
| 138 | if(uper_get_constrained_whole_number(pd, &lhalf, nbits - 31)) |
| 139 | return -1; |
| 140 | |
| 141 | *out_value = ((unsigned long)half << (nbits - 31)) | lhalf; |
| 142 | return 0; |
| 143 | } |
| 144 | |
| 145 | |
| 146 | /* X.691-2008/11, #11.5.6 -> #11.3 */ |
| 147 | int uper_put_constrained_whole_number_s(asn_per_outp_t *po, long v, int nbits) { |
| 148 | /* |
| 149 | * Assume signed number can be safely coerced into |
| 150 | * unsigned of the same range. |
| 151 | * The following testing code will likely be optimized out |
| 152 | * by compiler if it is true. |
| 153 | */ |
| 154 | unsigned long uvalue1 = ULONG_MAX; |
| 155 | long svalue = uvalue1; |
| 156 | unsigned long uvalue2 = svalue; |
| 157 | assert(uvalue1 == uvalue2); |
| 158 | return uper_put_constrained_whole_number_u(po, v, nbits); |
| 159 | } |
| 160 | |
| 161 | int uper_put_constrained_whole_number_u(asn_per_outp_t *po, unsigned long v, int nbits) { |
| 162 | if(nbits <= 31) { |
| 163 | return per_put_few_bits(po, v, nbits); |
| 164 | } else { |
| 165 | /* Put higher portion first, followed by lower 31-bit */ |
| 166 | if(uper_put_constrained_whole_number_u(po, v >> 31, nbits - 31)) |
| 167 | return -1; |
| 168 | return per_put_few_bits(po, v, 31); |
| 169 | } |
| 170 | } |
| 171 | |
Lev Walkin | 523de9e | 2006-08-18 01:34:18 +0000 | [diff] [blame] | 172 | /* |
| 173 | * Put the length "n" (or part of it) into the stream. |
| 174 | */ |
| 175 | ssize_t |
| 176 | uper_put_length(asn_per_outp_t *po, size_t length) { |
| 177 | |
| 178 | if(length <= 127) /* #10.9.3.6 */ |
| 179 | return per_put_few_bits(po, length, 8) |
| 180 | ? -1 : (ssize_t)length; |
| 181 | else if(length < 16384) /* #10.9.3.7 */ |
| 182 | return per_put_few_bits(po, length|0x8000, 16) |
| 183 | ? -1 : (ssize_t)length; |
| 184 | |
| 185 | length >>= 14; |
| 186 | if(length > 4) length = 4; |
| 187 | |
| 188 | return per_put_few_bits(po, 0xC0 | length, 8) |
| 189 | ? -1 : (ssize_t)(length << 14); |
| 190 | } |
| 191 | |
Lev Walkin | 62258e2 | 2007-06-23 23:50:25 +0000 | [diff] [blame] | 192 | |
| 193 | /* |
| 194 | * Put the normally small length "n" into the stream. |
| 195 | * This procedure used to encode length of extensions bit-maps |
| 196 | * for SET and SEQUENCE types. |
| 197 | */ |
| 198 | int |
| 199 | uper_put_nslength(asn_per_outp_t *po, size_t length) { |
| 200 | |
| 201 | if(length <= 64) { |
| 202 | /* #10.9.3.4 */ |
| 203 | if(length == 0) return -1; |
| 204 | return per_put_few_bits(po, length-1, 7) ? -1 : 0; |
| 205 | } else { |
Lev Walkin | 5ce11fd | 2007-06-26 03:16:35 +0000 | [diff] [blame] | 206 | if(uper_put_length(po, length) != (ssize_t)length) { |
Lev Walkin | 62258e2 | 2007-06-23 23:50:25 +0000 | [diff] [blame] | 207 | /* This might happen in case of >16K extensions */ |
| 208 | return -1; |
| 209 | } |
| 210 | } |
| 211 | |
| 212 | return 0; |
| 213 | } |
| 214 | |