blob: 7e9b82c42ff6f68d89b26a8efdedd745ba65e61a [file] [log] [blame]
Lev Walkinf15320b2004-06-03 03:38:44 +00001/*-
2 * Copyright (c) 2003, 2004 Lev Walkin <vlm@lionet.info>. All rights reserved.
3 * Redistribution and modifications are permitted subject to BSD license.
4 */
Lev Walkina9cc46e2004-09-22 16:06:28 +00005#include <asn_internal.h>
Lev Walkinf15320b2004-06-03 03:38:44 +00006#include <BIT_STRING.h>
Lev Walkin8e8078a2004-09-26 13:10:40 +00007#include <asn_internal.h>
Lev Walkinf15320b2004-06-03 03:38:44 +00008
9/*
10 * BIT STRING basic type description.
11 */
Wim Lewis18c2ec92014-07-29 11:30:10 -070012static const ber_tlv_tag_t asn_DEF_BIT_STRING_tags[] = {
Lev Walkinf15320b2004-06-03 03:38:44 +000013 (ASN_TAG_CLASS_UNIVERSAL | (3 << 2))
14};
Bi-Ruei, Chiu1fa31c92016-05-16 13:50:09 +080015asn_OCTET_STRING_specifics_t asn_SPC_BIT_STRING_specs = {
Lev Walkinbbd93252004-10-12 05:57:23 +000016 sizeof(BIT_STRING_t),
17 offsetof(BIT_STRING_t, _asn_ctx),
Lev Walkin3a4689a2006-11-24 11:20:27 +000018 ASN_OSUBV_BIT
Lev Walkinbbd93252004-10-12 05:57:23 +000019};
Bi-Ruei, Chiu1f87ac02017-08-20 01:25:45 +080020asn_TYPE_operation_t asn_OP_BIT_STRING = {
Lev Walkina9cc46e2004-09-22 16:06:28 +000021 OCTET_STRING_free, /* Implemented in terms of OCTET STRING */
22 BIT_STRING_print,
Lev Walkincd2f48e2017-08-10 02:14:59 -070023 BIT_STRING_compare,
Lev Walkinf15320b2004-06-03 03:38:44 +000024 BIT_STRING_constraint,
25 OCTET_STRING_decode_ber, /* Implemented in terms of OCTET STRING */
26 OCTET_STRING_encode_der, /* Implemented in terms of OCTET STRING */
Lev Walkindc06f6b2004-10-20 15:50:55 +000027 OCTET_STRING_decode_xer_binary,
Lev Walkina9cc46e2004-09-22 16:06:28 +000028 BIT_STRING_encode_xer,
Lev Walkincc159472017-07-06 08:26:36 -070029#ifdef ASN_DISABLE_OER_SUPPORT
30 0,
31 0,
32#else
33 0,
34 0,
35#endif /* ASN_DISABLE_OER_SUPPORT */
Lev Walkinb33425f2017-07-14 14:59:52 +040036#ifdef ASN_DISABLE_PER_SUPPORT
37 0,
38 0,
39#else
40 OCTET_STRING_decode_uper, /* Unaligned PER decoder */
41 OCTET_STRING_encode_uper, /* Unaligned PER encoder */
42#endif /* ASN_DISABLE_PER_SUPPORT */
Bi-Ruei, Chiu1f87ac02017-08-20 01:25:45 +080043 0 /* Use generic outmost tag fetcher */
44};
45asn_TYPE_descriptor_t asn_DEF_BIT_STRING = {
46 "BIT STRING",
47 "BIT_STRING",
48 &asn_OP_BIT_STRING,
49 BIT_STRING_constraint,
Lev Walkin5e033762004-09-29 13:26:15 +000050 asn_DEF_BIT_STRING_tags,
51 sizeof(asn_DEF_BIT_STRING_tags)
52 / sizeof(asn_DEF_BIT_STRING_tags[0]),
53 asn_DEF_BIT_STRING_tags, /* Same as above */
54 sizeof(asn_DEF_BIT_STRING_tags)
55 / sizeof(asn_DEF_BIT_STRING_tags[0]),
Lev Walkin76780762017-07-07 10:07:30 -070056 0, /* No OER visible constraints */
Lev Walkin59b176e2005-11-26 11:25:14 +000057 0, /* No PER visible constraints */
Lev Walkin449f8322004-08-20 13:23:42 +000058 0, 0, /* No members */
Bi-Ruei, Chiu419ac3a2016-05-14 15:27:19 +080059 &asn_SPC_BIT_STRING_specs
Lev Walkinf15320b2004-06-03 03:38:44 +000060};
61
62/*
63 * BIT STRING generic constraint.
64 */
65int
Lev Walkin5e033762004-09-29 13:26:15 +000066BIT_STRING_constraint(asn_TYPE_descriptor_t *td, const void *sptr,
Lev Walkin1eded352006-07-13 11:19:01 +000067 asn_app_constraint_failed_f *ctfailcb, void *app_key) {
Lev Walkinc2346572004-08-11 09:07:36 +000068 const BIT_STRING_t *st = (const BIT_STRING_t *)sptr;
Lev Walkinf15320b2004-06-03 03:38:44 +000069
70 if(st && st->buf) {
Lev Walkin9abdf262007-02-21 19:27:45 +000071 if((st->size == 0 && st->bits_unused)
72 || st->bits_unused < 0 || st->bits_unused > 7) {
Lev Walkin7c1dc052016-03-14 03:08:15 -070073 ASN__CTFAIL(app_key, td, sptr,
Lev Walkinbbd93252004-10-12 05:57:23 +000074 "%s: invalid padding byte (%s:%d)",
Lev Walkin16835b62004-08-22 13:47:59 +000075 td->name, __FILE__, __LINE__);
Lev Walkinf15320b2004-06-03 03:38:44 +000076 return -1;
77 }
78 } else {
Lev Walkin7c1dc052016-03-14 03:08:15 -070079 ASN__CTFAIL(app_key, td, sptr,
Lev Walkin16835b62004-08-22 13:47:59 +000080 "%s: value not given (%s:%d)",
81 td->name, __FILE__, __LINE__);
Lev Walkinf15320b2004-06-03 03:38:44 +000082 return -1;
83 }
84
85 return 0;
86}
87
johvik5f619fb2017-05-09 09:05:04 +020088static const char *_bit_pattern[16] = {
Lev Walkina9cc46e2004-09-22 16:06:28 +000089 "0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111",
90 "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"
91};
92
93asn_enc_rval_t
Lev Walkin5e033762004-09-29 13:26:15 +000094BIT_STRING_encode_xer(asn_TYPE_descriptor_t *td, void *sptr,
Lev Walkina9cc46e2004-09-22 16:06:28 +000095 int ilevel, enum xer_encoder_flags_e flags,
96 asn_app_consume_bytes_f *cb, void *app_key) {
97 asn_enc_rval_t er;
98 char scratch[128];
99 char *p = scratch;
100 char *scend = scratch + (sizeof(scratch) - 10);
101 const BIT_STRING_t *st = (const BIT_STRING_t *)sptr;
Lev Walkincc6a9102004-09-23 22:06:26 +0000102 int xcan = (flags & XER_F_CANONICAL);
Lev Walkina9cc46e2004-09-22 16:06:28 +0000103 uint8_t *buf;
104 uint8_t *end;
105
106 if(!st || !st->buf)
Lev Walkin7c1dc052016-03-14 03:08:15 -0700107 ASN__ENCODE_FAILED;
Lev Walkina9cc46e2004-09-22 16:06:28 +0000108
109 er.encoded = 0;
110
111 buf = st->buf;
112 end = buf + st->size - 1; /* Last byte is special */
113
114 /*
115 * Binary dump
116 */
Lev Walkinbbd93252004-10-12 05:57:23 +0000117 for(; buf < end; buf++) {
Lev Walkina9cc46e2004-09-22 16:06:28 +0000118 int v = *buf;
Lev Walkinbbd93252004-10-12 05:57:23 +0000119 int nline = xcan?0:(((buf - st->buf) % 8) == 0);
Lev Walkina9cc46e2004-09-22 16:06:28 +0000120 if(p >= scend || nline) {
121 er.encoded += p - scratch;
Lev Walkin7c1dc052016-03-14 03:08:15 -0700122 ASN__CALLBACK(scratch, p - scratch);
Lev Walkina9cc46e2004-09-22 16:06:28 +0000123 p = scratch;
Lev Walkinc6cac8e2016-03-14 02:57:07 -0700124 if(nline) ASN__TEXT_INDENT(1, ilevel);
Lev Walkina9cc46e2004-09-22 16:06:28 +0000125 }
126 memcpy(p + 0, _bit_pattern[v >> 4], 4);
127 memcpy(p + 4, _bit_pattern[v & 0x0f], 4);
128 p += 8;
129 }
130
Lev Walkinbbd93252004-10-12 05:57:23 +0000131 if(!xcan && ((buf - st->buf) % 8) == 0)
Lev Walkinc6cac8e2016-03-14 02:57:07 -0700132 ASN__TEXT_INDENT(1, ilevel);
Lev Walkin938c6fe2004-09-24 20:56:25 +0000133 er.encoded += p - scratch;
Lev Walkin7c1dc052016-03-14 03:08:15 -0700134 ASN__CALLBACK(scratch, p - scratch);
Lev Walkin938c6fe2004-09-24 20:56:25 +0000135 p = scratch;
Lev Walkina9cc46e2004-09-22 16:06:28 +0000136
Lev Walkin938c6fe2004-09-24 20:56:25 +0000137 if(buf == end) {
Lev Walkina9cc46e2004-09-22 16:06:28 +0000138 int v = *buf;
Lev Walkinbbd93252004-10-12 05:57:23 +0000139 int ubits = st->bits_unused;
Lev Walkina9cc46e2004-09-22 16:06:28 +0000140 int i;
Lev Walkinbbd93252004-10-12 05:57:23 +0000141 for(i = 7; i >= ubits; i--)
Lev Walkin5e033762004-09-29 13:26:15 +0000142 *p++ = (v & (1 << i)) ? 0x31 : 0x30;
Lev Walkina9cc46e2004-09-22 16:06:28 +0000143 er.encoded += p - scratch;
Lev Walkin7c1dc052016-03-14 03:08:15 -0700144 ASN__CALLBACK(scratch, p - scratch);
Lev Walkina9cc46e2004-09-22 16:06:28 +0000145 }
146
Lev Walkinc6cac8e2016-03-14 02:57:07 -0700147 if(!xcan) ASN__TEXT_INDENT(1, ilevel - 1);
Lev Walkincc6a9102004-09-23 22:06:26 +0000148
Lev Walkin7c1dc052016-03-14 03:08:15 -0700149 ASN__ENCODED_OK(er);
Lev Walkin942fd082004-10-03 09:13:02 +0000150cb_failed:
Lev Walkin7c1dc052016-03-14 03:08:15 -0700151 ASN__ENCODE_FAILED;
Lev Walkina9cc46e2004-09-22 16:06:28 +0000152}
153
154
Lev Walkinf15320b2004-06-03 03:38:44 +0000155/*
156 * BIT STRING specific contents printer.
157 */
158int
Lev Walkin5e033762004-09-29 13:26:15 +0000159BIT_STRING_print(asn_TYPE_descriptor_t *td, const void *sptr, int ilevel,
Lev Walkinf15320b2004-06-03 03:38:44 +0000160 asn_app_consume_bytes_f *cb, void *app_key) {
Wim Lewis59e8d282014-08-04 12:39:35 -0700161 const char * const h2c = "0123456789ABCDEF";
Lev Walkinf15320b2004-06-03 03:38:44 +0000162 char scratch[64];
Lev Walkinc2346572004-08-11 09:07:36 +0000163 const BIT_STRING_t *st = (const BIT_STRING_t *)sptr;
Lev Walkinf15320b2004-06-03 03:38:44 +0000164 uint8_t *buf;
165 uint8_t *end;
166 char *p = scratch;
167
Lev Walkind9bd7752004-06-05 08:17:50 +0000168 (void)td; /* Unused argument */
169
Lev Walkin8e8078a2004-09-26 13:10:40 +0000170 if(!st || !st->buf)
171 return (cb("<absent>", 8, app_key) < 0) ? -1 : 0;
Lev Walkinf15320b2004-06-03 03:38:44 +0000172
Lev Walkin8e8078a2004-09-26 13:10:40 +0000173 ilevel++;
Lev Walkinf15320b2004-06-03 03:38:44 +0000174 buf = st->buf;
175 end = buf + st->size;
176
177 /*
178 * Hexadecimal dump.
179 */
Lev Walkinbbd93252004-10-12 05:57:23 +0000180 for(; buf < end; buf++) {
181 if((buf - st->buf) % 16 == 0 && (st->size > 16)
182 && buf != st->buf) {
Lev Walkin8e8078a2004-09-26 13:10:40 +0000183 _i_INDENT(1);
Lev Walkinf15320b2004-06-03 03:38:44 +0000184 /* Dump the string */
Lev Walkin8e8078a2004-09-26 13:10:40 +0000185 if(cb(scratch, p - scratch, app_key) < 0) return -1;
Lev Walkinf15320b2004-06-03 03:38:44 +0000186 p = scratch;
187 }
188 *p++ = h2c[*buf >> 4];
189 *p++ = h2c[*buf & 0x0F];
190 *p++ = 0x20;
191 }
Lev Walkinf15320b2004-06-03 03:38:44 +0000192
Lev Walkincc6a9102004-09-23 22:06:26 +0000193 if(p > scratch) {
194 p--; /* Eat the tailing space */
195
Lev Walkinbbd93252004-10-12 05:57:23 +0000196 if((st->size > 16)) {
Lev Walkin8e8078a2004-09-26 13:10:40 +0000197 _i_INDENT(1);
Lev Walkincc6a9102004-09-23 22:06:26 +0000198 }
199
200 /* Dump the incomplete 16-bytes row */
Lev Walkin8e8078a2004-09-26 13:10:40 +0000201 if(cb(scratch, p - scratch, app_key) < 0)
Lev Walkincc6a9102004-09-23 22:06:26 +0000202 return -1;
203 }
204
205 return 0;
Lev Walkinf15320b2004-06-03 03:38:44 +0000206}
207
Lev Walkincd2f48e2017-08-10 02:14:59 -0700208/*
209 * Lexicographically compare the common prefix of both strings,
210 * and if it is the same return -1 for the smallest string.
211 */
212int
213BIT_STRING_compare(const asn_TYPE_descriptor_t *td, const void *aptr,
214 const void *bptr) {
215 const BIT_STRING_t *a = aptr;
216 const BIT_STRING_t *b = bptr;
217
218 (void)td;
219
220 if(a && b) {
221 size_t common_prefix_size = a->size <= b->size ? a->size : b->size;
222 int ret = memcmp(a->buf, b->buf, common_prefix_size);
223 if(ret == 0) {
224 /* Figure out which string with equal prefixes is longer. */
225 if(a->size < b->size) {
226 return -1;
227 } else if(a->size > b->size) {
228 return 1;
229 } else {
230 /* Figure out how many unused bits */
231 if(a->bits_unused < b->bits_unused) {
232 return -1;
233 } else if(a->bits_unused > b->bits_unused) {
234 return 1;
235 } else {
236 return 0;
237 }
238 }
239 } else {
240 return ret;
241 }
242 } else if(!a && !b) {
243 return 0;
244 } else if(!a) {
245 return -1;
246 } else {
247 return 1;
248 }
249}
250