Coverage Report

Created: 2025-07-23 06:43

/src/libtasn1/lib/decoding.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright (C) 2002-2025 Free Software Foundation, Inc.
3
 *
4
 * This file is part of LIBTASN1.
5
 *
6
 * The LIBTASN1 library is free software; you can redistribute it
7
 * and/or modify it under the terms of the GNU Lesser General Public
8
 * License as published by the Free Software Foundation; either
9
 * version 2.1 of the License, or (at your option) any later version.
10
 *
11
 * This library is distributed in the hope that it will be useful, but
12
 * WITHOUT ANY WARRANTY; without even the implied warranty of
13
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
14
 * Lesser General Public License for more details.
15
 *
16
 * You should have received a copy of the GNU Lesser General Public
17
 * License along with this library; if not, see
18
 * <https://www.gnu.org/licenses/>.
19
 */
20
21
#include <config.h>
22
23
/*****************************************************/
24
/* File: decoding.c                                  */
25
/* Description: Functions to manage DER decoding     */
26
/*****************************************************/
27
28
#include <int.h>
29
#include <parser_aux.h>
30
#include <gstr.h>
31
#include <structure.h>
32
#include <element.h>
33
#include <limits.h>
34
#include <intprops.h>
35
#include "c-ctype.h"
36
37
#ifdef DEBUG
38
# define warn() fprintf(stderr, "%s: %d\n", __func__, __LINE__)
39
#else
40
# define warn()
41
#endif
42
43
7.64M
#define IS_ERR(len, flags) (len < -1 || ((flags & ASN1_DECODE_FLAG_STRICT_DER) && len < 0))
44
45
12.7M
#define HAVE_TWO(x) (x>=2?1:0)
46
47
/* Decoding flags (dflags) used in several decoding functions.
48
 *  DECODE_FLAG_HAVE_TAG: The provided buffer includes a tag
49
 *  DECODE_FLAG_CONSTRUCTED: The provided buffer is of indefinite encoding (useful
50
 *                           when no tags are present).
51
 *  DECODE_FLAG_LEVEL1: Internal flag to indicate a level of recursion for BER strings.
52
 *  DECODE_FLAG_LEVEL2: Internal flag to indicate two levels of recursion for BER strings.
53
 *  DECODE_FLAG_LEVEL3: Internal flag to indicate three levels of recursion for BER strings.
54
 *                      This is the maximum levels of recursion possible to prevent stack
55
 *                      exhaustion.
56
 */
57
58
606k
#define DECODE_FLAG_HAVE_TAG 1
59
200k
#define DECODE_FLAG_CONSTRUCTED (1<<1)
60
255k
#define DECODE_FLAG_LEVEL1 (1<<2)
61
145k
#define DECODE_FLAG_LEVEL2 (1<<3)
62
13.0k
#define DECODE_FLAG_LEVEL3 (1<<4)
63
64
57.6M
#define DECR_LEN(l, s) do { \
65
57.6M
    l -= s; \
66
57.6M
    if (l < 0) { \
67
525
      warn(); \
68
525
      result = ASN1_DER_ERROR; \
69
525
      goto cleanup; \
70
525
    } \
71
57.6M
  } while (0)
72
73
static int
74
_asn1_get_indefinite_length_string (const unsigned char *der, int der_len,
75
            int *len);
76
77
static int
78
_asn1_decode_simple_ber (unsigned int etype, const unsigned char *der,
79
       unsigned int _der_len, unsigned char **str,
80
       unsigned int *str_len, unsigned int *ber_len,
81
       unsigned dflags);
82
83
static int
84
_asn1_decode_simple_der (unsigned int etype, const unsigned char *der,
85
       unsigned int _der_len, const unsigned char **str,
86
       unsigned int *str_len, unsigned dflags);
87
88
static void
89
_asn1_error_description_tag_error (asn1_node node, char *ErrorDescription)
90
1.77k
{
91
92
1.77k
  Estrcpy (ErrorDescription, ":: tag error near element '");
93
1.77k
  _asn1_hierarchical_name (node, ErrorDescription + strlen (ErrorDescription),
94
1.77k
         ASN1_MAX_ERROR_DESCRIPTION_SIZE - 40);
95
1.77k
  Estrcat (ErrorDescription, "'");
96
97
1.77k
}
98
99
/**
100
 * asn1_get_length_der:
101
 * @der: DER data to decode.
102
 * @der_len: Length of DER data to decode.
103
 * @len: Output variable containing the length of the DER length field.
104
 *
105
 * Extract a length field from DER data.
106
 *
107
 * Returns: Return the decoded length value, or -1 on indefinite
108
 *   length, or -2 when the value was too big to fit in a int, or -4
109
 *   when the decoded length value plus @len would exceed @der_len.
110
 **/
111
long
112
asn1_get_length_der (const unsigned char *der, int der_len, int *len)
113
22.5M
{
114
22.5M
  unsigned int ans;
115
22.5M
  int k, punt, sum;
116
117
22.5M
  *len = 0;
118
22.5M
  if (der_len <= 0)
119
6.71k
    return 0;
120
121
22.5M
  if (!(der[0] & 128))
122
18.7M
    {
123
      /* short form */
124
18.7M
      *len = 1;
125
18.7M
      ans = der[0];
126
18.7M
    }
127
3.80M
  else
128
3.80M
    {
129
      /* Long form */
130
3.80M
      k = der[0] & 0x7F;
131
3.80M
      punt = 1;
132
3.80M
      if (k)
133
3.59M
  {     /* definite length method */
134
3.59M
    ans = 0;
135
11.1M
    while (punt <= k && punt < der_len)
136
7.54M
      {
137
7.54M
        if (INT_MULTIPLY_OVERFLOW (ans, 256))
138
2.80k
    return -2;
139
7.54M
        ans *= 256;
140
141
7.54M
        if (INT_ADD_OVERFLOW (ans, ((unsigned) der[punt])))
142
0
    return -2;
143
7.54M
        ans += der[punt];
144
7.54M
        punt++;
145
7.54M
      }
146
3.59M
  }
147
216k
      else
148
216k
  {     /* indefinite length method */
149
216k
    *len = punt;
150
216k
    return -1;
151
216k
  }
152
153
3.58M
      *len = punt;
154
3.58M
    }
155
156
22.3M
  sum = ans;
157
22.3M
  if (ans >= INT_MAX || INT_ADD_OVERFLOW (sum, (*len)))
158
2.12k
    return -2;
159
22.3M
  sum += *len;
160
161
22.3M
  if (sum > der_len)
162
19.9k
    return -4;
163
164
22.3M
  return ans;
165
22.3M
}
166
167
/**
168
 * asn1_get_tag_der:
169
 * @der: DER data to decode.
170
 * @der_len: Length of DER data to decode.
171
 * @cls: Output variable containing decoded class.
172
 * @len: Output variable containing the length of the DER TAG data.
173
 * @tag: Output variable containing the decoded tag (may be %NULL).
174
 *
175
 * Decode the class and TAG from DER code.
176
 *
177
 * Returns: Returns %ASN1_SUCCESS on success, or an error.
178
 **/
179
int
180
asn1_get_tag_der (const unsigned char *der, int der_len,
181
      unsigned char *cls, int *len, unsigned long *tag)
182
26.8M
{
183
26.8M
  unsigned int ris;
184
26.8M
  int punt;
185
186
26.8M
  if (der == NULL || der_len < 2 || len == NULL)
187
2.84k
    return ASN1_DER_ERROR;
188
189
26.8M
  *cls = der[0] & 0xE0;
190
26.8M
  if ((der[0] & 0x1F) != 0x1F)
191
26.4M
    {
192
      /* short form */
193
26.4M
      *len = 1;
194
26.4M
      ris = der[0] & 0x1F;
195
26.4M
    }
196
381k
  else
197
381k
    {
198
      /* Long form */
199
381k
      punt = 1;
200
381k
      ris = 0;
201
304M
      while (punt < der_len && der[punt] & 128)
202
303M
  {
203
204
303M
    if (INT_MULTIPLY_OVERFLOW (ris, 128))
205
1.24k
      return ASN1_DER_ERROR;
206
303M
    ris *= 128;
207
208
303M
    if (INT_ADD_OVERFLOW (ris, ((unsigned) (der[punt] & 0x7F))))
209
0
      return ASN1_DER_ERROR;
210
303M
    ris += (der[punt] & 0x7F);
211
303M
    punt++;
212
303M
  }
213
214
380k
      if (punt >= der_len)
215
1.60k
  return ASN1_DER_ERROR;
216
217
378k
      if (INT_MULTIPLY_OVERFLOW (ris, 128))
218
2.03k
  return ASN1_DER_ERROR;
219
376k
      ris *= 128;
220
221
376k
      if (INT_ADD_OVERFLOW (ris, ((unsigned) (der[punt] & 0x7F))))
222
0
  return ASN1_DER_ERROR;
223
376k
      ris += (der[punt] & 0x7F);
224
376k
      punt++;
225
226
376k
      *len = punt;
227
376k
    }
228
229
26.8M
  if (tag)
230
26.8M
    *tag = ris;
231
26.8M
  return ASN1_SUCCESS;
232
26.8M
}
233
234
/**
235
 * asn1_get_length_ber:
236
 * @ber: BER data to decode.
237
 * @ber_len: Length of BER data to decode.
238
 * @len: Output variable containing the length of the BER length field.
239
 *
240
 * Extract a length field from BER data.  The difference to
241
 * asn1_get_length_der() is that this function will return a length
242
 * even if the value has indefinite encoding.
243
 *
244
 * Returns: Return the decoded length value, or negative value when
245
 *   the value was too big.
246
 *
247
 * Since: 2.0
248
 **/
249
long
250
asn1_get_length_ber (const unsigned char *ber, int ber_len, int *len)
251
106k
{
252
106k
  int ret;
253
106k
  long err;
254
255
106k
  ret = asn1_get_length_der (ber, ber_len, len);
256
257
106k
  if (ret == -1 && ber_len > 1)
258
4.05k
    {       /* indefinite length method */
259
4.05k
      err = _asn1_get_indefinite_length_string (ber + 1, ber_len - 1, &ret);
260
4.05k
      if (err != ASN1_SUCCESS)
261
1.96k
  return -3;
262
4.05k
    }
263
264
104k
  return ret;
265
106k
}
266
267
/**
268
 * asn1_get_octet_der:
269
 * @der: DER data to decode containing the OCTET SEQUENCE.
270
 * @der_len: The length of the @der data to decode.
271
 * @ret_len: Output variable containing the encoded length of the DER data.
272
 * @str: Pre-allocated output buffer to put decoded OCTET SEQUENCE in.
273
 * @str_size: Length of pre-allocated output buffer.
274
 * @str_len: Output variable containing the length of the contents of the OCTET SEQUENCE.
275
 *
276
 * Extract an OCTET SEQUENCE from DER data. Note that this function
277
 * expects the DER data past the tag field, i.e., the length and
278
 * content octets.
279
 *
280
 * Returns: Returns %ASN1_SUCCESS on success, or an error.
281
 **/
282
int
283
asn1_get_octet_der (const unsigned char *der, int der_len,
284
        int *ret_len, unsigned char *str, int str_size,
285
        int *str_len)
286
1.98M
{
287
1.98M
  int len_len = 0;
288
289
1.98M
  if (der_len <= 0)
290
0
    return ASN1_GENERIC_ERROR;
291
292
1.98M
  *str_len = asn1_get_length_der (der, der_len, &len_len);
293
294
1.98M
  if (*str_len < 0)
295
0
    return ASN1_DER_ERROR;
296
297
1.98M
  *ret_len = *str_len + len_len;
298
1.98M
  if (str_size >= *str_len)
299
1.08M
    {
300
1.08M
      if (*str_len > 0 && str != NULL)
301
1.08M
  memcpy (str, der + len_len, *str_len);
302
1.08M
    }
303
894k
  else
304
894k
    {
305
894k
      return ASN1_MEM_ERROR;
306
894k
    }
307
308
1.08M
  return ASN1_SUCCESS;
309
1.98M
}
310
311
312
/*-
313
 * _asn1_get_time_der:
314
 * @type: %ASN1_ETYPE_GENERALIZED_TIME or %ASN1_ETYPE_UTC_TIME
315
 * @der: DER data to decode containing the time
316
 * @der_len: Length of DER data to decode.
317
 * @ret_len: Output variable containing the length of the DER data.
318
 * @str: Pre-allocated output buffer to put the textual time in.
319
 * @str_size: Length of pre-allocated output buffer.
320
 * @flags: Zero or %ASN1_DECODE_FLAG_STRICT_DER
321
 *
322
 * Performs basic checks in the DER encoded time object and returns its textual form.
323
 * The textual form will be in the YYYYMMDD000000Z format for GeneralizedTime
324
 * and YYMMDD000000Z for UTCTime.
325
 *
326
 * Returns: %ASN1_SUCCESS on success, or an error.
327
 -*/
