diff options
Diffstat (limited to 'src/lib/libcrypto/asn1/evp_asn1.c')
-rw-r--r-- | src/lib/libcrypto/asn1/evp_asn1.c | 193 |
1 files changed, 193 insertions, 0 deletions
diff --git a/src/lib/libcrypto/asn1/evp_asn1.c b/src/lib/libcrypto/asn1/evp_asn1.c new file mode 100644 index 0000000000..ebe34a3362 --- /dev/null +++ b/src/lib/libcrypto/asn1/evp_asn1.c | |||
@@ -0,0 +1,193 @@ | |||
1 | /* crypto/asn1/evp_asn1.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 | #include "asn1_mac.h" | ||
63 | |||
64 | int ASN1_TYPE_set_octetstring(a,data,len) | ||
65 | ASN1_TYPE *a; | ||
66 | unsigned char *data; | ||
67 | int len; | ||
68 | { | ||
69 | ASN1_STRING *os; | ||
70 | |||
71 | if ((os=ASN1_OCTET_STRING_new()) == NULL) return(0); | ||
72 | if (!ASN1_OCTET_STRING_set(os,data,len)) return(0); | ||
73 | ASN1_TYPE_set(a,V_ASN1_OCTET_STRING,(char *)os); | ||
74 | return(1); | ||
75 | } | ||
76 | |||
77 | int ASN1_TYPE_get_octetstring(a,data,max_len) | ||
78 | ASN1_TYPE *a; | ||
79 | unsigned char *data; | ||
80 | int max_len; /* for returned value */ | ||
81 | { | ||
82 | int ret,num; | ||
83 | unsigned char *p; | ||
84 | |||
85 | if ((a->type != V_ASN1_OCTET_STRING) || (a->value.octet_string == NULL)) | ||
86 | { | ||
87 | ASN1err(ASN1_F_ASN1_TYPE_GET_OCTETSTRING,ASN1_R_DATA_IS_WRONG); | ||
88 | return(-1); | ||
89 | } | ||
90 | p=ASN1_STRING_data(a->value.octet_string); | ||
91 | ret=ASN1_STRING_length(a->value.octet_string); | ||
92 | if (ret < max_len) | ||
93 | num=ret; | ||
94 | else | ||
95 | num=max_len; | ||
96 | memcpy(data,p,num); | ||
97 | return(ret); | ||
98 | } | ||
99 | |||
100 | int ASN1_TYPE_set_int_octetstring(a,num,data,len) | ||
101 | ASN1_TYPE *a; | ||
102 | long num; | ||
103 | unsigned char *data; | ||
104 | int len; | ||
105 | { | ||
106 | int n,size; | ||
107 | ASN1_OCTET_STRING os,*osp; | ||
108 | ASN1_INTEGER in; | ||
109 | unsigned char *p; | ||
110 | unsigned char buf[32]; /* when they have 256bit longs, | ||
111 | * I'll be in trouble */ | ||
112 | in.data=buf; | ||
113 | in.length=32; | ||
114 | os.data=data; | ||
115 | os.type=V_ASN1_OCTET_STRING; | ||
116 | os.length=len; | ||
117 | ASN1_INTEGER_set(&in,num); | ||
118 | n = i2d_ASN1_INTEGER(&in,NULL); | ||
119 | n+=M_i2d_ASN1_OCTET_STRING(&os,NULL); | ||
120 | |||
121 | size=ASN1_object_size(1,n,V_ASN1_SEQUENCE); | ||
122 | |||
123 | if ((osp=ASN1_STRING_new()) == NULL) return(0); | ||
124 | /* Grow the 'string' */ | ||
125 | ASN1_STRING_set(osp,NULL,size); | ||
126 | |||
127 | ASN1_STRING_length(osp)=size; | ||
128 | p=ASN1_STRING_data(osp); | ||
129 | |||
130 | ASN1_put_object(&p,1,n,V_ASN1_SEQUENCE,V_ASN1_UNIVERSAL); | ||
131 | i2d_ASN1_INTEGER(&in,&p); | ||
132 | M_i2d_ASN1_OCTET_STRING(&os,&p); | ||
133 | |||
134 | ASN1_TYPE_set(a,V_ASN1_SEQUENCE,(char *)osp); | ||
135 | return(1); | ||
136 | } | ||
137 | |||
138 | /* we return the actual length... */ | ||
139 | int ASN1_TYPE_get_int_octetstring(a,num,data,max_len) | ||
140 | ASN1_TYPE *a; | ||
141 | long *num; | ||
142 | unsigned char *data; | ||
143 | int max_len; /* for returned value */ | ||
144 | { | ||
145 | int ret= -1,n; | ||
146 | ASN1_INTEGER *ai=NULL; | ||
147 | ASN1_OCTET_STRING *os=NULL; | ||
148 | unsigned char *p; | ||
149 | long length; | ||
150 | ASN1_CTX c; | ||
151 | |||
152 | if ((a->type != V_ASN1_SEQUENCE) || (a->value.sequence == NULL)) | ||
153 | { | ||
154 | goto err; | ||
155 | } | ||
156 | p=ASN1_STRING_data(a->value.sequence); | ||
157 | length=ASN1_STRING_length(a->value.sequence); | ||
158 | |||
159 | c.pp= &p; | ||
160 | c.p=p; | ||
161 | c.max=p+length; | ||
162 | c.error=ASN1_R_DATA_IS_WRONG; | ||
163 | |||
164 | M_ASN1_D2I_start_sequence(); | ||
165 | c.q=c.p; | ||
166 | if ((ai=d2i_ASN1_INTEGER(NULL,&c.p,c.slen)) == NULL) goto err; | ||
167 | c.slen-=(c.p-c.q); | ||
168 | c.q=c.p; | ||
169 | if ((os=d2i_ASN1_OCTET_STRING(NULL,&c.p,c.slen)) == NULL) goto err; | ||
170 | c.slen-=(c.p-c.q); | ||
171 | if (!M_ASN1_D2I_end_sequence()) goto err; | ||
172 | |||
173 | if (num != NULL) | ||
174 | *num=ASN1_INTEGER_get(ai); | ||
175 | |||
176 | ret=ASN1_STRING_length(os); | ||
177 | if (max_len > ret) | ||
178 | n=ret; | ||
179 | else | ||
180 | n=max_len; | ||
181 | |||
182 | if (data != NULL) | ||
183 | memcpy(data,ASN1_STRING_data(os),n); | ||
184 | if (0) | ||
185 | { | ||
186 | err: | ||
187 | ASN1err(ASN1_F_ASN1_TYPE_GET_INT_OCTETSTRING,ASN1_R_DATA_IS_WRONG); | ||
188 | } | ||
189 | if (os != NULL) ASN1_OCTET_STRING_free(os); | ||
190 | if (ai != NULL) ASN1_INTEGER_free(ai); | ||
191 | return(ret); | ||
192 | } | ||
193 | |||