diff options
Diffstat (limited to 'src/lib/libcrypto/evp/names.c')
-rw-r--r-- | src/lib/libcrypto/evp/names.c | 285 |
1 files changed, 285 insertions, 0 deletions
diff --git a/src/lib/libcrypto/evp/names.c b/src/lib/libcrypto/evp/names.c new file mode 100644 index 0000000000..e0774da20d --- /dev/null +++ b/src/lib/libcrypto/evp/names.c | |||
@@ -0,0 +1,285 @@ | |||
1 | /* crypto/evp/names.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 "evp.h" | ||
62 | #include "objects.h" | ||
63 | |||
64 | typedef struct aliases_st { | ||
65 | char *alias; | ||
66 | /* This must be the last field becaue I will allocate things | ||
67 | * so they go off the end of it */ | ||
68 | char name[4]; | ||
69 | } ALIASES; | ||
70 | |||
71 | static STACK /* ALIASES */ *aliases=NULL; | ||
72 | static STACK /* EVP_CIPHERS */ *ciphers=NULL; | ||
73 | static STACK /* EVP_MD */ *digests=NULL; | ||
74 | |||
75 | static int cipher_nid_cmp(a,b) | ||
76 | EVP_CIPHER **a,**b; | ||
77 | { return((*a)->nid - (*b)->nid); } | ||
78 | |||
79 | static int digest_type_cmp(a,b) | ||
80 | EVP_MD **a,**b; | ||
81 | { return((*a)->pkey_type - (*b)->pkey_type); } | ||
82 | |||
83 | int EVP_add_cipher(c) | ||
84 | EVP_CIPHER *c; | ||
85 | { | ||
86 | int i; | ||
87 | |||
88 | if (ciphers == NULL) | ||
89 | { | ||
90 | ciphers=sk_new(cipher_nid_cmp); | ||
91 | if (ciphers == NULL) return(0); | ||
92 | } | ||
93 | if ((i=sk_find(ciphers,(char *)c)) >= 0) | ||
94 | { | ||
95 | if (sk_value(ciphers,i) == (char *)c) | ||
96 | return(1); | ||
97 | sk_delete(ciphers,i); | ||
98 | } | ||
99 | return(sk_push(ciphers,(char *)c)); | ||
100 | } | ||
101 | |||
102 | int EVP_add_digest(md) | ||
103 | EVP_MD *md; | ||
104 | { | ||
105 | int i; | ||
106 | char *n; | ||
107 | |||
108 | if (digests == NULL) | ||
109 | { | ||
110 | digests=sk_new(digest_type_cmp); | ||
111 | if (digests == NULL) return(0); | ||
112 | } | ||
113 | if ((i=sk_find(digests,(char *)md)) >= 0) | ||
114 | { | ||
115 | if (sk_value(digests,i) == (char *)md) | ||
116 | return(1); | ||
117 | sk_delete(digests,i); | ||
118 | } | ||
119 | if (md->type != md->pkey_type) | ||
120 | { | ||
121 | n=OBJ_nid2sn(md->pkey_type); | ||
122 | EVP_add_alias(n,OBJ_nid2sn(md->type)); | ||
123 | EVP_add_alias(n,OBJ_nid2ln(md->type)); | ||
124 | } | ||
125 | sk_push(digests,(char *)md); | ||
126 | return(1); | ||
127 | } | ||
128 | |||
129 | static int alias_cmp(a,b) | ||
130 | ALIASES **a,**b; | ||
131 | { | ||
132 | return(strcmp((*a)->alias,(*b)->alias)); | ||
133 | } | ||
134 | |||
135 | int EVP_add_alias(name,aname) | ||
136 | char *name; | ||
137 | char *aname; | ||
138 | { | ||
139 | int l1,l2,i; | ||
140 | ALIASES *a; | ||
141 | char *p; | ||
142 | |||
143 | if ((name == NULL) || (aname == NULL)) return(0); | ||
144 | l1=strlen(name)+1; | ||
145 | l2=strlen(aname)+1; | ||
146 | i=sizeof(ALIASES)+l1+l2; | ||
147 | if ((a=(ALIASES *)Malloc(i)) == NULL) | ||
148 | return(0); | ||
149 | strcpy(a->name,name); | ||
150 | p= &(a->name[l1]); | ||
151 | strcpy(p,aname); | ||
152 | a->alias=p; | ||
153 | |||
154 | if (aliases == NULL) | ||
155 | { | ||
156 | aliases=sk_new(alias_cmp); | ||
157 | if (aliases == NULL) goto err; | ||
158 | } | ||
159 | |||
160 | if ((i=sk_find(aliases,(char *)a)) >= 0) | ||
161 | { | ||
162 | Free(sk_delete(aliases,i)); | ||
163 | } | ||
164 | if (!sk_push(aliases,(char *)a)) goto err; | ||
165 | return(1); | ||
166 | err: | ||
167 | return(0); | ||
168 | } | ||
169 | |||
170 | int EVP_delete_alias(name) | ||
171 | char *name; | ||
172 | { | ||
173 | ALIASES a; | ||
174 | int i; | ||
175 | |||
176 | if (aliases != NULL) | ||
177 | { | ||
178 | a.alias=name; | ||
179 | if ((i=sk_find(aliases,(char *)&a)) >= 0) | ||
180 | { | ||
181 | Free(sk_delete(aliases,i)); | ||
182 | return(1); | ||
183 | } | ||
184 | } | ||
185 | return(0); | ||
186 | } | ||
187 | |||
188 | EVP_CIPHER *EVP_get_cipherbyname(name) | ||
189 | char *name; | ||
190 | { | ||
191 | int nid,num=6,i; | ||
192 | EVP_CIPHER c,*cp; | ||
193 | ALIASES a,*ap; | ||
194 | |||
195 | if (ciphers == NULL) return(NULL); | ||
196 | for (;;) | ||
197 | { | ||
198 | if (num-- <= 0) return(NULL); | ||
199 | if (aliases != NULL) | ||
200 | { | ||
201 | a.alias=name; | ||
202 | i=sk_find(aliases,(char *)&a); | ||
203 | if (i >= 0) | ||
204 | { | ||
205 | ap=(ALIASES *)sk_value(aliases,i); | ||
206 | name=ap->name; | ||
207 | continue; | ||
208 | } | ||
209 | } | ||
210 | |||
211 | nid=OBJ_txt2nid(name); | ||
212 | if (nid == NID_undef) return(NULL); | ||
213 | c.nid=nid; | ||
214 | i=sk_find(ciphers,(char *)&c); | ||
215 | if (i >= 0) | ||
216 | { | ||
217 | cp=(EVP_CIPHER *)sk_value(ciphers,i); | ||
218 | return(cp); | ||
219 | } | ||
220 | else | ||
221 | return(NULL); | ||
222 | } | ||
223 | } | ||
224 | |||
225 | EVP_MD *EVP_get_digestbyname(name) | ||
226 | char *name; | ||
227 | { | ||
228 | int nid,num=6,i; | ||
229 | EVP_MD c,*cp; | ||
230 | ALIASES a,*ap; | ||
231 | |||
232 | if (digests == NULL) return(NULL); | ||
233 | |||
234 | for (;;) | ||
235 | { | ||
236 | if (num-- <= 0) return(NULL); | ||
237 | |||
238 | if (aliases != NULL) | ||
239 | { | ||
240 | a.alias=name; | ||
241 | i=sk_find(aliases,(char *)&a); | ||
242 | if (i >= 0) | ||
243 | { | ||
244 | ap=(ALIASES *)sk_value(aliases,i); | ||
245 | name=ap->name; | ||
246 | continue; | ||
247 | } | ||
248 | } | ||
249 | |||
250 | nid=OBJ_txt2nid(name); | ||
251 | if (nid == NID_undef) return(NULL); | ||
252 | c.pkey_type=nid; | ||
253 | i=sk_find(digests,(char *)&c); | ||
254 | if (i >= 0) | ||
255 | { | ||
256 | cp=(EVP_MD *)sk_value(digests,i); | ||
257 | return(cp); | ||
258 | } | ||
259 | else | ||
260 | return(NULL); | ||
261 | } | ||
262 | } | ||
263 | |||
264 | void EVP_cleanup() | ||
265 | { | ||
266 | int i; | ||
267 | |||
268 | if (aliases != NULL) | ||
269 | { | ||
270 | for (i=0; i<sk_num(aliases); i++) | ||
271 | Free(sk_value(aliases,i)); | ||
272 | sk_free(aliases); | ||
273 | aliases=NULL; | ||
274 | } | ||
275 | if (ciphers != NULL) | ||
276 | { | ||
277 | sk_free(ciphers); | ||
278 | ciphers=NULL; | ||
279 | } | ||
280 | if (digests != NULL) | ||
281 | { | ||
282 | sk_free(digests); | ||
283 | digests=NULL; | ||
284 | } | ||
285 | } | ||