diff options
Diffstat (limited to 'src/lib/libcrypto/bn/bnspeed.c')
-rw-r--r-- | src/lib/libcrypto/bn/bnspeed.c | 248 |
1 files changed, 248 insertions, 0 deletions
diff --git a/src/lib/libcrypto/bn/bnspeed.c b/src/lib/libcrypto/bn/bnspeed.c new file mode 100644 index 0000000000..f7c2790fff --- /dev/null +++ b/src/lib/libcrypto/bn/bnspeed.c | |||
@@ -0,0 +1,248 @@ | |||
1 | /* crypto/bn/bnspeed.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 | /* most of this code has been pilfered from my libdes speed.c program */ | ||
60 | |||
61 | #define BASENUM 1000000 | ||
62 | #undef PROG | ||
63 | #define PROG bnspeed_main | ||
64 | |||
65 | #include <stdio.h> | ||
66 | #include <stdlib.h> | ||
67 | #include <signal.h> | ||
68 | #include <string.h> | ||
69 | #include "crypto.h" | ||
70 | #include "err.h" | ||
71 | |||
72 | #ifndef MSDOS | ||
73 | #define TIMES | ||
74 | #endif | ||
75 | |||
76 | #ifndef VMS | ||
77 | #ifndef _IRIX | ||
78 | #include <time.h> | ||
79 | #endif | ||
80 | #ifdef TIMES | ||
81 | #include <sys/types.h> | ||
82 | #include <sys/times.h> | ||
83 | #endif | ||
84 | #else /* VMS */ | ||
85 | #include <types.h> | ||
86 | struct tms { | ||
87 | time_t tms_utime; | ||
88 | time_t tms_stime; | ||
89 | time_t tms_uchild; /* I dunno... */ | ||
90 | time_t tms_uchildsys; /* so these names are a guess :-) */ | ||
91 | } | ||
92 | #endif | ||
93 | #ifndef TIMES | ||
94 | #include <sys/timeb.h> | ||
95 | #endif | ||
96 | |||
97 | #ifdef sun | ||
98 | #include <limits.h> | ||
99 | #include <sys/param.h> | ||
100 | #endif | ||
101 | |||
102 | #include "bn.h" | ||
103 | #include "x509.h" | ||
104 | |||
105 | /* The following if from times(3) man page. It may need to be changed */ | ||
106 | #ifndef HZ | ||
107 | # ifndef CLK_TCK | ||
108 | # ifndef _BSD_CLK_TCK_ /* FreeBSD hack */ | ||
109 | # ifndef VMS | ||
110 | # define HZ 100.0 | ||
111 | # else /* VMS */ | ||
112 | # define HZ 100.0 | ||
113 | # endif | ||
114 | # else /* _BSD_CLK_TCK_ */ | ||
115 | # define HZ ((double)_BSD_CLK_TCK_) | ||
116 | # endif | ||
117 | # else /* CLK_TCK */ | ||
118 | # define HZ ((double)CLK_TCK) | ||
119 | # endif | ||
120 | #endif | ||
121 | |||
122 | #undef BUFSIZE | ||
123 | #define BUFSIZE ((long)1024*8) | ||
124 | int run=0; | ||
125 | |||
126 | #ifndef NOPROTO | ||
127 | static double Time_F(int s); | ||
128 | #else | ||
129 | static double Time_F(); | ||
130 | #endif | ||
131 | |||
132 | #define START 0 | ||
133 | #define STOP 1 | ||
134 | |||
135 | static double Time_F(s) | ||
136 | int s; | ||
137 | { | ||
138 | double ret; | ||
139 | #ifdef TIMES | ||
140 | static struct tms tstart,tend; | ||
141 | |||
142 | if (s == START) | ||
143 | { | ||
144 | times(&tstart); | ||
145 | return(0); | ||
146 | } | ||
147 | else | ||
148 | { | ||
149 | times(&tend); | ||
150 | ret=((double)(tend.tms_utime-tstart.tms_utime))/HZ; | ||
151 | return((ret < 1e-3)?1e-3:ret); | ||
152 | } | ||
153 | #else /* !times() */ | ||
154 | static struct timeb tstart,tend; | ||
155 | long i; | ||
156 | |||
157 | if (s == START) | ||
158 | { | ||
159 | ftime(&tstart); | ||
160 | return(0); | ||
161 | } | ||
162 | else | ||
163 | { | ||
164 | ftime(&tend); | ||
165 | i=(long)tend.millitm-(long)tstart.millitm; | ||
166 | ret=((double)(tend.time-tstart.time))+((double)i)/1000.0; | ||
167 | return((ret < 0.001)?0.001:ret); | ||
168 | } | ||
169 | #endif | ||
170 | } | ||
171 | |||
172 | #define NUM_SIZES 5 | ||
173 | static int sizes[NUM_SIZES]={128,256,512,1024,2048}; | ||
174 | /*static int sizes[NUM_SIZES]={59,179,299,419,539}; */ | ||
175 | |||
176 | void do_mul(BIGNUM *r,BIGNUM *a,BIGNUM *b,BN_CTX *ctx); | ||
177 | |||
178 | int main(argc,argv) | ||
179 | int argc; | ||
180 | char **argv; | ||
181 | { | ||
182 | BN_CTX *ctx; | ||
183 | BIGNUM *a,*b,*c,*r; | ||
184 | |||
185 | ctx=BN_CTX_new(); | ||
186 | a=BN_new(); | ||
187 | b=BN_new(); | ||
188 | c=BN_new(); | ||
189 | r=BN_new(); | ||
190 | |||
191 | do_mul(a,b,c,ctx); | ||
192 | } | ||
193 | |||
194 | void do_mul(r,a,b,ctx) | ||
195 | BIGNUM *r; | ||
196 | BIGNUM *a; | ||
197 | BIGNUM *b; | ||
198 | BN_CTX *ctx; | ||
199 | { | ||
200 | int i,j,k; | ||
201 | double tm; | ||
202 | long num; | ||
203 | |||
204 | for (i=0; i<NUM_SIZES; i++) | ||
205 | { | ||
206 | num=BASENUM; | ||
207 | if (i) num/=(i*3); | ||
208 | BN_rand(a,sizes[i],1,0); | ||
209 | for (j=i; j<NUM_SIZES; j++) | ||
210 | { | ||
211 | BN_rand(b,sizes[j],1,0); | ||
212 | Time_F(START); | ||
213 | for (k=0; k<num; k++) | ||
214 | BN_mul(r,b,a); | ||
215 | tm=Time_F(STOP); | ||
216 | printf("mul %4d x %4d -> %8.3fms\n",sizes[i],sizes[j],tm*1000.0/num); | ||
217 | } | ||
218 | } | ||
219 | |||
220 | for (i=0; i<NUM_SIZES; i++) | ||
221 | { | ||
222 | num=BASENUM; | ||
223 | if (i) num/=(i*3); | ||
224 | BN_rand(a,sizes[i],1,0); | ||
225 | Time_F(START); | ||
226 | for (k=0; k<num; k++) | ||
227 | BN_sqr(r,a,ctx); | ||
228 | tm=Time_F(STOP); | ||
229 | printf("sqr %4d x %4d -> %8.3fms\n",sizes[i],sizes[i],tm*1000.0/num); | ||
230 | } | ||
231 | |||
232 | for (i=0; i<NUM_SIZES; i++) | ||
233 | { | ||
234 | num=BASENUM/10; | ||
235 | if (i) num/=(i*3); | ||
236 | BN_rand(a,sizes[i]-1,1,0); | ||
237 | for (j=i; j<NUM_SIZES; j++) | ||
238 | { | ||
239 | BN_rand(b,sizes[j],1,0); | ||
240 | Time_F(START); | ||
241 | for (k=0; k<100000; k++) | ||
242 | BN_div(r, NULL, b, a,ctx); | ||
243 | tm=Time_F(STOP); | ||
244 | printf("div %4d / %4d -> %8.3fms\n",sizes[j],sizes[i]-1,tm*1000.0/num); | ||
245 | } | ||
246 | } | ||
247 | } | ||
248 | |||