aboutsummaryrefslogtreecommitdiff
path: root/soft-fp/op-common.h
blob: 1f58b89478d806f3ad76a835a037aa4b710434f5 (plain)
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
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
/* Software floating-point emulation. Common operations.
   Copyright (C) 1997,1998,1999,2006,2007 Free Software Foundation, Inc.
   This file is part of the GNU C Library.
   Contributed by Richard Henderson (rth@cygnus.com),
		  Jakub Jelinek (jj@ultra.linux.cz),
		  David S. Miller (davem@redhat.com) and
		  Peter Maydell (pmaydell@chiark.greenend.org.uk).

   The GNU C 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 2.1 of the License, or (at your option) any later version.

   In addition to the permissions in the GNU Lesser General Public
   License, the Free Software Foundation gives you unlimited
   permission to link the compiled version of this file into
   combinations with other programs, and to distribute those
   combinations without any restriction coming from the use of this
   file.  (The Lesser General Public License restrictions do apply in
   other respects; for example, they cover modification of the file,
   and distribution when not linked into a combine executable.)

   The GNU C 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 C Library; if not, write to the Free
   Software Foundation, 51 Franklin Street, Fifth Floor, Boston,
   MA 02110-1301, USA.  */

#define _FP_DECL(wc, X)						\
  _FP_I_TYPE X##_c __attribute__((unused)), X##_s, X##_e;	\
  _FP_FRAC_DECL_##wc(X)

/*
 * Finish truely unpacking a native fp value by classifying the kind
 * of fp value and normalizing both the exponent and the fraction.
 */

