diff options
Diffstat (limited to 'src/lib/libcrypto/asn1/a_bitstr.c')
-rw-r--r-- | src/lib/libcrypto/asn1/a_bitstr.c | 204 |
1 files changed, 204 insertions, 0 deletions
diff --git a/src/lib/libcrypto/asn1/a_bitstr.c b/src/lib/libcrypto/asn1/a_bitstr.c new file mode 100644 index 0000000000..2c10120651 --- /dev/null +++ b/src/lib/libcrypto/asn1/a_bitstr.c | |||
@@ -0,0 +1,204 @@ | |||
1 | /* crypto/asn1/a_bitstr.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 "asn1.h" | ||
62 | |||
63 | /* ASN1err(ASN1_F_ASN1_STRING_NEW,ASN1_R_STRING_TOO_SHORT); | ||
64 | * ASN1err(ASN1_F_D2I_ASN1_BIT_STRING,ASN1_R_EXPECTING_A_BIT_STRING); | ||
65 | */ | ||
66 | |||
67 | int i2d_ASN1_BIT_STRING(a,pp) | ||
68 | ASN1_BIT_STRING *a; | ||
69 | unsigned char **pp; | ||
70 | { | ||
71 | int ret,j,r,bits; | ||
72 | unsigned char *p,*d; | ||
73 | |||
74 | if (a == NULL) return(0); | ||
75 | |||
76 | /* our bit strings are always a multiple of 8 :-) */ | ||
77 | bits=0; | ||
78 | ret=1+a->length; | ||
79 | r=ASN1_object_size(0,ret,V_ASN1_BIT_STRING); | ||
80 | if (pp == NULL) return(r); | ||
81 | p= *pp; | ||
82 | |||
83 | ASN1_put_object(&p,0,ret,V_ASN1_BIT_STRING,V_ASN1_UNIVERSAL); | ||
84 | if (bits == 0) | ||
85 | j=0; | ||
86 | else j=8-bits; | ||
87 | *(p++)=(unsigned char)j; | ||
88 | d=a->data; | ||
89 | memcpy(p,d,a->length); | ||
90 | p+=a->length; | ||
91 | if (a->length > 0) p[-1]&=(0xff<<j); | ||
92 | *pp=p; | ||
93 | return(r); | ||
94 | } | ||
95 | |||
96 | ASN1_BIT_STRING *d2i_ASN1_BIT_STRING(a, pp, length) | ||
97 | ASN1_BIT_STRING **a; | ||
98 | unsigned char **pp; | ||
99 | long length; | ||
100 | { | ||
101 | ASN1_BIT_STRING *ret=NULL; | ||
102 | unsigned char *p,*s; | ||
103 | long len; | ||
104 | int inf,tag,xclass; | ||
105 | int i; | ||
106 | |||
107 | if ((a == NULL) || ((*a) == NULL)) | ||
108 | { | ||
109 | if ((ret=ASN1_BIT_STRING_new()) == NULL) return(NULL); | ||
110 | } | ||
111 | else | ||
112 | ret=(*a); | ||
113 | |||
114 | p= *pp; | ||
115 | inf=ASN1_get_object(&p,&len,&tag,&xclass,length); | ||
116 | if (inf & 0x80) | ||
117 | { | ||
118 | i=ASN1_R_BAD_OBJECT_HEADER; | ||
119 | goto err; | ||
120 | } | ||
121 | |||
122 | if (tag != V_ASN1_BIT_STRING) | ||
123 | { | ||
124 | i=ASN1_R_EXPECTING_A_BIT_STRING; | ||
125 | goto err; | ||
126 | } | ||
127 | if (len < 1) { i=ASN1_R_STRING_TOO_SHORT; goto err; } | ||
128 | |||
129 | i= *(p++); | ||
130 | if (len-- > 1) /* using one because of the bits left byte */ | ||
131 | { | ||
132 | s=(unsigned char *)Malloc((int)len); | ||
133 | if (s == NULL) | ||
134 | { | ||
135 | i=ERR_R_MALLOC_FAILURE; | ||
136 | goto err; | ||
137 | } | ||
138 | memcpy(s,p,(int)len); | ||
139 | s[len-1]&=(0xff<<i); | ||
140 | p+=len; | ||
141 | } | ||
142 | else | ||
143 | s=NULL; | ||
144 | |||
145 | ret->length=(int)len; | ||
146 | if (ret->data != NULL) Free((char *)ret->data); | ||
147 | ret->data=s; | ||
148 | ret->type=V_ASN1_BIT_STRING; | ||
149 | if (a != NULL) (*a)=ret; | ||
150 | *pp=p; | ||
151 | return(ret); | ||
152 | err: | ||
153 | ASN1err(ASN1_F_D2I_ASN1_BIT_STRING,i); | ||
154 | if ((ret != NULL) && ((a == NULL) || (*a != ret))) | ||
155 | ASN1_BIT_STRING_free(ret); | ||
156 | return(NULL); | ||
157 | } | ||
158 | |||
159 | /* These next 2 functions from Goetz Babin-Ebell <babinebell@trustcenter.de> | ||
160 | */ | ||
161 | int ASN1_BIT_STRING_set_bit(a,n,value) | ||
162 | ASN1_BIT_STRING *a; | ||
163 | int n; | ||
164 | int value; | ||
165 | { | ||
166 | int w,v,iv; | ||
167 | unsigned char *c; | ||
168 | |||
169 | w=n/8; | ||
170 | v=1<<(7-(n&0x07)); | ||
171 | iv= ~v; | ||
172 | |||
173 | if (a == NULL) return(0); | ||
174 | if ((a->length < (w+1)) || (a->data == NULL)) | ||
175 | { | ||
176 | if (!value) return(1); /* Don't need to set */ | ||
177 | if (a->data == NULL) | ||
178 | c=(unsigned char *)Malloc(w+1); | ||
179 | else | ||
180 | c=(unsigned char *)Realloc(a->data,w+1); | ||
181 | if (c == NULL) return(0); | ||
182 | a->data=c; | ||
183 | a->length=w+1; | ||
184 | c[w]=0; | ||
185 | } | ||
186 | a->data[w]=((a->data[w])&iv)|v; | ||
187 | while ((a->length > 0) && (a->data[a->length-1] == 0)) | ||
188 | a->length--; | ||
189 | return(1); | ||
190 | } | ||
191 | |||
192 | int ASN1_BIT_STRING_get_bit(a,n) | ||
193 | ASN1_BIT_STRING *a; | ||
194 | int n; | ||
195 | { | ||
196 | int w,v; | ||
197 | |||
198 | w=n/8; | ||
199 | v=1<<(7-(n&0x07)); | ||
200 | if ((a == NULL) || (a->length < (w+1)) || (a->data == NULL)) | ||
201 | return(0); | ||
202 | return((a->data[w]&v) != 0); | ||
203 | } | ||
204 | |||