Coverage Report

Created: 2022-10-16 06:45

/src/openssl/crypto/asn1/x_name.c
Line
Count
Source (jump to first uncovered line)
1
/* crypto/asn1/x_name.c */
2
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3
 * All rights reserved.
4
 *
5
 * This package is an SSL implementation written
6
 * by Eric Young (eay@cryptsoft.com).
7
 * The implementation was written so as to conform with Netscapes SSL.
8
 *
9
 * This library is free for commercial and non-commercial use as long as
10
 * the following conditions are aheared to.  The following conditions
11
 * apply to all code found in this distribution, be it the RC4, RSA,
12
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
13
 * included with this distribution is covered by the same copyright terms
14
 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
15
 *
16
 * Copyright remains Eric Young's, and as such any Copyright notices in
17
 * the code are not to be removed.
18
 * If this package is used in a product, Eric Young should be given attribution
19
 * as the author of the parts of the library used.
20
 * This can be in the form of a textual message at program startup or
21
 * in documentation (online or textual) provided with the package.
22
 *
23
 * Redistribution and use in source and binary forms, with or without
24
 * modification, are permitted provided that the following conditions
25
 * are met:
26
 * 1. Redistributions of source code must retain the copyright
27
 *    notice, this list of conditions and the following disclaimer.
28
 * 2. Redistributions in binary form must reproduce the above copyright
29
 *    notice, this list of conditions and the following disclaimer in the
30
 *    documentation and/or other materials provided with the distribution.
31
 * 3. All advertising materials mentioning features or use of this software
32
 *    must display the following acknowledgement:
33
 *    "This product includes cryptographic software written by
34
 *     Eric Young (eay@cryptsoft.com)"
35
 *    The word 'cryptographic' can be left out if the rouines from the library
36
 *    being used are not cryptographic related :-).
37
 * 4. If you include any Windows specific code (or a derivative thereof) from
38
 *    the apps directory (application code) you must include an acknowledgement:
39
 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40
 *
41
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
51
 * SUCH DAMAGE.
52
 *
53
 * The licence and distribution terms for any publically available version or
54
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
55
 * copied and put under another distribution licence
56
 * [including the GNU Public Licence.]
57
 */
58
59
#include <stdio.h>
60
#include <ctype.h>
61
#include "cryptlib.h"
62
#include <openssl/asn1t.h>
63
#include <openssl/x509.h>
64
#include "asn1_locl.h"
65
66
typedef STACK_OF(X509_NAME_ENTRY) STACK_OF_X509_NAME_ENTRY;
67
DECLARE_STACK_OF(STACK_OF_X509_NAME_ENTRY)
68
69
/*
70
 * Maximum length of X509_NAME: much larger than anything we should
71
 * ever see in practice.
72
 */
73
74
6.77M
#define X509_NAME_MAX (1024 * 1024)
75
76
static int x509_name_ex_d2i(ASN1_VALUE **val,
77
                            const unsigned char **in, long len,
78
                            const ASN1_ITEM *it,
79
                            int tag, int aclass, char opt, ASN1_TLC *ctx);
80
81
static int x509_name_ex_i2d(ASN1_VALUE **val, unsigned char **out,
82
                            const ASN1_ITEM *it, int tag, int aclass);
83
static int x509_name_ex_new(ASN1_VALUE **val, const ASN1_ITEM *it);
84
static void x509_name_ex_free(ASN1_VALUE **val, const ASN1_ITEM *it);
85
86
static int x509_name_encode(X509_NAME *a);
87
static int x509_name_canon(X509_NAME *a);
88
static int asn1_string_canon(ASN1_STRING *out, ASN1_STRING *in);
89
static int i2d_name_canon(STACK_OF(STACK_OF_X509_NAME_ENTRY) * intname,
90
                          unsigned char **in);
91
92
static int x509_name_ex_print(BIO *out, ASN1_VALUE **pval,
93
                              int indent,
94
                              const char *fname, const ASN1_PCTX *pctx);
