]>
Commit | Line | Data |
---|---|---|
175b0942 DSH |
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 "buffer.h" | |
62 | #include "x509.h" | |
63 | ||
64 | /* Based on a_int.c: equivalent ENUMERATED functions */ | |
65 | ||
66 | int i2a_ASN1_ENUMERATED(bp, a) | |
67 | BIO *bp; | |
68 | ASN1_ENUMERATED *a; | |
69 | { | |
70 | int i,n=0; | |
e778802f | 71 | static const char *h="0123456789ABCDEF"; |
175b0942 DSH |
72 | char buf[2]; |
73 | ||
74 | if (a == NULL) return(0); | |
75 | ||
76 | if (a->length == 0) | |
77 | { | |
78 | if (BIO_write(bp,"00",2) != 2) goto err; | |
79 | n=2; | |
80 | } | |
81 | else | |
82 | { | |
83 | for (i=0; i<a->length; i++) | |
84 | { | |
85 | if ((i != 0) && (i%35 == 0)) | |
86 | { | |
87 | if (BIO_write(bp,"\\\n",2) != 2) goto err; | |
88 | n+=2; | |
89 | } | |
90 | buf[0]=h[((unsigned char)a->data[i]>>4)&0x0f]; | |
91 | buf[1]=h[((unsigned char)a->data[i] )&0x0f]; | |
92 | if (BIO_write(bp,buf,2) != 2) goto err; | |
93 | n+=2; | |
94 | } | |
95 | } | |
96 | return(n); | |
97 | err: | |
98 | return(-1); | |
99 | } | |
100 | ||
101 | int a2i_ASN1_ENUMERATED(bp,bs,buf,size) | |
102 | BIO *bp; | |
103 | ASN1_ENUMERATED *bs; | |
104 | char *buf; | |
105 | int size; | |
106 | { | |
107 | int ret=0; | |
108 | int i,j,k,m,n,again,bufsize; | |
109 | unsigned char *s=NULL,*sp; | |
110 | unsigned char *bufp; | |
111 | int num=0,slen=0,first=1; | |
112 | ||
113 | bs->type=V_ASN1_ENUMERATED; | |
114 | ||
115 | bufsize=BIO_gets(bp,buf,size); | |
116 | for (;;) | |
117 | { | |
118 | if (bufsize < 1) goto err_sl; | |
119 | i=bufsize; | |
120 | if (buf[i-1] == '\n') buf[--i]='\0'; | |
121 | if (i == 0) goto err_sl; | |
122 | if (buf[i-1] == '\r') buf[--i]='\0'; | |
123 | if (i == 0) goto err_sl; | |
124 | again=(buf[i-1] == '\\'); | |
125 | ||
126 | for (j=0; j<i; j++) | |
127 | { | |
128 | if (!( ((buf[j] >= '0') && (buf[j] <= '9')) || | |
129 | ((buf[j] >= 'a') && (buf[j] <= 'f')) || | |
130 | ((buf[j] >= 'A') && (buf[j] <= 'F')))) | |
131 | { | |
132 | i=j; | |
133 | break; | |
134 | } | |
135 | } | |
136 | buf[i]='\0'; | |
137 | /* We have now cleared all the crap off the end of the | |
138 | * line */ | |
139 | if (i < 2) goto err_sl; | |
140 | ||
141 | bufp=(unsigned char *)buf; | |
142 | if (first) | |
143 | { | |
144 | first=0; | |
145 | if ((bufp[0] == '0') && (buf[1] == '0')) | |
146 | { | |
147 | bufp+=2; | |
148 | i-=2; | |
149 | } | |
150 | } | |
151 | k=0; | |
152 | i-=again; | |
153 | if (i%2 != 0) | |
154 | { | |
155 | ASN1err(ASN1_F_A2I_ASN1_ENUMERATED,ASN1_R_ODD_NUMBER_OF_CHARS); | |
156 | goto err; | |
157 | } | |
158 | i/=2; | |
159 | if (num+i > slen) | |
160 | { | |
161 | if (s == NULL) | |
162 | sp=(unsigned char *)Malloc( | |
163 | (unsigned int)num+i*2); | |
164 | else | |
165 | sp=(unsigned char *)Realloc(s, | |
166 | (unsigned int)num+i*2); | |
167 | if (sp == NULL) | |
168 | { | |
169 | ASN1err(ASN1_F_A2I_ASN1_ENUMERATED,ERR_R_MALLOC_FAILURE); | |
170 | if (s != NULL) Free((char *)s); | |
171 | goto err; | |
172 | } | |
173 | s=sp; | |
174 | slen=num+i*2; | |
175 | } | |
176 | for (j=0; j<i; j++,k+=2) | |
177 | { | |
178 | for (n=0; n<2; n++) | |
179 | { | |
180 | m=bufp[k+n]; | |
181 | if ((m >= '0') && (m <= '9')) | |
182 | m-='0'; | |
183 | else if ((m >= 'a') && (m <= 'f')) | |
184 | m=m-'a'+10; | |
185 | else if ((m >= 'A') && (m <= 'F')) | |
186 | m=m-'A'+10; | |
187 | else | |
188 | { | |
189 | ASN1err(ASN1_F_A2I_ASN1_ENUMERATED,ASN1_R_NON_HEX_CHARACTERS); | |
190 | goto err; | |
191 | } | |
192 | s[num+j]<<=4; | |
193 | s[num+j]|=m; | |
194 | } | |
195 | } | |
196 | num+=i; | |
197 | if (again) | |
198 | bufsize=BIO_gets(bp,buf,size); | |
199 | else | |
200 | break; | |
201 | } | |
202 | bs->length=num; | |
203 | bs->data=s; | |
204 | ret=1; | |
205 | err: | |
206 | if (0) | |
207 | { | |
208 | err_sl: | |
209 | ASN1err(ASN1_F_A2I_ASN1_ENUMERATED,ASN1_R_SHORT_LINE); | |
210 | } | |
211 | return(ret); | |
212 | } | |
213 |