1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
|
/** \file speedtest.c
*
* Copyright 2005-2016 Nick Galbreath -- nickg [at] client9 [dot] com
* All rights reserved.
*
* https://github.com/client9/stringencoders/
*
* Released under MIT license. See LICENSE for details.
*
* Quickie performance tester. This does NOT test correctness.
*
*/
#include "apr_base64.h"
#include "modp_b16.h"
#include "modp_b2.h"
#include "modp_b64.h"
#include "modp_b85.h"
#include "modp_bjavascript.h"
#include "modp_burl.h"
#include <time.h>
#ifndef CLOCKS_PER_SEC
#ifdef CLK_TCK
#define CLOCKS_PER_SEC (CLK_TCK)
#endif
#endif
#include <stdio.h>
#include <string.h>
#define SZ 4096
int main(void)
{
double s1, s2;
int i, j;
clock_t c0, c1;
char teststr1[SZ];
/*
this contains the message sizes we'll test on
add, subtract, change as desired.
*/
size_t sizes[] = { 20, 200, 2000 };
for (i = 0; i < (int)sizeof(teststr1); ++i) {
teststr1[i] = (char)('A' + i % 26);
}
/* over allocate result buffers */
char result[SZ * 8];
char result2[SZ * 8];
const int MAX = 1000000;
for (j = 0; j < (int)(sizeof(sizes) / sizeof(size_t)); ++j) {
printf("\nMessage size = %d\n", (int)sizes[j]);
printf("\tmodpb64\tapache\timprovement\tmodpb85\tmodpurl\tmodpb16\tmodpb2\tmodpjs\n");
printf("Encode\t");
fflush(stdout);
/* MODP_B64 ENCODE */
c0 = clock();
for (i = 0; i < MAX; ++i) {
modp_b64_encode(result, teststr1, sizes[j]);
}
c1 = clock();
s1 = (double)(c1 - c0) * (1.0 / (double)CLOCKS_PER_SEC);
printf("%6.2f\t", s1);
fflush(stdout);
/* APACHE ENCODE */
c0 = clock();
for (i = 0; i < MAX; ++i) {
apr_base64_encode_binary(result,
(const unsigned char*)teststr1,
(int)sizes[j]);
}
c1 = clock();
s2 = (double)(c1 - c0) * (1.0 / (double)CLOCKS_PER_SEC);
printf("%6.2f\t", s2);
printf("%6.2fx\t\t", s2 / s1);
fflush(stdout);
/*
* base85 encode, let's see what is faster
*/
c0 = clock();
for (i = 0; i < MAX; ++i) {
modp_b85_encode(result, teststr1, sizes[j]);
}
c1 = clock();
s1 = (double)(c1 - c0) * (1.0 / (double)CLOCKS_PER_SEC);
printf("%6.2f\t", s1);
fflush(stdout);
/*
* url encode
*/
c0 = clock();
for (i = 0; i < MAX; ++i) {
modp_burl_encode(result, teststr1, sizes[j]);
}
c1 = clock();
s1 = (double)(c1 - c0) * (1.0 / (double)CLOCKS_PER_SEC);
printf("%6.2f\t", s1);
fflush(stdout);
/**
* B16
*/
c0 = clock();
for (i = 0; i < MAX; ++i) {
modp_b16_encode(result, teststr1, sizes[j]);
}
c1 = clock();
s1 = (double)(c1 - c0) * (1.0 / (double)CLOCKS_PER_SEC);
printf("%6.2f\t", s1);
fflush(stdout);
/**
* B2 BINARY
*/
c0 = clock();
for (i = 0; i < MAX; ++i) {
modp_b2_encode(result, teststr1, sizes[j]);
}
c1 = clock();
s1 = (double)(c1 - c0) * (1.0 / (double)CLOCKS_PER_SEC);
printf("%6.2f\t", s1);
fflush(stdout);
/**
* javascript
*/
c0 = clock();
for (i = 0; i < MAX; ++i) {
modp_bjavascript_encode(result, teststr1, sizes[j]);
}
c1 = clock();
s1 = (double)(c1 - c0) * (1.0 / (double)CLOCKS_PER_SEC);
printf("%6.2f\t", s1);
fflush(stdout);
printf("\n");
fflush(stdout);
/***
* DECODE
*/
/* reset result to have b64 chars */
modp_b64_encode(result, teststr1, sizes[j]);
size_t len = strlen(result);
printf("Decode\t");
fflush(stdout);
/* MODP_B64 */
c0 = clock();
for (i = 0; i < MAX; ++i) {
modp_b64_decode(result2, result, len);
}
c1 = clock();
s1 = (double)(c1 - c0) * (1.0 / (double)CLOCKS_PER_SEC);
printf("%6.2f\t", s1);
fflush(stdout);
/* APACHE */
c0 = clock();
for (i = 0; i < MAX; ++i) {
apr_base64_decode_binary((unsigned char*)result2, result);
}
c1 = clock();
s2 = (double)(c1 - c0) * (1.0 / (double)CLOCKS_PER_SEC);
printf("%6.2f\t", s2);
printf("%6.2fx\t\t", s2 / s1);
fflush(stdout);
/*
* modp_b85 decode
*/
/* re-encode to get b85 chars, not b64 */
len = modp_b85_encode(result, teststr1, sizes[j]);
c0 = clock();
for (i = 0; i < MAX; ++i) {
modp_b85_decode(result2, result, len);
}
c1 = clock();
s1 = (double)(c1 - c0) * (1.0 / (double)CLOCKS_PER_SEC);
printf("%6.2f\t", s1);
fflush(stdout);
/* re-encode to get urlencoded chars, not b64 */
len = modp_burl_encode(result, teststr1, sizes[j]);
c0 = clock();
for (i = 0; i < MAX; ++i) {
modp_burl_decode(result2, result, len);
}
c1 = clock();
s1 = (double)(c1 - c0) * (1.0 / (double)CLOCKS_PER_SEC);
printf("%6.2f\t", s1);
fflush(stdout);
/**
** B16 DECODE
**/
/* re-encode to get urlencoded chars, not b64 */
len = modp_b16_encode(result, teststr1, sizes[j]);
c0 = clock();
for (i = 0; i < MAX; ++i) {
modp_b16_decode(result2, result, len);
}
c1 = clock();
s1 = (double)(c1 - c0) * (1.0 / (double)CLOCKS_PER_SEC);
printf("%6.2f\t", s1);
fflush(stdout);
/**
** B16 DECODE
**/
/* re-encode to get urlencoded chars, not b64 */
len = modp_b2_encode(result, teststr1, sizes[j]);
c0 = clock();
for (i = 0; i < MAX; ++i) {
modp_b2_decode(result2, result, len);
}
c1 = clock();
s1 = (double)(c1 - c0) * (1.0 / (double)CLOCKS_PER_SEC);
printf("%6.2f\t", s1);
fflush(stdout);
printf("\n");
fflush(stdout);
}
return 0;
}
|
