1 /* crypto/x509/x509name.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
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)"
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
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.]
67 int X509_NAME_get_text_by_NID(name,nid,buf,len)
76 if (obj == NULL) return(-1);
77 return(X509_NAME_get_text_by_OBJ(name,obj,buf,len));
80 int X509_NAME_get_text_by_OBJ(name,obj,buf,len)
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);
99 int X509_NAME_entry_count(name)
102 if (name == NULL) return(0);
103 return(sk_num(name->entries));
106 int X509_NAME_get_index_by_NID(name,nid,lastpos)
113 obj=OBJ_nid2obj(nid);
114 if (obj == NULL) return(-2);
115 return(X509_NAME_get_index_by_OBJ(name,obj,lastpos));
118 /* NOTE: you should be passsing -1, not 0 as lastpos */
119 int X509_NAME_get_index_by_OBJ(name,obj,lastpos)
128 if (name == NULL) return(-1);
133 for (lastpos++; lastpos < n; lastpos++)
135 ne=(X509_NAME_ENTRY *)sk_value(sk,lastpos);
136 if (OBJ_cmp(ne->object,obj) == 0)
142 X509_NAME_ENTRY *X509_NAME_get_entry(name,loc)
146 if ( (name == NULL) || (sk_num(name->entries) <= loc) || (loc < 0))
149 return((X509_NAME_ENTRY *)sk_value(name->entries,loc));
152 X509_NAME_ENTRY *X509_NAME_delete_entry(name,loc)
156 X509_NAME_ENTRY *ret;
157 int i,n,set_prev,set_next;
160 if ((name == NULL) || (sk_num(name->entries) <= loc) || (loc < 0))
163 ret=(X509_NAME_ENTRY *)sk_delete(sk,loc);
166 if (loc == n) return(ret);
168 /* else we need to fixup the set field */
170 set_prev=((X509_NAME_ENTRY *)sk_value(sk,loc-1))->set;
173 set_next=((X509_NAME_ENTRY *)sk_value(sk,loc))->set;
175 /* set_prev is the previous set
176 * set is the current set
177 * set_next is the following
178 * prev 1 1 1 1 1 1 1 1
180 * next 1 1 2 2 2 2 3 2
181 * so basically only if prev and next differ by 2, then
182 * re-number down by 1 */
183 if (set_prev+1 < set_next)
184 for (i=loc; i<n; i++)
185 ((X509_NAME_ENTRY *)sk_value(sk,i))->set--;
189 /* if set is -1, append to previous set, 0 'a new one', and 1,
190 * prepend to the guy we are about to stomp on. */
191 int X509_NAME_add_entry(name,ne,loc,set)
197 X509_NAME_ENTRY *new_name=NULL;
201 if (name == NULL) return(0);
205 else if (loc < 0) loc=n;
218 set=((X509_NAME_ENTRY *)sk_value(sk,loc-1))->set;
222 else /* if (set >= 0) */
227 set=((X509_NAME_ENTRY *)
228 sk_value(sk,loc-1))->set+1;
233 set=((X509_NAME_ENTRY *)sk_value(sk,loc))->set;
237 if ((new_name=X509_NAME_ENTRY_dup(ne)) == NULL)
240 if (!sk_insert(sk,(char *)new_name,loc))
242 X509err(X509_F_X509_NAME_ADD_ENTRY,ERR_R_MALLOC_FAILURE);
248 for (i=loc+1; i<n; i++)
249 ((X509_NAME_ENTRY *)sk_value(sk,i-1))->set+=1;
253 if (new_name != NULL)
254 X509_NAME_ENTRY_free(ne);
258 X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_NID(ne,nid,type,bytes,len)
259 X509_NAME_ENTRY **ne;
262 unsigned char *bytes;
267 obj=OBJ_nid2obj(nid);
270 X509err(X509_F_X509_NAME_ENTRY_CREATE_BY_NID,X509_R_UNKNOWN_NID);
273 return(X509_NAME_ENTRY_create_by_OBJ(ne,obj,type,bytes,len));
276 X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_OBJ(ne,obj,type,bytes,len)
277 X509_NAME_ENTRY **ne;
280 unsigned char *bytes;
283 X509_NAME_ENTRY *ret;
285 if ((ne == NULL) || (*ne == NULL))
287 if ((ret=X509_NAME_ENTRY_new()) == NULL)
293 if (!X509_NAME_ENTRY_set_object(ret,obj))
295 if (!X509_NAME_ENTRY_set_data(ret,type,bytes,len))
298 if ((ne != NULL) && (*ne == NULL)) *ne=ret;
301 if ((ne == NULL) || (ret != *ne))
302 X509_NAME_ENTRY_free(ret);
306 int X509_NAME_ENTRY_set_object(ne,obj)
310 if ((ne == NULL) || (obj == NULL))
312 X509err(X509_F_X509_NAME_ENTRY_SET_OBJECT,ERR_R_PASSED_NULL_PARAMETER);
315 ASN1_OBJECT_free(ne->object);
316 ne->object=OBJ_dup(obj);
317 return((ne->object == NULL)?0:1);
320 int X509_NAME_ENTRY_set_data(ne,type,bytes,len)
323 unsigned char *bytes;
328 if ((ne == NULL) || ((bytes == NULL) && (len != 0))) return(0);
329 if (len < 0) len=strlen((char *)bytes);
330 i=ASN1_STRING_set(ne->value,bytes,len);
332 if (type != V_ASN1_UNDEF)
334 if (type == V_ASN1_APP_CHOOSE)
335 ne->value->type=ASN1_PRINTABLE_type(bytes,len);
337 ne->value->type=type;
342 ASN1_OBJECT *X509_NAME_ENTRY_get_object(ne)
345 if (ne == NULL) return(NULL);
349 ASN1_STRING *X509_NAME_ENTRY_get_data(ne)
352 if (ne == NULL) return(NULL);