diff options
Diffstat (limited to 'src/lib/libcrypto/asn1/x_name.c')
-rw-r--r-- | src/lib/libcrypto/asn1/x_name.c | 295 |
1 files changed, 295 insertions, 0 deletions
diff --git a/src/lib/libcrypto/asn1/x_name.c b/src/lib/libcrypto/asn1/x_name.c new file mode 100644 index 0000000000..28b9c34b58 --- /dev/null +++ b/src/lib/libcrypto/asn1/x_name.c | |||
@@ -0,0 +1,295 @@ | |||
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 "objects.h" | ||
62 | #include "asn1_mac.h" | ||
63 | |||
64 | /* | ||
65 | * ASN1err(ASN1_F_D2I_X509_NAME,ASN1_R_LENGTH_MISMATCH); | ||
66 | * ASN1err(ASN1_F_X509_NAME_NEW,ASN1_R_UNKNOWN_ATTRIBUTE_TYPE); | ||
67 | * ASN1err(ASN1_F_D2I_X509_NAME_ENTRY,ASN1_R_LENGTH_MISMATCH); | ||
68 | * ASN1err(ASN1_F_X509_NAME_ENTRY_NEW,ASN1_R_UNKNOWN_ATTRIBUTE_TYPE); | ||
69 | */ | ||
70 | |||
71 | #ifndef NOPROTO | ||
72 | static int i2d_X509_NAME_entries(X509_NAME *a); | ||
73 | #else | ||
74 | static int i2d_X509_NAME_entries(); | ||
75 | #endif | ||
76 | |||
77 | int i2d_X509_NAME_ENTRY(a,pp) | ||
78 | X509_NAME_ENTRY *a; | ||
79 | unsigned char **pp; | ||
80 | { | ||
81 | M_ASN1_I2D_vars(a); | ||
82 | |||
83 | M_ASN1_I2D_len(a->object,i2d_ASN1_OBJECT); | ||
84 | M_ASN1_I2D_len(a->value,i2d_ASN1_PRINTABLE); | ||
85 | |||
86 | M_ASN1_I2D_seq_total(); | ||
87 | |||
88 | M_ASN1_I2D_put(a->object,i2d_ASN1_OBJECT); | ||
89 | M_ASN1_I2D_put(a->value,i2d_ASN1_PRINTABLE); | ||
90 | |||
91 | M_ASN1_I2D_finish(); | ||
92 | } | ||
93 | |||
94 | X509_NAME_ENTRY *d2i_X509_NAME_ENTRY(a,pp,length) | ||
95 | X509_NAME_ENTRY **a; | ||
96 | unsigned char **pp; | ||
97 | long length; | ||
98 | { | ||
99 | M_ASN1_D2I_vars(a,X509_NAME_ENTRY *,X509_NAME_ENTRY_new); | ||
100 | |||
101 | M_ASN1_D2I_Init(); | ||
102 | M_ASN1_D2I_start_sequence(); | ||
103 | M_ASN1_D2I_get(ret->object,d2i_ASN1_OBJECT); | ||
104 | M_ASN1_D2I_get(ret->value,d2i_ASN1_PRINTABLE); | ||
105 | ret->set=0; | ||
106 | M_ASN1_D2I_Finish(a,X509_NAME_ENTRY_free,ASN1_F_D2I_X509_NAME_ENTRY); | ||
107 | } | ||
108 | |||
109 | int i2d_X509_NAME(a,pp) | ||
110 | X509_NAME *a; | ||
111 | unsigned char **pp; | ||
112 | { | ||
113 | int ret; | ||
114 | |||
115 | if (a == NULL) return(0); | ||
116 | if (a->modified) | ||
117 | { | ||
118 | ret=i2d_X509_NAME_entries(a); | ||
119 | if (ret < 0) return(ret); | ||
120 | } | ||
121 | |||
122 | ret=a->bytes->length; | ||
123 | if (pp != NULL) | ||
124 | { | ||
125 | memcpy(*pp,a->bytes->data,ret); | ||
126 | *pp+=ret; | ||
127 | } | ||
128 | return(ret); | ||
129 | } | ||
130 | |||
131 | static int i2d_X509_NAME_entries(a) | ||
132 | X509_NAME *a; | ||
133 | { | ||
134 | X509_NAME_ENTRY *ne,*fe=NULL; | ||
135 | STACK *sk; | ||
136 | BUF_MEM *buf=NULL; | ||
137 | int set=0,r,ret=0; | ||
138 | int i; | ||
139 | unsigned char *p; | ||
140 | int size=0; | ||
141 | |||
142 | sk=a->entries; | ||
143 | for (i=0; i<sk_num(sk); i++) | ||
144 | { | ||
145 | ne=(X509_NAME_ENTRY *)sk_value(sk,i); | ||
146 | if (fe == NULL) | ||
147 | { | ||
148 | fe=ne; | ||
149 | size=0; | ||
150 | } | ||
151 | |||
152 | if (ne->set != set) | ||
153 | { | ||
154 | ret+=ASN1_object_size(1,size,V_ASN1_SET); | ||
155 | fe->size=size; | ||
156 | fe=ne; | ||
157 | size=0; | ||
158 | set=ne->set; | ||
159 | } | ||
160 | size+=i2d_X509_NAME_ENTRY(ne,NULL); | ||
161 | } | ||
162 | |||
163 | ret+=ASN1_object_size(1,size,V_ASN1_SET); | ||
164 | if (fe != NULL) | ||
165 | fe->size=size; | ||
166 | |||
167 | r=ASN1_object_size(1,ret,V_ASN1_SEQUENCE); | ||
168 | |||
169 | buf=a->bytes; | ||
170 | if (!BUF_MEM_grow(buf,r)) goto err; | ||
171 | p=(unsigned char *)buf->data; | ||
172 | |||
173 | ASN1_put_object(&p,1,ret,V_ASN1_SEQUENCE,V_ASN1_UNIVERSAL); | ||
174 | |||
175 | set= -1; | ||
176 | for (i=0; i<sk_num(sk); i++) | ||
177 | { | ||
178 | ne=(X509_NAME_ENTRY *)sk_value(sk,i); | ||
179 | if (set != ne->set) | ||
180 | { | ||
181 | set=ne->set; | ||
182 | ASN1_put_object(&p,1,ne->size, | ||
183 | V_ASN1_SET,V_ASN1_UNIVERSAL); | ||
184 | } | ||
185 | i2d_X509_NAME_ENTRY(ne,&p); | ||
186 | } | ||
187 | a->modified=0; | ||
188 | return(r); | ||
189 | err: | ||
190 | return(-1); | ||
191 | } | ||
192 | |||
193 | X509_NAME *d2i_X509_NAME(a,pp,length) | ||
194 | X509_NAME **a; | ||
195 | unsigned char **pp; | ||
196 | long length; | ||
197 | { | ||
198 | int set=0,i; | ||
199 | int idx=0; | ||
200 | unsigned char *orig; | ||
201 | M_ASN1_D2I_vars(a,X509_NAME *,X509_NAME_new); | ||
202 | |||
203 | orig= *pp; | ||
204 | if (sk_num(ret->entries) > 0) | ||
205 | { | ||
206 | while (sk_num(ret->entries) > 0) | ||
207 | X509_NAME_ENTRY_free((X509_NAME_ENTRY *) | ||
208 | sk_pop(ret->entries)); | ||
209 | } | ||
210 | |||
211 | M_ASN1_D2I_Init(); | ||
212 | M_ASN1_D2I_start_sequence(); | ||
213 | for (;;) | ||
214 | { | ||
215 | if (M_ASN1_D2I_end_sequence()) break; | ||
216 | M_ASN1_D2I_get_set(ret->entries,d2i_X509_NAME_ENTRY); | ||
217 | for (; idx < sk_num(ret->entries); idx++) | ||
218 | { | ||
219 | ((X509_NAME_ENTRY *)sk_value(ret->entries,idx))->set= | ||
220 | set; | ||
221 | } | ||
222 | set++; | ||
223 | } | ||
224 | |||
225 | i=(int)(c.p-orig); | ||
226 | if (!BUF_MEM_grow(ret->bytes,i)) goto err; | ||
227 | memcpy(ret->bytes->data,orig,i); | ||
228 | ret->bytes->length=i; | ||
229 | ret->modified=0; | ||
230 | |||
231 | M_ASN1_D2I_Finish(a,X509_NAME_free,ASN1_F_D2I_X509_NAME); | ||
232 | } | ||
233 | |||
234 | X509_NAME *X509_NAME_new() | ||
235 | { | ||
236 | X509_NAME *ret=NULL; | ||
237 | |||
238 | M_ASN1_New_Malloc(ret,X509_NAME); | ||
239 | if ((ret->entries=sk_new(NULL)) == NULL) goto err2; | ||
240 | M_ASN1_New(ret->bytes,BUF_MEM_new); | ||
241 | ret->modified=1; | ||
242 | return(ret); | ||
243 | M_ASN1_New_Error(ASN1_F_X509_NAME_NEW); | ||
244 | } | ||
245 | |||
246 | X509_NAME_ENTRY *X509_NAME_ENTRY_new() | ||
247 | { | ||
248 | X509_NAME_ENTRY *ret=NULL; | ||
249 | |||
250 | M_ASN1_New_Malloc(ret,X509_NAME_ENTRY); | ||
251 | /* M_ASN1_New(ret->object,ASN1_OBJECT_new);*/ | ||
252 | ret->object=NULL; | ||
253 | ret->set=0; | ||
254 | M_ASN1_New(ret->value,ASN1_STRING_new); | ||
255 | return(ret); | ||
256 | M_ASN1_New_Error(ASN1_F_X509_NAME_ENTRY_NEW); | ||
257 | } | ||
258 | |||
259 | void X509_NAME_free(a) | ||
260 | X509_NAME *a; | ||
261 | { | ||
262 | BUF_MEM_free(a->bytes); | ||
263 | sk_pop_free(a->entries,X509_NAME_ENTRY_free); | ||
264 | Free((char *)a); | ||
265 | } | ||
266 | |||
267 | void X509_NAME_ENTRY_free(a) | ||
268 | X509_NAME_ENTRY *a; | ||
269 | { | ||
270 | if (a == NULL) return; | ||
271 | ASN1_OBJECT_free(a->object); | ||
272 | ASN1_BIT_STRING_free(a->value); | ||
273 | Free((char *)a); | ||
274 | } | ||
275 | |||
276 | int X509_NAME_set(xn,name) | ||
277 | X509_NAME **xn; | ||
278 | X509_NAME *name; | ||
279 | { | ||
280 | X509_NAME *in; | ||
281 | |||
282 | if (*xn == NULL) return(0); | ||
283 | |||
284 | if (*xn != name) | ||
285 | { | ||
286 | in=X509_NAME_dup(name); | ||
287 | if (in != NULL) | ||
288 | { | ||
289 | X509_NAME_free(*xn); | ||
290 | *xn=in; | ||
291 | } | ||
292 | } | ||
293 | return(*xn != NULL); | ||
294 | } | ||
295 | |||