1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/os/ossrv/ssl/libcrypto/src/crypto/asn1/f_string.c Fri Jun 15 03:10:57 2012 +0200
1.3 @@ -0,0 +1,223 @@
1.4 +/* crypto/asn1/f_string.c */
1.5 +/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
1.6 + * All rights reserved.
1.7 + *
1.8 + * This package is an SSL implementation written
1.9 + * by Eric Young (eay@cryptsoft.com).
1.10 + * The implementation was written so as to conform with Netscapes SSL.
1.11 + *
1.12 + * This library is free for commercial and non-commercial use as long as
1.13 + * the following conditions are aheared to. The following conditions
1.14 + * apply to all code found in this distribution, be it the RC4, RSA,
1.15 + * lhash, DES, etc., code; not just the SSL code. The SSL documentation
1.16 + * included with this distribution is covered by the same copyright terms
1.17 + * except that the holder is Tim Hudson (tjh@cryptsoft.com).
1.18 + *
1.19 + * Copyright remains Eric Young's, and as such any Copyright notices in
1.20 + * the code are not to be removed.
1.21 + * If this package is used in a product, Eric Young should be given attribution
1.22 + * as the author of the parts of the library used.
1.23 + * This can be in the form of a textual message at program startup or
1.24 + * in documentation (online or textual) provided with the package.
1.25 + *
1.26 + * Redistribution and use in source and binary forms, with or without
1.27 + * modification, are permitted provided that the following conditions
1.28 + * are met:
1.29 + * 1. Redistributions of source code must retain the copyright
1.30 + * notice, this list of conditions and the following disclaimer.
1.31 + * 2. Redistributions in binary form must reproduce the above copyright
1.32 + * notice, this list of conditions and the following disclaimer in the
1.33 + * documentation and/or other materials provided with the distribution.
1.34 + * 3. All advertising materials mentioning features or use of this software
1.35 + * must display the following acknowledgement:
1.36 + * "This product includes cryptographic software written by
1.37 + * Eric Young (eay@cryptsoft.com)"
1.38 + * The word 'cryptographic' can be left out if the rouines from the library
1.39 + * being used are not cryptographic related :-).
1.40 + * 4. If you include any Windows specific code (or a derivative thereof) from
1.41 + * the apps directory (application code) you must include an acknowledgement:
1.42 + * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
1.43 + *
1.44 + * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
1.45 + * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1.46 + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1.47 + * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
1.48 + * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1.49 + * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1.50 + * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1.51 + * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1.52 + * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1.53 + * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
1.54 + * SUCH DAMAGE.
1.55 + *
1.56 + * The licence and distribution terms for any publically available version or
1.57 + * derivative of this code cannot be changed. i.e. this code cannot simply be
1.58 + * copied and put under another distribution licence
1.59 + * [including the GNU Public Licence.]
1.60 + */
1.61 +/*
1.62 + © Portions copyright (c) 2006 Nokia Corporation. All rights reserved.
1.63 + */
1.64 +#include <stdio.h>
1.65 +#include "cryptlib.h"
1.66 +#include <openssl/buffer.h>
1.67 +#include <openssl/asn1.h>
1.68 +#if (defined(SYMBIAN) && (defined(__WINSCW__) || defined(__WINS__)))
1.69 +#include "libcrypto_wsd_macros.h"
1.70 +#include "libcrypto_wsd.h"
1.71 +#endif
1.72 +
1.73 +
1.74 +EXPORT_C int i2a_ASN1_STRING(BIO *bp, ASN1_STRING *a, int type)
1.75 + {
1.76 + int i,n=0;
1.77 +#ifndef EMULATOR
1.78 + static const char *h="0123456789ABCDEF";
1.79 +#else
1.80 + static const char *const h="0123456789ABCDEF";
1.81 +#endif
1.82 + char buf[2];
1.83 +
1.84 + if (a == NULL) return(0);
1.85 +
1.86 + if (a->length == 0)
1.87 + {
1.88 + if (BIO_write(bp,"0",1) != 1) goto err;
1.89 + n=1;
1.90 + }
1.91 + else
1.92 + {
1.93 + for (i=0; i<a->length; i++)
1.94 + {
1.95 + if ((i != 0) && (i%35 == 0))
1.96 + {
1.97 + if (BIO_write(bp,"\\\n",2) != 2) goto err;
1.98 + n+=2;
1.99 + }
1.100 + buf[0]=h[((unsigned char)a->data[i]>>4)&0x0f];
1.101 + buf[1]=h[((unsigned char)a->data[i] )&0x0f];
1.102 + if (BIO_write(bp,buf,2) != 2) goto err;
1.103 + n+=2;
1.104 + }
1.105 + }
1.106 + return(n);
1.107 +err:
1.108 + return(-1);
1.109 + }
1.110 +
1.111 +EXPORT_C int a2i_ASN1_STRING(BIO *bp, ASN1_STRING *bs, char *buf, int size)
1.112 + {
1.113 + int ret=0;
1.114 + int i,j,k,m,n,again,bufsize;
1.115 + unsigned char *s=NULL,*sp;
1.116 + unsigned char *bufp;
1.117 + int num=0,slen=0,first=1;
1.118 +
1.119 + bufsize=BIO_gets(bp,buf,size);
1.120 + for (;;)
1.121 + {
1.122 + if (bufsize < 1)
1.123 + {
1.124 + if (first)
1.125 + break;
1.126 + else
1.127 + goto err_sl;
1.128 + }
1.129 + first=0;
1.130 +
1.131 + i=bufsize;
1.132 + if (buf[i-1] == '\n') buf[--i]='\0';
1.133 + if (i == 0) goto err_sl;
1.134 + if (buf[i-1] == '\r') buf[--i]='\0';
1.135 + if (i == 0) goto err_sl;
1.136 + again=(buf[i-1] == '\\');
1.137 +
1.138 + for (j=i-1; j>0; j--)
1.139 + {
1.140 +#ifndef CHARSET_EBCDIC
1.141 + if (!( ((buf[j] >= '0') && (buf[j] <= '9')) ||
1.142 + ((buf[j] >= 'a') && (buf[j] <= 'f')) ||
1.143 + ((buf[j] >= 'A') && (buf[j] <= 'F'))))
1.144 +#else
1.145 + /* This #ifdef is not strictly necessary, since
1.146 + * the characters A...F a...f 0...9 are contiguous
1.147 + * (yes, even in EBCDIC - but not the whole alphabet).
1.148 + * Nevertheless, isxdigit() is faster.
1.149 + */
1.150 + if (!isxdigit(buf[j]))
1.151 +#endif
1.152 + {
1.153 + i=j;
1.154 + break;
1.155 + }
1.156 + }
1.157 + buf[i]='\0';
1.158 + /* We have now cleared all the crap off the end of the
1.159 + * line */
1.160 + if (i < 2) goto err_sl;
1.161 +
1.162 + bufp=(unsigned char *)buf;
1.163 +
1.164 + k=0;
1.165 + i-=again;
1.166 + if (i%2 != 0)
1.167 + {
1.168 + ASN1err(ASN1_F_A2I_ASN1_STRING,ASN1_R_ODD_NUMBER_OF_CHARS);
1.169 + goto err;
1.170 + }
1.171 + i/=2;
1.172 + if (num+i > slen)
1.173 + {
1.174 + if (s == NULL)
1.175 + sp=(unsigned char *)OPENSSL_malloc(
1.176 + (unsigned int)num+i*2);
1.177 + else
1.178 + sp=(unsigned char *)OPENSSL_realloc(s,
1.179 + (unsigned int)num+i*2);
1.180 + if (sp == NULL)
1.181 + {
1.182 + ASN1err(ASN1_F_A2I_ASN1_STRING,ERR_R_MALLOC_FAILURE);
1.183 + if (s != NULL) OPENSSL_free(s);
1.184 + goto err;
1.185 + }
1.186 + s=sp;
1.187 + slen=num+i*2;
1.188 + }
1.189 + for (j=0; j<i; j++,k+=2)
1.190 + {
1.191 + for (n=0; n<2; n++)
1.192 + {
1.193 + m=bufp[k+n];
1.194 + if ((m >= '0') && (m <= '9'))
1.195 + m-='0';
1.196 + else if ((m >= 'a') && (m <= 'f'))
1.197 + m=m-'a'+10;
1.198 + else if ((m >= 'A') && (m <= 'F'))
1.199 + m=m-'A'+10;
1.200 + else
1.201 + {
1.202 + ASN1err(ASN1_F_A2I_ASN1_STRING,ASN1_R_NON_HEX_CHARACTERS);
1.203 + goto err;
1.204 + }
1.205 + s[num+j]<<=4;
1.206 + s[num+j]|=m;
1.207 + }
1.208 + }
1.209 + num+=i;
1.210 + if (again)
1.211 + bufsize=BIO_gets(bp,buf,size);
1.212 + else
1.213 + break;
1.214 + }
1.215 + bs->length=num;
1.216 + bs->data=s;
1.217 + ret=1;
1.218 +err:
1.219 + if (0)
1.220 + {
1.221 +err_sl:
1.222 + ASN1err(ASN1_F_A2I_ASN1_STRING,ASN1_R_SHORT_LINE);
1.223 + }
1.224 + return(ret);
1.225 + }
1.226 +