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
|
/*
array-profile.c: routines for profiling simple array operations
Copyright (C) 2007, 2008, David Harvey
This file is part of the zn_poly library (version 0.8).
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 2 of the License, or
(at your option) version 3 of the License.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <math.h>
#include "support.h"
#include "profiler.h"
#include "zn_poly_internal.h"
#include "zn_poly.h"
typedef void (*bfly_func)(ulong*, ulong*, ulong, const zn_mod_t);
/*
Profiles one of the butterfly routines.
arg points to an array of ulongs:
* First is 0 for add, 1 for subtract, 2 for inplace butterfly.
* Second is 0 for safe version, 1 for slim version.
Returns total cycle count for _count_ calls to butterfly of length 1000.
*/
double profile_bfly(void* arg, unsigned long count)
{
ulong type = ((ulong*) arg)[0];
ulong speed = ((ulong*) arg)[1];
ulong n = 123 +
(speed ? (1UL << (ULONG_BITS - 2)) : (1UL << (ULONG_BITS - 1)));
zn_mod_t mod;
zn_mod_init(mod, n);
const ulong len = 1000;
ulong* buf1 = (ulong*) malloc(sizeof(ulong) * len);
ulong* buf2 = (ulong*) malloc(sizeof(ulong) * len);
// generate random inputs
size_t i;
for (i = 0; i < len; i++)
buf1[i] = random_ulong(n);
for (i = 0; i < len; i++)
buf2[i] = random_ulong(n);
bfly_func target;
if (type == 0)
target = (bfly_func) zn_array_add_inplace;
else if (type == 1)
target = (bfly_func) zn_array_sub_inplace;
else // type == 2
target = zn_array_bfly_inplace;
// warm up
ulong j;
for (j = 0; j < count; j++)
target(buf1, buf2, len, mod);
// do the actual profile
cycle_count_t t0 = get_cycle_counter();
for (j = 0; j < count; j++)
target(buf1, buf2, len, mod);
cycle_count_t t1 = get_cycle_counter();
free(buf2);
free(buf1);
zn_mod_clear(mod);
return cycle_diff(t0, t1);
}
/*
Profiles mpn_add_n or mpn_sub_n.
arg points to a single ulong: 0 for mpn_add_n, 1 for mpn_sub_n.
Returns total cycle count for _count_ calls to length 1000 call.
*/
double profile_mpn_aors(void* arg, unsigned long count)
{
ulong type = ((ulong*) arg)[0];
const ulong len = 1000;
mp_limb_t* buf1 = (mp_limb_t*) malloc(sizeof(mp_limb_t) * len);
mp_limb_t* buf2 = (mp_limb_t*) malloc(sizeof(mp_limb_t) * len);
mp_limb_t (*target)(mp_limb_t*, const mp_limb_t*, const mp_limb_t*,
mp_size_t len);
target = type ? mpn_sub_n : mpn_add_n;
// generate random inputs
size_t i;
for (i = 0; i < len; i++)
buf1[i] = random_ulong(1UL << (ULONG_BITS - 1));
for (i = 0; i < len; i++)
buf2[i] = random_ulong(1UL << (ULONG_BITS - 1));
// warm up
ulong j;
for (j = 0; j < count; j++)
target(buf1, buf1, buf2, len);
// do the actual profile
cycle_count_t t0 = get_cycle_counter();
for (j = 0; j < count; j++)
target(buf1, buf1, buf2, len);
cycle_count_t t1 = get_cycle_counter();
free(buf2);
free(buf1);
return cycle_diff(t0, t1);
}
/*
Profiles scalar multiplication.
arg points to an array of ulongs:
* First is modulus size in bits.
* Second is 0 for regular multiply, 1 for REDC multiply
Returns total cycle count for _count_ calls to zn_array_scalar_mul
of length 1000.
*/
double profile_scalar_mul(void* arg, unsigned long count)
{
int bits = ((ulong*) arg)[0];
int algo = ((ulong*) arg)[1];
zn_mod_t mod;
ulong n = random_modulus(bits, 1);
zn_mod_init(mod, n);
ulong scalar = random_ulong(n);
const ulong len = 1000;
// generate random input
ulong* buf = (ulong*) malloc(sizeof(ulong) * len);
size_t i;
for (i = 0; i < len; i++)
buf[i] = random_ulong(n);
cycle_count_t t0, t1;
// warm up
ulong j;
for (j = 0; j < count; j++)
_zn_array_scalar_mul(buf, buf, len, scalar, algo, mod);
// do the actual profile
t0 = get_cycle_counter();
for (j = 0; j < count; j++)
_zn_array_scalar_mul(buf, buf, len, scalar, algo, mod);
t1 = get_cycle_counter();
free(buf);
zn_mod_clear(mod);
return cycle_diff(t0, t1);
}
// end of file ****************************************************************
|
