1 |
|
|
/* $OpenBSD: a_enum.c,v 1.17 2015/09/30 18:45:56 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/bn.h> |
63 |
|
|
#include <openssl/err.h> |
64 |
|
|
|
65 |
|
|
/* |
66 |
|
|
* Code for ENUMERATED type: identical to INTEGER apart from a different tag. |
67 |
|
|
* for comments on encoding see a_int.c |
68 |
|
|
*/ |
69 |
|
|
|
70 |
|
|
int |
71 |
|
|
ASN1_ENUMERATED_set(ASN1_ENUMERATED *a, long v) |
72 |
|
|
{ |
73 |
|
|
int j, k; |
74 |
|
|
unsigned int i; |
75 |
|
|
unsigned char buf[sizeof(long) + 1]; |
76 |
|
|
long d; |
77 |
|
|
|
78 |
|
|
a->type = V_ASN1_ENUMERATED; |
79 |
|
|
if (a->length < (int)(sizeof(long) + 1)) { |
80 |
|
|
free(a->data); |
81 |
|
|
a->data = calloc(1, sizeof(long) + 1); |
82 |
|
|
} |
83 |
|
|
if (a->data == NULL) { |
84 |
|
|
ASN1err(ASN1_F_ASN1_ENUMERATED_SET, ERR_R_MALLOC_FAILURE); |
85 |
|
|
return (0); |
86 |
|
|
} |
87 |
|
|
d = v; |
88 |
|
|
if (d < 0) { |
89 |
|
|
d = -d; |
90 |
|
|
a->type = V_ASN1_NEG_ENUMERATED; |
91 |
|
|
} |
92 |
|
|
|
93 |
|
|
for (i = 0; i < sizeof(long); i++) { |
94 |
|
|
if (d == 0) |
95 |
|
|
break; |
96 |
|
|
buf[i] = (int)d & 0xff; |
97 |
|
|
d >>= 8; |
98 |
|
|
} |
99 |
|
|
j = 0; |
100 |
|
|
for (k = i - 1; k >= 0; k--) |
101 |
|
|
a->data[j++] = buf[k]; |
102 |
|
|
a->length = j; |
103 |
|
|
return (1); |
104 |
|
|
} |
105 |
|
|
|
106 |
|
|
long |
107 |
|
|
ASN1_ENUMERATED_get(ASN1_ENUMERATED *a) |
108 |
|
2 |
{ |
109 |
|
2 |
int neg = 0, i; |
110 |
|
2 |
long r = 0; |
111 |
|
|
|
112 |
✗✓ |
2 |
if (a == NULL) |
113 |
|
|
return (0L); |
114 |
|
2 |
i = a->type; |
115 |
✗✓ |
2 |
if (i == V_ASN1_NEG_ENUMERATED) |
116 |
|
|
neg = 1; |
117 |
✗✓ |
2 |
else if (i != V_ASN1_ENUMERATED) |
118 |
|
|
return -1; |
119 |
|
|
|
120 |
✗✓ |
2 |
if (a->length > (int)sizeof(long)) { |
121 |
|
|
/* hmm... a bit ugly */ |
122 |
|
|
return -1; |
123 |
|
|
} |
124 |
✗✓ |
2 |
if (a->data == NULL) |
125 |
|
|
return 0; |
126 |
|
|
|
127 |
✓✓ |
4 |
for (i = 0; i < a->length; i++) { |
128 |
|
2 |
r <<= 8; |
129 |
|
2 |
r |= (unsigned char)a->data[i]; |
130 |
|
|
} |
131 |
✗✓ |
2 |
if (neg) |
132 |
|
|
r = -r; |
133 |
|
2 |
return (r); |
134 |
|
|
} |
135 |
|
|
|
136 |
|
|
ASN1_ENUMERATED * |
137 |
|
|
BN_to_ASN1_ENUMERATED(BIGNUM *bn, ASN1_ENUMERATED *ai) |
138 |
|
|
{ |
139 |
|
|
ASN1_ENUMERATED *ret; |
140 |
|
|
int len, j; |
141 |
|
|
|
142 |
|
|
if (ai == NULL) |
143 |
|
|
ret = ASN1_ENUMERATED_new(); |
144 |
|
|
else |
145 |
|
|
ret = ai; |
146 |
|
|
if (ret == NULL) { |
147 |
|
|
ASN1err(ASN1_F_BN_TO_ASN1_ENUMERATED, ERR_R_NESTED_ASN1_ERROR); |
148 |
|
|
goto err; |
149 |
|
|
} |
150 |
|
|
if (BN_is_negative(bn)) |
151 |
|
|
ret->type = V_ASN1_NEG_ENUMERATED; |
152 |
|
|
else |
153 |
|
|
ret->type = V_ASN1_ENUMERATED; |
154 |
|
|
j = BN_num_bits(bn); |
155 |
|
|
len = ((j == 0) ? 0 : ((j / 8) + 1)); |
156 |
|
|
if (ret->length < len + 4) { |
157 |
|
|
unsigned char *new_data = realloc(ret->data, len + 4); |
158 |
|
|
if (!new_data) { |
159 |
|
|
ASN1err(ASN1_F_BN_TO_ASN1_ENUMERATED, ERR_R_MALLOC_FAILURE); |
160 |
|
|
goto err; |
161 |
|
|
} |
162 |
|
|
ret->data = new_data; |
163 |
|
|
} |
164 |
|
|
ret->length = BN_bn2bin(bn, ret->data); |
165 |
|
|
|
166 |
|
|
/* Correct zero case */ |
167 |
|
|
if (!ret->length) { |
168 |
|
|
ret->data[0] = 0; |
169 |
|
|
ret->length = 1; |
170 |
|
|
} |
171 |
|
|
return (ret); |
172 |
|
|
|
173 |
|
|
err: |
174 |
|
|
if (ret != ai) |
175 |
|
|
ASN1_ENUMERATED_free(ret); |
176 |
|
|
return (NULL); |
177 |
|
|
} |
178 |
|
|
|
179 |
|
|
BIGNUM * |
180 |
|
|
ASN1_ENUMERATED_to_BN(ASN1_ENUMERATED *ai, BIGNUM *bn) |
181 |
|
|
{ |
182 |
|
|
BIGNUM *ret; |
183 |
|
|
|
184 |
|
|
if ((ret = BN_bin2bn(ai->data, ai->length, bn)) == NULL) |
185 |
|
|
ASN1err(ASN1_F_ASN1_ENUMERATED_TO_BN, ASN1_R_BN_LIB); |
186 |
|
|
else if (ai->type == V_ASN1_NEG_ENUMERATED) |
187 |
|
|
BN_set_negative(ret, 1); |
188 |
|
|
return (ret); |
189 |
|
|
} |