@@ -41,7 +41,7 @@ typedef struct Fp {
41
41
int exp ;
42
42
} Fp ;
43
43
44
- static Fp powers_ten [] = {
44
+ static const Fp powers_ten [] = {
45
45
{ 18054884314459144840U , -1220 }, { 13451937075301367670U , -1193 },
46
46
{ 10022474136428063862U , -1166 }, { 14934650266808366570U , -1140 },
47
47
{ 11127181549972568877U , -1113 }, { 16580792590934885855U , -1087 },
@@ -123,7 +123,7 @@ static Fp find_cachedpow10(int exp, int* k)
123
123
#define absv (n ) ((n) < 0 ? -(n) : (n))
124
124
#define minv (a , b ) ((a) < (b) ? (a) : (b))
125
125
126
- static uint64_t tens [] = {
126
+ static const uint64_t tens [] = {
127
127
10000000000000000000U , 1000000000000000000U , 100000000000000000U ,
128
128
10000000000000000U , 1000000000000000U , 100000000000000U ,
129
129
10000000000000U , 1000000000000U , 100000000000U ,
@@ -244,7 +244,7 @@ static int generate_digits(Fp* fp, Fp* upper, Fp* lower, char* digits, int* K)
244
244
uint64_t part2 = upper -> frac & (one .frac - 1 );
245
245
246
246
int idx = 0 , kappa = 10 ;
247
- uint64_t * divp ;
247
+ const uint64_t * divp ;
248
248
/* 1000000000 */
249
249
for (divp = tens + 10 ; kappa > 0 ; divp ++ ) {
250
250
@@ -268,7 +268,7 @@ static int generate_digits(Fp* fp, Fp* upper, Fp* lower, char* digits, int* K)
268
268
}
269
269
270
270
/* 10 */
271
- uint64_t * unit = tens + 18 ;
271
+ const uint64_t * unit = tens + 18 ;
272
272
273
273
while (true) {
274
274
part2 *= 10 ;
0 commit comments