328
static int
329
_asn1_get_time_der (unsigned type, const unsigned char *der, int der_len,
330
        int *ret_len, char *str, int str_size, unsigned flags)
331
244k
{
332
244k
  int len_len, str_len;
333
244k
  unsigned i;
334
244k
  unsigned sign_count = 0;
335
244k
  unsigned dot_count = 0;
336
244k
  const unsigned char *p;
337
338
244k
  if (der_len <= 0 || str == NULL)
339
26
    return ASN1_DER_ERROR;
340
341
244k
  str_len = asn1_get_length_der (der, der_len, &len_len);
342
244k
  if (str_len <= 0 || str_size < str_len)
343
1.49k
    return ASN1_DER_ERROR;
344
345
  /* perform some sanity checks on the data */
346
242k
  if (str_len < 8)
347
71
    {
348
71
      warn ();
349
71
      return ASN1_TIME_ENCODING_ERROR;
350
71
    }
351
352
242k
  if ((flags & ASN1_DECODE_FLAG_STRICT_DER)
353
242k
      && !(flags & ASN1_DECODE_FLAG_ALLOW_INCORRECT_TIME))
354
242k
    {
355
242k
      p = &der[len_len];
356
3.25M
      for (i = 0; i < (unsigned) (str_len - 1); i++)
357
3.01M
  {
358
3.01M
    if (c_isdigit (p[i]) == 0)
359
2.95k
      {
360
2.95k
        if (type == ASN1_ETYPE_GENERALIZED_TIME)
361
2.84k
    {
362
      /* tolerate lax encodings */
363
2.84k
      if (p[i] == '.' && dot_count == 0)
364
2.53k
        {
365
2.53k
          dot_count++;
366
2.53k
          continue;
367
2.53k
        }
368
369
      /* This is not really valid DER, but there are
370
       * structures using that */
371
308
      if (!(flags & ASN1_DECODE_FLAG_STRICT_DER) &&
372
308
          (p[i] == '+' || p[i] == '-') && sign_count == 0)
373
0
        {
374
0
          sign_count++;
375
0
          continue;
376
0
        }
377
308
    }
378
379
418
        warn ();
380
418
        return ASN1_TIME_ENCODING_ERROR;
381
2.95k
      }
382
3.01M
  }
383
384
242k
      if (sign_count == 0 && p[str_len - 1] != 'Z')
385
161
  {
386
161
    warn ();
387
161
    return ASN1_TIME_ENCODING_ERROR;
388
161
  }
389
242k
    }
390
241k
  memcpy (str, der + len_len, str_len);
391
241k
  str[str_len] = 0;
392
241k
  *ret_len = str_len + len_len;
393
394
241k
  return ASN1_SUCCESS;
395
242k
}
396
397
/**
398
 * asn1_get_object_id_der:
399
 * @der: DER data to decode containing the OBJECT IDENTIFIER
400
 * @der_len: Length of DER data to decode.
401
 * @ret_len: Output variable containing the length of the DER data.
402
 * @str: Pre-allocated output buffer to put the textual object id in.
403
 * @str_size: Length of pre-allocated output buffer.
404
 *
405
 * Converts a DER encoded object identifier to its textual form. This
406
 * function expects the DER object identifier without the tag.
407
 *
408
 * Returns: %ASN1_SUCCESS on success, or an error.
409
 **/
410
int
411
asn1_get_object_id_der (const unsigned char *der, int der_len, int *ret_len,
412
      char *str, int str_size)
413
1.59M
{
414
1.59M
  int len_len, len, k;
415
1.59M
  int leading, parsed;
416
1.59M
  char temp[LTOSTR_MAX_SIZE];
417
1.59M
  uint64_t val, val1, val0;
418
419
1.59M
  *ret_len = 0;
420
1.59M
  if (str && str_size > 0)
421
1.59M
    str[0] = 0;     /* no oid */
422
423
1.59M
  if (str == NULL || der_len <= 0)
424
52
    return ASN1_GENERIC_ERROR;
425
426
1.59M
  len = asn1_get_length_der (der, der_len, &len_len);
427
428
1.59M
  if (len <= 0 || len + len_len > der_len)
429
2.06k
    return ASN1_DER_ERROR;
430
431
  /* leading octet can never be 0x80 */
432
1.59M
  if (der[len_len] == 0x80)
433
64
    return ASN1_DER_ERROR;
434
435
1.59M
  val0 = 0;
436
437
1.78M
  for (k = 0; k < len; k++)
438
1.75M
    {
439
1.75M
      if (INT_LEFT_SHIFT_OVERFLOW (val0, 7))
440
213
  return ASN1_DER_ERROR;
441
442
1.75M
      val0 <<= 7;
443
1.75M
      val0 |= der[len_len + k] & 0x7F;
444
1.75M
      if (!(der[len_len + k] & 0x80))
445
1.57M
  break;
446
1.75M
    }
447
1.59M
  parsed = ++k;
448
449
  /* val0 = (X*40) + Y, X={0,1,2}, Y<=39 when X={0,1} */
450
  /* X = val, Y = val1 */
451
452
  /* check if X == 0  */
453
1.59M
  val = 0;
454
1.59M
  val1 = val0;
455
1.59M
  if (val1 > 39)
456
1.52M
    {
457
1.52M
      val = 1;
458
1.52M
      val1 = val0 - 40;
459
1.52M
      if (val1 > 39)
460
964k
  {
461
964k
    val = 2;
462
964k
    val1 = val0 - 80;
463
964k
  }
464
1.52M
    }
465
466
1.59M
  _asn1_str_cpy (str, str_size, _asn1_ltostr (val, temp));
467
1.59M
  _asn1_str_cat (str, str_size, ".");
468
1.59M
  _asn1_str_cat (str, str_size, _asn1_ltostr (val1, temp));
469
470
1.59M
  val = 0;
471
1.59M
  leading = 1;
472
16.3M
  for (k = parsed; k < len; k++)
473
14.7M
    {
474
      /* X.690 mandates that the leading byte must never be 0x80
475
       */
476
14.7M
      if (leading != 0 && der[len_len + k] == 0x80)
477
151
  return ASN1_DER_ERROR;
478
14.7M
      leading = 0;
479
480
      /* check for wrap around */
481
14.7M
      if (INT_LEFT_SHIFT_OVERFLOW (val, 7))
482
398
  return ASN1_DER_ERROR;
483
484
14.7M
      val = val << 7;
485
14.7M
      val |= der[len_len + k] & 0x7F;
486
487
14.7M
      if (!(der[len_len + k] & 0x80))
488
13.0M
  {
489
13.0M
    _asn1_str_cat (str, str_size, ".");
490
13.0M
    _asn1_str_cat (str, str_size, _asn1_ltostr (val, temp));
491
13.0M
    val = 0;
492
13.0M
    leading = 1;
493
13.0M
  }
494
14.7M
    }
495
496
1.59M
  if (INT_ADD_OVERFLOW (len, len_len))
497
0
    return ASN1_DER_ERROR;
498
499
1.59M
  *ret_len = len + len_len;
500
501
1.59M
  return ASN1_SUCCESS;
502
1.59M
}
503
504
/**
505
 * asn1_get_bit_der:
506
 * @der: DER data to decode containing the BIT SEQUENCE.
507
 * @der_len: Length of DER data to decode.
508
 * @ret_len: Output variable containing the length of the DER data.
509
 * @str: Pre-allocated output buffer to put decoded BIT SEQUENCE in.
510
 * @str_size: Length of pre-allocated output buffer.
511
 * @bit_len: Output variable containing the size of the BIT SEQUENCE.
512
 *
513
 * Extract a BIT SEQUENCE from DER data.
514
 *
515
 * Returns: %ASN1_SUCCESS on success, or an error.
516
 **/
517
int
518
asn1_get_bit_der (const unsigned char *der, int der_len,
519
      int *ret_len, unsigned char *str, int str_size,
520
      int *bit_len)
521
326k
{
522
326k
  int len_len = 0, len_byte;
523
524
326k
  if (der_len <= 0)
525
0
    return ASN1_GENERIC_ERROR;
526
527
326k
  len_byte = asn1_get_length_der (der, der_len, &len_len) - 1;
528
326k
  if (len_byte < 0)
529
2.63k
    return ASN1_DER_ERROR;
530
531
324k
  *ret_len = len_byte + len_len + 1;
532
324k
  *bit_len = len_byte * 8 - der[len_len];
533
534
324k
  if (*bit_len < 0)
535
989
    return ASN1_DER_ERROR;
536
537
323k
  if (str_size >= len_byte)
538
179k
    {
539
179k
      if (len_byte > 0 && str)
540
179k
  memcpy (str, der + len_len + 1, len_byte);
541
179k
    }
542
143k
  else
543
143k
    {
544
143k
      return ASN1_MEM_ERROR;
545
143k
    }
546
547
179k
  return ASN1_SUCCESS;
548
323k
}
549
550
/* tag_len: the total tag length (explicit+inner)
551
 * inner_tag_len: the inner_tag length
552
 */
553
static int
554
_asn1_extract_tag_der (asn1_node node, const unsigned char *der, int der_len,
555
           int *tag_len, int *inner_tag_len, unsigned flags)
