/src/openssl/crypto/asn1/a_set.c
Line | Count | Source (jump to first uncovered line) |
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 | 0 | { |
76 | 0 | const MYBLOB *b1 = (const MYBLOB *)elem1; |
77 | 0 | const MYBLOB *b2 = (const MYBLOB *)elem2; |
78 | 0 | int r; |
79 | |
|
80 | 0 | r = memcmp(b1->pbData, b2->pbData, |
81 | 0 | b1->cbData < b2->cbData ? b1->cbData : b2->cbData); |
82 | 0 | if (r != 0) |
83 | 0 | return r; |
84 | 0 | return b1->cbData - b2->cbData; |
85 | 0 | } |
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 | 0 | { |
93 | 0 | int ret = 0, r; |
94 | 0 | int i; |
95 | 0 | unsigned char *p; |
96 | 0 | unsigned char *pStart, *pTempMem; |
97 | 0 | MYBLOB *rgSetBlob; |
98 | 0 | int totSize; |
99 | |
|
100 | 0 | if (a == NULL) |
101 | 0 | return (0); |
102 | 0 | for (i = sk_OPENSSL_BLOCK_num(a) - 1; i >= 0; i--) { |
103 | 0 | int tmplen = i2d(sk_OPENSSL_BLOCK_value(a, i), NULL); |
104 | 0 | if (tmplen > INT_MAX - ret) |
105 | 0 | return -1; |
106 | 0 | ret += i2d(sk_OPENSSL_BLOCK_value(a, i), NULL); |
107 | 0 | } |
108 | 0 | r = ASN1_object_size(1, ret, ex_tag); |
109 | 0 | if (pp == NULL || r == -1) |
110 | 0 | return (r); |
111 | | |
112 | 0 | p = *pp; |
113 | 0 | 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 | 0 | if (!is_set || (sk_OPENSSL_BLOCK_num(a) < 2)) { |
120 | 0 | for (i = 0; i < sk_OPENSSL_BLOCK_num(a); i++) |
121 | 0 | i2d(sk_OPENSSL_BLOCK_value(a, i), &p); |
122 | |
|
123 | 0 | *pp = p; |
124 | 0 | return (r); |
125 | 0 | } |
126 | | |
127 | 0 | pStart = p; /* Catch the beg of Setblobs */ |
128 | | /* In this array we will store the SET blobs */ |
129 | 0 | rgSetBlob = OPENSSL_malloc(sk_OPENSSL_BLOCK_num(a) * sizeof(MYBLOB)); |
130 | 0 | if (rgSetBlob == NULL) { |
131 | 0 | ASN1err(ASN1_F_I2D_ASN1_SET, ERR_R_MALLOC_FAILURE); |
132 | 0 | return (0); |
133 | 0 | } |
134 | | |
135 | 0 | for (i = 0; i < sk_OPENSSL_BLOCK_num(a); i++) { |
136 | 0 | rgSetBlob[i].pbData = p; /* catch each set encode blob */ |
137 | 0 | i2d(sk_OPENSSL_BLOCK_value(a, i), &p); |
138 | 0 | rgSetBlob[i].cbData = p - rgSetBlob[i].pbData; /* Length of this |
139 | | * SetBlob */ |
140 | 0 | } |
141 | 0 | *pp = p; |
142 | 0 | 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 | 0 | qsort(rgSetBlob, sk_OPENSSL_BLOCK_num(a), sizeof(MYBLOB), SetBlobCmp); |
149 | 0 | if (!(pTempMem = OPENSSL_malloc(totSize))) { |
150 | 0 | ASN1err(ASN1_F_I2D_ASN1_SET, ERR_R_MALLOC_FAILURE); |
151 | 0 | return (0); |
152 | 0 | } |
153 | | |
154 | | /* Copy to temp mem */ |
155 | 0 | p = pTempMem; |
156 | 0 | for (i = 0; i < sk_OPENSSL_BLOCK_num(a); ++i) { |
157 | 0 | memcpy(p, rgSetBlob[i].pbData, rgSetBlob[i].cbData); |
158 | 0 | p += rgSetBlob[i].cbData; |
159 | 0 | } |
160 | | |
161 | | /* Copy back to user mem*/ |
162 | 0 | memcpy(pStart, pTempMem, totSize); |
163 | 0 | OPENSSL_free(pTempMem); |
164 | 0 | OPENSSL_free(rgSetBlob); |
165 | |
|
166 | 0 | return (r); |
167 | 0 | } |
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 | 0 | { |
175 | 0 | ASN1_const_CTX c; |
176 | 0 | STACK_OF(OPENSSL_BLOCK) *ret = NULL; |
177 | |
|
178 | 0 | if ((a == NULL) || ((*a) == NULL)) { |
179 | 0 | if ((ret = sk_OPENSSL_BLOCK_new_null()) == NULL) { |
180 | 0 | ASN1err(ASN1_F_D2I_ASN1_SET, ERR_R_MALLOC_FAILURE); |
181 | 0 | goto err; |
182 | 0 | } |
183 | 0 | } else |
184 | 0 | ret = (*a); |
185 | | |
186 | 0 | c.p = *pp; |
187 | 0 | c.max = (length == 0) ? 0 : (c.p + length); |
188 | |
|
189 | 0 | c.inf = ASN1_get_object(&c.p, &c.slen, &c.tag, &c.xclass, c.max - c.p); |
190 | 0 | if (c.inf & 0x80) |
191 | 0 | goto err; |
192 | 0 | if (ex_class != c.xclass) { |
193 | 0 | ASN1err(ASN1_F_D2I_ASN1_SET, ASN1_R_BAD_CLASS); |
194 | 0 | goto err; |
195 | 0 | } |
196 | 0 | if (ex_tag != c.tag) { |
197 | 0 | ASN1err(ASN1_F_D2I_ASN1_SET, ASN1_R_BAD_TAG); |
198 | 0 | goto err; |
199 | 0 | } |
200 | 0 | if ((c.slen + c.p) > c.max) { |
201 | 0 | ASN1err(ASN1_F_D2I_ASN1_SET, ASN1_R_LENGTH_ERROR); |
202 | 0 | goto err; |
203 | 0 | } |
204 | | /* |
205 | | * check for infinite constructed - it can be as long as the amount of |
206 | | * data passed to us |
207 | | */ |
208 | 0 | if (c.inf == (V_ASN1_CONSTRUCTED + 1)) |
209 | 0 | c.slen = length + *pp - c.p; |
210 | 0 | c.max = c.p + c.slen; |
211 | |
|
212 | 0 | while (c.p < c.max) { |
213 | 0 | char *s; |
214 | |
|
215 | 0 | if (M_ASN1_D2I_end_sequence()) |
216 | 0 | 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 | 0 | if ((s = d2i(NULL, &c.p, c.slen)) == NULL) { |
222 | 0 | ASN1err(ASN1_F_D2I_ASN1_SET, ASN1_R_ERROR_PARSING_SET_ELEMENT); |
223 | 0 | asn1_add_error(*pp, (int)(c.p - *pp)); |
224 | 0 | goto err; |
225 | 0 | } |
226 | 0 | if (!sk_OPENSSL_BLOCK_push(ret, s)) |
227 | 0 | goto err; |
228 | 0 | } |
229 | 0 | if (a != NULL) |
230 | 0 | (*a) = ret; |
231 | 0 | *pp = c.p; |
232 | 0 | return (ret); |
233 | 0 | err: |
234 | 0 | if ((ret != NULL) && ((a == NULL) || (*a != ret))) { |
235 | 0 | if (free_func != NULL) |
236 | 0 | sk_OPENSSL_BLOCK_pop_free(ret, free_func); |
237 | 0 | else |
238 | 0 | sk_OPENSSL_BLOCK_free(ret); |
239 | 0 | } |
240 | 0 | return (NULL); |
241 | 0 | } |
242 | | |
243 | | #endif |