1 /* Copyright (C) 1995-1998 Eric Young (eay (at) cryptsoft.com) 2 * All rights reserved. 3 * 4 * This package is an SSL implementation written 5 * by Eric Young (eay (at) cryptsoft.com). 6 * The implementation was written so as to conform with Netscapes SSL. 7 * 8 * This library is free for commercial and non-commercial use as long as 9 * the following conditions are aheared to. The following conditions 10 * apply to all code found in this distribution, be it the RC4, RSA, 11 * lhash, DES, etc., code; not just the SSL code. The SSL documentation 12 * included with this distribution is covered by the same copyright terms 13 * except that the holder is Tim Hudson (tjh (at) cryptsoft.com). 14 * 15 * Copyright remains Eric Young's, and as such any Copyright notices in 16 * the code are not to be removed. 17 * If this package is used in a product, Eric Young should be given attribution 18 * as the author of the parts of the library used. 19 * This can be in the form of a textual message at program startup or 20 * in documentation (online or textual) provided with the package. 21 * 22 * Redistribution and use in source and binary forms, with or without 23 * modification, are permitted provided that the following conditions 24 * are met: 25 * 1. Redistributions of source code must retain the copyright 26 * notice, this list of conditions and the following disclaimer. 27 * 2. Redistributions in binary form must reproduce the above copyright 28 * notice, this list of conditions and the following disclaimer in the 29 * documentation and/or other materials provided with the distribution. 30 * 3. All advertising materials mentioning features or use of this software 31 * must display the following acknowledgement: 32 * "This product includes cryptographic software written by 33 * Eric Young (eay (at) cryptsoft.com)" 34 * The word 'cryptographic' can be left out if the rouines from the library 35 * being used are not cryptographic related :-). 36 * 4. If you include any Windows specific code (or a derivative thereof) from 37 * the apps directory (application code) you must include an acknowledgement: 38 * "This product includes software written by Tim Hudson (tjh (at) cryptsoft.com)" 39 * 40 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND 41 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 43 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 44 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 45 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 46 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 48 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 49 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 50 * SUCH DAMAGE. 51 * 52 * The licence and distribution terms for any publically available version or 53 * derivative of this code cannot be changed. i.e. this code cannot simply be 54 * copied and put under another distribution licence 55 * [including the GNU Public Licence.] */ 56 57 #include <openssl/asn1.h> 58 59 #include <openssl/err.h> 60 #include <openssl/mem.h> 61 62 63 int i2a_ASN1_INTEGER(BIO *bp, ASN1_INTEGER *a) 64 { 65 int i,n=0; 66 static const char *h="0123456789ABCDEF"; 67 char buf[2]; 68 69 if (a == NULL) return(0); 70 71 if (a->type & V_ASN1_NEG) 72 { 73 if (BIO_write(bp, "-", 1) != 1) goto err; 74 n = 1; 75 } 76 77 if (a->length == 0) 78 { 79 if (BIO_write(bp,"00",2) != 2) goto err; 80 n += 2; 81 } 82 else 83 { 84 for (i=0; i<a->length; i++) 85 { 86 if ((i != 0) && (i%35 == 0)) 87 { 88 if (BIO_write(bp,"\\\n",2) != 2) goto err; 89 n+=2; 90 } 91 buf[0]=h[((unsigned char)a->data[i]>>4)&0x0f]; 92 buf[1]=h[((unsigned char)a->data[i] )&0x0f]; 93 if (BIO_write(bp,buf,2) != 2) goto err; 94 n+=2; 95 } 96 } 97 return(n); 98 err: 99 return(-1); 100 } 101 102 int a2i_ASN1_INTEGER(BIO *bp, ASN1_INTEGER *bs, char *buf, int size) 103 { 104 int ret=0; 105 int i,j,k,m,n,again,bufsize; 106 unsigned char *s=NULL,*sp; 107 unsigned char *bufp; 108 int num=0,slen=0,first=1; 109 110 bs->type=V_ASN1_INTEGER; 111 112 bufsize=BIO_gets(bp,buf,size); 113 for (;;) 114 { 115 if (bufsize < 1) goto err_sl; 116 i=bufsize; 117 if (buf[i-1] == '\n') buf[--i]='\0'; 118 if (i == 0) goto err_sl; 119 if (buf[i-1] == '\r') buf[--i]='\0'; 120 if (i == 0) goto err_sl; 121 again=(buf[i-1] == '\\'); 122 123 for (j=0; j<i; j++) 124 { 125 if (!( ((buf[j] >= '0') && (buf[j] <= '9')) || 126 ((buf[j] >= 'a') && (buf[j] <= 'f')) || 127 ((buf[j] >= 'A') && (buf[j] <= 'F')))) 128 { 129 i=j; 130 break; 131 } 132 } 133 buf[i]='\0'; 134 /* We have now cleared all the crap off the end of the 135 * line */ 136 if (i < 2) goto err_sl; 137 138 bufp=(unsigned char *)buf; 139 if (first) 140 { 141 first=0; 142 if ((bufp[0] == '0') && (buf[1] == '0')) 143 { 144 bufp+=2; 145 i-=2; 146 } 147 } 148 k=0; 149 i-=again; 150 if (i%2 != 0) 151 { 152 OPENSSL_PUT_ERROR(ASN1, ASN1_R_ODD_NUMBER_OF_CHARS); 153 goto err; 154 } 155 i/=2; 156 if (num+i > slen) 157 { 158 if (s == NULL) 159 sp=(unsigned char *)OPENSSL_malloc( 160 (unsigned int)num+i*2); 161 else 162 sp=OPENSSL_realloc_clean(s,slen,num+i*2); 163 if (sp == NULL) 164 { 165 OPENSSL_PUT_ERROR(ASN1, ERR_R_MALLOC_FAILURE); 166 goto err; 167 } 168 s=sp; 169 slen=num+i*2; 170 } 171 for (j=0; j<i; j++,k+=2) 172 { 173 for (n=0; n<2; n++) 174 { 175 m=bufp[k+n]; 176 if ((m >= '0') && (m <= '9')) 177 m-='0'; 178 else if ((m >= 'a') && (m <= 'f')) 179 m=m-'a'+10; 180 else if ((m >= 'A') && (m <= 'F')) 181 m=m-'A'+10; 182 else 183 { 184 OPENSSL_PUT_ERROR(ASN1, ASN1_R_NON_HEX_CHARACTERS); 185 goto err; 186 } 187 s[num+j]<<=4; 188 s[num+j]|=m; 189 } 190 } 191 num+=i; 192 if (again) 193 bufsize=BIO_gets(bp,buf,size); 194 else 195 break; 196 } 197 bs->length=num; 198 bs->data=s; 199 ret=1; 200 err: 201 if (0) 202 { 203 err_sl: 204 OPENSSL_PUT_ERROR(ASN1, ASN1_R_SHORT_LINE); 205 } 206 if (s != NULL) 207 OPENSSL_free(s); 208 return(ret); 209 } 210 211