556
17.2M
{
557
17.2M
  asn1_node p;
558
17.2M
  int counter, len2, len3, is_tag_implicit;
559
17.2M
  int result;
560
17.2M
  unsigned long tag, tag_implicit = 0;
561
17.2M
  unsigned char class, class2, class_implicit = 0;
562
563
17.2M
  if (der_len <= 0)
564
3.97k
    return ASN1_GENERIC_ERROR;
565
566
17.2M
  counter = is_tag_implicit = 0;
567
568
17.2M
  if (node->type & CONST_TAG)
569
1.56M
    {
570
1.56M
      p = node->down;
571
3.76M
      while (p)
572
2.28M
  {
573
2.28M
    if (type_field (p->type) == ASN1_ETYPE_TAG)
574
1.57M
      {
575
1.57M
        if (p->type & CONST_APPLICATION)
576
0
    class2 = ASN1_CLASS_APPLICATION;
577
1.57M
        else if (p->type & CONST_UNIVERSAL)
578
0
    class2 = ASN1_CLASS_UNIVERSAL;
579
1.57M
        else if (p->type & CONST_PRIVATE)
580
0
    class2 = ASN1_CLASS_PRIVATE;
581
1.57M
        else
582
1.57M
    class2 = ASN1_CLASS_CONTEXT_SPECIFIC;
583
584
1.57M
        if (p->type & CONST_EXPLICIT)
585
415k
    {
586
415k
      if (asn1_get_tag_der
587
415k
          (der + counter, der_len, &class, &len2,
588
415k
           &tag) != ASN1_SUCCESS)
589
1.30k
        return ASN1_DER_ERROR;
590
591
414k
      DECR_LEN (der_len, len2);
592
414k
      counter += len2;
593
594
414k
      if (flags & ASN1_DECODE_FLAG_STRICT_DER)
595
365k
        len3 =
596
365k
          asn1_get_length_der (der + counter, der_len, &len2);
597
49.1k
      else
598
49.1k
        len3 =
599
49.1k
          asn1_get_length_ber (der + counter, der_len, &len2);
600
414k
      if (len3 < 0)
601
7.90k
        return ASN1_DER_ERROR;
602
603
406k
      DECR_LEN (der_len, len2);
604
406k
      counter += len2;
605
606
406k
      if (!is_tag_implicit)
607
406k
        {
608
406k
          if ((class != (class2 | ASN1_CLASS_STRUCTURED)) ||
609
406k
        (tag != strtoul ((char *) p->value, NULL, 10)))
610
72.6k
      return ASN1_TAG_ERROR;
611
406k
        }
612
0
      else
613
0
        {   /* ASN1_TAG_IMPLICIT */
614
0
          if ((class != class_implicit) || (tag != tag_implicit))
615
0
      return ASN1_TAG_ERROR;
616
0
        }
617
333k
      is_tag_implicit = 0;
618
333k
    }
619
1.16M
        else
620
1.16M
    {   /* ASN1_TAG_IMPLICIT */
621
1.16M
      if (!is_tag_implicit)
622
1.16M
        {
623
1.16M
          if ((type_field (node->type) == ASN1_ETYPE_SEQUENCE) ||
624
1.16M
        (type_field (node->type) == ASN1_ETYPE_SEQUENCE_OF)
625
1.16M
        || (type_field (node->type) == ASN1_ETYPE_SET)
626
1.16M
        || (type_field (node->type) == ASN1_ETYPE_SET_OF))
627
229k
      class2 |= ASN1_CLASS_STRUCTURED;
628
1.16M
          class_implicit = class2;
629
1.16M
          tag_implicit = strtoul ((char *) p->value, NULL, 10);
630
1.16M
          is_tag_implicit = 1;
631
1.16M
        }
632
1.16M
    }
633
1.57M
      }
634
2.20M
    p = p->right;
635
2.20M
  }
636
1.56M
    }
637
638
17.2M
  if (is_tag_implicit)
639
1.16M
    {
640
1.16M
      if (asn1_get_tag_der
641
1.16M
    (der + counter, der_len, &class, &len2, &tag) != ASN1_SUCCESS)
642
2.68k
  return ASN1_DER_ERROR;
643
644
1.15M
      DECR_LEN (der_len, len2);
645
646
1.15M
      if ((class != class_implicit) || (tag != tag_implicit))
647
696k
  {
648
696k
    if (type_field (node->type) == ASN1_ETYPE_OCTET_STRING)
649
26.3k
      {
650
26.3k
        class_implicit |= ASN1_CLASS_STRUCTURED;
651
26.3k
        if ((class != class_implicit) || (tag != tag_implicit))
652
20.9k
    return ASN1_TAG_ERROR;
653
26.3k
      }
654
670k
    else
655
670k
      return ASN1_TAG_ERROR;
656
696k
  }
657
1.15M
    }
658
16.0M
  else
659
16.0M
    {
660
16.0M
      unsigned type = type_field (node->type);
661
16.0M
      if (type == ASN1_ETYPE_TAG)
662
21.4k
  {
663
21.4k
    *tag_len = 0;
664
21.4k
    if (inner_tag_len)
665
21.4k
      *inner_tag_len = 0;
666
21.4k
    return ASN1_SUCCESS;
667
21.4k
  }
668
669
16.0M
      if (asn1_get_tag_der
670
16.0M
    (der + counter, der_len, &class, &len2, &tag) != ASN1_SUCCESS)
671
2.37k
  return ASN1_DER_ERROR;
672
673
16.0M
      DECR_LEN (der_len, len2);
674
675
16.0M
      switch (type)
676
16.0M
  {
677
0
  case ASN1_ETYPE_NULL:
678
548k
  case ASN1_ETYPE_BOOLEAN:
679
1.60M
  case ASN1_ETYPE_INTEGER:
680
1.61M
  case ASN1_ETYPE_ENUMERATED:
681
3.26M
  case ASN1_ETYPE_OBJECT_ID:
682
3.26M
  case ASN1_ETYPE_GENERALSTRING:
683
3.26M
  case ASN1_ETYPE_NUMERIC_STRING:
684
3.26M
  case ASN1_ETYPE_IA5_STRING:
685
3.37M
  case ASN1_ETYPE_TELETEX_STRING:
686
3.52M
  case ASN1_ETYPE_PRINTABLE_STRING:
687
3.58M
  case ASN1_ETYPE_UNIVERSAL_STRING:
688
3.66M
  case ASN1_ETYPE_BMP_STRING:
689
3.71M
  case ASN1_ETYPE_UTF8_STRING:
690
3.71M
  case ASN1_ETYPE_VISIBLE_STRING:
691
3.95M
  case ASN1_ETYPE_BIT_STRING:
692
6.60M
  case ASN1_ETYPE_SEQUENCE:
693
7.43M
  case ASN1_ETYPE_SEQUENCE_OF:
694
7.43M
  case ASN1_ETYPE_SET:
695
8.17M
  case ASN1_ETYPE_SET_OF:
696
8.37M
  case ASN1_ETYPE_GENERALIZED_TIME:
697
8.96M
  case ASN1_ETYPE_UTC_TIME:
698
8.96M
    if ((class != _asn1_tags[type].class)
699
8.96M
        || (tag != _asn1_tags[type].tag))
700
771k
      return ASN1_DER_ERROR;
701
8.19M
    break;
702
703
8.19M
  case ASN1_ETYPE_OCTET_STRING:
704
    /* OCTET STRING is handled differently to allow
705
     * BER encodings (structured class). */
706
704k
    if (((class != ASN1_CLASS_UNIVERSAL)
707
704k
         && (class != (ASN1_CLASS_UNIVERSAL | ASN1_CLASS_STRUCTURED)))
708
704k
        || (tag != ASN1_TAG_OCTET_STRING))
709
27.2k
      return ASN1_DER_ERROR;
710
677k
    break;
711
6.35M
  case ASN1_ETYPE_ANY:
712
6.35M
    counter -= len2;
713
6.35M
    break;
714
0
  case ASN1_ETYPE_CHOICE:
715
0
    counter -= len2;
716
0
    break;
717
0
  default:
718
0
    return ASN1_DER_ERROR;
719
0
    break;
720
16.0M
  }
721
16.0M
    }
722
723
15.6M
  counter += len2;
724
15.6M
  *tag_len = counter;
725
15.6M
  if (inner_tag_len)
726
13.7M
    *inner_tag_len = len2;
727
15.6M
  return ASN1_SUCCESS;
728
729
0
cleanup:
730
0
  return result;
731
17.2M
}
732
733
static int
734
extract_tag_der_recursive (asn1_node node, const unsigned char *der,
735
         int der_len, int *ret_len, int *inner_len,
736
         unsigned flags)
737
17.2M
{
738
17.2M
  asn1_node p;
739
17.2M
  int ris = ASN1_DER_ERROR;
740
741
17.2M
  if (type_field (node->type) == ASN1_ETYPE_CHOICE)
742
1.97M
    {
743
1.97M
      p = node->down;
744
1.97M
      while (p)
745
1.97M
  {
746
1.97M
    ris =
747
1.97M
      _asn1_extract_tag_der (p, der, der_len, ret_len, inner_len,
748
1.97M
           flags);
749
1.97M
    if (ris == ASN1_SUCCESS)
750
1.97M
      break;
751
0
    p = p->right;
752
0
  }
753
754
1.97M
      *ret_len = 0;
755
1.97M
      return ris;
756
1.97M
    }
757
15.3M
  else
758
15.3M
    return _asn1_extract_tag_der (node, der, der_len, ret_len, inner_len,
759
15.3M
          flags);
760
17.2M
}
761
762
static int
763
_asn1_delete_not_used (asn1_node node)
764
602k
{
765
602k
  asn1_node p, p2;
766
767
602k
  if (node == NULL)
768
0
    return ASN1_ELEMENT_NOT_FOUND;
769
770
602k
  p = node;
771
19.2M
  while (p)
772
18.6M
    {
773
18.6M
      if (p->type & CONST_NOT_USED)
774
186k
  {
775
186k
    p2 = NULL;
776
186k
    if (p != node)
777
186k
      {
778
186k
        p2 = _asn1_find_left (p);
779
186k
        if (!p2)
780
1.87k
    p2 = _asn1_find_up (p);
781
186k
      }
782
186k
    asn1_delete_structure (&p);
783
186k
    p = p2;
784
186k
  }
785
786
18.6M
      if (!p)
787
0
  break;     /* reach node */
788
789
18.6M
      if (p->down)
790
8.61M
  {
791
8.61M
    p = p->down;
792
8.61M
  }
793
10.0M
      else
794
10.0M
  {
795
10.0M
    if (p == node)
796
59.5k
      p = NULL;
797
9.95M
    else if (p->right)
798
3.87M
      p = p->right;
799
6.07M
    else
800
6.07M
      {
801
8.61M
        while (1)
802
8.61M
    {
803
8.61M
      p = _asn1_find_up (p);
804
8.61M
      if (p == node)
805
543k
        {
806
543k
          p = NULL;
807
543k
          break;
808
543k
        }
809
8.07M
      if (p->right)
810
5.53M
        {
811
5.53M
          p = p->right;
812
5.53M
          break;
813
5.53M
        }
814
8.07M
    }
815
6.07M
      }
816
10.0M
  }
817
18.6M
    }
818
602k
  return ASN1_SUCCESS;
819
602k
}
820
821
static int
822
_asn1_get_indefinite_length_string (const unsigned char *der,
823
            int der_len, int *len)
824
14.9k
{
825
14.9k
  int len2, len3, counter, indefinite;
826
14.9k
  int result;
827
14.9k
  unsigned long tag;
828
14.9k
  unsigned char class;
829
830
14.9k
  counter = indefinite = 0;
831
832
4.94M
  while (1)
833
4.94M
    {
834
4.94M
      if (HAVE_TWO (der_len) && (der[counter] == 0)
835
4.94M
    && (der[counter + 1] == 0))
836
39.4k
  {
837
39.4k
    counter += 2;
838
39.4k
    DECR_LEN (der_len, 2);
839
840
39.4k
    indefinite--;
841
39.4k
    if (indefinite <= 0)
842
12.9k
      break;
843
26.5k
    else
844
26.5k
      continue;
845
39.4k
  }
846
847
4.90M
      if (asn1_get_tag_der
848
4.90M
    (der + counter, der_len, &class, &len2, &tag) != ASN1_SUCCESS)
849
764
  return ASN1_DER_ERROR;
850
851
4.90M
      DECR_LEN (der_len, len2);
852
4.90M
      counter += len2;
853
854
4.90M
      len2 = asn1_get_length_der (der + counter, der_len, &len3);
855
4.90M
      if (len2 < -1)
856
1.27k
  return ASN1_DER_ERROR;
857
858
4.90M
      if (len2 == -1)
859
156k
  {
860
156k
    indefinite++;
861
156k
    counter += 1;
862
156k
    DECR_LEN (der_len, 1);
863
156k
  }
864
4.74M
      else
865
4.74M
  {
866
4.74M
    counter += len2 + len3;
867
4.74M
    DECR_LEN (der_len, len2 + len3);
868
4.74M
  }
869
4.90M
    }
870
871
12.9k
  *len = counter;
872
12.9k
  return ASN1_SUCCESS;
873
874
0
cleanup:
875
0
  return result;
876
14.9k
}
877
878
static void
879
delete_unneeded_choice_fields (asn1_node p)
880
1.97M
{
881
1.97M
  asn1_node p2;
882
883
3.02M
  while (p->right)
884
1.04M
    {
885
1.04M
      p2 = p->right;
886
1.04M
      asn1_delete_structure (&p2);
887
1.04M
    }
888
1.97M
}
889
890
891
/**
892
 * asn1_der_decoding2
893
 * @element: pointer to an ASN1 structure.
894
 * @ider: vector that contains the DER encoding.
895
 * @max_ider_len: pointer to an integer giving the information about the
896
 *   maximal number of bytes occupied by *@ider. The real size of the DER
897
 *   encoding is returned through this pointer.
898
 * @flags: flags controlling the behaviour of the function.
899
 * @errorDescription: null-terminated string contains details when an
900
 *   error occurred.
901
 *
902
 * Fill the structure *@element with values of a DER encoding string. The
903
 * structure must just be created with function asn1_create_element().
904
 *
905
 * If %ASN1_DECODE_FLAG_ALLOW_PADDING flag is set then the function will ignore
906
 * padding after the decoded DER data. Upon a successful return the value of
907
 * *@max_ider_len will be set to the number of bytes decoded.
908
 *
909
 * If %ASN1_DECODE_FLAG_STRICT_DER flag is set then the function will
910
 * not decode any BER-encoded elements.
911
 *
912
 * Returns: %ASN1_SUCCESS if DER encoding OK, %ASN1_ELEMENT_NOT_FOUND
913
 *   if @ELEMENT is %NULL, and %ASN1_TAG_ERROR or
914
 *   %ASN1_DER_ERROR if the der encoding doesn't match the structure
915
 *   name (*@ELEMENT deleted).
916
 **/
917
int
918
asn1_der_decoding2 (asn1_node *element, const void *ider, int *max_ider_len,
919
        unsigned int flags, char *errorDescription)
