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
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
|
/* Tune various threshold of MPFR
Copyright 2005-2016 Free Software Foundation, Inc.
Contributed by the AriC and Caramel projects, INRIA.
This file is part of the GNU MPFR Library.
The GNU MPFR Library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 3 of the License, or (at your
option) any later version.
The GNU MPFR Library 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 Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the GNU MPFR Library; see the file COPYING.LESSER. If not, see
http://www.gnu.org/licenses/ or write to the Free Software Foundation, Inc.,
51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */
#include <stdlib.h>
#include <time.h>
#define MPFR_NEED_LONGLONG_H
#include "mpfr-impl.h"
#undef _PROTO
#define _PROTO __GMP_PROTO
#include "speed.h"
int verbose;
/* template for an unary function */
/* s->size: precision of both input and output
s->xp : Mantissa of first input
s->yp : mantissa of second input */
#define SPEED_MPFR_FUNC(mean_fun) \
do \
{ \
unsigned i; \
mpfr_limb_ptr wp; \
double t; \
mpfr_t w, x; \
mp_size_t size; \
MPFR_TMP_DECL (marker); \
\
SPEED_RESTRICT_COND (s->size >= MPFR_PREC_MIN); \
SPEED_RESTRICT_COND (s->size <= MPFR_PREC_MAX); \
MPFR_TMP_MARK (marker); \
\
size = (s->size-1)/GMP_NUMB_BITS+1; \
s->xp[size-1] |= MPFR_LIMB_HIGHBIT; \
MPFR_TMP_INIT1 (s->xp, x, s->size); \
MPFR_SET_EXP (x, 0); \
\
MPFR_TMP_INIT (wp, w, s->size, size); \
\
speed_operand_src (s, s->xp, size); \
speed_operand_dst (s, wp, size); \
speed_cache_fill (s); \
\
speed_starttime (); \
i = s->reps; \
do \
mean_fun (w, x, MPFR_RNDN); \
while (--i != 0); \
t = speed_endtime (); \
\
MPFR_TMP_FREE (marker); \
return t; \
} \
while (0)
/* same as SPEED_MPFR_FUNC, but for say mpfr_sin_cos (y, z, x, r) */
#define SPEED_MPFR_FUNC2(mean_fun) \
do \
{ \
unsigned i; \
mpfr_limb_ptr vp, wp; \
double t; \
mpfr_t v, w, x; \
mp_size_t size; \
MPFR_TMP_DECL (marker); \
\
SPEED_RESTRICT_COND (s->size >= MPFR_PREC_MIN); \
SPEED_RESTRICT_COND (s->size <= MPFR_PREC_MAX); \
MPFR_TMP_MARK (marker); \
\
size = (s->size-1)/GMP_NUMB_BITS+1; \
s->xp[size-1] |= MPFR_LIMB_HIGHBIT; \
MPFR_TMP_INIT1 (s->xp, x, s->size); \
MPFR_SET_EXP (x, 0); \
\
MPFR_TMP_INIT (vp, v, s->size, size); \
MPFR_TMP_INIT (wp, w, s->size, size); \
\
speed_operand_src (s, s->xp, size); \
speed_operand_dst (s, vp, size); \
speed_operand_dst (s, wp, size); \
speed_cache_fill (s); \
\
speed_starttime (); \
i = s->reps; \
do \
mean_fun (v, w, x, MPFR_RNDN); \
while (--i != 0); \
t = speed_endtime (); \
\
MPFR_TMP_FREE (marker); \
return t; \
} \
while (0)
/* template for a function like mpfr_mul */
#define SPEED_MPFR_OP(mean_fun) \
do \
{ \
unsigned i; \
mpfr_limb_ptr wp; \
double t; \
mpfr_t w, x, y; \
mp_size_t size; \
MPFR_TMP_DECL (marker); \
\
SPEED_RESTRICT_COND (s->size >= MPFR_PREC_MIN); \
SPEED_RESTRICT_COND (s->size <= MPFR_PREC_MAX); \
MPFR_TMP_MARK (marker); \
\
size = (s->size-1)/GMP_NUMB_BITS+1; \
s->xp[size-1] |= MPFR_LIMB_HIGHBIT; \
MPFR_TMP_INIT1 (s->xp, x, s->size); \
MPFR_SET_EXP (x, 0); \
s->yp[size-1] |= MPFR_LIMB_HIGHBIT; \
MPFR_TMP_INIT1 (s->yp, y, s->size); \
MPFR_SET_EXP (y, 0); \
\
MPFR_TMP_INIT (wp, w, s->size, size); \
\
speed_operand_src (s, s->xp, size); \
speed_operand_src (s, s->yp, size); \
speed_operand_dst (s, wp, size); \
speed_cache_fill (s); \
\
speed_starttime (); \
i = s->reps; \
do \
mean_fun (w, x, y, MPFR_RNDN); \
while (--i != 0); \
t = speed_endtime (); \
\
MPFR_TMP_FREE (marker); \
return t; \
} \
while (0)
/* special template for mpfr_mul(a,b,b) */
#define SPEED_MPFR_SQR(mean_fun) \
do \
{ \
unsigned i; \
mpfr_limb_ptr wp; \
double t; \
mpfr_t w, x; \
mp_size_t size; \
MPFR_TMP_DECL (marker); \
\
SPEED_RESTRICT_COND (s->size >= MPFR_PREC_MIN); \
SPEED_RESTRICT_COND (s->size <= MPFR_PREC_MAX); \
MPFR_TMP_MARK (marker); \
\
size = (s->size-1)/GMP_NUMB_BITS+1; \
s->xp[size-1] |= MPFR_LIMB_HIGHBIT; \
MPFR_TMP_INIT1 (s->xp, x, s->size); \
MPFR_SET_EXP (x, 0); \
\
MPFR_TMP_INIT (wp, w, s->size, size); \
\
speed_operand_src (s, s->xp, size); \
speed_operand_dst (s, wp, size); \
speed_cache_fill (s); \
\
speed_starttime (); \
i = s->reps; \
do \
mean_fun (w, x, x, MPFR_RNDN); \
while (--i != 0); \
t = speed_endtime (); \
\
MPFR_TMP_FREE (marker); \
return t; \
} \
while (0)
/* s->size: precision of both input and output
s->xp : Mantissa of first input
s->r : exponent
s->align_xp : sign (1 means positive, 2 means negative)
*/
#define SPEED_MPFR_FUNC_WITH_EXPONENT(mean_fun) \
do \
{ \
unsigned i; \
mpfr_limb_ptr wp; \
double t; \
mpfr_t w, x; \
mp_size_t size; \
MPFR_TMP_DECL (marker); \
\
SPEED_RESTRICT_COND (s->size >= MPFR_PREC_MIN); \
SPEED_RESTRICT_COND (s->size <= MPFR_PREC_MAX); \
MPFR_TMP_MARK (marker); \
\
size = (s->size-1)/GMP_NUMB_BITS+1; \
s->xp[size-1] |= MPFR_LIMB_HIGHBIT; \
MPFR_TMP_INIT1 (s->xp, x, s->size); \
MPFR_SET_EXP (x, s->r); \
if (s->align_xp == 2) MPFR_SET_NEG (x); \
\
MPFR_TMP_INIT (wp, w, s->size, size); \
\
speed_operand_src (s, s->xp, size); \
speed_operand_dst (s, wp, size); \
speed_cache_fill (s); \
\
speed_starttime (); \
i = s->reps; \
do \
mean_fun (w, x, MPFR_RNDN); \
while (--i != 0); \
t = speed_endtime (); \
\
MPFR_TMP_FREE (marker); \
return t; \
} \
while (0)
/* First we include all the functions we want to tune inside this program.
We can't use the GNU MPFR library since the thresholds are fixed macros. */
/* Setup mpfr_exp_2 */
mpfr_prec_t mpfr_exp_2_threshold;
#undef MPFR_EXP_2_THRESHOLD
#define MPFR_EXP_2_THRESHOLD mpfr_exp_2_threshold
#include "exp_2.c"
static double
speed_mpfr_exp_2 (struct speed_params *s)
{
SPEED_MPFR_FUNC (mpfr_exp_2);
}
/* Setup mpfr_exp */
mpfr_prec_t mpfr_exp_threshold;
#undef MPFR_EXP_THRESHOLD
#define MPFR_EXP_THRESHOLD mpfr_exp_threshold
#include "exp.c"
static double
speed_mpfr_exp (struct speed_params *s)
{
SPEED_MPFR_FUNC (mpfr_exp);
}
/* Setup mpfr_sin_cos */
mpfr_prec_t mpfr_sincos_threshold;
#undef MPFR_SINCOS_THRESHOLD
#define MPFR_SINCOS_THRESHOLD mpfr_sincos_threshold
#include "sin_cos.c"
#include "cos.c"
static double
speed_mpfr_sincos (struct speed_params *s)
{
SPEED_MPFR_FUNC2 (mpfr_sin_cos);
}
/* Setup mpfr_mul, mpfr_sqr and mpfr_div */
mpfr_prec_t mpfr_mul_threshold;
mpfr_prec_t mpfr_sqr_threshold;
mpfr_prec_t mpfr_div_threshold;
#undef MPFR_MUL_THRESHOLD
#define MPFR_MUL_THRESHOLD mpfr_mul_threshold
#undef MPFR_SQR_THRESHOLD
#define MPFR_SQR_THRESHOLD mpfr_sqr_threshold
#undef MPFR_DIV_THRESHOLD
#define MPFR_DIV_THRESHOLD mpfr_div_threshold
#include "mul.c"
#include "div.c"
static double
speed_mpfr_mul (struct speed_params *s)
{
SPEED_MPFR_OP (mpfr_mul);
}
static double
speed_mpfr_sqr (struct speed_params *s)
{
SPEED_MPFR_SQR (mpfr_mul);
}
static double
speed_mpfr_div (struct speed_params *s)
{
SPEED_MPFR_OP (mpfr_div);
}
/************************************************
* Common functions (inspired by GMP function) *
************************************************/
static int
analyze_data (double *dat, int ndat)
{
double x, min_x;
int j, min_j;
x = 0.0;
for (j = 0; j < ndat; j++)
if (dat[j] > 0.0)
x += dat[j];
min_x = x;
min_j = 0;
for (j = 0; j < ndat; x -= dat[j], j++)
{
if (x < min_x)
{
min_x = x;
min_j = j;
}
}
return min_j;
}
static double
mpfr_speed_measure (speed_function_t fun, struct speed_params *s, char *m)
{
double t = -1.0;
int i;
int number_of_iterations = 30;
for (i = 1; i <= number_of_iterations && t == -1.0; i++)
{
t = speed_measure (fun, s);
if ( (t == -1.0) && (i+1 <= number_of_iterations) )
printf("speed_measure failed for size %lu. Trying again... (%d/%d)\n",
s->size, i+1, number_of_iterations);
}
if (t == -1.0)
{
fprintf (stderr, "Failed to measure %s!\n", m);
fprintf (stderr, "If CPU frequency scaling is enabled, please disable it:\n");
fprintf (stderr, " under Linux: cpufreq-selector -g performance\n");
fprintf (stderr, "On a multi-core processor, you might also try to load all the cores\n");
abort ();
}
return t;
}
#define THRESHOLD_WINDOW 16
#define THRESHOLD_FINAL_WINDOW 128
static double
domeasure (mpfr_prec_t *threshold,
double (*func) (struct speed_params *),
mpfr_prec_t p)
{
struct speed_params s;
mp_size_t size;
double t1, t2, d;
s.align_xp = s.align_yp = s.align_wp = 64;
s.size = p;
size = (p - 1)/GMP_NUMB_BITS+1;
s.xp = malloc (2*size*sizeof (mp_limb_t));
if (s.xp == NULL)
{
fprintf (stderr, "Can't allocate memory.\n");
abort ();
}
mpn_random (s.xp, size);
s.yp = s.xp + size;
mpn_random (s.yp, size);
*threshold = MPFR_PREC_MAX;
t1 = mpfr_speed_measure (func, &s, "function 1");
*threshold = 1;
t2 = mpfr_speed_measure (func, &s, "function 2");
free (s.xp);
/* t1 is the time of the first algo (used for low prec) */
if (t2 >= t1)
d = (t2 - t1) / t2;
else
d = (t2 - t1) / t1;
/* d > 0 if we have to use algo 1.
d < 0 if we have to use algo 2 */
return d;
}
/* Performs measures when both the precision and the point of evaluation
shall vary. s.yp is ignored and not initialized.
It assumes that func depends on three thresholds with a boundary of the
form threshold1*x + threshold2*p = some scaling factor, if x<0,
and threshold3*x + threshold2*p = some scaling factor, if x>=0.
*/
static double
domeasure2 (long int *threshold1, long int *threshold2, long int *threshold3,
double (*func) (struct speed_params *),
mpfr_prec_t p,
mpfr_t x)
{
struct speed_params s;
mp_size_t size;
double t1, t2, d;
mpfr_t xtmp;
if (MPFR_IS_SINGULAR (x))
{
mpfr_fprintf (stderr, "x=%RNf is not a regular number.\n");
abort ();
}
if (MPFR_IS_NEG (x))
s.align_xp = 2;
else
s.align_xp = 1;
s.align_yp = s.align_wp = 64;
s.size = p;
size = (p - 1)/GMP_NUMB_BITS+1;
mpfr_init2 (xtmp, p);
mpn_random (xtmp->_mpfr_d, size);
xtmp->_mpfr_d[size-1] |= MPFR_LIMB_HIGHBIT;
MPFR_SET_EXP (xtmp, -53);
mpfr_add_ui (xtmp, xtmp, 1, MPFR_RNDN);
mpfr_mul (xtmp, xtmp, x, MPFR_RNDN); /* xtmp = x*(1+perturb) */
/* where perturb ~ 2^(-53) is */
/* randomly chosen. */
s.xp = xtmp->_mpfr_d;
s.r = MPFR_GET_EXP (xtmp);
*threshold1 = 0;
*threshold2 = 0;
*threshold3 = 0;
t1 = mpfr_speed_measure (func, &s, "function 1");
if (MPFR_IS_NEG (x))
*threshold1 = INT_MIN;
else
*threshold3 = INT_MAX;
*threshold2 = INT_MAX;
t2 = mpfr_speed_measure (func, &s, "function 2");
/* t1 is the time of the first algo (used for low prec) */
if (t2 >= t1)
d = (t2 - t1) / t2;
else
d = (t2 - t1) / t1;
/* d > 0 if we have to use algo 1.
d < 0 if we have to use algo 2 */
mpfr_clear (xtmp);
return d;
}
/* Tune a function with a simple THRESHOLD
The function doesn't depend on another threshold.
It assumes that it uses algo1 if p < THRESHOLD
and algo2 otherwise.
if algo2 is better for low prec, and algo1 better for high prec,
the behaviour of this function is undefined. */
static void
tune_simple_func (mpfr_prec_t *threshold,
double (*func) (struct speed_params *),
mpfr_prec_t pstart)
{
double measure[THRESHOLD_FINAL_WINDOW+1];
double d;
mpfr_prec_t pstep;
int i, numpos, numneg, try;
mpfr_prec_t pmin, pmax, p;
/* first look for a lower bound within 10% */
pmin = p = pstart;
d = domeasure (threshold, func, pmin);
if (d < 0.0)
{
if (verbose)
printf ("Oops: even for %lu, algo 2 seems to be faster!\n",
(unsigned long) pmin);
*threshold = MPFR_PREC_MIN;
return;
}
if (d >= 1.00)
for (;;)
{
d = domeasure (threshold, func, pmin);
if (d < 1.00)
break;
p = pmin;
pmin += pmin/2;
}
pmin = p;
for (;;)
{
d = domeasure (threshold, func, pmin);
if (d < 0.10)
break;
pmin += GMP_NUMB_BITS;
}
/* then look for an upper bound within 20% */
pmax = pmin * 2;
for (;;)
{
d = domeasure (threshold, func, pmax);
if (d < -0.20)
break;
pmax += pmin / 2; /* don't increase too rapidly */
}
/* The threshold is between pmin and pmax. Affine them */
try = 0;
while ((pmax-pmin) >= THRESHOLD_FINAL_WINDOW)
{
pstep = MAX(MIN(GMP_NUMB_BITS/2,(pmax-pmin)/(2*THRESHOLD_WINDOW)),1);
if (verbose)
printf ("Pmin = %8lu Pmax = %8lu Pstep=%lu\n", pmin, pmax, pstep);
p = (pmin + pmax) / 2;
for (i = numpos = numneg = 0 ; i < THRESHOLD_WINDOW + 1 ; i++)
{
measure[i] = domeasure (threshold, func,
p+(i-THRESHOLD_WINDOW/2)*pstep);
if (measure[i] > 0)
numpos ++;
else if (measure[i] < 0)
numneg ++;
}
if (numpos > numneg)
/* We use more often algo 1 than algo 2 */
pmin = p - THRESHOLD_WINDOW/2*pstep;
else if (numpos < numneg)
pmax = p + THRESHOLD_WINDOW/2*pstep;
else
/* numpos == numneg ... */
if (++ try > 2)
{
*threshold = p;
if (verbose)
printf ("Quick find: %lu\n", *threshold);
return ;
}
}
/* Final tune... */
if (verbose)
printf ("Finalizing in [%lu, %lu]... ", pmin, pmax);
for (i = 0 ; i < THRESHOLD_FINAL_WINDOW+1 ; i++)
measure[i] = domeasure (threshold, func, pmin+i);
i = analyze_data (measure, THRESHOLD_FINAL_WINDOW+1);
*threshold = pmin + i;
if (verbose)
printf ("%lu\n", *threshold);
return;
}
/* Tune a function which behavior depends on both p and x,
in a given direction.
It assumes that for (x,p) close to zero, algo1 is used
and algo2 is used when (x,p) is far from zero.
If algo2 is better for low prec, and algo1 better for high prec,
the behaviour of this function is undefined.
This tuning function tries couples (x,p) of the form (ell*dirx, ell*dirp)
until it finds a point on the boundary. It returns ell.
*/
static void
tune_simple_func_in_some_direction (long int *threshold1,
long int *threshold2,
long int *threshold3,
double (*func) (struct speed_params *),
mpfr_prec_t pstart,
int dirx, int dirp,
mpfr_t xres, mpfr_prec_t *pres)
{
double measure[THRESHOLD_FINAL_WINDOW+1];
double d;
mpfr_prec_t pstep;
int i, numpos, numneg, try;
mpfr_prec_t pmin, pmax, p;
mpfr_t xmin, xmax, x;
mpfr_t ratio;
mpfr_init2 (ratio, MPFR_SMALL_PRECISION);
mpfr_set_si (ratio, dirx, MPFR_RNDN);
mpfr_div_si (ratio, ratio, dirp, MPFR_RNDN);
mpfr_init2 (xmin, MPFR_SMALL_PRECISION);
mpfr_init2 (xmax, MPFR_SMALL_PRECISION);
mpfr_init2 (x, MPFR_SMALL_PRECISION);
/* first look for a lower bound within 10% */
pmin = p = pstart;
mpfr_mul_ui (xmin, ratio, (unsigned int)pmin, MPFR_RNDN);
mpfr_set (x, xmin, MPFR_RNDN);
d = domeasure2 (threshold1, threshold2, threshold3, func, pmin, xmin);
if (d < 0.0)
{
if (verbose)
printf ("Oops: even for %lu, algo 2 seems to be faster!\n",
(unsigned long) pmin);
*pres = MPFR_PREC_MIN;
mpfr_mul_ui (xres, ratio, (unsigned int)*pres, MPFR_RNDN);
mpfr_clear (ratio); mpfr_clear (x); mpfr_clear (xmin); mpfr_clear (xmax);
return;
}
if (d >= 1.00)
for (;;)
{
d = domeasure2 (threshold1, threshold2, threshold3, func, pmin, xmin);
if (d < 1.00)
break;
p = pmin;
mpfr_set (x, xmin, MPFR_RNDN);
pmin += pmin/2;
mpfr_mul_ui (xmin, ratio, (unsigned int)pmin, MPFR_RNDN);
}
pmin = p;
mpfr_set (xmin, x, MPFR_RNDN);
for (;;)
{
d = domeasure2 (threshold1, threshold2, threshold3, func, pmin, xmin);
if (d < 0.10)
break;
pmin += GMP_NUMB_BITS;
mpfr_mul_ui (xmin, ratio, (unsigned int)pmin, MPFR_RNDN);
}
/* then look for an upper bound within 20% */
pmax = pmin * 2;
mpfr_mul_ui (xmax, ratio, (unsigned int)pmax, MPFR_RNDN);
for (;;)
{
d = domeasure2 (threshold1, threshold2, threshold3, func, pmax, xmax);
if (d < -0.20)
break;
pmax += pmin / 2; /* don't increase too rapidly */
mpfr_mul_ui (xmax, ratio, (unsigned int)pmax, MPFR_RNDN);
}
/* The threshold is between pmin and pmax. Affine them */
try = 0;
while ((pmax-pmin) >= THRESHOLD_FINAL_WINDOW)
{
pstep = MAX(MIN(GMP_NUMB_BITS/2,(pmax-pmin)/(2*THRESHOLD_WINDOW)),1);
if (verbose)
printf ("Pmin = %8lu Pmax = %8lu Pstep=%lu\n", pmin, pmax, pstep);
p = (pmin + pmax) / 2;
mpfr_mul_ui (x, ratio, (unsigned int)p, MPFR_RNDN);
for (i = numpos = numneg = 0 ; i < THRESHOLD_WINDOW + 1 ; i++)
{
*pres = p+(i-THRESHOLD_WINDOW/2)*pstep;
mpfr_mul_ui (xres, ratio, (unsigned int)*pres, MPFR_RNDN);
measure[i] = domeasure2 (threshold1, threshold2, threshold3,
func, *pres, xres);
if (measure[i] > 0)
numpos ++;
else if (measure[i] < 0)
numneg ++;
}
if (numpos > numneg)
{
/* We use more often algo 1 than algo 2 */
pmin = p - THRESHOLD_WINDOW/2*pstep;
mpfr_mul_ui (xmin, ratio, (unsigned int)pmin, MPFR_RNDN);
}
else if (numpos < numneg)
{
pmax = p + THRESHOLD_WINDOW/2*pstep;
mpfr_mul_ui (xmax, ratio, (unsigned int)pmax, MPFR_RNDN);
}
else
/* numpos == numneg ... */
if (++ try > 2)
{
*pres = p;
mpfr_mul_ui (xres, ratio, (unsigned int)*pres, MPFR_RNDN);
if (verbose)
printf ("Quick find: %lu\n", *pres);
mpfr_clear (ratio);
mpfr_clear (x); mpfr_clear (xmin); mpfr_clear (xmax);
return ;
}
}
/* Final tune... */
if (verbose)
printf ("Finalizing in [%lu, %lu]... ", pmin, pmax);
for (i = 0 ; i < THRESHOLD_FINAL_WINDOW+1 ; i++)
{
*pres = pmin+i;
mpfr_mul_ui (xres, ratio, (unsigned int)*pres, MPFR_RNDN);
measure[i] = domeasure2 (threshold1, threshold2, threshold3,
func, *pres, xres);
}
i = analyze_data (measure, THRESHOLD_FINAL_WINDOW+1);
*pres = pmin + i;
mpfr_mul_ui (xres, ratio, (unsigned int)*pres, MPFR_RNDN);
if (verbose)
printf ("%lu\n", *pres);
mpfr_clear (ratio); mpfr_clear (x); mpfr_clear (xmin); mpfr_clear (xmax);
return;
}
/************************************
* Tune Mulders' mulhigh function *
************************************/
#define TOLERANCE 1.00
#define MULDERS_TABLE_SIZE 1024
#ifndef MPFR_MULHIGH_SIZE
# define MPFR_MULHIGH_SIZE MULDERS_TABLE_SIZE
#endif
#ifndef MPFR_SQRHIGH_SIZE
# define MPFR_SQRHIGH_SIZE MULDERS_TABLE_SIZE
#endif
#ifndef MPFR_DIVHIGH_SIZE
# define MPFR_DIVHIGH_SIZE MULDERS_TABLE_SIZE
#endif
#define MPFR_MULHIGH_TAB_SIZE MPFR_MULHIGH_SIZE
#define MPFR_SQRHIGH_TAB_SIZE MPFR_SQRHIGH_SIZE
#define MPFR_DIVHIGH_TAB_SIZE MPFR_DIVHIGH_SIZE
#include "mulders.c"
static double
speed_mpfr_mulhigh (struct speed_params *s)
{
SPEED_ROUTINE_MPN_MUL_N (mpfr_mulhigh_n);
}
static double
speed_mpfr_sqrhigh (struct speed_params *s)
{
SPEED_ROUTINE_MPN_SQR (mpfr_sqrhigh_n);
}
static double
speed_mpfr_divhigh (struct speed_params *s)
{
SPEED_ROUTINE_MPN_DC_DIVREM_CALL (mpfr_divhigh_n (q, a, d, s->size));
}
#define MAX_STEPS 513 /* maximum number of values of k tried for a given n */
/* Tune mpfr_mulhigh_n for size n */
static mp_size_t
tune_mul_mulders_upto (mp_size_t n)
{
struct speed_params s;
mp_size_t k, kbest, step;
double t, tbest;
MPFR_TMP_DECL (marker);
if (n == 0)
return -1;
MPFR_TMP_MARK (marker);
s.align_xp = s.align_yp = s.align_wp = 64;
s.size = n;
s.xp = MPFR_TMP_ALLOC (n * sizeof (mp_limb_t));
s.yp = MPFR_TMP_ALLOC (n * sizeof (mp_limb_t));
mpn_random (s.xp, n);
mpn_random (s.yp, n);
/* Check k == -1, mpn_mul_basecase */
mulhigh_ktab[n] = -1;
kbest = -1;
tbest = mpfr_speed_measure (speed_mpfr_mulhigh, &s, "mpfr_mulhigh");
/* Check k == 0, mpn_mulhigh_n_basecase */
mulhigh_ktab[n] = 0;
t = mpfr_speed_measure (speed_mpfr_mulhigh, &s, "mpfr_mulhigh");
if (t * TOLERANCE < tbest)
kbest = 0, tbest = t;
/* Check Mulders with cutoff point k */
step = 1 + n / (2 * MAX_STEPS);
/* we need k >= (n+3)/2, which translates into k >= (n+4)/2 in C */
for (k = (n + 4) / 2 ; k < n ; k += step)
{
mulhigh_ktab[n] = k;
t = mpfr_speed_measure (speed_mpfr_mulhigh, &s, "mpfr_mulhigh");
if (t * TOLERANCE < tbest)
kbest = k, tbest = t;
}
mulhigh_ktab[n] = kbest;
MPFR_TMP_FREE (marker);
return kbest;
}
/* Tune mpfr_sqrhigh_n for size n */
static mp_size_t
tune_sqr_mulders_upto (mp_size_t n)
{
struct speed_params s;
mp_size_t k, kbest, step;
double t, tbest;
MPFR_TMP_DECL (marker);
if (n == 0)
return -1;
MPFR_TMP_MARK (marker);
s.align_xp = s.align_wp = 64;
s.size = n;
s.xp = MPFR_TMP_ALLOC (n * sizeof (mp_limb_t));
mpn_random (s.xp, n);
/* Check k == -1, mpn_sqr_basecase */
sqrhigh_ktab[n] = -1;
kbest = -1;
tbest = mpfr_speed_measure (speed_mpfr_sqrhigh, &s, "mpfr_sqrhigh");
/* Check k == 0, mpfr_mulhigh_n_basecase */
sqrhigh_ktab[n] = 0;
t = mpfr_speed_measure (speed_mpfr_sqrhigh, &s, "mpfr_sqrhigh");
if (t * TOLERANCE < tbest)
kbest = 0, tbest = t;
/* Check Mulders */
step = 1 + n / (2 * MAX_STEPS);
/* we need k >= (n+3)/2, which translates into k >= (n+4)/2 in C */
for (k = (n + 4) / 2 ; k < n ; k += step)
{
sqrhigh_ktab[n] = k;
t = mpfr_speed_measure (speed_mpfr_sqrhigh, &s, "mpfr_sqrhigh");
if (t * TOLERANCE < tbest)
kbest = k, tbest = t;
}
sqrhigh_ktab[n] = kbest;
MPFR_TMP_FREE (marker);
return kbest;
}
/* Tune mpfr_divhigh_n for size n */
static mp_size_t
tune_div_mulders_upto (mp_size_t n)
{
struct speed_params s;
mp_size_t k, kbest, step;
double t, tbest;
MPFR_TMP_DECL (marker);
if (n == 0)
return 0;
MPFR_TMP_MARK (marker);
s.align_xp = s.align_yp = s.align_wp = s.align_wp2 = 64;
s.size = n;
s.xp = MPFR_TMP_ALLOC (n * sizeof (mp_limb_t));
s.yp = MPFR_TMP_ALLOC (n * sizeof (mp_limb_t));
mpn_random (s.xp, n);
mpn_random (s.yp, n);
/* Check k == n, i.e., mpn_divrem */
divhigh_ktab[n] = n;
kbest = n;
tbest = mpfr_speed_measure (speed_mpfr_divhigh, &s, "mpfr_divhigh");
/* Check k == 0, i.e., mpfr_divhigh_n_basecase */
#if defined(WANT_GMP_INTERNALS) && defined(HAVE___GMPN_SBPI1_DIVAPPR_Q)
if (n > 2) /* mpn_sbpi1_divappr_q requires dn > 2 */
#endif
{
divhigh_ktab[n] = 0;
t = mpfr_speed_measure (speed_mpfr_divhigh, &s, "mpfr_divhigh");
if (t * TOLERANCE < tbest)
kbest = 0, tbest = t;
}
/* Check Mulders */
step = 1 + n / (2 * MAX_STEPS);
/* we should have (n+3)/2 <= k < n, which translates into
(n+4)/2 <= k < n in C */
for (k = (n + 4) / 2 ; k < n ; k += step)
{
divhigh_ktab[n] = k;
t = mpfr_speed_measure (speed_mpfr_divhigh, &s, "mpfr_divhigh");
if (t * TOLERANCE < tbest)
kbest = k, tbest = t;
}
divhigh_ktab[n] = kbest;
MPFR_TMP_FREE (marker);
return kbest;
}
static void
tune_mul_mulders (FILE *f)
{
mp_size_t k;
if (verbose)
printf ("Tuning mpfr_mulhigh_n[%d]", (int) MPFR_MULHIGH_TAB_SIZE);
fprintf (f, "#define MPFR_MULHIGH_TAB \\\n ");
for (k = 0 ; k < MPFR_MULHIGH_TAB_SIZE ; k++)
{
fprintf (f, "%d", (int) tune_mul_mulders_upto (k));
if (k != MPFR_MULHIGH_TAB_SIZE-1)
fputc (',', f);
if ((k+1) % 16 == 0)
fprintf (f, " \\\n ");
if (verbose)
putchar ('.');
}
fprintf (f, " \n");
if (verbose)
putchar ('\n');
}
static void
tune_sqr_mulders (FILE *f)
{
mp_size_t k;
if (verbose)
printf ("Tuning mpfr_sqrhigh_n[%d]", (int) MPFR_SQRHIGH_TAB_SIZE);
fprintf (f, "#define MPFR_SQRHIGH_TAB \\\n ");
for (k = 0 ; k < MPFR_SQRHIGH_TAB_SIZE ; k++)
{
fprintf (f, "%d", (int) tune_sqr_mulders_upto (k));
if (k != MPFR_SQRHIGH_TAB_SIZE-1)
fputc (',', f);
if ((k+1) % 16 == 0)
fprintf (f, " \\\n ");
if (verbose)
putchar ('.');
}
fprintf (f, " \n");
if (verbose)
putchar ('\n');
}
static void
tune_div_mulders (FILE *f)
{
mp_size_t k;
if (verbose)
printf ("Tuning mpfr_divhigh_n[%d]", (int) MPFR_DIVHIGH_TAB_SIZE);
fprintf (f, "#define MPFR_DIVHIGH_TAB \\\n ");
for (k = 0 ; k < MPFR_DIVHIGH_TAB_SIZE ; k++)
{
fprintf (f, "%d", (int) tune_div_mulders_upto (k));
if (k != MPFR_DIVHIGH_TAB_SIZE - 1)
fputc (',', f);
if ((k+1) % 16 == 0)
fprintf (f, " /*%zu-%zu*/ \\\n ", k - 15, k);
if (verbose)
putchar ('.');
}
fprintf (f, " \n");
if (verbose)
putchar ('\n');
}
/*******************************************************
* Tuning functions for mpfr_ai *
*******************************************************/
long int mpfr_ai_threshold1;
long int mpfr_ai_threshold2;
long int mpfr_ai_threshold3;
#undef MPFR_AI_THRESHOLD1
#define MPFR_AI_THRESHOLD1 mpfr_ai_threshold1
#undef MPFR_AI_THRESHOLD2
#define MPFR_AI_THRESHOLD2 mpfr_ai_threshold2
#undef MPFR_AI_THRESHOLD3
#define MPFR_AI_THRESHOLD3 mpfr_ai_threshold3
#include "ai.c"
static double
speed_mpfr_ai (struct speed_params *s)
{
SPEED_MPFR_FUNC_WITH_EXPONENT (mpfr_ai);
}
/*******************************************************
* Tune all the threshold of MPFR *
* Warning: tune the function in their dependent order!*
*******************************************************/
static void
all (const char *filename)
{
FILE *f;
time_t start_time, end_time;
struct tm *tp;
mpfr_t x1, x2, x3, tmp1, tmp2;
mpfr_prec_t p1, p2, p3;
f = fopen (filename, "w");
if (f == NULL)
{
fprintf (stderr, "Can't open file '%s' for writing.\n", filename);
abort ();
}
speed_time_init ();
if (verbose)
{
printf ("Using: %s\n", speed_time_string);
printf ("speed_precision %d", speed_precision);
if (speed_unittime == 1.0)
printf (", speed_unittime 1 cycle");
else
printf (", speed_unittime %.2e secs", speed_unittime);
if (speed_cycletime == 1.0 || speed_cycletime == 0.0)
printf (", CPU freq unknown\n");
else
printf (", CPU freq %.2f MHz\n\n", 1e-6/speed_cycletime);
}
time (&start_time);
tp = localtime (&start_time);
fprintf (f, "/* Generated by MPFR's tuneup.c, %d-%02d-%02d, ",
tp->tm_year+1900, tp->tm_mon+1, tp->tm_mday);
#ifdef __ICC
fprintf (f, "icc %d.%d.%d */\n", __ICC / 100, __ICC / 10 % 10, __ICC % 10);
#elif defined(__GNUC__)
#ifdef __GNUC_PATCHLEVEL__
fprintf (f, "gcc %d.%d.%d */\n", __GNUC__, __GNUC_MINOR__,
__GNUC_PATCHLEVEL__);
#else
fprintf (f, "gcc %d.%d */\n", __GNUC__, __GNUC_MINOR__);
#endif
#elif defined (__SUNPRO_C)
fprintf (f, "Sun C %d.%d */\n", __SUNPRO_C / 0x100, __SUNPRO_C % 0x100);
#elif defined (__sgi) && defined (_COMPILER_VERSION)
fprintf (f, "MIPSpro C %d.%d.%d */\n",
_COMPILER_VERSION / 100,
_COMPILER_VERSION / 10 % 10,
_COMPILER_VERSION % 10);
#elif defined (__DECC) && defined (__DECC_VER)
fprintf (f, "DEC C %d */\n", __DECC_VER);
#else
fprintf (f, "system compiler */\n");
#endif
fprintf (f, "\n\n");
fprintf (f, "#ifndef MPFR_TUNE_CASE\n");
fprintf (f, "#define MPFR_TUNE_CASE \"src/mparam.h\"\n");
fprintf (f, "#endif\n\n");
/* Tune mulhigh */
tune_mul_mulders (f);
/* Tune sqrhigh */
tune_sqr_mulders (f);
/* Tune divhigh */
tune_div_mulders (f);
fflush (f);
/* Tune mpfr_mul (threshold is in limbs, but it doesn't matter too much) */
if (verbose)
printf ("Tuning mpfr_mul...\n");
tune_simple_func (&mpfr_mul_threshold, speed_mpfr_mul,
2*GMP_NUMB_BITS+1);
fprintf (f, "#define MPFR_MUL_THRESHOLD %lu /* limbs */\n",
(unsigned long) (mpfr_mul_threshold - 1) / GMP_NUMB_BITS + 1);
/* Tune mpfr_sqr (threshold is in limbs, but it doesn't matter too much) */
if (verbose)
printf ("Tuning mpfr_sqr...\n");
tune_simple_func (&mpfr_sqr_threshold, speed_mpfr_sqr,
2*GMP_NUMB_BITS+1);
fprintf (f, "#define MPFR_SQR_THRESHOLD %lu /* limbs */\n",
(unsigned long) (mpfr_sqr_threshold - 1) / GMP_NUMB_BITS + 1);
/* Tune mpfr_div (threshold is in limbs, but it doesn't matter too much) */
if (verbose)
printf ("Tuning mpfr_div...\n");
tune_simple_func (&mpfr_div_threshold, speed_mpfr_div,
2*GMP_NUMB_BITS+1);
fprintf (f, "#define MPFR_DIV_THRESHOLD %lu /* limbs */\n",
(unsigned long) (mpfr_div_threshold - 1) / GMP_NUMB_BITS + 1);
/* Tune mpfr_exp_2 */
if (verbose)
printf ("Tuning mpfr_exp_2...\n");
tune_simple_func (&mpfr_exp_2_threshold, speed_mpfr_exp_2, GMP_NUMB_BITS);
fprintf (f, "#define MPFR_EXP_2_THRESHOLD %lu /* bits */\n",
(unsigned long) mpfr_exp_2_threshold);
/* Tune mpfr_exp */
if (verbose)
printf ("Tuning mpfr_exp...\n");
tune_simple_func (&mpfr_exp_threshold, speed_mpfr_exp,
MPFR_PREC_MIN+3*GMP_NUMB_BITS);
fprintf (f, "#define MPFR_EXP_THRESHOLD %lu /* bits */\n",
(unsigned long) mpfr_exp_threshold);
/* Tune mpfr_sin_cos */
if (verbose)
printf ("Tuning mpfr_sin_cos...\n");
tune_simple_func (&mpfr_sincos_threshold, speed_mpfr_sincos,
MPFR_PREC_MIN+3*GMP_NUMB_BITS);
fprintf (f, "#define MPFR_SINCOS_THRESHOLD %lu /* bits */\n",
(unsigned long) mpfr_sincos_threshold);
/* Tune mpfr_ai */
if (verbose)
printf ("Tuning mpfr_ai...\n");
mpfr_init2 (x1, MPFR_SMALL_PRECISION);
mpfr_init2 (x2, MPFR_SMALL_PRECISION);
mpfr_init2 (x3, MPFR_SMALL_PRECISION);
mpfr_init2 (tmp1, MPFR_SMALL_PRECISION);
mpfr_init2 (tmp2, MPFR_SMALL_PRECISION);
tune_simple_func_in_some_direction (&mpfr_ai_threshold1, &mpfr_ai_threshold2,
&mpfr_ai_threshold3, speed_mpfr_ai,
MPFR_PREC_MIN+GMP_NUMB_BITS,
-60, 200, x1, &p1);
tune_simple_func_in_some_direction (&mpfr_ai_threshold1, &mpfr_ai_threshold2,
&mpfr_ai_threshold3, speed_mpfr_ai,
MPFR_PREC_MIN+GMP_NUMB_BITS,
-20, 500, x2, &p2);
tune_simple_func_in_some_direction (&mpfr_ai_threshold1, &mpfr_ai_threshold2,
&mpfr_ai_threshold3, speed_mpfr_ai,
MPFR_PREC_MIN+GMP_NUMB_BITS,
40, 200, x3, &p3);
mpfr_mul_ui (tmp1, x2, (unsigned long)p1, MPFR_RNDN);
mpfr_mul_ui (tmp2, x1, (unsigned long)p2, MPFR_RNDN);
mpfr_sub (tmp1, tmp1, tmp2, MPFR_RNDN);
mpfr_div_ui (tmp1, tmp1, MPFR_AI_SCALE, MPFR_RNDN);
mpfr_set_ui (tmp2, (unsigned long)p1, MPFR_RNDN);
mpfr_sub_ui (tmp2, tmp2, (unsigned long)p2, MPFR_RNDN);
mpfr_div (tmp2, tmp2, tmp1, MPFR_RNDN);
mpfr_ai_threshold1 = mpfr_get_si (tmp2, MPFR_RNDN);
mpfr_sub (tmp2, x2, x1, MPFR_RNDN);
mpfr_div (tmp2, tmp2, tmp1, MPFR_RNDN);
mpfr_ai_threshold2 = mpfr_get_si (tmp2, MPFR_RNDN);
mpfr_set_ui (tmp1, (unsigned long)p3, MPFR_RNDN);
mpfr_mul_si (tmp1, tmp1, mpfr_ai_threshold2, MPFR_RNDN);
mpfr_ui_sub (tmp1, MPFR_AI_SCALE, tmp1, MPFR_RNDN);
mpfr_div (tmp1, tmp1, x3, MPFR_RNDN);
mpfr_ai_threshold3 = mpfr_get_si (tmp1, MPFR_RNDN);
fprintf (f, "#define MPFR_AI_THRESHOLD1 %ld /* threshold for negative input of mpfr_ai */\n", mpfr_ai_threshold1);
fprintf (f, "#define MPFR_AI_THRESHOLD2 %ld\n", mpfr_ai_threshold2);
fprintf (f, "#define MPFR_AI_THRESHOLD3 %ld\n", mpfr_ai_threshold3);
mpfr_clear (x1); mpfr_clear (x2); mpfr_clear (x3);
mpfr_clear (tmp1); mpfr_clear (tmp2);
/* End of tuning */
time (&end_time);
fprintf (f, "/* Tuneup completed successfully, took %ld seconds */\n",
(long) (end_time - start_time));
if (verbose)
printf ("Complete (took %ld seconds).\n", (long) (end_time - start_time));
fclose (f);
}
/* Main function */
int main (int argc, char *argv[])
{
/* Unbuffered so if output is redirected to a file it isn't lost if the
program is killed part way through. */
setbuf (stdout, NULL);
setbuf (stderr, NULL);
verbose = argc > 1;
if (verbose)
printf ("Tuning MPFR (Coffee time?)...\n");
all ("mparam.h");
return 0;
}
|