]>
Commit | Line | Data |
---|---|---|
b1ab9ed8 A |
1 | /* |
2 | * Copyright (c) 2000-2001 Apple Computer, Inc. All Rights Reserved. | |
3 | * | |
4 | * The contents of this file constitute Original Code as defined in and are | |
5 | * subject to the Apple Public Source License Version 1.2 (the 'License'). | |
6 | * You may not use this file except in compliance with the License. Please obtain | |
7 | * a copy of the License at http://www.apple.com/publicsource and read it before | |
8 | * using this file. | |
9 | * | |
10 | * This Original Code and all software distributed under the License are | |
11 | * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESS | |
12 | * OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, INCLUDING WITHOUT | |
13 | * LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR | |
14 | * PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. Please see the License for the | |
15 | * specific language governing rights and limitations under the License. | |
16 | */ | |
17 | ||
18 | ||
19 | /* unused */ | |
20 | ||
21 | /* crypto/bn/bnspeed.c */ | |
22 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) | |
23 | * All rights reserved. | |
24 | * | |
25 | * This package is an SSL implementation written | |
26 | * by Eric Young (eay@cryptsoft.com). | |
27 | * The implementation was written so as to conform with Netscapes SSL. | |
28 | * | |
29 | * This library is free for commercial and non-commercial use as long as | |
30 | * the following conditions are aheared to. The following conditions | |
31 | * apply to all code found in this distribution, be it the RC4, RSA, | |
32 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | |
33 | * included with this distribution is covered by the same copyright terms | |
34 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | |
35 | * | |
36 | * Copyright remains Eric Young's, and as such any Copyright notices in | |
37 | * the code are not to be removed. | |
38 | * If this package is used in a product, Eric Young should be given attribution | |
39 | * as the author of the parts of the library used. | |
40 | * This can be in the form of a textual message at program startup or | |
41 | * in documentation (online or textual) provided with the package. | |
42 | * | |
43 | * Redistribution and use in source and binary forms, with or without | |
44 | * modification, are permitted provided that the following conditions | |
45 | * are met: | |
46 | * 1. Redistributions of source code must retain the copyright | |
47 | * notice, this list of conditions and the following disclaimer. | |
48 | * 2. Redistributions in binary form must reproduce the above copyright | |
49 | * notice, this list of conditions and the following disclaimer in the | |
50 | * documentation and/or other materials provided with the distribution. | |
51 | * 3. All advertising materials mentioning features or use of this software | |
52 | * must display the following acknowledgement: | |
53 | * "This product includes cryptographic software written by | |
54 | * Eric Young (eay@cryptsoft.com)" | |
55 | * The word 'cryptographic' can be left out if the rouines from the library | |
56 | * being used are not cryptographic related :-). | |
57 | * 4. If you include any Windows specific code (or a derivative thereof) from | |
58 | * the apps directory (application code) you must include an acknowledgement: | |
59 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | |
60 | * | |
61 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND | |
62 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
63 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
64 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | |
65 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
66 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
67 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
68 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
69 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
70 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
71 | * SUCH DAMAGE. | |
72 | * | |
73 | * The licence and distribution terms for any publically available version or | |
74 | * derivative of this code cannot be changed. i.e. this code cannot simply be | |
75 | * copied and put under another distribution licence | |
76 | * [including the GNU Public Licence.] | |
77 | */ | |
78 | ||
79 | /* most of this code has been pilfered from my libdes speed.c program */ | |
80 | ||
81 | #define BASENUM 1000000 | |
82 | #undef PROG | |
83 | #define PROG bnspeed_main | |
84 | ||
85 | #include <stdio.h> | |
86 | #include <stdlib.h> | |
87 | #include <signal.h> | |
88 | #include <string.h> | |
89 | #include <openssl/crypto.h> | |
90 | #include <openssl/err.h> | |
91 | ||
92 | #if !defined(MSDOS) && (!defined(VMS) || defined(__DECC)) | |
93 | #define TIMES | |
94 | #endif | |
95 | ||
96 | #ifndef _IRIX | |
97 | #include <time.h> | |
98 | #endif | |
99 | #ifdef TIMES | |
100 | #include <sys/types.h> | |
101 | #include <sys/times.h> | |
102 | #endif | |
103 | ||
104 | /* Depending on the VMS version, the tms structure is perhaps defined. | |
105 | The __TMS macro will show if it was. If it wasn't defined, we should | |
106 | undefine TIMES, since that tells the rest of the program how things | |
107 | should be handled. -- Richard Levitte */ | |
108 | #if defined(VMS) && defined(__DECC) && !defined(__TMS) | |
109 | #undef TIMES | |
110 | #endif | |
111 | ||
112 | #ifndef TIMES | |
113 | #include <sys/timeb.h> | |
114 | #endif | |
115 | ||
116 | #if defined(sun) || defined(__ultrix) | |
117 | #define _POSIX_SOURCE | |
118 | #include <limits.h> | |
119 | #include <sys/param.h> | |
120 | #endif | |
121 | ||
122 | #include <openssl/bn.h> | |
123 | #include <openssl/x509.h> | |
124 | ||
125 | /* The following if from times(3) man page. It may need to be changed */ | |
126 | #ifndef HZ | |
127 | # ifndef CLK_TCK | |
128 | # ifndef _BSD_CLK_TCK_ /* FreeBSD hack */ | |
129 | # define HZ 100.0 | |
130 | # else /* _BSD_CLK_TCK_ */ | |
131 | # define HZ ((double)_BSD_CLK_TCK_) | |
132 | # endif | |
133 | # else /* CLK_TCK */ | |
134 | # define HZ ((double)CLK_TCK) | |
135 | # endif | |
136 | #endif | |
137 | ||
138 | #undef BUFSIZE | |
139 | #define BUFSIZE ((long)1024*8) | |
140 | int run=0; | |
141 | ||
142 | static double Time_F(int s); | |
143 | #define START 0 | |
144 | #define STOP 1 | |
145 | ||
146 | static double Time_F(int s) | |
147 | { | |
148 | double ret; | |
149 | #ifdef TIMES | |
150 | static struct tms tstart,tend; | |
151 | ||
152 | if (s == START) | |
153 | { | |
154 | times(&tstart); | |
155 | return(0); | |
156 | } | |
157 | else | |
158 | { | |
159 | times(&tend); | |
160 | ret=((double)(tend.tms_utime-tstart.tms_utime))/HZ; | |
161 | return((ret < 1e-3)?1e-3:ret); | |
162 | } | |
163 | #else /* !times() */ | |
164 | static struct timeb tstart,tend; | |
165 | long i; | |
166 | ||
167 | if (s == START) | |
168 | { | |
169 | ftime(&tstart); | |
170 | return(0); | |
171 | } | |
172 | else | |
173 | { | |
174 | ftime(&tend); | |
175 | i=(long)tend.millitm-(long)tstart.millitm; | |
176 | ret=((double)(tend.time-tstart.time))+((double)i)/1000.0; | |
177 | return((ret < 0.001)?0.001:ret); | |
178 | } | |
179 | #endif | |
180 | } | |
181 | ||
182 | #define NUM_SIZES 5 | |
183 | static int sizes[NUM_SIZES]={128,256,512,1024,2048}; | |
184 | /*static int sizes[NUM_SIZES]={59,179,299,419,539}; */ | |
185 | ||
186 | void do_mul(BIGNUM *r,BIGNUM *a,BIGNUM *b,BN_CTX *ctx); | |
187 | ||
188 | int main(int argc, char **argv) | |
189 | { | |
190 | BN_CTX *ctx; | |
191 | BIGNUM a,b,c; | |
192 | ||
193 | ctx=BN_CTX_new(); | |
194 | BN_init(&a); | |
195 | BN_init(&b); | |
196 | BN_init(&c); | |
197 | ||
198 | do_mul(&a,&b,&c,ctx); | |
199 | } | |
200 | ||
201 | void do_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_CTX *ctx) | |
202 | { | |
203 | int i,j,k; | |
204 | double tm; | |
205 | long num; | |
206 | ||
207 | for (i=0; i<NUM_SIZES; i++) | |
208 | { | |
209 | num=BASENUM; | |
210 | if (i) num/=(i*3); | |
211 | BN_rand(a,sizes[i],1,0); | |
212 | for (j=i; j<NUM_SIZES; j++) | |
213 | { | |
214 | BN_rand(b,sizes[j],1,0); | |
215 | Time_F(START); | |
216 | for (k=0; k<num; k++) | |
217 | BN_mul(r,b,a,ctx); | |
218 | tm=Time_F(STOP); | |
219 | printf("mul %4d x %4d -> %8.3fms\n",sizes[i],sizes[j],tm*1000.0/num); | |
220 | } | |
221 | } | |
222 | ||
223 | for (i=0; i<NUM_SIZES; i++) | |
224 | { | |
225 | num=BASENUM; | |
226 | if (i) num/=(i*3); | |
227 | BN_rand(a,sizes[i],1,0); | |
228 | Time_F(START); | |
229 | for (k=0; k<num; k++) | |
230 | BN_sqr(r,a,ctx); | |
231 | tm=Time_F(STOP); | |
232 | printf("sqr %4d x %4d -> %8.3fms\n",sizes[i],sizes[i],tm*1000.0/num); | |
233 | } | |
234 | ||
235 | for (i=0; i<NUM_SIZES; i++) | |
236 | { | |
237 | num=BASENUM/10; | |
238 | if (i) num/=(i*3); | |
239 | BN_rand(a,sizes[i]-1,1,0); | |
240 | for (j=i; j<NUM_SIZES; j++) | |
241 | { | |
242 | BN_rand(b,sizes[j],1,0); | |
243 | Time_F(START); | |
244 | for (k=0; k<100000; k++) | |
245 | BN_div(r, NULL, b, a,ctx); | |
246 | tm=Time_F(STOP); | |
247 | printf("div %4d / %4d -> %8.3fms\n",sizes[j],sizes[i]-1,tm*1000.0/num); | |
248 | } | |
249 | } | |
250 | } | |
251 |