95
96
ASN1_SEQUENCE(X509_NAME_ENTRY) = {
97
        ASN1_SIMPLE(X509_NAME_ENTRY, object, ASN1_OBJECT),
98
        ASN1_SIMPLE(X509_NAME_ENTRY, value, ASN1_PRINTABLE)
99
} ASN1_SEQUENCE_END(X509_NAME_ENTRY)
100
101
IMPLEMENT_ASN1_FUNCTIONS(X509_NAME_ENTRY)
102
IMPLEMENT_ASN1_DUP_FUNCTION(X509_NAME_ENTRY)
103
104
/*
105
 * For the "Name" type we need a SEQUENCE OF { SET OF X509_NAME_ENTRY } so
106
 * declare two template wrappers for this
107
 */
108
109
ASN1_ITEM_TEMPLATE(X509_NAME_ENTRIES) =
110
        ASN1_EX_TEMPLATE_TYPE(ASN1_TFLG_SET_OF, 0, RDNS, X509_NAME_ENTRY)
111
ASN1_ITEM_TEMPLATE_END(X509_NAME_ENTRIES)
112
113
ASN1_ITEM_TEMPLATE(X509_NAME_INTERNAL) =
114
        ASN1_EX_TEMPLATE_TYPE(ASN1_TFLG_SEQUENCE_OF, 0, Name, X509_NAME_ENTRIES)
115
ASN1_ITEM_TEMPLATE_END(X509_NAME_INTERNAL)
116
117
/*
118
 * Normally that's where it would end: we'd have two nested STACK structures
119
 * representing the ASN1. Unfortunately X509_NAME uses a completely different
120
 * form and caches encodings so we have to process the internal form and
121
 * convert to the external form.
122
 */
123
124
const ASN1_EXTERN_FUNCS x509_name_ff = {
125
    NULL,
126
    x509_name_ex_new,
127
    x509_name_ex_free,
128
    0,                          /* Default clear behaviour is OK */
129
    x509_name_ex_d2i,
130
    x509_name_ex_i2d,
131
    x509_name_ex_print
132
};
133
134
IMPLEMENT_EXTERN_ASN1(X509_NAME, V_ASN1_SEQUENCE, x509_name_ff)
135
136
IMPLEMENT_ASN1_FUNCTIONS(X509_NAME)
137
138
IMPLEMENT_ASN1_DUP_FUNCTION(X509_NAME)
139
140
static int x509_name_ex_new(ASN1_VALUE **val, const ASN1_ITEM *it)
141
13.5M
{
142
13.5M
    X509_NAME *ret = NULL;
143
13.5M
    ret = OPENSSL_malloc(sizeof(X509_NAME));
144
13.5M
    if (!ret)
145
0
        goto memerr;
146
13.5M
    if ((ret->entries = sk_X509_NAME_ENTRY_new_null()) == NULL)
147
0
        goto memerr;
148
13.5M
    if ((ret->bytes = BUF_MEM_new()) == NULL)
149
0
        goto memerr;
150
13.5M
    ret->canon_enc = NULL;
151
13.5M
    ret->canon_enclen = 0;
152
13.5M
    ret->modified = 1;
153
13.5M
    *val = (ASN1_VALUE *)ret;
154
13.5M
    return 1;
155
156
0
 memerr:
157
0
    ASN1err(ASN1_F_X509_NAME_EX_NEW, ERR_R_MALLOC_FAILURE);
158
0
    if (ret) {
159
0
        if (ret->entries)
160
0
            sk_X509_NAME_ENTRY_free(ret->entries);
161
0
        OPENSSL_free(ret);
162
0
    }
163
0
    return 0;
164
13.5M
}
165
166
static void x509_name_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it)
167
13.5M
{
168
13.5M
    X509_NAME *a;
169
13.5M
    if (!pval || !*pval)
170
0
        return;
171
13.5M
    a = (X509_NAME *)*pval;
172
173
13.5M
    BUF_MEM_free(a->bytes);
174
13.5M
    sk_X509_NAME_ENTRY_pop_free(a->entries, X509_NAME_ENTRY_free);
175
13.5M
    if (a->canon_enc)
176
6.77M
        OPENSSL_free(a->canon_enc);
177
13.5M
    OPENSSL_free(a);
178
13.5M
    *pval = NULL;
179
13.5M
}
180
181
static void local_sk_X509_NAME_ENTRY_free(STACK_OF(X509_NAME_ENTRY) *ne)
182
25.5M
{
183
25.5M
    sk_X509_NAME_ENTRY_free(ne);
184
25.5M
}
185
186
static void local_sk_X509_NAME_ENTRY_pop_free(STACK_OF(X509_NAME_ENTRY) *ne)
187
25.5M
{
188
25.5M
    sk_X509_NAME_ENTRY_pop_free(ne, X509_NAME_ENTRY_free);
189
25.5M
}
190
191
static int x509_name_ex_d2i(ASN1_VALUE **val,
192
                            const unsigned char **in, long len,
193
                            const ASN1_ITEM *it, int tag, int aclass,
194
                            char opt, ASN1_TLC *ctx)
