|
1 /* x_long.c */ |
|
2 /* Written by Dr Stephen N Henson (shenson@bigfoot.com) 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 © Portions copyright (c) 2006 Nokia Corporation. All rights reserved. |
|
60 */ |
|
61 |
|
62 |
|
63 #include <stdio.h> |
|
64 #include "cryptlib.h" |
|
65 #include <openssl/asn1t.h> |
|
66 #include <openssl/bn.h> |
|
67 #if (defined(SYMBIAN) && (defined(__WINSCW__) || defined(__WINS__))) |
|
68 #include "libcrypto_wsd_macros.h" |
|
69 #include "libcrypto_wsd.h" |
|
70 #endif |
|
71 |
|
72 /* Custom primitive type for long handling. This converts between an ASN1_INTEGER |
|
73 * and a long directly. |
|
74 */ |
|
75 |
|
76 |
|
77 static int long_new(ASN1_VALUE **pval, const ASN1_ITEM *it); |
|
78 static void long_free(ASN1_VALUE **pval, const ASN1_ITEM *it); |
|
79 |
|
80 static int long_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it); |
|
81 static int long_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it); |
|
82 |
|
83 #ifndef EMULATOR |
|
84 static ASN1_PRIMITIVE_FUNCS long_pf = { |
|
85 NULL, 0, |
|
86 long_new, |
|
87 long_free, |
|
88 long_free, /* Clear should set to initial value */ |
|
89 long_c2i, |
|
90 long_i2c |
|
91 }; |
|
92 #else |
|
93 static const ASN1_PRIMITIVE_FUNCS long_pf = { |
|
94 NULL, 0, |
|
95 long_new, |
|
96 long_free, |
|
97 long_free, /* Clear should set to initial value */ |
|
98 long_c2i, |
|
99 long_i2c |
|
100 }; |
|
101 |
|
102 #endif |
|
103 ASN1_ITEM_start(LONG) |
|
104 ASN1_ITYPE_PRIMITIVE, V_ASN1_INTEGER, NULL, 0, &long_pf, ASN1_LONG_UNDEF, "LONG" |
|
105 ASN1_ITEM_end(LONG) |
|
106 |
|
107 ASN1_ITEM_start(ZLONG) |
|
108 ASN1_ITYPE_PRIMITIVE, V_ASN1_INTEGER, NULL, 0, &long_pf, 0, "ZLONG" |
|
109 ASN1_ITEM_end(ZLONG) |
|
110 |
|
111 static int long_new(ASN1_VALUE **pval, const ASN1_ITEM *it) |
|
112 { |
|
113 *(long *)pval = it->size; |
|
114 return 1; |
|
115 } |
|
116 |
|
117 static void long_free(ASN1_VALUE **pval, const ASN1_ITEM *it) |
|
118 { |
|
119 *(long *)pval = it->size; |
|
120 } |
|
121 |
|
122 static int long_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it) |
|
123 { |
|
124 long ltmp; |
|
125 unsigned long utmp; |
|
126 int clen, pad, i; |
|
127 /* this exists to bypass broken gcc optimization */ |
|
128 char *cp = (char *)pval; |
|
129 |
|
130 /* use memcpy, because we may not be long aligned */ |
|
131 memcpy(<mp, cp, sizeof(long)); |
|
132 |
|
133 if(ltmp == it->size) return -1; |
|
134 /* Convert the long to positive: we subtract one if negative so |
|
135 * we can cleanly handle the padding if only the MSB of the leading |
|
136 * octet is set. |
|
137 */ |
|
138 if(ltmp < 0) utmp = -ltmp - 1; |
|
139 else utmp = ltmp; |
|
140 clen = BN_num_bits_word(utmp); |
|
141 /* If MSB of leading octet set we need to pad */ |
|
142 if(!(clen & 0x7)) pad = 1; |
|
143 else pad = 0; |
|
144 |
|
145 /* Convert number of bits to number of octets */ |
|
146 clen = (clen + 7) >> 3; |
|
147 |
|
148 if(cont) { |
|
149 if(pad) *cont++ = (ltmp < 0) ? 0xff : 0; |
|
150 for(i = clen - 1; i >= 0; i--) { |
|
151 cont[i] = (unsigned char)(utmp & 0xff); |
|
152 if(ltmp < 0) cont[i] ^= 0xff; |
|
153 utmp >>= 8; |
|
154 } |
|
155 } |
|
156 return clen + pad; |
|
157 } |
|
158 |
|
159 static int long_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, |
|
160 int utype, char *free_cont, const ASN1_ITEM *it) |
|
161 { |
|
162 int neg, i; |
|
163 long ltmp; |
|
164 unsigned long utmp = 0; |
|
165 char *cp = (char *)pval; |
|
166 if(len > (int)sizeof(long)) { |
|
167 ASN1err(ASN1_F_LONG_C2I, ASN1_R_INTEGER_TOO_LARGE_FOR_LONG); |
|
168 return 0; |
|
169 } |
|
170 /* Is it negative? */ |
|
171 if(len && (cont[0] & 0x80)) neg = 1; |
|
172 else neg = 0; |
|
173 utmp = 0; |
|
174 for(i = 0; i < len; i++) { |
|
175 utmp <<= 8; |
|
176 if(neg) utmp |= cont[i] ^ 0xff; |
|
177 else utmp |= cont[i]; |
|
178 } |
|
179 ltmp = (long)utmp; |
|
180 if(neg) { |
|
181 ltmp++; |
|
182 ltmp = -ltmp; |
|
183 } |
|
184 if(ltmp == it->size) { |
|
185 ASN1err(ASN1_F_LONG_C2I, ASN1_R_INTEGER_TOO_LARGE_FOR_LONG); |
|
186 return 0; |
|
187 } |
|
188 memcpy(cp, <mp, sizeof(long)); |
|
189 return 1; |
|
190 } |