Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	lib/libcrypto/x509/x509name.c	Lines:	93	170	54.7 %
Date:	2017-11-07	Branches:	44	112	39.3 %


/* $OpenBSD: x509name.c,v 1.14 2017/01/29 17:49:23 beck Exp $ */
/* 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 <string.h>

#include <openssl/asn1.h>
#include <openssl/err.h>
#include <openssl/evp.h>
#include <openssl/objects.h>
#include <openssl/stack.h>
#include <openssl/x509.h>

int
X509_NAME_get_text_by_NID(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(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);
	if (i >= 0) {
		memcpy(buf, data->data, i);
		buf[i] = '\0';
	}
	return (i);
}

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

int
X509_NAME_get_index_by_NID(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(X509_NAME *name, ASN1_OBJECT *obj, int lastpos)
{
	int n;
	X509_NAME_ENTRY *ne;
	STACK_OF(X509_NAME_ENTRY) *sk;

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

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

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

	if (name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc ||
	    loc < 0)
		return (NULL);
	sk = name->entries;
	ret = sk_X509_NAME_ENTRY_delete(sk, loc);
	n = sk_X509_NAME_ENTRY_num(sk);
	name->modified = 1;
	if (loc == n)
		return (ret);

	/* else we need to fixup the set field */
	if (loc != 0)
		set_prev = (sk_X509_NAME_ENTRY_value(sk, loc - 1))->set;
	else
		set_prev = ret->set - 1;
	set_next = sk_X509_NAME_ENTRY_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)
		for (i = loc; i < n; i++)
			sk_X509_NAME_ENTRY_value(sk, i)->set--;
	return (ret);
}

int
X509_NAME_add_entry_by_OBJ(X509_NAME *name, ASN1_OBJECT *obj, int type,
    unsigned char *bytes, int len, int loc, int set)
{
	X509_NAME_ENTRY *ne;
	int ret;

	ne = X509_NAME_ENTRY_create_by_OBJ(NULL, obj, type, bytes, len);
	if (!ne)
		return 0;
	ret = X509_NAME_add_entry(name, ne, loc, set);
	X509_NAME_ENTRY_free(ne);
	return ret;
}

int
X509_NAME_add_entry_by_NID(X509_NAME *name, int nid, int type,
    unsigned char *bytes, int len, int loc, int set)
{
	X509_NAME_ENTRY *ne;
	int ret;

	ne = X509_NAME_ENTRY_create_by_NID(NULL, nid, type, bytes, len);
	if (!ne)
		return 0;
	ret = X509_NAME_add_entry(name, ne, loc, set);
	X509_NAME_ENTRY_free(ne);
	return ret;
}

int
X509_NAME_add_entry_by_txt(X509_NAME *name, const char *field, int type,
    const unsigned char *bytes, int len, int loc, int set)
{
	X509_NAME_ENTRY *ne;
	int ret;

	ne = X509_NAME_ENTRY_create_by_txt(NULL, field, type, bytes, len);
	if (!ne)
		return 0;
	ret = X509_NAME_add_entry(name, ne, loc, set);
	X509_NAME_ENTRY_free(ne);
	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(X509_NAME *name, X509_NAME_ENTRY *ne, int loc, int set)
{
	X509_NAME_ENTRY *new_name = NULL;
	int n, i, inc;
	STACK_OF(X509_NAME_ENTRY) *sk;

	if (name == NULL)
		return (0);
	sk = name->entries;
	n = sk_X509_NAME_ENTRY_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 = sk_X509_NAME_ENTRY_value(sk, loc - 1)->set;
			inc = 0;
		}
	} else /* if (set >= 0) */ {
		if (loc >= n) {
			if (loc != 0)
				set = sk_X509_NAME_ENTRY_value(sk, loc - 1)->set + 1;
			else
				set = 0;
		} else
			set = sk_X509_NAME_ENTRY_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_X509_NAME_ENTRY_insert(sk, new_name, loc)) {
		X509error(ERR_R_MALLOC_FAILURE);
		goto err;
	}
	if (inc) {
		n = sk_X509_NAME_ENTRY_num(sk);
		for (i = loc + 1; i < n; i++)
			sk_X509_NAME_ENTRY_value(sk, i - 1)->set += 1;
	}
	return (1);

