GCC Code Coverage Report
Directory: ./ Exec Total Coverage
File: lib/libcrypto/crypto/../../libssl/src/crypto/asn1/f_enum.c Lines: 0 89 0.0 %
Date: 2016-12-06 Branches: 0 58 0.0 %

Line Branch Exec Source
1
/* $OpenBSD: f_enum.c,v 1.14 2014/07/11 08:44:47 jsing 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
61
#include <openssl/asn1.h>
62
#include <openssl/buffer.h>
63
#include <openssl/err.h>
64
65
/* Based on a_int.c: equivalent ENUMERATED functions */
66
67
int
68
i2a_ASN1_ENUMERATED(BIO *bp, ASN1_ENUMERATED *a)
69
{
70
	int i, n = 0;
71
	static const char h[] = "0123456789ABCDEF";
72
	char buf[2];
73
74
	if (a == NULL)
75
		return (0);
76
77
	if (a->length == 0) {
78
		if (BIO_write(bp, "00", 2) != 2)
79
			goto err;
80
		n = 2;
81
	} else {
82
		for (i = 0; i < a->length; i++) {
83
			if ((i != 0) && (i % 35 == 0)) {
84
				if (BIO_write(bp, "\\\n", 2) != 2)
85
					goto err;
86
				n += 2;
87
			}
88
			buf[0] = h[((unsigned char)a->data[i] >> 4) & 0x0f];
89
			buf[1] = h[((unsigned char)a->data[i]) & 0x0f];
90
			if (BIO_write(bp, buf, 2) != 2)
91
				goto err;
92
			n += 2;
93
		}
94
	}
95
	return (n);
96
97
err:
98
	return (-1);
99
}
100
101
int
102
a2i_ASN1_ENUMERATED(BIO *bp, ASN1_ENUMERATED *bs, char *buf, int size)
103
{
104
	int ret = 0;
105
	int i, j,k, m,n, again, bufsize;
106
	unsigned char *s = NULL, *sp;
107
	unsigned char *bufp;
108
	int first = 1;
109
	size_t num = 0, slen = 0;
110
111
	bs->type = V_ASN1_ENUMERATED;
112
113
	bufsize = BIO_gets(bp, buf, size);
114
	for (;;) {
115
		if (bufsize < 1)
116
			goto err_sl;
117
		i = bufsize;
118
		if (buf[i-1] == '\n')
119
			buf[--i] = '\0';
120
		if (i == 0)
121
			goto err_sl;
122
		if (buf[i-1] == '\r')
123
			buf[--i] = '\0';
124
		if (i == 0)
125
			goto err_sl;
126
		again = (buf[i - 1] == '\\');
127
128
		for (j = 0; j < i; j++) {
129
			if (!(((buf[j] >= '0') && (buf[j] <= '9')) ||
130
			    ((buf[j] >= 'a') && (buf[j] <= 'f')) ||
131
			    ((buf[j] >= 'A') && (buf[j] <= 'F')))) {
132
				i = j;
133
				break;
134
			}
135
		}
136
		buf[i] = '\0';
137
		/* We have now cleared all the crap off the end of the
138
		 * line */
139
		if (i < 2)
140
			goto err_sl;
141
142
		bufp = (unsigned char *)buf;
143
		if (first) {
144
			first = 0;
145
			if ((bufp[0] == '0') && (buf[1] == '0')) {
146
				bufp += 2;
147
				i -= 2;
148
			}
149
		}
150
		k = 0;
151
		i -= again;
152
		if (i % 2 != 0) {
153
			ASN1err(ASN1_F_A2I_ASN1_ENUMERATED,
154
			    ASN1_R_ODD_NUMBER_OF_CHARS);
155
			goto err;
156
		}
157
		i /= 2;
158
		if (num + i > slen) {
159
			sp = realloc(s, num + i);
160
			if (sp == NULL) {
161
				ASN1err(ASN1_F_A2I_ASN1_ENUMERATED,
162
				    ERR_R_MALLOC_FAILURE);
163
				goto err;
164
			}
165
			s = sp;
166
			slen = num + i;
167
		}
168
		for (j = 0; j < i; j++, k += 2) {
169
			for (n = 0; n < 2; n++) {
170
				m = bufp[k + n];
171
				if ((m >= '0') && (m <= '9'))
172
					m -= '0';
173
				else if ((m >= 'a') && (m <= 'f'))
174
					m = m - 'a' + 10;
175
				else if ((m >= 'A') && (m <= 'F'))
176
					m = m - 'A' + 10;
177
				else {
178
					ASN1err(ASN1_F_A2I_ASN1_ENUMERATED,
179
					    ASN1_R_NON_HEX_CHARACTERS);
180
					goto err;
181
				}
182
				s[num + j] <<= 4;
183
				s[num + j] |= m;
184
			}
185
		}
186
		num += i;
187
		if (again)
188
			bufsize = BIO_gets(bp, buf, size);
189
		else
190
			break;
191
	}
192
	bs->length = num;
193
	bs->data = s;
194
	return (1);
195
196
err_sl:
197
	ASN1err(ASN1_F_A2I_ASN1_ENUMERATED, ASN1_R_SHORT_LINE);
198
err:
199
	free(s);
200
	return (ret);
201
}