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