diff options
author | miod <> | 2014-04-18 17:32:31 +0000 |
---|---|---|
committer | miod <> | 2014-04-18 17:32:31 +0000 |
commit | 0b47fa2bab5b51d4929f5347baa45bcef8856d90 (patch) | |
tree | dba66643fe8afbf27d4baab6c8cdf4d3e896f3a1 | |
parent | f6130bd40807568ae84a0351ec561620b9bcc6cd (diff) | |
download | openbsd-0b47fa2bab5b51d4929f5347baa45bcef8856d90.tar.gz openbsd-0b47fa2bab5b51d4929f5347baa45bcef8856d90.tar.bz2 openbsd-0b47fa2bab5b51d4929f5347baa45bcef8856d90.zip |
Put back i2d_ASN1_SET() and d2i_ASN1_SET() from the NO_ASN1_OLD prune, as there
are still some 3rd-party code using it, and fixing them is not trivial.
As an excuse gift, the memory leaks on failure in resurrected a_set.c have
been fixed.
-rw-r--r-- | src/lib/libcrypto/asn1/a_set.c | 236 | ||||
-rw-r--r-- | src/lib/libcrypto/asn1/asn1.h | 9 | ||||
-rw-r--r-- | src/lib/libcrypto/crypto/Makefile | 3 | ||||
-rw-r--r-- | src/lib/libcrypto/stack/safestack.h | 13 | ||||
-rw-r--r-- | src/lib/libssl/src/crypto/asn1/a_set.c | 236 | ||||
-rw-r--r-- | src/lib/libssl/src/crypto/asn1/asn1.h | 9 | ||||
-rw-r--r-- | src/lib/libssl/src/crypto/stack/safestack.h | 13 |
7 files changed, 518 insertions, 1 deletions
diff --git a/src/lib/libcrypto/asn1/a_set.c b/src/lib/libcrypto/asn1/a_set.c new file mode 100644 index 0000000000..8a97984893 --- /dev/null +++ b/src/lib/libcrypto/asn1/a_set.c | |||
@@ -0,0 +1,236 @@ | |||
1 | /* crypto/asn1/a_set.c */ | ||
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 "cryptlib.h" | ||
61 | #include <openssl/asn1_mac.h> | ||
62 | |||
63 | #ifndef NO_ASN1_OLD | ||
64 | |||
65 | typedef struct { | ||
66 | unsigned char *pbData; | ||
67 | int cbData; | ||
68 | } MYBLOB; | ||
69 | |||
70 | /* SetBlobCmp | ||
71 | * This function compares two elements of SET_OF block | ||
72 | */ | ||
73 | static int | ||
74 | SetBlobCmp(const void *elem1, const void *elem2) | ||
75 | { | ||
76 | const MYBLOB *b1 = (const MYBLOB *)elem1; | ||
77 | const MYBLOB *b2 = (const MYBLOB *)elem2; | ||
78 | int r; | ||
79 | |||
80 | r = memcmp(b1->pbData, b2->pbData, | ||
81 | b1->cbData < b2->cbData ? b1->cbData : b2->cbData); | ||
82 | if (r != 0) | ||
83 | return r; | ||
84 | return b1->cbData - b2->cbData; | ||
85 | } | ||
86 | |||
87 | /* int is_set: if TRUE, then sort the contents (i.e. it isn't a SEQUENCE) */ | ||
88 | int | ||
89 | i2d_ASN1_SET(STACK_OF(OPENSSL_BLOCK) *a, unsigned char **pp, i2d_of_void *i2d, | ||
90 | int ex_tag, int ex_class, int is_set) | ||
91 | { | ||
92 | int ret = 0, r; | ||
93 | int i; | ||
94 | unsigned char *p; | ||
95 | unsigned char *pStart, *pTempMem; | ||
96 | MYBLOB *rgSetBlob; | ||
97 | int totSize; | ||
98 | |||
99 | if (a == NULL) | ||
100 | return 0; | ||
101 | for (i = sk_OPENSSL_BLOCK_num(a) - 1; i >= 0; i--) | ||
102 | ret += i2d(sk_OPENSSL_BLOCK_value(a, i), NULL); | ||
103 | r = ASN1_object_size(1, ret, ex_tag); | ||
104 | if (pp == NULL) | ||
105 | return r; | ||
106 | |||
107 | p= *pp; | ||
108 | ASN1_put_object(&p, 1, ret, ex_tag, ex_class); | ||
109 | |||
110 | /* Modified by gp@nsj.co.jp */ | ||
111 | /* And then again by Ben */ | ||
112 | /* And again by Steve */ | ||
113 | |||
114 | if (!is_set || (sk_OPENSSL_BLOCK_num(a) < 2)) { | ||
115 | for (i = 0; i < sk_OPENSSL_BLOCK_num(a); i++) | ||
116 | i2d(sk_OPENSSL_BLOCK_value(a, i), &p); | ||
117 | |||
118 | *pp = p; | ||
119 | return r; | ||
120 | } | ||
121 | |||
122 | pStart = p; /* Catch the beg of Setblobs*/ | ||
123 | /* In this array we will store the SET blobs */ | ||
124 | rgSetBlob = malloc(sk_OPENSSL_BLOCK_num(a) * sizeof(MYBLOB)); | ||
125 | if (rgSetBlob == NULL) { | ||
126 | ASN1err(ASN1_F_I2D_ASN1_SET, ERR_R_MALLOC_FAILURE); | ||
127 | return 0; | ||
128 | } | ||
129 | |||
130 | for (i = 0; i < sk_OPENSSL_BLOCK_num(a); i++) { | ||
131 | rgSetBlob[i].pbData = p; /* catch each set encode blob */ | ||
132 | i2d(sk_OPENSSL_BLOCK_value(a, i), &p); | ||
133 | /* Length of this SetBlob */ | ||
134 | rgSetBlob[i].cbData = p - rgSetBlob[i].pbData; | ||
135 | } | ||
136 | *pp = p; | ||
137 | totSize = p - pStart; /* This is the total size of all set blobs */ | ||
138 | |||
139 | /* Now we have to sort the blobs. I am using a simple algo. | ||
140 | * Sort ptrs | ||
141 | * Copy to temp-mem | ||
142 | * Copy from temp-mem to user-mem | ||
143 | */ | ||
144 | qsort(rgSetBlob, sk_OPENSSL_BLOCK_num(a), sizeof(MYBLOB), SetBlobCmp); | ||
145 | if ((pTempMem = malloc(totSize)) == NULL) { | ||
146 | free(rgSetBlob); | ||
147 | ASN1err(ASN1_F_I2D_ASN1_SET, ERR_R_MALLOC_FAILURE); | ||
148 | return 0; | ||
149 | } | ||
150 | |||
151 | /* Copy to temp mem */ | ||
152 | p = pTempMem; | ||
153 | for (i = 0; i < sk_OPENSSL_BLOCK_num(a); ++i) { | ||
154 | memcpy(p, rgSetBlob[i].pbData, rgSetBlob[i].cbData); | ||
155 | p += rgSetBlob[i].cbData; | ||
156 | } | ||
157 | |||
158 | /* Copy back to user mem*/ | ||
159 | memcpy(pStart, pTempMem, totSize); | ||
160 | free(pTempMem); | ||
161 | free(rgSetBlob); | ||
162 | |||
163 | return r; | ||
164 | } | ||
165 | |||
166 | STACK_OF(OPENSSL_BLOCK) * | ||
167 | d2i_ASN1_SET(STACK_OF(OPENSSL_BLOCK) **a, const unsigned char **pp, long length, | ||
168 | d2i_of_void *d2i, void (*free_func)(OPENSSL_BLOCK), int ex_tag, | ||
169 | int ex_class) | ||
170 | { | ||
171 | ASN1_const_CTX c; | ||
172 | STACK_OF(OPENSSL_BLOCK) *ret = NULL; | ||
173 | |||
174 | if (a == NULL || (*a) == NULL) { | ||
175 | if ((ret = sk_OPENSSL_BLOCK_new_null()) == NULL) { | ||
176 | ASN1err(ASN1_F_D2I_ASN1_SET, ERR_R_MALLOC_FAILURE); | ||
177 | goto err; | ||
178 | } | ||
179 | } else | ||
180 | ret = *a; | ||
181 | |||
182 | c.p= *pp; | ||
183 | c.max = (length == 0) ? 0 : (c.p + length); | ||
184 | |||
185 | c.inf = ASN1_get_object(&c.p, &c.slen, &c.tag, &c.xclass, c.max - c.p); | ||
186 | if (c.inf & 0x80) | ||
187 | goto err; | ||
188 | if (ex_class != c.xclass) { | ||
189 | ASN1err(ASN1_F_D2I_ASN1_SET, ASN1_R_BAD_CLASS); | ||
190 | goto err; | ||
191 | } | ||
192 | if (ex_tag != c.tag) { | ||
193 | ASN1err(ASN1_F_D2I_ASN1_SET, ASN1_R_BAD_TAG); | ||
194 | goto err; | ||
195 | } | ||
196 | if (c.slen + c.p > c.max) { | ||
197 | ASN1err(ASN1_F_D2I_ASN1_SET, ASN1_R_LENGTH_ERROR); | ||
198 | goto err; | ||
199 | } | ||
200 | /* check for infinite constructed - it can be as long | ||
201 | * as the amount of data passed to us */ | ||
202 | if (c.inf == (V_ASN1_CONSTRUCTED + 1)) | ||
203 | c.slen = length + *pp - c.p; | ||
204 | c.max = c.p + c.slen; | ||
205 | |||
206 | while (c.p < c.max) { | ||
207 | char *s; | ||
208 | |||
209 | if (M_ASN1_D2I_end_sequence()) | ||
210 | break; | ||
211 | /* XXX: This was called with 4 arguments, incorrectly, it seems | ||
212 | if ((s = func(NULL, &c.p, c.slen, c.max - c.p)) == NULL) */ | ||
213 | if ((s = d2i(NULL, &c.p, c.slen)) == NULL) { | ||
214 | ASN1err(ASN1_F_D2I_ASN1_SET, | ||
215 | ASN1_R_ERROR_PARSING_SET_ELEMENT); | ||
216 | asn1_add_error(*pp, (int)(c.p - *pp)); | ||
217 | goto err; | ||
218 | } | ||
219 | if (!sk_OPENSSL_BLOCK_push(ret,s)) | ||
220 | goto err; | ||
221 | } | ||
222 | if (a != NULL) | ||
223 | *a = ret; | ||
224 | *pp = c.p; | ||
225 | return ret; | ||
226 | err: | ||
227 | if (ret != NULL && (a == NULL || *a != ret)) { | ||
228 | if (free_func != NULL) | ||
229 | sk_OPENSSL_BLOCK_pop_free(ret, free_func); | ||
230 | else | ||
231 | sk_OPENSSL_BLOCK_free(ret); | ||
232 | } | ||
233 | return NULL; | ||
234 | } | ||
235 | |||
236 | #endif | ||
diff --git a/src/lib/libcrypto/asn1/asn1.h b/src/lib/libcrypto/asn1/asn1.h index c4fa8c649b..3daebc078f 100644 --- a/src/lib/libcrypto/asn1/asn1.h +++ b/src/lib/libcrypto/asn1/asn1.h | |||
@@ -884,6 +884,15 @@ int ASN1_TIME_check(ASN1_TIME *t); | |||
884 | ASN1_GENERALIZEDTIME *ASN1_TIME_to_generalizedtime(ASN1_TIME *t, ASN1_GENERALIZEDTIME **out); | 884 | ASN1_GENERALIZEDTIME *ASN1_TIME_to_generalizedtime(ASN1_TIME *t, ASN1_GENERALIZEDTIME **out); |
885 | int ASN1_TIME_set_string(ASN1_TIME *s, const char *str); | 885 | int ASN1_TIME_set_string(ASN1_TIME *s, const char *str); |
886 | 886 | ||
887 | int i2d_ASN1_SET(STACK_OF(OPENSSL_BLOCK) *a, unsigned char **pp, | ||
888 | i2d_of_void *i2d, int ex_tag, int ex_class, | ||
889 | int is_set); | ||
890 | STACK_OF(OPENSSL_BLOCK) *d2i_ASN1_SET(STACK_OF(OPENSSL_BLOCK) **a, | ||
891 | const unsigned char **pp, | ||
892 | long length, d2i_of_void *d2i, | ||
893 | void (*free_func)(OPENSSL_BLOCK), int ex_tag, | ||
894 | int ex_class); | ||
895 | |||
887 | #ifndef OPENSSL_NO_BIO | 896 | #ifndef OPENSSL_NO_BIO |
888 | int i2a_ASN1_INTEGER(BIO *bp, ASN1_INTEGER *a); | 897 | int i2a_ASN1_INTEGER(BIO *bp, ASN1_INTEGER *a); |
889 | int a2i_ASN1_INTEGER(BIO *bp,ASN1_INTEGER *bs,char *buf,int size); | 898 | int a2i_ASN1_INTEGER(BIO *bp,ASN1_INTEGER *bs,char *buf,int size); |
diff --git a/src/lib/libcrypto/crypto/Makefile b/src/lib/libcrypto/crypto/Makefile index 62f0861d47..31cab709d9 100644 --- a/src/lib/libcrypto/crypto/Makefile +++ b/src/lib/libcrypto/crypto/Makefile | |||
@@ -1,4 +1,4 @@ | |||
1 | # $OpenBSD: Makefile,v 1.24 2014/04/18 13:19:03 tedu Exp $ | 1 | # $OpenBSD: Makefile,v 1.25 2014/04/18 17:32:31 miod Exp $ |
2 | 2 | ||
3 | LIB= crypto | 3 | LIB= crypto |
4 | 4 | ||
@@ -57,6 +57,7 @@ SRCS+= f_int.c f_string.c n_pkey.c | |||
57 | SRCS+= f_enum.c x_pkey.c a_bool.c x_exten.c bio_asn1.c bio_ndef.c asn_mime.c | 57 | SRCS+= f_enum.c x_pkey.c a_bool.c x_exten.c bio_asn1.c bio_ndef.c asn_mime.c |
58 | SRCS+= asn1_gen.c asn1_par.c asn1_lib.c asn1_err.c a_bytes.c a_strnid.c | 58 | SRCS+= asn1_gen.c asn1_par.c asn1_lib.c asn1_err.c a_bytes.c a_strnid.c |
59 | SRCS+= evp_asn1.c asn_pack.c p5_pbe.c p5_pbev2.c p8_pkey.c asn_moid.c | 59 | SRCS+= evp_asn1.c asn_pack.c p5_pbe.c p5_pbev2.c p8_pkey.c asn_moid.c |
60 | SRCS+= a_set.c | ||
60 | 61 | ||
61 | # bf/ | 62 | # bf/ |
62 | SRCS+= bf_skey.c bf_ecb.c bf_cfb64.c bf_ofb64.c | 63 | SRCS+= bf_skey.c bf_ecb.c bf_cfb64.c bf_ofb64.c |
diff --git a/src/lib/libcrypto/stack/safestack.h b/src/lib/libcrypto/stack/safestack.h index 56978a2b01..f2a36fd64b 100644 --- a/src/lib/libcrypto/stack/safestack.h +++ b/src/lib/libcrypto/stack/safestack.h | |||
@@ -178,6 +178,19 @@ DECLARE_SPECIAL_STACK_OF(OPENSSL_BLOCK, void) | |||
178 | #define SKM_sk_is_sorted(type, st) \ | 178 | #define SKM_sk_is_sorted(type, st) \ |
179 | sk_is_sorted(CHECKED_STACK_OF(type, st)) | 179 | sk_is_sorted(CHECKED_STACK_OF(type, st)) |
180 | 180 | ||
181 | #define SKM_ASN1_SET_OF_d2i(type, st, pp, length, d2i_func, free_func, ex_tag, ex_class) \ | ||
182 | (STACK_OF(type) *)d2i_ASN1_SET( \ | ||
183 | (STACK_OF(OPENSSL_BLOCK) **)CHECKED_PTR_OF(STACK_OF(type)*, st), \ | ||
184 | pp, length, \ | ||
185 | CHECKED_D2I_OF(type, d2i_func), \ | ||
186 | CHECKED_SK_FREE_FUNC(type, free_func), \ | ||
187 | ex_tag, ex_class) | ||
188 | |||
189 | #define SKM_ASN1_SET_OF_i2d(type, st, pp, i2d_func, ex_tag, ex_class, is_set) \ | ||
190 | i2d_ASN1_SET((STACK_OF(OPENSSL_BLOCK) *)CHECKED_STACK_OF(type, st), pp, \ | ||
191 | CHECKED_I2D_OF(type, i2d_func), \ | ||
192 | ex_tag, ex_class, is_set) | ||
193 | |||
181 | #define SKM_PKCS12_decrypt_d2i(type, algor, d2i_func, free_func, pass, passlen, oct, seq) \ | 194 | #define SKM_PKCS12_decrypt_d2i(type, algor, d2i_func, free_func, pass, passlen, oct, seq) \ |
182 | (STACK_OF(type) *)PKCS12_decrypt_d2i(algor, \ | 195 | (STACK_OF(type) *)PKCS12_decrypt_d2i(algor, \ |
183 | CHECKED_D2I_OF(type, d2i_func), \ | 196 | CHECKED_D2I_OF(type, d2i_func), \ |
diff --git a/src/lib/libssl/src/crypto/asn1/a_set.c b/src/lib/libssl/src/crypto/asn1/a_set.c new file mode 100644 index 0000000000..8a97984893 --- /dev/null +++ b/src/lib/libssl/src/crypto/asn1/a_set.c | |||
@@ -0,0 +1,236 @@ | |||
1 | /* crypto/asn1/a_set.c */ | ||
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 "cryptlib.h" | ||
61 | #include <openssl/asn1_mac.h> | ||
62 | |||
63 | #ifndef NO_ASN1_OLD | ||
64 | |||
65 | typedef struct { | ||
66 | unsigned char *pbData; | ||
67 | int cbData; | ||
68 | } MYBLOB; | ||
69 | |||
70 | /* SetBlobCmp | ||
71 | * This function compares two elements of SET_OF block | ||
72 | */ | ||
73 | static int | ||
74 | SetBlobCmp(const void *elem1, const void *elem2) | ||
75 | { | ||
76 | const MYBLOB *b1 = (const MYBLOB *)elem1; | ||
77 | const MYBLOB *b2 = (const MYBLOB *)elem2; | ||
78 | int r; | ||
79 | |||
80 | r = memcmp(b1->pbData, b2->pbData, | ||
81 | b1->cbData < b2->cbData ? b1->cbData : b2->cbData); | ||
82 | if (r != 0) | ||
83 | return r; | ||
84 | return b1->cbData - b2->cbData; | ||
85 | } | ||
86 | |||
87 | /* int is_set: if TRUE, then sort the contents (i.e. it isn't a SEQUENCE) */ | ||
88 | int | ||
89 | i2d_ASN1_SET(STACK_OF(OPENSSL_BLOCK) *a, unsigned char **pp, i2d_of_void *i2d, | ||
90 | int ex_tag, int ex_class, int is_set) | ||
91 | { | ||
92 | int ret = 0, r; | ||
93 | int i; | ||
94 | unsigned char *p; | ||
95 | unsigned char *pStart, *pTempMem; | ||
96 | MYBLOB *rgSetBlob; | ||
97 | int totSize; | ||
98 | |||
99 | if (a == NULL) | ||
100 | return 0; | ||
101 | for (i = sk_OPENSSL_BLOCK_num(a) - 1; i >= 0; i--) | ||
102 | ret += i2d(sk_OPENSSL_BLOCK_value(a, i), NULL); | ||
103 | r = ASN1_object_size(1, ret, ex_tag); | ||
104 | if (pp == NULL) | ||
105 | return r; | ||
106 | |||
107 | p= *pp; | ||
108 | ASN1_put_object(&p, 1, ret, ex_tag, ex_class); | ||
109 | |||
110 | /* Modified by gp@nsj.co.jp */ | ||
111 | /* And then again by Ben */ | ||
112 | /* And again by Steve */ | ||
113 | |||
114 | if (!is_set || (sk_OPENSSL_BLOCK_num(a) < 2)) { | ||
115 | for (i = 0; i < sk_OPENSSL_BLOCK_num(a); i++) | ||
116 | i2d(sk_OPENSSL_BLOCK_value(a, i), &p); | ||
117 | |||
118 | *pp = p; | ||
119 | return r; | ||
120 | } | ||
121 | |||
122 | pStart = p; /* Catch the beg of Setblobs*/ | ||
123 | /* In this array we will store the SET blobs */ | ||
124 | rgSetBlob = malloc(sk_OPENSSL_BLOCK_num(a) * sizeof(MYBLOB)); | ||
125 | if (rgSetBlob == NULL) { | ||
126 | ASN1err(ASN1_F_I2D_ASN1_SET, ERR_R_MALLOC_FAILURE); | ||
127 | return 0; | ||
128 | } | ||
129 | |||
130 | for (i = 0; i < sk_OPENSSL_BLOCK_num(a); i++) { | ||
131 | rgSetBlob[i].pbData = p; /* catch each set encode blob */ | ||
132 | i2d(sk_OPENSSL_BLOCK_value(a, i), &p); | ||
133 | /* Length of this SetBlob */ | ||
134 | rgSetBlob[i].cbData = p - rgSetBlob[i].pbData; | ||
135 | } | ||
136 | *pp = p; | ||
137 | totSize = p - pStart; /* This is the total size of all set blobs */ | ||
138 | |||
139 | /* Now we have to sort the blobs. I am using a simple algo. | ||
140 | * Sort ptrs | ||
141 | * Copy to temp-mem | ||
142 | * Copy from temp-mem to user-mem | ||
143 | */ | ||
144 | qsort(rgSetBlob, sk_OPENSSL_BLOCK_num(a), sizeof(MYBLOB), SetBlobCmp); | ||
145 | if ((pTempMem = malloc(totSize)) == NULL) { | ||
146 | free(rgSetBlob); | ||
147 | ASN1err(ASN1_F_I2D_ASN1_SET, ERR_R_MALLOC_FAILURE); | ||
148 | return 0; | ||
149 | } | ||
150 | |||
151 | /* Copy to temp mem */ | ||
152 | p = pTempMem; | ||
153 | for (i = 0; i < sk_OPENSSL_BLOCK_num(a); ++i) { | ||
154 | memcpy(p, rgSetBlob[i].pbData, rgSetBlob[i].cbData); | ||
155 | p += rgSetBlob[i].cbData; | ||
156 | } | ||
157 | |||
158 | /* Copy back to user mem*/ | ||
159 | memcpy(pStart, pTempMem, totSize); | ||
160 | free(pTempMem); | ||
161 | free(rgSetBlob); | ||
162 | |||
163 | return r; | ||
164 | } | ||
165 | |||
166 | STACK_OF(OPENSSL_BLOCK) * | ||
167 | d2i_ASN1_SET(STACK_OF(OPENSSL_BLOCK) **a, const unsigned char **pp, long length, | ||
168 | d2i_of_void *d2i, void (*free_func)(OPENSSL_BLOCK), int ex_tag, | ||
169 | int ex_class) | ||
170 | { | ||
171 | ASN1_const_CTX c; | ||
172 | STACK_OF(OPENSSL_BLOCK) *ret = NULL; | ||
173 | |||
174 | if (a == NULL || (*a) == NULL) { | ||
175 | if ((ret = sk_OPENSSL_BLOCK_new_null()) == NULL) { | ||
176 | ASN1err(ASN1_F_D2I_ASN1_SET, ERR_R_MALLOC_FAILURE); | ||
177 | goto err; | ||
178 | } | ||
179 | } else | ||
180 | ret = *a; | ||
181 | |||
182 | c.p= *pp; | ||
183 | c.max = (length == 0) ? 0 : (c.p + length); | ||
184 | |||
185 | c.inf = ASN1_get_object(&c.p, &c.slen, &c.tag, &c.xclass, c.max - c.p); | ||
186 | if (c.inf & 0x80) | ||
187 | goto err; | ||
188 | if (ex_class != c.xclass) { | ||
189 | ASN1err(ASN1_F_D2I_ASN1_SET, ASN1_R_BAD_CLASS); | ||
190 | goto err; | ||
191 | } | ||
192 | if (ex_tag != c.tag) { | ||
193 | ASN1err(ASN1_F_D2I_ASN1_SET, ASN1_R_BAD_TAG); | ||
194 | goto err; | ||
195 | } | ||
196 | if (c.slen + c.p > c.max) { | ||
197 | ASN1err(ASN1_F_D2I_ASN1_SET, ASN1_R_LENGTH_ERROR); | ||
198 | goto err; | ||
199 | } | ||
200 | /* check for infinite constructed - it can be as long | ||
201 | * as the amount of data passed to us */ | ||
202 | if (c.inf == (V_ASN1_CONSTRUCTED + 1)) | ||
203 | c.slen = length + *pp - c.p; | ||
204 | c.max = c.p + c.slen; | ||
205 | |||
206 | while (c.p < c.max) { | ||
207 | char *s; | ||
208 | |||
209 | if (M_ASN1_D2I_end_sequence()) | ||
210 | break; | ||
211 | /* XXX: This was called with 4 arguments, incorrectly, it seems | ||
212 | if ((s = func(NULL, &c.p, c.slen, c.max - c.p)) == NULL) */ | ||
213 | if ((s = d2i(NULL, &c.p, c.slen)) == NULL) { | ||
214 | ASN1err(ASN1_F_D2I_ASN1_SET, | ||
215 | ASN1_R_ERROR_PARSING_SET_ELEMENT); | ||
216 | asn1_add_error(*pp, (int)(c.p - *pp)); | ||
217 | goto err; | ||
218 | } | ||
219 | if (!sk_OPENSSL_BLOCK_push(ret,s)) | ||
220 | goto err; | ||
221 | } | ||
222 | if (a != NULL) | ||
223 | *a = ret; | ||
224 | *pp = c.p; | ||
225 | return ret; | ||
226 | err: | ||
227 | if (ret != NULL && (a == NULL || *a != ret)) { | ||
228 | if (free_func != NULL) | ||
229 | sk_OPENSSL_BLOCK_pop_free(ret, free_func); | ||
230 | else | ||
231 | sk_OPENSSL_BLOCK_free(ret); | ||
232 | } | ||
233 | return NULL; | ||
234 | } | ||
235 | |||
236 | #endif | ||
diff --git a/src/lib/libssl/src/crypto/asn1/asn1.h b/src/lib/libssl/src/crypto/asn1/asn1.h index c4fa8c649b..3daebc078f 100644 --- a/src/lib/libssl/src/crypto/asn1/asn1.h +++ b/src/lib/libssl/src/crypto/asn1/asn1.h | |||
@@ -884,6 +884,15 @@ int ASN1_TIME_check(ASN1_TIME *t); | |||
884 | ASN1_GENERALIZEDTIME *ASN1_TIME_to_generalizedtime(ASN1_TIME *t, ASN1_GENERALIZEDTIME **out); | 884 | ASN1_GENERALIZEDTIME *ASN1_TIME_to_generalizedtime(ASN1_TIME *t, ASN1_GENERALIZEDTIME **out); |
885 | int ASN1_TIME_set_string(ASN1_TIME *s, const char *str); | 885 | int ASN1_TIME_set_string(ASN1_TIME *s, const char *str); |
886 | 886 | ||
887 | int i2d_ASN1_SET(STACK_OF(OPENSSL_BLOCK) *a, unsigned char **pp, | ||
888 | i2d_of_void *i2d, int ex_tag, int ex_class, | ||
889 | int is_set); | ||
890 | STACK_OF(OPENSSL_BLOCK) *d2i_ASN1_SET(STACK_OF(OPENSSL_BLOCK) **a, | ||
891 | const unsigned char **pp, | ||
892 | long length, d2i_of_void *d2i, | ||
893 | void (*free_func)(OPENSSL_BLOCK), int ex_tag, | ||
894 | int ex_class); | ||
895 | |||
887 | #ifndef OPENSSL_NO_BIO | 896 | #ifndef OPENSSL_NO_BIO |
888 | int i2a_ASN1_INTEGER(BIO *bp, ASN1_INTEGER *a); | 897 | int i2a_ASN1_INTEGER(BIO *bp, ASN1_INTEGER *a); |
889 | int a2i_ASN1_INTEGER(BIO *bp,ASN1_INTEGER *bs,char *buf,int size); | 898 | int a2i_ASN1_INTEGER(BIO *bp,ASN1_INTEGER *bs,char *buf,int size); |
diff --git a/src/lib/libssl/src/crypto/stack/safestack.h b/src/lib/libssl/src/crypto/stack/safestack.h index 56978a2b01..f2a36fd64b 100644 --- a/src/lib/libssl/src/crypto/stack/safestack.h +++ b/src/lib/libssl/src/crypto/stack/safestack.h | |||
@@ -178,6 +178,19 @@ DECLARE_SPECIAL_STACK_OF(OPENSSL_BLOCK, void) | |||
178 | #define SKM_sk_is_sorted(type, st) \ | 178 | #define SKM_sk_is_sorted(type, st) \ |
179 | sk_is_sorted(CHECKED_STACK_OF(type, st)) | 179 | sk_is_sorted(CHECKED_STACK_OF(type, st)) |
180 | 180 | ||
181 | #define SKM_ASN1_SET_OF_d2i(type, st, pp, length, d2i_func, free_func, ex_tag, ex_class) \ | ||
182 | (STACK_OF(type) *)d2i_ASN1_SET( \ | ||
183 | (STACK_OF(OPENSSL_BLOCK) **)CHECKED_PTR_OF(STACK_OF(type)*, st), \ | ||
184 | pp, length, \ | ||
185 | CHECKED_D2I_OF(type, d2i_func), \ | ||
186 | CHECKED_SK_FREE_FUNC(type, free_func), \ | ||
187 | ex_tag, ex_class) | ||
188 | |||
189 | #define SKM_ASN1_SET_OF_i2d(type, st, pp, i2d_func, ex_tag, ex_class, is_set) \ | ||
190 | i2d_ASN1_SET((STACK_OF(OPENSSL_BLOCK) *)CHECKED_STACK_OF(type, st), pp, \ | ||
191 | CHECKED_I2D_OF(type, i2d_func), \ | ||
192 | ex_tag, ex_class, is_set) | ||
193 | |||
181 | #define SKM_PKCS12_decrypt_d2i(type, algor, d2i_func, free_func, pass, passlen, oct, seq) \ | 194 | #define SKM_PKCS12_decrypt_d2i(type, algor, d2i_func, free_func, pass, passlen, oct, seq) \ |
182 | (STACK_OF(type) *)PKCS12_decrypt_d2i(algor, \ | 195 | (STACK_OF(type) *)PKCS12_decrypt_d2i(algor, \ |
183 | CHECKED_D2I_OF(type, d2i_func), \ | 196 | CHECKED_D2I_OF(type, d2i_func), \ |