forked from illumos/gcc
/
fixed-value.c
1149 lines (1043 loc) · 31.3 KB
/
fixed-value.c
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
/* Fixed-point arithmetic support.
Copyright (C) 2006, 2007, 2008, 2009, 2010 Free Software Foundation, Inc.
This file is part of GCC.
GCC 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 3, or (at your option) any later
version.
GCC 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 GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"
#include "tree.h"
#include "diagnostic-core.h"
/* Compare two fixed objects for bitwise identity. */
bool
fixed_identical (const FIXED_VALUE_TYPE *a, const FIXED_VALUE_TYPE *b)
{
return (a->mode == b->mode
&& a->data.high == b->data.high
&& a->data.low == b->data.low);
}
/* Calculate a hash value. */
unsigned int
fixed_hash (const FIXED_VALUE_TYPE *f)
{
return (unsigned int) (f->data.low ^ f->data.high);
}
/* Define the enum code for the range of the fixed-point value. */
enum fixed_value_range_code {
FIXED_OK, /* The value is within the range. */
FIXED_UNDERFLOW, /* The value is less than the minimum. */
FIXED_GT_MAX_EPS, /* The value is greater than the maximum, but not equal
to the maximum plus the epsilon. */
FIXED_MAX_EPS /* The value equals the maximum plus the epsilon. */
};
/* Check REAL_VALUE against the range of the fixed-point mode.
Return FIXED_OK, if it is within the range.
FIXED_UNDERFLOW, if it is less than the minimum.
FIXED_GT_MAX_EPS, if it is greater than the maximum, but not equal to
the maximum plus the epsilon.
FIXED_MAX_EPS, if it is equal to the maximum plus the epsilon. */
static enum fixed_value_range_code
check_real_for_fixed_mode (REAL_VALUE_TYPE *real_value, enum machine_mode mode)
{
REAL_VALUE_TYPE max_value, min_value, epsilon_value;
real_2expN (&max_value, GET_MODE_IBIT (mode), mode);
real_2expN (&epsilon_value, -GET_MODE_FBIT (mode), mode);
if (SIGNED_FIXED_POINT_MODE_P (mode))
min_value = real_value_negate (&max_value);
else
real_from_string (&min_value, "0.0");
if (real_compare (LT_EXPR, real_value, &min_value))
return FIXED_UNDERFLOW;
if (real_compare (EQ_EXPR, real_value, &max_value))
return FIXED_MAX_EPS;
real_arithmetic (&max_value, MINUS_EXPR, &max_value, &epsilon_value);
if (real_compare (GT_EXPR, real_value, &max_value))
return FIXED_GT_MAX_EPS;
return FIXED_OK;
}
/* Initialize from a decimal or hexadecimal string. */
void
fixed_from_string (FIXED_VALUE_TYPE *f, const char *str, enum machine_mode mode)
{
REAL_VALUE_TYPE real_value, fixed_value, base_value;
unsigned int fbit;
enum fixed_value_range_code temp;
f->mode = mode;
fbit = GET_MODE_FBIT (mode);
real_from_string (&real_value, str);
temp = check_real_for_fixed_mode (&real_value, f->mode);
/* We don't want to warn the case when the _Fract value is 1.0. */
if (temp == FIXED_UNDERFLOW
|| temp == FIXED_GT_MAX_EPS
|| (temp == FIXED_MAX_EPS && ALL_ACCUM_MODE_P (f->mode)))
warning (OPT_Woverflow,
"large fixed-point constant implicitly truncated to fixed-point type");
real_2expN (&base_value, fbit, mode);
real_arithmetic (&fixed_value, MULT_EXPR, &real_value, &base_value);
real_to_integer2 ((HOST_WIDE_INT *)&f->data.low, &f->data.high,
&fixed_value);
if (temp == FIXED_MAX_EPS && ALL_FRACT_MODE_P (f->mode))
{
/* From the spec, we need to evaluate 1 to the maximal value. */
f->data.low = -1;
f->data.high = -1;
f->data = double_int_ext (f->data,
GET_MODE_FBIT (f->mode)
+ GET_MODE_IBIT (f->mode), 1);
}
else
f->data = double_int_ext (f->data,
SIGNED_FIXED_POINT_MODE_P (f->mode)
+ GET_MODE_FBIT (f->mode)
+ GET_MODE_IBIT (f->mode),
UNSIGNED_FIXED_POINT_MODE_P (f->mode));
}
/* Render F as a decimal floating point constant. */
void
fixed_to_decimal (char *str, const FIXED_VALUE_TYPE *f_orig,
size_t buf_size)
{
REAL_VALUE_TYPE real_value, base_value, fixed_value;
real_2expN (&base_value, GET_MODE_FBIT (f_orig->mode), f_orig->mode);
real_from_integer (&real_value, VOIDmode, f_orig->data.low, f_orig->data.high,
UNSIGNED_FIXED_POINT_MODE_P (f_orig->mode));
real_arithmetic (&fixed_value, RDIV_EXPR, &real_value, &base_value);
real_to_decimal (str, &fixed_value, buf_size, 0, 1);
}
/* If SAT_P, saturate A to the maximum or the minimum, and save to *F based on
the machine mode MODE.
Do not modify *F otherwise.
This function assumes the width of double_int is greater than the width
of the fixed-point value (the sum of a possible sign bit, possible ibits,
and fbits).
Return true, if !SAT_P and overflow. */
static bool
fixed_saturate1 (enum machine_mode mode, double_int a, double_int *f,
bool sat_p)
{
bool overflow_p = false;
bool unsigned_p = UNSIGNED_FIXED_POINT_MODE_P (mode);
int i_f_bits = GET_MODE_IBIT (mode) + GET_MODE_FBIT (mode);
if (unsigned_p) /* Unsigned type. */
{
double_int max;
max.low = -1;
max.high = -1;
max = double_int_ext (max, i_f_bits, 1);
if (double_int_cmp (a, max, 1) == 1)
{
if (sat_p)
*f = max;
else
overflow_p = true;
}
}
else /* Signed type. */
{
double_int max, min;
max.high = -1;
max.low = -1;
max = double_int_ext (max, i_f_bits, 1);
min.high = 0;
min.low = 1;
lshift_double (min.low, min.high, i_f_bits,
2 * HOST_BITS_PER_WIDE_INT,
&min.low, &min.high, 1);
min = double_int_ext (min, 1 + i_f_bits, 0);
if (double_int_cmp (a, max, 0) == 1)
{
if (sat_p)
*f = max;
else
overflow_p = true;
}
else if (double_int_cmp (a, min, 0) == -1)
{
if (sat_p)
*f = min;
else
overflow_p = true;
}
}
return overflow_p;
}
/* If SAT_P, saturate {A_HIGH, A_LOW} to the maximum or the minimum, and
save to *F based on the machine mode MODE.
Do not modify *F otherwise.
This function assumes the width of two double_int is greater than the width
of the fixed-point value (the sum of a possible sign bit, possible ibits,
and fbits).
Return true, if !SAT_P and overflow. */
static bool
fixed_saturate2 (enum machine_mode mode, double_int a_high, double_int a_low,
double_int *f, bool sat_p)
{
bool overflow_p = false;
bool unsigned_p = UNSIGNED_FIXED_POINT_MODE_P (mode);
int i_f_bits = GET_MODE_IBIT (mode) + GET_MODE_FBIT (mode);
if (unsigned_p) /* Unsigned type. */
{
double_int max_r, max_s;
max_r.high = 0;
max_r.low = 0;
max_s.high = -1;
max_s.low = -1;
max_s = double_int_ext (max_s, i_f_bits, 1);
if (double_int_cmp (a_high, max_r, 1) == 1
|| (double_int_equal_p (a_high, max_r) &&
double_int_cmp (a_low, max_s, 1) == 1))
{
if (sat_p)
*f = max_s;
else
overflow_p = true;
}
}
else /* Signed type. */
{
double_int max_r, max_s, min_r, min_s;
max_r.high = 0;
max_r.low = 0;
max_s.high = -1;
max_s.low = -1;
max_s = double_int_ext (max_s, i_f_bits, 1);
min_r.high = -1;
min_r.low = -1;
min_s.high = 0;
min_s.low = 1;
lshift_double (min_s.low, min_s.high, i_f_bits,
2 * HOST_BITS_PER_WIDE_INT,
&min_s.low, &min_s.high, 1);
min_s = double_int_ext (min_s, 1 + i_f_bits, 0);
if (double_int_cmp (a_high, max_r, 0) == 1
|| (double_int_equal_p (a_high, max_r) &&
double_int_cmp (a_low, max_s, 1) == 1))
{
if (sat_p)
*f = max_s;
else
overflow_p = true;
}
else if (double_int_cmp (a_high, min_r, 0) == -1
|| (double_int_equal_p (a_high, min_r) &&
double_int_cmp (a_low, min_s, 1) == -1))
{
if (sat_p)
*f = min_s;
else
overflow_p = true;
}
}
return overflow_p;
}
/* Return the sign bit based on I_F_BITS. */
static inline int
get_fixed_sign_bit (double_int a, int i_f_bits)
{
if (i_f_bits < HOST_BITS_PER_WIDE_INT)
return (a.low >> i_f_bits) & 1;
else
return (a.high >> (i_f_bits - HOST_BITS_PER_WIDE_INT)) & 1;
}
/* Calculate F = A + (SUBTRACT_P ? -B : B).
If SAT_P, saturate the result to the max or the min.
Return true, if !SAT_P and overflow. */
static bool
do_fixed_add (FIXED_VALUE_TYPE *f, const FIXED_VALUE_TYPE *a,
const FIXED_VALUE_TYPE *b, bool subtract_p, bool sat_p)
{
bool overflow_p = false;
bool unsigned_p;
double_int temp;
int i_f_bits;
/* This was a conditional expression but it triggered a bug in
Sun C 5.5. */
if (subtract_p)
temp = double_int_neg (b->data);
else
temp = b->data;
unsigned_p = UNSIGNED_FIXED_POINT_MODE_P (a->mode);
i_f_bits = GET_MODE_IBIT (a->mode) + GET_MODE_FBIT (a->mode);
f->mode = a->mode;
f->data = double_int_add (a->data, temp);
if (unsigned_p) /* Unsigned type. */
{
if (subtract_p) /* Unsigned subtraction. */
{
if (double_int_cmp (a->data, b->data, 1) == -1)
{
if (sat_p)
{
f->data.high = 0;
f->data.low = 0;
}
else
overflow_p = true;
}
}
else /* Unsigned addition. */
{
f->data = double_int_ext (f->data, i_f_bits, 1);
if (double_int_cmp (f->data, a->data, 1) == -1
|| double_int_cmp (f->data, b->data, 1) == -1)
{
if (sat_p)
{
f->data.high = -1;
f->data.low = -1;
}
else
overflow_p = true;
}
}
}
else /* Signed type. */
{
if ((!subtract_p
&& (get_fixed_sign_bit (a->data, i_f_bits)
== get_fixed_sign_bit (b->data, i_f_bits))
&& (get_fixed_sign_bit (a->data, i_f_bits)
!= get_fixed_sign_bit (f->data, i_f_bits)))
|| (subtract_p
&& (get_fixed_sign_bit (a->data, i_f_bits)
!= get_fixed_sign_bit (b->data, i_f_bits))
&& (get_fixed_sign_bit (a->data, i_f_bits)
!= get_fixed_sign_bit (f->data, i_f_bits))))
{
if (sat_p)
{
f->data.low = 1;
f->data.high = 0;
lshift_double (f->data.low, f->data.high, i_f_bits,
2 * HOST_BITS_PER_WIDE_INT,
&f->data.low, &f->data.high, 1);
if (get_fixed_sign_bit (a->data, i_f_bits) == 0)
{
double_int one;
one.low = 1;
one.high = 0;
f->data = double_int_sub (f->data, one);
}
}
else
overflow_p = true;
}
}
f->data = double_int_ext (f->data, (!unsigned_p) + i_f_bits, unsigned_p);
return overflow_p;
}
/* Calculate F = A * B.
If SAT_P, saturate the result to the max or the min.
Return true, if !SAT_P and overflow. */
static bool
do_fixed_multiply (FIXED_VALUE_TYPE *f, const FIXED_VALUE_TYPE *a,
const FIXED_VALUE_TYPE *b, bool sat_p)
{
bool overflow_p = false;
bool unsigned_p = UNSIGNED_FIXED_POINT_MODE_P (a->mode);
int i_f_bits = GET_MODE_IBIT (a->mode) + GET_MODE_FBIT (a->mode);
f->mode = a->mode;
if (GET_MODE_PRECISION (f->mode) <= HOST_BITS_PER_WIDE_INT)
{
f->data = double_int_mul (a->data, b->data);
lshift_double (f->data.low, f->data.high,
(-GET_MODE_FBIT (f->mode)),
2 * HOST_BITS_PER_WIDE_INT,
&f->data.low, &f->data.high, !unsigned_p);
overflow_p = fixed_saturate1 (f->mode, f->data, &f->data, sat_p);
}
else
{
/* The result of multiplication expands to two double_int. */
double_int a_high, a_low, b_high, b_low;
double_int high_high, high_low, low_high, low_low;
double_int r, s, temp1, temp2;
int carry = 0;
/* Decompose a and b to four double_int. */
a_high.low = a->data.high;
a_high.high = 0;
a_low.low = a->data.low;
a_low.high = 0;
b_high.low = b->data.high;
b_high.high = 0;
b_low.low = b->data.low;
b_low.high = 0;
/* Perform four multiplications. */
low_low = double_int_mul (a_low, b_low);
low_high = double_int_mul (a_low, b_high);
high_low = double_int_mul (a_high, b_low);
high_high = double_int_mul (a_high, b_high);
/* Accumulate four results to {r, s}. */
temp1.high = high_low.low;
temp1.low = 0;
s = double_int_add (low_low, temp1);
if (double_int_cmp (s, low_low, 1) == -1
|| double_int_cmp (s, temp1, 1) == -1)
carry ++; /* Carry */
temp1.high = s.high;
temp1.low = s.low;
temp2.high = low_high.low;
temp2.low = 0;
s = double_int_add (temp1, temp2);
if (double_int_cmp (s, temp1, 1) == -1
|| double_int_cmp (s, temp2, 1) == -1)
carry ++; /* Carry */
temp1.low = high_low.high;
temp1.high = 0;
r = double_int_add (high_high, temp1);
temp1.low = low_high.high;
temp1.high = 0;
r = double_int_add (r, temp1);
temp1.low = carry;
temp1.high = 0;
r = double_int_add (r, temp1);
/* We need to subtract b from r, if a < 0. */
if (!unsigned_p && a->data.high < 0)
r = double_int_sub (r, b->data);
/* We need to subtract a from r, if b < 0. */
if (!unsigned_p && b->data.high < 0)
r = double_int_sub (r, a->data);
/* Shift right the result by FBIT. */
if (GET_MODE_FBIT (f->mode) == 2 * HOST_BITS_PER_WIDE_INT)
{
s.low = r.low;
s.high = r.high;
if (unsigned_p)
{
r.low = 0;
r.high = 0;
}
else
{
r.low = -1;
r.high = -1;
}
f->data.low = s.low;
f->data.high = s.high;
}
else
{
lshift_double (s.low, s.high,
(-GET_MODE_FBIT (f->mode)),
2 * HOST_BITS_PER_WIDE_INT,
&s.low, &s.high, 0);
lshift_double (r.low, r.high,
(2 * HOST_BITS_PER_WIDE_INT
- GET_MODE_FBIT (f->mode)),
2 * HOST_BITS_PER_WIDE_INT,
&f->data.low, &f->data.high, 0);
f->data.low = f->data.low | s.low;
f->data.high = f->data.high | s.high;
s.low = f->data.low;
s.high = f->data.high;
lshift_double (r.low, r.high,
(-GET_MODE_FBIT (f->mode)),
2 * HOST_BITS_PER_WIDE_INT,
&r.low, &r.high, !unsigned_p);
}
overflow_p = fixed_saturate2 (f->mode, r, s, &f->data, sat_p);
}
f->data = double_int_ext (f->data, (!unsigned_p) + i_f_bits, unsigned_p);
return overflow_p;
}
/* Calculate F = A / B.
If SAT_P, saturate the result to the max or the min.
Return true, if !SAT_P and overflow. */
static bool
do_fixed_divide (FIXED_VALUE_TYPE *f, const FIXED_VALUE_TYPE *a,
const FIXED_VALUE_TYPE *b, bool sat_p)
{
bool overflow_p = false;
bool unsigned_p = UNSIGNED_FIXED_POINT_MODE_P (a->mode);
int i_f_bits = GET_MODE_IBIT (a->mode) + GET_MODE_FBIT (a->mode);
f->mode = a->mode;
if (GET_MODE_PRECISION (f->mode) <= HOST_BITS_PER_WIDE_INT)
{
lshift_double (a->data.low, a->data.high,
GET_MODE_FBIT (f->mode),
2 * HOST_BITS_PER_WIDE_INT,
&f->data.low, &f->data.high, !unsigned_p);
f->data = double_int_div (f->data, b->data, unsigned_p, TRUNC_DIV_EXPR);
overflow_p = fixed_saturate1 (f->mode, f->data, &f->data, sat_p);
}
else
{
double_int pos_a, pos_b, r, s;
double_int quo_r, quo_s, mod, temp;
int num_of_neg = 0;
int i;
/* If a < 0, negate a. */
if (!unsigned_p && a->data.high < 0)
{
pos_a = double_int_neg (a->data);
num_of_neg ++;
}
else
pos_a = a->data;
/* If b < 0, negate b. */
if (!unsigned_p && b->data.high < 0)
{
pos_b = double_int_neg (b->data);
num_of_neg ++;
}
else
pos_b = b->data;
/* Left shift pos_a to {r, s} by FBIT. */
if (GET_MODE_FBIT (f->mode) == 2 * HOST_BITS_PER_WIDE_INT)
{
r = pos_a;
s.high = 0;
s.low = 0;
}
else
{
lshift_double (pos_a.low, pos_a.high,
GET_MODE_FBIT (f->mode),
2 * HOST_BITS_PER_WIDE_INT,
&s.low, &s.high, 0);
lshift_double (pos_a.low, pos_a.high,
- (2 * HOST_BITS_PER_WIDE_INT
- GET_MODE_FBIT (f->mode)),
2 * HOST_BITS_PER_WIDE_INT,
&r.low, &r.high, 0);
}
/* Divide r by pos_b to quo_r. The remainder is in mod. */
div_and_round_double (TRUNC_DIV_EXPR, 1, r.low, r.high, pos_b.low,
pos_b.high, &quo_r.low, &quo_r.high, &mod.low,
&mod.high);
quo_s.high = 0;
quo_s.low = 0;
for (i = 0; i < 2 * HOST_BITS_PER_WIDE_INT; i++)
{
/* Record the leftmost bit of mod. */
int leftmost_mod = (mod.high < 0);
/* Shift left mod by 1 bit. */
lshift_double (mod.low, mod.high, 1, 2 * HOST_BITS_PER_WIDE_INT,
&mod.low, &mod.high, 0);
/* Test the leftmost bit of s to add to mod. */
if (s.high < 0)
mod.low += 1;
/* Shift left quo_s by 1 bit. */
lshift_double (quo_s.low, quo_s.high, 1, 2 * HOST_BITS_PER_WIDE_INT,
&quo_s.low, &quo_s.high, 0);
/* Try to calculate (mod - pos_b). */
temp = double_int_sub (mod, pos_b);
if (leftmost_mod == 1 || double_int_cmp (mod, pos_b, 1) != -1)
{
quo_s.low += 1;
mod = temp;
}
/* Shift left s by 1 bit. */
lshift_double (s.low, s.high, 1, 2 * HOST_BITS_PER_WIDE_INT,
&s.low, &s.high, 0);
}
if (num_of_neg == 1)
{
quo_s = double_int_neg (quo_s);
if (quo_s.high == 0 && quo_s.low == 0)
quo_r = double_int_neg (quo_r);
else
{
quo_r.low = ~quo_r.low;
quo_r.high = ~quo_r.high;
}
}
f->data = quo_s;
overflow_p = fixed_saturate2 (f->mode, quo_r, quo_s, &f->data, sat_p);
}
f->data = double_int_ext (f->data, (!unsigned_p) + i_f_bits, unsigned_p);
return overflow_p;
}
/* Calculate F = A << B if LEFT_P. Otherwise, F = A >> B.
If SAT_P, saturate the result to the max or the min.
Return true, if !SAT_P and overflow. */
static bool
do_fixed_shift (FIXED_VALUE_TYPE *f, const FIXED_VALUE_TYPE *a,
const FIXED_VALUE_TYPE *b, bool left_p, bool sat_p)
{
bool overflow_p = false;
bool unsigned_p = UNSIGNED_FIXED_POINT_MODE_P (a->mode);
int i_f_bits = GET_MODE_IBIT (a->mode) + GET_MODE_FBIT (a->mode);
f->mode = a->mode;
if (b->data.low == 0)
{
f->data = a->data;
return overflow_p;
}
if (GET_MODE_PRECISION (f->mode) <= HOST_BITS_PER_WIDE_INT || (!left_p))
{
lshift_double (a->data.low, a->data.high,
left_p ? b->data.low : (-b->data.low),
2 * HOST_BITS_PER_WIDE_INT,
&f->data.low, &f->data.high, !unsigned_p);
if (left_p) /* Only left shift saturates. */
overflow_p = fixed_saturate1 (f->mode, f->data, &f->data, sat_p);
}
else /* We need two double_int to store the left-shift result. */
{
double_int temp_high, temp_low;
if (b->data.low == 2 * HOST_BITS_PER_WIDE_INT)
{
temp_high = a->data;
temp_low.high = 0;
temp_low.low = 0;
}
else
{
lshift_double (a->data.low, a->data.high,
b->data.low,
2 * HOST_BITS_PER_WIDE_INT,
&temp_low.low, &temp_low.high, !unsigned_p);
/* Logical shift right to temp_high. */
lshift_double (a->data.low, a->data.high,
b->data.low - 2 * HOST_BITS_PER_WIDE_INT,
2 * HOST_BITS_PER_WIDE_INT,
&temp_high.low, &temp_high.high, 0);
}
if (!unsigned_p && a->data.high < 0) /* Signed-extend temp_high. */
temp_high = double_int_ext (temp_high, b->data.low, unsigned_p);
f->data = temp_low;
overflow_p = fixed_saturate2 (f->mode, temp_high, temp_low, &f->data,
sat_p);
}
f->data = double_int_ext (f->data, (!unsigned_p) + i_f_bits, unsigned_p);
return overflow_p;
}
/* Calculate F = -A.
If SAT_P, saturate the result to the max or the min.
Return true, if !SAT_P and overflow. */
static bool
do_fixed_neg (FIXED_VALUE_TYPE *f, const FIXED_VALUE_TYPE *a, bool sat_p)
{
bool overflow_p = false;
bool unsigned_p = UNSIGNED_FIXED_POINT_MODE_P (a->mode);
int i_f_bits = GET_MODE_IBIT (a->mode) + GET_MODE_FBIT (a->mode);
f->mode = a->mode;
f->data = double_int_neg (a->data);
f->data = double_int_ext (f->data, (!unsigned_p) + i_f_bits, unsigned_p);
if (unsigned_p) /* Unsigned type. */
{
if (f->data.low != 0 || f->data.high != 0)
{
if (sat_p)
{
f->data.low = 0;
f->data.high = 0;
}
else
overflow_p = true;
}
}
else /* Signed type. */
{
if (!(f->data.high == 0 && f->data.low == 0)
&& f->data.high == a->data.high && f->data.low == a->data.low )
{
if (sat_p)
{
/* Saturate to the maximum by subtracting f->data by one. */
f->data.low = -1;
f->data.high = -1;
f->data = double_int_ext (f->data, i_f_bits, 1);
}
else
overflow_p = true;
}
}
return overflow_p;
}
/* Perform the binary or unary operation described by CODE.
Note that OP0 and OP1 must have the same mode for binary operators.
For a unary operation, leave OP1 NULL.
Return true, if !SAT_P and overflow. */
bool
fixed_arithmetic (FIXED_VALUE_TYPE *f, int icode, const FIXED_VALUE_TYPE *op0,
const FIXED_VALUE_TYPE *op1, bool sat_p)
{
switch (icode)
{
case NEGATE_EXPR:
return do_fixed_neg (f, op0, sat_p);
break;
case PLUS_EXPR:
gcc_assert (op0->mode == op1->mode);
return do_fixed_add (f, op0, op1, false, sat_p);
break;
case MINUS_EXPR:
gcc_assert (op0->mode == op1->mode);
return do_fixed_add (f, op0, op1, true, sat_p);
break;
case MULT_EXPR:
gcc_assert (op0->mode == op1->mode);
return do_fixed_multiply (f, op0, op1, sat_p);
break;
case TRUNC_DIV_EXPR:
gcc_assert (op0->mode == op1->mode);
return do_fixed_divide (f, op0, op1, sat_p);
break;
case LSHIFT_EXPR:
return do_fixed_shift (f, op0, op1, true, sat_p);
break;
case RSHIFT_EXPR:
return do_fixed_shift (f, op0, op1, false, sat_p);
break;
default:
gcc_unreachable ();
}
return false;
}
/* Compare fixed-point values by tree_code.
Note that OP0 and OP1 must have the same mode. */
bool
fixed_compare (int icode, const FIXED_VALUE_TYPE *op0,
const FIXED_VALUE_TYPE *op1)
{
enum tree_code code = (enum tree_code) icode;
gcc_assert (op0->mode == op1->mode);
switch (code)
{
case NE_EXPR:
return !double_int_equal_p (op0->data, op1->data);
case EQ_EXPR:
return double_int_equal_p (op0->data, op1->data);
case LT_EXPR:
return double_int_cmp (op0->data, op1->data,
UNSIGNED_FIXED_POINT_MODE_P (op0->mode)) == -1;
case LE_EXPR:
return double_int_cmp (op0->data, op1->data,
UNSIGNED_FIXED_POINT_MODE_P (op0->mode)) != 1;
case GT_EXPR:
return double_int_cmp (op0->data, op1->data,
UNSIGNED_FIXED_POINT_MODE_P (op0->mode)) == 1;
case GE_EXPR:
return double_int_cmp (op0->data, op1->data,
UNSIGNED_FIXED_POINT_MODE_P (op0->mode)) != -1;
default:
gcc_unreachable ();
}
}
/* Extend or truncate to a new mode.
If SAT_P, saturate the result to the max or the min.
Return true, if !SAT_P and overflow. */
bool
fixed_convert (FIXED_VALUE_TYPE *f, enum machine_mode mode,
const FIXED_VALUE_TYPE *a, bool sat_p)
{
bool overflow_p = false;
if (mode == a->mode)
{
*f = *a;
return overflow_p;
}
if (GET_MODE_FBIT (mode) > GET_MODE_FBIT (a->mode))
{
/* Left shift a to temp_high, temp_low based on a->mode. */
double_int temp_high, temp_low;
int amount = GET_MODE_FBIT (mode) - GET_MODE_FBIT (a->mode);
lshift_double (a->data.low, a->data.high,
amount,
2 * HOST_BITS_PER_WIDE_INT,
&temp_low.low, &temp_low.high,
SIGNED_FIXED_POINT_MODE_P (a->mode));
/* Logical shift right to temp_high. */
lshift_double (a->data.low, a->data.high,
amount - 2 * HOST_BITS_PER_WIDE_INT,
2 * HOST_BITS_PER_WIDE_INT,
&temp_high.low, &temp_high.high, 0);
if (SIGNED_FIXED_POINT_MODE_P (a->mode)
&& a->data.high < 0) /* Signed-extend temp_high. */
temp_high = double_int_ext (temp_high, amount, 0);
f->mode = mode;
f->data = temp_low;
if (SIGNED_FIXED_POINT_MODE_P (a->mode) ==
SIGNED_FIXED_POINT_MODE_P (f->mode))
overflow_p = fixed_saturate2 (f->mode, temp_high, temp_low, &f->data,
sat_p);
else
{
/* Take care of the cases when converting between signed and
unsigned. */
if (SIGNED_FIXED_POINT_MODE_P (a->mode))
{
/* Signed -> Unsigned. */
if (a->data.high < 0)
{
if (sat_p)
{
f->data.low = 0; /* Set to zero. */
f->data.high = 0; /* Set to zero. */
}
else
overflow_p = true;
}
else
overflow_p = fixed_saturate2 (f->mode, temp_high, temp_low,
&f->data, sat_p);
}
else
{
/* Unsigned -> Signed. */
if (temp_high.high < 0)
{
if (sat_p)
{
/* Set to maximum. */
f->data.low = -1; /* Set to all ones. */
f->data.high = -1; /* Set to all ones. */
f->data = double_int_ext (f->data,
GET_MODE_FBIT (f->mode)
+ GET_MODE_IBIT (f->mode),
1); /* Clear the sign. */
}
else
overflow_p = true;
}
else
overflow_p = fixed_saturate2 (f->mode, temp_high, temp_low,
&f->data, sat_p);
}
}
}
else
{
/* Right shift a to temp based on a->mode. */
double_int temp;
lshift_double (a->data.low, a->data.high,
GET_MODE_FBIT (mode) - GET_MODE_FBIT (a->mode),
2 * HOST_BITS_PER_WIDE_INT,
&temp.low, &temp.high,
SIGNED_FIXED_POINT_MODE_P (a->mode));
f->mode = mode;
f->data = temp;
if (SIGNED_FIXED_POINT_MODE_P (a->mode) ==
SIGNED_FIXED_POINT_MODE_P (f->mode))
overflow_p = fixed_saturate1 (f->mode, f->data, &f->data, sat_p);
else
{
/* Take care of the cases when converting between signed and
unsigned. */
if (SIGNED_FIXED_POINT_MODE_P (a->mode))
{
/* Signed -> Unsigned. */
if (a->data.high < 0)
{
if (sat_p)
{
f->data.low = 0; /* Set to zero. */
f->data.high = 0; /* Set to zero. */
}
else
overflow_p = true;
}
else
overflow_p = fixed_saturate1 (f->mode, f->data, &f->data,
sat_p);
}
else
{
/* Unsigned -> Signed. */
if (temp.high < 0)
{
if (sat_p)
{
/* Set to maximum. */
f->data.low = -1; /* Set to all ones. */
f->data.high = -1; /* Set to all ones. */
f->data = double_int_ext (f->data,
GET_MODE_FBIT (f->mode)
+ GET_MODE_IBIT (f->mode),
1); /* Clear the sign. */
}
else
overflow_p = true;
}
else
overflow_p = fixed_saturate1 (f->mode, f->data, &f->data,
sat_p);
}
}
}
f->data = double_int_ext (f->data,
SIGNED_FIXED_POINT_MODE_P (f->mode)
+ GET_MODE_FBIT (f->mode)
+ GET_MODE_IBIT (f->mode),
UNSIGNED_FIXED_POINT_MODE_P (f->mode));
return overflow_p;
}
/* Convert to a new fixed-point mode from an integer.
If UNSIGNED_P, this integer is unsigned.
If SAT_P, saturate the result to the max or the min.
Return true, if !SAT_P and overflow. */
bool
fixed_convert_from_int (FIXED_VALUE_TYPE *f, enum machine_mode mode,
double_int a, bool unsigned_p, bool sat_p)
{
bool overflow_p = false;
/* Left shift a to temp_high, temp_low. */
double_int temp_high, temp_low;
int amount = GET_MODE_FBIT (mode);
if (amount == 2 * HOST_BITS_PER_WIDE_INT)
{
temp_high = a;
temp_low.low = 0;
temp_low.high = 0;
}
else
{
lshift_double (a.low, a.high,
amount,
2 * HOST_BITS_PER_WIDE_INT,
&temp_low.low, &temp_low.high, 0);
/* Logical shift right to temp_high. */
lshift_double (a.low, a.high,
amount - 2 * HOST_BITS_PER_WIDE_INT,
2 * HOST_BITS_PER_WIDE_INT,
&temp_high.low, &temp_high.high, 0);