920
771k
{
921
771k
  asn1_node node, p, p2, p3;
922
771k
  char temp[128];
923
771k
  int counter, len2, len3, len4, move, ris, tlen;
924
771k
  struct node_tail_cache_st tcache = { NULL, NULL };
925
771k
  unsigned char class;
926
771k
  unsigned long tag;
927
771k
  int tag_len;
928
771k
  int indefinite, result, total_len = *max_ider_len, ider_len = *max_ider_len;
929
771k
  int inner_tag_len;
930
771k
  unsigned char *ptmp;
931
771k
  const unsigned char *ptag;
932
771k
  const unsigned char *der = ider;
933
934
771k
  node = *element;
935
936
771k
  if (errorDescription != NULL)
937
128k
    errorDescription[0] = 0;
938
939
771k
  if (node == NULL)
940
0
    return ASN1_ELEMENT_NOT_FOUND;
941
942
771k
  if (node->type & CONST_OPTION)
943
0
    {
944
0
      result = ASN1_GENERIC_ERROR;
945
0
      warn ();
946
0
      goto cleanup;
947
0
    }
948
949
771k
  counter = 0;
950
771k
  move = DOWN;
951
771k
  p = node;
952
24.2M
  while (1)
953
24.2M
    {
954
24.2M
      tag_len = 0;
955
24.2M
      inner_tag_len = 0;
956
24.2M
      ris = ASN1_SUCCESS;
957
24.2M
      if (move != UP)
958
14.7M
  {
959
14.7M
    if (p->type & CONST_SET)
960
0
      {
961
0
        p2 = _asn1_find_up (p);
962
0
        len2 = p2->tmp_ival;
963
0
        if (len2 == -1)
964
0
    {
965
0
      if (HAVE_TWO (ider_len) && !der[counter]
966
0
          && !der[counter + 1])
967
0
        {
968
0
          p = p2;
969
0
          move = UP;
970
0
          counter += 2;
971
0
          DECR_LEN (ider_len, 2);
972
0
          continue;
973
0
        }
974
0
    }
975
0
        else if (counter == len2)
976
0
    {
977
0
      p = p2;
978
0
      move = UP;
979
0
      continue;
980
0
    }
981
0
        else if (counter > len2)
982
0
    {
983
0
      result = ASN1_DER_ERROR;
984
0
      warn ();
985
0
      goto cleanup;
986
0
    }
987
0
        p2 = p2->down;
988
0
        while (p2)
989
0
    {
990
0
      if ((p2->type & CONST_SET) && (p2->type & CONST_NOT_USED))
991
0
        {
992
0
          ris =
993
0
      extract_tag_der_recursive (p2, der + counter,
994
0
               ider_len, &len2, NULL,
995
0
               flags);
996
0
          if (ris == ASN1_SUCCESS)
997
0
      {
998
0
        p2->type &= ~CONST_NOT_USED;
999
0
        p = p2;
1000
0
        break;
1001
0
      }
1002
0
        }
1003
0
      p2 = p2->right;
1004
0
    }
1005
0
        if (p2 == NULL)
1006
0
    {
1007
0
      result = ASN1_DER_ERROR;
1008
0
      warn ();
1009
0
      goto cleanup;
1010
0
    }
1011
0
      }
1012
1013
    /* the position in the DER structure this starts */
1014
14.7M
    p->start = counter;
1015
14.7M
    p->end = total_len - 1;
1016
1017
14.7M
    if ((p->type & CONST_OPTION) || (p->type & CONST_DEFAULT))
1018
1.57M
      {
1019
1.57M
        p2 = _asn1_find_up (p);
1020
1.57M
        len2 = p2->tmp_ival;
1021
1.57M
        if (counter == len2)
1022
322k
    {
1023
322k
      if (p->right)
1024
52.1k
        {
1025
52.1k
          p2 = p->right;
1026
52.1k
          move = RIGHT;
1027
52.1k
        }
1028
270k
      else
1029
270k
        move = UP;
1030
1031
322k
      if (p->type & CONST_OPTION)
1032
319k
        asn1_delete_structure (&p);
1033
1034
322k
      p = p2;
1035
322k
      continue;
1036
322k
    }
1037
1.57M
      }
1038
1039
14.4M
    if (type_field (p->type) == ASN1_ETYPE_CHOICE)
1040
1.99M
      {
1041
2.85M
        while (p->down)
1042
2.83M
    {
1043
2.83M
      ris =
1044
2.83M
        extract_tag_der_recursive (p->down, der + counter,
1045
2.83M
                 ider_len, &len2, NULL, flags);
1046
1047
2.83M
      if (ris == ASN1_SUCCESS)
1048
1.97M
        {
1049
1.97M
          delete_unneeded_choice_fields (p->down);
1050
1.97M
          break;
1051
1.97M
        }
1052
858k
      else if (ris == ASN1_ERROR_TYPE_ANY)
1053
0
        {
1054
0
          result = ASN1_ERROR_TYPE_ANY;
1055
0
          warn ();
1056
0
          goto cleanup;
1057
0
        }
1058
858k
      else
1059
858k
        {
1060
858k
          p2 = p->down;
1061
858k
          asn1_delete_structure (&p2);
1062
858k
        }
1063
2.83M
    }
1064
1065
1.99M
        if (p->down == NULL)
1066
17.5k
    {
1067
17.5k
      if (!(p->type & CONST_OPTION))
1068
14.3k
        {
1069
14.3k
          result = ASN1_DER_ERROR;
1070
14.3k
          warn ();
1071
14.3k
          goto cleanup;
1072
14.3k
        }
1073
17.5k
    }
1074
1.97M
        else if (type_field (p->type) != ASN1_ETYPE_CHOICE)
1075
0
    p = p->down;
1076
1077
1.98M
        p->start = counter;
1078
1.98M
      }
1079
1080
14.4M
    if ((p->type & CONST_OPTION) || (p->type & CONST_DEFAULT))
1081
1.25M
      {
1082
1.25M
        p2 = _asn1_find_up (p);
1083
1.25M
        len2 = p2->tmp_ival;
1084
1085
1.25M
        if ((len2 != -1) && (counter > len2))
1086
3.25k
    ris = ASN1_TAG_ERROR;
1087
1.25M
      }
1088
1089
14.4M
    if (ris == ASN1_SUCCESS)
1090
14.4M
      ris =
1091
14.4M
        extract_tag_der_recursive (p, der + counter, ider_len,
1092
14.4M
           &tag_len, &inner_tag_len, flags);
1093
1094
14.4M
    if (ris != ASN1_SUCCESS)
1095
728k
      {
1096
728k
        if (p->type & CONST_OPTION)
1097
209k
    {
1098
209k
      p->type |= CONST_NOT_USED;
1099
209k
      move = RIGHT;
1100
209k
    }
1101
518k
        else if (p->type & CONST_DEFAULT)
1102
393k
    {
1103
393k
      _asn1_set_value (p, NULL, 0);
1104
393k
      move = RIGHT;
1105
393k
    }
1106
125k
        else
1107
125k
    {
1108
125k
      if (errorDescription != NULL)
1109
1.77k
        _asn1_error_description_tag_error (p, errorDescription);
1110
1111
125k
      result = ASN1_TAG_ERROR;
1112
125k
      warn ();
1113
125k
      goto cleanup;
1114
125k
    }
1115
728k
      }
1116
13.7M
    else
1117
13.7M
      {
1118
13.7M
        DECR_LEN (ider_len, tag_len);
1119
13.7M
        counter += tag_len;
1120
13.7M
      }
1121
14.4M
  }
1122
1123
23.8M
      if (ris == ASN1_SUCCESS)
1124
23.2M
  {
1125
23.2M
    switch (type_field (p->type))
1126
23.2M
      {
1127
1.95k
      case ASN1_ETYPE_NULL:
1128
1.95k
        DECR_LEN (ider_len, 1);
1129
1.95k
        if (der[counter])
1130
9
    {
1131
9
      result = ASN1_DER_ERROR;
1132
9
      warn ();
1133
9
      goto cleanup;
1134
9
    }
1135
1.94k
        counter++;
1136
1.94k
        move = RIGHT;
1137
1.94k
        break;
1138
168k
      case ASN1_ETYPE_BOOLEAN:
1139
168k
        DECR_LEN (ider_len, 2);
1140
1141
168k
        if (der[counter++] != 1)
1142
108
    {
1143
108
      result = ASN1_DER_ERROR;
1144
108
      warn ();
1145
108
      goto cleanup;
1146
108
    }
1147
167k
        if (der[counter++] == 0)
1148
8.43k
    _asn1_set_value (p, "F", 1);
1149
159k
        else
1150
159k
    _asn1_set_value (p, "T", 1);
1151
167k
        move = RIGHT;
1152
167k
        break;
1153
976k
      case ASN1_ETYPE_INTEGER:
1154
980k
      case ASN1_ETYPE_ENUMERATED:
1155
980k
        len2 = asn1_get_length_der (der + counter, ider_len, &len3);
1156
980k
        if (len2 < 0)
1157
2.18k
    {
1158
2.18k
      result = ASN1_DER_ERROR;
1159
2.18k
      warn ();
1160
2.18k
      goto cleanup;
1161
2.18k
    }
1162
1163
978k
        DECR_LEN (ider_len, len3 + len2);
1164
1165
978k
        _asn1_set_value (p, der + counter, len3 + len2);
1166
978k
        counter += len3 + len2;
1167
978k
        move = RIGHT;
1168
978k
        break;
1169
1.59M
      case ASN1_ETYPE_OBJECT_ID:
1170
1.59M
        result =
1171
1.59M
    asn1_get_object_id_der (der + counter, ider_len, &len2,
1172
1.59M
          temp, sizeof (temp));
1173
1.59M
        if (result != ASN1_SUCCESS)
1174
2.94k
    {
1175
2.94k
      warn ();
1176
2.94k
      goto cleanup;
1177
2.94k
    }
1178
1179
1.59M
        DECR_LEN (ider_len, len2);
1180
1181
1.59M
        tlen = strlen (temp);
1182
1.59M
        if (tlen > 0)
1183
1.59M
    _asn1_set_value (p, temp, tlen + 1);
1184
1185
1.59M
        counter += len2;
1186
1.59M
        move = RIGHT;
1187
1.59M
        break;
1188
70.8k
      case ASN1_ETYPE_GENERALIZED_TIME:
1189
244k
      case ASN1_ETYPE_UTC_TIME:
1190
244k
        result =
1191
244k
    _asn1_get_time_der (type_field (p->type), der + counter,
1192
244k
            ider_len, &len2, temp, sizeof (temp) - 1,
1193
244k
            flags);
1194
244k
        if (result != ASN1_SUCCESS)
1195
2.17k
    {
1196
2.17k
      warn ();
1197
2.17k
      goto cleanup;
1198
2.17k
    }
1199
1200
241k
        DECR_LEN (ider_len, len2);
1201
1202
241k
        tlen = strlen (temp);
1203
241k
        if (tlen > 0)
1204
241k
    _asn1_set_value (p, temp, tlen);
1205
1206
241k
        counter += len2;
1207
241k
        move = RIGHT;
1208
241k
        break;
1209
687k
      case ASN1_ETYPE_OCTET_STRING:
1210
687k
        if (counter < inner_tag_len)
1211
0
    {
1212
0
      result = ASN1_DER_ERROR;
1213
0
      warn ();
1214
0
      goto cleanup;
1215
0
    }
1216
1217
687k
        ptag = der + counter - inner_tag_len;
1218
687k
        if ((flags & ASN1_DECODE_FLAG_STRICT_DER)
1219
687k
      || !(ptag[0] & ASN1_CLASS_STRUCTURED))
1220
683k
    {
1221
683k
      if (ptag[0] & ASN1_CLASS_STRUCTURED)
1222
133
        {
1223
133
          result = ASN1_DER_ERROR;
1224
133
          warn ();
1225
133
          goto cleanup;
1226
133
        }
1227
1228
683k
      len2 = asn1_get_length_der (der + counter, ider_len, &len3);
1229
683k
      if (len2 < 0)
1230
1.91k
        {
1231
1.91k
          result = ASN1_DER_ERROR;
1232
1.91k
          warn ();
1233
1.91k
          goto cleanup;
1234
1.91k
        }
1235
1236
681k
      DECR_LEN (ider_len, len3 + len2);
1237
1238
681k
      _asn1_set_value (p, der + counter, len3 + len2);
1239
681k
      counter += len3 + len2;
1240
681k
    }
1241
3.97k
        else
1242
3.97k
    {
1243
3.97k
      unsigned dflags = 0, vlen, ber_len;
1244
1245
3.97k
      if (ptag[0] & ASN1_CLASS_STRUCTURED)
1246
3.97k
        dflags |= DECODE_FLAG_CONSTRUCTED;
1247
1248
3.97k
      result =
1249
3.97k
        _asn1_decode_simple_ber (type_field (p->type),
1250
3.97k
               der + counter, ider_len, &ptmp,
1251
3.97k
               &vlen, &ber_len, dflags);
1252
3.97k
      if (result != ASN1_SUCCESS)
1253
1.17k
        {
1254
1.17k
          warn ();
1255
1.17k
          goto cleanup;
1256
1.17k
        }
1257
1258
2.80k
      DECR_LEN (ider_len, ber_len);
1259
1260
2.80k
      _asn1_set_value_lv (p, ptmp, vlen);
1261
1262
2.80k
      counter += ber_len;
1263
2.80k
      free (ptmp);
1264
2.80k
    }
1265
684k
        move = RIGHT;
1266
684k
        break;
1267
148
      case ASN1_ETYPE_GENERALSTRING:
1268
148
      case ASN1_ETYPE_NUMERIC_STRING:
1269
87.3k
      case ASN1_ETYPE_IA5_STRING:
1270
94.9k
      case ASN1_ETYPE_TELETEX_STRING:
1271
130k
      case ASN1_ETYPE_PRINTABLE_STRING:
1272
136k
      case ASN1_ETYPE_UNIVERSAL_STRING:
1273
160k
      case ASN1_ETYPE_BMP_STRING:
1274
164k
      case ASN1_ETYPE_UTF8_STRING:
1275
164k
      case ASN1_ETYPE_VISIBLE_STRING:
1276
406k
      case ASN1_ETYPE_BIT_STRING:
1277
406k
        len2 = asn1_get_length_der (der + counter, ider_len, &len3);
1278
406k
        if (len2 < 0)
1279
2.25k
    {
1280
2.25k
      result = ASN1_DER_ERROR;
1281
2.25k
      warn ();
1282
2.25k
      goto cleanup;
1283
2.25k
    }
1284
1285
404k
        DECR_LEN (ider_len, len3 + len2);
1286
1287
404k
        _asn1_set_value (p, der + counter, len3 + len2);
1288
404k
        counter += len3 + len2;
1289
404k
        move = RIGHT;
1290
404k
        break;
1291
4.84M
      case ASN1_ETYPE_SEQUENCE:
1292
4.84M
      case ASN1_ETYPE_SET:
1293
4.84M
        if (move == UP)
1294
2.20M
    {
1295
2.20M
      len2 = p->tmp_ival;
1296
2.20M
      p->tmp_ival = 0;
1297
2.20M
      if (len2 == -1)
1298
27.8k
        {   /* indefinite length method */
1299
27.8k
          DECR_LEN (ider_len, 2);
1300
27.6k
          if ((der[counter]) || der[counter + 1])
1301
271
      {
1302
271
        result = ASN1_DER_ERROR;
1303
271
        warn ();
1304
271
        goto cleanup;
1305
271
      }
1306
27.3k
          counter += 2;
1307
27.3k
        }
1308
2.18M
      else
1309
2.18M
        {   /* definite length method */
1310
2.18M
          if (len2 != counter)
1311
8.32k
      {
1312
8.32k
        result = ASN1_DER_ERROR;
1313
8.32k
        warn ();
1314
8.32k
        goto cleanup;
1315
8.32k
      }
1316
2.18M
        }
1317
2.20M
      move = RIGHT;
1318
2.20M
    }
1319
2.63M
        else
1320
2.63M
    {   /* move==DOWN || move==RIGHT */
1321
2.63M
      len3 = asn1_get_length_der (der + counter, ider_len, &len2);
1322
2.63M
      if (IS_ERR (len3, flags))
1323
2.78k
        {
1324
2.78k
          result = ASN1_DER_ERROR;
1325
2.78k
          warn ();
1326
2.78k
          goto cleanup;
1327
2.78k
        }
1328
1329
2.63M
      DECR_LEN (ider_len, len2);
1330
2.63M
      counter += len2;
1331
1332
2.63M
      if (len3 > 0)
1333
2.34M
        {
1334
2.34M
          p->tmp_ival = counter + len3;
1335
2.34M
          move = DOWN;
1336
2.34M
        }
1337
290k
      else if (len3 == 0)
1338
256k
        {
1339
256k
          p2 = p->down;
1340
937k
          while (p2)
1341
680k
      {
1342
680k
        if (type_field (p2->type) != ASN1_ETYPE_TAG)
1343
679k
          {
1344
679k
            p3 = p2->right;
1345
679k
            asn1_delete_structure (&p2);
1346
679k
            p2 = p3;
1347
679k
          }
1348
748
        else
1349
748
          p2 = p2->right;
1350
680k
      }
1351
256k
          move = RIGHT;
1352
256k
        }
1353
33.4k
      else
1354
33.4k
        {   /* indefinite length method */
1355
33.4k
          p->tmp_ival = -1;
1356
33.4k
          move = DOWN;
1357
33.4k
        }
1358
2.63M
    }
1359
4.83M
        break;
1360
4.83M
      case ASN1_ETYPE_SEQUENCE_OF:
1361
6.45M
      case ASN1_ETYPE_SET_OF:
1362
6.45M
        if (move == UP)
1363
5.30M
    {
1364
5.30M
      len2 = p->tmp_ival;
1365
5.30M
      if (len2 == -1)
1366
1.41M
        {   /* indefinite length method */
1367
1.41M
          if (!HAVE_TWO (ider_len)
1368
1.41M
        || ((der[counter]) || der[counter + 1]))
1369
1.40M
      {
1370
1.40M
        result = _asn1_append_sequence_set (p, &tcache);
1371
1.40M
        if (result != 0)
1372
0
          {
1373
0
            warn ();
1374
0
            goto cleanup;
1375
0
          }
1376
1.40M
        p = tcache.tail;
1377
1.40M
        move = RIGHT;
1378
1.40M
        continue;
1379
1.40M
      }
1380
1381
9.75k
          p->tmp_ival = 0;
1382
9.75k
          tcache.tail = NULL; /* finished decoding this structure */
1383
9.75k
          tcache.head = NULL;
1384
9.75k
          DECR_LEN (ider_len, 2);
1385
9.75k
          counter += 2;
1386
9.75k
        }
1387
3.89M
      else
1388
3.89M
        {   /* definite length method */
1389
3.89M
          if (len2 > counter)
1390
2.98M
      {
1391
2.98M
        result = _asn1_append_sequence_set (p, &tcache);
1392
2.98M
        if (result != 0)
1393
0
          {
1394
0
            warn ();
1395
0
            goto cleanup;
1396
0
          }
1397
2.98M
        p = tcache.tail;
1398
2.98M
        move = RIGHT;
1399
2.98M
        continue;
1400
2.98M
      }
1401
1402
910k
          p->tmp_ival = 0;
1403
910k
          tcache.tail = NULL; /* finished decoding this structure */
1404
910k
          tcache.head = NULL;
1405
1406
910k
          if (len2 != counter)
1407
665
      {
1408
665
        result = ASN1_DER_ERROR;
1409
665
        warn ();
1410
665
        goto cleanup;
1411
665
      }
1412
910k
        }
1413
5.30M
    }
1414
1.14M
        else
1415
1.14M
    {   /* move==DOWN || move==RIGHT */
1416
1.14M
      len3 = asn1_get_length_der (der + counter, ider_len, &len2);
1417
1.14M
      if (IS_ERR (len3, flags))
1418
1.84k
        {
1419
1.84k
          result = ASN1_DER_ERROR;
1420
1.84k
          warn ();
1421
1.84k
          goto cleanup;
1422
1.84k
        }
1423
1424
1.14M
      DECR_LEN (ider_len, len2);
1425
1.14M
      counter += len2;
1426
1.14M
      if (len3)
1427
932k
        {
1428
932k
          if (len3 > 0)
1429
922k
      { /* definite length method */
1430
922k
        p->tmp_ival = counter + len3;
1431
922k
      }
1432
10.6k
          else
1433
10.6k
      { /* indefinite length method */
1434
10.6k
        p->tmp_ival = -1;
1435
10.6k
      }
1436
1437
932k
          p2 = p->down;
1438
932k
          if (p2 == NULL)
1439
0
      {
1440
0
        result = ASN1_DER_ERROR;
1441
0
        warn ();
1442
0
        goto cleanup;
1443
0
      }
1444
1445
1.03M
          while ((type_field (p2->type) == ASN1_ETYPE_TAG)
1446
1.03M
           || (type_field (p2->type) == ASN1_ETYPE_SIZE))
1447
101k
      p2 = p2->right;
1448
932k
          if (p2->right == NULL)
1449
932k
      {
1450
932k
        result = _asn1_append_sequence_set (p, &tcache);
1451
932k
        if (result != 0)
1452
0
          {
1453
0
            warn ();
1454
0
            goto cleanup;
1455
0
          }
1456
932k
      }
1457
932k
          p = p2;
1458
932k
        }
1459
1.14M
    }
1460
2.06M
        move = RIGHT;
1461
2.06M
        break;
1462
3.86M
      case ASN1_ETYPE_ANY:
1463
        /* Check indefinite length method in an EXPLICIT TAG */
1464
1465
3.86M
        if (!(flags & ASN1_DECODE_FLAG_STRICT_DER)
1466
3.86M
      && (p->type & CONST_TAG) && tag_len == 2
1467
3.86M
      && (der[counter - 1] == 0x80))
1468
1.56k
    indefinite = 1;
1469
3.86M
        else
1470
3.86M
    indefinite = 0;
1471
1472
3.86M
        if (asn1_get_tag_der
1473
3.86M
      (der + counter, ider_len, &class, &len2,
1474
3.86M
       &tag) != ASN1_SUCCESS)
1475
160
    {
1476
160
      result = ASN1_DER_ERROR;
1477
160
      warn ();
1478
160
      goto cleanup;
1479
160
    }
1480
1481
3.86M
        DECR_LEN (ider_len, len2);
1482
1483
3.86M
        len4 =
1484
3.86M
    asn1_get_length_der (der + counter + len2, ider_len, &len3);
1485
3.86M
        if (IS_ERR (len4, flags))
1486
2.16k
    {
1487
2.16k
      result = ASN1_DER_ERROR;
1488
2.16k
      warn ();
1489
2.16k
      goto cleanup;
1490
2.16k
    }
1491
3.86M
        if (len4 != -1)  /* definite */
1492
3.85M
    {
1493
3.85M
      len2 += len4;
1494
1495
3.85M
      DECR_LEN (ider_len, len4 + len3);
1496
3.85M
      _asn1_set_value_lv (p, der + counter, len2 + len3);
1497
3.85M
      counter += len2 + len3;
1498
3.85M
    }
1499
10.9k
        else    /* == -1 */
1500
10.9k
    {   /* indefinite length */
1501
10.9k
      ider_len += len2; /* undo DECR_LEN */
1502
1503
10.9k
      if (counter == 0)
1504
0
        {
1505
0
          result = ASN1_DER_ERROR;
1506
0
          warn ();
1507
0
          goto cleanup;
1508
0
        }
1509
1510
10.9k
      result =
1511
10.9k
        _asn1_get_indefinite_length_string (der + counter,
1512
10.9k
              ider_len, &len2);
1513
10.9k
      if (result != ASN1_SUCCESS)
1514
70
        {
1515
70
          warn ();
1516
70
          goto cleanup;
1517
70
        }
1518
1519
10.8k
      DECR_LEN (ider_len, len2);
1520
10.8k
      _asn1_set_value_lv (p, der + counter, len2);
1521
10.8k
      counter += len2;
1522
1523
10.8k
    }
1524
1525
        /* Check if a couple of 0x00 are present due to an EXPLICIT TAG with
1526
           an indefinite length method. */
1527
3.86M
        if (indefinite)
1528
1.56k
    {
1529
1.56k
      DECR_LEN (ider_len, 2);
1530
1.49k
      if (!der[counter] && !der[counter + 1])
1531
1.36k
        {
1532
1.36k
          counter += 2;
1533
1.36k
        }
1534
125
      else
1535
125
        {
1536
125
          result = ASN1_DER_ERROR;
1537
125
          warn ();
1538
125
          goto cleanup;
1539
125
        }
1540
1.49k
    }
1541
1542
3.86M
        move = RIGHT;
1543
3.86M
        break;
1544
3.97M
      default:
1545
3.97M
        move = (move == UP) ? RIGHT : DOWN;
1546
3.97M
        break;
1547
23.2M
      }
1548
23.2M
  }
1549
1550
19.4M
      if (p)
1551
19.4M
  {
1552
19.4M
    p->end = counter - 1;
1553
19.4M
  }
1554
1555
19.4M
      if (p == node && move != DOWN)
1556
602k
  break;
1557
1558
18.8M
      if (move == DOWN)
1559
4.37M
  {
1560
4.37M
    if (p->down)
1561
4.35M
      p = p->down;
1562
21.4k
    else
1563
21.4k
      move = RIGHT;
1564
4.37M
  }
1565
18.8M
      if ((move == RIGHT) && !(p->type & CONST_SET))
1566
14.4M
  {
1567
14.4M
    if (p->right)
1568
5.23M
      p = p->right;
1569
9.21M
    else
1570
9.21M
      move = UP;
1571
14.4M
  }
1572
18.8M
      if (move == UP)
1573
9.21M
  {
1574
    /* If we are parsing a sequence or set and p is a direct
1575
       child of it, no need to traverse the list back to the leftmost node. */
1576
9.21M
    if (tcache.tail == p)
1577
4.73M
      p = tcache.head;
1578
4.48M
    else
1579
4.48M
      p = _asn1_find_up (p);
1580
9.21M
  }
1581
18.8M
    }
1582
1583
602k
  _asn1_delete_not_used (*element);
1584
1585
602k
  if ((ider_len < 0) ||
1586
602k
      (!(flags & ASN1_DECODE_FLAG_ALLOW_PADDING) && (ider_len != 0)))
1587
1.05k
    {
1588
1.05k
      warn ();
1589
1.05k
      result = ASN1_DER_ERROR;
1590
1.05k
      goto cleanup;
1591
1.05k
    }
1592
1593
601k
  *max_ider_len = total_len - ider_len;
1594
1595
601k
  return ASN1_SUCCESS;
1596
1597
170k
cleanup:
1598
170k
  asn1_delete_structure (element);
1599
170k
  return result;
1600
602k
}
1601
1602
1603
/**
1604
 * asn1_der_decoding:
1605
 * @element: pointer to an ASN1 structure.
1606
 * @ider: vector that contains the DER encoding.
1607
 * @ider_len: number of bytes of *@ider: @ider[0]..@ider[len-1].
1608
 * @errorDescription: null-terminated string contains details when an
1609
 *   error occurred.
1610
 *
1611
 * Fill the structure *@element with values of a DER encoding
1612
 * string. The structure must just be created with function
1613
 * asn1_create_element().
1614
 *
1615
 * Note that the *@element variable is provided as a pointer for
1616
 * historical reasons.
1617
 *
1618
 * Returns: %ASN1_SUCCESS if DER encoding OK, %ASN1_ELEMENT_NOT_FOUND
1619
 *   if @ELEMENT is %NULL, and %ASN1_TAG_ERROR or
1620
 *   %ASN1_DER_ERROR if the der encoding doesn't match the structure
1621
 *   name (*@ELEMENT deleted).
1622
 **/
