Alexandre Savard | 1b09e31 | 2012-08-07 20:33:29 -0400 | [diff] [blame] | 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 *)OPENSSL_malloc( |
| 157 | (unsigned int)num+i*2); |
| 158 | else |
| 159 | sp=(unsigned char *)OPENSSL_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) OPENSSL_free(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 | |