1*0Sstevel@tonic-gate /* crypto/asn1/a_set.c */ 2*0Sstevel@tonic-gate /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) 3*0Sstevel@tonic-gate * All rights reserved. 4*0Sstevel@tonic-gate * 5*0Sstevel@tonic-gate * This package is an SSL implementation written 6*0Sstevel@tonic-gate * by Eric Young (eay@cryptsoft.com). 7*0Sstevel@tonic-gate * The implementation was written so as to conform with Netscapes SSL. 8*0Sstevel@tonic-gate * 9*0Sstevel@tonic-gate * This library is free for commercial and non-commercial use as long as 10*0Sstevel@tonic-gate * the following conditions are aheared to. The following conditions 11*0Sstevel@tonic-gate * apply to all code found in this distribution, be it the RC4, RSA, 12*0Sstevel@tonic-gate * lhash, DES, etc., code; not just the SSL code. The SSL documentation 13*0Sstevel@tonic-gate * included with this distribution is covered by the same copyright terms 14*0Sstevel@tonic-gate * except that the holder is Tim Hudson (tjh@cryptsoft.com). 15*0Sstevel@tonic-gate * 16*0Sstevel@tonic-gate * Copyright remains Eric Young's, and as such any Copyright notices in 17*0Sstevel@tonic-gate * the code are not to be removed. 18*0Sstevel@tonic-gate * If this package is used in a product, Eric Young should be given attribution 19*0Sstevel@tonic-gate * as the author of the parts of the library used. 20*0Sstevel@tonic-gate * This can be in the form of a textual message at program startup or 21*0Sstevel@tonic-gate * in documentation (online or textual) provided with the package. 22*0Sstevel@tonic-gate * 23*0Sstevel@tonic-gate * Redistribution and use in source and binary forms, with or without 24*0Sstevel@tonic-gate * modification, are permitted provided that the following conditions 25*0Sstevel@tonic-gate * are met: 26*0Sstevel@tonic-gate * 1. Redistributions of source code must retain the copyright 27*0Sstevel@tonic-gate * notice, this list of conditions and the following disclaimer. 28*0Sstevel@tonic-gate * 2. Redistributions in binary form must reproduce the above copyright 29*0Sstevel@tonic-gate * notice, this list of conditions and the following disclaimer in the 30*0Sstevel@tonic-gate * documentation and/or other materials provided with the distribution. 31*0Sstevel@tonic-gate * 3. All advertising materials mentioning features or use of this software 32*0Sstevel@tonic-gate * must display the following acknowledgement: 33*0Sstevel@tonic-gate * "This product includes cryptographic software written by 34*0Sstevel@tonic-gate * Eric Young (eay@cryptsoft.com)" 35*0Sstevel@tonic-gate * The word 'cryptographic' can be left out if the rouines from the library 36*0Sstevel@tonic-gate * being used are not cryptographic related :-). 37*0Sstevel@tonic-gate * 4. If you include any Windows specific code (or a derivative thereof) from 38*0Sstevel@tonic-gate * the apps directory (application code) you must include an acknowledgement: 39*0Sstevel@tonic-gate * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" 40*0Sstevel@tonic-gate * 41*0Sstevel@tonic-gate * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND 42*0Sstevel@tonic-gate * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 43*0Sstevel@tonic-gate * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 44*0Sstevel@tonic-gate * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 45*0Sstevel@tonic-gate * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 46*0Sstevel@tonic-gate * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 47*0Sstevel@tonic-gate * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 48*0Sstevel@tonic-gate * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 49*0Sstevel@tonic-gate * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 50*0Sstevel@tonic-gate * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 51*0Sstevel@tonic-gate * SUCH DAMAGE. 52*0Sstevel@tonic-gate * 53*0Sstevel@tonic-gate * The licence and distribution terms for any publically available version or 54*0Sstevel@tonic-gate * derivative of this code cannot be changed. i.e. this code cannot simply be 55*0Sstevel@tonic-gate * copied and put under another distribution licence 56*0Sstevel@tonic-gate * [including the GNU Public Licence.] 57*0Sstevel@tonic-gate */ 58*0Sstevel@tonic-gate 59*0Sstevel@tonic-gate #include <stdio.h> 60*0Sstevel@tonic-gate #include "cryptlib.h" 61*0Sstevel@tonic-gate #include <openssl/asn1_mac.h> 62*0Sstevel@tonic-gate 63*0Sstevel@tonic-gate #ifndef NO_ASN1_OLD 64*0Sstevel@tonic-gate 65*0Sstevel@tonic-gate typedef struct 66*0Sstevel@tonic-gate { 67*0Sstevel@tonic-gate unsigned char *pbData; 68*0Sstevel@tonic-gate int cbData; 69*0Sstevel@tonic-gate } MYBLOB; 70*0Sstevel@tonic-gate 71*0Sstevel@tonic-gate /* SetBlobCmp 72*0Sstevel@tonic-gate * This function compares two elements of SET_OF block 73*0Sstevel@tonic-gate */ 74*0Sstevel@tonic-gate static int SetBlobCmp(const void *elem1, const void *elem2 ) 75*0Sstevel@tonic-gate { 76*0Sstevel@tonic-gate const MYBLOB *b1 = (const MYBLOB *)elem1; 77*0Sstevel@tonic-gate const MYBLOB *b2 = (const MYBLOB *)elem2; 78*0Sstevel@tonic-gate int r; 79*0Sstevel@tonic-gate 80*0Sstevel@tonic-gate r = memcmp(b1->pbData, b2->pbData, 81*0Sstevel@tonic-gate b1->cbData < b2->cbData ? b1->cbData : b2->cbData); 82*0Sstevel@tonic-gate if(r != 0) 83*0Sstevel@tonic-gate return r; 84*0Sstevel@tonic-gate return b1->cbData-b2->cbData; 85*0Sstevel@tonic-gate } 86*0Sstevel@tonic-gate 87*0Sstevel@tonic-gate /* int is_set: if TRUE, then sort the contents (i.e. it isn't a SEQUENCE) */ 88*0Sstevel@tonic-gate int i2d_ASN1_SET(STACK *a, unsigned char **pp, int (*func)(), int ex_tag, 89*0Sstevel@tonic-gate int ex_class, int is_set) 90*0Sstevel@tonic-gate { 91*0Sstevel@tonic-gate int ret=0,r; 92*0Sstevel@tonic-gate int i; 93*0Sstevel@tonic-gate unsigned char *p; 94*0Sstevel@tonic-gate unsigned char *pStart, *pTempMem; 95*0Sstevel@tonic-gate MYBLOB *rgSetBlob; 96*0Sstevel@tonic-gate int totSize; 97*0Sstevel@tonic-gate 98*0Sstevel@tonic-gate if (a == NULL) return(0); 99*0Sstevel@tonic-gate for (i=sk_num(a)-1; i>=0; i--) 100*0Sstevel@tonic-gate ret+=func(sk_value(a,i),NULL); 101*0Sstevel@tonic-gate r=ASN1_object_size(1,ret,ex_tag); 102*0Sstevel@tonic-gate if (pp == NULL) return(r); 103*0Sstevel@tonic-gate 104*0Sstevel@tonic-gate p= *pp; 105*0Sstevel@tonic-gate ASN1_put_object(&p,1,ret,ex_tag,ex_class); 106*0Sstevel@tonic-gate 107*0Sstevel@tonic-gate /* Modified by gp@nsj.co.jp */ 108*0Sstevel@tonic-gate /* And then again by Ben */ 109*0Sstevel@tonic-gate /* And again by Steve */ 110*0Sstevel@tonic-gate 111*0Sstevel@tonic-gate if(!is_set || (sk_num(a) < 2)) 112*0Sstevel@tonic-gate { 113*0Sstevel@tonic-gate for (i=0; i<sk_num(a); i++) 114*0Sstevel@tonic-gate func(sk_value(a,i),&p); 115*0Sstevel@tonic-gate 116*0Sstevel@tonic-gate *pp=p; 117*0Sstevel@tonic-gate return(r); 118*0Sstevel@tonic-gate } 119*0Sstevel@tonic-gate 120*0Sstevel@tonic-gate pStart = p; /* Catch the beg of Setblobs*/ 121*0Sstevel@tonic-gate if (!(rgSetBlob = (MYBLOB *)OPENSSL_malloc( sk_num(a) * sizeof(MYBLOB)))) return 0; /* In this array 122*0Sstevel@tonic-gate we will store the SET blobs */ 123*0Sstevel@tonic-gate 124*0Sstevel@tonic-gate for (i=0; i<sk_num(a); i++) 125*0Sstevel@tonic-gate { 126*0Sstevel@tonic-gate rgSetBlob[i].pbData = p; /* catch each set encode blob */ 127*0Sstevel@tonic-gate func(sk_value(a,i),&p); 128*0Sstevel@tonic-gate rgSetBlob[i].cbData = p - rgSetBlob[i].pbData; /* Length of this 129*0Sstevel@tonic-gate SetBlob 130*0Sstevel@tonic-gate */ 131*0Sstevel@tonic-gate } 132*0Sstevel@tonic-gate *pp=p; 133*0Sstevel@tonic-gate totSize = p - pStart; /* This is the total size of all set blobs */ 134*0Sstevel@tonic-gate 135*0Sstevel@tonic-gate /* Now we have to sort the blobs. I am using a simple algo. 136*0Sstevel@tonic-gate *Sort ptrs *Copy to temp-mem *Copy from temp-mem to user-mem*/ 137*0Sstevel@tonic-gate qsort( rgSetBlob, sk_num(a), sizeof(MYBLOB), SetBlobCmp); 138*0Sstevel@tonic-gate if (!(pTempMem = OPENSSL_malloc(totSize))) return 0; 139*0Sstevel@tonic-gate 140*0Sstevel@tonic-gate /* Copy to temp mem */ 141*0Sstevel@tonic-gate p = pTempMem; 142*0Sstevel@tonic-gate for(i=0; i<sk_num(a); ++i) 143*0Sstevel@tonic-gate { 144*0Sstevel@tonic-gate memcpy(p, rgSetBlob[i].pbData, rgSetBlob[i].cbData); 145*0Sstevel@tonic-gate p += rgSetBlob[i].cbData; 146*0Sstevel@tonic-gate } 147*0Sstevel@tonic-gate 148*0Sstevel@tonic-gate /* Copy back to user mem*/ 149*0Sstevel@tonic-gate memcpy(pStart, pTempMem, totSize); 150*0Sstevel@tonic-gate OPENSSL_free(pTempMem); 151*0Sstevel@tonic-gate OPENSSL_free(rgSetBlob); 152*0Sstevel@tonic-gate 153*0Sstevel@tonic-gate return(r); 154*0Sstevel@tonic-gate } 155*0Sstevel@tonic-gate 156*0Sstevel@tonic-gate STACK *d2i_ASN1_SET(STACK **a, unsigned char **pp, long length, 157*0Sstevel@tonic-gate char *(*func)(), void (*free_func)(void *), int ex_tag, int ex_class) 158*0Sstevel@tonic-gate { 159*0Sstevel@tonic-gate ASN1_CTX c; 160*0Sstevel@tonic-gate STACK *ret=NULL; 161*0Sstevel@tonic-gate 162*0Sstevel@tonic-gate if ((a == NULL) || ((*a) == NULL)) 163*0Sstevel@tonic-gate { if ((ret=sk_new_null()) == NULL) goto err; } 164*0Sstevel@tonic-gate else 165*0Sstevel@tonic-gate ret=(*a); 166*0Sstevel@tonic-gate 167*0Sstevel@tonic-gate c.p= *pp; 168*0Sstevel@tonic-gate c.max=(length == 0)?0:(c.p+length); 169*0Sstevel@tonic-gate 170*0Sstevel@tonic-gate c.inf=ASN1_get_object(&c.p,&c.slen,&c.tag,&c.xclass,c.max-c.p); 171*0Sstevel@tonic-gate if (c.inf & 0x80) goto err; 172*0Sstevel@tonic-gate if (ex_class != c.xclass) 173*0Sstevel@tonic-gate { 174*0Sstevel@tonic-gate ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_BAD_CLASS); 175*0Sstevel@tonic-gate goto err; 176*0Sstevel@tonic-gate } 177*0Sstevel@tonic-gate if (ex_tag != c.tag) 178*0Sstevel@tonic-gate { 179*0Sstevel@tonic-gate ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_BAD_TAG); 180*0Sstevel@tonic-gate goto err; 181*0Sstevel@tonic-gate } 182*0Sstevel@tonic-gate if ((c.slen+c.p) > c.max) 183*0Sstevel@tonic-gate { 184*0Sstevel@tonic-gate ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_LENGTH_ERROR); 185*0Sstevel@tonic-gate goto err; 186*0Sstevel@tonic-gate } 187*0Sstevel@tonic-gate /* check for infinite constructed - it can be as long 188*0Sstevel@tonic-gate * as the amount of data passed to us */ 189*0Sstevel@tonic-gate if (c.inf == (V_ASN1_CONSTRUCTED+1)) 190*0Sstevel@tonic-gate c.slen=length+ *pp-c.p; 191*0Sstevel@tonic-gate c.max=c.p+c.slen; 192*0Sstevel@tonic-gate 193*0Sstevel@tonic-gate while (c.p < c.max) 194*0Sstevel@tonic-gate { 195*0Sstevel@tonic-gate char *s; 196*0Sstevel@tonic-gate 197*0Sstevel@tonic-gate if (M_ASN1_D2I_end_sequence()) break; 198*0Sstevel@tonic-gate if ((s=func(NULL,&c.p,c.slen,c.max-c.p)) == NULL) 199*0Sstevel@tonic-gate { 200*0Sstevel@tonic-gate ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_ERROR_PARSING_SET_ELEMENT); 201*0Sstevel@tonic-gate asn1_add_error(*pp,(int)(c.q- *pp)); 202*0Sstevel@tonic-gate goto err; 203*0Sstevel@tonic-gate } 204*0Sstevel@tonic-gate if (!sk_push(ret,s)) goto err; 205*0Sstevel@tonic-gate } 206*0Sstevel@tonic-gate if (a != NULL) (*a)=ret; 207*0Sstevel@tonic-gate *pp=c.p; 208*0Sstevel@tonic-gate return(ret); 209*0Sstevel@tonic-gate err: 210*0Sstevel@tonic-gate if ((ret != NULL) && ((a == NULL) || (*a != ret))) 211*0Sstevel@tonic-gate { 212*0Sstevel@tonic-gate if (free_func != NULL) 213*0Sstevel@tonic-gate sk_pop_free(ret,free_func); 214*0Sstevel@tonic-gate else 215*0Sstevel@tonic-gate sk_free(ret); 216*0Sstevel@tonic-gate } 217*0Sstevel@tonic-gate return(NULL); 218*0Sstevel@tonic-gate } 219*0Sstevel@tonic-gate 220*0Sstevel@tonic-gate #endif 221