1623
int
1624
asn1_der_decoding (asn1_node *element, const void *ider, int ider_len,
1625
       char *errorDescription)
1626
157k
{
1627
157k
  return asn1_der_decoding2 (element, ider, &ider_len, 0, errorDescription);
1628
157k
}
1629
1630
/**
1631
 * asn1_der_decoding_element:
1632
 * @structure: pointer to an ASN1 structure
1633
 * @elementName: name of the element to fill
1634
 * @ider: vector that contains the DER encoding of the whole structure.
1635
 * @len: number of bytes of *der: der[0]..der[len-1]
1636
 * @errorDescription: null-terminated string contains details when an
1637
 *   error occurred.
1638
 *
1639
 * Fill the element named @ELEMENTNAME with values of a DER encoding
1640
 * string.  The structure must just be created with function
1641
 * asn1_create_element().  The DER vector must contain the encoding
1642
 * string of the whole @STRUCTURE.  If an error occurs during the
1643
 * decoding procedure, the *@STRUCTURE is deleted and set equal to
1644
 * %NULL.
1645
 *
1646
 * This function is deprecated and may just be an alias to asn1_der_decoding
1647
 * in future versions. Use asn1_der_decoding() instead.
1648
 *
1649
 * Returns: %ASN1_SUCCESS if DER encoding OK, %ASN1_ELEMENT_NOT_FOUND
1650
 *   if ELEMENT is %NULL or @elementName == NULL, and
1651
 *   %ASN1_TAG_ERROR or %ASN1_DER_ERROR if the der encoding doesn't
1652
 *   match the structure @structure (*ELEMENT deleted).
1653
 **/