err:
	if (new_name != NULL)
		X509_NAME_ENTRY_free(new_name);
	return (0);
}

X509_NAME_ENTRY *
X509_NAME_ENTRY_create_by_txt(X509_NAME_ENTRY **ne,
    const char *field, int type, const unsigned char *bytes, int len)
{
	ASN1_OBJECT *obj;
	X509_NAME_ENTRY *nentry;

	obj = OBJ_txt2obj(field, 0);
	if (obj == NULL) {
		X509error(X509_R_INVALID_FIELD_NAME);
		ERR_asprintf_error_data("name=%s", field);
		return (NULL);
	}
	nentry = X509_NAME_ENTRY_create_by_OBJ(ne, obj, type, bytes, len);
	ASN1_OBJECT_free(obj);
	return nentry;
}

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

	obj = OBJ_nid2obj(nid);
	if (obj == NULL) {
		X509error(X509_R_UNKNOWN_NID);
		return (NULL);
	}
	nentry = X509_NAME_ENTRY_create_by_OBJ(ne, obj, type, bytes, len);
	ASN1_OBJECT_free(obj);
	return nentry;
}

X509_NAME_ENTRY *
X509_NAME_ENTRY_create_by_OBJ(X509_NAME_ENTRY **ne, ASN1_OBJECT *obj, int type,
    const 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(X509_NAME_ENTRY *ne, ASN1_OBJECT *obj)
{
	if ((ne == NULL) || (obj == NULL)) {
		X509error(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(X509_NAME_ENTRY *ne, int type,
    const unsigned char *bytes, int len)
{
	int i;

	if ((ne == NULL) || ((bytes == NULL) && (len != 0)))
		return (0);
	if ((type > 0) && (type & MBSTRING_FLAG))
		return ASN1_STRING_set_by_NID(&ne->value, bytes, len, type,
		    OBJ_obj2nid(ne->object)) ? 1 : 0;
	if (len < 0)
		len = strlen((const 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(X509_NAME_ENTRY *ne)
{
	if (ne == NULL)
		return (NULL);
	return (ne->object);
}

ASN1_STRING *
X509_NAME_ENTRY_get_data(X509_NAME_ENTRY *ne)
{
	if (ne == NULL)
		return (NULL);
	return (ne->value);
}


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: x509name.c,v 1.14 2017/01/29 17:49:23 beck Exp $ */
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 <string.h>
61
62			#include <openssl/asn1.h>
63			#include <openssl/err.h>
64			#include <openssl/evp.h>
65			#include <openssl/objects.h>
66			#include <openssl/stack.h>
67			#include <openssl/x509.h>
68
69			int
70			X509_NAME_get_text_by_NID(X509_NAME name, int nid, char buf, int len)
71			{
72			ASN1_OBJECT *obj;
73
74		240	obj = OBJ_nid2obj(nid);
75	✗✓	120	if (obj == NULL)
76			return (-1);
77		120	return (X509_NAME_get_text_by_OBJ(name, obj, buf, len));
78		120	}
79
80			int
81			X509_NAME_get_text_by_OBJ(X509_NAME name, ASN1_OBJECT obj, char *buf,
82			int len)
83			{
84			int i;
85			ASN1_STRING *data;
86
87		240	i = X509_NAME_get_index_by_OBJ(name, obj, -1);
88	✗✓	120	if (i < 0)
89			return (-1);
90		120	data = X509_NAME_ENTRY_get_data(X509_NAME_get_entry(name, i));
91	✓✓	360	i = (data->length > (len - 1)) ? (len - 1) : data->length;
92	✓✓	120	if (buf == NULL)
93		60	return (data->length);
94	✓✗	60	if (i >= 0) {
95		60	memcpy(buf, data->data, i);
96		60	buf[i] = '\0';
97		60	}
98		60	return (i);
99		120	}
100
101			int
102			X509_NAME_entry_count(X509_NAME *name)
103			{
104	✗✓	128	if (name == NULL)
105			return (0);
106		64	return (sk_X509_NAME_ENTRY_num(name->entries));
107		64	}
108
109			int
110			X509_NAME_get_index_by_NID(X509_NAME *name, int nid, int lastpos)
111			{
112			ASN1_OBJECT *obj;
113
114		4	obj = OBJ_nid2obj(nid);
115	✗✓	2	if (obj == NULL)
116			return (-2);
117		2	return (X509_NAME_get_index_by_OBJ(name, obj, lastpos));
118		2	}
119
120			/* NOTE: you should be passsing -1, not 0 as lastpos */
121			int
122			X509_NAME_get_index_by_OBJ(X509_NAME name, ASN1_OBJECT obj, int lastpos)
123			{
124			int n;
125			X509_NAME_ENTRY *ne;
126			STACK_OF(X509_NAME_ENTRY) *sk;
127
128	✗✓	504	if (name == NULL)
129			return (-1);
130	✓✓	252	if (lastpos < 0)
131		212	lastpos = -1;
132		252	sk = name->entries;
133		252	n = sk_X509_NAME_ENTRY_num(sk);
134	✓✓	980	for (lastpos++; lastpos < n; lastpos++) {
135		428	ne = sk_X509_NAME_ENTRY_value(sk, lastpos);
136	✓✓	428	if (OBJ_cmp(ne->object, obj) == 0)
137		190	return (lastpos);
138			}
139		62	return (-1);
140		252	}
141
142			X509_NAME_ENTRY *
143			X509_NAME_get_entry(X509_NAME *name, int loc)
144			{
145	✓✗✗✓	1048	if (name == NULL \|\| sk_X509_NAME_ENTRY_num(name->entries) <= loc \|\|
146		262	loc < 0)
147			return (NULL);
148			else
149		262	return (sk_X509_NAME_ENTRY_value(name->entries, loc));
150		262	}
151
152			X509_NAME_ENTRY *
153			X509_NAME_delete_entry(X509_NAME *name, int loc)
154			{
155			X509_NAME_ENTRY *ret;
156			int i, n, set_prev, set_next;
157			STACK_OF(X509_NAME_ENTRY) *sk;
158
159			if (name == NULL \|\| sk_X509_NAME_ENTRY_num(name->entries) <= loc \|\|
160			loc < 0)
161			return (NULL);
162			sk = name->entries;
163			ret = sk_X509_NAME_ENTRY_delete(sk, loc);
164			n = sk_X509_NAME_ENTRY_num(sk);
165			name->modified = 1;
166			if (loc == n)
167			return (ret);
168
169			/* else we need to fixup the set field */
170			if (loc != 0)
171			set_prev = (sk_X509_NAME_ENTRY_value(sk, loc - 1))->set;
172			else
173			set_prev = ret->set - 1;
174			set_next = sk_X509_NAME_ENTRY_value(sk, loc)->set;
175
176			/* set_prev is the previous set
177			* set is the current set
178			* set_next is the following
179			* prev 1 1 1 1 1 1 1 1
180			* set 1 1 2 2
181			* next 1 1 2 2 2 2 3 2
182			* so basically only if prev and next differ by 2, then
183			* re-number down by 1 */
184			if (set_prev + 1 < set_next)
185			for (i = loc; i < n; i++)
186			sk_X509_NAME_ENTRY_value(sk, i)->set--;
187			return (ret);
188			}
189
190			int
191			X509_NAME_add_entry_by_OBJ(X509_NAME name, ASN1_OBJECT obj, int type,
192			unsigned char *bytes, int len, int loc, int set)
193			{
194			X509_NAME_ENTRY *ne;
195			int ret;
196
197			ne = X509_NAME_ENTRY_create_by_OBJ(NULL, obj, type, bytes, len);
198			if (!ne)
199			return 0;
200			ret = X509_NAME_add_entry(name, ne, loc, set);
201			X509_NAME_ENTRY_free(ne);
202			return ret;
203			}
204
205			int
206			X509_NAME_add_entry_by_NID(X509_NAME *name, int nid, int type,
207			unsigned char *bytes, int len, int loc, int set)
208			{
209			X509_NAME_ENTRY *ne;
210			int ret;
211
212		504	ne = X509_NAME_ENTRY_create_by_NID(NULL, nid, type, bytes, len);
213	✗✓	252	if (!ne)
214			return 0;
215		252	ret = X509_NAME_add_entry(name, ne, loc, set);
216		252	X509_NAME_ENTRY_free(ne);
217		252	return ret;
218		252	}
219
220			int
221			X509_NAME_add_entry_by_txt(X509_NAME name, const char field, int type,
222			const unsigned char *bytes, int len, int loc, int set)
223			{
224			X509_NAME_ENTRY *ne;
225			int ret;
226
227			ne = X509_NAME_ENTRY_create_by_txt(NULL, field, type, bytes, len);
228			if (!ne)
229			return 0;
230			ret = X509_NAME_add_entry(name, ne, loc, set);
231			X509_NAME_ENTRY_free(ne);
232			return ret;
233			}
234
235			/* if set is -1, append to previous set, 0 'a new one', and 1,
236			* prepend to the guy we are about to stomp on. */
237			int
238			X509_NAME_add_entry(X509_NAME name, X509_NAME_ENTRY ne, int loc, int set)
239			{
240			X509_NAME_ENTRY *new_name = NULL;
241			int n, i, inc;
242			STACK_OF(X509_NAME_ENTRY) *sk;
243
244	✗✓	584	if (name == NULL)
245			return (0);
246		292	sk = name->entries;
247		292	n = sk_X509_NAME_ENTRY_num(sk);
248	✗✓	292	if (loc > n)
249			loc = n;
250	✓✗	292	else if (loc < 0)
251		292	loc = n;
252
253		292	name->modified = 1;
254
255	✗✓	292	if (set == -1) {
256			if (loc == 0) {
257			set = 0;
258			inc = 1;
259			} else {
260			set = sk_X509_NAME_ENTRY_value(sk, loc - 1)->set;
261			inc = 0;
262			}
263			} else /* if (set >= 0) */ {
264	✓✗	292	if (loc >= n) {
265	✓✓	292	if (loc != 0)
266		144	set = sk_X509_NAME_ENTRY_value(sk, loc - 1)->set + 1;
267			else
268			set = 0;
269			} else
270			set = sk_X509_NAME_ENTRY_value(sk, loc)->set;
271		292	inc = (set == 0) ? 1 : 0;
272			}
273
274	✓✗	292	if ((new_name = X509_NAME_ENTRY_dup(ne)) == NULL)
275			goto err;
276		292	new_name->set = set;
277	✗✓	292	if (!sk_X509_NAME_ENTRY_insert(sk, new_name, loc)) {
278			X509error(ERR_R_MALLOC_FAILURE);
279			goto err;
280			}
281	✓✓	292	if (inc) {
282		148	n = sk_X509_NAME_ENTRY_num(sk);
283	✗✓	296	for (i = loc + 1; i < n; i++)
284			sk_X509_NAME_ENTRY_value(sk, i - 1)->set += 1;
285			}
286		292	return (1);
287
288			err:
289			if (new_name != NULL)
290			X509_NAME_ENTRY_free(new_name);
291			return (0);
292		292	}
293
294			X509_NAME_ENTRY *
295			X509_NAME_ENTRY_create_by_txt(X509_NAME_ENTRY **ne,
296			const char field, int type, const unsigned char bytes, int len)
297			{
298			ASN1_OBJECT *obj;
299			X509_NAME_ENTRY *nentry;
300
301			obj = OBJ_txt2obj(field, 0);
302			if (obj == NULL) {
303			X509error(X509_R_INVALID_FIELD_NAME);
304			ERR_asprintf_error_data("name=%s", field);
305			return (NULL);
306			}
307			nentry = X509_NAME_ENTRY_create_by_OBJ(ne, obj, type, bytes, len);
308			ASN1_OBJECT_free(obj);
309			return nentry;
310			}
311
312			X509_NAME_ENTRY *
313			X509_NAME_ENTRY_create_by_NID(X509_NAME_ENTRY **ne, int nid, int type,
314			unsigned char *bytes, int len)
315			{
316			ASN1_OBJECT *obj;
317			X509_NAME_ENTRY *nentry;
318
319		504	obj = OBJ_nid2obj(nid);
320	✗✓	252	if (obj == NULL) {
321			X509error(X509_R_UNKNOWN_NID);
322			return (NULL);
323			}
324		252	nentry = X509_NAME_ENTRY_create_by_OBJ(ne, obj, type, bytes, len);
325		252	ASN1_OBJECT_free(obj);
326		252	return nentry;
327		252	}
328
329			X509_NAME_ENTRY *
330			X509_NAME_ENTRY_create_by_OBJ(X509_NAME_ENTRY *ne, ASN1_OBJECT obj, int type,
331			const unsigned char *bytes, int len)
332			{
333			X509_NAME_ENTRY *ret;
334
335	✗✓✗✗	504	if ((ne == NULL) \|\| (*ne == NULL)) {
336	✗✓	252	if ((ret = X509_NAME_ENTRY_new()) == NULL)
337			return (NULL);
338			} else
339			ret= *ne;
340
341	✓✗	252	if (!X509_NAME_ENTRY_set_object(ret, obj))
342			goto err;
343	✓✗	252	if (!X509_NAME_ENTRY_set_data(ret, type, bytes, len))
344			goto err;
345
346	✗✓✗✗	252	if ((ne != NULL) && (*ne == NULL))
347			*ne = ret;
348		252	return (ret);
349
350			err:
351			if ((ne == NULL) \|\| (ret != *ne))
352			X509_NAME_ENTRY_free(ret);
353			return (NULL);
354		252	}
355
356			int
357			X509_NAME_ENTRY_set_object(X509_NAME_ENTRY ne, ASN1_OBJECT obj)
358			{
359	✗✓	504	if ((ne == NULL) \|\| (obj == NULL)) {
360			X509error(ERR_R_PASSED_NULL_PARAMETER);
361			return (0);
362			}
363		252	ASN1_OBJECT_free(ne->object);
364		252	ne->object = OBJ_dup(obj);
365		252	return ((ne->object == NULL) ? 0 : 1);
366		252	}
367
368			int
369			X509_NAME_ENTRY_set_data(X509_NAME_ENTRY *ne, int type,
370			const unsigned char *bytes, int len)
371			{
372			int i;
373
374	✓✗✗✓	756	if ((ne == NULL) \|\| ((bytes == NULL) && (len != 0)))
375			return (0);
376	✓✗✓✗	504	if ((type > 0) && (type & MBSTRING_FLAG))
377		504	return ASN1_STRING_set_by_NID(&ne->value, bytes, len, type,
378		252	OBJ_obj2nid(ne->object)) ? 1 : 0;
379			if (len < 0)
380			len = strlen((const char *)bytes);
381			i = ASN1_STRING_set(ne->value, bytes, len);
382			if (!i)
383			return (0);
384			if (type != V_ASN1_UNDEF) {
385			if (type == V_ASN1_APP_CHOOSE)
386			ne->value->type = ASN1_PRINTABLE_type(bytes, len);
387			else
388			ne->value->type = type;
389			}
390			return (1);
391		252	}
392
393			ASN1_OBJECT *
394			X509_NAME_ENTRY_get_object(X509_NAME_ENTRY *ne)
395			{
396	✗✓	144	if (ne == NULL)
397			return (NULL);
398		72	return (ne->object);
399		72	}
400
401			ASN1_STRING *
402			X509_NAME_ENTRY_get_data(X509_NAME_ENTRY *ne)
403			{
404	✗✓	504	if (ne == NULL)
405			return (NULL);
406		252	return (ne->value);
407		252	}