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