1
/* crypto/asn1/a_set.c */
2
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23
* Redistribution and use in source and binary forms, with or without
24
* modification, are permitted provided that the following conditions
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)"
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
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.]
61
#include <openssl/asn1_mac.h>
67
unsigned char *pbData;
72
* This function compares two elements of SET_OF block
74
static int SetBlobCmp(const void *elem1, const void *elem2 )
76
const MYBLOB *b1 = (const MYBLOB *)elem1;
77
const MYBLOB *b2 = (const MYBLOB *)elem2;
80
r = memcmp(b1->pbData, b2->pbData,
81
b1->cbData < b2->cbData ? b1->cbData : b2->cbData);
84
return b1->cbData-b2->cbData;
87
/* int is_set: if TRUE, then sort the contents (i.e. it isn't a SEQUENCE) */
88
int i2d_ASN1_SET(STACK *a, unsigned char **pp, int (*func)(), int ex_tag,
89
int ex_class, int is_set)
94
unsigned char *pStart, *pTempMem;
98
if (a == NULL) return(0);
99
for (i=sk_num(a)-1; i>=0; i--)
100
ret+=func(sk_value(a,i),NULL);
101
r=ASN1_object_size(1,ret,ex_tag);
102
if (pp == NULL) return(r);
105
ASN1_put_object(&p,1,ret,ex_tag,ex_class);
107
/* Modified by gp@nsj.co.jp */
108
/* And then again by Ben */
109
/* And again by Steve */
111
if(!is_set || (sk_num(a) < 2))
113
for (i=0; i<sk_num(a); i++)
114
func(sk_value(a,i),&p);
120
pStart = p; /* Catch the beg of Setblobs*/
121
if (!(rgSetBlob = (MYBLOB *)OPENSSL_malloc( sk_num(a) * sizeof(MYBLOB)))) return 0; /* In this array
122
we will store the SET blobs */
124
for (i=0; i<sk_num(a); i++)
126
rgSetBlob[i].pbData = p; /* catch each set encode blob */
127
func(sk_value(a,i),&p);
128
rgSetBlob[i].cbData = p - rgSetBlob[i].pbData; /* Length of this
133
totSize = p - pStart; /* This is the total size of all set blobs */
135
/* Now we have to sort the blobs. I am using a simple algo.
136
*Sort ptrs *Copy to temp-mem *Copy from temp-mem to user-mem*/
137
qsort( rgSetBlob, sk_num(a), sizeof(MYBLOB), SetBlobCmp);
138
if (!(pTempMem = OPENSSL_malloc(totSize))) return 0;
140
/* Copy to temp mem */
142
for(i=0; i<sk_num(a); ++i)
144
memcpy(p, rgSetBlob[i].pbData, rgSetBlob[i].cbData);
145
p += rgSetBlob[i].cbData;
148
/* Copy back to user mem*/
149
memcpy(pStart, pTempMem, totSize);
150
OPENSSL_free(pTempMem);
151
OPENSSL_free(rgSetBlob);
156
STACK *d2i_ASN1_SET(STACK **a, unsigned char **pp, long length,
157
char *(*func)(), void (*free_func)(void *), int ex_tag, int ex_class)
162
if ((a == NULL) || ((*a) == NULL))
163
{ if ((ret=sk_new_null()) == NULL) goto err; }
168
c.max=(length == 0)?0:(c.p+length);
170
c.inf=ASN1_get_object(&c.p,&c.slen,&c.tag,&c.xclass,c.max-c.p);
171
if (c.inf & 0x80) goto err;
172
if (ex_class != c.xclass)
174
ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_BAD_CLASS);
179
ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_BAD_TAG);
182
if ((c.slen+c.p) > c.max)
184
ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_LENGTH_ERROR);
187
/* check for infinite constructed - it can be as long
188
* as the amount of data passed to us */
189
if (c.inf == (V_ASN1_CONSTRUCTED+1))
190
c.slen=length+ *pp-c.p;
197
if (M_ASN1_D2I_end_sequence()) break;
198
if ((s=func(NULL,&c.p,c.slen,c.max-c.p)) == NULL)
200
ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_ERROR_PARSING_SET_ELEMENT);
201
asn1_add_error(*pp,(int)(c.q- *pp));
204
if (!sk_push(ret,s)) goto err;
206
if (a != NULL) (*a)=ret;
210
if ((ret != NULL) && ((a == NULL) || (*a != ret)))
212
if (free_func != NULL)
213
sk_pop_free(ret,free_func);