summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/asn1/x_name.c
diff options
context:
space:
mode:
authorcvs2svn <admin@example.com>2025-04-14 17:32:06 +0000
committercvs2svn <admin@example.com>2025-04-14 17:32:06 +0000
commiteb8dd9dca1228af0cd132f515509051ecfabf6f6 (patch)
treeedb6da6af7e865d488dc1a29309f1e1ec226e603 /src/lib/libcrypto/asn1/x_name.c
parent247f0352e0ed72a4f476db9dc91f4d982bc83eb2 (diff)
downloadopenbsd-tb_20250414.tar.gz
openbsd-tb_20250414.tar.bz2
openbsd-tb_20250414.zip
This commit was manufactured by cvs2git to create tag 'tb_20250414'.tb_20250414
Diffstat (limited to 'src/lib/libcrypto/asn1/x_name.c')
-rw-r--r--src/lib/libcrypto/asn1/x_name.c666
1 files changed, 0 insertions, 666 deletions
diff --git a/src/lib/libcrypto/asn1/x_name.c b/src/lib/libcrypto/asn1/x_name.c
deleted file mode 100644
index c60714b74f..0000000000
--- a/src/lib/libcrypto/asn1/x_name.c
+++ /dev/null
@@ -1,666 +0,0 @@
1/* $OpenBSD: x_name.c,v 1.45 2025/03/20 09:41:47 tb Exp $ */
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 <ctype.h>
60#include <stdio.h>
61#include <string.h>
62
63#include <openssl/asn1t.h>
64#include <openssl/err.h>
65#include <openssl/x509.h>
66
67#include "asn1_local.h"
68#include "x509_local.h"
69
70typedef STACK_OF(X509_NAME_ENTRY) STACK_OF_X509_NAME_ENTRY;
71DECLARE_STACK_OF(STACK_OF_X509_NAME_ENTRY)
72
73static int x509_name_ex_d2i(ASN1_VALUE **val, const unsigned char **in,
74 long len, const ASN1_ITEM *it, int tag, int aclass, char opt,
75 ASN1_TLC *ctx);
76
77static int x509_name_ex_i2d(ASN1_VALUE **val, unsigned char **out,
78 const ASN1_ITEM *it, int tag, int aclass);
79static int x509_name_ex_new(ASN1_VALUE **val, const ASN1_ITEM *it);
80static void x509_name_ex_free(ASN1_VALUE **val, const ASN1_ITEM *it);
81
82static int x509_name_encode(X509_NAME *a);
83static int x509_name_canon(X509_NAME *a);
84static int asn1_string_canon(ASN1_STRING *out, ASN1_STRING *in);
85static int i2d_name_canon(STACK_OF(STACK_OF_X509_NAME_ENTRY) *intname,
86 unsigned char **in);
87
88static int x509_name_ex_print(BIO *out, ASN1_VALUE **pval, int indent,
89 const char *fname, const ASN1_PCTX *pctx);
90
91static const ASN1_TEMPLATE X509_NAME_ENTRY_seq_tt[] = {
92 {
93 .offset = offsetof(X509_NAME_ENTRY, object),
94 .field_name = "object",
95 .item = &ASN1_OBJECT_it,
96 },
97 {
98 .offset = offsetof(X509_NAME_ENTRY, value),
99 .field_name = "value",
100 .item = &ASN1_PRINTABLE_it,
101 },
102};
103
104const ASN1_ITEM X509_NAME_ENTRY_it = {
105 .itype = ASN1_ITYPE_SEQUENCE,
106 .utype = V_ASN1_SEQUENCE,
107 .templates = X509_NAME_ENTRY_seq_tt,
108 .tcount = sizeof(X509_NAME_ENTRY_seq_tt) / sizeof(ASN1_TEMPLATE),
109 .size = sizeof(X509_NAME_ENTRY),
110 .sname = "X509_NAME_ENTRY",
111};
112LCRYPTO_ALIAS(X509_NAME_ENTRY_it);
113
114
115X509_NAME_ENTRY *
116d2i_X509_NAME_ENTRY(X509_NAME_ENTRY **a, const unsigned char **in, long len)
117{
118 return (X509_NAME_ENTRY *)ASN1_item_d2i((ASN1_VALUE **)a, in, len,
119 &X509_NAME_ENTRY_it);
120}
121LCRYPTO_ALIAS(d2i_X509_NAME_ENTRY);
122
123int
124i2d_X509_NAME_ENTRY(X509_NAME_ENTRY *a, unsigned char **out)
125{
126 return ASN1_item_i2d((ASN1_VALUE *)a, out, &X509_NAME_ENTRY_it);
127}
128LCRYPTO_ALIAS(i2d_X509_NAME_ENTRY);
129
130X509_NAME_ENTRY *
131X509_NAME_ENTRY_new(void)
132{
133 return (X509_NAME_ENTRY *)ASN1_item_new(&X509_NAME_ENTRY_it);
134}
135LCRYPTO_ALIAS(X509_NAME_ENTRY_new);
136
137void
138X509_NAME_ENTRY_free(X509_NAME_ENTRY *a)
139{
140 ASN1_item_free((ASN1_VALUE *)a, &X509_NAME_ENTRY_it);
141}
142LCRYPTO_ALIAS(X509_NAME_ENTRY_free);
143
144X509_NAME_ENTRY *
145X509_NAME_ENTRY_dup(X509_NAME_ENTRY *x)
146{
147 return ASN1_item_dup(&X509_NAME_ENTRY_it, x);
148}
149LCRYPTO_ALIAS(X509_NAME_ENTRY_dup);
150
151/* For the "Name" type we need a SEQUENCE OF { SET OF X509_NAME_ENTRY }
152 * so declare two template wrappers for this
153 */
154
155static const ASN1_TEMPLATE X509_NAME_ENTRIES_item_tt = {
156 .flags = ASN1_TFLG_SET_OF,
157 .tag = 0,
158 .offset = 0,
159 .field_name = "RDNS",
160 .item = &X509_NAME_ENTRY_it,
161};
162
163static const ASN1_ITEM X509_NAME_ENTRIES_it = {
164 .itype = ASN1_ITYPE_PRIMITIVE,
165 .utype = -1,
166 .templates = &X509_NAME_ENTRIES_item_tt,
167 .tcount = 0,
168 .funcs = NULL,
169 .size = 0,
170 .sname = "X509_NAME_ENTRIES",
171};
172
173static const ASN1_TEMPLATE X509_NAME_INTERNAL_item_tt = {
174 .flags = ASN1_TFLG_SEQUENCE_OF,
175 .tag = 0,
176 .offset = 0,
177 .field_name = "Name",
178 .item = &X509_NAME_ENTRIES_it,
179};
180
181static const ASN1_ITEM X509_NAME_INTERNAL_it = {
182 .itype = ASN1_ITYPE_PRIMITIVE,
183 .utype = -1,
184 .templates = &X509_NAME_INTERNAL_item_tt,
185 .tcount = 0,
186 .funcs = NULL,
187 .size = 0,
188 .sname = "X509_NAME_INTERNAL",
189};
190
191/* Normally that's where it would end: we'd have two nested STACK structures
192 * representing the ASN1. Unfortunately X509_NAME uses a completely different
193 * form and caches encodings so we have to process the internal form and convert
194 * to the external form.
195 */
196
197const ASN1_EXTERN_FUNCS x509_name_ff = {
198 .app_data = NULL,
199 .asn1_ex_new = x509_name_ex_new,
200 .asn1_ex_free = x509_name_ex_free,
201 .asn1_ex_clear = NULL,
202 .asn1_ex_d2i = x509_name_ex_d2i,
203 .asn1_ex_i2d = x509_name_ex_i2d,
204 .asn1_ex_print = x509_name_ex_print,
205};
206
207const ASN1_ITEM X509_NAME_it = {
208 .itype = ASN1_ITYPE_EXTERN,
209 .utype = V_ASN1_SEQUENCE,
210 .templates = NULL,
211 .tcount = 0,
212 .funcs = &x509_name_ff,
213 .size = 0,
214 .sname = "X509_NAME",
215};
216LCRYPTO_ALIAS(X509_NAME_it);
217
218X509_NAME *
219d2i_X509_NAME(X509_NAME **a, const unsigned char **in, long len)
220{
221 return (X509_NAME *)ASN1_item_d2i((ASN1_VALUE **)a, in, len,
222 &X509_NAME_it);
223}
224LCRYPTO_ALIAS(d2i_X509_NAME);
225
226int
227i2d_X509_NAME(X509_NAME *a, unsigned char **out)
228{
229 return ASN1_item_i2d((ASN1_VALUE *)a, out, &X509_NAME_it);
230}
231LCRYPTO_ALIAS(i2d_X509_NAME);
232
233X509_NAME *
234X509_NAME_new(void)
235{
236 return (X509_NAME *)ASN1_item_new(&X509_NAME_it);
237}
238LCRYPTO_ALIAS(X509_NAME_new);
239
240void
241X509_NAME_free(X509_NAME *a)
242{
243 ASN1_item_free((ASN1_VALUE *)a, &X509_NAME_it);
244}
245LCRYPTO_ALIAS(X509_NAME_free);
246
247X509_NAME *
248X509_NAME_dup(X509_NAME *x)
249{
250 return ASN1_item_dup(&X509_NAME_it, x);
251}
252LCRYPTO_ALIAS(X509_NAME_dup);
253
254static int
255x509_name_ex_new(ASN1_VALUE **val, const ASN1_ITEM *it)
256{
257 X509_NAME *ret = NULL;
258
259 ret = malloc(sizeof(X509_NAME));
260 if (!ret)
261 goto memerr;
262 if ((ret->entries = sk_X509_NAME_ENTRY_new_null()) == NULL)
263 goto memerr;
264 if ((ret->bytes = BUF_MEM_new()) == NULL)
265 goto memerr;
266 ret->canon_enc = NULL;
267 ret->canon_enclen = 0;
268 ret->modified = 1;
269 *val = (ASN1_VALUE *)ret;
270 return 1;
271
272 memerr:
273 ASN1error(ERR_R_MALLOC_FAILURE);
274 if (ret) {
275 if (ret->entries)
276 sk_X509_NAME_ENTRY_free(ret->entries);
277 free(ret);
278 }
279 return 0;
280}
281
282static void
283x509_name_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it)
284{
285 X509_NAME *a;
286
287 if (!pval || !*pval)
288 return;
289 a = (X509_NAME *)*pval;
290
291 BUF_MEM_free(a->bytes);
292 sk_X509_NAME_ENTRY_pop_free(a->entries, X509_NAME_ENTRY_free);
293 free(a->canon_enc);
294 free(a);
295 *pval = NULL;
296}
297
298static int
299x509_name_ex_d2i(ASN1_VALUE **val, const unsigned char **in, long len,
300 const ASN1_ITEM *it, int tag, int aclass, char opt, ASN1_TLC *ctx)
301{
302 const unsigned char *p = *in, *q;
303 union {
304 STACK_OF(STACK_OF_X509_NAME_ENTRY) *s;
305 ASN1_VALUE *a;
306 } intname = {NULL};
307 union {
308 X509_NAME *x;
309 ASN1_VALUE *a;
310 } nm = {NULL};
311 int i, j, ret;
312 STACK_OF(X509_NAME_ENTRY) *entries;
313 X509_NAME_ENTRY *entry;
314 q = p;
315
316 /* Get internal representation of Name */
317 ret = ASN1_item_ex_d2i(&intname.a, &p, len,
318 &X509_NAME_INTERNAL_it, tag, aclass, opt, ctx);
319
320 if (ret <= 0)
321 return ret;
322
323 if (*val)
324 x509_name_ex_free(val, NULL);
325 if (!x509_name_ex_new(&nm.a, NULL))
326 goto err;
327 /* We've decoded it: now cache encoding */
328 if (!BUF_MEM_grow(nm.x->bytes, p - q))
329 goto err;
330 memcpy(nm.x->bytes->data, q, p - q);
331
332 /* Convert internal representation to X509_NAME structure */
333 for (i = 0; i < sk_STACK_OF_X509_NAME_ENTRY_num(intname.s); i++) {
334 entries = sk_STACK_OF_X509_NAME_ENTRY_value(intname.s, i);
335 for (j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) {
336 entry = sk_X509_NAME_ENTRY_value(entries, j);
337 entry->set = i;
338 if (!sk_X509_NAME_ENTRY_push(nm.x->entries, entry))
339 goto err;
340 }
341 sk_X509_NAME_ENTRY_free(entries);
342 }
343 sk_STACK_OF_X509_NAME_ENTRY_free(intname.s);
344 ret = x509_name_canon(nm.x);
345 if (!ret)
346 goto err;
347 nm.x->modified = 0;
348 *val = nm.a;
349 *in = p;
350 return ret;
351
352 err:
353 if (nm.x != NULL)
354 X509_NAME_free(nm.x);
355 ASN1error(ERR_R_NESTED_ASN1_ERROR);
356 return 0;
357}
358
359static int
360x509_name_ex_i2d(ASN1_VALUE **val, unsigned char **out, const ASN1_ITEM *it,
361 int tag, int aclass)
362{
363 int ret;
364 X509_NAME *a = (X509_NAME *)*val;
365
366 if (a->modified) {
367 ret = x509_name_encode(a);
368 if (ret < 0)
369 return ret;
370 ret = x509_name_canon(a);
371 if (ret < 0)
372 return ret;
373 }
374 ret = a->bytes->length;
375 if (out != NULL) {
376 memcpy(*out, a->bytes->data, ret);
377 *out += ret;
378 }
379 return ret;
380}
381
382static void
383local_sk_X509_NAME_ENTRY_free(STACK_OF(X509_NAME_ENTRY) *ne)
384{
385 sk_X509_NAME_ENTRY_free(ne);
386}
387
388static void
389local_sk_X509_NAME_ENTRY_pop_free(STACK_OF(X509_NAME_ENTRY) *ne)
390{
391 sk_X509_NAME_ENTRY_pop_free(ne, X509_NAME_ENTRY_free);
392}
393
394static int
395x509_name_encode(X509_NAME *a)
396{
397 union {
398 STACK_OF(STACK_OF_X509_NAME_ENTRY) *s;
399 ASN1_VALUE *a;
400 } intname = {NULL};
401 int len;
402 unsigned char *p;
403 STACK_OF(X509_NAME_ENTRY) *entries = NULL;
404 X509_NAME_ENTRY *entry;
405 int i, set = -1;
406
407 intname.s = sk_STACK_OF_X509_NAME_ENTRY_new_null();
408 if (!intname.s)
409 goto memerr;
410 for (i = 0; i < sk_X509_NAME_ENTRY_num(a->entries); i++) {
411 entry = sk_X509_NAME_ENTRY_value(a->entries, i);
412 if (entry->set != set) {
413 entries = sk_X509_NAME_ENTRY_new_null();
414 if (!entries)
415 goto memerr;
416 if (!sk_STACK_OF_X509_NAME_ENTRY_push(intname.s,
417 entries)) {
418 sk_X509_NAME_ENTRY_free(entries);
419 goto memerr;
420 }
421 set = entry->set;
422 }
423 if (entries == NULL /* if entry->set is bogusly -1 */ ||
424 !sk_X509_NAME_ENTRY_push(entries, entry))
425 goto memerr;
426 }
427 len = ASN1_item_ex_i2d(&intname.a, NULL,
428 &X509_NAME_INTERNAL_it, -1, -1);
429 if (!BUF_MEM_grow(a->bytes, len))
430 goto memerr;
431 p = (unsigned char *)a->bytes->data;
432 ASN1_item_ex_i2d(&intname.a, &p, &X509_NAME_INTERNAL_it,
433 -1, -1);
434 sk_STACK_OF_X509_NAME_ENTRY_pop_free(intname.s,
435 local_sk_X509_NAME_ENTRY_free);
436 a->modified = 0;
437 return len;
438
439 memerr:
440 sk_STACK_OF_X509_NAME_ENTRY_pop_free(intname.s,
441 local_sk_X509_NAME_ENTRY_free);
442 ASN1error(ERR_R_MALLOC_FAILURE);
443 return -1;
444}
445
446static int
447x509_name_ex_print(BIO *out, ASN1_VALUE **pval, int indent, const char *fname,
448 const ASN1_PCTX *pctx)
449{
450 if (X509_NAME_print_ex(out, (X509_NAME *)*pval, indent,
451 pctx->nm_flags) <= 0)
452 return 0;
453 return 2;
454}
455
456/* This function generates the canonical encoding of the Name structure.
457 * In it all strings are converted to UTF8, leading, trailing and
458 * multiple spaces collapsed, converted to lower case and the leading
459 * SEQUENCE header removed.
460 *
461 * In future we could also normalize the UTF8 too.
462 *
463 * By doing this comparison of Name structures can be rapidly
464 * performed by just using memcmp() of the canonical encoding.
465 * By omitting the leading SEQUENCE name constraints of type
466 * dirName can also be checked with a simple memcmp().
467 */
468
469static int
470x509_name_canon(X509_NAME *a)
471{
472 unsigned char *p;
473 STACK_OF(STACK_OF_X509_NAME_ENTRY) *intname = NULL;
474 STACK_OF(X509_NAME_ENTRY) *entries = NULL;
475 X509_NAME_ENTRY *entry, *tmpentry = NULL;
476 int i, len, set = -1, ret = 0;
477
478 if (a->canon_enc) {
479 free(a->canon_enc);
480 a->canon_enc = NULL;
481 }
482 /* Special case: empty X509_NAME => null encoding */
483 if (sk_X509_NAME_ENTRY_num(a->entries) == 0) {
484 a->canon_enclen = 0;
485 return 1;
486 }
487 intname = sk_STACK_OF_X509_NAME_ENTRY_new_null();
488 if (!intname)
489 goto err;
490 for (i = 0; i < sk_X509_NAME_ENTRY_num(a->entries); i++) {
491 entry = sk_X509_NAME_ENTRY_value(a->entries, i);
492 if (entry->set != set) {
493 entries = sk_X509_NAME_ENTRY_new_null();
494 if (!entries)
495 goto err;
496 if (sk_STACK_OF_X509_NAME_ENTRY_push(intname,
497 entries) == 0) {
498 sk_X509_NAME_ENTRY_free(entries);
499 goto err;
500 }
501 set = entry->set;
502 }
503 tmpentry = X509_NAME_ENTRY_new();
504 if (tmpentry == NULL)
505 goto err;
506 tmpentry->object = OBJ_dup(entry->object);
507 if (tmpentry->object == NULL)
508 goto err;
509 if (!asn1_string_canon(tmpentry->value, entry->value))
510 goto err;
511 if (entries == NULL /* if entry->set is bogusly -1 */ ||
512 !sk_X509_NAME_ENTRY_push(entries, tmpentry))
513 goto err;
514 tmpentry = NULL;
515 }
516
517 /* Finally generate encoding */
518 len = i2d_name_canon(intname, NULL);
519 if (len < 0)
520 goto err;
521 p = malloc(len);
522 if (p == NULL)
523 goto err;
524 a->canon_enc = p;
525 a->canon_enclen = len;
526 i2d_name_canon(intname, &p);
527 ret = 1;
528
529 err:
530 if (tmpentry)
531 X509_NAME_ENTRY_free(tmpentry);
532 if (intname)
533 sk_STACK_OF_X509_NAME_ENTRY_pop_free(intname,
534 local_sk_X509_NAME_ENTRY_pop_free);
535 return ret;
536}
537
538/* Bitmap of all the types of string that will be canonicalized. */
539
540#define ASN1_MASK_CANON \
541 (B_ASN1_UTF8STRING | B_ASN1_BMPSTRING | B_ASN1_UNIVERSALSTRING \
542 | B_ASN1_PRINTABLESTRING | B_ASN1_T61STRING | B_ASN1_IA5STRING \
543 | B_ASN1_VISIBLESTRING)
544
545
546static int
547asn1_string_canon(ASN1_STRING *out, ASN1_STRING *in)
548{
549 unsigned char *to, *from;
550 int len, i;
551
552 /* If type not in bitmask just copy string across */
553 if (!(ASN1_tag2bit(in->type) & ASN1_MASK_CANON)) {
554 if (!ASN1_STRING_copy(out, in))
555 return 0;
556 return 1;
557 }
558
559 out->type = V_ASN1_UTF8STRING;
560 out->length = ASN1_STRING_to_UTF8(&out->data, in);
561 if (out->length == -1)
562 return 0;
563
564 to = out->data;
565 from = to;
566
567 len = out->length;
568
569 /* Convert string in place to canonical form.
570 * Ultimately we may need to handle a wider range of characters
571 * but for now ignore anything with MSB set and rely on the
572 * isspace() and tolower() functions.
573 */
574
575 /* Ignore leading spaces */
576 while ((len > 0) && !(*from & 0x80) && isspace(*from)) {
577 from++;
578 len--;
579 }
580
581 to = from + len - 1;
582
583 /* Ignore trailing spaces */
584 while ((len > 0) && !(*to & 0x80) && isspace(*to)) {
585 to--;
586 len--;
587 }
588
589 to = out->data;
590
591 i = 0;
592 while (i < len) {
593 /* If MSB set just copy across */
594 if (*from & 0x80) {
595 *to++ = *from++;
596 i++;
597 }
598 /* Collapse multiple spaces */
599 else if (isspace(*from)) {
600 /* Copy one space across */
601 *to++ = ' ';
602 /* Ignore subsequent spaces. Note: don't need to
603 * check len here because we know the last
604 * character is a non-space so we can't overflow.
605 */
606 do {
607 from++;
608 i++;
609 } while (!(*from & 0x80) && isspace(*from));
610 } else {
611 *to++ = tolower(*from);
612 from++;
613 i++;
614 }
615 }
616
617 out->length = to - out->data;
618
619 return 1;
620}
621
622static int
623i2d_name_canon(STACK_OF(STACK_OF_X509_NAME_ENTRY) *_intname, unsigned char **in)
624{
625 int i, len, ltmp;
626 ASN1_VALUE *v;
627 STACK_OF(ASN1_VALUE) *intname = (STACK_OF(ASN1_VALUE) *)_intname;
628
629 len = 0;
630 for (i = 0; i < sk_ASN1_VALUE_num(intname); i++) {
631 v = sk_ASN1_VALUE_value(intname, i);
632 ltmp = ASN1_item_ex_i2d(&v, in,
633 &X509_NAME_ENTRIES_it, -1, -1);
634 if (ltmp < 0)
635 return ltmp;
636 len += ltmp;
637 }
638 return len;
639}
640
641int
642X509_NAME_set(X509_NAME **xn, X509_NAME *name)
643{
644 if (*xn == name)
645 return *xn != NULL;
646 if ((name = X509_NAME_dup(name)) == NULL)
647 return 0;
648 X509_NAME_free(*xn);
649 *xn = name;
650 return 1;
651}
652LCRYPTO_ALIAS(X509_NAME_set);
653
654int
655X509_NAME_get0_der(X509_NAME *nm, const unsigned char **pder, size_t *pderlen)
656{
657 /* Make sure encoding is valid. */
658 if (i2d_X509_NAME(nm, NULL) <= 0)
659 return 0;
660 if (pder != NULL)
661 *pder = (unsigned char *)nm->bytes->data;
662 if (pderlen != NULL)
663 *pderlen = nm->bytes->length;
664 return 1;
665}
666LCRYPTO_ALIAS(X509_NAME_get0_der);
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-05-06 19:53:45 +0000