1654
int
1655
asn1_der_decoding_element (asn1_node *structure, const char *elementName,
1656
         const void *ider, int len, char *errorDescription)
1657
0
{
1658
0
  return asn1_der_decoding (structure, ider, len, errorDescription);
1659
0
}
1660
1661
/**
1662
 * asn1_der_decoding_startEnd:
1663
 * @element: pointer to an ASN1 element
1664
 * @ider: vector that contains the DER encoding.
1665
 * @ider_len: number of bytes of *@ider: @ider[0]..@ider[len-1]
1666
 * @name_element: an element of NAME structure.
1667
 * @start: the position of the first byte of NAME_ELEMENT decoding
1668
 *   (@ider[*start])
1669
 * @end: the position of the last byte of NAME_ELEMENT decoding
1670
 *  (@ider[*end])
1671
 *
1672
 * Find the start and end point of an element in a DER encoding
1673
 * string. I mean that if you have a der encoding and you have already
1674
 * used the function asn1_der_decoding() to fill a structure, it may
1675
 * happen that you want to find the piece of string concerning an
1676
 * element of the structure.
1677
 *
1678
 * One example is the sequence "tbsCertificate" inside an X509
1679
 * certificate.
1680
 *
1681
 * Note that since libtasn1 3.7 the @ider and @ider_len parameters
1682
 * can be omitted, if the element is already decoded using asn1_der_decoding().
1683
 *
1684
 * Returns: %ASN1_SUCCESS if DER encoding OK, %ASN1_ELEMENT_NOT_FOUND
1685
 *   if ELEMENT is %asn1_node EMPTY or @name_element is not a valid
1686
 *   element, %ASN1_TAG_ERROR or %ASN1_DER_ERROR if the der encoding
1687
 *   doesn't match the structure ELEMENT.
1688
 **/
1689
int
1690
asn1_der_decoding_startEnd (asn1_node element, const void *ider, int ider_len,
1691
          const char *name_element, int *start, int *end)
1692
919k
{
1693
919k
  asn1_node node, node_to_find;
1694
919k
  int result = ASN1_DER_ERROR;
1695
1696
919k
  node = element;
1697
1698
919k
  if (node == NULL)
1699
0
    return ASN1_ELEMENT_NOT_FOUND;
1700
1701
919k
  node_to_find = asn1_find_node (node, name_element);
1702
1703
919k
  if (node_to_find == NULL)
1704
922
    return ASN1_ELEMENT_NOT_FOUND;
1705
1706
919k
  *start = node_to_find->start;
1707
919k
  *end = node_to_find->end;
1708
1709
919k
  if (*start == 0 && *end == 0)
1710
0
    {
1711
0
      if (ider == NULL || ider_len == 0)
1712
0
  return ASN1_GENERIC_ERROR;
1713
1714
      /* it seems asn1_der_decoding() wasn't called before. Do it now */
1715
0
      result = asn1_der_decoding (&node, ider, ider_len, NULL);
1716
0
      if (result != ASN1_SUCCESS)
1717
0
  {
1718
0
    warn ();
1719
0
    return result;
1720
0
  }
1721
1722
0
      node_to_find = asn1_find_node (node, name_element);
1723
0
      if (node_to_find == NULL)
1724
0
  return ASN1_ELEMENT_NOT_FOUND;
1725
1726
0
      *start = node_to_find->start;
1727
0
      *end = node_to_find->end;
1728
0
    }
1729
1730
919k
  if (*end < *start)
1731
0
    return ASN1_GENERIC_ERROR;
1732
1733
919k
  return ASN1_SUCCESS;
1734
919k
}
1735
1736
/**
1737
 * asn1_expand_any_defined_by:
1738
 * @definitions: ASN1 definitions
1739
 * @element: pointer to an ASN1 structure
1740
 *
1741
 * Expands every "ANY DEFINED BY" element of a structure created from
1742
 * a DER decoding process (asn1_der_decoding function). The element
1743
 * ANY must be defined by an OBJECT IDENTIFIER. The type used to
1744
 * expand the element ANY is the first one following the definition of
1745
 * the actual value of the OBJECT IDENTIFIER.
1746
 *
1747
 * Returns: %ASN1_SUCCESS if Substitution OK, %ASN1_ERROR_TYPE_ANY if
1748
 *   some "ANY DEFINED BY" element couldn't be expanded due to a
1749
 *   problem in OBJECT_ID -> TYPE association, or other error codes
1750
 *   depending on DER decoding.
1751
 **/
