| blob | dbc42148985caa12e185526d1c12813956156d27 |
1 /* Decimal Number module for the decNumber C Library
2 Copyright (C) 2005 Free Software Foundation, Inc.
3 Contributed by IBM Corporation. Author Mike Cowlishaw.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
10 version.
12 In addition to the permissions in the GNU General Public License,
13 the Free Software Foundation gives you unlimited permission to link
14 the compiled version of this file into combinations with other
15 programs, and to distribute those combinations without any
16 restriction coming from the use of this file. (The General Public
17 License restrictions do apply in other respects; for example, they
18 cover modification of the file, and distribution when not linked
19 into a combine executable.)
21 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
22 WARRANTY; without even the implied warranty of MERCHANTABILITY or
23 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
24 for more details.
26 You should have received a copy of the GNU General Public License
27 along with GCC; see the file COPYING. If not, write to the Free
28 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
29 02110-1301, USA. */
31 /* ------------------------------------------------------------------ */
32 /* This module comprises the routines for Standard Decimal Arithmetic */
33 /* as defined in the specification which may be found on the */
34 /* http://www2.hursley.ibm.com/decimal web pages. It implements both */
35 /* the full ('extended') arithmetic and the simpler ('subset') */
36 /* arithmetic. */
37 /* */
38 /* Usage notes: */
39 /* */
40 /* 1. This code is ANSI C89 except: */
41 /* */
42 /* a) Line comments (double forward slash) are used. (Most C */
43 /* compilers accept these. If yours does not, a simple script */
44 /* can be used to convert them to ANSI C comments.) */
45 /* */
46 /* b) Types from C99 stdint.h are used. If you do not have this */
47 /* header file, see the User's Guide section of the decNumber */
48 /* documentation; this lists the necessary definitions. */
49 /* */
50 /* c) If DECDPUN>4, non-ANSI 64-bit 'long long' types are used. */
51 /* To avoid these, set DECDPUN <= 4 (see documentation). */
52 /* */
53 /* 2. The decNumber format which this library uses is optimized for */
54 /* efficient processing of relatively short numbers; in particular */
55 /* it allows the use of fixed sized structures and minimizes copy */
56 /* and move operations. It does, however, support arbitrary */
57 /* precision (up to 999,999,999 digits) and arbitrary exponent */
58 /* range (Emax in the range 0 through 999,999,999 and Emin in the */
59 /* range -999,999,999 through 0). */
60 /* */
61 /* 3. Operands to operator functions are never modified unless they */
62 /* are also specified to be the result number (which is always */
63 /* permitted). Other than that case, operands may not overlap. */
64 /* */
65 /* 4. Error handling: the type of the error is ORed into the status */
66 /* flags in the current context (decContext structure). The */
67 /* SIGFPE signal is then raised if the corresponding trap-enabler */
68 /* flag in the decContext is set (is 1). */
69 /* */
70 /* It is the responsibility of the caller to clear the status */
71 /* flags as required. */
72 /* */
73 /* The result of any routine which returns a number will always */
74 /* be a valid number (which may be a special value, such as an */
75 /* Infinity or NaN). */
76 /* */
77 /* 5. The decNumber format is not an exchangeable concrete */
78 /* representation as it comprises fields which may be machine- */
79 /* dependent (big-endian or little-endian, for example). */
80 /* Canonical conversions to and from strings are provided; other */
81 /* conversions are available in separate modules. */
82 /* */
83 /* 6. Normally, input operands are assumed to be valid. Set DECCHECK */
84 /* to 1 for extended operand checking (including NULL operands). */
85 /* Results are undefined if a badly-formed structure (or a NULL */
86 /* NULL pointer to a structure) is provided, though with DECCHECK */
87 /* enabled the operator routines are protected against exceptions. */
88 /* (Except if the result pointer is NULL, which is unrecoverable.) */
89 /* */
90 /* However, the routines will never cause exceptions if they are */
91 /* given well-formed operands, even if the value of the operands */
92 /* is inappropriate for the operation and DECCHECK is not set. */
93 /* */
94 /* 7. Subset arithmetic is available only if DECSUBSET is set to 1. */
95 /* ------------------------------------------------------------------ */
96 /* Implementation notes for maintenance of this module: */
97 /* */
98 /* 1. Storage leak protection: Routines which use malloc are not */
99 /* permitted to use return for fastpath or error exits (i.e., */
100 /* they follow strict structured programming conventions). */
101 /* Instead they have a do{}while(0); construct surrounding the */
102 /* code which is protected -- break may be used from this. */
103 /* Other routines are allowed to use the return statement inline. */
104 /* */
105 /* Storage leak accounting can be enabled using DECALLOC. */
106 /* */
107 /* 2. All loops use the for(;;) construct. Any do construct is for */
108 /* protection as just described. */
109 /* */
110 /* 3. Setting status in the context must always be the very last */
111 /* action in a routine, as non-0 status may raise a trap and hence */
112 /* the call to set status may not return (if the handler uses long */
113 /* jump). Therefore all cleanup must be done first. In general, */
114 /* to achieve this we accumulate status and only finally apply it */
115 /* by calling decContextSetStatus (via decStatus). */
116 /* */
117 /* Routines which allocate storage cannot, therefore, use the */
118 /* 'top level' routines which could cause a non-returning */
119 /* transfer of control. The decXxxxOp routines are safe (do not */
120 /* call decStatus even if traps are set in the context) and should */
121 /* be used instead (they are also a little faster). */
122 /* */
123 /* 4. Exponent checking is minimized by allowing the exponent to */
124 /* grow outside its limits during calculations, provided that */
125 /* the decFinalize function is called later. Multiplication and */
126 /* division, and intermediate calculations in exponentiation, */
127 /* require more careful checks because of the risk of 31-bit */
128 /* overflow (the most negative valid exponent is -1999999997, for */
129 /* a 999999999-digit number with adjusted exponent of -999999999). */
130 /* */
131 /* 5. Rounding is deferred until finalization of results, with any */
132 /* 'off to the right' data being represented as a single digit */
133 /* residue (in the range -1 through 9). This avoids any double- */
134 /* rounding when more than one shortening takes place (for */
135 /* example, when a result is subnormal). */
136 /* */
137 /* 6. The digits count is allowed to rise to a multiple of DECDPUN */
138 /* during many operations, so whole Units are handled and exact */
139 /* accounting of digits is not needed. The correct digits value */
140 /* is found by decGetDigits, which accounts for leading zeros. */
141 /* This must be called before any rounding if the number of digits */
142 /* is not known exactly. */
143 /* */
144 /* 7. We use the multiply-by-reciprocal 'trick' for partitioning */
145 /* numbers up to four digits, using appropriate constants. This */
146 /* is not useful for longer numbers because overflow of 32 bits */
147 /* would lead to 4 multiplies, which is almost as expensive as */
148 /* a divide (unless we assumed floating-point multiply available). */
149 /* */
150 /* 8. Unusual abbreviations possibly used in the commentary: */
151 /* lhs -- left hand side (operand, of an operation) */
152 /* lsd -- least significant digit (of coefficient) */
153 /* lsu -- least significant Unit (of coefficient) */
154 /* msd -- most significant digit (of coefficient) */
155 /* msu -- most significant Unit (of coefficient) */
156 /* rhs -- right hand side (operand, of an operation) */
157 /* +ve -- positive */
158 /* -ve -- negative */
159 /* ------------------------------------------------------------------ */
161 /* Some of glibc's string inlines cause warnings. Plus we'd rather
162 rely on (and therefore test) GCC's string builtins. */
163 #define __NO_STRING_INLINES
173 /* Constants */
174 /* Public constant array: powers of ten (powers[n]==10**n) */
177 };
179 /* Local constants */
194 /* Granularity-dependent code */
195 #if DECDPUN<=4
198 /* Constant multipliers for divide-by-power-of five using reciprocal */
199 /* multiply, after removing powers of 2 by shifting, and final shift */
200 /* of 17 [we only need up to **4] */
203 /* QUOT10 -- macro to return the quotient of unit u divided by 10**n */
204 #define QUOT10(u, n) ((((uInt)(u)>>(n))*multies[n])>>17)
205 #else
206 /* For DECDPUN>4 we currently use non-ANSI 64-bit types. These could */
207 /* be replaced by subroutine calls later. */
208 #ifdef long
209 #undef long
210 #endif
215 #endif
217 /* Local routines */
231 #if DECSUBSET
233 #else
235 #endif
254 #if !DECSUBSET
255 /* decFinish == decFinalize when no subset arithmetic needed */
256 #define decFinish(a,b,c,d) decFinalize(a,b,c,d)
257 #else
260 #endif
262 /* Diagnostic macros, etc. */
263 #if DECALLOC
264 /* Handle malloc/free accounting. If enabled, our accountable routines */
265 /* are used; otherwise the code just goes straight to the system malloc */
266 /* and free routines. */
267 #define malloc(a) decMalloc(a)
268 #define free(a) decFree(a)
270 /* 'Our' malloc and free: */
274 /* Note that DECALLOC code only checks for storage buffer overflow. */
275 /* To check for memory leaks, the decAllocBytes variable should be */
276 /* checked to be 0 at appropriate times (e.g., after the test */
277 /* harness completes a set of tests). This checking may be unreliable */
278 /* if the testing is done in a multi-thread environment. */
279 #endif
281 #if DECCHECK
282 /* Optional operand checking routines. Enabling these means that */
283 /* decNumber and decContext operands to operator routines are checked */
284 /* for correctness. This roughly doubles the execution time of the */
285 /* fastest routines (and adds 600+ bytes), so should not normally be */
286 /* used in 'production'. */
287 #define DECUNUSED (void *)(0xffffffff)
291 #endif
293 #if DECTRACE || DECCHECK
294 /* Optional trace/debugging routines. */
297 #endif
299 /* ================================================================== */
300 /* Conversions */
301 /* ================================================================== */
303 /* ------------------------------------------------------------------ */
304 /* to-scientific-string -- conversion to numeric string */
305 /* to-engineering-string -- conversion to numeric string */
306 /* */
307 /* decNumberToString(dn, string); */
308 /* decNumberToEngString(dn, string); */
309 /* */
310 /* dn is the decNumber to convert */
311 /* string is the string where the result will be laid out */
312 /* */
313 /* string must be at least dn->digits+14 characters long */
314 /* */
315 /* No error is possible, and no status can be set. */
316 /* ------------------------------------------------------------------ */
319 {
322 }
326 {
329 }
331 /* ------------------------------------------------------------------ */
332 /* to-number -- conversion from numeric string */
333 /* */
334 /* decNumberFromString -- convert string to decNumber */
335 /* dn -- the number structure to fill */
336 /* chars[] -- the string to convert ('\0' terminated) */
337 /* set -- the context used for processing any error, */
338 /* determining the maximum precision available */
339 /* (set.digits), determining the maximum and minimum */
340 /* exponent (set.emax and set.emin), determining if */
341 /* extended values are allowed, and checking the */
342 /* rounding mode if overflow occurs or rounding is */
343 /* needed. */
344 /* */
345 /* The length of the coefficient and the size of the exponent are */
346 /* checked by this routine, so the correct error (Underflow or */
347 /* Overflow) can be reported or rounding applied, as necessary. */
348 /* */
349 /* If bad syntax is detected, the result will be a quiet NaN. */
350 /* ------------------------------------------------------------------ */
351 decNumber *
353 {
367 #if DECDPUN>1
369 #endif
373 #if DECCHECK
376 #endif
378 do
384 c++;
385 }
388 /* We're at the start of the number [we think] */
391 {
397 }
400 /* dot: record, check, and ignore */
411 #if DECSUBSET
412 /* If subset then infinities and NaNs are not allowed */
414 {
417 }
418 else
419 {
420 #endif
421 /* Infinities and NaNs are possible, here */
424 {
427 }
428 else
430 /* 2003.09.10 NaNs are now permitted to have a sign */
435 c++;
437 }
440 c++;
443 c++;
446 c++;
447 /* now nothing, or nnnn, expected */
448 /* -> start of integer and skip leading 0s [including plain 0] */
450 cfirst++;
455 }
456 /* something other than 0s; setup last and d as usual [no dots] */
458 {
462 }
467 /* good; drop through and convert the integer */
471 #if DECSUBSET
472 }
473 #endif
480 {
483 }
485 /* Found 'e' or 'E' -- now process explicit exponent */
486 /* 1998.07.11: sign no longer required */
489 {
491 c++;
492 }
494 c++;
496 {
499 }
505 {
510 /* if we didn't end on '\0' must not be a digit */
512 {
515 }
517 /* (this next test must be after the syntax check) */
518 /* if it was too long the exponent may have wrapped, so check */
519 /* carefully and set it to a certain overflow if wrap possible */
521 {
524 /* [up to 1999999999 is OK, for example 1E-1000000998] */
525 }
529 /* Here when all inspected; syntax is good */
531 /* Handle decimal point... */
534 /* [we can now ignore the .] */
536 /* strip leading zeros/dot (leave final if all 0's) */
538 {
546 #if DECSUBSET
547 /* We can now make a rapid exit for zeros if !extended */
549 {
552 }
553 #endif
555 /* OK, the digits string is good. Copy to the decNumber, or to
556 a temporary decNumber if rounding is needed */
559 else
567 {
570 }
572 }
573 }
574 /* res now -> number lsu, buffer, or allocated storage for Unit array */
576 /* Place the coefficient into the selected Unit array */
577 #if DECDPUN>1
590 }
592 i--;
598 up--;
601 #else
602 /* DECDPUN==1 */
609 up++;
611 #endif
617 /* if not in number (too long) shorten into the number */
621 /* Finally check for overflow or subnormal and round as needed */
623 /* decNumberShow(dn); */
624 }
632 }
634 /* ================================================================== */
635 /* Operators */
636 /* ================================================================== */
638 /* ------------------------------------------------------------------ */
639 /* decNumberAbs -- absolute value operator */
640 /* */
641 /* This computes C = abs(A) */
642 /* */
643 /* res is C, the result. C may be A */
644 /* rhs is A */
645 /* set is the context */
646 /* */
647 /* C must have space for set->digits digits. */
648 /* ------------------------------------------------------------------ */
649 /* This has the same effect as decNumberPlus unless A is negative, */
650 /* in which case it has the same effect as decNumberMinus. */
651 /* ------------------------------------------------------------------ */
652 decNumber *
654 {
658 #if DECCHECK
661 #endif
669 }
671 /* ------------------------------------------------------------------ */
672 /* decNumberAdd -- add two Numbers */
673 /* */
674 /* This computes C = A + B */
675 /* */
676 /* res is C, the result. C may be A and/or B (e.g., X=X+X) */
677 /* lhs is A */
678 /* rhs is B */
679 /* set is the context */
680 /* */
681 /* C must have space for set->digits digits. */
682 /* ------------------------------------------------------------------ */
683 /* This just calls the routine shared with Subtract */
684 decNumber *
687 {
693 }
695 /* ------------------------------------------------------------------ */
696 /* decNumberCompare -- compare two Numbers */
697 /* */
698 /* This computes C = A ? B */
699 /* */
700 /* res is C, the result. C may be A and/or B (e.g., X=X?X) */
701 /* lhs is A */
702 /* rhs is B */
703 /* set is the context */
704 /* */
705 /* C must have space for one digit. */
706 /* ------------------------------------------------------------------ */
707 decNumber *
710 {
716 }
718 /* ------------------------------------------------------------------ */
719 /* decNumberDivide -- divide one number by another */
720 /* */
721 /* This computes C = A / B */
722 /* */
723 /* res is C, the result. C may be A and/or B (e.g., X=X/X) */
724 /* lhs is A */
725 /* rhs is B */
726 /* set is the context */
727 /* */
728 /* C must have space for set->digits digits. */
729 /* ------------------------------------------------------------------ */
730 decNumber *
733 {
739 }
741 /* ------------------------------------------------------------------ */
742 /* decNumberDivideInteger -- divide and return integer quotient */
743 /* */
744 /* This computes C = A # B, where # is the integer divide operator */
745 /* */
746 /* res is C, the result. C may be A and/or B (e.g., X=X#X) */
747 /* lhs is A */
748 /* rhs is B */
749 /* set is the context */
750 /* */
751 /* C must have space for set->digits digits. */
752 /* ------------------------------------------------------------------ */
753 decNumber *
756 {
762 }
764 /* ------------------------------------------------------------------ */
765 /* decNumberMax -- compare two Numbers and return the maximum */
766 /* */
767 /* This computes C = A ? B, returning the maximum or A if equal */
768 /* */
769 /* res is C, the result. C may be A and/or B (e.g., X=X?X) */
770 /* lhs is A */
771 /* rhs is B */
772 /* set is the context */
773 /* */
774 /* C must have space for set->digits digits. */
775 /* ------------------------------------------------------------------ */
776 decNumber *
779 {
785 }
787 /* ------------------------------------------------------------------ */
788 /* decNumberMin -- compare two Numbers and return the minimum */
789 /* */
790 /* This computes C = A ? B, returning the minimum or A if equal */
791 /* */
792 /* res is C, the result. C may be A and/or B (e.g., X=X?X) */
793 /* lhs is A */
794 /* rhs is B */
795 /* set is the context */
796 /* */
797 /* C must have space for set->digits digits. */
798 /* ------------------------------------------------------------------ */
799 decNumber *
802 {
808 }
810 /* ------------------------------------------------------------------ */
811 /* decNumberMinus -- prefix minus operator */
812 /* */
813 /* This computes C = 0 - A */
814 /* */
815 /* res is C, the result. C may be A */
816 /* rhs is A */
817 /* set is the context */
818 /* */
819 /* C must have space for set->digits digits. */
820 /* ------------------------------------------------------------------ */
821 /* We simply use AddOp for the subtract, which will do the necessary. */
822 /* ------------------------------------------------------------------ */
823 decNumber *
825 {
826 decNumber dzero;
829 #if DECCHECK
832 #endif
840 }
842 /* ------------------------------------------------------------------ */
843 /* decNumberPlus -- prefix plus operator */
844 /* */
845 /* This computes C = 0 + A */
846 /* */
847 /* res is C, the result. C may be A */
848 /* rhs is A */
849 /* set is the context */
850 /* */
851 /* C must have space for set->digits digits. */
852 /* ------------------------------------------------------------------ */
853 /* We simply use AddOp; Add will take fast path after preparing A. */
854 /* Performance is a concern here, as this routine is often used to */
855 /* check operands and apply rounding and overflow/underflow testing. */
856 /* ------------------------------------------------------------------ */
857 decNumber *
859 {
860 decNumber dzero;
863 #if DECCHECK
866 #endif
874 }
876 /* ------------------------------------------------------------------ */
877 /* decNumberMultiply -- multiply two Numbers */
878 /* */
879 /* This computes C = A x B */
880 /* */
881 /* res is C, the result. C may be A and/or B (e.g., X=X+X) */
882 /* lhs is A */
883 /* rhs is B */
884 /* set is the context */
885 /* */
886 /* C must have space for set->digits digits. */
887 /* ------------------------------------------------------------------ */
888 decNumber *
891 {
897 }
899 /* ------------------------------------------------------------------ */
900 /* decNumberNormalize -- remove trailing zeros */
901 /* */
902 /* This computes C = 0 + A, and normalizes the result */
903 /* */
904 /* res is C, the result. C may be A */
905 /* rhs is A */
906 /* set is the context */
907 /* */
908 /* C must have space for set->digits digits. */
909 /* ------------------------------------------------------------------ */
910 decNumber *
912 {
918 #if DECCHECK
921 #endif
923 do
925 #if DECSUBSET
927 {
928 /* reduce operand and set lostDigits status, as needed */
930 {
935 }
936 }
937 #endif
938 /* [following code does not require input rounding] */
940 /* specials copy through, except NaNs need care */
942 {
945 }
947 /* reduce result to the requested length and copy to result */
951 }
959 }
961 /* ------------------------------------------------------------------ */
962 /* decNumberPower -- raise a number to an integer power */
963 /* */
964 /* This computes C = A ** B */
965 /* */
966 /* res is C, the result. C may be A and/or B (e.g., X=X**X) */
967 /* lhs is A */
968 /* rhs is B */
969 /* set is the context */
970 /* */
971 /* C must have space for set->digits digits. */
972 /* */
973 /* Specification restriction: abs(n) must be <=999999999 */
974 /* ------------------------------------------------------------------ */
975 decNumber *
978 {
986 #if DECSUBSET
988 #endif
996 /* local accumulator buffer [a decNumber, with digits+elength+1 digits] */
998 /* same again for possible 1/lhs calculation */
1002 #if DECCHECK
1005 #endif
1007 do
1009 #if DECSUBSET
1011 {
1012 /* reduce operands and set lostDigits status, as needed */
1014 {
1019 }
1020 /* rounding won't affect the result, but we might signal lostDigits */
1021 /* as well as the error for non-integer [x**y would need this too] */
1023 {
1028 }
1029 }
1030 #endif
1031 /* [following code does not require input rounding] */
1033 /* handle rhs Infinity */
1035 {
1038 }
1039 /* handle NaNs */
1041 {
1044 }
1046 /* Original rhs must be an integer that fits and is in range */
1047 #if DECSUBSET
1049 #else
1051 #endif
1053 {
1056 }
1060 }
1065 /* handle LHS infinity */
1072 else
1073 {
1076 /* [otherwise will be 0 or -0] */
1078 }
1080 }
1082 /* clone the context */
1084 /* calculate the working DIGITS */
1086 /* it's an error if this is more than we can handle */
1088 {
1091 }
1093 /* workset.digits is the count of digits for the accumulator we need */
1094 /* if accumulator is too long for local storage, then allocate */
1095 needbytes =
1097 /* [needbytes also used below if 1/lhs needed] */
1099 {
1105 }
1107 }
1113 /* 0**0 is bad unless subset, when it becomes 1 */
1115 #if DECSUBSET
1117 #endif
1118 )
1120 else
1123 }
1125 /* if a negative power we'll need the constant 1, and if not subset */
1126 /* we'll invert the lhs now rather than inverting the result later */
1131 #if DECSUBSET
1134 #endif
1135 /* divide lhs into 1, putting result in dac [dac=1/dac] */
1138 {
1141 }
1142 /* now locate or allocate space for the inverted lhs */
1144 {
1150 }
1152 }
1153 else
1155 /* [lhs now points to buffer or allocated storage] */
1159 #if DECSUBSET
1160 }
1161 #endif
1162 }
1164 /* Raise-to-the-power loop... */
1168 /* abandon if we have had overflow or terminal underflow */
1173 }
1174 /* [the following two lines revealed an optimizer bug in a C++ */
1175 /* compiler, with symptom: 5**3 -> 25, when n=n+n was used] */
1181 }
1189 /* complete internal overflow or underflow processing */
1191 {
1192 #if DECSUBSET
1193 /* If subset, and power was negative, reverse the kind of -erflow */
1194 /* [1/x not yet done] */
1196 {
1199 else
1203 }
1204 }
1205 #endif
1207 /* round subnormals [to set.digits rather than workset.digits] */
1208 /* or set overflow result similarly as required */
1212 }
1214 #if DECSUBSET
1218 /* so divide result into 1 [dac=1/dac] */
1220 }
1221 #endif
1223 /* reduce result to the requested length and copy to result */
1226 #if DECSUBSET
1229 #endif
1230 }
1242 }
1244 /* ------------------------------------------------------------------ */
1245 /* decNumberQuantize -- force exponent to requested value */
1246 /* */
1247 /* This computes C = op(A, B), where op adjusts the coefficient */
1248 /* of C (by rounding or shifting) such that the exponent (-scale) */
1249 /* of C has exponent of B. The numerical value of C will equal A, */
1250 /* except for the effects of any rounding that occurred. */
1251 /* */
1252 /* res is C, the result. C may be A or B */
1253 /* lhs is A, the number to adjust */
1254 /* rhs is B, the number with exponent to match */
1255 /* set is the context */
1256 /* */
1257 /* C must have space for set->digits digits. */
1258 /* */
1259 /* Unless there is an error or the result is infinite, the exponent */
1260 /* after the operation is guaranteed to be equal to that of B. */
1261 /* ------------------------------------------------------------------ */
1262 decNumber *
1265 {
1271 }
1273 /* ------------------------------------------------------------------ */
1274 /* decNumberRescale -- force exponent to requested value */
1275 /* */
1276 /* This computes C = op(A, B), where op adjusts the coefficient */
1277 /* of C (by rounding or shifting) such that the exponent (-scale) */
1278 /* of C has the value B. The numerical value of C will equal A, */
1279 /* except for the effects of any rounding that occurred. */
1280 /* */
1281 /* res is C, the result. C may be A or B */
1282 /* lhs is A, the number to adjust */
1283 /* rhs is B, the requested exponent */
1284 /* set is the context */
1285 /* */
1286 /* C must have space for set->digits digits. */
1287 /* */
1288 /* Unless there is an error or the result is infinite, the exponent */
1289 /* after the operation is guaranteed to be equal to B. */
1290 /* ------------------------------------------------------------------ */
1291 decNumber *
1294 {
1300 }
1302 /* ------------------------------------------------------------------ */
1303 /* decNumberRemainder -- divide and return remainder */
1304 /* */
1305 /* This computes C = A % B */
1306 /* */
1307 /* res is C, the result. C may be A and/or B (e.g., X=X%X) */
1308 /* lhs is A */
1309 /* rhs is B */
1310 /* set is the context */
1311 /* */
1312 /* C must have space for set->digits digits. */
1313 /* ------------------------------------------------------------------ */
1314 decNumber *
1317 {
1323 }
1325 /* ------------------------------------------------------------------ */
1326 /* decNumberRemainderNear -- divide and return remainder from nearest */
1327 /* */
1328 /* This computes C = A % B, where % is the IEEE remainder operator */
1329 /* */
1330 /* res is C, the result. C may be A and/or B (e.g., X=X%X) */
1331 /* lhs is A */
1332 /* rhs is B */
1333 /* set is the context */
1334 /* */
1335 /* C must have space for set->digits digits. */
1336 /* ------------------------------------------------------------------ */
1337 decNumber *
1340 {
1346 }
1348 /* ------------------------------------------------------------------ */
1349 /* decNumberSameQuantum -- test for equal exponents */
1350 /* */
1351 /* res is the result number, which will contain either 0 or 1 */
1352 /* lhs is a number to test */
1353 /* rhs is the second (usually a pattern) */
1354 /* */
1355 /* No errors are possible and no context is needed. */
1356 /* ------------------------------------------------------------------ */
1357 decNumber *
1359 {
1363 #if DECCHECK
1366 #endif
1370 {
1375 /* [anything else with a special gives 0] */
1376 }
1383 }
1385 /* ------------------------------------------------------------------ */
1386 /* decNumberSquareRoot -- square root operator */
1387 /* */
1388 /* This computes C = squareroot(A) */
1389 /* */
1390 /* res is C, the result. C may be A */
1391 /* rhs is A */
1392 /* set is the context; note that rounding mode has no effect */
1393 /* */
1394 /* C must have space for set->digits digits. */
1395 /* ------------------------------------------------------------------ */
1396 /* This uses the following varying-precision algorithm in: */
1397 /* */
1398 /* Properly Rounded Variable Precision Square Root, T. E. Hull and */
1399 /* A. Abrham, ACM Transactions on Mathematical Software, Vol 11 #3, */
1400 /* pp229-237, ACM, September 1985. */
1401 /* */
1402 /* % [Reformatted original Numerical Turing source code follows.] */
1403 /* function sqrt(x : real) : real */
1404 /* % sqrt(x) returns the properly rounded approximation to the square */
1405 /* % root of x, in the precision of the calling environment, or it */
1406 /* % fails if x < 0. */
1407 /* % t e hull and a abrham, august, 1984 */
1408 /* if x <= 0 then */
1409 /* if x < 0 then */
1410 /* assert false */
1411 /* else */
1412 /* result 0 */
1413 /* end if */
1414 /* end if */
1415 /* var f := setexp(x, 0) % fraction part of x [0.1 <= x < 1] */
1416 /* var e := getexp(x) % exponent part of x */
1417 /* var approx : real */
1418 /* if e mod 2 = 0 then */
1419 /* approx := .259 + .819 * f % approx to root of f */
1420 /* else */
1421 /* f := f/l0 % adjustments */
1422 /* e := e + 1 % for odd */
1423 /* approx := .0819 + 2.59 * f % exponent */
1424 /* end if */
1425 /* */
1426 /* var p:= 3 */
1427 /* const maxp := currentprecision + 2 */
1428 /* loop */
1429 /* p := min(2*p - 2, maxp) % p = 4,6,10, . . . , maxp */
1430 /* precision p */
1431 /* approx := .5 * (approx + f/approx) */
1432 /* exit when p = maxp */
1433 /* end loop */
1434 /* */
1435 /* % approx is now within 1 ulp of the properly rounded square root */
1436 /* % of f; to ensure proper rounding, compare squares of (approx - */
1437 /* % l/2 ulp) and (approx + l/2 ulp) with f. */
1438 /* p := currentprecision */
1439 /* begin */
1440 /* precision p + 2 */
1441 /* const approxsubhalf := approx - setexp(.5, -p) */
1442 /* if mulru(approxsubhalf, approxsubhalf) > f then */
1443 /* approx := approx - setexp(.l, -p + 1) */
1444 /* else */
1445 /* const approxaddhalf := approx + setexp(.5, -p) */
1446 /* if mulrd(approxaddhalf, approxaddhalf) < f then */
1447 /* approx := approx + setexp(.l, -p + 1) */
1448 /* end if */
1449 /* end if */
1450 /* end */
1451 /* result setexp(approx, e div 2) % fix exponent */
1452 /* end sqrt */
1453 /* ------------------------------------------------------------------ */
1454 decNumber *
1456 {
1468 /* buffer for f [needs +1 in case DECBUFFER 0] */
1470 /* buffer for a [needs +2 to match maxp] */
1472 /* buffer for temporary, b [must be same size as a] */
1480 /* buffer for temporary variable, up to 3 digits */
1484 #if DECCHECK
1487 #endif
1489 do
1491 #if DECSUBSET
1493 {
1494 /* reduce operand and set lostDigits status, as needed */
1496 {
1500 /* [Note: 'f' allocation below could reuse this buffer if */
1501 /* used, but as this is rare we keep them separate for clarity.] */
1503 }
1504 }
1505 #endif
1506 /* [following code does not require input rounding] */
1508 /* handle infinities and NaNs */
1510 {
1515 else
1517 }
1518 else
1521 }
1523 /* calculate the ideal (preferred) exponent [floor(exp/2)] */
1524 /* [We would like to write: ideal=rhs->exponent>>1, but this */
1525 /* generates a compiler warning. Generated code is the same.] */
1528 /* handle zeros */
1530 {
1534 }
1536 /* any other -x is an oops */
1538 {
1541 }
1543 /* we need space for three working variables */
1544 /* f -- the same precision as the RHS, reduced to 0.01->0.99... */
1545 /* a -- Hull's approx -- precision, when assigned, is */
1546 /* currentprecision (we allow +2 for use as temporary) */
1547 /* b -- intermediate temporary result */
1548 /* if any is too long for local storage, then allocate */
1549 needbytes =
1552 {
1558 }
1560 }
1561 /* a and b both need to be able to hold a maxp-length number */
1571 }
1574 }
1576 /* copy rhs -> f, save exponent, and reduce so 0.1 <= f < 1 */
1581 /* set up working contexts (the second is used for Numerical */
1582 /* Turing assignment) */
1587 /* [Until further notice, no error is possible and status bits */
1588 /* (Rounded, etc.) should be ignored, not accumulated.] */
1590 /* Calculate initial approximation, and allow for odd exponent */
1598 /* Set t=0.259, a=0.819 */
1601 #if DECDPUN>=3
1604 #elif DECDPUN==2
1609 #else
1616 #endif
1617 }
1618 else
1620 /* Set t=0.0819, a=2.59 */
1625 #if DECDPUN>=3
1628 #elif DECDPUN==2
1633 #else
1640 #endif
1641 }
1644 /* [a is now the initial approximation for sqrt(f), calculated with */
1645 /* currentprecision, which is also a's precision.] */
1647 /* the main calculation loop */
1654 {
1655 /* set p to min(2*p - 2, maxp) [hence 3; or: 4, 6, 10, ... , maxp] */
1659 /* a = 0.5 * (a + f/a) */
1660 /* [calculated at p then rounded to currentprecision] */
1664 /* assign to approx [round to length] */
1670 /* a is now at currentprecision and within 1 ulp of the properly */
1671 /* rounded square root of f; to ensure proper rounding, compare */
1672 /* squares of (a - l/2 ulp) and (a + l/2 ulp) with f. */
1673 /* Here workset.digits=maxp and t=0.5 */
1683 /* this is the more common adjustment, though both are rare */
1687 /* assign to approx [round to length] */
1689 }
1690 else
1691 {
1702 /* assign to approx [round to length] */
1704 }
1705 }
1706 /* [no errors are possible in the above, and rounding/inexact during */
1707 /* estimation are irrelevant, so status was not accumulated] */
1709 /* Here, 0.1 <= a < 1 [Hull] */
1712 /* Process Subnormals */
1715 /* count dropable zeros [after any subnormal rounding] */
1719 /* Finally set Inexact and Rounded. The answer can only be exact if */
1720 /* it is short enough so that squaring it could fit in set->digits, */
1721 /* so this is the only (relatively rare) time we have to check */
1722 /* carefully */
1726 }
1727 else
1734 }
1735 else
1739 {
1741 }
1742 else
1744 /* here, dropped is the count of trailing zeros in 'a' */
1745 /* use closest exponent to ideal... */
1751 }
1752 else
1761 }
1762 }
1763 }
1764 }
1765 }
1767 }
1781 }
1783 /* ------------------------------------------------------------------ */
1784 /* decNumberSubtract -- subtract two Numbers */
1785 /* */
1786 /* This computes C = A - B */
1787 /* */
1788 /* res is C, the result. C may be A and/or B (e.g., X=X-X) */
1789 /* lhs is A */
1790 /* rhs is B */
1791 /* set is the context */
1792 /* */
1793 /* C must have space for set->digits digits. */
1794 /* ------------------------------------------------------------------ */
1795 decNumber *
1798 {
1805 }
1807 /* ------------------------------------------------------------------ */
1808 /* decNumberToIntegralValue -- round-to-integral-value */
1809 /* */
1810 /* res is the result */
1811 /* rhs is input number */
1812 /* set is the context */
1813 /* */
1814 /* res must have space for any value of rhs. */
1815 /* */
1816 /* This implements the IEEE special operator and therefore treats */
1817 /* special values as valid, and also never sets Inexact. For finite */
1818 /* numbers it returns rescale(rhs, 0) if rhs->exponent is <0. */
1819 /* Otherwise the result is rhs (so no error is possible). */
1820 /* */
1821 /* The context is used for rounding mode and status after sNaN, but */
1822 /* the digits setting is ignored. */
1823 /* ------------------------------------------------------------------ */
1824 decNumber *
1826 {
1827 decNumber dn;
1830 #if DECCHECK
1833 #endif
1835 /* handle infinities and NaNs */
1837 {
1841 else
1846 }
1848 /* we have a finite number; no error possible */
1851 /* that was easy, but if negative exponent we have work to do... */
1857 }
1859 /* ================================================================== */
1860 /* Utility routines */
1861 /* ================================================================== */
1863 /* ------------------------------------------------------------------ */
1864 /* decNumberCopy -- copy a number */
1865 /* */
1866 /* dest is the target decNumber */
1867 /* src is the source decNumber */
1868 /* returns dest */
1869 /* */
1870 /* (dest==src is allowed and is a no-op) */
1871 /* All fields are updated as required. This is a utility operation, */
1872 /* so special values are unchanged and no error is possible. */
1873 /* ------------------------------------------------------------------ */
1874 decNumber *
1876 {
1878 #if DECCHECK
1881 #endif
1886 /* We use explicit assignments here as structure assignment can copy */
1887 /* more than just the lsu (for small DECDPUN). This would not affect */
1888 /* the value of the results, but would disturb test harness spill */
1889 /* checking. */
1898 /* memcpy for the remaining Units would be safe as they cannot */
1899 /* overlap. However, this explicit loop is faster in short cases. */
1904 }
1906 }
1908 /* ------------------------------------------------------------------ */
1909 /* decNumberTrim -- remove insignificant zeros */
1910 /* */
1911 /* dn is the number to trim */
1912 /* returns dn */
1913 /* */
1914 /* All fields are updated as required. This is a utility operation, */
1915 /* so special values are unchanged and no error is possible. */
1916 /* ------------------------------------------------------------------ */
1917 decNumber *
1919 {
1922 }
1924 /* ------------------------------------------------------------------ */
1925 /* decNumberVersion -- return the name and version of this module */
1926 /* */
1927 /* No error is possible. */
1928 /* ------------------------------------------------------------------ */
1931 {
1933 }
1935 /* ------------------------------------------------------------------ */
1936 /* decNumberZero -- set a number to 0 */
1937 /* */
1938 /* dn is the number to set, with space for one digit */
1939 /* returns dn */
1940 /* */
1941 /* No error is possible. */
1942 /* ------------------------------------------------------------------ */
1943 /* Memset is not used as it is much slower in some environments. */
1944 decNumber *
1946 {
1948 #if DECCHECK
1951 #endif
1958 }
1960 /* ================================================================== */
1961 /* Local routines */
1962 /* ================================================================== */
1964 /* ------------------------------------------------------------------ */
1965 /* decToString -- lay out a number into a string */
1966 /* */
1967 /* dn is the number to lay out */
1968 /* string is where to lay out the number */
1969 /* eng is 1 if Engineering, 0 if Scientific */
1970 /* */
1971 /* str must be at least dn->digits+14 characters long */
1972 /* No error is possible. */
1973 /* */
1974 /* Note that this routine can generate a -0 or 0.000. These are */
1975 /* never generated in subset to-number or arithmetic, but can occur */
1976 /* in non-subset arithmetic (e.g., -1*0 or 1.234-1.234). */
1977 /* ------------------------------------------------------------------ */
1978 /* If DECCHECK is enabled the string "?" is returned if a number is */
1979 /* invalid. */
1981 /* TODIGIT -- macro to remove the leading digit from the unsigned */
1982 /* integer u at column cut (counting from the right, LSD=0) and place */
1983 /* it as an ASCII character into the character pointed to by c. Note */
1984 /* that cut must be <= 9, and the maximum value for u is 2,000,000,000 */
1985 /* (as is needed for negative exponents of subnormals). The unsigned */
1986 /* integer pow is used as a temporary variable. */
1987 #define TODIGIT(u, cut, c) { \
1989 pow=powers[cut]*2; \
1990 if ((u)>pow) { \
1991 pow*=4; \
1992 if ((u)>=pow) {(u)-=pow; *(c)+=8;} \
1993 pow/=2; \
1994 if ((u)>=pow) {(u)-=pow; *(c)+=4;} \
1995 pow/=2; \
1996 } \
1997 if ((u)>=pow) {(u)-=pow; *(c)+=2;} \
1998 pow/=2; \
1999 if ((u)>=pow) {(u)-=pow; *(c)+=1;} \
2000 }
2002 static void
2004 {
2013 #if DECCHECK
2015 {
2018 }
2019 #endif
2024 c++;
2025 }
2029 {
2032 }
2033 /* a NaN */
2037 c++;
2038 }
2041 /* if not a clean non-zero coefficient, that's all we have in a */
2042 /* NaN string */
2045 /* [drop through to add integer] */
2046 }
2048 /* calculate how many digits in msu, and hence first cut */
2056 /* used for NaNs, too] */
2063 }
2066 }
2068 /* non-0 exponent -- assume plain form */
2078 /* The C remainder operator is undefined for negative numbers, so */
2079 /* we must use positive remainder calculation here */
2081 {
2085 }
2086 else
2089 }
2091 /* if we are dealing with zero we will use exponent which is a */
2092 /* multiple of three, as expected, but there will only be the */
2093 /* one zero before the E, still. Otherwise note the padding. */
2096 else
2102 }
2105 }
2107 /* lay out the digits of the coefficient, adding 0s and . as needed */
2112 {
2117 up--;
2120 }
2122 }
2126 c++;
2128 {
2133 up--;
2136 }
2138 }
2139 }
2140 else
2143 }
2144 else
2147 c++;
2149 c++;
2153 {
2158 up--;
2161 }
2163 }
2164 }
2166 /* Finally add the E-part, if needed. It will never be 0, has a
2167 base maximum and minimum of +999999999 through -999999999, but
2168 could range down to -1999999998 for subnormal numbers */
2170 {
2173 c++;
2178 {
2181 }
2182 /* layout the exponent (_itoa is not ANSI C) */
2184 {
2191 }
2194 }
2196 /* ------------------------------------------------------------------ */
2197 /* decAddOp -- add/subtract operation */
2198 /* */
2199 /* This computes C = A + B */
2200 /* */
2201 /* res is C, the result. C may be A and/or B (e.g., X=X+X) */
2202 /* lhs is A */
2203 /* rhs is B */
2204 /* set is the context */
2205 /* negate is DECNEG if rhs should be negated, or 0 otherwise */
2206 /* status accumulates status for the caller */
2207 /* */
2208 /* C must have space for set->digits digits. */
2209 /* ------------------------------------------------------------------ */
2210 /* If possible, we calculate the coefficient directly into C. */
2211 /* However, if: */
2212 /* -- we need a digits+1 calculation because numbers are unaligned */
2213 /* and span more than set->digits digits */
2214 /* -- a carry to digits+1 digits looks possible */
2215 /* -- C is the same as A or B, and the result would destructively */
2216 /* overlap the A or B coefficient */
2217 /* then we must calculate into a temporary buffer. In this latter */
2218 /* case we use the local (stack) buffer if possible, and only if too */
2219 /* long for that do we resort to malloc. */
2220 /* */
2221 /* Misalignment is handled as follows: */
2222 /* Apad: (AExp>BExp) Swap operands and proceed as for BExp>AExp. */
2223 /* BPad: Apply the padding by a combination of shifting (whole */
2224 /* units) and multiplication (part units). */
2225 /* */
2226 /* Addition, especially x=x+1, is speed-critical, so we take pains */
2227 /* to make returning as fast as possible, by flagging any allocation. */
2228 /* ------------------------------------------------------------------ */
2232 {
2243 /* final carry digit or DECBUFFER=0] */
2250 #if DECCHECK
2253 #endif
2255 do
2257 #if DECSUBSET
2259 {
2260 /* reduce operands and set lostDigits status, as needed */
2262 {
2268 }
2270 {
2276 }
2277 }
2278 #endif
2279 /* [following code does not require input rounding] */
2281 /* note whether signs differ */
2284 /* handle infinities and NaNs */
2290 else
2294 /* two infinities with different signs is invalid */
2296 {
2299 }
2301 }
2302 else
2309 }
2311 /* Quick exit for add 0s; return the non-0, modified as need be */
2313 {
2320 #if DECSUBSET
2323 #endif
2324 /* exponent will be the lower of the two */
2330 /* 0-0 gives +0 unless rounding to -infinity, and -0-0 gives -0 */
2332 {
2335 else
2337 }
2338 }
2339 else
2344 {
2347 }
2351 }
2353 #if DECSUBSET
2355 #endif
2358 }
2367 #if DECSUBSET
2370 #endif
2371 /* exponent will be the lower of the two */
2372 /* [0-0 case handled above] */
2377 {
2380 }
2384 }
2385 #if DECSUBSET
2387 #endif
2390 }
2391 /* [both fastpath and mainpath code below assume these cases */
2392 /* (notably 0-0) have already been handled] */
2394 /* calculate the padding needed to align the operands */
2397 /* Fastpath cases where the numbers are aligned and normal, the RHS */
2398 /* is all in one unit, no operand rounding is needed, and no carry, */
2399 /* lengthening, or borrow is needed */
2400 if (rhs->digits <= DECDPUN && padding == 0 && rhs->exponent >= set->emin /* [some normals drop through] */
2402 {
2416 }
2417 /* else drop out for careful add */
2418 }
2419 else
2427 /* this could have reduced digits [but result>0] */
2430 }
2431 /* else drop out for careful subtract */
2432 }
2433 }
2435 /* Now align (pad) the lhs or rhs so we can add or subtract them, as
2436 necessary. If one number is much larger than the other (that is,
2437 if in plain form there is a least one digit between the lowest
2438 digit or one and the highest of the other) we need to pad with up
2439 to DIGITS-1 trailing zeros, and then apply rounding (as exotic
2440 rounding modes may be affected by the residue).
2441 */
2446 /* if padding==0 the operands are aligned; no padding needed */
2448 {
2449 /* some padding needed */
2450 /* We always pad the RHS, as we can then effect any required */
2451 /* padding by a combination of shifts and a multiply */
2462 }
2464 /* If, after pad, rhs would be longer than lhs by digits+1 or */
2465 /* more then lhs cannot affect the answer, except as a residue, */
2466 /* so we only need to pad up to a length of DIGITS+1. */
2468 {
2469 /* The RHS is sufficient */
2470 /* for residue we use the relative sign indication... */
2475 /* copy, shortening if necessary */
2477 /* if it was already shorter, then need to pad with zeros */
2479 {
2482 }
2483 /* flip the result sign if unswapped and rhs was negated */
2488 }
2490 /* LHS digits may affect result */
2498 /* determine the longer operand */
2503 /* Decide on the result buffer to use; if possible place directly */
2504 /* into result. */
2506 /* If destructive overlap, or the number is too long, or a carry or */
2507 /* borrow to DIGITS+1 might be possible we must use a buffer. */
2508 /* [Might be worth more sophisticated tests when maxdigits==reqdigits] */
2512 /* buffer needed; choose it */
2513 /* we'll need units for maxdigits digits, +1 Unit for carry or borrow */
2517 {
2523 }
2526 }
2527 }
2532 #if DECTRACE
2536 #endif
2538 /* add [A+B*m] or subtract [A+B*(-m)] */
2539 res->digits = decUnitAddSub (lhs->lsu, D2U (lhs->digits), rhs->lsu, D2U (rhs->digits), rhsshift, acc, mult) * DECDPUN; /* [units -> digits] */
2544 }
2545 #if DECTRACE
2547 #endif
2549 /* If we used a buffer we need to copy back, possibly shortening */
2550 /* (If we didn't use buffer it must have fit, so can't need rounding */
2551 /* and residue must be 0.) */
2554 {
2555 #if DECSUBSET
2558 #endif
2559 /* remove leading zeros that we added due to rounding up to */
2560 /* integral Units -- before the test for rounding. */
2564 #if DECSUBSET
2565 }
2566 else
2568 /* We may have an underestimate. This only occurs when both */
2569 /* numbers fit in DECDPUN digits and we are padding with a */
2570 /* negative multiple (-10, -100...) and the top digit(s) become */
2571 /* 0. (This only matters if we are using X3.274 rules where the */
2572 /* leading zero could be included in the rounding.) */
2574 {
2577 }
2578 else
2579 {
2580 /* remove leading zeros that we added due to rounding up to */
2581 /* integral Units (but only those in excess of the original */
2582 /* maxdigits length, unless extended) before test for rounding. */
2584 {
2588 }
2589 }
2591 /* Now apply rounding if needed before removing leading zeros. */
2592 /* This is safe because subnormals are not a possibility */
2594 {
2597 }
2599 #endif
2602 /* strip leading zeros [these were left on in case of subset subtract] */
2605 /* apply checks and rounding */
2608 /* "When the sum of two operands with opposite signs is exactly */
2609 /* zero, the sign of that sum shall be '+' in all rounding modes */
2610 /* except round toward -Infinity, in which mode that sign shall be */
2611 /* '-'." [Subset zeros also never have '-', set by decFinish.] */
2613 #if DECSUBSET
2615 #endif
2617 {
2620 else
2622 }
2623 }
2627 {
2634 }
2636 }
2638 /* ------------------------------------------------------------------ */
2639 /* decDivideOp -- division operation */
2640 /* */
2641 /* This routine performs the calculations for all four division */
2642 /* operators (divide, divideInteger, remainder, remainderNear). */
2643 /* */
2644 /* C=A op B */
2645 /* */
2646 /* res is C, the result. C may be A and/or B (e.g., X=X/X) */
2647 /* lhs is A */
2648 /* rhs is B */
2649 /* set is the context */
2650 /* op is DIVIDE, DIVIDEINT, REMAINDER, or REMNEAR respectively. */
2651 /* status is the usual accumulator */
2652 /* */
2653 /* C must have space for set->digits digits. */
2654 /* */
2655 /* ------------------------------------------------------------------ */
2656 /* The underlying algorithm of this routine is the same as in the */
2657 /* 1981 S/370 implementation, that is, non-restoring long division */
2658 /* with bi-unit (rather than bi-digit) estimation for each unit */
2659 /* multiplier. In this pseudocode overview, complications for the */
2660 /* Remainder operators and division residues for exact rounding are */
2661 /* omitted for clarity. */
2662 /* */
2663 /* Prepare operands and handle special values */
2664 /* Test for x/0 and then 0/x */
2665 /* Exp =Exp1 - Exp2 */
2666 /* Exp =Exp +len(var1) -len(var2) */
2667 /* Sign=Sign1 * Sign2 */
2668 /* Pad accumulator (Var1) to double-length with 0's (pad1) */
2669 /* Pad Var2 to same length as Var1 */
2670 /* msu2pair/plus=1st 2 or 1 units of var2, +1 to allow for round */
2671 /* have=0 */
2672 /* Do until (have=digits+1 OR residue=0) */
2673 /* if exp<0 then if integer divide/residue then leave */
2674 /* this_unit=0 */
2675 /* Do forever */
2676 /* compare numbers */
2677 /* if <0 then leave inner_loop */
2678 /* if =0 then (* quick exit without subtract *) do */
2679 /* this_unit=this_unit+1; output this_unit */
2680 /* leave outer_loop; end */
2681 /* Compare lengths of numbers (mantissae): */
2682 /* If same then tops2=msu2pair -- {units 1&2 of var2} */
2683 /* else tops2=msu2plus -- {0, unit 1 of var2} */
2684 /* tops1=first_unit_of_Var1*10**DECDPUN +second_unit_of_var1 */
2685 /* mult=tops1/tops2 -- Good and safe guess at divisor */
2686 /* if mult=0 then mult=1 */
2687 /* this_unit=this_unit+mult */
2688 /* subtract */
2689 /* end inner_loop */
2690 /* if have\=0 | this_unit\=0 then do */
2691 /* output this_unit */
2692 /* have=have+1; end */
2693 /* var2=var2/10 */
2694 /* exp=exp-1 */
2695 /* end outer_loop */
2696 /* exp=exp+1 -- set the proper exponent */
2697 /* if have=0 then generate answer=0 */
2698 /* Return (Result is defined by Var1) */
2699 /* */
2700 /* ------------------------------------------------------------------ */
2701 /* We need two working buffers during the long division; one (digits+ */
2702 /* 1) to accumulate the result, and the other (up to 2*digits+1) for */
2703 /* long subtractions. These are acc and var1 respectively. */
2704 /* var1 is a copy of the lhs coefficient, var2 is the rhs coefficient.*/
2705 /* ------------------------------------------------------------------ */
2710 {
2747 #if DECSUBSET
2749 #endif
2751 #if DECCHECK
2754 #endif
2756 do
2758 #if DECSUBSET
2760 {
2761 /* reduce operands and set lostDigits status, as needed */
2763 {
2768 }
2770 {
2775 }
2776 }
2777 #endif
2778 /* [following code does not require input rounding] */
2782 /* handle infinities and NaNs */
2790 }
2791 /* one or two infinities */
2799 }
2800 /* [Note that infinity/0 raises no exceptions] */
2804 }
2805 else
2809 {
2810 /* result is [finished clone of] lhs */
2812 }
2813 else
2817 /* for DIVIDEINT the exponent is always 0. For DIVIDE, result */
2818 /* is a 0 with infinitely negative exponent, clamped to minimum */
2820 {
2823 }
2824 }
2827 }
2828 }
2830 /* handle 0 rhs (x/0) */
2834 {
2837 }
2838 else
2839 {
2843 else
2844 {
2847 }
2848 }
2850 }
2852 /* handle 0 lhs (0/x) */
2855 #if DECSUBSET
2858 else
2859 {
2860 #endif
2862 {
2869 }
2871 {
2874 }
2875 else
2881 }
2882 #if DECSUBSET
2883 }
2884 #endif
2886 }
2888 /* Precalculate exponent. This starts off adjusted (and hence fits */
2889 /* in 31 bits) and becomes the usual unadjusted exponent as the */
2890 /* division proceeds. The order of evaluation is important, here, */
2891 /* to avoid wrap. */
2892 exponent =
2895 /* If the working exponent is -ve, then some quick exits are */
2896 /* possible because the quotient is known to be <1 */
2897 /* [for REMNEAR, it needs to be < -1, as -0.5 could need work] */
2899 {
2901 {
2903 #if DECSUBSET
2905 #endif
2908 }
2909 /* we can fastpath remainders so long as the lhs has the */
2910 /* smaller (or equal) exponent */
2912 {
2914 {
2915 /* It is REMAINDER or safe REMNEAR; result is [finished */
2916 /* clone of] lhs (r = x - 0*y) */
2921 }
2922 /* [unsafe REMNEAR drops through] */
2923 }
2926 /* We need long (slow) division; roll up the sleeves... */
2928 /* The accumulator will hold the quotient of the division. */
2929 /* If it needs to be too long for stack storage, then allocate. */
2932 {
2938 }
2940 }
2942 /* var1 is the padded LHS ready for subtractions. */
2943 /* If it needs to be too long for stack storage, then allocate. */
2944 /* The maximum units we need for var1 (long subtraction) is: */
2945 /* Enough for */
2946 /* (rhs->digits+reqdigits-1) -- to allow full slide to right */
2947 /* or (lhs->digits) -- to allow for long lhs */
2948 /* whichever is larger */
2949 /* +1 -- for rounding of slide to right */
2950 /* +1 -- for leading 0s */
2951 /* +1 -- for pre-adjust if a remainder or DIVIDEINT */
2952 /* [Note: unused units do not participate in decUnitAddSub data] */
2957 /* allocate a guard unit above msu1 for REMAINDERNEAR */
2959 var1units++;
2961 {
2967 }
2969 }
2971 /* Extend the lhs and rhs to full long subtraction length. The lhs */
2972 /* is truly extended into the var1 buffer, with 0 padding, so we can */
2973 /* subtract in place. The rhs (var2) has virtual padding */
2974 /* (implemented by decUnitAddSub). */
2975 /* We allocated one guard unit above msu1 for rem=rem+rem in REMAINDERNEAR */
2983 /* rhs (var2) is left-aligned with var1 at the start */
2988 /* now set up the variables which we'll use for estimating the */
2989 /* multiplication factor. If these variables are not exact, we add */
2990 /* 1 to make sure that we never overestimate the multiplier. */
3000 }
3002 /* Since we are working in units, the units may have leading zeros, */
3003 /* but we calculated the exponent on the assumption that they are */
3004 /* both left-aligned. Adjust the exponent to compensate: add the */
3005 /* number of leading zeros in var1 msu and subtract those in var2 msu. */
3006 /* [We actually do this by counting the digits and negating, as */
3007 /* lead1=DECDPUN-digits1, and similarly for lead2.] */
3009 exponent--;
3011 exponent++;
3013 /* Now, if doing an integer divide or remainder, we want to ensure */
3014 /* that the result will be Unit-aligned. To do this, we shift the */
3015 /* var1 accumulator towards least if need be. (It's much easier to */
3016 /* do this now than to reassemble the residue afterwards, if we are */
3017 /* doing a remainder.) Also ensure the exponent is not negative. */
3019 {
3021 /* save the initial 'false' padding of var1, in digits */
3023 /* Determine the shift to do. */
3026 else
3031 /* clean any most-significant units we just emptied */
3035 else
3038 /* optimization: if the first iteration will just produce 0, */
3039 /* preadjust to skip it [valid for DIVIDE only] */
3041 {
3044 }
3045 }
3047 /* ---- start the long-division loops ------------------------------ */
3054 /* find the next unit */
3057 /* strip leading zero units [from either pre-adjust or from */
3058 /* subtract last time around]. Leave at least one unit. */
3060 var1units--;
3066 /* compare the two numbers, from msu */
3071 {
3072 /* v1=*pv1 -- always OK */
3080 }
3081 /* here when all inspected or a difference seen */
3086 /* reach here if var1 and var2 are identical; subtraction */
3087 /* would increase digit by one, and the residue will be 0 so */
3088 /* we are done; leave the loop with residue set to 0. */
3094 /* *pv1>v2. Prepare for real subtraction; the lengths are equal */
3095 /* Estimate the multiplier (there's always a msu1-1)... */
3096 /* Bring in two units of var2 to provide a good estimate. */
3097 mult =
3101 else
3103 /* The var2 msu is one unit towards the lsu of the var1 msu, */
3104 /* so we can only use one unit for var2. */
3105 mult =
3108 }
3111 /* subtraction needed; var1 is > var2 */
3113 /* subtract var1-var2, into var1; only the overlap needs */
3114 /* processing, as we are in place */
3116 #if DECTRACE
3120 #endif
3123 #if DECTRACE
3125 #endif
3126 /* var1 now probably has leading zeros; these are removed at the */
3127 /* top of the inner loop. */
3130 /* We have the next unit; unless it's a leading zero, add to acc */
3134 /* account exactly for the digits we got */
3136 {
3139 accdigits++;
3140 }
3141 else
3147 }
3149 /* if the residue is zero, we're done (unless divide or */
3150 /* divideInteger and we haven't got enough digits yet) */
3157 /* [drop through if divideInteger] */
3158 }
3159 /* we've also done enough if calculating remainder or integer */
3160 /* divide and we just did the last ('units') unit */
3164 /* to get here, var1 is less than var2, so divide var2 by the per- */
3165 /* Unit power of ten and go for the next digit */
3170 /* ---- division is complete --------------------------------------- */
3171 /* here: acc has at least reqdigits+1 of good results (or fewer */
3172 /* if early stop), starting at accnext+1 (its lsu) */
3173 /* var1 has any residue at the stopping point */
3174 /* accunits is the number of digits we collected in acc */
3180 }
3181 else
3183 /* accnext now -> lowest unit of result */
3187 {
3188 /* record the presence of any residue, for rounding */
3191 else
3193 /* We had an exact division; clean up spurious trailing 0s. */
3194 /* There will be at most DECDPUN-1, from the final multiply, */
3195 /* and then only if the result is non-0 (and even) and the */
3196 /* exponent is 'loose'. */
3197 #if DECDPUN>1
3200 {
3201 /* count the trailing zeros */
3207 #if DECDPUN<=4
3211 #else
3214 #endif
3215 exponent++;
3216 }
3218 {
3222 /* [exponent was adjusted in the loop] */
3223 }
3225 #endif
3229 {
3230 /* check for coefficient overflow */
3232 {
3235 }
3237 {
3238 /* [Here, the exponent will be 0, because we adjusted var1 */
3239 /* appropriately.] */
3245 /* Fastpath when residue is truly 0 is worthwhile [and */
3246 /* simplifies the code below] */
3253 #if DECSUBSET
3255 #endif
3258 }
3259 /* note if the quotient was odd */
3265 /* treat the residue, in var1, as the value to return, via acc */
3266 /* calculate the unused zero digits. This is the smaller of: */
3267 /* var1 initial padding (saved above) */
3268 /* var2 residual padding, which happens to be given by: */
3269 postshift =
3271 /* [the 'exponent' term accounts for the shifts during divide] */
3275 /* shift var1 the requested amount, and adjust its digits */
3286 /* Now correct the result if we are doing remainderNear; if it */
3287 /* (looking just at coefficients) is > rhs/2, or == rhs/2 and */
3288 /* the integer was odd then the result should be rem-rhs. */
3290 {
3295 /* calculate remainder*2 into the var1 buffer (which has */
3296 /* 'headroom' of an extra unit and hence enough space) */
3297 /* [a dedicated 'double' loop would be faster, here] */
3298 tarunits =
3301 /* decDumpAr('r', accnext, tarunits); */
3303 /* Here, accnext (var1) holds tarunits Units with twice the */
3304 /* remainder's coefficient, which we must now compare to the */
3305 /* RHS. The remainder's exponent may be smaller than the RHS's. */
3306 compare =
3314 }
3316 /* now restore the remainder by dividing by two; we know the */
3317 /* lsu is even. */
3319 {
3326 }
3327 /* [accunits still describes the original remainder length] */
3332 /* This is effectively causing round-up of the quotient, */
3333 /* so if it was the rare case where it was full and all */
3334 /* nines, it would overflow and hence division-impossible */
3335 /* should be raised */
3340 {
3342 {
3345 }
3346 else
3351 }
3356 {
3359 }
3361 /* we need rem-rhs; the sign will invert. Again we can */
3362 /* safely use var1 for the working Units array. */
3364 /* Calculate units and remainder from exponent. */
3367 /* subtract [A+B*(-m)]; the result will always be negative */
3374 /* [exponent is as for original remainder] */
3376 }
3381 /* Set exponent and bits */
3385 /* Now the coefficient. */
3390 #if DECSUBSET
3391 /* If a divide then strip trailing zeros if subset [after round] */
3394 #endif
3395 }
3407 }
3409 /* ------------------------------------------------------------------ */
3410 /* decMultiplyOp -- multiplication operation */
3411 /* */
3412 /* This routine performs the multiplication C=A x B. */
3413 /* */
3414 /* res is C, the result. C may be A and/or B (e.g., X=X*X) */
3415 /* lhs is A */
3416 /* rhs is B */
3417 /* set is the context */
3418 /* status is the usual accumulator */
3419 /* */
3420 /* C must have space for set->digits digits. */
3421 /* */
3422 /* ------------------------------------------------------------------ */
3423 /* Note: We use 'long' multiplication rather than Karatsuba, as the */
3424 /* latter would give only a minor improvement for the short numbers */
3425 /* we expect to handle most (and uses much more memory). */
3426 /* */
3427 /* We always have to use a buffer for the accumulator. */
3428 /* ------------------------------------------------------------------ */
3432 {
3448 #if DECCHECK
3451 #endif
3453 do
3455 #if DECSUBSET
3457 {
3458 /* reduce operands and set lostDigits status, as needed */
3460 {
3465 }
3467 {
3472 }
3473 }
3474 #endif
3475 /* [following code does not require input rounding] */
3477 /* precalculate result sign */
3480 /* handle infinities and NaNs */
3488 }
3489 /* one or two infinities. Infinity * 0 is invalid */
3492 {
3495 }
3499 }
3501 /* For best speed, as in DMSRCN, we use the shorter number as the */
3502 /* multiplier (rhs) and the longer as the multiplicand (lhs) */
3508 }
3510 /* if accumulator is too long for local storage, then allocate */
3513 {
3516 {
3519 }
3521 }
3523 /* Now the main long multiplication loop */
3524 /* Unlike the equivalent in the IBM Java implementation, there */
3525 /* is no advantage in calculating from msu to lsu. So we do it */
3526 /* by the book, as it were. */
3527 /* Each iteration calculates ACC=ACC+MULTAND*MULT */
3535 {
3536 /* Here, *mer is the next Unit in the multiplier to use */
3537 /* If non-zero [optimization] add it... */
3539 {
3540 accunits =
3543 }
3544 else
3546 /* [this avoids length of <=0 later] */
3548 accunits++;
3549 }
3550 /* multiply multiplicand by 10**DECDPUN for next Unit to left */
3553 #if DECTRACE
3554 /* Show exact result */
3556 #endif
3558 /* acc now contains the exact result of the multiplication */
3559 /* Build a decNumber from it, noting if any residue */
3563 /* We might have a 31-bit wrap in calculating the exponent. */
3564 /* This can only happen if both input exponents are negative and */
3565 /* both their magnitudes are large. If we did wrap, we set a safe */
3566 /* very negative exponent, from which decFinalize() will raise a */
3567 /* hard underflow. */
3573 /* Set the coefficient. If any rounding, residue records */
3577 }
3587 }
3589 /* ------------------------------------------------------------------ */
3590 /* decQuantizeOp -- force exponent to requested value */
3591 /* */
3592 /* This computes C = op(A, B), where op adjusts the coefficient */
3593 /* of C (by rounding or shifting) such that the exponent (-scale) */
3594 /* of C has the value B or matches the exponent of B. */
3595 /* The numerical value of C will equal A, except for the effects of */
3596 /* any rounding that occurred. */
3597 /* */
3598 /* res is C, the result. C may be A or B */
3599 /* lhs is A, the number to adjust */
3600 /* rhs is B, the requested exponent */
3601 /* set is the context */
3602 /* quant is 1 for quantize or 0 for rescale */
3603 /* status is the status accumulator (this can be called without */
3604 /* risk of control loss) */
3605 /* */
3606 /* C must have space for set->digits digits. */
3607 /* */
3608 /* Unless there is an error or the result is infinite, the exponent */
3609 /* after the operation is guaranteed to be that requested. */
3610 /* ------------------------------------------------------------------ */
3614 {
3624 #if DECCHECK
3627 #endif
3629 do
3631 #if DECSUBSET
3633 {
3634 /* reduce operands and set lostDigits status, as needed */
3636 {
3641 }
3648 }
3649 }
3650 #endif
3651 /* [following code does not require input rounding] */
3653 /* Handle special values */
3656 {
3657 /* NaNs get usual processing */
3660 /* one infinity but not both is bad */
3663 /* both infinity: return lhs */
3664 else
3667 }
3669 /* set requested exponent */
3672 else
3674 /* Original rhs must be an integer that fits and is in range */
3675 #if DECSUBSET
3677 #else
3679 #endif
3680 }
3682 #if DECSUBSET
3685 #endif
3693 }
3695 /* we've processed the RHS, so we can overwrite it now if necessary */
3700 #if DECSUBSET
3703 #endif
3704 }
3705 else
3708 /* if adjusted coefficient will not fit, give up now */
3710 {
3713 }
3717 /* this will decrease the length of the coefficient by adjust */
3718 /* digits, and must round as it does so */
3722 /* [note that the latter can be <1, here] */
3726 /* If we rounded a 999s case, exponent will be off by one; */
3727 /* adjust back if so. */
3729 {
3732 }
3733 #if DECSUBSET
3736 #endif
3740 /* this will increase the length of the coefficient by -adjust */
3741 /* digits, by adding trailing zeros. */
3743 /* if padding needed (adjust<0), add it now... */
3745 {
3749 }
3753 /* Check for overflow [do not use Finalize in this case, as an */
3754 /* overflow here is a "don't fit" situation] */
3759 }
3760 else
3761 {
3764 }
3765 }
3773 }
3775 /* ------------------------------------------------------------------ */
3776 /* decCompareOp -- compare, min, or max two Numbers */
3777 /* */
3778 /* This computes C = A ? B and returns the signum (as a Number) */
3779 /* for COMPARE or the maximum or minimum (for COMPMAX and COMPMIN). */
3780 /* */
3781 /* res is C, the result. C may be A and/or B (e.g., X=X?X) */
3782 /* lhs is A */
3783 /* rhs is B */
3784 /* set is the context */
3785 /* op is the operation flag */
3786 /* status is the usual accumulator */
3787 /* */
3788 /* C must have space for one digit for COMPARE or set->digits for */
3789 /* COMPMAX and COMPMIN. */
3790 /* ------------------------------------------------------------------ */
3791 /* The emphasis here is on speed for common cases, and avoiding */
3792 /* coefficient comparison if possible. */
3793 /* ------------------------------------------------------------------ */
3794 decNumber *
3797 {
3804 #if DECCHECK
3807 #endif
3809 do
3811 #if DECSUBSET
3813 {
3814 /* reduce operands and set lostDigits status, as needed */
3816 {
3819 {
3822 }
3824 }
3826 {
3829 {
3832 }
3834 }
3835 }
3836 #endif
3837 /* [following code does not require input rounding] */
3839 /* handle NaNs now; let infinities drop through */
3840 /* +++ review sNaN handling with 754r, for now assumes sNaN */
3841 /* (even just one) leads to NaN. */
3847 else
3849 /* here if MIN or MAX, and one or two quiet NaNs */
3851 else
3853 /* force choice to be the non-NaN operand */
3857 else
3860 }
3861 }
3865 }
3868 }
3873 else
3874 {
3880 else
3881 {
3885 }
3886 }
3888 else
3891 /* choose the operand for the result */
3895 /* choose according to sign then exponent (see 754r) */
3898 #if DECSUBSET
3903 }
3904 else
3905 #endif
3910 else
3912 }
3917 else
3919 /* [if equal, we use lhs, technically identical] */
3920 }
3921 else
3925 else
3927 /* [ditto] */
3928 }
3930 /* here result will be non-0 */
3934 /* copy chosen to result, rounding if need be */
3937 }
3938 }
3944 }
3946 /* ------------------------------------------------------------------ */
3947 /* decCompare -- compare two decNumbers by numerical value */
3948 /* */
3949 /* This routine compares A ? B without altering them. */
3950 /* */
3951 /* Arg1 is A, a decNumber which is not a NaN */
3952 /* Arg2 is B, a decNumber which is not a NaN */
3953 /* */
3954 /* returns -1, 0, or 1 for A<B, A==B, or A>B, or BADINT if failure */
3955 /* (the only possible failure is an allocation error) */
3956 /* ------------------------------------------------------------------ */
3957 /* This could be merged into decCompareOp */
3958 static Int
3960 {
3979 /* signums are the same */
3982 /* Both non-zero */
3990 }
3992 /* we must compare the coefficients, allowing for exponents */
3995 /* swap sides, and sign */
4000 }
4009 }
4011 /* ------------------------------------------------------------------ */
4012 /* decUnitCompare -- compare two >=0 integers in Unit arrays */
4013 /* */
4014 /* This routine compares A ? B*10**E where A and B are unit arrays */
4015 /* A is a plain integer */
4016 /* B has an exponent of E (which must be non-negative) */
4017 /* */
4018 /* Arg1 is A first Unit (lsu) */
4019 /* Arg2 is A length in Units */
4020 /* Arg3 is B first Unit (lsu) */
4021 /* Arg4 is B length in Units */
4022 /* Arg5 is E */
4023 /* */
4024 /* returns -1, 0, or 1 for A<B, A==B, or A>B, or BADINT if failure */
4025 /* (the only possible failure is an allocation error) */
4026 /* ------------------------------------------------------------------ */
4027 static Int
4029 {
4043 /* same number of units in both -- need unit-by-unit compare */
4047 {
4052 }
4056 /* Unaligned. If one is >1 unit longer than the other, padded */
4057 /* approximately, then we can return easily */
4063 /* We need to do a real subtract. For this, we need a result buffer */
4064 /* even though we only are interested in the sign. Its length needs */
4065 /* to be the larger of alength and padded blength, +2 */
4072 {
4077 }
4078 /* Calculate units and remainder from exponent. */
4081 /* subtract [A+B*(-m)] */
4084 /* [UnitAddSub result may have leading zeros, even on zero] */
4087 else
4089 /* check units of the result before freeing any storage */
4091 u++;
4093 }
4094 /* clean up and return the result */
4098 }
4100 /* ------------------------------------------------------------------ */
4101 /* decUnitAddSub -- add or subtract two >=0 integers in Unit arrays */
4102 /* */
4103 /* This routine performs the calculation: */
4104 /* */
4105 /* C=A+(B*M) */
4106 /* */
4107 /* Where M is in the range -DECDPUNMAX through +DECDPUNMAX. */
4108 /* */
4109 /* A may be shorter or longer than B. */
4110 /* */
4111 /* Leading zeros are not removed after a calculation. The result is */
4112 /* either the same length as the longer of A and B (adding any */
4113 /* shift), or one Unit longer than that (if a Unit carry occurred). */
4114 /* */
4115 /* A and B content are not altered unless C is also A or B. */
4116 /* C may be the same array as A or B, but only if no zero padding is */
4117 /* requested (that is, C may be B only if bshift==0). */
4118 /* C is filled from the lsu; only those units necessary to complete */
4119 /* the calculation are referenced. */
4120 /* */
4121 /* Arg1 is A first Unit (lsu) */
4122 /* Arg2 is A length in Units */
4123 /* Arg3 is B first Unit (lsu) */
4124 /* Arg4 is B length in Units */
4125 /* Arg5 is B shift in Units (>=0; pads with 0 units if positive) */
4126 /* Arg6 is C first Unit (lsu) */
4127 /* Arg7 is M, the multiplier */
4128 /* */
4129 /* returns the count of Units written to C, which will be non-zero */
4130 /* and negated if the result is negative. That is, the sign of the */
4131 /* returned Int is the sign of the result (positive for zero) and */
4132 /* the absolute value of the Int is the count of Units. */
4133 /* */
4134 /* It is the caller's responsibility to make sure that C size is */
4135 /* safe, allowing space if necessary for a one-Unit carry. */
4136 /* */
4137 /* This routine is severely performance-critical; *any* change here */
4138 /* must be measured (timed) to assure no performance degradation. */
4139 /* In particular, trickery here tends to be counter-productive, as */
4140 /* increased complexity of code hurts register optimizations on */
4141 /* register-poor architectures. Avoiding divisions is nearly */
4142 /* always a Good Idea, however. */
4143 /* */
4144 /* Special thanks to Rick McGuire (IBM Cambridge, MA) and Dave Clark */
4145 /* (IBM Warwick, UK) for some of the ideas used in this routine. */
4146 /* ------------------------------------------------------------------ */
4147 static Int
4150 {
4159 #endif
4161 #if DECTRACE
4164 #endif
4171 /* if in place [common], skip copy unless there's a gap [rare] */
4173 {
4176 }
4177 else
4182 else
4184 }
4185 }
4191 }
4193 /* For speed, we do the addition as two loops; the first where both A */
4194 /* and B contribute, and the second (if necessary) where only one or */
4195 /* other of the numbers contribute. */
4196 /* Carry handling is the same (i.e., duplicated) in each case. */
4198 {
4200 a++;
4203 /* here carry is new Unit of digits; it could be +ve or -ve */
4209 }
4210 /* remainder operator is undefined if negative, so we must test */
4213 {
4219 carry++;
4222 }
4223 /* negative case */
4230 carry++;
4232 #else
4238 }
4240 {
4244 }
4245 /* negative case */
4249 #endif
4252 /* we now may have one or other to complete */
4253 /* [pretest to avoid loop setup/shutdown] */
4256 {
4260 a++;
4261 }
4262 else
4265 b++;
4266 }
4267 /* here carry is new Unit of digits; it could be +ve or -ve and */
4268 /* magnitude up to DECDPUNMAX squared */
4274 }
4275 /* result for this unit is negative or >DECDPUNMAX */
4277 /* remainder is undefined if negative, so we must test */
4279 {
4285 carry++;
4288 }
4289 /* negative case */
4296 carry++;
4298 #else
4304 }
4305 /* remainder is undefined if negative, so we must test */
4307 {
4311 }
4312 /* negative case */
4316 #endif
4319 /* OK, all A and B processed; might still have carry or borrow */
4320 /* return number of Units in the result, negated if a borrow */
4328 }
4329 /* -ve carry: it's a borrow; complement needed */
4332 {
4335 {
4338 }
4339 else
4340 {
4343 }
4344 }
4345 /* add an extra unit iff it would be non-zero */
4346 #if DECTRACE
4348 #endif
4350 {
4353 }
4355 }
4357 /* ------------------------------------------------------------------ */
4358 /* decTrim -- trim trailing zeros or normalize */
4359 /* */
4360 /* dn is the number to trim or normalize */
4361 /* all is 1 to remove all trailing zeros, 0 for just fraction ones */
4362 /* dropped returns the number of discarded trailing zeros */
4363 /* returns dn */
4364 /* */
4365 /* All fields are updated as required. This is a utility operation, */
4366 /* so special values are unchanged and no error is possible. */
4367 /* ------------------------------------------------------------------ */
4370 {
4375 #if DECCHECK
4378 #endif
4388 }
4390 /* we have a finite number which is even */
4396 /* slice by powers */
4397 #if DECDPUN<=4
4401 #else
4404 #endif
4405 /* have a trailing 0 */
4408 /* [if exp>0 then all trailing 0s are significant for trim] */
4414 }
4415 }
4419 up++;
4421 }
4426 /* effect the drop */
4432 }
4434 /* ------------------------------------------------------------------ */
4435 /* decShiftToMost -- shift digits in array towards most significant */
4436 /* */
4437 /* uar is the array */
4438 /* digits is the count of digits in use in the array */
4439 /* shift is the number of zeros to pad with (least significant); */
4440 /* it must be zero or positive */
4441 /* */
4442 /* returns the new length of the integer in the array, in digits */
4443 /* */
4444 /* No overflow is permitted (that is, the uar array must be known to */
4445 /* be large enough to hold the result, after shifting). */
4446 /* ------------------------------------------------------------------ */
4447 static Int
4449 {
4461 }
4470 {
4471 /* split the source Unit and accumulate remainder for next */
4472 #if DECDPUN<=4
4476 #else
4479 #endif
4483 }
4484 /* propagate to one below and clear the rest */
4486 {
4489 }
4491 }
4493 /* ------------------------------------------------------------------ */
4494 /* decShiftToLeast -- shift digits in array towards least significant */
4495 /* */
4496 /* uar is the array */
4497 /* units is length of the array, in units */
4498 /* shift is the number of digits to remove from the lsu end; it */
4499 /* must be zero or positive and less than units*DECDPUN. */
4500 /* */
4501 /* returns the new length of the integer in the array, in units */
4502 /* */
4503 /* Removed digits are discarded (lost). Units not required to hold */
4504 /* the final result are unchanged. */
4505 /* ------------------------------------------------------------------ */
4506 static Int
4508 {
4524 }
4525 /* messier */
4527 #if DECDPUN<=4
4529 #else
4531 #endif
4533 {
4538 up++;
4540 #if DECDPUN<=4
4543 #else
4546 #endif
4551 }
4553 }
4555 #if DECSUBSET
4556 /* ------------------------------------------------------------------ */
4557 /* decRoundOperand -- round an operand [used for subset only] */
4558 /* */
4559 /* dn is the number to round (dn->digits is > set->digits) */
4560 /* set is the relevant context */
4561 /* status is the status accumulator */
4562 /* */
4563 /* returns an allocated decNumber with the rounded result. */
4564 /* */
4565 /* lostDigits and other status may be set by this. */
4566 /* */
4567 /* Since the input is an operand, we are not permitted to modify it. */
4568 /* We therefore return an allocated decNumber, rounded as required. */
4569 /* It is the caller's responsibility to free the allocated storage. */
4570 /* */
4571 /* If no storage is available then the result cannot be used, so NULL */
4572 /* is returned. */
4573 /* ------------------------------------------------------------------ */
4576 {
4581 /* Allocate storage for the returned decNumber, big enough for the */
4582 /* length specified by the context */
4586 {
4589 }
4593 /* If that set Inexact then we "lost digits" */
4598 }
4599 #endif
4601 /* ------------------------------------------------------------------ */
4602 /* decCopyFit -- copy a number, shortening the coefficient if needed */
4603 /* */
4604 /* dest is the target decNumber */
4605 /* src is the source decNumber */
4606 /* set is the context [used for length (digits) and rounding mode] */
4607 /* residue is the residue accumulator */
4608 /* status contains the current status to be updated */
4609 /* */
4610 /* (dest==src is allowed and will be a no-op if fits) */
4611 /* All fields are updated as required. */
4612 /* ------------------------------------------------------------------ */
4613 static void
4616 {
4620 }
4622 /* ------------------------------------------------------------------ */
4623 /* decSetCoeff -- set the coefficient of a number */
4624 /* */
4625 /* dn is the number whose coefficient array is to be set. */
4626 /* It must have space for set->digits digits */
4627 /* set is the context [for size] */
4628 /* lsu -> lsu of the source coefficient [may be dn->lsu] */
4629 /* len is digits in the source coefficient [may be dn->digits] */
4630 /* residue is the residue accumulator. This has values as in */
4631 /* decApplyRound, and will be unchanged unless the */
4632 /* target size is less than len. In this case, the */
4633 /* coefficient is truncated and the residue is updated to */
4634 /* reflect the previous residue and the dropped digits. */
4635 /* status is the status accumulator, as usual */
4636 /* */
4637 /* The coefficient may already be in the number, or it can be an */
4638 /* external intermediate array. If it is in the number, lsu must == */
4639 /* dn->lsu and len must == dn->digits. */
4640 /* */
4641 /* Note that the coefficient length (len) may be < set->digits, and */
4642 /* in this case this merely copies the coefficient (or is a no-op */
4643 /* if dn->lsu==lsu). */
4644 /* */
4645 /* Note also that (only internally, from decNumberRescale and */
4646 /* decSetSubnormal) the value of set->digits may be less than one, */
4647 /* indicating a round to left. */
4648 /* This routine handles that case correctly; caller ensures space. */
4649 /* */
4650 /* dn->digits, dn->lsu (and as required), and dn->exponent are */
4651 /* updated as necessary. dn->bits (sign) is unchanged. */
4652 /* */
4653 /* DEC_Rounded status is set if any digits are discarded. */
4654 /* DEC_Inexact status is set if any non-zero digits are discarded, or */
4655 /* incoming residue was non-0 (implies rounded) */
4656 /* ------------------------------------------------------------------ */
4657 /* mapping array: maps 0-9 to canonical residues, so that we can */
4658 /* adjust by a residue in range [-1, +1] and achieve correct rounding */
4659 /* 0 1 2 3 4 5 6 7 8 9 */
4661 static void
4664 {
4672 #if DECDPUN<=4
4674 #endif
4681 /* copy the coefficient array to the result number; no shift needed */
4684 {
4686 }
4688 }
4689 /* dn->exponent and residue are unchanged */
4693 }
4695 /* we have to discard some digits */
4702 /* guard digit is 0 */
4703 /* residue is all the number [NB could be all 0s] */
4706 {
4711 }
4712 }
4721 /* partial discard [most common case] */
4722 /* here, at least the first (most significant) discarded digit exists */
4724 /* spin up the number, noting residue as we pass, until we get to */
4725 /* the Unit with the first discarded digit. When we get there, */
4726 /* extract it and remember where we're at */
4729 {
4737 /* here up -> Unit with discarded digit */
4741 #if DECDPUN<=4
4744 #else
4747 #endif
4753 }
4754 else
4755 {
4756 /* discard digit is in low digit(s), not top digit */
4761 #if DECDPUN<=4
4764 #else
4767 #endif
4770 }
4771 /* discard digit is now at bottom of quot */
4772 #if DECDPUN<=4
4774 /* Vowels algorithm here not a win (9 instructions) */
4777 #else
4780 #endif
4782 }
4784 /* here: up -> Unit of the array with discarded digit */
4785 /* cut is the division point for each Unit */
4786 /* quot holds the uncut high-order digits for the current */
4787 /* Unit, unless cut==0 in which case it's still in *up */
4788 /* copy the coefficient array to the result number, shifting as we go */
4794 }
4795 else
4797 /* [this is similar to decShiftToLeast code, with copy] */
4800 {
4801 /* on unit boundary, so simple shift down copy loop suffices */
4804 {
4806 }
4807 }
4808 else
4810 {
4815 up++;
4817 #if DECDPUN<=4
4820 #else
4823 #endif
4828 }
4832 /* here, discard1 is the guard digit, and residue is everything else */
4833 /* [use mapping to accumulate residue safely] */
4839 }
4841 /* ------------------------------------------------------------------ */
4842 /* decApplyRound -- apply pending rounding to a number */
4843 /* */
4844 /* dn is the number, with space for set->digits digits */
4845 /* set is the context [for size and rounding mode] */
4846 /* residue indicates pending rounding, being any accumulated */
4847 /* guard and sticky information. It may be: */
4848 /* 6-9: rounding digit is >5 */
4849 /* 5: rounding digit is exactly half-way */
4850 /* 1-4: rounding digit is <5 and >0 */
4851 /* 0: the coefficient is exact */
4852 /* -1: as 1, but the hidden digits are subtractive, that */
4853 /* is, of the opposite sign to dn. In this case the */
4854 /* coefficient must be non-0. */
4855 /* status is the status accumulator, as usual */
4856 /* */
4857 /* This routine applies rounding while keeping the length of the */
4858 /* coefficient constant. The exponent and status are unchanged */
4859 /* except if: */
4860 /* */
4861 /* -- the coefficient was increased and is all nines (in which */
4862 /* case Overflow could occur, and is handled directly here so */
4863 /* the caller does not need to re-test for overflow) */
4864 /* */
4865 /* -- the coefficient was decreased and becomes all nines (in which */
4866 /* case Underflow could occur, and is also handled directly). */
4867 /* */
4868 /* All fields in dn are updated as required. */
4869 /* */
4870 /* ------------------------------------------------------------------ */
4871 static void
4873 {
4875 /* -1 if coefficient needs to be decremented */
4882 /* now decide whether, and how, to round, depending on mode */
4884 {
4886 {
4887 /* no change, except if negative residue */
4894 {
4901 {
4906 /* 0.5 goes up iff [new] lsd is odd */
4909 }
4914 {
4921 {
4928 {
4929 /* same as _UP for positive numbers, and as _DOWN for negatives */
4930 /* [negative residue cannot occur on 0] */
4932 {
4935 }
4936 else
4937 {
4940 }
4945 {
4946 /* same as _UP for negative numbers, and as _DOWN for positive */
4947 /* [negative residue cannot occur on 0] */
4949 {
4952 }
4953 else
4954 {
4957 }
4964 #if DECTRACE
4966 #endif
4968 }
4971 /* now bump the number, up or down, if need be */
4975 /* Simply use decUnitAddSub unless we are bumping up and the number */
4976 /* is all nines. In this special case we set to 1000... and adjust */
4977 /* the exponent by one (as otherwise we could overflow the array) */
4978 /* Similarly handle all-nines result if bumping down. */
4980 {
4984 {
4986 {
4987 /* this is the last Unit (the msu) */
4990 /* here if it, too, is all nines */
4995 /* [which, very rarely, could cause Overflow...] */
4997 {
4999 }
5001 }
5002 /* a full unit to check, with more to come */
5008 else
5010 /* here we are lookng for a pre-bump of 1000... (leading 1, */
5011 /* all other digits zero) */
5015 {
5017 {
5018 /* this is the last Unit (the msu) */
5021 /* here if we have the 1000... case */
5024 /* others all to all-nines, too */
5029 /* iff the number was at the subnormal boundary (exponent=etiny) */
5030 /* then the exponent is now out of range, so it will in fact get */
5031 /* clamped to etiny and the final 9 dropped. */
5032 /* printf(">> emin=%d exp=%d sdig=%d\n", set->emin, */
5033 /* dn->exponent, set->digits); */
5035 {
5038 else
5039 {
5042 }
5046 }
5048 }
5050 /* a full unit to check, with more to come */
5058 /* Actual bump needed. Do it. */
5060 }
5062 #if DECSUBSET
5063 /* ------------------------------------------------------------------ */
5064 /* decFinish -- finish processing a number */
5065 /* */
5066 /* dn is the number */
5067 /* set is the context */
5068 /* residue is the rounding accumulator (as in decApplyRound) */
5069 /* status is the accumulator */
5070 /* */
5071 /* This finishes off the current number by: */
5072 /* 1. If not extended: */
5073 /* a. Converting a zero result to clean '0' */
5074 /* b. Reducing positive exponents to 0, if would fit in digits */
5075 /* 2. Checking for overflow and subnormals (always) */
5076 /* Note this is just Finalize when no subset arithmetic. */
5077 /* All fields are updated as required. */
5078 /* ------------------------------------------------------------------ */
5079 static void
5081 {
5083 {
5084 if ISZERO
5090 }
5093 /* >0; reduce to integer if possible */
5095 {
5098 }
5099 }
5103 }
5104 #endif
5106 /* ------------------------------------------------------------------ */
5107 /* decFinalize -- final check, clamp, and round of a number */
5108 /* */
5109 /* dn is the number */
5110 /* set is the context */
5111 /* residue is the rounding accumulator (as in decApplyRound) */
5112 /* status is the status accumulator */
5113 /* */
5114 /* This finishes off the current number by checking for subnormal */
5115 /* results, applying any pending rounding, checking for overflow, */
5116 /* and applying any clamping. */
5117 /* Underflow and overflow conditions are raised as appropriate. */
5118 /* All fields are updated as required. */
5119 /* ------------------------------------------------------------------ */
5120 static void
5122 {
5125 /* We have to be careful when checking the exponent as the adjusted */
5126 /* exponent could overflow 31 bits [because it may already be up */
5127 /* to twice the expected]. */
5129 /* First test for subnormal. This must be done before any final */
5130 /* round as the result could be rounded to Nmin or 0. */
5133 {
5134 /* Go handle subnormals; this will apply round if needed. */
5137 }
5139 /* now apply any pending round (this could raise overflow). */
5143 /* Check for overflow [redundant in the 'rare' case] or clamp */
5147 /* here when we might have an overflow or clamp to do */
5152 }
5153 /* here when the result is normal but in clamp range */
5157 /* here when we need to apply the IEEE exponent clamp (fold-down) */
5160 /* shift coefficient (if non-zero) */
5162 {
5164 }
5168 }
5170 /* ------------------------------------------------------------------ */
5171 /* decSetOverflow -- set number to proper overflow value */
5172 /* */
5173 /* dn is the number (used for sign [only] and result) */
5174 /* set is the context [used for the rounding mode] */
5175 /* status contains the current status to be updated */
5176 /* */
5177 /* This sets the sign of a number and sets its value to either */
5178 /* Infinity or the maximum finite value, depending on the sign of */
5179 /* dn and therounding mode, following IEEE 854 rules. */
5180 /* ------------------------------------------------------------------ */
5181 static void
5183 {
5196 }
5198 }
5202 {
5204 {
5209 {
5215 {
5222 }
5224 {
5228 /* fill in all nines to set maximum value */
5230 {
5233 else
5237 }
5242 }
5243 else
5246 }
5248 /* ------------------------------------------------------------------ */
5249 /* decSetSubnormal -- process value whose exponent is <Emin */
5250 /* */
5251 /* dn is the number (used as input as well as output; it may have */
5252 /* an allowed subnormal value, which may need to be rounded) */
5253 /* set is the context [used for the rounding mode] */
5254 /* residue is any pending residue */
5255 /* status contains the current status to be updated */
5256 /* */
5257 /* If subset mode, set result to zero and set Underflow flags. */
5258 /* */
5259 /* Value may be zero with a low exponent; this does not set Subnormal */
5260 /* but the exponent will be clamped to Etiny. */
5261 /* */
5262 /* Otherwise ensure exponent is not out of range, and round as */
5263 /* necessary. Underflow is set if the result is Inexact. */
5264 /* ------------------------------------------------------------------ */
5265 static void
5268 {
5272 #if DECSUBSET
5273 /* simple set to zero and 'hard underflow' for subset */
5275 {
5277 /* always full overflow */
5280 }
5281 #endif
5283 /* Full arithmetic -- allow subnormals, rounded to minimum exponent */
5284 /* (Etiny) if needed */
5287 if ISZERO
5290 /* residue can never be non-zero here */
5291 #if DECCHECK
5293 {
5296 }
5297 #endif
5302 }
5304 }
5311 /* residue can never be non-zero here, so fast-path out */
5312 #if DECCHECK
5314 {
5317 }
5318 #endif
5319 /* it may already be inexact (from setting the coefficient) */
5323 }
5325 /* adjust>0. we need to rescale the result so exponent becomes Etiny */
5326 /* [this code is similar to that in rescale] */
5330 /* [note that the latter can be <1, here, similar to Rescale case] */
5334 /* Use 754R/854 default rule: Underflow is set iff Inexact */
5335 /* [independent of whether trapped] */
5339 /* if we rounded up a 999s case, exponent will be off by one; adjust */
5340 /* back if so [it will fit, because we shortened] */
5342 {
5345 }
5346 }
5348 /* ------------------------------------------------------------------ */
5349 /* decGetInt -- get integer from a number */
5350 /* */
5351 /* dn is the number [which will not be altered] */
5352 /* set is the context [requested digits], subset only */
5353 /* returns the converted integer, or BADINT if error */
5354 /* */
5355 /* This checks and gets a whole number from the input decNumber. */
5356 /* The magnitude of the integer must be <2^31. */
5357 /* Any discarded fractional part must be 0. */
5358 /* If subset it must also fit in set->digits */
5359 /* ------------------------------------------------------------------ */
5360 #if DECSUBSET
5361 static Int
5363 {
5364 #else
5365 static Int
5367 {
5368 #endif
5374 /* The number must be an integer that fits in 10 digits */
5375 /* Assert, here, that 10 is enough for any rescale Etiny */
5376 #if DEC_MAX_EMAX > 999999999
5377 #error GetInt may need updating [for Emax]
5378 #endif
5379 #if DEC_MIN_EMIN < -999999999
5380 #error GetInt may need updating [for Emin]
5381 #endif
5386 #if DECSUBSET
5389 #endif
5395 /* no fractional part [usual]; allow for positive exponent */
5397 }
5398 else
5401 /* spin up whole units until we get to the Unit with the unit digit */
5403 {
5407 }
5410 else
5413 /* slice off fraction digits and check for non-zero */
5414 #if DECDPUN<=4
5417 #else
5420 #endif
5423 /* OK, we're good */
5426 }
5427 }
5428 /* collect the rest */
5430 {
5433 }
5437 /* [that test also disallows the BADINT result case] */
5439 /* apply any sign and return */
5443 }
5445 /* ------------------------------------------------------------------ */
5446 /* decStrEq -- caseless comparison of strings */
5447 /* */
5448 /* str1 is one of the strings to compare */
5449 /* str2 is the other */
5450 /* */
5451 /* returns 1 if strings caseless-compare equal, 0 otherwise */
5452 /* */
5453 /* Note that the strings must be the same length if they are to */
5454 /* compare equal; there is no padding. */
5455 /* ------------------------------------------------------------------ */
5456 /* [strcmpi is not in ANSI C] */
5457 static Flag
5459 {
5461 {
5465 {
5468 }
5469 else
5470 {
5473 }
5476 }
5478 /* ------------------------------------------------------------------ */
5479 /* decNaNs -- handle NaN operand or operands */
5480 /* */
5481 /* res is the result number */
5482 /* lhs is the first operand */
5483 /* rhs is the second operand, or NULL if none */
5484 /* status contains the current status */
5485 /* returns res in case convenient */
5486 /* */
5487 /* Called when one or both operands is a NaN, and propagates the */
5488 /* appropriate result to res. When an sNaN is found, it is changed */
5489 /* to a qNaN and Invalid operation is set. */
5490 /* ------------------------------------------------------------------ */
5493 {
5494 /* This decision tree ends up with LHS being the source pointer, */
5495 /* and status updated if need be */
5500 {
5503 }
5505 else
5512 /* [coefficient was copied] */
5514 }
5516 /* ------------------------------------------------------------------ */
5517 /* decStatus -- apply non-zero status */
5518 /* */
5519 /* dn is the number to set if error */
5520 /* status contains the current status (not yet in context) */
5521 /* set is the context */
5522 /* */
5523 /* If the status is an error status, the number is set to a NaN, */
5524 /* unless the error was an overflow, divide-by-zero, or underflow, */
5525 /* in which case the number will have already been set. */
5526 /* */
5527 /* The context status is then updated with the new status. Note that */
5528 /* this may raise a signal, so control may never return from this */
5529 /* routine (hence resources must be recovered before it is called). */
5530 /* ------------------------------------------------------------------ */
5531 static void
5533 {
5536 /* if cause was an sNaN, clear and propagate [NaN is already set up] */
5539 else
5540 {
5543 }
5544 }
5547 }
5549 /* ------------------------------------------------------------------ */
5550 /* decGetDigits -- count digits in a Units array */
5551 /* */
5552 /* uar is the Unit array holding the number [this is often an */
5553 /* accumulator of some sort] */
5554 /* len is the length of the array in units */
5555 /* */
5556 /* returns the number of (significant) digits in the array */
5557 /* */
5558 /* All leading zeros are excluded, except the last if the array has */
5559 /* only zero Units. */
5560 /* ------------------------------------------------------------------ */
5561 /* This may be called twice during some operations. */
5562 static Int
5564 {
5570 {
5576 /* all units were 0 */
5579 }
5580 /* found the first non-zero Unit */
5581 digits++;
5584 digits++;
5586 digits++;
5591 }
5594 #if DECTRACE | DECCHECK
5595 /* ------------------------------------------------------------------ */
5596 /* decNumberShow -- display a number [debug aid] */
5597 /* dn is the number to show */
5598 /* */
5599 /* Shows: sign, exponent, coefficient (msu first), digits */
5600 /* or: sign, special-value */
5601 /* ------------------------------------------------------------------ */
5602 /* this is public so other modules can use it */
5603 void
5605 {
5611 {
5614 }
5622 else
5626 else
5628 }
5629 /* if coefficient and exponent are 0, we're done */
5631 {
5634 }
5635 /* drop through to report other information */
5637 }
5639 /* now carefully display the coefficient */
5643 {
5647 {
5654 {
5659 }
5661 }
5662 #endif
5664 #if DECTRACE || DECCHECK
5665 /* ------------------------------------------------------------------ */
5666 /* decDumpAr -- display a unit array [debug aid] */
5667 /* name is a single-character tag name */
5668 /* ar is the array to display */
5669 /* len is the length of the array in Units */
5670 /* ------------------------------------------------------------------ */
5671 static void
5673 {
5674 Int i;
5675 #if DECDPUN==4
5677 #else
5679 #endif
5682 {
5685 else
5687 }
5690 }
5691 #endif
5693 #if DECCHECK
5694 /* ------------------------------------------------------------------ */
5695 /* decCheckOperands -- check operand(s) to a routine */
5696 /* res is the result structure (not checked; it will be set to */
5697 /* quiet NaN if error found (and it is not NULL)) */
5698 /* lhs is the first operand (may be DECUNUSED) */
5699 /* rhs is the second (may be DECUNUSED) */
5700 /* set is the context (may be DECUNUSED) */
5701 /* returns 0 if both operands, and the context are clean, or 1 */
5702 /* otherwise (in which case the context will show an error, */
5703 /* unless NULL). Note that res is not cleaned; caller should */
5704 /* handle this so res=NULL case is safe. */
5705 /* The caller is expected to abandon immediately if 1 is returned. */
5706 /* ------------------------------------------------------------------ */
5707 static Flag
5710 {
5714 #if DECTRACE
5716 #endif
5719 }
5723 {
5725 #if DECTRACE
5727 #endif
5728 }
5729 else
5730 {
5732 {
5734 #if DECTRACE
5736 #endif
5737 }
5742 }
5744 {
5748 {
5751 }
5752 }
5754 }
5756 /* ------------------------------------------------------------------ */
5757 /* decCheckNumber -- check a number */
5758 /* dn is the number to check */
5759 /* set is the context (may be DECUNUSED) */
5760 /* returns 0 if the number is clean, or 1 otherwise */
5761 /* */
5762 /* The number is considered valid if it could be a result from some */
5763 /* operation in some valid context (not necessarily the current one). */
5764 /* ------------------------------------------------------------------ */
5765 Flag
5767 {
5775 #if DECTRACE
5777 #endif
5779 }
5781 /* check special values */
5783 {
5785 {
5786 #if DECTRACE
5788 #endif
5790 }
5792 /* 2003.09.08: NaNs may now have coefficients, so next tests Inf only */
5794 {
5796 {
5797 #if DECTRACE
5799 #endif
5801 }
5803 {
5804 #if DECTRACE
5806 #endif
5808 }
5810 /* 2002.12.26: negative NaNs can now appear through proposed IEEE */
5811 /* concrete formats (decimal64, etc.), though they are */
5812 /* never visible in strings. */
5815 /* if ((dn->bits & DECINF) || (dn->bits & DECNEG)==0) return 0; */
5816 /* #if DECTRACE */
5817 /* printf("Negative NaN in number.\n"); */
5818 /* #endif */
5819 /* return 1; */
5820 }
5822 /* check the coefficient */
5824 {
5825 #if DECTRACE
5827 #endif
5829 }
5834 {
5837 else
5841 {
5842 #if DECTRACE
5845 #endif
5847 }
5848 }
5850 {
5851 #if DECTRACE
5854 #endif
5856 }
5858 }
5860 /* check the exponent. Note that input operands can have exponents */
5861 /* which are out of the set->emin/set->emax and set->digits range */
5862 /* (just as they can have more digits than set->digits). */
5868 {
5869 #if DECTRACE
5872 #endif
5874 }
5876 {
5877 #if DECTRACE
5880 #endif
5882 }
5885 }
5886 #endif
5888 #if DECALLOC
5889 #undef malloc
5890 #undef free
5891 /* ------------------------------------------------------------------ */
5892 /* decMalloc -- accountable allocation routine */
5893 /* n is the number of bytes to allocate */
5894 /* */
5895 /* Semantics is the same as the stdlib malloc routine, but bytes */
5896 /* allocated are accounted for globally, and corruption fences are */
5897 /* added before and after the 'actual' storage. */
5898 /* ------------------------------------------------------------------ */
5899 /* This routine allocates storage with an extra twelve bytes; 8 are */
5900 /* at the start and hold: */
5901 /* 0-3 the original length requested */
5902 /* 4-7 buffer corruption detection fence (DECFENCE, x4) */
5903 /* The 4 bytes at the end also hold a corruption fence (DECFENCE, x4) */
5904 /* ------------------------------------------------------------------ */
5907 {
5920 /* printf("++ alloc(%d)\n", n); */
5926 }
5928 /* ------------------------------------------------------------------ */
5929 /* decFree -- accountable free routine */
5930 /* alloc is the storage to free */
5931 /* */
5932 /* Semantics is the same as the stdlib malloc routine, except that */
5933 /* the global storage accounting is updated and the fences are */
5934 /* checked to ensure that no routine has written 'out of bounds'. */
5935 /* ------------------------------------------------------------------ */
5936 /* This routine first checks that the fences have not been corrupted. */
5937 /* It then frees the storage using the 'truw' storage address (that */
5938 /* is, offset by 8). */
5939 /* ------------------------------------------------------------------ */
5940 static void
5942 {
5962 }
5963 #endif