diff options
Diffstat (limited to 'src/lib/libcrypto/asn1/a_set.c')
-rw-r--r-- | src/lib/libcrypto/asn1/a_set.c | 237 |
1 files changed, 0 insertions, 237 deletions
diff --git a/src/lib/libcrypto/asn1/a_set.c b/src/lib/libcrypto/asn1/a_set.c deleted file mode 100644 index 63d55c3714..0000000000 --- a/src/lib/libcrypto/asn1/a_set.c +++ /dev/null | |||
@@ -1,237 +0,0 @@ | |||
1 | /* $OpenBSD: a_set.c,v 1.17 2015/03/19 14:00:22 tedu 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 | #include <string.h> | ||
61 | |||
62 | #include <openssl/asn1_mac.h> | ||
63 | #include <openssl/err.h> | ||
64 | |||
65 | #ifndef NO_ASN1_OLD | ||
66 | |||
67 | typedef struct { | ||
68 | unsigned char *pbData; | ||
69 | int cbData; | ||
70 | } MYBLOB; | ||
71 | |||
72 | /* SetBlobCmp | ||
73 | * This function compares two elements of SET_OF block | ||
74 | */ | ||
75 | static int | ||
76 | SetBlobCmp(const void *elem1, const void *elem2) | ||
77 | { | ||
78 | const MYBLOB *b1 = (const MYBLOB *)elem1; | ||
79 | const MYBLOB *b2 = (const MYBLOB *)elem2; | ||
80 | int r; | ||
81 | |||
82 | r = memcmp(b1->pbData, b2->pbData, | ||
83 | b1->cbData < b2->cbData ? b1->cbData : b2->cbData); | ||
84 | if (r != 0) | ||
85 | return r; | ||
86 | return b1->cbData - b2->cbData; | ||
87 | } | ||
88 | |||
89 | /* int is_set: if TRUE, then sort the contents (i.e. it isn't a SEQUENCE) */ | ||
90 | int | ||
91 | i2d_ASN1_SET(STACK_OF(OPENSSL_BLOCK) *a, unsigned char **pp, i2d_of_void *i2d, | ||
92 | int ex_tag, int ex_class, int is_set) | ||
93 | { | ||
94 | int ret = 0, r; | ||
95 | int i; | ||
96 | unsigned char *p; | ||
97 | unsigned char *pStart, *pTempMem; | ||
98 | MYBLOB *rgSetBlob; | ||
99 | int totSize; | ||
100 | |||
101 | if (a == NULL) | ||
102 | return 0; | ||
103 | for (i = sk_OPENSSL_BLOCK_num(a) - 1; i >= 0; i--) | ||
104 | ret += i2d(sk_OPENSSL_BLOCK_value(a, i), NULL); | ||
105 | r = ASN1_object_size(1, ret, ex_tag); | ||
106 | if (pp == NULL) | ||
107 | return r; | ||
108 | |||
109 | p = *pp; | ||
110 | ASN1_put_object(&p, 1, ret, ex_tag, ex_class); | ||
111 | |||
112 | /* Modified by gp@nsj.co.jp */ | ||
113 | /* And then again by Ben */ | ||
114 | /* And again by Steve */ | ||
115 | |||
116 | if (!is_set || (sk_OPENSSL_BLOCK_num(a) < 2)) { | ||
117 | for (i = 0; i < sk_OPENSSL_BLOCK_num(a); i++) | ||
118 | i2d(sk_OPENSSL_BLOCK_value(a, i), &p); | ||
119 | |||
120 | *pp = p; | ||
121 | return r; | ||
122 | } | ||
123 | |||
124 | pStart = p; /* Catch the beg of Setblobs*/ | ||
125 | /* In this array we will store the SET blobs */ | ||
126 | rgSetBlob = reallocarray(NULL, sk_OPENSSL_BLOCK_num(a), sizeof(MYBLOB)); | ||
127 | if (rgSetBlob == NULL) { | ||
128 | ASN1err(ASN1_F_I2D_ASN1_SET, ERR_R_MALLOC_FAILURE); | ||
129 | return 0; | ||
130 | } | ||
131 | |||
132 | for (i = 0; i < sk_OPENSSL_BLOCK_num(a); i++) { | ||
133 | rgSetBlob[i].pbData = p; /* catch each set encode blob */ | ||
134 | i2d(sk_OPENSSL_BLOCK_value(a, i), &p); | ||
135 | /* Length of this SetBlob */ | ||
136 | rgSetBlob[i].cbData = p - rgSetBlob[i].pbData; | ||
137 | } | ||
138 | *pp = p; | ||
139 | totSize = p - pStart; /* This is the total size of all set blobs */ | ||
140 | |||
141 | /* Now we have to sort the blobs. I am using a simple algo. | ||
142 | * Sort ptrs | ||
143 | * Copy to temp-mem | ||
144 | * Copy from temp-mem to user-mem | ||
145 | */ | ||
146 | qsort(rgSetBlob, sk_OPENSSL_BLOCK_num(a), sizeof(MYBLOB), SetBlobCmp); | ||
147 | if ((pTempMem = malloc(totSize)) == NULL) { | ||
148 | free(rgSetBlob); | ||
149 | ASN1err(ASN1_F_I2D_ASN1_SET, ERR_R_MALLOC_FAILURE); | ||
150 | return 0; | ||
151 | } | ||
152 | |||
153 | /* Copy to temp mem */ | ||
154 | p = pTempMem; | ||
155 | for (i = 0; i < sk_OPENSSL_BLOCK_num(a); ++i) { | ||
156 | memcpy(p, rgSetBlob[i].pbData, rgSetBlob[i].cbData); | ||
157 | p += rgSetBlob[i].cbData; | ||
158 | } | ||
159 | |||
160 | /* Copy back to user mem*/ | ||
161 | memcpy(pStart, pTempMem, totSize); | ||
162 | free(pTempMem); | ||
163 | free(rgSetBlob); | ||
164 | |||
165 | return r; | ||
166 | } | ||
167 | |||
168 | STACK_OF(OPENSSL_BLOCK) * | ||
169 | d2i_ASN1_SET(STACK_OF(OPENSSL_BLOCK) **a, const unsigned char **pp, long length, | ||
170 | d2i_of_void *d2i, void (*free_func)(OPENSSL_BLOCK), int ex_tag, | ||
171 | int ex_class) | ||
172 | { | ||
173 | ASN1_const_CTX c; | ||
174 | STACK_OF(OPENSSL_BLOCK) *ret = NULL; | ||
175 | |||
176 | if (a == NULL || (*a) == NULL) { | ||
177 | if ((ret = sk_OPENSSL_BLOCK_new_null()) == NULL) { | ||
178 | ASN1err(ASN1_F_D2I_ASN1_SET, ERR_R_MALLOC_FAILURE); | ||
179 | goto err; | ||
180 | } | ||
181 | } else | ||
182 | ret = *a; | ||
183 | |||
184 | c.p = *pp; | ||
185 | c.max = (length == 0) ? 0 : (c.p + length); | ||
186 | |||
187 | c.inf = ASN1_get_object(&c.p, &c.slen, &c.tag, &c.xclass, c.max - c.p); | ||
188 | if (c.inf & 0x80) | ||
189 | goto err; | ||
190 | if (ex_class != c.xclass) { | ||
191 | ASN1err(ASN1_F_D2I_ASN1_SET, ASN1_R_BAD_CLASS); | ||
192 | goto err; | ||
193 | } | ||
194 | if (ex_tag != c.tag) { | ||
195 | ASN1err(ASN1_F_D2I_ASN1_SET, ASN1_R_BAD_TAG); | ||
196 | goto err; | ||
197 | } | ||
198 | if (c.slen + c.p > c.max) { | ||
199 | ASN1err(ASN1_F_D2I_ASN1_SET, ASN1_R_LENGTH_ERROR); | ||
200 | goto err; | ||
201 | } | ||
202 | /* check for infinite constructed - it can be as long | ||
203 | * as the amount of data passed to us */ | ||
204 | if (c.inf == (V_ASN1_CONSTRUCTED + 1)) | ||
205 | c.slen = length + *pp - c.p; | ||
206 | c.max = c.p + c.slen; | ||
207 | |||
208 | while (c.p < c.max) { | ||
209 | char *s; | ||
210 | |||
211 | if (M_ASN1_D2I_end_sequence()) | ||
212 | break; | ||
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 | |||
227 | err: | ||
228 | if (a == NULL || *a != ret) { | ||
229 | if (free_func != NULL) | ||
230 | sk_OPENSSL_BLOCK_pop_free(ret, free_func); | ||
231 | else | ||
232 | sk_OPENSSL_BLOCK_free(ret); | ||
233 | } | ||
234 | return NULL; | ||
235 | } | ||
236 | |||
237 | #endif | ||