Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	lib/libcrypto/crypto/../../libssl/src/crypto/asn1/tasn_fre.c	Lines:	83	95	87.4 %
Date:	2016-12-06	Branches:	55	75	73.3 %


/* $OpenBSD: tasn_fre.c,v 1.14 2015/02/14 15:23:57 miod Exp $ */
/* Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL
 * project 2000.
 */
/* ====================================================================
 * Copyright (c) 2000 The OpenSSL Project.  All rights reserved.
 *
 * 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 above 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 acknowledgment:
 *    "This product includes software developed by the OpenSSL Project
 *    for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
 *
 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
 *    endorse or promote products derived from this software without
 *    prior written permission. For written permission, please contact
 *    licensing@OpenSSL.org.
 *
 * 5. Products derived from this software may not be called "OpenSSL"
 *    nor may "OpenSSL" appear in their names without prior written
 *    permission of the OpenSSL Project.
 *
 * 6. Redistributions of any form whatsoever must retain the following
 *    acknowledgment:
 *    "This product includes software developed by the OpenSSL Project
 *    for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
 *
 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
 * EXPRESSED 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 OpenSSL PROJECT OR
 * ITS 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.
 * ====================================================================
 *
 * This product includes cryptographic software written by Eric Young
 * (eay@cryptsoft.com).  This product includes software written by Tim
 * Hudson (tjh@cryptsoft.com).
 *
 */


#include <stddef.h>
#include <openssl/asn1.h>
#include <openssl/asn1t.h>
#include <openssl/objects.h>

static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it,
    int combine);

/* Free up an ASN1 structure */

void
ASN1_item_free(ASN1_VALUE *val, const ASN1_ITEM *it)
{
	asn1_item_combine_free(&val, it, 0);
}

void
ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it)
{
	asn1_item_combine_free(pval, it, 0);
}

static void
asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine)
{
	const ASN1_TEMPLATE *tt = NULL, *seqtt;
	const ASN1_EXTERN_FUNCS *ef;
	const ASN1_AUX *aux = it->funcs;
	ASN1_aux_cb *asn1_cb = NULL;
	int i;

	if (pval == NULL || *pval == NULL)
		return;

	if (aux != NULL && aux->asn1_cb != NULL)
		asn1_cb = aux->asn1_cb;

	switch (it->itype) {
	case ASN1_ITYPE_PRIMITIVE:
		if (it->templates)
			ASN1_template_free(pval, it->templates);
		else
			ASN1_primitive_free(pval, it);
		break;

	case ASN1_ITYPE_MSTRING:
		ASN1_primitive_free(pval, it);
		break;

	case ASN1_ITYPE_CHOICE:
		if (asn1_cb) {
			i = asn1_cb(ASN1_OP_FREE_PRE, pval, it, NULL);
			if (i == 2)
				return;
		}
		i = asn1_get_choice_selector(pval, it);
		if ((i >= 0) && (i < it->tcount)) {
			ASN1_VALUE **pchval;
			tt = it->templates + i;
			pchval = asn1_get_field_ptr(pval, tt);
			ASN1_template_free(pchval, tt);
		}
		if (asn1_cb)
			asn1_cb(ASN1_OP_FREE_POST, pval, it, NULL);
		if (!combine) {
			free(*pval);
			*pval = NULL;
		}
		break;

	case ASN1_ITYPE_EXTERN:
		ef = it->funcs;
		if (ef && ef->asn1_ex_free)
			ef->asn1_ex_free(pval, it);
		break;

	case ASN1_ITYPE_NDEF_SEQUENCE:
	case ASN1_ITYPE_SEQUENCE:
		if (asn1_do_lock(pval, -1, it) > 0)
			return;
		if (asn1_cb) {
			i = asn1_cb(ASN1_OP_FREE_PRE, pval, it, NULL);
			if (i == 2)
				return;
		}
		asn1_enc_free(pval, it);
		/* If we free up as normal we will invalidate any
		 * ANY DEFINED BY field and we wont be able to
		 * determine the type of the field it defines. So
		 * free up in reverse order.
		 */
		tt = it->templates + it->tcount - 1;
		for (i = 0; i < it->tcount; tt--, i++) {
			ASN1_VALUE **pseqval;
			seqtt = asn1_do_adb(pval, tt, 0);
			if (!seqtt)
				continue;
			pseqval = asn1_get_field_ptr(pval, seqtt);
			ASN1_template_free(pseqval, seqtt);
		}
		if (asn1_cb)
			asn1_cb(ASN1_OP_FREE_POST, pval, it, NULL);
		if (!combine) {
			free(*pval);
			*pval = NULL;
		}
		break;
	}
}

