[thirdparty/openssl.git] / crypto / x509 / x509name.c

/* crypto/x509/x509name.c */
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
 * All rights reserved.
 *
 * This package is an SSL implementation written
 * by Eric Young (eay@cryptsoft.com).
 * The implementation was written so as to conform with Netscapes SSL.
 * 
 * This library is free for commercial and non-commercial use as long as
 * the following conditions are aheared to.  The following conditions
 * apply to all code found in this distribution, be it the RC4, RSA,
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
 * included with this distribution is covered by the same copyright terms
 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
 * 
 * Copyright remains Eric Young's, and as such any Copyright notices in
 * the code are not to be removed.
 * If this package is used in a product, Eric Young should be given attribution
 * as the author of the parts of the library used.
 * This can be in the form of a textual message at program startup or
 * in documentation (online or textual) provided with the package.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *    "This product includes cryptographic software written by
 *     Eric Young (eay@cryptsoft.com)"
 *    The word 'cryptographic' can be left out if the rouines from the library
 *    being used are not cryptographic related :-).
 * 4. If you include any Windows specific code (or a derivative thereof) from 
 *    the apps directory (application code) you must include an acknowledgement:
 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
 * 
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 * 
 * The licence and distribution terms for any publically available version or
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
 * copied and put under another distribution licence
 * [including the GNU Public Licence.]
 */

#include <stdio.h>
#include "stack.h"
#include "cryptlib.h"
#include "asn1.h"
#include "objects.h"
#include "evp.h"
#include "x509.h"

int X509_NAME_get_text_by_NID(name,nid,buf,len)
X509_NAME *name;
int nid;
char *buf;
int len;
	{
	ASN1_OBJECT *obj;

	obj=OBJ_nid2obj(nid);
	if (obj == NULL) return(-1);
	return(X509_NAME_get_text_by_OBJ(name,obj,buf,len));
	}

int X509_NAME_get_text_by_OBJ(name,obj,buf,len)
X509_NAME *name;
ASN1_OBJECT *obj;
char *buf;
int len;
	{
	int i;
	ASN1_STRING *data;

	i=X509_NAME_get_index_by_OBJ(name,obj,-1);
	if (i < 0) return(-1);
	data=X509_NAME_ENTRY_get_data(X509_NAME_get_entry(name,i));
	i=(data->length > (len-1))?(len-1):data->length;
	if (buf == NULL) return(data->length);
	memcpy(buf,data->data,i);
	buf[i]='\0';
	return(i);
	}

int X509_NAME_entry_count(name)
X509_NAME *name;
	{
	if (name == NULL) return(0);
	return(sk_num(name->entries));
	}

int X509_NAME_get_index_by_NID(name,nid,lastpos)
X509_NAME *name;
int nid;
int lastpos;
	{
	ASN1_OBJECT *obj;

	obj=OBJ_nid2obj(nid);
	if (obj == NULL) return(-2);
	return(X509_NAME_get_index_by_OBJ(name,obj,lastpos));
	}

/* NOTE: you should be passsing -1, not 0 as lastpos */
int X509_NAME_get_index_by_OBJ(name,obj,lastpos)
X509_NAME *name;
ASN1_OBJECT *obj;
int lastpos;
	{
	int n;
	X509_NAME_ENTRY *ne;
	STACK *sk;

	if (name == NULL) return(-1);
	if (lastpos < 0)
		lastpos= -1;
	sk=name->entries;
	n=sk_num(sk);
	for (lastpos++; lastpos < n; lastpos++)
		{
		ne=(X509_NAME_ENTRY *)sk_value(sk,lastpos);
		if (OBJ_cmp(ne->object,obj) == 0)
			return(lastpos);
		}
	return(-1);
	}

X509_NAME_ENTRY *X509_NAME_get_entry(name,loc)
X509_NAME *name;
int loc;
	{
	if (	(name == NULL) || (sk_num(name->entries) <= loc) || (loc < 0))
		return(NULL);
	else
		return((X509_NAME_ENTRY *)sk_value(name->entries,loc));
	}

X509_NAME_ENTRY *X509_NAME_delete_entry(name,loc)
X509_NAME *name;
int loc;
	{
	X509_NAME_ENTRY *ret;
	int i,j,n,set_prev,set_next;
	STACK *sk;

	if ((name == NULL) || (sk_num(name->entries) <= loc) || (loc < 0))
		return(NULL);
	sk=name->entries;
	ret=(X509_NAME_ENTRY *)sk_delete(sk,loc);
	n=sk_num(sk);
	name->modified=1;
	if (loc == n) return(ret);

	/* else we need to fixup the set field */
	if (loc != 0)
		set_prev=((X509_NAME_ENTRY *)sk_value(sk,loc-1))->set;
	else
		set_prev=ret->set-1;
	set_next=((X509_NAME_ENTRY *)sk_value(sk,loc))->set;

	/* set_prev is the previous set
	 * set is the current set
	 * set_next is the following
	 * prev  1 1	1 1	1 1	1 1
	 * set   1	1	2	2
	 * next  1 1	2 2	2 2	3 2
	 * so basically only if prev and next differ by 2, then
	 * re-number down by 1 */
	if (set_prev+1 < set_next)
		{
		j=set_next-set_prev-1;
		for (i=loc; i<n; i++)
			((X509_NAME_ENTRY *)sk_value(sk,loc-1))->set-=j;
		}
	return(ret);
	}

