<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en_US" xml:lang="en_US">
<head>
<title>kjs: dtoa.cpp Source File (kjs)</title>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<meta http-equiv="Content-Style-Type" content="text/css" />
<meta http-equiv="pics-label" content='(pics-1.1 "http://www.icra.org/ratingsv02.html" comment "ICRAonline DE v2.0" l gen true for "http://www.kde.org" r (nz 1 vz 1 lz 1 oz 1 cb 1) "http://www.rsac.org/ratingsv01.html" l gen true for "http://www.kde.org" r (n 0 s 0 v 0 l 0))' />
<meta name="trademark" content="KDE e.V." />
<meta name="description" content="K Desktop Environment Homepage, KDE.org" />
<meta name="MSSmartTagsPreventParsing" content="true" />
<meta name="robots" content="all" />
<link rel="shortcut icon" href="../../favicon.ico" />
<link rel="stylesheet" media="screen" type="text/css" title="APIDOX" href="doxygen.css" />
</head>
<body>
<div id="nav_header_top" align="right">
<a href="#content" class="doNotDisplay" accesskey="2">Skip to main content ::</a>
<a href="../.."><img id="nav_header_logo" alt="Home" align="left" src="../../kde_gear_64.png" border="0" /></a>
<span class="doNotDisplay">::</span>
<div id="nav_header_title" align="left">KDE API Reference</div>
</div>
<div id="nav_header_bottom" align="right">
<span class="doNotDisplay">:: <a href="#navigation" accesskey="5">Skip to Link Menu</a><br/></span>
<div id="nav_header_bottom_right" style="text-align: left;">
/ <a href="../..">API Reference</a>
/ <a href=".">kjs</a>
</div>
</div>
<table id="main" border="0" cellpadding="0" cellspacing="0" width="100%">
<tr>
<td valign="top" class="menuheader" height="0"></td>
<td id="contentcolumn" valign="top" rowspan="2" >
<div id="content" style="padding-top: 0px;"><div style="width:100%; margin: 0px; padding: 0px;">
<a name="content"></a>
<!-- Generated by Doxygen 1.7.4 -->
<div class="header">
<div class="headertitle">
<div class="title">dtoa.cpp</div> </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/****************************************************************</span>
<a name="l00002"></a>00002 <span class="comment"> *</span>
<a name="l00003"></a>00003 <span class="comment"> * The author of this software is David M. Gay.</span>
<a name="l00004"></a>00004 <span class="comment"> *</span>
<a name="l00005"></a>00005 <span class="comment"> * Copyright (c) 1991, 2000, 2001 by Lucent Technologies.</span>
<a name="l00006"></a>00006 <span class="comment"> *</span>
<a name="l00007"></a>00007 <span class="comment"> * Permission to use, copy, modify, and distribute this software for any</span>
<a name="l00008"></a>00008 <span class="comment"> * purpose without fee is hereby granted, provided that this entire notice</span>
<a name="l00009"></a>00009 <span class="comment"> * is included in all copies of any software which is or includes a copy</span>
<a name="l00010"></a>00010 <span class="comment"> * or modification of this software and in all copies of the supporting</span>
<a name="l00011"></a>00011 <span class="comment"> * documentation for such software.</span>
<a name="l00012"></a>00012 <span class="comment"> *</span>
<a name="l00013"></a>00013 <span class="comment"> * THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED</span>
<a name="l00014"></a>00014 <span class="comment"> * WARRANTY. IN PARTICULAR, NEITHER THE AUTHOR NOR LUCENT MAKES ANY</span>
<a name="l00015"></a>00015 <span class="comment"> * REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY</span>
<a name="l00016"></a>00016 <span class="comment"> * OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.</span>
<a name="l00017"></a>00017 <span class="comment"> *</span>
<a name="l00018"></a>00018 <span class="comment"> ***************************************************************/</span>
<a name="l00019"></a>00019
<a name="l00020"></a>00020 <span class="comment">/* Please send bug reports to</span>
<a name="l00021"></a>00021 <span class="comment"> David M. Gay</span>
<a name="l00022"></a>00022 <span class="comment"> Bell Laboratories, Room 2C-463</span>
<a name="l00023"></a>00023 <span class="comment"> 600 Mountain Avenue</span>
<a name="l00024"></a>00024 <span class="comment"> Murray Hill, NJ 07974-0636</span>
<a name="l00025"></a>00025 <span class="comment"> U.S.A.</span>
<a name="l00026"></a>00026 <span class="comment"> dmg@bell-labs.com</span>
<a name="l00027"></a>00027 <span class="comment"> */</span>
<a name="l00028"></a>00028
<a name="l00029"></a>00029 <span class="comment">/* On a machine with IEEE extended-precision registers, it is</span>
<a name="l00030"></a>00030 <span class="comment"> * necessary to specify double-precision (53-bit) rounding precision</span>
<a name="l00031"></a>00031 <span class="comment"> * before invoking strtod or dtoa. If the machine uses (the equivalent</span>
<a name="l00032"></a>00032 <span class="comment"> * of) Intel 80x87 arithmetic, the call</span>
<a name="l00033"></a>00033 <span class="comment"> * _control87(PC_53, MCW_PC);</span>
<a name="l00034"></a>00034 <span class="comment"> * does this with many compilers. Whether this or another call is</span>
<a name="l00035"></a>00035 <span class="comment"> * appropriate depends on the compiler; for this to work, it may be</span>
<a name="l00036"></a>00036 <span class="comment"> * necessary to #include "float.h" or another system-dependent header</span>
<a name="l00037"></a>00037 <span class="comment"> * file.</span>
<a name="l00038"></a>00038 <span class="comment"> */</span>
<a name="l00039"></a>00039
<a name="l00040"></a>00040 <span class="comment">/* strtod for IEEE-, VAX-, and IBM-arithmetic machines.</span>
<a name="l00041"></a>00041 <span class="comment"> *</span>
<a name="l00042"></a>00042 <span class="comment"> * This strtod returns a nearest machine number to the input decimal</span>
<a name="l00043"></a>00043 <span class="comment"> * string (or sets errno to ERANGE). With IEEE arithmetic, ties are</span>
<a name="l00044"></a>00044 <span class="comment"> * broken by the IEEE round-even rule. Otherwise ties are broken by</span>
<a name="l00045"></a>00045 <span class="comment"> * biased rounding (add half and chop).</span>
<a name="l00046"></a>00046 <span class="comment"> *</span>
<a name="l00047"></a>00047 <span class="comment"> * Inspired loosely by William D. Clinger's paper "How to Read Floating</span>
<a name="l00048"></a>00048 <span class="comment"> * Point Numbers Accurately" [Proc. ACM SIGPLAN '90, pp. 92-101].</span>
<a name="l00049"></a>00049 <span class="comment"> *</span>
<a name="l00050"></a>00050 <span class="comment"> * Modifications:</span>
<a name="l00051"></a>00051 <span class="comment"> *</span>
<a name="l00052"></a>00052 <span class="comment"> * 1. We only require IEEE, IBM, or VAX double-precision</span>
<a name="l00053"></a>00053 <span class="comment"> * arithmetic (not IEEE double-extended).</span>
<a name="l00054"></a>00054 <span class="comment"> * 2. We get by with floating-point arithmetic in a case that</span>
<a name="l00055"></a>00055 <span class="comment"> * Clinger missed -- when we're computing d * 10^n</span>
<a name="l00056"></a>00056 <span class="comment"> * for a small integer d and the integer n is not too</span>
<a name="l00057"></a>00057 <span class="comment"> * much larger than 22 (the maximum integer k for which</span>
<a name="l00058"></a>00058 <span class="comment"> * we can represent 10^k exactly), we may be able to</span>
<a name="l00059"></a>00059 <span class="comment"> * compute (d*10^k) * 10^(e-k) with just one roundoff.</span>
<a name="l00060"></a>00060 <span class="comment"> * 3. Rather than a bit-at-a-time adjustment of the binary</span>
<a name="l00061"></a>00061 <span class="comment"> * result in the hard case, we use floating-point</span>
<a name="l00062"></a>00062 <span class="comment"> * arithmetic to determine the adjustment to within</span>
<a name="l00063"></a>00063 <span class="comment"> * one bit; only in really hard cases do we need to</span>
<a name="l00064"></a>00064 <span class="comment"> * compute a second residual.</span>
<a name="l00065"></a>00065 <span class="comment"> * 4. Because of 3., we don't need a large table of powers of 10</span>
<a name="l00066"></a>00066 <span class="comment"> * for ten-to-e (just some small tables, e.g. of 10^k</span>
<a name="l00067"></a>00067 <span class="comment"> * for 0 <= k <= 22).</span>
<a name="l00068"></a>00068 <span class="comment"> */</span>
<a name="l00069"></a>00069
<a name="l00070"></a>00070 <span class="comment">/*</span>
<a name="l00071"></a>00071 <span class="comment"> * #define IEEE_8087 for IEEE-arithmetic machines where the least</span>
<a name="l00072"></a>00072 <span class="comment"> * significant byte has the lowest address.</span>
<a name="l00073"></a>00073 <span class="comment"> * #define IEEE_MC68k for IEEE-arithmetic machines where the most</span>
<a name="l00074"></a>00074 <span class="comment"> * significant byte has the lowest address.</span>
<a name="l00075"></a>00075 <span class="comment"> * #define Long int on machines with 32-bit ints and 64-bit longs.</span>
<a name="l00076"></a>00076 <span class="comment"> * #define IBM for IBM mainframe-style floating-point arithmetic.</span>
<a name="l00077"></a>00077 <span class="comment"> * #define VAX for VAX-style floating-point arithmetic (D_floating).</span>
<a name="l00078"></a>00078 <span class="comment"> * #define No_leftright to omit left-right logic in fast floating-point</span>
<a name="l00079"></a>00079 <span class="comment"> * computation of dtoa.</span>
<a name="l00080"></a>00080 <span class="comment"> * #define Honor_FLT_ROUNDS if FLT_ROUNDS can assume the values 2 or 3</span>
<a name="l00081"></a>00081 <span class="comment"> * and strtod and dtoa should round accordingly.</span>
<a name="l00082"></a>00082 <span class="comment"> * #define Check_FLT_ROUNDS if FLT_ROUNDS can assume the values 2 or 3</span>
<a name="l00083"></a>00083 <span class="comment"> * and Honor_FLT_ROUNDS is not #defined.</span>
<a name="l00084"></a>00084 <span class="comment"> * #define RND_PRODQUOT to use rnd_prod and rnd_quot (assembly routines</span>
<a name="l00085"></a>00085 <span class="comment"> * that use extended-precision instructions to compute rounded</span>
<a name="l00086"></a>00086 <span class="comment"> * products and quotients) with IBM.</span>
<a name="l00087"></a>00087 <span class="comment"> * #define ROUND_BIASED for IEEE-format with biased rounding.</span>
<a name="l00088"></a>00088 <span class="comment"> * #define Inaccurate_Divide for IEEE-format with correctly rounded</span>
<a name="l00089"></a>00089 <span class="comment"> * products but inaccurate quotients, e.g., for Intel i860.</span>
<a name="l00090"></a>00090 <span class="comment"> * #define NO_LONG_LONG on machines that do not have a "long long"</span>
<a name="l00091"></a>00091 <span class="comment"> * integer type (of >= 64 bits). On such machines, you can</span>
<a name="l00092"></a>00092 <span class="comment"> * #define Just_16 to store 16 bits per 32-bit Long when doing</span>
<a name="l00093"></a>00093 <span class="comment"> * high-precision integer arithmetic. Whether this speeds things</span>
<a name="l00094"></a>00094 <span class="comment"> * up or slows things down depends on the machine and the number</span>
<a name="l00095"></a>00095 <span class="comment"> * being converted. If long long is available and the name is</span>
<a name="l00096"></a>00096 <span class="comment"> * something other than "long long", #define Llong to be the name,</span>
<a name="l00097"></a>00097 <span class="comment"> * and if "unsigned Llong" does not work as an unsigned version of</span>
<a name="l00098"></a>00098 <span class="comment"> * Llong, #define #ULLong to be the corresponding unsigned type.</span>
<a name="l00099"></a>00099 <span class="comment"> * #define KR_headers for old-style C function headers.</span>
<a name="l00100"></a>00100 <span class="comment"> * #define Bad_float_h if your system lacks a float.h or if it does not</span>
<a name="l00101"></a>00101 <span class="comment"> * define some or all of DBL_DIG, DBL_MAX_10_EXP, DBL_MAX_EXP,</span>
<a name="l00102"></a>00102 <span class="comment"> * FLT_RADIX, FLT_ROUNDS, and DBL_MAX.</span>
<a name="l00103"></a>00103 <span class="comment"> * #define MALLOC your_malloc, where your_malloc(n) acts like malloc(n)</span>
<a name="l00104"></a>00104 <span class="comment"> * if memory is available and otherwise does something you deem</span>
<a name="l00105"></a>00105 <span class="comment"> * appropriate. If MALLOC is undefined, malloc will be invoked</span>
<a name="l00106"></a>00106 <span class="comment"> * directly -- and assumed always to succeed.</span>
<a name="l00107"></a>00107 <span class="comment"> * #define Omit_Private_Memory to omit logic (added Jan. 1998) for making</span>
<a name="l00108"></a>00108 <span class="comment"> * memory allocations from a private pool of memory when possible.</span>
<a name="l00109"></a>00109 <span class="comment"> * When used, the private pool is PRIVATE_MEM bytes long: 2304 bytes,</span>
<a name="l00110"></a>00110 <span class="comment"> * unless #defined to be a different length. This default length</span>
<a name="l00111"></a>00111 <span class="comment"> * suffices to get rid of MALLOC calls except for unusual cases,</span>
<a name="l00112"></a>00112 <span class="comment"> * such as decimal-to-binary conversion of a very long string of</span>
<a name="l00113"></a>00113 <span class="comment"> * digits. The longest string dtoa can return is about 751 bytes</span>
<a name="l00114"></a>00114 <span class="comment"> * long. For conversions by strtod of strings of 800 digits and</span>
<a name="l00115"></a>00115 <span class="comment"> * all dtoa conversions in single-threaded executions with 8-byte</span>
<a name="l00116"></a>00116 <span class="comment"> * pointers, PRIVATE_MEM >= 7400 appears to suffice; with 4-byte</span>
<a name="l00117"></a>00117 <span class="comment"> * pointers, PRIVATE_MEM >= 7112 appears adequate.</span>
<a name="l00118"></a>00118 <span class="comment"> * #define INFNAN_CHECK on IEEE systems to cause strtod to check for</span>
<a name="l00119"></a>00119 <span class="comment"> * Infinity and NaN (case insensitively). On some systems (e.g.,</span>
<a name="l00120"></a>00120 <span class="comment"> * some HP systems), it may be necessary to #define NAN_WORD0</span>
<a name="l00121"></a>00121 <span class="comment"> * appropriately -- to the most significant word of a quiet NaN.</span>
<a name="l00122"></a>00122 <span class="comment"> * (On HP Series 700/800 machines, -DNAN_WORD0=0x7ff40000 works.)</span>
<a name="l00123"></a>00123 <span class="comment"> * When INFNAN_CHECK is #defined and No_Hex_NaN is not #defined,</span>
<a name="l00124"></a>00124 <span class="comment"> * strtod also accepts (case insensitively) strings of the form</span>
<a name="l00125"></a>00125 <span class="comment"> * NaN(x), where x is a string of hexadecimal digits and spaces;</span>
<a name="l00126"></a>00126 <span class="comment"> * if there is only one string of hexadecimal digits, it is taken</span>
<a name="l00127"></a>00127 <span class="comment"> * for the 52 fraction bits of the resulting NaN; if there are two</span>
<a name="l00128"></a>00128 <span class="comment"> * or more strings of hex digits, the first is for the high 20 bits,</span>
<a name="l00129"></a>00129 <span class="comment"> * the second and subsequent for the low 32 bits, with intervening</span>
<a name="l00130"></a>00130 <span class="comment"> * white space ignored; but if this results in none of the 52</span>
<a name="l00131"></a>00131 <span class="comment"> * fraction bits being on (an IEEE Infinity symbol), then NAN_WORD0</span>
<a name="l00132"></a>00132 <span class="comment"> * and NAN_WORD1 are used instead.</span>
<a name="l00133"></a>00133 <span class="comment"> * #define MULTIPLE_THREADS if the system offers preemptively scheduled</span>
<a name="l00134"></a>00134 <span class="comment"> * multiple threads. In this case, you must provide (or suitably</span>
<a name="l00135"></a>00135 <span class="comment"> * #define) two locks, acquired by ACQUIRE_DTOA_LOCK(n) and freed</span>
<a name="l00136"></a>00136 <span class="comment"> * by FREE_DTOA_LOCK(n) for n = 0 or 1. (The second lock, accessed</span>
<a name="l00137"></a>00137 <span class="comment"> * in pow5mult, ensures lazy evaluation of only one copy of high</span>
<a name="l00138"></a>00138 <span class="comment"> * powers of 5; omitting this lock would introduce a small</span>
<a name="l00139"></a>00139 <span class="comment"> * probability of wasting memory, but would otherwise be harmless.)</span>
<a name="l00140"></a>00140 <span class="comment"> * You must also invoke freedtoa(s) to free the value s returned by</span>
<a name="l00141"></a>00141 <span class="comment"> * dtoa. You may do so whether or not MULTIPLE_THREADS is #defined.</span>
<a name="l00142"></a>00142 <span class="comment"> * #define NO_IEEE_Scale to disable new (Feb. 1997) logic in strtod that</span>
<a name="l00143"></a>00143 <span class="comment"> * avoids underflows on inputs whose result does not underflow.</span>
<a name="l00144"></a>00144 <span class="comment"> * If you #define NO_IEEE_Scale on a machine that uses IEEE-format</span>
<a name="l00145"></a>00145 <span class="comment"> * floating-point numbers and flushes underflows to zero rather</span>
<a name="l00146"></a>00146 <span class="comment"> * than implementing gradual underflow, then you must also #define</span>
<a name="l00147"></a>00147 <span class="comment"> * Sudden_Underflow.</span>
<a name="l00148"></a>00148 <span class="comment"> * #define YES_ALIAS to permit aliasing certain double values with</span>
<a name="l00149"></a>00149 <span class="comment"> * arrays of ULongs. This leads to slightly better code with</span>
<a name="l00150"></a>00150 <span class="comment"> * some compilers and was always used prior to 19990916, but it</span>
<a name="l00151"></a>00151 <span class="comment"> * is not strictly legal and can cause trouble with aggressively</span>
<a name="l00152"></a>00152 <span class="comment"> * optimizing compilers (e.g., gcc 2.95.1 under -O2).</span>
<a name="l00153"></a>00153 <span class="comment"> * #define USE_LOCALE to use the current locale's decimal_point value.</span>
<a name="l00154"></a>00154 <span class="comment"> * #define SET_INEXACT if IEEE arithmetic is being used and extra</span>
<a name="l00155"></a>00155 <span class="comment"> * computation should be done to set the inexact flag when the</span>
<a name="l00156"></a>00156 <span class="comment"> * result is inexact and avoid setting inexact when the result</span>
<a name="l00157"></a>00157 <span class="comment"> * is exact. In this case, dtoa.c must be compiled in</span>
<a name="l00158"></a>00158 <span class="comment"> * an environment, perhaps provided by #include "dtoa.c" in a</span>
<a name="l00159"></a>00159 <span class="comment"> * suitable wrapper, that defines two functions,</span>
<a name="l00160"></a>00160 <span class="comment"> * int get_inexact(void);</span>
<a name="l00161"></a>00161 <span class="comment"> * void clear_inexact(void);</span>
<a name="l00162"></a>00162 <span class="comment"> * such that get_inexact() returns a nonzero value if the</span>
<a name="l00163"></a>00163 <span class="comment"> * inexact bit is already set, and clear_inexact() sets the</span>
<a name="l00164"></a>00164 <span class="comment"> * inexact bit to 0. When SET_INEXACT is #defined, strtod</span>
<a name="l00165"></a>00165 <span class="comment"> * also does extra computations to set the underflow and overflow</span>
<a name="l00166"></a>00166 <span class="comment"> * flags when appropriate (i.e., when the result is tiny and</span>
<a name="l00167"></a>00167 <span class="comment"> * inexact or when it is a numeric value rounded to +-infinity).</span>
<a name="l00168"></a>00168 <span class="comment"> * #define NO_ERRNO if strtod should not assign errno = ERANGE when</span>
<a name="l00169"></a>00169 <span class="comment"> * the result overflows to +-Infinity or underflows to 0.</span>
<a name="l00170"></a>00170 <span class="comment"> */</span>
<a name="l00171"></a>00171
<a name="l00172"></a>00172 <span class="comment">// Put this before anything else that may import a definition of CONST. CONST from grammar.cpp conflicts with this.</span>
<a name="l00173"></a>00173 <span class="preprocessor">#ifdef KDE_USE_FINAL</span>
<a name="l00174"></a>00174 <span class="preprocessor"></span><span class="preprocessor">#undef CONST</span>
<a name="l00175"></a>00175 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00176"></a>00176 <span class="preprocessor"></span>
<a name="l00177"></a>00177 <span class="preprocessor">#include "dtoa.h"</span>
<a name="l00178"></a>00178 <span class="preprocessor">#include <config.h></span>
<a name="l00179"></a>00179
<a name="l00180"></a>00180 <span class="preprocessor">#include "global.h"</span>
<a name="l00181"></a>00181
<a name="l00182"></a>00182 <span class="preprocessor">#ifdef WORDS_BIGENDIAN</span>
<a name="l00183"></a>00183 <span class="preprocessor"></span><span class="preprocessor">#define IEEE_MC68k</span>
<a name="l00184"></a>00184 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00185"></a>00185 <span class="preprocessor"></span><span class="preprocessor">#define IEEE_8087</span>
<a name="l00186"></a>00186 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00187"></a>00187 <span class="preprocessor"></span><span class="preprocessor">#define INFNAN_CHECK</span>
<a name="l00188"></a>00188 <span class="preprocessor"></span>
<a name="l00189"></a>00189
<a name="l00190"></a>00190
<a name="l00191"></a>00191 <span class="preprocessor">#ifndef Long</span>
<a name="l00192"></a>00192 <span class="preprocessor"></span><span class="preprocessor">#define Long int</span>
<a name="l00193"></a>00193 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00194"></a>00194 <span class="preprocessor"></span><span class="preprocessor">#ifndef ULong</span>
<a name="l00195"></a>00195 <span class="preprocessor"></span><span class="keyword">typedef</span> <span class="keywordtype">unsigned</span> Long ULong;
<a name="l00196"></a>00196 <span class="preprocessor">#endif</span>
<a name="l00197"></a>00197 <span class="preprocessor"></span>
<a name="l00198"></a>00198 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l00199"></a>00199 <span class="preprocessor"></span><span class="preprocessor">#include <stdio.h></span>
<a name="l00200"></a>00200 <span class="preprocessor">#define Bug(x) {fprintf(stderr, "%s\n", x); exit(1);}</span>
<a name="l00201"></a>00201 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00202"></a>00202 <span class="preprocessor"></span>
<a name="l00203"></a>00203 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00204"></a>00204 <span class="preprocessor">#include <string.h></span>
<a name="l00205"></a>00205
<a name="l00206"></a>00206 <span class="preprocessor">#ifdef USE_LOCALE</span>
<a name="l00207"></a>00207 <span class="preprocessor"></span><span class="preprocessor">#include <locale.h></span>
<a name="l00208"></a>00208 <span class="preprocessor">#endif</span>
<a name="l00209"></a>00209 <span class="preprocessor"></span>
<a name="l00210"></a>00210 <span class="preprocessor">#ifdef MALLOC</span>
<a name="l00211"></a>00211 <span class="preprocessor"></span><span class="keyword">extern</span> <span class="keywordtype">void</span> *MALLOC(<span class="keywordtype">size_t</span>);
<a name="l00212"></a>00212 <span class="preprocessor">#else</span>
<a name="l00213"></a>00213 <span class="preprocessor"></span><span class="preprocessor">#define MALLOC malloc</span>
<a name="l00214"></a>00214 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00215"></a>00215 <span class="preprocessor"></span>
<a name="l00216"></a>00216 <span class="preprocessor">#ifndef Omit_Private_Memory</span>
<a name="l00217"></a>00217 <span class="preprocessor"></span><span class="preprocessor">#ifndef PRIVATE_MEM</span>
<a name="l00218"></a>00218 <span class="preprocessor"></span><span class="preprocessor">#define PRIVATE_MEM 2304</span>
<a name="l00219"></a>00219 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00220"></a>00220 <span class="preprocessor"></span><span class="preprocessor">#define PRIVATE_mem ((PRIVATE_MEM+sizeof(double)-1)/sizeof(double))</span>
<a name="l00221"></a>00221 <span class="preprocessor"></span><span class="keyword">static</span> <span class="keywordtype">double</span> private_mem[PRIVATE_mem], *pmem_next = private_mem;
<a name="l00222"></a>00222 <span class="preprocessor">#endif</span>
<a name="l00223"></a>00223 <span class="preprocessor"></span>
<a name="l00224"></a>00224 <span class="preprocessor">#undef IEEE_Arith</span>
<a name="l00225"></a>00225 <span class="preprocessor"></span><span class="preprocessor">#undef Avoid_Underflow</span>
<a name="l00226"></a>00226 <span class="preprocessor"></span><span class="preprocessor">#ifdef IEEE_MC68k</span>
<a name="l00227"></a>00227 <span class="preprocessor"></span><span class="preprocessor">#define IEEE_Arith</span>
<a name="l00228"></a>00228 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00229"></a>00229 <span class="preprocessor"></span><span class="preprocessor">#ifdef IEEE_8087</span>
<a name="l00230"></a>00230 <span class="preprocessor"></span><span class="preprocessor">#define IEEE_Arith</span>
<a name="l00231"></a>00231 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00232"></a>00232 <span class="preprocessor"></span>
<a name="l00233"></a>00233 <span class="preprocessor">#include <errno.h></span>
<a name="l00234"></a>00234
<a name="l00235"></a>00235 <span class="preprocessor">#ifdef Bad_float_h</span>
<a name="l00236"></a>00236 <span class="preprocessor"></span>
<a name="l00237"></a>00237 <span class="preprocessor">#ifdef IEEE_Arith</span>
<a name="l00238"></a>00238 <span class="preprocessor"></span><span class="preprocessor">#define DBL_DIG 15</span>
<a name="l00239"></a>00239 <span class="preprocessor"></span><span class="preprocessor">#define DBL_MAX_10_EXP 308</span>
<a name="l00240"></a>00240 <span class="preprocessor"></span><span class="preprocessor">#define DBL_MAX_EXP 1024</span>
<a name="l00241"></a>00241 <span class="preprocessor"></span><span class="preprocessor">#define FLT_RADIX 2</span>
<a name="l00242"></a>00242 <span class="preprocessor"></span><span class="preprocessor">#endif </span><span class="comment">/*IEEE_Arith*/</span>
<a name="l00243"></a>00243
<a name="l00244"></a>00244 <span class="preprocessor">#ifdef IBM</span>
<a name="l00245"></a>00245 <span class="preprocessor"></span><span class="preprocessor">#define DBL_DIG 16</span>
<a name="l00246"></a>00246 <span class="preprocessor"></span><span class="preprocessor">#define DBL_MAX_10_EXP 75</span>
<a name="l00247"></a>00247 <span class="preprocessor"></span><span class="preprocessor">#define DBL_MAX_EXP 63</span>
<a name="l00248"></a>00248 <span class="preprocessor"></span><span class="preprocessor">#define FLT_RADIX 16</span>
<a name="l00249"></a>00249 <span class="preprocessor"></span><span class="preprocessor">#define DBL_MAX 7.2370055773322621e+75</span>
<a name="l00250"></a>00250 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00251"></a>00251 <span class="preprocessor"></span>
<a name="l00252"></a>00252 <span class="preprocessor">#ifdef VAX</span>
<a name="l00253"></a>00253 <span class="preprocessor"></span><span class="preprocessor">#define DBL_DIG 16</span>
<a name="l00254"></a>00254 <span class="preprocessor"></span><span class="preprocessor">#define DBL_MAX_10_EXP 38</span>
<a name="l00255"></a>00255 <span class="preprocessor"></span><span class="preprocessor">#define DBL_MAX_EXP 127</span>
<a name="l00256"></a>00256 <span class="preprocessor"></span><span class="preprocessor">#define FLT_RADIX 2</span>
<a name="l00257"></a>00257 <span class="preprocessor"></span><span class="preprocessor">#define DBL_MAX 1.7014118346046923e+38</span>
<a name="l00258"></a>00258 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00259"></a>00259 <span class="preprocessor"></span>
<a name="l00260"></a>00260 <span class="preprocessor">#ifndef LONG_MAX</span>
<a name="l00261"></a>00261 <span class="preprocessor"></span><span class="preprocessor">#define LONG_MAX 2147483647</span>
<a name="l00262"></a>00262 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00263"></a>00263 <span class="preprocessor"></span>
<a name="l00264"></a>00264 <span class="preprocessor">#else </span><span class="comment">/* ifndef Bad_float_h */</span>
<a name="l00265"></a>00265 <span class="preprocessor">#include <float.h></span>
<a name="l00266"></a>00266 <span class="preprocessor">#endif </span><span class="comment">/* Bad_float_h */</span>
<a name="l00267"></a>00267
<a name="l00268"></a>00268 <span class="preprocessor">#ifndef __MATH_H__</span>
<a name="l00269"></a>00269 <span class="preprocessor"></span><span class="preprocessor">#include <math.h></span>
<a name="l00270"></a>00270 <span class="preprocessor">#endif</span>
<a name="l00271"></a>00271 <span class="preprocessor"></span>
<a name="l00272"></a>00272 <span class="preprocessor">#define strtod kjs_strtod</span>
<a name="l00273"></a>00273 <span class="preprocessor"></span><span class="preprocessor">#define dtoa kjs_dtoa</span>
<a name="l00274"></a>00274 <span class="preprocessor"></span><span class="preprocessor">#define freedtoa kjs_freedtoa</span>
<a name="l00275"></a>00275 <span class="preprocessor"></span>
<a name="l00276"></a>00276 <span class="preprocessor">#ifdef __cplusplus</span>
<a name="l00277"></a>00277 <span class="preprocessor"></span><span class="keyword">extern</span> <span class="stringliteral">"C"</span> {
<a name="l00278"></a>00278 <span class="preprocessor">#endif</span>
<a name="l00279"></a>00279 <span class="preprocessor"></span>
<a name="l00280"></a>00280 <span class="preprocessor">#ifndef CONST</span>
<a name="l00281"></a>00281 <span class="preprocessor"></span><span class="preprocessor">#define CONST const</span>
<a name="l00282"></a>00282 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00283"></a>00283 <span class="preprocessor"></span>
<a name="l00284"></a>00284 <span class="preprocessor">#if defined(IEEE_8087) + defined(IEEE_MC68k) + defined(VAX) + defined(IBM) != 1</span>
<a name="l00285"></a>00285 <span class="preprocessor"></span>Exactly one of IEEE_8087, IEEE_MC68k, VAX, or IBM should be defined.
<a name="l00286"></a>00286 #endif
<a name="l00287"></a>00287
<a name="l00288"></a>00288 <span class="keyword">typedef</span> <span class="keyword">union </span>{ <span class="keywordtype">double</span> d; ULong L[2]; } U;
<a name="l00289"></a>00289
<a name="l00290"></a>00290 <span class="preprocessor">#define dval(x) (x).d</span>
<a name="l00291"></a>00291 <span class="preprocessor"></span><span class="preprocessor">#ifdef IEEE_8087</span>
<a name="l00292"></a>00292 <span class="preprocessor"></span><span class="preprocessor">#define word0(x) (x).L[1]</span>
<a name="l00293"></a>00293 <span class="preprocessor"></span><span class="preprocessor">#define word1(x) (x).L[0]</span>
<a name="l00294"></a>00294 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00295"></a>00295 <span class="preprocessor"></span><span class="preprocessor">#define word0(x) (x).L[0]</span>
<a name="l00296"></a>00296 <span class="preprocessor"></span><span class="preprocessor">#define word1(x) (x).L[1]</span>
<a name="l00297"></a>00297 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00298"></a>00298 <span class="preprocessor"></span>
<a name="l00299"></a>00299 <span class="comment">/* The following definition of Storeinc is appropriate for MIPS processors.</span>
<a name="l00300"></a>00300 <span class="comment"> * An alternative that might be better on some machines is</span>
<a name="l00301"></a>00301 <span class="comment"> */</span>
<a name="l00302"></a>00302 <span class="preprocessor">#define Storeinc(a,b,c) (*a++ = b << 16 | c & 0xffff)</span>
<a name="l00303"></a>00303 <span class="preprocessor"></span>
<a name="l00304"></a>00304 <span class="comment">/* #define P DBL_MANT_DIG */</span>
<a name="l00305"></a>00305 <span class="comment">/* Ten_pmax = floor(P*log(2)/log(5)) */</span>
<a name="l00306"></a>00306 <span class="comment">/* Bletch = (highest power of 2 < DBL_MAX_10_EXP) / 16 */</span>
<a name="l00307"></a>00307 <span class="comment">/* Quick_max = floor((P-1)*log(FLT_RADIX)/log(10) - 1) */</span>
<a name="l00308"></a>00308 <span class="comment">/* Int_max = floor(P*log(FLT_RADIX)/log(10) - 1) */</span>
<a name="l00309"></a>00309
<a name="l00310"></a>00310 <span class="preprocessor">#ifdef IEEE_Arith</span>
<a name="l00311"></a>00311 <span class="preprocessor"></span><span class="preprocessor">#define Exp_shift 20</span>
<a name="l00312"></a>00312 <span class="preprocessor"></span><span class="preprocessor">#define Exp_shift1 20</span>
<a name="l00313"></a>00313 <span class="preprocessor"></span><span class="preprocessor">#define Exp_msk1 0x100000</span>
<a name="l00314"></a>00314 <span class="preprocessor"></span><span class="preprocessor">#define Exp_msk11 0x100000</span>
<a name="l00315"></a>00315 <span class="preprocessor"></span><span class="preprocessor">#define Exp_mask 0x7ff00000</span>
<a name="l00316"></a>00316 <span class="preprocessor"></span><span class="preprocessor">#define P 53</span>
<a name="l00317"></a>00317 <span class="preprocessor"></span><span class="preprocessor">#define Bias 1023</span>
<a name="l00318"></a>00318 <span class="preprocessor"></span><span class="preprocessor">#define Emin (-1022)</span>
<a name="l00319"></a>00319 <span class="preprocessor"></span><span class="preprocessor">#define Exp_1 0x3ff00000</span>
<a name="l00320"></a>00320 <span class="preprocessor"></span><span class="preprocessor">#define Exp_11 0x3ff00000</span>
<a name="l00321"></a>00321 <span class="preprocessor"></span><span class="preprocessor">#define Ebits 11</span>
<a name="l00322"></a>00322 <span class="preprocessor"></span><span class="preprocessor">#define Frac_mask 0xfffff</span>
<a name="l00323"></a>00323 <span class="preprocessor"></span><span class="preprocessor">#define Frac_mask1 0xfffff</span>
<a name="l00324"></a>00324 <span class="preprocessor"></span><span class="preprocessor">#define Ten_pmax 22</span>
<a name="l00325"></a>00325 <span class="preprocessor"></span><span class="preprocessor">#define Bletch 0x10</span>
<a name="l00326"></a>00326 <span class="preprocessor"></span><span class="preprocessor">#define Bndry_mask 0xfffff</span>
<a name="l00327"></a>00327 <span class="preprocessor"></span><span class="preprocessor">#define Bndry_mask1 0xfffff</span>
<a name="l00328"></a>00328 <span class="preprocessor"></span><span class="preprocessor">#define LSB 1</span>
<a name="l00329"></a>00329 <span class="preprocessor"></span><span class="preprocessor">#define Sign_bit 0x80000000</span>
<a name="l00330"></a>00330 <span class="preprocessor"></span><span class="preprocessor">#define Log2P 1</span>
<a name="l00331"></a>00331 <span class="preprocessor"></span><span class="preprocessor">#define Tiny0 0</span>
<a name="l00332"></a>00332 <span class="preprocessor"></span><span class="preprocessor">#define Tiny1 1</span>
<a name="l00333"></a>00333 <span class="preprocessor"></span><span class="preprocessor">#define Quick_max 14</span>
<a name="l00334"></a>00334 <span class="preprocessor"></span><span class="preprocessor">#define Int_max 14</span>
<a name="l00335"></a>00335 <span class="preprocessor"></span><span class="preprocessor">#ifndef NO_IEEE_Scale</span>
<a name="l00336"></a>00336 <span class="preprocessor"></span><span class="preprocessor">#define Avoid_Underflow</span>
<a name="l00337"></a>00337 <span class="preprocessor"></span><span class="preprocessor">#ifdef Flush_Denorm </span><span class="comment">/* debugging option */</span>
<a name="l00338"></a>00338 <span class="preprocessor">#undef Sudden_Underflow</span>
<a name="l00339"></a>00339 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00340"></a>00340 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00341"></a>00341 <span class="preprocessor"></span>
<a name="l00342"></a>00342 <span class="preprocessor">#ifndef Flt_Rounds</span>
<a name="l00343"></a>00343 <span class="preprocessor"></span><span class="preprocessor">#ifdef FLT_ROUNDS</span>
<a name="l00344"></a>00344 <span class="preprocessor"></span><span class="preprocessor">#define Flt_Rounds FLT_ROUNDS</span>
<a name="l00345"></a>00345 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00346"></a>00346 <span class="preprocessor"></span><span class="preprocessor">#define Flt_Rounds 1</span>
<a name="l00347"></a>00347 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00348"></a>00348 <span class="preprocessor"></span><span class="preprocessor">#endif </span><span class="comment">/*Flt_Rounds*/</span>
<a name="l00349"></a>00349
<a name="l00350"></a>00350 <span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l00351"></a>00351 <span class="preprocessor"></span><span class="preprocessor">#define Rounding rounding</span>
<a name="l00352"></a>00352 <span class="preprocessor"></span><span class="preprocessor">#undef Check_FLT_ROUNDS</span>
<a name="l00353"></a>00353 <span class="preprocessor"></span><span class="preprocessor">#define Check_FLT_ROUNDS</span>
<a name="l00354"></a>00354 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00355"></a>00355 <span class="preprocessor"></span><span class="preprocessor">#define Rounding Flt_Rounds</span>
<a name="l00356"></a>00356 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00357"></a>00357 <span class="preprocessor"></span>
<a name="l00358"></a>00358 <span class="preprocessor">#else </span><span class="comment">/* ifndef IEEE_Arith */</span>
<a name="l00359"></a>00359 <span class="preprocessor">#undef Check_FLT_ROUNDS</span>
<a name="l00360"></a>00360 <span class="preprocessor"></span><span class="preprocessor">#undef Honor_FLT_ROUNDS</span>
<a name="l00361"></a>00361 <span class="preprocessor"></span><span class="preprocessor">#undef SET_INEXACT</span>
<a name="l00362"></a>00362 <span class="preprocessor"></span><span class="preprocessor">#undef Sudden_Underflow</span>
<a name="l00363"></a>00363 <span class="preprocessor"></span><span class="preprocessor">#define Sudden_Underflow</span>
<a name="l00364"></a>00364 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
<a name="l00365"></a>00365 <span class="preprocessor"></span><span class="preprocessor">#undef Flt_Rounds</span>
<a name="l00366"></a>00366 <span class="preprocessor"></span><span class="preprocessor">#define Flt_Rounds 0</span>
<a name="l00367"></a>00367 <span class="preprocessor"></span><span class="preprocessor">#define Exp_shift 24</span>
<a name="l00368"></a>00368 <span class="preprocessor"></span><span class="preprocessor">#define Exp_shift1 24</span>
<a name="l00369"></a>00369 <span class="preprocessor"></span><span class="preprocessor">#define Exp_msk1 0x1000000</span>
<a name="l00370"></a>00370 <span class="preprocessor"></span><span class="preprocessor">#define Exp_msk11 0x1000000</span>
<a name="l00371"></a>00371 <span class="preprocessor"></span><span class="preprocessor">#define Exp_mask 0x7f000000</span>
<a name="l00372"></a>00372 <span class="preprocessor"></span><span class="preprocessor">#define P 14</span>
<a name="l00373"></a>00373 <span class="preprocessor"></span><span class="preprocessor">#define Bias 65</span>
<a name="l00374"></a>00374 <span class="preprocessor"></span><span class="preprocessor">#define Exp_1 0x41000000</span>
<a name="l00375"></a>00375 <span class="preprocessor"></span><span class="preprocessor">#define Exp_11 0x41000000</span>
<a name="l00376"></a>00376 <span class="preprocessor"></span><span class="preprocessor">#define Ebits 8 </span><span class="comment">/* exponent has 7 bits, but 8 is the right value in b2d */</span>
<a name="l00377"></a>00377 <span class="preprocessor">#define Frac_mask 0xffffff</span>
<a name="l00378"></a>00378 <span class="preprocessor"></span><span class="preprocessor">#define Frac_mask1 0xffffff</span>
<a name="l00379"></a>00379 <span class="preprocessor"></span><span class="preprocessor">#define Bletch 4</span>
<a name="l00380"></a>00380 <span class="preprocessor"></span><span class="preprocessor">#define Ten_pmax 22</span>
<a name="l00381"></a>00381 <span class="preprocessor"></span><span class="preprocessor">#define Bndry_mask 0xefffff</span>
<a name="l00382"></a>00382 <span class="preprocessor"></span><span class="preprocessor">#define Bndry_mask1 0xffffff</span>
<a name="l00383"></a>00383 <span class="preprocessor"></span><span class="preprocessor">#define LSB 1</span>
<a name="l00384"></a>00384 <span class="preprocessor"></span><span class="preprocessor">#define Sign_bit 0x80000000</span>
<a name="l00385"></a>00385 <span class="preprocessor"></span><span class="preprocessor">#define Log2P 4</span>
<a name="l00386"></a>00386 <span class="preprocessor"></span><span class="preprocessor">#define Tiny0 0x100000</span>
<a name="l00387"></a>00387 <span class="preprocessor"></span><span class="preprocessor">#define Tiny1 0</span>
<a name="l00388"></a>00388 <span class="preprocessor"></span><span class="preprocessor">#define Quick_max 14</span>
<a name="l00389"></a>00389 <span class="preprocessor"></span><span class="preprocessor">#define Int_max 15</span>
<a name="l00390"></a>00390 <span class="preprocessor"></span><span class="preprocessor">#else </span><span class="comment">/* VAX */</span>
<a name="l00391"></a>00391 <span class="preprocessor">#undef Flt_Rounds</span>
<a name="l00392"></a>00392 <span class="preprocessor"></span><span class="preprocessor">#define Flt_Rounds 1</span>
<a name="l00393"></a>00393 <span class="preprocessor"></span><span class="preprocessor">#define Exp_shift 23</span>
<a name="l00394"></a>00394 <span class="preprocessor"></span><span class="preprocessor">#define Exp_shift1 7</span>
<a name="l00395"></a>00395 <span class="preprocessor"></span><span class="preprocessor">#define Exp_msk1 0x80</span>
<a name="l00396"></a>00396 <span class="preprocessor"></span><span class="preprocessor">#define Exp_msk11 0x800000</span>
<a name="l00397"></a>00397 <span class="preprocessor"></span><span class="preprocessor">#define Exp_mask 0x7f80</span>
<a name="l00398"></a>00398 <span class="preprocessor"></span><span class="preprocessor">#define P 56</span>
<a name="l00399"></a>00399 <span class="preprocessor"></span><span class="preprocessor">#define Bias 129</span>
<a name="l00400"></a>00400 <span class="preprocessor"></span><span class="preprocessor">#define Exp_1 0x40800000</span>
<a name="l00401"></a>00401 <span class="preprocessor"></span><span class="preprocessor">#define Exp_11 0x4080</span>
<a name="l00402"></a>00402 <span class="preprocessor"></span><span class="preprocessor">#define Ebits 8</span>
<a name="l00403"></a>00403 <span class="preprocessor"></span><span class="preprocessor">#define Frac_mask 0x7fffff</span>
<a name="l00404"></a>00404 <span class="preprocessor"></span><span class="preprocessor">#define Frac_mask1 0xffff007f</span>
<a name="l00405"></a>00405 <span class="preprocessor"></span><span class="preprocessor">#define Ten_pmax 24</span>
<a name="l00406"></a>00406 <span class="preprocessor"></span><span class="preprocessor">#define Bletch 2</span>
<a name="l00407"></a>00407 <span class="preprocessor"></span><span class="preprocessor">#define Bndry_mask 0xffff007f</span>
<a name="l00408"></a>00408 <span class="preprocessor"></span><span class="preprocessor">#define Bndry_mask1 0xffff007f</span>
<a name="l00409"></a>00409 <span class="preprocessor"></span><span class="preprocessor">#define LSB 0x10000</span>
<a name="l00410"></a>00410 <span class="preprocessor"></span><span class="preprocessor">#define Sign_bit 0x8000</span>
<a name="l00411"></a>00411 <span class="preprocessor"></span><span class="preprocessor">#define Log2P 1</span>
<a name="l00412"></a>00412 <span class="preprocessor"></span><span class="preprocessor">#define Tiny0 0x80</span>
<a name="l00413"></a>00413 <span class="preprocessor"></span><span class="preprocessor">#define Tiny1 0</span>
<a name="l00414"></a>00414 <span class="preprocessor"></span><span class="preprocessor">#define Quick_max 15</span>
<a name="l00415"></a>00415 <span class="preprocessor"></span><span class="preprocessor">#define Int_max 15</span>
<a name="l00416"></a>00416 <span class="preprocessor"></span><span class="preprocessor">#endif </span><span class="comment">/* IBM, VAX */</span>
<a name="l00417"></a>00417 <span class="preprocessor">#endif </span><span class="comment">/* IEEE_Arith */</span>
<a name="l00418"></a>00418
<a name="l00419"></a>00419 <span class="preprocessor">#ifndef IEEE_Arith</span>
<a name="l00420"></a>00420 <span class="preprocessor"></span><span class="preprocessor">#define ROUND_BIASED</span>
<a name="l00421"></a>00421 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00422"></a>00422 <span class="preprocessor"></span>
<a name="l00423"></a>00423 <span class="preprocessor">#ifdef RND_PRODQUOT</span>
<a name="l00424"></a>00424 <span class="preprocessor"></span><span class="preprocessor">#define rounded_product(a,b) a = rnd_prod(a, b)</span>
<a name="l00425"></a>00425 <span class="preprocessor"></span><span class="preprocessor">#define rounded_quotient(a,b) a = rnd_quot(a, b)</span>
<a name="l00426"></a>00426 <span class="preprocessor"></span><span class="keyword">extern</span> <span class="keywordtype">double</span> rnd_prod(<span class="keywordtype">double</span>, <span class="keywordtype">double</span>), rnd_quot(<span class="keywordtype">double</span>, <span class="keywordtype">double</span>);
<a name="l00427"></a>00427 <span class="preprocessor">#else</span>
<a name="l00428"></a>00428 <span class="preprocessor"></span><span class="preprocessor">#define rounded_product(a,b) a *= b</span>
<a name="l00429"></a>00429 <span class="preprocessor"></span><span class="preprocessor">#define rounded_quotient(a,b) a /= b</span>
<a name="l00430"></a>00430 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00431"></a>00431 <span class="preprocessor"></span>
<a name="l00432"></a>00432 <span class="preprocessor">#define Big0 (Frac_mask1 | Exp_msk1*(DBL_MAX_EXP+Bias-1))</span>
<a name="l00433"></a>00433 <span class="preprocessor"></span><span class="preprocessor">#define Big1 0xffffffff</span>
<a name="l00434"></a>00434 <span class="preprocessor"></span>
<a name="l00435"></a>00435 <span class="preprocessor">#ifndef Pack_32</span>
<a name="l00436"></a>00436 <span class="preprocessor"></span><span class="preprocessor">#define Pack_32</span>
<a name="l00437"></a>00437 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00438"></a>00438 <span class="preprocessor"></span>
<a name="l00439"></a>00439 <span class="preprocessor">#define FFFFFFFF 0xffffffffUL</span>
<a name="l00440"></a>00440 <span class="preprocessor"></span>
<a name="l00441"></a>00441 <span class="preprocessor">#ifdef NO_LONG_LONG</span>
<a name="l00442"></a>00442 <span class="preprocessor"></span><span class="preprocessor">#undef ULLong</span>
<a name="l00443"></a>00443 <span class="preprocessor"></span><span class="preprocessor">#ifdef Just_16</span>
<a name="l00444"></a>00444 <span class="preprocessor"></span><span class="preprocessor">#undef Pack_32</span>
<a name="l00445"></a>00445 <span class="preprocessor"></span><span class="comment">/* When Pack_32 is not defined, we store 16 bits per 32-bit Long.</span>
<a name="l00446"></a>00446 <span class="comment"> * This makes some inner loops simpler and sometimes saves work</span>
<a name="l00447"></a>00447 <span class="comment"> * during multiplications, but it often seems to make things slightly</span>
<a name="l00448"></a>00448 <span class="comment"> * slower. Hence the default is now to store 32 bits per Long.</span>
<a name="l00449"></a>00449 <span class="comment"> */</span>
<a name="l00450"></a>00450 <span class="preprocessor">#endif</span>
<a name="l00451"></a>00451 <span class="preprocessor"></span><span class="preprocessor">#else </span><span class="comment">/* long long available */</span>
<a name="l00452"></a>00452 <span class="preprocessor">#ifndef Llong</span>
<a name="l00453"></a>00453 <span class="preprocessor"></span><span class="preprocessor">#define Llong long long</span>
<a name="l00454"></a>00454 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00455"></a>00455 <span class="preprocessor"></span><span class="preprocessor">#ifndef ULLong</span>
<a name="l00456"></a>00456 <span class="preprocessor"></span><span class="preprocessor">#define ULLong unsigned Llong</span>
<a name="l00457"></a>00457 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00458"></a>00458 <span class="preprocessor"></span><span class="preprocessor">#endif </span><span class="comment">/* NO_LONG_LONG */</span>
<a name="l00459"></a>00459
<a name="l00460"></a>00460 <span class="preprocessor">#ifndef MULTIPLE_THREADS</span>
<a name="l00461"></a>00461 <span class="preprocessor"></span><span class="preprocessor">#define ACQUIRE_DTOA_LOCK(n) </span><span class="comment">/*nothing*/</span>
<a name="l00462"></a>00462 <span class="preprocessor">#define FREE_DTOA_LOCK(n) </span><span class="comment">/*nothing*/</span>
<a name="l00463"></a>00463 <span class="preprocessor">#endif</span>
<a name="l00464"></a>00464 <span class="preprocessor"></span>
<a name="l00465"></a>00465 <span class="preprocessor">#define Kmax (sizeof(size_t) << 3)</span>
<a name="l00466"></a>00466 <span class="preprocessor"></span>
<a name="l00467"></a>00467 <span class="keyword">struct</span>
<a name="l00468"></a>00468 Bigint {
<a name="l00469"></a>00469 <span class="keyword">struct </span>Bigint *<a class="codeRef" doxygen="kdecore.tag:../../kdecore/html/" href="../../kdecore/html/namespaceKStdAccel.html#a3c93cec83afd9c54d443fe78a9899502">next</a>;
<a name="l00470"></a>00470 <span class="keywordtype">int</span> k, maxwds, sign, wds;
<a name="l00471"></a>00471 ULong x[1];
<a name="l00472"></a>00472 };
<a name="l00473"></a>00473
<a name="l00474"></a>00474 <span class="keyword">typedef</span> <span class="keyword">struct </span>Bigint Bigint;
<a name="l00475"></a>00475
<a name="l00476"></a>00476 <span class="keyword">static</span> Bigint *freelist[Kmax+1];
<a name="l00477"></a>00477
<a name="l00478"></a>00478 <span class="keyword">static</span> Bigint *
<a name="l00479"></a>00479 Balloc
<a name="l00480"></a>00480 (<span class="keywordtype">int</span> k)
<a name="l00481"></a>00481 {
<a name="l00482"></a>00482 <span class="keywordtype">int</span> x;
<a name="l00483"></a>00483 Bigint *rv;
<a name="l00484"></a>00484 <span class="preprocessor">#ifndef Omit_Private_Memory</span>
<a name="l00485"></a>00485 <span class="preprocessor"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> len;
<a name="l00486"></a>00486 <span class="preprocessor">#endif</span>
<a name="l00487"></a>00487 <span class="preprocessor"></span>
<a name="l00488"></a>00488 ACQUIRE_DTOA_LOCK(0);
<a name="l00489"></a>00489 <span class="keywordflow">if</span> ((rv = freelist[k])) {
<a name="l00490"></a>00490 freelist[k] = rv->next;
<a name="l00491"></a>00491 }
<a name="l00492"></a>00492 <span class="keywordflow">else</span> {
<a name="l00493"></a>00493 x = 1 << k;
<a name="l00494"></a>00494 <span class="preprocessor">#ifdef Omit_Private_Memory</span>
<a name="l00495"></a>00495 <span class="preprocessor"></span> rv = (Bigint *)MALLOC(<span class="keyword">sizeof</span>(Bigint) + (x-1)*<span class="keyword">sizeof</span>(ULong));
<a name="l00496"></a>00496 <span class="preprocessor">#else</span>
<a name="l00497"></a>00497 <span class="preprocessor"></span> len = (<span class="keyword">sizeof</span>(Bigint) + (x-1)*<span class="keyword">sizeof</span>(ULong) + <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>) - 1)
<a name="l00498"></a>00498 /<span class="keyword">sizeof</span>(<span class="keywordtype">double</span>);
<a name="l00499"></a>00499 <span class="keywordflow">if</span> (pmem_next - private_mem + len <= (<span class="keywordtype">unsigned</span>)PRIVATE_mem) {
<a name="l00500"></a>00500 rv = (Bigint*)pmem_next;
<a name="l00501"></a>00501 pmem_next += len;
<a name="l00502"></a>00502 }
<a name="l00503"></a>00503 <span class="keywordflow">else</span>
<a name="l00504"></a>00504 rv = (Bigint*)MALLOC(len*<span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));
<a name="l00505"></a>00505 <span class="preprocessor">#endif</span>
<a name="l00506"></a>00506 <span class="preprocessor"></span> rv->k = k;
<a name="l00507"></a>00507 rv->maxwds = x;
<a name="l00508"></a>00508 }
<a name="l00509"></a>00509 FREE_DTOA_LOCK(0);
<a name="l00510"></a>00510 rv->sign = rv->wds = 0;
<a name="l00511"></a>00511 <span class="keywordflow">return</span> rv;
<a name="l00512"></a>00512 }
<a name="l00513"></a>00513
<a name="l00514"></a>00514 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00515"></a>00515 Bfree
<a name="l00516"></a>00516 (Bigint *v)
<a name="l00517"></a>00517 {
<a name="l00518"></a>00518 <span class="keywordflow">if</span> (v) {
<a name="l00519"></a>00519 ACQUIRE_DTOA_LOCK(0);
<a name="l00520"></a>00520 v->next = freelist[v->k];
<a name="l00521"></a>00521 freelist[v->k] = v;
<a name="l00522"></a>00522 FREE_DTOA_LOCK(0);
<a name="l00523"></a>00523 }
<a name="l00524"></a>00524 }
<a name="l00525"></a>00525
<a name="l00526"></a>00526 <span class="preprocessor">#define Bcopy(x,y) memcpy((char *)&x->sign, (char *)&y->sign, \</span>
<a name="l00527"></a>00527 <span class="preprocessor">y->wds*sizeof(Long) + 2*sizeof(int))</span>
<a name="l00528"></a>00528 <span class="preprocessor"></span>
<a name="l00529"></a>00529 <span class="keyword">static</span> Bigint *
<a name="l00530"></a>00530 multadd
<a name="l00531"></a>00531 (Bigint *b, <span class="keywordtype">int</span> m, <span class="keywordtype">int</span> a) <span class="comment">/* multiply by m and add a */</span>
<a name="l00532"></a>00532 {
<a name="l00533"></a>00533 <span class="keywordtype">int</span> i, wds;
<a name="l00534"></a>00534 <span class="preprocessor">#ifdef ULLong</span>
<a name="l00535"></a>00535 <span class="preprocessor"></span> ULong *x;
<a name="l00536"></a>00536 ULLong carry, y;
<a name="l00537"></a>00537 <span class="preprocessor">#else</span>
<a name="l00538"></a>00538 <span class="preprocessor"></span> ULong carry, *x, y;
<a name="l00539"></a>00539 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l00540"></a>00540 <span class="preprocessor"></span> ULong xi, z;
<a name="l00541"></a>00541 <span class="preprocessor">#endif</span>
<a name="l00542"></a>00542 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00543"></a>00543 <span class="preprocessor"></span> Bigint *b1;
<a name="l00544"></a>00544
<a name="l00545"></a>00545 wds = b->wds;
<a name="l00546"></a>00546 x = b->x;
<a name="l00547"></a>00547 i = 0;
<a name="l00548"></a>00548 carry = a;
<a name="l00549"></a>00549 <span class="keywordflow">do</span> {
<a name="l00550"></a>00550 <span class="preprocessor">#ifdef ULLong</span>
<a name="l00551"></a>00551 <span class="preprocessor"></span> y = *x * (ULLong)m + carry;
<a name="l00552"></a>00552 carry = y >> 32;
<a name="l00553"></a>00553 *x++ = (ULong)y & FFFFFFFF;
<a name="l00554"></a>00554 <span class="preprocessor">#else</span>
<a name="l00555"></a>00555 <span class="preprocessor"></span><span class="preprocessor">#ifdef Pack_32</span>
<a name="l00556"></a>00556 <span class="preprocessor"></span> xi = *x;
<a name="l00557"></a>00557 y = (xi & 0xffff) * m + carry;
<a name="l00558"></a>00558 z = (xi >> 16) * m + (y >> 16);
<a name="l00559"></a>00559 carry = z >> 16;
<a name="l00560"></a>00560 *x++ = (z << 16) + (y & 0xffff);
<a name="l00561"></a>00561 <span class="preprocessor">#else</span>
<a name="l00562"></a>00562 <span class="preprocessor"></span> y = *x * m + carry;
<a name="l00563"></a>00563 carry = y >> 16;
<a name="l00564"></a>00564 *x++ = y & 0xffff;
<a name="l00565"></a>00565 <span class="preprocessor">#endif</span>
<a name="l00566"></a>00566 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00567"></a>00567 <span class="preprocessor"></span> }
<a name="l00568"></a>00568 <span class="keywordflow">while</span>(++i < wds);
<a name="l00569"></a>00569 <span class="keywordflow">if</span> (carry) {
<a name="l00570"></a>00570 <span class="keywordflow">if</span> (wds >= b->maxwds) {
<a name="l00571"></a>00571 b1 = Balloc(b->k+1);
<a name="l00572"></a>00572 Bcopy(b1, b);
<a name="l00573"></a>00573 Bfree(b);
<a name="l00574"></a>00574 b = b1;
<a name="l00575"></a>00575 }
<a name="l00576"></a>00576 b->x[wds++] = (ULong)carry;
<a name="l00577"></a>00577 b->wds = wds;
<a name="l00578"></a>00578 }
<a name="l00579"></a>00579 <span class="keywordflow">return</span> b;
<a name="l00580"></a>00580 }
<a name="l00581"></a>00581
<a name="l00582"></a>00582 <span class="keyword">static</span> Bigint *
<a name="l00583"></a>00583 s2b
<a name="l00584"></a>00584 (CONST <span class="keywordtype">char</span> *s, <span class="keywordtype">int</span> nd0, <span class="keywordtype">int</span> nd, ULong y9)
<a name="l00585"></a>00585 {
<a name="l00586"></a>00586 Bigint *b;
<a name="l00587"></a>00587 <span class="keywordtype">int</span> i, k;
<a name="l00588"></a>00588 Long x, y;
<a name="l00589"></a>00589
<a name="l00590"></a>00590 x = (nd + 8) / 9;
<a name="l00591"></a>00591 <span class="keywordflow">for</span>(k = 0, y = 1; x > y; y <<= 1, k++) ;
<a name="l00592"></a>00592 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l00593"></a>00593 <span class="preprocessor"></span> b = Balloc(k);
<a name="l00594"></a>00594 b->x[0] = y9;
<a name="l00595"></a>00595 b->wds = 1;
<a name="l00596"></a>00596 <span class="preprocessor">#else</span>
<a name="l00597"></a>00597 <span class="preprocessor"></span> b = Balloc(k+1);
<a name="l00598"></a>00598 b->x[0] = y9 & 0xffff;
<a name="l00599"></a>00599 b->wds = (b->x[1] = y9 >> 16) ? 2 : 1;
<a name="l00600"></a>00600 <span class="preprocessor">#endif</span>
<a name="l00601"></a>00601 <span class="preprocessor"></span>
<a name="l00602"></a>00602 i = 9;
<a name="l00603"></a>00603 <span class="keywordflow">if</span> (9 < nd0) {
<a name="l00604"></a>00604 s += 9;
<a name="l00605"></a>00605 <span class="keywordflow">do</span> b = multadd(b, 10, *s++ - <span class="charliteral">'0'</span>);
<a name="l00606"></a>00606 <span class="keywordflow">while</span>(++i < nd0);
<a name="l00607"></a>00607 s++;
<a name="l00608"></a>00608 }
<a name="l00609"></a>00609 <span class="keywordflow">else</span>
<a name="l00610"></a>00610 s += 10;
<a name="l00611"></a>00611 <span class="keywordflow">for</span>(; i < nd; i++)
<a name="l00612"></a>00612 b = multadd(b, 10, *s++ - <span class="charliteral">'0'</span>);
<a name="l00613"></a>00613 <span class="keywordflow">return</span> b;
<a name="l00614"></a>00614 }
<a name="l00615"></a>00615
<a name="l00616"></a>00616 <span class="keyword">static</span> <span class="keywordtype">int</span>
<a name="l00617"></a>00617 hi0bits
<a name="l00618"></a>00618 (<span class="keyword">register</span> ULong x)
<a name="l00619"></a>00619 {
<a name="l00620"></a>00620 <span class="keyword">register</span> <span class="keywordtype">int</span> k = 0;
<a name="l00621"></a>00621
<a name="l00622"></a>00622 <span class="keywordflow">if</span> (!(x & 0xffff0000)) {
<a name="l00623"></a>00623 k = 16;
<a name="l00624"></a>00624 x <<= 16;
<a name="l00625"></a>00625 }
<a name="l00626"></a>00626 <span class="keywordflow">if</span> (!(x & 0xff000000)) {
<a name="l00627"></a>00627 k += 8;
<a name="l00628"></a>00628 x <<= 8;
<a name="l00629"></a>00629 }
<a name="l00630"></a>00630 <span class="keywordflow">if</span> (!(x & 0xf0000000)) {
<a name="l00631"></a>00631 k += 4;
<a name="l00632"></a>00632 x <<= 4;
<a name="l00633"></a>00633 }
<a name="l00634"></a>00634 <span class="keywordflow">if</span> (!(x & 0xc0000000)) {
<a name="l00635"></a>00635 k += 2;
<a name="l00636"></a>00636 x <<= 2;
<a name="l00637"></a>00637 }
<a name="l00638"></a>00638 <span class="keywordflow">if</span> (!(x & 0x80000000)) {
<a name="l00639"></a>00639 k++;
<a name="l00640"></a>00640 <span class="keywordflow">if</span> (!(x & 0x40000000))
<a name="l00641"></a>00641 <span class="keywordflow">return</span> 32;
<a name="l00642"></a>00642 }
<a name="l00643"></a>00643 <span class="keywordflow">return</span> k;
<a name="l00644"></a>00644 }
<a name="l00645"></a>00645
<a name="l00646"></a>00646 <span class="keyword">static</span> <span class="keywordtype">int</span>
<a name="l00647"></a>00647 lo0bits
<a name="l00648"></a>00648 (ULong *y)
<a name="l00649"></a>00649 {
<a name="l00650"></a>00650 <span class="keyword">register</span> <span class="keywordtype">int</span> k;
<a name="l00651"></a>00651 <span class="keyword">register</span> ULong x = *y;
<a name="l00652"></a>00652
<a name="l00653"></a>00653 <span class="keywordflow">if</span> (x & 7) {
<a name="l00654"></a>00654 <span class="keywordflow">if</span> (x & 1)
<a name="l00655"></a>00655 <span class="keywordflow">return</span> 0;
<a name="l00656"></a>00656 <span class="keywordflow">if</span> (x & 2) {
<a name="l00657"></a>00657 *y = x >> 1;
<a name="l00658"></a>00658 <span class="keywordflow">return</span> 1;
<a name="l00659"></a>00659 }
<a name="l00660"></a>00660 *y = x >> 2;
<a name="l00661"></a>00661 <span class="keywordflow">return</span> 2;
<a name="l00662"></a>00662 }
<a name="l00663"></a>00663 k = 0;
<a name="l00664"></a>00664 <span class="keywordflow">if</span> (!(x & 0xffff)) {
<a name="l00665"></a>00665 k = 16;
<a name="l00666"></a>00666 x >>= 16;
<a name="l00667"></a>00667 }
<a name="l00668"></a>00668 <span class="keywordflow">if</span> (!(x & 0xff)) {
<a name="l00669"></a>00669 k += 8;
<a name="l00670"></a>00670 x >>= 8;
<a name="l00671"></a>00671 }
<a name="l00672"></a>00672 <span class="keywordflow">if</span> (!(x & 0xf)) {
<a name="l00673"></a>00673 k += 4;
<a name="l00674"></a>00674 x >>= 4;
<a name="l00675"></a>00675 }
<a name="l00676"></a>00676 <span class="keywordflow">if</span> (!(x & 0x3)) {
<a name="l00677"></a>00677 k += 2;
<a name="l00678"></a>00678 x >>= 2;
<a name="l00679"></a>00679 }
<a name="l00680"></a>00680 <span class="keywordflow">if</span> (!(x & 1)) {
<a name="l00681"></a>00681 k++;
<a name="l00682"></a>00682 x >>= 1;
<a name="l00683"></a>00683 <span class="keywordflow">if</span> (!x & 1)
<a name="l00684"></a>00684 <span class="keywordflow">return</span> 32;
<a name="l00685"></a>00685 }
<a name="l00686"></a>00686 *y = x;
<a name="l00687"></a>00687 <span class="keywordflow">return</span> k;
<a name="l00688"></a>00688 }
<a name="l00689"></a>00689
<a name="l00690"></a>00690 <span class="keyword">static</span> Bigint *
<a name="l00691"></a>00691 i2b
<a name="l00692"></a>00692 (<span class="keywordtype">int</span> i)
<a name="l00693"></a>00693 {
<a name="l00694"></a>00694 Bigint *b;
<a name="l00695"></a>00695
<a name="l00696"></a>00696 b = Balloc(1);
<a name="l00697"></a>00697 b->x[0] = i;
<a name="l00698"></a>00698 b->wds = 1;
<a name="l00699"></a>00699 <span class="keywordflow">return</span> b;
<a name="l00700"></a>00700 }
<a name="l00701"></a>00701
<a name="l00702"></a>00702 <span class="keyword">static</span> Bigint *
<a name="l00703"></a>00703 mult
<a name="l00704"></a>00704 (Bigint *a, Bigint *b)
<a name="l00705"></a>00705 {
<a name="l00706"></a>00706 Bigint *c;
<a name="l00707"></a>00707 <span class="keywordtype">int</span> k, wa, wb, wc;
<a name="l00708"></a>00708 ULong *x, *xa, *xae, *xb, *xbe, *xc, *xc0;
<a name="l00709"></a>00709 ULong y;
<a name="l00710"></a>00710 <span class="preprocessor">#ifdef ULLong</span>
<a name="l00711"></a>00711 <span class="preprocessor"></span> ULLong carry, z;
<a name="l00712"></a>00712 <span class="preprocessor">#else</span>
<a name="l00713"></a>00713 <span class="preprocessor"></span> ULong carry, z;
<a name="l00714"></a>00714 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l00715"></a>00715 <span class="preprocessor"></span> ULong z2;
<a name="l00716"></a>00716 <span class="preprocessor">#endif</span>
<a name="l00717"></a>00717 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00718"></a>00718 <span class="preprocessor"></span>
<a name="l00719"></a>00719 <span class="keywordflow">if</span> (a->wds < b->wds) {
<a name="l00720"></a>00720 c = a;
<a name="l00721"></a>00721 a = b;
<a name="l00722"></a>00722 b = c;
<a name="l00723"></a>00723 }
<a name="l00724"></a>00724 k = a->k;
<a name="l00725"></a>00725 wa = a->wds;
<a name="l00726"></a>00726 wb = b->wds;
<a name="l00727"></a>00727 wc = wa + wb;
<a name="l00728"></a>00728 <span class="keywordflow">if</span> (wc > a->maxwds)
<a name="l00729"></a>00729 k++;
<a name="l00730"></a>00730 c = Balloc(k);
<a name="l00731"></a>00731 <span class="keywordflow">for</span>(x = c->x, xa = x + wc; x < xa; x++)
<a name="l00732"></a>00732 *x = 0;
<a name="l00733"></a>00733 xa = a->x;
<a name="l00734"></a>00734 xae = xa + wa;
<a name="l00735"></a>00735 xb = b->x;
<a name="l00736"></a>00736 xbe = xb + wb;
<a name="l00737"></a>00737 xc0 = c->x;
<a name="l00738"></a>00738 <span class="preprocessor">#ifdef ULLong</span>
<a name="l00739"></a>00739 <span class="preprocessor"></span> <span class="keywordflow">for</span>(; xb < xbe; xc0++) {
<a name="l00740"></a>00740 <span class="keywordflow">if</span> ((y = *xb++)) {
<a name="l00741"></a>00741 x = xa;
<a name="l00742"></a>00742 xc = xc0;
<a name="l00743"></a>00743 carry = 0;
<a name="l00744"></a>00744 <span class="keywordflow">do</span> {
<a name="l00745"></a>00745 z = *x++ * (ULLong)y + *xc + carry;
<a name="l00746"></a>00746 carry = z >> 32;
<a name="l00747"></a>00747 *xc++ = (ULong)z & FFFFFFFF;
<a name="l00748"></a>00748 }
<a name="l00749"></a>00749 <span class="keywordflow">while</span>(x < xae);
<a name="l00750"></a>00750 *xc = (ULong)carry;
<a name="l00751"></a>00751 }
<a name="l00752"></a>00752 }
<a name="l00753"></a>00753 <span class="preprocessor">#else</span>
<a name="l00754"></a>00754 <span class="preprocessor"></span><span class="preprocessor">#ifdef Pack_32</span>
<a name="l00755"></a>00755 <span class="preprocessor"></span> <span class="keywordflow">for</span>(; xb < xbe; xb++, xc0++) {
<a name="l00756"></a>00756 <span class="keywordflow">if</span> (y = *xb & 0xffff) {
<a name="l00757"></a>00757 x = xa;
<a name="l00758"></a>00758 xc = xc0;
<a name="l00759"></a>00759 carry = 0;
<a name="l00760"></a>00760 <span class="keywordflow">do</span> {
<a name="l00761"></a>00761 z = (*x & 0xffff) * y + (*xc & 0xffff) + carry;
<a name="l00762"></a>00762 carry = z >> 16;
<a name="l00763"></a>00763 z2 = (*x++ >> 16) * y + (*xc >> 16) + carry;
<a name="l00764"></a>00764 carry = z2 >> 16;
<a name="l00765"></a>00765 Storeinc(xc, z2, z);
<a name="l00766"></a>00766 }
<a name="l00767"></a>00767 <span class="keywordflow">while</span>(x < xae);
<a name="l00768"></a>00768 *xc = carry;
<a name="l00769"></a>00769 }
<a name="l00770"></a>00770 <span class="keywordflow">if</span> (y = *xb >> 16) {
<a name="l00771"></a>00771 x = xa;
<a name="l00772"></a>00772 xc = xc0;
<a name="l00773"></a>00773 carry = 0;
<a name="l00774"></a>00774 z2 = *xc;
<a name="l00775"></a>00775 <span class="keywordflow">do</span> {
<a name="l00776"></a>00776 z = (*x & 0xffff) * y + (*xc >> 16) + carry;
<a name="l00777"></a>00777 carry = z >> 16;
<a name="l00778"></a>00778 Storeinc(xc, z, z2);
<a name="l00779"></a>00779 z2 = (*x++ >> 16) * y + (*xc & 0xffff) + carry;
<a name="l00780"></a>00780 carry = z2 >> 16;
<a name="l00781"></a>00781 }
<a name="l00782"></a>00782 <span class="keywordflow">while</span>(x < xae);
<a name="l00783"></a>00783 *xc = z2;
<a name="l00784"></a>00784 }
<a name="l00785"></a>00785 }
<a name="l00786"></a>00786 <span class="preprocessor">#else</span>
<a name="l00787"></a>00787 <span class="preprocessor"></span> <span class="keywordflow">for</span>(; xb < xbe; xc0++) {
<a name="l00788"></a>00788 <span class="keywordflow">if</span> (y = *xb++) {
<a name="l00789"></a>00789 x = xa;
<a name="l00790"></a>00790 xc = xc0;
<a name="l00791"></a>00791 carry = 0;
<a name="l00792"></a>00792 <span class="keywordflow">do</span> {
<a name="l00793"></a>00793 z = *x++ * y + *xc + carry;
<a name="l00794"></a>00794 carry = z >> 16;
<a name="l00795"></a>00795 *xc++ = z & 0xffff;
<a name="l00796"></a>00796 }
<a name="l00797"></a>00797 <span class="keywordflow">while</span>(x < xae);
<a name="l00798"></a>00798 *xc = carry;
<a name="l00799"></a>00799 }
<a name="l00800"></a>00800 }
<a name="l00801"></a>00801 <span class="preprocessor">#endif</span>
<a name="l00802"></a>00802 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00803"></a>00803 <span class="preprocessor"></span> <span class="keywordflow">for</span>(xc0 = c->x, xc = xc0 + wc; wc > 0 && !*--xc; --wc) ;
<a name="l00804"></a>00804 c->wds = wc;
<a name="l00805"></a>00805 <span class="keywordflow">return</span> c;
<a name="l00806"></a>00806 }
<a name="l00807"></a>00807
<a name="l00808"></a>00808 <span class="keyword">static</span> Bigint *p5s;
<a name="l00809"></a>00809
<a name="l00810"></a>00810 <span class="keyword">static</span> Bigint *
<a name="l00811"></a>00811 pow5mult
<a name="l00812"></a>00812 (Bigint *b, <span class="keywordtype">int</span> k)
<a name="l00813"></a>00813 {
<a name="l00814"></a>00814 Bigint *b1, *p5, *p51;
<a name="l00815"></a>00815 <span class="keywordtype">int</span> i;
<a name="l00816"></a>00816 <span class="keyword">static</span> <span class="keywordtype">int</span> p05[3] = { 5, 25, 125 };
<a name="l00817"></a>00817
<a name="l00818"></a>00818 <span class="keywordflow">if</span> ((i = k & 3))
<a name="l00819"></a>00819 b = multadd(b, p05[i-1], 0);
<a name="l00820"></a>00820
<a name="l00821"></a>00821 <span class="keywordflow">if</span> (!(k >>= 2))
<a name="l00822"></a>00822 <span class="keywordflow">return</span> b;
<a name="l00823"></a>00823 <span class="keywordflow">if</span> (!(p5 = p5s)) {
<a name="l00824"></a>00824 <span class="comment">/* first time */</span>
<a name="l00825"></a>00825 <span class="preprocessor">#ifdef MULTIPLE_THREADS</span>
<a name="l00826"></a>00826 <span class="preprocessor"></span> ACQUIRE_DTOA_LOCK(1);
<a name="l00827"></a>00827 <span class="keywordflow">if</span> (!(p5 = p5s)) {
<a name="l00828"></a>00828 p5 = p5s = i2b(625);
<a name="l00829"></a>00829 p5->next = 0;
<a name="l00830"></a>00830 }
<a name="l00831"></a>00831 FREE_DTOA_LOCK(1);
<a name="l00832"></a>00832 <span class="preprocessor">#else</span>
<a name="l00833"></a>00833 <span class="preprocessor"></span> p5 = p5s = i2b(625);
<a name="l00834"></a>00834 p5->next = 0;
<a name="l00835"></a>00835 <span class="preprocessor">#endif</span>
<a name="l00836"></a>00836 <span class="preprocessor"></span> }
<a name="l00837"></a>00837 <span class="keywordflow">for</span>(;;) {
<a name="l00838"></a>00838 <span class="keywordflow">if</span> (k & 1) {
<a name="l00839"></a>00839 b1 = mult(b, p5);
<a name="l00840"></a>00840 Bfree(b);
<a name="l00841"></a>00841 b = b1;
<a name="l00842"></a>00842 }
<a name="l00843"></a>00843 <span class="keywordflow">if</span> (!(k >>= 1))
<a name="l00844"></a>00844 <span class="keywordflow">break</span>;
<a name="l00845"></a>00845 <span class="keywordflow">if</span> (!(p51 = p5->next)) {
<a name="l00846"></a>00846 <span class="preprocessor">#ifdef MULTIPLE_THREADS</span>
<a name="l00847"></a>00847 <span class="preprocessor"></span> ACQUIRE_DTOA_LOCK(1);
<a name="l00848"></a>00848 <span class="keywordflow">if</span> (!(p51 = p5->next)) {
<a name="l00849"></a>00849 p51 = p5->next = mult(p5,p5);
<a name="l00850"></a>00850 p51->next = 0;
<a name="l00851"></a>00851 }
<a name="l00852"></a>00852 FREE_DTOA_LOCK(1);
<a name="l00853"></a>00853 <span class="preprocessor">#else</span>
<a name="l00854"></a>00854 <span class="preprocessor"></span> p51 = p5->next = mult(p5,p5);
<a name="l00855"></a>00855 p51->next = 0;
<a name="l00856"></a>00856 <span class="preprocessor">#endif</span>
<a name="l00857"></a>00857 <span class="preprocessor"></span> }
<a name="l00858"></a>00858 p5 = p51;
<a name="l00859"></a>00859 }
<a name="l00860"></a>00860 <span class="keywordflow">return</span> b;
<a name="l00861"></a>00861 }
<a name="l00862"></a>00862
<a name="l00863"></a>00863 <span class="keyword">static</span> Bigint *
<a name="l00864"></a>00864 lshift
<a name="l00865"></a>00865 (Bigint *b, <span class="keywordtype">int</span> k)
<a name="l00866"></a>00866 {
<a name="l00867"></a>00867 <span class="keywordtype">int</span> i, k1, n, n1;
<a name="l00868"></a>00868 Bigint *b1;
<a name="l00869"></a>00869 ULong *x, *x1, *xe, z;
<a name="l00870"></a>00870
<a name="l00871"></a>00871 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l00872"></a>00872 <span class="preprocessor"></span> n = k >> 5;
<a name="l00873"></a>00873 <span class="preprocessor">#else</span>
<a name="l00874"></a>00874 <span class="preprocessor"></span> n = k >> 4;
<a name="l00875"></a>00875 <span class="preprocessor">#endif</span>
<a name="l00876"></a>00876 <span class="preprocessor"></span> k1 = b->k;
<a name="l00877"></a>00877 n1 = n + b->wds + 1;
<a name="l00878"></a>00878 <span class="keywordflow">for</span>(i = b->maxwds; n1 > i; i <<= 1)
<a name="l00879"></a>00879 k1++;
<a name="l00880"></a>00880 b1 = Balloc(k1);
<a name="l00881"></a>00881 x1 = b1->x;
<a name="l00882"></a>00882 <span class="keywordflow">for</span>(i = 0; i < n; i++)
<a name="l00883"></a>00883 *x1++ = 0;
<a name="l00884"></a>00884 x = b->x;
<a name="l00885"></a>00885 xe = x + b->wds;
<a name="l00886"></a>00886 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l00887"></a>00887 <span class="preprocessor"></span> <span class="keywordflow">if</span> (k &= 0x1f) {
<a name="l00888"></a>00888 k1 = 32 - k;
<a name="l00889"></a>00889 z = 0;
<a name="l00890"></a>00890 <span class="keywordflow">do</span> {
<a name="l00891"></a>00891 *x1++ = *x << k | z;
<a name="l00892"></a>00892 z = *x++ >> k1;
<a name="l00893"></a>00893 }
<a name="l00894"></a>00894 <span class="keywordflow">while</span>(x < xe);
<a name="l00895"></a>00895 <span class="keywordflow">if</span> ((*x1 = z))
<a name="l00896"></a>00896 ++n1;
<a name="l00897"></a>00897 }
<a name="l00898"></a>00898 <span class="preprocessor">#else</span>
<a name="l00899"></a>00899 <span class="preprocessor"></span> <span class="keywordflow">if</span> (k &= 0xf) {
<a name="l00900"></a>00900 k1 = 16 - k;
<a name="l00901"></a>00901 z = 0;
<a name="l00902"></a>00902 <span class="keywordflow">do</span> {
<a name="l00903"></a>00903 *x1++ = *x << k & 0xffff | z;
<a name="l00904"></a>00904 z = *x++ >> k1;
<a name="l00905"></a>00905 }
<a name="l00906"></a>00906 <span class="keywordflow">while</span>(x < xe);
<a name="l00907"></a>00907 <span class="keywordflow">if</span> (*x1 = z)
<a name="l00908"></a>00908 ++n1;
<a name="l00909"></a>00909 }
<a name="l00910"></a>00910 <span class="preprocessor">#endif</span>
<a name="l00911"></a>00911 <span class="preprocessor"></span> <span class="keywordflow">else</span> <span class="keywordflow">do</span>
<a name="l00912"></a>00912 *x1++ = *x++;
<a name="l00913"></a>00913 <span class="keywordflow">while</span>(x < xe);
<a name="l00914"></a>00914 b1->wds = n1 - 1;
<a name="l00915"></a>00915 Bfree(b);
<a name="l00916"></a>00916 <span class="keywordflow">return</span> b1;
<a name="l00917"></a>00917 }
<a name="l00918"></a>00918
<a name="l00919"></a>00919 <span class="keyword">static</span> <span class="keywordtype">int</span>
<a name="l00920"></a>00920 cmp
<a name="l00921"></a>00921 (Bigint *a, Bigint *b)
<a name="l00922"></a>00922 {
<a name="l00923"></a>00923 ULong *xa, *xa0, *xb, *xb0;
<a name="l00924"></a>00924 <span class="keywordtype">int</span> i, j;
<a name="l00925"></a>00925
<a name="l00926"></a>00926 i = a->wds;
<a name="l00927"></a>00927 j = b->wds;
<a name="l00928"></a>00928 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l00929"></a>00929 <span class="preprocessor"></span> <span class="keywordflow">if</span> (i > 1 && !a->x[i-1])
<a name="l00930"></a>00930 Bug(<span class="stringliteral">"cmp called with a->x[a->wds-1] == 0"</span>);
<a name="l00931"></a>00931 <span class="keywordflow">if</span> (j > 1 && !b->x[j-1])
<a name="l00932"></a>00932 Bug(<span class="stringliteral">"cmp called with b->x[b->wds-1] == 0"</span>);
<a name="l00933"></a>00933 <span class="preprocessor">#endif</span>
<a name="l00934"></a>00934 <span class="preprocessor"></span> <span class="keywordflow">if</span> (i -= j)
<a name="l00935"></a>00935 <span class="keywordflow">return</span> i;
<a name="l00936"></a>00936 xa0 = a->x;
<a name="l00937"></a>00937 xa = xa0 + j;
<a name="l00938"></a>00938 xb0 = b->x;
<a name="l00939"></a>00939 xb = xb0 + j;
<a name="l00940"></a>00940 <span class="keywordflow">for</span>(;;) {
<a name="l00941"></a>00941 <span class="keywordflow">if</span> (*--xa != *--xb)
<a name="l00942"></a>00942 <span class="keywordflow">return</span> *xa < *xb ? -1 : 1;
<a name="l00943"></a>00943 <span class="keywordflow">if</span> (xa <= xa0)
<a name="l00944"></a>00944 <span class="keywordflow">break</span>;
<a name="l00945"></a>00945 }
<a name="l00946"></a>00946 <span class="keywordflow">return</span> 0;
<a name="l00947"></a>00947 }
<a name="l00948"></a>00948
<a name="l00949"></a>00949 <span class="keyword">static</span> Bigint *
<a name="l00950"></a>00950 diff
<a name="l00951"></a>00951 (Bigint *a, Bigint *b)
<a name="l00952"></a>00952 {
<a name="l00953"></a>00953 Bigint *c;
<a name="l00954"></a>00954 <span class="keywordtype">int</span> i, wa, wb;
<a name="l00955"></a>00955 ULong *xa, *xae, *xb, *xbe, *xc;
<a name="l00956"></a>00956 <span class="preprocessor">#ifdef ULLong</span>
<a name="l00957"></a>00957 <span class="preprocessor"></span> ULLong borrow, y;
<a name="l00958"></a>00958 <span class="preprocessor">#else</span>
<a name="l00959"></a>00959 <span class="preprocessor"></span> ULong borrow, y;
<a name="l00960"></a>00960 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l00961"></a>00961 <span class="preprocessor"></span> ULong z;
<a name="l00962"></a>00962 <span class="preprocessor">#endif</span>
<a name="l00963"></a>00963 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00964"></a>00964 <span class="preprocessor"></span>
<a name="l00965"></a>00965 i = cmp(a,b);
<a name="l00966"></a>00966 <span class="keywordflow">if</span> (!i) {
<a name="l00967"></a>00967 c = Balloc(0);
<a name="l00968"></a>00968 c->wds = 1;
<a name="l00969"></a>00969 c->x[0] = 0;
<a name="l00970"></a>00970 <span class="keywordflow">return</span> c;
<a name="l00971"></a>00971 }
<a name="l00972"></a>00972 <span class="keywordflow">if</span> (i < 0) {
<a name="l00973"></a>00973 c = a;
<a name="l00974"></a>00974 a = b;
<a name="l00975"></a>00975 b = c;
<a name="l00976"></a>00976 i = 1;
<a name="l00977"></a>00977 }
<a name="l00978"></a>00978 <span class="keywordflow">else</span>
<a name="l00979"></a>00979 i = 0;
<a name="l00980"></a>00980 c = Balloc(a->k);
<a name="l00981"></a>00981 c->sign = i;
<a name="l00982"></a>00982 wa = a->wds;
<a name="l00983"></a>00983 xa = a->x;
<a name="l00984"></a>00984 xae = xa + wa;
<a name="l00985"></a>00985 wb = b->wds;
<a name="l00986"></a>00986 xb = b->x;
<a name="l00987"></a>00987 xbe = xb + wb;
<a name="l00988"></a>00988 xc = c->x;
<a name="l00989"></a>00989 borrow = 0;
<a name="l00990"></a>00990 <span class="preprocessor">#ifdef ULLong</span>
<a name="l00991"></a>00991 <span class="preprocessor"></span> <span class="keywordflow">do</span> {
<a name="l00992"></a>00992 y = (ULLong)*xa++ - *xb++ - borrow;
<a name="l00993"></a>00993 borrow = y >> 32 & (ULong)1;
<a name="l00994"></a>00994 *xc++ = (ULong)y & FFFFFFFF;
<a name="l00995"></a>00995 }
<a name="l00996"></a>00996 <span class="keywordflow">while</span>(xb < xbe);
<a name="l00997"></a>00997 <span class="keywordflow">while</span>(xa < xae) {
<a name="l00998"></a>00998 y = *xa++ - borrow;
<a name="l00999"></a>00999 borrow = y >> 32 & (ULong)1;
<a name="l01000"></a>01000 *xc++ = (ULong)y & FFFFFFFF;
<a name="l01001"></a>01001 }
<a name="l01002"></a>01002 <span class="preprocessor">#else</span>
<a name="l01003"></a>01003 <span class="preprocessor"></span><span class="preprocessor">#ifdef Pack_32</span>
<a name="l01004"></a>01004 <span class="preprocessor"></span> <span class="keywordflow">do</span> {
<a name="l01005"></a>01005 y = (*xa & 0xffff) - (*xb & 0xffff) - borrow;
<a name="l01006"></a>01006 borrow = (y & 0x10000) >> 16;
<a name="l01007"></a>01007 z = (*xa++ >> 16) - (*xb++ >> 16) - borrow;
<a name="l01008"></a>01008 borrow = (z & 0x10000) >> 16;
<a name="l01009"></a>01009 Storeinc(xc, z, y);
<a name="l01010"></a>01010 }
<a name="l01011"></a>01011 <span class="keywordflow">while</span>(xb < xbe);
<a name="l01012"></a>01012 <span class="keywordflow">while</span>(xa < xae) {
<a name="l01013"></a>01013 y = (*xa & 0xffff) - borrow;
<a name="l01014"></a>01014 borrow = (y & 0x10000) >> 16;
<a name="l01015"></a>01015 z = (*xa++ >> 16) - borrow;
<a name="l01016"></a>01016 borrow = (z & 0x10000) >> 16;
<a name="l01017"></a>01017 Storeinc(xc, z, y);
<a name="l01018"></a>01018 }
<a name="l01019"></a>01019 <span class="preprocessor">#else</span>
<a name="l01020"></a>01020 <span class="preprocessor"></span> <span class="keywordflow">do</span> {
<a name="l01021"></a>01021 y = *xa++ - *xb++ - borrow;
<a name="l01022"></a>01022 borrow = (y & 0x10000) >> 16;
<a name="l01023"></a>01023 *xc++ = y & 0xffff;
<a name="l01024"></a>01024 }
<a name="l01025"></a>01025 <span class="keywordflow">while</span>(xb < xbe);
<a name="l01026"></a>01026 <span class="keywordflow">while</span>(xa < xae) {
<a name="l01027"></a>01027 y = *xa++ - borrow;
<a name="l01028"></a>01028 borrow = (y & 0x10000) >> 16;
<a name="l01029"></a>01029 *xc++ = y & 0xffff;
<a name="l01030"></a>01030 }
<a name="l01031"></a>01031 <span class="preprocessor">#endif</span>
<a name="l01032"></a>01032 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01033"></a>01033 <span class="preprocessor"></span> <span class="keywordflow">while</span>(!*--xc)
<a name="l01034"></a>01034 wa--;
<a name="l01035"></a>01035 c->wds = wa;
<a name="l01036"></a>01036 <span class="keywordflow">return</span> c;
<a name="l01037"></a>01037 }
<a name="l01038"></a>01038
<a name="l01039"></a>01039 <span class="keyword">static</span> <span class="keywordtype">double</span>
<a name="l01040"></a>01040 ulp
<a name="l01041"></a>01041 (<span class="keywordtype">double</span> dx)
<a name="l01042"></a>01042 {
<a name="l01043"></a>01043 <span class="keyword">register</span> Long L;
<a name="l01044"></a>01044 U x, a;
<a name="l01045"></a>01045
<a name="l01046"></a>01046 dval(x) = dx;
<a name="l01047"></a>01047 L = (word0(x) & Exp_mask) - (P-1)*Exp_msk1;
<a name="l01048"></a>01048 <span class="preprocessor">#ifndef Avoid_Underflow</span>
<a name="l01049"></a>01049 <span class="preprocessor"></span><span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l01050"></a>01050 <span class="preprocessor"></span> <span class="keywordflow">if</span> (L > 0) {
<a name="l01051"></a>01051 <span class="preprocessor">#endif</span>
<a name="l01052"></a>01052 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01053"></a>01053 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
<a name="l01054"></a>01054 <span class="preprocessor"></span> L |= Exp_msk1 >> 4;
<a name="l01055"></a>01055 <span class="preprocessor">#endif</span>
<a name="l01056"></a>01056 <span class="preprocessor"></span> word0(a) = L;
<a name="l01057"></a>01057 word1(a) = 0;
<a name="l01058"></a>01058 <span class="preprocessor">#ifndef Avoid_Underflow</span>
<a name="l01059"></a>01059 <span class="preprocessor"></span><span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l01060"></a>01060 <span class="preprocessor"></span> }
<a name="l01061"></a>01061 <span class="keywordflow">else</span> {
<a name="l01062"></a>01062 L = -L >> Exp_shift;
<a name="l01063"></a>01063 <span class="keywordflow">if</span> (L < Exp_shift) {
<a name="l01064"></a>01064 word0(a) = 0x80000 >> L;
<a name="l01065"></a>01065 word1(a) = 0;
<a name="l01066"></a>01066 }
<a name="l01067"></a>01067 <span class="keywordflow">else</span> {
<a name="l01068"></a>01068 word0(a) = 0;
<a name="l01069"></a>01069 L -= Exp_shift;
<a name="l01070"></a>01070 word1(a) = L >= 31 ? 1 : 1 << 31 - L;
<a name="l01071"></a>01071 }
<a name="l01072"></a>01072 }
<a name="l01073"></a>01073 <span class="preprocessor">#endif</span>
<a name="l01074"></a>01074 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01075"></a>01075 <span class="preprocessor"></span> <span class="keywordflow">return</span> dval(a);
<a name="l01076"></a>01076 }
<a name="l01077"></a>01077
<a name="l01078"></a>01078 <span class="keyword">static</span> <span class="keywordtype">double</span>
<a name="l01079"></a>01079 b2d
<a name="l01080"></a>01080 (Bigint *a, <span class="keywordtype">int</span> *e)
<a name="l01081"></a>01081 {
<a name="l01082"></a>01082 ULong *xa, *xa0, w, y, z;
<a name="l01083"></a>01083 <span class="keywordtype">int</span> k;
<a name="l01084"></a>01084 U d;
<a name="l01085"></a>01085 <span class="preprocessor">#ifdef VAX</span>
<a name="l01086"></a>01086 <span class="preprocessor"></span> ULong d0, d1;
<a name="l01087"></a>01087 <span class="preprocessor">#else</span>
<a name="l01088"></a>01088 <span class="preprocessor"></span><span class="preprocessor">#define d0 word0(d)</span>
<a name="l01089"></a>01089 <span class="preprocessor"></span><span class="preprocessor">#define d1 word1(d)</span>
<a name="l01090"></a>01090 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01091"></a>01091 <span class="preprocessor"></span>
<a name="l01092"></a>01092 xa0 = a->x;
<a name="l01093"></a>01093 xa = xa0 + a->wds;
<a name="l01094"></a>01094 y = *--xa;
<a name="l01095"></a>01095 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l01096"></a>01096 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!y) Bug(<span class="stringliteral">"zero y in b2d"</span>);
<a name="l01097"></a>01097 <span class="preprocessor">#endif</span>
<a name="l01098"></a>01098 <span class="preprocessor"></span> k = hi0bits(y);
<a name="l01099"></a>01099 *e = 32 - k;
<a name="l01100"></a>01100 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l01101"></a>01101 <span class="preprocessor"></span> <span class="keywordflow">if</span> (k < Ebits) {
<a name="l01102"></a>01102 d0 = Exp_1 | y >> Ebits - k;
<a name="l01103"></a>01103 w = xa > xa0 ? *--xa : 0;
<a name="l01104"></a>01104 d1 = y << (32-Ebits) + k | w >> Ebits - k;
<a name="l01105"></a>01105 <span class="keywordflow">goto</span> ret_d;
<a name="l01106"></a>01106 }
<a name="l01107"></a>01107 z = xa > xa0 ? *--xa : 0;
<a name="l01108"></a>01108 <span class="keywordflow">if</span> (k -= Ebits) {
<a name="l01109"></a>01109 d0 = Exp_1 | y << k | z >> 32 - k;
<a name="l01110"></a>01110 y = xa > xa0 ? *--xa : 0;
<a name="l01111"></a>01111 d1 = z << k | y >> 32 - k;
<a name="l01112"></a>01112 }
<a name="l01113"></a>01113 <span class="keywordflow">else</span> {
<a name="l01114"></a>01114 d0 = Exp_1 | y;
<a name="l01115"></a>01115 d1 = z;
<a name="l01116"></a>01116 }
<a name="l01117"></a>01117 <span class="preprocessor">#else</span>
<a name="l01118"></a>01118 <span class="preprocessor"></span> <span class="keywordflow">if</span> (k < Ebits + 16) {
<a name="l01119"></a>01119 z = xa > xa0 ? *--xa : 0;
<a name="l01120"></a>01120 d0 = Exp_1 | y << k - Ebits | z >> Ebits + 16 - k;
<a name="l01121"></a>01121 w = xa > xa0 ? *--xa : 0;
<a name="l01122"></a>01122 y = xa > xa0 ? *--xa : 0;
<a name="l01123"></a>01123 d1 = z << k + 16 - Ebits | w << k - Ebits | y >> 16 + Ebits - k;
<a name="l01124"></a>01124 <span class="keywordflow">goto</span> ret_d;
<a name="l01125"></a>01125 }
<a name="l01126"></a>01126 z = xa > xa0 ? *--xa : 0;
<a name="l01127"></a>01127 w = xa > xa0 ? *--xa : 0;
<a name="l01128"></a>01128 k -= Ebits + 16;
<a name="l01129"></a>01129 d0 = Exp_1 | y << k + 16 | z << k | w >> 16 - k;
<a name="l01130"></a>01130 y = xa > xa0 ? *--xa : 0;
<a name="l01131"></a>01131 d1 = w << k + 16 | y << k;
<a name="l01132"></a>01132 <span class="preprocessor">#endif</span>
<a name="l01133"></a>01133 <span class="preprocessor"></span> ret_d:
<a name="l01134"></a>01134 <span class="preprocessor">#ifdef VAX</span>
<a name="l01135"></a>01135 <span class="preprocessor"></span> word0(d) = d0 >> 16 | d0 << 16;
<a name="l01136"></a>01136 word1(d) = d1 >> 16 | d1 << 16;
<a name="l01137"></a>01137 <span class="preprocessor">#else</span>
<a name="l01138"></a>01138 <span class="preprocessor"></span><span class="preprocessor">#undef d0</span>
<a name="l01139"></a>01139 <span class="preprocessor"></span><span class="preprocessor">#undef d1</span>
<a name="l01140"></a>01140 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01141"></a>01141 <span class="preprocessor"></span> <span class="keywordflow">return</span> dval(d);
<a name="l01142"></a>01142 }
<a name="l01143"></a>01143
<a name="l01144"></a>01144 <span class="keyword">static</span> Bigint *
<a name="l01145"></a>01145 d2b
<a name="l01146"></a>01146 (<span class="keywordtype">double</span> dd, <span class="keywordtype">int</span> *e, <span class="keywordtype">int</span> *bits)
<a name="l01147"></a>01147 {
<a name="l01148"></a>01148 U d;
<a name="l01149"></a>01149 Bigint *b;
<a name="l01150"></a>01150 <span class="keywordtype">int</span> de, k;
<a name="l01151"></a>01151 ULong *x, y, z;
<a name="l01152"></a>01152 <span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l01153"></a>01153 <span class="preprocessor"></span> <span class="keywordtype">int</span> i;
<a name="l01154"></a>01154 <span class="preprocessor">#endif</span>
<a name="l01155"></a>01155 <span class="preprocessor"></span><span class="preprocessor">#ifdef VAX</span>
<a name="l01156"></a>01156 <span class="preprocessor"></span> ULong d0, d1;
<a name="l01157"></a>01157 <span class="preprocessor">#endif</span>
<a name="l01158"></a>01158 <span class="preprocessor"></span> dval(d) = dd;
<a name="l01159"></a>01159 <span class="preprocessor">#ifdef VAX</span>
<a name="l01160"></a>01160 <span class="preprocessor"></span> d0 = word0(d) >> 16 | word0(d) << 16;
<a name="l01161"></a>01161 d1 = word1(d) >> 16 | word1(d) << 16;
<a name="l01162"></a>01162 <span class="preprocessor">#else</span>
<a name="l01163"></a>01163 <span class="preprocessor"></span><span class="preprocessor">#define d0 word0(d)</span>
<a name="l01164"></a>01164 <span class="preprocessor"></span><span class="preprocessor">#define d1 word1(d)</span>
<a name="l01165"></a>01165 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01166"></a>01166 <span class="preprocessor"></span>
<a name="l01167"></a>01167 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l01168"></a>01168 <span class="preprocessor"></span> b = Balloc(1);
<a name="l01169"></a>01169 <span class="preprocessor">#else</span>
<a name="l01170"></a>01170 <span class="preprocessor"></span> b = Balloc(2);
<a name="l01171"></a>01171 <span class="preprocessor">#endif</span>
<a name="l01172"></a>01172 <span class="preprocessor"></span> x = b->x;
<a name="l01173"></a>01173
<a name="l01174"></a>01174 z = d0 & Frac_mask;
<a name="l01175"></a>01175 d0 &= 0x7fffffff; <span class="comment">/* clear sign bit, which we ignore */</span>
<a name="l01176"></a>01176 <span class="preprocessor">#ifdef Sudden_Underflow</span>
<a name="l01177"></a>01177 <span class="preprocessor"></span> de = (int)(d0 >> Exp_shift);
<a name="l01178"></a>01178 <span class="preprocessor">#ifndef IBM</span>
<a name="l01179"></a>01179 <span class="preprocessor"></span> z |= Exp_msk11;
<a name="l01180"></a>01180 <span class="preprocessor">#endif</span>
<a name="l01181"></a>01181 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l01182"></a>01182 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((de = (<span class="keywordtype">int</span>)(d0 >> Exp_shift)))
<a name="l01183"></a>01183 z |= Exp_msk1;
<a name="l01184"></a>01184 <span class="preprocessor">#endif</span>
<a name="l01185"></a>01185 <span class="preprocessor"></span><span class="preprocessor">#ifdef Pack_32</span>
<a name="l01186"></a>01186 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((y = d1)) {
<a name="l01187"></a>01187 <span class="keywordflow">if</span> ((k = lo0bits(&y))) {
<a name="l01188"></a>01188 x[0] = y | z << 32 - k;
<a name="l01189"></a>01189 z >>= k;
<a name="l01190"></a>01190 }
<a name="l01191"></a>01191 <span class="keywordflow">else</span>
<a name="l01192"></a>01192 x[0] = y;
<a name="l01193"></a>01193 <span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l01194"></a>01194 <span class="preprocessor"></span> i =
<a name="l01195"></a>01195 <span class="preprocessor">#endif</span>
<a name="l01196"></a>01196 <span class="preprocessor"></span> b->wds = (x[1] = z) ? 2 : 1;
<a name="l01197"></a>01197 }
<a name="l01198"></a>01198 <span class="keywordflow">else</span> {
<a name="l01199"></a>01199 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l01200"></a>01200 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!z)
<a name="l01201"></a>01201 Bug(<span class="stringliteral">"Zero passed to d2b"</span>);
<a name="l01202"></a>01202 <span class="preprocessor">#endif</span>
<a name="l01203"></a>01203 <span class="preprocessor"></span> k = lo0bits(&z);
<a name="l01204"></a>01204 x[0] = z;
<a name="l01205"></a>01205 <span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l01206"></a>01206 <span class="preprocessor"></span> i =
<a name="l01207"></a>01207 <span class="preprocessor">#endif</span>
<a name="l01208"></a>01208 <span class="preprocessor"></span> b->wds = 1;
<a name="l01209"></a>01209 k += 32;
<a name="l01210"></a>01210 }
<a name="l01211"></a>01211 <span class="preprocessor">#else</span>
<a name="l01212"></a>01212 <span class="preprocessor"></span> <span class="keywordflow">if</span> (y = d1) {
<a name="l01213"></a>01213 <span class="keywordflow">if</span> (k = lo0bits(&y))
<a name="l01214"></a>01214 <span class="keywordflow">if</span> (k >= 16) {
<a name="l01215"></a>01215 x[0] = y | z << 32 - k & 0xffff;
<a name="l01216"></a>01216 x[1] = z >> k - 16 & 0xffff;
<a name="l01217"></a>01217 x[2] = z >> k;
<a name="l01218"></a>01218 i = 2;
<a name="l01219"></a>01219 }
<a name="l01220"></a>01220 <span class="keywordflow">else</span> {
<a name="l01221"></a>01221 x[0] = y & 0xffff;
<a name="l01222"></a>01222 x[1] = y >> 16 | z << 16 - k & 0xffff;
<a name="l01223"></a>01223 x[2] = z >> k & 0xffff;
<a name="l01224"></a>01224 x[3] = z >> k+16;
<a name="l01225"></a>01225 i = 3;
<a name="l01226"></a>01226 }
<a name="l01227"></a>01227 <span class="keywordflow">else</span> {
<a name="l01228"></a>01228 x[0] = y & 0xffff;
<a name="l01229"></a>01229 x[1] = y >> 16;
<a name="l01230"></a>01230 x[2] = z & 0xffff;
<a name="l01231"></a>01231 x[3] = z >> 16;
<a name="l01232"></a>01232 i = 3;
<a name="l01233"></a>01233 }
<a name="l01234"></a>01234 }
<a name="l01235"></a>01235 <span class="keywordflow">else</span> {
<a name="l01236"></a>01236 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l01237"></a>01237 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!z)
<a name="l01238"></a>01238 Bug(<span class="stringliteral">"Zero passed to d2b"</span>);
<a name="l01239"></a>01239 <span class="preprocessor">#endif</span>
<a name="l01240"></a>01240 <span class="preprocessor"></span> k = lo0bits(&z);
<a name="l01241"></a>01241 <span class="keywordflow">if</span> (k >= 16) {
<a name="l01242"></a>01242 x[0] = z;
<a name="l01243"></a>01243 i = 0;
<a name="l01244"></a>01244 }
<a name="l01245"></a>01245 <span class="keywordflow">else</span> {
<a name="l01246"></a>01246 x[0] = z & 0xffff;
<a name="l01247"></a>01247 x[1] = z >> 16;
<a name="l01248"></a>01248 i = 1;
<a name="l01249"></a>01249 }
<a name="l01250"></a>01250 k += 32;
<a name="l01251"></a>01251 }
<a name="l01252"></a>01252 <span class="keywordflow">while</span>(!x[i])
<a name="l01253"></a>01253 --i;
<a name="l01254"></a>01254 b->wds = i + 1;
<a name="l01255"></a>01255 <span class="preprocessor">#endif</span>
<a name="l01256"></a>01256 <span class="preprocessor"></span><span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l01257"></a>01257 <span class="preprocessor"></span> <span class="keywordflow">if</span> (de) {
<a name="l01258"></a>01258 <span class="preprocessor">#endif</span>
<a name="l01259"></a>01259 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
<a name="l01260"></a>01260 <span class="preprocessor"></span> *e = (de - Bias - (P-1) << 2) + k;
<a name="l01261"></a>01261 *bits = 4*P + 8 - k - hi0bits(word0(d) & Frac_mask);
<a name="l01262"></a>01262 <span class="preprocessor">#else</span>
<a name="l01263"></a>01263 <span class="preprocessor"></span> *e = de - Bias - (P-1) + k;
<a name="l01264"></a>01264 *bits = P - k;
<a name="l01265"></a>01265 <span class="preprocessor">#endif</span>
<a name="l01266"></a>01266 <span class="preprocessor"></span><span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l01267"></a>01267 <span class="preprocessor"></span> }
<a name="l01268"></a>01268 <span class="keywordflow">else</span> {
<a name="l01269"></a>01269 *e = de - Bias - (P-1) + 1 + k;
<a name="l01270"></a>01270 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l01271"></a>01271 <span class="preprocessor"></span> *bits = 32*i - hi0bits(x[i-1]);
<a name="l01272"></a>01272 <span class="preprocessor">#else</span>
<a name="l01273"></a>01273 <span class="preprocessor"></span> *bits = (i+2)*16 - hi0bits(x[i]);
<a name="l01274"></a>01274 <span class="preprocessor">#endif</span>
<a name="l01275"></a>01275 <span class="preprocessor"></span> }
<a name="l01276"></a>01276 <span class="preprocessor">#endif</span>
<a name="l01277"></a>01277 <span class="preprocessor"></span> <span class="keywordflow">return</span> b;
<a name="l01278"></a>01278 }
<a name="l01279"></a>01279 <span class="preprocessor">#undef d0</span>
<a name="l01280"></a>01280 <span class="preprocessor"></span><span class="preprocessor">#undef d1</span>
<a name="l01281"></a>01281 <span class="preprocessor"></span>
<a name="l01282"></a>01282 <span class="keyword">static</span> <span class="keywordtype">double</span>
<a name="l01283"></a>01283 ratio
<a name="l01284"></a>01284 (Bigint *a, Bigint *b)
<a name="l01285"></a>01285 {
<a name="l01286"></a>01286 U da, db;
<a name="l01287"></a>01287 <span class="keywordtype">int</span> k, ka, kb;
<a name="l01288"></a>01288
<a name="l01289"></a>01289 dval(da) = b2d(a, &ka);
<a name="l01290"></a>01290 dval(db) = b2d(b, &kb);
<a name="l01291"></a>01291 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l01292"></a>01292 <span class="preprocessor"></span> k = ka - kb + 32*(a->wds - b->wds);
<a name="l01293"></a>01293 <span class="preprocessor">#else</span>
<a name="l01294"></a>01294 <span class="preprocessor"></span> k = ka - kb + 16*(a->wds - b->wds);
<a name="l01295"></a>01295 <span class="preprocessor">#endif</span>
<a name="l01296"></a>01296 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
<a name="l01297"></a>01297 <span class="preprocessor"></span> <span class="keywordflow">if</span> (k > 0) {
<a name="l01298"></a>01298 word0(da) += (k >> 2)*Exp_msk1;
<a name="l01299"></a>01299 <span class="keywordflow">if</span> (k &= 3)
<a name="l01300"></a>01300 dval(da) *= 1 << k;
<a name="l01301"></a>01301 }
<a name="l01302"></a>01302 <span class="keywordflow">else</span> {
<a name="l01303"></a>01303 k = -k;
<a name="l01304"></a>01304 word0(db) += (k >> 2)*Exp_msk1;
<a name="l01305"></a>01305 <span class="keywordflow">if</span> (k &= 3)
<a name="l01306"></a>01306 dval(db) *= 1 << k;
<a name="l01307"></a>01307 }
<a name="l01308"></a>01308 <span class="preprocessor">#else</span>
<a name="l01309"></a>01309 <span class="preprocessor"></span> <span class="keywordflow">if</span> (k > 0)
<a name="l01310"></a>01310 word0(da) += k*Exp_msk1;
<a name="l01311"></a>01311 <span class="keywordflow">else</span> {
<a name="l01312"></a>01312 k = -k;
<a name="l01313"></a>01313 word0(db) += k*Exp_msk1;
<a name="l01314"></a>01314 }
<a name="l01315"></a>01315 <span class="preprocessor">#endif</span>
<a name="l01316"></a>01316 <span class="preprocessor"></span> <span class="keywordflow">return</span> dval(da) / dval(db);
<a name="l01317"></a>01317 }
<a name="l01318"></a>01318
<a name="l01319"></a>01319 <span class="keyword">static</span> CONST <span class="keywordtype">double</span>
<a name="l01320"></a>01320 tens[] = {
<a name="l01321"></a>01321 1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9,
<a name="l01322"></a>01322 1e10, 1e11, 1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19,
<a name="l01323"></a>01323 1e20, 1e21, 1e22
<a name="l01324"></a>01324 <span class="preprocessor">#ifdef VAX</span>
<a name="l01325"></a>01325 <span class="preprocessor"></span> , 1e23, 1e24
<a name="l01326"></a>01326 <span class="preprocessor">#endif</span>
<a name="l01327"></a>01327 <span class="preprocessor"></span> };
<a name="l01328"></a>01328
<a name="l01329"></a>01329 <span class="keyword">static</span> CONST <span class="keywordtype">double</span>
<a name="l01330"></a>01330 <span class="preprocessor">#ifdef IEEE_Arith</span>
<a name="l01331"></a>01331 <span class="preprocessor"></span>bigtens[] = { 1e16, 1e32, 1e64, 1e128, 1e256 };
<a name="l01332"></a>01332 <span class="keyword">static</span> CONST <span class="keywordtype">double</span> tinytens[] = { 1e-16, 1e-32, 1e-64, 1e-128,
<a name="l01333"></a>01333 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l01334"></a>01334 <span class="preprocessor"></span> 9007199254740992.*9007199254740992.e-256
<a name="l01335"></a>01335 <span class="comment">/* = 2^106 * 1e-53 */</span>
<a name="l01336"></a>01336 <span class="preprocessor">#else</span>
<a name="l01337"></a>01337 <span class="preprocessor"></span> 1e-256
<a name="l01338"></a>01338 <span class="preprocessor">#endif</span>
<a name="l01339"></a>01339 <span class="preprocessor"></span> };
<a name="l01340"></a>01340 <span class="comment">/* The factor of 2^53 in tinytens[4] helps us avoid setting the underflow */</span>
<a name="l01341"></a>01341 <span class="comment">/* flag unnecessarily. It leads to a song and dance at the end of strtod. */</span>
<a name="l01342"></a>01342 <span class="preprocessor">#define Scale_Bit 0x10</span>
<a name="l01343"></a>01343 <span class="preprocessor"></span><span class="preprocessor">#define n_bigtens 5</span>
<a name="l01344"></a>01344 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l01345"></a>01345 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
<a name="l01346"></a>01346 <span class="preprocessor"></span>bigtens[] = { 1e16, 1e32, 1e64 };
<a name="l01347"></a>01347 <span class="keyword">static</span> CONST <span class="keywordtype">double</span> tinytens[] = { 1e-16, 1e-32, 1e-64 };
<a name="l01348"></a>01348 <span class="preprocessor">#define n_bigtens 3</span>
<a name="l01349"></a>01349 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l01350"></a>01350 <span class="preprocessor"></span>bigtens[] = { 1e16, 1e32 };
<a name="l01351"></a>01351 <span class="keyword">static</span> CONST <span class="keywordtype">double</span> tinytens[] = { 1e-16, 1e-32 };
<a name="l01352"></a>01352 <span class="preprocessor">#define n_bigtens 2</span>
<a name="l01353"></a>01353 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01354"></a>01354 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01355"></a>01355 <span class="preprocessor"></span>
<a name="l01356"></a>01356 <span class="preprocessor">#ifndef IEEE_Arith</span>
<a name="l01357"></a>01357 <span class="preprocessor"></span><span class="preprocessor">#undef INFNAN_CHECK</span>
<a name="l01358"></a>01358 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01359"></a>01359 <span class="preprocessor"></span>
<a name="l01360"></a>01360 <span class="preprocessor">#ifdef INFNAN_CHECK</span>
<a name="l01361"></a>01361 <span class="preprocessor"></span>
<a name="l01362"></a>01362 <span class="preprocessor">#ifndef NAN_WORD0</span>
<a name="l01363"></a>01363 <span class="preprocessor"></span><span class="preprocessor">#define NAN_WORD0 0x7ff80000</span>
<a name="l01364"></a>01364 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01365"></a>01365 <span class="preprocessor"></span>
<a name="l01366"></a>01366 <span class="preprocessor">#ifndef NAN_WORD1</span>
<a name="l01367"></a>01367 <span class="preprocessor"></span><span class="preprocessor">#define NAN_WORD1 0</span>
<a name="l01368"></a>01368 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01369"></a>01369 <span class="preprocessor"></span>
<a name="l01370"></a>01370 <span class="keyword">static</span> <span class="keywordtype">int</span>
<a name="l01371"></a>01371 match
<a name="l01372"></a>01372 (CONST <span class="keywordtype">char</span> **sp, CONST <span class="keywordtype">char</span> *t)
<a name="l01373"></a>01373 {
<a name="l01374"></a>01374 <span class="keywordtype">int</span> c, d;
<a name="l01375"></a>01375 CONST <span class="keywordtype">char</span> *s = *sp;
<a name="l01376"></a>01376
<a name="l01377"></a>01377 <span class="keywordflow">while</span>((d = *t++)) {
<a name="l01378"></a>01378 <span class="keywordflow">if</span> ((c = *++s) >= <span class="charliteral">'A'</span> && c <= <span class="charliteral">'Z'</span>)
<a name="l01379"></a>01379 c += <span class="charliteral">'a'</span> - <span class="charliteral">'A'</span>;
<a name="l01380"></a>01380 <span class="keywordflow">if</span> (c != d)
<a name="l01381"></a>01381 <span class="keywordflow">return</span> 0;
<a name="l01382"></a>01382 }
<a name="l01383"></a>01383 *sp = s + 1;
<a name="l01384"></a>01384 <span class="keywordflow">return</span> 1;
<a name="l01385"></a>01385 }
<a name="l01386"></a>01386
<a name="l01387"></a>01387 <span class="preprocessor">#ifndef No_Hex_NaN</span>
<a name="l01388"></a>01388 <span class="preprocessor"></span> <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l01389"></a>01389 hexnan
<a name="l01390"></a>01390 (U *rvp, CONST <span class="keywordtype">char</span> **sp)
<a name="l01391"></a>01391 {
<a name="l01392"></a>01392 ULong c, x[2];
<a name="l01393"></a>01393 CONST <span class="keywordtype">char</span> *s;
<a name="l01394"></a>01394 <span class="keywordtype">int</span> havedig, udx0, xshift;
<a name="l01395"></a>01395
<a name="l01396"></a>01396 x[0] = x[1] = 0;
<a name="l01397"></a>01397 havedig = xshift = 0;
<a name="l01398"></a>01398 udx0 = 1;
<a name="l01399"></a>01399 s = *sp;
<a name="l01400"></a>01400 <span class="keywordflow">while</span>((c = *(CONST <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>*)++s)) {
<a name="l01401"></a>01401 <span class="keywordflow">if</span> (c >= <span class="charliteral">'0'</span> && c <= <span class="charliteral">'9'</span>)
<a name="l01402"></a>01402 c -= <span class="charliteral">'0'</span>;
<a name="l01403"></a>01403 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c >= <span class="charliteral">'a'</span> && c <= <span class="charliteral">'f'</span>)
<a name="l01404"></a>01404 c += 10 - <span class="charliteral">'a'</span>;
<a name="l01405"></a>01405 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c >= <span class="charliteral">'A'</span> && c <= <span class="charliteral">'F'</span>)
<a name="l01406"></a>01406 c += 10 - <span class="charliteral">'A'</span>;
<a name="l01407"></a>01407 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c <= <span class="charliteral">' '</span>) {
<a name="l01408"></a>01408 <span class="keywordflow">if</span> (udx0 && havedig) {
<a name="l01409"></a>01409 udx0 = 0;
<a name="l01410"></a>01410 xshift = 1;
<a name="l01411"></a>01411 }
<a name="l01412"></a>01412 <span class="keywordflow">continue</span>;
<a name="l01413"></a>01413 }
<a name="l01414"></a>01414 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="comment">/*(*/</span> c == <span class="charliteral">')'</span> && havedig) {
<a name="l01415"></a>01415 *sp = s + 1;
<a name="l01416"></a>01416 <span class="keywordflow">break</span>;
<a name="l01417"></a>01417 }
<a name="l01418"></a>01418 <span class="keywordflow">else</span>
<a name="l01419"></a>01419 <span class="keywordflow">return</span>; <span class="comment">/* invalid form: don't change *sp */</span>
<a name="l01420"></a>01420 havedig = 1;
<a name="l01421"></a>01421 <span class="keywordflow">if</span> (xshift) {
<a name="l01422"></a>01422 xshift = 0;
<a name="l01423"></a>01423 x[0] = x[1];
<a name="l01424"></a>01424 x[1] = 0;
<a name="l01425"></a>01425 }
<a name="l01426"></a>01426 <span class="keywordflow">if</span> (udx0)
<a name="l01427"></a>01427 x[0] = (x[0] << 4) | (x[1] >> 28);
<a name="l01428"></a>01428 x[1] = (x[1] << 4) | c;
<a name="l01429"></a>01429 }
<a name="l01430"></a>01430 <span class="keywordflow">if</span> ((x[0] &= 0xfffff) || x[1]) {
<a name="l01431"></a>01431 word0(*rvp) = Exp_mask | x[0];
<a name="l01432"></a>01432 word1(*rvp) = x[1];
<a name="l01433"></a>01433 }
<a name="l01434"></a>01434 }
<a name="l01435"></a>01435 <span class="preprocessor">#endif </span><span class="comment">/*No_Hex_NaN*/</span>
<a name="l01436"></a>01436 <span class="preprocessor">#endif </span><span class="comment">/* INFNAN_CHECK */</span>
<a name="l01437"></a>01437
<a name="l01438"></a>01438 <span class="keywordtype">double</span>
<a name="l01439"></a>01439 strtod
<a name="l01440"></a>01440 (CONST <span class="keywordtype">char</span> *s00, <span class="keywordtype">char</span> **se)
<a name="l01441"></a>01441 {
<a name="l01442"></a>01442 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l01443"></a>01443 <span class="preprocessor"></span> <span class="keywordtype">int</span> scale;
<a name="l01444"></a>01444 <span class="preprocessor">#endif</span>
<a name="l01445"></a>01445 <span class="preprocessor"></span> <span class="keywordtype">int</span> bb2, bb5, bbe, bd2, bd5, bbbits, bs2, c, dsign,
<a name="l01446"></a>01446 e, e1, esign, i, j, k, nd, nd0, nf, nz, nz0, sign;
<a name="l01447"></a>01447 CONST <span class="keywordtype">char</span> *s, *s0, *s1;
<a name="l01448"></a>01448 <span class="keywordtype">double</span> aadj, aadj1, adj;
<a name="l01449"></a>01449 U aadj2, rv, rv0;
<a name="l01450"></a>01450 Long L;
<a name="l01451"></a>01451 ULong y, z;
<a name="l01452"></a>01452 Bigint *bb = NULL, *bb1 = NULL, *bd = NULL, *bd0 = NULL, *bs = NULL, *delta = NULL;
<a name="l01453"></a>01453 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l01454"></a>01454 <span class="preprocessor"></span> <span class="keywordtype">int</span> inexact, oldinexact;
<a name="l01455"></a>01455 <span class="preprocessor">#endif</span>
<a name="l01456"></a>01456 <span class="preprocessor"></span><span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l01457"></a>01457 <span class="preprocessor"></span> <span class="keywordtype">int</span> rounding;
<a name="l01458"></a>01458 <span class="preprocessor">#endif</span>
<a name="l01459"></a>01459 <span class="preprocessor"></span><span class="preprocessor">#ifdef USE_LOCALE</span>
<a name="l01460"></a>01460 <span class="preprocessor"></span> CONST <span class="keywordtype">char</span> *s2;
<a name="l01461"></a>01461 <span class="preprocessor">#endif</span>
<a name="l01462"></a>01462 <span class="preprocessor"></span>
<a name="l01463"></a>01463 sign = nz0 = nz = 0;
<a name="l01464"></a>01464 dval(rv) = 0.;
<a name="l01465"></a>01465 <span class="keywordflow">for</span>(s = s00;;s++) <span class="keywordflow">switch</span>(*s) {
<a name="l01466"></a>01466 <span class="keywordflow">case</span> <span class="charliteral">'-'</span>:
<a name="l01467"></a>01467 sign = 1;
<a name="l01468"></a>01468 <span class="comment">/* no break */</span>
<a name="l01469"></a>01469 <span class="keywordflow">case</span> <span class="charliteral">'+'</span>:
<a name="l01470"></a>01470 <span class="keywordflow">if</span> (*++s)
<a name="l01471"></a>01471 <span class="keywordflow">goto</span> break2;
<a name="l01472"></a>01472 <span class="comment">/* no break */</span>
<a name="l01473"></a>01473 <span class="keywordflow">case</span> 0:
<a name="l01474"></a>01474 <span class="keywordflow">goto</span> ret0;
<a name="l01475"></a>01475 <span class="keywordflow">case</span> <span class="charliteral">'\t'</span>:
<a name="l01476"></a>01476 <span class="keywordflow">case</span> <span class="charliteral">'\n'</span>:
<a name="l01477"></a>01477 <span class="keywordflow">case</span> <span class="charliteral">'\v'</span>:
<a name="l01478"></a>01478 <span class="keywordflow">case</span> <span class="charliteral">'\f'</span>:
<a name="l01479"></a>01479 <span class="keywordflow">case</span> <span class="charliteral">'\r'</span>:
<a name="l01480"></a>01480 <span class="keywordflow">case</span> <span class="charliteral">' '</span>:
<a name="l01481"></a>01481 <span class="keywordflow">continue</span>;
<a name="l01482"></a>01482 <span class="keywordflow">default</span>:
<a name="l01483"></a>01483 <span class="keywordflow">goto</span> break2;
<a name="l01484"></a>01484 }
<a name="l01485"></a>01485 break2:
<a name="l01486"></a>01486 <span class="keywordflow">if</span> (*s == <span class="charliteral">'0'</span>) {
<a name="l01487"></a>01487 nz0 = 1;
<a name="l01488"></a>01488 <span class="keywordflow">while</span>(*++s == <span class="charliteral">'0'</span>) ;
<a name="l01489"></a>01489 <span class="keywordflow">if</span> (!*s)
<a name="l01490"></a>01490 <span class="keywordflow">goto</span> ret;
<a name="l01491"></a>01491 }
<a name="l01492"></a>01492 s0 = s;
<a name="l01493"></a>01493 y = z = 0;
<a name="l01494"></a>01494 <span class="keywordflow">for</span>(nd = nf = 0; (c = *s) >= <span class="charliteral">'0'</span> && c <= <span class="charliteral">'9'</span>; nd++, s++)
<a name="l01495"></a>01495 <span class="keywordflow">if</span> (nd < 9)
<a name="l01496"></a>01496 y = 10*y + c - <span class="charliteral">'0'</span>;
<a name="l01497"></a>01497 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (nd < 16)
<a name="l01498"></a>01498 z = 10*z + c - <span class="charliteral">'0'</span>;
<a name="l01499"></a>01499 nd0 = nd;
<a name="l01500"></a>01500 <span class="preprocessor">#ifdef USE_LOCALE</span>
<a name="l01501"></a>01501 <span class="preprocessor"></span> s1 = localeconv()->decimal_point;
<a name="l01502"></a>01502 <span class="keywordflow">if</span> (c == *s1) {
<a name="l01503"></a>01503 c = <span class="charliteral">'.'</span>;
<a name="l01504"></a>01504 <span class="keywordflow">if</span> (*++s1) {
<a name="l01505"></a>01505 s2 = s;
<a name="l01506"></a>01506 <span class="keywordflow">for</span>(;;) {
<a name="l01507"></a>01507 <span class="keywordflow">if</span> (*++s2 != *s1) {
<a name="l01508"></a>01508 c = 0;
<a name="l01509"></a>01509 <span class="keywordflow">break</span>;
<a name="l01510"></a>01510 }
<a name="l01511"></a>01511 <span class="keywordflow">if</span> (!*++s1) {
<a name="l01512"></a>01512 s = s2;
<a name="l01513"></a>01513 <span class="keywordflow">break</span>;
<a name="l01514"></a>01514 }
<a name="l01515"></a>01515 }
<a name="l01516"></a>01516 }
<a name="l01517"></a>01517 }
<a name="l01518"></a>01518 <span class="preprocessor">#endif</span>
<a name="l01519"></a>01519 <span class="preprocessor"></span> <span class="keywordflow">if</span> (c == <span class="charliteral">'.'</span>) {
<a name="l01520"></a>01520 c = *++s;
<a name="l01521"></a>01521 <span class="keywordflow">if</span> (!nd) {
<a name="l01522"></a>01522 <span class="keywordflow">for</span>(; c == <span class="charliteral">'0'</span>; c = *++s)
<a name="l01523"></a>01523 nz++;
<a name="l01524"></a>01524 <span class="keywordflow">if</span> (c > <span class="charliteral">'0'</span> && c <= <span class="charliteral">'9'</span>) {
<a name="l01525"></a>01525 s0 = s;
<a name="l01526"></a>01526 nf += nz;
<a name="l01527"></a>01527 nz = 0;
<a name="l01528"></a>01528 <span class="keywordflow">goto</span> have_dig;
<a name="l01529"></a>01529 }
<a name="l01530"></a>01530 <span class="keywordflow">goto</span> dig_done;
<a name="l01531"></a>01531 }
<a name="l01532"></a>01532 <span class="keywordflow">for</span>(; c >= <span class="charliteral">'0'</span> && c <= <span class="charliteral">'9'</span>; c = *++s) {
<a name="l01533"></a>01533 have_dig:
<a name="l01534"></a>01534 nz++;
<a name="l01535"></a>01535 <span class="keywordflow">if</span> (c -= <span class="charliteral">'0'</span>) {
<a name="l01536"></a>01536 nf += nz;
<a name="l01537"></a>01537 <span class="keywordflow">for</span>(i = 1; i < nz; i++)
<a name="l01538"></a>01538 <span class="keywordflow">if</span> (nd++ < 9)
<a name="l01539"></a>01539 y *= 10;
<a name="l01540"></a>01540 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (nd <= DBL_DIG + 1)
<a name="l01541"></a>01541 z *= 10;
<a name="l01542"></a>01542 <span class="keywordflow">if</span> (nd++ < 9)
<a name="l01543"></a>01543 y = 10*y + c;
<a name="l01544"></a>01544 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (nd <= DBL_DIG + 1)
<a name="l01545"></a>01545 z = 10*z + c;
<a name="l01546"></a>01546 nz = 0;
<a name="l01547"></a>01547 }
<a name="l01548"></a>01548 }
<a name="l01549"></a>01549 }
<a name="l01550"></a>01550 dig_done:
<a name="l01551"></a>01551 e = 0;
<a name="l01552"></a>01552 <span class="keywordflow">if</span> (c == <span class="charliteral">'e'</span> || c == <span class="charliteral">'E'</span>) {
<a name="l01553"></a>01553 <span class="keywordflow">if</span> (!nd && !nz && !nz0) {
<a name="l01554"></a>01554 <span class="keywordflow">goto</span> ret0;
<a name="l01555"></a>01555 }
<a name="l01556"></a>01556 s00 = s;
<a name="l01557"></a>01557 esign = 0;
<a name="l01558"></a>01558 <span class="keywordflow">switch</span>(c = *++s) {
<a name="l01559"></a>01559 <span class="keywordflow">case</span> <span class="charliteral">'-'</span>:
<a name="l01560"></a>01560 esign = 1;
<a name="l01561"></a>01561 <span class="keywordflow">case</span> <span class="charliteral">'+'</span>:
<a name="l01562"></a>01562 c = *++s;
<a name="l01563"></a>01563 }
<a name="l01564"></a>01564 <span class="keywordflow">if</span> (c >= <span class="charliteral">'0'</span> && c <= <span class="charliteral">'9'</span>) {
<a name="l01565"></a>01565 <span class="keywordflow">while</span>(c == <span class="charliteral">'0'</span>)
<a name="l01566"></a>01566 c = *++s;
<a name="l01567"></a>01567 <span class="keywordflow">if</span> (c > <span class="charliteral">'0'</span> && c <= <span class="charliteral">'9'</span>) {
<a name="l01568"></a>01568 L = c - <span class="charliteral">'0'</span>;
<a name="l01569"></a>01569 s1 = s;
<a name="l01570"></a>01570 <span class="keywordflow">while</span>((c = *++s) >= <span class="charliteral">'0'</span> && c <= <span class="charliteral">'9'</span>)
<a name="l01571"></a>01571 L = 10*L + c - <span class="charliteral">'0'</span>;
<a name="l01572"></a>01572 <span class="keywordflow">if</span> (s - s1 > 8 || L > 19999)
<a name="l01573"></a>01573 <span class="comment">/* Avoid confusion from exponents</span>
<a name="l01574"></a>01574 <span class="comment"> * so large that e might overflow.</span>
<a name="l01575"></a>01575 <span class="comment"> */</span>
<a name="l01576"></a>01576 e = 19999; <span class="comment">/* safe for 16 bit ints */</span>
<a name="l01577"></a>01577 <span class="keywordflow">else</span>
<a name="l01578"></a>01578 e = (int)L;
<a name="l01579"></a>01579 <span class="keywordflow">if</span> (esign)
<a name="l01580"></a>01580 e = -e;
<a name="l01581"></a>01581 }
<a name="l01582"></a>01582 <span class="keywordflow">else</span>
<a name="l01583"></a>01583 e = 0;
<a name="l01584"></a>01584 }
<a name="l01585"></a>01585 <span class="keywordflow">else</span>
<a name="l01586"></a>01586 s = s00;
<a name="l01587"></a>01587 }
<a name="l01588"></a>01588 <span class="keywordflow">if</span> (!nd) {
<a name="l01589"></a>01589 <span class="keywordflow">if</span> (!nz && !nz0) {
<a name="l01590"></a>01590 <span class="preprocessor">#ifdef INFNAN_CHECK</span>
<a name="l01591"></a>01591 <span class="preprocessor"></span> <span class="comment">/* Check for Nan and Infinity */</span>
<a name="l01592"></a>01592 <span class="keywordflow">switch</span>(c) {
<a name="l01593"></a>01593 <span class="keywordflow">case</span> <span class="charliteral">'i'</span>:
<a name="l01594"></a>01594 <span class="keywordflow">case</span> <span class="charliteral">'I'</span>:
<a name="l01595"></a>01595 <span class="keywordflow">if</span> (match(&s,<span class="stringliteral">"nf"</span>)) {
<a name="l01596"></a>01596 --s;
<a name="l01597"></a>01597 <span class="keywordflow">if</span> (!match(&s,<span class="stringliteral">"inity"</span>))
<a name="l01598"></a>01598 ++s;
<a name="l01599"></a>01599 word0(rv) = 0x7ff00000;
<a name="l01600"></a>01600 word1(rv) = 0;
<a name="l01601"></a>01601 <span class="keywordflow">goto</span> ret;
<a name="l01602"></a>01602 }
<a name="l01603"></a>01603 <span class="keywordflow">break</span>;
<a name="l01604"></a>01604 <span class="keywordflow">case</span> <span class="charliteral">'n'</span>:
<a name="l01605"></a>01605 <span class="keywordflow">case</span> <span class="charliteral">'N'</span>:
<a name="l01606"></a>01606 <span class="keywordflow">if</span> (match(&s, <span class="stringliteral">"an"</span>)) {
<a name="l01607"></a>01607 word0(rv) = NAN_WORD0;
<a name="l01608"></a>01608 word1(rv) = NAN_WORD1;
<a name="l01609"></a>01609 <span class="preprocessor">#ifndef No_Hex_NaN</span>
<a name="l01610"></a>01610 <span class="preprocessor"></span> <span class="keywordflow">if</span> (*s == <span class="charliteral">'('</span>) <span class="comment">/*)*/</span>
<a name="l01611"></a>01611 hexnan(&rv, &s);
<a name="l01612"></a>01612 <span class="preprocessor">#endif</span>
<a name="l01613"></a>01613 <span class="preprocessor"></span> <span class="keywordflow">goto</span> ret;
<a name="l01614"></a>01614 }
<a name="l01615"></a>01615 }
<a name="l01616"></a>01616 <span class="preprocessor">#endif </span><span class="comment">/* INFNAN_CHECK */</span>
<a name="l01617"></a>01617 ret0:
<a name="l01618"></a>01618 s = s00;
<a name="l01619"></a>01619 sign = 0;
<a name="l01620"></a>01620 }
<a name="l01621"></a>01621 <span class="keywordflow">goto</span> ret;
<a name="l01622"></a>01622 }
<a name="l01623"></a>01623 e1 = e -= nf;
<a name="l01624"></a>01624
<a name="l01625"></a>01625 <span class="comment">/* Now we have nd0 digits, starting at s0, followed by a</span>
<a name="l01626"></a>01626 <span class="comment"> * decimal point, followed by nd-nd0 digits. The number we're</span>
<a name="l01627"></a>01627 <span class="comment"> * after is the integer represented by those digits times</span>
<a name="l01628"></a>01628 <span class="comment"> * 10**e */</span>
<a name="l01629"></a>01629
<a name="l01630"></a>01630 <span class="keywordflow">if</span> (!nd0)
<a name="l01631"></a>01631 nd0 = nd;
<a name="l01632"></a>01632 k = nd < DBL_DIG + 1 ? nd : DBL_DIG + 1;
<a name="l01633"></a>01633 dval(rv) = y;
<a name="l01634"></a>01634 <span class="keywordflow">if</span> (k > 9) {
<a name="l01635"></a>01635 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l01636"></a>01636 <span class="preprocessor"></span> <span class="keywordflow">if</span> (k > DBL_DIG)
<a name="l01637"></a>01637 oldinexact = get_inexact();
<a name="l01638"></a>01638 <span class="preprocessor">#endif</span>
<a name="l01639"></a>01639 <span class="preprocessor"></span> dval(rv) = tens[k - 9] * dval(rv) + z;
<a name="l01640"></a>01640 }
<a name="l01641"></a>01641 bd0 = 0;
<a name="l01642"></a>01642 <span class="keywordflow">if</span> (nd <= DBL_DIG
<a name="l01643"></a>01643 #ifndef RND_PRODQUOT
<a name="l01644"></a>01644 #ifndef Honor_FLT_ROUNDS
<a name="l01645"></a>01645 && Flt_Rounds == 1
<a name="l01646"></a>01646 #endif
<a name="l01647"></a>01647 #endif
<a name="l01648"></a>01648 ) {
<a name="l01649"></a>01649 <span class="keywordflow">if</span> (!e)
<a name="l01650"></a>01650 <span class="keywordflow">goto</span> ret;
<a name="l01651"></a>01651 <span class="keywordflow">if</span> (e > 0) {
<a name="l01652"></a>01652 <span class="keywordflow">if</span> (e <= Ten_pmax) {
<a name="l01653"></a>01653 <span class="preprocessor">#ifdef VAX</span>
<a name="l01654"></a>01654 <span class="preprocessor"></span> <span class="keywordflow">goto</span> vax_ovfl_check;
<a name="l01655"></a>01655 <span class="preprocessor">#else</span>
<a name="l01656"></a>01656 <span class="preprocessor"></span><span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l01657"></a>01657 <span class="preprocessor"></span> <span class="comment">/* round correctly FLT_ROUNDS = 2 or 3 */</span>
<a name="l01658"></a>01658 <span class="keywordflow">if</span> (sign) {
<a name="l01659"></a>01659 rv = -rv;
<a name="l01660"></a>01660 sign = 0;
<a name="l01661"></a>01661 }
<a name="l01662"></a>01662 <span class="preprocessor">#endif</span>
<a name="l01663"></a>01663 <span class="preprocessor"></span> <span class="comment">/* rv = */</span> rounded_product(dval(rv), tens[e]);
<a name="l01664"></a>01664 <span class="keywordflow">goto</span> ret;
<a name="l01665"></a>01665 <span class="preprocessor">#endif</span>
<a name="l01666"></a>01666 <span class="preprocessor"></span> }
<a name="l01667"></a>01667 i = DBL_DIG - nd;
<a name="l01668"></a>01668 <span class="keywordflow">if</span> (e <= Ten_pmax + i) {
<a name="l01669"></a>01669 <span class="comment">/* A fancier test would sometimes let us do</span>
<a name="l01670"></a>01670 <span class="comment"> * this for larger i values.</span>
<a name="l01671"></a>01671 <span class="comment"> */</span>
<a name="l01672"></a>01672 <span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l01673"></a>01673 <span class="preprocessor"></span> <span class="comment">/* round correctly FLT_ROUNDS = 2 or 3 */</span>
<a name="l01674"></a>01674 <span class="keywordflow">if</span> (sign) {
<a name="l01675"></a>01675 rv = -rv;
<a name="l01676"></a>01676 sign = 0;
<a name="l01677"></a>01677 }
<a name="l01678"></a>01678 <span class="preprocessor">#endif</span>
<a name="l01679"></a>01679 <span class="preprocessor"></span> e -= i;
<a name="l01680"></a>01680 dval(rv) *= tens[i];
<a name="l01681"></a>01681 <span class="preprocessor">#ifdef VAX</span>
<a name="l01682"></a>01682 <span class="preprocessor"></span> <span class="comment">/* VAX exponent range is so narrow we must</span>
<a name="l01683"></a>01683 <span class="comment"> * worry about overflow here...</span>
<a name="l01684"></a>01684 <span class="comment"> */</span>
<a name="l01685"></a>01685 vax_ovfl_check:
<a name="l01686"></a>01686 word0(rv) -= P*Exp_msk1;
<a name="l01687"></a>01687 <span class="comment">/* rv = */</span> rounded_product(dval(rv), tens[e]);
<a name="l01688"></a>01688 <span class="keywordflow">if</span> ((word0(rv) & Exp_mask)
<a name="l01689"></a>01689 > Exp_msk1*(DBL_MAX_EXP+Bias-1-P))
<a name="l01690"></a>01690 <span class="keywordflow">goto</span> ovfl;
<a name="l01691"></a>01691 word0(rv) += P*Exp_msk1;
<a name="l01692"></a>01692 <span class="preprocessor">#else</span>
<a name="l01693"></a>01693 <span class="preprocessor"></span> <span class="comment">/* rv = */</span> rounded_product(dval(rv), tens[e]);
<a name="l01694"></a>01694 <span class="preprocessor">#endif</span>
<a name="l01695"></a>01695 <span class="preprocessor"></span> <span class="keywordflow">goto</span> ret;
<a name="l01696"></a>01696 }
<a name="l01697"></a>01697 }
<a name="l01698"></a>01698 <span class="preprocessor">#ifndef Inaccurate_Divide</span>
<a name="l01699"></a>01699 <span class="preprocessor"></span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (e >= -Ten_pmax) {
<a name="l01700"></a>01700 <span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l01701"></a>01701 <span class="preprocessor"></span> <span class="comment">/* round correctly FLT_ROUNDS = 2 or 3 */</span>
<a name="l01702"></a>01702 <span class="keywordflow">if</span> (sign) {
<a name="l01703"></a>01703 rv = -rv;
<a name="l01704"></a>01704 sign = 0;
<a name="l01705"></a>01705 }
<a name="l01706"></a>01706 <span class="preprocessor">#endif</span>
<a name="l01707"></a>01707 <span class="preprocessor"></span> <span class="comment">/* rv = */</span> rounded_quotient(dval(rv), tens[-e]);
<a name="l01708"></a>01708 <span class="keywordflow">goto</span> ret;
<a name="l01709"></a>01709 }
<a name="l01710"></a>01710 <span class="preprocessor">#endif</span>
<a name="l01711"></a>01711 <span class="preprocessor"></span> }
<a name="l01712"></a>01712 e1 += nd - k;
<a name="l01713"></a>01713
<a name="l01714"></a>01714 <span class="preprocessor">#ifdef IEEE_Arith</span>
<a name="l01715"></a>01715 <span class="preprocessor"></span><span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l01716"></a>01716 <span class="preprocessor"></span> inexact = 1;
<a name="l01717"></a>01717 <span class="keywordflow">if</span> (k <= DBL_DIG)
<a name="l01718"></a>01718 oldinexact = get_inexact();
<a name="l01719"></a>01719 <span class="preprocessor">#endif</span>
<a name="l01720"></a>01720 <span class="preprocessor"></span><span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l01721"></a>01721 <span class="preprocessor"></span> scale = 0;
<a name="l01722"></a>01722 <span class="preprocessor">#endif</span>
<a name="l01723"></a>01723 <span class="preprocessor"></span><span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l01724"></a>01724 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((rounding = Flt_Rounds) >= 2) {
<a name="l01725"></a>01725 <span class="keywordflow">if</span> (sign)
<a name="l01726"></a>01726 rounding = rounding == 2 ? 0 : 2;
<a name="l01727"></a>01727 <span class="keywordflow">else</span>
<a name="l01728"></a>01728 <span class="keywordflow">if</span> (rounding != 2)
<a name="l01729"></a>01729 rounding = 0;
<a name="l01730"></a>01730 }
<a name="l01731"></a>01731 <span class="preprocessor">#endif</span>
<a name="l01732"></a>01732 <span class="preprocessor"></span><span class="preprocessor">#endif </span><span class="comment">/*IEEE_Arith*/</span>
<a name="l01733"></a>01733
<a name="l01734"></a>01734 <span class="comment">/* Get starting approximation = rv * 10**e1 */</span>
<a name="l01735"></a>01735
<a name="l01736"></a>01736 <span class="keywordflow">if</span> (e1 > 0) {
<a name="l01737"></a>01737 <span class="keywordflow">if</span> ((i = e1 & 15))
<a name="l01738"></a>01738 dval(rv) *= tens[i];
<a name="l01739"></a>01739 <span class="keywordflow">if</span> (e1 &= ~15) {
<a name="l01740"></a>01740 <span class="keywordflow">if</span> (e1 > DBL_MAX_10_EXP) {
<a name="l01741"></a>01741 ovfl:
<a name="l01742"></a>01742 <span class="preprocessor">#ifndef NO_ERRNO</span>
<a name="l01743"></a>01743 <span class="preprocessor"></span> errno = ERANGE;
<a name="l01744"></a>01744 <span class="preprocessor">#endif</span>
<a name="l01745"></a>01745 <span class="preprocessor"></span> <span class="comment">/* Can't trust HUGE_VAL */</span>
<a name="l01746"></a>01746 <span class="preprocessor">#ifdef IEEE_Arith</span>
<a name="l01747"></a>01747 <span class="preprocessor"></span><span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l01748"></a>01748 <span class="preprocessor"></span> <span class="keywordflow">switch</span>(rounding) {
<a name="l01749"></a>01749 <span class="keywordflow">case</span> 0: <span class="comment">/* toward 0 */</span>
<a name="l01750"></a>01750 <span class="keywordflow">case</span> 3: <span class="comment">/* toward -infinity */</span>
<a name="l01751"></a>01751 word0(rv) = Big0;
<a name="l01752"></a>01752 word1(rv) = Big1;
<a name="l01753"></a>01753 <span class="keywordflow">break</span>;
<a name="l01754"></a>01754 <span class="keywordflow">default</span>:
<a name="l01755"></a>01755 word0(rv) = Exp_mask;
<a name="l01756"></a>01756 word1(rv) = 0;
<a name="l01757"></a>01757 }
<a name="l01758"></a>01758 <span class="preprocessor">#else </span><span class="comment">/*Honor_FLT_ROUNDS*/</span>
<a name="l01759"></a>01759 word0(rv) = Exp_mask;
<a name="l01760"></a>01760 word1(rv) = 0;
<a name="l01761"></a>01761 <span class="preprocessor">#endif </span><span class="comment">/*Honor_FLT_ROUNDS*/</span>
<a name="l01762"></a>01762 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l01763"></a>01763 <span class="preprocessor"></span> <span class="comment">/* set overflow bit */</span>
<a name="l01764"></a>01764 dval(rv0) = 1e300;
<a name="l01765"></a>01765 dval(rv0) *= dval(rv0);
<a name="l01766"></a>01766 <span class="preprocessor">#endif</span>
<a name="l01767"></a>01767 <span class="preprocessor"></span><span class="preprocessor">#else </span><span class="comment">/*IEEE_Arith*/</span>
<a name="l01768"></a>01768 word0(rv) = Big0;
<a name="l01769"></a>01769 word1(rv) = Big1;
<a name="l01770"></a>01770 <span class="preprocessor">#endif </span><span class="comment">/*IEEE_Arith*/</span>
<a name="l01771"></a>01771 <span class="keywordflow">if</span> (bd0)
<a name="l01772"></a>01772 <span class="keywordflow">goto</span> retfree;
<a name="l01773"></a>01773 <span class="keywordflow">goto</span> ret;
<a name="l01774"></a>01774 }
<a name="l01775"></a>01775 e1 >>= 4;
<a name="l01776"></a>01776 <span class="keywordflow">for</span>(j = 0; e1 > 1; j++, e1 >>= 1)
<a name="l01777"></a>01777 <span class="keywordflow">if</span> (e1 & 1)
<a name="l01778"></a>01778 dval(rv) *= bigtens[j];
<a name="l01779"></a>01779 <span class="comment">/* The last multiplication could overflow. */</span>
<a name="l01780"></a>01780 word0(rv) -= P*Exp_msk1;
<a name="l01781"></a>01781 dval(rv) *= bigtens[j];
<a name="l01782"></a>01782 <span class="keywordflow">if</span> ((z = word0(rv) & Exp_mask)
<a name="l01783"></a>01783 > Exp_msk1*(DBL_MAX_EXP+Bias-P))
<a name="l01784"></a>01784 <span class="keywordflow">goto</span> ovfl;
<a name="l01785"></a>01785 <span class="keywordflow">if</span> (z > Exp_msk1*(DBL_MAX_EXP+Bias-1-P)) {
<a name="l01786"></a>01786 <span class="comment">/* set to largest number */</span>
<a name="l01787"></a>01787 <span class="comment">/* (Can't trust DBL_MAX) */</span>
<a name="l01788"></a>01788 word0(rv) = Big0;
<a name="l01789"></a>01789 word1(rv) = Big1;
<a name="l01790"></a>01790 }
<a name="l01791"></a>01791 <span class="keywordflow">else</span>
<a name="l01792"></a>01792 word0(rv) += P*Exp_msk1;
<a name="l01793"></a>01793 }
<a name="l01794"></a>01794 }
<a name="l01795"></a>01795 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (e1 < 0) {
<a name="l01796"></a>01796 e1 = -e1;
<a name="l01797"></a>01797 <span class="keywordflow">if</span> ((i = e1 & 15))
<a name="l01798"></a>01798 dval(rv) /= tens[i];
<a name="l01799"></a>01799 <span class="keywordflow">if</span> (e1 >>= 4) {
<a name="l01800"></a>01800 <span class="keywordflow">if</span> (e1 >= 1 << n_bigtens)
<a name="l01801"></a>01801 <span class="keywordflow">goto</span> undfl;
<a name="l01802"></a>01802 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l01803"></a>01803 <span class="preprocessor"></span> <span class="keywordflow">if</span> (e1 & Scale_Bit)
<a name="l01804"></a>01804 scale = 2*P;
<a name="l01805"></a>01805 <span class="keywordflow">for</span>(j = 0; e1 > 0; j++, e1 >>= 1)
<a name="l01806"></a>01806 <span class="keywordflow">if</span> (e1 & 1)
<a name="l01807"></a>01807 dval(rv) *= tinytens[j];
<a name="l01808"></a>01808 <span class="keywordflow">if</span> (scale && (j = 2*P + 1 - ((word0(rv) & Exp_mask)
<a name="l01809"></a>01809 >> Exp_shift)) > 0) {
<a name="l01810"></a>01810 <span class="comment">/* scaled rv is denormal; zap j low bits */</span>
<a name="l01811"></a>01811 <span class="keywordflow">if</span> (j >= 32) {
<a name="l01812"></a>01812 word1(rv) = 0;
<a name="l01813"></a>01813 <span class="keywordflow">if</span> (j >= 53)
<a name="l01814"></a>01814 word0(rv) = (P+2)*Exp_msk1;
<a name="l01815"></a>01815 <span class="keywordflow">else</span>
<a name="l01816"></a>01816 word0(rv) &= 0xffffffff << j-32;
<a name="l01817"></a>01817 }
<a name="l01818"></a>01818 <span class="keywordflow">else</span>
<a name="l01819"></a>01819 word1(rv) &= 0xffffffff << j;
<a name="l01820"></a>01820 }
<a name="l01821"></a>01821 <span class="preprocessor">#else</span>
<a name="l01822"></a>01822 <span class="preprocessor"></span> <span class="keywordflow">for</span>(j = 0; e1 > 1; j++, e1 >>= 1)
<a name="l01823"></a>01823 <span class="keywordflow">if</span> (e1 & 1)
<a name="l01824"></a>01824 dval(rv) *= tinytens[j];
<a name="l01825"></a>01825 <span class="comment">/* The last multiplication could underflow. */</span>
<a name="l01826"></a>01826 dval(rv0) = dval(rv);
<a name="l01827"></a>01827 dval(rv) *= tinytens[j];
<a name="l01828"></a>01828 <span class="keywordflow">if</span> (!dval(rv)) {
<a name="l01829"></a>01829 dval(rv) = 2.*dval(rv0);
<a name="l01830"></a>01830 dval(rv) *= tinytens[j];
<a name="l01831"></a>01831 <span class="preprocessor">#endif</span>
<a name="l01832"></a>01832 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!dval(rv)) {
<a name="l01833"></a>01833 undfl:
<a name="l01834"></a>01834 dval(rv) = 0.;
<a name="l01835"></a>01835 <span class="preprocessor">#ifndef NO_ERRNO</span>
<a name="l01836"></a>01836 <span class="preprocessor"></span> errno = ERANGE;
<a name="l01837"></a>01837 <span class="preprocessor">#endif</span>
<a name="l01838"></a>01838 <span class="preprocessor"></span> <span class="keywordflow">if</span> (bd0)
<a name="l01839"></a>01839 <span class="keywordflow">goto</span> retfree;
<a name="l01840"></a>01840 <span class="keywordflow">goto</span> ret;
<a name="l01841"></a>01841 }
<a name="l01842"></a>01842 <span class="preprocessor">#ifndef Avoid_Underflow</span>
<a name="l01843"></a>01843 <span class="preprocessor"></span> word0(rv) = Tiny0;
<a name="l01844"></a>01844 word1(rv) = Tiny1;
<a name="l01845"></a>01845 <span class="comment">/* The refinement below will clean</span>
<a name="l01846"></a>01846 <span class="comment"> * this approximation up.</span>
<a name="l01847"></a>01847 <span class="comment"> */</span>
<a name="l01848"></a>01848 }
<a name="l01849"></a>01849 <span class="preprocessor">#endif</span>
<a name="l01850"></a>01850 <span class="preprocessor"></span> }
<a name="l01851"></a>01851 }
<a name="l01852"></a>01852
<a name="l01853"></a>01853 <span class="comment">/* Now the hard part -- adjusting rv to the correct value.*/</span>
<a name="l01854"></a>01854
<a name="l01855"></a>01855 <span class="comment">/* Put digits into bd: true value = bd * 10^e */</span>
<a name="l01856"></a>01856
<a name="l01857"></a>01857 bd0 = s2b(s0, nd0, nd, y);
<a name="l01858"></a>01858
<a name="l01859"></a>01859 <span class="keywordflow">for</span>(;;) {
<a name="l01860"></a>01860 bd = Balloc(bd0->k);
<a name="l01861"></a>01861 Bcopy(bd, bd0);
<a name="l01862"></a>01862 bb = d2b(dval(rv), &bbe, &bbbits); <span class="comment">/* rv = bb * 2^bbe */</span>
<a name="l01863"></a>01863 bs = i2b(1);
<a name="l01864"></a>01864
<a name="l01865"></a>01865 <span class="keywordflow">if</span> (e >= 0) {
<a name="l01866"></a>01866 bb2 = bb5 = 0;
<a name="l01867"></a>01867 bd2 = bd5 = e;
<a name="l01868"></a>01868 }
<a name="l01869"></a>01869 <span class="keywordflow">else</span> {
<a name="l01870"></a>01870 bb2 = bb5 = -e;
<a name="l01871"></a>01871 bd2 = bd5 = 0;
<a name="l01872"></a>01872 }
<a name="l01873"></a>01873 <span class="keywordflow">if</span> (bbe >= 0)
<a name="l01874"></a>01874 bb2 += bbe;
<a name="l01875"></a>01875 <span class="keywordflow">else</span>
<a name="l01876"></a>01876 bd2 -= bbe;
<a name="l01877"></a>01877 bs2 = bb2;
<a name="l01878"></a>01878 <span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l01879"></a>01879 <span class="preprocessor"></span> <span class="keywordflow">if</span> (rounding != 1)
<a name="l01880"></a>01880 bs2++;
<a name="l01881"></a>01881 <span class="preprocessor">#endif</span>
<a name="l01882"></a>01882 <span class="preprocessor"></span><span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l01883"></a>01883 <span class="preprocessor"></span> j = bbe - scale;
<a name="l01884"></a>01884 i = j + bbbits - 1; <span class="comment">/* logb(rv) */</span>
<a name="l01885"></a>01885 <span class="keywordflow">if</span> (i < Emin) <span class="comment">/* denormal */</span>
<a name="l01886"></a>01886 j += P - Emin;
<a name="l01887"></a>01887 <span class="keywordflow">else</span>
<a name="l01888"></a>01888 j = P + 1 - bbbits;
<a name="l01889"></a>01889 <span class="preprocessor">#else </span><span class="comment">/*Avoid_Underflow*/</span>
<a name="l01890"></a>01890 <span class="preprocessor">#ifdef Sudden_Underflow</span>
<a name="l01891"></a>01891 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
<a name="l01892"></a>01892 <span class="preprocessor"></span> j = 1 + 4*P - 3 - bbbits + ((bbe + bbbits - 1) & 3);
<a name="l01893"></a>01893 <span class="preprocessor">#else</span>
<a name="l01894"></a>01894 <span class="preprocessor"></span> j = P + 1 - bbbits;
<a name="l01895"></a>01895 <span class="preprocessor">#endif</span>
<a name="l01896"></a>01896 <span class="preprocessor"></span><span class="preprocessor">#else </span><span class="comment">/*Sudden_Underflow*/</span>
<a name="l01897"></a>01897 j = bbe;
<a name="l01898"></a>01898 i = j + bbbits - 1; <span class="comment">/* logb(rv) */</span>
<a name="l01899"></a>01899 <span class="keywordflow">if</span> (i < Emin) <span class="comment">/* denormal */</span>
<a name="l01900"></a>01900 j += P - Emin;
<a name="l01901"></a>01901 <span class="keywordflow">else</span>
<a name="l01902"></a>01902 j = P + 1 - bbbits;
<a name="l01903"></a>01903 <span class="preprocessor">#endif </span><span class="comment">/*Sudden_Underflow*/</span>
<a name="l01904"></a>01904 <span class="preprocessor">#endif </span><span class="comment">/*Avoid_Underflow*/</span>
<a name="l01905"></a>01905 bb2 += j;
<a name="l01906"></a>01906 bd2 += j;
<a name="l01907"></a>01907 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l01908"></a>01908 <span class="preprocessor"></span> bd2 += scale;
<a name="l01909"></a>01909 <span class="preprocessor">#endif</span>
<a name="l01910"></a>01910 <span class="preprocessor"></span> i = bb2 < bd2 ? bb2 : bd2;
<a name="l01911"></a>01911 <span class="keywordflow">if</span> (i > bs2)
<a name="l01912"></a>01912 i = bs2;
<a name="l01913"></a>01913 <span class="keywordflow">if</span> (i > 0) {
<a name="l01914"></a>01914 bb2 -= i;
<a name="l01915"></a>01915 bd2 -= i;
<a name="l01916"></a>01916 bs2 -= i;
<a name="l01917"></a>01917 }
<a name="l01918"></a>01918 <span class="keywordflow">if</span> (bb5 > 0) {
<a name="l01919"></a>01919 bs = pow5mult(bs, bb5);
<a name="l01920"></a>01920 bb1 = mult(bs, bb);
<a name="l01921"></a>01921 Bfree(bb);
<a name="l01922"></a>01922 bb = bb1;
<a name="l01923"></a>01923 }
<a name="l01924"></a>01924 <span class="keywordflow">if</span> (bb2 > 0)
<a name="l01925"></a>01925 bb = lshift(bb, bb2);
<a name="l01926"></a>01926 <span class="keywordflow">if</span> (bd5 > 0)
<a name="l01927"></a>01927 bd = pow5mult(bd, bd5);
<a name="l01928"></a>01928 <span class="keywordflow">if</span> (bd2 > 0)
<a name="l01929"></a>01929 bd = lshift(bd, bd2);
<a name="l01930"></a>01930 <span class="keywordflow">if</span> (bs2 > 0)
<a name="l01931"></a>01931 bs = lshift(bs, bs2);
<a name="l01932"></a>01932 delta = diff(bb, bd);
<a name="l01933"></a>01933 dsign = delta->sign;
<a name="l01934"></a>01934 delta->sign = 0;
<a name="l01935"></a>01935 i = cmp(delta, bs);
<a name="l01936"></a>01936 <span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l01937"></a>01937 <span class="preprocessor"></span> <span class="keywordflow">if</span> (rounding != 1) {
<a name="l01938"></a>01938 <span class="keywordflow">if</span> (i < 0) {
<a name="l01939"></a>01939 <span class="comment">/* Error is less than an ulp */</span>
<a name="l01940"></a>01940 <span class="keywordflow">if</span> (!delta->x[0] && delta->wds <= 1) {
<a name="l01941"></a>01941 <span class="comment">/* exact */</span>
<a name="l01942"></a>01942 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l01943"></a>01943 <span class="preprocessor"></span> inexact = 0;
<a name="l01944"></a>01944 <span class="preprocessor">#endif</span>
<a name="l01945"></a>01945 <span class="preprocessor"></span> <span class="keywordflow">break</span>;
<a name="l01946"></a>01946 }
<a name="l01947"></a>01947 <span class="keywordflow">if</span> (rounding) {
<a name="l01948"></a>01948 <span class="keywordflow">if</span> (dsign) {
<a name="l01949"></a>01949 adj = 1.;
<a name="l01950"></a>01950 <span class="keywordflow">goto</span> apply_adj;
<a name="l01951"></a>01951 }
<a name="l01952"></a>01952 }
<a name="l01953"></a>01953 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!dsign) {
<a name="l01954"></a>01954 adj = -1.;
<a name="l01955"></a>01955 <span class="keywordflow">if</span> (!word1(rv)
<a name="l01956"></a>01956 && !(word0(rv) & Frac_mask)) {
<a name="l01957"></a>01957 y = word0(rv) & Exp_mask;
<a name="l01958"></a>01958 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l01959"></a>01959 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!scale || y > 2*P*Exp_msk1)
<a name="l01960"></a>01960 <span class="preprocessor">#else</span>
<a name="l01961"></a>01961 <span class="preprocessor"></span> <span class="keywordflow">if</span> (y)
<a name="l01962"></a>01962 <span class="preprocessor">#endif</span>
<a name="l01963"></a>01963 <span class="preprocessor"></span> {
<a name="l01964"></a>01964 delta = lshift(delta,Log2P);
<a name="l01965"></a>01965 <span class="keywordflow">if</span> (cmp(delta, bs) <= 0)
<a name="l01966"></a>01966 adj = -0.5;
<a name="l01967"></a>01967 }
<a name="l01968"></a>01968 }
<a name="l01969"></a>01969 apply_adj:
<a name="l01970"></a>01970 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l01971"></a>01971 <span class="preprocessor"></span> <span class="keywordflow">if</span> (scale && (y = word0(rv) & Exp_mask)
<a name="l01972"></a>01972 <= 2*P*Exp_msk1)
<a name="l01973"></a>01973 word0(adj) += (2*P+1)*Exp_msk1 - y;
<a name="l01974"></a>01974 <span class="preprocessor">#else</span>
<a name="l01975"></a>01975 <span class="preprocessor"></span><span class="preprocessor">#ifdef Sudden_Underflow</span>
<a name="l01976"></a>01976 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((word0(rv) & Exp_mask) <=
<a name="l01977"></a>01977 P*Exp_msk1) {
<a name="l01978"></a>01978 word0(rv) += P*Exp_msk1;
<a name="l01979"></a>01979 dval(rv) += adj*ulp(dval(rv));
<a name="l01980"></a>01980 word0(rv) -= P*Exp_msk1;
<a name="l01981"></a>01981 }
<a name="l01982"></a>01982 <span class="keywordflow">else</span>
<a name="l01983"></a>01983 <span class="preprocessor">#endif </span><span class="comment">/*Sudden_Underflow*/</span>
<a name="l01984"></a>01984 <span class="preprocessor">#endif </span><span class="comment">/*Avoid_Underflow*/</span>
<a name="l01985"></a>01985 dval(rv) += adj*ulp(dval(rv));
<a name="l01986"></a>01986 }
<a name="l01987"></a>01987 <span class="keywordflow">break</span>;
<a name="l01988"></a>01988 }
<a name="l01989"></a>01989 adj = ratio(delta, bs);
<a name="l01990"></a>01990 <span class="keywordflow">if</span> (adj < 1.)
<a name="l01991"></a>01991 adj = 1.;
<a name="l01992"></a>01992 <span class="keywordflow">if</span> (adj <= 0x7ffffffe) {
<a name="l01993"></a>01993 <span class="comment">/* adj = rounding ? ceil(adj) : floor(adj); */</span>
<a name="l01994"></a>01994 y = adj;
<a name="l01995"></a>01995 <span class="keywordflow">if</span> (y != adj) {
<a name="l01996"></a>01996 <span class="keywordflow">if</span> (!((rounding>>1) ^ dsign))
<a name="l01997"></a>01997 y++;
<a name="l01998"></a>01998 adj = y;
<a name="l01999"></a>01999 }
<a name="l02000"></a>02000 }
<a name="l02001"></a>02001 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l02002"></a>02002 <span class="preprocessor"></span> <span class="keywordflow">if</span> (scale && (y = word0(rv) & Exp_mask) <= 2*P*Exp_msk1)
<a name="l02003"></a>02003 word0(adj) += (2*P+1)*Exp_msk1 - y;
<a name="l02004"></a>02004 <span class="preprocessor">#else</span>
<a name="l02005"></a>02005 <span class="preprocessor"></span><span class="preprocessor">#ifdef Sudden_Underflow</span>
<a name="l02006"></a>02006 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((word0(rv) & Exp_mask) <= P*Exp_msk1) {
<a name="l02007"></a>02007 word0(rv) += P*Exp_msk1;
<a name="l02008"></a>02008 adj *= ulp(dval(rv));
<a name="l02009"></a>02009 <span class="keywordflow">if</span> (dsign)
<a name="l02010"></a>02010 dval(rv) += adj;
<a name="l02011"></a>02011 <span class="keywordflow">else</span>
<a name="l02012"></a>02012 dval(rv) -= adj;
<a name="l02013"></a>02013 word0(rv) -= P*Exp_msk1;
<a name="l02014"></a>02014 <span class="keywordflow">goto</span> cont;
<a name="l02015"></a>02015 }
<a name="l02016"></a>02016 <span class="preprocessor">#endif </span><span class="comment">/*Sudden_Underflow*/</span>
<a name="l02017"></a>02017 <span class="preprocessor">#endif </span><span class="comment">/*Avoid_Underflow*/</span>
<a name="l02018"></a>02018 adj *= ulp(dval(rv));
<a name="l02019"></a>02019 <span class="keywordflow">if</span> (dsign)
<a name="l02020"></a>02020 dval(rv) += adj;
<a name="l02021"></a>02021 <span class="keywordflow">else</span>
<a name="l02022"></a>02022 dval(rv) -= adj;
<a name="l02023"></a>02023 <span class="keywordflow">goto</span> cont;
<a name="l02024"></a>02024 }
<a name="l02025"></a>02025 <span class="preprocessor">#endif </span><span class="comment">/*Honor_FLT_ROUNDS*/</span>
<a name="l02026"></a>02026
<a name="l02027"></a>02027 <span class="keywordflow">if</span> (i < 0) {
<a name="l02028"></a>02028 <span class="comment">/* Error is less than half an ulp -- check for</span>
<a name="l02029"></a>02029 <span class="comment"> * special case of mantissa a power of two.</span>
<a name="l02030"></a>02030 <span class="comment"> */</span>
<a name="l02031"></a>02031 <span class="keywordflow">if</span> (dsign || word1(rv) || word0(rv) & Bndry_mask
<a name="l02032"></a>02032 #ifdef IEEE_Arith
<a name="l02033"></a>02033 #ifdef Avoid_Underflow
<a name="l02034"></a>02034 || (word0(rv) & Exp_mask) <= (2*P+1)*Exp_msk1
<a name="l02035"></a>02035 #<span class="keywordflow">else</span>
<a name="l02036"></a>02036 || (word0(rv) & Exp_mask) <= Exp_msk1
<a name="l02037"></a>02037 #endif
<a name="l02038"></a>02038 #endif
<a name="l02039"></a>02039 ) {
<a name="l02040"></a>02040 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l02041"></a>02041 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!delta->x[0] && delta->wds <= 1)
<a name="l02042"></a>02042 inexact = 0;
<a name="l02043"></a>02043 <span class="preprocessor">#endif</span>
<a name="l02044"></a>02044 <span class="preprocessor"></span> <span class="keywordflow">break</span>;
<a name="l02045"></a>02045 }
<a name="l02046"></a>02046 <span class="keywordflow">if</span> (!delta->x[0] && delta->wds <= 1) {
<a name="l02047"></a>02047 <span class="comment">/* exact result */</span>
<a name="l02048"></a>02048 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l02049"></a>02049 <span class="preprocessor"></span> inexact = 0;
<a name="l02050"></a>02050 <span class="preprocessor">#endif</span>
<a name="l02051"></a>02051 <span class="preprocessor"></span> <span class="keywordflow">break</span>;
<a name="l02052"></a>02052 }
<a name="l02053"></a>02053 delta = lshift(delta,Log2P);
<a name="l02054"></a>02054 <span class="keywordflow">if</span> (cmp(delta, bs) > 0)
<a name="l02055"></a>02055 <span class="keywordflow">goto</span> drop_down;
<a name="l02056"></a>02056 <span class="keywordflow">break</span>;
<a name="l02057"></a>02057 }
<a name="l02058"></a>02058 <span class="keywordflow">if</span> (i == 0) {
<a name="l02059"></a>02059 <span class="comment">/* exactly half-way between */</span>
<a name="l02060"></a>02060 <span class="keywordflow">if</span> (dsign) {
<a name="l02061"></a>02061 <span class="keywordflow">if</span> ((word0(rv) & Bndry_mask1) == Bndry_mask1
<a name="l02062"></a>02062 && word1(rv) == (
<a name="l02063"></a>02063 #ifdef Avoid_Underflow
<a name="l02064"></a>02064 (scale && (y = word0(rv) & Exp_mask) <= 2*P*Exp_msk1)
<a name="l02065"></a>02065 ? (0xffffffff & (0xffffffff << (2*P+1-(y>>Exp_shift)))) :
<a name="l02066"></a>02066 #endif
<a name="l02067"></a>02067 0xffffffff)) {
<a name="l02068"></a>02068 <span class="comment">/*boundary case -- increment exponent*/</span>
<a name="l02069"></a>02069 word0(rv) = (word0(rv) & Exp_mask)
<a name="l02070"></a>02070 + Exp_msk1
<a name="l02071"></a>02071 #ifdef IBM
<a name="l02072"></a>02072 | Exp_msk1 >> 4
<a name="l02073"></a>02073 #endif
<a name="l02074"></a>02074 ;
<a name="l02075"></a>02075 word1(rv) = 0;
<a name="l02076"></a>02076 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l02077"></a>02077 <span class="preprocessor"></span> dsign = 0;
<a name="l02078"></a>02078 <span class="preprocessor">#endif</span>
<a name="l02079"></a>02079 <span class="preprocessor"></span> <span class="keywordflow">break</span>;
<a name="l02080"></a>02080 }
<a name="l02081"></a>02081 }
<a name="l02082"></a>02082 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!(word0(rv) & Bndry_mask) && !word1(rv)) {
<a name="l02083"></a>02083 drop_down:
<a name="l02084"></a>02084 <span class="comment">/* boundary case -- decrement exponent */</span>
<a name="l02085"></a>02085 <span class="preprocessor">#ifdef Sudden_Underflow </span><span class="comment">/*{{*/</span>
<a name="l02086"></a>02086 L = word0(rv) & Exp_mask;
<a name="l02087"></a>02087 <span class="preprocessor">#ifdef IBM</span>
<a name="l02088"></a>02088 <span class="preprocessor"></span> <span class="keywordflow">if</span> (L < Exp_msk1)
<a name="l02089"></a>02089 <span class="preprocessor">#else</span>
<a name="l02090"></a>02090 <span class="preprocessor"></span><span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l02091"></a>02091 <span class="preprocessor"></span> <span class="keywordflow">if</span> (L <= (scale ? (2*P+1)*Exp_msk1 : Exp_msk1))
<a name="l02092"></a>02092 <span class="preprocessor">#else</span>
<a name="l02093"></a>02093 <span class="preprocessor"></span> <span class="keywordflow">if</span> (L <= Exp_msk1)
<a name="l02094"></a>02094 <span class="preprocessor">#endif </span><span class="comment">/*Avoid_Underflow*/</span>
<a name="l02095"></a>02095 <span class="preprocessor">#endif </span><span class="comment">/*IBM*/</span>
<a name="l02096"></a>02096 <span class="keywordflow">goto</span> undfl;
<a name="l02097"></a>02097 L -= Exp_msk1;
<a name="l02098"></a>02098 <span class="preprocessor">#else </span><span class="comment">/*Sudden_Underflow}{*/</span>
<a name="l02099"></a>02099 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l02100"></a>02100 <span class="preprocessor"></span> <span class="keywordflow">if</span> (scale) {
<a name="l02101"></a>02101 L = word0(rv) & Exp_mask;
<a name="l02102"></a>02102 <span class="keywordflow">if</span> (L <= (2*P+1)*Exp_msk1) {
<a name="l02103"></a>02103 <span class="keywordflow">if</span> (L > (P+2)*Exp_msk1)
<a name="l02104"></a>02104 <span class="comment">/* round even ==> */</span>
<a name="l02105"></a>02105 <span class="comment">/* accept rv */</span>
<a name="l02106"></a>02106 <span class="keywordflow">break</span>;
<a name="l02107"></a>02107 <span class="comment">/* rv = smallest denormal */</span>
<a name="l02108"></a>02108 <span class="keywordflow">goto</span> undfl;
<a name="l02109"></a>02109 }
<a name="l02110"></a>02110 }
<a name="l02111"></a>02111 <span class="preprocessor">#endif </span><span class="comment">/*Avoid_Underflow*/</span>
<a name="l02112"></a>02112 L = (word0(rv) & Exp_mask) - Exp_msk1;
<a name="l02113"></a>02113 <span class="preprocessor">#endif </span><span class="comment">/*Sudden_Underflow}}*/</span>
<a name="l02114"></a>02114 word0(rv) = L | Bndry_mask1;
<a name="l02115"></a>02115 word1(rv) = 0xffffffff;
<a name="l02116"></a>02116 <span class="preprocessor">#ifdef IBM</span>
<a name="l02117"></a>02117 <span class="preprocessor"></span> <span class="keywordflow">goto</span> cont;
<a name="l02118"></a>02118 <span class="preprocessor">#else</span>
<a name="l02119"></a>02119 <span class="preprocessor"></span> <span class="keywordflow">break</span>;
<a name="l02120"></a>02120 <span class="preprocessor">#endif</span>
<a name="l02121"></a>02121 <span class="preprocessor"></span> }
<a name="l02122"></a>02122 <span class="preprocessor">#ifndef ROUND_BIASED</span>
<a name="l02123"></a>02123 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!(word1(rv) & LSB))
<a name="l02124"></a>02124 <span class="keywordflow">break</span>;
<a name="l02125"></a>02125 <span class="preprocessor">#endif</span>
<a name="l02126"></a>02126 <span class="preprocessor"></span> <span class="keywordflow">if</span> (dsign)
<a name="l02127"></a>02127 dval(rv) += ulp(dval(rv));
<a name="l02128"></a>02128 <span class="preprocessor">#ifndef ROUND_BIASED</span>
<a name="l02129"></a>02129 <span class="preprocessor"></span> <span class="keywordflow">else</span> {
<a name="l02130"></a>02130 dval(rv) -= ulp(dval(rv));
<a name="l02131"></a>02131 <span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l02132"></a>02132 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!dval(rv))
<a name="l02133"></a>02133 <span class="keywordflow">goto</span> undfl;
<a name="l02134"></a>02134 <span class="preprocessor">#endif</span>
<a name="l02135"></a>02135 <span class="preprocessor"></span> }
<a name="l02136"></a>02136 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l02137"></a>02137 <span class="preprocessor"></span> dsign = 1 - dsign;
<a name="l02138"></a>02138 <span class="preprocessor">#endif</span>
<a name="l02139"></a>02139 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l02140"></a>02140 <span class="preprocessor"></span> <span class="keywordflow">break</span>;
<a name="l02141"></a>02141 }
<a name="l02142"></a>02142 <span class="keywordflow">if</span> ((aadj = ratio(delta, bs)) <= 2.) {
<a name="l02143"></a>02143 <span class="keywordflow">if</span> (dsign)
<a name="l02144"></a>02144 aadj = aadj1 = 1.;
<a name="l02145"></a>02145 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (word1(rv) || word0(rv) & Bndry_mask) {
<a name="l02146"></a>02146 <span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l02147"></a>02147 <span class="preprocessor"></span> <span class="keywordflow">if</span> (word1(rv) == Tiny1 && !word0(rv))
<a name="l02148"></a>02148 <span class="keywordflow">goto</span> undfl;
<a name="l02149"></a>02149 <span class="preprocessor">#endif</span>
<a name="l02150"></a>02150 <span class="preprocessor"></span> aadj = 1.;
<a name="l02151"></a>02151 aadj1 = -1.;
<a name="l02152"></a>02152 }
<a name="l02153"></a>02153 <span class="keywordflow">else</span> {
<a name="l02154"></a>02154 <span class="comment">/* special case -- power of FLT_RADIX to be */</span>
<a name="l02155"></a>02155 <span class="comment">/* rounded down... */</span>
<a name="l02156"></a>02156
<a name="l02157"></a>02157 <span class="keywordflow">if</span> (aadj < 2./FLT_RADIX)
<a name="l02158"></a>02158 aadj = 1./FLT_RADIX;
<a name="l02159"></a>02159 <span class="keywordflow">else</span>
<a name="l02160"></a>02160 aadj *= 0.5;
<a name="l02161"></a>02161 aadj1 = -aadj;
<a name="l02162"></a>02162 }
<a name="l02163"></a>02163 }
<a name="l02164"></a>02164 <span class="keywordflow">else</span> {
<a name="l02165"></a>02165 aadj *= 0.5;
<a name="l02166"></a>02166 aadj1 = dsign ? aadj : -aadj;
<a name="l02167"></a>02167 <span class="preprocessor">#ifdef Check_FLT_ROUNDS</span>
<a name="l02168"></a>02168 <span class="preprocessor"></span> <span class="keywordflow">switch</span>(Rounding) {
<a name="l02169"></a>02169 <span class="keywordflow">case</span> 2: <span class="comment">/* towards +infinity */</span>
<a name="l02170"></a>02170 aadj1 -= 0.5;
<a name="l02171"></a>02171 <span class="keywordflow">break</span>;
<a name="l02172"></a>02172 <span class="keywordflow">case</span> 0: <span class="comment">/* towards 0 */</span>
<a name="l02173"></a>02173 <span class="keywordflow">case</span> 3: <span class="comment">/* towards -infinity */</span>
<a name="l02174"></a>02174 aadj1 += 0.5;
<a name="l02175"></a>02175 }
<a name="l02176"></a>02176 <span class="preprocessor">#else</span>
<a name="l02177"></a>02177 <span class="preprocessor"></span> <span class="keywordflow">if</span> (Flt_Rounds == 0)
<a name="l02178"></a>02178 aadj1 += 0.5;
<a name="l02179"></a>02179 <span class="preprocessor">#endif </span><span class="comment">/*Check_FLT_ROUNDS*/</span>
<a name="l02180"></a>02180 }
<a name="l02181"></a>02181 y = word0(rv) & Exp_mask;
<a name="l02182"></a>02182
<a name="l02183"></a>02183 <span class="comment">/* Check for overflow */</span>
<a name="l02184"></a>02184
<a name="l02185"></a>02185 <span class="keywordflow">if</span> (y == Exp_msk1*(DBL_MAX_EXP+Bias-1)) {
<a name="l02186"></a>02186 dval(rv0) = dval(rv);
<a name="l02187"></a>02187 word0(rv) -= P*Exp_msk1;
<a name="l02188"></a>02188 adj = aadj1 * ulp(dval(rv));
<a name="l02189"></a>02189 dval(rv) += adj;
<a name="l02190"></a>02190 <span class="keywordflow">if</span> ((word0(rv) & Exp_mask) >=
<a name="l02191"></a>02191 Exp_msk1*(DBL_MAX_EXP+Bias-P)) {
<a name="l02192"></a>02192 <span class="keywordflow">if</span> (word0(rv0) == Big0 && word1(rv0) == Big1)
<a name="l02193"></a>02193 <span class="keywordflow">goto</span> ovfl;
<a name="l02194"></a>02194 word0(rv) = Big0;
<a name="l02195"></a>02195 word1(rv) = Big1;
<a name="l02196"></a>02196 <span class="keywordflow">goto</span> cont;
<a name="l02197"></a>02197 }
<a name="l02198"></a>02198 <span class="keywordflow">else</span>
<a name="l02199"></a>02199 word0(rv) += P*Exp_msk1;
<a name="l02200"></a>02200 }
<a name="l02201"></a>02201 <span class="keywordflow">else</span> {
<a name="l02202"></a>02202 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l02203"></a>02203 <span class="preprocessor"></span> <span class="keywordflow">if</span> (scale && y <= 2*P*Exp_msk1) {
<a name="l02204"></a>02204 <span class="keywordflow">if</span> (aadj <= 0x7fffffff) {
<a name="l02205"></a>02205 <span class="keywordflow">if</span> ((z = (ULong)aadj) <= 0)
<a name="l02206"></a>02206 z = 1;
<a name="l02207"></a>02207 aadj = z;
<a name="l02208"></a>02208 aadj1 = dsign ? aadj : -aadj;
<a name="l02209"></a>02209 }
<a name="l02210"></a>02210 dval(aadj2) = aadj1;
<a name="l02211"></a>02211 word0(aadj2) += (2*P+1)*Exp_msk1 - y;
<a name="l02212"></a>02212 aadj1 = dval(aadj2);
<a name="l02213"></a>02213 }
<a name="l02214"></a>02214 adj = aadj1 * ulp(dval(rv));
<a name="l02215"></a>02215 dval(rv) += adj;
<a name="l02216"></a>02216 <span class="preprocessor">#else</span>
<a name="l02217"></a>02217 <span class="preprocessor"></span><span class="preprocessor">#ifdef Sudden_Underflow</span>
<a name="l02218"></a>02218 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((word0(rv) & Exp_mask) <= P*Exp_msk1) {
<a name="l02219"></a>02219 dval(rv0) = dval(rv);
<a name="l02220"></a>02220 word0(rv) += P*Exp_msk1;
<a name="l02221"></a>02221 adj = aadj1 * ulp(dval(rv));
<a name="l02222"></a>02222 dval(rv) += adj;
<a name="l02223"></a>02223 <span class="preprocessor">#ifdef IBM</span>
<a name="l02224"></a>02224 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((word0(rv) & Exp_mask) < P*Exp_msk1)
<a name="l02225"></a>02225 <span class="preprocessor">#else</span>
<a name="l02226"></a>02226 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((word0(rv) & Exp_mask) <= P*Exp_msk1)
<a name="l02227"></a>02227 <span class="preprocessor">#endif</span>
<a name="l02228"></a>02228 <span class="preprocessor"></span> {
<a name="l02229"></a>02229 <span class="keywordflow">if</span> (word0(rv0) == Tiny0
<a name="l02230"></a>02230 && word1(rv0) == Tiny1)
<a name="l02231"></a>02231 <span class="keywordflow">goto</span> undfl;
<a name="l02232"></a>02232 word0(rv) = Tiny0;
<a name="l02233"></a>02233 word1(rv) = Tiny1;
<a name="l02234"></a>02234 <span class="keywordflow">goto</span> cont;
<a name="l02235"></a>02235 }
<a name="l02236"></a>02236 <span class="keywordflow">else</span>
<a name="l02237"></a>02237 word0(rv) -= P*Exp_msk1;
<a name="l02238"></a>02238 }
<a name="l02239"></a>02239 <span class="keywordflow">else</span> {
<a name="l02240"></a>02240 adj = aadj1 * ulp(dval(rv));
<a name="l02241"></a>02241 dval(rv) += adj;
<a name="l02242"></a>02242 }
<a name="l02243"></a>02243 <span class="preprocessor">#else </span><span class="comment">/*Sudden_Underflow*/</span>
<a name="l02244"></a>02244 <span class="comment">/* Compute adj so that the IEEE rounding rules will</span>
<a name="l02245"></a>02245 <span class="comment"> * correctly round rv + adj in some half-way cases.</span>
<a name="l02246"></a>02246 <span class="comment"> * If rv * ulp(rv) is denormalized (i.e.,</span>
<a name="l02247"></a>02247 <span class="comment"> * y <= (P-1)*Exp_msk1), we must adjust aadj to avoid</span>
<a name="l02248"></a>02248 <span class="comment"> * trouble from bits lost to denormalization;</span>
<a name="l02249"></a>02249 <span class="comment"> * example: 1.2e-307 .</span>
<a name="l02250"></a>02250 <span class="comment"> */</span>
<a name="l02251"></a>02251 <span class="keywordflow">if</span> (y <= (P-1)*Exp_msk1 && aadj > 1.) {
<a name="l02252"></a>02252 aadj1 = (double)(<span class="keywordtype">int</span>)(aadj + 0.5);
<a name="l02253"></a>02253 <span class="keywordflow">if</span> (!dsign)
<a name="l02254"></a>02254 aadj1 = -aadj1;
<a name="l02255"></a>02255 }
<a name="l02256"></a>02256 adj = aadj1 * ulp(dval(rv));
<a name="l02257"></a>02257 dval(rv) += adj;
<a name="l02258"></a>02258 <span class="preprocessor">#endif </span><span class="comment">/*Sudden_Underflow*/</span>
<a name="l02259"></a>02259 <span class="preprocessor">#endif </span><span class="comment">/*Avoid_Underflow*/</span>
<a name="l02260"></a>02260 }
<a name="l02261"></a>02261 z = word0(rv) & Exp_mask;
<a name="l02262"></a>02262 <span class="preprocessor">#ifndef SET_INEXACT</span>
<a name="l02263"></a>02263 <span class="preprocessor"></span><span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l02264"></a>02264 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!scale)
<a name="l02265"></a>02265 <span class="preprocessor">#endif</span>
<a name="l02266"></a>02266 <span class="preprocessor"></span> <span class="keywordflow">if</span> (y == z) {
<a name="l02267"></a>02267 <span class="comment">/* Can we stop now? */</span>
<a name="l02268"></a>02268 L = (Long)aadj;
<a name="l02269"></a>02269 aadj -= L;
<a name="l02270"></a>02270 <span class="comment">/* The tolerances below are conservative. */</span>
<a name="l02271"></a>02271 <span class="keywordflow">if</span> (dsign || word1(rv) || word0(rv) & Bndry_mask) {
<a name="l02272"></a>02272 <span class="keywordflow">if</span> (aadj < .4999999 || aadj > .5000001)
<a name="l02273"></a>02273 <span class="keywordflow">break</span>;
<a name="l02274"></a>02274 }
<a name="l02275"></a>02275 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (aadj < .4999999/FLT_RADIX)
<a name="l02276"></a>02276 <span class="keywordflow">break</span>;
<a name="l02277"></a>02277 }
<a name="l02278"></a>02278 <span class="preprocessor">#endif</span>
<a name="l02279"></a>02279 <span class="preprocessor"></span> cont:
<a name="l02280"></a>02280 Bfree(bb);
<a name="l02281"></a>02281 Bfree(bd);
<a name="l02282"></a>02282 Bfree(bs);
<a name="l02283"></a>02283 Bfree(delta);
<a name="l02284"></a>02284 }
<a name="l02285"></a>02285 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l02286"></a>02286 <span class="preprocessor"></span> <span class="keywordflow">if</span> (inexact) {
<a name="l02287"></a>02287 <span class="keywordflow">if</span> (!oldinexact) {
<a name="l02288"></a>02288 word0(rv0) = Exp_1 + (70 << Exp_shift);
<a name="l02289"></a>02289 word1(rv0) = 0;
<a name="l02290"></a>02290 dval(rv0) += 1.;
<a name="l02291"></a>02291 }
<a name="l02292"></a>02292 }
<a name="l02293"></a>02293 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!oldinexact)
<a name="l02294"></a>02294 clear_inexact();
<a name="l02295"></a>02295 <span class="preprocessor">#endif</span>
<a name="l02296"></a>02296 <span class="preprocessor"></span><span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l02297"></a>02297 <span class="preprocessor"></span> <span class="keywordflow">if</span> (scale) {
<a name="l02298"></a>02298 word0(rv0) = Exp_1 - 2*P*Exp_msk1;
<a name="l02299"></a>02299 word1(rv0) = 0;
<a name="l02300"></a>02300 dval(rv) *= dval(rv0);
<a name="l02301"></a>02301 <span class="preprocessor">#ifndef NO_ERRNO</span>
<a name="l02302"></a>02302 <span class="preprocessor"></span> <span class="comment">/* try to avoid the bug of testing an 8087 register value */</span>
<a name="l02303"></a>02303 <span class="keywordflow">if</span> (word0(rv) == 0 && word1(rv) == 0)
<a name="l02304"></a>02304 errno = ERANGE;
<a name="l02305"></a>02305 <span class="preprocessor">#endif</span>
<a name="l02306"></a>02306 <span class="preprocessor"></span> }
<a name="l02307"></a>02307 <span class="preprocessor">#endif </span><span class="comment">/* Avoid_Underflow */</span>
<a name="l02308"></a>02308 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l02309"></a>02309 <span class="preprocessor"></span> <span class="keywordflow">if</span> (inexact && !(word0(rv) & Exp_mask)) {
<a name="l02310"></a>02310 <span class="comment">/* set underflow bit */</span>
<a name="l02311"></a>02311 dval(rv0) = 1e-300;
<a name="l02312"></a>02312 dval(rv0) *= dval(rv0);
<a name="l02313"></a>02313 }
<a name="l02314"></a>02314 <span class="preprocessor">#endif</span>
<a name="l02315"></a>02315 <span class="preprocessor"></span> retfree:
<a name="l02316"></a>02316 Bfree(bb);
<a name="l02317"></a>02317 Bfree(bd);
<a name="l02318"></a>02318 Bfree(bs);
<a name="l02319"></a>02319 Bfree(bd0);
<a name="l02320"></a>02320 Bfree(delta);
<a name="l02321"></a>02321 ret:
<a name="l02322"></a>02322 <span class="keywordflow">if</span> (se)
<a name="l02323"></a>02323 *se = (<span class="keywordtype">char</span> *)s;
<a name="l02324"></a>02324 <span class="keywordflow">return</span> sign ? -dval(rv) : dval(rv);
<a name="l02325"></a>02325 }
<a name="l02326"></a>02326
<a name="l02327"></a>02327 <span class="keyword">static</span> <span class="keywordtype">int</span>
<a name="l02328"></a>02328 quorem
<a name="l02329"></a>02329 (Bigint *b, Bigint *S)
<a name="l02330"></a>02330 {
<a name="l02331"></a>02331 <span class="keywordtype">int</span> n;
<a name="l02332"></a>02332 ULong *bx, *bxe, q, *sx, *sxe;
<a name="l02333"></a>02333 <span class="preprocessor">#ifdef ULLong</span>
<a name="l02334"></a>02334 <span class="preprocessor"></span> ULLong borrow, carry, y, ys;
<a name="l02335"></a>02335 <span class="preprocessor">#else</span>
<a name="l02336"></a>02336 <span class="preprocessor"></span> ULong borrow, carry, y, ys;
<a name="l02337"></a>02337 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l02338"></a>02338 <span class="preprocessor"></span> ULong si, z, zs;
<a name="l02339"></a>02339 <span class="preprocessor">#endif</span>
<a name="l02340"></a>02340 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l02341"></a>02341 <span class="preprocessor"></span>
<a name="l02342"></a>02342 n = S->wds;
<a name="l02343"></a>02343 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l02344"></a>02344 <span class="preprocessor"></span> <span class="comment">/*debug*/</span> <span class="keywordflow">if</span> (b->wds > n)
<a name="l02345"></a>02345 <span class="comment">/*debug*/</span> Bug(<span class="stringliteral">"oversize b in quorem"</span>);
<a name="l02346"></a>02346 <span class="preprocessor">#endif</span>
<a name="l02347"></a>02347 <span class="preprocessor"></span> <span class="keywordflow">if</span> (b->wds < n)
<a name="l02348"></a>02348 <span class="keywordflow">return</span> 0;
<a name="l02349"></a>02349 sx = S->x;
<a name="l02350"></a>02350 sxe = sx + --n;
<a name="l02351"></a>02351 bx = b->x;
<a name="l02352"></a>02352 bxe = bx + n;
<a name="l02353"></a>02353 q = *bxe / (*sxe + 1); <span class="comment">/* ensure q <= true quotient */</span>
<a name="l02354"></a>02354 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l02355"></a>02355 <span class="preprocessor"></span> <span class="comment">/*debug*/</span> <span class="keywordflow">if</span> (q > 9)
<a name="l02356"></a>02356 <span class="comment">/*debug*/</span> Bug(<span class="stringliteral">"oversized quotient in quorem"</span>);
<a name="l02357"></a>02357 <span class="preprocessor">#endif</span>
<a name="l02358"></a>02358 <span class="preprocessor"></span> <span class="keywordflow">if</span> (q) {
<a name="l02359"></a>02359 borrow = 0;
<a name="l02360"></a>02360 carry = 0;
<a name="l02361"></a>02361 <span class="keywordflow">do</span> {
<a name="l02362"></a>02362 <span class="preprocessor">#ifdef ULLong</span>
<a name="l02363"></a>02363 <span class="preprocessor"></span> ys = *sx++ * (ULLong)q + carry;
<a name="l02364"></a>02364 carry = ys >> 32;
<a name="l02365"></a>02365 y = *bx - (ys & FFFFFFFF) - borrow;
<a name="l02366"></a>02366 borrow = y >> 32 & (ULong)1;
<a name="l02367"></a>02367 *bx++ = (ULong)y & FFFFFFFF;
<a name="l02368"></a>02368 <span class="preprocessor">#else</span>
<a name="l02369"></a>02369 <span class="preprocessor"></span><span class="preprocessor">#ifdef Pack_32</span>
<a name="l02370"></a>02370 <span class="preprocessor"></span> si = *sx++;
<a name="l02371"></a>02371 ys = (si & 0xffff) * q + carry;
<a name="l02372"></a>02372 zs = (si >> 16) * q + (ys >> 16);
<a name="l02373"></a>02373 carry = zs >> 16;
<a name="l02374"></a>02374 y = (*bx & 0xffff) - (ys & 0xffff) - borrow;
<a name="l02375"></a>02375 borrow = (y & 0x10000) >> 16;
<a name="l02376"></a>02376 z = (*bx >> 16) - (zs & 0xffff) - borrow;
<a name="l02377"></a>02377 borrow = (z & 0x10000) >> 16;
<a name="l02378"></a>02378 Storeinc(bx, z, y);
<a name="l02379"></a>02379 <span class="preprocessor">#else</span>
<a name="l02380"></a>02380 <span class="preprocessor"></span> ys = *sx++ * q + carry;
<a name="l02381"></a>02381 carry = ys >> 16;
<a name="l02382"></a>02382 y = *bx - (ys & 0xffff) - borrow;
<a name="l02383"></a>02383 borrow = (y & 0x10000) >> 16;
<a name="l02384"></a>02384 *bx++ = y & 0xffff;
<a name="l02385"></a>02385 <span class="preprocessor">#endif</span>
<a name="l02386"></a>02386 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l02387"></a>02387 <span class="preprocessor"></span> }
<a name="l02388"></a>02388 <span class="keywordflow">while</span>(sx <= sxe);
<a name="l02389"></a>02389 <span class="keywordflow">if</span> (!*bxe) {
<a name="l02390"></a>02390 bx = b->x;
<a name="l02391"></a>02391 <span class="keywordflow">while</span>(--bxe > bx && !*bxe)
<a name="l02392"></a>02392 --n;
<a name="l02393"></a>02393 b->wds = n;
<a name="l02394"></a>02394 }
<a name="l02395"></a>02395 }
<a name="l02396"></a>02396 <span class="keywordflow">if</span> (cmp(b, S) >= 0) {
<a name="l02397"></a>02397 q++;
<a name="l02398"></a>02398 borrow = 0;
<a name="l02399"></a>02399 carry = 0;
<a name="l02400"></a>02400 bx = b->x;
<a name="l02401"></a>02401 sx = S->x;
<a name="l02402"></a>02402 <span class="keywordflow">do</span> {
<a name="l02403"></a>02403 <span class="preprocessor">#ifdef ULLong</span>
<a name="l02404"></a>02404 <span class="preprocessor"></span> ys = *sx++ + carry;
<a name="l02405"></a>02405 carry = ys >> 32;
<a name="l02406"></a>02406 y = *bx - (ys & FFFFFFFF) - borrow;
<a name="l02407"></a>02407 borrow = y >> 32 & (ULong)1;
<a name="l02408"></a>02408 *bx++ = (ULong)y & FFFFFFFF;
<a name="l02409"></a>02409 <span class="preprocessor">#else</span>
<a name="l02410"></a>02410 <span class="preprocessor"></span><span class="preprocessor">#ifdef Pack_32</span>
<a name="l02411"></a>02411 <span class="preprocessor"></span> si = *sx++;
<a name="l02412"></a>02412 ys = (si & 0xffff) + carry;
<a name="l02413"></a>02413 zs = (si >> 16) + (ys >> 16);
<a name="l02414"></a>02414 carry = zs >> 16;
<a name="l02415"></a>02415 y = (*bx & 0xffff) - (ys & 0xffff) - borrow;
<a name="l02416"></a>02416 borrow = (y & 0x10000) >> 16;
<a name="l02417"></a>02417 z = (*bx >> 16) - (zs & 0xffff) - borrow;
<a name="l02418"></a>02418 borrow = (z & 0x10000) >> 16;
<a name="l02419"></a>02419 Storeinc(bx, z, y);
<a name="l02420"></a>02420 <span class="preprocessor">#else</span>
<a name="l02421"></a>02421 <span class="preprocessor"></span> ys = *sx++ + carry;
<a name="l02422"></a>02422 carry = ys >> 16;
<a name="l02423"></a>02423 y = *bx - (ys & 0xffff) - borrow;
<a name="l02424"></a>02424 borrow = (y & 0x10000) >> 16;
<a name="l02425"></a>02425 *bx++ = y & 0xffff;
<a name="l02426"></a>02426 <span class="preprocessor">#endif</span>
<a name="l02427"></a>02427 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l02428"></a>02428 <span class="preprocessor"></span> }
<a name="l02429"></a>02429 <span class="keywordflow">while</span>(sx <= sxe);
<a name="l02430"></a>02430 bx = b->x;
<a name="l02431"></a>02431 bxe = bx + n;
<a name="l02432"></a>02432 <span class="keywordflow">if</span> (!*bxe) {
<a name="l02433"></a>02433 <span class="keywordflow">while</span>(--bxe > bx && !*bxe)
<a name="l02434"></a>02434 --n;
<a name="l02435"></a>02435 b->wds = n;
<a name="l02436"></a>02436 }
<a name="l02437"></a>02437 }
<a name="l02438"></a>02438 <span class="keywordflow">return</span> q;
<a name="l02439"></a>02439 }
<a name="l02440"></a>02440
<a name="l02441"></a>02441 <span class="preprocessor">#ifndef MULTIPLE_THREADS</span>
<a name="l02442"></a>02442 <span class="preprocessor"></span> <span class="keyword">static</span> <span class="keywordtype">char</span> *dtoa_result;
<a name="l02443"></a>02443 <span class="preprocessor">#endif</span>
<a name="l02444"></a>02444 <span class="preprocessor"></span>
<a name="l02445"></a>02445 <span class="keyword">static</span> <span class="keywordtype">char</span> *
<a name="l02446"></a>02446 rv_alloc(<span class="keywordtype">int</span> i)
<a name="l02447"></a>02447 {
<a name="l02448"></a>02448 <span class="keywordtype">int</span> j, k, *r;
<a name="l02449"></a>02449
<a name="l02450"></a>02450 j = <span class="keyword">sizeof</span>(ULong);
<a name="l02451"></a>02451 <span class="keywordflow">for</span>(k = 0;
<a name="l02452"></a>02452 <span class="keyword">sizeof</span>(Bigint) - <span class="keyword">sizeof</span>(ULong) - <span class="keyword">sizeof</span>(int) + j <= (<span class="keywordtype">unsigned</span>)i;
<a name="l02453"></a>02453 j <<= 1)
<a name="l02454"></a>02454 k++;
<a name="l02455"></a>02455 r = (<span class="keywordtype">int</span>*)Balloc(k);
<a name="l02456"></a>02456 *r = k;
<a name="l02457"></a>02457 <span class="keywordflow">return</span>
<a name="l02458"></a>02458 <span class="preprocessor">#ifndef MULTIPLE_THREADS</span>
<a name="l02459"></a>02459 <span class="preprocessor"></span> dtoa_result =
<a name="l02460"></a>02460 <span class="preprocessor">#endif</span>
<a name="l02461"></a>02461 <span class="preprocessor"></span> (<span class="keywordtype">char</span> *)(r+1);
<a name="l02462"></a>02462 }
<a name="l02463"></a>02463
<a name="l02464"></a>02464 <span class="keyword">static</span> <span class="keywordtype">char</span> *
<a name="l02465"></a>02465 nrv_alloc(CONST <span class="keywordtype">char</span> *s, <span class="keywordtype">char</span> **rve, <span class="keywordtype">int</span> n)
<a name="l02466"></a>02466 {
<a name="l02467"></a>02467 <span class="keywordtype">char</span> *rv, *t;
<a name="l02468"></a>02468
<a name="l02469"></a>02469 t = rv = rv_alloc(n);
<a name="l02470"></a>02470 <span class="keywordflow">while</span>((*t = *s++)) t++;
<a name="l02471"></a>02471 <span class="keywordflow">if</span> (rve)
<a name="l02472"></a>02472 *rve = t;
<a name="l02473"></a>02473 <span class="keywordflow">return</span> rv;
<a name="l02474"></a>02474 }
<a name="l02475"></a>02475
<a name="l02476"></a>02476 <span class="comment">/* freedtoa(s) must be used to free values s returned by dtoa</span>
<a name="l02477"></a>02477 <span class="comment"> * when MULTIPLE_THREADS is #defined. It should be used in all cases,</span>
<a name="l02478"></a>02478 <span class="comment"> * but for consistency with earlier versions of dtoa, it is optional</span>
<a name="l02479"></a>02479 <span class="comment"> * when MULTIPLE_THREADS is not defined.</span>
<a name="l02480"></a>02480 <span class="comment"> */</span>
<a name="l02481"></a>02481
<a name="l02482"></a>02482 <span class="keywordtype">void</span>
<a name="l02483"></a>02483 freedtoa(<span class="keywordtype">char</span> *s)
<a name="l02484"></a>02484 {
<a name="l02485"></a>02485 Bigint *b = (Bigint *)((<span class="keywordtype">int</span> *)s - 1);
<a name="l02486"></a>02486 b->maxwds = 1 << (b->k = *(<span class="keywordtype">int</span>*)b);
<a name="l02487"></a>02487 Bfree(b);
<a name="l02488"></a>02488 <span class="preprocessor">#ifndef MULTIPLE_THREADS</span>
<a name="l02489"></a>02489 <span class="preprocessor"></span> <span class="keywordflow">if</span> (s == dtoa_result)
<a name="l02490"></a>02490 dtoa_result = 0;
<a name="l02491"></a>02491 <span class="preprocessor">#endif</span>
<a name="l02492"></a>02492 <span class="preprocessor"></span> }
<a name="l02493"></a>02493
<a name="l02494"></a>02494 <span class="comment">/* dtoa for IEEE arithmetic (dmg): convert double to ASCII string.</span>
<a name="l02495"></a>02495 <span class="comment"> *</span>
<a name="l02496"></a>02496 <span class="comment"> * Inspired by "How to Print Floating-Point Numbers Accurately" by</span>
<a name="l02497"></a>02497 <span class="comment"> * Guy L. Steele, Jr. and Jon L. White [Proc. ACM SIGPLAN '90, pp. 92-101].</span>
<a name="l02498"></a>02498 <span class="comment"> *</span>
<a name="l02499"></a>02499 <span class="comment"> * Modifications:</span>
<a name="l02500"></a>02500 <span class="comment"> * 1. Rather than iterating, we use a simple numeric overestimate</span>
<a name="l02501"></a>02501 <span class="comment"> * to determine k = floor(log10(d)). We scale relevant</span>
<a name="l02502"></a>02502 <span class="comment"> * quantities using O(log2(k)) rather than O(k) multiplications.</span>
<a name="l02503"></a>02503 <span class="comment"> * 2. For some modes > 2 (corresponding to ecvt and fcvt), we don't</span>
<a name="l02504"></a>02504 <span class="comment"> * try to generate digits strictly left to right. Instead, we</span>
<a name="l02505"></a>02505 <span class="comment"> * compute with fewer bits and propagate the carry if necessary</span>
<a name="l02506"></a>02506 <span class="comment"> * when rounding the final digit up. This is often faster.</span>
<a name="l02507"></a>02507 <span class="comment"> * 3. Under the assumption that input will be rounded nearest,</span>
<a name="l02508"></a>02508 <span class="comment"> * mode 0 renders 1e23 as 1e23 rather than 9.999999999999999e22.</span>
<a name="l02509"></a>02509 <span class="comment"> * That is, we allow equality in stopping tests when the</span>
<a name="l02510"></a>02510 <span class="comment"> * round-nearest rule will give the same floating-point value</span>
<a name="l02511"></a>02511 <span class="comment"> * as would satisfaction of the stopping test with strict</span>
<a name="l02512"></a>02512 <span class="comment"> * inequality.</span>
<a name="l02513"></a>02513 <span class="comment"> * 4. We remove common factors of powers of 2 from relevant</span>
<a name="l02514"></a>02514 <span class="comment"> * quantities.</span>
<a name="l02515"></a>02515 <span class="comment"> * 5. When converting floating-point integers less than 1e16,</span>
<a name="l02516"></a>02516 <span class="comment"> * we use floating-point arithmetic rather than resorting</span>
<a name="l02517"></a>02517 <span class="comment"> * to multiple-precision integers.</span>
<a name="l02518"></a>02518 <span class="comment"> * 6. When asked to produce fewer than 15 digits, we first try</span>
<a name="l02519"></a>02519 <span class="comment"> * to get by with floating-point arithmetic; we resort to</span>
<a name="l02520"></a>02520 <span class="comment"> * multiple-precision integer arithmetic only if we cannot</span>
<a name="l02521"></a>02521 <span class="comment"> * guarantee that the floating-point calculation has given</span>
<a name="l02522"></a>02522 <span class="comment"> * the correctly rounded result. For k requested digits and</span>
<a name="l02523"></a>02523 <span class="comment"> * "uniformly" distributed input, the probability is</span>
<a name="l02524"></a>02524 <span class="comment"> * something like 10^(k-15) that we must resort to the Long</span>
<a name="l02525"></a>02525 <span class="comment"> * calculation.</span>
<a name="l02526"></a>02526 <span class="comment"> */</span>
<a name="l02527"></a>02527
<a name="l02528"></a>02528 <span class="keywordtype">char</span> *
<a name="l02529"></a>02529 dtoa
<a name="l02530"></a>02530 (<span class="keywordtype">double</span> dd, <span class="keywordtype">int</span> mode, <span class="keywordtype">int</span> ndigits, <span class="keywordtype">int</span> *decpt, <span class="keywordtype">int</span> *sign, <span class="keywordtype">char</span> **rve)
<a name="l02531"></a>02531 {
<a name="l02532"></a>02532 <span class="comment">/* Arguments ndigits, decpt, sign are similar to those</span>
<a name="l02533"></a>02533 <span class="comment"> of ecvt and fcvt; trailing zeros are suppressed from</span>
<a name="l02534"></a>02534 <span class="comment"> the returned string. If not null, *rve is set to point</span>
<a name="l02535"></a>02535 <span class="comment"> to the end of the return value. If d is +-Infinity or NaN,</span>
<a name="l02536"></a>02536 <span class="comment"> then *decpt is set to 9999.</span>
<a name="l02537"></a>02537 <span class="comment"></span>
<a name="l02538"></a>02538 <span class="comment"> mode:</span>
<a name="l02539"></a>02539 <span class="comment"> 0 ==> shortest string that yields d when read in</span>
<a name="l02540"></a>02540 <span class="comment"> and rounded to nearest.</span>
<a name="l02541"></a>02541 <span class="comment"> 1 ==> like 0, but with Steele & White stopping rule;</span>
<a name="l02542"></a>02542 <span class="comment"> e.g. with IEEE P754 arithmetic , mode 0 gives</span>
<a name="l02543"></a>02543 <span class="comment"> 1e23 whereas mode 1 gives 9.999999999999999e22.</span>
<a name="l02544"></a>02544 <span class="comment"> 2 ==> max(1,ndigits) significant digits. This gives a</span>
<a name="l02545"></a>02545 <span class="comment"> return value similar to that of ecvt, except</span>
<a name="l02546"></a>02546 <span class="comment"> that trailing zeros are suppressed.</span>
<a name="l02547"></a>02547 <span class="comment"> 3 ==> through ndigits past the decimal point. This</span>
<a name="l02548"></a>02548 <span class="comment"> gives a return value similar to that from fcvt,</span>
<a name="l02549"></a>02549 <span class="comment"> except that trailing zeros are suppressed, and</span>
<a name="l02550"></a>02550 <span class="comment"> ndigits can be negative.</span>
<a name="l02551"></a>02551 <span class="comment"> 4,5 ==> similar to 2 and 3, respectively, but (in</span>
<a name="l02552"></a>02552 <span class="comment"> round-nearest mode) with the tests of mode 0 to</span>
<a name="l02553"></a>02553 <span class="comment"> possibly return a shorter string that rounds to d.</span>
<a name="l02554"></a>02554 <span class="comment"> With IEEE arithmetic and compilation with</span>
<a name="l02555"></a>02555 <span class="comment"> -DHonor_FLT_ROUNDS, modes 4 and 5 behave the same</span>
<a name="l02556"></a>02556 <span class="comment"> as modes 2 and 3 when FLT_ROUNDS != 1.</span>
<a name="l02557"></a>02557 <span class="comment"> 6-9 ==> Debugging modes similar to mode - 4: don't try</span>
<a name="l02558"></a>02558 <span class="comment"> fast floating-point estimate (if applicable).</span>
<a name="l02559"></a>02559 <span class="comment"></span>
<a name="l02560"></a>02560 <span class="comment"> Values of mode other than 0-9 are treated as mode 0.</span>
<a name="l02561"></a>02561 <span class="comment"></span>
<a name="l02562"></a>02562 <span class="comment"> Sufficient space is allocated to the return value</span>
<a name="l02563"></a>02563 <span class="comment"> to hold the suppressed trailing zeros.</span>
<a name="l02564"></a>02564 <span class="comment"> */</span>
<a name="l02565"></a>02565
<a name="l02566"></a>02566 <span class="keywordtype">int</span> bbits, b2, b5, be, dig, i, ieps, ilim = 0, ilim0, ilim1 = 0,
<a name="l02567"></a>02567 j, j1, k, k0, k_check, leftright, m2, m5, s2, s5,
<a name="l02568"></a>02568 spec_case, try_quick;
<a name="l02569"></a>02569 Long L;
<a name="l02570"></a>02570 <span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l02571"></a>02571 <span class="preprocessor"></span> <span class="keywordtype">int</span> denorm;
<a name="l02572"></a>02572 ULong x;
<a name="l02573"></a>02573 <span class="preprocessor">#endif</span>
<a name="l02574"></a>02574 <span class="preprocessor"></span> Bigint *b, *b1, *delta, *mlo = NULL, *mhi, *S;
<a name="l02575"></a>02575 U d, d2, eps;
<a name="l02576"></a>02576 <span class="keywordtype">double</span> ds;
<a name="l02577"></a>02577 <span class="keywordtype">char</span> *s, *s0;
<a name="l02578"></a>02578 <span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l02579"></a>02579 <span class="preprocessor"></span> <span class="keywordtype">int</span> rounding;
<a name="l02580"></a>02580 <span class="preprocessor">#endif</span>
<a name="l02581"></a>02581 <span class="preprocessor"></span><span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l02582"></a>02582 <span class="preprocessor"></span> <span class="keywordtype">int</span> inexact, oldinexact;
<a name="l02583"></a>02583 <span class="preprocessor">#endif</span>
<a name="l02584"></a>02584 <span class="preprocessor"></span>
<a name="l02585"></a>02585 <span class="preprocessor">#ifndef MULTIPLE_THREADS</span>
<a name="l02586"></a>02586 <span class="preprocessor"></span> <span class="keywordflow">if</span> (dtoa_result) {
<a name="l02587"></a>02587 freedtoa(dtoa_result);
<a name="l02588"></a>02588 dtoa_result = 0;
<a name="l02589"></a>02589 }
<a name="l02590"></a>02590 <span class="preprocessor">#endif</span>
<a name="l02591"></a>02591 <span class="preprocessor"></span>
<a name="l02592"></a>02592 dval(d) = dd;
<a name="l02593"></a>02593 <span class="keywordflow">if</span> (word0(d) & Sign_bit) {
<a name="l02594"></a>02594 <span class="comment">/* set sign for everything, including 0's and NaNs */</span>
<a name="l02595"></a>02595 *sign = 1;
<a name="l02596"></a>02596 word0(d) &= ~Sign_bit; <span class="comment">/* clear sign bit */</span>
<a name="l02597"></a>02597 }
<a name="l02598"></a>02598 <span class="keywordflow">else</span>
<a name="l02599"></a>02599 *sign = 0;
<a name="l02600"></a>02600
<a name="l02601"></a>02601 <span class="preprocessor">#if defined(IEEE_Arith) + defined(VAX)</span>
<a name="l02602"></a>02602 <span class="preprocessor"></span><span class="preprocessor">#ifdef IEEE_Arith</span>
<a name="l02603"></a>02603 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((word0(d) & Exp_mask) == Exp_mask)
<a name="l02604"></a>02604 <span class="preprocessor">#else</span>
<a name="l02605"></a>02605 <span class="preprocessor"></span> <span class="keywordflow">if</span> (word0(d) == 0x8000)
<a name="l02606"></a>02606 <span class="preprocessor">#endif</span>
<a name="l02607"></a>02607 <span class="preprocessor"></span> {
<a name="l02608"></a>02608 <span class="comment">/* Infinity or NaN */</span>
<a name="l02609"></a>02609 *decpt = 9999;
<a name="l02610"></a>02610 <span class="preprocessor">#ifdef IEEE_Arith</span>
<a name="l02611"></a>02611 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!word1(d) && !(word0(d) & 0xfffff))
<a name="l02612"></a>02612 <span class="keywordflow">return</span> nrv_alloc(<span class="stringliteral">"Infinity"</span>, rve, 8);
<a name="l02613"></a>02613 <span class="preprocessor">#endif</span>
<a name="l02614"></a>02614 <span class="preprocessor"></span> <span class="keywordflow">return</span> nrv_alloc(<span class="stringliteral">"NaN"</span>, rve, 3);
<a name="l02615"></a>02615 }
<a name="l02616"></a>02616 <span class="preprocessor">#endif</span>
<a name="l02617"></a>02617 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
<a name="l02618"></a>02618 <span class="preprocessor"></span> dval(d) += 0; <span class="comment">/* normalize */</span>
<a name="l02619"></a>02619 <span class="preprocessor">#endif</span>
<a name="l02620"></a>02620 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!dval(d)) {
<a name="l02621"></a>02621 *decpt = 1;
<a name="l02622"></a>02622 <span class="keywordflow">return</span> nrv_alloc(<span class="stringliteral">"0"</span>, rve, 1);
<a name="l02623"></a>02623 }
<a name="l02624"></a>02624
<a name="l02625"></a>02625 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l02626"></a>02626 <span class="preprocessor"></span> try_quick = oldinexact = get_inexact();
<a name="l02627"></a>02627 inexact = 1;
<a name="l02628"></a>02628 <span class="preprocessor">#endif</span>
<a name="l02629"></a>02629 <span class="preprocessor"></span><span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l02630"></a>02630 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((rounding = Flt_Rounds) >= 2) {
<a name="l02631"></a>02631 <span class="keywordflow">if</span> (*sign)
<a name="l02632"></a>02632 rounding = rounding == 2 ? 0 : 2;
<a name="l02633"></a>02633 <span class="keywordflow">else</span>
<a name="l02634"></a>02634 <span class="keywordflow">if</span> (rounding != 2)
<a name="l02635"></a>02635 rounding = 0;
<a name="l02636"></a>02636 }
<a name="l02637"></a>02637 <span class="preprocessor">#endif</span>
<a name="l02638"></a>02638 <span class="preprocessor"></span>
<a name="l02639"></a>02639 b = d2b(dval(d), &be, &bbits);
<a name="l02640"></a>02640 <span class="preprocessor">#ifdef Sudden_Underflow</span>
<a name="l02641"></a>02641 <span class="preprocessor"></span> i = (int)(word0(d) >> Exp_shift1 & (Exp_mask>>Exp_shift1));
<a name="l02642"></a>02642 <span class="preprocessor">#else</span>
<a name="l02643"></a>02643 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((i = (<span class="keywordtype">int</span>)(word0(d) >> Exp_shift1 & (Exp_mask>>Exp_shift1)))) {
<a name="l02644"></a>02644 <span class="preprocessor">#endif</span>
<a name="l02645"></a>02645 <span class="preprocessor"></span> dval(d2) = dval(d);
<a name="l02646"></a>02646 word0(d2) &= Frac_mask1;
<a name="l02647"></a>02647 word0(d2) |= Exp_11;
<a name="l02648"></a>02648 <span class="preprocessor">#ifdef IBM</span>
<a name="l02649"></a>02649 <span class="preprocessor"></span> <span class="keywordflow">if</span> (j = 11 - hi0bits(word0(d2) & Frac_mask))
<a name="l02650"></a>02650 dval(d2) /= 1 << j;
<a name="l02651"></a>02651 <span class="preprocessor">#endif</span>
<a name="l02652"></a>02652 <span class="preprocessor"></span>
<a name="l02653"></a>02653 <span class="comment">/* log(x) ~=~ log(1.5) + (x-1.5)/1.5</span>
<a name="l02654"></a>02654 <span class="comment"> * log10(x) = log(x) / log(10)</span>
<a name="l02655"></a>02655 <span class="comment"> * ~=~ log(1.5)/log(10) + (x-1.5)/(1.5*log(10))</span>
<a name="l02656"></a>02656 <span class="comment"> * log10(d) = (i-Bias)*log(2)/log(10) + log10(d2)</span>
<a name="l02657"></a>02657 <span class="comment"> *</span>
<a name="l02658"></a>02658 <span class="comment"> * This suggests computing an approximation k to log10(d) by</span>
<a name="l02659"></a>02659 <span class="comment"> *</span>
<a name="l02660"></a>02660 <span class="comment"> * k = (i - Bias)*0.301029995663981</span>
<a name="l02661"></a>02661 <span class="comment"> * + ( (d2-1.5)*0.289529654602168 + 0.176091259055681 );</span>
<a name="l02662"></a>02662 <span class="comment"> *</span>
<a name="l02663"></a>02663 <span class="comment"> * We want k to be too large rather than too small.</span>
<a name="l02664"></a>02664 <span class="comment"> * The error in the first-order Taylor series approximation</span>
<a name="l02665"></a>02665 <span class="comment"> * is in our favor, so we just round up the constant enough</span>
<a name="l02666"></a>02666 <span class="comment"> * to compensate for any error in the multiplication of</span>
<a name="l02667"></a>02667 <span class="comment"> * (i - Bias) by 0.301029995663981; since |i - Bias| <= 1077,</span>
<a name="l02668"></a>02668 <span class="comment"> * and 1077 * 0.30103 * 2^-52 ~=~ 7.2e-14,</span>
<a name="l02669"></a>02669 <span class="comment"> * adding 1e-13 to the constant term more than suffices.</span>
<a name="l02670"></a>02670 <span class="comment"> * Hence we adjust the constant term to 0.1760912590558.</span>
<a name="l02671"></a>02671 <span class="comment"> * (We could get a more accurate k by invoking log10,</span>
<a name="l02672"></a>02672 <span class="comment"> * but this is probably not worthwhile.)</span>
<a name="l02673"></a>02673 <span class="comment"> */</span>
<a name="l02674"></a>02674
<a name="l02675"></a>02675 i -= Bias;
<a name="l02676"></a>02676 <span class="preprocessor">#ifdef IBM</span>
<a name="l02677"></a>02677 <span class="preprocessor"></span> i <<= 2;
<a name="l02678"></a>02678 i += j;
<a name="l02679"></a>02679 <span class="preprocessor">#endif</span>
<a name="l02680"></a>02680 <span class="preprocessor"></span><span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l02681"></a>02681 <span class="preprocessor"></span> denorm = 0;
<a name="l02682"></a>02682 }
<a name="l02683"></a>02683 <span class="keywordflow">else</span> {
<a name="l02684"></a>02684 <span class="comment">/* d is denormalized */</span>
<a name="l02685"></a>02685
<a name="l02686"></a>02686 i = bbits + be + (Bias + (P-1) - 1);
<a name="l02687"></a>02687 x = i > 32 ? word0(d) << 64 - i | word1(d) >> i - 32
<a name="l02688"></a>02688 : word1(d) << 32 - i;
<a name="l02689"></a>02689 dval(d2) = x;
<a name="l02690"></a>02690 word0(d2) -= 31*Exp_msk1; <span class="comment">/* adjust exponent */</span>
<a name="l02691"></a>02691 i -= (Bias + (P-1) - 1) + 1;
<a name="l02692"></a>02692 denorm = 1;
<a name="l02693"></a>02693 }
<a name="l02694"></a>02694 <span class="preprocessor">#endif</span>
<a name="l02695"></a>02695 <span class="preprocessor"></span> ds = (dval(d2)-1.5)*0.289529654602168 + 0.1760912590558 + i*0.301029995663981;
<a name="l02696"></a>02696 k = (int)ds;
<a name="l02697"></a>02697 <span class="keywordflow">if</span> (ds < 0. && ds != k)
<a name="l02698"></a>02698 k--; <span class="comment">/* want k = floor(ds) */</span>
<a name="l02699"></a>02699 k_check = 1;
<a name="l02700"></a>02700 <span class="keywordflow">if</span> (k >= 0 && k <= Ten_pmax) {
<a name="l02701"></a>02701 <span class="keywordflow">if</span> (dval(d) < tens[k])
<a name="l02702"></a>02702 k--;
<a name="l02703"></a>02703 k_check = 0;
<a name="l02704"></a>02704 }
<a name="l02705"></a>02705 j = bbits - i - 1;
<a name="l02706"></a>02706 <span class="keywordflow">if</span> (j >= 0) {
<a name="l02707"></a>02707 b2 = 0;
<a name="l02708"></a>02708 s2 = j;
<a name="l02709"></a>02709 }
<a name="l02710"></a>02710 <span class="keywordflow">else</span> {
<a name="l02711"></a>02711 b2 = -j;
<a name="l02712"></a>02712 s2 = 0;
<a name="l02713"></a>02713 }
<a name="l02714"></a>02714 <span class="keywordflow">if</span> (k >= 0) {
<a name="l02715"></a>02715 b5 = 0;
<a name="l02716"></a>02716 s5 = k;
<a name="l02717"></a>02717 s2 += k;
<a name="l02718"></a>02718 }
<a name="l02719"></a>02719 <span class="keywordflow">else</span> {
<a name="l02720"></a>02720 b2 -= k;
<a name="l02721"></a>02721 b5 = -k;
<a name="l02722"></a>02722 s5 = 0;
<a name="l02723"></a>02723 }
<a name="l02724"></a>02724 <span class="keywordflow">if</span> (mode < 0 || mode > 9)
<a name="l02725"></a>02725 mode = 0;
<a name="l02726"></a>02726
<a name="l02727"></a>02727 <span class="preprocessor">#ifndef SET_INEXACT</span>
<a name="l02728"></a>02728 <span class="preprocessor"></span><span class="preprocessor">#ifdef Check_FLT_ROUNDS</span>
<a name="l02729"></a>02729 <span class="preprocessor"></span> try_quick = Rounding == 1;
<a name="l02730"></a>02730 <span class="preprocessor">#else</span>
<a name="l02731"></a>02731 <span class="preprocessor"></span> try_quick = 1;
<a name="l02732"></a>02732 <span class="preprocessor">#endif</span>
<a name="l02733"></a>02733 <span class="preprocessor"></span><span class="preprocessor">#endif </span><span class="comment">/*SET_INEXACT*/</span>
<a name="l02734"></a>02734
<a name="l02735"></a>02735 <span class="keywordflow">if</span> (mode > 5) {
<a name="l02736"></a>02736 mode -= 4;
<a name="l02737"></a>02737 try_quick = 0;
<a name="l02738"></a>02738 }
<a name="l02739"></a>02739 leftright = 1;
<a name="l02740"></a>02740 <span class="keywordflow">switch</span>(mode) {
<a name="l02741"></a>02741 <span class="keywordflow">case</span> 0:
<a name="l02742"></a>02742 <span class="keywordflow">case</span> 1:
<a name="l02743"></a>02743 ilim = ilim1 = -1;
<a name="l02744"></a>02744 i = 18;
<a name="l02745"></a>02745 ndigits = 0;
<a name="l02746"></a>02746 <span class="keywordflow">break</span>;
<a name="l02747"></a>02747 <span class="keywordflow">case</span> 2:
<a name="l02748"></a>02748 leftright = 0;
<a name="l02749"></a>02749 <span class="comment">/* no break */</span>
<a name="l02750"></a>02750 <span class="keywordflow">case</span> 4:
<a name="l02751"></a>02751 <span class="keywordflow">if</span> (ndigits <= 0)
<a name="l02752"></a>02752 ndigits = 1;
<a name="l02753"></a>02753 ilim = ilim1 = i = ndigits;
<a name="l02754"></a>02754 <span class="keywordflow">break</span>;
<a name="l02755"></a>02755 <span class="keywordflow">case</span> 3:
<a name="l02756"></a>02756 leftright = 0;
<a name="l02757"></a>02757 <span class="comment">/* no break */</span>
<a name="l02758"></a>02758 <span class="keywordflow">case</span> 5:
<a name="l02759"></a>02759 i = ndigits + k + 1;
<a name="l02760"></a>02760 ilim = i;
<a name="l02761"></a>02761 ilim1 = i - 1;
<a name="l02762"></a>02762 <span class="keywordflow">if</span> (i <= 0)
<a name="l02763"></a>02763 i = 1;
<a name="l02764"></a>02764 }
<a name="l02765"></a>02765 s = s0 = rv_alloc(i);
<a name="l02766"></a>02766
<a name="l02767"></a>02767 <span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l02768"></a>02768 <span class="preprocessor"></span> <span class="keywordflow">if</span> (mode > 1 && rounding != 1)
<a name="l02769"></a>02769 leftright = 0;
<a name="l02770"></a>02770 <span class="preprocessor">#endif</span>
<a name="l02771"></a>02771 <span class="preprocessor"></span>
<a name="l02772"></a>02772 <span class="keywordflow">if</span> (ilim >= 0 && ilim <= Quick_max && try_quick) {
<a name="l02773"></a>02773
<a name="l02774"></a>02774 <span class="comment">/* Try to get by with floating-point arithmetic. */</span>
<a name="l02775"></a>02775
<a name="l02776"></a>02776 i = 0;
<a name="l02777"></a>02777 dval(d2) = dval(d);
<a name="l02778"></a>02778 k0 = k;
<a name="l02779"></a>02779 ilim0 = ilim;
<a name="l02780"></a>02780 ieps = 2; <span class="comment">/* conservative */</span>
<a name="l02781"></a>02781 <span class="keywordflow">if</span> (k > 0) {
<a name="l02782"></a>02782 ds = tens[k&0xf];
<a name="l02783"></a>02783 j = k >> 4;
<a name="l02784"></a>02784 <span class="keywordflow">if</span> (j & Bletch) {
<a name="l02785"></a>02785 <span class="comment">/* prevent overflows */</span>
<a name="l02786"></a>02786 j &= Bletch - 1;
<a name="l02787"></a>02787 dval(d) /= bigtens[n_bigtens-1];
<a name="l02788"></a>02788 ieps++;
<a name="l02789"></a>02789 }
<a name="l02790"></a>02790 <span class="keywordflow">for</span>(; j; j >>= 1, i++)
<a name="l02791"></a>02791 <span class="keywordflow">if</span> (j & 1) {
<a name="l02792"></a>02792 ieps++;
<a name="l02793"></a>02793 ds *= bigtens[i];
<a name="l02794"></a>02794 }
<a name="l02795"></a>02795 dval(d) /= ds;
<a name="l02796"></a>02796 }
<a name="l02797"></a>02797 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((j1 = -k)) {
<a name="l02798"></a>02798 dval(d) *= tens[j1 & 0xf];
<a name="l02799"></a>02799 <span class="keywordflow">for</span>(j = j1 >> 4; j; j >>= 1, i++)
<a name="l02800"></a>02800 <span class="keywordflow">if</span> (j & 1) {
<a name="l02801"></a>02801 ieps++;
<a name="l02802"></a>02802 dval(d) *= bigtens[i];
<a name="l02803"></a>02803 }
<a name="l02804"></a>02804 }
<a name="l02805"></a>02805 <span class="keywordflow">if</span> (k_check && dval(d) < 1. && ilim > 0) {
<a name="l02806"></a>02806 <span class="keywordflow">if</span> (ilim1 <= 0)
<a name="l02807"></a>02807 <span class="keywordflow">goto</span> fast_failed;
<a name="l02808"></a>02808 ilim = ilim1;
<a name="l02809"></a>02809 k--;
<a name="l02810"></a>02810 dval(d) *= 10.;
<a name="l02811"></a>02811 ieps++;
<a name="l02812"></a>02812 }
<a name="l02813"></a>02813 dval(eps) = ieps*dval(d) + 7.;
<a name="l02814"></a>02814 word0(eps) -= (P-1)*Exp_msk1;
<a name="l02815"></a>02815 <span class="keywordflow">if</span> (ilim == 0) {
<a name="l02816"></a>02816 S = mhi = 0;
<a name="l02817"></a>02817 dval(d) -= 5.;
<a name="l02818"></a>02818 <span class="keywordflow">if</span> (dval(d) > dval(eps))
<a name="l02819"></a>02819 <span class="keywordflow">goto</span> one_digit;
<a name="l02820"></a>02820 <span class="keywordflow">if</span> (dval(d) < -dval(eps))
<a name="l02821"></a>02821 <span class="keywordflow">goto</span> no_digits;
<a name="l02822"></a>02822 <span class="keywordflow">goto</span> fast_failed;
<a name="l02823"></a>02823 }
<a name="l02824"></a>02824 <span class="preprocessor">#ifndef No_leftright</span>
<a name="l02825"></a>02825 <span class="preprocessor"></span> <span class="keywordflow">if</span> (leftright) {
<a name="l02826"></a>02826 <span class="comment">/* Use Steele & White method of only</span>
<a name="l02827"></a>02827 <span class="comment"> * generating digits needed.</span>
<a name="l02828"></a>02828 <span class="comment"> */</span>
<a name="l02829"></a>02829 dval(eps) = 0.5/tens[ilim-1] - dval(eps);
<a name="l02830"></a>02830 <span class="keywordflow">for</span>(i = 0;;) {
<a name="l02831"></a>02831 L = (<span class="keywordtype">long</span> int)dval(d);
<a name="l02832"></a>02832 dval(d) -= L;
<a name="l02833"></a>02833 *s++ = <span class="charliteral">'0'</span> + (int)L;
<a name="l02834"></a>02834 <span class="keywordflow">if</span> (dval(d) < dval(eps))
<a name="l02835"></a>02835 <span class="keywordflow">goto</span> ret1;
<a name="l02836"></a>02836 <span class="keywordflow">if</span> (1. - dval(d) < dval(eps))
<a name="l02837"></a>02837 <span class="keywordflow">goto</span> bump_up;
<a name="l02838"></a>02838 <span class="keywordflow">if</span> (++i >= ilim)
<a name="l02839"></a>02839 <span class="keywordflow">break</span>;
<a name="l02840"></a>02840 dval(eps) *= 10.;
<a name="l02841"></a>02841 dval(d) *= 10.;
<a name="l02842"></a>02842 }
<a name="l02843"></a>02843 }
<a name="l02844"></a>02844 <span class="keywordflow">else</span> {
<a name="l02845"></a>02845 <span class="preprocessor">#endif</span>
<a name="l02846"></a>02846 <span class="preprocessor"></span> <span class="comment">/* Generate ilim digits, then fix them up. */</span>
<a name="l02847"></a>02847 dval(eps) *= tens[ilim-1];
<a name="l02848"></a>02848 <span class="keywordflow">for</span>(i = 1;; i++, dval(d) *= 10.) {
<a name="l02849"></a>02849 L = (Long)(dval(d));
<a name="l02850"></a>02850 <span class="keywordflow">if</span> (!(dval(d) -= L))
<a name="l02851"></a>02851 ilim = i;
<a name="l02852"></a>02852 *s++ = <span class="charliteral">'0'</span> + (int)L;
<a name="l02853"></a>02853 <span class="keywordflow">if</span> (i == ilim) {
<a name="l02854"></a>02854 <span class="keywordflow">if</span> (dval(d) > 0.5 + dval(eps))
<a name="l02855"></a>02855 <span class="keywordflow">goto</span> bump_up;
<a name="l02856"></a>02856 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (dval(d) < 0.5 - dval(eps)) {
<a name="l02857"></a>02857 <span class="keywordflow">while</span>(*--s == <span class="charliteral">'0'</span>)
<a name="l02858"></a>02858 ;
<a name="l02859"></a>02859 s++;
<a name="l02860"></a>02860 <span class="keywordflow">goto</span> ret1;
<a name="l02861"></a>02861 }
<a name="l02862"></a>02862 <span class="keywordflow">break</span>;
<a name="l02863"></a>02863 }
<a name="l02864"></a>02864 }
<a name="l02865"></a>02865 <span class="preprocessor">#ifndef No_leftright</span>
<a name="l02866"></a>02866 <span class="preprocessor"></span> }
<a name="l02867"></a>02867 <span class="preprocessor">#endif</span>
<a name="l02868"></a>02868 <span class="preprocessor"></span> fast_failed:
<a name="l02869"></a>02869 s = s0;
<a name="l02870"></a>02870 dval(d) = dval(d2);
<a name="l02871"></a>02871 k = k0;
<a name="l02872"></a>02872 ilim = ilim0;
<a name="l02873"></a>02873 }
<a name="l02874"></a>02874
<a name="l02875"></a>02875 <span class="comment">/* Do we have a "small" integer? */</span>
<a name="l02876"></a>02876
<a name="l02877"></a>02877 <span class="keywordflow">if</span> (be >= 0 && k <= Int_max) {
<a name="l02878"></a>02878 <span class="comment">/* Yes. */</span>
<a name="l02879"></a>02879 ds = tens[k];
<a name="l02880"></a>02880 <span class="keywordflow">if</span> (ndigits < 0 && ilim <= 0) {
<a name="l02881"></a>02881 S = mhi = 0;
<a name="l02882"></a>02882 <span class="keywordflow">if</span> (ilim < 0 || dval(d) <= 5*ds)
<a name="l02883"></a>02883 <span class="keywordflow">goto</span> no_digits;
<a name="l02884"></a>02884 <span class="keywordflow">goto</span> one_digit;
<a name="l02885"></a>02885 }
<a name="l02886"></a>02886 <span class="keywordflow">for</span>(i = 1;; i++, dval(d) *= 10.) {
<a name="l02887"></a>02887 L = (Long)(dval(d) / ds);
<a name="l02888"></a>02888 dval(d) -= L*ds;
<a name="l02889"></a>02889 <span class="preprocessor">#ifdef Check_FLT_ROUNDS</span>
<a name="l02890"></a>02890 <span class="preprocessor"></span> <span class="comment">/* If FLT_ROUNDS == 2, L will usually be high by 1 */</span>
<a name="l02891"></a>02891 <span class="keywordflow">if</span> (dval(d) < 0) {
<a name="l02892"></a>02892 L--;
<a name="l02893"></a>02893 dval(d) += ds;
<a name="l02894"></a>02894 }
<a name="l02895"></a>02895 <span class="preprocessor">#endif</span>
<a name="l02896"></a>02896 <span class="preprocessor"></span> *s++ = <span class="charliteral">'0'</span> + (int)L;
<a name="l02897"></a>02897 <span class="keywordflow">if</span> (!dval(d)) {
<a name="l02898"></a>02898 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l02899"></a>02899 <span class="preprocessor"></span> inexact = 0;
<a name="l02900"></a>02900 <span class="preprocessor">#endif</span>
<a name="l02901"></a>02901 <span class="preprocessor"></span> <span class="keywordflow">break</span>;
<a name="l02902"></a>02902 }
<a name="l02903"></a>02903 <span class="keywordflow">if</span> (i == ilim) {
<a name="l02904"></a>02904 <span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l02905"></a>02905 <span class="preprocessor"></span> <span class="keywordflow">if</span> (mode > 1)
<a name="l02906"></a>02906 <span class="keywordflow">switch</span>(rounding) {
<a name="l02907"></a>02907 <span class="keywordflow">case</span> 0: <span class="keywordflow">goto</span> ret1;
<a name="l02908"></a>02908 <span class="keywordflow">case</span> 2: <span class="keywordflow">goto</span> bump_up;
<a name="l02909"></a>02909 }
<a name="l02910"></a>02910 <span class="preprocessor">#endif</span>
<a name="l02911"></a>02911 <span class="preprocessor"></span> dval(d) += dval(d);
<a name="l02912"></a>02912 <span class="keywordflow">if</span> (dval(d) > ds || dval(d) == ds && L & 1) {
<a name="l02913"></a>02913 bump_up:
<a name="l02914"></a>02914 <span class="keywordflow">while</span>(*--s == <span class="charliteral">'9'</span>)
<a name="l02915"></a>02915 <span class="keywordflow">if</span> (s == s0) {
<a name="l02916"></a>02916 k++;
<a name="l02917"></a>02917 *s = <span class="charliteral">'0'</span>;
<a name="l02918"></a>02918 <span class="keywordflow">break</span>;
<a name="l02919"></a>02919 }
<a name="l02920"></a>02920 ++*s++;
<a name="l02921"></a>02921 }
<a name="l02922"></a>02922 <span class="keywordflow">break</span>;
<a name="l02923"></a>02923 }
<a name="l02924"></a>02924 }
<a name="l02925"></a>02925 <span class="keywordflow">goto</span> ret1;
<a name="l02926"></a>02926 }
<a name="l02927"></a>02927
<a name="l02928"></a>02928 m2 = b2;
<a name="l02929"></a>02929 m5 = b5;
<a name="l02930"></a>02930 mhi = mlo = 0;
<a name="l02931"></a>02931 <span class="keywordflow">if</span> (leftright) {
<a name="l02932"></a>02932 i =
<a name="l02933"></a>02933 <span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l02934"></a>02934 <span class="preprocessor"></span> denorm ? be + (Bias + (P-1) - 1 + 1) :
<a name="l02935"></a>02935 #endif
<a name="l02936"></a>02936 #ifdef IBM
<a name="l02937"></a>02937 1 + 4*P - 3 - bbits + ((bbits + be - 1) & 3);
<a name="l02938"></a>02938 <span class="preprocessor">#else</span>
<a name="l02939"></a>02939 <span class="preprocessor"></span> 1 + P - bbits;
<a name="l02940"></a>02940 <span class="preprocessor">#endif</span>
<a name="l02941"></a>02941 <span class="preprocessor"></span> b2 += i;
<a name="l02942"></a>02942 s2 += i;
<a name="l02943"></a>02943 mhi = i2b(1);
<a name="l02944"></a>02944 }
<a name="l02945"></a>02945 <span class="keywordflow">if</span> (m2 > 0 && s2 > 0) {
<a name="l02946"></a>02946 i = m2 < s2 ? m2 : s2;
<a name="l02947"></a>02947 b2 -= i;
<a name="l02948"></a>02948 m2 -= i;
<a name="l02949"></a>02949 s2 -= i;
<a name="l02950"></a>02950 }
<a name="l02951"></a>02951 <span class="keywordflow">if</span> (b5 > 0) {
<a name="l02952"></a>02952 <span class="keywordflow">if</span> (leftright) {
<a name="l02953"></a>02953 <span class="keywordflow">if</span> (m5 > 0) {
<a name="l02954"></a>02954 mhi = pow5mult(mhi, m5);
<a name="l02955"></a>02955 b1 = mult(mhi, b);
<a name="l02956"></a>02956 Bfree(b);
<a name="l02957"></a>02957 b = b1;
<a name="l02958"></a>02958 }
<a name="l02959"></a>02959 <span class="keywordflow">if</span> ((j = b5 - m5))
<a name="l02960"></a>02960 b = pow5mult(b, j);
<a name="l02961"></a>02961 }
<a name="l02962"></a>02962 <span class="keywordflow">else</span>
<a name="l02963"></a>02963 b = pow5mult(b, b5);
<a name="l02964"></a>02964 }
<a name="l02965"></a>02965 S = i2b(1);
<a name="l02966"></a>02966 <span class="keywordflow">if</span> (s5 > 0)
<a name="l02967"></a>02967 S = pow5mult(S, s5);
<a name="l02968"></a>02968
<a name="l02969"></a>02969 <span class="comment">/* Check for special case that d is a normalized power of 2. */</span>
<a name="l02970"></a>02970
<a name="l02971"></a>02971 spec_case = 0;
<a name="l02972"></a>02972 <span class="keywordflow">if</span> ((mode < 2 || leftright)
<a name="l02973"></a>02973 #ifdef Honor_FLT_ROUNDS
<a name="l02974"></a>02974 && rounding == 1
<a name="l02975"></a>02975 #endif
<a name="l02976"></a>02976 ) {
<a name="l02977"></a>02977 <span class="keywordflow">if</span> (!word1(d) && !(word0(d) & Bndry_mask)
<a name="l02978"></a>02978 #ifndef Sudden_Underflow
<a name="l02979"></a>02979 && word0(d) & (Exp_mask & ~Exp_msk1)
<a name="l02980"></a>02980 #endif
<a name="l02981"></a>02981 ) {
<a name="l02982"></a>02982 <span class="comment">/* The special case */</span>
<a name="l02983"></a>02983 b2 += Log2P;
<a name="l02984"></a>02984 s2 += Log2P;
<a name="l02985"></a>02985 spec_case = 1;
<a name="l02986"></a>02986 }
<a name="l02987"></a>02987 }
<a name="l02988"></a>02988
<a name="l02989"></a>02989 <span class="comment">/* Arrange for convenient computation of quotients:</span>
<a name="l02990"></a>02990 <span class="comment"> * shift left if necessary so divisor has 4 leading 0 bits.</span>
<a name="l02991"></a>02991 <span class="comment"> *</span>
<a name="l02992"></a>02992 <span class="comment"> * Perhaps we should just compute leading 28 bits of S once</span>
<a name="l02993"></a>02993 <span class="comment"> * and for all and pass them and a shift to quorem, so it</span>
<a name="l02994"></a>02994 <span class="comment"> * can do shifts and ors to compute the numerator for q.</span>
<a name="l02995"></a>02995 <span class="comment"> */</span>
<a name="l02996"></a>02996 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l02997"></a>02997 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((i = ((s5 ? 32 - hi0bits(S->x[S->wds-1]) : 1) + s2) & 0x1f))
<a name="l02998"></a>02998 i = 32 - i;
<a name="l02999"></a>02999 <span class="preprocessor">#else</span>
<a name="l03000"></a>03000 <span class="preprocessor"></span> <span class="keywordflow">if</span> (i = ((s5 ? 32 - hi0bits(S->x[S->wds-1]) : 1) + s2) & 0xf)
<a name="l03001"></a>03001 i = 16 - i;
<a name="l03002"></a>03002 <span class="preprocessor">#endif</span>
<a name="l03003"></a>03003 <span class="preprocessor"></span> <span class="keywordflow">if</span> (i > 4) {
<a name="l03004"></a>03004 i -= 4;
<a name="l03005"></a>03005 b2 += i;
<a name="l03006"></a>03006 m2 += i;
<a name="l03007"></a>03007 s2 += i;
<a name="l03008"></a>03008 }
<a name="l03009"></a>03009 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i < 4) {
<a name="l03010"></a>03010 i += 28;
<a name="l03011"></a>03011 b2 += i;
<a name="l03012"></a>03012 m2 += i;
<a name="l03013"></a>03013 s2 += i;
<a name="l03014"></a>03014 }
<a name="l03015"></a>03015 <span class="keywordflow">if</span> (b2 > 0)
<a name="l03016"></a>03016 b = lshift(b, b2);
<a name="l03017"></a>03017 <span class="keywordflow">if</span> (s2 > 0)
<a name="l03018"></a>03018 S = lshift(S, s2);
<a name="l03019"></a>03019 <span class="keywordflow">if</span> (k_check) {
<a name="l03020"></a>03020 <span class="keywordflow">if</span> (cmp(b,S) < 0) {
<a name="l03021"></a>03021 k--;
<a name="l03022"></a>03022 b = multadd(b, 10, 0); <span class="comment">/* we botched the k estimate */</span>
<a name="l03023"></a>03023 <span class="keywordflow">if</span> (leftright)
<a name="l03024"></a>03024 mhi = multadd(mhi, 10, 0);
<a name="l03025"></a>03025 ilim = ilim1;
<a name="l03026"></a>03026 }
<a name="l03027"></a>03027 }
<a name="l03028"></a>03028 <span class="keywordflow">if</span> (ilim <= 0 && (mode == 3 || mode == 5)) {
<a name="l03029"></a>03029 <span class="keywordflow">if</span> (ilim < 0 || cmp(b,S = multadd(S,5,0)) <= 0) {
<a name="l03030"></a>03030 <span class="comment">/* no digits, fcvt style */</span>
<a name="l03031"></a>03031 no_digits:
<a name="l03032"></a>03032 k = -1 - ndigits;
<a name="l03033"></a>03033 <span class="keywordflow">goto</span> ret;
<a name="l03034"></a>03034 }
<a name="l03035"></a>03035 one_digit:
<a name="l03036"></a>03036 *s++ = <span class="charliteral">'1'</span>;
<a name="l03037"></a>03037 k++;
<a name="l03038"></a>03038 <span class="keywordflow">goto</span> ret;
<a name="l03039"></a>03039 }
<a name="l03040"></a>03040 <span class="keywordflow">if</span> (leftright) {
<a name="l03041"></a>03041 <span class="keywordflow">if</span> (m2 > 0)
<a name="l03042"></a>03042 mhi = lshift(mhi, m2);
<a name="l03043"></a>03043
<a name="l03044"></a>03044 <span class="comment">/* Compute mlo -- check for special case</span>
<a name="l03045"></a>03045 <span class="comment"> * that d is a normalized power of 2.</span>
<a name="l03046"></a>03046 <span class="comment"> */</span>
<a name="l03047"></a>03047
<a name="l03048"></a>03048 mlo = mhi;
<a name="l03049"></a>03049 <span class="keywordflow">if</span> (spec_case) {
<a name="l03050"></a>03050 mhi = Balloc(mhi->k);
<a name="l03051"></a>03051 Bcopy(mhi, mlo);
<a name="l03052"></a>03052 mhi = lshift(mhi, Log2P);
<a name="l03053"></a>03053 }
<a name="l03054"></a>03054
<a name="l03055"></a>03055 <span class="keywordflow">for</span>(i = 1;;i++) {
<a name="l03056"></a>03056 dig = quorem(b,S) + <span class="charliteral">'0'</span>;
<a name="l03057"></a>03057 <span class="comment">/* Do we yet have the shortest decimal string</span>
<a name="l03058"></a>03058 <span class="comment"> * that will round to d?</span>
<a name="l03059"></a>03059 <span class="comment"> */</span>
<a name="l03060"></a>03060 j = cmp(b, mlo);
<a name="l03061"></a>03061 delta = diff(S, mhi);
<a name="l03062"></a>03062 j1 = delta->sign ? 1 : cmp(b, delta);
<a name="l03063"></a>03063 Bfree(delta);
<a name="l03064"></a>03064 <span class="preprocessor">#ifndef ROUND_BIASED</span>
<a name="l03065"></a>03065 <span class="preprocessor"></span> <span class="keywordflow">if</span> (j1 == 0 && mode != 1 && !(word1(d) & 1)
<a name="l03066"></a>03066 #ifdef Honor_FLT_ROUNDS
<a name="l03067"></a>03067 && rounding >= 1
<a name="l03068"></a>03068 #endif
<a name="l03069"></a>03069 ) {
<a name="l03070"></a>03070 <span class="keywordflow">if</span> (dig == <span class="charliteral">'9'</span>)
<a name="l03071"></a>03071 <span class="keywordflow">goto</span> round_9_up;
<a name="l03072"></a>03072 <span class="keywordflow">if</span> (j > 0)
<a name="l03073"></a>03073 dig++;
<a name="l03074"></a>03074 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l03075"></a>03075 <span class="preprocessor"></span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!b->x[0] && b->wds <= 1)
<a name="l03076"></a>03076 inexact = 0;
<a name="l03077"></a>03077 <span class="preprocessor">#endif</span>
<a name="l03078"></a>03078 <span class="preprocessor"></span> *s++ = dig;
<a name="l03079"></a>03079 <span class="keywordflow">goto</span> ret;
<a name="l03080"></a>03080 }
<a name="l03081"></a>03081 <span class="preprocessor">#endif</span>
<a name="l03082"></a>03082 <span class="preprocessor"></span> <span class="keywordflow">if</span> (j < 0 || j == 0 && mode != 1
<a name="l03083"></a>03083 #ifndef ROUND_BIASED
<a name="l03084"></a>03084 && !(word1(d) & 1)
<a name="l03085"></a>03085 #endif
<a name="l03086"></a>03086 ) {
<a name="l03087"></a>03087 <span class="keywordflow">if</span> (!b->x[0] && b->wds <= 1) {
<a name="l03088"></a>03088 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l03089"></a>03089 <span class="preprocessor"></span> inexact = 0;
<a name="l03090"></a>03090 <span class="preprocessor">#endif</span>
<a name="l03091"></a>03091 <span class="preprocessor"></span> <span class="keywordflow">goto</span> accept_dig;
<a name="l03092"></a>03092 }
<a name="l03093"></a>03093 <span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l03094"></a>03094 <span class="preprocessor"></span> <span class="keywordflow">if</span> (mode > 1)
<a name="l03095"></a>03095 <span class="keywordflow">switch</span>(rounding) {
<a name="l03096"></a>03096 <span class="keywordflow">case</span> 0: <span class="keywordflow">goto</span> accept_dig;
<a name="l03097"></a>03097 <span class="keywordflow">case</span> 2: <span class="keywordflow">goto</span> keep_dig;
<a name="l03098"></a>03098 }
<a name="l03099"></a>03099 <span class="preprocessor">#endif </span><span class="comment">/*Honor_FLT_ROUNDS*/</span>
<a name="l03100"></a>03100 <span class="keywordflow">if</span> (j1 > 0) {
<a name="l03101"></a>03101 b = lshift(b, 1);
<a name="l03102"></a>03102 j1 = cmp(b, S);
<a name="l03103"></a>03103 <span class="keywordflow">if</span> ((j1 > 0 || j1 == 0 && dig & 1)
<a name="l03104"></a>03104 && dig++ == <span class="charliteral">'9'</span>)
<a name="l03105"></a>03105 <span class="keywordflow">goto</span> round_9_up;
<a name="l03106"></a>03106 }
<a name="l03107"></a>03107 accept_dig:
<a name="l03108"></a>03108 *s++ = dig;
<a name="l03109"></a>03109 <span class="keywordflow">goto</span> ret;
<a name="l03110"></a>03110 }
<a name="l03111"></a>03111 <span class="keywordflow">if</span> (j1 > 0) {
<a name="l03112"></a>03112 <span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l03113"></a>03113 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!rounding)
<a name="l03114"></a>03114 <span class="keywordflow">goto</span> accept_dig;
<a name="l03115"></a>03115 <span class="preprocessor">#endif</span>
<a name="l03116"></a>03116 <span class="preprocessor"></span> <span class="keywordflow">if</span> (dig == <span class="charliteral">'9'</span>) { <span class="comment">/* possible if i == 1 */</span>
<a name="l03117"></a>03117 round_9_up:
<a name="l03118"></a>03118 *s++ = <span class="charliteral">'9'</span>;
<a name="l03119"></a>03119 <span class="keywordflow">goto</span> roundoff;
<a name="l03120"></a>03120 }
<a name="l03121"></a>03121 *s++ = dig + 1;
<a name="l03122"></a>03122 <span class="keywordflow">goto</span> ret;
<a name="l03123"></a>03123 }
<a name="l03124"></a>03124 <span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l03125"></a>03125 <span class="preprocessor"></span> keep_dig:
<a name="l03126"></a>03126 <span class="preprocessor">#endif</span>
<a name="l03127"></a>03127 <span class="preprocessor"></span> *s++ = dig;
<a name="l03128"></a>03128 <span class="keywordflow">if</span> (i == ilim)
<a name="l03129"></a>03129 <span class="keywordflow">break</span>;
<a name="l03130"></a>03130 b = multadd(b, 10, 0);
<a name="l03131"></a>03131 <span class="keywordflow">if</span> (mlo == mhi)
<a name="l03132"></a>03132 mlo = mhi = multadd(mhi, 10, 0);
<a name="l03133"></a>03133 <span class="keywordflow">else</span> {
<a name="l03134"></a>03134 mlo = multadd(mlo, 10, 0);
<a name="l03135"></a>03135 mhi = multadd(mhi, 10, 0);
<a name="l03136"></a>03136 }
<a name="l03137"></a>03137 }
<a name="l03138"></a>03138 }
<a name="l03139"></a>03139 <span class="keywordflow">else</span>
<a name="l03140"></a>03140 <span class="keywordflow">for</span>(i = 1;; i++) {
<a name="l03141"></a>03141 *s++ = dig = quorem(b,S) + <span class="charliteral">'0'</span>;
<a name="l03142"></a>03142 <span class="keywordflow">if</span> (!b->x[0] && b->wds <= 1) {
<a name="l03143"></a>03143 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l03144"></a>03144 <span class="preprocessor"></span> inexact = 0;
<a name="l03145"></a>03145 <span class="preprocessor">#endif</span>
<a name="l03146"></a>03146 <span class="preprocessor"></span> <span class="keywordflow">goto</span> ret;
<a name="l03147"></a>03147 }
<a name="l03148"></a>03148 <span class="keywordflow">if</span> (i >= ilim)
<a name="l03149"></a>03149 <span class="keywordflow">break</span>;
<a name="l03150"></a>03150 b = multadd(b, 10, 0);
<a name="l03151"></a>03151 }
<a name="l03152"></a>03152
<a name="l03153"></a>03153 <span class="comment">/* Round off last digit */</span>
<a name="l03154"></a>03154
<a name="l03155"></a>03155 <span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l03156"></a>03156 <span class="preprocessor"></span> <span class="keywordflow">switch</span>(rounding) {
<a name="l03157"></a>03157 <span class="keywordflow">case</span> 0: <span class="keywordflow">goto</span> trimzeros;
<a name="l03158"></a>03158 <span class="keywordflow">case</span> 2: <span class="keywordflow">goto</span> roundoff;
<a name="l03159"></a>03159 }
<a name="l03160"></a>03160 <span class="preprocessor">#endif</span>
<a name="l03161"></a>03161 <span class="preprocessor"></span> b = lshift(b, 1);
<a name="l03162"></a>03162 j = cmp(b, S);
<a name="l03163"></a>03163 <span class="keywordflow">if</span> (j > 0 || j == 0 && dig & 1) {
<a name="l03164"></a>03164 roundoff:
<a name="l03165"></a>03165 <span class="keywordflow">while</span>(*--s == <span class="charliteral">'9'</span>)
<a name="l03166"></a>03166 <span class="keywordflow">if</span> (s == s0) {
<a name="l03167"></a>03167 k++;
<a name="l03168"></a>03168 *s++ = <span class="charliteral">'1'</span>;
<a name="l03169"></a>03169 <span class="keywordflow">goto</span> ret;
<a name="l03170"></a>03170 }
<a name="l03171"></a>03171 ++*s++;
<a name="l03172"></a>03172 }
<a name="l03173"></a>03173 <span class="keywordflow">else</span> {
<a name="l03174"></a>03174 <span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l03175"></a>03175 <span class="preprocessor"></span>trimzeros:
<a name="l03176"></a>03176 <span class="preprocessor">#endif</span>
<a name="l03177"></a>03177 <span class="preprocessor"></span> <span class="keywordflow">while</span>(*--s == <span class="charliteral">'0'</span>)
<a name="l03178"></a>03178 ;
<a name="l03179"></a>03179 s++;
<a name="l03180"></a>03180 }
<a name="l03181"></a>03181 ret:
<a name="l03182"></a>03182 Bfree(S);
<a name="l03183"></a>03183 <span class="keywordflow">if</span> (mhi) {
<a name="l03184"></a>03184 <span class="keywordflow">if</span> (mlo && mlo != mhi)
<a name="l03185"></a>03185 Bfree(mlo);
<a name="l03186"></a>03186 Bfree(mhi);
<a name="l03187"></a>03187 }
<a name="l03188"></a>03188 ret1:
<a name="l03189"></a>03189 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l03190"></a>03190 <span class="preprocessor"></span> <span class="keywordflow">if</span> (inexact) {
<a name="l03191"></a>03191 <span class="keywordflow">if</span> (!oldinexact) {
<a name="l03192"></a>03192 word0(d) = Exp_1 + (70 << Exp_shift);
<a name="l03193"></a>03193 word1(d) = 0;
<a name="l03194"></a>03194 dval(d) += 1.;
<a name="l03195"></a>03195 }
<a name="l03196"></a>03196 }
<a name="l03197"></a>03197 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!oldinexact)
<a name="l03198"></a>03198 clear_inexact();
<a name="l03199"></a>03199 <span class="preprocessor">#endif</span>
<a name="l03200"></a>03200 <span class="preprocessor"></span> Bfree(b);
<a name="l03201"></a>03201 *s = 0;
<a name="l03202"></a>03202 *decpt = k + 1;
<a name="l03203"></a>03203 <span class="keywordflow">if</span> (rve)
<a name="l03204"></a>03204 *rve = s;
<a name="l03205"></a>03205 <span class="keywordflow">return</span> s0;
<a name="l03206"></a>03206 }
<a name="l03207"></a>03207 <span class="preprocessor">#ifdef __cplusplus</span>
<a name="l03208"></a>03208 <span class="preprocessor"></span>}
<a name="l03209"></a>03209 <span class="preprocessor">#endif</span>
</pre></div></div>
</div>
</div></div>
</td>
</tr>
<tr>
<td valign="top" id="leftmenu" width="25%">
<a name="navigation"></a>
<div class="menu_box"><h2>kjs</h2>
<div class="nav_list">
<ul><li><a href="index.html">Main Page</a></li><li><a href="hierarchy.html">Class Hierarchy</a></li><li><a href="classes.html">Alphabetical List</a></li><li><a href="annotated.html">Class List</a></li><li><a href="files.html">File List</a></li><li><a href="functions.html">Class Members</a></li><li><a href="pages.html">Related Pages</a></li></ul>
<!--
<h2>Class Picker</h2>
<div style="text-align: center;">
<form name="guideform">
<select name="guidelinks" style="width:100%;" onChange="window.location=document.guideform.guidelinks.options[document.guideform.guidelinks.selectedIndex].value">
<option value="annotated.html">-- Choose --</option>
<option value="classKJS_1_1BinaryLogicalNode.html">kjs::binarylogicalnode</option>, <option value="classKJS_1_1Boolean.html">kjs::boolean</option>, <option value="classKJS_1_1Collector.html">kjs::collector</option>, <option value="classKJS_1_1Completion.html">kjs::completion</option>, <option value="classKJS_1_1ConditionalNode.html">kjs::conditionalnode</option>, <option value="classKJS_1_1Context.html">kjs::context</option>, <option value="classKJS_1_1ContextImp.html">kjs::contextimp</option>, <option value="classKJS_1_1CString.html">kjs::cstring</option>, <option value="classKJS_1_1Error.html">kjs::error</option>, <option value="classKJS_1_1ExecState.html">kjs::execstate</option>, <option value="classKJS_1_1FunctionImp.html">kjs::functionimp</option>, <option value="classKJS_1_1FunctionPrototypeImp.html">kjs::functionprototypeimp</option>, <option value="classKJS_1_1Identifier.html">kjs::identifier</option>, <option value="classKJS_1_1InternalFunctionImp.html">kjs::internalfunctionimp</option>, <option value="classKJS_1_1Interpreter.html">kjs::interpreter</option>, <option value="classKJS_1_1LabelStack.html">kjs::labelstack</option>, <option value="classKJS_1_1List.html">kjs::list</option>, <option value="classKJS_1_1ListIterator.html">kjs::listiterator</option>, <option value="classKJS_1_1Lookup.html">kjs::lookup</option>, <option value="classKJS_1_1Null.html">kjs::null</option>, <option value="classKJS_1_1Number.html">kjs::number</option>, <option value="classKJS_1_1Object.html">kjs::object</option>, <option value="classKJS_1_1PropertyMap.html">kjs::propertymap</option>, <option value="classKJS_1_1Reference.html">kjs::reference</option>, <option value="classKJS_1_1ReferenceList.html">kjs::referencelist</option>, <option value="classKJS_1_1ReferenceListIterator.html">kjs::referencelistiterator</option>, <option value="classKJS_1_1SavedProperties.html">kjs::savedproperties</option>, <option value="classKJS_1_1ScopeChain.html">kjs::scopechain</option>, <option value="classKJS_1_1ScopeChainNode.html">kjs::scopechainnode</option>, <option value="classKJS_1_1String.html">kjs::string</option>, <option value="classKJS_1_1UCharReference.html">kjs::ucharreference</option>, <option value="classKJS_1_1Undefined.html">kjs::undefined</option>, <option value="classKJS_1_1UString.html">kjs::ustring</option>, <option value="classKJS_1_1Value.html">kjs::value</option>, <option value="classKJS_1_1ValueImp.html">kjs::valueimp</option>,
</select>
</form>
</div>
-->
</div></div>
<div class="menu_box"><h2>API Dox</h2>
<div class="nav_list">
<ul>
<li><a href="../../arts/html/index.html">arts</a></li><li><a href="../../dcop/html/index.html">dcop</a></li><li><a href="../../dnssd/html/index.html">dnssd</a></li><li><a href="../../interfaces/html/index.html">interfaces</a></li><li> <a href="../../interfaces/kimproxy/interface/html/index.html">interface</a></li><li> <a href="../../interfaces/kimproxy/library/html/index.html">library</a></li><li> <a href="../../interfaces/kspeech/html/index.html">kspeech</a></li><li> <a href="../../interfaces/ktexteditor/html/index.html">ktexteditor</a></li><li><a href="../../kabc/html/index.html">kabc</a></li><li><a href="../../kate/html/index.html">kate</a></li><li><a href="../../kcmshell/html/index.html">kcmshell</a></li><li><a href="../../kdecore/html/index.html">kdecore</a></li><li><a href="../../kded/html/index.html">kded</a></li><li><a href="../../kdefx/html/index.html">kdefx</a></li><li><a href="../../kdeprint/html/index.html">kdeprint</a></li><li><a href="../../kdesu/html/index.html">kdesu</a></li><li><a href="../../kdeui/html/index.html">kdeui</a></li><li><a href="../../kdoctools/html/index.html">kdoctools</a></li><li><a href="../../khtml/html/index.html">khtml</a></li><li><a href="../../kimgio/html/index.html">kimgio</a></li><li><a href="../../kinit/html/index.html">kinit</a></li><li><a href="../../kio/html/index.html">kio</a></li><li> <a href="../../kio/bookmarks/html/index.html">bookmarks</a></li><li> <a href="../../kio/httpfilter/html/index.html">httpfilter</a></li><li> <a href="../../kio/kfile/html/index.html">kfile</a></li><li> <a href="../../kio/kio/html/index.html">kio</a></li><li> <a href="../../kio/kioexec/html/index.html">kioexec</a></li><li> <a href="../../kio/kpasswdserver/html/index.html">kpasswdserver</a></li><li> <a href="../../kio/kssl/html/index.html">kssl</a></li><li><a href="../../kioslave/html/index.html">kioslave</a></li><li> <a href="../../kioslave/http/html/index.html">http</a></li><li><a href="../../kjs/html/index.html">kjs</a></li><li><a href="../../kmdi/html/index.html">kmdi</a></li><li> <a href="../../kmdi/kmdi/html/index.html">kmdi</a></li><li><a href="../../knewstuff/html/index.html">knewstuff</a></li><li><a href="../../kparts/html/index.html">kparts</a></li><li><a href="../../kresources/html/index.html">kresources</a></li><li><a href="../../kspell2/html/index.html">kspell2</a></li><li><a href="../../kunittest/html/index.html">kunittest</a></li><li><a href="../../kutils/html/index.html">kutils</a></li><li><a href="../../kwallet/html/index.html">kwallet</a></li><li><a href="../../libkmid/html/index.html">libkmid</a></li><li><a href="../../libkscreensaver/html/index.html">libkscreensaver</a></li>
</ul></div></div>
</td>
</tr>
</table>
<span class="doNotDisplay">
<a href="http://www.kde.org/" accesskey="8">KDE Home</a> |
<a href="http://accessibility.kde.org/" accesskey="9">KDE Accessibility Home</a> |
<a href="http://www.kde.org/media/accesskeys.php" accesskey="0">Description of Access Keys</a>
</span>
<div style="height: 8px"></div>
<div id="footer">
<div id="footer_left">
Maintained by <a href="mailto:groot@kde.org">Adriaan de Groot</a>
and
<a href="mailto:winter@kde.org">Allen Winter</a>.
<br/>
KDE and K Desktop Environment are trademarks of <a href="http://www.kde.org/areas/kde-ev/" title="Homepage of the KDE non-profit Organization">KDE e.V.</a> |
<a href="http://www.kde.org/contact/impressum.php">Legal</a>
</div>
<div id="footer_right"><img src="/media/images/footer_right.png" style="margin: 0px" alt="" /></div>
</div>
<!--
WARNING: DO NOT SEND MAIL TO THE FOLLOWING EMAIL ADDRESS! YOU WILL
BE BLOCKED INSTANTLY AND PERMANENTLY!
<a href="mailto:aaaatrap-425acc3b5374943f@kde.org">Block me</a>
WARNING END
-->
</body>
</html>
