/src/libressl/crypto/x509/x509_obj.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* $OpenBSD: x509_obj.c,v 1.19 2021/11/01 20:53:08 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 <stdio.h> |
60 | | #include <string.h> |
61 | | |
62 | | #include <openssl/buffer.h> |
63 | | #include <openssl/err.h> |
64 | | #include <openssl/lhash.h> |
65 | | #include <openssl/objects.h> |
66 | | #include <openssl/x509.h> |
67 | | |
68 | | #include "x509_lcl.h" |
69 | | |
70 | | char * |
71 | | X509_NAME_oneline(const X509_NAME *a, char *buf, int len) |
72 | 0 | { |
73 | 0 | X509_NAME_ENTRY *ne; |
74 | 0 | int i; |
75 | 0 | int n, lold, l, l1, l2, num, j, type; |
76 | 0 | const char *s; |
77 | 0 | char *p; |
78 | 0 | unsigned char *q; |
79 | 0 | BUF_MEM *b = NULL; |
80 | 0 | static const char hex[17] = "0123456789ABCDEF"; |
81 | 0 | int gs_doit[4]; |
82 | 0 | char tmp_buf[80]; |
83 | |
|
84 | 0 | if (buf == NULL) { |
85 | 0 | if ((b = BUF_MEM_new()) == NULL) |
86 | 0 | goto err; |
87 | 0 | if (!BUF_MEM_grow(b, 200)) |
88 | 0 | goto err; |
89 | 0 | b->data[0] = '\0'; |
90 | 0 | len = 200; |
91 | 0 | } |
92 | 0 | if (a == NULL) { |
93 | 0 | if (b) { |
94 | 0 | buf = b->data; |
95 | 0 | free(b); |
96 | 0 | } |
97 | 0 | strlcpy(buf, "NO X509_NAME", len); |
98 | 0 | return buf; |
99 | 0 | } |
100 | | |
101 | 0 | len--; /* space for '\0' */ |
102 | 0 | l = 0; |
103 | 0 | for (i = 0; i < sk_X509_NAME_ENTRY_num(a->entries); i++) { |
104 | 0 | ne = sk_X509_NAME_ENTRY_value(a->entries, i); |
105 | 0 | n = OBJ_obj2nid(ne->object); |
106 | 0 | if ((n == NID_undef) || ((s = OBJ_nid2sn(n)) == NULL)) { |
107 | 0 | i2t_ASN1_OBJECT(tmp_buf, sizeof(tmp_buf), ne->object); |
108 | 0 | s = tmp_buf; |
109 | 0 | } |
110 | 0 | l1 = strlen(s); |
111 | |
|
112 | 0 | type = ne->value->type; |
113 | 0 | num = ne->value->length; |
114 | 0 | q = ne->value->data; |
115 | 0 | if ((type == V_ASN1_GENERALSTRING) && ((num % 4) == 0)) { |
116 | 0 | gs_doit[0] = gs_doit[1] = gs_doit[2] = gs_doit[3] = 0; |
117 | 0 | for (j = 0; j < num; j++) |
118 | 0 | if (q[j] != 0) |
119 | 0 | gs_doit[j & 3] = 1; |
120 | |
|
121 | 0 | if (gs_doit[0]|gs_doit[1]|gs_doit[2]) |
122 | 0 | gs_doit[0] = gs_doit[1] = gs_doit[2] = gs_doit[3] = 1; |
123 | 0 | else { |
124 | 0 | gs_doit[0] = gs_doit[1] = gs_doit[2] = 0; |
125 | 0 | gs_doit[3] = 1; |
126 | 0 | } |
127 | 0 | } else |
128 | 0 | gs_doit[0] = gs_doit[1] = gs_doit[2] = gs_doit[3] = 1; |
129 | |
|
130 | 0 | for (l2 = j=0; j < num; j++) { |
131 | 0 | if (!gs_doit[j&3]) |
132 | 0 | continue; |
133 | 0 | l2++; |
134 | 0 | if ((q[j] < ' ') || (q[j] > '~')) |
135 | 0 | l2 += 3; |
136 | 0 | } |
137 | |
|
138 | 0 | lold = l; |
139 | 0 | l += 1 + l1 + 1 + l2; |
140 | 0 | if (b != NULL) { |
141 | 0 | if (!BUF_MEM_grow(b, l + 1)) |
142 | 0 | goto err; |
143 | 0 | p = &(b->data[lold]); |
144 | 0 | } else if (l > len) { |
145 | 0 | break; |
146 | 0 | } else |
147 | 0 | p = &(buf[lold]); |
148 | 0 | *(p++) = '/'; |
149 | 0 | memcpy(p, s, l1); |
150 | 0 | p += l1; |
151 | 0 | *(p++) = '='; |
152 | 0 | q = ne->value->data; |
153 | 0 | for (j = 0; j < num; j++) { |
154 | 0 | if (!gs_doit[j & 3]) |
155 | 0 | continue; |
156 | 0 | n = q[j]; |
157 | 0 | if ((n < ' ') || (n > '~')) { |
158 | 0 | *(p++) = '\\'; |
159 | 0 | *(p++) = 'x'; |
160 | 0 | *(p++) = hex[(n >> 4) & 0x0f]; |
161 | 0 | *(p++) = hex[n & 0x0f]; |
162 | 0 | } else |
163 | 0 | *(p++) = n; |
164 | 0 | } |
165 | 0 | *p = '\0'; |
166 | 0 | } |
167 | 0 | if (b != NULL) { |
168 | 0 | p = b->data; |
169 | 0 | free(b); |
170 | 0 | } else |
171 | 0 | p = buf; |
172 | 0 | if (i == 0) |
173 | 0 | *p = '\0'; |
174 | 0 | return (p); |
175 | | |
176 | 0 | err: |
177 | 0 | X509error(ERR_R_MALLOC_FAILURE); |
178 | 0 | if (b != NULL) |
179 | 0 | BUF_MEM_free(b); |
180 | 0 | return (NULL); |
181 | 0 | } |