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 <limits.h> |
61 |
#include "cryptlib.h" |
62 |
#include <openssl/asn1_mac.h> |
63 |
|
64 |
#ifndef NO_ASN1_OLD |
65 |
|
66 |
typedef struct { |
67 |
unsigned char *pbData; |
68 |
int cbData; |
69 |
} MYBLOB; |
70 |
|
71 |
/* |
72 |
* SetBlobCmp This function compares two elements of SET_OF block |
73 |
*/ |
74 |
static int 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 |
/* |
88 |
* int is_set: if TRUE, then sort the contents (i.e. it isn't a SEQUENCE) |
89 |
*/ |
90 |
int i2d_ASN1_SET(STACK_OF(OPENSSL_BLOCK) *a, unsigned char **pp, |
91 |
i2d_of_void *i2d, int ex_tag, int ex_class, int is_set) |
92 |
{ |
93 |
int ret = 0, r; |
94 |
int i; |
95 |
unsigned char *p; |
96 |
unsigned char *pStart, *pTempMem; |
97 |
MYBLOB *rgSetBlob; |
98 |
int totSize; |
99 |
|
100 |
if (a == NULL) |
101 |
return (0); |
102 |
for (i = sk_OPENSSL_BLOCK_num(a) - 1; i >= 0; i--) { |
103 |
int tmplen = i2d(sk_OPENSSL_BLOCK_value(a, i), NULL); |
104 |
if (tmplen > INT_MAX - ret) |
105 |
return -1; |
106 |
ret += i2d(sk_OPENSSL_BLOCK_value(a, i), NULL); |
107 |
} |
108 |
r = ASN1_object_size(1, ret, ex_tag); |
109 |
if (pp == NULL || r == -1) |
110 |
return (r); |
111 |
|
112 |
p = *pp; |
113 |
ASN1_put_object(&p, 1, ret, ex_tag, ex_class); |
114 |
|
115 |
/* Modified by gp@nsj.co.jp */ |
116 |
/* And then again by Ben */ |
117 |
/* And again by Steve */ |
118 |
|
119 |
if (!is_set || (sk_OPENSSL_BLOCK_num(a) < 2)) { |
120 |
for (i = 0; i < sk_OPENSSL_BLOCK_num(a); i++) |
121 |
i2d(sk_OPENSSL_BLOCK_value(a, i), &p); |
122 |
|
123 |
*pp = p; |
124 |
return (r); |
125 |
} |
126 |
|
127 |
pStart = p; /* Catch the beg of Setblobs */ |
128 |
/* In this array we will store the SET blobs */ |
129 |
rgSetBlob = OPENSSL_malloc(sk_OPENSSL_BLOCK_num(a) * sizeof(MYBLOB)); |
130 |
if (rgSetBlob == NULL) { |
131 |
ASN1err(ASN1_F_I2D_ASN1_SET, ERR_R_MALLOC_FAILURE); |
132 |
return (0); |
133 |
} |
134 |
|
135 |
for (i = 0; i < sk_OPENSSL_BLOCK_num(a); i++) { |
136 |
rgSetBlob[i].pbData = p; /* catch each set encode blob */ |
137 |
i2d(sk_OPENSSL_BLOCK_value(a, i), &p); |
138 |
rgSetBlob[i].cbData = p - rgSetBlob[i].pbData; /* Length of this |
139 |
* SetBlob */ |
140 |
} |
141 |
*pp = p; |
142 |
totSize = p - pStart; /* This is the total size of all set blobs */ |
143 |
|
144 |
/* |
145 |
* Now we have to sort the blobs. I am using a simple algo. *Sort ptrs |
146 |
* *Copy to temp-mem *Copy from temp-mem to user-mem |
147 |
*/ |
148 |
qsort(rgSetBlob, sk_OPENSSL_BLOCK_num(a), sizeof(MYBLOB), SetBlobCmp); |
149 |
if (!(pTempMem = OPENSSL_malloc(totSize))) { |
150 |
ASN1err(ASN1_F_I2D_ASN1_SET, ERR_R_MALLOC_FAILURE); |
151 |
return (0); |
152 |
} |
153 |
|
154 |
/* Copy to temp mem */ |
155 |
p = pTempMem; |
156 |
for (i = 0; i < sk_OPENSSL_BLOCK_num(a); ++i) { |
157 |
memcpy(p, rgSetBlob[i].pbData, rgSetBlob[i].cbData); |
158 |
p += rgSetBlob[i].cbData; |
159 |
} |
160 |
|
161 |
/* Copy back to user mem*/ |
162 |
memcpy(pStart, pTempMem, totSize); |
163 |
OPENSSL_free(pTempMem); |
164 |
OPENSSL_free(rgSetBlob); |
165 |
|
166 |
return (r); |
167 |
} |
168 |
|
169 |
STACK_OF(OPENSSL_BLOCK) *d2i_ASN1_SET(STACK_OF(OPENSSL_BLOCK) **a, |
170 |
const unsigned char **pp, |
171 |
long length, d2i_of_void *d2i, |
172 |
void (*free_func) (OPENSSL_BLOCK), |
173 |
int ex_tag, int ex_class) |
174 |
{ |
175 |
ASN1_const_CTX c; |
176 |
STACK_OF(OPENSSL_BLOCK) *ret = NULL; |
177 |
|
178 |
if ((a == NULL) || ((*a) == NULL)) { |
179 |
if ((ret = sk_OPENSSL_BLOCK_new_null()) == NULL) { |
180 |
ASN1err(ASN1_F_D2I_ASN1_SET, ERR_R_MALLOC_FAILURE); |
181 |
goto err; |
182 |
} |
183 |
} else |
184 |
ret = (*a); |
185 |
|
186 |
c.p = *pp; |
187 |
c.max = (length == 0) ? 0 : (c.p + length); |
188 |
|
189 |
c.inf = ASN1_get_object(&c.p, &c.slen, &c.tag, &c.xclass, c.max - c.p); |
190 |
if (c.inf & 0x80) |
191 |
goto err; |
192 |
if (ex_class != c.xclass) { |
193 |
ASN1err(ASN1_F_D2I_ASN1_SET, ASN1_R_BAD_CLASS); |
194 |
goto err; |
195 |
} |
196 |
if (ex_tag != c.tag) { |
197 |
ASN1err(ASN1_F_D2I_ASN1_SET, ASN1_R_BAD_TAG); |
198 |
goto err; |
199 |
} |
200 |
if ((c.slen + c.p) > c.max) { |
201 |
ASN1err(ASN1_F_D2I_ASN1_SET, ASN1_R_LENGTH_ERROR); |
202 |
goto err; |
203 |
} |
204 |
/* |
205 |
* check for infinite constructed - it can be as long as the amount of |
206 |
* data passed to us |
207 |
*/ |
208 |
if (c.inf == (V_ASN1_CONSTRUCTED + 1)) |
209 |
c.slen = length + *pp - c.p; |
210 |
c.max = c.p + c.slen; |
211 |
|
212 |
while (c.p < c.max) { |
213 |
char *s; |
214 |
|
215 |
if (M_ASN1_D2I_end_sequence()) |
216 |
break; |
217 |
/* |
218 |
* XXX: This was called with 4 arguments, incorrectly, it seems if |
219 |
* ((s=func(NULL,&c.p,c.slen,c.max-c.p)) == NULL) |
220 |
*/ |
221 |
if ((s = d2i(NULL, &c.p, c.slen)) == NULL) { |
222 |
ASN1err(ASN1_F_D2I_ASN1_SET, ASN1_R_ERROR_PARSING_SET_ELEMENT); |
223 |
asn1_add_error(*pp, (int)(c.p - *pp)); |
224 |
goto err; |
225 |
} |
226 |
if (!sk_OPENSSL_BLOCK_push(ret, s)) |
227 |
goto err; |
228 |
} |
229 |
if (a != NULL) |
230 |
(*a) = ret; |
231 |
*pp = c.p; |
232 |
return (ret); |
233 |
err: |
234 |
if ((ret != NULL) && ((a == NULL) || (*a != ret))) { |
235 |
if (free_func != NULL) |
236 |
sk_OPENSSL_BLOCK_pop_free(ret, free_func); |
237 |
else |
238 |
sk_OPENSSL_BLOCK_free(ret); |
239 |
} |
240 |
return (NULL); |
241 |
} |
242 |
|
243 |
#endif |