void
ASN1_template_free(ASN1_VALUE **pval, const ASN1_TEMPLATE *tt)
{
	int i;
	if (tt->flags & ASN1_TFLG_SK_MASK) {
		STACK_OF(ASN1_VALUE) *sk = (STACK_OF(ASN1_VALUE) *)*pval;
		for (i = 0; i < sk_ASN1_VALUE_num(sk); i++) {
			ASN1_VALUE *vtmp;
			vtmp = sk_ASN1_VALUE_value(sk, i);
			asn1_item_combine_free(&vtmp, ASN1_ITEM_ptr(tt->item),
			    0);
		}
		sk_ASN1_VALUE_free(sk);
		*pval = NULL;
	} else
		asn1_item_combine_free(pval, ASN1_ITEM_ptr(tt->item),
		    tt->flags & ASN1_TFLG_COMBINE);
}

void
ASN1_primitive_free(ASN1_VALUE **pval, const ASN1_ITEM *it)
{
	int utype;
	if (it) {
		const ASN1_PRIMITIVE_FUNCS *pf;
		pf = it->funcs;
		if (pf && pf->prim_free) {
			pf->prim_free(pval, it);
			return;
		}
	}
	/* Special case: if 'it' is NULL free contents of ASN1_TYPE */
	if (!it) {
		ASN1_TYPE *typ = (ASN1_TYPE *)*pval;
		utype = typ->type;
		pval = &typ->value.asn1_value;
		if (!*pval)
			return;
	} else if (it->itype == ASN1_ITYPE_MSTRING) {
		utype = -1;
		if (!*pval)
			return;
	} else {
		utype = it->utype;
		if ((utype != V_ASN1_BOOLEAN) && !*pval)
			return;
	}

	switch (utype) {
	case V_ASN1_OBJECT:
		ASN1_OBJECT_free((ASN1_OBJECT *)*pval);
		break;

	case V_ASN1_BOOLEAN:
		if (it)
			*(ASN1_BOOLEAN *)pval = it->size;
		else
			*(ASN1_BOOLEAN *)pval = -1;
		return;

	case V_ASN1_NULL:
		break;

	case V_ASN1_ANY:
		ASN1_primitive_free(pval, NULL);
		free(*pval);
		break;

	default:
		ASN1_STRING_free((ASN1_STRING *)*pval);
		break;
	}
	*pval = NULL;
}


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: tasn_fre.c,v 1.14 2015/02/14 15:23:57 miod Exp $ */
2			/* Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL
3			* project 2000.
4			*/
5			/* ====================================================================
6			* Copyright (c) 2000 The OpenSSL Project. All rights reserved.
7			*
8			* Redistribution and use in source and binary forms, with or without
9			* modification, are permitted provided that the following conditions
10			* are met:
11			*
12			* 1. Redistributions of source code must retain the above copyright
13			* notice, this list of conditions and the following disclaimer.
14			*
15			* 2. Redistributions in binary form must reproduce the above copyright
16			* notice, this list of conditions and the following disclaimer in
17			* the documentation and/or other materials provided with the
18			* distribution.
19			*
20			* 3. All advertising materials mentioning features or use of this
21			* software must display the following acknowledgment:
22			* "This product includes software developed by the OpenSSL Project
23			* for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
24			*
25			* 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
26			* endorse or promote products derived from this software without
27			* prior written permission. For written permission, please contact
28			* licensing@OpenSSL.org.
29			*
30			* 5. Products derived from this software may not be called "OpenSSL"
31			* nor may "OpenSSL" appear in their names without prior written
32			* permission of the OpenSSL Project.
33			*
34			* 6. Redistributions of any form whatsoever must retain the following
35			* acknowledgment:
36			* "This product includes software developed by the OpenSSL Project
37			* for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
38			*
39			* THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
40			* EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
41			* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
42			* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
43			* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
44			* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
45			* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
46			* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47			* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
48			* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
49			* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
50			* OF THE POSSIBILITY OF SUCH DAMAGE.
51			* ====================================================================
52			*
53			* This product includes cryptographic software written by Eric Young
54			* (eay@cryptsoft.com). This product includes software written by Tim
55			* Hudson (tjh@cryptsoft.com).
56			*
57			*/
58
59
60			#include <stddef.h>
61			#include <openssl/asn1.h>
62			#include <openssl/asn1t.h>
63			#include <openssl/objects.h>
64
65			static void asn1_item_combine_free(ASN1_VALUE *pval, const ASN1_ITEM it,
66			int combine);
67
68			/* Free up an ASN1 structure */
69
70			void
71			ASN1_item_free(ASN1_VALUE val, const ASN1_ITEM it)
72		2367	{
73		2367	asn1_item_combine_free(&val, it, 0);
74		2367	}
75
76			void
77			ASN1_item_ex_free(ASN1_VALUE *pval, const ASN1_ITEM it)
78		76	{
79		76	asn1_item_combine_free(pval, it, 0);
80		76	}
81
82			static void
83			asn1_item_combine_free(ASN1_VALUE *pval, const ASN1_ITEM it, int combine)
84		7303	{
85		7303	const ASN1_TEMPLATE tt = NULL, seqtt;
86			const ASN1_EXTERN_FUNCS *ef;
87		7303	const ASN1_AUX *aux = it->funcs;
88		7303	ASN1_aux_cb *asn1_cb = NULL;
89			int i;
90
91	✓✗✓✓	7303	if (pval == NULL \|\| *pval == NULL)
92			return;
93
94	✓✓✓✓	6787	if (aux != NULL && aux->asn1_cb != NULL)
95		1406	asn1_cb = aux->asn1_cb;
96
97	✓✓✓✓ ✓✗	6787	switch (it->itype) {
98			case ASN1_ITYPE_PRIMITIVE:
99	✗✓	3141	if (it->templates)
100			ASN1_template_free(pval, it->templates);
101			else
102		3141	ASN1_primitive_free(pval, it);
103			break;
104
105			case ASN1_ITYPE_MSTRING:
106		1402	ASN1_primitive_free(pval, it);
107		1402	break;
108
109			case ASN1_ITYPE_CHOICE:
110	✗✓	8	if (asn1_cb) {
111			i = asn1_cb(ASN1_OP_FREE_PRE, pval, it, NULL);
112			if (i == 2)
113			return;
114			}
115		8	i = asn1_get_choice_selector(pval, it);
116	✓✗✓✗	8	if ((i >= 0) && (i < it->tcount)) {
117			ASN1_VALUE **pchval;
118		8	tt = it->templates + i;
119		8	pchval = asn1_get_field_ptr(pval, tt);
120		8	ASN1_template_free(pchval, tt);
121			}
122	✗✓	8	if (asn1_cb)
123			asn1_cb(ASN1_OP_FREE_POST, pval, it, NULL);
124	✗✓	8	if (!combine) {
125			free(*pval);
126			*pval = NULL;
127			}
128			break;
129
130			case ASN1_ITYPE_EXTERN:
131		6	ef = it->funcs;
132	✓✗✓✗	6	if (ef && ef->asn1_ex_free)
133		6	ef->asn1_ex_free(pval, it);
134			break;
135
136			case ASN1_ITYPE_NDEF_SEQUENCE:
137			case ASN1_ITYPE_SEQUENCE:
138	✓✓	2230	if (asn1_do_lock(pval, -1, it) > 0)
139		174	return;
140	✓✓	2056	if (asn1_cb) {
141		10	i = asn1_cb(ASN1_OP_FREE_PRE, pval, it, NULL);
142	✗✓	10	if (i == 2)
143			return;
144			}
145		2056	asn1_enc_free(pval, it);
146			/* If we free up as normal we will invalidate any
147			* ANY DEFINED BY field and we wont be able to
148			* determine the type of the field it defines. So
149			* free up in reverse order.
150			*/
151		2056	tt = it->templates + it->tcount - 1;
152	✓✓	6190	for (i = 0; i < it->tcount; tt--, i++) {
153			ASN1_VALUE **pseqval;
154		4134	seqtt = asn1_do_adb(pval, tt, 0);
155	✗✓	4134	if (!seqtt)
156			continue;
157		4134	pseqval = asn1_get_field_ptr(pval, seqtt);
158		4134	ASN1_template_free(pseqval, seqtt);
159			}
160	✓✓	2056	if (asn1_cb)
161		10	asn1_cb(ASN1_OP_FREE_POST, pval, it, NULL);
162	✓✗	2056	if (!combine) {
163		2056	free(*pval);
164		2056	*pval = NULL;
165			}
166			break;
167			}
168			}
169
170			void
171			ASN1_template_free(ASN1_VALUE *pval, const ASN1_TEMPLATE tt)
172		4887	{
173			int i;
174	✓✓	4887	if (tt->flags & ASN1_TFLG_SK_MASK) {
175		51	STACK_OF(ASN1_VALUE) sk = (STACK_OF(ASN1_VALUE) )*pval;
176	✓✓	75	for (i = 0; i < sk_ASN1_VALUE_num(sk); i++) {
177			ASN1_VALUE *vtmp;
178		24	vtmp = sk_ASN1_VALUE_value(sk, i);
179		24	asn1_item_combine_free(&vtmp, ASN1_ITEM_ptr(tt->item),
180			0);
181			}
182		51	sk_ASN1_VALUE_free(sk);
183		51	*pval = NULL;
184			} else
185		4836	asn1_item_combine_free(pval, ASN1_ITEM_ptr(tt->item),
186			tt->flags & ASN1_TFLG_COMBINE);
187		4887	}
188
189			void
190			ASN1_primitive_free(ASN1_VALUE *pval, const ASN1_ITEM it)
191		4573	{
192			int utype;
193	✓✓	4573	if (it) {
194			const ASN1_PRIMITIVE_FUNCS *pf;
195		4543	pf = it->funcs;
196	✓✓✓✗	4543	if (pf && pf->prim_free) {
197		1222	pf->prim_free(pval, it);
198		1222	return;
199			}
200			}
201			/* Special case: if 'it' is NULL free contents of ASN1_TYPE */
202	✓✓	3351	if (!it) {
203		30	ASN1_TYPE typ = (ASN1_TYPE )*pval;
204		30	utype = typ->type;
205		30	pval = &typ->value.asn1_value;
206	✓✓	30	if (!*pval)
207		15	return;
208	✓✓	3321	} else if (it->itype == ASN1_ITYPE_MSTRING) {
209		1402	utype = -1;
210	✗✓	1402	if (!*pval)
211			return;
212			} else {
213		1919	utype = it->utype;
214	✓✓✗✓	1919	if ((utype != V_ASN1_BOOLEAN) && !*pval)
215			return;
216			}
217
218	✓✓✓✓ ✗	3336	switch (utype) {
219			case V_ASN1_OBJECT:
220		1422	ASN1_OBJECT_free((ASN1_OBJECT )pval);
221		1422	break;
222
223			case V_ASN1_BOOLEAN:
224	✓✗	323	if (it)
225		323	(ASN1_BOOLEAN )pval = it->size;
226			else
227			(ASN1_BOOLEAN )pval = -1;
228			return;
229
230			case V_ASN1_NULL:
231			break;
232
233			case V_ASN1_ANY:
234		30	ASN1_primitive_free(pval, NULL);
235		30	free(*pval);
236		30	break;
237
238			default:
239		1561	ASN1_STRING_free((ASN1_STRING )pval);
240			break;
241			}
242		3013	*pval = NULL;
243			}