195
6.77M
{
196
6.77M
    const unsigned char *p = *in, *q;
197
6.77M
    union {
198
6.77M
        STACK_OF(STACK_OF_X509_NAME_ENTRY) *s;
199
6.77M
        ASN1_VALUE *a;
200
6.77M
    } intname = {
201
6.77M
        NULL
202
6.77M
    };
203
6.77M
    union {
204
6.77M
        X509_NAME *x;
205
6.77M
        ASN1_VALUE *a;
206
6.77M
    } nm = {
207
6.77M
        NULL
208
6.77M
    };
209
6.77M
    int i, j, ret;
210
6.77M
    STACK_OF(X509_NAME_ENTRY) *entries;
211
6.77M
    X509_NAME_ENTRY *entry;
212
6.77M
    if (len > X509_NAME_MAX)
213
0
        len = X509_NAME_MAX;
214
6.77M
    q = p;
215
216
    /* Get internal representation of Name */
217
6.77M
    ret = ASN1_item_ex_d2i(&intname.a,
218
6.77M
                           &p, len, ASN1_ITEM_rptr(X509_NAME_INTERNAL),
219
6.77M
                           tag, aclass, opt, ctx);
220
221
6.77M
    if (ret <= 0)
222
0
        return ret;
223
224
6.77M
    if (*val)
225
6.77M
        x509_name_ex_free(val, NULL);
226
6.77M
    if (!x509_name_ex_new(&nm.a, NULL))
227
0
        goto err;
228
    /* We've decoded it: now cache encoding */
229
6.77M
    if (!BUF_MEM_grow(nm.x->bytes, p - q))
230
0
        goto err;
231
6.77M
    memcpy(nm.x->bytes->data, q, p - q);
232
233
    /* Convert internal representation to X509_NAME structure */
234
32.2M
    for (i = 0; i < sk_STACK_OF_X509_NAME_ENTRY_num(intname.s); i++) {
235
25.5M
        entries = sk_STACK_OF_X509_NAME_ENTRY_value(intname.s, i);
236
51.0M
        for (j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) {
237
25.5M
            entry = sk_X509_NAME_ENTRY_value(entries, j);
238
25.5M
            entry->set = i;
239
25.5M
            if (!sk_X509_NAME_ENTRY_push(nm.x->entries, entry))
240
0
                goto err;
241
25.5M
            sk_X509_NAME_ENTRY_set(entries, j, NULL);
242
25.5M
        }
243
25.5M
    }
244
6.77M
    ret = x509_name_canon(nm.x);
245
6.77M
    if (!ret)
246
0
        goto err;
247
6.77M
    sk_STACK_OF_X509_NAME_ENTRY_pop_free(intname.s,
248
6.77M
                                         local_sk_X509_NAME_ENTRY_free);
249
6.77M
    nm.x->modified = 0;
250
6.77M
    *val = nm.a;
251
6.77M
    *in = p;
252
6.77M
    return ret;
253
0
 err:
254
0
    if (nm.x != NULL)
255
0
        X509_NAME_free(nm.x);
256
0
    sk_STACK_OF_X509_NAME_ENTRY_pop_free(intname.s,
257
0
                                         local_sk_X509_NAME_ENTRY_pop_free);
258
0
    ASN1err(ASN1_F_X509_NAME_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
259
0
    return 0;
260
6.77M
}
261
262
static int x509_name_ex_i2d(ASN1_VALUE **val, unsigned char **out,
263
                            const ASN1_ITEM *it, int tag, int aclass)
264
0
{
265
0
    int ret;
266
0
    X509_NAME *a = (X509_NAME *)*val;
267
0
    if (a->modified) {
268
0
        ret = x509_name_encode(a);
269
0
        if (ret < 0)
270
0
            return ret;
271
0
        ret = x509_name_canon(a);
272
0
        if (ret < 0)
273
0
            return ret;
274
0
    }
275
0
    ret = a->bytes->length;
276
0
    if (out != NULL) {
277
0
        memcpy(*out, a->bytes->data, ret);
278
0
        *out += ret;
279
0
    }
280
0
    return ret;
281
0
}
282
283
static int x509_name_encode(X509_NAME *a)
284
0
{
285
0
    union {
286
0
        STACK_OF(STACK_OF_X509_NAME_ENTRY) *s;
287
0
        ASN1_VALUE *a;
288
0
    } intname = {
289
0
        NULL
290
0
    };
291
0
    int len;
292
0
    unsigned char *p;
293
0
    STACK_OF(X509_NAME_ENTRY) *entries = NULL;
294
0
    X509_NAME_ENTRY *entry;
295
0
    int i, set = -1;
296
0
    intname.s = sk_STACK_OF_X509_NAME_ENTRY_new_null();
297
0
    if (!intname.s)
298
0
        goto memerr;
299
0
    for (i = 0; i < sk_X509_NAME_ENTRY_num(a->entries); i++) {
300
0
        entry = sk_X509_NAME_ENTRY_value(a->entries, i);
301
0
        if (entry->set != set) {
302
0
            entries = sk_X509_NAME_ENTRY_new_null();
303
0
            if (!entries)
304
0
                goto memerr;
305
0
            if (!sk_STACK_OF_X509_NAME_ENTRY_push(intname.s, entries)) {
306
0
                sk_X509_NAME_ENTRY_free(entries);
307
0
                goto memerr;
308
0
            }
309
0
            set = entry->set;
310
0
        }
311
0
        if (!sk_X509_NAME_ENTRY_push(entries, entry))
312
0
            goto memerr;
313
0
    }
314
0
    len = ASN1_item_ex_i2d(&intname.a, NULL,
315
0
                           ASN1_ITEM_rptr(X509_NAME_INTERNAL), -1, -1);
316
0
    if (!BUF_MEM_grow(a->bytes, len))
317
0
        goto memerr;
318
0
    p = (unsigned char *)a->bytes->data;
319
0
    ASN1_item_ex_i2d(&intname.a,
320
0
                     &p, ASN1_ITEM_rptr(X509_NAME_INTERNAL), -1, -1);
321
0
    sk_STACK_OF_X509_NAME_ENTRY_pop_free(intname.s,
322
0
                                         local_sk_X509_NAME_ENTRY_free);
323
0
    a->modified = 0;
324
0
    return len;
325
0
 memerr:
326
0
    sk_STACK_OF_X509_NAME_ENTRY_pop_free(intname.s,
327
0
                                         local_sk_X509_NAME_ENTRY_free);
328
0
    ASN1err(ASN1_F_X509_NAME_ENCODE, ERR_R_MALLOC_FAILURE);
329
0
    return -1;
330
0
}
331
332
static int x509_name_ex_print(BIO *out, ASN1_VALUE **pval,
333
                              int indent,
334
                              const char *fname, const ASN1_PCTX *pctx)
335
0
{
336
0
    if (X509_NAME_print_ex(out, (X509_NAME *)*pval,
337
0
                           indent, pctx->nm_flags) <= 0)
338
0
        return 0;
339
0
    return 2;
340
0
}
341
342
/*
343
 * This function generates the canonical encoding of the Name structure. In
344
 * it all strings are converted to UTF8, leading, trailing and multiple
345
 * spaces collapsed, converted to lower case and the leading SEQUENCE header
346
 * removed. In future we could also normalize the UTF8 too. By doing this
347
 * comparison of Name structures can be rapidly perfomed by just using
348
 * memcmp() of the canonical encoding. By omitting the leading SEQUENCE name
349
 * constraints of type dirName can also be checked with a simple memcmp().
350
 */
351
352
static int x509_name_canon(X509_NAME *a)
353
6.77M
{
354
6.77M
    unsigned char *p;
355
6.77M
    STACK_OF(STACK_OF_X509_NAME_ENTRY) *intname = NULL;
356
6.77M
    STACK_OF(X509_NAME_ENTRY) *entries = NULL;
357
6.77M
    X509_NAME_ENTRY *entry, *tmpentry = NULL;
358
6.77M
    int i, set = -1, ret = 0;
359
360
6.77M
    if (a->canon_enc) {
361
0
        OPENSSL_free(a->canon_enc);
362
0
        a->canon_enc = NULL;
363
0
    }
364
    /* Special case: empty X509_NAME => null encoding */
365
6.77M
    if (sk_X509_NAME_ENTRY_num(a->entries) == 0) {
366
0
        a->canon_enclen = 0;
367
0
        return 1;
368
0
    }
369
6.77M
    intname = sk_STACK_OF_X509_NAME_ENTRY_new_null();
370
6.77M
    if (!intname)
371
0
        goto err;
372
32.2M
    for (i = 0; i < sk_X509_NAME_ENTRY_num(a->entries); i++) {
373
25.5M
        entry = sk_X509_NAME_ENTRY_value(a->entries, i);
374
25.5M
        if (entry->set != set) {
375
25.5M
            entries = sk_X509_NAME_ENTRY_new_null();
376
25.5M
            if (!entries)
377
0
                goto err;
378
25.5M
            if (!sk_STACK_OF_X509_NAME_ENTRY_push(intname, entries)) {
379
0
                sk_X509_NAME_ENTRY_free(entries);
380
0
                goto err;
381
0
            }
382
25.5M
            set = entry->set;
383
25.5M
        }
384
25.5M
        tmpentry = X509_NAME_ENTRY_new();
385
25.5M
        if (!tmpentry)
386
0
            goto err;
387
25.5M
        tmpentry->object = OBJ_dup(entry->object);
388
25.5M
        if (!asn1_string_canon(tmpentry->value, entry->value))
389
0
            goto err;
390
25.5M
        if (!sk_X509_NAME_ENTRY_push(entries, tmpentry))
391
0
            goto err;
392
25.5M
        tmpentry = NULL;
393
25.5M
    }
394
395
    /* Finally generate encoding */
396
397
6.77M
    a->canon_enclen = i2d_name_canon(intname, NULL);
398
399
6.77M
    p = OPENSSL_malloc(a->canon_enclen);
400
401
6.77M
    if (!p)
402
0
        goto err;
403
404
6.77M
    a->canon_enc = p;
405
406
6.77M
    i2d_name_canon(intname, &p);
407
408
6.77M
    ret = 1;
409
410
6.77M
 err:
411
412
6.77M
    if (tmpentry)
413
0
        X509_NAME_ENTRY_free(tmpentry);
414
6.77M
    if (intname)
415
6.77M
        sk_STACK_OF_X509_NAME_ENTRY_pop_free(intname,
416
6.77M
                                             local_sk_X509_NAME_ENTRY_pop_free);
417
6.77M
    return ret;
418
6.77M
}
419
420
/* Bitmap of all the types of string that will be canonicalized. */
421
422
#define ASN1_MASK_CANON \
423
25.5M
        (B_ASN1_UTF8STRING | B_ASN1_BMPSTRING | B_ASN1_UNIVERSALSTRING \
424
25.5M
        | B_ASN1_PRINTABLESTRING | B_ASN1_T61STRING | B_ASN1_IA5STRING \
425
25.5M
        | B_ASN1_VISIBLESTRING)
426
427
static int asn1_string_canon(ASN1_STRING *out, ASN1_STRING *in)
428
25.5M
{
429
25.5M
    unsigned char *to, *from;
430
25.5M
    int len, i;
431
432
    /* If type not in bitmask just copy string across */
433
25.5M
    if (!(ASN1_tag2bit(in->type) & ASN1_MASK_CANON)) {
434
0
        if (!ASN1_STRING_copy(out, in))
435
0
            return 0;
436
0
        return 1;
437
0
    }
438
439
25.5M
    out->type = V_ASN1_UTF8STRING;
440
25.5M
    out->length = ASN1_STRING_to_UTF8(&out->data, in);
441
25.5M
    if (out->length == -1)
442
0
        return 0;
443
444
25.5M
    to = out->data;
445
25.5M
    from = to;
446
447
25.5M
    len = out->length;
448
449
    /*
450
     * Convert string in place to canonical form. Ultimately we may need to
451
     * handle a wider range of characters but for now ignore anything with
452
     * MSB set and rely on the isspace() and tolower() functions.
453
     */
454
455
    /* Ignore leading spaces */
456
25.5M
    while ((len > 0) && !(*from & 0x80) && isspace(*from)) {
457
0
        from++;
458
0
        len--;
459
0
    }
460
461
25.5M
    to = from + len - 1;
462
463
    /* Ignore trailing spaces */
464
25.5M
    while ((len > 0) && !(*to & 0x80) && isspace(*to)) {
465
0
        to--;
466
0
        len--;
467
0
    }
468
469
25.5M
    to = out->data;
470
471
25.5M
    i = 0;
472
441M
    while (i < len) {
473
        /* If MSB set just copy across */
474
416M
        if (*from & 0x80) {
475
1.17M
            *to++ = *from++;
476
1.17M
            i++;
477
1.17M
        }
478
        /* Collapse multiple spaces */
479
415M
        else if (isspace(*from)) {
480
            /* Copy one space across */
481
38.7M
            *to++ = ' ';
482
            /*
483
             * Ignore subsequent spaces. Note: don't need to check len here
484
             * because we know the last character is a non-space so we can't
485
             * overflow.
486
             */
487
38.7M
            do {
488
38.7M
                from++;
489
38.7M
                i++;
490
38.7M
            }
491
38.7M
            while (!(*from & 0x80) && isspace(*from));
492
376M
        } else {
493
376M
            *to++ = tolower(*from);
494
376M
            from++;
495
376M
            i++;
496
376M
        }
497
416M
    }
498
499
25.5M
    out->length = to - out->data;
500
501
25.5M
    return 1;
502
503
25.5M
}
504
505
static int i2d_name_canon(STACK_OF(STACK_OF_X509_NAME_ENTRY) * _intname,
506
                          unsigned char **in)
507
13.5M
{
508
13.5M
    int i, len, ltmp;
509
13.5M
    ASN1_VALUE *v;
510
13.5M
    STACK_OF(ASN1_VALUE) *intname = (STACK_OF(ASN1_VALUE) *)_intname;
511
512
13.5M
    len = 0;
513
64.5M
    for (i = 0; i < sk_ASN1_VALUE_num(intname); i++) {
514
51.0M
        v = sk_ASN1_VALUE_value(intname, i);
515
51.0M
        ltmp = ASN1_item_ex_i2d(&v, in,
516
51.0M
                                ASN1_ITEM_rptr(X509_NAME_ENTRIES), -1, -1);
517
51.0M
        if (ltmp < 0)
518
0
            return ltmp;
519
51.0M
        len += ltmp;
520
51.0M
    }
521
13.5M
    return len;
522
13.5M
}
523
524
int X509_NAME_set(X509_NAME **xn, X509_NAME *name)
525
0
{
526
0
    if ((name = X509_NAME_dup(name)) == NULL)
527
0
        return 0;
528
0
    X509_NAME_free(*xn);
529
0
    *xn = name;
530
0
    return 1;
531
0
}
532
533
IMPLEMENT_STACK_OF(X509_NAME_ENTRY)
534
535
IMPLEMENT_ASN1_SET_OF(X509_NAME_ENTRY)