|
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 "cryptlib.h" |
|
61 #include <openssl/asn1t.h> |
|
62 #include <openssl/x509.h> |
|
63 |
|
64 static int x509_name_ex_d2i(ASN1_VALUE **val, const unsigned char **in, long len, const ASN1_ITEM *it, |
|
65 int tag, int aclass, char opt, ASN1_TLC *ctx); |
|
66 |
|
67 static int x509_name_ex_i2d(ASN1_VALUE **val, unsigned char **out, const ASN1_ITEM *it, int tag, int aclass); |
|
68 static int x509_name_ex_new(ASN1_VALUE **val, const ASN1_ITEM *it); |
|
69 static void x509_name_ex_free(ASN1_VALUE **val, const ASN1_ITEM *it); |
|
70 |
|
71 static int x509_name_encode(X509_NAME *a); |
|
72 |
|
73 ASN1_SEQUENCE(X509_NAME_ENTRY) = { |
|
74 ASN1_SIMPLE(X509_NAME_ENTRY, object, ASN1_OBJECT), |
|
75 ASN1_SIMPLE(X509_NAME_ENTRY, value, ASN1_PRINTABLE) |
|
76 } ASN1_SEQUENCE_END(X509_NAME_ENTRY) |
|
77 |
|
78 IMPLEMENT_ASN1_FUNCTIONS(X509_NAME_ENTRY) |
|
79 IMPLEMENT_ASN1_DUP_FUNCTION(X509_NAME_ENTRY) |
|
80 |
|
81 /* For the "Name" type we need a SEQUENCE OF { SET OF X509_NAME_ENTRY } |
|
82 * so declare two template wrappers for this |
|
83 */ |
|
84 |
|
85 ASN1_ITEM_TEMPLATE(X509_NAME_ENTRIES) = |
|
86 ASN1_EX_TEMPLATE_TYPE(ASN1_TFLG_SET_OF, 0, RDNS, X509_NAME_ENTRY) |
|
87 ASN1_ITEM_TEMPLATE_END(X509_NAME_ENTRIES) |
|
88 |
|
89 ASN1_ITEM_TEMPLATE(X509_NAME_INTERNAL) = |
|
90 ASN1_EX_TEMPLATE_TYPE(ASN1_TFLG_SEQUENCE_OF, 0, Name, X509_NAME_ENTRIES) |
|
91 ASN1_ITEM_TEMPLATE_END(X509_NAME_INTERNAL) |
|
92 |
|
93 /* Normally that's where it would end: we'd have two nested STACK structures |
|
94 * representing the ASN1. Unfortunately X509_NAME uses a completely different |
|
95 * form and caches encodings so we have to process the internal form and convert |
|
96 * to the external form. |
|
97 */ |
|
98 |
|
99 const ASN1_EXTERN_FUNCS x509_name_ff = { |
|
100 NULL, |
|
101 x509_name_ex_new, |
|
102 x509_name_ex_free, |
|
103 0, /* Default clear behaviour is OK */ |
|
104 x509_name_ex_d2i, |
|
105 x509_name_ex_i2d |
|
106 }; |
|
107 |
|
108 IMPLEMENT_EXTERN_ASN1(X509_NAME, V_ASN1_SEQUENCE, x509_name_ff) |
|
109 |
|
110 IMPLEMENT_ASN1_FUNCTIONS(X509_NAME) |
|
111 IMPLEMENT_ASN1_DUP_FUNCTION(X509_NAME) |
|
112 |
|
113 static int x509_name_ex_new(ASN1_VALUE **val, const ASN1_ITEM *it) |
|
114 { |
|
115 X509_NAME *ret = NULL; |
|
116 ret = OPENSSL_malloc(sizeof(X509_NAME)); |
|
117 if(!ret) goto memerr; |
|
118 if ((ret->entries=sk_X509_NAME_ENTRY_new_null()) == NULL) |
|
119 goto memerr; |
|
120 if((ret->bytes = BUF_MEM_new()) == NULL) goto memerr; |
|
121 ret->modified=1; |
|
122 *val = (ASN1_VALUE *)ret; |
|
123 return 1; |
|
124 |
|
125 memerr: |
|
126 ASN1err(ASN1_F_X509_NAME_EX_NEW, ERR_R_MALLOC_FAILURE); |
|
127 if (ret) |
|
128 { |
|
129 if (ret->entries) |
|
130 sk_X509_NAME_ENTRY_free(ret->entries); |
|
131 OPENSSL_free(ret); |
|
132 } |
|
133 return 0; |
|
134 } |
|
135 |
|
136 static void x509_name_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it) |
|
137 { |
|
138 X509_NAME *a; |
|
139 if(!pval || !*pval) |
|
140 return; |
|
141 a = (X509_NAME *)*pval; |
|
142 |
|
143 BUF_MEM_free(a->bytes); |
|
144 sk_X509_NAME_ENTRY_pop_free(a->entries,X509_NAME_ENTRY_free); |
|
145 OPENSSL_free(a); |
|
146 *pval = NULL; |
|
147 } |
|
148 |
|
149 /* Used with sk_pop_free() to free up the internal representation. |
|
150 * NB: we only free the STACK and not its contents because it is |
|
151 * already present in the X509_NAME structure. |
|
152 */ |
|
153 |
|
154 static void sk_internal_free(void *a) |
|
155 { |
|
156 sk_free(a); |
|
157 } |
|
158 |
|
159 static int x509_name_ex_d2i(ASN1_VALUE **val, const unsigned char **in, long len, const ASN1_ITEM *it, |
|
160 int tag, int aclass, char opt, ASN1_TLC *ctx) |
|
161 { |
|
162 const unsigned char *p = *in, *q; |
|
163 union { STACK *s; ASN1_VALUE *a; } intname = {NULL}; |
|
164 union { X509_NAME *x; ASN1_VALUE *a; } nm = {NULL}; |
|
165 int i, j, ret; |
|
166 STACK_OF(X509_NAME_ENTRY) *entries; |
|
167 X509_NAME_ENTRY *entry; |
|
168 q = p; |
|
169 |
|
170 /* Get internal representation of Name */ |
|
171 ret = ASN1_item_ex_d2i(&intname.a, |
|
172 &p, len, ASN1_ITEM_rptr(X509_NAME_INTERNAL), |
|
173 tag, aclass, opt, ctx); |
|
174 |
|
175 if(ret <= 0) return ret; |
|
176 |
|
177 if(*val) x509_name_ex_free(val, NULL); |
|
178 if(!x509_name_ex_new(&nm.a, NULL)) goto err; |
|
179 /* We've decoded it: now cache encoding */ |
|
180 if(!BUF_MEM_grow(nm.x->bytes, p - q)) goto err; |
|
181 memcpy(nm.x->bytes->data, q, p - q); |
|
182 |
|
183 /* Convert internal representation to X509_NAME structure */ |
|
184 for(i = 0; i < sk_num(intname.s); i++) { |
|
185 entries = (STACK_OF(X509_NAME_ENTRY) *)sk_value(intname.s, i); |
|
186 for(j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) { |
|
187 entry = sk_X509_NAME_ENTRY_value(entries, j); |
|
188 entry->set = i; |
|
189 if(!sk_X509_NAME_ENTRY_push(nm.x->entries, entry)) |
|
190 goto err; |
|
191 } |
|
192 sk_X509_NAME_ENTRY_free(entries); |
|
193 } |
|
194 sk_free(intname.s); |
|
195 nm.x->modified = 0; |
|
196 *val = nm.a; |
|
197 *in = p; |
|
198 return ret; |
|
199 err: |
|
200 ASN1err(ASN1_F_X509_NAME_EX_D2I, ERR_R_NESTED_ASN1_ERROR); |
|
201 return 0; |
|
202 } |
|
203 |
|
204 static int x509_name_ex_i2d(ASN1_VALUE **val, unsigned char **out, const ASN1_ITEM *it, int tag, int aclass) |
|
205 { |
|
206 int ret; |
|
207 X509_NAME *a = (X509_NAME *)*val; |
|
208 if(a->modified) { |
|
209 ret = x509_name_encode((X509_NAME *)a); |
|
210 if(ret < 0) return ret; |
|
211 } |
|
212 ret = a->bytes->length; |
|
213 if(out != NULL) { |
|
214 memcpy(*out,a->bytes->data,ret); |
|
215 *out+=ret; |
|
216 } |
|
217 return ret; |
|
218 } |
|
219 |
|
220 static int x509_name_encode(X509_NAME *a) |
|
221 { |
|
222 union { STACK *s; ASN1_VALUE *a; } intname = {NULL}; |
|
223 int len; |
|
224 unsigned char *p; |
|
225 STACK_OF(X509_NAME_ENTRY) *entries = NULL; |
|
226 X509_NAME_ENTRY *entry; |
|
227 int i, set = -1; |
|
228 intname.s = sk_new_null(); |
|
229 if(!intname.s) goto memerr; |
|
230 for(i = 0; i < sk_X509_NAME_ENTRY_num(a->entries); i++) { |
|
231 entry = sk_X509_NAME_ENTRY_value(a->entries, i); |
|
232 if(entry->set != set) { |
|
233 entries = sk_X509_NAME_ENTRY_new_null(); |
|
234 if(!entries) goto memerr; |
|
235 if(!sk_push(intname.s, (char *)entries)) goto memerr; |
|
236 set = entry->set; |
|
237 } |
|
238 if(!sk_X509_NAME_ENTRY_push(entries, entry)) goto memerr; |
|
239 } |
|
240 len = ASN1_item_ex_i2d(&intname.a, NULL, |
|
241 ASN1_ITEM_rptr(X509_NAME_INTERNAL), -1, -1); |
|
242 if (!BUF_MEM_grow(a->bytes,len)) goto memerr; |
|
243 p=(unsigned char *)a->bytes->data; |
|
244 ASN1_item_ex_i2d(&intname.a, |
|
245 &p, ASN1_ITEM_rptr(X509_NAME_INTERNAL), -1, -1); |
|
246 sk_pop_free(intname.s, sk_internal_free); |
|
247 a->modified = 0; |
|
248 return len; |
|
249 memerr: |
|
250 sk_pop_free(intname.s, sk_internal_free); |
|
251 ASN1err(ASN1_F_X509_NAME_ENCODE, ERR_R_MALLOC_FAILURE); |
|
252 return -1; |
|
253 } |
|
254 |
|
255 |
|
256 EXPORT_C int X509_NAME_set(X509_NAME **xn, X509_NAME *name) |
|
257 { |
|
258 X509_NAME *in; |
|
259 |
|
260 if (!xn || !name) return(0); |
|
261 |
|
262 if (*xn != name) |
|
263 { |
|
264 in=X509_NAME_dup(name); |
|
265 if (in != NULL) |
|
266 { |
|
267 X509_NAME_free(*xn); |
|
268 *xn=in; |
|
269 } |
|
270 } |
|
271 return(*xn != NULL); |
|
272 } |
|
273 |
|
274 IMPLEMENT_STACK_OF(X509_NAME_ENTRY) |
|
275 IMPLEMENT_ASN1_SET_OF(X509_NAME_ENTRY) |