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
|
#include "modint.h"
void modint_mat_mul1(unsigned m, unsigned n, unsigned p,
modint * restrict c, unsigned stride_c,
const modint *a, unsigned stride_a,
const modint *b, unsigned stride_b) {
for(unsigned i=0; i<m; i++) {
for(unsigned k=0; k<p; k++) {
c[i*stride_c+k] = 0;
}
}
for(unsigned i=0; i<m; i++) {
for(unsigned k=0; k<p; k++) {
for(unsigned j=0; j<n; j++) {
c[i*stride_c+k] += a[i*stride_a+j] * b[j*stride_b+k];
}
}
}
for(unsigned i=0; i<m; i++) {
for(unsigned k=0; k<p; k++) {
c[i*stride_c+k] %= MODULUS;
}
}
}
void modint_mat_mul2(unsigned m, unsigned n, unsigned p,
modint * restrict c, unsigned stride_c,
const modint *a, unsigned stride_a,
const modint *b, unsigned stride_b) {
for(unsigned i=0; i<m; i++) {
for(unsigned k=0; k<p; k++) {
modint total = 0;
for(unsigned j=0; j<n; j++) {
total += a[i*stride_a + j] * b[j*stride_b + k];
}
c[i*stride_c+k] = total % MODULUS;
}
}
}
void modint_mat_mul3(unsigned m, unsigned n, unsigned p,
modint * restrict c, unsigned stride_c,
const modint *a, unsigned stride_a,
const modint *b, unsigned stride_b) {
for(unsigned i=0; i<m; i++) {
for(unsigned k=0; k<p; k++) {
modint total0 = 0, total1 = 0;
unsigned j;
for(j=0; j+1<n; j+=2) {
total0 += a[i*stride_a + j] * b[j*stride_b + k];
total1 += a[i*stride_a + (j+1)] * b[(j+1)*stride_b + k];
}
if (j < n) {
total0 += a[i*stride_a + j] * b[j*stride_b + k];
}
c[i*stride_c+k] = (total0+total1) % MODULUS;
}
}
}
void modint_mat_mul4(unsigned m, unsigned n, unsigned p,
modint * c, unsigned stride_c,
const modint *a, unsigned stride_a,
const modint *b, unsigned stride_b) {
const modint *pa_i = a;
modint * pc_i = c;
for(unsigned i=0; i<m; i++) {
for(unsigned k=0; k<p; k++) {
const modint *pb_j_k = b+k, *pa_i_j = pa_i;
modint total = 0;
for(unsigned j=0; j<n; j++) {
total += *pa_i_j * *pb_j_k;
pa_i_j ++;
pb_j_k += stride_b;
}
pc_i[k] = total % MODULUS;
}
pa_i += stride_a;
pc_i += stride_c;
}
}
void modint_mat_mul5(unsigned m, unsigned n, unsigned p,
modint * c, unsigned stride_c,
const modint *a, unsigned stride_a,
const modint *b, unsigned stride_b) {
const modint *pa_i = a;
modint * pc_i = c;
for(unsigned i=0; i<m; i++) {
for(unsigned k=0; k<p; k++) {
const modint *pb_j_k = b+k, *pa_i_j = pa_i;
modint total = 0;
for(unsigned j2=0, n2=n/2; j2<n2; j2++) {
modint p0 = *pa_i_j * *pb_j_k;
pa_i_j ++;
pb_j_k += stride_b;
modint p1 = *pa_i_j * *pb_j_k;
pa_i_j ++;
pb_j_k += stride_b;
total += p0 + p1;
}
if (n%2) {
total += *pa_i_j * *pb_j_k;
}
pc_i[k] = total % MODULUS;
}
pa_i += stride_a;
pc_i += stride_c;
}
}
modint modint_random(void) {
static uint64_t next = 1325997111;
next = next * 1103515245 + 12345;
return next % MODULUS;
}
void modint_mat_random(unsigned m,
unsigned n,
modint *a, unsigned stride_a) {
for(unsigned i=0; i<m; i++) {
for(unsigned j=0; j<n; j++) {
a[i*stride_a + j] = modint_random();
}
}
}
bool modint_mat_equal(unsigned m,
unsigned n,
const modint *a, unsigned stride_a,
const modint *b, unsigned stride_b) {
for(unsigned i=0; i<m; i++) {
for(unsigned j=0; j<n; j++) {
if (a[i*stride_a + j] != b[i*stride_b + j]) return false;
}
}
return true;
}
|