1752
int
1753
asn1_expand_any_defined_by (asn1_node_const definitions, asn1_node *element)
1754
0
{
1755
0
  char name[2 * ASN1_MAX_NAME_SIZE + 2], value[ASN1_MAX_NAME_SIZE];
1756
0
  int retCode = ASN1_SUCCESS, result;
1757
0
  int len, len2, len3;
1758
0
  asn1_node_const p2;
1759
0
  asn1_node p, p3, aux = NULL;
1760
0
  char errorDescription[ASN1_MAX_ERROR_DESCRIPTION_SIZE];
1761
0
  const char *definitionsName;
1762
1763
0
  if ((definitions == NULL) || (*element == NULL))
1764
0
    return ASN1_ELEMENT_NOT_FOUND;
1765
1766
0
  definitionsName = definitions->name;
1767
1768
0
  p = *element;
1769
0
  while (p)
1770
0
    {
1771
1772
0
      switch (type_field (p->type))
1773
0
  {
1774
0
  case ASN1_ETYPE_ANY:
1775
0
    if ((p->type & CONST_DEFINED_BY) && (p->value))
1776
0
      {
1777
        /* search the "DEF_BY" element */
1778
0
        p2 = p->down;
1779
0
        while ((p2) && (type_field (p2->type) != ASN1_ETYPE_CONSTANT))
1780
0
    p2 = p2->right;
1781
1782
0
        if (!p2)
1783
0
    {
1784
0
      retCode = ASN1_ERROR_TYPE_ANY;
1785
0
      break;
1786
0
    }
1787
1788
0
        p3 = _asn1_find_up (p);
1789
1790
0
        if (!p3)
1791
0
    {
1792
0
      retCode = ASN1_ERROR_TYPE_ANY;
1793
0
      break;
1794
0
    }
1795
1796
0
        p3 = p3->down;
1797
0
        while (p3)
1798
0
    {
1799
0
      if (!(strcmp (p3->name, p2->name)))
1800
0
        break;
1801
0
      p3 = p3->right;
1802
0
    }
1803
1804
0
        if ((!p3) || (type_field (p3->type) != ASN1_ETYPE_OBJECT_ID) ||
1805
0
      (p3->value == NULL))
1806
0
    {
1807
1808
0
      p3 = _asn1_find_up (p);
1809
0
      p3 = _asn1_find_up (p3);
1810
1811
0
      if (!p3)
1812
0
        {
1813
0
          retCode = ASN1_ERROR_TYPE_ANY;
1814
0
          break;
1815
0
        }
1816
1817
0
      p3 = p3->down;
1818
1819
0
      while (p3)
1820
0
        {
1821
0
          if (!(strcmp (p3->name, p2->name)))
1822
0
      break;
1823
0
          p3 = p3->right;
1824
0
        }
1825
1826
0
      if ((!p3) || (type_field (p3->type) != ASN1_ETYPE_OBJECT_ID)
1827
0
          || (p3->value == NULL))
1828
0
        {
1829
0
          retCode = ASN1_ERROR_TYPE_ANY;
1830
0
          break;
1831
0
        }
1832
0
    }
1833
1834
        /* search the OBJECT_ID into definitions */
1835
0
        p2 = definitions->down;
1836
0
        while (p2)
1837
0
    {
1838
0
      if ((type_field (p2->type) == ASN1_ETYPE_OBJECT_ID) &&
1839
0
          (p2->type & CONST_ASSIGN))
1840
0
        {
1841
0
          snprintf (name, sizeof (name), "%s.%s", definitionsName,
1842
0
        p2->name);
1843
1844
0
          len = ASN1_MAX_NAME_SIZE;
1845
0
          result =
1846
0
      asn1_read_value (definitions, name, value, &len);
1847
1848
0
          if ((result == ASN1_SUCCESS)
1849
0
        && (!_asn1_strcmp (p3->value, value)))
1850
0
      {
1851
0
        p2 = p2->right; /* pointer to the structure to
1852
               use for expansion */
1853
0
        while ((p2) && (p2->type & CONST_ASSIGN))
1854
0
          p2 = p2->right;
1855
1856
0
        if (p2)
1857
0
          {
1858
0
            snprintf (name, sizeof (name), "%s.%s",
1859
0
          definitionsName, p2->name);
1860
1861
0
            result =
1862
0
        asn1_create_element (definitions, name, &aux);
1863
0
            if (result == ASN1_SUCCESS)
1864
0
        {
1865
0
          _asn1_cpy_name (aux, p);
1866
0
          len2 =
1867
0
            asn1_get_length_der (p->value,
1868
0
               p->value_len, &len3);
1869
0
          if (len2 < 0)
1870
0
            return ASN1_DER_ERROR;
1871
1872
0
          result =
1873
0
            asn1_der_decoding (&aux, p->value + len3,
1874
0
                   len2,
1875
0
                   errorDescription);
1876
0
          if (result == ASN1_SUCCESS)
1877
0
            {
1878
1879
0
              _asn1_set_right (aux, p->right);
1880
0
              _asn1_set_right (p, aux);
1881
1882
0
              result = asn1_delete_structure (&p);
1883
0
              if (result == ASN1_SUCCESS)
1884
0
          {
1885
0
            p = aux;
1886
0
            aux = NULL;
1887
0
            break;
1888
0
          }
1889
0
              else
1890
0
          { /* error with asn1_delete_structure */
1891
0
            asn1_delete_structure (&aux);
1892
0
            retCode = result;
1893
0
            break;
1894
0
          }
1895
0
            }
1896
0
          else
1897
0
            { /* error with asn1_der_decoding */
1898
0
              retCode = result;
1899
0
              break;
1900
0
            }
1901
0
        }
1902
0
            else
1903
0
        { /* error with asn1_create_element */
1904
0
          retCode = result;
1905
0
          break;
1906
0
        }
1907
0
          }
1908
0
        else
1909
0
          { /* error with the pointer to the structure to expand */
1910
0
            retCode = ASN1_ERROR_TYPE_ANY;
1911
0
            break;
1912
0
          }
1913
0
      }
1914
0
        }
1915
0
      p2 = p2->right;
1916
0
    }    /* end while */
1917
1918
0
        if (!p2)
1919
0
    {
1920
0
      retCode = ASN1_ERROR_TYPE_ANY;
1921
0
      break;
1922
0
    }
1923
1924
0
      }
1925
0
    break;
1926
0
  default:
1927
0
    break;
1928
0
  }
1929
1930
1931
0
      if (p->down)
1932
0
  {
1933
0
    p = p->down;
1934
0
  }
1935
0
      else if (p == *element)
1936
0
  {
1937
0
    p = NULL;
1938
0
    break;
1939
0
  }
1940
0
      else if (p->right)
1941
0
  p = p->right;
1942
0
      else
1943
0
  {
1944
0
    while (1)
1945
0
      {
1946
0
        p = _asn1_find_up (p);
1947
0
        if (p == *element)
1948
0
    {
1949
0
      p = NULL;
1950
0
      break;
1951
0
    }
1952
0
        if (p->right)
1953
0
    {
1954
0
      p = p->right;
1955
0
      break;
1956
0
    }
1957
0
      }
1958
0
  }
1959
0
    }
1960
1961
0
  return retCode;
1962
0
}
1963
1964
/**
1965
 * asn1_expand_octet_string:
1966
 * @definitions: ASN1 definitions
1967
 * @element: pointer to an ASN1 structure
1968
 * @octetName: name of the OCTET STRING field to expand.
1969
 * @objectName: name of the OBJECT IDENTIFIER field to use to define
1970
 *    the type for expansion.
1971
 *
1972
 * Expands an "OCTET STRING" element of a structure created from a DER
1973
 * decoding process (the asn1_der_decoding() function).  The type used
1974
 * for expansion is the first one following the definition of the
1975
 * actual value of the OBJECT IDENTIFIER indicated by OBJECTNAME.
1976
 *
1977
 * Returns: %ASN1_SUCCESS if substitution OK, %ASN1_ELEMENT_NOT_FOUND
1978
 *   if @objectName or @octetName are not correct,
1979
 *   %ASN1_VALUE_NOT_VALID if it wasn't possible to find the type to
1980
 *   use for expansion, or other errors depending on DER decoding.
1981
 **/
1982
int
1983
asn1_expand_octet_string (asn1_node_const definitions, asn1_node *element,
1984
        const char *octetName, const char *objectName)
1985
0
{
1986
0
  char name[2 * ASN1_MAX_NAME_SIZE + 1], value[ASN1_MAX_NAME_SIZE];
1987
0
  int retCode = ASN1_SUCCESS, result;
1988
0
  int len, len2, len3;
1989
0
  asn1_node_const p2;
1990
0
  asn1_node aux = NULL;
1991
0
  asn1_node octetNode = NULL, objectNode = NULL;
1992
0
  char errorDescription[ASN1_MAX_ERROR_DESCRIPTION_SIZE];
1993
1994
0
  if ((definitions == NULL) || (*element == NULL))
1995
0
    return ASN1_ELEMENT_NOT_FOUND;
1996
1997
0
  octetNode = asn1_find_node (*element, octetName);
1998
0
  if (octetNode == NULL)
1999
0
    return ASN1_ELEMENT_NOT_FOUND;
2000
0
  if (type_field (octetNode->type) != ASN1_ETYPE_OCTET_STRING)
2001
0
    return ASN1_ELEMENT_NOT_FOUND;
2002
0
  if (octetNode->value == NULL)
2003
0
    return ASN1_VALUE_NOT_FOUND;
2004
2005
0
  objectNode = asn1_find_node (*element, objectName);
2006
0
  if (objectNode == NULL)
2007
0
    return ASN1_ELEMENT_NOT_FOUND;
2008
2009
0
  if (type_field (objectNode->type) != ASN1_ETYPE_OBJECT_ID)
2010
0
    return ASN1_ELEMENT_NOT_FOUND;
2011
2012
0
  if (objectNode->value == NULL)
2013
0
    return ASN1_VALUE_NOT_FOUND;
2014
2015
2016
  /* search the OBJECT_ID into definitions */
2017
0
  p2 = definitions->down;
2018
0
  while (p2)
2019
0
    {
2020
0
      if ((type_field (p2->type) == ASN1_ETYPE_OBJECT_ID) &&
2021
0
    (p2->type & CONST_ASSIGN))
2022
0
  {
2023
0
    strcpy (name, definitions->name);
2024
0
    strcat (name, ".");
2025
0
    strcat (name, p2->name);
2026
2027
0
    len = sizeof (value);
2028
0
    result = asn1_read_value (definitions, name, value, &len);
2029
2030
0
    if ((result == ASN1_SUCCESS)
2031
0
        && (!_asn1_strcmp (objectNode->value, value)))
2032
0
      {
2033
2034
0
        p2 = p2->right; /* pointer to the structure to
2035
           use for expansion */
2036
0
        while ((p2) && (p2->type & CONST_ASSIGN))
2037
0
    p2 = p2->right;
2038
2039
0
        if (p2)
2040
0
    {
2041
0
      strcpy (name, definitions->name);
2042
0
      strcat (name, ".");
2043
0
      strcat (name, p2->name);
2044
2045
0
      result = asn1_create_element (definitions, name, &aux);
2046
0
      if (result == ASN1_SUCCESS)
2047
0
        {
2048
0
          _asn1_cpy_name (aux, octetNode);
2049
0
          len2 =
2050
0
      asn1_get_length_der (octetNode->value,
2051
0
               octetNode->value_len, &len3);
2052
0
          if (len2 < 0)
2053
0
      return ASN1_DER_ERROR;
2054
2055
0
          result =
2056
0
      asn1_der_decoding (&aux, octetNode->value + len3,
2057
0
             len2, errorDescription);
2058
0
          if (result == ASN1_SUCCESS)
2059
0
      {
2060
2061
0
        _asn1_set_right (aux, octetNode->right);
2062
0
        _asn1_set_right (octetNode, aux);
2063
2064
0
        result = asn1_delete_structure (&octetNode);
2065
0
        if (result == ASN1_SUCCESS)
2066
0
          {
2067
0
            aux = NULL;
2068
0
            break;
2069
0
          }
2070
0
        else
2071
0
          { /* error with asn1_delete_structure */
2072
0
            asn1_delete_structure (&aux);
2073
0
            retCode = result;
2074
0
            break;
2075
0
          }
2076
0
      }
2077
0
          else
2078
0
      { /* error with asn1_der_decoding */
2079
0
        retCode = result;
2080
0
        break;
2081
0
      }
2082
0
        }
2083
0
      else
2084
0
        {   /* error with asn1_create_element */
2085
0
          retCode = result;
2086
0
          break;
2087
0
        }
2088
0
    }
2089
0
        else
2090
0
    {   /* error with the pointer to the structure to expand */
2091
0
      retCode = ASN1_VALUE_NOT_VALID;
2092
0
      break;
2093
0
    }
2094
0
      }
2095
0
  }
2096
2097
0
      p2 = p2->right;
2098
2099
0
    }
2100
2101
0
  if (!p2)
2102
0
    retCode = ASN1_VALUE_NOT_VALID;
2103
2104
0
  return retCode;
2105
0
}
2106
2107
/*-
2108
 * _asn1_decode_simple_der:
2109
 * @etype: The type of the string to be encoded (ASN1_ETYPE_)
2110
 * @der: the encoded string
2111
 * @_der_len: the bytes of the encoded string
2112
 * @str: a pointer to the data
2113
 * @str_len: the length of the data
2114
 * @dflags: DECODE_FLAG_*
2115
 *
2116
 * Decodes a simple DER encoded type (e.g. a string, which is not constructed).
2117
 * The output is a pointer inside the @der.
2118
 *
2119
 * Returns: %ASN1_SUCCESS if successful or an error value.
2120
 -*/
2121
static int
2122
_asn1_decode_simple_der (unsigned int etype, const unsigned char *der,
2123
       unsigned int _der_len, const unsigned char **str,
2124
       unsigned int *str_len, unsigned dflags)
2125
199k
{
2126
199k
  int tag_len, len_len;
2127
199k
  const unsigned char *p;
2128
199k
  int der_len = _der_len;
2129
199k
  unsigned char class;
2130
199k
  unsigned long tag;
2131
199k
  long ret;
2132
2133
199k
  if (der == NULL || der_len == 0)
2134
0
    return ASN1_VALUE_NOT_VALID;
2135
2136
199k
  if (ETYPE_OK (etype) == 0 || ETYPE_IS_STRING (etype) == 0)
2137
0
    return ASN1_VALUE_NOT_VALID;
2138
2139
  /* doesn't handle constructed classes */
2140
199k
  class = ETYPE_CLASS (etype);
2141
199k
  if (class != ASN1_CLASS_UNIVERSAL)
2142
0
    return ASN1_VALUE_NOT_VALID;
2143
2144
199k
  p = der;
2145
2146
199k
  if (dflags & DECODE_FLAG_HAVE_TAG)
2147
199k
    {
2148
199k
      ret = asn1_get_tag_der (p, der_len, &class, &tag_len, &tag);
2149
199k
      if (ret != ASN1_SUCCESS)
2150
0
  return ret;
2151
2152
199k
      if (class != ETYPE_CLASS (etype) || tag != ETYPE_TAG (etype))
2153
5.53k
  {
2154
5.53k
    warn ();
2155
5.53k
    return ASN1_DER_ERROR;
2156
5.53k
  }
2157
2158
194k
      p += tag_len;
2159
194k
      der_len -= tag_len;
2160
194k
      if (der_len <= 0)
2161
20
  return ASN1_DER_ERROR;
2162
194k
    }
2163
2164
194k
  ret = asn1_get_length_der (p, der_len, &len_len);
2165
194k
  if (ret < 0)
2166
354
    return ASN1_DER_ERROR;
2167
2168
193k
  p += len_len;
2169
193k
  der_len -= len_len;
2170
193k
  if (der_len <= 0)
2171
82
    return ASN1_DER_ERROR;
2172
2173
193k
  *str_len = ret;
2174
193k
  *str = p;
2175
2176
193k
  return ASN1_SUCCESS;
2177
193k
}
2178
2179
/**
2180
 * asn1_decode_simple_der:
2181
 * @etype: The type of the string to be encoded (ASN1_ETYPE_)
2182
 * @der: the encoded string
2183
 * @_der_len: the bytes of the encoded string
2184
 * @str: a pointer to the data
2185
 * @str_len: the length of the data
2186
 *
2187
 * Decodes a simple DER encoded type (e.g. a string, which is not constructed).
2188
 * The output is a pointer inside the @der.
2189
 *
2190
 * Returns: %ASN1_SUCCESS if successful or an error value.
2191
 **/
