a_set.c revision 55714
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 "cryptlib.h" 61#include <openssl/asn1_mac.h> 62 63typedef struct 64 { 65 unsigned char *pbData; 66 int cbData; 67 } MYBLOB; 68 69/* SetBlobCmp 70 * This function compares two elements of SET_OF block 71 */ 72static int SetBlobCmp(const void *elem1, const void *elem2 ) 73 { 74 const MYBLOB *b1 = (const MYBLOB *)elem1; 75 const MYBLOB *b2 = (const MYBLOB *)elem2; 76 int r; 77 78 r = memcmp(b1->pbData, b2->pbData, 79 b1->cbData < b2->cbData ? b1->cbData : b2->cbData); 80 if(r != 0) 81 return r; 82 return b1->cbData-b2->cbData; 83 } 84 85/* int is_set: if TRUE, then sort the contents (i.e. it isn't a SEQUENCE) */ 86int i2d_ASN1_SET(STACK *a, unsigned char **pp, int (*func)(), int ex_tag, 87 int ex_class, int is_set) 88 { 89 int ret=0,r; 90 int i; 91 unsigned char *p; 92 unsigned char *pStart, *pTempMem; 93 MYBLOB *rgSetBlob; 94 int totSize; 95 96 if (a == NULL) return(0); 97 for (i=sk_num(a)-1; i>=0; i--) 98 ret+=func(sk_value(a,i),NULL); 99 r=ASN1_object_size(1,ret,ex_tag); 100 if (pp == NULL) return(r); 101 102 p= *pp; 103 ASN1_put_object(&p,1,ret,ex_tag,ex_class); 104 105/* Modified by gp@nsj.co.jp */ 106 /* And then again by Ben */ 107 /* And again by Steve */ 108 109 if(!is_set || (sk_num(a) < 2)) 110 { 111 for (i=0; i<sk_num(a); i++) 112 func(sk_value(a,i),&p); 113 114 *pp=p; 115 return(r); 116 } 117 118 pStart = p; /* Catch the beg of Setblobs*/ 119 rgSetBlob = (MYBLOB *)Malloc( sk_num(a) * sizeof(MYBLOB)); /* In this array 120we will store the SET blobs */ 121 122 for (i=0; i<sk_num(a); i++) 123 { 124 rgSetBlob[i].pbData = p; /* catch each set encode blob */ 125 func(sk_value(a,i),&p); 126 rgSetBlob[i].cbData = p - rgSetBlob[i].pbData; /* Length of this 127SetBlob 128*/ 129 } 130 *pp=p; 131 totSize = p - pStart; /* This is the total size of all set blobs */ 132 133 /* Now we have to sort the blobs. I am using a simple algo. 134 *Sort ptrs *Copy to temp-mem *Copy from temp-mem to user-mem*/ 135 qsort( rgSetBlob, sk_num(a), sizeof(MYBLOB), SetBlobCmp); 136 pTempMem = Malloc(totSize); 137 138/* Copy to temp mem */ 139 p = pTempMem; 140 for(i=0; i<sk_num(a); ++i) 141 { 142 memcpy(p, rgSetBlob[i].pbData, rgSetBlob[i].cbData); 143 p += rgSetBlob[i].cbData; 144 } 145 146/* Copy back to user mem*/ 147 memcpy(pStart, pTempMem, totSize); 148 Free(pTempMem); 149 Free(rgSetBlob); 150 151 return(r); 152 } 153 154STACK *d2i_ASN1_SET(STACK **a, unsigned char **pp, long length, 155 char *(*func)(), void (*free_func)(), int ex_tag, int ex_class) 156 { 157 ASN1_CTX c; 158 STACK *ret=NULL; 159 160 if ((a == NULL) || ((*a) == NULL)) 161 { if ((ret=sk_new(NULL)) == NULL) goto err; } 162 else 163 ret=(*a); 164 165 c.p= *pp; 166 c.max=(length == 0)?0:(c.p+length); 167 168 c.inf=ASN1_get_object(&c.p,&c.slen,&c.tag,&c.xclass,c.max-c.p); 169 if (c.inf & 0x80) goto err; 170 if (ex_class != c.xclass) 171 { 172 ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_BAD_CLASS); 173 goto err; 174 } 175 if (ex_tag != c.tag) 176 { 177 ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_BAD_TAG); 178 goto err; 179 } 180 if ((c.slen+c.p) > c.max) 181 { 182 ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_LENGTH_ERROR); 183 goto err; 184 } 185 /* check for infinite constructed - it can be as long 186 * as the amount of data passed to us */ 187 if (c.inf == (V_ASN1_CONSTRUCTED+1)) 188 c.slen=length+ *pp-c.p; 189 c.max=c.p+c.slen; 190 191 while (c.p < c.max) 192 { 193 char *s; 194 195 if (M_ASN1_D2I_end_sequence()) break; 196 if ((s=func(NULL,&c.p,c.slen,c.max-c.p)) == NULL) 197 { 198 ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_ERROR_PARSING_SET_ELEMENT); 199 asn1_add_error(*pp,(int)(c.q- *pp)); 200 goto err; 201 } 202 if (!sk_push(ret,s)) goto err; 203 } 204 if (a != NULL) (*a)=ret; 205 *pp=c.p; 206 return(ret); 207err: 208 if ((ret != NULL) && ((a == NULL) || (*a != ret))) 209 { 210 if (free_func != NULL) 211 sk_pop_free(ret,free_func); 212 else 213 sk_free(ret); 214 } 215 return(NULL); 216 } 217 218