]>
Commit | Line | Data |
---|---|---|
d02b48c6 RE |
1 | /* crypto/x509/x509name.c */ |
2 | /* Copyright (C) 1995-1997 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 "stack.h" | |
61 | #include "cryptlib.h" | |
62 | #include "asn1.h" | |
63 | #include "objects.h" | |
64 | #include "evp.h" | |
65 | #include "x509.h" | |
66 | ||
67 | int X509_NAME_get_text_by_NID(name,nid,buf,len) | |
68 | X509_NAME *name; | |
69 | int nid; | |
70 | char *buf; | |
71 | int len; | |
72 | { | |
73 | ASN1_OBJECT *obj; | |
74 | ||
75 | obj=OBJ_nid2obj(nid); | |
76 | if (obj == NULL) return(-1); | |
77 | return(X509_NAME_get_text_by_OBJ(name,obj,buf,len)); | |
78 | } | |
79 | ||
80 | int X509_NAME_get_text_by_OBJ(name,obj,buf,len) | |
81 | X509_NAME *name; | |
82 | ASN1_OBJECT *obj; | |
83 | char *buf; | |
84 | int len; | |
85 | { | |
86 | int i; | |
87 | ASN1_STRING *data; | |
88 | ||
89 | i=X509_NAME_get_index_by_OBJ(name,obj,-1); | |
90 | if (i < 0) return(-1); | |
91 | data=X509_NAME_ENTRY_get_data(X509_NAME_get_entry(name,i)); | |
92 | i=(data->length > (len-1))?(len-1):data->length; | |
93 | if (buf == NULL) return(data->length); | |
94 | memcpy(buf,data->data,i); | |
95 | buf[i]='\0'; | |
96 | return(i); | |
97 | } | |
98 | ||
99 | int X509_NAME_entry_count(name) | |
100 | X509_NAME *name; | |
101 | { | |
102 | if (name == NULL) return(0); | |
103 | return(sk_num(name->entries)); | |
104 | } | |
105 | ||
106 | int X509_NAME_get_index_by_NID(name,nid,oldpos) | |
107 | X509_NAME *name; | |
108 | int nid; | |
109 | int oldpos; | |
110 | { | |
111 | ASN1_OBJECT *obj; | |
112 | ||
113 | obj=OBJ_nid2obj(nid); | |
114 | if (obj == NULL) return(-2); | |
115 | return(X509_NAME_get_index_by_OBJ(name,obj,oldpos)); | |
116 | } | |
117 | ||
118 | int X509_NAME_get_index_by_OBJ(name,obj,oldpos) | |
119 | X509_NAME *name; | |
120 | ASN1_OBJECT *obj; | |
121 | int oldpos; | |
122 | { | |
123 | int n; | |
124 | X509_NAME_ENTRY *ne; | |
125 | STACK *sk; | |
126 | ||
127 | if (name == NULL) return(-1); | |
128 | if (oldpos < 0) | |
129 | oldpos= -1; | |
130 | sk=name->entries; | |
131 | n=sk_num(sk); | |
132 | for (oldpos++; oldpos < n; oldpos++) | |
133 | { | |
134 | ne=(X509_NAME_ENTRY *)sk_value(sk,oldpos); | |
135 | if (OBJ_cmp(ne->object,obj) == 0) | |
136 | return(oldpos); | |
137 | } | |
138 | return(-1); | |
139 | } | |
140 | ||
141 | X509_NAME_ENTRY *X509_NAME_get_entry(name,loc) | |
142 | X509_NAME *name; | |
143 | int loc; | |
144 | { | |
145 | if ( (name == NULL) || (sk_num(name->entries) <= loc) || (loc < 0)) | |
146 | return(NULL); | |
147 | else | |
148 | return((X509_NAME_ENTRY *)sk_value(name->entries,loc)); | |
149 | } | |
150 | ||
151 | X509_NAME_ENTRY *X509_NAME_delete_entry(name,loc) | |
152 | X509_NAME *name; | |
153 | int loc; | |
154 | { | |
155 | X509_NAME_ENTRY *ret; | |
156 | int i,j,n,set_prev,set_next; | |
157 | STACK *sk; | |
158 | ||
159 | if ((name == NULL) || (sk_num(name->entries) <= loc) || (loc < 0)) | |
160 | return(NULL); | |
161 | sk=name->entries; | |
162 | ret=(X509_NAME_ENTRY *)sk_delete(sk,loc); | |
163 | n=sk_num(sk); | |
164 | name->modified=1; | |
165 | if (loc == n) return(ret); | |
166 | ||
167 | /* else we need to fixup the set field */ | |
168 | if (loc != 0) | |
169 | set_prev=((X509_NAME_ENTRY *)sk_value(sk,loc-1))->set; | |
170 | else | |
171 | set_prev=ret->set-1; | |
172 | set_next=((X509_NAME_ENTRY *)sk_value(sk,loc))->set; | |
173 | ||
174 | /* set_prev is the previous set | |
175 | * set is the current set | |
176 | * set_next is the following | |
177 | * prev 1 1 1 1 1 1 1 1 | |
178 | * set 1 1 2 2 | |
179 | * next 1 1 2 2 2 2 3 2 | |
180 | * so basically only if prev and next differ by 2, then | |
181 | * re-number down by 1 */ | |
182 | if (set_prev+1 < set_next) | |
183 | { | |
184 | j=set_next-set_prev-1; | |
185 | for (i=loc; i<n; i++) | |
186 | ((X509_NAME_ENTRY *)sk_value(sk,loc-1))->set-=j; | |
187 | } | |
188 | return(ret); | |
189 | } | |
190 | ||
191 | /* if set is -1, append to previous set, 0 'a new one', and 1, | |
192 | * prepend to the guy we are about to stomp on. */ | |
193 | int X509_NAME_add_entry(name,ne,loc,set) | |
194 | X509_NAME *name; | |
195 | X509_NAME_ENTRY *ne; | |
196 | int loc; | |
197 | int set; | |
198 | { | |
199 | X509_NAME_ENTRY *new_name=NULL; | |
200 | int n,i,inc; | |
201 | STACK *sk; | |
202 | ||
203 | if (name == NULL) return(0); | |
204 | sk=name->entries; | |
205 | n=sk_num(sk); | |
206 | if (loc > n) loc=n; | |
207 | else if (loc < 0) loc=n; | |
208 | ||
209 | name->modified=1; | |
210 | ||
211 | if (set == -1) | |
212 | { | |
213 | if (loc == 0) | |
214 | { | |
215 | set=0; | |
216 | inc=1; | |
217 | } | |
218 | else | |
219 | { | |
220 | set=((X509_NAME_ENTRY *)sk_value(sk,loc-1))->set; | |
221 | inc=0; | |
222 | } | |
223 | } | |
224 | else /* if (set >= 0) */ | |
225 | { | |
226 | if (loc >= n) | |
227 | { | |
228 | if (loc != 0) | |
229 | set=((X509_NAME_ENTRY *) | |
230 | sk_value(sk,loc-1))->set+1; | |
231 | else | |
232 | set=0; | |
233 | } | |
234 | else | |
235 | set=((X509_NAME_ENTRY *)sk_value(sk,loc))->set; | |
236 | inc=(set == 0)?1:0; | |
237 | } | |
238 | ||
239 | if ((new_name=X509_NAME_ENTRY_dup(ne)) == NULL) | |
240 | goto err; | |
241 | new_name->set=set; | |
242 | if (!sk_insert(sk,(char *)new_name,loc)) | |
243 | { | |
244 | X509err(X509_F_X509_NAME_ADD_ENTRY,ERR_R_MALLOC_FAILURE); | |
245 | goto err; | |
246 | } | |
247 | if (inc) | |
248 | { | |
249 | n=sk_num(sk); | |
250 | for (i=loc+1; i<n; i++) | |
251 | ((X509_NAME_ENTRY *)sk_value(sk,i-1))->set+=1; | |
252 | } | |
253 | return(1); | |
254 | err: | |
255 | if (new_name != NULL) | |
256 | X509_NAME_ENTRY_free(ne); | |
257 | return(0); | |
258 | } | |
259 | ||
260 | X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_NID(ne,nid,type,bytes,len) | |
261 | X509_NAME_ENTRY **ne; | |
262 | int nid; | |
263 | int type; | |
264 | unsigned char *bytes; | |
265 | int len; | |
266 | { | |
267 | ASN1_OBJECT *obj; | |
268 | ||
269 | obj=OBJ_nid2obj(nid); | |
270 | if (obj == NULL) | |
271 | { | |
272 | X509err(X509_F_X509_NAME_ENTRY_CREATE_BY_NID,X509_R_UNKNOWN_NID); | |
273 | return(NULL); | |
274 | } | |
275 | return(X509_NAME_ENTRY_create_by_OBJ(ne,obj,type,bytes,len)); | |
276 | } | |
277 | ||
278 | X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_OBJ(ne,obj,type,bytes,len) | |
279 | X509_NAME_ENTRY **ne; | |
280 | ASN1_OBJECT *obj; | |
281 | int type; | |
282 | unsigned char *bytes; | |
283 | int len; | |
284 | { | |
285 | X509_NAME_ENTRY *ret; | |
286 | ||
287 | if ((ne == NULL) || (*ne == NULL)) | |
288 | { | |
289 | if ((ret=X509_NAME_ENTRY_new()) == NULL) | |
290 | return(NULL); | |
291 | } | |
292 | else | |
293 | ret= *ne; | |
294 | ||
295 | if (!X509_NAME_ENTRY_set_object(ret,obj)) | |
296 | goto err; | |
297 | if (!X509_NAME_ENTRY_set_data(ret,type,bytes,len)) | |
298 | goto err; | |
299 | ||
300 | if ((ne != NULL) && (*ne == NULL)) *ne=ret; | |
301 | return(ret); | |
302 | err: | |
303 | if ((ne == NULL) || (ret != *ne)) | |
304 | X509_NAME_ENTRY_free(ret); | |
305 | return(NULL); | |
306 | } | |
307 | ||
308 | int X509_NAME_ENTRY_set_object(ne,obj) | |
309 | X509_NAME_ENTRY *ne; | |
310 | ASN1_OBJECT *obj; | |
311 | { | |
312 | if ((ne == NULL) || (obj == NULL)) | |
313 | { | |
314 | X509err(X509_F_X509_NAME_ENTRY_SET_OBJECT,ERR_R_PASSED_NULL_PARAMETER); | |
315 | return(0); | |
316 | } | |
317 | ASN1_OBJECT_free(ne->object); | |
318 | ne->object=OBJ_dup(obj); | |
319 | return((ne->object == NULL)?0:1); | |
320 | } | |
321 | ||
322 | int X509_NAME_ENTRY_set_data(ne,type,bytes,len) | |
323 | X509_NAME_ENTRY *ne; | |
324 | int type; | |
325 | unsigned char *bytes; | |
326 | int len; | |
327 | { | |
328 | int i; | |
329 | ||
330 | if ((ne == NULL) || ((bytes == NULL) && (len != 0))) return(0); | |
331 | if (len < 0) len=strlen((char *)bytes); | |
332 | i=ASN1_STRING_set(ne->value,bytes,len); | |
333 | if (!i) return(0); | |
334 | if (type != V_ASN1_UNDEF) | |
335 | { | |
336 | if (type == V_ASN1_APP_CHOOSE) | |
337 | ne->value->type=ASN1_PRINTABLE_type(bytes,len); | |
338 | else | |
339 | ne->value->type=type; | |
340 | } | |
341 | return(1); | |
342 | } | |
343 | ||
344 | ASN1_OBJECT *X509_NAME_ENTRY_get_object(ne) | |
345 | X509_NAME_ENTRY *ne; | |
346 | { | |
347 | if (ne == NULL) return(NULL); | |
348 | return(ne->object); | |
349 | } | |
350 | ||
351 | ASN1_STRING *X509_NAME_ENTRY_get_data(ne) | |
352 | X509_NAME_ENTRY *ne; | |
353 | { | |
354 | if (ne == NULL) return(NULL); | |
355 | return(ne->value); | |
356 | } | |
357 |