diff options
| author | cvs2svn <admin@example.com> | 2002-05-15 02:29:24 +0000 |
|---|---|---|
| committer | cvs2svn <admin@example.com> | 2002-05-15 02:29:24 +0000 |
| commit | 027351f729b9e837200dae6e1520cda6577ab930 (patch) | |
| tree | e25a717057aa4529e433fc3b1fac8d4df8db3a5c /src/lib/libcrypto/asn1 | |
| parent | aeeae06a79815dc190061534d47236cec09f9e32 (diff) | |
| download | openbsd-027351f729b9e837200dae6e1520cda6577ab930.tar.gz openbsd-027351f729b9e837200dae6e1520cda6577ab930.tar.bz2 openbsd-027351f729b9e837200dae6e1520cda6577ab930.zip | |
This commit was manufactured by cvs2git to create branch 'unlabeled-1.1.1'.
Diffstat (limited to 'src/lib/libcrypto/asn1')
30 files changed, 7369 insertions, 0 deletions
diff --git a/src/lib/libcrypto/asn1/a_enum.c b/src/lib/libcrypto/asn1/a_enum.c new file mode 100644 index 0000000000..9239ecc439 --- /dev/null +++ b/src/lib/libcrypto/asn1/a_enum.c | |||
| @@ -0,0 +1,326 @@ | |||
| 1 | /* crypto/asn1/a_enum.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.h> | ||
| 62 | |||
| 63 | /* | ||
| 64 | * Code for ENUMERATED type: identical to INTEGER apart from a different tag. | ||
| 65 | * for comments on encoding see a_int.c | ||
| 66 | */ | ||
| 67 | |||
| 68 | int i2d_ASN1_ENUMERATED(ASN1_ENUMERATED *a, unsigned char **pp) | ||
| 69 | { | ||
| 70 | int pad=0,ret,r,i,t; | ||
| 71 | unsigned char *p,*n,pb=0; | ||
| 72 | |||
| 73 | if ((a == NULL) || (a->data == NULL)) return(0); | ||
| 74 | t=a->type; | ||
| 75 | if (a->length == 0) | ||
| 76 | ret=1; | ||
| 77 | else | ||
| 78 | { | ||
| 79 | ret=a->length; | ||
| 80 | i=a->data[0]; | ||
| 81 | if ((t == V_ASN1_ENUMERATED) && (i > 127)) { | ||
| 82 | pad=1; | ||
| 83 | pb=0; | ||
| 84 | } else if(t == V_ASN1_NEG_ENUMERATED) { | ||
| 85 | if(i>128) { | ||
| 86 | pad=1; | ||
| 87 | pb=0xFF; | ||
| 88 | } else if(i == 128) { | ||
| 89 | for(i = 1; i < a->length; i++) if(a->data[i]) { | ||
| 90 | pad=1; | ||
| 91 | pb=0xFF; | ||
| 92 | break; | ||
| 93 | } | ||
| 94 | } | ||
| 95 | } | ||
| 96 | ret+=pad; | ||
| 97 | } | ||
| 98 | r=ASN1_object_size(0,ret,V_ASN1_ENUMERATED); | ||
| 99 | if (pp == NULL) return(r); | ||
| 100 | p= *pp; | ||
| 101 | |||
| 102 | ASN1_put_object(&p,0,ret,V_ASN1_ENUMERATED,V_ASN1_UNIVERSAL); | ||
| 103 | if (pad) *(p++)=pb; | ||
| 104 | if (a->length == 0) | ||
| 105 | *(p++)=0; | ||
| 106 | else if (t == V_ASN1_ENUMERATED) | ||
| 107 | { | ||
| 108 | memcpy(p,a->data,(unsigned int)a->length); | ||
| 109 | p+=a->length; | ||
| 110 | } | ||
| 111 | else { | ||
| 112 | /* Begin at the end of the encoding */ | ||
| 113 | n=a->data + a->length - 1; | ||
| 114 | p += a->length - 1; | ||
| 115 | i = a->length; | ||
| 116 | /* Copy zeros to destination as long as source is zero */ | ||
| 117 | while(!*n) { | ||
| 118 | *(p--) = 0; | ||
| 119 | n--; | ||
| 120 | i--; | ||
| 121 | } | ||
| 122 | /* Complement and increment next octet */ | ||
| 123 | *(p--) = ((*(n--)) ^ 0xff) + 1; | ||
| 124 | i--; | ||
| 125 | /* Complement any octets left */ | ||
| 126 | for(;i > 0; i--) *(p--) = *(n--) ^ 0xff; | ||
| 127 | p += a->length; | ||
| 128 | } | ||
| 129 | |||
| 130 | *pp=p; | ||
| 131 | return(r); | ||
| 132 | } | ||
| 133 | |||
| 134 | ASN1_ENUMERATED *d2i_ASN1_ENUMERATED(ASN1_ENUMERATED **a, unsigned char **pp, | ||
| 135 | long length) | ||
| 136 | { | ||
| 137 | ASN1_ENUMERATED *ret=NULL; | ||
| 138 | unsigned char *p,*to,*s; | ||
| 139 | long len; | ||
| 140 | int inf,tag,xclass; | ||
| 141 | int i; | ||
| 142 | |||
| 143 | if ((a == NULL) || ((*a) == NULL)) | ||
| 144 | { | ||
| 145 | if ((ret=ASN1_ENUMERATED_new()) == NULL) return(NULL); | ||
| 146 | ret->type=V_ASN1_ENUMERATED; | ||
| 147 | } | ||
| 148 | else | ||
| 149 | ret=(*a); | ||
| 150 | |||
| 151 | p= *pp; | ||
| 152 | inf=ASN1_get_object(&p,&len,&tag,&xclass,length); | ||
| 153 | if (inf & 0x80) | ||
| 154 | { | ||
| 155 | i=ASN1_R_BAD_OBJECT_HEADER; | ||
| 156 | goto err; | ||
| 157 | } | ||
| 158 | |||
| 159 | if (tag != V_ASN1_ENUMERATED) | ||
| 160 | { | ||
| 161 | i=ASN1_R_EXPECTING_AN_ENUMERATED; | ||
| 162 | goto err; | ||
| 163 | } | ||
| 164 | |||
| 165 | /* We must Malloc stuff, even for 0 bytes otherwise it | ||
| 166 | * signifies a missing NULL parameter. */ | ||
| 167 | s=(unsigned char *)Malloc((int)len+1); | ||
| 168 | if (s == NULL) | ||
| 169 | { | ||
| 170 | i=ERR_R_MALLOC_FAILURE; | ||
| 171 | goto err; | ||
| 172 | } | ||
| 173 | to=s; | ||
| 174 | if (*p & 0x80) /* a negative number */ | ||
| 175 | { | ||
| 176 | ret->type=V_ASN1_NEG_ENUMERATED; | ||
| 177 | if ((*p == 0xff) && (len != 1)) { | ||
| 178 | p++; | ||
| 179 | len--; | ||
| 180 | } | ||
| 181 | i = len; | ||
| 182 | p += i - 1; | ||
| 183 | to += i - 1; | ||
| 184 | while((!*p) && i) { | ||
| 185 | *(to--) = 0; | ||
| 186 | i--; | ||
| 187 | p--; | ||
| 188 | } | ||
| 189 | if(!i) { | ||
| 190 | *s = 1; | ||
| 191 | s[len] = 0; | ||
| 192 | p += len; | ||
| 193 | len++; | ||
| 194 | } else { | ||
| 195 | *(to--) = (*(p--) ^ 0xff) + 1; | ||
| 196 | i--; | ||
| 197 | for(;i > 0; i--) *(to--) = *(p--) ^ 0xff; | ||
| 198 | p += len; | ||
| 199 | } | ||
| 200 | } else { | ||
| 201 | ret->type=V_ASN1_ENUMERATED; | ||
| 202 | if ((*p == 0) && (len != 1)) | ||
| 203 | { | ||
| 204 | p++; | ||
| 205 | len--; | ||
| 206 | } | ||
| 207 | memcpy(s,p,(int)len); | ||
| 208 | p+=len; | ||
| 209 | } | ||
| 210 | |||
| 211 | if (ret->data != NULL) Free((char *)ret->data); | ||
| 212 | ret->data=s; | ||
| 213 | ret->length=(int)len; | ||
| 214 | if (a != NULL) (*a)=ret; | ||
| 215 | *pp=p; | ||
| 216 | return(ret); | ||
| 217 | err: | ||
| 218 | ASN1err(ASN1_F_D2I_ASN1_ENUMERATED,i); | ||
| 219 | if ((ret != NULL) && ((a == NULL) || (*a != ret))) | ||
| 220 | ASN1_ENUMERATED_free(ret); | ||
| 221 | return(NULL); | ||
| 222 | } | ||
| 223 | |||
| 224 | int ASN1_ENUMERATED_set(ASN1_ENUMERATED *a, long v) | ||
| 225 | { | ||
| 226 | int i,j,k; | ||
| 227 | unsigned char buf[sizeof(long)+1]; | ||
| 228 | long d; | ||
| 229 | |||
| 230 | a->type=V_ASN1_ENUMERATED; | ||
| 231 | if (a->length < (sizeof(long)+1)) | ||
| 232 | { | ||
| 233 | if (a->data != NULL) | ||
| 234 | Free((char *)a->data); | ||
| 235 | if ((a->data=(unsigned char *)Malloc(sizeof(long)+1)) != NULL) | ||
| 236 | memset((char *)a->data,0,sizeof(long)+1); | ||
| 237 | } | ||
| 238 | if (a->data == NULL) | ||
| 239 | { | ||
| 240 | ASN1err(ASN1_F_ASN1_ENUMERATED_SET,ERR_R_MALLOC_FAILURE); | ||
| 241 | return(0); | ||
| 242 | } | ||
| 243 | d=v; | ||
| 244 | if (d < 0) | ||
| 245 | { | ||
| 246 | d= -d; | ||
| 247 | a->type=V_ASN1_NEG_ENUMERATED; | ||
| 248 | } | ||
| 249 | |||
| 250 | for (i=0; i<sizeof(long); i++) | ||
| 251 | { | ||
| 252 | if (d == 0) break; | ||
| 253 | buf[i]=(int)d&0xff; | ||
| 254 | d>>=8; | ||
| 255 | } | ||
| 256 | j=0; | ||
| 257 | for (k=i-1; k >=0; k--) | ||
| 258 | a->data[j++]=buf[k]; | ||
| 259 | a->length=j; | ||
| 260 | return(1); | ||
| 261 | } | ||
| 262 | |||
| 263 | long ASN1_ENUMERATED_get(ASN1_ENUMERATED *a) | ||
| 264 | { | ||
| 265 | int neg=0,i; | ||
| 266 | long r=0; | ||
| 267 | |||
| 268 | if (a == NULL) return(0L); | ||
| 269 | i=a->type; | ||
| 270 | if (i == V_ASN1_NEG_ENUMERATED) | ||
| 271 | neg=1; | ||
| 272 | else if (i != V_ASN1_ENUMERATED) | ||
| 273 | return(0); | ||
| 274 | |||
| 275 | if (a->length > sizeof(long)) | ||
| 276 | { | ||
| 277 | /* hmm... a bit ugly */ | ||
| 278 | return(0xffffffffL); | ||
| 279 | } | ||
| 280 | if (a->data == NULL) | ||
| 281 | return(0); | ||
| 282 | |||
| 283 | for (i=0; i<a->length; i++) | ||
| 284 | { | ||
| 285 | r<<=8; | ||
| 286 | r|=(unsigned char)a->data[i]; | ||
| 287 | } | ||
| 288 | if (neg) r= -r; | ||
| 289 | return(r); | ||
| 290 | } | ||
| 291 | |||
| 292 | ASN1_ENUMERATED *BN_to_ASN1_ENUMERATED(BIGNUM *bn, ASN1_ENUMERATED *ai) | ||
| 293 | { | ||
| 294 | ASN1_ENUMERATED *ret; | ||
| 295 | int len,j; | ||
| 296 | |||
| 297 | if (ai == NULL) | ||
| 298 | ret=ASN1_ENUMERATED_new(); | ||
| 299 | else | ||
| 300 | ret=ai; | ||
| 301 | if (ret == NULL) | ||
| 302 | { | ||
| 303 | ASN1err(ASN1_F_BN_TO_ASN1_ENUMERATED,ERR_R_NESTED_ASN1_ERROR); | ||
| 304 | goto err; | ||
| 305 | } | ||
| 306 | if(bn->neg) ret->type = V_ASN1_NEG_ENUMERATED; | ||
| 307 | else ret->type=V_ASN1_ENUMERATED; | ||
| 308 | j=BN_num_bits(bn); | ||
| 309 | len=((j == 0)?0:((j/8)+1)); | ||
| 310 | ret->data=(unsigned char *)Malloc(len+4); | ||
| 311 | ret->length=BN_bn2bin(bn,ret->data); | ||
| 312 | return(ret); | ||
| 313 | err: | ||
| 314 | if (ret != ai) ASN1_ENUMERATED_free(ret); | ||
| 315 | return(NULL); | ||
| 316 | } | ||
| 317 | |||
| 318 | BIGNUM *ASN1_ENUMERATED_to_BN(ASN1_ENUMERATED *ai, BIGNUM *bn) | ||
| 319 | { | ||
| 320 | BIGNUM *ret; | ||
| 321 | |||
| 322 | if ((ret=BN_bin2bn(ai->data,ai->length,bn)) == NULL) | ||
| 323 | ASN1err(ASN1_F_ASN1_ENUMERATED_TO_BN,ASN1_R_BN_LIB); | ||
| 324 | if(ai->type == V_ASN1_NEG_ENUMERATED) bn->neg = 1; | ||
| 325 | return(ret); | ||
| 326 | } | ||
diff --git a/src/lib/libcrypto/asn1/a_mbstr.c b/src/lib/libcrypto/asn1/a_mbstr.c new file mode 100644 index 0000000000..7a710d5459 --- /dev/null +++ b/src/lib/libcrypto/asn1/a_mbstr.c | |||
| @@ -0,0 +1,390 @@ | |||
| 1 | /* a_mbstr.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 1999. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 1999 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | #include <stdio.h> | ||
| 60 | #include <ctype.h> | ||
| 61 | #include "cryptlib.h" | ||
| 62 | #include <openssl/asn1.h> | ||
| 63 | |||
| 64 | static int traverse_string(const unsigned char *p, int len, int inform, | ||
| 65 | int (*rfunc)(unsigned long value, void *in), void *arg); | ||
| 66 | static int in_utf8(unsigned long value, void *arg); | ||
| 67 | static int out_utf8(unsigned long value, void *arg); | ||
| 68 | static int type_str(unsigned long value, void *arg); | ||
| 69 | static int cpy_asc(unsigned long value, void *arg); | ||
| 70 | static int cpy_bmp(unsigned long value, void *arg); | ||
| 71 | static int cpy_univ(unsigned long value, void *arg); | ||
| 72 | static int cpy_utf8(unsigned long value, void *arg); | ||
| 73 | static int is_printable(unsigned long value); | ||
| 74 | |||
| 75 | /* These functions take a string in UTF8, ASCII or multibyte form and | ||
| 76 | * a mask of permissible ASN1 string types. It then works out the minimal | ||
| 77 | * type (using the order Printable < IA5 < T61 < BMP < Universal < UTF8) | ||
| 78 | * and creates a string of the correct type with the supplied data. | ||
| 79 | * Yes this is horrible: it has to be :-( | ||
| 80 | * The 'ncopy' form checks minimum and maximum size limits too. | ||
| 81 | */ | ||
| 82 | |||
| 83 | int ASN1_mbstring_copy(ASN1_STRING **out, const unsigned char *in, int len, | ||
| 84 | int inform, unsigned long mask) | ||
| 85 | { | ||
| 86 | return ASN1_mbstring_ncopy(out, in, len, inform, mask, 0, 0); | ||
| 87 | } | ||
| 88 | |||
| 89 | int ASN1_mbstring_ncopy(ASN1_STRING **out, const unsigned char *in, int len, | ||
| 90 | int inform, unsigned long mask, | ||
| 91 | long minsize, long maxsize) | ||
| 92 | { | ||
| 93 | int str_type; | ||
| 94 | int ret; | ||
| 95 | int outform, outlen; | ||
| 96 | ASN1_STRING *dest; | ||
| 97 | unsigned char *p; | ||
| 98 | int nchar; | ||
| 99 | char strbuf[32]; | ||
| 100 | int (*cpyfunc)(unsigned long,void *) = NULL; | ||
| 101 | if(len == -1) len = strlen((const char *)in); | ||
| 102 | if(!mask) mask = DIRSTRING_TYPE; | ||
| 103 | |||
| 104 | /* First do a string check and work out the number of characters */ | ||
| 105 | switch(inform) { | ||
| 106 | |||
| 107 | case MBSTRING_BMP: | ||
| 108 | if(len & 1) { | ||
| 109 | ASN1err(ASN1_F_ASN1_MBSTRING_COPY, | ||
| 110 | ASN1_R_INVALID_BMPSTRING_LENGTH); | ||
| 111 | return -1; | ||
| 112 | } | ||
| 113 | nchar = len >> 1; | ||
| 114 | break; | ||
| 115 | |||
| 116 | case MBSTRING_UNIV: | ||
| 117 | if(len & 3) { | ||
| 118 | ASN1err(ASN1_F_ASN1_MBSTRING_COPY, | ||
| 119 | ASN1_R_INVALID_UNIVERSALSTRING_LENGTH); | ||
| 120 | return -1; | ||
| 121 | } | ||
| 122 | nchar = len >> 2; | ||
| 123 | break; | ||
| 124 | |||
| 125 | case MBSTRING_UTF8: | ||
| 126 | nchar = 0; | ||
| 127 | /* This counts the characters and does utf8 syntax checking */ | ||
| 128 | ret = traverse_string(in, len, MBSTRING_UTF8, in_utf8, &nchar); | ||
| 129 | if(ret < 0) { | ||
| 130 | ASN1err(ASN1_F_ASN1_MBSTRING_COPY, | ||
| 131 | ASN1_R_INVALID_UTF8STRING); | ||
| 132 | return -1; | ||
| 133 | } | ||
| 134 | break; | ||
| 135 | |||
| 136 | case MBSTRING_ASC: | ||
| 137 | nchar = len; | ||
| 138 | break; | ||
| 139 | |||
| 140 | default: | ||
| 141 | ASN1err(ASN1_F_ASN1_MBSTRING_COPY, ASN1_R_UNKNOWN_FORMAT); | ||
| 142 | return -1; | ||
| 143 | } | ||
| 144 | |||
| 145 | if((minsize > 0) && (nchar < minsize)) { | ||
| 146 | ASN1err(ASN1_F_ASN1_MBSTRING_COPY, ASN1_R_STRING_TOO_SHORT); | ||
| 147 | sprintf(strbuf, "%ld", minsize); | ||
| 148 | ERR_add_error_data(2, "minsize=", strbuf); | ||
| 149 | return -1; | ||
| 150 | } | ||
| 151 | |||
| 152 | if((maxsize > 0) && (nchar > maxsize)) { | ||
| 153 | ASN1err(ASN1_F_ASN1_MBSTRING_COPY, ASN1_R_STRING_TOO_LONG); | ||
| 154 | sprintf(strbuf, "%ld", maxsize); | ||
| 155 | ERR_add_error_data(2, "maxsize=", strbuf); | ||
| 156 | return -1; | ||
| 157 | } | ||
| 158 | |||
| 159 | /* Now work out minimal type (if any) */ | ||
| 160 | if(traverse_string(in, len, inform, type_str, &mask) < 0) { | ||
| 161 | ASN1err(ASN1_F_ASN1_MBSTRING_COPY, ASN1_R_ILLEGAL_CHARACTERS); | ||
| 162 | return -1; | ||
| 163 | } | ||
| 164 | |||
| 165 | |||
| 166 | /* Now work out output format and string type */ | ||
| 167 | outform = MBSTRING_ASC; | ||
| 168 | if(mask & B_ASN1_PRINTABLESTRING) str_type = V_ASN1_PRINTABLESTRING; | ||
| 169 | else if(mask & B_ASN1_IA5STRING) str_type = V_ASN1_IA5STRING; | ||
| 170 | else if(mask & B_ASN1_T61STRING) str_type = V_ASN1_T61STRING; | ||
| 171 | else if(mask & B_ASN1_BMPSTRING) { | ||
| 172 | str_type = V_ASN1_BMPSTRING; | ||
| 173 | outform = MBSTRING_BMP; | ||
| 174 | } else if(mask & B_ASN1_UNIVERSALSTRING) { | ||
| 175 | str_type = V_ASN1_UNIVERSALSTRING; | ||
| 176 | outform = MBSTRING_UNIV; | ||
| 177 | } else { | ||
| 178 | str_type = V_ASN1_UTF8STRING; | ||
| 179 | outform = MBSTRING_UTF8; | ||
| 180 | } | ||
| 181 | if(!out) return str_type; | ||
| 182 | if(*out) { | ||
| 183 | dest = *out; | ||
| 184 | if(dest->data) { | ||
| 185 | dest->length = 0; | ||
| 186 | Free(dest->data); | ||
| 187 | dest->data = NULL; | ||
| 188 | } | ||
| 189 | dest->type = str_type; | ||
| 190 | } else { | ||
| 191 | dest = ASN1_STRING_type_new(str_type); | ||
| 192 | if(!dest) { | ||
| 193 | ASN1err(ASN1_F_ASN1_MBSTRING_COPY, | ||
| 194 | ERR_R_MALLOC_FAILURE); | ||
| 195 | return -1; | ||
| 196 | } | ||
| 197 | *out = dest; | ||
| 198 | } | ||
| 199 | /* If both the same type just copy across */ | ||
| 200 | if(inform == outform) { | ||
| 201 | if(!ASN1_STRING_set(dest, in, len)) { | ||
| 202 | ASN1err(ASN1_F_ASN1_MBSTRING_COPY,ERR_R_MALLOC_FAILURE); | ||
| 203 | return -1; | ||
| 204 | } | ||
| 205 | return str_type; | ||
| 206 | } | ||
| 207 | |||
| 208 | /* Work out how much space the destination will need */ | ||
| 209 | switch(outform) { | ||
| 210 | case MBSTRING_ASC: | ||
| 211 | outlen = nchar; | ||
| 212 | cpyfunc = cpy_asc; | ||
| 213 | break; | ||
| 214 | |||
| 215 | case MBSTRING_BMP: | ||
| 216 | outlen = nchar << 1; | ||
| 217 | cpyfunc = cpy_bmp; | ||
| 218 | break; | ||
| 219 | |||
| 220 | case MBSTRING_UNIV: | ||
| 221 | outlen = nchar << 2; | ||
| 222 | cpyfunc = cpy_univ; | ||
| 223 | break; | ||
| 224 | |||
| 225 | case MBSTRING_UTF8: | ||
| 226 | outlen = 0; | ||
| 227 | traverse_string(in, len, inform, out_utf8, &outlen); | ||
| 228 | cpyfunc = cpy_utf8; | ||
| 229 | break; | ||
| 230 | } | ||
| 231 | if(!(p = Malloc(outlen + 1))) { | ||
| 232 | ASN1_STRING_free(dest); | ||
| 233 | ASN1err(ASN1_F_ASN1_MBSTRING_COPY,ERR_R_MALLOC_FAILURE); | ||
| 234 | return -1; | ||
| 235 | } | ||
| 236 | dest->length = outlen; | ||
| 237 | dest->data = p; | ||
| 238 | p[outlen] = 0; | ||
| 239 | traverse_string(in, len, inform, cpyfunc, &p); | ||
| 240 | return str_type; | ||
| 241 | } | ||
| 242 | |||
| 243 | /* This function traverses a string and passes the value of each character | ||
| 244 | * to an optional function along with a void * argument. | ||
| 245 | */ | ||
| 246 | |||
| 247 | static int traverse_string(const unsigned char *p, int len, int inform, | ||
| 248 | int (*rfunc)(unsigned long value, void *in), void *arg) | ||
| 249 | { | ||
| 250 | unsigned long value; | ||
| 251 | int ret; | ||
| 252 | while(len) { | ||
| 253 | if(inform == MBSTRING_ASC) { | ||
| 254 | value = *p++; | ||
| 255 | len--; | ||
| 256 | } else if(inform == MBSTRING_BMP) { | ||
| 257 | value = *p++ << 8; | ||
| 258 | value |= *p++; | ||
| 259 | len -= 2; | ||
| 260 | } else if(inform == MBSTRING_UNIV) { | ||
| 261 | value = *p++ << 24; | ||
| 262 | value |= *p++ << 16; | ||
| 263 | value |= *p++ << 8; | ||
| 264 | value |= *p++; | ||
| 265 | len -= 4; | ||
| 266 | } else { | ||
| 267 | ret = UTF8_getc(p, len, &value); | ||
| 268 | if(ret < 0) return -1; | ||
| 269 | len -= ret; | ||
| 270 | p += ret; | ||
| 271 | } | ||
| 272 | if(rfunc) { | ||
| 273 | ret = rfunc(value, arg); | ||
| 274 | if(ret <= 0) return ret; | ||
| 275 | } | ||
| 276 | } | ||
| 277 | return 1; | ||
| 278 | } | ||
| 279 | |||
| 280 | /* Various utility functions for traverse_string */ | ||
| 281 | |||
| 282 | /* Just count number of characters */ | ||
| 283 | |||
| 284 | static int in_utf8(unsigned long value, void *arg) | ||
| 285 | { | ||
| 286 | int *nchar; | ||
| 287 | nchar = arg; | ||
| 288 | (*nchar)++; | ||
| 289 | return 1; | ||
| 290 | } | ||
| 291 | |||
| 292 | /* Determine size of output as a UTF8 String */ | ||
| 293 | |||
| 294 | static int out_utf8(unsigned long value, void *arg) | ||
| 295 | { | ||
| 296 | long *outlen; | ||
| 297 | outlen = arg; | ||
| 298 | *outlen += UTF8_putc(NULL, -1, value); | ||
| 299 | return 1; | ||
| 300 | } | ||
| 301 | |||
| 302 | /* Determine the "type" of a string: check each character against a | ||
| 303 | * supplied "mask". | ||
| 304 | */ | ||
| 305 | |||
| 306 | static int type_str(unsigned long value, void *arg) | ||
| 307 | { | ||
| 308 | unsigned long types; | ||
| 309 | types = *((unsigned long *)arg); | ||
| 310 | if((types & B_ASN1_PRINTABLESTRING) && !is_printable(value)) | ||
| 311 | types &= ~B_ASN1_PRINTABLESTRING; | ||
| 312 | if((types & B_ASN1_IA5STRING) && (value > 127)) | ||
| 313 | types &= ~B_ASN1_IA5STRING; | ||
| 314 | if((types & B_ASN1_T61STRING) && (value > 0xff)) | ||
| 315 | types &= ~B_ASN1_T61STRING; | ||
| 316 | if((types & B_ASN1_BMPSTRING) && (value > 0xffff)) | ||
| 317 | types &= ~B_ASN1_BMPSTRING; | ||
| 318 | if(!types) return -1; | ||
| 319 | *((unsigned long *)arg) = types; | ||
| 320 | return 1; | ||
| 321 | } | ||
| 322 | |||
| 323 | /* Copy one byte per character ASCII like strings */ | ||
| 324 | |||
| 325 | static int cpy_asc(unsigned long value, void *arg) | ||
| 326 | { | ||
| 327 | unsigned char **p, *q; | ||
| 328 | p = arg; | ||
| 329 | q = *p; | ||
| 330 | *q = (unsigned char) value; | ||
| 331 | (*p)++; | ||
| 332 | return 1; | ||
| 333 | } | ||
| 334 | |||
| 335 | /* Copy two byte per character BMPStrings */ | ||
| 336 | |||
| 337 | static int cpy_bmp(unsigned long value, void *arg) | ||
| 338 | { | ||
| 339 | unsigned char **p, *q; | ||
| 340 | p = arg; | ||
| 341 | q = *p; | ||
| 342 | *q++ = (unsigned char) ((value >> 8) & 0xff); | ||
| 343 | *q = (unsigned char) (value & 0xff); | ||
| 344 | *p += 2; | ||
| 345 | return 1; | ||
| 346 | } | ||
| 347 | |||
| 348 | /* Copy four byte per character UniversalStrings */ | ||
| 349 | |||
| 350 | static int cpy_univ(unsigned long value, void *arg) | ||
| 351 | { | ||
| 352 | unsigned char **p, *q; | ||
| 353 | p = arg; | ||
| 354 | q = *p; | ||
| 355 | *q++ = (unsigned char) ((value >> 24) & 0xff); | ||
| 356 | *q++ = (unsigned char) ((value >> 16) & 0xff); | ||
| 357 | *q++ = (unsigned char) ((value >> 8) & 0xff); | ||
| 358 | *q = (unsigned char) (value & 0xff); | ||
| 359 | *p += 4; | ||
| 360 | return 1; | ||
| 361 | } | ||
| 362 | |||
| 363 | /* Copy to a UTF8String */ | ||
| 364 | |||
| 365 | static int cpy_utf8(unsigned long value, void *arg) | ||
| 366 | { | ||
| 367 | unsigned char **p; | ||
| 368 | int ret; | ||
| 369 | p = arg; | ||
| 370 | /* We already know there is enough room so pass 0xff as the length */ | ||
| 371 | ret = UTF8_putc(*p, 0xff, value); | ||
| 372 | *p += ret; | ||
| 373 | return 1; | ||
| 374 | } | ||
| 375 | |||
| 376 | /* Return 1 if the character is permitted in a PrintableString */ | ||
| 377 | static int is_printable(unsigned long value) | ||
| 378 | { | ||
| 379 | int ch; | ||
| 380 | if(value > 0x7f) return 0; | ||
| 381 | ch = (int) value; | ||
| 382 | /* Note: we can't use 'isalnum' because certain accented | ||
| 383 | * characters may count as alphanumeric in some environments. | ||
| 384 | */ | ||
| 385 | if((ch >= 'a') && (ch <= 'z')) return 1; | ||
| 386 | if((ch >= 'A') && (ch <= 'Z')) return 1; | ||
| 387 | if((ch >= '0') && (ch <= '9')) return 1; | ||
| 388 | if ((ch == ' ') || strchr("'()+,-./:=?", ch)) return 1; | ||
| 389 | return 0; | ||
| 390 | } | ||
diff --git a/src/lib/libcrypto/asn1/a_strex.c b/src/lib/libcrypto/asn1/a_strex.c new file mode 100644 index 0000000000..569b811998 --- /dev/null +++ b/src/lib/libcrypto/asn1/a_strex.c | |||
| @@ -0,0 +1,533 @@ | |||
| 1 | /* a_strex.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 2000. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 2000 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | #include <stdio.h> | ||
| 60 | #include <string.h> | ||
| 61 | #include <openssl/crypto.h> | ||
| 62 | #include <openssl/x509.h> | ||
| 63 | #include <openssl/asn1.h> | ||
| 64 | |||
| 65 | #include "charmap.h" | ||
| 66 | |||
| 67 | /* ASN1_STRING_print_ex() and X509_NAME_print_ex(). | ||
| 68 | * Enhanced string and name printing routines handling | ||
| 69 | * multibyte characters, RFC2253 and a host of other | ||
| 70 | * options. | ||
| 71 | */ | ||
| 72 | |||
| 73 | |||
| 74 | #define CHARTYPE_BS_ESC (ASN1_STRFLGS_ESC_2253 | CHARTYPE_FIRST_ESC_2253 | CHARTYPE_LAST_ESC_2253) | ||
| 75 | |||
| 76 | |||
| 77 | /* Three IO functions for sending data to memory, a BIO and | ||
| 78 | * and a FILE pointer. | ||
| 79 | */ | ||
| 80 | |||
| 81 | int send_mem_chars(void *arg, const void *buf, int len) | ||
| 82 | { | ||
| 83 | unsigned char **out = arg; | ||
| 84 | if(!out) return 1; | ||
| 85 | memcpy(*out, buf, len); | ||
| 86 | *out += len; | ||
| 87 | return 1; | ||
| 88 | } | ||
| 89 | |||
| 90 | int send_bio_chars(void *arg, const void *buf, int len) | ||
| 91 | { | ||
| 92 | if(!arg) return 1; | ||
| 93 | if(BIO_write(arg, buf, len) != len) return 0; | ||
| 94 | return 1; | ||
| 95 | } | ||
| 96 | |||
| 97 | int send_fp_chars(void *arg, const void *buf, int len) | ||
| 98 | { | ||
| 99 | if(!arg) return 1; | ||
| 100 | if(fwrite(buf, 1, len, arg) != (unsigned int)len) return 0; | ||
| 101 | return 1; | ||
| 102 | } | ||
| 103 | |||
| 104 | typedef int char_io(void *arg, const void *buf, int len); | ||
| 105 | |||
| 106 | /* This function handles display of | ||
| 107 | * strings, one character at a time. | ||
| 108 | * It is passed an unsigned long for each | ||
| 109 | * character because it could come from 2 or even | ||
| 110 | * 4 byte forms. | ||
| 111 | */ | ||
| 112 | |||
| 113 | static int do_esc_char(unsigned long c, unsigned char flags, char *do_quotes, char_io *io_ch, void *arg) | ||
| 114 | { | ||
| 115 | unsigned char chflgs, chtmp; | ||
| 116 | char tmphex[11]; | ||
| 117 | if(c > 0xffff) { | ||
| 118 | BIO_snprintf(tmphex, 11, "\\W%08lX", c); | ||
| 119 | if(!io_ch(arg, tmphex, 10)) return -1; | ||
| 120 | return 10; | ||
| 121 | } | ||
| 122 | if(c > 0xff) { | ||
| 123 | BIO_snprintf(tmphex, 11, "\\U%04lX", c); | ||
| 124 | if(!io_ch(arg, tmphex, 6)) return -1; | ||
| 125 | return 6; | ||
| 126 | } | ||
| 127 | chtmp = (unsigned char)c; | ||
| 128 | if(chtmp > 0x7f) chflgs = flags & ASN1_STRFLGS_ESC_MSB; | ||
| 129 | else chflgs = char_type[chtmp] & flags; | ||
| 130 | if(chflgs & CHARTYPE_BS_ESC) { | ||
| 131 | /* If we don't escape with quotes, signal we need quotes */ | ||
| 132 | if(chflgs & ASN1_STRFLGS_ESC_QUOTE) { | ||
| 133 | if(do_quotes) *do_quotes = 1; | ||
| 134 | if(!io_ch(arg, &chtmp, 1)) return -1; | ||
| 135 | return 1; | ||
| 136 | } | ||
| 137 | if(!io_ch(arg, "\\", 1)) return -1; | ||
| 138 | if(!io_ch(arg, &chtmp, 1)) return -1; | ||
| 139 | return 2; | ||
| 140 | } | ||
| 141 | if(chflgs & (ASN1_STRFLGS_ESC_CTRL|ASN1_STRFLGS_ESC_MSB)) { | ||
| 142 | BIO_snprintf(tmphex, 11, "\\%02X", chtmp); | ||
| 143 | if(!io_ch(arg, tmphex, 3)) return -1; | ||
| 144 | return 3; | ||
| 145 | } | ||
| 146 | if(!io_ch(arg, &chtmp, 1)) return -1; | ||
| 147 | return 1; | ||
| 148 | } | ||
| 149 | |||
| 150 | #define BUF_TYPE_WIDTH_MASK 0x7 | ||
| 151 | #define BUF_TYPE_CONVUTF8 0x8 | ||
| 152 | |||
| 153 | /* This function sends each character in a buffer to | ||
| 154 | * do_esc_char(). It interprets the content formats | ||
| 155 | * and converts to or from UTF8 as appropriate. | ||
| 156 | */ | ||
| 157 | |||
| 158 | static int do_buf(unsigned char *buf, int buflen, | ||
| 159 | int type, unsigned char flags, char *quotes, char_io *io_ch, void *arg) | ||
| 160 | { | ||
| 161 | int i, outlen, len; | ||
| 162 | unsigned char orflags, *p, *q; | ||
| 163 | unsigned long c; | ||
| 164 | p = buf; | ||
| 165 | q = buf + buflen; | ||
| 166 | outlen = 0; | ||
| 167 | while(p != q) { | ||
| 168 | if(p == buf) orflags = CHARTYPE_FIRST_ESC_2253; | ||
| 169 | else orflags = 0; | ||
| 170 | switch(type & BUF_TYPE_WIDTH_MASK) { | ||
| 171 | case 4: | ||
| 172 | c = ((unsigned long)*p++) << 24; | ||
| 173 | c |= ((unsigned long)*p++) << 16; | ||
| 174 | c |= ((unsigned long)*p++) << 8; | ||
| 175 | c |= *p++; | ||
| 176 | break; | ||
| 177 | |||
| 178 | case 2: | ||
| 179 | c = ((unsigned long)*p++) << 8; | ||
| 180 | c |= *p++; | ||
| 181 | break; | ||
| 182 | |||
| 183 | case 1: | ||
| 184 | c = *p++; | ||
| 185 | break; | ||
| 186 | |||
| 187 | case 0: | ||
| 188 | i = UTF8_getc(p, buflen, &c); | ||
| 189 | if(i < 0) return -1; /* Invalid UTF8String */ | ||
| 190 | p += i; | ||
| 191 | break; | ||
| 192 | } | ||
| 193 | if (p == q) orflags = CHARTYPE_LAST_ESC_2253; | ||
| 194 | if(type & BUF_TYPE_CONVUTF8) { | ||
| 195 | unsigned char utfbuf[6]; | ||
| 196 | int utflen; | ||
| 197 | utflen = UTF8_putc(utfbuf, 6, c); | ||
| 198 | for(i = 0; i < utflen; i++) { | ||
| 199 | /* We don't need to worry about setting orflags correctly | ||
| 200 | * because if utflen==1 its value will be correct anyway | ||
| 201 | * otherwise each character will be > 0x7f and so the | ||
| 202 | * character will never be escaped on first and last. | ||
| 203 | */ | ||
| 204 | len = do_esc_char(utfbuf[i], (unsigned char)(flags | orflags), quotes, io_ch, arg); | ||
| 205 | if(len < 0) return -1; | ||
| 206 | outlen += len; | ||
| 207 | } | ||
| 208 | } else { | ||
| 209 | len = do_esc_char(c, (unsigned char)(flags | orflags), quotes, io_ch, arg); | ||
| 210 | if(len < 0) return -1; | ||
| 211 | outlen += len; | ||
| 212 | } | ||
| 213 | } | ||
| 214 | return outlen; | ||
| 215 | } | ||
| 216 | |||
| 217 | /* This function hex dumps a buffer of characters */ | ||
| 218 | |||
| 219 | static int do_hex_dump(char_io *io_ch, void *arg, unsigned char *buf, int buflen) | ||
| 220 | { | ||
| 221 | const static char hexdig[] = "0123456789ABCDEF"; | ||
| 222 | unsigned char *p, *q; | ||
| 223 | char hextmp[2]; | ||
| 224 | if(arg) { | ||
| 225 | p = buf; | ||
| 226 | q = buf + buflen; | ||
| 227 | while(p != q) { | ||
| 228 | hextmp[0] = hexdig[*p >> 4]; | ||
| 229 | hextmp[1] = hexdig[*p & 0xf]; | ||
| 230 | if(!io_ch(arg, hextmp, 2)) return -1; | ||
| 231 | p++; | ||
| 232 | } | ||
| 233 | } | ||
| 234 | return buflen << 1; | ||
| 235 | } | ||
| 236 | |||
| 237 | /* "dump" a string. This is done when the type is unknown, | ||
| 238 | * or the flags request it. We can either dump the content | ||
| 239 | * octets or the entire DER encoding. This uses the RFC2253 | ||
| 240 | * #01234 format. | ||
| 241 | */ | ||
| 242 | |||
| 243 | int do_dump(unsigned long lflags, char_io *io_ch, void *arg, ASN1_STRING *str) | ||
| 244 | { | ||
| 245 | /* Placing the ASN1_STRING in a temp ASN1_TYPE allows | ||
| 246 | * the DER encoding to readily obtained | ||
| 247 | */ | ||
| 248 | ASN1_TYPE t; | ||
| 249 | unsigned char *der_buf, *p; | ||
| 250 | int outlen, der_len; | ||
| 251 | |||
| 252 | if(!io_ch(arg, "#", 1)) return -1; | ||
| 253 | /* If we don't dump DER encoding just dump content octets */ | ||
| 254 | if(!(lflags & ASN1_STRFLGS_DUMP_DER)) { | ||
| 255 | outlen = do_hex_dump(io_ch, arg, str->data, str->length); | ||
| 256 | if(outlen < 0) return -1; | ||
| 257 | return outlen + 1; | ||
| 258 | } | ||
| 259 | t.type = str->type; | ||
| 260 | t.value.ptr = (char *)str; | ||
| 261 | der_len = i2d_ASN1_TYPE(&t, NULL); | ||
| 262 | der_buf = OPENSSL_malloc(der_len); | ||
| 263 | if(!der_buf) return -1; | ||
| 264 | p = der_buf; | ||
| 265 | i2d_ASN1_TYPE(&t, &p); | ||
| 266 | outlen = do_hex_dump(io_ch, arg, der_buf, der_len); | ||
| 267 | OPENSSL_free(der_buf); | ||
| 268 | if(outlen < 0) return -1; | ||
| 269 | return outlen + 1; | ||
| 270 | } | ||
| 271 | |||
| 272 | /* Lookup table to convert tags to character widths, | ||
| 273 | * 0 = UTF8 encoded, -1 is used for non string types | ||
| 274 | * otherwise it is the number of bytes per character | ||
| 275 | */ | ||
| 276 | |||
| 277 | const static char tag2nbyte[] = { | ||
| 278 | -1, -1, -1, -1, -1, /* 0-4 */ | ||
| 279 | -1, -1, -1, -1, -1, /* 5-9 */ | ||
| 280 | -1, -1, 0, -1, /* 10-13 */ | ||
| 281 | -1, -1, -1, -1, /* 15-17 */ | ||
| 282 | -1, 1, 1, /* 18-20 */ | ||
| 283 | -1, 1, -1,-1, /* 21-24 */ | ||
| 284 | -1, 1, -1, /* 25-27 */ | ||
| 285 | 4, -1, 2 /* 28-30 */ | ||
| 286 | }; | ||
| 287 | |||
| 288 | #define ESC_FLAGS (ASN1_STRFLGS_ESC_2253 | \ | ||
| 289 | ASN1_STRFLGS_ESC_QUOTE | \ | ||
| 290 | ASN1_STRFLGS_ESC_CTRL | \ | ||
| 291 | ASN1_STRFLGS_ESC_MSB) | ||
| 292 | |||
| 293 | /* This is the main function, print out an | ||
| 294 | * ASN1_STRING taking note of various escape | ||
| 295 | * and display options. Returns number of | ||
| 296 | * characters written or -1 if an error | ||
| 297 | * occurred. | ||
| 298 | */ | ||
| 299 | |||
| 300 | static int do_print_ex(char_io *io_ch, void *arg, unsigned long lflags, ASN1_STRING *str) | ||
| 301 | { | ||
| 302 | int outlen, len; | ||
| 303 | int type; | ||
| 304 | char quotes; | ||
| 305 | unsigned char flags; | ||
| 306 | quotes = 0; | ||
| 307 | /* Keep a copy of escape flags */ | ||
| 308 | flags = (unsigned char)(lflags & ESC_FLAGS); | ||
| 309 | |||
| 310 | type = str->type; | ||
| 311 | |||
| 312 | outlen = 0; | ||
| 313 | |||
| 314 | |||
| 315 | if(lflags & ASN1_STRFLGS_SHOW_TYPE) { | ||
| 316 | const char *tagname; | ||
| 317 | tagname = ASN1_tag2str(type); | ||
| 318 | outlen += strlen(tagname); | ||
| 319 | if(!io_ch(arg, tagname, outlen) || !io_ch(arg, ":", 1)) return -1; | ||
| 320 | outlen++; | ||
| 321 | } | ||
| 322 | |||
| 323 | /* Decide what to do with type, either dump content or display it */ | ||
| 324 | |||
| 325 | /* Dump everything */ | ||
| 326 | if(lflags & ASN1_STRFLGS_DUMP_ALL) type = -1; | ||
| 327 | /* Ignore the string type */ | ||
| 328 | else if(lflags & ASN1_STRFLGS_IGNORE_TYPE) type = 1; | ||
| 329 | else { | ||
| 330 | /* Else determine width based on type */ | ||
| 331 | if((type > 0) && (type < 31)) type = tag2nbyte[type]; | ||
| 332 | else type = -1; | ||
| 333 | if((type == -1) && !(lflags & ASN1_STRFLGS_DUMP_UNKNOWN)) type = 1; | ||
| 334 | } | ||
| 335 | |||
| 336 | if(type == -1) { | ||
| 337 | len = do_dump(lflags, io_ch, arg, str); | ||
| 338 | if(len < 0) return -1; | ||
| 339 | outlen += len; | ||
| 340 | return outlen; | ||
| 341 | } | ||
| 342 | |||
| 343 | if(lflags & ASN1_STRFLGS_UTF8_CONVERT) { | ||
| 344 | /* Note: if string is UTF8 and we want | ||
| 345 | * to convert to UTF8 then we just interpret | ||
| 346 | * it as 1 byte per character to avoid converting | ||
| 347 | * twice. | ||
| 348 | */ | ||
| 349 | if(!type) type = 1; | ||
| 350 | else type |= BUF_TYPE_CONVUTF8; | ||
| 351 | } | ||
| 352 | |||
| 353 | len = do_buf(str->data, str->length, type, flags, "es, io_ch, NULL); | ||
| 354 | if(outlen < 0) return -1; | ||
| 355 | outlen += len; | ||
| 356 | if(quotes) outlen += 2; | ||
| 357 | if(!arg) return outlen; | ||
| 358 | if(quotes && !io_ch(arg, "\"", 1)) return -1; | ||
| 359 | do_buf(str->data, str->length, type, flags, NULL, io_ch, arg); | ||
| 360 | if(quotes && !io_ch(arg, "\"", 1)) return -1; | ||
| 361 | return outlen; | ||
| 362 | } | ||
| 363 | |||
| 364 | /* Used for line indenting: print 'indent' spaces */ | ||
| 365 | |||
| 366 | static int do_indent(char_io *io_ch, void *arg, int indent) | ||
| 367 | { | ||
| 368 | int i; | ||
| 369 | for(i = 0; i < indent; i++) | ||
| 370 | if(!io_ch(arg, " ", 1)) return 0; | ||
| 371 | return 1; | ||
| 372 | } | ||
| 373 | |||
| 374 | |||
| 375 | static int do_name_ex(char_io *io_ch, void *arg, X509_NAME *n, | ||
| 376 | int indent, unsigned long flags) | ||
| 377 | { | ||
| 378 | int i, prev = -1, orflags, cnt; | ||
| 379 | int fn_opt, fn_nid; | ||
| 380 | ASN1_OBJECT *fn; | ||
| 381 | ASN1_STRING *val; | ||
| 382 | X509_NAME_ENTRY *ent; | ||
| 383 | char objtmp[80]; | ||
| 384 | const char *objbuf; | ||
| 385 | int outlen, len; | ||
| 386 | char *sep_dn, *sep_mv, *sep_eq; | ||
| 387 | int sep_dn_len, sep_mv_len, sep_eq_len; | ||
| 388 | if(indent < 0) indent = 0; | ||
| 389 | outlen = indent; | ||
| 390 | if(!do_indent(io_ch, arg, indent)) return -1; | ||
| 391 | switch (flags & XN_FLAG_SEP_MASK) | ||
| 392 | { | ||
| 393 | case XN_FLAG_SEP_MULTILINE: | ||
| 394 | sep_dn = "\n"; | ||
| 395 | sep_dn_len = 1; | ||
| 396 | sep_mv = " + "; | ||
| 397 | sep_mv_len = 3; | ||
| 398 | break; | ||
| 399 | |||
| 400 | case XN_FLAG_SEP_COMMA_PLUS: | ||
| 401 | sep_dn = ","; | ||
| 402 | sep_dn_len = 1; | ||
| 403 | sep_mv = "+"; | ||
| 404 | sep_mv_len = 1; | ||
| 405 | indent = 0; | ||
| 406 | break; | ||
| 407 | |||
| 408 | case XN_FLAG_SEP_CPLUS_SPC: | ||
| 409 | sep_dn = ", "; | ||
| 410 | sep_dn_len = 2; | ||
| 411 | sep_mv = " + "; | ||
| 412 | sep_mv_len = 3; | ||
| 413 | indent = 0; | ||
| 414 | break; | ||
| 415 | |||
| 416 | case XN_FLAG_SEP_SPLUS_SPC: | ||
| 417 | sep_dn = "; "; | ||
| 418 | sep_dn_len = 2; | ||
| 419 | sep_mv = " + "; | ||
| 420 | sep_mv_len = 3; | ||
| 421 | indent = 0; | ||
| 422 | break; | ||
| 423 | |||
| 424 | default: | ||
| 425 | return -1; | ||
| 426 | } | ||
| 427 | |||
| 428 | if(flags & XN_FLAG_SPC_EQ) { | ||
| 429 | sep_eq = " = "; | ||
| 430 | sep_eq_len = 3; | ||
| 431 | } else { | ||
| 432 | sep_eq = "="; | ||
| 433 | sep_eq_len = 1; | ||
| 434 | } | ||
| 435 | |||
| 436 | fn_opt = flags & XN_FLAG_FN_MASK; | ||
| 437 | |||
| 438 | cnt = X509_NAME_entry_count(n); | ||
| 439 | for(i = 0; i < cnt; i++) { | ||
| 440 | if(flags & XN_FLAG_DN_REV) | ||
| 441 | ent = X509_NAME_get_entry(n, cnt - i - 1); | ||
| 442 | else ent = X509_NAME_get_entry(n, i); | ||
| 443 | if(prev != -1) { | ||
| 444 | if(prev == ent->set) { | ||
| 445 | if(!io_ch(arg, sep_mv, sep_mv_len)) return -1; | ||
| 446 | outlen += sep_mv_len; | ||
| 447 | } else { | ||
| 448 | if(!io_ch(arg, sep_dn, sep_dn_len)) return -1; | ||
| 449 | outlen += sep_dn_len; | ||
| 450 | if(!do_indent(io_ch, arg, indent)) return -1; | ||
| 451 | outlen += indent; | ||
| 452 | } | ||
| 453 | } | ||
| 454 | prev = ent->set; | ||
| 455 | fn = X509_NAME_ENTRY_get_object(ent); | ||
| 456 | val = X509_NAME_ENTRY_get_data(ent); | ||
| 457 | fn_nid = OBJ_obj2nid(fn); | ||
| 458 | if(fn_opt != XN_FLAG_FN_NONE) { | ||
| 459 | int objlen; | ||
| 460 | if((fn_opt == XN_FLAG_FN_OID) || (fn_nid==NID_undef) ) { | ||
| 461 | OBJ_obj2txt(objtmp, 80, fn, 1); | ||
| 462 | objbuf = objtmp; | ||
| 463 | } else { | ||
| 464 | if(fn_opt == XN_FLAG_FN_SN) | ||
| 465 | objbuf = OBJ_nid2sn(fn_nid); | ||
| 466 | else if(fn_opt == XN_FLAG_FN_LN) | ||
| 467 | objbuf = OBJ_nid2ln(fn_nid); | ||
| 468 | else objbuf = ""; | ||
| 469 | } | ||
| 470 | objlen = strlen(objbuf); | ||
| 471 | if(!io_ch(arg, objbuf, objlen)) return -1; | ||
| 472 | if(!io_ch(arg, sep_eq, sep_eq_len)) return -1; | ||
| 473 | outlen += objlen + sep_eq_len; | ||
| 474 | } | ||
| 475 | /* If the field name is unknown then fix up the DER dump | ||
| 476 | * flag. We might want to limit this further so it will | ||
| 477 | * DER dump on anything other than a few 'standard' fields. | ||
| 478 | */ | ||
| 479 | if((fn_nid == NID_undef) && (flags & XN_FLAG_DUMP_UNKNOWN_FIELDS)) | ||
| 480 | orflags = ASN1_STRFLGS_DUMP_ALL; | ||
| 481 | else orflags = 0; | ||
| 482 | |||
| 483 | len = do_print_ex(io_ch, arg, flags | orflags, val); | ||
| 484 | if(len < 0) return -1; | ||
| 485 | outlen += len; | ||
| 486 | } | ||
| 487 | return outlen; | ||
| 488 | } | ||
| 489 | |||
| 490 | /* Wrappers round the main functions */ | ||
| 491 | |||
| 492 | int X509_NAME_print_ex(BIO *out, X509_NAME *nm, int indent, unsigned long flags) | ||
| 493 | { | ||
| 494 | return do_name_ex(send_bio_chars, out, nm, indent, flags); | ||
| 495 | } | ||
| 496 | |||
| 497 | |||
| 498 | int X509_NAME_print_ex_fp(FILE *fp, X509_NAME *nm, int indent, unsigned long flags) | ||
| 499 | { | ||
| 500 | return do_name_ex(send_fp_chars, fp, nm, indent, flags); | ||
| 501 | } | ||
| 502 | |||
| 503 | int ASN1_STRING_print_ex(BIO *out, ASN1_STRING *str, unsigned long flags) | ||
| 504 | { | ||
| 505 | return do_print_ex(send_bio_chars, out, flags, str); | ||
| 506 | } | ||
| 507 | |||
| 508 | |||
| 509 | int ASN1_STRING_print_ex_fp(FILE *fp, ASN1_STRING *str, unsigned long flags) | ||
| 510 | { | ||
| 511 | return do_print_ex(send_fp_chars, fp, flags, str); | ||
| 512 | } | ||
| 513 | |||
| 514 | /* Utility function: convert any string type to UTF8, returns number of bytes | ||
| 515 | * in output string or a negative error code | ||
| 516 | */ | ||
| 517 | |||
| 518 | int ASN1_STRING_to_UTF8(unsigned char **out, ASN1_STRING *in) | ||
| 519 | { | ||
| 520 | ASN1_STRING stmp, *str = &stmp; | ||
| 521 | int mbflag, type, ret; | ||
| 522 | if(!*out || !in) return -1; | ||
| 523 | type = in->type; | ||
| 524 | if((type < 0) || (type > 30)) return -1; | ||
| 525 | mbflag = tag2nbyte[type]; | ||
| 526 | if(mbflag == -1) return -1; | ||
| 527 | mbflag |= MBSTRING_FLAG; | ||
| 528 | stmp.data = NULL; | ||
| 529 | ret = ASN1_mbstring_copy(&str, in->data, in->length, mbflag, B_ASN1_UTF8STRING); | ||
| 530 | if(ret < 0) return ret; | ||
| 531 | if(out) *out = stmp.data; | ||
| 532 | return stmp.length; | ||
| 533 | } | ||
diff --git a/src/lib/libcrypto/asn1/a_strnid.c b/src/lib/libcrypto/asn1/a_strnid.c new file mode 100644 index 0000000000..ab8417ffab --- /dev/null +++ b/src/lib/libcrypto/asn1/a_strnid.c | |||
| @@ -0,0 +1,247 @@ | |||
| 1 | /* a_strnid.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 1999. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 1999 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | #include <stdio.h> | ||
| 60 | #include <ctype.h> | ||
| 61 | #include "cryptlib.h" | ||
| 62 | #include <openssl/asn1.h> | ||
| 63 | #include <openssl/objects.h> | ||
| 64 | |||
| 65 | |||
| 66 | static STACK_OF(ASN1_STRING_TABLE) *stable = NULL; | ||
| 67 | static void st_free(ASN1_STRING_TABLE *tbl); | ||
| 68 | static int sk_table_cmp(ASN1_STRING_TABLE **a, ASN1_STRING_TABLE **b); | ||
| 69 | static int table_cmp(ASN1_STRING_TABLE *a, ASN1_STRING_TABLE *b); | ||
| 70 | |||
| 71 | |||
| 72 | /* This is the global mask for the mbstring functions: this is use to | ||
| 73 | * mask out certain types (such as BMPString and UTF8String) because | ||
| 74 | * certain software (e.g. Netscape) has problems with them. | ||
| 75 | */ | ||
| 76 | |||
| 77 | static unsigned long global_mask = 0xFFFFFFFFL; | ||
| 78 | |||
| 79 | void ASN1_STRING_set_default_mask(unsigned long mask) | ||
| 80 | { | ||
| 81 | global_mask = mask; | ||
| 82 | } | ||
| 83 | |||
| 84 | unsigned long ASN1_STRING_get_default_mask(void) | ||
| 85 | { | ||
| 86 | return global_mask; | ||
| 87 | } | ||
| 88 | |||
| 89 | /* This function sets the default to various "flavours" of configuration. | ||
| 90 | * based on an ASCII string. Currently this is: | ||
| 91 | * MASK:XXXX : a numerical mask value. | ||
| 92 | * nobmp : Don't use BMPStrings (just Printable, T61). | ||
| 93 | * pkix : PKIX recommendation in RFC2459. | ||
| 94 | * utf8only : only use UTF8Strings (RFC2459 recommendation for 2004). | ||
| 95 | * default: the default value, Printable, T61, BMP. | ||
| 96 | */ | ||
| 97 | |||
| 98 | int ASN1_STRING_set_default_mask_asc(char *p) | ||
| 99 | { | ||
| 100 | unsigned long mask; | ||
| 101 | char *end; | ||
| 102 | if(!strncmp(p, "MASK:", 5)) { | ||
| 103 | if(!p[5]) return 0; | ||
| 104 | mask = strtoul(p + 5, &end, 0); | ||
| 105 | if(*end) return 0; | ||
| 106 | } else if(!strcmp(p, "nombstr")) | ||
| 107 | mask = ~(B_ASN1_BMPSTRING|B_ASN1_UTF8STRING); | ||
| 108 | else if(!strcmp(p, "pkix")) | ||
| 109 | mask = ~B_ASN1_T61STRING; | ||
| 110 | else if(!strcmp(p, "utf8only")) mask = B_ASN1_UTF8STRING; | ||
| 111 | else if(!strcmp(p, "default")) | ||
| 112 | mask = 0xFFFFFFFFL; | ||
| 113 | else return 0; | ||
| 114 | ASN1_STRING_set_default_mask(mask); | ||
| 115 | return 1; | ||
| 116 | } | ||
| 117 | |||
| 118 | /* The following function generates an ASN1_STRING based on limits in a table. | ||
| 119 | * Frequently the types and length of an ASN1_STRING are restricted by a | ||
| 120 | * corresponding OID. For example certificates and certificate requests. | ||
| 121 | */ | ||
| 122 | |||
| 123 | ASN1_STRING *ASN1_STRING_set_by_NID(ASN1_STRING **out, const unsigned char *in, | ||
| 124 | int inlen, int inform, int nid) | ||
| 125 | { | ||
| 126 | ASN1_STRING_TABLE *tbl; | ||
| 127 | ASN1_STRING *str = NULL; | ||
| 128 | unsigned long mask; | ||
| 129 | int ret; | ||
| 130 | if(!out) out = &str; | ||
| 131 | tbl = ASN1_STRING_TABLE_get(nid); | ||
| 132 | if(tbl) { | ||
| 133 | mask = tbl->mask; | ||
| 134 | if(!(tbl->flags & STABLE_NO_MASK)) mask &= global_mask; | ||
| 135 | ret = ASN1_mbstring_ncopy(out, in, inlen, inform, tbl->mask, | ||
| 136 | tbl->minsize, tbl->maxsize); | ||
| 137 | } else ret = ASN1_mbstring_copy(out, in, inlen, inform, DIRSTRING_TYPE & global_mask); | ||
| 138 | if(ret <= 0) return NULL; | ||
| 139 | return *out; | ||
| 140 | } | ||
| 141 | |||
| 142 | /* Now the tables and helper functions for the string table: | ||
| 143 | */ | ||
| 144 | |||
| 145 | /* size limits: this stuff is taken straight from RFC2459 */ | ||
| 146 | |||
| 147 | #define ub_name 32768 | ||
| 148 | #define ub_common_name 64 | ||
| 149 | #define ub_locality_name 128 | ||
| 150 | #define ub_state_name 128 | ||
| 151 | #define ub_organization_name 64 | ||
| 152 | #define ub_organization_unit_name 64 | ||
| 153 | #define ub_title 64 | ||
| 154 | #define ub_email_address 128 | ||
| 155 | |||
| 156 | /* This table must be kept in NID order */ | ||
| 157 | |||
| 158 | static ASN1_STRING_TABLE tbl_standard[] = { | ||
| 159 | {NID_commonName, 1, ub_common_name, DIRSTRING_TYPE, 0}, | ||
| 160 | {NID_countryName, 2, 2, B_ASN1_PRINTABLESTRING, STABLE_NO_MASK}, | ||
| 161 | {NID_localityName, 1, ub_locality_name, DIRSTRING_TYPE, 0}, | ||
| 162 | {NID_stateOrProvinceName, 1, ub_state_name, DIRSTRING_TYPE, 0}, | ||
| 163 | {NID_organizationName, 1, ub_organization_name, DIRSTRING_TYPE, 0}, | ||
| 164 | {NID_organizationalUnitName, 1, ub_organization_unit_name, DIRSTRING_TYPE, 0}, | ||
| 165 | {NID_pkcs9_emailAddress, 1, ub_email_address, B_ASN1_IA5STRING, STABLE_NO_MASK}, | ||
| 166 | {NID_pkcs9_unstructuredName, 1, -1, PKCS9STRING_TYPE, 0}, | ||
| 167 | {NID_pkcs9_challengePassword, 1, -1, PKCS9STRING_TYPE, 0}, | ||
| 168 | {NID_pkcs9_unstructuredAddress, 1, -1, DIRSTRING_TYPE, 0}, | ||
| 169 | {NID_givenName, 1, ub_name, DIRSTRING_TYPE, 0}, | ||
| 170 | {NID_surname, 1, ub_name, DIRSTRING_TYPE, 0}, | ||
| 171 | {NID_initials, 1, ub_name, DIRSTRING_TYPE, 0}, | ||
| 172 | {NID_name, 1, ub_name, DIRSTRING_TYPE, 0}, | ||
| 173 | {NID_dnQualifier, -1, -1, B_ASN1_PRINTABLESTRING, STABLE_NO_MASK} | ||
| 174 | }; | ||
| 175 | |||
| 176 | static int sk_table_cmp(ASN1_STRING_TABLE **a, ASN1_STRING_TABLE **b) | ||
| 177 | { | ||
| 178 | return (*a)->nid - (*b)->nid; | ||
| 179 | } | ||
| 180 | |||
| 181 | static int table_cmp(ASN1_STRING_TABLE *a, ASN1_STRING_TABLE *b) | ||
| 182 | { | ||
| 183 | return a->nid - b->nid; | ||
| 184 | } | ||
| 185 | |||
| 186 | ASN1_STRING_TABLE *ASN1_STRING_TABLE_get(int nid) | ||
| 187 | { | ||
| 188 | int idx; | ||
| 189 | ASN1_STRING_TABLE *ttmp; | ||
| 190 | ASN1_STRING_TABLE fnd; | ||
| 191 | fnd.nid = nid; | ||
| 192 | ttmp = (ASN1_STRING_TABLE *) OBJ_bsearch((char *)&fnd, | ||
| 193 | (char *)tbl_standard, | ||
| 194 | sizeof(tbl_standard)/sizeof(ASN1_STRING_TABLE), | ||
| 195 | sizeof(ASN1_STRING_TABLE), (int(*)())table_cmp); | ||
| 196 | if(ttmp) return ttmp; | ||
| 197 | if(!stable) return NULL; | ||
| 198 | idx = sk_ASN1_STRING_TABLE_find(stable, &fnd); | ||
| 199 | if(idx < 0) return NULL; | ||
| 200 | return sk_ASN1_STRING_TABLE_value(stable, idx); | ||
| 201 | } | ||
| 202 | |||
| 203 | int ASN1_STRING_TABLE_add(int nid, | ||
| 204 | long minsize, long maxsize, unsigned long mask, | ||
| 205 | unsigned long flags) | ||
| 206 | { | ||
| 207 | ASN1_STRING_TABLE *tmp; | ||
| 208 | char new_nid = 0; | ||
| 209 | flags &= ~STABLE_FLAGS_MALLOC; | ||
| 210 | if(!stable) stable = sk_ASN1_STRING_TABLE_new(sk_table_cmp); | ||
| 211 | if(!stable) { | ||
| 212 | ASN1err(ASN1_F_ASN1_STRING_TABLE_ADD, ERR_R_MALLOC_FAILURE); | ||
| 213 | return 0; | ||
| 214 | } | ||
| 215 | if(!(tmp = ASN1_STRING_TABLE_get(nid))) { | ||
| 216 | tmp = Malloc(sizeof(ASN1_STRING_TABLE)); | ||
| 217 | if(!tmp) { | ||
| 218 | ASN1err(ASN1_F_ASN1_STRING_TABLE_ADD, | ||
| 219 | ERR_R_MALLOC_FAILURE); | ||
| 220 | return 0; | ||
| 221 | } | ||
| 222 | tmp->flags = flags | STABLE_FLAGS_MALLOC; | ||
| 223 | tmp->nid = nid; | ||
| 224 | new_nid = 1; | ||
| 225 | } else tmp->flags = (tmp->flags & STABLE_FLAGS_MALLOC) | flags; | ||
| 226 | if(minsize != -1) tmp->minsize = minsize; | ||
| 227 | if(maxsize != -1) tmp->maxsize = maxsize; | ||
| 228 | tmp->mask = mask; | ||
| 229 | if(new_nid) sk_ASN1_STRING_TABLE_push(stable, tmp); | ||
| 230 | return 1; | ||
| 231 | } | ||
| 232 | |||
| 233 | void ASN1_STRING_TABLE_cleanup(void) | ||
| 234 | { | ||
| 235 | STACK_OF(ASN1_STRING_TABLE) *tmp; | ||
| 236 | tmp = stable; | ||
| 237 | if(!tmp) return; | ||
| 238 | stable = NULL; | ||
| 239 | sk_ASN1_STRING_TABLE_pop_free(tmp, st_free); | ||
| 240 | } | ||
| 241 | |||
| 242 | static void st_free(ASN1_STRING_TABLE *tbl) | ||
| 243 | { | ||
| 244 | if(tbl->flags & STABLE_FLAGS_MALLOC) Free(tbl); | ||
| 245 | } | ||
| 246 | |||
| 247 | IMPLEMENT_STACK_OF(ASN1_STRING_TABLE) | ||
diff --git a/src/lib/libcrypto/asn1/a_time.c b/src/lib/libcrypto/asn1/a_time.c new file mode 100644 index 0000000000..c1690a5694 --- /dev/null +++ b/src/lib/libcrypto/asn1/a_time.c | |||
| @@ -0,0 +1,123 @@ | |||
| 1 | /* crypto/asn1/a_time.c */ | ||
| 2 | /* ==================================================================== | ||
| 3 | * Copyright (c) 1999 The OpenSSL Project. All rights reserved. | ||
| 4 | * | ||
| 5 | * Redistribution and use in source and binary forms, with or without | ||
| 6 | * modification, are permitted provided that the following conditions | ||
| 7 | * are met: | ||
| 8 | * | ||
| 9 | * 1. Redistributions of source code must retain the above copyright | ||
| 10 | * notice, this list of conditions and the following disclaimer. | ||
| 11 | * | ||
| 12 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer in | ||
| 14 | * the documentation and/or other materials provided with the | ||
| 15 | * distribution. | ||
| 16 | * | ||
| 17 | * 3. All advertising materials mentioning features or use of this | ||
| 18 | * software must display the following acknowledgment: | ||
| 19 | * "This product includes software developed by the OpenSSL Project | ||
| 20 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 21 | * | ||
| 22 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 23 | * endorse or promote products derived from this software without | ||
| 24 | * prior written permission. For written permission, please contact | ||
| 25 | * licensing@OpenSSL.org. | ||
| 26 | * | ||
| 27 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 28 | * nor may "OpenSSL" appear in their names without prior written | ||
| 29 | * permission of the OpenSSL Project. | ||
| 30 | * | ||
| 31 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 32 | * acknowledgment: | ||
| 33 | * "This product includes software developed by the OpenSSL Project | ||
| 34 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 35 | * | ||
| 36 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 37 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 38 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 39 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 40 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 41 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 42 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 43 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 44 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 45 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 46 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 47 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 48 | * ==================================================================== | ||
| 49 | * | ||
| 50 | * This product includes cryptographic software written by Eric Young | ||
| 51 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 52 | * Hudson (tjh@cryptsoft.com). | ||
| 53 | * | ||
| 54 | */ | ||
| 55 | |||
| 56 | |||
| 57 | /* This is an implementation of the ASN1 Time structure which is: | ||
| 58 | * Time ::= CHOICE { | ||
| 59 | * utcTime UTCTime, | ||
| 60 | * generalTime GeneralizedTime } | ||
| 61 | * written by Steve Henson. | ||
| 62 | */ | ||
| 63 | |||
| 64 | #include <stdio.h> | ||
| 65 | #include <time.h> | ||
| 66 | #include "cryptlib.h" | ||
| 67 | #include <openssl/asn1.h> | ||
| 68 | |||
| 69 | int i2d_ASN1_TIME(ASN1_TIME *a, unsigned char **pp) | ||
| 70 | { | ||
| 71 | #ifdef CHARSET_EBCDIC | ||
| 72 | /* KLUDGE! We convert to ascii before writing DER */ | ||
| 73 | char tmp[24]; | ||
| 74 | ASN1_STRING tmpstr; | ||
| 75 | |||
| 76 | if(a->type == V_ASN1_UTCTIME || a->type == V_ASN1_GENERALIZEDTIME) { | ||
| 77 | int len; | ||
| 78 | |||
| 79 | tmpstr = *(ASN1_STRING *)a; | ||
| 80 | len = tmpstr.length; | ||
| 81 | ebcdic2ascii(tmp, tmpstr.data, (len >= sizeof tmp) ? sizeof tmp : len); | ||
| 82 | tmpstr.data = tmp; | ||
| 83 | a = (ASN1_GENERALIZEDTIME *) &tmpstr; | ||
| 84 | } | ||
| 85 | #endif | ||
| 86 | if(a->type == V_ASN1_UTCTIME || a->type == V_ASN1_GENERALIZEDTIME) | ||
| 87 | return(i2d_ASN1_bytes((ASN1_STRING *)a,pp, | ||
| 88 | a->type ,V_ASN1_UNIVERSAL)); | ||
| 89 | ASN1err(ASN1_F_I2D_ASN1_TIME,ASN1_R_EXPECTING_A_TIME); | ||
| 90 | return -1; | ||
| 91 | } | ||
| 92 | |||
| 93 | |||
| 94 | ASN1_TIME *d2i_ASN1_TIME(ASN1_TIME **a, unsigned char **pp, long length) | ||
| 95 | { | ||
| 96 | unsigned char tag; | ||
| 97 | tag = **pp & ~V_ASN1_CONSTRUCTED; | ||
| 98 | if(tag == (V_ASN1_UTCTIME|V_ASN1_UNIVERSAL)) | ||
| 99 | return d2i_ASN1_UTCTIME(a, pp, length); | ||
| 100 | if(tag == (V_ASN1_GENERALIZEDTIME|V_ASN1_UNIVERSAL)) | ||
| 101 | return d2i_ASN1_GENERALIZEDTIME(a, pp, length); | ||
| 102 | ASN1err(ASN1_F_D2I_ASN1_TIME,ASN1_R_EXPECTING_A_TIME); | ||
| 103 | return(NULL); | ||
| 104 | } | ||
| 105 | |||
| 106 | |||
| 107 | ASN1_TIME *ASN1_TIME_set(ASN1_TIME *s, time_t t) | ||
| 108 | { | ||
| 109 | struct tm *ts; | ||
| 110 | #if defined(THREADS) && !defined(WIN32) | ||
| 111 | struct tm data; | ||
| 112 | #endif | ||
| 113 | |||
| 114 | #if defined(THREADS) && !defined(WIN32) | ||
| 115 | gmtime_r(&t,&data); | ||
| 116 | ts=&data; /* should return &data, but doesn't on some systems, so we don't even look at the return value */ | ||
| 117 | #else | ||
| 118 | ts=gmtime(&t); | ||
| 119 | #endif | ||
| 120 | if((ts->tm_year >= 50) && (ts->tm_year < 150)) | ||
| 121 | return ASN1_UTCTIME_set(s, t); | ||
| 122 | return ASN1_GENERALIZEDTIME_set(s,t); | ||
| 123 | } | ||
diff --git a/src/lib/libcrypto/asn1/a_utf8.c b/src/lib/libcrypto/asn1/a_utf8.c new file mode 100644 index 0000000000..4a8a92e9e4 --- /dev/null +++ b/src/lib/libcrypto/asn1/a_utf8.c | |||
| @@ -0,0 +1,83 @@ | |||
| 1 | /* crypto/asn1/a_utf8.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.h> | ||
| 62 | |||
| 63 | int i2d_ASN1_UTF8STRING(ASN1_UTF8STRING *a, unsigned char **pp) | ||
| 64 | { | ||
| 65 | return(i2d_ASN1_bytes((ASN1_STRING *)a,pp, | ||
| 66 | V_ASN1_UTF8STRING,V_ASN1_UNIVERSAL)); | ||
| 67 | } | ||
| 68 | |||
| 69 | ASN1_UTF8STRING *d2i_ASN1_UTF8STRING(ASN1_UTF8STRING **a, unsigned char **pp, | ||
| 70 | long length) | ||
| 71 | { | ||
| 72 | ASN1_UTF8STRING *ret=NULL; | ||
| 73 | |||
| 74 | ret=(ASN1_UTF8STRING *)d2i_ASN1_bytes((ASN1_STRING **)a, | ||
| 75 | pp,length,V_ASN1_UTF8STRING,V_ASN1_UNIVERSAL); | ||
| 76 | if (ret == NULL) | ||
| 77 | { | ||
| 78 | ASN1err(ASN1_F_D2I_ASN1_UTF8STRING,ERR_R_NESTED_ASN1_ERROR); | ||
| 79 | return(NULL); | ||
| 80 | } | ||
| 81 | return(ret); | ||
| 82 | } | ||
| 83 | |||
diff --git a/src/lib/libcrypto/asn1/asn1t.h b/src/lib/libcrypto/asn1/asn1t.h new file mode 100644 index 0000000000..ed372f8554 --- /dev/null +++ b/src/lib/libcrypto/asn1/asn1t.h | |||
| @@ -0,0 +1,846 @@ | |||
| 1 | /* asn1t.h */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 2000. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 2000 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | #ifndef HEADER_ASN1T_H | ||
| 59 | #define HEADER_ASN1T_H | ||
| 60 | |||
| 61 | #include <stddef.h> | ||
| 62 | #include <openssl/e_os2.h> | ||
| 63 | #include <openssl/asn1.h> | ||
| 64 | |||
| 65 | #ifdef OPENSSL_BUILD_SHLIBCRYPTO | ||
| 66 | # undef OPENSSL_EXTERN | ||
| 67 | # define OPENSSL_EXTERN OPENSSL_EXPORT | ||
| 68 | #endif | ||
| 69 | |||
| 70 | /* ASN1 template defines, structures and functions */ | ||
| 71 | |||
| 72 | #ifdef __cplusplus | ||
| 73 | extern "C" { | ||
| 74 | #endif | ||
| 75 | |||
| 76 | |||
| 77 | #ifndef OPENSSL_EXPORT_VAR_AS_FUNCTION | ||
| 78 | |||
| 79 | /* Macro to obtain ASN1_ADB pointer from a type (only used internally) */ | ||
| 80 | #define ASN1_ADB_ptr(iptr) ((const ASN1_ADB *)(iptr)) | ||
| 81 | |||
| 82 | |||
| 83 | /* Macros for start and end of ASN1_ITEM definition */ | ||
| 84 | |||
| 85 | #define ASN1_ITEM_start(itname) \ | ||
| 86 | OPENSSL_GLOBAL const ASN1_ITEM itname##_it = { | ||
| 87 | |||
| 88 | #define ASN1_ITEM_end(itname) \ | ||
| 89 | }; | ||
| 90 | |||
| 91 | #else | ||
| 92 | |||
| 93 | /* Macro to obtain ASN1_ADB pointer from a type (only used internally) */ | ||
| 94 | #define ASN1_ADB_ptr(iptr) ((const ASN1_ADB *)(iptr())) | ||
| 95 | |||
| 96 | |||
| 97 | /* Macros for start and end of ASN1_ITEM definition */ | ||
| 98 | |||
| 99 | #define ASN1_ITEM_start(itname) \ | ||
| 100 | const ASN1_ITEM * itname##_it(void) \ | ||
| 101 | { \ | ||
| 102 | static const ASN1_ITEM local_it = { \ | ||
| 103 | |||
| 104 | #define ASN1_ITEM_end(itname) \ | ||
| 105 | }; \ | ||
| 106 | return &local_it; \ | ||
| 107 | } | ||
| 108 | |||
| 109 | #endif | ||
| 110 | |||
| 111 | |||
| 112 | /* Macros to aid ASN1 template writing */ | ||
| 113 | |||
| 114 | #define ASN1_ITEM_TEMPLATE(tname) \ | ||
| 115 | const static ASN1_TEMPLATE tname##_item_tt | ||
| 116 | |||
| 117 | #define ASN1_ITEM_TEMPLATE_END(tname) \ | ||
| 118 | ;\ | ||
| 119 | ASN1_ITEM_start(tname) \ | ||
| 120 | ASN1_ITYPE_PRIMITIVE,\ | ||
| 121 | -1,\ | ||
| 122 | &tname##_item_tt,\ | ||
| 123 | 0,\ | ||
| 124 | NULL,\ | ||
| 125 | 0,\ | ||
| 126 | #tname \ | ||
| 127 | ASN1_ITEM_end(tname) | ||
| 128 | |||
| 129 | |||
| 130 | /* This is a ASN1 type which just embeds a template */ | ||
| 131 | |||
| 132 | /* This pair helps declare a SEQUENCE. We can do: | ||
| 133 | * | ||
| 134 | * ASN1_SEQUENCE(stname) = { | ||
| 135 | * ... SEQUENCE components ... | ||
| 136 | * } ASN1_SEQUENCE_END(stname) | ||
| 137 | * | ||
| 138 | * This will produce an ASN1_ITEM called stname_it | ||
| 139 | * for a structure called stname. | ||
| 140 | * | ||
| 141 | * If you want the same structure but a different | ||
| 142 | * name then use: | ||
| 143 | * | ||
| 144 | * ASN1_SEQUENCE(itname) = { | ||
| 145 | * ... SEQUENCE components ... | ||
| 146 | * } ASN1_SEQUENCE_END_name(stname, itname) | ||
| 147 | * | ||
| 148 | * This will create an item called itname_it using | ||
| 149 | * a structure called stname. | ||
| 150 | */ | ||
| 151 | |||
| 152 | #define ASN1_SEQUENCE(tname) \ | ||
| 153 | const static ASN1_TEMPLATE tname##_seq_tt[] | ||
| 154 | |||
| 155 | #define ASN1_SEQUENCE_END(stname) ASN1_SEQUENCE_END_name(stname, stname) | ||
| 156 | |||
| 157 | #define ASN1_SEQUENCE_END_name(stname, tname) \ | ||
| 158 | ;\ | ||
| 159 | ASN1_ITEM_start(tname) \ | ||
| 160 | ASN1_ITYPE_SEQUENCE,\ | ||
| 161 | V_ASN1_SEQUENCE,\ | ||
| 162 | tname##_seq_tt,\ | ||
| 163 | sizeof(tname##_seq_tt) / sizeof(ASN1_TEMPLATE),\ | ||
| 164 | NULL,\ | ||
| 165 | sizeof(stname),\ | ||
| 166 | #stname \ | ||
| 167 | ASN1_ITEM_end(tname) | ||
| 168 | |||
| 169 | #define ASN1_SEQUENCE_cb(tname, cb) \ | ||
| 170 | const static ASN1_AUX tname##_aux = {NULL, 0, 0, 0, cb, 0}; \ | ||
| 171 | ASN1_SEQUENCE(tname) | ||
| 172 | |||
| 173 | #define ASN1_BROKEN_SEQUENCE(tname) \ | ||
| 174 | const static ASN1_AUX tname##_aux = {NULL, ASN1_AFLG_BROKEN, 0, 0, 0, 0}; \ | ||
| 175 | ASN1_SEQUENCE(tname) | ||
| 176 | |||
| 177 | #define ASN1_SEQUENCE_ref(tname, cb, lck) \ | ||
| 178 | const static ASN1_AUX tname##_aux = {NULL, ASN1_AFLG_REFCOUNT, offsetof(tname, references), lck, cb, 0}; \ | ||
| 179 | ASN1_SEQUENCE(tname) | ||
| 180 | |||
| 181 | #define ASN1_SEQUENCE_enc(tname, enc, cb) \ | ||
| 182 | const static ASN1_AUX tname##_aux = {NULL, ASN1_AFLG_ENCODING, 0, 0, cb, offsetof(tname, enc)}; \ | ||
| 183 | ASN1_SEQUENCE(tname) | ||
| 184 | |||
| 185 | #define ASN1_BROKEN_SEQUENCE_END(stname) ASN1_SEQUENCE_END_ref(stname, stname) | ||
| 186 | |||
| 187 | #define ASN1_SEQUENCE_END_enc(stname, tname) ASN1_SEQUENCE_END_ref(stname, tname) | ||
| 188 | |||
| 189 | #define ASN1_SEQUENCE_END_cb(stname, tname) ASN1_SEQUENCE_END_ref(stname, tname) | ||
| 190 | |||
| 191 | #define ASN1_SEQUENCE_END_ref(stname, tname) \ | ||
| 192 | ;\ | ||
| 193 | ASN1_ITEM_start(tname) \ | ||
| 194 | ASN1_ITYPE_SEQUENCE,\ | ||
| 195 | V_ASN1_SEQUENCE,\ | ||
| 196 | tname##_seq_tt,\ | ||
| 197 | sizeof(tname##_seq_tt) / sizeof(ASN1_TEMPLATE),\ | ||
| 198 | &tname##_aux,\ | ||
| 199 | sizeof(stname),\ | ||
| 200 | #stname \ | ||
| 201 | ASN1_ITEM_end(tname) | ||
| 202 | |||
| 203 | |||
| 204 | /* This pair helps declare a CHOICE type. We can do: | ||
| 205 | * | ||
| 206 | * ASN1_CHOICE(chname) = { | ||
| 207 | * ... CHOICE options ... | ||
| 208 | * ASN1_CHOICE_END(chname) | ||
| 209 | * | ||
| 210 | * This will produce an ASN1_ITEM called chname_it | ||
| 211 | * for a structure called chname. The structure | ||
| 212 | * definition must look like this: | ||
| 213 | * typedef struct { | ||
| 214 | * int type; | ||
| 215 | * union { | ||
| 216 | * ASN1_SOMETHING *opt1; | ||
| 217 | * ASN1_SOMEOTHER *opt2; | ||
| 218 | * } value; | ||
| 219 | * } chname; | ||
| 220 | * | ||
| 221 | * the name of the selector must be 'type'. | ||
| 222 | * to use an alternative selector name use the | ||
| 223 | * ASN1_CHOICE_END_selector() version. | ||
| 224 | */ | ||
| 225 | |||
| 226 | #define ASN1_CHOICE(tname) \ | ||
| 227 | const static ASN1_TEMPLATE tname##_ch_tt[] | ||
| 228 | |||
| 229 | #define ASN1_CHOICE_cb(tname, cb) \ | ||
| 230 | const static ASN1_AUX tname##_aux = {NULL, 0, 0, 0, cb, 0}; \ | ||
| 231 | ASN1_CHOICE(tname) | ||
| 232 | |||
| 233 | #define ASN1_CHOICE_END(stname) ASN1_CHOICE_END_name(stname, stname) | ||
| 234 | |||
| 235 | #define ASN1_CHOICE_END_name(stname, tname) ASN1_CHOICE_END_selector(stname, tname, type) | ||
| 236 | |||
| 237 | #define ASN1_CHOICE_END_selector(stname, tname, selname) \ | ||
| 238 | ;\ | ||
| 239 | ASN1_ITEM_start(tname) \ | ||
| 240 | ASN1_ITYPE_CHOICE,\ | ||
| 241 | offsetof(stname,selname) ,\ | ||
| 242 | tname##_ch_tt,\ | ||
| 243 | sizeof(tname##_ch_tt) / sizeof(ASN1_TEMPLATE),\ | ||
| 244 | NULL,\ | ||
| 245 | sizeof(stname),\ | ||
| 246 | #stname \ | ||
| 247 | ASN1_ITEM_end(tname) | ||
| 248 | |||
| 249 | #define ASN1_CHOICE_END_cb(stname, tname, selname) \ | ||
| 250 | ;\ | ||
| 251 | ASN1_ITEM_start(tname) \ | ||
| 252 | ASN1_ITYPE_CHOICE,\ | ||
| 253 | offsetof(stname,selname) ,\ | ||
| 254 | tname##_ch_tt,\ | ||
| 255 | sizeof(tname##_ch_tt) / sizeof(ASN1_TEMPLATE),\ | ||
| 256 | &tname##_aux,\ | ||
| 257 | sizeof(stname),\ | ||
| 258 | #stname \ | ||
| 259 | ASN1_ITEM_end(tname) | ||
| 260 | |||
| 261 | /* This helps with the template wrapper form of ASN1_ITEM */ | ||
| 262 | |||
| 263 | #define ASN1_EX_TEMPLATE_TYPE(flags, tag, name, type) { \ | ||
| 264 | (flags), (tag), 0,\ | ||
| 265 | #name, ASN1_ITEM_ref(type) } | ||
| 266 | |||
| 267 | /* These help with SEQUENCE or CHOICE components */ | ||
| 268 | |||
| 269 | /* used to declare other types */ | ||
| 270 | |||
| 271 | #define ASN1_EX_TYPE(flags, tag, stname, field, type) { \ | ||
| 272 | (flags), (tag), offsetof(stname, field),\ | ||
| 273 | #field, ASN1_ITEM_ref(type) } | ||
| 274 | |||
| 275 | /* used when the structure is combined with the parent */ | ||
| 276 | |||
| 277 | #define ASN1_EX_COMBINE(flags, tag, type) { \ | ||
| 278 | (flags)|ASN1_TFLG_COMBINE, (tag), 0, NULL, ASN1_ITEM_ref(type) } | ||
| 279 | |||
| 280 | /* implicit and explicit helper macros */ | ||
| 281 | |||
| 282 | #define ASN1_IMP_EX(stname, field, type, tag, ex) \ | ||
| 283 | ASN1_EX_TYPE(ASN1_TFLG_IMPLICIT | ex, tag, stname, field, type) | ||
| 284 | |||
| 285 | #define ASN1_EXP_EX(stname, field, type, tag, ex) \ | ||
| 286 | ASN1_EX_TYPE(ASN1_TFLG_EXPLICIT | ex, tag, stname, field, type) | ||
| 287 | |||
| 288 | /* Any defined by macros: the field used is in the table itself */ | ||
| 289 | |||
| 290 | #ifndef OPENSSL_EXPORT_VAR_AS_FUNCTION | ||
| 291 | #define ASN1_ADB_OBJECT(tblname) { ASN1_TFLG_ADB_OID, -1, 0, #tblname, (const ASN1_ITEM *)&(tblname##_adb) } | ||
| 292 | #define ASN1_ADB_INTEGER(tblname) { ASN1_TFLG_ADB_INT, -1, 0, #tblname, (const ASN1_ITEM *)&(tblname##_adb) } | ||
| 293 | #else | ||
| 294 | #define ASN1_ADB_OBJECT(tblname) { ASN1_TFLG_ADB_OID, -1, 0, #tblname, tblname##_adb } | ||
| 295 | #define ASN1_ADB_INTEGER(tblname) { ASN1_TFLG_ADB_INT, -1, 0, #tblname, tblname##_adb } | ||
| 296 | #endif | ||
| 297 | /* Plain simple type */ | ||
| 298 | #define ASN1_SIMPLE(stname, field, type) ASN1_EX_TYPE(0,0, stname, field, type) | ||
| 299 | |||
| 300 | /* OPTIONAL simple type */ | ||
| 301 | #define ASN1_OPT(stname, field, type) ASN1_EX_TYPE(ASN1_TFLG_OPTIONAL, 0, stname, field, type) | ||
| 302 | |||
| 303 | /* IMPLICIT tagged simple type */ | ||
| 304 | #define ASN1_IMP(stname, field, type, tag) ASN1_IMP_EX(stname, field, type, tag, 0) | ||
| 305 | |||
| 306 | /* IMPLICIT tagged OPTIONAL simple type */ | ||
| 307 | #define ASN1_IMP_OPT(stname, field, type, tag) ASN1_IMP_EX(stname, field, type, tag, ASN1_TFLG_OPTIONAL) | ||
| 308 | |||
| 309 | /* Same as above but EXPLICIT */ | ||
| 310 | |||
| 311 | #define ASN1_EXP(stname, field, type, tag) ASN1_EXP_EX(stname, field, type, tag, 0) | ||
| 312 | #define ASN1_EXP_OPT(stname, field, type, tag) ASN1_EXP_EX(stname, field, type, tag, ASN1_TFLG_OPTIONAL) | ||
| 313 | |||
| 314 | /* SEQUENCE OF type */ | ||
| 315 | #define ASN1_SEQUENCE_OF(stname, field, type) \ | ||
| 316 | ASN1_EX_TYPE(ASN1_TFLG_SEQUENCE_OF, 0, stname, field, type) | ||
| 317 | |||
| 318 | /* OPTIONAL SEQUENCE OF */ | ||
| 319 | #define ASN1_SEQUENCE_OF_OPT(stname, field, type) \ | ||
| 320 | ASN1_EX_TYPE(ASN1_TFLG_SEQUENCE_OF|ASN1_TFLG_OPTIONAL, 0, stname, field, type) | ||
| 321 | |||
| 322 | /* Same as above but for SET OF */ | ||
| 323 | |||
| 324 | #define ASN1_SET_OF(stname, field, type) \ | ||
| 325 | ASN1_EX_TYPE(ASN1_TFLG_SET_OF, 0, stname, field, type) | ||
| 326 | |||
| 327 | #define ASN1_SET_OF_OPT(stname, field, type) \ | ||
| 328 | ASN1_EX_TYPE(ASN1_TFLG_SET_OF|ASN1_TFLG_OPTIONAL, 0, stname, field, type) | ||
| 329 | |||
| 330 | /* Finally compound types of SEQUENCE, SET, IMPLICIT, EXPLICIT and OPTIONAL */ | ||
| 331 | |||
| 332 | #define ASN1_IMP_SET_OF(stname, field, type, tag) \ | ||
| 333 | ASN1_IMP_EX(stname, field, type, tag, ASN1_TFLG_SET_OF) | ||
| 334 | |||
| 335 | #define ASN1_EXP_SET_OF(stname, field, type, tag) \ | ||
| 336 | ASN1_EXP_EX(stname, field, type, tag, ASN1_TFLG_SET_OF) | ||
| 337 | |||
| 338 | #define ASN1_IMP_SET_OF_OPT(stname, field, type, tag) \ | ||
| 339 | ASN1_IMP_EX(stname, field, type, tag, ASN1_TFLG_SET_OF|ASN1_TFLG_OPTIONAL) | ||
| 340 | |||
| 341 | #define ASN1_EXP_SET_OF_OPT(stname, field, type, tag) \ | ||
| 342 | ASN1_EXP_EX(stname, field, type, tag, ASN1_TFLG_SET_OF|ASN1_TFLG_OPTIONAL) | ||
| 343 | |||
| 344 | #define ASN1_IMP_SEQUENCE_OF(stname, field, type, tag) \ | ||
| 345 | ASN1_IMP_EX(stname, field, type, tag, ASN1_TFLG_SEQUENCE_OF) | ||
| 346 | |||
| 347 | #define ASN1_IMP_SEQUENCE_OF_OPT(stname, field, type, tag) \ | ||
| 348 | ASN1_IMP_EX(stname, field, type, tag, ASN1_TFLG_SEQUENCE_OF|ASN1_TFLG_OPTIONAL) | ||
| 349 | |||
| 350 | #define ASN1_EXP_SEQUENCE_OF(stname, field, type, tag) \ | ||
| 351 | ASN1_EXP_EX(stname, field, type, tag, ASN1_TFLG_SEQUENCE_OF) | ||
| 352 | |||
| 353 | #define ASN1_EXP_SEQUENCE_OF_OPT(stname, field, type, tag) \ | ||
| 354 | ASN1_EXP_EX(stname, field, type, tag, ASN1_TFLG_SEQUENCE_OF|ASN1_TFLG_OPTIONAL) | ||
| 355 | |||
| 356 | /* Macros for the ASN1_ADB structure */ | ||
| 357 | |||
| 358 | #define ASN1_ADB(name) \ | ||
| 359 | const static ASN1_ADB_TABLE name##_adbtbl[] | ||
| 360 | |||
| 361 | #ifndef OPENSSL_EXPORT_VAR_AS_FUNCTION | ||
| 362 | |||
| 363 | #define ASN1_ADB_END(name, flags, field, app_table, def, none) \ | ||
| 364 | ;\ | ||
| 365 | const static ASN1_ADB name##_adb = {\ | ||
| 366 | flags,\ | ||
| 367 | offsetof(name, field),\ | ||
| 368 | app_table,\ | ||
| 369 | name##_adbtbl,\ | ||
| 370 | sizeof(name##_adbtbl) / sizeof(ASN1_ADB_TABLE),\ | ||
| 371 | def,\ | ||
| 372 | none\ | ||
| 373 | } | ||
| 374 | |||
| 375 | #else | ||
| 376 | |||
| 377 | #define ASN1_ADB_END(name, flags, field, app_table, def, none) \ | ||
| 378 | ;\ | ||
| 379 | const static ASN1_ITEM *name##_adb(void) \ | ||
| 380 | { \ | ||
| 381 | const static ASN1_ADB internal_adb = \ | ||
| 382 | {\ | ||
| 383 | flags,\ | ||
| 384 | offsetof(name, field),\ | ||
| 385 | app_table,\ | ||
| 386 | name##_adbtbl,\ | ||
| 387 | sizeof(name##_adbtbl) / sizeof(ASN1_ADB_TABLE),\ | ||
| 388 | def,\ | ||
| 389 | none\ | ||
| 390 | }; \ | ||
| 391 | return (const ASN1_ITEM *) &internal_adb; \ | ||
| 392 | } \ | ||
| 393 | void dummy_function(void) | ||
| 394 | |||
| 395 | #endif | ||
| 396 | |||
| 397 | #define ADB_ENTRY(val, template) {val, template} | ||
| 398 | |||
| 399 | #define ASN1_ADB_TEMPLATE(name) \ | ||
| 400 | const static ASN1_TEMPLATE name##_tt | ||
| 401 | |||
| 402 | /* This is the ASN1 template structure that defines | ||
| 403 | * a wrapper round the actual type. It determines the | ||
| 404 | * actual position of the field in the value structure, | ||
| 405 | * various flags such as OPTIONAL and the field name. | ||
| 406 | */ | ||
| 407 | |||
| 408 | struct ASN1_TEMPLATE_st { | ||
| 409 | unsigned long flags; /* Various flags */ | ||
| 410 | long tag; /* tag, not used if no tagging */ | ||
| 411 | unsigned long offset; /* Offset of this field in structure */ | ||
| 412 | #ifndef NO_ASN1_FIELD_NAMES | ||
| 413 | char *field_name; /* Field name */ | ||
| 414 | #endif | ||
| 415 | ASN1_ITEM_EXP *item; /* Relevant ASN1_ITEM or ASN1_ADB */ | ||
| 416 | }; | ||
| 417 | |||
| 418 | /* Macro to extract ASN1_ITEM and ASN1_ADB pointer from ASN1_TEMPLATE */ | ||
| 419 | |||
| 420 | #define ASN1_TEMPLATE_item(t) (t->item_ptr) | ||
| 421 | #define ASN1_TEMPLATE_adb(t) (t->item_ptr) | ||
| 422 | |||
| 423 | typedef struct ASN1_ADB_TABLE_st ASN1_ADB_TABLE; | ||
| 424 | typedef struct ASN1_ADB_st ASN1_ADB; | ||
| 425 | |||
| 426 | struct ASN1_ADB_st { | ||
| 427 | unsigned long flags; /* Various flags */ | ||
| 428 | unsigned long offset; /* Offset of selector field */ | ||
| 429 | STACK_OF(ASN1_ADB_TABLE) **app_items; /* Application defined items */ | ||
| 430 | const ASN1_ADB_TABLE *tbl; /* Table of possible types */ | ||
| 431 | long tblcount; /* Number of entries in tbl */ | ||
| 432 | const ASN1_TEMPLATE *default_tt; /* Type to use if no match */ | ||
| 433 | const ASN1_TEMPLATE *null_tt; /* Type to use if selector is NULL */ | ||
| 434 | }; | ||
| 435 | |||
| 436 | struct ASN1_ADB_TABLE_st { | ||
| 437 | long value; /* NID for an object or value for an int */ | ||
| 438 | const ASN1_TEMPLATE tt; /* item for this value */ | ||
| 439 | }; | ||
| 440 | |||
| 441 | /* template flags */ | ||
| 442 | |||
| 443 | /* Field is optional */ | ||
| 444 | #define ASN1_TFLG_OPTIONAL (0x1) | ||
| 445 | |||
| 446 | /* Field is a SET OF */ | ||
| 447 | #define ASN1_TFLG_SET_OF (0x1 << 1) | ||
| 448 | |||
| 449 | /* Field is a SEQUENCE OF */ | ||
| 450 | #define ASN1_TFLG_SEQUENCE_OF (0x2 << 1) | ||
| 451 | |||
| 452 | /* Special case: this refers to a SET OF that | ||
| 453 | * will be sorted into DER order when encoded *and* | ||
| 454 | * the corresponding STACK will be modified to match | ||
| 455 | * the new order. | ||
| 456 | */ | ||
| 457 | #define ASN1_TFLG_SET_ORDER (0x3 << 1) | ||
| 458 | |||
| 459 | /* Mask for SET OF or SEQUENCE OF */ | ||
| 460 | #define ASN1_TFLG_SK_MASK (0x3 << 1) | ||
| 461 | |||
| 462 | /* These flags mean the tag should be taken from the | ||
| 463 | * tag field. If EXPLICIT then the underlying type | ||
| 464 | * is used for the inner tag. | ||
| 465 | */ | ||
| 466 | |||
| 467 | /* IMPLICIT tagging */ | ||
| 468 | #define ASN1_TFLG_IMPTAG (0x1 << 3) | ||
| 469 | |||
| 470 | |||
| 471 | /* EXPLICIT tagging, inner tag from underlying type */ | ||
| 472 | #define ASN1_TFLG_EXPTAG (0x2 << 3) | ||
| 473 | |||
| 474 | #define ASN1_TFLG_TAG_MASK (0x3 << 3) | ||
| 475 | |||
| 476 | /* context specific IMPLICIT */ | ||
| 477 | #define ASN1_TFLG_IMPLICIT ASN1_TFLG_IMPTAG|ASN1_TFLG_CONTEXT | ||
| 478 | |||
| 479 | /* context specific EXPLICIT */ | ||
| 480 | #define ASN1_TFLG_EXPLICIT ASN1_TFLG_EXPTAG|ASN1_TFLG_CONTEXT | ||
| 481 | |||
| 482 | /* If tagging is in force these determine the | ||
| 483 | * type of tag to use. Otherwise the tag is | ||
| 484 | * determined by the underlying type. These | ||
| 485 | * values reflect the actual octet format. | ||
| 486 | */ | ||
| 487 | |||
| 488 | /* Universal tag */ | ||
| 489 | #define ASN1_TFLG_UNIVERSAL (0x0<<6) | ||
| 490 | /* Application tag */ | ||
| 491 | #define ASN1_TFLG_APPLICATION (0x1<<6) | ||
| 492 | /* Context specific tag */ | ||
| 493 | #define ASN1_TFLG_CONTEXT (0x2<<6) | ||
| 494 | /* Private tag */ | ||
| 495 | #define ASN1_TFLG_PRIVATE (0x3<<6) | ||
| 496 | |||
| 497 | #define ASN1_TFLG_TAG_CLASS (0x3<<6) | ||
| 498 | |||
| 499 | /* These are for ANY DEFINED BY type. In this case | ||
| 500 | * the 'item' field points to an ASN1_ADB structure | ||
| 501 | * which contains a table of values to decode the | ||
| 502 | * relevant type | ||
| 503 | */ | ||
| 504 | |||
| 505 | #define ASN1_TFLG_ADB_MASK (0x3<<8) | ||
| 506 | |||
| 507 | #define ASN1_TFLG_ADB_OID (0x1<<8) | ||
| 508 | |||
| 509 | #define ASN1_TFLG_ADB_INT (0x1<<9) | ||
| 510 | |||
| 511 | /* This flag means a parent structure is passed | ||
| 512 | * instead of the field: this is useful is a | ||
| 513 | * SEQUENCE is being combined with a CHOICE for | ||
| 514 | * example. Since this means the structure and | ||
| 515 | * item name will differ we need to use the | ||
| 516 | * ASN1_CHOICE_END_name() macro for example. | ||
| 517 | */ | ||
| 518 | |||
| 519 | #define ASN1_TFLG_COMBINE (0x1<<10) | ||
| 520 | |||
| 521 | /* This is the actual ASN1 item itself */ | ||
| 522 | |||
| 523 | struct ASN1_ITEM_st { | ||
| 524 | char itype; /* The item type, primitive, SEQUENCE, CHOICE or extern */ | ||
| 525 | long utype; /* underlying type */ | ||
| 526 | const ASN1_TEMPLATE *templates; /* If SEQUENCE or CHOICE this contains the contents */ | ||
| 527 | long tcount; /* Number of templates if SEQUENCE or CHOICE */ | ||
| 528 | const void *funcs; /* functions that handle this type */ | ||
| 529 | long size; /* Structure size (usually)*/ | ||
| 530 | #ifndef NO_ASN1_FIELD_NAMES | ||
| 531 | const char *sname; /* Structure name */ | ||
| 532 | #endif | ||
| 533 | }; | ||
| 534 | |||
| 535 | /* These are values for the itype field and | ||
| 536 | * determine how the type is interpreted. | ||
| 537 | * | ||
| 538 | * For PRIMITIVE types the underlying type | ||
| 539 | * determines the behaviour if items is NULL. | ||
| 540 | * | ||
| 541 | * Otherwise templates must contain a single | ||
| 542 | * template and the type is treated in the | ||
| 543 | * same way as the type specified in the template. | ||
| 544 | * | ||
| 545 | * For SEQUENCE types the templates field points | ||
| 546 | * to the members, the size field is the | ||
| 547 | * structure size. | ||
| 548 | * | ||
| 549 | * For CHOICE types the templates field points | ||
| 550 | * to each possible member (typically a union) | ||
| 551 | * and the 'size' field is the offset of the | ||
| 552 | * selector. | ||
| 553 | * | ||
| 554 | * The 'funcs' field is used for application | ||
| 555 | * specific functions. | ||
| 556 | * | ||
| 557 | * For COMPAT types the funcs field gives a | ||
| 558 | * set of functions that handle this type, this | ||
| 559 | * supports the old d2i, i2d convention. | ||
| 560 | * | ||
| 561 | * The EXTERN type uses a new style d2i/i2d. | ||
| 562 | * The new style should be used where possible | ||
| 563 | * because it avoids things like the d2i IMPLICIT | ||
| 564 | * hack. | ||
| 565 | * | ||
| 566 | * MSTRING is a multiple string type, it is used | ||
| 567 | * for a CHOICE of character strings where the | ||
| 568 | * actual strings all occupy an ASN1_STRING | ||
| 569 | * structure. In this case the 'utype' field | ||
| 570 | * has a special meaning, it is used as a mask | ||
| 571 | * of acceptable types using the B_ASN1 constants. | ||
| 572 | * | ||
| 573 | */ | ||
| 574 | |||
| 575 | #define ASN1_ITYPE_PRIMITIVE 0x0 | ||
| 576 | |||
| 577 | #define ASN1_ITYPE_SEQUENCE 0x1 | ||
| 578 | |||
| 579 | #define ASN1_ITYPE_CHOICE 0x2 | ||
| 580 | |||
| 581 | #define ASN1_ITYPE_COMPAT 0x3 | ||
| 582 | |||
| 583 | #define ASN1_ITYPE_EXTERN 0x4 | ||
| 584 | |||
| 585 | #define ASN1_ITYPE_MSTRING 0x5 | ||
| 586 | |||
| 587 | /* Cache for ASN1 tag and length, so we | ||
| 588 | * don't keep re-reading it for things | ||
| 589 | * like CHOICE | ||
| 590 | */ | ||
| 591 | |||
| 592 | struct ASN1_TLC_st{ | ||
| 593 | char valid; /* Values below are valid */ | ||
| 594 | int ret; /* return value */ | ||
| 595 | long plen; /* length */ | ||
| 596 | int ptag; /* class value */ | ||
| 597 | int pclass; /* class value */ | ||
| 598 | int hdrlen; /* header length */ | ||
| 599 | }; | ||
| 600 | |||
| 601 | /* Typedefs for ASN1 function pointers */ | ||
| 602 | |||
| 603 | typedef ASN1_VALUE * ASN1_new_func(void); | ||
| 604 | typedef void ASN1_free_func(ASN1_VALUE *a); | ||
| 605 | typedef ASN1_VALUE * ASN1_d2i_func(ASN1_VALUE **a, unsigned char ** in, long length); | ||
| 606 | typedef int ASN1_i2d_func(ASN1_VALUE * a, unsigned char **in); | ||
| 607 | |||
| 608 | typedef int ASN1_ex_d2i(ASN1_VALUE **pval, unsigned char **in, long len, const ASN1_ITEM *it, | ||
| 609 | int tag, int aclass, char opt, ASN1_TLC *ctx); | ||
| 610 | |||
| 611 | typedef int ASN1_ex_i2d(ASN1_VALUE **pval, unsigned char **out, const ASN1_ITEM *it, int tag, int aclass); | ||
| 612 | typedef int ASN1_ex_new_func(ASN1_VALUE **pval, const ASN1_ITEM *it); | ||
| 613 | typedef void ASN1_ex_free_func(ASN1_VALUE **pval, const ASN1_ITEM *it); | ||
| 614 | |||
| 615 | typedef int ASN1_primitive_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it); | ||
| 616 | typedef int ASN1_primitive_c2i(ASN1_VALUE **pval, unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it); | ||
| 617 | |||
| 618 | typedef struct ASN1_COMPAT_FUNCS_st { | ||
| 619 | ASN1_new_func *asn1_new; | ||
| 620 | ASN1_free_func *asn1_free; | ||
| 621 | ASN1_d2i_func *asn1_d2i; | ||
| 622 | ASN1_i2d_func *asn1_i2d; | ||
| 623 | } ASN1_COMPAT_FUNCS; | ||
| 624 | |||
| 625 | typedef struct ASN1_EXTERN_FUNCS_st { | ||
| 626 | void *app_data; | ||
| 627 | ASN1_ex_new_func *asn1_ex_new; | ||
| 628 | ASN1_ex_free_func *asn1_ex_free; | ||
| 629 | ASN1_ex_free_func *asn1_ex_clear; | ||
| 630 | ASN1_ex_d2i *asn1_ex_d2i; | ||
| 631 | ASN1_ex_i2d *asn1_ex_i2d; | ||
| 632 | } ASN1_EXTERN_FUNCS; | ||
| 633 | |||
| 634 | typedef struct ASN1_PRIMITIVE_FUNCS_st { | ||
| 635 | void *app_data; | ||
| 636 | unsigned long flags; | ||
| 637 | ASN1_ex_new_func *prim_new; | ||
| 638 | ASN1_ex_free_func *prim_free; | ||
| 639 | ASN1_ex_free_func *prim_clear; | ||
| 640 | ASN1_primitive_c2i *prim_c2i; | ||
| 641 | ASN1_primitive_i2c *prim_i2c; | ||
| 642 | } ASN1_PRIMITIVE_FUNCS; | ||
| 643 | |||
| 644 | /* This is the ASN1_AUX structure: it handles various | ||
| 645 | * miscellaneous requirements. For example the use of | ||
| 646 | * reference counts and an informational callback. | ||
| 647 | * | ||
| 648 | * The "informational callback" is called at various | ||
| 649 | * points during the ASN1 encoding and decoding. It can | ||
| 650 | * be used to provide minor customisation of the structures | ||
| 651 | * used. This is most useful where the supplied routines | ||
| 652 | * *almost* do the right thing but need some extra help | ||
| 653 | * at a few points. If the callback returns zero then | ||
| 654 | * it is assumed a fatal error has occurred and the | ||
| 655 | * main operation should be abandoned. | ||
| 656 | * | ||
| 657 | * If major changes in the default behaviour are required | ||
| 658 | * then an external type is more appropriate. | ||
| 659 | */ | ||
| 660 | |||
| 661 | typedef int ASN1_aux_cb(int operation, ASN1_VALUE **in, const ASN1_ITEM *it); | ||
| 662 | |||
| 663 | typedef struct ASN1_AUX_st { | ||
| 664 | void *app_data; | ||
| 665 | int flags; | ||
| 666 | int ref_offset; /* Offset of reference value */ | ||
| 667 | int ref_lock; /* Lock type to use */ | ||
| 668 | ASN1_aux_cb *asn1_cb; | ||
| 669 | int enc_offset; /* Offset of ASN1_ENCODING structure */ | ||
| 670 | } ASN1_AUX; | ||
| 671 | |||
| 672 | /* Flags in ASN1_AUX */ | ||
| 673 | |||
| 674 | /* Use a reference count */ | ||
| 675 | #define ASN1_AFLG_REFCOUNT 1 | ||
| 676 | /* Save the encoding of structure (useful for signatures) */ | ||
| 677 | #define ASN1_AFLG_ENCODING 2 | ||
| 678 | /* The Sequence length is invalid */ | ||
| 679 | #define ASN1_AFLG_BROKEN 4 | ||
| 680 | |||
| 681 | /* operation values for asn1_cb */ | ||
| 682 | |||
| 683 | #define ASN1_OP_NEW_PRE 0 | ||
| 684 | #define ASN1_OP_NEW_POST 1 | ||
| 685 | #define ASN1_OP_FREE_PRE 2 | ||
| 686 | #define ASN1_OP_FREE_POST 3 | ||
| 687 | #define ASN1_OP_D2I_PRE 4 | ||
| 688 | #define ASN1_OP_D2I_POST 5 | ||
| 689 | #define ASN1_OP_I2D_PRE 6 | ||
| 690 | #define ASN1_OP_I2D_POST 7 | ||
| 691 | |||
| 692 | /* Macro to implement a primitive type */ | ||
| 693 | #define IMPLEMENT_ASN1_TYPE(stname) IMPLEMENT_ASN1_TYPE_ex(stname, stname, 0) | ||
| 694 | #define IMPLEMENT_ASN1_TYPE_ex(itname, vname, ex) \ | ||
| 695 | ASN1_ITEM_start(itname) \ | ||
| 696 | ASN1_ITYPE_PRIMITIVE, V_##vname, NULL, 0, NULL, ex, #itname \ | ||
| 697 | ASN1_ITEM_end(itname) | ||
| 698 | |||
| 699 | /* Macro to implement a multi string type */ | ||
| 700 | #define IMPLEMENT_ASN1_MSTRING(itname, mask) \ | ||
| 701 | ASN1_ITEM_start(itname) \ | ||
| 702 | ASN1_ITYPE_MSTRING, mask, NULL, 0, NULL, sizeof(ASN1_STRING), #itname \ | ||
| 703 | ASN1_ITEM_end(itname) | ||
| 704 | |||
| 705 | /* Macro to implement an ASN1_ITEM in terms of old style funcs */ | ||
| 706 | |||
| 707 | #define IMPLEMENT_COMPAT_ASN1(sname) IMPLEMENT_COMPAT_ASN1_type(sname, V_ASN1_SEQUENCE) | ||
| 708 | |||
| 709 | #define IMPLEMENT_COMPAT_ASN1_type(sname, tag) \ | ||
| 710 | static const ASN1_COMPAT_FUNCS sname##_ff = { \ | ||
| 711 | (ASN1_new_func *)sname##_new, \ | ||
| 712 | (ASN1_free_func *)sname##_free, \ | ||
| 713 | (ASN1_d2i_func *)d2i_##sname, \ | ||
| 714 | (ASN1_i2d_func *)i2d_##sname, \ | ||
| 715 | }; \ | ||
| 716 | ASN1_ITEM_start(sname) \ | ||
| 717 | ASN1_ITYPE_COMPAT, \ | ||
| 718 | tag, \ | ||
| 719 | NULL, \ | ||
| 720 | 0, \ | ||
| 721 | &sname##_ff, \ | ||
| 722 | 0, \ | ||
| 723 | #sname \ | ||
| 724 | ASN1_ITEM_end(sname) | ||
| 725 | |||
| 726 | #define IMPLEMENT_EXTERN_ASN1(sname, tag, fptrs) \ | ||
| 727 | ASN1_ITEM_start(sname) \ | ||
| 728 | ASN1_ITYPE_EXTERN, \ | ||
| 729 | tag, \ | ||
| 730 | NULL, \ | ||
| 731 | 0, \ | ||
| 732 | &fptrs, \ | ||
| 733 | 0, \ | ||
| 734 | #sname \ | ||
| 735 | ASN1_ITEM_end(sname) | ||
| 736 | |||
| 737 | /* Macro to implement standard functions in terms of ASN1_ITEM structures */ | ||
| 738 | |||
| 739 | #define IMPLEMENT_ASN1_FUNCTIONS(stname) IMPLEMENT_ASN1_FUNCTIONS_fname(stname, stname, stname) | ||
| 740 | |||
| 741 | #define IMPLEMENT_ASN1_FUNCTIONS_name(stname, itname) IMPLEMENT_ASN1_FUNCTIONS_fname(stname, itname, itname) | ||
| 742 | |||
| 743 | #define IMPLEMENT_ASN1_FUNCTIONS_ENCODE_name(stname, itname) \ | ||
| 744 | IMPLEMENT_ASN1_FUNCTIONS_ENCODE_fname(stname, itname, itname) | ||
| 745 | |||
| 746 | #define IMPLEMENT_ASN1_ALLOC_FUNCTIONS_fname(stname, itname, fname) \ | ||
| 747 | stname *fname##_new(void) \ | ||
| 748 | { \ | ||
| 749 | return (stname *)ASN1_item_new(ASN1_ITEM_rptr(itname)); \ | ||
| 750 | } \ | ||
| 751 | void fname##_free(stname *a) \ | ||
| 752 | { \ | ||
| 753 | ASN1_item_free((ASN1_VALUE *)a, ASN1_ITEM_rptr(itname)); \ | ||
| 754 | } | ||
| 755 | |||
| 756 | #define IMPLEMENT_ASN1_FUNCTIONS_fname(stname, itname, fname) \ | ||
| 757 | IMPLEMENT_ASN1_ENCODE_FUNCTIONS_fname(stname, itname, fname) \ | ||
| 758 | IMPLEMENT_ASN1_ALLOC_FUNCTIONS_fname(stname, itname, fname) | ||
| 759 | |||
| 760 | #define IMPLEMENT_ASN1_ENCODE_FUNCTIONS_fname(stname, itname, fname) \ | ||
| 761 | stname *d2i_##fname(stname **a, unsigned char **in, long len) \ | ||
| 762 | { \ | ||
| 763 | return (stname *)ASN1_item_d2i((ASN1_VALUE **)a, in, len, ASN1_ITEM_rptr(itname));\ | ||
| 764 | } \ | ||
| 765 | int i2d_##fname(stname *a, unsigned char **out) \ | ||
| 766 | { \ | ||
| 767 | return ASN1_item_i2d((ASN1_VALUE *)a, out, ASN1_ITEM_rptr(itname));\ | ||
| 768 | } | ||
| 769 | |||
| 770 | /* This includes evil casts to remove const: they will go away when full | ||
| 771 | * ASN1 constification is done. | ||
| 772 | */ | ||
| 773 | #define IMPLEMENT_ASN1_ENCODE_FUNCTIONS_const_fname(stname, itname, fname) \ | ||
| 774 | stname *d2i_##fname(stname **a, const unsigned char **in, long len) \ | ||
| 775 | { \ | ||
| 776 | return (stname *)ASN1_item_d2i((ASN1_VALUE **)a, (unsigned char **)in, len, ASN1_ITEM_rptr(itname));\ | ||
| 777 | } \ | ||
| 778 | int i2d_##fname(const stname *a, unsigned char **out) \ | ||
| 779 | { \ | ||
| 780 | return ASN1_item_i2d((ASN1_VALUE *)a, out, ASN1_ITEM_rptr(itname));\ | ||
| 781 | } | ||
| 782 | |||
| 783 | #define IMPLEMENT_ASN1_DUP_FUNCTION(stname) \ | ||
| 784 | stname * stname##_dup(stname *x) \ | ||
| 785 | { \ | ||
| 786 | return ASN1_item_dup(ASN1_ITEM_rptr(stname), x); \ | ||
| 787 | } | ||
| 788 | |||
| 789 | #define IMPLEMENT_ASN1_FUNCTIONS_const(name) \ | ||
| 790 | IMPLEMENT_ASN1_FUNCTIONS_const_fname(name, name, name) | ||
| 791 | |||
| 792 | #define IMPLEMENT_ASN1_FUNCTIONS_const_fname(stname, itname, fname) \ | ||
| 793 | IMPLEMENT_ASN1_ENCODE_FUNCTIONS_const_fname(stname, itname, fname) \ | ||
| 794 | IMPLEMENT_ASN1_ALLOC_FUNCTIONS_fname(stname, itname, fname) | ||
| 795 | |||
| 796 | /* external definitions for primitive types */ | ||
| 797 | |||
| 798 | DECLARE_ASN1_ITEM(ASN1_BOOLEAN) | ||
| 799 | DECLARE_ASN1_ITEM(ASN1_TBOOLEAN) | ||
| 800 | DECLARE_ASN1_ITEM(ASN1_FBOOLEAN) | ||
| 801 | DECLARE_ASN1_ITEM(ASN1_ANY) | ||
| 802 | DECLARE_ASN1_ITEM(ASN1_SEQUENCE) | ||
| 803 | DECLARE_ASN1_ITEM(CBIGNUM) | ||
| 804 | DECLARE_ASN1_ITEM(BIGNUM) | ||
| 805 | DECLARE_ASN1_ITEM(LONG) | ||
| 806 | DECLARE_ASN1_ITEM(ZLONG) | ||
| 807 | |||
| 808 | DECLARE_STACK_OF(ASN1_VALUE) | ||
| 809 | |||
| 810 | /* Functions used internally by the ASN1 code */ | ||
| 811 | |||
| 812 | int ASN1_item_ex_new(ASN1_VALUE **pval, const ASN1_ITEM *it); | ||
| 813 | void ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it); | ||
| 814 | int ASN1_template_new(ASN1_VALUE **pval, const ASN1_TEMPLATE *tt); | ||
| 815 | int ASN1_primitive_new(ASN1_VALUE **pval, const ASN1_ITEM *it); | ||
| 816 | |||
| 817 | void ASN1_template_free(ASN1_VALUE **pval, const ASN1_TEMPLATE *tt); | ||
| 818 | int ASN1_template_d2i(ASN1_VALUE **pval, unsigned char **in, long len, const ASN1_TEMPLATE *tt); | ||
| 819 | int ASN1_item_ex_d2i(ASN1_VALUE **pval, unsigned char **in, long len, const ASN1_ITEM *it, | ||
| 820 | int tag, int aclass, char opt, ASN1_TLC *ctx); | ||
| 821 | |||
| 822 | int ASN1_item_ex_i2d(ASN1_VALUE **pval, unsigned char **out, const ASN1_ITEM *it, int tag, int aclass); | ||
| 823 | int ASN1_template_i2d(ASN1_VALUE **pval, unsigned char **out, const ASN1_TEMPLATE *tt); | ||
| 824 | void ASN1_primitive_free(ASN1_VALUE **pval, const ASN1_ITEM *it); | ||
| 825 | |||
| 826 | int asn1_ex_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it); | ||
| 827 | int asn1_ex_c2i(ASN1_VALUE **pval, unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it); | ||
| 828 | |||
| 829 | int asn1_get_choice_selector(ASN1_VALUE **pval, const ASN1_ITEM *it); | ||
| 830 | int asn1_set_choice_selector(ASN1_VALUE **pval, int value, const ASN1_ITEM *it); | ||
| 831 | |||
| 832 | ASN1_VALUE ** asn1_get_field_ptr(ASN1_VALUE **pval, const ASN1_TEMPLATE *tt); | ||
| 833 | |||
| 834 | const ASN1_TEMPLATE *asn1_do_adb(ASN1_VALUE **pval, const ASN1_TEMPLATE *tt, int nullerr); | ||
| 835 | |||
| 836 | int asn1_do_lock(ASN1_VALUE **pval, int op, const ASN1_ITEM *it); | ||
| 837 | |||
| 838 | void asn1_enc_init(ASN1_VALUE **pval, const ASN1_ITEM *it); | ||
| 839 | void asn1_enc_free(ASN1_VALUE **pval, const ASN1_ITEM *it); | ||
| 840 | int asn1_enc_restore(int *len, unsigned char **out, ASN1_VALUE **pval, const ASN1_ITEM *it); | ||
| 841 | int asn1_enc_save(ASN1_VALUE **pval, unsigned char *in, int inlen, const ASN1_ITEM *it); | ||
| 842 | |||
| 843 | #ifdef __cplusplus | ||
| 844 | } | ||
| 845 | #endif | ||
| 846 | #endif | ||
diff --git a/src/lib/libcrypto/asn1/asn_moid.c b/src/lib/libcrypto/asn1/asn_moid.c new file mode 100644 index 0000000000..be20db4bad --- /dev/null +++ b/src/lib/libcrypto/asn1/asn_moid.c | |||
| @@ -0,0 +1,95 @@ | |||
| 1 | /* asn_moid.c */ | ||
| 2 | /* Written by Stephen Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 2001. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 2001 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | #include <stdio.h> | ||
| 60 | #include <openssl/crypto.h> | ||
| 61 | #include "cryptlib.h" | ||
| 62 | #include <openssl/conf.h> | ||
| 63 | #include <openssl/dso.h> | ||
| 64 | #include <openssl/x509.h> | ||
| 65 | |||
| 66 | /* Simple ASN1 OID module: add all objects in a given section */ | ||
| 67 | |||
| 68 | static int oid_module_init(CONF_IMODULE *md, const CONF *cnf) | ||
| 69 | { | ||
| 70 | int i; | ||
| 71 | const char *oid_section; | ||
| 72 | STACK_OF(CONF_VALUE) *sktmp; | ||
| 73 | CONF_VALUE *oval; | ||
| 74 | oid_section = CONF_imodule_get_value(md); | ||
| 75 | if(!(sktmp = NCONF_get_section(cnf, oid_section))) | ||
| 76 | { | ||
| 77 | ASN1err(ASN1_F_OID_MODULE_INIT, ASN1_R_ERROR_LOADING_SECTION); | ||
| 78 | return 0; | ||
| 79 | } | ||
| 80 | for(i = 0; i < sk_CONF_VALUE_num(sktmp); i++) | ||
| 81 | { | ||
| 82 | oval = sk_CONF_VALUE_value(sktmp, i); | ||
| 83 | if(OBJ_create(oval->value, oval->name, oval->name) == NID_undef) | ||
| 84 | { | ||
| 85 | ASN1err(ASN1_F_OID_MODULE_INIT, ASN1_R_ADDING_OBJECT); | ||
| 86 | return 0; | ||
| 87 | } | ||
| 88 | } | ||
| 89 | return 1; | ||
| 90 | } | ||
| 91 | |||
| 92 | void ASN1_add_oid_module(void) | ||
| 93 | { | ||
| 94 | CONF_module_add("oid_section", oid_module_init, 0); | ||
| 95 | } | ||
diff --git a/src/lib/libcrypto/asn1/asn_pack.c b/src/lib/libcrypto/asn1/asn_pack.c new file mode 100644 index 0000000000..662a2626a1 --- /dev/null +++ b/src/lib/libcrypto/asn1/asn_pack.c | |||
| @@ -0,0 +1,145 @@ | |||
| 1 | /* asn_pack.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 1999. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 1999 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | #include <stdio.h> | ||
| 60 | #include "cryptlib.h" | ||
| 61 | #include <openssl/asn1.h> | ||
| 62 | |||
| 63 | /* ASN1 packing and unpacking functions */ | ||
| 64 | |||
| 65 | /* Turn an ASN1 encoded SEQUENCE OF into a STACK of structures */ | ||
| 66 | |||
| 67 | STACK *ASN1_seq_unpack(unsigned char *buf, int len, char *(*d2i)(), | ||
| 68 | void (*free_func)()) | ||
| 69 | { | ||
| 70 | STACK *sk; | ||
| 71 | unsigned char *pbuf; | ||
| 72 | pbuf = buf; | ||
| 73 | if (!(sk = d2i_ASN1_SET(NULL, &pbuf, len, d2i, free_func, | ||
| 74 | V_ASN1_SEQUENCE, V_ASN1_UNIVERSAL))) | ||
| 75 | ASN1err(ASN1_F_ASN1_SEQ_UNPACK,ASN1_R_DECODE_ERROR); | ||
| 76 | return sk; | ||
| 77 | } | ||
| 78 | |||
| 79 | /* Turn a STACK structures into an ASN1 encoded SEQUENCE OF structure in a | ||
| 80 | * Malloc'ed buffer | ||
| 81 | */ | ||
| 82 | |||
| 83 | unsigned char *ASN1_seq_pack(STACK *safes, int (*i2d)(), unsigned char **buf, | ||
| 84 | int *len) | ||
| 85 | { | ||
| 86 | int safelen; | ||
| 87 | unsigned char *safe, *p; | ||
| 88 | if (!(safelen = i2d_ASN1_SET(safes, NULL, i2d, V_ASN1_SEQUENCE, | ||
| 89 | V_ASN1_UNIVERSAL, IS_SEQUENCE))) { | ||
| 90 | ASN1err(ASN1_F_ASN1_SEQ_PACK,ASN1_R_ENCODE_ERROR); | ||
| 91 | return NULL; | ||
| 92 | } | ||
| 93 | if (!(safe = Malloc (safelen))) { | ||
| 94 | ASN1err(ASN1_F_ASN1_SEQ_PACK,ERR_R_MALLOC_FAILURE); | ||
| 95 | return NULL; | ||
| 96 | } | ||
| 97 | p = safe; | ||
| 98 | i2d_ASN1_SET(safes, &p, i2d, V_ASN1_SEQUENCE, V_ASN1_UNIVERSAL, | ||
| 99 | IS_SEQUENCE); | ||
| 100 | if (len) *len = safelen; | ||
| 101 | if (buf) *buf = safe; | ||
| 102 | return safe; | ||
| 103 | } | ||
| 104 | |||
| 105 | /* Extract an ASN1 object from an ASN1_STRING */ | ||
| 106 | |||
| 107 | void *ASN1_unpack_string (ASN1_STRING *oct, char *(*d2i)()) | ||
| 108 | { | ||
| 109 | unsigned char *p; | ||
| 110 | char *ret; | ||
| 111 | |||
| 112 | p = oct->data; | ||
| 113 | if(!(ret = d2i(NULL, &p, oct->length))) | ||
| 114 | ASN1err(ASN1_F_ASN1_UNPACK_STRING,ASN1_R_DECODE_ERROR); | ||
| 115 | return ret; | ||
| 116 | } | ||
| 117 | |||
| 118 | /* Pack an ASN1 object into an ASN1_STRING */ | ||
| 119 | |||
| 120 | ASN1_STRING *ASN1_pack_string (void *obj, int (*i2d)(), ASN1_STRING **oct) | ||
| 121 | { | ||
| 122 | unsigned char *p; | ||
| 123 | ASN1_STRING *octmp; | ||
| 124 | |||
| 125 | if (!oct || !*oct) { | ||
| 126 | if (!(octmp = ASN1_STRING_new ())) { | ||
| 127 | ASN1err(ASN1_F_ASN1_PACK_STRING,ERR_R_MALLOC_FAILURE); | ||
| 128 | return NULL; | ||
| 129 | } | ||
| 130 | if (oct) *oct = octmp; | ||
| 131 | } else octmp = *oct; | ||
| 132 | |||
| 133 | if (!(octmp->length = i2d(obj, NULL))) { | ||
| 134 | ASN1err(ASN1_F_ASN1_PACK_STRING,ASN1_R_ENCODE_ERROR); | ||
| 135 | return NULL; | ||
| 136 | } | ||
| 137 | if (!(p = Malloc (octmp->length))) { | ||
| 138 | ASN1err(ASN1_F_ASN1_PACK_STRING,ERR_R_MALLOC_FAILURE); | ||
| 139 | return NULL; | ||
| 140 | } | ||
| 141 | octmp->data = p; | ||
| 142 | i2d (obj, &p); | ||
| 143 | return octmp; | ||
| 144 | } | ||
| 145 | |||
diff --git a/src/lib/libcrypto/asn1/charmap.h b/src/lib/libcrypto/asn1/charmap.h new file mode 100644 index 0000000000..bd020a9562 --- /dev/null +++ b/src/lib/libcrypto/asn1/charmap.h | |||
| @@ -0,0 +1,15 @@ | |||
| 1 | /* Auto generated with chartype.pl script. | ||
| 2 | * Mask of various character properties | ||
| 3 | */ | ||
| 4 | |||
| 5 | static unsigned char char_type[] = { | ||
| 6 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | ||
| 7 | 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, | ||
| 8 | 120, 0, 1,40, 0, 0, 0,16,16,16, 0,25,25,16,16,16, | ||
| 9 | 16,16,16,16,16,16,16,16,16,16,16, 9, 9,16, 9,16, | ||
| 10 | 0,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16, | ||
| 11 | 16,16,16,16,16,16,16,16,16,16,16, 0, 1, 0, 0, 0, | ||
| 12 | 0,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16, | ||
| 13 | 16,16,16,16,16,16,16,16,16,16,16, 0, 0, 0, 0, 2 | ||
| 14 | }; | ||
| 15 | |||
diff --git a/src/lib/libcrypto/asn1/charmap.pl b/src/lib/libcrypto/asn1/charmap.pl new file mode 100644 index 0000000000..2875c59867 --- /dev/null +++ b/src/lib/libcrypto/asn1/charmap.pl | |||
| @@ -0,0 +1,80 @@ | |||
| 1 | #!/usr/local/bin/perl -w | ||
| 2 | |||
| 3 | use strict; | ||
| 4 | |||
| 5 | my ($i, @arr); | ||
| 6 | |||
| 7 | # Set up an array with the type of ASCII characters | ||
| 8 | # Each set bit represents a character property. | ||
| 9 | |||
| 10 | # RFC2253 character properties | ||
| 11 | my $RFC2253_ESC = 1; # Character escaped with \ | ||
| 12 | my $ESC_CTRL = 2; # Escaped control character | ||
| 13 | # These are used with RFC1779 quoting using " | ||
| 14 | my $NOESC_QUOTE = 8; # Not escaped if quoted | ||
| 15 | my $PSTRING_CHAR = 0x10; # Valid PrintableString character | ||
| 16 | my $RFC2253_FIRST_ESC = 0x20; # Escaped with \ if first character | ||
| 17 | my $RFC2253_LAST_ESC = 0x40; # Escaped with \ if last character | ||
| 18 | |||
| 19 | for($i = 0; $i < 128; $i++) { | ||
| 20 | # Set the RFC2253 escape characters (control) | ||
| 21 | $arr[$i] = 0; | ||
| 22 | if(($i < 32) || ($i > 126)) { | ||
| 23 | $arr[$i] |= $ESC_CTRL; | ||
| 24 | } | ||
| 25 | |||
| 26 | # Some PrintableString characters | ||
| 27 | if( ( ( $i >= ord("a")) && ( $i <= ord("z")) ) | ||
| 28 | || ( ( $i >= ord("A")) && ( $i <= ord("Z")) ) | ||
| 29 | || ( ( $i >= ord("0")) && ( $i <= ord("9")) ) ) { | ||
| 30 | $arr[$i] |= $PSTRING_CHAR; | ||
| 31 | } | ||
| 32 | } | ||
| 33 | |||
| 34 | # Now setup the rest | ||
| 35 | |||
| 36 | # Remaining RFC2253 escaped characters | ||
| 37 | |||
| 38 | $arr[ord(" ")] |= $NOESC_QUOTE | $RFC2253_FIRST_ESC | $RFC2253_LAST_ESC; | ||
| 39 | $arr[ord("#")] |= $NOESC_QUOTE | $RFC2253_FIRST_ESC; | ||
| 40 | |||
| 41 | $arr[ord(",")] |= $NOESC_QUOTE | $RFC2253_ESC; | ||
| 42 | $arr[ord("+")] |= $NOESC_QUOTE | $RFC2253_ESC; | ||
| 43 | $arr[ord("\"")] |= $RFC2253_ESC; | ||
| 44 | $arr[ord("\\")] |= $RFC2253_ESC; | ||
| 45 | $arr[ord("<")] |= $NOESC_QUOTE | $RFC2253_ESC; | ||
| 46 | $arr[ord(">")] |= $NOESC_QUOTE | $RFC2253_ESC; | ||
| 47 | $arr[ord(";")] |= $NOESC_QUOTE | $RFC2253_ESC; | ||
| 48 | |||
| 49 | # Remaining PrintableString characters | ||
| 50 | |||
| 51 | $arr[ord(" ")] |= $PSTRING_CHAR; | ||
| 52 | $arr[ord("'")] |= $PSTRING_CHAR; | ||
| 53 | $arr[ord("(")] |= $PSTRING_CHAR; | ||
| 54 | $arr[ord(")")] |= $PSTRING_CHAR; | ||
| 55 | $arr[ord("+")] |= $PSTRING_CHAR; | ||
| 56 | $arr[ord(",")] |= $PSTRING_CHAR; | ||
| 57 | $arr[ord("-")] |= $PSTRING_CHAR; | ||
| 58 | $arr[ord(".")] |= $PSTRING_CHAR; | ||
| 59 | $arr[ord("/")] |= $PSTRING_CHAR; | ||
| 60 | $arr[ord(":")] |= $PSTRING_CHAR; | ||
| 61 | $arr[ord("=")] |= $PSTRING_CHAR; | ||
| 62 | $arr[ord("?")] |= $PSTRING_CHAR; | ||
| 63 | |||
| 64 | # Now generate the C code | ||
| 65 | |||
| 66 | print <<EOF; | ||
| 67 | /* Auto generated with chartype.pl script. | ||
| 68 | * Mask of various character properties | ||
| 69 | */ | ||
| 70 | |||
| 71 | static unsigned char char_type[] = { | ||
| 72 | EOF | ||
| 73 | |||
| 74 | for($i = 0; $i < 128; $i++) { | ||
| 75 | print("\n") if($i && (($i % 16) == 0)); | ||
| 76 | printf("%2d", $arr[$i]); | ||
| 77 | print(",") if ($i != 127); | ||
| 78 | } | ||
| 79 | print("\n};\n\n"); | ||
| 80 | |||
diff --git a/src/lib/libcrypto/asn1/f_enum.c b/src/lib/libcrypto/asn1/f_enum.c new file mode 100644 index 0000000000..3bcceecdb8 --- /dev/null +++ b/src/lib/libcrypto/asn1/f_enum.c | |||
| @@ -0,0 +1,207 @@ | |||
| 1 | /* crypto/asn1/f_enum.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/buffer.h> | ||
| 62 | #include <openssl/asn1.h> | ||
| 63 | |||
| 64 | /* Based on a_int.c: equivalent ENUMERATED functions */ | ||
| 65 | |||
| 66 | int i2a_ASN1_ENUMERATED(BIO *bp, ASN1_ENUMERATED *a) | ||
| 67 | { | ||
| 68 | int i,n=0; | ||
| 69 | static const char *h="0123456789ABCDEF"; | ||
| 70 | char buf[2]; | ||
| 71 | |||
| 72 | if (a == NULL) return(0); | ||
| 73 | |||
| 74 | if (a->length == 0) | ||
| 75 | { | ||
| 76 | if (BIO_write(bp,"00",2) != 2) goto err; | ||
| 77 | n=2; | ||
| 78 | } | ||
| 79 | else | ||
| 80 | { | ||
| 81 | for (i=0; i<a->length; i++) | ||
| 82 | { | ||
| 83 | if ((i != 0) && (i%35 == 0)) | ||
| 84 | { | ||
| 85 | if (BIO_write(bp,"\\\n",2) != 2) goto err; | ||
| 86 | n+=2; | ||
| 87 | } | ||
| 88 | buf[0]=h[((unsigned char)a->data[i]>>4)&0x0f]; | ||
| 89 | buf[1]=h[((unsigned char)a->data[i] )&0x0f]; | ||
| 90 | if (BIO_write(bp,buf,2) != 2) goto err; | ||
| 91 | n+=2; | ||
| 92 | } | ||
| 93 | } | ||
| 94 | return(n); | ||
| 95 | err: | ||
| 96 | return(-1); | ||
| 97 | } | ||
| 98 | |||
| 99 | int a2i_ASN1_ENUMERATED(BIO *bp, ASN1_ENUMERATED *bs, char *buf, int size) | ||
| 100 | { | ||
| 101 | int ret=0; | ||
| 102 | int i,j,k,m,n,again,bufsize; | ||
| 103 | unsigned char *s=NULL,*sp; | ||
| 104 | unsigned char *bufp; | ||
| 105 | int num=0,slen=0,first=1; | ||
| 106 | |||
| 107 | bs->type=V_ASN1_ENUMERATED; | ||
| 108 | |||
| 109 | bufsize=BIO_gets(bp,buf,size); | ||
| 110 | for (;;) | ||
| 111 | { | ||
| 112 | if (bufsize < 1) goto err_sl; | ||
| 113 | i=bufsize; | ||
| 114 | if (buf[i-1] == '\n') buf[--i]='\0'; | ||
| 115 | if (i == 0) goto err_sl; | ||
| 116 | if (buf[i-1] == '\r') buf[--i]='\0'; | ||
| 117 | if (i == 0) goto err_sl; | ||
| 118 | again=(buf[i-1] == '\\'); | ||
| 119 | |||
| 120 | for (j=0; j<i; j++) | ||
| 121 | { | ||
| 122 | if (!( ((buf[j] >= '0') && (buf[j] <= '9')) || | ||
| 123 | ((buf[j] >= 'a') && (buf[j] <= 'f')) || | ||
| 124 | ((buf[j] >= 'A') && (buf[j] <= 'F')))) | ||
| 125 | { | ||
| 126 | i=j; | ||
| 127 | break; | ||
| 128 | } | ||
| 129 | } | ||
| 130 | buf[i]='\0'; | ||
| 131 | /* We have now cleared all the crap off the end of the | ||
| 132 | * line */ | ||
| 133 | if (i < 2) goto err_sl; | ||
| 134 | |||
| 135 | bufp=(unsigned char *)buf; | ||
| 136 | if (first) | ||
| 137 | { | ||
| 138 | first=0; | ||
| 139 | if ((bufp[0] == '0') && (buf[1] == '0')) | ||
| 140 | { | ||
| 141 | bufp+=2; | ||
| 142 | i-=2; | ||
| 143 | } | ||
| 144 | } | ||
| 145 | k=0; | ||
| 146 | i-=again; | ||
| 147 | if (i%2 != 0) | ||
| 148 | { | ||
| 149 | ASN1err(ASN1_F_A2I_ASN1_ENUMERATED,ASN1_R_ODD_NUMBER_OF_CHARS); | ||
| 150 | goto err; | ||
| 151 | } | ||
| 152 | i/=2; | ||
| 153 | if (num+i > slen) | ||
| 154 | { | ||
| 155 | if (s == NULL) | ||
| 156 | sp=(unsigned char *)Malloc( | ||
| 157 | (unsigned int)num+i*2); | ||
| 158 | else | ||
| 159 | sp=(unsigned char *)Realloc(s, | ||
| 160 | (unsigned int)num+i*2); | ||
| 161 | if (sp == NULL) | ||
| 162 | { | ||
| 163 | ASN1err(ASN1_F_A2I_ASN1_ENUMERATED,ERR_R_MALLOC_FAILURE); | ||
| 164 | if (s != NULL) Free((char *)s); | ||
| 165 | goto err; | ||
| 166 | } | ||
| 167 | s=sp; | ||
| 168 | slen=num+i*2; | ||
| 169 | } | ||
| 170 | for (j=0; j<i; j++,k+=2) | ||
| 171 | { | ||
| 172 | for (n=0; n<2; n++) | ||
| 173 | { | ||
| 174 | m=bufp[k+n]; | ||
| 175 | if ((m >= '0') && (m <= '9')) | ||
| 176 | m-='0'; | ||
| 177 | else if ((m >= 'a') && (m <= 'f')) | ||
| 178 | m=m-'a'+10; | ||
| 179 | else if ((m >= 'A') && (m <= 'F')) | ||
| 180 | m=m-'A'+10; | ||
| 181 | else | ||
| 182 | { | ||
| 183 | ASN1err(ASN1_F_A2I_ASN1_ENUMERATED,ASN1_R_NON_HEX_CHARACTERS); | ||
| 184 | goto err; | ||
| 185 | } | ||
| 186 | s[num+j]<<=4; | ||
| 187 | s[num+j]|=m; | ||
| 188 | } | ||
| 189 | } | ||
| 190 | num+=i; | ||
| 191 | if (again) | ||
| 192 | bufsize=BIO_gets(bp,buf,size); | ||
| 193 | else | ||
| 194 | break; | ||
| 195 | } | ||
| 196 | bs->length=num; | ||
| 197 | bs->data=s; | ||
| 198 | ret=1; | ||
| 199 | err: | ||
| 200 | if (0) | ||
| 201 | { | ||
| 202 | err_sl: | ||
| 203 | ASN1err(ASN1_F_A2I_ASN1_ENUMERATED,ASN1_R_SHORT_LINE); | ||
| 204 | } | ||
| 205 | return(ret); | ||
| 206 | } | ||
| 207 | |||
diff --git a/src/lib/libcrypto/asn1/nsseq.c b/src/lib/libcrypto/asn1/nsseq.c new file mode 100644 index 0000000000..417d024b81 --- /dev/null +++ b/src/lib/libcrypto/asn1/nsseq.c | |||
| @@ -0,0 +1,118 @@ | |||
| 1 | /* nsseq.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 1999. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 1999 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | #include <stdio.h> | ||
| 60 | #include <stdlib.h> | ||
| 61 | #include <openssl/asn1_mac.h> | ||
| 62 | #include <openssl/err.h> | ||
| 63 | #include <openssl/x509.h> | ||
| 64 | #include <openssl/objects.h> | ||
| 65 | |||
| 66 | /* Netscape certificate sequence structure */ | ||
| 67 | |||
| 68 | int i2d_NETSCAPE_CERT_SEQUENCE(NETSCAPE_CERT_SEQUENCE *a, unsigned char **pp) | ||
| 69 | { | ||
| 70 | int v = 0; | ||
| 71 | M_ASN1_I2D_vars(a); | ||
| 72 | M_ASN1_I2D_len (a->type, i2d_ASN1_OBJECT); | ||
| 73 | M_ASN1_I2D_len_EXP_SEQUENCE_opt_type(X509,a->certs,i2d_X509,0, | ||
| 74 | V_ASN1_SEQUENCE,v); | ||
| 75 | |||
| 76 | M_ASN1_I2D_seq_total(); | ||
| 77 | |||
| 78 | M_ASN1_I2D_put (a->type, i2d_ASN1_OBJECT); | ||
| 79 | M_ASN1_I2D_put_EXP_SEQUENCE_opt_type(X509,a->certs,i2d_X509,0, | ||
| 80 | V_ASN1_SEQUENCE,v); | ||
| 81 | |||
| 82 | M_ASN1_I2D_finish(); | ||
| 83 | } | ||
| 84 | |||
| 85 | NETSCAPE_CERT_SEQUENCE *NETSCAPE_CERT_SEQUENCE_new(void) | ||
| 86 | { | ||
| 87 | NETSCAPE_CERT_SEQUENCE *ret=NULL; | ||
| 88 | ASN1_CTX c; | ||
| 89 | M_ASN1_New_Malloc(ret, NETSCAPE_CERT_SEQUENCE); | ||
| 90 | /* Note hardcoded object type */ | ||
| 91 | ret->type = OBJ_nid2obj(NID_netscape_cert_sequence); | ||
| 92 | ret->certs = NULL; | ||
| 93 | return (ret); | ||
| 94 | M_ASN1_New_Error(ASN1_F_NETSCAPE_CERT_SEQUENCE_NEW); | ||
| 95 | } | ||
| 96 | |||
| 97 | NETSCAPE_CERT_SEQUENCE *d2i_NETSCAPE_CERT_SEQUENCE(NETSCAPE_CERT_SEQUENCE **a, | ||
| 98 | unsigned char **pp, long length) | ||
| 99 | { | ||
| 100 | M_ASN1_D2I_vars(a,NETSCAPE_CERT_SEQUENCE *, | ||
| 101 | NETSCAPE_CERT_SEQUENCE_new); | ||
| 102 | M_ASN1_D2I_Init(); | ||
| 103 | M_ASN1_D2I_start_sequence(); | ||
| 104 | M_ASN1_D2I_get (ret->type, d2i_ASN1_OBJECT); | ||
| 105 | M_ASN1_D2I_get_EXP_set_opt_type(X509,ret->certs,d2i_X509,X509_free,0, | ||
| 106 | V_ASN1_SEQUENCE); | ||
| 107 | M_ASN1_D2I_Finish(a, NETSCAPE_CERT_SEQUENCE_free, | ||
| 108 | ASN1_F_D2I_NETSCAPE_CERT_SEQUENCE); | ||
| 109 | } | ||
| 110 | |||
| 111 | void NETSCAPE_CERT_SEQUENCE_free (NETSCAPE_CERT_SEQUENCE *a) | ||
| 112 | { | ||
| 113 | if (a == NULL) return; | ||
| 114 | ASN1_OBJECT_free(a->type); | ||
| 115 | if(a->certs) | ||
| 116 | sk_X509_pop_free(a->certs, X509_free); | ||
| 117 | Free (a); | ||
| 118 | } | ||
diff --git a/src/lib/libcrypto/asn1/p5_pbe.c b/src/lib/libcrypto/asn1/p5_pbe.c new file mode 100644 index 0000000000..b831836e7b --- /dev/null +++ b/src/lib/libcrypto/asn1/p5_pbe.c | |||
| @@ -0,0 +1,156 @@ | |||
| 1 | /* p5_pbe.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 1999. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 1999 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | #include <stdio.h> | ||
| 60 | #include "cryptlib.h" | ||
| 61 | #include <openssl/asn1_mac.h> | ||
| 62 | #include <openssl/x509.h> | ||
| 63 | #include <openssl/rand.h> | ||
| 64 | |||
| 65 | /* PKCS#5 password based encryption structure */ | ||
| 66 | |||
| 67 | int i2d_PBEPARAM(PBEPARAM *a, unsigned char **pp) | ||
| 68 | { | ||
| 69 | M_ASN1_I2D_vars(a); | ||
| 70 | M_ASN1_I2D_len (a->salt, i2d_ASN1_OCTET_STRING); | ||
| 71 | M_ASN1_I2D_len (a->iter, i2d_ASN1_INTEGER); | ||
| 72 | |||
| 73 | M_ASN1_I2D_seq_total (); | ||
| 74 | |||
| 75 | M_ASN1_I2D_put (a->salt, i2d_ASN1_OCTET_STRING); | ||
| 76 | M_ASN1_I2D_put (a->iter, i2d_ASN1_INTEGER); | ||
| 77 | M_ASN1_I2D_finish(); | ||
| 78 | } | ||
| 79 | |||
| 80 | PBEPARAM *PBEPARAM_new(void) | ||
| 81 | { | ||
| 82 | PBEPARAM *ret=NULL; | ||
| 83 | ASN1_CTX c; | ||
| 84 | M_ASN1_New_Malloc(ret, PBEPARAM); | ||
| 85 | M_ASN1_New(ret->iter,ASN1_INTEGER_new); | ||
| 86 | M_ASN1_New(ret->salt,ASN1_OCTET_STRING_new); | ||
| 87 | return (ret); | ||
| 88 | M_ASN1_New_Error(ASN1_F_PBEPARAM_NEW); | ||
| 89 | } | ||
| 90 | |||
| 91 | PBEPARAM *d2i_PBEPARAM(PBEPARAM **a, unsigned char **pp, long length) | ||
| 92 | { | ||
| 93 | M_ASN1_D2I_vars(a,PBEPARAM *,PBEPARAM_new); | ||
| 94 | M_ASN1_D2I_Init(); | ||
| 95 | M_ASN1_D2I_start_sequence(); | ||
| 96 | M_ASN1_D2I_get (ret->salt, d2i_ASN1_OCTET_STRING); | ||
| 97 | M_ASN1_D2I_get (ret->iter, d2i_ASN1_INTEGER); | ||
| 98 | M_ASN1_D2I_Finish(a, PBEPARAM_free, ASN1_F_D2I_PBEPARAM); | ||
| 99 | } | ||
| 100 | |||
| 101 | void PBEPARAM_free (PBEPARAM *a) | ||
| 102 | { | ||
| 103 | if(a==NULL) return; | ||
| 104 | ASN1_OCTET_STRING_free(a->salt); | ||
| 105 | ASN1_INTEGER_free (a->iter); | ||
| 106 | Free ((char *)a); | ||
| 107 | } | ||
| 108 | |||
| 109 | /* Return an algorithm identifier for a PKCS#5 PBE algorithm */ | ||
| 110 | |||
| 111 | X509_ALGOR *PKCS5_pbe_set(int alg, int iter, unsigned char *salt, | ||
| 112 | int saltlen) | ||
| 113 | { | ||
| 114 | PBEPARAM *pbe; | ||
| 115 | ASN1_OBJECT *al; | ||
| 116 | X509_ALGOR *algor; | ||
| 117 | ASN1_TYPE *astype; | ||
| 118 | |||
| 119 | if (!(pbe = PBEPARAM_new ())) { | ||
| 120 | ASN1err(ASN1_F_ASN1_PBE_SET,ERR_R_MALLOC_FAILURE); | ||
| 121 | return NULL; | ||
| 122 | } | ||
| 123 | if(iter <= 0) iter = PKCS5_DEFAULT_ITER; | ||
| 124 | ASN1_INTEGER_set (pbe->iter, iter); | ||
| 125 | if (!saltlen) saltlen = PKCS5_SALT_LEN; | ||
| 126 | if (!(pbe->salt->data = Malloc (saltlen))) { | ||
| 127 | ASN1err(ASN1_F_ASN1_PBE_SET,ERR_R_MALLOC_FAILURE); | ||
| 128 | return NULL; | ||
| 129 | } | ||
| 130 | pbe->salt->length = saltlen; | ||
| 131 | if (salt) memcpy (pbe->salt->data, salt, saltlen); | ||
| 132 | else RAND_bytes (pbe->salt->data, saltlen); | ||
| 133 | |||
| 134 | if (!(astype = ASN1_TYPE_new())) { | ||
| 135 | ASN1err(ASN1_F_ASN1_PBE_SET,ERR_R_MALLOC_FAILURE); | ||
| 136 | return NULL; | ||
| 137 | } | ||
| 138 | |||
| 139 | astype->type = V_ASN1_SEQUENCE; | ||
| 140 | if(!ASN1_pack_string(pbe, i2d_PBEPARAM, &astype->value.sequence)) { | ||
| 141 | ASN1err(ASN1_F_ASN1_PBE_SET,ERR_R_MALLOC_FAILURE); | ||
| 142 | return NULL; | ||
| 143 | } | ||
| 144 | PBEPARAM_free (pbe); | ||
| 145 | |||
| 146 | al = OBJ_nid2obj(alg); /* never need to free al */ | ||
| 147 | if (!(algor = X509_ALGOR_new())) { | ||
| 148 | ASN1err(ASN1_F_ASN1_PBE_SET,ERR_R_MALLOC_FAILURE); | ||
| 149 | return NULL; | ||
| 150 | } | ||
| 151 | ASN1_OBJECT_free(algor->algorithm); | ||
| 152 | algor->algorithm = al; | ||
| 153 | algor->parameter = astype; | ||
| 154 | |||
| 155 | return (algor); | ||
| 156 | } | ||
diff --git a/src/lib/libcrypto/asn1/p5_pbev2.c b/src/lib/libcrypto/asn1/p5_pbev2.c new file mode 100644 index 0000000000..09f4bf6112 --- /dev/null +++ b/src/lib/libcrypto/asn1/p5_pbev2.c | |||
| @@ -0,0 +1,274 @@ | |||
| 1 | /* p5_pbev2.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 1999. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 1999 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | #include <stdio.h> | ||
| 60 | #include "cryptlib.h" | ||
| 61 | #include <openssl/asn1_mac.h> | ||
| 62 | #include <openssl/x509.h> | ||
| 63 | #include <openssl/rand.h> | ||
| 64 | |||
| 65 | /* PKCS#5 v2.0 password based encryption structures */ | ||
| 66 | |||
| 67 | int i2d_PBE2PARAM(PBE2PARAM *a, unsigned char **pp) | ||
| 68 | { | ||
| 69 | M_ASN1_I2D_vars(a); | ||
| 70 | M_ASN1_I2D_len (a->keyfunc, i2d_X509_ALGOR); | ||
| 71 | M_ASN1_I2D_len (a->encryption, i2d_X509_ALGOR); | ||
| 72 | |||
| 73 | M_ASN1_I2D_seq_total (); | ||
| 74 | |||
| 75 | M_ASN1_I2D_put (a->keyfunc, i2d_X509_ALGOR); | ||
| 76 | M_ASN1_I2D_put (a->encryption, i2d_X509_ALGOR); | ||
| 77 | |||
| 78 | M_ASN1_I2D_finish(); | ||
| 79 | } | ||
| 80 | |||
| 81 | PBE2PARAM *PBE2PARAM_new(void) | ||
| 82 | { | ||
| 83 | PBE2PARAM *ret=NULL; | ||
| 84 | ASN1_CTX c; | ||
| 85 | M_ASN1_New_Malloc(ret, PBE2PARAM); | ||
| 86 | M_ASN1_New(ret->keyfunc,X509_ALGOR_new); | ||
| 87 | M_ASN1_New(ret->encryption,X509_ALGOR_new); | ||
| 88 | return (ret); | ||
| 89 | M_ASN1_New_Error(ASN1_F_PBE2PARAM_NEW); | ||
| 90 | } | ||
| 91 | |||
| 92 | PBE2PARAM *d2i_PBE2PARAM(PBE2PARAM **a, unsigned char **pp, long length) | ||
| 93 | { | ||
| 94 | M_ASN1_D2I_vars(a,PBE2PARAM *,PBE2PARAM_new); | ||
| 95 | M_ASN1_D2I_Init(); | ||
| 96 | M_ASN1_D2I_start_sequence(); | ||
| 97 | M_ASN1_D2I_get (ret->keyfunc, d2i_X509_ALGOR); | ||
| 98 | M_ASN1_D2I_get (ret->encryption, d2i_X509_ALGOR); | ||
| 99 | M_ASN1_D2I_Finish(a, PBE2PARAM_free, ASN1_F_D2I_PBE2PARAM); | ||
| 100 | } | ||
| 101 | |||
| 102 | void PBE2PARAM_free (PBE2PARAM *a) | ||
| 103 | { | ||
| 104 | if(a==NULL) return; | ||
| 105 | X509_ALGOR_free(a->keyfunc); | ||
| 106 | X509_ALGOR_free(a->encryption); | ||
| 107 | Free ((char *)a); | ||
| 108 | } | ||
| 109 | |||
| 110 | int i2d_PBKDF2PARAM(PBKDF2PARAM *a, unsigned char **pp) | ||
| 111 | { | ||
| 112 | M_ASN1_I2D_vars(a); | ||
| 113 | M_ASN1_I2D_len (a->salt, i2d_ASN1_TYPE); | ||
| 114 | M_ASN1_I2D_len (a->iter, i2d_ASN1_INTEGER); | ||
| 115 | M_ASN1_I2D_len (a->keylength, i2d_ASN1_INTEGER); | ||
| 116 | M_ASN1_I2D_len (a->prf, i2d_X509_ALGOR); | ||
| 117 | |||
| 118 | M_ASN1_I2D_seq_total (); | ||
| 119 | |||
| 120 | M_ASN1_I2D_put (a->salt, i2d_ASN1_TYPE); | ||
| 121 | M_ASN1_I2D_put (a->iter, i2d_ASN1_INTEGER); | ||
| 122 | M_ASN1_I2D_put (a->keylength, i2d_ASN1_INTEGER); | ||
| 123 | M_ASN1_I2D_put (a->prf, i2d_X509_ALGOR); | ||
| 124 | |||
| 125 | M_ASN1_I2D_finish(); | ||
| 126 | } | ||
| 127 | |||
| 128 | PBKDF2PARAM *PBKDF2PARAM_new(void) | ||
| 129 | { | ||
| 130 | PBKDF2PARAM *ret=NULL; | ||
| 131 | ASN1_CTX c; | ||
| 132 | M_ASN1_New_Malloc(ret, PBKDF2PARAM); | ||
| 133 | M_ASN1_New(ret->salt, ASN1_TYPE_new); | ||
| 134 | M_ASN1_New(ret->iter, ASN1_INTEGER_new); | ||
| 135 | ret->keylength = NULL; | ||
| 136 | ret->prf = NULL; | ||
| 137 | return (ret); | ||
| 138 | M_ASN1_New_Error(ASN1_F_PBKDF2PARAM_NEW); | ||
| 139 | } | ||
| 140 | |||
| 141 | PBKDF2PARAM *d2i_PBKDF2PARAM(PBKDF2PARAM **a, unsigned char **pp, | ||
| 142 | long length) | ||
| 143 | { | ||
| 144 | M_ASN1_D2I_vars(a,PBKDF2PARAM *,PBKDF2PARAM_new); | ||
| 145 | M_ASN1_D2I_Init(); | ||
| 146 | M_ASN1_D2I_start_sequence(); | ||
| 147 | M_ASN1_D2I_get (ret->salt, d2i_ASN1_TYPE); | ||
| 148 | M_ASN1_D2I_get (ret->iter, d2i_ASN1_INTEGER); | ||
| 149 | M_ASN1_D2I_get_opt (ret->keylength, d2i_ASN1_INTEGER, V_ASN1_INTEGER); | ||
| 150 | M_ASN1_D2I_get_opt (ret->prf, d2i_X509_ALGOR, V_ASN1_SEQUENCE); | ||
| 151 | M_ASN1_D2I_Finish(a, PBKDF2PARAM_free, ASN1_F_D2I_PBKDF2PARAM); | ||
| 152 | } | ||
| 153 | |||
| 154 | void PBKDF2PARAM_free (PBKDF2PARAM *a) | ||
| 155 | { | ||
| 156 | if(a==NULL) return; | ||
| 157 | ASN1_TYPE_free(a->salt); | ||
| 158 | ASN1_INTEGER_free(a->iter); | ||
| 159 | ASN1_INTEGER_free(a->keylength); | ||
| 160 | X509_ALGOR_free(a->prf); | ||
| 161 | Free ((char *)a); | ||
| 162 | } | ||
| 163 | |||
| 164 | /* Return an algorithm identifier for a PKCS#5 v2.0 PBE algorithm: | ||
| 165 | * yes I know this is horrible! | ||
| 166 | */ | ||
| 167 | |||
| 168 | X509_ALGOR *PKCS5_pbe2_set(const EVP_CIPHER *cipher, int iter, | ||
| 169 | unsigned char *salt, int saltlen) | ||
| 170 | { | ||
| 171 | X509_ALGOR *scheme = NULL, *kalg = NULL, *ret = NULL; | ||
| 172 | int alg_nid; | ||
| 173 | EVP_CIPHER_CTX ctx; | ||
| 174 | unsigned char iv[EVP_MAX_IV_LENGTH]; | ||
| 175 | PBKDF2PARAM *kdf = NULL; | ||
| 176 | PBE2PARAM *pbe2 = NULL; | ||
| 177 | ASN1_OCTET_STRING *osalt = NULL; | ||
| 178 | |||
| 179 | if(!(pbe2 = PBE2PARAM_new())) goto merr; | ||
| 180 | |||
| 181 | /* Setup the AlgorithmIdentifier for the encryption scheme */ | ||
| 182 | scheme = pbe2->encryption; | ||
| 183 | |||
| 184 | alg_nid = EVP_CIPHER_type(cipher); | ||
| 185 | |||
| 186 | scheme->algorithm = OBJ_nid2obj(alg_nid); | ||
| 187 | if(!(scheme->parameter = ASN1_TYPE_new())) goto merr; | ||
| 188 | |||
| 189 | /* Create random IV */ | ||
| 190 | RAND_bytes(iv, EVP_CIPHER_iv_length(cipher)); | ||
| 191 | |||
| 192 | /* Dummy cipherinit to just setup the IV */ | ||
| 193 | EVP_CipherInit(&ctx, cipher, NULL, iv, 0); | ||
| 194 | if(EVP_CIPHER_param_to_asn1(&ctx, scheme->parameter) < 0) { | ||
| 195 | ASN1err(ASN1_F_PKCS5_PBE2_SET, | ||
| 196 | ASN1_R_ERROR_SETTING_CIPHER_PARAMS); | ||
| 197 | goto err; | ||
| 198 | } | ||
| 199 | EVP_CIPHER_CTX_cleanup(&ctx); | ||
| 200 | |||
| 201 | if(!(kdf = PBKDF2PARAM_new())) goto merr; | ||
| 202 | if(!(osalt = ASN1_OCTET_STRING_new())) goto merr; | ||
| 203 | |||
| 204 | if (!saltlen) saltlen = PKCS5_SALT_LEN; | ||
| 205 | if (!(osalt->data = Malloc (saltlen))) goto merr; | ||
| 206 | osalt->length = saltlen; | ||
| 207 | if (salt) memcpy (osalt->data, salt, saltlen); | ||
| 208 | else RAND_bytes (osalt->data, saltlen); | ||
| 209 | |||
| 210 | if(iter <= 0) iter = PKCS5_DEFAULT_ITER; | ||
| 211 | if(!ASN1_INTEGER_set(kdf->iter, iter)) goto merr; | ||
| 212 | |||
| 213 | /* Now include salt in kdf structure */ | ||
| 214 | kdf->salt->value.octet_string = osalt; | ||
| 215 | kdf->salt->type = V_ASN1_OCTET_STRING; | ||
| 216 | osalt = NULL; | ||
| 217 | |||
| 218 | /* If its RC2 then we'd better setup the key length */ | ||
| 219 | |||
| 220 | if(alg_nid == NID_rc2_cbc) { | ||
| 221 | if(!(kdf->keylength = ASN1_INTEGER_new())) goto merr; | ||
| 222 | if(!ASN1_INTEGER_set (kdf->keylength, | ||
| 223 | EVP_CIPHER_key_length(cipher))) goto merr; | ||
| 224 | } | ||
| 225 | |||
| 226 | /* prf can stay NULL because we are using hmacWithSHA1 */ | ||
| 227 | |||
| 228 | /* Now setup the PBE2PARAM keyfunc structure */ | ||
| 229 | |||
| 230 | pbe2->keyfunc->algorithm = OBJ_nid2obj(NID_id_pbkdf2); | ||
| 231 | |||
| 232 | /* Encode PBKDF2PARAM into parameter of pbe2 */ | ||
| 233 | |||
| 234 | if(!(pbe2->keyfunc->parameter = ASN1_TYPE_new())) goto merr; | ||
| 235 | |||
| 236 | if(!ASN1_pack_string(kdf, i2d_PBKDF2PARAM, | ||
| 237 | &pbe2->keyfunc->parameter->value.sequence)) goto merr; | ||
| 238 | pbe2->keyfunc->parameter->type = V_ASN1_SEQUENCE; | ||
| 239 | |||
| 240 | PBKDF2PARAM_free(kdf); | ||
| 241 | kdf = NULL; | ||
| 242 | |||
| 243 | /* Now set up top level AlgorithmIdentifier */ | ||
| 244 | |||
| 245 | if(!(ret = X509_ALGOR_new())) goto merr; | ||
| 246 | if(!(ret->parameter = ASN1_TYPE_new())) goto merr; | ||
| 247 | |||
| 248 | ret->algorithm = OBJ_nid2obj(NID_pbes2); | ||
| 249 | |||
| 250 | /* Encode PBE2PARAM into parameter */ | ||
| 251 | |||
| 252 | if(!ASN1_pack_string(pbe2, i2d_PBE2PARAM, | ||
| 253 | &ret->parameter->value.sequence)) goto merr; | ||
| 254 | ret->parameter->type = V_ASN1_SEQUENCE; | ||
| 255 | |||
| 256 | PBE2PARAM_free(pbe2); | ||
| 257 | pbe2 = NULL; | ||
| 258 | |||
| 259 | return ret; | ||
| 260 | |||
| 261 | merr: | ||
| 262 | ASN1err(ASN1_F_PKCS5_PBE2_SET,ERR_R_MALLOC_FAILURE); | ||
| 263 | |||
| 264 | err: | ||
| 265 | PBE2PARAM_free(pbe2); | ||
| 266 | /* Note 'scheme' is freed as part of pbe2 */ | ||
| 267 | ASN1_OCTET_STRING_free(osalt); | ||
| 268 | PBKDF2PARAM_free(kdf); | ||
| 269 | X509_ALGOR_free(kalg); | ||
| 270 | X509_ALGOR_free(ret); | ||
| 271 | |||
| 272 | return NULL; | ||
| 273 | |||
| 274 | } | ||
diff --git a/src/lib/libcrypto/asn1/p8_pkey.c b/src/lib/libcrypto/asn1/p8_pkey.c new file mode 100644 index 0000000000..aa9a4f6c96 --- /dev/null +++ b/src/lib/libcrypto/asn1/p8_pkey.c | |||
| @@ -0,0 +1,129 @@ | |||
| 1 | /* p8_pkey.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 1999. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 1999 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | #include <stdio.h> | ||
| 60 | #include "cryptlib.h" | ||
| 61 | #include <openssl/asn1_mac.h> | ||
| 62 | #include <openssl/x509.h> | ||
| 63 | |||
| 64 | int i2d_PKCS8_PRIV_KEY_INFO (PKCS8_PRIV_KEY_INFO *a, unsigned char **pp) | ||
| 65 | { | ||
| 66 | |||
| 67 | M_ASN1_I2D_vars(a); | ||
| 68 | |||
| 69 | M_ASN1_I2D_len (a->version, i2d_ASN1_INTEGER); | ||
| 70 | M_ASN1_I2D_len (a->pkeyalg, i2d_X509_ALGOR); | ||
| 71 | M_ASN1_I2D_len (a->pkey, i2d_ASN1_TYPE); | ||
| 72 | M_ASN1_I2D_len_IMP_SET_opt_type (X509_ATTRIBUTE, a->attributes, | ||
| 73 | i2d_X509_ATTRIBUTE, 0); | ||
| 74 | |||
| 75 | M_ASN1_I2D_seq_total (); | ||
| 76 | |||
| 77 | M_ASN1_I2D_put (a->version, i2d_ASN1_INTEGER); | ||
| 78 | M_ASN1_I2D_put (a->pkeyalg, i2d_X509_ALGOR); | ||
| 79 | M_ASN1_I2D_put (a->pkey, i2d_ASN1_TYPE); | ||
| 80 | M_ASN1_I2D_put_IMP_SET_opt_type (X509_ATTRIBUTE, a->attributes, | ||
| 81 | i2d_X509_ATTRIBUTE, 0); | ||
| 82 | |||
| 83 | M_ASN1_I2D_finish(); | ||
| 84 | } | ||
| 85 | |||
| 86 | PKCS8_PRIV_KEY_INFO *PKCS8_PRIV_KEY_INFO_new(void) | ||
| 87 | { | ||
| 88 | PKCS8_PRIV_KEY_INFO *ret=NULL; | ||
| 89 | ASN1_CTX c; | ||
| 90 | M_ASN1_New_Malloc(ret, PKCS8_PRIV_KEY_INFO); | ||
| 91 | M_ASN1_New (ret->version, ASN1_INTEGER_new); | ||
| 92 | M_ASN1_New (ret->pkeyalg, X509_ALGOR_new); | ||
| 93 | M_ASN1_New (ret->pkey, ASN1_TYPE_new); | ||
| 94 | ret->attributes = NULL; | ||
| 95 | ret->broken = PKCS8_OK; | ||
| 96 | return (ret); | ||
| 97 | M_ASN1_New_Error(ASN1_F_PKCS8_PRIV_KEY_INFO_NEW); | ||
| 98 | } | ||
| 99 | |||
| 100 | PKCS8_PRIV_KEY_INFO *d2i_PKCS8_PRIV_KEY_INFO(PKCS8_PRIV_KEY_INFO **a, | ||
| 101 | unsigned char **pp, long length) | ||
| 102 | { | ||
| 103 | M_ASN1_D2I_vars(a,PKCS8_PRIV_KEY_INFO *,PKCS8_PRIV_KEY_INFO_new); | ||
| 104 | M_ASN1_D2I_Init(); | ||
| 105 | M_ASN1_D2I_start_sequence(); | ||
| 106 | M_ASN1_D2I_get (ret->version, d2i_ASN1_INTEGER); | ||
| 107 | M_ASN1_D2I_get (ret->pkeyalg, d2i_X509_ALGOR); | ||
| 108 | M_ASN1_D2I_get (ret->pkey, d2i_ASN1_TYPE); | ||
| 109 | M_ASN1_D2I_get_IMP_set_opt_type(X509_ATTRIBUTE, ret->attributes, | ||
| 110 | d2i_X509_ATTRIBUTE, | ||
| 111 | X509_ATTRIBUTE_free, 0); | ||
| 112 | if (ASN1_TYPE_get(ret->pkey) == V_ASN1_SEQUENCE) | ||
| 113 | ret->broken = PKCS8_NO_OCTET; | ||
| 114 | M_ASN1_D2I_Finish(a, PKCS8_PRIV_KEY_INFO_free, ASN1_F_D2I_PKCS8_PRIV_KEY_INFO); | ||
| 115 | } | ||
| 116 | |||
| 117 | void PKCS8_PRIV_KEY_INFO_free (PKCS8_PRIV_KEY_INFO *a) | ||
| 118 | { | ||
| 119 | if (a == NULL) return; | ||
| 120 | ASN1_INTEGER_free (a->version); | ||
| 121 | X509_ALGOR_free(a->pkeyalg); | ||
| 122 | /* Clear sensitive data */ | ||
| 123 | if (a->pkey->value.octet_string) | ||
| 124 | memset (a->pkey->value.octet_string->data, | ||
| 125 | 0, a->pkey->value.octet_string->length); | ||
| 126 | ASN1_TYPE_free (a->pkey); | ||
| 127 | sk_X509_ATTRIBUTE_pop_free (a->attributes, X509_ATTRIBUTE_free); | ||
| 128 | Free (a); | ||
| 129 | } | ||
diff --git a/src/lib/libcrypto/asn1/t_bitst.c b/src/lib/libcrypto/asn1/t_bitst.c new file mode 100644 index 0000000000..8ee789f082 --- /dev/null +++ b/src/lib/libcrypto/asn1/t_bitst.c | |||
| @@ -0,0 +1,99 @@ | |||
| 1 | /* t_bitst.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 1999. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 1999 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | #include <stdio.h> | ||
| 60 | #include "cryptlib.h" | ||
| 61 | #include <openssl/conf.h> | ||
| 62 | #include <openssl/x509v3.h> | ||
| 63 | |||
| 64 | int ASN1_BIT_STRING_name_print(BIO *out, ASN1_BIT_STRING *bs, | ||
| 65 | BIT_STRING_BITNAME *tbl, int indent) | ||
| 66 | { | ||
| 67 | BIT_STRING_BITNAME *bnam; | ||
| 68 | char first = 1; | ||
| 69 | BIO_printf(out, "%*s", indent, ""); | ||
| 70 | for(bnam = tbl; bnam->lname; bnam++) { | ||
| 71 | if(ASN1_BIT_STRING_get_bit(bs, bnam->bitnum)) { | ||
| 72 | if(!first) BIO_puts(out, ", "); | ||
| 73 | BIO_puts(out, bnam->lname); | ||
| 74 | first = 0; | ||
| 75 | } | ||
| 76 | } | ||
| 77 | BIO_puts(out, "\n"); | ||
| 78 | return 1; | ||
| 79 | } | ||
| 80 | |||
| 81 | int ASN1_BIT_STRING_set_asc(ASN1_BIT_STRING *bs, char *name, int value, | ||
| 82 | BIT_STRING_BITNAME *tbl) | ||
| 83 | { | ||
| 84 | int bitnum; | ||
| 85 | bitnum = ASN1_BIT_STRING_num_asc(name, tbl); | ||
| 86 | if(bitnum < 0) return 0; | ||
| 87 | if(bs) ASN1_BIT_STRING_set_bit(bs, bitnum, value); | ||
| 88 | return 1; | ||
| 89 | } | ||
| 90 | |||
| 91 | int ASN1_BIT_STRING_num_asc(char *name, BIT_STRING_BITNAME *tbl) | ||
| 92 | { | ||
| 93 | BIT_STRING_BITNAME *bnam; | ||
| 94 | for(bnam = tbl; bnam->lname; bnam++) { | ||
| 95 | if(!strcmp(bnam->sname, name) || | ||
| 96 | !strcmp(bnam->lname, name) ) return bnam->bitnum; | ||
| 97 | } | ||
| 98 | return -1; | ||
| 99 | } | ||
diff --git a/src/lib/libcrypto/asn1/t_crl.c b/src/lib/libcrypto/asn1/t_crl.c new file mode 100644 index 0000000000..c2e447ce6f --- /dev/null +++ b/src/lib/libcrypto/asn1/t_crl.c | |||
| @@ -0,0 +1,166 @@ | |||
| 1 | /* t_crl.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 1999. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 1999 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | #include <stdio.h> | ||
| 60 | #include "cryptlib.h" | ||
| 61 | #include <openssl/buffer.h> | ||
| 62 | #include <openssl/bn.h> | ||
| 63 | #include <openssl/objects.h> | ||
| 64 | #include <openssl/x509.h> | ||
| 65 | #include <openssl/x509v3.h> | ||
| 66 | |||
| 67 | static void ext_print(BIO *out, X509_EXTENSION *ex); | ||
| 68 | #ifndef NO_FP_API | ||
| 69 | int X509_CRL_print_fp(FILE *fp, X509_CRL *x) | ||
| 70 | { | ||
| 71 | BIO *b; | ||
| 72 | int ret; | ||
| 73 | |||
| 74 | if ((b=BIO_new(BIO_s_file())) == NULL) | ||
| 75 | { | ||
| 76 | X509err(X509_F_X509_PRINT_FP,ERR_R_BUF_LIB); | ||
| 77 | return(0); | ||
| 78 | } | ||
| 79 | BIO_set_fp(b,fp,BIO_NOCLOSE); | ||
| 80 | ret=X509_CRL_print(b, x); | ||
| 81 | BIO_free(b); | ||
| 82 | return(ret); | ||
| 83 | } | ||
| 84 | #endif | ||
| 85 | |||
| 86 | int X509_CRL_print(BIO *out, X509_CRL *x) | ||
| 87 | { | ||
| 88 | char buf[256]; | ||
| 89 | unsigned char *s; | ||
| 90 | STACK_OF(X509_REVOKED) *rev; | ||
| 91 | X509_REVOKED *r; | ||
| 92 | long l; | ||
| 93 | int i, j, n; | ||
| 94 | |||
| 95 | BIO_printf(out, "Certificate Revocation List (CRL):\n"); | ||
| 96 | l = X509_CRL_get_version(x); | ||
| 97 | BIO_printf(out, "%8sVersion %lu (0x%lx)\n", "", l+1, l); | ||
| 98 | i = OBJ_obj2nid(x->sig_alg->algorithm); | ||
| 99 | BIO_printf(out, "%8sSignature Algorithm: %s\n", "", | ||
| 100 | (i == NID_undef) ? "NONE" : OBJ_nid2ln(i)); | ||
| 101 | X509_NAME_oneline(X509_CRL_get_issuer(x),buf,256); | ||
| 102 | BIO_printf(out,"%8sIssuer: %s\n","",buf); | ||
| 103 | BIO_printf(out,"%8sLast Update: ",""); | ||
| 104 | ASN1_TIME_print(out,X509_CRL_get_lastUpdate(x)); | ||
| 105 | BIO_printf(out,"\n%8sNext Update: ",""); | ||
| 106 | if (X509_CRL_get_nextUpdate(x)) | ||
| 107 | ASN1_TIME_print(out,X509_CRL_get_nextUpdate(x)); | ||
| 108 | else BIO_printf(out,"NONE"); | ||
| 109 | BIO_printf(out,"\n"); | ||
| 110 | |||
| 111 | n=X509_CRL_get_ext_count(x); | ||
| 112 | if (n > 0) { | ||
| 113 | BIO_printf(out,"%8sCRL extensions:\n",""); | ||
| 114 | for (i=0; i<n; i++) ext_print(out, X509_CRL_get_ext(x, i)); | ||
| 115 | } | ||
| 116 | |||
| 117 | |||
| 118 | rev = X509_CRL_get_REVOKED(x); | ||
| 119 | |||
| 120 | if(sk_X509_REVOKED_num(rev)) | ||
| 121 | BIO_printf(out, "Revoked Certificates:\n"); | ||
| 122 | else BIO_printf(out, "No Revoked Certificates.\n"); | ||
| 123 | |||
| 124 | for(i = 0; i < sk_X509_REVOKED_num(rev); i++) { | ||
| 125 | r = sk_X509_REVOKED_value(rev, i); | ||
| 126 | BIO_printf(out," Serial Number: "); | ||
| 127 | i2a_ASN1_INTEGER(out,r->serialNumber); | ||
| 128 | BIO_printf(out,"\n Revocation Date: ",""); | ||
| 129 | ASN1_TIME_print(out,r->revocationDate); | ||
| 130 | BIO_printf(out,"\n"); | ||
| 131 | for(j = 0; j < X509_REVOKED_get_ext_count(r); j++) | ||
| 132 | ext_print(out, X509_REVOKED_get_ext(r, j)); | ||
| 133 | } | ||
| 134 | |||
| 135 | i=OBJ_obj2nid(x->sig_alg->algorithm); | ||
| 136 | BIO_printf(out," Signature Algorithm: %s", | ||
| 137 | (i == NID_undef)?"UNKNOWN":OBJ_nid2ln(i)); | ||
| 138 | |||
| 139 | s = x->signature->data; | ||
| 140 | n = x->signature->length; | ||
| 141 | for (i=0; i<n; i++, s++) | ||
| 142 | { | ||
| 143 | if ((i%18) == 0) BIO_write(out,"\n ",9); | ||
| 144 | BIO_printf(out,"%02x%s",*s, ((i+1) == n)?"":":"); | ||
| 145 | } | ||
| 146 | BIO_write(out,"\n",1); | ||
| 147 | |||
| 148 | return 1; | ||
| 149 | |||
| 150 | } | ||
| 151 | |||
| 152 | static void ext_print(BIO *out, X509_EXTENSION *ex) | ||
| 153 | { | ||
| 154 | ASN1_OBJECT *obj; | ||
| 155 | int j; | ||
| 156 | BIO_printf(out,"%12s",""); | ||
| 157 | obj=X509_EXTENSION_get_object(ex); | ||
| 158 | i2a_ASN1_OBJECT(out,obj); | ||
| 159 | j=X509_EXTENSION_get_critical(ex); | ||
| 160 | BIO_printf(out, ": %s\n", j ? "critical":"",""); | ||
| 161 | if(!X509V3_EXT_print(out, ex, 0, 16)) { | ||
| 162 | BIO_printf(out, "%16s", ""); | ||
| 163 | ASN1_OCTET_STRING_print(out,ex->value); | ||
| 164 | } | ||
| 165 | BIO_write(out,"\n",1); | ||
| 166 | } | ||
diff --git a/src/lib/libcrypto/asn1/t_spki.c b/src/lib/libcrypto/asn1/t_spki.c new file mode 100644 index 0000000000..d708434fca --- /dev/null +++ b/src/lib/libcrypto/asn1/t_spki.c | |||
| @@ -0,0 +1,116 @@ | |||
| 1 | /* t_spki.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 1999. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 1999 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | #include <stdio.h> | ||
| 60 | #include "cryptlib.h" | ||
| 61 | #include <openssl/x509.h> | ||
| 62 | #include <openssl/asn1_mac.h> | ||
| 63 | |||
| 64 | /* Print out an SPKI */ | ||
| 65 | |||
| 66 | int NETSCAPE_SPKI_print(BIO *out, NETSCAPE_SPKI *spki) | ||
| 67 | { | ||
| 68 | EVP_PKEY *pkey; | ||
| 69 | ASN1_IA5STRING *chal; | ||
| 70 | int i, n; | ||
| 71 | char *s; | ||
| 72 | BIO_printf(out, "Netscape SPKI:\n"); | ||
| 73 | i=OBJ_obj2nid(spki->spkac->pubkey->algor->algorithm); | ||
| 74 | BIO_printf(out," Public Key Algorithm: %s\n", | ||
| 75 | (i == NID_undef)?"UNKNOWN":OBJ_nid2ln(i)); | ||
| 76 | pkey = X509_PUBKEY_get(spki->spkac->pubkey); | ||
| 77 | if(!pkey) BIO_printf(out, " Unable to load public key\n"); | ||
| 78 | else { | ||
| 79 | #ifndef NO_RSA | ||
| 80 | if (pkey->type == EVP_PKEY_RSA) | ||
| 81 | { | ||
| 82 | BIO_printf(out," RSA Public Key: (%d bit)\n", | ||
| 83 | BN_num_bits(pkey->pkey.rsa->n)); | ||
| 84 | RSA_print(out,pkey->pkey.rsa,2); | ||
| 85 | } | ||
| 86 | else | ||
| 87 | #endif | ||
| 88 | #ifndef NO_DSA | ||
| 89 | if (pkey->type == EVP_PKEY_DSA) | ||
| 90 | { | ||
| 91 | BIO_printf(out," DSA Public Key:\n"); | ||
| 92 | DSA_print(out,pkey->pkey.dsa,2); | ||
| 93 | } | ||
| 94 | else | ||
| 95 | #endif | ||
| 96 | BIO_printf(out," Unknown Public Key:\n"); | ||
| 97 | EVP_PKEY_free(pkey); | ||
| 98 | } | ||
| 99 | chal = spki->spkac->challenge; | ||
| 100 | if(chal->length) | ||
| 101 | BIO_printf(out, " Challenge String: %s\n", chal->data); | ||
| 102 | i=OBJ_obj2nid(spki->sig_algor->algorithm); | ||
| 103 | BIO_printf(out," Signature Algorithm: %s", | ||
| 104 | (i == NID_undef)?"UNKNOWN":OBJ_nid2ln(i)); | ||
| 105 | |||
| 106 | n=spki->signature->length; | ||
| 107 | s=(char *)spki->signature->data; | ||
| 108 | for (i=0; i<n; i++) | ||
| 109 | { | ||
| 110 | if ((i%18) == 0) BIO_write(out,"\n ",7); | ||
| 111 | BIO_printf(out,"%02x%s",(unsigned char)s[i], | ||
| 112 | ((i+1) == n)?"":":"); | ||
| 113 | } | ||
| 114 | BIO_write(out,"\n",1); | ||
| 115 | return 1; | ||
| 116 | } | ||
diff --git a/src/lib/libcrypto/asn1/t_x509a.c b/src/lib/libcrypto/asn1/t_x509a.c new file mode 100644 index 0000000000..a18ebb586c --- /dev/null +++ b/src/lib/libcrypto/asn1/t_x509a.c | |||
| @@ -0,0 +1,102 @@ | |||
| 1 | /* t_x509a.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 1999. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 1999 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | #include <stdio.h> | ||
| 60 | #include "cryptlib.h" | ||
| 61 | #include <openssl/evp.h> | ||
| 62 | #include <openssl/asn1_mac.h> | ||
| 63 | #include <openssl/x509.h> | ||
| 64 | |||
| 65 | /* X509_CERT_AUX and string set routines | ||
| 66 | */ | ||
| 67 | |||
| 68 | int X509_CERT_AUX_print(BIO *out, X509_CERT_AUX *aux, int indent) | ||
| 69 | { | ||
| 70 | char oidstr[80], first; | ||
| 71 | int i; | ||
| 72 | if(!aux) return 1; | ||
| 73 | if(aux->trust) { | ||
| 74 | first = 1; | ||
| 75 | BIO_printf(out, "%*sTrusted Uses:\n%*s", | ||
| 76 | indent, "", indent + 2, ""); | ||
| 77 | for(i = 0; i < sk_ASN1_OBJECT_num(aux->trust); i++) { | ||
| 78 | if(!first) BIO_puts(out, ", "); | ||
| 79 | else first = 0; | ||
| 80 | OBJ_obj2txt(oidstr, 80, | ||
| 81 | sk_ASN1_OBJECT_value(aux->trust, i), 0); | ||
| 82 | BIO_puts(out, oidstr); | ||
| 83 | } | ||
| 84 | BIO_puts(out, "\n"); | ||
| 85 | } else BIO_printf(out, "%*sNo Trusted Uses.\n", indent, ""); | ||
| 86 | if(aux->reject) { | ||
| 87 | first = 1; | ||
| 88 | BIO_printf(out, "%*sRejected Uses:\n%*s", | ||
| 89 | indent, "", indent + 2, ""); | ||
| 90 | for(i = 0; i < sk_ASN1_OBJECT_num(aux->reject); i++) { | ||
| 91 | if(!first) BIO_puts(out, ", "); | ||
| 92 | else first = 0; | ||
| 93 | OBJ_obj2txt(oidstr, 80, | ||
| 94 | sk_ASN1_OBJECT_value(aux->reject, i), 0); | ||
| 95 | BIO_puts(out, oidstr); | ||
| 96 | } | ||
| 97 | BIO_puts(out, "\n"); | ||
| 98 | } else BIO_printf(out, "%*sNo Rejected Uses.\n", indent, ""); | ||
| 99 | if(aux->alias) BIO_printf(out, "%*sAlias: %s\n", indent, "", | ||
| 100 | aux->alias->data); | ||
| 101 | return 1; | ||
| 102 | } | ||
diff --git a/src/lib/libcrypto/asn1/tasn_dec.c b/src/lib/libcrypto/asn1/tasn_dec.c new file mode 100644 index 0000000000..0fc1f421e2 --- /dev/null +++ b/src/lib/libcrypto/asn1/tasn_dec.c | |||
| @@ -0,0 +1,958 @@ | |||
| 1 | /* tasn_dec.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 2000. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 2000 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | |||
| 60 | #include <stddef.h> | ||
| 61 | #include <string.h> | ||
| 62 | #include <openssl/asn1.h> | ||
| 63 | #include <openssl/asn1t.h> | ||
| 64 | #include <openssl/objects.h> | ||
| 65 | #include <openssl/buffer.h> | ||
| 66 | #include <openssl/err.h> | ||
| 67 | |||
| 68 | static int asn1_check_eoc(unsigned char **in, long len); | ||
| 69 | static int asn1_collect(BUF_MEM *buf, unsigned char **in, long len, char inf, int tag, int aclass); | ||
| 70 | static int collect_data(BUF_MEM *buf, unsigned char **p, long plen); | ||
| 71 | static int asn1_check_tlen(long *olen, int *otag, unsigned char *oclass, char *inf, char *cst, | ||
| 72 | unsigned char **in, long len, int exptag, int expclass, char opt, ASN1_TLC *ctx); | ||
| 73 | static int asn1_template_ex_d2i(ASN1_VALUE **pval, unsigned char **in, long len, const ASN1_TEMPLATE *tt, char opt, ASN1_TLC *ctx); | ||
| 74 | static int asn1_template_noexp_d2i(ASN1_VALUE **val, unsigned char **in, long len, const ASN1_TEMPLATE *tt, char opt, ASN1_TLC *ctx); | ||
| 75 | static int asn1_d2i_ex_primitive(ASN1_VALUE **pval, unsigned char **in, long len, | ||
| 76 | const ASN1_ITEM *it, int tag, int aclass, char opt, ASN1_TLC *ctx); | ||
| 77 | |||
| 78 | /* Table to convert tags to bit values, used for MSTRING type */ | ||
| 79 | static unsigned long tag2bit[32]={ | ||
| 80 | 0, 0, 0, B_ASN1_BIT_STRING, /* tags 0 - 3 */ | ||
| 81 | B_ASN1_OCTET_STRING, 0, 0, B_ASN1_UNKNOWN,/* tags 4- 7 */ | ||
| 82 | B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN,/* tags 8-11 */ | ||
| 83 | B_ASN1_UTF8STRING,B_ASN1_UNKNOWN,B_ASN1_UNKNOWN,B_ASN1_UNKNOWN,/* tags 12-15 */ | ||
| 84 | 0, 0, B_ASN1_NUMERICSTRING,B_ASN1_PRINTABLESTRING, /* tags 16-19 */ | ||
| 85 | B_ASN1_T61STRING,B_ASN1_VIDEOTEXSTRING,B_ASN1_IA5STRING, /* tags 20-22 */ | ||
| 86 | B_ASN1_UTCTIME, B_ASN1_GENERALIZEDTIME, /* tags 23-24 */ | ||
| 87 | B_ASN1_GRAPHICSTRING,B_ASN1_ISO64STRING,B_ASN1_GENERALSTRING, /* tags 25-27 */ | ||
| 88 | B_ASN1_UNIVERSALSTRING,B_ASN1_UNKNOWN,B_ASN1_BMPSTRING,B_ASN1_UNKNOWN, /* tags 28-31 */ | ||
| 89 | }; | ||
| 90 | |||
| 91 | unsigned long ASN1_tag2bit(int tag) | ||
| 92 | { | ||
| 93 | if((tag < 0) || (tag > 30)) return 0; | ||
| 94 | return tag2bit[tag]; | ||
| 95 | } | ||
| 96 | |||
| 97 | /* Macro to initialize and invalidate the cache */ | ||
| 98 | |||
| 99 | #define asn1_tlc_clear(c) if(c) (c)->valid = 0 | ||
| 100 | |||
| 101 | /* Decode an ASN1 item, this currently behaves just | ||
| 102 | * like a standard 'd2i' function. 'in' points to | ||
| 103 | * a buffer to read the data from, in future we will | ||
| 104 | * have more advanced versions that can input data | ||
| 105 | * a piece at a time and this will simply be a special | ||
| 106 | * case. | ||
| 107 | */ | ||
| 108 | |||
| 109 | ASN1_VALUE *ASN1_item_d2i(ASN1_VALUE **pval, unsigned char **in, long len, const ASN1_ITEM *it) | ||
| 110 | { | ||
| 111 | ASN1_TLC c; | ||
| 112 | ASN1_VALUE *ptmpval = NULL; | ||
| 113 | if(!pval) pval = &ptmpval; | ||
| 114 | asn1_tlc_clear(&c); | ||
| 115 | if(ASN1_item_ex_d2i(pval, in, len, it, -1, 0, 0, &c) > 0) | ||
| 116 | return *pval; | ||
| 117 | return NULL; | ||
| 118 | } | ||
| 119 | |||
| 120 | int ASN1_template_d2i(ASN1_VALUE **pval, unsigned char **in, long len, const ASN1_TEMPLATE *tt) | ||
| 121 | { | ||
| 122 | ASN1_TLC c; | ||
| 123 | asn1_tlc_clear(&c); | ||
| 124 | return asn1_template_ex_d2i(pval, in, len, tt, 0, &c); | ||
| 125 | } | ||
| 126 | |||
| 127 | |||
| 128 | /* Decode an item, taking care of IMPLICIT tagging, if any. | ||
| 129 | * If 'opt' set and tag mismatch return -1 to handle OPTIONAL | ||
| 130 | */ | ||
| 131 | |||
| 132 | int ASN1_item_ex_d2i(ASN1_VALUE **pval, unsigned char **in, long len, const ASN1_ITEM *it, | ||
| 133 | int tag, int aclass, char opt, ASN1_TLC *ctx) | ||
| 134 | { | ||
| 135 | const ASN1_TEMPLATE *tt, *errtt = NULL; | ||
| 136 | const ASN1_COMPAT_FUNCS *cf; | ||
| 137 | const ASN1_EXTERN_FUNCS *ef; | ||
| 138 | const ASN1_AUX *aux = it->funcs; | ||
| 139 | ASN1_aux_cb *asn1_cb; | ||
| 140 | unsigned char *p, *q, imphack = 0, oclass; | ||
| 141 | char seq_eoc, seq_nolen, cst, isopt; | ||
| 142 | long tmplen; | ||
| 143 | int i; | ||
| 144 | int otag; | ||
| 145 | int ret = 0; | ||
| 146 | ASN1_VALUE *pchval, **pchptr, *ptmpval; | ||
| 147 | if(!pval) return 0; | ||
| 148 | if(aux && aux->asn1_cb) asn1_cb = aux->asn1_cb; | ||
| 149 | else asn1_cb = 0; | ||
| 150 | |||
| 151 | switch(it->itype) { | ||
| 152 | |||
| 153 | case ASN1_ITYPE_PRIMITIVE: | ||
| 154 | if(it->templates) { | ||
| 155 | /* tagging or OPTIONAL is currently illegal on an item template | ||
| 156 | * because the flags can't get passed down. In practice this isn't | ||
| 157 | * a problem: we include the relevant flags from the item template | ||
| 158 | * in the template itself. | ||
| 159 | */ | ||
| 160 | if ((tag != -1) || opt) { | ||
| 161 | ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_ILLEGAL_OPTIONS_ON_ITEM_TEMPLATE); | ||
| 162 | goto err; | ||
| 163 | } | ||
| 164 | return asn1_template_ex_d2i(pval, in, len, it->templates, opt, ctx); | ||
| 165 | } | ||
| 166 | return asn1_d2i_ex_primitive(pval, in, len, it, tag, aclass, opt, ctx); | ||
| 167 | break; | ||
| 168 | |||
| 169 | case ASN1_ITYPE_MSTRING: | ||
| 170 | p = *in; | ||
| 171 | /* Just read in tag and class */ | ||
| 172 | ret = asn1_check_tlen(NULL, &otag, &oclass, NULL, NULL, &p, len, -1, 0, 1, ctx); | ||
| 173 | if(!ret) { | ||
| 174 | ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR); | ||
| 175 | goto err; | ||
| 176 | } | ||
| 177 | /* Must be UNIVERSAL class */ | ||
| 178 | if(oclass != V_ASN1_UNIVERSAL) { | ||
| 179 | /* If OPTIONAL, assume this is OK */ | ||
| 180 | if(opt) return -1; | ||
| 181 | ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_MSTRING_NOT_UNIVERSAL); | ||
| 182 | goto err; | ||
| 183 | } | ||
| 184 | /* Check tag matches bit map */ | ||
| 185 | if(!(ASN1_tag2bit(otag) & it->utype)) { | ||
| 186 | /* If OPTIONAL, assume this is OK */ | ||
| 187 | if(opt) return -1; | ||
| 188 | ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_MSTRING_WRONG_TAG); | ||
| 189 | goto err; | ||
| 190 | } | ||
| 191 | return asn1_d2i_ex_primitive(pval, in, len, it, otag, 0, 0, ctx); | ||
| 192 | |||
| 193 | case ASN1_ITYPE_EXTERN: | ||
| 194 | /* Use new style d2i */ | ||
| 195 | ef = it->funcs; | ||
| 196 | return ef->asn1_ex_d2i(pval, in, len, it, tag, aclass, opt, ctx); | ||
| 197 | |||
| 198 | case ASN1_ITYPE_COMPAT: | ||
| 199 | /* we must resort to old style evil hackery */ | ||
| 200 | cf = it->funcs; | ||
| 201 | |||
| 202 | /* If OPTIONAL see if it is there */ | ||
| 203 | if(opt) { | ||
| 204 | int exptag; | ||
| 205 | p = *in; | ||
| 206 | if(tag == -1) exptag = it->utype; | ||
| 207 | else exptag = tag; | ||
| 208 | /* Don't care about anything other than presence of expected tag */ | ||
| 209 | ret = asn1_check_tlen(NULL, NULL, NULL, NULL, NULL, &p, len, exptag, aclass, 1, ctx); | ||
| 210 | if(!ret) { | ||
| 211 | ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR); | ||
| 212 | goto err; | ||
| 213 | } | ||
| 214 | if(ret == -1) return -1; | ||
| 215 | } | ||
| 216 | /* This is the old style evil hack IMPLICIT handling: | ||
| 217 | * since the underlying code is expecting a tag and | ||
| 218 | * class other than the one present we change the | ||
| 219 | * buffer temporarily then change it back afterwards. | ||
| 220 | * This doesn't and never did work for tags > 30. | ||
| 221 | * | ||
| 222 | * Yes this is *horrible* but it is only needed for | ||
| 223 | * old style d2i which will hopefully not be around | ||
| 224 | * for much longer. | ||
| 225 | * FIXME: should copy the buffer then modify it so | ||
| 226 | * the input buffer can be const: we should *always* | ||
| 227 | * copy because the old style d2i might modify the | ||
| 228 | * buffer. | ||
| 229 | */ | ||
| 230 | |||
| 231 | if(tag != -1) { | ||
| 232 | p = *in; | ||
| 233 | imphack = *p; | ||
| 234 | *p = (unsigned char)((*p & V_ASN1_CONSTRUCTED) | it->utype); | ||
| 235 | } | ||
| 236 | |||
| 237 | ptmpval = cf->asn1_d2i(pval, in, len); | ||
| 238 | |||
| 239 | if(tag != -1) *p = imphack; | ||
| 240 | |||
| 241 | if(ptmpval) return 1; | ||
| 242 | ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR); | ||
| 243 | goto err; | ||
| 244 | |||
| 245 | |||
| 246 | case ASN1_ITYPE_CHOICE: | ||
| 247 | if(asn1_cb && !asn1_cb(ASN1_OP_D2I_PRE, pval, it)) | ||
| 248 | goto auxerr; | ||
| 249 | |||
| 250 | /* Allocate structure */ | ||
| 251 | if(!*pval) { | ||
| 252 | if(!ASN1_item_ex_new(pval, it)) { | ||
| 253 | ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR); | ||
| 254 | goto err; | ||
| 255 | } | ||
| 256 | } | ||
| 257 | /* CHOICE type, try each possibility in turn */ | ||
| 258 | pchval = NULL; | ||
| 259 | p = *in; | ||
| 260 | for(i = 0, tt=it->templates; i < it->tcount; i++, tt++) { | ||
| 261 | pchptr = asn1_get_field_ptr(pval, tt); | ||
| 262 | /* We mark field as OPTIONAL so its absence | ||
| 263 | * can be recognised. | ||
| 264 | */ | ||
| 265 | ret = asn1_template_ex_d2i(pchptr, &p, len, tt, 1, ctx); | ||
| 266 | /* If field not present, try the next one */ | ||
| 267 | if(ret == -1) continue; | ||
| 268 | /* If positive return, read OK, break loop */ | ||
| 269 | if(ret > 0) break; | ||
| 270 | /* Otherwise must be an ASN1 parsing error */ | ||
| 271 | errtt = tt; | ||
| 272 | ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR); | ||
| 273 | goto err; | ||
| 274 | } | ||
| 275 | /* Did we fall off the end without reading anything? */ | ||
| 276 | if(i == it->tcount) { | ||
| 277 | /* If OPTIONAL, this is OK */ | ||
| 278 | if(opt) { | ||
| 279 | /* Free and zero it */ | ||
| 280 | ASN1_item_ex_free(pval, it); | ||
| 281 | return -1; | ||
| 282 | } | ||
| 283 | ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_NO_MATCHING_CHOICE_TYPE); | ||
| 284 | goto err; | ||
| 285 | } | ||
| 286 | asn1_set_choice_selector(pval, i, it); | ||
| 287 | *in = p; | ||
| 288 | if(asn1_cb && !asn1_cb(ASN1_OP_D2I_POST, pval, it)) | ||
| 289 | goto auxerr; | ||
| 290 | return 1; | ||
| 291 | |||
| 292 | case ASN1_ITYPE_SEQUENCE: | ||
| 293 | p = *in; | ||
| 294 | tmplen = len; | ||
| 295 | |||
| 296 | /* If no IMPLICIT tagging set to SEQUENCE, UNIVERSAL */ | ||
| 297 | if(tag == -1) { | ||
| 298 | tag = V_ASN1_SEQUENCE; | ||
| 299 | aclass = V_ASN1_UNIVERSAL; | ||
| 300 | } | ||
| 301 | /* Get SEQUENCE length and update len, p */ | ||
| 302 | ret = asn1_check_tlen(&len, NULL, NULL, &seq_eoc, &cst, &p, len, tag, aclass, opt, ctx); | ||
| 303 | if(!ret) { | ||
| 304 | ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR); | ||
| 305 | goto err; | ||
| 306 | } else if(ret == -1) return -1; | ||
| 307 | if(aux && (aux->flags & ASN1_AFLG_BROKEN)) { | ||
| 308 | len = tmplen - (p - *in); | ||
| 309 | seq_nolen = 1; | ||
| 310 | } else seq_nolen = seq_eoc; /* If indefinite we don't do a length check */ | ||
| 311 | if(!cst) { | ||
| 312 | ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_SEQUENCE_NOT_CONSTRUCTED); | ||
| 313 | goto err; | ||
| 314 | } | ||
| 315 | |||
| 316 | if(!*pval) { | ||
| 317 | if(!ASN1_item_ex_new(pval, it)) { | ||
| 318 | ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR); | ||
| 319 | goto err; | ||
| 320 | } | ||
| 321 | } | ||
| 322 | if(asn1_cb && !asn1_cb(ASN1_OP_D2I_PRE, pval, it)) | ||
| 323 | goto auxerr; | ||
| 324 | |||
| 325 | /* Get each field entry */ | ||
| 326 | for(i = 0, tt = it->templates; i < it->tcount; i++, tt++) { | ||
| 327 | const ASN1_TEMPLATE *seqtt; | ||
| 328 | ASN1_VALUE **pseqval; | ||
| 329 | seqtt = asn1_do_adb(pval, tt, 1); | ||
| 330 | if(!seqtt) goto err; | ||
| 331 | pseqval = asn1_get_field_ptr(pval, seqtt); | ||
| 332 | /* Have we ran out of data? */ | ||
| 333 | if(!len) break; | ||
| 334 | q = p; | ||
| 335 | if(asn1_check_eoc(&p, len)) { | ||
| 336 | if(!seq_eoc) { | ||
| 337 | ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_UNEXPECTED_EOC); | ||
| 338 | goto err; | ||
| 339 | } | ||
| 340 | len -= p - q; | ||
| 341 | seq_eoc = 0; | ||
| 342 | q = p; | ||
| 343 | break; | ||
| 344 | } | ||
| 345 | /* This determines the OPTIONAL flag value. The field cannot | ||
| 346 | * be omitted if it is the last of a SEQUENCE and there is | ||
| 347 | * still data to be read. This isn't strictly necessary but | ||
| 348 | * it increases efficiency in some cases. | ||
| 349 | */ | ||
| 350 | if(i == (it->tcount - 1)) isopt = 0; | ||
| 351 | else isopt = (char)(seqtt->flags & ASN1_TFLG_OPTIONAL); | ||
| 352 | /* attempt to read in field, allowing each to be OPTIONAL */ | ||
| 353 | ret = asn1_template_ex_d2i(pseqval, &p, len, seqtt, isopt, ctx); | ||
| 354 | if(!ret) { | ||
| 355 | errtt = seqtt; | ||
| 356 | goto err; | ||
| 357 | } else if(ret == -1) { | ||
| 358 | /* OPTIONAL component absent. Free and zero the field | ||
| 359 | */ | ||
| 360 | ASN1_template_free(pseqval, seqtt); | ||
| 361 | continue; | ||
| 362 | } | ||
| 363 | /* Update length */ | ||
| 364 | len -= p - q; | ||
| 365 | } | ||
| 366 | /* Check for EOC if expecting one */ | ||
| 367 | if(seq_eoc && !asn1_check_eoc(&p, len)) { | ||
| 368 | ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_MISSING_EOC); | ||
| 369 | goto err; | ||
| 370 | } | ||
| 371 | /* Check all data read */ | ||
| 372 | if(!seq_nolen && len) { | ||
| 373 | ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_SEQUENCE_LENGTH_MISMATCH); | ||
| 374 | goto err; | ||
| 375 | } | ||
| 376 | |||
| 377 | /* If we get here we've got no more data in the SEQUENCE, | ||
| 378 | * however we may not have read all fields so check all | ||
| 379 | * remaining are OPTIONAL and clear any that are. | ||
| 380 | */ | ||
| 381 | for(; i < it->tcount; tt++, i++) { | ||
| 382 | const ASN1_TEMPLATE *seqtt; | ||
| 383 | seqtt = asn1_do_adb(pval, tt, 1); | ||
| 384 | if(!seqtt) goto err; | ||
| 385 | if(seqtt->flags & ASN1_TFLG_OPTIONAL) { | ||
| 386 | ASN1_VALUE **pseqval; | ||
| 387 | pseqval = asn1_get_field_ptr(pval, seqtt); | ||
| 388 | ASN1_template_free(pseqval, seqtt); | ||
| 389 | } else { | ||
| 390 | errtt = seqtt; | ||
| 391 | ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_FIELD_MISSING); | ||
| 392 | goto err; | ||
| 393 | } | ||
| 394 | } | ||
| 395 | /* Save encoding */ | ||
| 396 | if(!asn1_enc_save(pval, *in, p - *in, it)) goto auxerr; | ||
| 397 | *in = p; | ||
| 398 | if(asn1_cb && !asn1_cb(ASN1_OP_D2I_POST, pval, it)) | ||
| 399 | goto auxerr; | ||
| 400 | return 1; | ||
| 401 | |||
| 402 | default: | ||
| 403 | return 0; | ||
| 404 | } | ||
| 405 | auxerr: | ||
| 406 | ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_AUX_ERROR); | ||
| 407 | err: | ||
| 408 | ASN1_item_ex_free(pval, it); | ||
| 409 | if(errtt) ERR_add_error_data(4, "Field=", errtt->field_name, ", Type=", it->sname); | ||
| 410 | else ERR_add_error_data(2, "Type=", it->sname); | ||
| 411 | return 0; | ||
| 412 | } | ||
| 413 | |||
| 414 | /* Templates are handled with two separate functions. One handles any EXPLICIT tag and the other handles the | ||
| 415 | * rest. | ||
| 416 | */ | ||
| 417 | |||
| 418 | static int asn1_template_ex_d2i(ASN1_VALUE **val, unsigned char **in, long inlen, const ASN1_TEMPLATE *tt, char opt, ASN1_TLC *ctx) | ||
| 419 | { | ||
| 420 | int flags, aclass; | ||
| 421 | int ret; | ||
| 422 | long len; | ||
| 423 | unsigned char *p, *q; | ||
| 424 | char exp_eoc; | ||
| 425 | if(!val) return 0; | ||
| 426 | flags = tt->flags; | ||
| 427 | aclass = flags & ASN1_TFLG_TAG_CLASS; | ||
| 428 | |||
| 429 | p = *in; | ||
| 430 | |||
| 431 | /* Check if EXPLICIT tag expected */ | ||
| 432 | if(flags & ASN1_TFLG_EXPTAG) { | ||
| 433 | char cst; | ||
| 434 | /* Need to work out amount of data available to the inner content and where it | ||
| 435 | * starts: so read in EXPLICIT header to get the info. | ||
| 436 | */ | ||
| 437 | ret = asn1_check_tlen(&len, NULL, NULL, &exp_eoc, &cst, &p, inlen, tt->tag, aclass, opt, ctx); | ||
| 438 | q = p; | ||
| 439 | if(!ret) { | ||
| 440 | ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ERR_R_NESTED_ASN1_ERROR); | ||
| 441 | return 0; | ||
| 442 | } else if(ret == -1) return -1; | ||
| 443 | if(!cst) { | ||
| 444 | ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ASN1_R_EXPLICIT_TAG_NOT_CONSTRUCTED); | ||
| 445 | return 0; | ||
| 446 | } | ||
| 447 | /* We've found the field so it can't be OPTIONAL now */ | ||
| 448 | ret = asn1_template_noexp_d2i(val, &p, len, tt, 0, ctx); | ||
| 449 | if(!ret) { | ||
| 450 | ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ERR_R_NESTED_ASN1_ERROR); | ||
| 451 | return 0; | ||
| 452 | } | ||
| 453 | /* We read the field in OK so update length */ | ||
| 454 | len -= p - q; | ||
| 455 | if(exp_eoc) { | ||
| 456 | /* If NDEF we must have an EOC here */ | ||
| 457 | if(!asn1_check_eoc(&p, len)) { | ||
| 458 | ASN1err(ASN1_F_ASN1_TEMPLATE_D2I, ASN1_R_MISSING_EOC); | ||
| 459 | goto err; | ||
| 460 | } | ||
| 461 | } else { | ||
| 462 | /* Otherwise we must hit the EXPLICIT tag end or its an error */ | ||
| 463 | if(len) { | ||
| 464 | ASN1err(ASN1_F_ASN1_TEMPLATE_D2I, ASN1_R_EXPLICIT_LENGTH_MISMATCH); | ||
| 465 | goto err; | ||
| 466 | } | ||
| 467 | } | ||
| 468 | } else | ||
| 469 | return asn1_template_noexp_d2i(val, in, inlen, tt, opt, ctx); | ||
| 470 | |||
| 471 | *in = p; | ||
| 472 | return 1; | ||
| 473 | |||
| 474 | err: | ||
| 475 | ASN1_template_free(val, tt); | ||
| 476 | *val = NULL; | ||
| 477 | return 0; | ||
| 478 | } | ||
| 479 | |||
| 480 | static int asn1_template_noexp_d2i(ASN1_VALUE **val, unsigned char **in, long len, const ASN1_TEMPLATE *tt, char opt, ASN1_TLC *ctx) | ||
| 481 | { | ||
| 482 | int flags, aclass; | ||
| 483 | int ret; | ||
| 484 | unsigned char *p, *q; | ||
| 485 | if(!val) return 0; | ||
| 486 | flags = tt->flags; | ||
| 487 | aclass = flags & ASN1_TFLG_TAG_CLASS; | ||
| 488 | |||
| 489 | p = *in; | ||
| 490 | q = p; | ||
| 491 | |||
| 492 | if(flags & ASN1_TFLG_SK_MASK) { | ||
| 493 | /* SET OF, SEQUENCE OF */ | ||
| 494 | int sktag, skaclass; | ||
| 495 | char sk_eoc; | ||
| 496 | /* First work out expected inner tag value */ | ||
| 497 | if(flags & ASN1_TFLG_IMPTAG) { | ||
| 498 | sktag = tt->tag; | ||
| 499 | skaclass = aclass; | ||
| 500 | } else { | ||
| 501 | skaclass = V_ASN1_UNIVERSAL; | ||
| 502 | if(flags & ASN1_TFLG_SET_OF) sktag = V_ASN1_SET; | ||
| 503 | else sktag = V_ASN1_SEQUENCE; | ||
| 504 | } | ||
| 505 | /* Get the tag */ | ||
| 506 | ret = asn1_check_tlen(&len, NULL, NULL, &sk_eoc, NULL, &p, len, sktag, skaclass, opt, ctx); | ||
| 507 | if(!ret) { | ||
| 508 | ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ERR_R_NESTED_ASN1_ERROR); | ||
| 509 | return 0; | ||
| 510 | } else if(ret == -1) return -1; | ||
| 511 | if(!*val) *val = (ASN1_VALUE *)sk_new_null(); | ||
| 512 | else { | ||
| 513 | /* We've got a valid STACK: free up any items present */ | ||
| 514 | STACK *sktmp = (STACK *)*val; | ||
| 515 | ASN1_VALUE *vtmp; | ||
| 516 | while(sk_num(sktmp) > 0) { | ||
| 517 | vtmp = (ASN1_VALUE *)sk_pop(sktmp); | ||
| 518 | ASN1_item_ex_free(&vtmp, ASN1_ITEM_ptr(tt->item)); | ||
| 519 | } | ||
| 520 | } | ||
| 521 | |||
| 522 | if(!*val) { | ||
| 523 | ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ERR_R_MALLOC_FAILURE); | ||
| 524 | goto err; | ||
| 525 | } | ||
| 526 | /* Read as many items as we can */ | ||
| 527 | while(len > 0) { | ||
| 528 | ASN1_VALUE *skfield; | ||
| 529 | q = p; | ||
| 530 | /* See if EOC found */ | ||
| 531 | if(asn1_check_eoc(&p, len)) { | ||
| 532 | if(!sk_eoc) { | ||
| 533 | ASN1err(ASN1_F_ASN1_TEMPLATE_D2I, ASN1_R_UNEXPECTED_EOC); | ||
| 534 | goto err; | ||
| 535 | } | ||
| 536 | len -= p - q; | ||
| 537 | sk_eoc = 0; | ||
| 538 | break; | ||
| 539 | } | ||
| 540 | skfield = NULL; | ||
| 541 | if(!ASN1_item_ex_d2i(&skfield, &p, len, ASN1_ITEM_ptr(tt->item), -1, 0, 0, ctx)) { | ||
| 542 | ASN1err(ASN1_F_ASN1_TEMPLATE_D2I, ERR_R_NESTED_ASN1_ERROR); | ||
| 543 | goto err; | ||
| 544 | } | ||
| 545 | len -= p - q; | ||
| 546 | if(!sk_push((STACK *)*val, (char *)skfield)) { | ||
| 547 | ASN1err(ASN1_F_ASN1_TEMPLATE_D2I, ERR_R_MALLOC_FAILURE); | ||
| 548 | goto err; | ||
| 549 | } | ||
| 550 | } | ||
| 551 | if(sk_eoc) { | ||
| 552 | ASN1err(ASN1_F_ASN1_TEMPLATE_D2I, ASN1_R_MISSING_EOC); | ||
| 553 | goto err; | ||
| 554 | } | ||
| 555 | } else if(flags & ASN1_TFLG_IMPTAG) { | ||
| 556 | /* IMPLICIT tagging */ | ||
| 557 | ret = ASN1_item_ex_d2i(val, &p, len, ASN1_ITEM_ptr(tt->item), tt->tag, aclass, opt, ctx); | ||
| 558 | if(!ret) { | ||
| 559 | ASN1err(ASN1_F_ASN1_TEMPLATE_D2I, ERR_R_NESTED_ASN1_ERROR); | ||
| 560 | goto err; | ||
| 561 | } else if(ret == -1) return -1; | ||
| 562 | } else { | ||
| 563 | /* Nothing special */ | ||
| 564 | ret = ASN1_item_ex_d2i(val, &p, len, ASN1_ITEM_ptr(tt->item), -1, 0, opt, ctx); | ||
| 565 | if(!ret) { | ||
| 566 | ASN1err(ASN1_F_ASN1_TEMPLATE_D2I, ERR_R_NESTED_ASN1_ERROR); | ||
| 567 | goto err; | ||
| 568 | } else if(ret == -1) return -1; | ||
| 569 | } | ||
| 570 | |||
| 571 | *in = p; | ||
| 572 | return 1; | ||
| 573 | |||
| 574 | err: | ||
| 575 | ASN1_template_free(val, tt); | ||
| 576 | *val = NULL; | ||
| 577 | return 0; | ||
| 578 | } | ||
| 579 | |||
| 580 | static int asn1_d2i_ex_primitive(ASN1_VALUE **pval, unsigned char **in, long inlen, | ||
| 581 | const ASN1_ITEM *it, | ||
| 582 | int tag, int aclass, char opt, ASN1_TLC *ctx) | ||
| 583 | { | ||
| 584 | int ret = 0, utype; | ||
| 585 | long plen; | ||
| 586 | char cst, inf, free_cont = 0; | ||
| 587 | unsigned char *p; | ||
| 588 | BUF_MEM buf; | ||
| 589 | unsigned char *cont = NULL; | ||
| 590 | long len; | ||
| 591 | if(!pval) { | ||
| 592 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_ILLEGAL_NULL); | ||
| 593 | return 0; /* Should never happen */ | ||
| 594 | } | ||
| 595 | |||
| 596 | if(it->itype == ASN1_ITYPE_MSTRING) { | ||
| 597 | utype = tag; | ||
| 598 | tag = -1; | ||
| 599 | } else utype = it->utype; | ||
| 600 | |||
| 601 | if(utype == V_ASN1_ANY) { | ||
| 602 | /* If type is ANY need to figure out type from tag */ | ||
| 603 | unsigned char oclass; | ||
| 604 | if(tag >= 0) { | ||
| 605 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_ILLEGAL_TAGGED_ANY); | ||
| 606 | return 0; | ||
| 607 | } | ||
| 608 | if(opt) { | ||
| 609 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_ILLEGAL_OPTIONAL_ANY); | ||
| 610 | return 0; | ||
| 611 | } | ||
| 612 | p = *in; | ||
| 613 | ret = asn1_check_tlen(NULL, &utype, &oclass, NULL, NULL, &p, inlen, -1, 0, 0, ctx); | ||
| 614 | if(!ret) { | ||
| 615 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_NESTED_ASN1_ERROR); | ||
| 616 | return 0; | ||
| 617 | } | ||
| 618 | if(oclass != V_ASN1_UNIVERSAL) utype = V_ASN1_OTHER; | ||
| 619 | } | ||
| 620 | if(tag == -1) { | ||
| 621 | tag = utype; | ||
| 622 | aclass = V_ASN1_UNIVERSAL; | ||
| 623 | } | ||
| 624 | p = *in; | ||
| 625 | /* Check header */ | ||
| 626 | ret = asn1_check_tlen(&plen, NULL, NULL, &inf, &cst, &p, inlen, tag, aclass, opt, ctx); | ||
| 627 | if(!ret) { | ||
| 628 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_NESTED_ASN1_ERROR); | ||
| 629 | return 0; | ||
| 630 | } else if(ret == -1) return -1; | ||
| 631 | /* SEQUENCE, SET and "OTHER" are left in encoded form */ | ||
| 632 | if((utype == V_ASN1_SEQUENCE) || (utype == V_ASN1_SET) || (utype == V_ASN1_OTHER)) { | ||
| 633 | /* Clear context cache for type OTHER because the auto clear when | ||
| 634 | * we have a exact match wont work | ||
| 635 | */ | ||
| 636 | if(utype == V_ASN1_OTHER) { | ||
| 637 | asn1_tlc_clear(ctx); | ||
| 638 | /* SEQUENCE and SET must be constructed */ | ||
| 639 | } else if(!cst) { | ||
| 640 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_TYPE_NOT_CONSTRUCTED); | ||
| 641 | return 0; | ||
| 642 | } | ||
| 643 | |||
| 644 | cont = *in; | ||
| 645 | /* If indefinite length constructed find the real end */ | ||
| 646 | if(inf) { | ||
| 647 | if(!asn1_collect(NULL, &p, plen, inf, -1, -1)) goto err; | ||
| 648 | len = p - cont; | ||
| 649 | } else { | ||
| 650 | len = p - cont + plen; | ||
| 651 | p += plen; | ||
| 652 | buf.data = NULL; | ||
| 653 | } | ||
| 654 | } else if(cst) { | ||
| 655 | buf.length = 0; | ||
| 656 | buf.max = 0; | ||
| 657 | buf.data = NULL; | ||
| 658 | /* Should really check the internal tags are correct but | ||
| 659 | * some things may get this wrong. The relevant specs | ||
| 660 | * say that constructed string types should be OCTET STRINGs | ||
| 661 | * internally irrespective of the type. So instead just check | ||
| 662 | * for UNIVERSAL class and ignore the tag. | ||
| 663 | */ | ||
| 664 | if(!asn1_collect(&buf, &p, plen, inf, -1, V_ASN1_UNIVERSAL)) goto err; | ||
| 665 | len = buf.length; | ||
| 666 | /* Append a final null to string */ | ||
| 667 | if(!BUF_MEM_grow(&buf, len + 1)) { | ||
| 668 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_MALLOC_FAILURE); | ||
| 669 | return 0; | ||
| 670 | } | ||
| 671 | buf.data[len] = 0; | ||
| 672 | cont = (unsigned char *)buf.data; | ||
| 673 | free_cont = 1; | ||
| 674 | } else { | ||
| 675 | cont = p; | ||
| 676 | len = plen; | ||
| 677 | p += plen; | ||
| 678 | } | ||
| 679 | |||
| 680 | /* We now have content length and type: translate into a structure */ | ||
| 681 | if(!asn1_ex_c2i(pval, cont, len, utype, &free_cont, it)) goto err; | ||
| 682 | |||
| 683 | *in = p; | ||
| 684 | ret = 1; | ||
| 685 | err: | ||
| 686 | if(free_cont && buf.data) OPENSSL_free(buf.data); | ||
| 687 | return ret; | ||
| 688 | } | ||
| 689 | |||
| 690 | /* Translate ASN1 content octets into a structure */ | ||
| 691 | |||
| 692 | int asn1_ex_c2i(ASN1_VALUE **pval, unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it) | ||
| 693 | { | ||
| 694 | ASN1_STRING *stmp; | ||
| 695 | ASN1_TYPE *typ = NULL; | ||
| 696 | int ret = 0; | ||
| 697 | const ASN1_PRIMITIVE_FUNCS *pf; | ||
| 698 | ASN1_INTEGER **tint; | ||
| 699 | pf = it->funcs; | ||
| 700 | if(pf && pf->prim_c2i) return pf->prim_c2i(pval, cont, len, utype, free_cont, it); | ||
| 701 | /* If ANY type clear type and set pointer to internal value */ | ||
| 702 | if(it->utype == V_ASN1_ANY) { | ||
| 703 | if(!*pval) { | ||
| 704 | typ = ASN1_TYPE_new(); | ||
| 705 | *pval = (ASN1_VALUE *)typ; | ||
| 706 | } else typ = (ASN1_TYPE *)*pval; | ||
| 707 | if(utype != typ->type) ASN1_TYPE_set(typ, utype, NULL); | ||
| 708 | pval = (ASN1_VALUE **)&typ->value.ptr; | ||
| 709 | } | ||
| 710 | switch(utype) { | ||
| 711 | case V_ASN1_OBJECT: | ||
| 712 | if(!c2i_ASN1_OBJECT((ASN1_OBJECT **)pval, &cont, len)) goto err; | ||
| 713 | break; | ||
| 714 | |||
| 715 | case V_ASN1_NULL: | ||
| 716 | if(len) { | ||
| 717 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_NULL_IS_WRONG_LENGTH); | ||
| 718 | goto err; | ||
| 719 | } | ||
| 720 | *pval = (ASN1_VALUE *)1; | ||
| 721 | break; | ||
| 722 | |||
| 723 | case V_ASN1_BOOLEAN: | ||
| 724 | if(len != 1) { | ||
| 725 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_BOOLEAN_IS_WRONG_LENGTH); | ||
| 726 | goto err; | ||
| 727 | } else { | ||
| 728 | ASN1_BOOLEAN *tbool; | ||
| 729 | tbool = (ASN1_BOOLEAN *)pval; | ||
| 730 | *tbool = *cont; | ||
| 731 | } | ||
| 732 | break; | ||
| 733 | |||
| 734 | case V_ASN1_BIT_STRING: | ||
| 735 | if(!c2i_ASN1_BIT_STRING((ASN1_BIT_STRING **)pval, &cont, len)) goto err; | ||
| 736 | break; | ||
| 737 | |||
| 738 | case V_ASN1_INTEGER: | ||
| 739 | case V_ASN1_NEG_INTEGER: | ||
| 740 | case V_ASN1_ENUMERATED: | ||
| 741 | case V_ASN1_NEG_ENUMERATED: | ||
| 742 | tint = (ASN1_INTEGER **)pval; | ||
| 743 | if(!c2i_ASN1_INTEGER(tint, &cont, len)) goto err; | ||
| 744 | /* Fixup type to match the expected form */ | ||
| 745 | (*tint)->type = utype | ((*tint)->type & V_ASN1_NEG); | ||
| 746 | break; | ||
| 747 | |||
| 748 | case V_ASN1_OCTET_STRING: | ||
| 749 | case V_ASN1_NUMERICSTRING: | ||
| 750 | case V_ASN1_PRINTABLESTRING: | ||
| 751 | case V_ASN1_T61STRING: | ||
| 752 | case V_ASN1_VIDEOTEXSTRING: | ||
| 753 | case V_ASN1_IA5STRING: | ||
| 754 | case V_ASN1_UTCTIME: | ||
| 755 | case V_ASN1_GENERALIZEDTIME: | ||
| 756 | case V_ASN1_GRAPHICSTRING: | ||
| 757 | case V_ASN1_VISIBLESTRING: | ||
| 758 | case V_ASN1_GENERALSTRING: | ||
| 759 | case V_ASN1_UNIVERSALSTRING: | ||
| 760 | case V_ASN1_BMPSTRING: | ||
| 761 | case V_ASN1_UTF8STRING: | ||
| 762 | case V_ASN1_OTHER: | ||
| 763 | case V_ASN1_SET: | ||
| 764 | case V_ASN1_SEQUENCE: | ||
| 765 | default: | ||
| 766 | /* All based on ASN1_STRING and handled the same */ | ||
| 767 | if(!*pval) { | ||
| 768 | stmp = ASN1_STRING_type_new(utype); | ||
| 769 | if(!stmp) { | ||
| 770 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_MALLOC_FAILURE); | ||
| 771 | goto err; | ||
| 772 | } | ||
| 773 | *pval = (ASN1_VALUE *)stmp; | ||
| 774 | } else { | ||
| 775 | stmp = (ASN1_STRING *)*pval; | ||
| 776 | stmp->type = utype; | ||
| 777 | } | ||
| 778 | /* If we've already allocated a buffer use it */ | ||
| 779 | if(*free_cont) { | ||
| 780 | if(stmp->data) OPENSSL_free(stmp->data); | ||
| 781 | stmp->data = cont; | ||
| 782 | stmp->length = len; | ||
| 783 | *free_cont = 0; | ||
| 784 | } else { | ||
| 785 | if(!ASN1_STRING_set(stmp, cont, len)) { | ||
| 786 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_MALLOC_FAILURE); | ||
| 787 | ASN1_STRING_free(stmp); | ||
| 788 | *pval = NULL; | ||
| 789 | goto err; | ||
| 790 | } | ||
| 791 | } | ||
| 792 | break; | ||
| 793 | } | ||
| 794 | /* If ASN1_ANY and NULL type fix up value */ | ||
| 795 | if(typ && utype==V_ASN1_NULL) typ->value.ptr = NULL; | ||
| 796 | |||
| 797 | ret = 1; | ||
| 798 | err: | ||
| 799 | if(!ret) ASN1_TYPE_free(typ); | ||
| 800 | return ret; | ||
| 801 | } | ||
| 802 | |||
| 803 | /* This function collects the asn1 data from a constructred string | ||
| 804 | * type into a buffer. The values of 'in' and 'len' should refer | ||
| 805 | * to the contents of the constructed type and 'inf' should be set | ||
| 806 | * if it is indefinite length. If 'buf' is NULL then we just want | ||
| 807 | * to find the end of the current structure: useful for indefinite | ||
| 808 | * length constructed stuff. | ||
| 809 | */ | ||
| 810 | |||
| 811 | static int asn1_collect(BUF_MEM *buf, unsigned char **in, long len, char inf, int tag, int aclass) | ||
| 812 | { | ||
| 813 | unsigned char *p, *q; | ||
| 814 | long plen; | ||
| 815 | char cst, ininf; | ||
| 816 | p = *in; | ||
| 817 | inf &= 1; | ||
| 818 | /* If no buffer and not indefinite length constructed just pass over the encoded data */ | ||
| 819 | if(!buf && !inf) { | ||
| 820 | *in += len; | ||
| 821 | return 1; | ||
| 822 | } | ||
| 823 | while(len > 0) { | ||
| 824 | q = p; | ||
| 825 | /* Check for EOC */ | ||
| 826 | if(asn1_check_eoc(&p, len)) { | ||
| 827 | /* EOC is illegal outside indefinite length constructed form */ | ||
| 828 | if(!inf) { | ||
| 829 | ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_UNEXPECTED_EOC); | ||
| 830 | return 0; | ||
| 831 | } | ||
| 832 | inf = 0; | ||
| 833 | break; | ||
| 834 | } | ||
| 835 | if(!asn1_check_tlen(&plen, NULL, NULL, &ininf, &cst, &p, len, tag, aclass, 0, NULL)) { | ||
| 836 | ASN1err(ASN1_F_ASN1_COLLECT, ERR_R_NESTED_ASN1_ERROR); | ||
| 837 | return 0; | ||
| 838 | } | ||
| 839 | /* If indefinite length constructed update max length */ | ||
| 840 | if(cst) { | ||
| 841 | if(!asn1_collect(buf, &p, plen, ininf, tag, aclass)) return 0; | ||
| 842 | } else { | ||
| 843 | if(!collect_data(buf, &p, plen)) return 0; | ||
| 844 | } | ||
| 845 | len -= p - q; | ||
| 846 | } | ||
| 847 | if(inf) { | ||
| 848 | ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_MISSING_EOC); | ||
| 849 | return 0; | ||
| 850 | } | ||
| 851 | *in = p; | ||
| 852 | return 1; | ||
| 853 | } | ||
| 854 | |||
| 855 | static int collect_data(BUF_MEM *buf, unsigned char **p, long plen) | ||
| 856 | { | ||
| 857 | int len; | ||
| 858 | if(buf) { | ||
| 859 | len = buf->length; | ||
| 860 | if(!BUF_MEM_grow(buf, len + plen)) { | ||
| 861 | ASN1err(ASN1_F_COLLECT_DATA, ERR_R_MALLOC_FAILURE); | ||
| 862 | return 0; | ||
| 863 | } | ||
| 864 | memcpy(buf->data + len, *p, plen); | ||
| 865 | } | ||
| 866 | *p += plen; | ||
| 867 | return 1; | ||
| 868 | } | ||
| 869 | |||
| 870 | /* Check for ASN1 EOC and swallow it if found */ | ||
| 871 | |||
| 872 | static int asn1_check_eoc(unsigned char **in, long len) | ||
| 873 | { | ||
| 874 | unsigned char *p; | ||
| 875 | if(len < 2) return 0; | ||
| 876 | p = *in; | ||
| 877 | if(!p[0] && !p[1]) { | ||
| 878 | *in += 2; | ||
| 879 | return 1; | ||
| 880 | } | ||
| 881 | return 0; | ||
| 882 | } | ||
| 883 | |||
| 884 | /* Check an ASN1 tag and length: a bit like ASN1_get_object | ||
| 885 | * but it sets the length for indefinite length constructed | ||
| 886 | * form, we don't know the exact length but we can set an | ||
| 887 | * upper bound to the amount of data available minus the | ||
| 888 | * header length just read. | ||
| 889 | */ | ||
| 890 | |||
| 891 | static int asn1_check_tlen(long *olen, int *otag, unsigned char *oclass, char *inf, char *cst, | ||
| 892 | unsigned char **in, long len, int exptag, int expclass, char opt, ASN1_TLC *ctx) | ||
| 893 | { | ||
| 894 | int i; | ||
| 895 | int ptag, pclass; | ||
| 896 | long plen; | ||
| 897 | unsigned char *p, *q; | ||
| 898 | p = *in; | ||
| 899 | q = p; | ||
| 900 | |||
| 901 | if(ctx && ctx->valid) { | ||
| 902 | i = ctx->ret; | ||
| 903 | plen = ctx->plen; | ||
| 904 | pclass = ctx->pclass; | ||
| 905 | ptag = ctx->ptag; | ||
| 906 | p += ctx->hdrlen; | ||
| 907 | } else { | ||
| 908 | i = ASN1_get_object(&p, &plen, &ptag, &pclass, len); | ||
| 909 | if(ctx) { | ||
| 910 | ctx->ret = i; | ||
| 911 | ctx->plen = plen; | ||
| 912 | ctx->pclass = pclass; | ||
| 913 | ctx->ptag = ptag; | ||
| 914 | ctx->hdrlen = p - q; | ||
| 915 | ctx->valid = 1; | ||
| 916 | /* If definite length, length + header can't exceed total | ||
| 917 | * amount of data available. | ||
| 918 | */ | ||
| 919 | if(!(i & 1) && ((plen + ctx->hdrlen) > len)) { | ||
| 920 | ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_TOO_LONG); | ||
| 921 | asn1_tlc_clear(ctx); | ||
| 922 | return 0; | ||
| 923 | } | ||
| 924 | } | ||
| 925 | } | ||
| 926 | |||
| 927 | if(i & 0x80) { | ||
| 928 | ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_BAD_OBJECT_HEADER); | ||
| 929 | asn1_tlc_clear(ctx); | ||
| 930 | return 0; | ||
| 931 | } | ||
| 932 | if(exptag >= 0) { | ||
| 933 | if((exptag != ptag) || (expclass != pclass)) { | ||
| 934 | /* If type is OPTIONAL, not an error, but indicate missing | ||
| 935 | * type. | ||
| 936 | */ | ||
| 937 | if(opt) return -1; | ||
| 938 | asn1_tlc_clear(ctx); | ||
| 939 | ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_WRONG_TAG); | ||
| 940 | return 0; | ||
| 941 | } | ||
| 942 | /* We have a tag and class match, so assume we are going to do something with it */ | ||
| 943 | asn1_tlc_clear(ctx); | ||
| 944 | } | ||
| 945 | |||
| 946 | if(i & 1) plen = len - (p - q); | ||
| 947 | |||
| 948 | if(inf) *inf = i & 1; | ||
| 949 | |||
| 950 | if(cst) *cst = i & V_ASN1_CONSTRUCTED; | ||
| 951 | |||
| 952 | if(olen) *olen = plen; | ||
| 953 | if(oclass) *oclass = pclass; | ||
| 954 | if(otag) *otag = ptag; | ||
| 955 | |||
| 956 | *in = p; | ||
| 957 | return 1; | ||
| 958 | } | ||
diff --git a/src/lib/libcrypto/asn1/tasn_enc.c b/src/lib/libcrypto/asn1/tasn_enc.c new file mode 100644 index 0000000000..f6c8ddef0a --- /dev/null +++ b/src/lib/libcrypto/asn1/tasn_enc.c | |||
| @@ -0,0 +1,497 @@ | |||
| 1 | /* tasn_enc.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 2000. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 2000 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | |||
| 60 | #include <stddef.h> | ||
| 61 | #include <string.h> | ||
| 62 | #include <openssl/asn1.h> | ||
| 63 | #include <openssl/asn1t.h> | ||
| 64 | #include <openssl/objects.h> | ||
| 65 | |||
| 66 | static int asn1_i2d_ex_primitive(ASN1_VALUE **pval, unsigned char **out, const ASN1_ITEM *it, int tag, int aclass); | ||
| 67 | static int asn1_set_seq_out(STACK_OF(ASN1_VALUE) *seq, unsigned char **out, int skcontlen, const ASN1_ITEM *item, int isset); | ||
| 68 | |||
| 69 | /* Encode an ASN1 item, this is compatible with the | ||
| 70 | * standard 'i2d' function. 'out' points to | ||
| 71 | * a buffer to output the data to, in future we will | ||
| 72 | * have more advanced versions that can output data | ||
| 73 | * a piece at a time and this will simply be a special | ||
| 74 | * case. | ||
| 75 | * | ||
| 76 | * The new i2d has one additional feature. If the output | ||
| 77 | * buffer is NULL (i.e. *out == NULL) then a buffer is | ||
| 78 | * allocated and populated with the encoding. | ||
| 79 | */ | ||
| 80 | |||
| 81 | |||
| 82 | int ASN1_item_i2d(ASN1_VALUE *val, unsigned char **out, const ASN1_ITEM *it) | ||
| 83 | { | ||
| 84 | if(out && !*out) { | ||
| 85 | unsigned char *p, *buf; | ||
| 86 | int len; | ||
| 87 | len = ASN1_item_ex_i2d(&val, NULL, it, -1, 0); | ||
| 88 | if(len <= 0) return len; | ||
| 89 | buf = OPENSSL_malloc(len); | ||
| 90 | if(!buf) return -1; | ||
| 91 | p = buf; | ||
| 92 | ASN1_item_ex_i2d(&val, &p, it, -1, 0); | ||
| 93 | *out = buf; | ||
| 94 | return len; | ||
| 95 | } | ||
| 96 | |||
| 97 | return ASN1_item_ex_i2d(&val, out, it, -1, 0); | ||
| 98 | } | ||
| 99 | |||
| 100 | /* Encode an item, taking care of IMPLICIT tagging (if any). | ||
| 101 | * This function performs the normal item handling: it can be | ||
| 102 | * used in external types. | ||
| 103 | */ | ||
| 104 | |||
| 105 | int ASN1_item_ex_i2d(ASN1_VALUE **pval, unsigned char **out, const ASN1_ITEM *it, int tag, int aclass) | ||
| 106 | { | ||
| 107 | const ASN1_TEMPLATE *tt = NULL; | ||
| 108 | unsigned char *p = NULL; | ||
| 109 | int i, seqcontlen, seqlen; | ||
| 110 | ASN1_STRING *strtmp; | ||
| 111 | const ASN1_COMPAT_FUNCS *cf; | ||
| 112 | const ASN1_EXTERN_FUNCS *ef; | ||
| 113 | const ASN1_AUX *aux = it->funcs; | ||
| 114 | ASN1_aux_cb *asn1_cb; | ||
| 115 | if((it->itype != ASN1_ITYPE_PRIMITIVE) && !*pval) return 0; | ||
| 116 | if(aux && aux->asn1_cb) asn1_cb = aux->asn1_cb; | ||
| 117 | else asn1_cb = 0; | ||
| 118 | |||
| 119 | switch(it->itype) { | ||
| 120 | |||
| 121 | case ASN1_ITYPE_PRIMITIVE: | ||
| 122 | if(it->templates) | ||
| 123 | return ASN1_template_i2d(pval, out, it->templates); | ||
| 124 | return asn1_i2d_ex_primitive(pval, out, it, tag, aclass); | ||
| 125 | break; | ||
| 126 | |||
| 127 | case ASN1_ITYPE_MSTRING: | ||
| 128 | strtmp = (ASN1_STRING *)*pval; | ||
| 129 | return asn1_i2d_ex_primitive(pval, out, it, -1, 0); | ||
| 130 | |||
| 131 | case ASN1_ITYPE_CHOICE: | ||
| 132 | if(asn1_cb && !asn1_cb(ASN1_OP_I2D_PRE, pval, it)) | ||
| 133 | return 0; | ||
| 134 | i = asn1_get_choice_selector(pval, it); | ||
| 135 | if((i >= 0) && (i < it->tcount)) { | ||
| 136 | ASN1_VALUE **pchval; | ||
| 137 | const ASN1_TEMPLATE *chtt; | ||
| 138 | chtt = it->templates + i; | ||
| 139 | pchval = asn1_get_field_ptr(pval, chtt); | ||
| 140 | return ASN1_template_i2d(pchval, out, chtt); | ||
| 141 | } | ||
| 142 | /* Fixme: error condition if selector out of range */ | ||
| 143 | if(asn1_cb && !asn1_cb(ASN1_OP_I2D_POST, pval, it)) | ||
| 144 | return 0; | ||
| 145 | break; | ||
| 146 | |||
| 147 | case ASN1_ITYPE_EXTERN: | ||
| 148 | /* If new style i2d it does all the work */ | ||
| 149 | ef = it->funcs; | ||
| 150 | return ef->asn1_ex_i2d(pval, out, it, tag, aclass); | ||
| 151 | |||
| 152 | case ASN1_ITYPE_COMPAT: | ||
| 153 | /* old style hackery... */ | ||
| 154 | cf = it->funcs; | ||
| 155 | if(out) p = *out; | ||
| 156 | i = cf->asn1_i2d(*pval, out); | ||
| 157 | /* Fixup for IMPLICIT tag: note this messes up for tags > 30, | ||
| 158 | * but so did the old code. Tags > 30 are very rare anyway. | ||
| 159 | */ | ||
| 160 | if(out && (tag != -1)) | ||
| 161 | *p = aclass | tag | (*p & V_ASN1_CONSTRUCTED); | ||
| 162 | return i; | ||
| 163 | |||
| 164 | case ASN1_ITYPE_SEQUENCE: | ||
| 165 | i = asn1_enc_restore(&seqcontlen, out, pval, it); | ||
| 166 | /* An error occurred */ | ||
| 167 | if(i < 0) return 0; | ||
| 168 | /* We have a valid cached encoding... */ | ||
| 169 | if(i > 0) return seqcontlen; | ||
| 170 | /* Otherwise carry on */ | ||
| 171 | seqcontlen = 0; | ||
| 172 | /* If no IMPLICIT tagging set to SEQUENCE, UNIVERSAL */ | ||
| 173 | if(tag == -1) { | ||
| 174 | tag = V_ASN1_SEQUENCE; | ||
| 175 | aclass = V_ASN1_UNIVERSAL; | ||
| 176 | } | ||
| 177 | if(asn1_cb && !asn1_cb(ASN1_OP_I2D_PRE, pval, it)) | ||
| 178 | return 0; | ||
| 179 | /* First work out sequence content length */ | ||
| 180 | for(i = 0, tt = it->templates; i < it->tcount; tt++, i++) { | ||
| 181 | const ASN1_TEMPLATE *seqtt; | ||
| 182 | ASN1_VALUE **pseqval; | ||
| 183 | seqtt = asn1_do_adb(pval, tt, 1); | ||
| 184 | if(!seqtt) return 0; | ||
| 185 | pseqval = asn1_get_field_ptr(pval, seqtt); | ||
| 186 | /* FIXME: check for errors in enhanced version */ | ||
| 187 | /* FIXME: special handling of indefinite length encoding */ | ||
| 188 | seqcontlen += ASN1_template_i2d(pseqval, NULL, seqtt); | ||
| 189 | } | ||
| 190 | seqlen = ASN1_object_size(1, seqcontlen, tag); | ||
| 191 | if(!out) return seqlen; | ||
| 192 | /* Output SEQUENCE header */ | ||
| 193 | ASN1_put_object(out, 1, seqcontlen, tag, aclass); | ||
| 194 | for(i = 0, tt = it->templates; i < it->tcount; tt++, i++) { | ||
| 195 | const ASN1_TEMPLATE *seqtt; | ||
| 196 | ASN1_VALUE **pseqval; | ||
| 197 | seqtt = asn1_do_adb(pval, tt, 1); | ||
| 198 | if(!seqtt) return 0; | ||
| 199 | pseqval = asn1_get_field_ptr(pval, seqtt); | ||
| 200 | /* FIXME: check for errors in enhanced version */ | ||
| 201 | ASN1_template_i2d(pseqval, out, seqtt); | ||
| 202 | } | ||
| 203 | if(asn1_cb && !asn1_cb(ASN1_OP_I2D_POST, pval, it)) | ||
| 204 | return 0; | ||
| 205 | return seqlen; | ||
| 206 | |||
| 207 | default: | ||
| 208 | return 0; | ||
| 209 | } | ||
| 210 | return 0; | ||
| 211 | } | ||
| 212 | |||
| 213 | int ASN1_template_i2d(ASN1_VALUE **pval, unsigned char **out, const ASN1_TEMPLATE *tt) | ||
| 214 | { | ||
| 215 | int i, ret, flags, aclass; | ||
| 216 | flags = tt->flags; | ||
| 217 | aclass = flags & ASN1_TFLG_TAG_CLASS; | ||
| 218 | if(flags & ASN1_TFLG_SK_MASK) { | ||
| 219 | /* SET OF, SEQUENCE OF */ | ||
| 220 | STACK_OF(ASN1_VALUE) *sk = (STACK_OF(ASN1_VALUE) *)*pval; | ||
| 221 | int isset, sktag, skaclass; | ||
| 222 | int skcontlen, sklen; | ||
| 223 | ASN1_VALUE *skitem; | ||
| 224 | if(!*pval) return 0; | ||
| 225 | if(flags & ASN1_TFLG_SET_OF) { | ||
| 226 | isset = 1; | ||
| 227 | /* 2 means we reorder */ | ||
| 228 | if(flags & ASN1_TFLG_SEQUENCE_OF) isset = 2; | ||
| 229 | } else isset = 0; | ||
| 230 | /* First work out inner tag value */ | ||
| 231 | if(flags & ASN1_TFLG_IMPTAG) { | ||
| 232 | sktag = tt->tag; | ||
| 233 | skaclass = aclass; | ||
| 234 | } else { | ||
| 235 | skaclass = V_ASN1_UNIVERSAL; | ||
| 236 | if(isset) sktag = V_ASN1_SET; | ||
| 237 | else sktag = V_ASN1_SEQUENCE; | ||
| 238 | } | ||
| 239 | /* Now work out length of items */ | ||
| 240 | skcontlen = 0; | ||
| 241 | for(i = 0; i < sk_ASN1_VALUE_num(sk); i++) { | ||
| 242 | skitem = sk_ASN1_VALUE_value(sk, i); | ||
| 243 | skcontlen += ASN1_item_ex_i2d(&skitem, NULL, ASN1_ITEM_ptr(tt->item), -1, 0); | ||
| 244 | } | ||
| 245 | sklen = ASN1_object_size(1, skcontlen, sktag); | ||
| 246 | /* If EXPLICIT need length of surrounding tag */ | ||
| 247 | if(flags & ASN1_TFLG_EXPTAG) | ||
| 248 | ret = ASN1_object_size(1, sklen, tt->tag); | ||
| 249 | else ret = sklen; | ||
| 250 | |||
| 251 | if(!out) return ret; | ||
| 252 | |||
| 253 | /* Now encode this lot... */ | ||
| 254 | /* EXPLICIT tag */ | ||
| 255 | if(flags & ASN1_TFLG_EXPTAG) | ||
| 256 | ASN1_put_object(out, 1, sklen, tt->tag, aclass); | ||
| 257 | /* SET or SEQUENCE and IMPLICIT tag */ | ||
| 258 | ASN1_put_object(out, 1, skcontlen, sktag, skaclass); | ||
| 259 | /* And finally the stuff itself */ | ||
| 260 | asn1_set_seq_out(sk, out, skcontlen, ASN1_ITEM_ptr(tt->item), isset); | ||
| 261 | |||
| 262 | return ret; | ||
| 263 | } | ||
| 264 | |||
| 265 | if(flags & ASN1_TFLG_EXPTAG) { | ||
| 266 | /* EXPLICIT tagging */ | ||
| 267 | /* Find length of tagged item */ | ||
| 268 | i = ASN1_item_ex_i2d(pval, NULL, ASN1_ITEM_ptr(tt->item), -1, 0); | ||
| 269 | if(!i) return 0; | ||
| 270 | /* Find length of EXPLICIT tag */ | ||
| 271 | ret = ASN1_object_size(1, i, tt->tag); | ||
| 272 | if(out) { | ||
| 273 | /* Output tag and item */ | ||
| 274 | ASN1_put_object(out, 1, i, tt->tag, aclass); | ||
| 275 | ASN1_item_ex_i2d(pval, out, ASN1_ITEM_ptr(tt->item), -1, 0); | ||
| 276 | } | ||
| 277 | return ret; | ||
| 278 | } | ||
| 279 | if(flags & ASN1_TFLG_IMPTAG) { | ||
| 280 | /* IMPLICIT tagging */ | ||
| 281 | return ASN1_item_ex_i2d(pval, out, ASN1_ITEM_ptr(tt->item), tt->tag, aclass); | ||
| 282 | } | ||
| 283 | /* Nothing special: treat as normal */ | ||
| 284 | return ASN1_item_ex_i2d(pval, out, ASN1_ITEM_ptr(tt->item), -1, 0); | ||
| 285 | } | ||
| 286 | |||
| 287 | /* Temporary structure used to hold DER encoding of items for SET OF */ | ||
| 288 | |||
| 289 | typedef struct { | ||
| 290 | unsigned char *data; | ||
| 291 | int length; | ||
| 292 | ASN1_VALUE *field; | ||
| 293 | } DER_ENC; | ||
| 294 | |||
| 295 | static int der_cmp(const void *a, const void *b) | ||
| 296 | { | ||
| 297 | const DER_ENC *d1 = a, *d2 = b; | ||
| 298 | int cmplen, i; | ||
| 299 | cmplen = (d1->length < d2->length) ? d1->length : d2->length; | ||
| 300 | i = memcmp(d1->data, d2->data, cmplen); | ||
| 301 | if(i) return i; | ||
| 302 | return d1->length - d2->length; | ||
| 303 | } | ||
| 304 | |||
| 305 | /* Output the content octets of SET OF or SEQUENCE OF */ | ||
| 306 | |||
| 307 | static int asn1_set_seq_out(STACK_OF(ASN1_VALUE) *sk, unsigned char **out, int skcontlen, const ASN1_ITEM *item, int do_sort) | ||
| 308 | { | ||
| 309 | int i; | ||
| 310 | ASN1_VALUE *skitem; | ||
| 311 | unsigned char *tmpdat = NULL, *p = NULL; | ||
| 312 | DER_ENC *derlst = NULL, *tder; | ||
| 313 | if(do_sort) { | ||
| 314 | /* Don't need to sort less than 2 items */ | ||
| 315 | if(sk_ASN1_VALUE_num(sk) < 2) do_sort = 0; | ||
| 316 | else { | ||
| 317 | derlst = OPENSSL_malloc(sk_ASN1_VALUE_num(sk) * sizeof(*derlst)); | ||
| 318 | tmpdat = OPENSSL_malloc(skcontlen); | ||
| 319 | if(!derlst || !tmpdat) return 0; | ||
| 320 | } | ||
| 321 | } | ||
| 322 | /* If not sorting just output each item */ | ||
| 323 | if(!do_sort) { | ||
| 324 | for(i = 0; i < sk_ASN1_VALUE_num(sk); i++) { | ||
| 325 | skitem = sk_ASN1_VALUE_value(sk, i); | ||
| 326 | ASN1_item_i2d(skitem, out, item); | ||
| 327 | } | ||
| 328 | return 1; | ||
| 329 | } | ||
| 330 | p = tmpdat; | ||
| 331 | /* Doing sort: build up a list of each member's DER encoding */ | ||
| 332 | for(i = 0, tder = derlst; i < sk_ASN1_VALUE_num(sk); i++, tder++) { | ||
| 333 | skitem = sk_ASN1_VALUE_value(sk, i); | ||
| 334 | tder->data = p; | ||
| 335 | tder->length = ASN1_item_i2d(skitem, &p, item); | ||
| 336 | tder->field = skitem; | ||
| 337 | } | ||
| 338 | /* Now sort them */ | ||
| 339 | qsort(derlst, sk_ASN1_VALUE_num(sk), sizeof(*derlst), der_cmp); | ||
| 340 | /* Output sorted DER encoding */ | ||
| 341 | p = *out; | ||
| 342 | for(i = 0, tder = derlst; i < sk_ASN1_VALUE_num(sk); i++, tder++) { | ||
| 343 | memcpy(p, tder->data, tder->length); | ||
| 344 | p += tder->length; | ||
| 345 | } | ||
| 346 | *out = p; | ||
| 347 | /* If do_sort is 2 then reorder the STACK */ | ||
| 348 | if(do_sort == 2) { | ||
| 349 | for(i = 0, tder = derlst; i < sk_ASN1_VALUE_num(sk); i++, tder++) | ||
| 350 | sk_ASN1_VALUE_set(sk, i, tder->field); | ||
| 351 | } | ||
| 352 | OPENSSL_free(derlst); | ||
| 353 | OPENSSL_free(tmpdat); | ||
| 354 | return 1; | ||
| 355 | } | ||
| 356 | |||
| 357 | static int asn1_i2d_ex_primitive(ASN1_VALUE **pval, unsigned char **out, const ASN1_ITEM *it, int tag, int aclass) | ||
| 358 | { | ||
| 359 | int len; | ||
| 360 | int utype; | ||
| 361 | int usetag; | ||
| 362 | |||
| 363 | utype = it->utype; | ||
| 364 | |||
| 365 | /* Get length of content octets and maybe find | ||
| 366 | * out the underlying type. | ||
| 367 | */ | ||
| 368 | |||
| 369 | len = asn1_ex_i2c(pval, NULL, &utype, it); | ||
| 370 | |||
| 371 | /* If SEQUENCE, SET or OTHER then header is | ||
| 372 | * included in pseudo content octets so don't | ||
| 373 | * include tag+length. We need to check here | ||
| 374 | * because the call to asn1_ex_i2c() could change | ||
| 375 | * utype. | ||
| 376 | */ | ||
| 377 | if((utype == V_ASN1_SEQUENCE) || (utype == V_ASN1_SET) || | ||
| 378 | (utype == V_ASN1_OTHER)) | ||
| 379 | usetag = 0; | ||
| 380 | else usetag = 1; | ||
| 381 | |||
| 382 | /* -1 means omit type */ | ||
| 383 | |||
| 384 | if(len == -1) return 0; | ||
| 385 | |||
| 386 | /* If not implicitly tagged get tag from underlying type */ | ||
| 387 | if(tag == -1) tag = utype; | ||
| 388 | |||
| 389 | /* Output tag+length followed by content octets */ | ||
| 390 | if(out) { | ||
| 391 | if(usetag) ASN1_put_object(out, 0, len, tag, aclass); | ||
| 392 | asn1_ex_i2c(pval, *out, &utype, it); | ||
| 393 | *out += len; | ||
| 394 | } | ||
| 395 | |||
| 396 | if(usetag) return ASN1_object_size(0, len, tag); | ||
| 397 | return len; | ||
| 398 | } | ||
| 399 | |||
| 400 | /* Produce content octets from a structure */ | ||
| 401 | |||
| 402 | int asn1_ex_i2c(ASN1_VALUE **pval, unsigned char *cout, int *putype, const ASN1_ITEM *it) | ||
| 403 | { | ||
| 404 | ASN1_BOOLEAN *tbool = NULL; | ||
| 405 | ASN1_STRING *strtmp; | ||
| 406 | ASN1_OBJECT *otmp; | ||
| 407 | int utype; | ||
| 408 | unsigned char *cont, c; | ||
| 409 | int len; | ||
| 410 | const ASN1_PRIMITIVE_FUNCS *pf; | ||
| 411 | pf = it->funcs; | ||
| 412 | if(pf && pf->prim_i2c) return pf->prim_i2c(pval, cout, putype, it); | ||
| 413 | |||
| 414 | /* Should type be omitted? */ | ||
| 415 | if((it->itype != ASN1_ITYPE_PRIMITIVE) || (it->utype != V_ASN1_BOOLEAN)) { | ||
| 416 | if(!*pval) return -1; | ||
| 417 | } | ||
| 418 | |||
| 419 | if(it->itype == ASN1_ITYPE_MSTRING) { | ||
| 420 | /* If MSTRING type set the underlying type */ | ||
| 421 | strtmp = (ASN1_STRING *)*pval; | ||
| 422 | utype = strtmp->type; | ||
| 423 | *putype = utype; | ||
| 424 | } else if(it->utype == V_ASN1_ANY) { | ||
| 425 | /* If ANY set type and pointer to value */ | ||
| 426 | ASN1_TYPE *typ; | ||
| 427 | typ = (ASN1_TYPE *)*pval; | ||
| 428 | utype = typ->type; | ||
| 429 | *putype = utype; | ||
| 430 | pval = (ASN1_VALUE **)&typ->value.ptr; | ||
| 431 | } else utype = *putype; | ||
| 432 | |||
| 433 | switch(utype) { | ||
| 434 | case V_ASN1_OBJECT: | ||
| 435 | otmp = (ASN1_OBJECT *)*pval; | ||
| 436 | cont = otmp->data; | ||
| 437 | len = otmp->length; | ||
| 438 | break; | ||
| 439 | |||
| 440 | case V_ASN1_NULL: | ||
| 441 | cont = NULL; | ||
| 442 | len = 0; | ||
| 443 | break; | ||
| 444 | |||
| 445 | case V_ASN1_BOOLEAN: | ||
| 446 | tbool = (ASN1_BOOLEAN *)pval; | ||
| 447 | if(*tbool == -1) return -1; | ||
| 448 | /* Default handling if value == size field then omit */ | ||
| 449 | if(*tbool && (it->size > 0)) return -1; | ||
| 450 | if(!*tbool && !it->size) return -1; | ||
| 451 | c = (unsigned char)*tbool; | ||
| 452 | cont = &c; | ||
| 453 | len = 1; | ||
| 454 | break; | ||
| 455 | |||
| 456 | case V_ASN1_BIT_STRING: | ||
| 457 | return i2c_ASN1_BIT_STRING((ASN1_BIT_STRING *)*pval, cout ? &cout : NULL); | ||
| 458 | break; | ||
| 459 | |||
| 460 | case V_ASN1_INTEGER: | ||
| 461 | case V_ASN1_NEG_INTEGER: | ||
| 462 | case V_ASN1_ENUMERATED: | ||
| 463 | case V_ASN1_NEG_ENUMERATED: | ||
| 464 | /* These are all have the same content format | ||
| 465 | * as ASN1_INTEGER | ||
| 466 | */ | ||
| 467 | return i2c_ASN1_INTEGER((ASN1_INTEGER *)*pval, cout ? &cout : NULL); | ||
| 468 | break; | ||
| 469 | |||
| 470 | case V_ASN1_OCTET_STRING: | ||
| 471 | case V_ASN1_NUMERICSTRING: | ||
| 472 | case V_ASN1_PRINTABLESTRING: | ||
| 473 | case V_ASN1_T61STRING: | ||
| 474 | case V_ASN1_VIDEOTEXSTRING: | ||
| 475 | case V_ASN1_IA5STRING: | ||
| 476 | case V_ASN1_UTCTIME: | ||
| 477 | case V_ASN1_GENERALIZEDTIME: | ||
| 478 | case V_ASN1_GRAPHICSTRING: | ||
| 479 | case V_ASN1_VISIBLESTRING: | ||
| 480 | case V_ASN1_GENERALSTRING: | ||
| 481 | case V_ASN1_UNIVERSALSTRING: | ||
| 482 | case V_ASN1_BMPSTRING: | ||
| 483 | case V_ASN1_UTF8STRING: | ||
| 484 | case V_ASN1_SEQUENCE: | ||
| 485 | case V_ASN1_SET: | ||
| 486 | default: | ||
| 487 | /* All based on ASN1_STRING and handled the same */ | ||
| 488 | strtmp = (ASN1_STRING *)*pval; | ||
| 489 | cont = strtmp->data; | ||
| 490 | len = strtmp->length; | ||
| 491 | |||
| 492 | break; | ||
| 493 | |||
| 494 | } | ||
| 495 | if(cout && len) memcpy(cout, cont, len); | ||
| 496 | return len; | ||
| 497 | } | ||
diff --git a/src/lib/libcrypto/asn1/tasn_fre.c b/src/lib/libcrypto/asn1/tasn_fre.c new file mode 100644 index 0000000000..c7610776f2 --- /dev/null +++ b/src/lib/libcrypto/asn1/tasn_fre.c | |||
| @@ -0,0 +1,226 @@ | |||
| 1 | /* tasn_fre.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 2000. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 2000 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | |||
| 60 | #include <stddef.h> | ||
| 61 | #include <openssl/asn1.h> | ||
| 62 | #include <openssl/asn1t.h> | ||
| 63 | #include <openssl/objects.h> | ||
| 64 | |||
| 65 | static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine); | ||
| 66 | |||
| 67 | /* Free up an ASN1 structure */ | ||
| 68 | |||
| 69 | void ASN1_item_free(ASN1_VALUE *val, const ASN1_ITEM *it) | ||
| 70 | { | ||
| 71 | asn1_item_combine_free(&val, it, 0); | ||
| 72 | } | ||
| 73 | |||
| 74 | void ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it) | ||
| 75 | { | ||
| 76 | asn1_item_combine_free(pval, it, 0); | ||
| 77 | } | ||
| 78 | |||
| 79 | static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine) | ||
| 80 | { | ||
| 81 | const ASN1_TEMPLATE *tt = NULL, *seqtt; | ||
| 82 | const ASN1_EXTERN_FUNCS *ef; | ||
| 83 | const ASN1_COMPAT_FUNCS *cf; | ||
| 84 | const ASN1_AUX *aux = it->funcs; | ||
| 85 | ASN1_aux_cb *asn1_cb; | ||
| 86 | int i; | ||
| 87 | if(!pval) return; | ||
| 88 | if((it->itype != ASN1_ITYPE_PRIMITIVE) && !*pval) return; | ||
| 89 | if(aux && aux->asn1_cb) asn1_cb = aux->asn1_cb; | ||
| 90 | else asn1_cb = 0; | ||
| 91 | |||
| 92 | switch(it->itype) { | ||
| 93 | |||
| 94 | case ASN1_ITYPE_PRIMITIVE: | ||
| 95 | if(it->templates) ASN1_template_free(pval, it->templates); | ||
| 96 | else ASN1_primitive_free(pval, it); | ||
| 97 | break; | ||
| 98 | |||
| 99 | case ASN1_ITYPE_MSTRING: | ||
| 100 | ASN1_primitive_free(pval, it); | ||
| 101 | break; | ||
| 102 | |||
| 103 | case ASN1_ITYPE_CHOICE: | ||
| 104 | if(asn1_cb) { | ||
| 105 | i = asn1_cb(ASN1_OP_FREE_PRE, pval, it); | ||
| 106 | if(i == 2) return; | ||
| 107 | } | ||
| 108 | i = asn1_get_choice_selector(pval, it); | ||
| 109 | if(asn1_cb) asn1_cb(ASN1_OP_FREE_PRE, pval, it); | ||
| 110 | if((i >= 0) && (i < it->tcount)) { | ||
| 111 | ASN1_VALUE **pchval; | ||
| 112 | tt = it->templates + i; | ||
| 113 | pchval = asn1_get_field_ptr(pval, tt); | ||
| 114 | ASN1_template_free(pchval, tt); | ||
| 115 | } | ||
| 116 | if(asn1_cb) asn1_cb(ASN1_OP_FREE_POST, pval, it); | ||
| 117 | if(!combine) { | ||
| 118 | OPENSSL_free(*pval); | ||
| 119 | *pval = NULL; | ||
| 120 | } | ||
| 121 | break; | ||
| 122 | |||
| 123 | case ASN1_ITYPE_COMPAT: | ||
| 124 | cf = it->funcs; | ||
| 125 | if(cf && cf->asn1_free) cf->asn1_free(*pval); | ||
| 126 | break; | ||
| 127 | |||
| 128 | case ASN1_ITYPE_EXTERN: | ||
| 129 | ef = it->funcs; | ||
| 130 | if(ef && ef->asn1_ex_free) ef->asn1_ex_free(pval, it); | ||
| 131 | break; | ||
| 132 | |||
| 133 | case ASN1_ITYPE_SEQUENCE: | ||
| 134 | if(asn1_do_lock(pval, -1, it) > 0) return; | ||
| 135 | if(asn1_cb) { | ||
| 136 | i = asn1_cb(ASN1_OP_FREE_PRE, pval, it); | ||
| 137 | if(i == 2) return; | ||
| 138 | } | ||
| 139 | asn1_enc_free(pval, it); | ||
| 140 | /* If we free up as normal we will invalidate any | ||
| 141 | * ANY DEFINED BY field and we wont be able to | ||
| 142 | * determine the type of the field it defines. So | ||
| 143 | * free up in reverse order. | ||
| 144 | */ | ||
| 145 | tt = it->templates + it->tcount - 1; | ||
| 146 | for(i = 0; i < it->tcount; tt--, i++) { | ||
| 147 | ASN1_VALUE **pseqval; | ||
| 148 | seqtt = asn1_do_adb(pval, tt, 0); | ||
| 149 | if(!seqtt) continue; | ||
| 150 | pseqval = asn1_get_field_ptr(pval, seqtt); | ||
| 151 | ASN1_template_free(pseqval, seqtt); | ||
| 152 | } | ||
| 153 | if(asn1_cb) asn1_cb(ASN1_OP_FREE_POST, pval, it); | ||
| 154 | if(!combine) { | ||
| 155 | OPENSSL_free(*pval); | ||
| 156 | *pval = NULL; | ||
| 157 | } | ||
| 158 | break; | ||
| 159 | } | ||
| 160 | } | ||
| 161 | |||
| 162 | void ASN1_template_free(ASN1_VALUE **pval, const ASN1_TEMPLATE *tt) | ||
| 163 | { | ||
| 164 | int i; | ||
| 165 | if(tt->flags & ASN1_TFLG_SK_MASK) { | ||
| 166 | STACK_OF(ASN1_VALUE) *sk = (STACK_OF(ASN1_VALUE) *)*pval; | ||
| 167 | for(i = 0; i < sk_ASN1_VALUE_num(sk); i++) { | ||
| 168 | ASN1_VALUE *vtmp; | ||
| 169 | vtmp = sk_ASN1_VALUE_value(sk, i); | ||
| 170 | asn1_item_combine_free(&vtmp, ASN1_ITEM_ptr(tt->item), 0); | ||
| 171 | } | ||
| 172 | sk_ASN1_VALUE_free(sk); | ||
| 173 | *pval = NULL; | ||
| 174 | } else asn1_item_combine_free(pval, ASN1_ITEM_ptr(tt->item), | ||
| 175 | tt->flags & ASN1_TFLG_COMBINE); | ||
| 176 | } | ||
| 177 | |||
| 178 | void ASN1_primitive_free(ASN1_VALUE **pval, const ASN1_ITEM *it) | ||
| 179 | { | ||
| 180 | int utype; | ||
| 181 | if(it) { | ||
| 182 | const ASN1_PRIMITIVE_FUNCS *pf; | ||
| 183 | pf = it->funcs; | ||
| 184 | if(pf && pf->prim_free) { | ||
| 185 | pf->prim_free(pval, it); | ||
| 186 | return; | ||
| 187 | } | ||
| 188 | } | ||
| 189 | /* Special case: if 'it' is NULL free contents of ASN1_TYPE */ | ||
| 190 | if(!it) { | ||
| 191 | ASN1_TYPE *typ = (ASN1_TYPE *)*pval; | ||
| 192 | utype = typ->type; | ||
| 193 | pval = (ASN1_VALUE **)&typ->value.ptr; | ||
| 194 | if(!*pval) return; | ||
| 195 | } else if(it->itype == ASN1_ITYPE_MSTRING) { | ||
| 196 | utype = -1; | ||
| 197 | if(!*pval) return; | ||
| 198 | } else { | ||
| 199 | utype = it->utype; | ||
| 200 | if((utype != V_ASN1_BOOLEAN) && !*pval) return; | ||
| 201 | } | ||
| 202 | |||
| 203 | switch(utype) { | ||
| 204 | case V_ASN1_OBJECT: | ||
| 205 | ASN1_OBJECT_free((ASN1_OBJECT *)*pval); | ||
| 206 | break; | ||
| 207 | |||
| 208 | case V_ASN1_BOOLEAN: | ||
| 209 | *(ASN1_BOOLEAN *)pval = it->size; | ||
| 210 | return; | ||
| 211 | |||
| 212 | case V_ASN1_NULL: | ||
| 213 | break; | ||
| 214 | |||
| 215 | case V_ASN1_ANY: | ||
| 216 | ASN1_primitive_free(pval, NULL); | ||
| 217 | OPENSSL_free(*pval); | ||
| 218 | break; | ||
| 219 | |||
| 220 | default: | ||
| 221 | ASN1_STRING_free((ASN1_STRING *)*pval); | ||
| 222 | *pval = NULL; | ||
| 223 | break; | ||
| 224 | } | ||
| 225 | *pval = NULL; | ||
| 226 | } | ||
diff --git a/src/lib/libcrypto/asn1/tasn_new.c b/src/lib/libcrypto/asn1/tasn_new.c new file mode 100644 index 0000000000..e33861f864 --- /dev/null +++ b/src/lib/libcrypto/asn1/tasn_new.c | |||
| @@ -0,0 +1,348 @@ | |||
| 1 | /* tasn_new.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 2000. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 2000 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | |||
| 60 | #include <stddef.h> | ||
| 61 | #include <openssl/asn1.h> | ||
| 62 | #include <openssl/objects.h> | ||
| 63 | #include <openssl/err.h> | ||
| 64 | #include <openssl/asn1t.h> | ||
| 65 | #include <string.h> | ||
| 66 | |||
| 67 | static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine); | ||
| 68 | static void asn1_item_clear(ASN1_VALUE **pval, const ASN1_ITEM *it); | ||
| 69 | static void asn1_template_clear(ASN1_VALUE **pval, const ASN1_TEMPLATE *tt); | ||
| 70 | void asn1_primitive_clear(ASN1_VALUE **pval, const ASN1_ITEM *it); | ||
| 71 | |||
| 72 | ASN1_VALUE *ASN1_item_new(const ASN1_ITEM *it) | ||
| 73 | { | ||
| 74 | ASN1_VALUE *ret = NULL; | ||
| 75 | if(ASN1_item_ex_new(&ret, it) > 0) return ret; | ||
| 76 | return NULL; | ||
| 77 | } | ||
| 78 | |||
| 79 | /* Allocate an ASN1 structure */ | ||
| 80 | |||
| 81 | int ASN1_item_ex_new(ASN1_VALUE **pval, const ASN1_ITEM *it) | ||
| 82 | { | ||
| 83 | return asn1_item_ex_combine_new(pval, it, 0); | ||
| 84 | } | ||
| 85 | |||
| 86 | static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine) | ||
| 87 | { | ||
| 88 | const ASN1_TEMPLATE *tt = NULL; | ||
| 89 | const ASN1_COMPAT_FUNCS *cf; | ||
| 90 | const ASN1_EXTERN_FUNCS *ef; | ||
| 91 | const ASN1_AUX *aux = it->funcs; | ||
| 92 | ASN1_aux_cb *asn1_cb; | ||
| 93 | ASN1_VALUE **pseqval; | ||
| 94 | int i; | ||
| 95 | if(aux && aux->asn1_cb) asn1_cb = aux->asn1_cb; | ||
| 96 | else asn1_cb = 0; | ||
| 97 | |||
| 98 | if(!combine) *pval = NULL; | ||
| 99 | |||
| 100 | #ifdef CRYPTO_MDEBUG | ||
| 101 | if(it->sname) CRYPTO_push_info(it->sname); | ||
| 102 | #endif | ||
| 103 | |||
| 104 | switch(it->itype) { | ||
| 105 | |||
| 106 | case ASN1_ITYPE_EXTERN: | ||
| 107 | ef = it->funcs; | ||
| 108 | if(ef && ef->asn1_ex_new) { | ||
| 109 | if(!ef->asn1_ex_new(pval, it)) | ||
| 110 | goto memerr; | ||
| 111 | } | ||
| 112 | break; | ||
| 113 | |||
| 114 | case ASN1_ITYPE_COMPAT: | ||
| 115 | cf = it->funcs; | ||
| 116 | if(cf && cf->asn1_new) { | ||
| 117 | *pval = cf->asn1_new(); | ||
| 118 | if(!*pval) goto memerr; | ||
| 119 | } | ||
| 120 | break; | ||
| 121 | |||
| 122 | case ASN1_ITYPE_PRIMITIVE: | ||
| 123 | if(it->templates) { | ||
| 124 | if(!ASN1_template_new(pval, it->templates)) | ||
| 125 | goto memerr; | ||
| 126 | } else { | ||
| 127 | if(!ASN1_primitive_new(pval, it)) | ||
| 128 | goto memerr; | ||
| 129 | } | ||
| 130 | break; | ||
| 131 | |||
| 132 | case ASN1_ITYPE_MSTRING: | ||
| 133 | if(!ASN1_primitive_new(pval, it)) | ||
| 134 | goto memerr; | ||
| 135 | break; | ||
| 136 | |||
| 137 | case ASN1_ITYPE_CHOICE: | ||
| 138 | if(asn1_cb) { | ||
| 139 | i = asn1_cb(ASN1_OP_NEW_PRE, pval, it); | ||
| 140 | if(!i) goto auxerr; | ||
| 141 | if(i==2) { | ||
| 142 | #ifdef CRYPTO_MDEBUG | ||
| 143 | if(it->sname) CRYPTO_pop_info(); | ||
| 144 | #endif | ||
| 145 | return 1; | ||
| 146 | } | ||
| 147 | } | ||
| 148 | if(!combine) { | ||
| 149 | *pval = OPENSSL_malloc(it->size); | ||
| 150 | if(!*pval) goto memerr; | ||
| 151 | memset(*pval, 0, it->size); | ||
| 152 | } | ||
| 153 | asn1_set_choice_selector(pval, -1, it); | ||
| 154 | if(asn1_cb && !asn1_cb(ASN1_OP_NEW_POST, pval, it)) | ||
| 155 | goto auxerr; | ||
| 156 | break; | ||
| 157 | |||
| 158 | case ASN1_ITYPE_SEQUENCE: | ||
| 159 | if(asn1_cb) { | ||
| 160 | i = asn1_cb(ASN1_OP_NEW_PRE, pval, it); | ||
| 161 | if(!i) goto auxerr; | ||
| 162 | if(i==2) { | ||
| 163 | #ifdef CRYPTO_MDEBUG | ||
| 164 | if(it->sname) CRYPTO_pop_info(); | ||
| 165 | #endif | ||
| 166 | return 1; | ||
| 167 | } | ||
| 168 | } | ||
| 169 | if(!combine) { | ||
| 170 | *pval = OPENSSL_malloc(it->size); | ||
| 171 | if(!*pval) goto memerr; | ||
| 172 | memset(*pval, 0, it->size); | ||
| 173 | asn1_do_lock(pval, 0, it); | ||
| 174 | asn1_enc_init(pval, it); | ||
| 175 | } | ||
| 176 | for(i = 0, tt = it->templates; i < it->tcount; tt++, i++) { | ||
| 177 | pseqval = asn1_get_field_ptr(pval, tt); | ||
| 178 | if(!ASN1_template_new(pseqval, tt)) goto memerr; | ||
| 179 | } | ||
| 180 | if(asn1_cb && !asn1_cb(ASN1_OP_NEW_POST, pval, it)) | ||
| 181 | goto auxerr; | ||
| 182 | break; | ||
| 183 | } | ||
| 184 | #ifdef CRYPTO_MDEBUG | ||
| 185 | if(it->sname) CRYPTO_pop_info(); | ||
| 186 | #endif | ||
| 187 | return 1; | ||
| 188 | |||
| 189 | memerr: | ||
| 190 | ASN1err(ASN1_F_ASN1_ITEM_NEW, ERR_R_MALLOC_FAILURE); | ||
| 191 | #ifdef CRYPTO_MDEBUG | ||
| 192 | if(it->sname) CRYPTO_pop_info(); | ||
| 193 | #endif | ||
| 194 | return 0; | ||
| 195 | |||
| 196 | auxerr: | ||
| 197 | ASN1err(ASN1_F_ASN1_ITEM_NEW, ASN1_R_AUX_ERROR); | ||
| 198 | ASN1_item_ex_free(pval, it); | ||
| 199 | #ifdef CRYPTO_MDEBUG | ||
| 200 | if(it->sname) CRYPTO_pop_info(); | ||
| 201 | #endif | ||
| 202 | return 0; | ||
| 203 | |||
| 204 | } | ||
| 205 | |||
| 206 | static void asn1_item_clear(ASN1_VALUE **pval, const ASN1_ITEM *it) | ||
| 207 | { | ||
| 208 | const ASN1_EXTERN_FUNCS *ef; | ||
| 209 | |||
| 210 | switch(it->itype) { | ||
| 211 | |||
| 212 | case ASN1_ITYPE_EXTERN: | ||
| 213 | ef = it->funcs; | ||
| 214 | if(ef && ef->asn1_ex_clear) | ||
| 215 | ef->asn1_ex_clear(pval, it); | ||
| 216 | else *pval = NULL; | ||
| 217 | break; | ||
| 218 | |||
| 219 | |||
| 220 | case ASN1_ITYPE_PRIMITIVE: | ||
| 221 | if(it->templates) | ||
| 222 | asn1_template_clear(pval, it->templates); | ||
| 223 | else | ||
| 224 | asn1_primitive_clear(pval, it); | ||
| 225 | break; | ||
| 226 | |||
| 227 | case ASN1_ITYPE_MSTRING: | ||
| 228 | asn1_primitive_clear(pval, it); | ||
| 229 | break; | ||
| 230 | |||
| 231 | case ASN1_ITYPE_COMPAT: | ||
| 232 | case ASN1_ITYPE_CHOICE: | ||
| 233 | case ASN1_ITYPE_SEQUENCE: | ||
| 234 | *pval = NULL; | ||
| 235 | break; | ||
| 236 | } | ||
| 237 | } | ||
| 238 | |||
| 239 | |||
| 240 | int ASN1_template_new(ASN1_VALUE **pval, const ASN1_TEMPLATE *tt) | ||
| 241 | { | ||
| 242 | const ASN1_ITEM *it = ASN1_ITEM_ptr(tt->item); | ||
| 243 | int ret; | ||
| 244 | if(tt->flags & ASN1_TFLG_OPTIONAL) { | ||
| 245 | asn1_template_clear(pval, tt); | ||
| 246 | return 1; | ||
| 247 | } | ||
| 248 | /* If ANY DEFINED BY nothing to do */ | ||
| 249 | |||
| 250 | if(tt->flags & ASN1_TFLG_ADB_MASK) { | ||
| 251 | *pval = NULL; | ||
| 252 | return 1; | ||
| 253 | } | ||
| 254 | #ifdef CRYPTO_MDEBUG | ||
| 255 | if(tt->field_name) CRYPTO_push_info(tt->field_name); | ||
| 256 | #endif | ||
| 257 | /* If SET OF or SEQUENCE OF, its a STACK */ | ||
| 258 | if(tt->flags & ASN1_TFLG_SK_MASK) { | ||
| 259 | STACK_OF(ASN1_VALUE) *skval; | ||
| 260 | skval = sk_ASN1_VALUE_new_null(); | ||
| 261 | if(!skval) { | ||
| 262 | ASN1err(ASN1_F_ASN1_TEMPLATE_NEW, ERR_R_MALLOC_FAILURE); | ||
| 263 | ret = 0; | ||
| 264 | goto done; | ||
| 265 | } | ||
| 266 | *pval = (ASN1_VALUE *)skval; | ||
| 267 | ret = 1; | ||
| 268 | goto done; | ||
| 269 | } | ||
| 270 | /* Otherwise pass it back to the item routine */ | ||
| 271 | ret = asn1_item_ex_combine_new(pval, it, tt->flags & ASN1_TFLG_COMBINE); | ||
| 272 | done: | ||
| 273 | #ifdef CRYPTO_MDEBUG | ||
| 274 | if(it->sname) CRYPTO_pop_info(); | ||
| 275 | #endif | ||
| 276 | return ret; | ||
| 277 | } | ||
| 278 | |||
| 279 | static void asn1_template_clear(ASN1_VALUE **pval, const ASN1_TEMPLATE *tt) | ||
| 280 | { | ||
| 281 | /* If ADB or STACK just NULL the field */ | ||
| 282 | if(tt->flags & (ASN1_TFLG_ADB_MASK|ASN1_TFLG_SK_MASK)) | ||
| 283 | *pval = NULL; | ||
| 284 | else | ||
| 285 | asn1_item_clear(pval, ASN1_ITEM_ptr(tt->item)); | ||
| 286 | } | ||
| 287 | |||
| 288 | |||
| 289 | /* NB: could probably combine most of the real XXX_new() behaviour and junk all the old | ||
| 290 | * functions. | ||
| 291 | */ | ||
| 292 | |||
| 293 | int ASN1_primitive_new(ASN1_VALUE **pval, const ASN1_ITEM *it) | ||
| 294 | { | ||
| 295 | ASN1_TYPE *typ; | ||
| 296 | int utype; | ||
| 297 | const ASN1_PRIMITIVE_FUNCS *pf; | ||
| 298 | pf = it->funcs; | ||
| 299 | if(pf && pf->prim_new) return pf->prim_new(pval, it); | ||
| 300 | if(!it || (it->itype == ASN1_ITYPE_MSTRING)) utype = -1; | ||
| 301 | else utype = it->utype; | ||
| 302 | switch(utype) { | ||
| 303 | case V_ASN1_OBJECT: | ||
| 304 | *pval = (ASN1_VALUE *)OBJ_nid2obj(NID_undef); | ||
| 305 | return 1; | ||
| 306 | |||
| 307 | case V_ASN1_BOOLEAN: | ||
| 308 | *(ASN1_BOOLEAN *)pval = it->size; | ||
| 309 | return 1; | ||
| 310 | |||
| 311 | case V_ASN1_NULL: | ||
| 312 | *pval = (ASN1_VALUE *)1; | ||
| 313 | return 1; | ||
| 314 | |||
| 315 | case V_ASN1_ANY: | ||
| 316 | typ = OPENSSL_malloc(sizeof(ASN1_TYPE)); | ||
| 317 | if(!typ) return 0; | ||
| 318 | typ->value.ptr = NULL; | ||
| 319 | typ->type = -1; | ||
| 320 | *pval = (ASN1_VALUE *)typ; | ||
| 321 | break; | ||
| 322 | |||
| 323 | default: | ||
| 324 | *pval = (ASN1_VALUE *)ASN1_STRING_type_new(utype); | ||
| 325 | break; | ||
| 326 | } | ||
| 327 | if(*pval) return 1; | ||
| 328 | return 0; | ||
| 329 | } | ||
| 330 | |||
| 331 | void asn1_primitive_clear(ASN1_VALUE **pval, const ASN1_ITEM *it) | ||
| 332 | { | ||
| 333 | int utype; | ||
| 334 | const ASN1_PRIMITIVE_FUNCS *pf; | ||
| 335 | pf = it->funcs; | ||
| 336 | if(pf) { | ||
| 337 | if(pf->prim_clear) | ||
| 338 | pf->prim_clear(pval, it); | ||
| 339 | else | ||
| 340 | *pval = NULL; | ||
| 341 | return; | ||
| 342 | } | ||
| 343 | if(!it || (it->itype == ASN1_ITYPE_MSTRING)) utype = -1; | ||
| 344 | else utype = it->utype; | ||
| 345 | if(utype == V_ASN1_BOOLEAN) | ||
| 346 | *(ASN1_BOOLEAN *)pval = it->size; | ||
| 347 | else *pval = NULL; | ||
| 348 | } | ||
diff --git a/src/lib/libcrypto/asn1/tasn_prn.c b/src/lib/libcrypto/asn1/tasn_prn.c new file mode 100644 index 0000000000..fab67ae5ac --- /dev/null +++ b/src/lib/libcrypto/asn1/tasn_prn.c | |||
| @@ -0,0 +1,198 @@ | |||
| 1 | /* tasn_prn.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 2000. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 2000 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | |||
| 60 | #include <stddef.h> | ||
| 61 | #include <openssl/asn1.h> | ||
| 62 | #include <openssl/objects.h> | ||
| 63 | #include <openssl/buffer.h> | ||
| 64 | #include <openssl/err.h> | ||
| 65 | #include <openssl/nasn.h> | ||
| 66 | |||
| 67 | /* Print routines. Print out a whole structure from a template. | ||
| 68 | */ | ||
| 69 | |||
| 70 | static int asn1_item_print_nm(BIO *out, void *fld, int indent, const ASN1_ITEM *it, const char *name); | ||
| 71 | |||
| 72 | int ASN1_item_print(BIO *out, void *fld, int indent, const ASN1_ITEM *it) | ||
| 73 | { | ||
| 74 | return asn1_item_print_nm(out, fld, indent, it, it->sname); | ||
| 75 | } | ||
| 76 | |||
| 77 | static int asn1_item_print_nm(BIO *out, void *fld, int indent, const ASN1_ITEM *it, const char *name) | ||
| 78 | { | ||
| 79 | ASN1_STRING *str; | ||
| 80 | const ASN1_TEMPLATE *tt; | ||
| 81 | void *tmpfld; | ||
| 82 | int i; | ||
| 83 | if(!fld) { | ||
| 84 | BIO_printf(out, "%*s%s ABSENT\n", indent, "", name); | ||
| 85 | return 1; | ||
| 86 | } | ||
| 87 | switch(it->itype) { | ||
| 88 | |||
| 89 | case ASN1_ITYPE_PRIMITIVE: | ||
| 90 | if(it->templates) | ||
| 91 | return ASN1_template_print(out, fld, indent, it->templates); | ||
| 92 | return asn1_primitive_print(out, fld, it->utype, indent, name); | ||
| 93 | break; | ||
| 94 | |||
| 95 | case ASN1_ITYPE_MSTRING: | ||
| 96 | str = fld; | ||
| 97 | return asn1_primitive_print(out, fld, str->type, indent, name); | ||
| 98 | |||
| 99 | case ASN1_ITYPE_EXTERN: | ||
| 100 | BIO_printf(out, "%*s%s:EXTERNAL TYPE %s %s\n", indent, "", name, it->sname, fld ? "" : "ABSENT"); | ||
| 101 | return 1; | ||
| 102 | case ASN1_ITYPE_COMPAT: | ||
| 103 | BIO_printf(out, "%*s%s:COMPATIBLE TYPE %s %s\n", indent, "", name, it->sname, fld ? "" : "ABSENT"); | ||
| 104 | return 1; | ||
| 105 | |||
| 106 | |||
| 107 | case ASN1_ITYPE_CHOICE: | ||
| 108 | /* CHOICE type, get selector */ | ||
| 109 | i = asn1_get_choice_selector(fld, it); | ||
| 110 | /* This should never happen... */ | ||
| 111 | if((i < 0) || (i >= it->tcount)) { | ||
| 112 | BIO_printf(out, "%s selector [%d] out of range\n", it->sname, i); | ||
| 113 | return 1; | ||
| 114 | } | ||
| 115 | tt = it->templates + i; | ||
| 116 | tmpfld = asn1_get_field(fld, tt); | ||
| 117 | return ASN1_template_print(out, tmpfld, indent, tt); | ||
| 118 | |||
| 119 | case ASN1_ITYPE_SEQUENCE: | ||
| 120 | BIO_printf(out, "%*s%s {\n", indent, "", name); | ||
| 121 | /* Get each field entry */ | ||
| 122 | for(i = 0, tt = it->templates; i < it->tcount; i++, tt++) { | ||
| 123 | tmpfld = asn1_get_field(fld, tt); | ||
| 124 | ASN1_template_print(out, tmpfld, indent + 2, tt); | ||
| 125 | } | ||
| 126 | BIO_printf(out, "%*s}\n", indent, ""); | ||
| 127 | return 1; | ||
| 128 | |||
| 129 | default: | ||
| 130 | return 0; | ||
| 131 | } | ||
| 132 | } | ||
| 133 | |||
| 134 | int ASN1_template_print(BIO *out, void *fld, int indent, const ASN1_TEMPLATE *tt) | ||
| 135 | { | ||
| 136 | int i, flags; | ||
| 137 | #if 0 | ||
| 138 | if(!fld) return 0; | ||
| 139 | #endif | ||
| 140 | flags = tt->flags; | ||
| 141 | if(flags & ASN1_TFLG_SK_MASK) { | ||
| 142 | char *tname; | ||
| 143 | void *skitem; | ||
| 144 | /* SET OF, SEQUENCE OF */ | ||
| 145 | if(flags & ASN1_TFLG_SET_OF) tname = "SET"; | ||
| 146 | else tname = "SEQUENCE"; | ||
| 147 | if(fld) { | ||
| 148 | BIO_printf(out, "%*s%s OF %s {\n", indent, "", tname, tt->field_name); | ||
| 149 | for(i = 0; i < sk_num(fld); i++) { | ||
| 150 | skitem = sk_value(fld, i); | ||
| 151 | asn1_item_print_nm(out, skitem, indent + 2, tt->item, ""); | ||
| 152 | } | ||
| 153 | BIO_printf(out, "%*s}\n", indent, ""); | ||
| 154 | } else | ||
| 155 | BIO_printf(out, "%*s%s OF %s ABSENT\n", indent, "", tname, tt->field_name); | ||
| 156 | return 1; | ||
| 157 | } | ||
| 158 | return asn1_item_print_nm(out, fld, indent, tt->item, tt->field_name); | ||
| 159 | } | ||
| 160 | |||
| 161 | static int asn1_primitive_print(BIO *out, void *fld, long utype, int indent, const char *name) | ||
| 162 | { | ||
| 163 | ASN1_STRING *str = fld; | ||
| 164 | if(fld) { | ||
| 165 | if(utype == V_ASN1_BOOLEAN) { | ||
| 166 | int *bool = fld; | ||
| 167 | if(*bool == -1) printf("BOOL MISSING\n"); | ||
| 168 | BIO_printf(out, "%*s%s:%s", indent, "", "BOOLEAN", *bool ? "TRUE" : "FALSE"); | ||
| 169 | } else if((utype == V_ASN1_INTEGER) | ||
| 170 | || (utype == V_ASN1_ENUMERATED)) { | ||
| 171 | char *s, *nm; | ||
| 172 | s = i2s_ASN1_INTEGER(NULL, fld); | ||
| 173 | if(utype == V_ASN1_INTEGER) nm = "INTEGER"; | ||
| 174 | else nm = "ENUMERATED"; | ||
| 175 | BIO_printf(out, "%*s%s:%s", indent, "", nm, s); | ||
| 176 | OPENSSL_free(s); | ||
| 177 | } else if(utype == V_ASN1_NULL) { | ||
| 178 | BIO_printf(out, "%*s%s", indent, "", "NULL"); | ||
| 179 | } else if(utype == V_ASN1_UTCTIME) { | ||
| 180 | BIO_printf(out, "%*s%s:%s:", indent, "", name, "UTCTIME"); | ||
| 181 | ASN1_UTCTIME_print(out, str); | ||
| 182 | } else if(utype == V_ASN1_GENERALIZEDTIME) { | ||
| 183 | BIO_printf(out, "%*s%s:%s:", indent, "", name, "GENERALIZEDTIME"); | ||
| 184 | ASN1_GENERALIZEDTIME_print(out, str); | ||
| 185 | } else if(utype == V_ASN1_OBJECT) { | ||
| 186 | char objbuf[80], *ln; | ||
| 187 | ln = OBJ_nid2ln(OBJ_obj2nid(fld)); | ||
| 188 | if(!ln) ln = ""; | ||
| 189 | OBJ_obj2txt(objbuf, 80, fld, 1); | ||
| 190 | BIO_printf(out, "%*s%s:%s (%s)", indent, "", "OBJECT", ln, objbuf); | ||
| 191 | } else { | ||
| 192 | BIO_printf(out, "%*s%s:", indent, "", name); | ||
| 193 | ASN1_STRING_print_ex(out, str, ASN1_STRFLGS_DUMP_UNKNOWN|ASN1_STRFLGS_SHOW_TYPE); | ||
| 194 | } | ||
| 195 | BIO_printf(out, "\n"); | ||
| 196 | } else BIO_printf(out, "%*s%s [ABSENT]\n", indent, "", name); | ||
| 197 | return 1; | ||
| 198 | } | ||
diff --git a/src/lib/libcrypto/asn1/tasn_typ.c b/src/lib/libcrypto/asn1/tasn_typ.c new file mode 100644 index 0000000000..804d2eeba2 --- /dev/null +++ b/src/lib/libcrypto/asn1/tasn_typ.c | |||
| @@ -0,0 +1,133 @@ | |||
| 1 | /* tasn_typ.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 2000. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 2000 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | #include <stdio.h> | ||
| 59 | #include <openssl/asn1.h> | ||
| 60 | #include <openssl/asn1t.h> | ||
| 61 | |||
| 62 | /* Declarations for string types */ | ||
| 63 | |||
| 64 | |||
| 65 | IMPLEMENT_ASN1_TYPE(ASN1_INTEGER) | ||
| 66 | IMPLEMENT_ASN1_FUNCTIONS(ASN1_INTEGER) | ||
| 67 | |||
| 68 | IMPLEMENT_ASN1_TYPE(ASN1_ENUMERATED) | ||
| 69 | IMPLEMENT_ASN1_FUNCTIONS(ASN1_ENUMERATED) | ||
| 70 | |||
| 71 | IMPLEMENT_ASN1_TYPE(ASN1_BIT_STRING) | ||
| 72 | IMPLEMENT_ASN1_FUNCTIONS(ASN1_BIT_STRING) | ||
| 73 | |||
| 74 | IMPLEMENT_ASN1_TYPE(ASN1_OCTET_STRING) | ||
| 75 | IMPLEMENT_ASN1_FUNCTIONS(ASN1_OCTET_STRING) | ||
| 76 | |||
| 77 | IMPLEMENT_ASN1_TYPE(ASN1_NULL) | ||
| 78 | IMPLEMENT_ASN1_FUNCTIONS(ASN1_NULL) | ||
| 79 | |||
| 80 | IMPLEMENT_ASN1_TYPE(ASN1_OBJECT) | ||
| 81 | |||
| 82 | IMPLEMENT_ASN1_TYPE(ASN1_UTF8STRING) | ||
| 83 | IMPLEMENT_ASN1_FUNCTIONS(ASN1_UTF8STRING) | ||
| 84 | |||
| 85 | IMPLEMENT_ASN1_TYPE(ASN1_PRINTABLESTRING) | ||
| 86 | IMPLEMENT_ASN1_FUNCTIONS(ASN1_PRINTABLESTRING) | ||
| 87 | |||
| 88 | IMPLEMENT_ASN1_TYPE(ASN1_T61STRING) | ||
| 89 | IMPLEMENT_ASN1_FUNCTIONS(ASN1_T61STRING) | ||
| 90 | |||
| 91 | IMPLEMENT_ASN1_TYPE(ASN1_IA5STRING) | ||
| 92 | IMPLEMENT_ASN1_FUNCTIONS(ASN1_IA5STRING) | ||
| 93 | |||
| 94 | IMPLEMENT_ASN1_TYPE(ASN1_GENERALSTRING) | ||
| 95 | IMPLEMENT_ASN1_FUNCTIONS(ASN1_GENERALSTRING) | ||
| 96 | |||
| 97 | IMPLEMENT_ASN1_TYPE(ASN1_UTCTIME) | ||
| 98 | IMPLEMENT_ASN1_FUNCTIONS(ASN1_UTCTIME) | ||
| 99 | |||
| 100 | IMPLEMENT_ASN1_TYPE(ASN1_GENERALIZEDTIME) | ||
| 101 | IMPLEMENT_ASN1_FUNCTIONS(ASN1_GENERALIZEDTIME) | ||
| 102 | |||
| 103 | IMPLEMENT_ASN1_TYPE(ASN1_VISIBLESTRING) | ||
| 104 | IMPLEMENT_ASN1_FUNCTIONS(ASN1_VISIBLESTRING) | ||
| 105 | |||
| 106 | IMPLEMENT_ASN1_TYPE(ASN1_UNIVERSALSTRING) | ||
| 107 | IMPLEMENT_ASN1_FUNCTIONS(ASN1_UNIVERSALSTRING) | ||
| 108 | |||
| 109 | IMPLEMENT_ASN1_TYPE(ASN1_BMPSTRING) | ||
| 110 | IMPLEMENT_ASN1_FUNCTIONS(ASN1_BMPSTRING) | ||
| 111 | |||
| 112 | IMPLEMENT_ASN1_TYPE(ASN1_ANY) | ||
| 113 | |||
| 114 | /* Just swallow an ASN1_SEQUENCE in an ASN1_STRING */ | ||
| 115 | IMPLEMENT_ASN1_TYPE(ASN1_SEQUENCE) | ||
| 116 | |||
| 117 | IMPLEMENT_ASN1_FUNCTIONS_fname(ASN1_TYPE, ASN1_ANY, ASN1_TYPE) | ||
| 118 | |||
| 119 | /* Multistring types */ | ||
| 120 | |||
| 121 | IMPLEMENT_ASN1_MSTRING(ASN1_PRINTABLE, B_ASN1_PRINTABLE) | ||
| 122 | IMPLEMENT_ASN1_FUNCTIONS_name(ASN1_STRING, ASN1_PRINTABLE) | ||
| 123 | |||
| 124 | IMPLEMENT_ASN1_MSTRING(DISPLAYTEXT, B_ASN1_DISPLAYTEXT) | ||
| 125 | IMPLEMENT_ASN1_FUNCTIONS_name(ASN1_STRING, DISPLAYTEXT) | ||
| 126 | |||
| 127 | IMPLEMENT_ASN1_MSTRING(DIRECTORYSTRING, B_ASN1_DIRECTORYSTRING) | ||
| 128 | IMPLEMENT_ASN1_FUNCTIONS_name(ASN1_STRING, DIRECTORYSTRING) | ||
| 129 | |||
| 130 | /* Three separate BOOLEAN type: normal, DEFAULT TRUE and DEFAULT FALSE */ | ||
| 131 | IMPLEMENT_ASN1_TYPE_ex(ASN1_BOOLEAN, ASN1_BOOLEAN, -1) | ||
| 132 | IMPLEMENT_ASN1_TYPE_ex(ASN1_TBOOLEAN, ASN1_BOOLEAN, 1) | ||
| 133 | IMPLEMENT_ASN1_TYPE_ex(ASN1_FBOOLEAN, ASN1_BOOLEAN, 0) | ||
diff --git a/src/lib/libcrypto/asn1/tasn_utl.c b/src/lib/libcrypto/asn1/tasn_utl.c new file mode 100644 index 0000000000..8996ce8c13 --- /dev/null +++ b/src/lib/libcrypto/asn1/tasn_utl.c | |||
| @@ -0,0 +1,253 @@ | |||
| 1 | /* tasn_utl.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 2000. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 2000 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | |||
| 60 | #include <stddef.h> | ||
| 61 | #include <string.h> | ||
| 62 | #include <openssl/asn1.h> | ||
| 63 | #include <openssl/asn1t.h> | ||
| 64 | #include <openssl/objects.h> | ||
| 65 | #include <openssl/err.h> | ||
| 66 | |||
| 67 | /* Utility functions for manipulating fields and offsets */ | ||
| 68 | |||
| 69 | /* Add 'offset' to 'addr' */ | ||
| 70 | #define offset2ptr(addr, offset) (void *)(((char *) addr) + offset) | ||
| 71 | |||
| 72 | /* Given an ASN1_ITEM CHOICE type return | ||
| 73 | * the selector value | ||
| 74 | */ | ||
| 75 | |||
| 76 | int asn1_get_choice_selector(ASN1_VALUE **pval, const ASN1_ITEM *it) | ||
| 77 | { | ||
| 78 | int *sel = offset2ptr(*pval, it->utype); | ||
| 79 | return *sel; | ||
| 80 | } | ||
| 81 | |||
| 82 | /* Given an ASN1_ITEM CHOICE type set | ||
| 83 | * the selector value, return old value. | ||
| 84 | */ | ||
| 85 | |||
| 86 | int asn1_set_choice_selector(ASN1_VALUE **pval, int value, const ASN1_ITEM *it) | ||
| 87 | { | ||
| 88 | int *sel, ret; | ||
| 89 | sel = offset2ptr(*pval, it->utype); | ||
| 90 | ret = *sel; | ||
| 91 | *sel = value; | ||
| 92 | return ret; | ||
| 93 | } | ||
| 94 | |||
| 95 | /* Do reference counting. The value 'op' decides what to do. | ||
| 96 | * if it is +1 then the count is incremented. If op is 0 count is | ||
| 97 | * set to 1. If op is -1 count is decremented and the return value | ||
| 98 | * is the current refrence count or 0 if no reference count exists. | ||
| 99 | */ | ||
| 100 | |||
| 101 | int asn1_do_lock(ASN1_VALUE **pval, int op, const ASN1_ITEM *it) | ||
| 102 | { | ||
| 103 | const ASN1_AUX *aux; | ||
| 104 | int *lck, ret; | ||
| 105 | if(it->itype != ASN1_ITYPE_SEQUENCE) return 0; | ||
| 106 | aux = it->funcs; | ||
| 107 | if(!aux || !(aux->flags & ASN1_AFLG_REFCOUNT)) return 0; | ||
| 108 | lck = offset2ptr(*pval, aux->ref_offset); | ||
| 109 | if(op == 0) { | ||
| 110 | *lck = 1; | ||
| 111 | return 1; | ||
| 112 | } | ||
| 113 | ret = CRYPTO_add(lck, op, aux->ref_lock); | ||
| 114 | #ifdef REF_PRINT | ||
| 115 | fprintf(stderr, "%s: Reference Count: %d\n", it->sname, *lck); | ||
| 116 | #endif | ||
| 117 | #ifdef REF_CHECK | ||
| 118 | if(ret < 0) | ||
| 119 | fprintf(stderr, "%s, bad reference count\n", it->sname); | ||
| 120 | #endif | ||
| 121 | return ret; | ||
| 122 | } | ||
| 123 | |||
| 124 | static ASN1_ENCODING *asn1_get_enc_ptr(ASN1_VALUE **pval, const ASN1_ITEM *it) | ||
| 125 | { | ||
| 126 | const ASN1_AUX *aux; | ||
| 127 | if(!pval || !*pval) return NULL; | ||
| 128 | aux = it->funcs; | ||
| 129 | if(!aux || !(aux->flags & ASN1_AFLG_ENCODING)) return NULL; | ||
| 130 | return offset2ptr(*pval, aux->enc_offset); | ||
| 131 | } | ||
| 132 | |||
| 133 | void asn1_enc_init(ASN1_VALUE **pval, const ASN1_ITEM *it) | ||
| 134 | { | ||
| 135 | ASN1_ENCODING *enc; | ||
| 136 | enc = asn1_get_enc_ptr(pval, it); | ||
| 137 | if(enc) { | ||
| 138 | enc->enc = NULL; | ||
| 139 | enc->len = 0; | ||
| 140 | enc->modified = 1; | ||
| 141 | } | ||
| 142 | } | ||
| 143 | |||
| 144 | void asn1_enc_free(ASN1_VALUE **pval, const ASN1_ITEM *it) | ||
| 145 | { | ||
| 146 | ASN1_ENCODING *enc; | ||
| 147 | enc = asn1_get_enc_ptr(pval, it); | ||
| 148 | if(enc) { | ||
| 149 | if(enc->enc) OPENSSL_free(enc->enc); | ||
| 150 | enc->enc = NULL; | ||
| 151 | enc->len = 0; | ||
| 152 | enc->modified = 1; | ||
| 153 | } | ||
| 154 | } | ||
| 155 | |||
| 156 | int asn1_enc_save(ASN1_VALUE **pval, unsigned char *in, int inlen, const ASN1_ITEM *it) | ||
| 157 | { | ||
| 158 | ASN1_ENCODING *enc; | ||
| 159 | enc = asn1_get_enc_ptr(pval, it); | ||
| 160 | if(!enc) return 1; | ||
| 161 | |||
| 162 | if(enc->enc) OPENSSL_free(enc->enc); | ||
| 163 | enc->enc = OPENSSL_malloc(inlen); | ||
| 164 | if(!enc->enc) return 0; | ||
| 165 | memcpy(enc->enc, in, inlen); | ||
| 166 | enc->len = inlen; | ||
| 167 | enc->modified = 0; | ||
| 168 | |||
| 169 | return 1; | ||
| 170 | } | ||
| 171 | |||
| 172 | int asn1_enc_restore(int *len, unsigned char **out, ASN1_VALUE **pval, const ASN1_ITEM *it) | ||
| 173 | { | ||
| 174 | ASN1_ENCODING *enc; | ||
| 175 | enc = asn1_get_enc_ptr(pval, it); | ||
| 176 | if(!enc || enc->modified) return 0; | ||
| 177 | if(out) { | ||
| 178 | memcpy(*out, enc->enc, enc->len); | ||
| 179 | *out += enc->len; | ||
| 180 | } | ||
| 181 | if(len) *len = enc->len; | ||
| 182 | return 1; | ||
| 183 | } | ||
| 184 | |||
| 185 | /* Given an ASN1_TEMPLATE get a pointer to a field */ | ||
| 186 | ASN1_VALUE ** asn1_get_field_ptr(ASN1_VALUE **pval, const ASN1_TEMPLATE *tt) | ||
| 187 | { | ||
| 188 | ASN1_VALUE **pvaltmp; | ||
| 189 | if(tt->flags & ASN1_TFLG_COMBINE) return pval; | ||
| 190 | pvaltmp = offset2ptr(*pval, tt->offset); | ||
| 191 | /* NOTE for BOOLEAN types the field is just a plain | ||
| 192 | * int so we can't return int **, so settle for | ||
| 193 | * (int *). | ||
| 194 | */ | ||
| 195 | return pvaltmp; | ||
| 196 | } | ||
| 197 | |||
| 198 | /* Handle ANY DEFINED BY template, find the selector, look up | ||
| 199 | * the relevant ASN1_TEMPLATE in the table and return it. | ||
| 200 | */ | ||
| 201 | |||
| 202 | const ASN1_TEMPLATE *asn1_do_adb(ASN1_VALUE **pval, const ASN1_TEMPLATE *tt, int nullerr) | ||
| 203 | { | ||
| 204 | const ASN1_ADB *adb; | ||
| 205 | const ASN1_ADB_TABLE *atbl; | ||
| 206 | long selector; | ||
| 207 | ASN1_VALUE **sfld; | ||
| 208 | int i; | ||
| 209 | if(!(tt->flags & ASN1_TFLG_ADB_MASK)) return tt; | ||
| 210 | |||
| 211 | /* Else ANY DEFINED BY ... get the table */ | ||
| 212 | adb = ASN1_ADB_ptr(tt->item); | ||
| 213 | |||
| 214 | /* Get the selector field */ | ||
| 215 | sfld = offset2ptr(*pval, adb->offset); | ||
| 216 | |||
| 217 | /* Check if NULL */ | ||
| 218 | if(!sfld) { | ||
| 219 | if(!adb->null_tt) goto err; | ||
| 220 | return adb->null_tt; | ||
| 221 | } | ||
| 222 | |||
| 223 | /* Convert type to a long: | ||
| 224 | * NB: don't check for NID_undef here because it | ||
| 225 | * might be a legitimate value in the table | ||
| 226 | */ | ||
| 227 | if(tt->flags & ASN1_TFLG_ADB_OID) | ||
| 228 | selector = OBJ_obj2nid((ASN1_OBJECT *)*sfld); | ||
| 229 | else | ||
| 230 | selector = ASN1_INTEGER_get((ASN1_INTEGER *)*sfld); | ||
| 231 | |||
| 232 | /* Try to find matching entry in table | ||
| 233 | * Maybe should check application types first to | ||
| 234 | * allow application override? Might also be useful | ||
| 235 | * to have a flag which indicates table is sorted and | ||
| 236 | * we can do a binary search. For now stick to a | ||
| 237 | * linear search. | ||
| 238 | */ | ||
| 239 | |||
| 240 | for(atbl = adb->tbl, i = 0; i < adb->tblcount; i++, atbl++) | ||
| 241 | if(atbl->value == selector) return &atbl->tt; | ||
| 242 | |||
| 243 | /* FIXME: need to search application table too */ | ||
| 244 | |||
| 245 | /* No match, return default type */ | ||
| 246 | if(!adb->default_tt) goto err; | ||
| 247 | return adb->default_tt; | ||
| 248 | |||
| 249 | err: | ||
| 250 | /* FIXME: should log the value or OID of unsupported type */ | ||
| 251 | if(nullerr) ASN1err(ASN1_F_ASN1_DO_ADB, ASN1_R_UNSUPPORTED_ANY_DEFINED_BY_TYPE); | ||
| 252 | return NULL; | ||
| 253 | } | ||
diff --git a/src/lib/libcrypto/asn1/x_bignum.c b/src/lib/libcrypto/asn1/x_bignum.c new file mode 100644 index 0000000000..848c7a0877 --- /dev/null +++ b/src/lib/libcrypto/asn1/x_bignum.c | |||
| @@ -0,0 +1,137 @@ | |||
| 1 | /* x_bignum.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 2000. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 2000 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | #include <stdio.h> | ||
| 60 | #include "cryptlib.h" | ||
| 61 | #include <openssl/asn1t.h> | ||
| 62 | |||
| 63 | /* Custom primitive type for BIGNUM handling. This reads in an ASN1_INTEGER as a | ||
| 64 | * BIGNUM directly. Currently it ignores the sign which isn't a problem since all | ||
| 65 | * BIGNUMs used are non negative and anything that looks negative is normally due | ||
| 66 | * to an encoding error. | ||
| 67 | */ | ||
| 68 | |||
| 69 | #define BN_SENSITIVE 1 | ||
| 70 | |||
| 71 | static int bn_new(ASN1_VALUE **pval, const ASN1_ITEM *it); | ||
| 72 | static void bn_free(ASN1_VALUE **pval, const ASN1_ITEM *it); | ||
| 73 | |||
| 74 | static int bn_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it); | ||
| 75 | static int bn_c2i(ASN1_VALUE **pval, unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it); | ||
| 76 | |||
| 77 | static ASN1_PRIMITIVE_FUNCS bignum_pf = { | ||
| 78 | NULL, 0, | ||
| 79 | bn_new, | ||
| 80 | bn_free, | ||
| 81 | 0, | ||
| 82 | bn_c2i, | ||
| 83 | bn_i2c | ||
| 84 | }; | ||
| 85 | |||
| 86 | ASN1_ITEM_start(BIGNUM) | ||
| 87 | ASN1_ITYPE_PRIMITIVE, V_ASN1_INTEGER, NULL, 0, &bignum_pf, 0, "BIGNUM" | ||
| 88 | ASN1_ITEM_end(BIGNUM) | ||
| 89 | |||
| 90 | ASN1_ITEM_start(CBIGNUM) | ||
| 91 | ASN1_ITYPE_PRIMITIVE, V_ASN1_INTEGER, NULL, 0, &bignum_pf, BN_SENSITIVE, "BIGNUM" | ||
| 92 | ASN1_ITEM_end(CBIGNUM) | ||
| 93 | |||
| 94 | static int bn_new(ASN1_VALUE **pval, const ASN1_ITEM *it) | ||
| 95 | { | ||
| 96 | *pval = (ASN1_VALUE *)BN_new(); | ||
| 97 | if(*pval) return 1; | ||
| 98 | else return 0; | ||
| 99 | } | ||
| 100 | |||
| 101 | static void bn_free(ASN1_VALUE **pval, const ASN1_ITEM *it) | ||
| 102 | { | ||
| 103 | if(!*pval) return; | ||
| 104 | if(it->size & BN_SENSITIVE) BN_clear_free((BIGNUM *)*pval); | ||
| 105 | else BN_free((BIGNUM *)*pval); | ||
| 106 | *pval = NULL; | ||
| 107 | } | ||
| 108 | |||
| 109 | static int bn_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it) | ||
| 110 | { | ||
| 111 | BIGNUM *bn; | ||
| 112 | int pad; | ||
| 113 | if(!*pval) return -1; | ||
| 114 | bn = (BIGNUM *)*pval; | ||
| 115 | /* If MSB set in an octet we need a padding byte */ | ||
| 116 | if(BN_num_bits(bn) & 0x7) pad = 0; | ||
| 117 | else pad = 1; | ||
| 118 | if(cont) { | ||
| 119 | if(pad) *cont++ = 0; | ||
| 120 | BN_bn2bin(bn, cont); | ||
| 121 | } | ||
| 122 | return pad + BN_num_bytes(bn); | ||
| 123 | } | ||
| 124 | |||
| 125 | static int bn_c2i(ASN1_VALUE **pval, unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it) | ||
| 126 | { | ||
| 127 | BIGNUM *bn; | ||
| 128 | if(!*pval) bn_new(pval, it); | ||
| 129 | bn = (BIGNUM *)*pval; | ||
| 130 | if(!BN_bin2bn(cont, len, bn)) { | ||
| 131 | bn_free(pval, it); | ||
| 132 | return 0; | ||
| 133 | } | ||
| 134 | return 1; | ||
| 135 | } | ||
| 136 | |||
| 137 | |||
diff --git a/src/lib/libcrypto/asn1/x_long.c b/src/lib/libcrypto/asn1/x_long.c new file mode 100644 index 0000000000..c5f25956cb --- /dev/null +++ b/src/lib/libcrypto/asn1/x_long.c | |||
| @@ -0,0 +1,169 @@ | |||
| 1 | /* x_long.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 2000. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 2000 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | #include <stdio.h> | ||
| 60 | #include "cryptlib.h" | ||
| 61 | #include <openssl/asn1t.h> | ||
| 62 | |||
| 63 | /* Custom primitive type for long handling. This converts between an ASN1_INTEGER | ||
| 64 | * and a long directly. | ||
| 65 | */ | ||
| 66 | |||
| 67 | |||
| 68 | static int long_new(ASN1_VALUE **pval, const ASN1_ITEM *it); | ||
| 69 | static void long_free(ASN1_VALUE **pval, const ASN1_ITEM *it); | ||
| 70 | |||
| 71 | static int long_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it); | ||
| 72 | static int long_c2i(ASN1_VALUE **pval, unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it); | ||
| 73 | |||
| 74 | static ASN1_PRIMITIVE_FUNCS long_pf = { | ||
| 75 | NULL, 0, | ||
| 76 | long_new, | ||
| 77 | long_free, | ||
| 78 | long_free, /* Clear should set to initial value */ | ||
| 79 | long_c2i, | ||
| 80 | long_i2c | ||
| 81 | }; | ||
| 82 | |||
| 83 | ASN1_ITEM_start(LONG) | ||
| 84 | ASN1_ITYPE_PRIMITIVE, V_ASN1_INTEGER, NULL, 0, &long_pf, ASN1_LONG_UNDEF, "LONG" | ||
| 85 | ASN1_ITEM_end(LONG) | ||
| 86 | |||
| 87 | ASN1_ITEM_start(ZLONG) | ||
| 88 | ASN1_ITYPE_PRIMITIVE, V_ASN1_INTEGER, NULL, 0, &long_pf, 0, "ZLONG" | ||
| 89 | ASN1_ITEM_end(ZLONG) | ||
| 90 | |||
| 91 | static int long_new(ASN1_VALUE **pval, const ASN1_ITEM *it) | ||
| 92 | { | ||
| 93 | *(long *)pval = it->size; | ||
| 94 | return 1; | ||
| 95 | } | ||
| 96 | |||
| 97 | static void long_free(ASN1_VALUE **pval, const ASN1_ITEM *it) | ||
| 98 | { | ||
| 99 | *(long *)pval = it->size; | ||
| 100 | } | ||
| 101 | |||
| 102 | static int long_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it) | ||
| 103 | { | ||
| 104 | long ltmp; | ||
| 105 | unsigned long utmp; | ||
| 106 | int clen, pad, i; | ||
| 107 | /* this exists to bypass broken gcc optimization */ | ||
| 108 | char *cp = (char *)pval; | ||
| 109 | |||
| 110 | /* use memcpy, because we may not be long aligned */ | ||
| 111 | memcpy(<mp, cp, sizeof(long)); | ||
| 112 | |||
| 113 | if(ltmp == it->size) return -1; | ||
| 114 | /* Convert the long to positive: we subtract one if negative so | ||
| 115 | * we can cleanly handle the padding if only the MSB of the leading | ||
| 116 | * octet is set. | ||
| 117 | */ | ||
| 118 | if(ltmp < 0) utmp = -ltmp - 1; | ||
| 119 | else utmp = ltmp; | ||
| 120 | clen = BN_num_bits_word(utmp); | ||
| 121 | /* If MSB of leading octet set we need to pad */ | ||
| 122 | if(!(clen & 0x7)) pad = 1; | ||
| 123 | else pad = 0; | ||
| 124 | |||
| 125 | /* Convert number of bits to number of octets */ | ||
| 126 | clen = (clen + 7) >> 3; | ||
| 127 | |||
| 128 | if(cont) { | ||
| 129 | if(pad) *cont++ = (ltmp < 0) ? 0xff : 0; | ||
| 130 | for(i = clen - 1; i >= 0; i--) { | ||
| 131 | cont[i] = (unsigned char)(utmp & 0xff); | ||
| 132 | if(ltmp < 0) cont[i] ^= 0xff; | ||
| 133 | utmp >>= 8; | ||
| 134 | } | ||
| 135 | } | ||
| 136 | return clen + pad; | ||
| 137 | } | ||
| 138 | |||
| 139 | static int long_c2i(ASN1_VALUE **pval, unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it) | ||
| 140 | { | ||
| 141 | int neg, i; | ||
| 142 | long ltmp; | ||
| 143 | unsigned long utmp = 0; | ||
| 144 | char *cp = (char *)pval; | ||
| 145 | if(len > sizeof(long)) { | ||
| 146 | ASN1err(ASN1_F_LONG_C2I, ASN1_R_INTEGER_TOO_LARGE_FOR_LONG); | ||
| 147 | return 0; | ||
| 148 | } | ||
| 149 | /* Is it negative? */ | ||
| 150 | if(len && (cont[0] & 0x80)) neg = 1; | ||
| 151 | else neg = 0; | ||
| 152 | utmp = 0; | ||
| 153 | for(i = 0; i < len; i++) { | ||
| 154 | utmp <<= 8; | ||
| 155 | if(neg) utmp |= cont[i] ^ 0xff; | ||
| 156 | else utmp |= cont[i]; | ||
| 157 | } | ||
| 158 | ltmp = (long)utmp; | ||
| 159 | if(neg) { | ||
| 160 | ltmp++; | ||
| 161 | ltmp = -ltmp; | ||
| 162 | } | ||
| 163 | if(ltmp == it->size) { | ||
| 164 | ASN1err(ASN1_F_LONG_C2I, ASN1_R_INTEGER_TOO_LARGE_FOR_LONG); | ||
| 165 | return 0; | ||
| 166 | } | ||
| 167 | memcpy(cp, <mp, sizeof(long)); | ||
| 168 | return 1; | ||
| 169 | } | ||
diff --git a/src/lib/libcrypto/asn1/x_x509a.c b/src/lib/libcrypto/asn1/x_x509a.c new file mode 100644 index 0000000000..b9987ea968 --- /dev/null +++ b/src/lib/libcrypto/asn1/x_x509a.c | |||
| @@ -0,0 +1,200 @@ | |||
| 1 | /* a_x509a.c */ | ||
| 2 | /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL | ||
| 3 | * project 1999. | ||
| 4 | */ | ||
| 5 | /* ==================================================================== | ||
| 6 | * Copyright (c) 1999 The OpenSSL Project. All rights reserved. | ||
| 7 | * | ||
| 8 | * Redistribution and use in source and binary forms, with or without | ||
| 9 | * modification, are permitted provided that the following conditions | ||
| 10 | * are met: | ||
| 11 | * | ||
| 12 | * 1. Redistributions of source code must retain the above copyright | ||
| 13 | * notice, this list of conditions and the following disclaimer. | ||
| 14 | * | ||
| 15 | * 2. Redistributions in binary form must reproduce the above copyright | ||
| 16 | * notice, this list of conditions and the following disclaimer in | ||
| 17 | * the documentation and/or other materials provided with the | ||
| 18 | * distribution. | ||
| 19 | * | ||
| 20 | * 3. All advertising materials mentioning features or use of this | ||
| 21 | * software must display the following acknowledgment: | ||
| 22 | * "This product includes software developed by the OpenSSL Project | ||
| 23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
| 24 | * | ||
| 25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
| 26 | * endorse or promote products derived from this software without | ||
| 27 | * prior written permission. For written permission, please contact | ||
| 28 | * licensing@OpenSSL.org. | ||
| 29 | * | ||
| 30 | * 5. Products derived from this software may not be called "OpenSSL" | ||
| 31 | * nor may "OpenSSL" appear in their names without prior written | ||
| 32 | * permission of the OpenSSL Project. | ||
| 33 | * | ||
| 34 | * 6. Redistributions of any form whatsoever must retain the following | ||
| 35 | * acknowledgment: | ||
| 36 | * "This product includes software developed by the OpenSSL Project | ||
| 37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
| 38 | * | ||
| 39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
| 40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
| 41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
| 42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
| 43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| 44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
| 45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
| 46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
| 48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
| 49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
| 50 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| 51 | * ==================================================================== | ||
| 52 | * | ||
| 53 | * This product includes cryptographic software written by Eric Young | ||
| 54 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
| 55 | * Hudson (tjh@cryptsoft.com). | ||
| 56 | * | ||
| 57 | */ | ||
| 58 | |||
| 59 | #include <stdio.h> | ||
| 60 | #include "cryptlib.h" | ||
| 61 | #include <openssl/evp.h> | ||
| 62 | #include <openssl/asn1_mac.h> | ||
| 63 | #include <openssl/x509.h> | ||
| 64 | |||
| 65 | /* X509_CERT_AUX routines. These are used to encode additional | ||
| 66 | * user modifiable data about a certificate. This data is | ||
| 67 | * appended to the X509 encoding when the *_X509_AUX routines | ||
| 68 | * are used. This means that the "traditional" X509 routines | ||
| 69 | * will simply ignore the extra data. | ||
| 70 | */ | ||
| 71 | |||
| 72 | static X509_CERT_AUX *aux_get(X509 *x); | ||
| 73 | |||
| 74 | X509_CERT_AUX *d2i_X509_CERT_AUX(X509_CERT_AUX **a, unsigned char **pp, long length) | ||
| 75 | { | ||
| 76 | M_ASN1_D2I_vars(a, X509_CERT_AUX *, X509_CERT_AUX_new); | ||
| 77 | |||
| 78 | M_ASN1_D2I_Init(); | ||
| 79 | M_ASN1_D2I_start_sequence(); | ||
| 80 | |||
| 81 | M_ASN1_D2I_get_seq_opt_type(ASN1_OBJECT, ret->trust, | ||
| 82 | d2i_ASN1_OBJECT, ASN1_OBJECT_free); | ||
| 83 | M_ASN1_D2I_get_IMP_set_opt_type(ASN1_OBJECT, ret->reject, | ||
| 84 | d2i_ASN1_OBJECT, ASN1_OBJECT_free, 0); | ||
| 85 | M_ASN1_D2I_get_opt(ret->alias, d2i_ASN1_UTF8STRING, V_ASN1_UTF8STRING); | ||
| 86 | M_ASN1_D2I_get_opt(ret->keyid, d2i_ASN1_OCTET_STRING, V_ASN1_OCTET_STRING); | ||
| 87 | M_ASN1_D2I_get_IMP_set_opt_type(X509_ALGOR, ret->other, | ||
| 88 | d2i_X509_ALGOR, X509_ALGOR_free, 1); | ||
| 89 | |||
| 90 | M_ASN1_D2I_Finish(a, X509_CERT_AUX_free, ASN1_F_D2I_X509_CERT_AUX); | ||
| 91 | } | ||
| 92 | |||
| 93 | X509_CERT_AUX *X509_CERT_AUX_new() | ||
| 94 | { | ||
| 95 | X509_CERT_AUX *ret = NULL; | ||
| 96 | ASN1_CTX c; | ||
| 97 | M_ASN1_New_Malloc(ret, X509_CERT_AUX); | ||
| 98 | ret->trust = NULL; | ||
| 99 | ret->reject = NULL; | ||
| 100 | ret->alias = NULL; | ||
| 101 | ret->keyid = NULL; | ||
| 102 | ret->other = NULL; | ||
| 103 | return(ret); | ||
| 104 | M_ASN1_New_Error(ASN1_F_X509_CERT_AUX_NEW); | ||
| 105 | } | ||
| 106 | |||
| 107 | void X509_CERT_AUX_free(X509_CERT_AUX *a) | ||
| 108 | { | ||
| 109 | if(a == NULL) return; | ||
| 110 | sk_ASN1_OBJECT_pop_free(a->trust, ASN1_OBJECT_free); | ||
| 111 | sk_ASN1_OBJECT_pop_free(a->reject, ASN1_OBJECT_free); | ||
| 112 | ASN1_UTF8STRING_free(a->alias); | ||
| 113 | ASN1_OCTET_STRING_free(a->keyid); | ||
| 114 | sk_X509_ALGOR_pop_free(a->other, X509_ALGOR_free); | ||
| 115 | Free(a); | ||
| 116 | } | ||
| 117 | |||
| 118 | int i2d_X509_CERT_AUX(X509_CERT_AUX *a, unsigned char **pp) | ||
| 119 | { | ||
| 120 | M_ASN1_I2D_vars(a); | ||
| 121 | |||
| 122 | M_ASN1_I2D_len_SEQUENCE_opt_type(ASN1_OBJECT, a->trust, i2d_ASN1_OBJECT); | ||
| 123 | M_ASN1_I2D_len_IMP_SEQUENCE_opt_type(ASN1_OBJECT, a->reject, i2d_ASN1_OBJECT, 0); | ||
| 124 | |||
| 125 | M_ASN1_I2D_len(a->alias, i2d_ASN1_UTF8STRING); | ||
| 126 | M_ASN1_I2D_len(a->keyid, i2d_ASN1_OCTET_STRING); | ||
| 127 | M_ASN1_I2D_len_IMP_SEQUENCE_opt_type(X509_ALGOR, a->other, i2d_X509_ALGOR, 1); | ||
| 128 | |||
| 129 | M_ASN1_I2D_seq_total(); | ||
| 130 | |||
| 131 | M_ASN1_I2D_put_SEQUENCE_opt_type(ASN1_OBJECT, a->trust, i2d_ASN1_OBJECT); | ||
| 132 | M_ASN1_I2D_put_IMP_SEQUENCE_opt_type(ASN1_OBJECT, a->reject, i2d_ASN1_OBJECT, 0); | ||
| 133 | |||
| 134 | M_ASN1_I2D_put(a->alias, i2d_ASN1_UTF8STRING); | ||
| 135 | M_ASN1_I2D_put(a->keyid, i2d_ASN1_OCTET_STRING); | ||
| 136 | M_ASN1_I2D_put_IMP_SEQUENCE_opt_type(X509_ALGOR, a->other, i2d_X509_ALGOR, 1); | ||
| 137 | |||
| 138 | M_ASN1_I2D_finish(); | ||
| 139 | } | ||
| 140 | |||
| 141 | static X509_CERT_AUX *aux_get(X509 *x) | ||
| 142 | { | ||
| 143 | if(!x) return NULL; | ||
| 144 | if(!x->aux && !(x->aux = X509_CERT_AUX_new())) return NULL; | ||
| 145 | return x->aux; | ||
| 146 | } | ||
| 147 | |||
| 148 | int X509_alias_set1(X509 *x, unsigned char *name, int len) | ||
| 149 | { | ||
| 150 | X509_CERT_AUX *aux; | ||
| 151 | if(!(aux = aux_get(x))) return 0; | ||
| 152 | if(!aux->alias && !(aux->alias = ASN1_UTF8STRING_new())) return 0; | ||
| 153 | return ASN1_STRING_set(aux->alias, name, len); | ||
| 154 | } | ||
| 155 | |||
| 156 | unsigned char *X509_alias_get0(X509 *x, int *len) | ||
| 157 | { | ||
| 158 | if(!x->aux || !x->aux->alias) return NULL; | ||
| 159 | if(len) *len = x->aux->alias->length; | ||
| 160 | return x->aux->alias->data; | ||
| 161 | } | ||
| 162 | |||
| 163 | int X509_add1_trust_object(X509 *x, ASN1_OBJECT *obj) | ||
| 164 | { | ||
| 165 | X509_CERT_AUX *aux; | ||
| 166 | ASN1_OBJECT *objtmp; | ||
| 167 | if(!(objtmp = OBJ_dup(obj))) return 0; | ||
| 168 | if(!(aux = aux_get(x))) return 0; | ||
| 169 | if(!aux->trust | ||
| 170 | && !(aux->trust = sk_ASN1_OBJECT_new_null())) return 0; | ||
| 171 | return sk_ASN1_OBJECT_push(aux->trust, objtmp); | ||
| 172 | } | ||
| 173 | |||
| 174 | int X509_add1_reject_object(X509 *x, ASN1_OBJECT *obj) | ||
| 175 | { | ||
| 176 | X509_CERT_AUX *aux; | ||
| 177 | ASN1_OBJECT *objtmp; | ||
| 178 | if(!(objtmp = OBJ_dup(obj))) return 0; | ||
| 179 | if(!(aux = aux_get(x))) return 0; | ||
| 180 | if(!aux->reject | ||
| 181 | && !(aux->reject = sk_ASN1_OBJECT_new_null())) return 0; | ||
| 182 | return sk_ASN1_OBJECT_push(aux->reject, objtmp); | ||
| 183 | } | ||
| 184 | |||
| 185 | void X509_trust_clear(X509 *x) | ||
| 186 | { | ||
| 187 | if(x->aux && x->aux->trust) { | ||
| 188 | sk_ASN1_OBJECT_pop_free(x->aux->trust, ASN1_OBJECT_free); | ||
| 189 | x->aux->trust = NULL; | ||
| 190 | } | ||
| 191 | } | ||
| 192 | |||
| 193 | void X509_reject_clear(X509 *x) | ||
| 194 | { | ||
| 195 | if(x->aux && x->aux->reject) { | ||
| 196 | sk_ASN1_OBJECT_pop_free(x->aux->reject, ASN1_OBJECT_free); | ||
| 197 | x->aux->reject = NULL; | ||
| 198 | } | ||
| 199 | } | ||
| 200 | |||
