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
|
// Copyright (c) 2024 Advanced Micro Devices, Inc. All rights reserved.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
#include "utils_matrix_exponentiation.hpp"
#include <hip/hip_runtime.h>
#include <fstream>
#include <iostream>
#include <string>
const int LFSR113_N = 4; // 4 values
const int LFSR113_M = 32; // 32-bit each
const int LFSR113_SIZE = LFSR113_M * LFSR113_N * LFSR113_N;
const int LFSR113_JUMP_MATRICES = 32;
const int LFSR113_JUMP_LOG2 = 2;
const int LFSR113_SEQUENCE_JUMP_LOG2 = 55;
struct rocrand_lfsr113_state
{
uint4 z;
uint4 subsequence;
void discard()
{
unsigned int b;
b = (((z.x << 6) ^ z.x) >> 13);
z.x = (((z.x & 4294967294U) << 18) ^ b);
b = (((z.y << 2) ^ z.y) >> 27);
z.y = (((z.y & 4294967288U) << 2) ^ b);
b = (((z.z << 13) ^ z.z) >> 21);
z.z = (((z.z & 4294967280U) << 7) ^ b);
b = (((z.w << 3) ^ z.w) >> 12);
z.w = (((z.w & 4294967168U) << 13) ^ b);
}
};
void generate_matrices(unsigned int (&jump_matrices)[LFSR113_JUMP_MATRICES][LFSR113_SIZE],
unsigned int (&sequence_jump_matrices)[LFSR113_JUMP_MATRICES][LFSR113_SIZE])
{
unsigned int one_step[LFSR113_SIZE];
for(int i = 0; i < LFSR113_N; ++i)
{
for(int j = 0; j < LFSR113_M; ++j)
{
rocrand_lfsr113_state state;
const unsigned int b = 1U << j;
state.z.x = (i == 0 ? b : 0);
state.z.y = (i == 1 ? b : 0);
state.z.z = (i == 2 ? b : 0);
state.z.w = (i == 3 ? b : 0);
state.subsequence = uint4{0, 0, 0, 0};
state.discard();
one_step[(i * LFSR113_M + j) * LFSR113_N + 0] = state.z.x;
one_step[(i * LFSR113_M + j) * LFSR113_N + 1] = state.z.y;
one_step[(i * LFSR113_M + j) * LFSR113_N + 2] = state.z.z;
one_step[(i * LFSR113_M + j) * LFSR113_N + 3] = state.z.w;
}
}
// Matrices for jumps within the same sequence (offset). The powers from 2^0 (one_step) to 2^64
// are required, so we need 32 iterations of exponentiations to 2^LFSR113_JUMP_LOG2.
{
unsigned int a[LFSR113_SIZE];
unsigned int b[LFSR113_SIZE];
copy_arr<LFSR113_SIZE>(a, one_step);
copy_arr<LFSR113_SIZE>(jump_matrices[0], a);
for(int k = 1; k < LFSR113_JUMP_MATRICES; k++)
{
copy_arr<LFSR113_SIZE>(b, a);
mat_pow<LFSR113_SIZE, LFSR113_N, LFSR113_M>(a, b, (1 << LFSR113_JUMP_LOG2));
copy_arr<LFSR113_SIZE>(jump_matrices[k], a);
}
}
// Matrices for jumps within sequences. The powers from (2^0)*(2^55) (one_step) to (2^64)*(2^55)
// are required, so we need 32 iterations of exponentiations to 2^LFSR113_JUMP_LOG2.
{
unsigned int a[LFSR113_SIZE];
unsigned int b[LFSR113_SIZE];
copy_arr<LFSR113_SIZE>(a, one_step);
// For 55: A^(2^27)
mat_pow<LFSR113_SIZE, LFSR113_N, LFSR113_M>(b, a, 1ULL << (LFSR113_SEQUENCE_JUMP_LOG2 / 2));
// For 55: (A^(2^27))^(2^28) = A^(2^55)
mat_pow<LFSR113_SIZE, LFSR113_N, LFSR113_M>(
a,
b,
1ULL << (LFSR113_SEQUENCE_JUMP_LOG2 - LFSR113_SEQUENCE_JUMP_LOG2 / 2));
copy_arr<LFSR113_SIZE>(sequence_jump_matrices[0], a);
for(int k = 1; k < LFSR113_JUMP_MATRICES; k++)
{
copy_arr<LFSR113_SIZE>(b, a);
mat_pow<LFSR113_SIZE, LFSR113_N, LFSR113_M>(a, b, (1 << LFSR113_JUMP_LOG2));
copy_arr<LFSR113_SIZE>(sequence_jump_matrices[k], a);
}
}
}
int main(int argc, char const* argv[])
{
if(argc != 2 || std::string(argv[1]) == "--help")
{
std::cout << "Usage:" << std::endl;
std::cout << " ./lfsr113_precomputed_generator "
"../../library/include/rocrand/rocrand_lfsr113_precomputed.h"
<< std::endl;
return -1;
}
unsigned int jump_matrices[LFSR113_JUMP_MATRICES][LFSR113_SIZE];
unsigned int sequence_jump_matrices[LFSR113_JUMP_MATRICES][LFSR113_SIZE];
generate_matrices(jump_matrices, sequence_jump_matrices);
const std::string file_path(argv[1]);
std::ofstream fout(file_path, std::ios_base::out | std::ios_base::trunc);
fout << R"(// Copyright (c) 2024 Advanced Micro Devices, Inc. All rights reserved.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
#ifndef ROCRAND_LFSR113_PRECOMPUTED_H_
#define ROCRAND_LFSR113_PRECOMPUTED_H_
// Auto-generated file. Do not edit!
// Generated by tools/lfsr113_precomputed_generator
)";
fout << "#define LFSR113_N " << LFSR113_N << std::endl;
fout << "#define LFSR113_M " << LFSR113_M << std::endl;
fout << "#define LFSR113_SIZE (LFSR113_M * LFSR113_N * LFSR113_N)" << std::endl;
fout << "#define LFSR113_JUMP_MATRICES " << LFSR113_JUMP_MATRICES << std::endl;
fout << "#define LFSR113_JUMP_LOG2 " << LFSR113_JUMP_LOG2 << std::endl;
fout << std::endl;
write_matrices<LFSR113_JUMP_MATRICES, LFSR113_SIZE, LFSR113_N, LFSR113_M>(
fout,
"d_lfsr113_jump_matrices",
"lfsr113",
static_cast<unsigned int*>(&jump_matrices[0][0]),
true);
write_matrices<LFSR113_JUMP_MATRICES, LFSR113_SIZE, LFSR113_N, LFSR113_M>(
fout,
"h_lfsr113_jump_matrices",
"lfsr113",
static_cast<unsigned int*>(&jump_matrices[0][0]),
false);
write_matrices<LFSR113_JUMP_MATRICES, LFSR113_SIZE, LFSR113_N, LFSR113_M>(
fout,
"d_lfsr113_sequence_jump_matrices",
"lfsr113",
static_cast<unsigned int*>(&sequence_jump_matrices[0][0]),
true);
write_matrices<LFSR113_JUMP_MATRICES, LFSR113_SIZE, LFSR113_N, LFSR113_M>(
fout,
"h_lfsr113_sequence_jump_matrices",
"lfsr113",
static_cast<unsigned int*>(&sequence_jump_matrices[0][0]),
false);
fout << R"(
#endif // ROCRAND_LFSR113_PRECOMPUTED_H_
)";
return 0;
}
|