2192
int
2193
asn1_decode_simple_der (unsigned int etype, const unsigned char *der,
2194
      unsigned int _der_len, const unsigned char **str,
2195
      unsigned int *str_len)
2196
13.9k
{
2197
13.9k
  return _asn1_decode_simple_der (etype, der, _der_len, str, str_len,
2198
13.9k
          DECODE_FLAG_HAVE_TAG);
2199
13.9k
}
2200
2201
static int
2202
append (uint8_t **dst, unsigned *dst_size, const unsigned char *src,
2203
  unsigned src_size)
2204
329k
{
2205
329k
  if (src_size == 0)
2206
26.7k
    return ASN1_SUCCESS;
2207
2208
302k
  *dst = _asn1_realloc (*dst, *dst_size + src_size);
2209
302k
  if (*dst == NULL)
2210
0
    return ASN1_MEM_ALLOC_ERROR;
2211
302k
  memcpy (*dst + *dst_size, src, src_size);
2212
302k
  *dst_size += src_size;
2213
302k
  return ASN1_SUCCESS;
2214
302k
}
2215
2216
/*-
2217
 * _asn1_decode_simple_ber:
2218
 * @etype: The type of the string to be encoded (ASN1_ETYPE_)
2219
 * @der: the encoded string
2220
 * @_der_len: the bytes of the encoded string
2221
 * @str: a pointer to the data
2222
 * @str_len: the length of the data
2223
 * @ber_len: the total length occupied by BER (may be %NULL)
2224
 * @have_tag: whether a DER tag is included
2225
 *
2226
 * Decodes a BER encoded type. The output is an allocated value
2227
 * of the data. This decodes BER STRINGS only. Other types are
2228
 * decoded as DER.
2229
 *
2230
 * Returns: %ASN1_SUCCESS if successful or an error value.
2231
 -*/
2232
static int
2233
_asn1_decode_simple_ber (unsigned int etype, const unsigned char *der,
2234
       unsigned int _der_len, unsigned char **str,
2235
       unsigned int *str_len, unsigned int *ber_len,
2236
       unsigned dflags)
2237
198k
{
2238
198k
  int tag_len, len_len;
2239
198k
  const unsigned char *p;
2240
198k
  int der_len = _der_len;
2241
198k
  uint8_t *total = NULL;
2242
198k
  unsigned total_size = 0;
2243
198k
  unsigned char class;
2244
198k
  unsigned long tag;
2245
198k
  unsigned char *out = NULL;
2246
198k
  const unsigned char *cout = NULL;
2247
198k
  unsigned out_len;
2248
198k
  long result;
2249
2250
198k
  if (ber_len)
2251
149k
    *ber_len = 0;
2252
2253
198k
  if (der == NULL || der_len == 0)
2254
27
    {
2255
27
      warn ();
2256
27
      return ASN1_VALUE_NOT_VALID;
2257
27
    }
2258
2259
198k
  if (ETYPE_OK (etype) == 0)
2260
0
    {
2261
0
      warn ();
2262
0
      return ASN1_VALUE_NOT_VALID;
2263
0
    }
2264
2265
  /* doesn't handle constructed + definite classes */
2266
198k
  class = ETYPE_CLASS (etype);
2267
198k
  if (class != ASN1_CLASS_UNIVERSAL)
2268
0
    {
2269
0
      warn ();
2270
0
      return ASN1_VALUE_NOT_VALID;
2271
0
    }
2272
2273
198k
  p = der;
2274
2275
198k
  if (dflags & DECODE_FLAG_HAVE_TAG)
2276
194k
    {
2277
194k
      result = asn1_get_tag_der (p, der_len, &class, &tag_len, &tag);
2278
194k
      if (result != ASN1_SUCCESS)
2279
145
  {
2280
145
    warn ();
2281
145
    return result;
2282
145
  }
2283
2284
194k
      if (tag != ETYPE_TAG (etype))
2285
1.10k
  {
2286
1.10k
    warn ();
2287
1.10k
    return ASN1_DER_ERROR;
2288
1.10k
  }
2289
2290
193k
      p += tag_len;
2291
2292
193k
      DECR_LEN (der_len, tag_len);
2293
2294
193k
      if (ber_len)
2295
145k
  *ber_len += tag_len;
2296
193k
    }
2297
2298
  /* indefinite constructed */
2299
197k
  if ((((dflags & DECODE_FLAG_CONSTRUCTED) || class == ASN1_CLASS_STRUCTURED)
2300
197k
       && ETYPE_IS_STRING (etype)) && !(dflags & DECODE_FLAG_LEVEL3))
2301
10.8k
    {
2302
10.8k
      if (der_len == 0)
2303
8
  {
2304
8
    warn ();
2305
8
    result = ASN1_DER_ERROR;
2306
8
    goto cleanup;
2307
8
  }
2308
2309
10.8k
      if (der_len > 0 && p[0] == 0x80)  /* indefinite */
2310
2.37k
  {
2311
2.37k
    len_len = 1;
2312
2.37k
    DECR_LEN (der_len, len_len);
2313
2.37k
    p += len_len;
2314
2315
2.37k
    if (ber_len)
2316
1.61k
      *ber_len += len_len;
2317
2318
    /* decode the available octet strings */
2319
2.37k
    do
2320
140k
      {
2321
140k
        unsigned tmp_len;
2322
140k
        unsigned flags = DECODE_FLAG_HAVE_TAG;
2323
2324
140k
        if (dflags & DECODE_FLAG_LEVEL1)
2325
32.2k
    flags |= DECODE_FLAG_LEVEL2;
2326
108k
        else if (dflags & DECODE_FLAG_LEVEL2)
2327
1.20k
    flags |= DECODE_FLAG_LEVEL3;
2328
106k
        else
2329
106k
    flags |= DECODE_FLAG_LEVEL1;
2330
2331
140k
        result =
2332
140k
    _asn1_decode_simple_ber (etype, p, der_len, &out, &out_len,
2333
140k
           &tmp_len, flags);
2334
140k
        if (result != ASN1_SUCCESS)
2335
1.06k
    {
2336
1.06k
      warn ();
2337
1.06k
      goto cleanup;
2338
1.06k
    }
2339
2340
139k
        p += tmp_len;
2341
139k
        DECR_LEN (der_len, tmp_len);
2342
2343
139k
        if (ber_len)
2344
126k
    *ber_len += tmp_len;
2345
2346
139k
        DECR_LEN (der_len, 2); /* we need the EOC */
2347
2348
139k
        result = append (&total, &total_size, out, out_len);
2349
139k
        if (result != ASN1_SUCCESS)
2350
0
    {
2351
0
      warn ();
2352
0
      goto cleanup;
2353
0
    }
2354
2355
139k
        free (out);
2356
139k
        out = NULL;
2357
2358
139k
        if (p[0] == 0 && p[1] == 0)  /* EOC */
2359
1.17k
    {
2360
1.17k
      if (ber_len)
2361
891
        *ber_len += 2;
2362
1.17k
      break;
2363
1.17k
    }
2364
2365
        /* no EOC */
2366
138k
        der_len += 2;
2367
2368
138k
        if (der_len == 2)
2369
51
    {
2370
51
      warn ();
2371
51
      result = ASN1_DER_ERROR;
2372
51
      goto cleanup;
2373
51
    }
2374
138k
      }
2375
138k
    while (1);
2376
2.37k
  }
2377
8.44k
      else      /* constructed */
2378
8.44k
  {
2379
8.44k
    long const_len;
2380
2381
8.44k
    result = asn1_get_length_ber (p, der_len, &len_len);
2382
8.44k
    if (result < 0)
2383
330
      {
2384
330
        warn ();
2385
330
        result = ASN1_DER_ERROR;
2386
330
        goto cleanup;
2387
330
      }
2388
2389
8.11k
    DECR_LEN (der_len, len_len);
2390
8.11k
    p += len_len;
2391
2392
8.11k
    const_len = result;
2393
2394
8.11k
    if (ber_len)
2395
7.90k
      *ber_len += len_len;
2396
2397
    /* decode the available octet strings */
2398
12.7k
    while (const_len > 0)
2399
5.55k
      {
2400
5.55k
        unsigned tmp_len;
2401
5.55k
        unsigned flags = DECODE_FLAG_HAVE_TAG;
2402
2403
5.55k
        if (dflags & DECODE_FLAG_LEVEL1)
2404
2.16k
    flags |= DECODE_FLAG_LEVEL2;
2405
3.39k
        else if (dflags & DECODE_FLAG_LEVEL2)
2406
992
    flags |= DECODE_FLAG_LEVEL3;
2407
2.39k
        else
2408
2.39k
    flags |= DECODE_FLAG_LEVEL1;
2409
2410
5.55k
        result =
2411
5.55k
    _asn1_decode_simple_ber (etype, p, der_len, &out, &out_len,
2412
5.55k
           &tmp_len, flags);
2413
5.55k
        if (result != ASN1_SUCCESS)
2414
778
    {
2415
778
      warn ();
2416
778
      goto cleanup;
2417
778
    }
2418
2419
4.78k
        p += tmp_len;
2420
4.78k
        DECR_LEN (der_len, tmp_len);
2421
4.78k
        DECR_LEN (const_len, tmp_len);
2422
2423
4.64k
        if (ber_len)
2424
3.92k
    *ber_len += tmp_len;
2425
2426
4.64k
        result = append (&total, &total_size, out, out_len);
2427
4.64k
        if (result != ASN1_SUCCESS)
2428
0
    {
2429
0
      warn ();
2430
0
      goto cleanup;
2431
0
    }
2432
2433
4.64k
        free (out);
2434
4.64k
        out = NULL;
2435
4.64k
      }
2436
8.11k
  }
2437
10.8k
    }
2438
186k
  else if (class == ETYPE_CLASS (etype))
2439
186k
    {
2440
186k
      if (ber_len)
2441
139k
  {
2442
139k
    result = asn1_get_length_der (p, der_len, &len_len);
2443
139k
    if (result < 0)
2444
326
      {
2445
326
        warn ();
2446
326
        result = ASN1_DER_ERROR;
2447
326
        goto cleanup;
2448
326
      }
2449
138k
    *ber_len += result + len_len;
2450
138k
  }
2451
2452
      /* non-string values are decoded as DER */
2453
185k
      result =
2454
185k
  _asn1_decode_simple_der (etype, der, _der_len, &cout, &out_len,
2455
185k
         dflags);
2456
185k
      if (result != ASN1_SUCCESS)
2457
284
  {
2458
284
    warn ();
2459
284
    goto cleanup;
2460
284
  }
2461
2462
185k
      result = append (&total, &total_size, cout, out_len);
2463
185k
      if (result != ASN1_SUCCESS)
2464
0
  {
2465
0
    warn ();
2466
0
    goto cleanup;
2467
0
  }
2468
185k
    }
2469
94
  else
2470
94
    {
2471
94
      warn ();
2472
94
      result = ASN1_DER_ERROR;
2473
94
      goto cleanup;
2474
94
    }
2475
2476
193k
  *str = total;
2477
193k
  *str_len = total_size;
2478
2479
193k
  return ASN1_SUCCESS;
2480
3.15k
cleanup:
2481
3.15k
  free (out);
2482
3.15k
  free (total);
2483
3.15k
  return result;
2484
197k
}
2485
2486
/**
2487
 * asn1_decode_simple_ber:
2488
 * @etype: The type of the string to be encoded (ASN1_ETYPE_)
2489
 * @der: the encoded string
2490
 * @_der_len: the bytes of the encoded string
2491
 * @str: a pointer to the data
2492
 * @str_len: the length of the data
2493
 * @ber_len: the total length occupied by BER (may be %NULL)
2494
 *
2495
 * Decodes a BER encoded type. The output is an allocated value
2496
 * of the data. This decodes BER STRINGS only. Other types are
2497
 * decoded as DER.
2498
 *
2499
 * Returns: %ASN1_SUCCESS if successful or an error value.
2500
 **/
2501
int
2502
asn1_decode_simple_ber (unsigned int etype, const unsigned char *der,
2503
      unsigned int _der_len, unsigned char **str,
2504
      unsigned int *str_len, unsigned int *ber_len)
2505
48.3k
{
2506
48.3k
  return _asn1_decode_simple_ber (etype, der, _der_len, str, str_len, ber_len,
2507
48.3k
          DECODE_FLAG_HAVE_TAG);
2508
48.3k
}