/* if set is -1, append to previous set, 0 'a new one', and 1,
 * prepend to the guy we are about to stomp on. */
int X509_NAME_add_entry(name,ne,loc,set)
X509_NAME *name;
X509_NAME_ENTRY *ne;
int loc;
int set;
	{
	X509_NAME_ENTRY *new_name=NULL;
	int n,i,inc;
	STACK *sk;

	if (name == NULL) return(0);
	sk=name->entries;
	n=sk_num(sk);
	if (loc > n) loc=n;
	else if (loc < 0) loc=n;

	name->modified=1;

	if (set == -1)
		{
		if (loc == 0)
			{
			set=0;
			inc=1;
			}
		else
			{
			set=((X509_NAME_ENTRY *)sk_value(sk,loc-1))->set;
			inc=0;
			}
		}
	else /* if (set >= 0) */
		{
		if (loc >= n)
			{
			if (loc != 0)
				set=((X509_NAME_ENTRY *)
					sk_value(sk,loc-1))->set+1;
			else
				set=0;
			}
		else
			set=((X509_NAME_ENTRY *)sk_value(sk,loc))->set;
		inc=(set == 0)?1:0;
		}

	if ((new_name=X509_NAME_ENTRY_dup(ne)) == NULL)
		goto err;
	new_name->set=set;
	if (!sk_insert(sk,(char *)new_name,loc))
		{
		X509err(X509_F_X509_NAME_ADD_ENTRY,ERR_R_MALLOC_FAILURE);
		goto err;
		}
	if (inc)
		{
		n=sk_num(sk);
		for (i=loc+1; i<n; i++)
			((X509_NAME_ENTRY *)sk_value(sk,i-1))->set+=1;
		}	
	return(1);
err:
	if (new_name != NULL)
		X509_NAME_ENTRY_free(ne);
	return(0);
	}

X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_NID(ne,nid,type,bytes,len)
X509_NAME_ENTRY **ne;
int nid;
int type;
unsigned char *bytes;
int len;
	{
	ASN1_OBJECT *obj;

	obj=OBJ_nid2obj(nid);
	if (obj == NULL)
		{
		X509err(X509_F_X509_NAME_ENTRY_CREATE_BY_NID,X509_R_UNKNOWN_NID);
		return(NULL);
		}
	return(X509_NAME_ENTRY_create_by_OBJ(ne,obj,type,bytes,len));
	}

X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_OBJ(ne,obj,type,bytes,len)
X509_NAME_ENTRY **ne;
ASN1_OBJECT *obj;
int type;
unsigned char *bytes;
int len;
	{
	X509_NAME_ENTRY *ret;

	if ((ne == NULL) || (*ne == NULL))
		{
		if ((ret=X509_NAME_ENTRY_new()) == NULL)
			return(NULL);
		}
	else
		ret= *ne;

	if (!X509_NAME_ENTRY_set_object(ret,obj))
		goto err;
	if (!X509_NAME_ENTRY_set_data(ret,type,bytes,len))
		goto err;
	
	if ((ne != NULL) && (*ne == NULL)) *ne=ret;
	return(ret);
err:
	if ((ne == NULL) || (ret != *ne))
		X509_NAME_ENTRY_free(ret);
	return(NULL);
	}

int X509_NAME_ENTRY_set_object(ne,obj)
X509_NAME_ENTRY *ne;
ASN1_OBJECT *obj;
	{
	if ((ne == NULL) || (obj == NULL))
		{
		X509err(X509_F_X509_NAME_ENTRY_SET_OBJECT,ERR_R_PASSED_NULL_PARAMETER);
		return(0);
		}
	ASN1_OBJECT_free(ne->object);
	ne->object=OBJ_dup(obj);
	return((ne->object == NULL)?0:1);
	}

int X509_NAME_ENTRY_set_data(ne,type,bytes,len)
X509_NAME_ENTRY *ne;
int type;
unsigned char *bytes;
int len;
	{
	int i;

	if ((ne == NULL) || ((bytes == NULL) && (len != 0))) return(0);
	if (len < 0) len=strlen((char *)bytes);
	i=ASN1_STRING_set(ne->value,bytes,len);
	if (!i) return(0);
	if (type != V_ASN1_UNDEF)
		{
		if (type == V_ASN1_APP_CHOOSE)
			ne->value->type=ASN1_PRINTABLE_type(bytes,len);
		else
			ne->value->type=type;
		}
	return(1);
	}

