Loading...
1// SPDX-License-Identifier: GPL-2.0-or-later
2/* Decoder for ASN.1 BER/DER/CER encoded bytestream
3 *
4 * Copyright (C) 2012 Red Hat, Inc. All Rights Reserved.
5 * Written by David Howells (dhowells@redhat.com)
6 */
7
8#include <linux/export.h>
9#include <linux/kernel.h>
10#include <linux/errno.h>
11#include <linux/module.h>
12#include <linux/asn1_decoder.h>
13#include <linux/asn1_ber_bytecode.h>
14
15static const unsigned char asn1_op_lengths[ASN1_OP__NR] = {
16 /* OPC TAG JMP ACT */
17 [ASN1_OP_MATCH] = 1 + 1,
18 [ASN1_OP_MATCH_OR_SKIP] = 1 + 1,
19 [ASN1_OP_MATCH_ACT] = 1 + 1 + 1,
20 [ASN1_OP_MATCH_ACT_OR_SKIP] = 1 + 1 + 1,
21 [ASN1_OP_MATCH_JUMP] = 1 + 1 + 1,
22 [ASN1_OP_MATCH_JUMP_OR_SKIP] = 1 + 1 + 1,
23 [ASN1_OP_MATCH_ANY] = 1,
24 [ASN1_OP_MATCH_ANY_OR_SKIP] = 1,
25 [ASN1_OP_MATCH_ANY_ACT] = 1 + 1,
26 [ASN1_OP_MATCH_ANY_ACT_OR_SKIP] = 1 + 1,
27 [ASN1_OP_COND_MATCH_OR_SKIP] = 1 + 1,
28 [ASN1_OP_COND_MATCH_ACT_OR_SKIP] = 1 + 1 + 1,
29 [ASN1_OP_COND_MATCH_JUMP_OR_SKIP] = 1 + 1 + 1,
30 [ASN1_OP_COND_MATCH_ANY] = 1,
31 [ASN1_OP_COND_MATCH_ANY_OR_SKIP] = 1,
32 [ASN1_OP_COND_MATCH_ANY_ACT] = 1 + 1,
33 [ASN1_OP_COND_MATCH_ANY_ACT_OR_SKIP] = 1 + 1,
34 [ASN1_OP_COND_FAIL] = 1,
35 [ASN1_OP_COMPLETE] = 1,
36 [ASN1_OP_ACT] = 1 + 1,
37 [ASN1_OP_MAYBE_ACT] = 1 + 1,
38 [ASN1_OP_RETURN] = 1,
39 [ASN1_OP_END_SEQ] = 1,
40 [ASN1_OP_END_SEQ_OF] = 1 + 1,
41 [ASN1_OP_END_SET] = 1,
42 [ASN1_OP_END_SET_OF] = 1 + 1,
43 [ASN1_OP_END_SEQ_ACT] = 1 + 1,
44 [ASN1_OP_END_SEQ_OF_ACT] = 1 + 1 + 1,
45 [ASN1_OP_END_SET_ACT] = 1 + 1,
46 [ASN1_OP_END_SET_OF_ACT] = 1 + 1 + 1,
47};
48
49/*
50 * Find the length of an indefinite length object
51 * @data: The data buffer
52 * @datalen: The end of the innermost containing element in the buffer
53 * @_dp: The data parse cursor (updated before returning)
54 * @_len: Where to return the size of the element.
55 * @_errmsg: Where to return a pointer to an error message on error
56 */
57static int asn1_find_indefinite_length(const unsigned char *data, size_t datalen,
58 size_t *_dp, size_t *_len,
59 const char **_errmsg)
60{
61 unsigned char tag, tmp;
62 size_t dp = *_dp, len, n;
63 int indef_level = 1;
64
65next_tag:
66 if (unlikely(datalen - dp < 2)) {
67 if (datalen == dp)
68 goto missing_eoc;
69 goto data_overrun_error;
70 }
71
72 /* Extract a tag from the data */
73 tag = data[dp++];
74 if (tag == ASN1_EOC) {
75 /* It appears to be an EOC. */
76 if (data[dp++] != 0)
77 goto invalid_eoc;
78 if (--indef_level <= 0) {
79 *_len = dp - *_dp;
80 *_dp = dp;
81 return 0;
82 }
83 goto next_tag;
84 }
85
86 if (unlikely((tag & 0x1f) == ASN1_LONG_TAG)) {
87 do {
88 if (unlikely(datalen - dp < 2))
89 goto data_overrun_error;
90 tmp = data[dp++];
91 } while (tmp & 0x80);
92 }
93
94 /* Extract the length */
95 len = data[dp++];
96 if (len <= 0x7f)
97 goto check_length;
98
99 if (unlikely(len == ASN1_INDEFINITE_LENGTH)) {
100 /* Indefinite length */
101 if (unlikely((tag & ASN1_CONS_BIT) == ASN1_PRIM << 5))
102 goto indefinite_len_primitive;
103 indef_level++;
104 goto next_tag;
105 }
106
107 n = len - 0x80;
108 if (unlikely(n > sizeof(len) - 1))
109 goto length_too_long;
110 if (unlikely(n > datalen - dp))
111 goto data_overrun_error;
112 len = 0;
113 for (; n > 0; n--) {
114 len <<= 8;
115 len |= data[dp++];
116 }
117check_length:
118 if (len > datalen - dp)
119 goto data_overrun_error;
120 dp += len;
121 goto next_tag;
122
123length_too_long:
124 *_errmsg = "Unsupported length";
125 goto error;
126indefinite_len_primitive:
127 *_errmsg = "Indefinite len primitive not permitted";
128 goto error;
129invalid_eoc:
130 *_errmsg = "Invalid length EOC";
131 goto error;
132data_overrun_error:
133 *_errmsg = "Data overrun error";
134 goto error;
135missing_eoc:
136 *_errmsg = "Missing EOC in indefinite len cons";
137error:
138 *_dp = dp;
139 return -1;
140}
141
142/**
143 * asn1_ber_decoder - Decoder BER/DER/CER ASN.1 according to pattern
144 * @decoder: The decoder definition (produced by asn1_compiler)
145 * @context: The caller's context (to be passed to the action functions)
146 * @data: The encoded data
147 * @datalen: The size of the encoded data
148 *
149 * Decode BER/DER/CER encoded ASN.1 data according to a bytecode pattern
150 * produced by asn1_compiler. Action functions are called on marked tags to
151 * allow the caller to retrieve significant data.
152 *
153 * LIMITATIONS:
154 *
155 * To keep down the amount of stack used by this function, the following limits
156 * have been imposed:
157 *
158 * (1) This won't handle datalen > 65535 without increasing the size of the
159 * cons stack elements and length_too_long checking.
160 *
161 * (2) The stack of constructed types is 10 deep. If the depth of non-leaf
162 * constructed types exceeds this, the decode will fail.
163 *
164 * (3) The SET type (not the SET OF type) isn't really supported as tracking
165 * what members of the set have been seen is a pain.
166 */
167int asn1_ber_decoder(const struct asn1_decoder *decoder,
168 void *context,
169 const unsigned char *data,
170 size_t datalen)
171{
172 const unsigned char *machine = decoder->machine;
173 const asn1_action_t *actions = decoder->actions;
174 size_t machlen = decoder->machlen;
175 enum asn1_opcode op;
176 unsigned char tag = 0, csp = 0, jsp = 0, optag = 0, hdr = 0;
177 const char *errmsg;
178 size_t pc = 0, dp = 0, tdp = 0, len = 0;
179 int ret;
180
181 unsigned char flags = 0;
182#define FLAG_INDEFINITE_LENGTH 0x01
183#define FLAG_MATCHED 0x02
184#define FLAG_LAST_MATCHED 0x04 /* Last tag matched */
185#define FLAG_CONS 0x20 /* Corresponds to CONS bit in the opcode tag
186 * - ie. whether or not we are going to parse
187 * a compound type.
188 */
189
190#define NR_CONS_STACK 10
191 unsigned short cons_dp_stack[NR_CONS_STACK];
192 unsigned short cons_datalen_stack[NR_CONS_STACK];
193 unsigned char cons_hdrlen_stack[NR_CONS_STACK];
194#define NR_JUMP_STACK 10
195 unsigned char jump_stack[NR_JUMP_STACK];
196
197 if (datalen > 65535)
198 return -EMSGSIZE;
199
200next_op:
201 pr_debug("next_op: pc=\e[32m%zu\e[m/%zu dp=\e[33m%zu\e[m/%zu C=%d J=%d\n",
202 pc, machlen, dp, datalen, csp, jsp);
203 if (unlikely(pc >= machlen))
204 goto machine_overrun_error;
205 op = machine[pc];
206 if (unlikely(pc + asn1_op_lengths[op] > machlen))
207 goto machine_overrun_error;
208
209 /* If this command is meant to match a tag, then do that before
210 * evaluating the command.
211 */
212 if (op <= ASN1_OP__MATCHES_TAG) {
213 unsigned char tmp;
214
215 /* Skip conditional matches if possible */
216 if ((op & ASN1_OP_MATCH__COND && flags & FLAG_MATCHED) ||
217 (op & ASN1_OP_MATCH__SKIP && dp == datalen)) {
218 flags &= ~FLAG_LAST_MATCHED;
219 pc += asn1_op_lengths[op];
220 goto next_op;
221 }
222
223 flags = 0;
224 hdr = 2;
225
226 /* Extract a tag from the data */
227 if (unlikely(datalen - dp < 2))
228 goto data_overrun_error;
229 tag = data[dp++];
230 if (unlikely((tag & 0x1f) == ASN1_LONG_TAG))
231 goto long_tag_not_supported;
232
233 if (op & ASN1_OP_MATCH__ANY) {
234 pr_debug("- any %02x\n", tag);
235 } else {
236 /* Extract the tag from the machine
237 * - Either CONS or PRIM are permitted in the data if
238 * CONS is not set in the op stream, otherwise CONS
239 * is mandatory.
240 */
241 optag = machine[pc + 1];
242 flags |= optag & FLAG_CONS;
243
244 /* Determine whether the tag matched */
245 tmp = optag ^ tag;
246 tmp &= ~(optag & ASN1_CONS_BIT);
247 pr_debug("- match? %02x %02x %02x\n", tag, optag, tmp);
248 if (tmp != 0) {
249 /* All odd-numbered tags are MATCH_OR_SKIP. */
250 if (op & ASN1_OP_MATCH__SKIP) {
251 pc += asn1_op_lengths[op];
252 dp--;
253 goto next_op;
254 }
255 goto tag_mismatch;
256 }
257 }
258 flags |= FLAG_MATCHED;
259
260 len = data[dp++];
261 if (len > 0x7f) {
262 if (unlikely(len == ASN1_INDEFINITE_LENGTH)) {
263 /* Indefinite length */
264 if (unlikely(!(tag & ASN1_CONS_BIT)))
265 goto indefinite_len_primitive;
266 flags |= FLAG_INDEFINITE_LENGTH;
267 if (unlikely(2 > datalen - dp))
268 goto data_overrun_error;
269 } else {
270 int n = len - 0x80;
271 if (unlikely(n > 2))
272 goto length_too_long;
273 if (unlikely(n > datalen - dp))
274 goto data_overrun_error;
275 hdr += n;
276 for (len = 0; n > 0; n--) {
277 len <<= 8;
278 len |= data[dp++];
279 }
280 if (unlikely(len > datalen - dp))
281 goto data_overrun_error;
282 }
283 } else {
284 if (unlikely(len > datalen - dp))
285 goto data_overrun_error;
286 }
287
288 if (flags & FLAG_CONS) {
289 /* For expected compound forms, we stack the positions
290 * of the start and end of the data.
291 */
292 if (unlikely(csp >= NR_CONS_STACK))
293 goto cons_stack_overflow;
294 cons_dp_stack[csp] = dp;
295 cons_hdrlen_stack[csp] = hdr;
296 if (!(flags & FLAG_INDEFINITE_LENGTH)) {
297 cons_datalen_stack[csp] = datalen;
298 datalen = dp + len;
299 } else {
300 cons_datalen_stack[csp] = 0;
301 }
302 csp++;
303 }
304
305 pr_debug("- TAG: %02x %zu%s\n",
306 tag, len, flags & FLAG_CONS ? " CONS" : "");
307 tdp = dp;
308 }
309
310 /* Decide how to handle the operation */
311 switch (op) {
312 case ASN1_OP_MATCH:
313 case ASN1_OP_MATCH_OR_SKIP:
314 case ASN1_OP_MATCH_ACT:
315 case ASN1_OP_MATCH_ACT_OR_SKIP:
316 case ASN1_OP_MATCH_ANY:
317 case ASN1_OP_MATCH_ANY_OR_SKIP:
318 case ASN1_OP_MATCH_ANY_ACT:
319 case ASN1_OP_MATCH_ANY_ACT_OR_SKIP:
320 case ASN1_OP_COND_MATCH_OR_SKIP:
321 case ASN1_OP_COND_MATCH_ACT_OR_SKIP:
322 case ASN1_OP_COND_MATCH_ANY:
323 case ASN1_OP_COND_MATCH_ANY_OR_SKIP:
324 case ASN1_OP_COND_MATCH_ANY_ACT:
325 case ASN1_OP_COND_MATCH_ANY_ACT_OR_SKIP:
326
327 if (!(flags & FLAG_CONS)) {
328 if (flags & FLAG_INDEFINITE_LENGTH) {
329 size_t tmp = dp;
330
331 ret = asn1_find_indefinite_length(
332 data, datalen, &tmp, &len, &errmsg);
333 if (ret < 0)
334 goto error;
335 }
336 pr_debug("- LEAF: %zu\n", len);
337 }
338
339 if (op & ASN1_OP_MATCH__ACT) {
340 unsigned char act;
341
342 if (op & ASN1_OP_MATCH__ANY)
343 act = machine[pc + 1];
344 else
345 act = machine[pc + 2];
346 ret = actions[act](context, hdr, tag, data + dp, len);
347 if (ret < 0)
348 return ret;
349 }
350
351 if (!(flags & FLAG_CONS))
352 dp += len;
353 pc += asn1_op_lengths[op];
354 goto next_op;
355
356 case ASN1_OP_MATCH_JUMP:
357 case ASN1_OP_MATCH_JUMP_OR_SKIP:
358 case ASN1_OP_COND_MATCH_JUMP_OR_SKIP:
359 pr_debug("- MATCH_JUMP\n");
360 if (unlikely(jsp == NR_JUMP_STACK))
361 goto jump_stack_overflow;
362 jump_stack[jsp++] = pc + asn1_op_lengths[op];
363 pc = machine[pc + 2];
364 goto next_op;
365
366 case ASN1_OP_COND_FAIL:
367 if (unlikely(!(flags & FLAG_MATCHED)))
368 goto tag_mismatch;
369 pc += asn1_op_lengths[op];
370 goto next_op;
371
372 case ASN1_OP_COMPLETE:
373 if (unlikely(jsp != 0 || csp != 0)) {
374 pr_err("ASN.1 decoder error: Stacks not empty at completion (%u, %u)\n",
375 jsp, csp);
376 return -EBADMSG;
377 }
378 return 0;
379
380 case ASN1_OP_END_SET:
381 case ASN1_OP_END_SET_ACT:
382 if (unlikely(!(flags & FLAG_MATCHED)))
383 goto tag_mismatch;
384 fallthrough;
385
386 case ASN1_OP_END_SEQ:
387 case ASN1_OP_END_SET_OF:
388 case ASN1_OP_END_SEQ_OF:
389 case ASN1_OP_END_SEQ_ACT:
390 case ASN1_OP_END_SET_OF_ACT:
391 case ASN1_OP_END_SEQ_OF_ACT:
392 if (unlikely(csp <= 0))
393 goto cons_stack_underflow;
394 csp--;
395 tdp = cons_dp_stack[csp];
396 hdr = cons_hdrlen_stack[csp];
397 len = datalen;
398 datalen = cons_datalen_stack[csp];
399 pr_debug("- end cons t=%zu dp=%zu l=%zu/%zu\n",
400 tdp, dp, len, datalen);
401 if (datalen == 0) {
402 /* Indefinite length - check for the EOC. */
403 datalen = len;
404 if (unlikely(datalen - dp < 2))
405 goto data_overrun_error;
406 if (data[dp++] != 0) {
407 if (op & ASN1_OP_END__OF) {
408 dp--;
409 csp++;
410 pc = machine[pc + 1];
411 pr_debug("- continue\n");
412 goto next_op;
413 }
414 goto missing_eoc;
415 }
416 if (data[dp++] != 0)
417 goto invalid_eoc;
418 len = dp - tdp - 2;
419 } else {
420 if (dp < len && (op & ASN1_OP_END__OF)) {
421 datalen = len;
422 csp++;
423 pc = machine[pc + 1];
424 pr_debug("- continue\n");
425 goto next_op;
426 }
427 if (dp != len)
428 goto cons_length_error;
429 len -= tdp;
430 pr_debug("- cons len l=%zu d=%zu\n", len, dp - tdp);
431 }
432
433 if (op & ASN1_OP_END__ACT) {
434 unsigned char act;
435 if (op & ASN1_OP_END__OF)
436 act = machine[pc + 2];
437 else
438 act = machine[pc + 1];
439 ret = actions[act](context, hdr, 0, data + tdp, len);
440 if (ret < 0)
441 return ret;
442 }
443 pc += asn1_op_lengths[op];
444 goto next_op;
445
446 case ASN1_OP_MAYBE_ACT:
447 if (!(flags & FLAG_LAST_MATCHED)) {
448 pc += asn1_op_lengths[op];
449 goto next_op;
450 }
451 fallthrough;
452
453 case ASN1_OP_ACT:
454 ret = actions[machine[pc + 1]](context, hdr, tag, data + tdp, len);
455 if (ret < 0)
456 return ret;
457 pc += asn1_op_lengths[op];
458 goto next_op;
459
460 case ASN1_OP_RETURN:
461 if (unlikely(jsp <= 0))
462 goto jump_stack_underflow;
463 pc = jump_stack[--jsp];
464 flags |= FLAG_MATCHED | FLAG_LAST_MATCHED;
465 goto next_op;
466
467 default:
468 break;
469 }
470
471 /* Shouldn't reach here */
472 pr_err("ASN.1 decoder error: Found reserved opcode (%u) pc=%zu\n",
473 op, pc);
474 return -EBADMSG;
475
476data_overrun_error:
477 errmsg = "Data overrun error";
478 goto error;
479machine_overrun_error:
480 errmsg = "Machine overrun error";
481 goto error;
482jump_stack_underflow:
483 errmsg = "Jump stack underflow";
484 goto error;
485jump_stack_overflow:
486 errmsg = "Jump stack overflow";
487 goto error;
488cons_stack_underflow:
489 errmsg = "Cons stack underflow";
490 goto error;
491cons_stack_overflow:
492 errmsg = "Cons stack overflow";
493 goto error;
494cons_length_error:
495 errmsg = "Cons length error";
496 goto error;
497missing_eoc:
498 errmsg = "Missing EOC in indefinite len cons";
499 goto error;
500invalid_eoc:
501 errmsg = "Invalid length EOC";
502 goto error;
503length_too_long:
504 errmsg = "Unsupported length";
505 goto error;
506indefinite_len_primitive:
507 errmsg = "Indefinite len primitive not permitted";
508 goto error;
509tag_mismatch:
510 errmsg = "Unexpected tag";
511 goto error;
512long_tag_not_supported:
513 errmsg = "Long tag not supported";
514error:
515 pr_debug("\nASN1: %s [m=%zu d=%zu ot=%02x t=%02x l=%zu]\n",
516 errmsg, pc, dp, optag, tag, len);
517 return -EBADMSG;
518}
519EXPORT_SYMBOL_GPL(asn1_ber_decoder);
520
521MODULE_LICENSE("GPL");
1/* Decoder for ASN.1 BER/DER/CER encoded bytestream
2 *
3 * Copyright (C) 2012 Red Hat, Inc. All Rights Reserved.
4 * Written by David Howells (dhowells@redhat.com)
5 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public Licence
8 * as published by the Free Software Foundation; either version
9 * 2 of the Licence, or (at your option) any later version.
10 */
11
12#include <linux/export.h>
13#include <linux/kernel.h>
14#include <linux/errno.h>
15#include <linux/asn1_decoder.h>
16#include <linux/asn1_ber_bytecode.h>
17
18static const unsigned char asn1_op_lengths[ASN1_OP__NR] = {
19 /* OPC TAG JMP ACT */
20 [ASN1_OP_MATCH] = 1 + 1,
21 [ASN1_OP_MATCH_OR_SKIP] = 1 + 1,
22 [ASN1_OP_MATCH_ACT] = 1 + 1 + 1,
23 [ASN1_OP_MATCH_ACT_OR_SKIP] = 1 + 1 + 1,
24 [ASN1_OP_MATCH_JUMP] = 1 + 1 + 1,
25 [ASN1_OP_MATCH_JUMP_OR_SKIP] = 1 + 1 + 1,
26 [ASN1_OP_MATCH_ANY] = 1,
27 [ASN1_OP_MATCH_ANY_OR_SKIP] = 1,
28 [ASN1_OP_MATCH_ANY_ACT] = 1 + 1,
29 [ASN1_OP_MATCH_ANY_ACT_OR_SKIP] = 1 + 1,
30 [ASN1_OP_COND_MATCH_OR_SKIP] = 1 + 1,
31 [ASN1_OP_COND_MATCH_ACT_OR_SKIP] = 1 + 1 + 1,
32 [ASN1_OP_COND_MATCH_JUMP_OR_SKIP] = 1 + 1 + 1,
33 [ASN1_OP_COND_MATCH_ANY] = 1,
34 [ASN1_OP_COND_MATCH_ANY_OR_SKIP] = 1,
35 [ASN1_OP_COND_MATCH_ANY_ACT] = 1 + 1,
36 [ASN1_OP_COND_MATCH_ANY_ACT_OR_SKIP] = 1 + 1,
37 [ASN1_OP_COND_FAIL] = 1,
38 [ASN1_OP_COMPLETE] = 1,
39 [ASN1_OP_ACT] = 1 + 1,
40 [ASN1_OP_MAYBE_ACT] = 1 + 1,
41 [ASN1_OP_RETURN] = 1,
42 [ASN1_OP_END_SEQ] = 1,
43 [ASN1_OP_END_SEQ_OF] = 1 + 1,
44 [ASN1_OP_END_SET] = 1,
45 [ASN1_OP_END_SET_OF] = 1 + 1,
46 [ASN1_OP_END_SEQ_ACT] = 1 + 1,
47 [ASN1_OP_END_SEQ_OF_ACT] = 1 + 1 + 1,
48 [ASN1_OP_END_SET_ACT] = 1 + 1,
49 [ASN1_OP_END_SET_OF_ACT] = 1 + 1 + 1,
50};
51
52/*
53 * Find the length of an indefinite length object
54 * @data: The data buffer
55 * @datalen: The end of the innermost containing element in the buffer
56 * @_dp: The data parse cursor (updated before returning)
57 * @_len: Where to return the size of the element.
58 * @_errmsg: Where to return a pointer to an error message on error
59 */
60static int asn1_find_indefinite_length(const unsigned char *data, size_t datalen,
61 size_t *_dp, size_t *_len,
62 const char **_errmsg)
63{
64 unsigned char tag, tmp;
65 size_t dp = *_dp, len, n;
66 int indef_level = 1;
67
68next_tag:
69 if (unlikely(datalen - dp < 2)) {
70 if (datalen == dp)
71 goto missing_eoc;
72 goto data_overrun_error;
73 }
74
75 /* Extract a tag from the data */
76 tag = data[dp++];
77 if (tag == ASN1_EOC) {
78 /* It appears to be an EOC. */
79 if (data[dp++] != 0)
80 goto invalid_eoc;
81 if (--indef_level <= 0) {
82 *_len = dp - *_dp;
83 *_dp = dp;
84 return 0;
85 }
86 goto next_tag;
87 }
88
89 if (unlikely((tag & 0x1f) == ASN1_LONG_TAG)) {
90 do {
91 if (unlikely(datalen - dp < 2))
92 goto data_overrun_error;
93 tmp = data[dp++];
94 } while (tmp & 0x80);
95 }
96
97 /* Extract the length */
98 len = data[dp++];
99 if (len <= 0x7f)
100 goto check_length;
101
102 if (unlikely(len == ASN1_INDEFINITE_LENGTH)) {
103 /* Indefinite length */
104 if (unlikely((tag & ASN1_CONS_BIT) == ASN1_PRIM << 5))
105 goto indefinite_len_primitive;
106 indef_level++;
107 goto next_tag;
108 }
109
110 n = len - 0x80;
111 if (unlikely(n > sizeof(len) - 1))
112 goto length_too_long;
113 if (unlikely(n > datalen - dp))
114 goto data_overrun_error;
115 len = 0;
116 for (; n > 0; n--) {
117 len <<= 8;
118 len |= data[dp++];
119 }
120check_length:
121 if (len > datalen - dp)
122 goto data_overrun_error;
123 dp += len;
124 goto next_tag;
125
126length_too_long:
127 *_errmsg = "Unsupported length";
128 goto error;
129indefinite_len_primitive:
130 *_errmsg = "Indefinite len primitive not permitted";
131 goto error;
132invalid_eoc:
133 *_errmsg = "Invalid length EOC";
134 goto error;
135data_overrun_error:
136 *_errmsg = "Data overrun error";
137 goto error;
138missing_eoc:
139 *_errmsg = "Missing EOC in indefinite len cons";
140error:
141 *_dp = dp;
142 return -1;
143}
144
145/**
146 * asn1_ber_decoder - Decoder BER/DER/CER ASN.1 according to pattern
147 * @decoder: The decoder definition (produced by asn1_compiler)
148 * @context: The caller's context (to be passed to the action functions)
149 * @data: The encoded data
150 * @datalen: The size of the encoded data
151 *
152 * Decode BER/DER/CER encoded ASN.1 data according to a bytecode pattern
153 * produced by asn1_compiler. Action functions are called on marked tags to
154 * allow the caller to retrieve significant data.
155 *
156 * LIMITATIONS:
157 *
158 * To keep down the amount of stack used by this function, the following limits
159 * have been imposed:
160 *
161 * (1) This won't handle datalen > 65535 without increasing the size of the
162 * cons stack elements and length_too_long checking.
163 *
164 * (2) The stack of constructed types is 10 deep. If the depth of non-leaf
165 * constructed types exceeds this, the decode will fail.
166 *
167 * (3) The SET type (not the SET OF type) isn't really supported as tracking
168 * what members of the set have been seen is a pain.
169 */
170int asn1_ber_decoder(const struct asn1_decoder *decoder,
171 void *context,
172 const unsigned char *data,
173 size_t datalen)
174{
175 const unsigned char *machine = decoder->machine;
176 const asn1_action_t *actions = decoder->actions;
177 size_t machlen = decoder->machlen;
178 enum asn1_opcode op;
179 unsigned char tag = 0, csp = 0, jsp = 0, optag = 0, hdr = 0;
180 const char *errmsg;
181 size_t pc = 0, dp = 0, tdp = 0, len = 0;
182 int ret;
183
184 unsigned char flags = 0;
185#define FLAG_INDEFINITE_LENGTH 0x01
186#define FLAG_MATCHED 0x02
187#define FLAG_LAST_MATCHED 0x04 /* Last tag matched */
188#define FLAG_CONS 0x20 /* Corresponds to CONS bit in the opcode tag
189 * - ie. whether or not we are going to parse
190 * a compound type.
191 */
192
193#define NR_CONS_STACK 10
194 unsigned short cons_dp_stack[NR_CONS_STACK];
195 unsigned short cons_datalen_stack[NR_CONS_STACK];
196 unsigned char cons_hdrlen_stack[NR_CONS_STACK];
197#define NR_JUMP_STACK 10
198 unsigned char jump_stack[NR_JUMP_STACK];
199
200 if (datalen > 65535)
201 return -EMSGSIZE;
202
203next_op:
204 pr_debug("next_op: pc=\e[32m%zu\e[m/%zu dp=\e[33m%zu\e[m/%zu C=%d J=%d\n",
205 pc, machlen, dp, datalen, csp, jsp);
206 if (unlikely(pc >= machlen))
207 goto machine_overrun_error;
208 op = machine[pc];
209 if (unlikely(pc + asn1_op_lengths[op] > machlen))
210 goto machine_overrun_error;
211
212 /* If this command is meant to match a tag, then do that before
213 * evaluating the command.
214 */
215 if (op <= ASN1_OP__MATCHES_TAG) {
216 unsigned char tmp;
217
218 /* Skip conditional matches if possible */
219 if ((op & ASN1_OP_MATCH__COND && flags & FLAG_MATCHED) ||
220 (op & ASN1_OP_MATCH__SKIP && dp == datalen)) {
221 flags &= ~FLAG_LAST_MATCHED;
222 pc += asn1_op_lengths[op];
223 goto next_op;
224 }
225
226 flags = 0;
227 hdr = 2;
228
229 /* Extract a tag from the data */
230 if (unlikely(dp >= datalen - 1))
231 goto data_overrun_error;
232 tag = data[dp++];
233 if (unlikely((tag & 0x1f) == ASN1_LONG_TAG))
234 goto long_tag_not_supported;
235
236 if (op & ASN1_OP_MATCH__ANY) {
237 pr_debug("- any %02x\n", tag);
238 } else {
239 /* Extract the tag from the machine
240 * - Either CONS or PRIM are permitted in the data if
241 * CONS is not set in the op stream, otherwise CONS
242 * is mandatory.
243 */
244 optag = machine[pc + 1];
245 flags |= optag & FLAG_CONS;
246
247 /* Determine whether the tag matched */
248 tmp = optag ^ tag;
249 tmp &= ~(optag & ASN1_CONS_BIT);
250 pr_debug("- match? %02x %02x %02x\n", tag, optag, tmp);
251 if (tmp != 0) {
252 /* All odd-numbered tags are MATCH_OR_SKIP. */
253 if (op & ASN1_OP_MATCH__SKIP) {
254 pc += asn1_op_lengths[op];
255 dp--;
256 goto next_op;
257 }
258 goto tag_mismatch;
259 }
260 }
261 flags |= FLAG_MATCHED;
262
263 len = data[dp++];
264 if (len > 0x7f) {
265 if (unlikely(len == ASN1_INDEFINITE_LENGTH)) {
266 /* Indefinite length */
267 if (unlikely(!(tag & ASN1_CONS_BIT)))
268 goto indefinite_len_primitive;
269 flags |= FLAG_INDEFINITE_LENGTH;
270 if (unlikely(2 > datalen - dp))
271 goto data_overrun_error;
272 } else {
273 int n = len - 0x80;
274 if (unlikely(n > 2))
275 goto length_too_long;
276 if (unlikely(dp >= datalen - n))
277 goto data_overrun_error;
278 hdr += n;
279 for (len = 0; n > 0; n--) {
280 len <<= 8;
281 len |= data[dp++];
282 }
283 if (unlikely(len > datalen - dp))
284 goto data_overrun_error;
285 }
286 }
287
288 if (flags & FLAG_CONS) {
289 /* For expected compound forms, we stack the positions
290 * of the start and end of the data.
291 */
292 if (unlikely(csp >= NR_CONS_STACK))
293 goto cons_stack_overflow;
294 cons_dp_stack[csp] = dp;
295 cons_hdrlen_stack[csp] = hdr;
296 if (!(flags & FLAG_INDEFINITE_LENGTH)) {
297 cons_datalen_stack[csp] = datalen;
298 datalen = dp + len;
299 } else {
300 cons_datalen_stack[csp] = 0;
301 }
302 csp++;
303 }
304
305 pr_debug("- TAG: %02x %zu%s\n",
306 tag, len, flags & FLAG_CONS ? " CONS" : "");
307 tdp = dp;
308 }
309
310 /* Decide how to handle the operation */
311 switch (op) {
312 case ASN1_OP_MATCH_ANY_ACT:
313 case ASN1_OP_MATCH_ANY_ACT_OR_SKIP:
314 case ASN1_OP_COND_MATCH_ANY_ACT:
315 case ASN1_OP_COND_MATCH_ANY_ACT_OR_SKIP:
316 ret = actions[machine[pc + 1]](context, hdr, tag, data + dp, len);
317 if (ret < 0)
318 return ret;
319 goto skip_data;
320
321 case ASN1_OP_MATCH_ACT:
322 case ASN1_OP_MATCH_ACT_OR_SKIP:
323 case ASN1_OP_COND_MATCH_ACT_OR_SKIP:
324 ret = actions[machine[pc + 2]](context, hdr, tag, data + dp, len);
325 if (ret < 0)
326 return ret;
327 goto skip_data;
328
329 case ASN1_OP_MATCH:
330 case ASN1_OP_MATCH_OR_SKIP:
331 case ASN1_OP_MATCH_ANY:
332 case ASN1_OP_MATCH_ANY_OR_SKIP:
333 case ASN1_OP_COND_MATCH_OR_SKIP:
334 case ASN1_OP_COND_MATCH_ANY:
335 case ASN1_OP_COND_MATCH_ANY_OR_SKIP:
336 skip_data:
337 if (!(flags & FLAG_CONS)) {
338 if (flags & FLAG_INDEFINITE_LENGTH) {
339 ret = asn1_find_indefinite_length(
340 data, datalen, &dp, &len, &errmsg);
341 if (ret < 0)
342 goto error;
343 } else {
344 dp += len;
345 }
346 pr_debug("- LEAF: %zu\n", len);
347 }
348 pc += asn1_op_lengths[op];
349 goto next_op;
350
351 case ASN1_OP_MATCH_JUMP:
352 case ASN1_OP_MATCH_JUMP_OR_SKIP:
353 case ASN1_OP_COND_MATCH_JUMP_OR_SKIP:
354 pr_debug("- MATCH_JUMP\n");
355 if (unlikely(jsp == NR_JUMP_STACK))
356 goto jump_stack_overflow;
357 jump_stack[jsp++] = pc + asn1_op_lengths[op];
358 pc = machine[pc + 2];
359 goto next_op;
360
361 case ASN1_OP_COND_FAIL:
362 if (unlikely(!(flags & FLAG_MATCHED)))
363 goto tag_mismatch;
364 pc += asn1_op_lengths[op];
365 goto next_op;
366
367 case ASN1_OP_COMPLETE:
368 if (unlikely(jsp != 0 || csp != 0)) {
369 pr_err("ASN.1 decoder error: Stacks not empty at completion (%u, %u)\n",
370 jsp, csp);
371 return -EBADMSG;
372 }
373 return 0;
374
375 case ASN1_OP_END_SET:
376 case ASN1_OP_END_SET_ACT:
377 if (unlikely(!(flags & FLAG_MATCHED)))
378 goto tag_mismatch;
379 case ASN1_OP_END_SEQ:
380 case ASN1_OP_END_SET_OF:
381 case ASN1_OP_END_SEQ_OF:
382 case ASN1_OP_END_SEQ_ACT:
383 case ASN1_OP_END_SET_OF_ACT:
384 case ASN1_OP_END_SEQ_OF_ACT:
385 if (unlikely(csp <= 0))
386 goto cons_stack_underflow;
387 csp--;
388 tdp = cons_dp_stack[csp];
389 hdr = cons_hdrlen_stack[csp];
390 len = datalen;
391 datalen = cons_datalen_stack[csp];
392 pr_debug("- end cons t=%zu dp=%zu l=%zu/%zu\n",
393 tdp, dp, len, datalen);
394 if (datalen == 0) {
395 /* Indefinite length - check for the EOC. */
396 datalen = len;
397 if (unlikely(datalen - dp < 2))
398 goto data_overrun_error;
399 if (data[dp++] != 0) {
400 if (op & ASN1_OP_END__OF) {
401 dp--;
402 csp++;
403 pc = machine[pc + 1];
404 pr_debug("- continue\n");
405 goto next_op;
406 }
407 goto missing_eoc;
408 }
409 if (data[dp++] != 0)
410 goto invalid_eoc;
411 len = dp - tdp - 2;
412 } else {
413 if (dp < len && (op & ASN1_OP_END__OF)) {
414 datalen = len;
415 csp++;
416 pc = machine[pc + 1];
417 pr_debug("- continue\n");
418 goto next_op;
419 }
420 if (dp != len)
421 goto cons_length_error;
422 len -= tdp;
423 pr_debug("- cons len l=%zu d=%zu\n", len, dp - tdp);
424 }
425
426 if (op & ASN1_OP_END__ACT) {
427 unsigned char act;
428 if (op & ASN1_OP_END__OF)
429 act = machine[pc + 2];
430 else
431 act = machine[pc + 1];
432 ret = actions[act](context, hdr, 0, data + tdp, len);
433 }
434 pc += asn1_op_lengths[op];
435 goto next_op;
436
437 case ASN1_OP_MAYBE_ACT:
438 if (!(flags & FLAG_LAST_MATCHED)) {
439 pc += asn1_op_lengths[op];
440 goto next_op;
441 }
442 case ASN1_OP_ACT:
443 ret = actions[machine[pc + 1]](context, hdr, tag, data + tdp, len);
444 if (ret < 0)
445 return ret;
446 pc += asn1_op_lengths[op];
447 goto next_op;
448
449 case ASN1_OP_RETURN:
450 if (unlikely(jsp <= 0))
451 goto jump_stack_underflow;
452 pc = jump_stack[--jsp];
453 flags |= FLAG_MATCHED | FLAG_LAST_MATCHED;
454 goto next_op;
455
456 default:
457 break;
458 }
459
460 /* Shouldn't reach here */
461 pr_err("ASN.1 decoder error: Found reserved opcode (%u) pc=%zu\n",
462 op, pc);
463 return -EBADMSG;
464
465data_overrun_error:
466 errmsg = "Data overrun error";
467 goto error;
468machine_overrun_error:
469 errmsg = "Machine overrun error";
470 goto error;
471jump_stack_underflow:
472 errmsg = "Jump stack underflow";
473 goto error;
474jump_stack_overflow:
475 errmsg = "Jump stack overflow";
476 goto error;
477cons_stack_underflow:
478 errmsg = "Cons stack underflow";
479 goto error;
480cons_stack_overflow:
481 errmsg = "Cons stack overflow";
482 goto error;
483cons_length_error:
484 errmsg = "Cons length error";
485 goto error;
486missing_eoc:
487 errmsg = "Missing EOC in indefinite len cons";
488 goto error;
489invalid_eoc:
490 errmsg = "Invalid length EOC";
491 goto error;
492length_too_long:
493 errmsg = "Unsupported length";
494 goto error;
495indefinite_len_primitive:
496 errmsg = "Indefinite len primitive not permitted";
497 goto error;
498tag_mismatch:
499 errmsg = "Unexpected tag";
500 goto error;
501long_tag_not_supported:
502 errmsg = "Long tag not supported";
503error:
504 pr_debug("\nASN1: %s [m=%zu d=%zu ot=%02x t=%02x l=%zu]\n",
505 errmsg, pc, dp, optag, tag, len);
506 return -EBADMSG;
507}
508EXPORT_SYMBOL_GPL(asn1_ber_decoder);