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