ASN1_OBJECT *X509_NAME_ENTRY_get_object(ne)
X509_NAME_ENTRY *ne;
	{
	if (ne == NULL) return(NULL);
	return(ne->object);
	}

ASN1_STRING *X509_NAME_ENTRY_get_data(ne)
X509_NAME_ENTRY *ne;
	{
	if (ne == NULL) return(NULL);
	return(ne->value);
	}
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
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
58964a49	106	int X509_NAME_get_index_by_NID(name,nid,lastpos)
d02b48c6 RE	107	X509_NAME *name;
d02b48c6 RE	108	int nid;
58964a49	109	int lastpos;
d02b48c6 RE	110	{
	111	ASN1_OBJECT *obj;
	112
	113	obj=OBJ_nid2obj(nid);
	114	if (obj == NULL) return(-2);
58964a49	115	return(X509_NAME_get_index_by_OBJ(name,obj,lastpos));
d02b48c6 RE	116	}
d02b48c6 RE	117
58964a49 RE	118	/* NOTE: you should be passsing -1, not 0 as lastpos */
58964a49 RE	119	int X509_NAME_get_index_by_OBJ(name,obj,lastpos)
d02b48c6 RE	120	X509_NAME *name;
d02b48c6 RE	121	ASN1_OBJECT *obj;
58964a49	122	int lastpos;
d02b48c6 RE	123	{
	124	int n;
	125	X509_NAME_ENTRY *ne;
	126	STACK *sk;
	127
	128	if (name == NULL) return(-1);
58964a49 RE	129	if (lastpos < 0)
58964a49 RE	130	lastpos= -1;
d02b48c6 RE	131	sk=name->entries;
d02b48c6 RE	132	n=sk_num(sk);
58964a49	133	for (lastpos++; lastpos < n; lastpos++)
d02b48c6	134	{
58964a49	135	ne=(X509_NAME_ENTRY *)sk_value(sk,lastpos);
d02b48c6	136	if (OBJ_cmp(ne->object,obj) == 0)
58964a49	137	return(lastpos);
d02b48c6 RE	138	}
	139	return(-1);
	140	}
	141
	142	X509_NAME_ENTRY *X509_NAME_get_entry(name,loc)
	143	X509_NAME *name;
	144	int loc;
	145	{
	146	if ( (name == NULL) \|\| (sk_num(name->entries) <= loc) \|\| (loc < 0))
	147	return(NULL);
	148	else
	149	return((X509_NAME_ENTRY *)sk_value(name->entries,loc));
	150	}
	151
	152	X509_NAME_ENTRY *X509_NAME_delete_entry(name,loc)
	153	X509_NAME *name;
	154	int loc;
	155	{
	156	X509_NAME_ENTRY *ret;
	157	int i,j,n,set_prev,set_next;
	158	STACK *sk;
	159
	160	if ((name == NULL) \|\| (sk_num(name->entries) <= loc) \|\| (loc < 0))
	161	return(NULL);
	162	sk=name->entries;
	163	ret=(X509_NAME_ENTRY *)sk_delete(sk,loc);
	164	n=sk_num(sk);
	165	name->modified=1;
	166	if (loc == n) return(ret);
	167
	168	/* else we need to fixup the set field */
	169	if (loc != 0)
	170	set_prev=((X509_NAME_ENTRY *)sk_value(sk,loc-1))->set;
	171	else
	172	set_prev=ret->set-1;
	173	set_next=((X509_NAME_ENTRY *)sk_value(sk,loc))->set;
	174
	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
	179	* set 1 1 2 2
	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	{
	185	j=set_next-set_prev-1;
	186	for (i=loc; i<n; i++)
	187	((X509_NAME_ENTRY *)sk_value(sk,loc-1))->set-=j;
	188	}
	189	return(ret);
	190	}
	191
	192	/* if set is -1, append to previous set, 0 'a new one', and 1,
	193	* prepend to the guy we are about to stomp on. */
	194	int X509_NAME_add_entry(name,ne,loc,set)
	195	X509_NAME *name;
	196	X509_NAME_ENTRY *ne;
	197	int loc;
	198	int set;
	199	{
	200	X509_NAME_ENTRY *new_name=NULL;
	201	int n,i,inc;
202	STACK *sk;
203
204	if (name == NULL) return(0);
205	sk=name->entries;
206	n=sk_num(sk);
207	if (loc > n) loc=n;
208	else if (loc < 0) loc=n;
209
210	name->modified=1;
211
212	if (set == -1)
213	{
214	if (loc == 0)
215	{
216	set=0;
217	inc=1;
218	}
219	else
220	{
221	set=((X509_NAME_ENTRY *)sk_value(sk,loc-1))->set;
222	inc=0;
223	}
224	}
225	else /* if (set >= 0) */
226	{
227	if (loc >= n)
228	{
229	if (loc != 0)
230	set=((X509_NAME_ENTRY *)
231	sk_value(sk,loc-1))->set+1;
232	else
233	set=0;
234	}
235	else
236	set=((X509_NAME_ENTRY *)sk_value(sk,loc))->set;
237	inc=(set == 0)?1:0;
238	}
239
240	if ((new_name=X509_NAME_ENTRY_dup(ne)) == NULL)
241	goto err;
242	new_name->set=set;
243	if (!sk_insert(sk,(char *)new_name,loc))
244	{
245	X509err(X509_F_X509_NAME_ADD_ENTRY,ERR_R_MALLOC_FAILURE);
246	goto err;
247	}
248	if (inc)
249	{
250	n=sk_num(sk);
251	for (i=loc+1; i<n; i++)
252	((X509_NAME_ENTRY *)sk_value(sk,i-1))->set+=1;
253	}
254	return(1);
255	err:
256	if (new_name != NULL)
257	X509_NAME_ENTRY_free(ne);
258	return(0);
259	}
260
261	X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_NID(ne,nid,type,bytes,len)
262	X509_NAME_ENTRY **ne;
263	int nid;
264	int type;
265	unsigned char *bytes;
266	int len;
267	{
268	ASN1_OBJECT *obj;
269
270	obj=OBJ_nid2obj(nid);
271	if (obj == NULL)
272	{
273	X509err(X509_F_X509_NAME_ENTRY_CREATE_BY_NID,X509_R_UNKNOWN_NID);
274	return(NULL);
275	}
276	return(X509_NAME_ENTRY_create_by_OBJ(ne,obj,type,bytes,len));
277	}
278
279	X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_OBJ(ne,obj,type,bytes,len)
280	X509_NAME_ENTRY **ne;
281	ASN1_OBJECT *obj;
282	int type;
283	unsigned char *bytes;
284	int len;
285	{
286	X509_NAME_ENTRY *ret;
287
288	if ((ne == NULL) \|\| (*ne == NULL))
289	{
290	if ((ret=X509_NAME_ENTRY_new()) == NULL)
291	return(NULL);
292	}
293	else
294	ret= *ne;
295
296	if (!X509_NAME_ENTRY_set_object(ret,obj))
297	goto err;
298	if (!X509_NAME_ENTRY_set_data(ret,type,bytes,len))
299	goto err;
300
301	if ((ne != NULL) && (ne == NULL)) ne=ret;
302	return(ret);
303	err:
304	if ((ne == NULL) \|\| (ret != *ne))
305	X509_NAME_ENTRY_free(ret);
306	return(NULL);
307	}
308
309	int X509_NAME_ENTRY_set_object(ne,obj)
310	X509_NAME_ENTRY *ne;
311	ASN1_OBJECT *obj;
312	{
313	if ((ne == NULL) \|\| (obj == NULL))
314	{
315	X509err(X509_F_X509_NAME_ENTRY_SET_OBJECT,ERR_R_PASSED_NULL_PARAMETER);
316	return(0);
317	}
318	ASN1_OBJECT_free(ne->object);
319	ne->object=OBJ_dup(obj);
320	return((ne->object == NULL)?0:1);
321	}
322
323	int X509_NAME_ENTRY_set_data(ne,type,bytes,len)
324	X509_NAME_ENTRY *ne;
325	int type;
326	unsigned char *bytes;
327	int len;
328	{
329	int i;
330
331	if ((ne == NULL) \|\| ((bytes == NULL) && (len != 0))) return(0);
332	if (len < 0) len=strlen((char *)bytes);
333	i=ASN1_STRING_set(ne->value,bytes,len);
334	if (!i) return(0);
335	if (type != V_ASN1_UNDEF)
336	{
337	if (type == V_ASN1_APP_CHOOSE)
338	ne->value->type=ASN1_PRINTABLE_type(bytes,len);
339	else
340	ne->value->type=type;
341	}
342	return(1);
343	}
344
345	ASN1_OBJECT *X509_NAME_ENTRY_get_object(ne)
346	X509_NAME_ENTRY *ne;
347	{
348	if (ne == NULL) return(NULL);
349	return(ne->object);
350	}
351
352	ASN1_STRING *X509_NAME_ENTRY_get_data(ne)
353	X509_NAME_ENTRY *ne;
354	{
355	if (ne == NULL) return(NULL);
356	return(ne->value);
357	}
358