#define _FP_UNPACK_CANONICAL(fs, wc, X)					\
do {									\
  switch (X##_e)							\
  {									\
  default:								\
    _FP_FRAC_HIGH_RAW_##fs(X) |= _FP_IMPLBIT_##fs;			\
    _FP_FRAC_SLL_##wc(X, _FP_WORKBITS);					\
    X##_e -= _FP_EXPBIAS_##fs;						\
    X##_c = FP_CLS_NORMAL;						\
    break;								\
									\
  case 0:								\
    if (_FP_FRAC_ZEROP_##wc(X))						\
      X##_c = FP_CLS_ZERO;						\
    else								\
      {									\
	/* a denormalized number */					\
	_FP_I_TYPE _shift;						\
	_FP_FRAC_CLZ_##wc(_shift, X);					\
	_shift -= _FP_FRACXBITS_##fs;					\
	_FP_FRAC_SLL_##wc(X, (_shift+_FP_WORKBITS));			\
	X##_e -= _FP_EXPBIAS_##fs - 1 + _shift;				\
	X##_c = FP_CLS_NORMAL;						\
	FP_SET_EXCEPTION(FP_EX_DENORM);					\
      }									\
    break;								\
									\
  case _FP_EXPMAX_##fs:							\
    if (_FP_FRAC_ZEROP_##wc(X))						\
      X##_c = FP_CLS_INF;						\
    else								\
      {									\
	X##_c = FP_CLS_NAN;						\
	/* Check for signaling NaN */					\
	if (!(_FP_FRAC_HIGH_RAW_##fs(X) & _FP_QNANBIT_##fs))		\
	  FP_SET_EXCEPTION(FP_EX_INVALID);				\
      }									\
    break;								\
  }									\
} while (0)

/* Finish unpacking an fp value in semi-raw mode: the mantissa is
   shifted by _FP_WORKBITS but the implicit MSB is not inserted and
   other classification is not done.  */
#define _FP_UNPACK_SEMIRAW(fs, wc, X)	_FP_FRAC_SLL_##wc(X, _FP_WORKBITS)

/* A semi-raw value has overflowed to infinity.  Adjust the mantissa
   and exponent appropriately.  */
#define _FP_OVERFLOW_SEMIRAW(fs, wc, X)			\
do {							\
  if (FP_ROUNDMODE == FP_RND_NEAREST			\
      || (FP_ROUNDMODE == FP_RND_PINF && !X##_s)	\
      || (FP_ROUNDMODE == FP_RND_MINF && X##_s))	\
    {							\
      X##_e = _FP_EXPMAX_##fs;				\
      _FP_FRAC_SET_##wc(X, _FP_ZEROFRAC_##wc);		\
    }							\
  else							\
    {							\
      X##_e = _FP_EXPMAX_##fs - 1;			\
      _FP_FRAC_SET_##wc(X, _FP_MAXFRAC_##wc);		\
    }							\
    FP_SET_EXCEPTION(FP_EX_INEXACT);			\
    FP_SET_EXCEPTION(FP_EX_OVERFLOW);			\
} while (0)

/* Check for a semi-raw value being a signaling NaN and raise the
   invalid exception if so.  */
#define _FP_CHECK_SIGNAN_SEMIRAW(fs, wc, X)			\
do {								\
  if (X##_e == _FP_EXPMAX_##fs					\
      && !_FP_FRAC_ZEROP_##wc(X)				\
      && !(_FP_FRAC_HIGH_##fs(X) & _FP_QNANBIT_SH_##fs))	\
    FP_SET_EXCEPTION(FP_EX_INVALID);				\
} while (0)

/* Choose a NaN result from an operation on two semi-raw NaN
   values.  */
#define _FP_CHOOSENAN_SEMIRAW(fs, wc, R, X, Y, OP)			\
do {									\
  /* _FP_CHOOSENAN expects raw values, so shift as required.  */	\
  _FP_FRAC_SRL_##wc(X, _FP_WORKBITS);					\
  _FP_FRAC_SRL_##wc(Y, _FP_WORKBITS);					\
  _FP_CHOOSENAN(fs, wc, R, X, Y, OP);					\
  _FP_FRAC_SLL_##wc(R, _FP_WORKBITS);					\
} while (0)

/* Test whether a biased exponent is normal (not zero or maximum).  */
#define _FP_EXP_NORMAL(fs, wc, X)	(((X##_e + 1) & _FP_EXPMAX_##fs) > 1)

/* Prepare to pack an fp value in semi-raw mode: the mantissa is
   rounded and shifted right, with the rounding possibly increasing
   the exponent (including changing a finite value to infinity).  */
#define _FP_PACK_SEMIRAW(fs, wc, X)				\
do {								\
  _FP_ROUND(wc, X);						\
  if (_FP_FRAC_HIGH_##fs(X)					\
      & (_FP_OVERFLOW_##fs >> 1))				\
    {								\
      _FP_FRAC_HIGH_##fs(X) &= ~(_FP_OVERFLOW_##fs >> 1);	\
      X##_e++;							\
      if (X##_e == _FP_EXPMAX_##fs)				\
	_FP_OVERFLOW_SEMIRAW(fs, wc, X);			\
    }								\
  _FP_FRAC_SRL_##wc(X, _FP_WORKBITS);				\
  if (!_FP_EXP_NORMAL(fs, wc, X) && !_FP_FRAC_ZEROP_##wc(X))	\
    {								\
      if (X##_e == 0)						\
	FP_SET_EXCEPTION(FP_EX_UNDERFLOW);			\
      else							\
	{							\
	  if (!_FP_KEEPNANFRACP)				\
	    {							\
	      _FP_FRAC_SET_##wc(X, _FP_NANFRAC_##fs);		\
	      X##_s = _FP_NANSIGN_##fs;				\
	    }							\
	  else							\
	    _FP_FRAC_HIGH_RAW_##fs(X) |= _FP_QNANBIT_##fs;	\
	}							\
    }								\
} while (0)

/*
 * Before packing the bits back into the native fp result, take care
 * of such mundane things as rounding and overflow.  Also, for some
 * kinds of fp values, the original parts may not have been fully
 * extracted -- but that is ok, we can regenerate them now.
 */

#define _FP_PACK_CANONICAL(fs, wc, X)				\
do {								\
  switch (X##_c)						\
  {								\
  case FP_CLS_NORMAL:						\
    X##_e += _FP_EXPBIAS_##fs;					\
    if (X##_e > 0)						\
      {								\
	_FP_ROUND(wc, X);					\
	if (_FP_FRAC_OVERP_##wc(fs, X))				\
	  {							\
	    _FP_FRAC_CLEAR_OVERP_##wc(fs, X);			\
	    X##_e++;						\
	  }							\
	_FP_FRAC_SRL_##wc(X, _FP_WORKBITS);			\
	if (X##_e >= _FP_EXPMAX_##fs)				\
	  {							\
	    /* overflow */					\
	    switch (FP_ROUNDMODE)				\
	      {							\
	      case FP_RND_NEAREST:				\
		X##_c = FP_CLS_INF;				\
		break;						\
	      case FP_RND_PINF:					\
		if (!X##_s) X##_c = FP_CLS_INF;			\
		break;						\
	      case FP_RND_MINF:					\
		if (X##_s) X##_c = FP_CLS_INF;			\
		break;						\
	      }							\
	    if (X##_c == FP_CLS_INF)				\
	      {							\
		/* Overflow to infinity */			\
		X##_e = _FP_EXPMAX_##fs;			\
		_FP_FRAC_SET_##wc(X, _FP_ZEROFRAC_##wc);	\
	      }							\
	    else						\
	      {							\
		/* Overflow to maximum normal */		\
		X##_e = _FP_EXPMAX_##fs - 1;			\
		_FP_FRAC_SET_##wc(X, _FP_MAXFRAC_##wc);		\
	      }							\
	    FP_SET_EXCEPTION(FP_EX_OVERFLOW);			\
            FP_SET_EXCEPTION(FP_EX_INEXACT);			\
	  }							\
      }								\
    else							\
      {								\
	/* we've got a denormalized number */			\
	X##_e = -X##_e + 1;					\
	if (X##_e <= _FP_WFRACBITS_##fs)			\
	  {							\
	    _FP_FRAC_SRS_##wc(X, X##_e, _FP_WFRACBITS_##fs);	\
	    _FP_ROUND(wc, X);					\
	    if (_FP_FRAC_HIGH_##fs(X)				\
		& (_FP_OVERFLOW_##fs >> 1))			\
	      {							\
	        X##_e = 1;					\
	        _FP_FRAC_SET_##wc(X, _FP_ZEROFRAC_##wc);	\
	      }							\
	    else						\
	      {							\
		X##_e = 0;					\
		_FP_FRAC_SRL_##wc(X, _FP_WORKBITS);		\
		FP_SET_EXCEPTION(FP_EX_UNDERFLOW);		\
	      }							\
	  }							\
	else							\
	  {							\
	    /* underflow to zero */				\
	    X##_e = 0;						\
	    if (!_FP_FRAC_ZEROP_##wc(X))			\
	      {							\
	        _FP_FRAC_SET_##wc(X, _FP_MINFRAC_##wc);		\
	        _FP_ROUND(wc, X);				\
	        _FP_FRAC_LOW_##wc(X) >>= (_FP_WORKBITS);	\
	      }							\
	    FP_SET_EXCEPTION(FP_EX_UNDERFLOW);			\
	  }							\
      }								\
    break;							\
								\
  case FP_CLS_ZERO:						\
    X##_e = 0;							\
    _FP_FRAC_SET_##wc(X, _FP_ZEROFRAC_##wc);			\
    break;							\
								\
  case FP_CLS_INF:						\
    X##_e = _FP_EXPMAX_##fs;					\
    _FP_FRAC_SET_##wc(X, _FP_ZEROFRAC_##wc);			\
    break;							\
								\
  case FP_CLS_NAN:						\
    X##_e = _FP_EXPMAX_##fs;					\
    if (!_FP_KEEPNANFRACP)					\
      {								\
	_FP_FRAC_SET_##wc(X, _FP_NANFRAC_##fs);			\
	X##_s = _FP_NANSIGN_##fs;				\
      }								\
    else							\
      _FP_FRAC_HIGH_RAW_##fs(X) |= _FP_QNANBIT_##fs;		\
    break;							\
  }								\
} while (0)

/* This one accepts raw argument and not cooked,  returns
 * 1 if X is a signaling NaN.
 */
#define _FP_ISSIGNAN(fs, wc, X)					\
({								\
  int __ret = 0;						\
  if (X##_e == _FP_EXPMAX_##fs)					\
    {								\
      if (!_FP_FRAC_ZEROP_##wc(X)				\
	  && !(_FP_FRAC_HIGH_RAW_##fs(X) & _FP_QNANBIT_##fs))	\
	__ret = 1;						\
    }								\
  __ret;							\
})





/* Addition on semi-raw values.  */
#define _FP_ADD_INTERNAL(fs, wc, R, X, Y, OP)				 \
do {									 \
  if (X##_s == Y##_s)							 \
    {									 \
      /* Addition.  */							 \
      R##_s = X##_s;							 \
      int ediff = X##_e - Y##_e;					 \
      if (ediff > 0)							 \
	{								 \
	  R##_e = X##_e;						 \
	  if (Y##_e == 0)						 \
	    {								 \
	      /* Y is zero or denormalized.  */				 \
	      if (_FP_FRAC_ZEROP_##wc(Y))				 \
		{							 \
		  _FP_CHECK_SIGNAN_SEMIRAW(fs, wc, X);			 \
		  _FP_FRAC_COPY_##wc(R, X);				 \
		  goto add_done;					 \
		}							 \
	      else							 \
		{							 \
		  FP_SET_EXCEPTION(FP_EX_DENORM);			 \
		  ediff--;						 \
		  if (ediff == 0)					 \
		    {							 \
		      _FP_FRAC_ADD_##wc(R, X, Y);			 \
		      goto add3;					 \
		    }							 \
		  if (X##_e == _FP_EXPMAX_##fs)				 \
		    {							 \
		      _FP_CHECK_SIGNAN_SEMIRAW(fs, wc, X);		 \
		      _FP_FRAC_COPY_##wc(R, X);				 \
		      goto add_done;					 \
		    }							 \
		  goto add1;						 \
		}							 \
	    }								 \
	  else if (X##_e == _FP_EXPMAX_##fs)				 \
	    {								 \
	      /* X is NaN or Inf, Y is normal.  */			 \
	      _FP_CHECK_SIGNAN_SEMIRAW(fs, wc, X);			 \
	      _FP_FRAC_COPY_##wc(R, X);					 \
	      goto add_done;						 \
	    }								 \
									 \
	  /* Insert implicit MSB of Y.  */				 \
	  _FP_FRAC_HIGH_##fs(Y) |= _FP_IMPLBIT_SH_##fs;			 \
									 \
	add1:								 \
	  /* Shift the mantissa of Y to the right EDIFF steps;		 \
	     remember to account later for the implicit MSB of X.  */	 \
	  if (ediff <= _FP_WFRACBITS_##fs)				 \
	    _FP_FRAC_SRS_##wc(Y, ediff, _FP_WFRACBITS_##fs);		 \
	  else if (!_FP_FRAC_ZEROP_##wc(Y))				 \
	    _FP_FRAC_SET_##wc(Y, _FP_MINFRAC_##wc);			 \
	  _FP_FRAC_ADD_##wc(R, X, Y);					 \
	}								 \
      else if (ediff < 0)						 \
	{								 \
	  ediff = -ediff;						 \
	  R##_e = Y##_e;						 \
	  if (X##_e == 0)						 \
	    {								 \
	      /* X is zero or denormalized.  */				 \
	      if (_FP_FRAC_ZEROP_##wc(X))				 \
		{							 \
		  _FP_CHECK_SIGNAN_SEMIRAW(fs, wc, Y);			 \
		  _FP_FRAC_COPY_##wc(R, Y);				 \
		  goto add_done;					 \
		}							 \
	      else							 \
		{							 \
		  FP_SET_EXCEPTION(FP_EX_DENORM);			 \
		  ediff--;						 \
		  if (ediff == 0)					 \
		    {							 \
		      _FP_FRAC_ADD_##wc(R, Y, X);			 \
		      goto add3;					 \
		    }							 \
		  if (Y##_e == _FP_EXPMAX_##fs)				 \
		    {							 \
		      _FP_CHECK_SIGNAN_SEMIRAW(fs, wc, Y);		 \
		      _FP_FRAC_COPY_##wc(R, Y);				 \
		      goto add_done;					 \
		    }							 \
		  goto add2;						 \
		}							 \
	    }								 \
	  else if (Y##_e == _FP_EXPMAX_##fs)				 \
	    {								 \
	      /* Y is NaN or Inf, X is normal.  */			 \
	      _FP_CHECK_SIGNAN_SEMIRAW(fs, wc, Y);			 \
	      _FP_FRAC_COPY_##wc(R, Y);					 \
	      goto add_done;						 \
	    }								 \
									 \
	  /* Insert implicit MSB of X.  */				 \
	  _FP_FRAC_HIGH_##fs(X) |= _FP_IMPLBIT_SH_##fs;			 \
									 \
	add2:								 \
	  /* Shift the mantissa of X to the right EDIFF steps;		 \
	     remember to account later for the implicit MSB of Y.  */	 \
	  if (ediff <= _FP_WFRACBITS_##fs)				 \
	    _FP_FRAC_SRS_##wc(X, ediff, _FP_WFRACBITS_##fs);		 \
	  else if (!_FP_FRAC_ZEROP_##wc(X))				 \
	    _FP_FRAC_SET_##wc(X, _FP_MINFRAC_##wc);			 \
	  _FP_FRAC_ADD_##wc(R, Y, X);					 \
	}								 \
      else								 \
	{								 \
	  /* ediff == 0.  */						 \
	  if (!_FP_EXP_NORMAL(fs, wc, X))				 \
	    {								 \
	      if (X##_e == 0)						 \
		{							 \
		  /* X and Y are zero or denormalized.  */		 \
		  R##_e = 0;						 \
		  if (_FP_FRAC_ZEROP_##wc(X))				 \
		    {							 \
		      if (!_FP_FRAC_ZEROP_##wc(Y))			 \
			FP_SET_EXCEPTION(FP_EX_DENORM);			 \
		      _FP_FRAC_COPY_##wc(R, Y);				 \
		      goto add_done;					 \
		    }							 \
		  else if (_FP_FRAC_ZEROP_##wc(Y))			 \
		    {							 \
		      FP_SET_EXCEPTION(FP_EX_DENORM);			 \
		      _FP_FRAC_COPY_##wc(R, X);				 \
		      goto add_done;					 \
		    }							 \
		  else							 \
		    {							 \
		      FP_SET_EXCEPTION(FP_EX_DENORM);			 \
		      _FP_FRAC_ADD_##wc(R, X, Y);			 \
		      if (_FP_FRAC_HIGH_##fs(R) & _FP_IMPLBIT_SH_##fs)	 \
			{						 \
			  /* Normalized result.  */			 \
			  _FP_FRAC_HIGH_##fs(R)				 \
			    &= ~(_FP_W_TYPE)_FP_IMPLBIT_SH_##fs;	 \
			  R##_e = 1;					 \
			}						 \
		      goto add_done;					 \
		    }							 \
		}							 \
	      else							 \
		{							 \
		  /* X and Y are NaN or Inf.  */			 \
		  _FP_CHECK_SIGNAN_SEMIRAW(fs, wc, X);			 \
		  _FP_CHECK_SIGNAN_SEMIRAW(fs, wc, Y);			 \
		  R##_e = _FP_EXPMAX_##fs;				 \
		  if (_FP_FRAC_ZEROP_##wc(X))				 \
		    _FP_FRAC_COPY_##wc(R, Y);				 \
		  else if (_FP_FRAC_ZEROP_##wc(Y))			 \
		    _FP_FRAC_COPY_##wc(R, X);				 \
		  else							 \
		    _FP_CHOOSENAN_SEMIRAW(fs, wc, R, X, Y, OP);		 \
		  goto add_done;					 \
		}							 \
	    }								 \
	  /* The exponents of X and Y, both normal, are equal.  The	 \
	     implicit MSBs will always add to increase the		 \
	     exponent.  */						 \
	  _FP_FRAC_ADD_##wc(R, X, Y);					 \
	  R##_e = X##_e + 1;						 \
	  _FP_FRAC_SRS_##wc(R, 1, _FP_WFRACBITS_##fs);			 \
	  if (R##_e == _FP_EXPMAX_##fs)					 \
	    /* Overflow to infinity (depending on rounding mode).  */	 \
	    _FP_OVERFLOW_SEMIRAW(fs, wc, R);				 \
	  goto add_done;						 \
	}								 \
    add3:								 \
      if (_FP_FRAC_HIGH_##fs(R) & _FP_IMPLBIT_SH_##fs)			 \
	{								 \
	  /* Overflow.  */						 \
	  _FP_FRAC_HIGH_##fs(R) &= ~(_FP_W_TYPE)_FP_IMPLBIT_SH_##fs;	 \
	  R##_e++;							 \
	  _FP_FRAC_SRS_##wc(R, 1, _FP_WFRACBITS_##fs);			 \
	  if (R##_e == _FP_EXPMAX_##fs)					 \
	    /* Overflow to infinity (depending on rounding mode).  */	 \
	    _FP_OVERFLOW_SEMIRAW(fs, wc, R);				 \
	}								 \
    add_done: ;								 \
    }									 \
  else									 \
    {									 \
      /* Subtraction.  */						 \
      int ediff = X##_e - Y##_e;					 \
      if (ediff > 0)							 \
	{								 \
	  R##_e = X##_e;						 \
	  R##_s = X##_s;						 \
	  if (Y##_e == 0)						 \
	    {								 \
	      /* Y is zero or denormalized.  */				 \
	      if (_FP_FRAC_ZEROP_##wc(Y))				 \
		{							 \
		  _FP_CHECK_SIGNAN_SEMIRAW(fs, wc, X);			 \
		  _FP_FRAC_COPY_##wc(R, X);				 \
		  goto sub_done;					 \
		}							 \
	      else							 \
		{							 \
		  FP_SET_EXCEPTION(FP_EX_DENORM);			 \
		  ediff--;						 \
		  if (ediff == 0)					 \
		    {							 \
		      _FP_FRAC_SUB_##wc(R, X, Y);			 \
		      goto sub3;					 \
		    }							 \
		  if (X##_e == _FP_EXPMAX_##fs)				 \
		    {							 \
		      _FP_CHECK_SIGNAN_SEMIRAW(fs, wc, X);		 \
		      _FP_FRAC_COPY_##wc(R, X);				 \
		      goto sub_done;					 \
		    }							 \
		  goto sub1;						 \
		}							 \
	    }								 \
	  else if (X##_e == _FP_EXPMAX_##fs)				 \
	    {								 \
	      /* X is NaN or Inf, Y is normal.  */			 \
	      _FP_CHECK_SIGNAN_SEMIRAW(fs, wc, X);			 \
	      _FP_FRAC_COPY_##wc(R, X);					 \
	      goto sub_done;						 \
	    }								 \
									 \
	  /* Insert implicit MSB of Y.  */				 \
	  _FP_FRAC_HIGH_##fs(Y) |= _FP_IMPLBIT_SH_##fs;			 \
									 \
	sub1:								 \
	  /* Shift the mantissa of Y to the right EDIFF steps;		 \
	     remember to account later for the implicit MSB of X.  */	 \
	  if (ediff <= _FP_WFRACBITS_##fs)				 \
	    _FP_FRAC_SRS_##wc(Y, ediff, _FP_WFRACBITS_##fs);		 \
	  else if (!_FP_FRAC_ZEROP_##wc(Y))				 \
	    _FP_FRAC_SET_##wc(Y, _FP_MINFRAC_##wc);			 \
	  _FP_FRAC_SUB_##wc(R, X, Y);					 \
	}								 \
      else if (ediff < 0)						 \
	{								 \
	  ediff = -ediff;						 \
	  R##_e = Y##_e;						 \
	  R##_s = Y##_s;						 \
	  if (X##_e == 0)						 \
	    {								 \
	      /* X is zero or denormalized.  */				 \
	      if (_FP_FRAC_ZEROP_##wc(X))				 \
		{							 \
		  _FP_CHECK_SIGNAN_SEMIRAW(fs, wc, Y);			 \
		  _FP_FRAC_COPY_##wc(R, Y);				 \
		  goto sub_done;					 \
		}							 \
	      else							 \
		{							 \
		  FP_SET_EXCEPTION(FP_EX_DENORM);			 \
		  ediff--;						 \
		  if (ediff == 0)					 \
		    {							 \
		      _FP_FRAC_SUB_##wc(R, Y, X);			 \
		      goto sub3;					 \
		    }							 \
		  if (Y##_e == _FP_EXPMAX_##fs)				 \
		    {							 \
		      _FP_CHECK_SIGNAN_SEMIRAW(fs, wc, Y);		 \
		      _FP_FRAC_COPY_##wc(R, Y);				 \
		      goto sub_done;					 \
		    }							 \
		  goto sub2;						 \
		}							 \
	    }								 \
	  else if (Y##_e == _FP_EXPMAX_##fs)				 \
	    {								 \
	      /* Y is NaN or Inf, X is normal.  */			 \
	      _FP_CHECK_SIGNAN_SEMIRAW(fs, wc, Y);			 \
	      _FP_FRAC_COPY_##wc(R, Y);					 \
	      goto sub_done;						 \
	    }								 \
									 \
	  /* Insert implicit MSB of X.  */				 \
	  _FP_FRAC_HIGH_##fs(X) |= _FP_IMPLBIT_SH_##fs;			 \
									 \
	sub2:								 \
	  /* Shift the mantissa of X to the right EDIFF steps;		 \
	     remember to account later for the implicit MSB of Y.  */	 \
	  if (ediff <= _FP_WFRACBITS_##fs)				 \
	    _FP_FRAC_SRS_##wc(X, ediff, _FP_WFRACBITS_##fs);		 \
	  else if (!_FP_FRAC_ZEROP_##wc(X))				 \
	    _FP_FRAC_SET_##wc(X, _FP_MINFRAC_##wc);			 \
	  _FP_FRAC_SUB_##wc(R, Y, X);					 \
	}								 \
      else								 \
	{								 \
	  /* ediff == 0.  */						 \
	  if (!_FP_EXP_NORMAL(fs, wc, X))				 \
	    {								 \
	      if (X##_e == 0)						 \
		{							 \
		  /* X and Y are zero or denormalized.  */		 \
		  R##_e = 0;						 \
		  if (_FP_FRAC_ZEROP_##wc(X))				 \
		    {							 \
		      _FP_FRAC_COPY_##wc(R, Y);				 \
		      if (_FP_FRAC_ZEROP_##wc(Y))			 \
			R##_s = (FP_ROUNDMODE == FP_RND_MINF);		 \
		      else						 \
			{						 \
			  FP_SET_EXCEPTION(FP_EX_DENORM);		 \
			  R##_s = Y##_s;				 \
			}						 \
		      goto sub_done;					 \
		    }							 \
		  else if (_FP_FRAC_ZEROP_##wc(Y))			 \
		    {							 \
		      FP_SET_EXCEPTION(FP_EX_DENORM);			 \
		      _FP_FRAC_COPY_##wc(R, X);				 \
		      R##_s = X##_s;					 \
		      goto sub_done;					 \
		    }							 \
		  else							 \
		    {							 \
		      FP_SET_EXCEPTION(FP_EX_DENORM);			 \
		      _FP_FRAC_SUB_##wc(R, X, Y);			 \
		      R##_s = X##_s;					 \
		      if (_FP_FRAC_HIGH_##fs(R) & _FP_IMPLBIT_SH_##fs)	 \
			{						 \
			  /* |X| < |Y|, negate result.  */		 \
			  _FP_FRAC_SUB_##wc(R, Y, X);			 \
			  R##_s = Y##_s;				 \
			}						 \
		      else if (_FP_FRAC_ZEROP_##wc(R))			 \
			R##_s = (FP_ROUNDMODE == FP_RND_MINF);		 \
		      goto sub_done;					 \
		    }							 \
		}							 \
	      else							 \
		{							 \
		  /* X and Y are NaN or Inf, of opposite signs.  */	 \
		  _FP_CHECK_SIGNAN_SEMIRAW(fs, wc, X);			 \
		  _FP_CHECK_SIGNAN_SEMIRAW(fs, wc, Y);			 \
		  R##_e = _FP_EXPMAX_##fs;				 \
		  if (_FP_FRAC_ZEROP_##wc(X))				 \
		    {							 \
		      if (_FP_FRAC_ZEROP_##wc(Y))			 \
			{						 \
			  /* Inf - Inf.  */				 \
			  R##_s = _FP_NANSIGN_##fs;			 \
			  _FP_FRAC_SET_##wc(R, _FP_NANFRAC_##fs);	 \
			  _FP_FRAC_SLL_##wc(R, _FP_WORKBITS);		 \
			  FP_SET_EXCEPTION(FP_EX_INVALID);		 \
			}						 \
		      else						 \
			{						 \
			  /* Inf - NaN.  */				 \
			  R##_s = Y##_s;				 \
			  _FP_FRAC_COPY_##wc(R, Y);			 \
			}						 \
		    }							 \
		  else							 \
		    {							 \
		      if (_FP_FRAC_ZEROP_##wc(Y))			 \
			{						 \
			  /* NaN - Inf.  */				 \
			  R##_s = X##_s;				 \
			  _FP_FRAC_COPY_##wc(R, X);			 \
			}						 \
		      else						 \
			{						 \
			  /* NaN - NaN.  */				 \
			  _FP_CHOOSENAN_SEMIRAW(fs, wc, R, X, Y, OP);	 \
			}						 \
		    }							 \
		  goto sub_done;					 \
		}							 \
	    }								 \
	  /* The exponents of X and Y, both normal, are equal.  The	 \
	     implicit MSBs cancel.  */					 \
	  R##_e = X##_e;						 \
	  _FP_FRAC_SUB_##wc(R, X, Y);					 \
	  R##_s = X##_s;						 \
	  if (_FP_FRAC_HIGH_##fs(R) & _FP_IMPLBIT_SH_##fs)		 \
	    {								 \
	      /* |X| < |Y|, negate result.  */				 \
	      _FP_FRAC_SUB_##wc(R, Y, X);				 \
	      R##_s = Y##_s;						 \
	    }								 \
	  else if (_FP_FRAC_ZEROP_##wc(R))				 \
	    {								 \
	      R##_e = 0;						 \
	      R##_s = (FP_ROUNDMODE == FP_RND_MINF);			 \
	      goto sub_done;						 \
	    }								 \
	  goto norm;							 \
	}								 \
    sub3:								 \
      if (_FP_FRAC_HIGH_##fs(R) & _FP_IMPLBIT_SH_##fs)			 \
	{								 \
	  int diff;							 \
	  /* Carry into most significant bit of larger one of X and Y,	 \
	     canceling it; renormalize.  */				 \
	  _FP_FRAC_HIGH_##fs(R) &= _FP_IMPLBIT_SH_##fs - 1;		 \
	norm:								 \
	  _FP_FRAC_CLZ_##wc(diff, R);					 \
	  diff -= _FP_WFRACXBITS_##fs;					 \
	  _FP_FRAC_SLL_##wc(R, diff);					 \
	  if (R##_e <= diff)						 \
	    {								 \
	      /* R is denormalized.  */					 \
	      diff = diff - R##_e + 1;					 \
	      _FP_FRAC_SRS_##wc(R, diff, _FP_WFRACBITS_##fs);		 \
	      R##_e = 0;						 \
	    }								 \
	  else								 \
	    {								 \
	      R##_e -= diff;						 \
	      _FP_FRAC_HIGH_##fs(R) &= ~(_FP_W_TYPE)_FP_IMPLBIT_SH_##fs; \
	    }								 \
	}								 \
    sub_done: ;								 \
    }									 \
} while (0)

#define _FP_ADD(fs, wc, R, X, Y) _FP_ADD_INTERNAL(fs, wc, R, X, Y, '+')
#define _FP_SUB(fs, wc, R, X, Y)					    \
  do {									    \
    if (!(Y##_e == _FP_EXPMAX_##fs && !_FP_FRAC_ZEROP_##wc(Y))) Y##_s ^= 1; \
    _FP_ADD_INTERNAL(fs, wc, R, X, Y, '-');				    \
  } while (0)


/*
 * Main negation routine.  FIXME -- when we care about setting exception
 * bits reliably, this will not do.  We should examine all of the fp classes.
 */

#define _FP_NEG(fs, wc, R, X)		\
  do {					\
    _FP_FRAC_COPY_##wc(R, X);		\
    R##_c = X##_c;			\
    R##_e = X##_e;			\
    R##_s = 1 ^ X##_s;			\
  } while (0)


/*
 * Main multiplication routine.  The input values should be cooked.
 */

#define _FP_MUL(fs, wc, R, X, Y)			\
do {							\
  R##_s = X##_s ^ Y##_s;				\
  switch (_FP_CLS_COMBINE(X##_c, Y##_c))		\
  {							\
  case _FP_CLS_COMBINE(FP_CLS_NORMAL,FP_CLS_NORMAL):	\
    R##_c = FP_CLS_NORMAL;				\
    R##_e = X##_e + Y##_e + 1;				\
							\
    _FP_MUL_MEAT_##fs(R,X,Y);				\
							\
    if (_FP_FRAC_OVERP_##wc(fs, R))			\
      _FP_FRAC_SRS_##wc(R, 1, _FP_WFRACBITS_##fs);	\
    else						\
      R##_e--;						\
    break;						\
							\
  case _FP_CLS_COMBINE(FP_CLS_NAN,FP_CLS_NAN):		\
    _FP_CHOOSENAN(fs, wc, R, X, Y, '*');		\
    break;						\
							\
  case _FP_CLS_COMBINE(FP_CLS_NAN,FP_CLS_NORMAL):	\
  case _FP_CLS_COMBINE(FP_CLS_NAN,FP_CLS_INF):		\
  case _FP_CLS_COMBINE(FP_CLS_NAN,FP_CLS_ZERO):		\
    R##_s = X##_s;					\
							\
  case _FP_CLS_COMBINE(FP_CLS_INF,FP_CLS_INF):		\
  case _FP_CLS_COMBINE(FP_CLS_INF,FP_CLS_NORMAL):	\
  case _FP_CLS_COMBINE(FP_CLS_ZERO,FP_CLS_NORMAL):	\
  case _FP_CLS_COMBINE(FP_CLS_ZERO,FP_CLS_ZERO):	\
    _FP_FRAC_COPY_##wc(R, X);				\
    R##_c = X##_c;					\
    break;						\
							\
  case _FP_CLS_COMBINE(FP_CLS_NORMAL,FP_CLS_NAN):	\
  case _FP_CLS_COMBINE(FP_CLS_INF,FP_CLS_NAN):		\
  case _FP_CLS_COMBINE(FP_CLS_ZERO,FP_CLS_NAN):		\
    R##_s = Y##_s;					\
							\
  case _FP_CLS_COMBINE(FP_CLS_NORMAL,FP_CLS_INF):	\
  case _FP_CLS_COMBINE(FP_CLS_NORMAL,FP_CLS_ZERO):	\
    _FP_FRAC_COPY_##wc(R, Y);				\
    R##_c = Y##_c;					\
    break;						\
							\
  case _FP_CLS_COMBINE(FP_CLS_INF,FP_CLS_ZERO):		\
  case _FP_CLS_COMBINE(FP_CLS_ZERO,FP_CLS_INF):		\
    R##_s = _FP_NANSIGN_##fs;				\
    R##_c = FP_CLS_NAN;					\
    _FP_FRAC_SET_##wc(R, _FP_NANFRAC_##fs);		\
    FP_SET_EXCEPTION(FP_EX_INVALID);			\
    break;						\
							\
  default:						\
    abort();						\
  }							\
} while (0)


/*
 * Main division routine.  The input values should be cooked.
 */

#define _FP_DIV(fs, wc, R, X, Y)			\
do {							\
  R##_s = X##_s ^ Y##_s;				\
  switch (_FP_CLS_COMBINE(X##_c, Y##_c))		\
  {							\
  case _FP_CLS_COMBINE(FP_CLS_NORMAL,FP_CLS_NORMAL):	\
    R##_c = FP_CLS_NORMAL;				\
    R##_e = X##_e - Y##_e;				\
							\
    _FP_DIV_MEAT_##fs(R,X,Y);				\
    break;						\
							\
  case _FP_CLS_COMBINE(FP_CLS_NAN,FP_CLS_NAN):		\
    _FP_CHOOSENAN(fs, wc, R, X, Y, '/');		\
    break;						\
							\
  case _FP_CLS_COMBINE(FP_CLS_NAN,FP_CLS_NORMAL):	\
  case _FP_CLS_COMBINE(FP_CLS_NAN,FP_CLS_INF):		\
  case _FP_CLS_COMBINE(FP_CLS_NAN,FP_CLS_ZERO):		\
    R##_s = X##_s;					\
    _FP_FRAC_COPY_##wc(R, X);				\
    R##_c = X##_c;					\
    break;						\
							\
  case _FP_CLS_COMBINE(FP_CLS_NORMAL,FP_CLS_NAN):	\
  case _FP_CLS_COMBINE(FP_CLS_INF,FP_CLS_NAN):		\
  case _FP_CLS_COMBINE(FP_CLS_ZERO,FP_CLS_NAN):		\
    R##_s = Y##_s;					\
    _FP_FRAC_COPY_##wc(R, Y);				\
    R##_c = Y##_c;					\
    break;						\
							\
  case _FP_CLS_COMBINE(FP_CLS_NORMAL,FP_CLS_INF):	\
  case _FP_CLS_COMBINE(FP_CLS_ZERO,FP_CLS_INF):		\
  case _FP_CLS_COMBINE(FP_CLS_ZERO,FP_CLS_NORMAL):	\
    R##_c = FP_CLS_ZERO;				\
    break;						\
							\
  case _FP_CLS_COMBINE(FP_CLS_NORMAL,FP_CLS_ZERO):	\
    FP_SET_EXCEPTION(FP_EX_DIVZERO);			\
  case _FP_CLS_COMBINE(FP_CLS_INF,FP_CLS_ZERO):		\
  case _FP_CLS_COMBINE(FP_CLS_INF,FP_CLS_NORMAL):	\
    R##_c = FP_CLS_INF;					\
    break;						\
							\
  case _FP_CLS_COMBINE(FP_CLS_INF,FP_CLS_INF):		\
  case _FP_CLS_COMBINE(FP_CLS_ZERO,FP_CLS_ZERO):	\
    R##_s = _FP_NANSIGN_##fs;				\
    R##_c = FP_CLS_NAN;					\
    _FP_FRAC_SET_##wc(R, _FP_NANFRAC_##fs);		\
    FP_SET_EXCEPTION(FP_EX_INVALID);			\
    break;						\
							\
  default:						\
    abort();						\
  }							\
} while (0)


/*
 * Main differential comparison routine.  The inputs should be raw not
 * cooked.  The return is -1,0,1 for normal values, 2 otherwise.
 */

#define _FP_CMP(fs, wc, ret, X, Y, un)					\
  do {									\
    /* NANs are unordered */						\
    if ((X##_e == _FP_EXPMAX_##fs && !_FP_FRAC_ZEROP_##wc(X))		\
	|| (Y##_e == _FP_EXPMAX_##fs && !_FP_FRAC_ZEROP_##wc(Y)))	\
      {									\
	ret = un;							\
      }									\
    else								\
      {									\
	int __is_zero_x;						\
	int __is_zero_y;						\
									\
	__is_zero_x = (!X##_e && _FP_FRAC_ZEROP_##wc(X)) ? 1 : 0;	\
	__is_zero_y = (!Y##_e && _FP_FRAC_ZEROP_##wc(Y)) ? 1 : 0;	\
									\
	if (__is_zero_x && __is_zero_y)					\
		ret = 0;						\
	else if (__is_zero_x)						\
		ret = Y##_s ? 1 : -1;					\
	else if (__is_zero_y)						\
		ret = X##_s ? -1 : 1;					\
	else if (X##_s != Y##_s)					\
	  ret = X##_s ? -1 : 1;						\
	else if (X##_e > Y##_e)						\
	  ret = X##_s ? -1 : 1;						\
	else if (X##_e < Y##_e)						\
	  ret = X##_s ? 1 : -1;						\
	else if (_FP_FRAC_GT_##wc(X, Y))				\
	  ret = X##_s ? -1 : 1;						\
	else if (_FP_FRAC_GT_##wc(Y, X))				\
	  ret = X##_s ? 1 : -1;						\
	else								\
	  ret = 0;							\
      }									\
  } while (0)


/* Simplification for strict equality.  */

#define _FP_CMP_EQ(fs, wc, ret, X, Y)					    \
  do {									    \
    /* NANs are unordered */						    \
    if ((X##_e == _FP_EXPMAX_##fs && !_FP_FRAC_ZEROP_##wc(X))		    \
	|| (Y##_e == _FP_EXPMAX_##fs && !_FP_FRAC_ZEROP_##wc(Y)))	    \
      {									    \
	ret = 1;							    \
      }									    \
    else								    \
      {									    \
	ret = !(X##_e == Y##_e						    \
		&& _FP_FRAC_EQ_##wc(X, Y)				    \
		&& (X##_s == Y##_s || (!X##_e && _FP_FRAC_ZEROP_##wc(X)))); \
      }									    \
  } while (0)

/* Version to test unordered.  */

#define _FP_CMP_UNORD(fs, wc, ret, X, Y)				\
  do {									\
    ret = ((X##_e == _FP_EXPMAX_##fs && !_FP_FRAC_ZEROP_##wc(X))	\
	   || (Y##_e == _FP_EXPMAX_##fs && !_FP_FRAC_ZEROP_##wc(Y)));	\
  } while (0)

/*
 * Main square root routine.  The input value should be cooked.
 */

#define _FP_SQRT(fs, wc, R, X)						\
do {									\
    _FP_FRAC_DECL_##wc(T); _FP_FRAC_DECL_##wc(S);			\
    _FP_W_TYPE q;							\
    switch (X##_c)							\
    {									\
    case FP_CLS_NAN:							\
	_FP_FRAC_COPY_##wc(R, X);					\
	R##_s = X##_s;							\
    	R##_c = FP_CLS_NAN;						\
    	break;								\
    case FP_CLS_INF:							\
    	if (X##_s)							\
    	  {								\
    	    R##_s = _FP_NANSIGN_##fs;					\
	    R##_c = FP_CLS_NAN; /* NAN */				\
	    _FP_FRAC_SET_##wc(R, _FP_NANFRAC_##fs);			\
	    FP_SET_EXCEPTION(FP_EX_INVALID);				\
    	  }								\
    	else								\
    	  {								\
    	    R##_s = 0;							\
    	    R##_c = FP_CLS_INF; /* sqrt(+inf) = +inf */			\
    	  }								\
    	break;								\
    case FP_CLS_ZERO:							\
	R##_s = X##_s;							\
	R##_c = FP_CLS_ZERO; /* sqrt(+-0) = +-0 */			\
	break;								\
    case FP_CLS_NORMAL:							\
    	R##_s = 0;							\
        if (X##_s)							\
          {								\
	    R##_c = FP_CLS_NAN; /* sNAN */				\
	    R##_s = _FP_NANSIGN_##fs;					\
	    _FP_FRAC_SET_##wc(R, _FP_NANFRAC_##fs);			\
	    FP_SET_EXCEPTION(FP_EX_INVALID);				\
	    break;							\
          }								\
    	R##_c = FP_CLS_NORMAL;						\
        if (X##_e & 1)							\
          _FP_FRAC_SLL_##wc(X, 1);					\
        R##_e = X##_e >> 1;						\
        _FP_FRAC_SET_##wc(S, _FP_ZEROFRAC_##wc);			\
        _FP_FRAC_SET_##wc(R, _FP_ZEROFRAC_##wc);			\
        q = _FP_OVERFLOW_##fs >> 1;					\
        _FP_SQRT_MEAT_##wc(R, S, T, X, q);				\
    }									\
  } while (0)

/*
 * Convert from FP to integer.  Input is raw.
 */

/* RSIGNED can have following values:
 * 0:  the number is required to be 0..(2^rsize)-1, if not, NV is set plus
 *     the result is either 0 or (2^rsize)-1 depending on the sign in such
 *     case.
 * 1:  the number is required to be -(2^(rsize-1))..(2^(rsize-1))-1, if not,
 *     NV is set plus the result is either -(2^(rsize-1)) or (2^(rsize-1))-1
 *     depending on the sign in such case.
 * -1: the number is required to be -(2^(rsize-1))..(2^rsize)-1, if not, NV is
 *     set plus the result is either -(2^(rsize-1)) or (2^(rsize-1))-1
 *     depending on the sign in such case.
 */
#define _FP_TO_INT(fs, wc, r, X, rsize, rsigned)			\
do {									\
  if (X##_e < _FP_EXPBIAS_##fs)						\
    {									\
      r = 0;								\
      if (X##_e == 0)							\
	{								\
	  if (!_FP_FRAC_ZEROP_##wc(X))					\
	    {								\
	      FP_SET_EXCEPTION(FP_EX_INEXACT);				\
	      FP_SET_EXCEPTION(FP_EX_DENORM);				\
	    }								\
	}								\
      else								\
	FP_SET_EXCEPTION(FP_EX_INEXACT);				\
    }									\
  else if (X##_e >= _FP_EXPBIAS_##fs + rsize - (rsigned > 0 || X##_s)	\
	   || (!rsigned && X##_s))					\
    {									\
      /* Overflow or converting to the most negative integer.  */	\
      if (rsigned)							\
	{								\
	  r = 1;							\
	  r <<= rsize - 1;						\
	  r -= 1 - X##_s;						\
	} else {							\
	  r = 0;							\
	  if (X##_s)							\
	    r = ~r;							\
	}								\
									\
      if (rsigned && X##_s && X##_e == _FP_EXPBIAS_##fs + rsize - 1)	\
	{								\
	  /* Possibly converting to most negative integer; check the	\
	     mantissa.  */						\
	  int inexact = 0;						\
	  (void)((_FP_FRACBITS_##fs > rsize)				\
		 ? ({ _FP_FRAC_SRST_##wc(X, inexact,			\
					 _FP_FRACBITS_##fs - rsize,	\
					 _FP_FRACBITS_##fs); 0; })	\
		 : 0);							\
	  if (!_FP_FRAC_ZEROP_##wc(X))					\
	    FP_SET_EXCEPTION(FP_EX_INVALID);				\
	  else if (inexact)						\
	    FP_SET_EXCEPTION(FP_EX_INEXACT);				\
	}								\
      else								\
	FP_SET_EXCEPTION(FP_EX_INVALID);				\
    }									\
  else									\
    {									\
      _FP_FRAC_HIGH_RAW_##fs(X) |= _FP_IMPLBIT_##fs;			\
      if (X##_e >= _FP_EXPBIAS_##fs + _FP_FRACBITS_##fs - 1)		\
	{								\
	  _FP_FRAC_ASSEMBLE_##wc(r, X, rsize);				\
	  r <<= X##_e - _FP_EXPBIAS_##fs - _FP_FRACBITS_##fs + 1;	\
	}								\
      else								\
	{								\
	  int inexact;							\
	  _FP_FRAC_SRST_##wc(X, inexact,				\
			    (_FP_FRACBITS_##fs + _FP_EXPBIAS_##fs - 1	\
			     - X##_e),					\
			    _FP_FRACBITS_##fs);				\
	  if (inexact)							\
	    FP_SET_EXCEPTION(FP_EX_INEXACT);				\
	  _FP_FRAC_ASSEMBLE_##wc(r, X, rsize);				\
	}								\
      if (rsigned && X##_s)						\
	r = -r;								\
    }									\
} while (0)

/* Convert integer to fp.  Output is raw.  RTYPE is unsigned even if
   input is signed.  */
#define _FP_FROM_INT(fs, wc, X, r, rsize, rtype)			     \
  do {									     \
    if (r)								     \
      {									     \
	rtype ur_;							     \
									     \
	if ((X##_s = (r < 0)))						     \
	  r = -(rtype)r;						     \
									     \
	ur_ = (rtype) r;						     \
	(void)((rsize <= _FP_W_TYPE_SIZE)				     \
	       ? ({							     \
		    int lz_;						     \
		    __FP_CLZ(lz_, (_FP_W_TYPE)ur_);			     \
		    X##_e = _FP_EXPBIAS_##fs + _FP_W_TYPE_SIZE - 1 - lz_;    \
		  })							     \
	       : ((rsize <= 2 * _FP_W_TYPE_SIZE)			     \
		  ? ({							     \
		       int lz_;						     \
		       __FP_CLZ_2(lz_, (_FP_W_TYPE)(ur_ >> _FP_W_TYPE_SIZE), \
				  (_FP_W_TYPE)ur_);			     \
		       X##_e = (_FP_EXPBIAS_##fs + 2 * _FP_W_TYPE_SIZE - 1   \
				- lz_);					     \
		     })							     \
		  : (abort(), 0)));					     \
									     \
	if (rsize - 1 + _FP_EXPBIAS_##fs >= _FP_EXPMAX_##fs		     \
	    && X##_e >= _FP_EXPMAX_##fs)				     \
	  {								     \
	    /* Exponent too big; overflow to infinity.  (May also	     \
	       happen after rounding below.)  */			     \
	    _FP_OVERFLOW_SEMIRAW(fs, wc, X);				     \
	    goto pack_semiraw;						     \
	  }								     \
									     \
	if (rsize <= _FP_FRACBITS_##fs					     \
	    || X##_e < _FP_EXPBIAS_##fs + _FP_FRACBITS_##fs)		     \
	  {								     \
	    /* Exactly representable; shift left.  */			     \
	    _FP_FRAC_DISASSEMBLE_##wc(X, ur_, rsize);			     \
	    _FP_FRAC_SLL_##wc(X, (_FP_EXPBIAS_##fs			     \
				  + _FP_FRACBITS_##fs - 1 - X##_e));	     \
	  }								     \
	else								     \
	  {								     \
	    /* More bits in integer than in floating type; need to	     \
	       round.  */						     \
	    if (_FP_EXPBIAS_##fs + _FP_WFRACBITS_##fs - 1 < X##_e)	     \
	      ur_ = ((ur_ >> (X##_e - _FP_EXPBIAS_##fs			     \
			      - _FP_WFRACBITS_##fs + 1))		     \
		     | ((ur_ << (rsize - (X##_e - _FP_EXPBIAS_##fs	     \
					  - _FP_WFRACBITS_##fs + 1)))	     \
			!= 0));						     \
	    _FP_FRAC_DISASSEMBLE_##wc(X, ur_, rsize);			     \
	    if ((_FP_EXPBIAS_##fs + _FP_WFRACBITS_##fs - 1 - X##_e) > 0)     \
	      _FP_FRAC_SLL_##wc(X, (_FP_EXPBIAS_##fs			     \
				    + _FP_WFRACBITS_##fs - 1 - X##_e));	     \
	    _FP_FRAC_HIGH_##fs(X) &= ~(_FP_W_TYPE)_FP_IMPLBIT_SH_##fs;	     \
	  pack_semiraw:							     \
	    _FP_PACK_SEMIRAW(fs, wc, X);				     \
	  }								     \
      }									     \
    else								     \
      {									     \
	X##_s = 0;							     \
	X##_e = 0;							     \
	_FP_FRAC_SET_##wc(X, _FP_ZEROFRAC_##wc);			     \
      }									     \
  } while (0)


/* Extend from a narrower floating-point format to a wider one.  Input
   and output are raw.  */
#define FP_EXTEND(dfs,sfs,dwc,swc,D,S)					 \
do {									 \
  if (_FP_FRACBITS_##dfs < _FP_FRACBITS_##sfs				 \
      || (_FP_EXPMAX_##dfs - _FP_EXPBIAS_##dfs				 \
	  < _FP_EXPMAX_##sfs - _FP_EXPBIAS_##sfs)			 \
      || _FP_EXPBIAS_##dfs < _FP_EXPBIAS_##sfs + _FP_FRACBITS_##sfs - 1) \
    abort();								 \
  D##_s = S##_s;							 \
  _FP_FRAC_COPY_##dwc##_##swc(D, S);					 \
  if (_FP_EXP_NORMAL(sfs, swc, S))					 \
    {									 \
      D##_e = S##_e + _FP_EXPBIAS_##dfs - _FP_EXPBIAS_##sfs;		 \
      _FP_FRAC_SLL_##dwc(D, (_FP_FRACBITS_##dfs - _FP_FRACBITS_##sfs));	 \
    }									 \
  else									 \
    {									 \
      if (S##_e == 0)							 \
	{								 \
	  if (_FP_FRAC_ZEROP_##swc(S))					 \
	    D##_e = 0;							 \
	  else								 \
	    {								 \
	      int _lz;							 \
	      FP_SET_EXCEPTION(FP_EX_DENORM);				 \
	      _FP_FRAC_CLZ_##swc(_lz, S);				 \
	      _FP_FRAC_SLL_##dwc(D,					 \
				 _lz + _FP_FRACBITS_##dfs		 \
				 - _FP_FRACTBITS_##sfs);		 \
	      D##_e = (_FP_EXPBIAS_##dfs - _FP_EXPBIAS_##sfs + 1	 \
		       + _FP_FRACXBITS_##sfs - _lz);			 \
	    }								 \
	}								 \
      else								 \
	{								 \
	  D##_e = _FP_EXPMAX_##dfs;					 \
	  if (!_FP_FRAC_ZEROP_##swc(S))					 \
	    {								 \
	      if (!(_FP_FRAC_HIGH_RAW_##sfs(S) & _FP_QNANBIT_##sfs))	 \
		FP_SET_EXCEPTION(FP_EX_INVALID);			 \
	      _FP_FRAC_SLL_##dwc(D, (_FP_FRACBITS_##dfs			 \
				     - _FP_FRACBITS_##sfs));		 \
	    }								 \
	}								 \
    }									 \
} while (0)

/* Truncate from a wider floating-point format to a narrower one.
   Input and output are semi-raw.  */
#define FP_TRUNC(dfs,sfs,dwc,swc,D,S)					     \
do {									     \
  if (_FP_FRACBITS_##sfs < _FP_FRACBITS_##dfs				     \
      || _FP_EXPBIAS_##sfs < _FP_EXPBIAS_##dfs + _FP_FRACBITS_##dfs - 1)     \
    abort();								     \
  D##_s = S##_s;							     \
  if (_FP_EXP_NORMAL(sfs, swc, S))					     \
    {									     \
      D##_e = S##_e + _FP_EXPBIAS_##dfs - _FP_EXPBIAS_##sfs;		     \
      if (D##_e >= _FP_EXPMAX_##dfs)					     \
	_FP_OVERFLOW_SEMIRAW(dfs, dwc, D);				     \
      else								     \
	{								     \
	  if (D##_e <= 0)						     \
	    {								     \
	      if (D##_e < 1 - _FP_FRACBITS_##dfs)			     \
		{							     \
		  _FP_FRAC_SET_##swc(S, _FP_ZEROFRAC_##swc);		     \
		  _FP_FRAC_LOW_##swc(S) |= 1;				     \
		}							     \
	      else							     \
		{							     \
		  _FP_FRAC_HIGH_##sfs(S) |= _FP_IMPLBIT_SH_##sfs;	     \
		  _FP_FRAC_SRS_##swc(S, (_FP_WFRACBITS_##sfs		     \
					 - _FP_WFRACBITS_##dfs + 1 - D##_e), \
				     _FP_WFRACBITS_##sfs);		     \
		}							     \
	      D##_e = 0;						     \
	    }								     \
	  else								     \
	    _FP_FRAC_SRS_##swc(S, (_FP_WFRACBITS_##sfs			     \
				   - _FP_WFRACBITS_##dfs),		     \
			       _FP_WFRACBITS_##sfs);			     \
	  _FP_FRAC_COPY_##dwc##_##swc(D, S);				     \
	}								     \
    }									     \
  else									     \
    {									     \
      if (S##_e == 0)							     \
	{								     \
	  D##_e = 0;							     \
	  _FP_FRAC_SET_##dwc(D, _FP_ZEROFRAC_##dwc);			     \
	  if (!_FP_FRAC_ZEROP_##swc(S))					     \
	    {								     \
	      FP_SET_EXCEPTION(FP_EX_DENORM);				     \
	      FP_SET_EXCEPTION(FP_EX_INEXACT);				     \
	    }								     \
	}								     \
      else								     \
	{								     \
	  D##_e = _FP_EXPMAX_##dfs;					     \
	  if (_FP_FRAC_ZEROP_##swc(S))					     \
	    _FP_FRAC_SET_##dwc(D, _FP_ZEROFRAC_##dwc);			     \
	  else								     \
	    {								     \
	      _FP_CHECK_SIGNAN_SEMIRAW(sfs, swc, S);			     \
	      _FP_FRAC_SRL_##swc(S, (_FP_WFRACBITS_##sfs		     \
				     - _FP_WFRACBITS_##dfs));		     \
	      _FP_FRAC_COPY_##dwc##_##swc(D, S);			     \
	      /* Semi-raw NaN must have all workbits cleared.  */	     \
	      _FP_FRAC_LOW_##dwc(D)					     \
		&= ~(_FP_W_TYPE) ((1 << _FP_WORKBITS) - 1);		     \
	      _FP_FRAC_HIGH_##dfs(D) |= _FP_QNANBIT_SH_##dfs;		     \
	    }								     \
	}								     \
    }									     \
} while (0)

/*
 * Helper primitives.
 */

/* Count leading zeros in a word.  */

#ifndef __FP_CLZ
/* GCC 3.4 and later provide the builtins for us.  */
#define __FP_CLZ(r, x)							      \
  do {									      \
    if (sizeof (_FP_W_TYPE) == sizeof (unsigned int))			      \
      r = __builtin_clz (x);						      \
    else if (sizeof (_FP_W_TYPE) == sizeof (unsigned long))		      \
      r = __builtin_clzl (x);						      \
    else if (sizeof (_FP_W_TYPE) == sizeof (unsigned long long))	      \
      r = __builtin_clzll (x);						      \
    else								      \
      abort ();								      \
  } while (0)
#endif /* ndef __FP_CLZ */

#define _FP_DIV_HELP_imm(q, r, n, d)		\
  do {						\
    q = n / d, r = n % d;			\
  } while (0)


/* A restoring bit-by-bit division primitive.  */

#define _FP_DIV_MEAT_N_loop(fs, wc, R, X, Y)				\
  do {									\
    int count = _FP_WFRACBITS_##fs;					\
    _FP_FRAC_DECL_##wc (u);						\
    _FP_FRAC_DECL_##wc (v);						\
    _FP_FRAC_COPY_##wc (u, X);						\
    _FP_FRAC_COPY_##wc (v, Y);						\
    _FP_FRAC_SET_##wc (R, _FP_ZEROFRAC_##wc);				\
    /* Normalize U and V.  */						\
    _FP_FRAC_SLL_##wc (u, _FP_WFRACXBITS_##fs);				\
    _FP_FRAC_SLL_##wc (v, _FP_WFRACXBITS_##fs);				\
    /* First round.  Since the operands are normalized, either the	\
       first or second bit will be set in the fraction.  Produce a	\
       normalized result by checking which and adjusting the loop	\
       count and exponent accordingly.  */				\
    if (_FP_FRAC_GE_1 (u, v))						\
      {									\
	_FP_FRAC_SUB_##wc (u, u, v);					\
	_FP_FRAC_LOW_##wc (R) |= 1;					\
	count--;							\
      }									\
    else								\
      R##_e--;								\
    /* Subsequent rounds.  */						\
    do {								\
      int msb = (_FP_WS_TYPE) _FP_FRAC_HIGH_##wc (u) < 0;		\
      _FP_FRAC_SLL_##wc (u, 1);						\
      _FP_FRAC_SLL_##wc (R, 1);						\
      if (msb || _FP_FRAC_GE_1 (u, v))					\
	{								\
	  _FP_FRAC_SUB_##wc (u, u, v);					\
	  _FP_FRAC_LOW_##wc (R) |= 1;					\
	}								\
    } while (--count > 0);						\
    /* If there's anything left in U, the result is inexact.  */	\
    _FP_FRAC_LOW_##wc (R) |= !_FP_FRAC_ZEROP_##wc (u);			\
  } while (0)

#define _FP_DIV_MEAT_1_loop(fs, R, X, Y)  _FP_DIV_MEAT_N_loop (fs, 1, R, X, Y)
#define _FP_DIV_MEAT_2_loop(fs, R, X, Y)  _FP_DIV_MEAT_N_loop (fs, 2, R, X, Y)
#define _FP_DIV_MEAT_4_loop(fs, R, X, Y)  _FP_DIV_MEAT_N_loop (fs, 4, R, X, Y)