<!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">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>SphinxBase: src/libsphinxbase/util/dtoa.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.3 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">SphinxBase <span id="projectnumber">0.6</span></div>
</td>
</tr>
</tbody>
</table>
</div>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul>
</div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
initNavTree('dtoa_8c.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<h1>src/libsphinxbase/util/dtoa.c</h1> </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 David M. Gay (dmg at acm dot org,</span>
<a name="l00021"></a>00021 <span class="comment"> * with " at " changed at "@" and " dot " changed to "."). */</span>
<a name="l00022"></a>00022
<a name="l00023"></a>00023 <span class="comment">/* On a machine with IEEE extended-precision registers, it is</span>
<a name="l00024"></a>00024 <span class="comment"> * necessary to specify double-precision (53-bit) rounding precision</span>
<a name="l00025"></a>00025 <span class="comment"> * before invoking strtod or dtoa. If the machine uses (the equivalent</span>
<a name="l00026"></a>00026 <span class="comment"> * of) Intel 80x87 arithmetic, the call</span>
<a name="l00027"></a>00027 <span class="comment"> * _control87(PC_53, MCW_PC);</span>
<a name="l00028"></a>00028 <span class="comment"> * does this with many compilers. Whether this or another call is</span>
<a name="l00029"></a>00029 <span class="comment"> * appropriate depends on the compiler; for this to work, it may be</span>
<a name="l00030"></a>00030 <span class="comment"> * necessary to #include "float.h" or another system-dependent header</span>
<a name="l00031"></a>00031 <span class="comment"> * file.</span>
<a name="l00032"></a>00032 <span class="comment"> */</span>
<a name="l00033"></a>00033
<a name="l00034"></a>00034 <span class="comment">/* strtod for IEEE-, VAX-, and IBM-arithmetic machines.</span>
<a name="l00035"></a>00035 <span class="comment"> *</span>
<a name="l00036"></a>00036 <span class="comment"> * This strtod returns a nearest machine number to the input decimal</span>
<a name="l00037"></a>00037 <span class="comment"> * string (or sets errno to ERANGE). With IEEE arithmetic, ties are</span>
<a name="l00038"></a>00038 <span class="comment"> * broken by the IEEE round-even rule. Otherwise ties are broken by</span>
<a name="l00039"></a>00039 <span class="comment"> * biased rounding (add half and chop).</span>
<a name="l00040"></a>00040 <span class="comment"> *</span>
<a name="l00041"></a>00041 <span class="comment"> * Inspired loosely by William D. Clinger's paper "How to Read Floating</span>
<a name="l00042"></a>00042 <span class="comment"> * Point Numbers Accurately" [Proc. ACM SIGPLAN '90, pp. 92-101].</span>
<a name="l00043"></a>00043 <span class="comment"> *</span>
<a name="l00044"></a>00044 <span class="comment"> * Modifications:</span>
<a name="l00045"></a>00045 <span class="comment"> *</span>
<a name="l00046"></a>00046 <span class="comment"> * 1. We only require IEEE, IBM, or VAX double-precision</span>
<a name="l00047"></a>00047 <span class="comment"> * arithmetic (not IEEE double-extended).</span>
<a name="l00048"></a>00048 <span class="comment"> * 2. We get by with floating-point arithmetic in a case that</span>
<a name="l00049"></a>00049 <span class="comment"> * Clinger missed -- when we're computing d * 10^n</span>
<a name="l00050"></a>00050 <span class="comment"> * for a small integer d and the integer n is not too</span>
<a name="l00051"></a>00051 <span class="comment"> * much larger than 22 (the maximum integer k for which</span>
<a name="l00052"></a>00052 <span class="comment"> * we can represent 10^k exactly), we may be able to</span>
<a name="l00053"></a>00053 <span class="comment"> * compute (d*10^k) * 10^(e-k) with just one roundoff.</span>
<a name="l00054"></a>00054 <span class="comment"> * 3. Rather than a bit-at-a-time adjustment of the binary</span>
<a name="l00055"></a>00055 <span class="comment"> * result in the hard case, we use floating-point</span>
<a name="l00056"></a>00056 <span class="comment"> * arithmetic to determine the adjustment to within</span>
<a name="l00057"></a>00057 <span class="comment"> * one bit; only in really hard cases do we need to</span>
<a name="l00058"></a>00058 <span class="comment"> * compute a second residual.</span>
<a name="l00059"></a>00059 <span class="comment"> * 4. Because of 3., we don't need a large table of powers of 10</span>
<a name="l00060"></a>00060 <span class="comment"> * for ten-to-e (just some small tables, e.g. of 10^k</span>
<a name="l00061"></a>00061 <span class="comment"> * for 0 <= k <= 22).</span>
<a name="l00062"></a>00062 <span class="comment"> */</span>
<a name="l00063"></a>00063
<a name="l00064"></a>00064 <span class="comment">/*</span>
<a name="l00065"></a>00065 <span class="comment"> * This file has been modified to remove dtoa() and all</span>
<a name="l00066"></a>00066 <span class="comment"> * non-reentrancy. This makes it slower, but it also makes life a lot</span>
<a name="l00067"></a>00067 <span class="comment"> * easier on Windows and other platforms without static lock</span>
<a name="l00068"></a>00068 <span class="comment"> * initializers (grumble).</span>
<a name="l00069"></a>00069 <span class="comment"> */</span>
<a name="l00070"></a>00070
<a name="l00071"></a>00071 <span class="comment">/* Added by dhuggins@cs.cmu.edu to use autoconf results. */</span>
<a name="l00072"></a>00072 <span class="comment">/* We do not care about the VAX. */</span>
<a name="l00073"></a>00073 <span class="preprocessor">#include "config.h"</span>
<a name="l00074"></a>00074 <span class="preprocessor">#ifdef WORDS_BIGENDIAN</span>
<a name="l00075"></a>00075 <span class="preprocessor"></span><span class="preprocessor">#define IEEE_MC68k</span>
<a name="l00076"></a>00076 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00077"></a>00077 <span class="preprocessor"></span><span class="preprocessor">#define IEEE_8087</span>
<a name="l00078"></a>00078 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00079"></a>00079 <span class="preprocessor"></span><span class="preprocessor">#ifndef HAVE_LONG_LONG</span>
<a name="l00080"></a>00080 <span class="preprocessor"></span><span class="preprocessor">#define NO_LONG_LONG</span>
<a name="l00081"></a>00081 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00082"></a>00082 <span class="preprocessor"></span><span class="preprocessor">#define Omit_Private_Memory</span>
<a name="l00083"></a>00083 <span class="preprocessor"></span><span class="preprocessor">#include "sphinxbase/ckd_alloc.h"</span>
<a name="l00084"></a>00084 <span class="preprocessor">#undef USE_LOCALE</span>
<a name="l00085"></a>00085 <span class="preprocessor"></span>
<a name="l00086"></a>00086 <span class="comment">/* Correct totally bogus typedefs in this code. */</span>
<a name="l00087"></a>00087 <span class="preprocessor">#include "sphinxbase/prim_type.h"</span>
<a name="l00088"></a>00088 <span class="preprocessor">#define Long int32 </span><span class="comment">/* ZOMG */</span>
<a name="l00089"></a>00089 <span class="preprocessor">#define ULong uint32 </span><span class="comment">/* WTF */</span>
<a name="l00090"></a>00090
<a name="l00091"></a>00091 <span class="comment">/*</span>
<a name="l00092"></a>00092 <span class="comment"> * #define IEEE_8087 for IEEE-arithmetic machines where the least</span>
<a name="l00093"></a>00093 <span class="comment"> * significant byte has the lowest address.</span>
<a name="l00094"></a>00094 <span class="comment"> * #define IEEE_MC68k for IEEE-arithmetic machines where the most</span>
<a name="l00095"></a>00095 <span class="comment"> * significant byte has the lowest address.</span>
<a name="l00096"></a>00096 <span class="comment"> * #define Long int on machines with 32-bit ints and 64-bit longs.</span>
<a name="l00097"></a>00097 <span class="comment"> * #define IBM for IBM mainframe-style floating-point arithmetic.</span>
<a name="l00098"></a>00098 <span class="comment"> * #define VAX for VAX-style floating-point arithmetic (D_floating).</span>
<a name="l00099"></a>00099 <span class="comment"> * #define No_leftright to omit left-right logic in fast floating-point</span>
<a name="l00100"></a>00100 <span class="comment"> * computation of dtoa.</span>
<a name="l00101"></a>00101 <span class="comment"> * #define Honor_FLT_ROUNDS if FLT_ROUNDS can assume the values 2 or 3</span>
<a name="l00102"></a>00102 <span class="comment"> * and strtod and dtoa should round accordingly.</span>
<a name="l00103"></a>00103 <span class="comment"> * #define Check_FLT_ROUNDS if FLT_ROUNDS can assume the values 2 or 3</span>
<a name="l00104"></a>00104 <span class="comment"> * and Honor_FLT_ROUNDS is not #defined.</span>
<a name="l00105"></a>00105 <span class="comment"> * #define RND_PRODQUOT to use rnd_prod and rnd_quot (assembly routines</span>
<a name="l00106"></a>00106 <span class="comment"> * that use extended-precision instructions to compute rounded</span>
<a name="l00107"></a>00107 <span class="comment"> * products and quotients) with IBM.</span>
<a name="l00108"></a>00108 <span class="comment"> * #define ROUND_BIASED for IEEE-format with biased rounding.</span>
<a name="l00109"></a>00109 <span class="comment"> * #define Inaccurate_Divide for IEEE-format with correctly rounded</span>
<a name="l00110"></a>00110 <span class="comment"> * products but inaccurate quotients, e.g., for Intel i860.</span>
<a name="l00111"></a>00111 <span class="comment"> * #define NO_LONG_LONG on machines that do not have a "long long"</span>
<a name="l00112"></a>00112 <span class="comment"> * integer type (of >= 64 bits). On such machines, you can</span>
<a name="l00113"></a>00113 <span class="comment"> * #define Just_16 to store 16 bits per 32-bit Long when doing</span>
<a name="l00114"></a>00114 <span class="comment"> * high-precision integer arithmetic. Whether this speeds things</span>
<a name="l00115"></a>00115 <span class="comment"> * up or slows things down depends on the machine and the number</span>
<a name="l00116"></a>00116 <span class="comment"> * being converted. If long long is available and the name is</span>
<a name="l00117"></a>00117 <span class="comment"> * something other than "long long", #define Llong to be the name,</span>
<a name="l00118"></a>00118 <span class="comment"> * and if "unsigned Llong" does not work as an unsigned version of</span>
<a name="l00119"></a>00119 <span class="comment"> * Llong, #define #ULLong to be the corresponding unsigned type.</span>
<a name="l00120"></a>00120 <span class="comment"> * #define KR_headers for old-style C function headers.</span>
<a name="l00121"></a>00121 <span class="comment"> * #define Bad_float_h if your system lacks a float.h or if it does not</span>
<a name="l00122"></a>00122 <span class="comment"> * define some or all of DBL_DIG, DBL_MAX_10_EXP, DBL_MAX_EXP,</span>
<a name="l00123"></a>00123 <span class="comment"> * FLT_RADIX, FLT_ROUNDS, and DBL_MAX.</span>
<a name="l00124"></a>00124 <span class="comment"> * #define MALLOC your_malloc, where your_malloc(n) acts like malloc(n)</span>
<a name="l00125"></a>00125 <span class="comment"> * if memory is available and otherwise does something you deem</span>
<a name="l00126"></a>00126 <span class="comment"> * appropriate. If MALLOC is undefined, malloc will be invoked</span>
<a name="l00127"></a>00127 <span class="comment"> * directly -- and assumed always to succeed.</span>
<a name="l00128"></a>00128 <span class="comment"> * #define Omit_Private_Memory to omit logic (added Jan. 1998) for making</span>
<a name="l00129"></a>00129 <span class="comment"> * memory allocations from a private pool of memory when possible.</span>
<a name="l00130"></a>00130 <span class="comment"> * When used, the private pool is PRIVATE_MEM bytes long: 2304 bytes,</span>
<a name="l00131"></a>00131 <span class="comment"> * unless #defined to be a different length. This default length</span>
<a name="l00132"></a>00132 <span class="comment"> * suffices to get rid of MALLOC calls except for unusual cases,</span>
<a name="l00133"></a>00133 <span class="comment"> * such as decimal-to-binary conversion of a very long string of</span>
<a name="l00134"></a>00134 <span class="comment"> * digits. The longest string dtoa can return is about 751 bytes</span>
<a name="l00135"></a>00135 <span class="comment"> * long. For conversions by strtod of strings of 800 digits and</span>
<a name="l00136"></a>00136 <span class="comment"> * all dtoa conversions in single-threaded executions with 8-byte</span>
<a name="l00137"></a>00137 <span class="comment"> * pointers, PRIVATE_MEM >= 7400 appears to suffice; with 4-byte</span>
<a name="l00138"></a>00138 <span class="comment"> * pointers, PRIVATE_MEM >= 7112 appears adequate.</span>
<a name="l00139"></a>00139 <span class="comment"> * #define NO_INFNAN_CHECK if you do not wish to have INFNAN_CHECK</span>
<a name="l00140"></a>00140 <span class="comment"> * #defined automatically on IEEE systems. On such systems,</span>
<a name="l00141"></a>00141 <span class="comment"> * when INFNAN_CHECK is #defined, strtod checks</span>
<a name="l00142"></a>00142 <span class="comment"> * for Infinity and NaN (case insensitively). On some systems</span>
<a name="l00143"></a>00143 <span class="comment"> * (e.g., some HP systems), it may be necessary to #define NAN_WORD0</span>
<a name="l00144"></a>00144 <span class="comment"> * appropriately -- to the most significant word of a quiet NaN.</span>
<a name="l00145"></a>00145 <span class="comment"> * (On HP Series 700/800 machines, -DNAN_WORD0=0x7ff40000 works.)</span>
<a name="l00146"></a>00146 <span class="comment"> * When INFNAN_CHECK is #defined and No_Hex_NaN is not #defined,</span>
<a name="l00147"></a>00147 <span class="comment"> * strtod also accepts (case insensitively) strings of the form</span>
<a name="l00148"></a>00148 <span class="comment"> * NaN(x), where x is a string of hexadecimal digits and spaces;</span>
<a name="l00149"></a>00149 <span class="comment"> * if there is only one string of hexadecimal digits, it is taken</span>
<a name="l00150"></a>00150 <span class="comment"> * for the 52 fraction bits of the resulting NaN; if there are two</span>
<a name="l00151"></a>00151 <span class="comment"> * or more strings of hex digits, the first is for the high 20 bits,</span>
<a name="l00152"></a>00152 <span class="comment"> * the second and subsequent for the low 32 bits, with intervening</span>
<a name="l00153"></a>00153 <span class="comment"> * white space ignored; but if this results in none of the 52</span>
<a name="l00154"></a>00154 <span class="comment"> * fraction bits being on (an IEEE Infinity symbol), then NAN_WORD0</span>
<a name="l00155"></a>00155 <span class="comment"> * and NAN_WORD1 are used instead.</span>
<a name="l00156"></a>00156 <span class="comment"> * #define MULTIPLE_THREADS if the system offers preemptively scheduled</span>
<a name="l00157"></a>00157 <span class="comment"> * multiple threads. In this case, you must provide (or suitably</span>
<a name="l00158"></a>00158 <span class="comment"> * #define) two locks, acquired by ACQUIRE_DTOA_LOCK(n) and freed</span>
<a name="l00159"></a>00159 <span class="comment"> * by FREE_DTOA_LOCK(n) for n = 0 or 1. (The second lock, accessed</span>
<a name="l00160"></a>00160 <span class="comment"> * in pow5mult, ensures lazy evaluation of only one copy of high</span>
<a name="l00161"></a>00161 <span class="comment"> * powers of 5; omitting this lock would introduce a small</span>
<a name="l00162"></a>00162 <span class="comment"> * probability of wasting memory, but would otherwise be harmless.)</span>
<a name="l00163"></a>00163 <span class="comment"> * You must also invoke freedtoa(s) to free the value s returned by</span>
<a name="l00164"></a>00164 <span class="comment"> * dtoa. You may do so whether or not MULTIPLE_THREADS is #defined.</span>
<a name="l00165"></a>00165 <span class="comment"> * #define NO_IEEE_Scale to disable new (Feb. 1997) logic in strtod that</span>
<a name="l00166"></a>00166 <span class="comment"> * avoids underflows on inputs whose result does not underflow.</span>
<a name="l00167"></a>00167 <span class="comment"> * If you #define NO_IEEE_Scale on a machine that uses IEEE-format</span>
<a name="l00168"></a>00168 <span class="comment"> * floating-point numbers and flushes underflows to zero rather</span>
<a name="l00169"></a>00169 <span class="comment"> * than implementing gradual underflow, then you must also #define</span>
<a name="l00170"></a>00170 <span class="comment"> * Sudden_Underflow.</span>
<a name="l00171"></a>00171 <span class="comment"> * #define YES_ALIAS to permit aliasing certain double values with</span>
<a name="l00172"></a>00172 <span class="comment"> * arrays of ULongs. This leads to slightly better code with</span>
<a name="l00173"></a>00173 <span class="comment"> * some compilers and was always used prior to 19990916, but it</span>
<a name="l00174"></a>00174 <span class="comment"> * is not strictly legal and can cause trouble with aggressively</span>
<a name="l00175"></a>00175 <span class="comment"> * optimizing compilers (e.g., gcc 2.95.1 under -O2).</span>
<a name="l00176"></a>00176 <span class="comment"> * #define USE_LOCALE to use the current locale's decimal_point value.</span>
<a name="l00177"></a>00177 <span class="comment"> * #define SET_INEXACT if IEEE arithmetic is being used and extra</span>
<a name="l00178"></a>00178 <span class="comment"> * computation should be done to set the inexact flag when the</span>
<a name="l00179"></a>00179 <span class="comment"> * result is inexact and avoid setting inexact when the result</span>
<a name="l00180"></a>00180 <span class="comment"> * is exact. In this case, dtoa.c must be compiled in</span>
<a name="l00181"></a>00181 <span class="comment"> * an environment, perhaps provided by #include "dtoa.c" in a</span>
<a name="l00182"></a>00182 <span class="comment"> * suitable wrapper, that defines two functions,</span>
<a name="l00183"></a>00183 <span class="comment"> * int get_inexact(void);</span>
<a name="l00184"></a>00184 <span class="comment"> * void clear_inexact(void);</span>
<a name="l00185"></a>00185 <span class="comment"> * such that get_inexact() returns a nonzero value if the</span>
<a name="l00186"></a>00186 <span class="comment"> * inexact bit is already set, and clear_inexact() sets the</span>
<a name="l00187"></a>00187 <span class="comment"> * inexact bit to 0. When SET_INEXACT is #defined, strtod</span>
<a name="l00188"></a>00188 <span class="comment"> * also does extra computations to set the underflow and overflow</span>
<a name="l00189"></a>00189 <span class="comment"> * flags when appropriate (i.e., when the result is tiny and</span>
<a name="l00190"></a>00190 <span class="comment"> * inexact or when it is a numeric value rounded to +-infinity).</span>
<a name="l00191"></a>00191 <span class="comment"> * #define NO_ERRNO if strtod should not assign errno = ERANGE when</span>
<a name="l00192"></a>00192 <span class="comment"> * the result overflows to +-Infinity or underflows to 0.</span>
<a name="l00193"></a>00193 <span class="comment"> */</span>
<a name="l00194"></a>00194
<a name="l00195"></a>00195 <span class="preprocessor">#ifndef Long</span>
<a name="l00196"></a>00196 <span class="preprocessor"></span><span class="preprocessor">#define Long long</span>
<a name="l00197"></a>00197 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00198"></a>00198 <span class="preprocessor"></span><span class="preprocessor">#ifndef ULong</span>
<a name="l00199"></a>00199 <span class="preprocessor"></span><span class="keyword">typedef</span> <span class="keywordtype">unsigned</span> Long ULong;
<a name="l00200"></a>00200 <span class="preprocessor">#endif</span>
<a name="l00201"></a>00201 <span class="preprocessor"></span>
<a name="l00202"></a>00202 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l00203"></a>00203 <span class="preprocessor"></span><span class="preprocessor">#include "stdio.h"</span>
<a name="l00204"></a>00204 <span class="preprocessor">#define Bug(x) {fprintf(stderr, "%s\n", x); exit(1);}</span>
<a name="l00205"></a>00205 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00206"></a>00206 <span class="preprocessor"></span>
<a name="l00207"></a>00207 <span class="preprocessor">#include "stdlib.h"</span>
<a name="l00208"></a>00208 <span class="preprocessor">#include "string.h"</span>
<a name="l00209"></a>00209
<a name="l00210"></a>00210 <span class="preprocessor">#ifdef USE_LOCALE</span>
<a name="l00211"></a>00211 <span class="preprocessor"></span><span class="preprocessor">#include "locale.h"</span>
<a name="l00212"></a>00212 <span class="preprocessor">#endif</span>
<a name="l00213"></a>00213 <span class="preprocessor"></span>
<a name="l00214"></a>00214 <span class="comment">/* Private memory and other non-reentrant stuff removed. */</span>
<a name="l00215"></a>00215
<a name="l00216"></a>00216 <span class="preprocessor">#undef IEEE_Arith</span>
<a name="l00217"></a>00217 <span class="preprocessor"></span><span class="preprocessor">#undef Avoid_Underflow</span>
<a name="l00218"></a>00218 <span class="preprocessor"></span><span class="preprocessor">#ifdef IEEE_MC68k</span>
<a name="l00219"></a>00219 <span class="preprocessor"></span><span class="preprocessor">#define IEEE_Arith</span>
<a name="l00220"></a>00220 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00221"></a>00221 <span class="preprocessor"></span><span class="preprocessor">#ifdef IEEE_8087</span>
<a name="l00222"></a>00222 <span class="preprocessor"></span><span class="preprocessor">#define IEEE_Arith</span>
<a name="l00223"></a>00223 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00224"></a>00224 <span class="preprocessor"></span>
<a name="l00225"></a>00225 <span class="preprocessor">#ifdef IEEE_Arith</span>
<a name="l00226"></a>00226 <span class="preprocessor"></span><span class="preprocessor">#ifndef NO_INFNAN_CHECK</span>
<a name="l00227"></a>00227 <span class="preprocessor"></span><span class="preprocessor">#undef INFNAN_CHECK</span>
<a name="l00228"></a>00228 <span class="preprocessor"></span><span class="preprocessor">#define INFNAN_CHECK</span>
<a name="l00229"></a>00229 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00230"></a>00230 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00231"></a>00231 <span class="preprocessor"></span><span class="preprocessor">#undef INFNAN_CHECK</span>
<a name="l00232"></a>00232 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00233"></a>00233 <span class="preprocessor"></span>
<a name="l00234"></a>00234 <span class="preprocessor">#include "errno.h"</span>
<a name="l00235"></a>00235
<a name="l00236"></a>00236 <span class="preprocessor">#ifdef Bad_float_h</span>
<a name="l00237"></a>00237 <span class="preprocessor"></span>
<a name="l00238"></a>00238 <span class="preprocessor">#ifdef IEEE_Arith</span>
<a name="l00239"></a>00239 <span class="preprocessor"></span><span class="preprocessor">#define DBL_DIG 15</span>
<a name="l00240"></a>00240 <span class="preprocessor"></span><span class="preprocessor">#define DBL_MAX_10_EXP 308</span>
<a name="l00241"></a>00241 <span class="preprocessor"></span><span class="preprocessor">#define DBL_MAX_EXP 1024</span>
<a name="l00242"></a>00242 <span class="preprocessor"></span><span class="preprocessor">#define FLT_RADIX 2</span>
<a name="l00243"></a>00243 <span class="preprocessor"></span><span class="preprocessor">#endif </span><span class="comment">/*IEEE_Arith*/</span>
<a name="l00244"></a>00244
<a name="l00245"></a>00245 <span class="preprocessor">#ifdef IBM</span>
<a name="l00246"></a>00246 <span class="preprocessor"></span><span class="preprocessor">#define DBL_DIG 16</span>
<a name="l00247"></a>00247 <span class="preprocessor"></span><span class="preprocessor">#define DBL_MAX_10_EXP 75</span>
<a name="l00248"></a>00248 <span class="preprocessor"></span><span class="preprocessor">#define DBL_MAX_EXP 63</span>
<a name="l00249"></a>00249 <span class="preprocessor"></span><span class="preprocessor">#define FLT_RADIX 16</span>
<a name="l00250"></a>00250 <span class="preprocessor"></span><span class="preprocessor">#define DBL_MAX 7.2370055773322621e+75</span>
<a name="l00251"></a>00251 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00252"></a>00252 <span class="preprocessor"></span>
<a name="l00253"></a>00253 <span class="preprocessor">#ifdef VAX</span>
<a name="l00254"></a>00254 <span class="preprocessor"></span><span class="preprocessor">#define DBL_DIG 16</span>
<a name="l00255"></a>00255 <span class="preprocessor"></span><span class="preprocessor">#define DBL_MAX_10_EXP 38</span>
<a name="l00256"></a>00256 <span class="preprocessor"></span><span class="preprocessor">#define DBL_MAX_EXP 127</span>
<a name="l00257"></a>00257 <span class="preprocessor"></span><span class="preprocessor">#define FLT_RADIX 2</span>
<a name="l00258"></a>00258 <span class="preprocessor"></span><span class="preprocessor">#define DBL_MAX 1.7014118346046923e+38</span>
<a name="l00259"></a>00259 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00260"></a>00260 <span class="preprocessor"></span>
<a name="l00261"></a>00261 <span class="preprocessor">#ifndef LONG_MAX</span>
<a name="l00262"></a>00262 <span class="preprocessor"></span><span class="preprocessor">#define LONG_MAX 2147483647</span>
<a name="l00263"></a>00263 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00264"></a>00264 <span class="preprocessor"></span>
<a name="l00265"></a>00265 <span class="preprocessor">#else </span><span class="comment">/* ifndef Bad_float_h */</span>
<a name="l00266"></a>00266 <span class="preprocessor">#include "float.h"</span>
<a name="l00267"></a>00267 <span class="preprocessor">#endif </span><span class="comment">/* Bad_float_h */</span>
<a name="l00268"></a>00268
<a name="l00269"></a>00269 <span class="preprocessor">#ifndef __MATH_H__</span>
<a name="l00270"></a>00270 <span class="preprocessor"></span><span class="preprocessor">#include "math.h"</span>
<a name="l00271"></a>00271 <span class="preprocessor">#endif</span>
<a name="l00272"></a>00272 <span class="preprocessor"></span>
<a name="l00273"></a>00273 <span class="preprocessor">#ifdef __cplusplus</span>
<a name="l00274"></a>00274 <span class="preprocessor"></span><span class="keyword">extern</span> <span class="stringliteral">"C"</span> {
<a name="l00275"></a>00275 <span class="preprocessor">#endif</span>
<a name="l00276"></a>00276 <span class="preprocessor"></span>
<a name="l00277"></a>00277 <span class="preprocessor">#ifndef CONST</span>
<a name="l00278"></a>00278 <span class="preprocessor"></span><span class="preprocessor">#ifdef KR_headers</span>
<a name="l00279"></a>00279 <span class="preprocessor"></span><span class="preprocessor">#define CONST </span><span class="comment">/* blank */</span>
<a name="l00280"></a>00280 <span class="preprocessor">#else</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><span class="preprocessor">#endif</span>
<a name="l00284"></a>00284 <span class="preprocessor"></span>
<a name="l00285"></a>00285
<a name="l00286"></a>00286 <span class="preprocessor">#if defined(IEEE_8087) + defined(IEEE_MC68k) + defined(VAX) + defined(IBM) != 1</span>
<a name="l00287"></a>00287 <span class="preprocessor"></span>Exactly one of IEEE_8087, IEEE_MC68k, VAX, or IBM should be defined.
<a name="l00288"></a>00288 #endif
<a name="l00289"></a>00289
<a name="l00291"></a><a class="code" href="unionU.html">00291</a> <span class="keyword">typedef</span> <span class="keyword">union </span>{ <span class="keywordtype">double</span> d; ULong L[2]; } <a class="code" href="unionU.html" title="Union to extract the bytes of a double.">U</a>;
<a name="l00292"></a>00292
<a name="l00293"></a>00293 <span class="preprocessor">#ifdef YES_ALIAS</span>
<a name="l00294"></a>00294 <span class="preprocessor"></span><span class="preprocessor">#define dval(x) x</span>
<a name="l00295"></a>00295 <span class="preprocessor"></span><span class="preprocessor">#ifdef IEEE_8087</span>
<a name="l00296"></a>00296 <span class="preprocessor"></span><span class="preprocessor">#define word0(x) ((ULong *)&x)[1]</span>
<a name="l00297"></a>00297 <span class="preprocessor"></span><span class="preprocessor">#define word1(x) ((ULong *)&x)[0]</span>
<a name="l00298"></a>00298 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00299"></a>00299 <span class="preprocessor"></span><span class="preprocessor">#define word0(x) ((ULong *)&x)[0]</span>
<a name="l00300"></a>00300 <span class="preprocessor"></span><span class="preprocessor">#define word1(x) ((ULong *)&x)[1]</span>
<a name="l00301"></a>00301 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00302"></a>00302 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00303"></a>00303 <span class="preprocessor"></span><span class="preprocessor">#ifdef IEEE_8087</span>
<a name="l00304"></a>00304 <span class="preprocessor"></span><span class="preprocessor">#define word0(x) ((U*)&x)->L[1]</span>
<a name="l00305"></a>00305 <span class="preprocessor"></span><span class="preprocessor">#define word1(x) ((U*)&x)->L[0]</span>
<a name="l00306"></a>00306 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00307"></a>00307 <span class="preprocessor"></span><span class="preprocessor">#define word0(x) ((U*)&x)->L[0]</span>
<a name="l00308"></a>00308 <span class="preprocessor"></span><span class="preprocessor">#define word1(x) ((U*)&x)->L[1]</span>
<a name="l00309"></a>00309 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00310"></a>00310 <span class="preprocessor"></span><span class="preprocessor">#define dval(x) ((U*)&x)->d</span>
<a name="l00311"></a>00311 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00312"></a>00312 <span class="preprocessor"></span>
<a name="l00313"></a>00313 <span class="comment">/* The following definition of Storeinc is appropriate for MIPS processors.</span>
<a name="l00314"></a>00314 <span class="comment"> * An alternative that might be better on some machines is</span>
<a name="l00315"></a>00315 <span class="comment"> * #define Storeinc(a,b,c) (*a++ = b << 16 | c & 0xffff)</span>
<a name="l00316"></a>00316 <span class="comment"> */</span>
<a name="l00317"></a>00317 <span class="preprocessor">#if defined(IEEE_8087) + defined(VAX)</span>
<a name="l00318"></a>00318 <span class="preprocessor"></span><span class="preprocessor">#define Storeinc(a,b,c) (((unsigned short *)a)[1] = (unsigned short)b, \</span>
<a name="l00319"></a>00319 <span class="preprocessor">((unsigned short *)a)[0] = (unsigned short)c, a++)</span>
<a name="l00320"></a>00320 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00321"></a>00321 <span class="preprocessor"></span><span class="preprocessor">#define Storeinc(a,b,c) (((unsigned short *)a)[0] = (unsigned short)b, \</span>
<a name="l00322"></a>00322 <span class="preprocessor">((unsigned short *)a)[1] = (unsigned short)c, a++)</span>
<a name="l00323"></a>00323 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00324"></a>00324 <span class="preprocessor"></span>
<a name="l00325"></a>00325 <span class="comment">/* #define P DBL_MANT_DIG */</span>
<a name="l00326"></a>00326 <span class="comment">/* Ten_pmax = floor(P*log(2)/log(5)) */</span>
<a name="l00327"></a>00327 <span class="comment">/* Bletch = (highest power of 2 < DBL_MAX_10_EXP) / 16 */</span>
<a name="l00328"></a>00328 <span class="comment">/* Quick_max = floor((P-1)*log(FLT_RADIX)/log(10) - 1) */</span>
<a name="l00329"></a>00329 <span class="comment">/* Int_max = floor(P*log(FLT_RADIX)/log(10) - 1) */</span>
<a name="l00330"></a>00330
<a name="l00331"></a>00331 <span class="preprocessor">#ifdef IEEE_Arith</span>
<a name="l00332"></a>00332 <span class="preprocessor"></span><span class="preprocessor">#define Exp_shift 20</span>
<a name="l00333"></a>00333 <span class="preprocessor"></span><span class="preprocessor">#define Exp_shift1 20</span>
<a name="l00334"></a>00334 <span class="preprocessor"></span><span class="preprocessor">#define Exp_msk1 0x100000</span>
<a name="l00335"></a>00335 <span class="preprocessor"></span><span class="preprocessor">#define Exp_msk11 0x100000</span>
<a name="l00336"></a>00336 <span class="preprocessor"></span><span class="preprocessor">#define Exp_mask 0x7ff00000</span>
<a name="l00337"></a>00337 <span class="preprocessor"></span><span class="preprocessor">#define P 53</span>
<a name="l00338"></a>00338 <span class="preprocessor"></span><span class="preprocessor">#define Bias 1023</span>
<a name="l00339"></a>00339 <span class="preprocessor"></span><span class="preprocessor">#define Emin (-1022)</span>
<a name="l00340"></a>00340 <span class="preprocessor"></span><span class="preprocessor">#define Exp_1 0x3ff00000</span>
<a name="l00341"></a>00341 <span class="preprocessor"></span><span class="preprocessor">#define Exp_11 0x3ff00000</span>
<a name="l00342"></a>00342 <span class="preprocessor"></span><span class="preprocessor">#define Ebits 11</span>
<a name="l00343"></a>00343 <span class="preprocessor"></span><span class="preprocessor">#define Frac_mask 0xfffff</span>
<a name="l00344"></a>00344 <span class="preprocessor"></span><span class="preprocessor">#define Frac_mask1 0xfffff</span>
<a name="l00345"></a>00345 <span class="preprocessor"></span><span class="preprocessor">#define Ten_pmax 22</span>
<a name="l00346"></a>00346 <span class="preprocessor"></span><span class="preprocessor">#define Bletch 0x10</span>
<a name="l00347"></a>00347 <span class="preprocessor"></span><span class="preprocessor">#define Bndry_mask 0xfffff</span>
<a name="l00348"></a>00348 <span class="preprocessor"></span><span class="preprocessor">#define Bndry_mask1 0xfffff</span>
<a name="l00349"></a>00349 <span class="preprocessor"></span><span class="preprocessor">#define LSB 1</span>
<a name="l00350"></a>00350 <span class="preprocessor"></span><span class="preprocessor">#define Sign_bit 0x80000000</span>
<a name="l00351"></a>00351 <span class="preprocessor"></span><span class="preprocessor">#define Log2P 1</span>
<a name="l00352"></a>00352 <span class="preprocessor"></span><span class="preprocessor">#define Tiny0 0</span>
<a name="l00353"></a>00353 <span class="preprocessor"></span><span class="preprocessor">#define Tiny1 1</span>
<a name="l00354"></a>00354 <span class="preprocessor"></span><span class="preprocessor">#define Quick_max 14</span>
<a name="l00355"></a>00355 <span class="preprocessor"></span><span class="preprocessor">#define Int_max 14</span>
<a name="l00356"></a>00356 <span class="preprocessor"></span><span class="preprocessor">#ifndef NO_IEEE_Scale</span>
<a name="l00357"></a>00357 <span class="preprocessor"></span><span class="preprocessor">#define Avoid_Underflow</span>
<a name="l00358"></a>00358 <span class="preprocessor"></span><span class="preprocessor">#ifdef Flush_Denorm </span><span class="comment">/* debugging option */</span>
<a name="l00359"></a>00359 <span class="preprocessor">#undef Sudden_Underflow</span>
<a name="l00360"></a>00360 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00361"></a>00361 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00362"></a>00362 <span class="preprocessor"></span>
<a name="l00363"></a>00363 <span class="preprocessor">#ifndef Flt_Rounds</span>
<a name="l00364"></a>00364 <span class="preprocessor"></span><span class="preprocessor">#ifdef FLT_ROUNDS</span>
<a name="l00365"></a>00365 <span class="preprocessor"></span><span class="preprocessor">#define Flt_Rounds FLT_ROUNDS</span>
<a name="l00366"></a>00366 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00367"></a>00367 <span class="preprocessor"></span><span class="preprocessor">#define Flt_Rounds 1</span>
<a name="l00368"></a>00368 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00369"></a>00369 <span class="preprocessor"></span><span class="preprocessor">#endif </span><span class="comment">/*Flt_Rounds*/</span>
<a name="l00370"></a>00370
<a name="l00371"></a>00371 <span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l00372"></a>00372 <span class="preprocessor"></span><span class="preprocessor">#define Rounding rounding</span>
<a name="l00373"></a>00373 <span class="preprocessor"></span><span class="preprocessor">#undef Check_FLT_ROUNDS</span>
<a name="l00374"></a>00374 <span class="preprocessor"></span><span class="preprocessor">#define Check_FLT_ROUNDS</span>
<a name="l00375"></a>00375 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00376"></a>00376 <span class="preprocessor"></span><span class="preprocessor">#define Rounding Flt_Rounds</span>
<a name="l00377"></a>00377 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00378"></a>00378 <span class="preprocessor"></span>
<a name="l00379"></a>00379 <span class="preprocessor">#else </span><span class="comment">/* ifndef IEEE_Arith */</span>
<a name="l00380"></a>00380 <span class="preprocessor">#undef Check_FLT_ROUNDS</span>
<a name="l00381"></a>00381 <span class="preprocessor"></span><span class="preprocessor">#undef Honor_FLT_ROUNDS</span>
<a name="l00382"></a>00382 <span class="preprocessor"></span><span class="preprocessor">#undef SET_INEXACT</span>
<a name="l00383"></a>00383 <span class="preprocessor"></span><span class="preprocessor">#undef Sudden_Underflow</span>
<a name="l00384"></a>00384 <span class="preprocessor"></span><span class="preprocessor">#define Sudden_Underflow</span>
<a name="l00385"></a>00385 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
<a name="l00386"></a>00386 <span class="preprocessor"></span><span class="preprocessor">#undef Flt_Rounds</span>
<a name="l00387"></a>00387 <span class="preprocessor"></span><span class="preprocessor">#define Flt_Rounds 0</span>
<a name="l00388"></a>00388 <span class="preprocessor"></span><span class="preprocessor">#define Exp_shift 24</span>
<a name="l00389"></a>00389 <span class="preprocessor"></span><span class="preprocessor">#define Exp_shift1 24</span>
<a name="l00390"></a>00390 <span class="preprocessor"></span><span class="preprocessor">#define Exp_msk1 0x1000000</span>
<a name="l00391"></a>00391 <span class="preprocessor"></span><span class="preprocessor">#define Exp_msk11 0x1000000</span>
<a name="l00392"></a>00392 <span class="preprocessor"></span><span class="preprocessor">#define Exp_mask 0x7f000000</span>
<a name="l00393"></a>00393 <span class="preprocessor"></span><span class="preprocessor">#define P 14</span>
<a name="l00394"></a>00394 <span class="preprocessor"></span><span class="preprocessor">#define Bias 65</span>
<a name="l00395"></a>00395 <span class="preprocessor"></span><span class="preprocessor">#define Exp_1 0x41000000</span>
<a name="l00396"></a>00396 <span class="preprocessor"></span><span class="preprocessor">#define Exp_11 0x41000000</span>
<a name="l00397"></a>00397 <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="l00398"></a>00398 <span class="preprocessor">#define Frac_mask 0xffffff</span>
<a name="l00399"></a>00399 <span class="preprocessor"></span><span class="preprocessor">#define Frac_mask1 0xffffff</span>
<a name="l00400"></a>00400 <span class="preprocessor"></span><span class="preprocessor">#define Bletch 4</span>
<a name="l00401"></a>00401 <span class="preprocessor"></span><span class="preprocessor">#define Ten_pmax 22</span>
<a name="l00402"></a>00402 <span class="preprocessor"></span><span class="preprocessor">#define Bndry_mask 0xefffff</span>
<a name="l00403"></a>00403 <span class="preprocessor"></span><span class="preprocessor">#define Bndry_mask1 0xffffff</span>
<a name="l00404"></a>00404 <span class="preprocessor"></span><span class="preprocessor">#define LSB 1</span>
<a name="l00405"></a>00405 <span class="preprocessor"></span><span class="preprocessor">#define Sign_bit 0x80000000</span>
<a name="l00406"></a>00406 <span class="preprocessor"></span><span class="preprocessor">#define Log2P 4</span>
<a name="l00407"></a>00407 <span class="preprocessor"></span><span class="preprocessor">#define Tiny0 0x100000</span>
<a name="l00408"></a>00408 <span class="preprocessor"></span><span class="preprocessor">#define Tiny1 0</span>
<a name="l00409"></a>00409 <span class="preprocessor"></span><span class="preprocessor">#define Quick_max 14</span>
<a name="l00410"></a>00410 <span class="preprocessor"></span><span class="preprocessor">#define Int_max 15</span>
<a name="l00411"></a>00411 <span class="preprocessor"></span><span class="preprocessor">#else </span><span class="comment">/* VAX */</span>
<a name="l00412"></a>00412 <span class="preprocessor">#undef Flt_Rounds</span>
<a name="l00413"></a>00413 <span class="preprocessor"></span><span class="preprocessor">#define Flt_Rounds 1</span>
<a name="l00414"></a>00414 <span class="preprocessor"></span><span class="preprocessor">#define Exp_shift 23</span>
<a name="l00415"></a>00415 <span class="preprocessor"></span><span class="preprocessor">#define Exp_shift1 7</span>
<a name="l00416"></a>00416 <span class="preprocessor"></span><span class="preprocessor">#define Exp_msk1 0x80</span>
<a name="l00417"></a>00417 <span class="preprocessor"></span><span class="preprocessor">#define Exp_msk11 0x800000</span>
<a name="l00418"></a>00418 <span class="preprocessor"></span><span class="preprocessor">#define Exp_mask 0x7f80</span>
<a name="l00419"></a>00419 <span class="preprocessor"></span><span class="preprocessor">#define P 56</span>
<a name="l00420"></a>00420 <span class="preprocessor"></span><span class="preprocessor">#define Bias 129</span>
<a name="l00421"></a>00421 <span class="preprocessor"></span><span class="preprocessor">#define Exp_1 0x40800000</span>
<a name="l00422"></a>00422 <span class="preprocessor"></span><span class="preprocessor">#define Exp_11 0x4080</span>
<a name="l00423"></a>00423 <span class="preprocessor"></span><span class="preprocessor">#define Ebits 8</span>
<a name="l00424"></a>00424 <span class="preprocessor"></span><span class="preprocessor">#define Frac_mask 0x7fffff</span>
<a name="l00425"></a>00425 <span class="preprocessor"></span><span class="preprocessor">#define Frac_mask1 0xffff007f</span>
<a name="l00426"></a>00426 <span class="preprocessor"></span><span class="preprocessor">#define Ten_pmax 24</span>
<a name="l00427"></a>00427 <span class="preprocessor"></span><span class="preprocessor">#define Bletch 2</span>
<a name="l00428"></a>00428 <span class="preprocessor"></span><span class="preprocessor">#define Bndry_mask 0xffff007f</span>
<a name="l00429"></a>00429 <span class="preprocessor"></span><span class="preprocessor">#define Bndry_mask1 0xffff007f</span>
<a name="l00430"></a>00430 <span class="preprocessor"></span><span class="preprocessor">#define LSB 0x10000</span>
<a name="l00431"></a>00431 <span class="preprocessor"></span><span class="preprocessor">#define Sign_bit 0x8000</span>
<a name="l00432"></a>00432 <span class="preprocessor"></span><span class="preprocessor">#define Log2P 1</span>
<a name="l00433"></a>00433 <span class="preprocessor"></span><span class="preprocessor">#define Tiny0 0x80</span>
<a name="l00434"></a>00434 <span class="preprocessor"></span><span class="preprocessor">#define Tiny1 0</span>
<a name="l00435"></a>00435 <span class="preprocessor"></span><span class="preprocessor">#define Quick_max 15</span>
<a name="l00436"></a>00436 <span class="preprocessor"></span><span class="preprocessor">#define Int_max 15</span>
<a name="l00437"></a>00437 <span class="preprocessor"></span><span class="preprocessor">#endif </span><span class="comment">/* IBM, VAX */</span>
<a name="l00438"></a>00438 <span class="preprocessor">#endif </span><span class="comment">/* IEEE_Arith */</span>
<a name="l00439"></a>00439
<a name="l00440"></a>00440 <span class="preprocessor">#ifndef IEEE_Arith</span>
<a name="l00441"></a>00441 <span class="preprocessor"></span><span class="preprocessor">#define ROUND_BIASED</span>
<a name="l00442"></a>00442 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00443"></a>00443 <span class="preprocessor"></span>
<a name="l00444"></a>00444 <span class="preprocessor">#ifdef RND_PRODQUOT</span>
<a name="l00445"></a>00445 <span class="preprocessor"></span><span class="preprocessor">#define rounded_product(a,b) a = rnd_prod(a, b)</span>
<a name="l00446"></a>00446 <span class="preprocessor"></span><span class="preprocessor">#define rounded_quotient(a,b) a = rnd_quot(a, b)</span>
<a name="l00447"></a>00447 <span class="preprocessor"></span><span class="preprocessor">#ifdef KR_headers</span>
<a name="l00448"></a>00448 <span class="preprocessor"></span><span class="keyword">extern</span> <span class="keywordtype">double</span> rnd_prod(), rnd_quot();
<a name="l00449"></a>00449 <span class="preprocessor">#else</span>
<a name="l00450"></a>00450 <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="l00451"></a>00451 <span class="preprocessor">#endif</span>
<a name="l00452"></a>00452 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00453"></a>00453 <span class="preprocessor"></span><span class="preprocessor">#define rounded_product(a,b) a *= b</span>
<a name="l00454"></a>00454 <span class="preprocessor"></span><span class="preprocessor">#define rounded_quotient(a,b) a /= b</span>
<a name="l00455"></a>00455 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00456"></a>00456 <span class="preprocessor"></span>
<a name="l00457"></a>00457 <span class="preprocessor">#define Big0 (Frac_mask1 | Exp_msk1*(DBL_MAX_EXP+Bias-1))</span>
<a name="l00458"></a>00458 <span class="preprocessor"></span><span class="preprocessor">#define Big1 0xffffffff</span>
<a name="l00459"></a>00459 <span class="preprocessor"></span>
<a name="l00460"></a>00460 <span class="preprocessor">#ifndef Pack_32</span>
<a name="l00461"></a>00461 <span class="preprocessor"></span><span class="preprocessor">#define Pack_32</span>
<a name="l00462"></a>00462 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00463"></a>00463 <span class="preprocessor"></span>
<a name="l00464"></a>00464 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l00465"></a>00465 <span class="preprocessor"></span><span class="preprocessor">#define FFFFFFFF ((((unsigned long)0xffff)<<16)|(unsigned long)0xffff)</span>
<a name="l00466"></a>00466 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00467"></a>00467 <span class="preprocessor"></span><span class="preprocessor">#define FFFFFFFF 0xffffffffUL</span>
<a name="l00468"></a>00468 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00469"></a>00469 <span class="preprocessor"></span>
<a name="l00470"></a>00470 <span class="preprocessor">#ifdef NO_LONG_LONG</span>
<a name="l00471"></a>00471 <span class="preprocessor"></span><span class="preprocessor">#undef ULLong</span>
<a name="l00472"></a>00472 <span class="preprocessor"></span><span class="preprocessor">#ifdef Just_16</span>
<a name="l00473"></a>00473 <span class="preprocessor"></span><span class="preprocessor">#undef Pack_32</span>
<a name="l00474"></a>00474 <span class="preprocessor"></span><span class="comment">/* When Pack_32 is not defined, we store 16 bits per 32-bit Long.</span>
<a name="l00475"></a>00475 <span class="comment"> * This makes some inner loops simpler and sometimes saves work</span>
<a name="l00476"></a>00476 <span class="comment"> * during multiplications, but it often seems to make things slightly</span>
<a name="l00477"></a>00477 <span class="comment"> * slower. Hence the default is now to store 32 bits per Long.</span>
<a name="l00478"></a>00478 <span class="comment"> */</span>
<a name="l00479"></a>00479 <span class="preprocessor">#endif</span>
<a name="l00480"></a>00480 <span class="preprocessor"></span><span class="preprocessor">#else </span><span class="comment">/* long long available */</span>
<a name="l00481"></a>00481 <span class="preprocessor">#ifndef Llong</span>
<a name="l00482"></a>00482 <span class="preprocessor"></span><span class="preprocessor">#define Llong long long</span>
<a name="l00483"></a>00483 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00484"></a>00484 <span class="preprocessor"></span><span class="preprocessor">#ifndef ULLong</span>
<a name="l00485"></a>00485 <span class="preprocessor"></span><span class="preprocessor">#define ULLong unsigned Llong</span>
<a name="l00486"></a>00486 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00487"></a>00487 <span class="preprocessor"></span><span class="preprocessor">#endif </span><span class="comment">/* NO_LONG_LONG */</span>
<a name="l00488"></a>00488
<a name="l00489"></a>00489 <span class="preprocessor">#ifndef MULTIPLE_THREADS</span>
<a name="l00490"></a>00490 <span class="preprocessor"></span><span class="preprocessor">#define ACQUIRE_DTOA_LOCK(n) </span><span class="comment">/*nothing*/</span>
<a name="l00491"></a>00491 <span class="preprocessor">#define FREE_DTOA_LOCK(n) </span><span class="comment">/*nothing*/</span>
<a name="l00492"></a>00492 <span class="preprocessor">#endif</span>
<a name="l00493"></a>00493 <span class="preprocessor"></span>
<a name="l00494"></a>00494 <span class="preprocessor">#define Kmax 15</span>
<a name="l00495"></a>00495 <span class="preprocessor"></span>
<a name="l00496"></a>00496 <span class="preprocessor">#ifdef __cplusplus</span>
<a name="l00497"></a>00497 <span class="preprocessor"></span><span class="keyword">extern</span> <span class="stringliteral">"C"</span> <span class="keywordtype">double</span> sb_strtod(<span class="keyword">const</span> <span class="keywordtype">char</span> *s00, <span class="keywordtype">char</span> **se);
<a name="l00498"></a>00498 <span class="preprocessor">#endif</span>
<a name="l00499"></a>00499 <span class="preprocessor"></span>
<a name="l00500"></a><a class="code" href="structBigint.html">00500</a> <span class="keyword">struct</span>
<a name="l00501"></a>00501 <a class="code" href="structBigint.html">Bigint</a> {
<a name="l00502"></a>00502 <span class="keyword">struct </span><a class="code" href="structBigint.html">Bigint</a> *next;
<a name="l00503"></a>00503 <span class="keywordtype">int</span> k, maxwds, sign, wds;
<a name="l00504"></a>00504 ULong x[1];
<a name="l00505"></a>00505 };
<a name="l00506"></a>00506
<a name="l00507"></a>00507 <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structBigint.html">Bigint</a> <a class="code" href="structBigint.html">Bigint</a>;
<a name="l00508"></a>00508
<a name="l00509"></a>00509 <span class="keyword">static</span> <a class="code" href="structBigint.html">Bigint</a> *
<a name="l00510"></a>00510 Balloc
<a name="l00511"></a>00511 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l00512"></a>00512 <span class="preprocessor"></span> (k) <span class="keywordtype">int</span> k;
<a name="l00513"></a>00513 <span class="preprocessor">#else</span>
<a name="l00514"></a>00514 <span class="preprocessor"></span> (<span class="keywordtype">int</span> k)
<a name="l00515"></a>00515 #endif
<a name="l00516"></a>00516 {
<a name="l00517"></a>00517 <span class="keywordtype">int</span> x;
<a name="l00518"></a>00518 <span class="keywordtype">size_t</span> len;
<a name="l00519"></a>00519 <a class="code" href="structBigint.html">Bigint</a> *rv;
<a name="l00520"></a>00520
<a name="l00521"></a>00521 x = 1 << k;
<a name="l00522"></a>00522 len = (<span class="keyword">sizeof</span>(<a class="code" href="structBigint.html">Bigint</a>) + (x-1)*<span class="keyword">sizeof</span>(ULong) + <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>) - 1)
<a name="l00523"></a>00523 /<span class="keyword">sizeof</span>(<span class="keywordtype">double</span>);
<a name="l00524"></a>00524 rv = <a class="code" href="ckd__alloc_8h.html#a8e89a31c3c70710a8e023a177084bff2" title="Macro for __ckd_malloc__.">ckd_malloc</a>(len*<span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));
<a name="l00525"></a>00525 rv->k = k;
<a name="l00526"></a>00526 rv->maxwds = x;
<a name="l00527"></a>00527 rv->sign = rv->wds = 0;
<a name="l00528"></a>00528 <span class="keywordflow">return</span> rv;
<a name="l00529"></a>00529 }
<a name="l00530"></a>00530
<a name="l00531"></a>00531 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00532"></a>00532 Bfree
<a name="l00533"></a>00533 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l00534"></a>00534 <span class="preprocessor"></span> (v) <a class="code" href="structBigint.html">Bigint</a> *v;
<a name="l00535"></a>00535 <span class="preprocessor">#else</span>
<a name="l00536"></a>00536 <span class="preprocessor"></span> (<a class="code" href="structBigint.html">Bigint</a> *v)
<a name="l00537"></a>00537 #endif
<a name="l00538"></a>00538 {
<a name="l00539"></a>00539 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(v);
<a name="l00540"></a>00540 }
<a name="l00541"></a>00541
<a name="l00542"></a>00542 <span class="preprocessor">#define Bcopy(x,y) memcpy((char *)&x->sign, (char *)&y->sign, \</span>
<a name="l00543"></a>00543 <span class="preprocessor">y->wds*sizeof(Long) + 2*sizeof(int))</span>
<a name="l00544"></a>00544 <span class="preprocessor"></span>
<a name="l00545"></a>00545 <span class="keyword">static</span> <a class="code" href="structBigint.html">Bigint</a> *
<a name="l00546"></a>00546 multadd
<a name="l00547"></a>00547 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l00548"></a>00548 <span class="preprocessor"></span> (b, m, a) <a class="code" href="structBigint.html">Bigint</a> *b; <span class="keywordtype">int</span> m, a;
<a name="l00549"></a>00549 <span class="preprocessor">#else</span>
<a name="l00550"></a>00550 <span class="preprocessor"></span> (<a class="code" href="structBigint.html">Bigint</a> *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="l00551"></a>00551 #endif
<a name="l00552"></a>00552 {
<a name="l00553"></a>00553 <span class="keywordtype">int</span> i, wds;
<a name="l00554"></a>00554 <span class="preprocessor">#ifdef ULLong</span>
<a name="l00555"></a>00555 <span class="preprocessor"></span> ULong *x;
<a name="l00556"></a>00556 ULLong carry, y;
<a name="l00557"></a>00557 <span class="preprocessor">#else</span>
<a name="l00558"></a>00558 <span class="preprocessor"></span> ULong carry, *x, y;
<a name="l00559"></a>00559 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l00560"></a>00560 <span class="preprocessor"></span> ULong xi, z;
<a name="l00561"></a>00561 <span class="preprocessor">#endif</span>
<a name="l00562"></a>00562 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00563"></a>00563 <span class="preprocessor"></span> <a class="code" href="structBigint.html">Bigint</a> *b1;
<a name="l00564"></a>00564
<a name="l00565"></a>00565 wds = b->wds;
<a name="l00566"></a>00566 x = b->x;
<a name="l00567"></a>00567 i = 0;
<a name="l00568"></a>00568 carry = a;
<a name="l00569"></a>00569 <span class="keywordflow">do</span> {
<a name="l00570"></a>00570 <span class="preprocessor">#ifdef ULLong</span>
<a name="l00571"></a>00571 <span class="preprocessor"></span> y = *x * (ULLong)m + carry;
<a name="l00572"></a>00572 carry = y >> 32;
<a name="l00573"></a>00573 *x++ = y & FFFFFFFF;
<a name="l00574"></a>00574 <span class="preprocessor">#else</span>
<a name="l00575"></a>00575 <span class="preprocessor"></span><span class="preprocessor">#ifdef Pack_32</span>
<a name="l00576"></a>00576 <span class="preprocessor"></span> xi = *x;
<a name="l00577"></a>00577 y = (xi & 0xffff) * m + carry;
<a name="l00578"></a>00578 z = (xi >> 16) * m + (y >> 16);
<a name="l00579"></a>00579 carry = z >> 16;
<a name="l00580"></a>00580 *x++ = (z << 16) + (y & 0xffff);
<a name="l00581"></a>00581 <span class="preprocessor">#else</span>
<a name="l00582"></a>00582 <span class="preprocessor"></span> y = *x * m + carry;
<a name="l00583"></a>00583 carry = y >> 16;
<a name="l00584"></a>00584 *x++ = y & 0xffff;
<a name="l00585"></a>00585 <span class="preprocessor">#endif</span>
<a name="l00586"></a>00586 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00587"></a>00587 <span class="preprocessor"></span> }
<a name="l00588"></a>00588 <span class="keywordflow">while</span>(++i < wds);
<a name="l00589"></a>00589 <span class="keywordflow">if</span> (carry) {
<a name="l00590"></a>00590 <span class="keywordflow">if</span> (wds >= b->maxwds) {
<a name="l00591"></a>00591 b1 = Balloc(b->k+1);
<a name="l00592"></a>00592 Bcopy(b1, b);
<a name="l00593"></a>00593 Bfree(b);
<a name="l00594"></a>00594 b = b1;
<a name="l00595"></a>00595 }
<a name="l00596"></a>00596 b->x[wds++] = carry;
<a name="l00597"></a>00597 b->wds = wds;
<a name="l00598"></a>00598 }
<a name="l00599"></a>00599 <span class="keywordflow">return</span> b;
<a name="l00600"></a>00600 }
<a name="l00601"></a>00601
<a name="l00602"></a>00602 <span class="keyword">static</span> <a class="code" href="structBigint.html">Bigint</a> *
<a name="l00603"></a>00603 s2b
<a name="l00604"></a>00604 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l00605"></a>00605 <span class="preprocessor"></span> (s, nd0, nd, y9) CONST <span class="keywordtype">char</span> *s; <span class="keywordtype">int</span> nd0, nd; ULong y9;
<a name="l00606"></a>00606 <span class="preprocessor">#else</span>
<a name="l00607"></a>00607 <span class="preprocessor"></span> (CONST <span class="keywordtype">char</span> *s, <span class="keywordtype">int</span> nd0, <span class="keywordtype">int</span> nd, ULong y9)
<a name="l00608"></a>00608 #endif
<a name="l00609"></a>00609 {
<a name="l00610"></a>00610 <a class="code" href="structBigint.html">Bigint</a> *b;
<a name="l00611"></a>00611 <span class="keywordtype">int</span> i, k;
<a name="l00612"></a>00612 Long x, y;
<a name="l00613"></a>00613
<a name="l00614"></a>00614 x = (nd + 8) / 9;
<a name="l00615"></a>00615 <span class="keywordflow">for</span>(k = 0, y = 1; x > y; y <<= 1, k++) ;
<a name="l00616"></a>00616 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l00617"></a>00617 <span class="preprocessor"></span> b = Balloc(k);
<a name="l00618"></a>00618 b->x[0] = y9;
<a name="l00619"></a>00619 b->wds = 1;
<a name="l00620"></a>00620 <span class="preprocessor">#else</span>
<a name="l00621"></a>00621 <span class="preprocessor"></span> b = Balloc(k+1);
<a name="l00622"></a>00622 b->x[0] = y9 & 0xffff;
<a name="l00623"></a>00623 b->wds = (b->x[1] = y9 >> 16) ? 2 : 1;
<a name="l00624"></a>00624 <span class="preprocessor">#endif</span>
<a name="l00625"></a>00625 <span class="preprocessor"></span>
<a name="l00626"></a>00626 i = 9;
<a name="l00627"></a>00627 <span class="keywordflow">if</span> (9 < nd0) {
<a name="l00628"></a>00628 s += 9;
<a name="l00629"></a>00629 <span class="keywordflow">do</span> b = multadd(b, 10, *s++ - <span class="charliteral">'0'</span>);
<a name="l00630"></a>00630 <span class="keywordflow">while</span>(++i < nd0);
<a name="l00631"></a>00631 s++;
<a name="l00632"></a>00632 }
<a name="l00633"></a>00633 <span class="keywordflow">else</span>
<a name="l00634"></a>00634 s += 10;
<a name="l00635"></a>00635 <span class="keywordflow">for</span>(; i < nd; i++)
<a name="l00636"></a>00636 b = multadd(b, 10, *s++ - <span class="charliteral">'0'</span>);
<a name="l00637"></a>00637 <span class="keywordflow">return</span> b;
<a name="l00638"></a>00638 }
<a name="l00639"></a>00639
<a name="l00640"></a>00640 <span class="keyword">static</span> <span class="keywordtype">int</span>
<a name="l00641"></a>00641 hi0bits
<a name="l00642"></a>00642 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l00643"></a>00643 <span class="preprocessor"></span> (x) <span class="keyword">register</span> ULong x;
<a name="l00644"></a>00644 <span class="preprocessor">#else</span>
<a name="l00645"></a>00645 <span class="preprocessor"></span> (<span class="keyword">register</span> ULong x)
<a name="l00646"></a>00646 #endif
<a name="l00647"></a>00647 {
<a name="l00648"></a>00648 <span class="keyword">register</span> <span class="keywordtype">int</span> k = 0;
<a name="l00649"></a>00649
<a name="l00650"></a>00650 <span class="keywordflow">if</span> (!(x & 0xffff0000)) {
<a name="l00651"></a>00651 k = 16;
<a name="l00652"></a>00652 x <<= 16;
<a name="l00653"></a>00653 }
<a name="l00654"></a>00654 <span class="keywordflow">if</span> (!(x & 0xff000000)) {
<a name="l00655"></a>00655 k += 8;
<a name="l00656"></a>00656 x <<= 8;
<a name="l00657"></a>00657 }
<a name="l00658"></a>00658 <span class="keywordflow">if</span> (!(x & 0xf0000000)) {
<a name="l00659"></a>00659 k += 4;
<a name="l00660"></a>00660 x <<= 4;
<a name="l00661"></a>00661 }
<a name="l00662"></a>00662 <span class="keywordflow">if</span> (!(x & 0xc0000000)) {
<a name="l00663"></a>00663 k += 2;
<a name="l00664"></a>00664 x <<= 2;
<a name="l00665"></a>00665 }
<a name="l00666"></a>00666 <span class="keywordflow">if</span> (!(x & 0x80000000)) {
<a name="l00667"></a>00667 k++;
<a name="l00668"></a>00668 <span class="keywordflow">if</span> (!(x & 0x40000000))
<a name="l00669"></a>00669 <span class="keywordflow">return</span> 32;
<a name="l00670"></a>00670 }
<a name="l00671"></a>00671 <span class="keywordflow">return</span> k;
<a name="l00672"></a>00672 }
<a name="l00673"></a>00673
<a name="l00674"></a>00674 <span class="keyword">static</span> <span class="keywordtype">int</span>
<a name="l00675"></a>00675 lo0bits
<a name="l00676"></a>00676 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l00677"></a>00677 <span class="preprocessor"></span> (y) ULong *y;
<a name="l00678"></a>00678 <span class="preprocessor">#else</span>
<a name="l00679"></a>00679 <span class="preprocessor"></span> (ULong *y)
<a name="l00680"></a>00680 #endif
<a name="l00681"></a>00681 {
<a name="l00682"></a>00682 <span class="keyword">register</span> <span class="keywordtype">int</span> k;
<a name="l00683"></a>00683 <span class="keyword">register</span> ULong x = *y;
<a name="l00684"></a>00684
<a name="l00685"></a>00685 <span class="keywordflow">if</span> (x & 7) {
<a name="l00686"></a>00686 <span class="keywordflow">if</span> (x & 1)
<a name="l00687"></a>00687 <span class="keywordflow">return</span> 0;
<a name="l00688"></a>00688 <span class="keywordflow">if</span> (x & 2) {
<a name="l00689"></a>00689 *y = x >> 1;
<a name="l00690"></a>00690 <span class="keywordflow">return</span> 1;
<a name="l00691"></a>00691 }
<a name="l00692"></a>00692 *y = x >> 2;
<a name="l00693"></a>00693 <span class="keywordflow">return</span> 2;
<a name="l00694"></a>00694 }
<a name="l00695"></a>00695 k = 0;
<a name="l00696"></a>00696 <span class="keywordflow">if</span> (!(x & 0xffff)) {
<a name="l00697"></a>00697 k = 16;
<a name="l00698"></a>00698 x >>= 16;
<a name="l00699"></a>00699 }
<a name="l00700"></a>00700 <span class="keywordflow">if</span> (!(x & 0xff)) {
<a name="l00701"></a>00701 k += 8;
<a name="l00702"></a>00702 x >>= 8;
<a name="l00703"></a>00703 }
<a name="l00704"></a>00704 <span class="keywordflow">if</span> (!(x & 0xf)) {
<a name="l00705"></a>00705 k += 4;
<a name="l00706"></a>00706 x >>= 4;
<a name="l00707"></a>00707 }
<a name="l00708"></a>00708 <span class="keywordflow">if</span> (!(x & 0x3)) {
<a name="l00709"></a>00709 k += 2;
<a name="l00710"></a>00710 x >>= 2;
<a name="l00711"></a>00711 }
<a name="l00712"></a>00712 <span class="keywordflow">if</span> (!(x & 1)) {
<a name="l00713"></a>00713 k++;
<a name="l00714"></a>00714 x >>= 1;
<a name="l00715"></a>00715 <span class="keywordflow">if</span> (!x)
<a name="l00716"></a>00716 <span class="keywordflow">return</span> 32;
<a name="l00717"></a>00717 }
<a name="l00718"></a>00718 *y = x;
<a name="l00719"></a>00719 <span class="keywordflow">return</span> k;
<a name="l00720"></a>00720 }
<a name="l00721"></a>00721
<a name="l00722"></a>00722 <span class="keyword">static</span> <a class="code" href="structBigint.html">Bigint</a> *
<a name="l00723"></a>00723 i2b
<a name="l00724"></a>00724 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l00725"></a>00725 <span class="preprocessor"></span> (i) <span class="keywordtype">int</span> i;
<a name="l00726"></a>00726 <span class="preprocessor">#else</span>
<a name="l00727"></a>00727 <span class="preprocessor"></span> (<span class="keywordtype">int</span> i)
<a name="l00728"></a>00728 #endif
<a name="l00729"></a>00729 {
<a name="l00730"></a>00730 <a class="code" href="structBigint.html">Bigint</a> *b;
<a name="l00731"></a>00731
<a name="l00732"></a>00732 b = Balloc(1);
<a name="l00733"></a>00733 b->x[0] = i;
<a name="l00734"></a>00734 b->wds = 1;
<a name="l00735"></a>00735 <span class="keywordflow">return</span> b;
<a name="l00736"></a>00736 }
<a name="l00737"></a>00737
<a name="l00738"></a>00738 <span class="keyword">static</span> <a class="code" href="structBigint.html">Bigint</a> *
<a name="l00739"></a>00739 mult
<a name="l00740"></a>00740 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l00741"></a>00741 <span class="preprocessor"></span> (a, b) <a class="code" href="structBigint.html">Bigint</a> *a, *b;
<a name="l00742"></a>00742 <span class="preprocessor">#else</span>
<a name="l00743"></a>00743 <span class="preprocessor"></span> (<a class="code" href="structBigint.html">Bigint</a> *a, <a class="code" href="structBigint.html">Bigint</a> *b)
<a name="l00744"></a>00744 #endif
<a name="l00745"></a>00745 {
<a name="l00746"></a>00746 <a class="code" href="structBigint.html">Bigint</a> *c;
<a name="l00747"></a>00747 <span class="keywordtype">int</span> k, wa, wb, wc;
<a name="l00748"></a>00748 ULong *x, *xa, *xae, *xb, *xbe, *xc, *xc0;
<a name="l00749"></a>00749 ULong y;
<a name="l00750"></a>00750 <span class="preprocessor">#ifdef ULLong</span>
<a name="l00751"></a>00751 <span class="preprocessor"></span> ULLong carry, z;
<a name="l00752"></a>00752 <span class="preprocessor">#else</span>
<a name="l00753"></a>00753 <span class="preprocessor"></span> ULong carry, z;
<a name="l00754"></a>00754 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l00755"></a>00755 <span class="preprocessor"></span> ULong z2;
<a name="l00756"></a>00756 <span class="preprocessor">#endif</span>
<a name="l00757"></a>00757 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00758"></a>00758 <span class="preprocessor"></span>
<a name="l00759"></a>00759 <span class="keywordflow">if</span> (a->wds < b->wds) {
<a name="l00760"></a>00760 c = a;
<a name="l00761"></a>00761 a = b;
<a name="l00762"></a>00762 b = c;
<a name="l00763"></a>00763 }
<a name="l00764"></a>00764 k = a->k;
<a name="l00765"></a>00765 wa = a->wds;
<a name="l00766"></a>00766 wb = b->wds;
<a name="l00767"></a>00767 wc = wa + wb;
<a name="l00768"></a>00768 <span class="keywordflow">if</span> (wc > a->maxwds)
<a name="l00769"></a>00769 k++;
<a name="l00770"></a>00770 c = Balloc(k);
<a name="l00771"></a>00771 <span class="keywordflow">for</span>(x = c->x, xa = x + wc; x < xa; x++)
<a name="l00772"></a>00772 *x = 0;
<a name="l00773"></a>00773 xa = a->x;
<a name="l00774"></a>00774 xae = xa + wa;
<a name="l00775"></a>00775 xb = b->x;
<a name="l00776"></a>00776 xbe = xb + wb;
<a name="l00777"></a>00777 xc0 = c->x;
<a name="l00778"></a>00778 <span class="preprocessor">#ifdef ULLong</span>
<a name="l00779"></a>00779 <span class="preprocessor"></span> <span class="keywordflow">for</span>(; xb < xbe; xc0++) {
<a name="l00780"></a>00780 <span class="keywordflow">if</span> ((y = *xb++)) {
<a name="l00781"></a>00781 x = xa;
<a name="l00782"></a>00782 xc = xc0;
<a name="l00783"></a>00783 carry = 0;
<a name="l00784"></a>00784 <span class="keywordflow">do</span> {
<a name="l00785"></a>00785 z = *x++ * (ULLong)y + *xc + carry;
<a name="l00786"></a>00786 carry = z >> 32;
<a name="l00787"></a>00787 *xc++ = z & FFFFFFFF;
<a name="l00788"></a>00788 }
<a name="l00789"></a>00789 <span class="keywordflow">while</span>(x < xae);
<a name="l00790"></a>00790 *xc = carry;
<a name="l00791"></a>00791 }
<a name="l00792"></a>00792 }
<a name="l00793"></a>00793 <span class="preprocessor">#else</span>
<a name="l00794"></a>00794 <span class="preprocessor"></span><span class="preprocessor">#ifdef Pack_32</span>
<a name="l00795"></a>00795 <span class="preprocessor"></span> <span class="keywordflow">for</span>(; xb < xbe; xb++, xc0++) {
<a name="l00796"></a>00796 <span class="keywordflow">if</span> (y = *xb & 0xffff) {
<a name="l00797"></a>00797 x = xa;
<a name="l00798"></a>00798 xc = xc0;
<a name="l00799"></a>00799 carry = 0;
<a name="l00800"></a>00800 <span class="keywordflow">do</span> {
<a name="l00801"></a>00801 z = (*x & 0xffff) * y + (*xc & 0xffff) + carry;
<a name="l00802"></a>00802 carry = z >> 16;
<a name="l00803"></a>00803 z2 = (*x++ >> 16) * y + (*xc >> 16) + carry;
<a name="l00804"></a>00804 carry = z2 >> 16;
<a name="l00805"></a>00805 Storeinc(xc, z2, z);
<a name="l00806"></a>00806 }
<a name="l00807"></a>00807 <span class="keywordflow">while</span>(x < xae);
<a name="l00808"></a>00808 *xc = carry;
<a name="l00809"></a>00809 }
<a name="l00810"></a>00810 <span class="keywordflow">if</span> (y = *xb >> 16) {
<a name="l00811"></a>00811 x = xa;
<a name="l00812"></a>00812 xc = xc0;
<a name="l00813"></a>00813 carry = 0;
<a name="l00814"></a>00814 z2 = *xc;
<a name="l00815"></a>00815 <span class="keywordflow">do</span> {
<a name="l00816"></a>00816 z = (*x & 0xffff) * y + (*xc >> 16) + carry;
<a name="l00817"></a>00817 carry = z >> 16;
<a name="l00818"></a>00818 Storeinc(xc, z, z2);
<a name="l00819"></a>00819 z2 = (*x++ >> 16) * y + (*xc & 0xffff) + carry;
<a name="l00820"></a>00820 carry = z2 >> 16;
<a name="l00821"></a>00821 }
<a name="l00822"></a>00822 <span class="keywordflow">while</span>(x < xae);
<a name="l00823"></a>00823 *xc = z2;
<a name="l00824"></a>00824 }
<a name="l00825"></a>00825 }
<a name="l00826"></a>00826 <span class="preprocessor">#else</span>
<a name="l00827"></a>00827 <span class="preprocessor"></span> <span class="keywordflow">for</span>(; xb < xbe; xc0++) {
<a name="l00828"></a>00828 <span class="keywordflow">if</span> (y = *xb++) {
<a name="l00829"></a>00829 x = xa;
<a name="l00830"></a>00830 xc = xc0;
<a name="l00831"></a>00831 carry = 0;
<a name="l00832"></a>00832 <span class="keywordflow">do</span> {
<a name="l00833"></a>00833 z = *x++ * y + *xc + carry;
<a name="l00834"></a>00834 carry = z >> 16;
<a name="l00835"></a>00835 *xc++ = z & 0xffff;
<a name="l00836"></a>00836 }
<a name="l00837"></a>00837 <span class="keywordflow">while</span>(x < xae);
<a name="l00838"></a>00838 *xc = carry;
<a name="l00839"></a>00839 }
<a name="l00840"></a>00840 }
<a name="l00841"></a>00841 <span class="preprocessor">#endif</span>
<a name="l00842"></a>00842 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00843"></a>00843 <span class="preprocessor"></span> <span class="keywordflow">for</span>(xc0 = c->x, xc = xc0 + wc; wc > 0 && !*--xc; --wc) ;
<a name="l00844"></a>00844 c->wds = wc;
<a name="l00845"></a>00845 <span class="keywordflow">return</span> c;
<a name="l00846"></a>00846 }
<a name="l00847"></a>00847
<a name="l00848"></a>00848 <span class="keyword">static</span> <a class="code" href="structBigint.html">Bigint</a> *
<a name="l00849"></a>00849 pow5mult
<a name="l00850"></a>00850 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l00851"></a>00851 <span class="preprocessor"></span> (b, k) <a class="code" href="structBigint.html">Bigint</a> *b; <span class="keywordtype">int</span> k;
<a name="l00852"></a>00852 <span class="preprocessor">#else</span>
<a name="l00853"></a>00853 <span class="preprocessor"></span> (<a class="code" href="structBigint.html">Bigint</a> *b, <span class="keywordtype">int</span> k)
<a name="l00854"></a>00854 #endif
<a name="l00855"></a>00855 {
<a name="l00856"></a>00856 <a class="code" href="structBigint.html">Bigint</a> *b1, *p5, *p51;
<a name="l00857"></a>00857 <span class="keywordtype">int</span> i;
<a name="l00858"></a>00858 <span class="keyword">static</span> <span class="keywordtype">int</span> CONST p05[3] = { 5, 25, 125 };
<a name="l00859"></a>00859
<a name="l00860"></a>00860 <span class="keywordflow">if</span> ((i = k & 3))
<a name="l00861"></a>00861 b = multadd(b, p05[i-1], 0);
<a name="l00862"></a>00862
<a name="l00863"></a>00863 <span class="keywordflow">if</span> (!(k >>= 2))
<a name="l00864"></a>00864 <span class="keywordflow">return</span> b;
<a name="l00865"></a>00865
<a name="l00866"></a>00866 p5 = i2b(625);
<a name="l00867"></a>00867 <span class="keywordflow">for</span>(;;) {
<a name="l00868"></a>00868 <span class="keywordflow">if</span> (k & 1) {
<a name="l00869"></a>00869 b1 = mult(b, p5);
<a name="l00870"></a>00870 Bfree(b);
<a name="l00871"></a>00871 b = b1;
<a name="l00872"></a>00872 }
<a name="l00873"></a>00873 <span class="keywordflow">if</span> (!(k >>= 1))
<a name="l00874"></a>00874 <span class="keywordflow">break</span>;
<a name="l00875"></a>00875 p51 = mult(p5,p5);
<a name="l00876"></a>00876 Bfree(p5);
<a name="l00877"></a>00877 p5 = p51;
<a name="l00878"></a>00878 }
<a name="l00879"></a>00879 Bfree(p5);
<a name="l00880"></a>00880 <span class="keywordflow">return</span> b;
<a name="l00881"></a>00881 }
<a name="l00882"></a>00882
<a name="l00883"></a>00883 <span class="keyword">static</span> <a class="code" href="structBigint.html">Bigint</a> *
<a name="l00884"></a>00884 lshift
<a name="l00885"></a>00885 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l00886"></a>00886 <span class="preprocessor"></span> (b, k) <a class="code" href="structBigint.html">Bigint</a> *b; <span class="keywordtype">int</span> k;
<a name="l00887"></a>00887 <span class="preprocessor">#else</span>
<a name="l00888"></a>00888 <span class="preprocessor"></span> (<a class="code" href="structBigint.html">Bigint</a> *b, <span class="keywordtype">int</span> k)
<a name="l00889"></a>00889 #endif
<a name="l00890"></a>00890 {
<a name="l00891"></a>00891 <span class="keywordtype">int</span> i, k1, n, n1;
<a name="l00892"></a>00892 <a class="code" href="structBigint.html">Bigint</a> *b1;
<a name="l00893"></a>00893 ULong *x, *x1, *xe, z;
<a name="l00894"></a>00894
<a name="l00895"></a>00895 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l00896"></a>00896 <span class="preprocessor"></span> n = k >> 5;
<a name="l00897"></a>00897 <span class="preprocessor">#else</span>
<a name="l00898"></a>00898 <span class="preprocessor"></span> n = k >> 4;
<a name="l00899"></a>00899 <span class="preprocessor">#endif</span>
<a name="l00900"></a>00900 <span class="preprocessor"></span> k1 = b->k;
<a name="l00901"></a>00901 n1 = n + b->wds + 1;
<a name="l00902"></a>00902 <span class="keywordflow">for</span>(i = b->maxwds; n1 > i; i <<= 1)
<a name="l00903"></a>00903 k1++;
<a name="l00904"></a>00904 b1 = Balloc(k1);
<a name="l00905"></a>00905 x1 = b1->x;
<a name="l00906"></a>00906 <span class="keywordflow">for</span>(i = 0; i < n; i++)
<a name="l00907"></a>00907 *x1++ = 0;
<a name="l00908"></a>00908 x = b->x;
<a name="l00909"></a>00909 xe = x + b->wds;
<a name="l00910"></a>00910 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l00911"></a>00911 <span class="preprocessor"></span> <span class="keywordflow">if</span> (k &= 0x1f) {
<a name="l00912"></a>00912 k1 = 32 - k;
<a name="l00913"></a>00913 z = 0;
<a name="l00914"></a>00914 <span class="keywordflow">do</span> {
<a name="l00915"></a>00915 *x1++ = *x << k | z;
<a name="l00916"></a>00916 z = *x++ >> k1;
<a name="l00917"></a>00917 }
<a name="l00918"></a>00918 <span class="keywordflow">while</span>(x < xe);
<a name="l00919"></a>00919 <span class="keywordflow">if</span> ((*x1 = z))
<a name="l00920"></a>00920 ++n1;
<a name="l00921"></a>00921 }
<a name="l00922"></a>00922 <span class="preprocessor">#else</span>
<a name="l00923"></a>00923 <span class="preprocessor"></span> <span class="keywordflow">if</span> (k &= 0xf) {
<a name="l00924"></a>00924 k1 = 16 - k;
<a name="l00925"></a>00925 z = 0;
<a name="l00926"></a>00926 <span class="keywordflow">do</span> {
<a name="l00927"></a>00927 *x1++ = *x << k & 0xffff | z;
<a name="l00928"></a>00928 z = *x++ >> k1;
<a name="l00929"></a>00929 }
<a name="l00930"></a>00930 <span class="keywordflow">while</span>(x < xe);
<a name="l00931"></a>00931 <span class="keywordflow">if</span> (*x1 = z)
<a name="l00932"></a>00932 ++n1;
<a name="l00933"></a>00933 }
<a name="l00934"></a>00934 <span class="preprocessor">#endif</span>
<a name="l00935"></a>00935 <span class="preprocessor"></span> <span class="keywordflow">else</span> <span class="keywordflow">do</span>
<a name="l00936"></a>00936 *x1++ = *x++;
<a name="l00937"></a>00937 <span class="keywordflow">while</span>(x < xe);
<a name="l00938"></a>00938 b1->wds = n1 - 1;
<a name="l00939"></a>00939 Bfree(b);
<a name="l00940"></a>00940 <span class="keywordflow">return</span> b1;
<a name="l00941"></a>00941 }
<a name="l00942"></a>00942
<a name="l00943"></a>00943 <span class="keyword">static</span> <span class="keywordtype">int</span>
<a name="l00944"></a>00944 cmp
<a name="l00945"></a>00945 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l00946"></a>00946 <span class="preprocessor"></span> (a, b) <a class="code" href="structBigint.html">Bigint</a> *a, *b;
<a name="l00947"></a>00947 <span class="preprocessor">#else</span>
<a name="l00948"></a>00948 <span class="preprocessor"></span> (<a class="code" href="structBigint.html">Bigint</a> *a, <a class="code" href="structBigint.html">Bigint</a> *b)
<a name="l00949"></a>00949 #endif
<a name="l00950"></a>00950 {
<a name="l00951"></a>00951 ULong *xa, *xa0, *xb, *xb0;
<a name="l00952"></a>00952 <span class="keywordtype">int</span> i, j;
<a name="l00953"></a>00953
<a name="l00954"></a>00954 i = a->wds;
<a name="l00955"></a>00955 j = b->wds;
<a name="l00956"></a>00956 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l00957"></a>00957 <span class="preprocessor"></span> <span class="keywordflow">if</span> (i > 1 && !a->x[i-1])
<a name="l00958"></a>00958 Bug(<span class="stringliteral">"cmp called with a->x[a->wds-1] == 0"</span>);
<a name="l00959"></a>00959 <span class="keywordflow">if</span> (j > 1 && !b->x[j-1])
<a name="l00960"></a>00960 Bug(<span class="stringliteral">"cmp called with b->x[b->wds-1] == 0"</span>);
<a name="l00961"></a>00961 <span class="preprocessor">#endif</span>
<a name="l00962"></a>00962 <span class="preprocessor"></span> <span class="keywordflow">if</span> (i -= j)
<a name="l00963"></a>00963 <span class="keywordflow">return</span> i;
<a name="l00964"></a>00964 xa0 = a->x;
<a name="l00965"></a>00965 xa = xa0 + j;
<a name="l00966"></a>00966 xb0 = b->x;
<a name="l00967"></a>00967 xb = xb0 + j;
<a name="l00968"></a>00968 <span class="keywordflow">for</span>(;;) {
<a name="l00969"></a>00969 <span class="keywordflow">if</span> (*--xa != *--xb)
<a name="l00970"></a>00970 <span class="keywordflow">return</span> *xa < *xb ? -1 : 1;
<a name="l00971"></a>00971 <span class="keywordflow">if</span> (xa <= xa0)
<a name="l00972"></a>00972 <span class="keywordflow">break</span>;
<a name="l00973"></a>00973 }
<a name="l00974"></a>00974 <span class="keywordflow">return</span> 0;
<a name="l00975"></a>00975 }
<a name="l00976"></a>00976
<a name="l00977"></a>00977 <span class="keyword">static</span> <a class="code" href="structBigint.html">Bigint</a> *
<a name="l00978"></a>00978 diff
<a name="l00979"></a>00979 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l00980"></a>00980 <span class="preprocessor"></span> (a, b) <a class="code" href="structBigint.html">Bigint</a> *a, *b;
<a name="l00981"></a>00981 <span class="preprocessor">#else</span>
<a name="l00982"></a>00982 <span class="preprocessor"></span> (<a class="code" href="structBigint.html">Bigint</a> *a, <a class="code" href="structBigint.html">Bigint</a> *b)
<a name="l00983"></a>00983 #endif
<a name="l00984"></a>00984 {
<a name="l00985"></a>00985 <a class="code" href="structBigint.html">Bigint</a> *c;
<a name="l00986"></a>00986 <span class="keywordtype">int</span> i, wa, wb;
<a name="l00987"></a>00987 ULong *xa, *xae, *xb, *xbe, *xc;
<a name="l00988"></a>00988 <span class="preprocessor">#ifdef ULLong</span>
<a name="l00989"></a>00989 <span class="preprocessor"></span> ULLong borrow, y;
<a name="l00990"></a>00990 <span class="preprocessor">#else</span>
<a name="l00991"></a>00991 <span class="preprocessor"></span> ULong borrow, y;
<a name="l00992"></a>00992 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l00993"></a>00993 <span class="preprocessor"></span> ULong z;
<a name="l00994"></a>00994 <span class="preprocessor">#endif</span>
<a name="l00995"></a>00995 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00996"></a>00996 <span class="preprocessor"></span>
<a name="l00997"></a>00997 i = cmp(a,b);
<a name="l00998"></a>00998 <span class="keywordflow">if</span> (!i) {
<a name="l00999"></a>00999 c = Balloc(0);
<a name="l01000"></a>01000 c->wds = 1;
<a name="l01001"></a>01001 c->x[0] = 0;
<a name="l01002"></a>01002 <span class="keywordflow">return</span> c;
<a name="l01003"></a>01003 }
<a name="l01004"></a>01004 <span class="keywordflow">if</span> (i < 0) {
<a name="l01005"></a>01005 c = a;
<a name="l01006"></a>01006 a = b;
<a name="l01007"></a>01007 b = c;
<a name="l01008"></a>01008 i = 1;
<a name="l01009"></a>01009 }
<a name="l01010"></a>01010 <span class="keywordflow">else</span>
<a name="l01011"></a>01011 i = 0;
<a name="l01012"></a>01012 c = Balloc(a->k);
<a name="l01013"></a>01013 c->sign = i;
<a name="l01014"></a>01014 wa = a->wds;
<a name="l01015"></a>01015 xa = a->x;
<a name="l01016"></a>01016 xae = xa + wa;
<a name="l01017"></a>01017 wb = b->wds;
<a name="l01018"></a>01018 xb = b->x;
<a name="l01019"></a>01019 xbe = xb + wb;
<a name="l01020"></a>01020 xc = c->x;
<a name="l01021"></a>01021 borrow = 0;
<a name="l01022"></a>01022 <span class="preprocessor">#ifdef ULLong</span>
<a name="l01023"></a>01023 <span class="preprocessor"></span> <span class="keywordflow">do</span> {
<a name="l01024"></a>01024 y = (ULLong)*xa++ - *xb++ - borrow;
<a name="l01025"></a>01025 borrow = y >> 32 & (ULong)1;
<a name="l01026"></a>01026 *xc++ = y & FFFFFFFF;
<a name="l01027"></a>01027 }
<a name="l01028"></a>01028 <span class="keywordflow">while</span>(xb < xbe);
<a name="l01029"></a>01029 <span class="keywordflow">while</span>(xa < xae) {
<a name="l01030"></a>01030 y = *xa++ - borrow;
<a name="l01031"></a>01031 borrow = y >> 32 & (ULong)1;
<a name="l01032"></a>01032 *xc++ = y & FFFFFFFF;
<a name="l01033"></a>01033 }
<a name="l01034"></a>01034 <span class="preprocessor">#else</span>
<a name="l01035"></a>01035 <span class="preprocessor"></span><span class="preprocessor">#ifdef Pack_32</span>
<a name="l01036"></a>01036 <span class="preprocessor"></span> <span class="keywordflow">do</span> {
<a name="l01037"></a>01037 y = (*xa & 0xffff) - (*xb & 0xffff) - borrow;
<a name="l01038"></a>01038 borrow = (y & 0x10000) >> 16;
<a name="l01039"></a>01039 z = (*xa++ >> 16) - (*xb++ >> 16) - borrow;
<a name="l01040"></a>01040 borrow = (z & 0x10000) >> 16;
<a name="l01041"></a>01041 Storeinc(xc, z, y);
<a name="l01042"></a>01042 }
<a name="l01043"></a>01043 <span class="keywordflow">while</span>(xb < xbe);
<a name="l01044"></a>01044 <span class="keywordflow">while</span>(xa < xae) {
<a name="l01045"></a>01045 y = (*xa & 0xffff) - borrow;
<a name="l01046"></a>01046 borrow = (y & 0x10000) >> 16;
<a name="l01047"></a>01047 z = (*xa++ >> 16) - borrow;
<a name="l01048"></a>01048 borrow = (z & 0x10000) >> 16;
<a name="l01049"></a>01049 Storeinc(xc, z, y);
<a name="l01050"></a>01050 }
<a name="l01051"></a>01051 <span class="preprocessor">#else</span>
<a name="l01052"></a>01052 <span class="preprocessor"></span> <span class="keywordflow">do</span> {
<a name="l01053"></a>01053 y = *xa++ - *xb++ - borrow;
<a name="l01054"></a>01054 borrow = (y & 0x10000) >> 16;
<a name="l01055"></a>01055 *xc++ = y & 0xffff;
<a name="l01056"></a>01056 }
<a name="l01057"></a>01057 <span class="keywordflow">while</span>(xb < xbe);
<a name="l01058"></a>01058 <span class="keywordflow">while</span>(xa < xae) {
<a name="l01059"></a>01059 y = *xa++ - borrow;
<a name="l01060"></a>01060 borrow = (y & 0x10000) >> 16;
<a name="l01061"></a>01061 *xc++ = y & 0xffff;
<a name="l01062"></a>01062 }
<a name="l01063"></a>01063 <span class="preprocessor">#endif</span>
<a name="l01064"></a>01064 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01065"></a>01065 <span class="preprocessor"></span> <span class="keywordflow">while</span>(!*--xc)
<a name="l01066"></a>01066 wa--;
<a name="l01067"></a>01067 c->wds = wa;
<a name="l01068"></a>01068 <span class="keywordflow">return</span> c;
<a name="l01069"></a>01069 }
<a name="l01070"></a>01070
<a name="l01071"></a>01071 <span class="keyword">static</span> <span class="keywordtype">double</span>
<a name="l01072"></a>01072 ulp
<a name="l01073"></a>01073 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l01074"></a>01074 <span class="preprocessor"></span> (x) <span class="keywordtype">double</span> x;
<a name="l01075"></a>01075 <span class="preprocessor">#else</span>
<a name="l01076"></a>01076 <span class="preprocessor"></span> (<span class="keywordtype">double</span> x)
<a name="l01077"></a>01077 #endif
<a name="l01078"></a>01078 {
<a name="l01079"></a>01079 <span class="keyword">register</span> Long L;
<a name="l01080"></a>01080 <a class="code" href="unionU.html" title="Union to extract the bytes of a double.">U</a> a;
<a name="l01081"></a>01081
<a name="l01082"></a>01082 L = (word0(x) & Exp_mask) - (P-1)*Exp_msk1;
<a name="l01083"></a>01083 <span class="preprocessor">#ifndef Avoid_Underflow</span>
<a name="l01084"></a>01084 <span class="preprocessor"></span><span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l01085"></a>01085 <span class="preprocessor"></span> <span class="keywordflow">if</span> (L > 0) {
<a name="l01086"></a>01086 <span class="preprocessor">#endif</span>
<a name="l01087"></a>01087 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01088"></a>01088 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
<a name="l01089"></a>01089 <span class="preprocessor"></span> L |= Exp_msk1 >> 4;
<a name="l01090"></a>01090 <span class="preprocessor">#endif</span>
<a name="l01091"></a>01091 <span class="preprocessor"></span> word0(a) = L;
<a name="l01092"></a>01092 word1(a) = 0;
<a name="l01093"></a>01093 <span class="preprocessor">#ifndef Avoid_Underflow</span>
<a name="l01094"></a>01094 <span class="preprocessor"></span><span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l01095"></a>01095 <span class="preprocessor"></span> }
<a name="l01096"></a>01096 <span class="keywordflow">else</span> {
<a name="l01097"></a>01097 L = -L >> Exp_shift;
<a name="l01098"></a>01098 <span class="keywordflow">if</span> (L < Exp_shift) {
<a name="l01099"></a>01099 word0(a) = 0x80000 >> L;
<a name="l01100"></a>01100 word1(a) = 0;
<a name="l01101"></a>01101 }
<a name="l01102"></a>01102 <span class="keywordflow">else</span> {
<a name="l01103"></a>01103 word0(a) = 0;
<a name="l01104"></a>01104 L -= Exp_shift;
<a name="l01105"></a>01105 word1(a) = L >= 31 ? 1 : 1 << 31 - L;
<a name="l01106"></a>01106 }
<a name="l01107"></a>01107 }
<a name="l01108"></a>01108 <span class="preprocessor">#endif</span>
<a name="l01109"></a>01109 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01110"></a>01110 <span class="preprocessor"></span> <span class="keywordflow">return</span> dval(a);
<a name="l01111"></a>01111 }
<a name="l01112"></a>01112
<a name="l01113"></a>01113 <span class="keyword">static</span> <span class="keywordtype">double</span>
<a name="l01114"></a>01114 b2d
<a name="l01115"></a>01115 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l01116"></a>01116 <span class="preprocessor"></span> (a, e) <a class="code" href="structBigint.html">Bigint</a> *a; <span class="keywordtype">int</span> *e;
<a name="l01117"></a>01117 <span class="preprocessor">#else</span>
<a name="l01118"></a>01118 <span class="preprocessor"></span> (<a class="code" href="structBigint.html">Bigint</a> *a, <span class="keywordtype">int</span> *e)
<a name="l01119"></a>01119 #endif
<a name="l01120"></a>01120 {
<a name="l01121"></a>01121 ULong *xa, *xa0, w, y, z;
<a name="l01122"></a>01122 <span class="keywordtype">int</span> k;
<a name="l01123"></a>01123 <a class="code" href="unionU.html" title="Union to extract the bytes of a double.">U</a> d;
<a name="l01124"></a>01124 <span class="preprocessor">#ifdef VAX</span>
<a name="l01125"></a>01125 <span class="preprocessor"></span> ULong d0, d1;
<a name="l01126"></a>01126 <span class="preprocessor">#else</span>
<a name="l01127"></a>01127 <span class="preprocessor"></span><span class="preprocessor">#define d0 word0(d)</span>
<a name="l01128"></a>01128 <span class="preprocessor"></span><span class="preprocessor">#define d1 word1(d)</span>
<a name="l01129"></a>01129 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01130"></a>01130 <span class="preprocessor"></span>
<a name="l01131"></a>01131 xa0 = a->x;
<a name="l01132"></a>01132 xa = xa0 + a->wds;
<a name="l01133"></a>01133 y = *--xa;
<a name="l01134"></a>01134 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l01135"></a>01135 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!y) Bug(<span class="stringliteral">"zero y in b2d"</span>);
<a name="l01136"></a>01136 <span class="preprocessor">#endif</span>
<a name="l01137"></a>01137 <span class="preprocessor"></span> k = hi0bits(y);
<a name="l01138"></a>01138 *e = 32 - k;
<a name="l01139"></a>01139 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l01140"></a>01140 <span class="preprocessor"></span> <span class="keywordflow">if</span> (k < Ebits) {
<a name="l01141"></a>01141 d0 = Exp_1 | y >> (Ebits - k);
<a name="l01142"></a>01142 w = xa > xa0 ? *--xa : 0;
<a name="l01143"></a>01143 d1 = y << ((32-Ebits) + k) | w >> (Ebits - k);
<a name="l01144"></a>01144 <span class="keywordflow">goto</span> ret_d;
<a name="l01145"></a>01145 }
<a name="l01146"></a>01146 z = xa > xa0 ? *--xa : 0;
<a name="l01147"></a>01147 <span class="keywordflow">if</span> (k -= Ebits) {
<a name="l01148"></a>01148 d0 = Exp_1 | y << k | z >> (32 - k);
<a name="l01149"></a>01149 y = xa > xa0 ? *--xa : 0;
<a name="l01150"></a>01150 d1 = z << k | y >> (32 - k);
<a name="l01151"></a>01151 }
<a name="l01152"></a>01152 <span class="keywordflow">else</span> {
<a name="l01153"></a>01153 d0 = Exp_1 | y;
<a name="l01154"></a>01154 d1 = z;
<a name="l01155"></a>01155 }
<a name="l01156"></a>01156 <span class="preprocessor">#else</span>
<a name="l01157"></a>01157 <span class="preprocessor"></span> <span class="keywordflow">if</span> (k < Ebits + 16) {
<a name="l01158"></a>01158 z = xa > xa0 ? *--xa : 0;
<a name="l01159"></a>01159 d0 = Exp_1 | y << k - Ebits | z >> Ebits + 16 - k;
<a name="l01160"></a>01160 w = xa > xa0 ? *--xa : 0;
<a name="l01161"></a>01161 y = xa > xa0 ? *--xa : 0;
<a name="l01162"></a>01162 d1 = z << k + 16 - Ebits | w << k - Ebits | y >> 16 + Ebits - k;
<a name="l01163"></a>01163 <span class="keywordflow">goto</span> ret_d;
<a name="l01164"></a>01164 }
<a name="l01165"></a>01165 z = xa > xa0 ? *--xa : 0;
<a name="l01166"></a>01166 w = xa > xa0 ? *--xa : 0;
<a name="l01167"></a>01167 k -= Ebits + 16;
<a name="l01168"></a>01168 d0 = Exp_1 | y << k + 16 | z << k | w >> 16 - k;
<a name="l01169"></a>01169 y = xa > xa0 ? *--xa : 0;
<a name="l01170"></a>01170 d1 = w << k + 16 | y << k;
<a name="l01171"></a>01171 <span class="preprocessor">#endif</span>
<a name="l01172"></a>01172 <span class="preprocessor"></span> ret_d:
<a name="l01173"></a>01173 <span class="preprocessor">#ifdef VAX</span>
<a name="l01174"></a>01174 <span class="preprocessor"></span> word0(d) = d0 >> 16 | d0 << 16;
<a name="l01175"></a>01175 word1(d) = d1 >> 16 | d1 << 16;
<a name="l01176"></a>01176 <span class="preprocessor">#else</span>
<a name="l01177"></a>01177 <span class="preprocessor"></span><span class="preprocessor">#undef d0</span>
<a name="l01178"></a>01178 <span class="preprocessor"></span><span class="preprocessor">#undef d1</span>
<a name="l01179"></a>01179 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01180"></a>01180 <span class="preprocessor"></span> <span class="keywordflow">return</span> dval(d);
<a name="l01181"></a>01181 }
<a name="l01182"></a>01182
<a name="l01183"></a>01183 <span class="keyword">static</span> <a class="code" href="structBigint.html">Bigint</a> *
<a name="l01184"></a>01184 d2b
<a name="l01185"></a>01185 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l01186"></a>01186 <span class="preprocessor"></span> (d, e, bits) <span class="keywordtype">double</span> d; <span class="keywordtype">int</span> *e, *bits;
<a name="l01187"></a>01187 <span class="preprocessor">#else</span>
<a name="l01188"></a>01188 <span class="preprocessor"></span> (<span class="keywordtype">double</span> _d, <span class="keywordtype">int</span> *e, <span class="keywordtype">int</span> *bits)
<a name="l01189"></a>01189 #endif
<a name="l01190"></a>01190 {
<a name="l01191"></a>01191 <a class="code" href="structBigint.html">Bigint</a> *b;
<a name="l01192"></a>01192 <span class="keywordtype">int</span> de, k;
<a name="l01193"></a>01193 ULong *x, y, z;
<a name="l01194"></a>01194 <a class="code" href="unionU.html" title="Union to extract the bytes of a double.">U</a> d;
<a name="l01195"></a>01195 <span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l01196"></a>01196 <span class="preprocessor"></span> <span class="keywordtype">int</span> i;
<a name="l01197"></a>01197 <span class="preprocessor">#endif</span>
<a name="l01198"></a>01198 <span class="preprocessor"></span><span class="preprocessor">#ifdef VAX</span>
<a name="l01199"></a>01199 <span class="preprocessor"></span> ULong d0, d1;
<a name="l01200"></a>01200 d0 = word0(d) >> 16 | word0(d) << 16;
<a name="l01201"></a>01201 d1 = word1(d) >> 16 | word1(d) << 16;
<a name="l01202"></a>01202 <span class="preprocessor">#else</span>
<a name="l01203"></a>01203 <span class="preprocessor"></span><span class="preprocessor">#define d0 word0(d)</span>
<a name="l01204"></a>01204 <span class="preprocessor"></span><span class="preprocessor">#define d1 word1(d)</span>
<a name="l01205"></a>01205 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01206"></a>01206 <span class="preprocessor"></span> dval(d) = _d;
<a name="l01207"></a>01207
<a name="l01208"></a>01208 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l01209"></a>01209 <span class="preprocessor"></span> b = Balloc(1);
<a name="l01210"></a>01210 <span class="preprocessor">#else</span>
<a name="l01211"></a>01211 <span class="preprocessor"></span> b = Balloc(2);
<a name="l01212"></a>01212 <span class="preprocessor">#endif</span>
<a name="l01213"></a>01213 <span class="preprocessor"></span> x = b->x;
<a name="l01214"></a>01214
<a name="l01215"></a>01215 z = d0 & Frac_mask;
<a name="l01216"></a>01216 d0 &= 0x7fffffff; <span class="comment">/* clear sign bit, which we ignore */</span>
<a name="l01217"></a>01217 <span class="preprocessor">#ifdef Sudden_Underflow</span>
<a name="l01218"></a>01218 <span class="preprocessor"></span> de = (int)(d0 >> Exp_shift);
<a name="l01219"></a>01219 <span class="preprocessor">#ifndef IBM</span>
<a name="l01220"></a>01220 <span class="preprocessor"></span> z |= Exp_msk11;
<a name="l01221"></a>01221 <span class="preprocessor">#endif</span>
<a name="l01222"></a>01222 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l01223"></a>01223 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((de = (<span class="keywordtype">int</span>)(d0 >> Exp_shift)))
<a name="l01224"></a>01224 z |= Exp_msk1;
<a name="l01225"></a>01225 <span class="preprocessor">#endif</span>
<a name="l01226"></a>01226 <span class="preprocessor"></span><span class="preprocessor">#ifdef Pack_32</span>
<a name="l01227"></a>01227 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((y = d1)) {
<a name="l01228"></a>01228 <span class="keywordflow">if</span> ((k = lo0bits(&y))) {
<a name="l01229"></a>01229 x[0] = y | z << (32 - k);
<a name="l01230"></a>01230 z >>= k;
<a name="l01231"></a>01231 }
<a name="l01232"></a>01232 <span class="keywordflow">else</span>
<a name="l01233"></a>01233 x[0] = y;
<a name="l01234"></a>01234 <span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l01235"></a>01235 <span class="preprocessor"></span> i =
<a name="l01236"></a>01236 <span class="preprocessor">#endif</span>
<a name="l01237"></a>01237 <span class="preprocessor"></span> b->wds = (x[1] = z) ? 2 : 1;
<a name="l01238"></a>01238 }
<a name="l01239"></a>01239 <span class="keywordflow">else</span> {
<a name="l01240"></a>01240 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l01241"></a>01241 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!z)
<a name="l01242"></a>01242 Bug(<span class="stringliteral">"Zero passed to d2b"</span>);
<a name="l01243"></a>01243 <span class="preprocessor">#endif</span>
<a name="l01244"></a>01244 <span class="preprocessor"></span> k = lo0bits(&z);
<a name="l01245"></a>01245 x[0] = z;
<a name="l01246"></a>01246 <span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l01247"></a>01247 <span class="preprocessor"></span> i =
<a name="l01248"></a>01248 <span class="preprocessor">#endif</span>
<a name="l01249"></a>01249 <span class="preprocessor"></span> b->wds = 1;
<a name="l01250"></a>01250 k += 32;
<a name="l01251"></a>01251 }
<a name="l01252"></a>01252 <span class="preprocessor">#else</span>
<a name="l01253"></a>01253 <span class="preprocessor"></span> <span class="keywordflow">if</span> (y = d1) {
<a name="l01254"></a>01254 <span class="keywordflow">if</span> (k = lo0bits(&y))
<a name="l01255"></a>01255 <span class="keywordflow">if</span> (k >= 16) {
<a name="l01256"></a>01256 x[0] = y | z << 32 - k & 0xffff;
<a name="l01257"></a>01257 x[1] = z >> k - 16 & 0xffff;
<a name="l01258"></a>01258 x[2] = z >> k;
<a name="l01259"></a>01259 i = 2;
<a name="l01260"></a>01260 }
<a name="l01261"></a>01261 <span class="keywordflow">else</span> {
<a name="l01262"></a>01262 x[0] = y & 0xffff;
<a name="l01263"></a>01263 x[1] = y >> 16 | z << 16 - k & 0xffff;
<a name="l01264"></a>01264 x[2] = z >> k & 0xffff;
<a name="l01265"></a>01265 x[3] = z >> k+16;
<a name="l01266"></a>01266 i = 3;
<a name="l01267"></a>01267 }
<a name="l01268"></a>01268 <span class="keywordflow">else</span> {
<a name="l01269"></a>01269 x[0] = y & 0xffff;
<a name="l01270"></a>01270 x[1] = y >> 16;
<a name="l01271"></a>01271 x[2] = z & 0xffff;
<a name="l01272"></a>01272 x[3] = z >> 16;
<a name="l01273"></a>01273 i = 3;
<a name="l01274"></a>01274 }
<a name="l01275"></a>01275 }
<a name="l01276"></a>01276 <span class="keywordflow">else</span> {
<a name="l01277"></a>01277 <span class="preprocessor">#ifdef DEBUG</span>
<a name="l01278"></a>01278 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!z)
<a name="l01279"></a>01279 Bug(<span class="stringliteral">"Zero passed to d2b"</span>);
<a name="l01280"></a>01280 <span class="preprocessor">#endif</span>
<a name="l01281"></a>01281 <span class="preprocessor"></span> k = lo0bits(&z);
<a name="l01282"></a>01282 <span class="keywordflow">if</span> (k >= 16) {
<a name="l01283"></a>01283 x[0] = z;
<a name="l01284"></a>01284 i = 0;
<a name="l01285"></a>01285 }
<a name="l01286"></a>01286 <span class="keywordflow">else</span> {
<a name="l01287"></a>01287 x[0] = z & 0xffff;
<a name="l01288"></a>01288 x[1] = z >> 16;
<a name="l01289"></a>01289 i = 1;
<a name="l01290"></a>01290 }
<a name="l01291"></a>01291 k += 32;
<a name="l01292"></a>01292 }
<a name="l01293"></a>01293 <span class="keywordflow">while</span>(!x[i])
<a name="l01294"></a>01294 --i;
<a name="l01295"></a>01295 b->wds = i + 1;
<a name="l01296"></a>01296 <span class="preprocessor">#endif</span>
<a name="l01297"></a>01297 <span class="preprocessor"></span><span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l01298"></a>01298 <span class="preprocessor"></span> <span class="keywordflow">if</span> (de) {
<a name="l01299"></a>01299 <span class="preprocessor">#endif</span>
<a name="l01300"></a>01300 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
<a name="l01301"></a>01301 <span class="preprocessor"></span> *e = (de - Bias - (P-1) << 2) + k;
<a name="l01302"></a>01302 *bits = 4*P + 8 - k - hi0bits(word0(d) & Frac_mask);
<a name="l01303"></a>01303 <span class="preprocessor">#else</span>
<a name="l01304"></a>01304 <span class="preprocessor"></span> *e = de - Bias - (P-1) + k;
<a name="l01305"></a>01305 *bits = P - k;
<a name="l01306"></a>01306 <span class="preprocessor">#endif</span>
<a name="l01307"></a>01307 <span class="preprocessor"></span><span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l01308"></a>01308 <span class="preprocessor"></span> }
<a name="l01309"></a>01309 <span class="keywordflow">else</span> {
<a name="l01310"></a>01310 *e = de - Bias - (P-1) + 1 + k;
<a name="l01311"></a>01311 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l01312"></a>01312 <span class="preprocessor"></span> *bits = 32*i - hi0bits(x[i-1]);
<a name="l01313"></a>01313 <span class="preprocessor">#else</span>
<a name="l01314"></a>01314 <span class="preprocessor"></span> *bits = (i+2)*16 - hi0bits(x[i]);
<a name="l01315"></a>01315 <span class="preprocessor">#endif</span>
<a name="l01316"></a>01316 <span class="preprocessor"></span> }
<a name="l01317"></a>01317 <span class="preprocessor">#endif</span>
<a name="l01318"></a>01318 <span class="preprocessor"></span> <span class="keywordflow">return</span> b;
<a name="l01319"></a>01319 }
<a name="l01320"></a>01320 <span class="preprocessor">#undef d0</span>
<a name="l01321"></a>01321 <span class="preprocessor"></span><span class="preprocessor">#undef d1</span>
<a name="l01322"></a>01322 <span class="preprocessor"></span>
<a name="l01323"></a>01323 <span class="keyword">static</span> <span class="keywordtype">double</span>
<a name="l01324"></a>01324 ratio
<a name="l01325"></a>01325 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l01326"></a>01326 <span class="preprocessor"></span> (a, b) <a class="code" href="structBigint.html">Bigint</a> *a, *b;
<a name="l01327"></a>01327 <span class="preprocessor">#else</span>
<a name="l01328"></a>01328 <span class="preprocessor"></span> (<a class="code" href="structBigint.html">Bigint</a> *a, <a class="code" href="structBigint.html">Bigint</a> *b)
<a name="l01329"></a>01329 #endif
<a name="l01330"></a>01330 {
<a name="l01331"></a>01331 <a class="code" href="unionU.html" title="Union to extract the bytes of a double.">U</a> da, db;
<a name="l01332"></a>01332 <span class="keywordtype">int</span> k, ka, kb;
<a name="l01333"></a>01333
<a name="l01334"></a>01334 dval(da) = b2d(a, &ka);
<a name="l01335"></a>01335 dval(db) = b2d(b, &kb);
<a name="l01336"></a>01336 <span class="preprocessor">#ifdef Pack_32</span>
<a name="l01337"></a>01337 <span class="preprocessor"></span> k = ka - kb + 32*(a->wds - b->wds);
<a name="l01338"></a>01338 <span class="preprocessor">#else</span>
<a name="l01339"></a>01339 <span class="preprocessor"></span> k = ka - kb + 16*(a->wds - b->wds);
<a name="l01340"></a>01340 <span class="preprocessor">#endif</span>
<a name="l01341"></a>01341 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
<a name="l01342"></a>01342 <span class="preprocessor"></span> <span class="keywordflow">if</span> (k > 0) {
<a name="l01343"></a>01343 word0(da) += (k >> 2)*Exp_msk1;
<a name="l01344"></a>01344 <span class="keywordflow">if</span> (k &= 3)
<a name="l01345"></a>01345 dval(da) *= 1 << k;
<a name="l01346"></a>01346 }
<a name="l01347"></a>01347 <span class="keywordflow">else</span> {
<a name="l01348"></a>01348 k = -k;
<a name="l01349"></a>01349 word0(db) += (k >> 2)*Exp_msk1;
<a name="l01350"></a>01350 <span class="keywordflow">if</span> (k &= 3)
<a name="l01351"></a>01351 dval(db) *= 1 << k;
<a name="l01352"></a>01352 }
<a name="l01353"></a>01353 <span class="preprocessor">#else</span>
<a name="l01354"></a>01354 <span class="preprocessor"></span> <span class="keywordflow">if</span> (k > 0)
<a name="l01355"></a>01355 word0(da) += k*Exp_msk1;
<a name="l01356"></a>01356 <span class="keywordflow">else</span> {
<a name="l01357"></a>01357 k = -k;
<a name="l01358"></a>01358 word0(db) += k*Exp_msk1;
<a name="l01359"></a>01359 }
<a name="l01360"></a>01360 <span class="preprocessor">#endif</span>
<a name="l01361"></a>01361 <span class="preprocessor"></span> <span class="keywordflow">return</span> dval(da) / dval(db);
<a name="l01362"></a>01362 }
<a name="l01363"></a>01363
<a name="l01364"></a>01364 <span class="keyword">static</span> CONST <span class="keywordtype">double</span>
<a name="l01365"></a>01365 tens[] = {
<a name="l01366"></a>01366 1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9,
<a name="l01367"></a>01367 1e10, 1e11, 1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19,
<a name="l01368"></a>01368 1e20, 1e21, 1e22
<a name="l01369"></a>01369 <span class="preprocessor">#ifdef VAX</span>
<a name="l01370"></a>01370 <span class="preprocessor"></span> , 1e23, 1e24
<a name="l01371"></a>01371 <span class="preprocessor">#endif</span>
<a name="l01372"></a>01372 <span class="preprocessor"></span> };
<a name="l01373"></a>01373
<a name="l01374"></a>01374 <span class="keyword">static</span> CONST <span class="keywordtype">double</span>
<a name="l01375"></a>01375 <span class="preprocessor">#ifdef IEEE_Arith</span>
<a name="l01376"></a>01376 <span class="preprocessor"></span>bigtens[] = { 1e16, 1e32, 1e64, 1e128, 1e256 };
<a name="l01377"></a>01377 <span class="keyword">static</span> CONST <span class="keywordtype">double</span> tinytens[] = { 1e-16, 1e-32, 1e-64, 1e-128,
<a name="l01378"></a>01378 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l01379"></a>01379 <span class="preprocessor"></span> 9007199254740992.*9007199254740992.e-256
<a name="l01380"></a>01380 <span class="comment">/* = 2^106 * 1e-53 */</span>
<a name="l01381"></a>01381 <span class="preprocessor">#else</span>
<a name="l01382"></a>01382 <span class="preprocessor"></span> 1e-256
<a name="l01383"></a>01383 <span class="preprocessor">#endif</span>
<a name="l01384"></a>01384 <span class="preprocessor"></span> };
<a name="l01385"></a>01385 <span class="comment">/* The factor of 2^53 in tinytens[4] helps us avoid setting the underflow */</span>
<a name="l01386"></a>01386 <span class="comment">/* flag unnecessarily. It leads to a song and dance at the end of strtod. */</span>
<a name="l01387"></a>01387 <span class="preprocessor">#define Scale_Bit 0x10</span>
<a name="l01388"></a>01388 <span class="preprocessor"></span><span class="preprocessor">#define n_bigtens 5</span>
<a name="l01389"></a>01389 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l01390"></a>01390 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
<a name="l01391"></a>01391 <span class="preprocessor"></span>bigtens[] = { 1e16, 1e32, 1e64 };
<a name="l01392"></a>01392 <span class="keyword">static</span> CONST <span class="keywordtype">double</span> tinytens[] = { 1e-16, 1e-32, 1e-64 };
<a name="l01393"></a>01393 <span class="preprocessor">#define n_bigtens 3</span>
<a name="l01394"></a>01394 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l01395"></a>01395 <span class="preprocessor"></span>bigtens[] = { 1e16, 1e32 };
<a name="l01396"></a>01396 <span class="keyword">static</span> CONST <span class="keywordtype">double</span> tinytens[] = { 1e-16, 1e-32 };
<a name="l01397"></a>01397 <span class="preprocessor">#define n_bigtens 2</span>
<a name="l01398"></a>01398 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01399"></a>01399 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01400"></a>01400 <span class="preprocessor"></span>
<a name="l01401"></a>01401 <span class="preprocessor">#ifdef INFNAN_CHECK</span>
<a name="l01402"></a>01402 <span class="preprocessor"></span>
<a name="l01403"></a>01403 <span class="preprocessor">#ifndef NAN_WORD0</span>
<a name="l01404"></a>01404 <span class="preprocessor"></span><span class="preprocessor">#define NAN_WORD0 0x7ff80000</span>
<a name="l01405"></a>01405 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01406"></a>01406 <span class="preprocessor"></span>
<a name="l01407"></a>01407 <span class="preprocessor">#ifndef NAN_WORD1</span>
<a name="l01408"></a>01408 <span class="preprocessor"></span><span class="preprocessor">#define NAN_WORD1 0</span>
<a name="l01409"></a>01409 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l01410"></a>01410 <span class="preprocessor"></span>
<a name="l01411"></a>01411 <span class="keyword">static</span> <span class="keywordtype">int</span>
<a name="l01412"></a>01412 match
<a name="l01413"></a>01413 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l01414"></a>01414 <span class="preprocessor"></span> (sp, t) <span class="keywordtype">char</span> **sp, *t;
<a name="l01415"></a>01415 <span class="preprocessor">#else</span>
<a name="l01416"></a>01416 <span class="preprocessor"></span> (CONST <span class="keywordtype">char</span> **sp, <span class="keywordtype">char</span> *t)
<a name="l01417"></a>01417 #endif
<a name="l01418"></a>01418 {
<a name="l01419"></a>01419 <span class="keywordtype">int</span> c, d;
<a name="l01420"></a>01420 CONST <span class="keywordtype">char</span> *s = *sp;
<a name="l01421"></a>01421
<a name="l01422"></a>01422 <span class="keywordflow">while</span>((d = *t++)) {
<a name="l01423"></a>01423 <span class="keywordflow">if</span> ((c = *++s) >= <span class="charliteral">'A'</span> && c <= <span class="charliteral">'Z'</span>)
<a name="l01424"></a>01424 c += <span class="charliteral">'a'</span> - <span class="charliteral">'A'</span>;
<a name="l01425"></a>01425 <span class="keywordflow">if</span> (c != d)
<a name="l01426"></a>01426 <span class="keywordflow">return</span> 0;
<a name="l01427"></a>01427 }
<a name="l01428"></a>01428 *sp = s + 1;
<a name="l01429"></a>01429 <span class="keywordflow">return</span> 1;
<a name="l01430"></a>01430 }
<a name="l01431"></a>01431
<a name="l01432"></a>01432 <span class="preprocessor">#ifndef No_Hex_NaN</span>
<a name="l01433"></a>01433 <span class="preprocessor"></span> <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l01434"></a>01434 hexnan
<a name="l01435"></a>01435 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l01436"></a>01436 <span class="preprocessor"></span> (rvp, sp) <span class="keywordtype">double</span> *rvp; CONST <span class="keywordtype">char</span> **sp;
<a name="l01437"></a>01437 <span class="preprocessor">#else</span>
<a name="l01438"></a>01438 <span class="preprocessor"></span> (<a class="code" href="unionU.html" title="Union to extract the bytes of a double.">U</a> *rvp, CONST <span class="keywordtype">char</span> **sp)
<a name="l01439"></a>01439 #endif
<a name="l01440"></a>01440 {
<a name="l01441"></a>01441 ULong c, x[2];
<a name="l01442"></a>01442 CONST <span class="keywordtype">char</span> *s;
<a name="l01443"></a>01443 <span class="keywordtype">int</span> havedig, udx0, xshift;
<a name="l01444"></a>01444
<a name="l01445"></a>01445 x[0] = x[1] = 0;
<a name="l01446"></a>01446 havedig = xshift = 0;
<a name="l01447"></a>01447 udx0 = 1;
<a name="l01448"></a>01448 s = *sp;
<a name="l01449"></a>01449 <span class="comment">/* allow optional initial 0x or 0X */</span>
<a name="l01450"></a>01450 <span class="keywordflow">while</span>((c = *(CONST <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>*)(s+1)) && c <= <span class="charliteral">' '</span>)
<a name="l01451"></a>01451 ++s;
<a name="l01452"></a>01452 <span class="keywordflow">if</span> (s[1] == <span class="charliteral">'0'</span> && (s[2] == <span class="charliteral">'x'</span> || s[2] == <span class="charliteral">'X'</span>))
<a name="l01453"></a>01453 s += 2;
<a name="l01454"></a>01454 <span class="keywordflow">while</span>((c = *(CONST <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>*)++s)) {
<a name="l01455"></a>01455 <span class="keywordflow">if</span> (c >= <span class="charliteral">'0'</span> && c <= <span class="charliteral">'9'</span>)
<a name="l01456"></a>01456 c -= <span class="charliteral">'0'</span>;
<a name="l01457"></a>01457 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c >= <span class="charliteral">'a'</span> && c <= <span class="charliteral">'f'</span>)
<a name="l01458"></a>01458 c += 10 - <span class="charliteral">'a'</span>;
<a name="l01459"></a>01459 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c >= <span class="charliteral">'A'</span> && c <= <span class="charliteral">'F'</span>)
<a name="l01460"></a>01460 c += 10 - <span class="charliteral">'A'</span>;
<a name="l01461"></a>01461 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c <= <span class="charliteral">' '</span>) {
<a name="l01462"></a>01462 <span class="keywordflow">if</span> (udx0 && havedig) {
<a name="l01463"></a>01463 udx0 = 0;
<a name="l01464"></a>01464 xshift = 1;
<a name="l01465"></a>01465 }
<a name="l01466"></a>01466 <span class="keywordflow">continue</span>;
<a name="l01467"></a>01467 }
<a name="l01468"></a>01468 <span class="preprocessor">#ifdef GDTOA_NON_PEDANTIC_NANCHECK</span>
<a name="l01469"></a>01469 <span class="preprocessor"></span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="comment">/*(*/</span> c == <span class="charliteral">')'</span> && havedig) {
<a name="l01470"></a>01470 *sp = s + 1;
<a name="l01471"></a>01471 <span class="keywordflow">break</span>;
<a name="l01472"></a>01472 }
<a name="l01473"></a>01473 <span class="keywordflow">else</span>
<a name="l01474"></a>01474 <span class="keywordflow">return</span>; <span class="comment">/* invalid form: don't change *sp */</span>
<a name="l01475"></a>01475 <span class="preprocessor">#else</span>
<a name="l01476"></a>01476 <span class="preprocessor"></span> <span class="keywordflow">else</span> {
<a name="l01477"></a>01477 <span class="keywordflow">do</span> {
<a name="l01478"></a>01478 <span class="keywordflow">if</span> (<span class="comment">/*(*/</span> c == <span class="charliteral">')'</span>) {
<a name="l01479"></a>01479 *sp = s + 1;
<a name="l01480"></a>01480 <span class="keywordflow">break</span>;
<a name="l01481"></a>01481 }
<a name="l01482"></a>01482 } <span class="keywordflow">while</span>((c = *++s));
<a name="l01483"></a>01483 <span class="keywordflow">break</span>;
<a name="l01484"></a>01484 }
<a name="l01485"></a>01485 <span class="preprocessor">#endif</span>
<a name="l01486"></a>01486 <span class="preprocessor"></span> havedig = 1;
<a name="l01487"></a>01487 <span class="keywordflow">if</span> (xshift) {
<a name="l01488"></a>01488 xshift = 0;
<a name="l01489"></a>01489 x[0] = x[1];
<a name="l01490"></a>01490 x[1] = 0;
<a name="l01491"></a>01491 }
<a name="l01492"></a>01492 <span class="keywordflow">if</span> (udx0)
<a name="l01493"></a>01493 x[0] = (x[0] << 4) | (x[1] >> 28);
<a name="l01494"></a>01494 x[1] = (x[1] << 4) | c;
<a name="l01495"></a>01495 }
<a name="l01496"></a>01496 <span class="keywordflow">if</span> ((x[0] &= 0xfffff) || x[1]) {
<a name="l01497"></a>01497 word0(*rvp) = Exp_mask | x[0];
<a name="l01498"></a>01498 word1(*rvp) = x[1];
<a name="l01499"></a>01499 }
<a name="l01500"></a>01500 }
<a name="l01501"></a>01501 <span class="preprocessor">#endif </span><span class="comment">/*No_Hex_NaN*/</span>
<a name="l01502"></a>01502 <span class="preprocessor">#endif </span><span class="comment">/* INFNAN_CHECK */</span>
<a name="l01503"></a>01503
<a name="l01504"></a>01504 <span class="keywordtype">double</span>
<a name="l01505"></a>01505 sb_strtod
<a name="l01506"></a>01506 <span class="preprocessor">#ifdef KR_headers</span>
<a name="l01507"></a>01507 <span class="preprocessor"></span> (s00, se) CONST <span class="keywordtype">char</span> *s00; <span class="keywordtype">char</span> **se;
<a name="l01508"></a>01508 <span class="preprocessor">#else</span>
<a name="l01509"></a>01509 <span class="preprocessor"></span> (CONST <span class="keywordtype">char</span> *s00, <span class="keywordtype">char</span> **se)
<a name="l01510"></a>01510 #endif
<a name="l01511"></a>01511 {
<a name="l01512"></a>01512 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l01513"></a>01513 <span class="preprocessor"></span> <span class="keywordtype">int</span> scale;
<a name="l01514"></a>01514 <span class="preprocessor">#endif</span>
<a name="l01515"></a>01515 <span class="preprocessor"></span> <span class="keywordtype">int</span> bb2, bb5, bbe, bd2, bd5, bbbits, bs2, c, dsign,
<a name="l01516"></a>01516 e, e1, esign, i, j, k, nd, nd0, nf, nz, nz0, sign;
<a name="l01517"></a>01517 CONST <span class="keywordtype">char</span> *s, *s0, *s1;
<a name="l01518"></a>01518 <span class="keywordtype">double</span> aadj, adj;
<a name="l01519"></a>01519 <a class="code" href="unionU.html" title="Union to extract the bytes of a double.">U</a> rv, rv0, aadj1;
<a name="l01520"></a>01520 Long L;
<a name="l01521"></a>01521 ULong y, z;
<a name="l01522"></a>01522 <a class="code" href="structBigint.html">Bigint</a> *bb, *bb1, *bd, *bd0, *bs, *delta;
<a name="l01523"></a>01523 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l01524"></a>01524 <span class="preprocessor"></span> <span class="keywordtype">int</span> inexact, oldinexact;
<a name="l01525"></a>01525 <span class="preprocessor">#endif</span>
<a name="l01526"></a>01526 <span class="preprocessor"></span><span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l01527"></a>01527 <span class="preprocessor"></span> <span class="keywordtype">int</span> rounding;
<a name="l01528"></a>01528 <span class="preprocessor">#endif</span>
<a name="l01529"></a>01529 <span class="preprocessor"></span><span class="preprocessor">#ifdef USE_LOCALE</span>
<a name="l01530"></a>01530 <span class="preprocessor"></span> CONST <span class="keywordtype">char</span> *s2;
<a name="l01531"></a>01531 <span class="preprocessor">#endif</span>
<a name="l01532"></a>01532 <span class="preprocessor"></span>
<a name="l01533"></a>01533 sign = nz0 = nz = 0;
<a name="l01534"></a>01534 dval(rv) = 0.;
<a name="l01535"></a>01535 <span class="keywordflow">for</span>(s = s00;;s++) <span class="keywordflow">switch</span>(*s) {
<a name="l01536"></a>01536 <span class="keywordflow">case</span> <span class="charliteral">'-'</span>:
<a name="l01537"></a>01537 sign = 1;
<a name="l01538"></a>01538 <span class="comment">/* no break */</span>
<a name="l01539"></a>01539 <span class="keywordflow">case</span> <span class="charliteral">'+'</span>:
<a name="l01540"></a>01540 <span class="keywordflow">if</span> (*++s)
<a name="l01541"></a>01541 <span class="keywordflow">goto</span> break2;
<a name="l01542"></a>01542 <span class="comment">/* no break */</span>
<a name="l01543"></a>01543 <span class="keywordflow">case</span> 0:
<a name="l01544"></a>01544 <span class="keywordflow">goto</span> ret0;
<a name="l01545"></a>01545 <span class="keywordflow">case</span> <span class="charliteral">'\t'</span>:
<a name="l01546"></a>01546 <span class="keywordflow">case</span> <span class="charliteral">'\n'</span>:
<a name="l01547"></a>01547 <span class="keywordflow">case</span> <span class="charliteral">'\v'</span>:
<a name="l01548"></a>01548 <span class="keywordflow">case</span> <span class="charliteral">'\f'</span>:
<a name="l01549"></a>01549 <span class="keywordflow">case</span> <span class="charliteral">'\r'</span>:
<a name="l01550"></a>01550 <span class="keywordflow">case</span> <span class="charliteral">' '</span>:
<a name="l01551"></a>01551 <span class="keywordflow">continue</span>;
<a name="l01552"></a>01552 <span class="keywordflow">default</span>:
<a name="l01553"></a>01553 <span class="keywordflow">goto</span> break2;
<a name="l01554"></a>01554 }
<a name="l01555"></a>01555 break2:
<a name="l01556"></a>01556 <span class="keywordflow">if</span> (*s == <span class="charliteral">'0'</span>) {
<a name="l01557"></a>01557 nz0 = 1;
<a name="l01558"></a>01558 <span class="keywordflow">while</span>(*++s == <span class="charliteral">'0'</span>) ;
<a name="l01559"></a>01559 <span class="keywordflow">if</span> (!*s)
<a name="l01560"></a>01560 <span class="keywordflow">goto</span> ret;
<a name="l01561"></a>01561 }
<a name="l01562"></a>01562 s0 = s;
<a name="l01563"></a>01563 y = z = 0;
<a name="l01564"></a>01564 <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="l01565"></a>01565 <span class="keywordflow">if</span> (nd < 9)
<a name="l01566"></a>01566 y = 10*y + c - <span class="charliteral">'0'</span>;
<a name="l01567"></a>01567 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (nd < 16)
<a name="l01568"></a>01568 z = 10*z + c - <span class="charliteral">'0'</span>;
<a name="l01569"></a>01569 nd0 = nd;
<a name="l01570"></a>01570 <span class="preprocessor">#ifdef USE_LOCALE</span>
<a name="l01571"></a>01571 <span class="preprocessor"></span> s1 = localeconv()->decimal_point;
<a name="l01572"></a>01572 <span class="keywordflow">if</span> (c == *s1) {
<a name="l01573"></a>01573 c = <span class="charliteral">'.'</span>;
<a name="l01574"></a>01574 <span class="keywordflow">if</span> (*++s1) {
<a name="l01575"></a>01575 s2 = s;
<a name="l01576"></a>01576 <span class="keywordflow">for</span>(;;) {
<a name="l01577"></a>01577 <span class="keywordflow">if</span> (*++s2 != *s1) {
<a name="l01578"></a>01578 c = 0;
<a name="l01579"></a>01579 <span class="keywordflow">break</span>;
<a name="l01580"></a>01580 }
<a name="l01581"></a>01581 <span class="keywordflow">if</span> (!*++s1) {
<a name="l01582"></a>01582 s = s2;
<a name="l01583"></a>01583 <span class="keywordflow">break</span>;
<a name="l01584"></a>01584 }
<a name="l01585"></a>01585 }
<a name="l01586"></a>01586 }
<a name="l01587"></a>01587 }
<a name="l01588"></a>01588 <span class="preprocessor">#endif</span>
<a name="l01589"></a>01589 <span class="preprocessor"></span> <span class="keywordflow">if</span> (c == <span class="charliteral">'.'</span>) {
<a name="l01590"></a>01590 c = *++s;
<a name="l01591"></a>01591 <span class="keywordflow">if</span> (!nd) {
<a name="l01592"></a>01592 <span class="keywordflow">for</span>(; c == <span class="charliteral">'0'</span>; c = *++s)
<a name="l01593"></a>01593 nz++;
<a name="l01594"></a>01594 <span class="keywordflow">if</span> (c > <span class="charliteral">'0'</span> && c <= <span class="charliteral">'9'</span>) {
<a name="l01595"></a>01595 s0 = s;
<a name="l01596"></a>01596 nf += nz;
<a name="l01597"></a>01597 nz = 0;
<a name="l01598"></a>01598 <span class="keywordflow">goto</span> have_dig;
<a name="l01599"></a>01599 }
<a name="l01600"></a>01600 <span class="keywordflow">goto</span> dig_done;
<a name="l01601"></a>01601 }
<a name="l01602"></a>01602 <span class="keywordflow">for</span>(; c >= <span class="charliteral">'0'</span> && c <= <span class="charliteral">'9'</span>; c = *++s) {
<a name="l01603"></a>01603 have_dig:
<a name="l01604"></a>01604 nz++;
<a name="l01605"></a>01605 <span class="keywordflow">if</span> (c -= <span class="charliteral">'0'</span>) {
<a name="l01606"></a>01606 nf += nz;
<a name="l01607"></a>01607 <span class="keywordflow">for</span>(i = 1; i < nz; i++)
<a name="l01608"></a>01608 <span class="keywordflow">if</span> (nd++ < 9)
<a name="l01609"></a>01609 y *= 10;
<a name="l01610"></a>01610 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (nd <= DBL_DIG + 1)
<a name="l01611"></a>01611 z *= 10;
<a name="l01612"></a>01612 <span class="keywordflow">if</span> (nd++ < 9)
<a name="l01613"></a>01613 y = 10*y + c;
<a name="l01614"></a>01614 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (nd <= DBL_DIG + 1)
<a name="l01615"></a>01615 z = 10*z + c;
<a name="l01616"></a>01616 nz = 0;
<a name="l01617"></a>01617 }
<a name="l01618"></a>01618 }
<a name="l01619"></a>01619 }
<a name="l01620"></a>01620 dig_done:
<a name="l01621"></a>01621 e = 0;
<a name="l01622"></a>01622 <span class="keywordflow">if</span> (c == <span class="charliteral">'e'</span> || c == <span class="charliteral">'E'</span>) {
<a name="l01623"></a>01623 <span class="keywordflow">if</span> (!nd && !nz && !nz0) {
<a name="l01624"></a>01624 <span class="keywordflow">goto</span> ret0;
<a name="l01625"></a>01625 }
<a name="l01626"></a>01626 s00 = s;
<a name="l01627"></a>01627 esign = 0;
<a name="l01628"></a>01628 <span class="keywordflow">switch</span>(c = *++s) {
<a name="l01629"></a>01629 <span class="keywordflow">case</span> <span class="charliteral">'-'</span>:
<a name="l01630"></a>01630 esign = 1;
<a name="l01631"></a>01631 <span class="keywordflow">case</span> <span class="charliteral">'+'</span>:
<a name="l01632"></a>01632 c = *++s;
<a name="l01633"></a>01633 }
<a name="l01634"></a>01634 <span class="keywordflow">if</span> (c >= <span class="charliteral">'0'</span> && c <= <span class="charliteral">'9'</span>) {
<a name="l01635"></a>01635 <span class="keywordflow">while</span>(c == <span class="charliteral">'0'</span>)
<a name="l01636"></a>01636 c = *++s;
<a name="l01637"></a>01637 <span class="keywordflow">if</span> (c > <span class="charliteral">'0'</span> && c <= <span class="charliteral">'9'</span>) {
<a name="l01638"></a>01638 L = c - <span class="charliteral">'0'</span>;
<a name="l01639"></a>01639 s1 = s;
<a name="l01640"></a>01640 <span class="keywordflow">while</span>((c = *++s) >= <span class="charliteral">'0'</span> && c <= <span class="charliteral">'9'</span>)
<a name="l01641"></a>01641 L = 10*L + c - <span class="charliteral">'0'</span>;
<a name="l01642"></a>01642 <span class="keywordflow">if</span> (s - s1 > 8 || L > 19999)
<a name="l01643"></a>01643 <span class="comment">/* Avoid confusion from exponents</span>
<a name="l01644"></a>01644 <span class="comment"> * so large that e might overflow.</span>
<a name="l01645"></a>01645 <span class="comment"> */</span>
<a name="l01646"></a>01646 e = 19999; <span class="comment">/* safe for 16 bit ints */</span>
<a name="l01647"></a>01647 <span class="keywordflow">else</span>
<a name="l01648"></a>01648 e = (int)L;
<a name="l01649"></a>01649 <span class="keywordflow">if</span> (esign)
<a name="l01650"></a>01650 e = -e;
<a name="l01651"></a>01651 }
<a name="l01652"></a>01652 <span class="keywordflow">else</span>
<a name="l01653"></a>01653 e = 0;
<a name="l01654"></a>01654 }
<a name="l01655"></a>01655 <span class="keywordflow">else</span>
<a name="l01656"></a>01656 s = s00;
<a name="l01657"></a>01657 }
<a name="l01658"></a>01658 <span class="keywordflow">if</span> (!nd) {
<a name="l01659"></a>01659 <span class="keywordflow">if</span> (!nz && !nz0) {
<a name="l01660"></a>01660 <span class="preprocessor">#ifdef INFNAN_CHECK</span>
<a name="l01661"></a>01661 <span class="preprocessor"></span> <span class="comment">/* Check for Nan and Infinity */</span>
<a name="l01662"></a>01662 <span class="keywordflow">switch</span>(c) {
<a name="l01663"></a>01663 <span class="keywordflow">case</span> <span class="charliteral">'i'</span>:
<a name="l01664"></a>01664 <span class="keywordflow">case</span> <span class="charliteral">'I'</span>:
<a name="l01665"></a>01665 <span class="keywordflow">if</span> (match(&s,<span class="stringliteral">"nf"</span>)) {
<a name="l01666"></a>01666 --s;
<a name="l01667"></a>01667 <span class="keywordflow">if</span> (!match(&s,<span class="stringliteral">"inity"</span>))
<a name="l01668"></a>01668 ++s;
<a name="l01669"></a>01669 word0(rv) = 0x7ff00000;
<a name="l01670"></a>01670 word1(rv) = 0;
<a name="l01671"></a>01671 <span class="keywordflow">goto</span> ret;
<a name="l01672"></a>01672 }
<a name="l01673"></a>01673 <span class="keywordflow">break</span>;
<a name="l01674"></a>01674 <span class="keywordflow">case</span> <span class="charliteral">'n'</span>:
<a name="l01675"></a>01675 <span class="keywordflow">case</span> <span class="charliteral">'N'</span>:
<a name="l01676"></a>01676 <span class="keywordflow">if</span> (match(&s, <span class="stringliteral">"an"</span>)) {
<a name="l01677"></a>01677 word0(rv) = NAN_WORD0;
<a name="l01678"></a>01678 word1(rv) = NAN_WORD1;
<a name="l01679"></a>01679 <span class="preprocessor">#ifndef No_Hex_NaN</span>
<a name="l01680"></a>01680 <span class="preprocessor"></span> <span class="keywordflow">if</span> (*s == <span class="charliteral">'('</span>) <span class="comment">/*)*/</span>
<a name="l01681"></a>01681 hexnan(&rv, &s);
<a name="l01682"></a>01682 <span class="preprocessor">#endif</span>
<a name="l01683"></a>01683 <span class="preprocessor"></span> <span class="keywordflow">goto</span> ret;
<a name="l01684"></a>01684 }
<a name="l01685"></a>01685 }
<a name="l01686"></a>01686 <span class="preprocessor">#endif </span><span class="comment">/* INFNAN_CHECK */</span>
<a name="l01687"></a>01687 ret0:
<a name="l01688"></a>01688 s = s00;
<a name="l01689"></a>01689 sign = 0;
<a name="l01690"></a>01690 }
<a name="l01691"></a>01691 <span class="keywordflow">goto</span> ret;
<a name="l01692"></a>01692 }
<a name="l01693"></a>01693 e1 = e -= nf;
<a name="l01694"></a>01694
<a name="l01695"></a>01695 <span class="comment">/* Now we have nd0 digits, starting at s0, followed by a</span>
<a name="l01696"></a>01696 <span class="comment"> * decimal point, followed by nd-nd0 digits. The number we're</span>
<a name="l01697"></a>01697 <span class="comment"> * after is the integer represented by those digits times</span>
<a name="l01698"></a>01698 <span class="comment"> * 10**e */</span>
<a name="l01699"></a>01699
<a name="l01700"></a>01700 <span class="keywordflow">if</span> (!nd0)
<a name="l01701"></a>01701 nd0 = nd;
<a name="l01702"></a>01702 k = nd < DBL_DIG + 1 ? nd : DBL_DIG + 1;
<a name="l01703"></a>01703 dval(rv) = y;
<a name="l01704"></a>01704 <span class="keywordflow">if</span> (k > 9) {
<a name="l01705"></a>01705 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l01706"></a>01706 <span class="preprocessor"></span> <span class="keywordflow">if</span> (k > DBL_DIG)
<a name="l01707"></a>01707 oldinexact = get_inexact();
<a name="l01708"></a>01708 <span class="preprocessor">#endif</span>
<a name="l01709"></a>01709 <span class="preprocessor"></span> dval(rv) = tens[k - 9] * dval(rv) + z;
<a name="l01710"></a>01710 }
<a name="l01711"></a>01711 bd0 = 0;
<a name="l01712"></a>01712 <span class="keywordflow">if</span> (nd <= DBL_DIG
<a name="l01713"></a>01713 #ifndef RND_PRODQUOT
<a name="l01714"></a>01714 #ifndef Honor_FLT_ROUNDS
<a name="l01715"></a>01715 && Flt_Rounds == 1
<a name="l01716"></a>01716 #endif
<a name="l01717"></a>01717 #endif
<a name="l01718"></a>01718 ) {
<a name="l01719"></a>01719 <span class="keywordflow">if</span> (!e)
<a name="l01720"></a>01720 <span class="keywordflow">goto</span> ret;
<a name="l01721"></a>01721 <span class="keywordflow">if</span> (e > 0) {
<a name="l01722"></a>01722 <span class="keywordflow">if</span> (e <= Ten_pmax) {
<a name="l01723"></a>01723 <span class="preprocessor">#ifdef VAX</span>
<a name="l01724"></a>01724 <span class="preprocessor"></span> <span class="keywordflow">goto</span> vax_ovfl_check;
<a name="l01725"></a>01725 <span class="preprocessor">#else</span>
<a name="l01726"></a>01726 <span class="preprocessor"></span><span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l01727"></a>01727 <span class="preprocessor"></span> <span class="comment">/* round correctly FLT_ROUNDS = 2 or 3 */</span>
<a name="l01728"></a>01728 <span class="keywordflow">if</span> (sign) {
<a name="l01729"></a>01729 rv = -rv;
<a name="l01730"></a>01730 sign = 0;
<a name="l01731"></a>01731 }
<a name="l01732"></a>01732 <span class="preprocessor">#endif</span>
<a name="l01733"></a>01733 <span class="preprocessor"></span> <span class="comment">/* rv = */</span> rounded_product(dval(rv), tens[e]);
<a name="l01734"></a>01734 <span class="keywordflow">goto</span> ret;
<a name="l01735"></a>01735 <span class="preprocessor">#endif</span>
<a name="l01736"></a>01736 <span class="preprocessor"></span> }
<a name="l01737"></a>01737 i = DBL_DIG - nd;
<a name="l01738"></a>01738 <span class="keywordflow">if</span> (e <= Ten_pmax + i) {
<a name="l01739"></a>01739 <span class="comment">/* A fancier test would sometimes let us do</span>
<a name="l01740"></a>01740 <span class="comment"> * this for larger i values.</span>
<a name="l01741"></a>01741 <span class="comment"> */</span>
<a name="l01742"></a>01742 <span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l01743"></a>01743 <span class="preprocessor"></span> <span class="comment">/* round correctly FLT_ROUNDS = 2 or 3 */</span>
<a name="l01744"></a>01744 <span class="keywordflow">if</span> (sign) {
<a name="l01745"></a>01745 rv = -rv;
<a name="l01746"></a>01746 sign = 0;
<a name="l01747"></a>01747 }
<a name="l01748"></a>01748 <span class="preprocessor">#endif</span>
<a name="l01749"></a>01749 <span class="preprocessor"></span> e -= i;
<a name="l01750"></a>01750 dval(rv) *= tens[i];
<a name="l01751"></a>01751 <span class="preprocessor">#ifdef VAX</span>
<a name="l01752"></a>01752 <span class="preprocessor"></span> <span class="comment">/* VAX exponent range is so narrow we must</span>
<a name="l01753"></a>01753 <span class="comment"> * worry about overflow here...</span>
<a name="l01754"></a>01754 <span class="comment"> */</span>
<a name="l01755"></a>01755 vax_ovfl_check:
<a name="l01756"></a>01756 word0(rv) -= P*Exp_msk1;
<a name="l01757"></a>01757 <span class="comment">/* rv = */</span> rounded_product(dval(rv), tens[e]);
<a name="l01758"></a>01758 <span class="keywordflow">if</span> ((word0(rv) & Exp_mask)
<a name="l01759"></a>01759 > Exp_msk1*(DBL_MAX_EXP+Bias-1-P))
<a name="l01760"></a>01760 <span class="keywordflow">goto</span> ovfl;
<a name="l01761"></a>01761 word0(rv) += P*Exp_msk1;
<a name="l01762"></a>01762 <span class="preprocessor">#else</span>
<a name="l01763"></a>01763 <span class="preprocessor"></span> <span class="comment">/* rv = */</span> rounded_product(dval(rv), tens[e]);
<a name="l01764"></a>01764 <span class="preprocessor">#endif</span>
<a name="l01765"></a>01765 <span class="preprocessor"></span> <span class="keywordflow">goto</span> ret;
<a name="l01766"></a>01766 }
<a name="l01767"></a>01767 }
<a name="l01768"></a>01768 <span class="preprocessor">#ifndef Inaccurate_Divide</span>
<a name="l01769"></a>01769 <span class="preprocessor"></span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (e >= -Ten_pmax) {
<a name="l01770"></a>01770 <span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l01771"></a>01771 <span class="preprocessor"></span> <span class="comment">/* round correctly FLT_ROUNDS = 2 or 3 */</span>
<a name="l01772"></a>01772 <span class="keywordflow">if</span> (sign) {
<a name="l01773"></a>01773 rv = -rv;
<a name="l01774"></a>01774 sign = 0;
<a name="l01775"></a>01775 }
<a name="l01776"></a>01776 <span class="preprocessor">#endif</span>
<a name="l01777"></a>01777 <span class="preprocessor"></span> <span class="comment">/* rv = */</span> rounded_quotient(dval(rv), tens[-e]);
<a name="l01778"></a>01778 <span class="keywordflow">goto</span> ret;
<a name="l01779"></a>01779 }
<a name="l01780"></a>01780 <span class="preprocessor">#endif</span>
<a name="l01781"></a>01781 <span class="preprocessor"></span> }
<a name="l01782"></a>01782 e1 += nd - k;
<a name="l01783"></a>01783
<a name="l01784"></a>01784 <span class="preprocessor">#ifdef IEEE_Arith</span>
<a name="l01785"></a>01785 <span class="preprocessor"></span><span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l01786"></a>01786 <span class="preprocessor"></span> inexact = 1;
<a name="l01787"></a>01787 <span class="keywordflow">if</span> (k <= DBL_DIG)
<a name="l01788"></a>01788 oldinexact = get_inexact();
<a name="l01789"></a>01789 <span class="preprocessor">#endif</span>
<a name="l01790"></a>01790 <span class="preprocessor"></span><span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l01791"></a>01791 <span class="preprocessor"></span> scale = 0;
<a name="l01792"></a>01792 <span class="preprocessor">#endif</span>
<a name="l01793"></a>01793 <span class="preprocessor"></span><span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l01794"></a>01794 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((rounding = Flt_Rounds) >= 2) {
<a name="l01795"></a>01795 <span class="keywordflow">if</span> (sign)
<a name="l01796"></a>01796 rounding = rounding == 2 ? 0 : 2;
<a name="l01797"></a>01797 <span class="keywordflow">else</span>
<a name="l01798"></a>01798 <span class="keywordflow">if</span> (rounding != 2)
<a name="l01799"></a>01799 rounding = 0;
<a name="l01800"></a>01800 }
<a name="l01801"></a>01801 <span class="preprocessor">#endif</span>
<a name="l01802"></a>01802 <span class="preprocessor"></span><span class="preprocessor">#endif </span><span class="comment">/*IEEE_Arith*/</span>
<a name="l01803"></a>01803
<a name="l01804"></a>01804 <span class="comment">/* Get starting approximation = rv * 10**e1 */</span>
<a name="l01805"></a>01805
<a name="l01806"></a>01806 <span class="keywordflow">if</span> (e1 > 0) {
<a name="l01807"></a>01807 <span class="keywordflow">if</span> ((i = e1 & 15))
<a name="l01808"></a>01808 dval(rv) *= tens[i];
<a name="l01809"></a>01809 <span class="keywordflow">if</span> (e1 &= ~15) {
<a name="l01810"></a>01810 <span class="keywordflow">if</span> (e1 > DBL_MAX_10_EXP) {
<a name="l01811"></a>01811 ovfl:
<a name="l01812"></a>01812 <span class="preprocessor">#ifndef NO_ERRNO</span>
<a name="l01813"></a>01813 <span class="preprocessor"></span> errno = ERANGE;
<a name="l01814"></a>01814 <span class="preprocessor">#endif</span>
<a name="l01815"></a>01815 <span class="preprocessor"></span> <span class="comment">/* Can't trust HUGE_VAL */</span>
<a name="l01816"></a>01816 <span class="preprocessor">#ifdef IEEE_Arith</span>
<a name="l01817"></a>01817 <span class="preprocessor"></span><span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l01818"></a>01818 <span class="preprocessor"></span> <span class="keywordflow">switch</span>(rounding) {
<a name="l01819"></a>01819 <span class="keywordflow">case</span> 0: <span class="comment">/* toward 0 */</span>
<a name="l01820"></a>01820 <span class="keywordflow">case</span> 3: <span class="comment">/* toward -infinity */</span>
<a name="l01821"></a>01821 word0(rv) = Big0;
<a name="l01822"></a>01822 word1(rv) = Big1;
<a name="l01823"></a>01823 <span class="keywordflow">break</span>;
<a name="l01824"></a>01824 <span class="keywordflow">default</span>:
<a name="l01825"></a>01825 word0(rv) = Exp_mask;
<a name="l01826"></a>01826 word1(rv) = 0;
<a name="l01827"></a>01827 }
<a name="l01828"></a>01828 <span class="preprocessor">#else </span><span class="comment">/*Honor_FLT_ROUNDS*/</span>
<a name="l01829"></a>01829 word0(rv) = Exp_mask;
<a name="l01830"></a>01830 word1(rv) = 0;
<a name="l01831"></a>01831 <span class="preprocessor">#endif </span><span class="comment">/*Honor_FLT_ROUNDS*/</span>
<a name="l01832"></a>01832 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l01833"></a>01833 <span class="preprocessor"></span> <span class="comment">/* set overflow bit */</span>
<a name="l01834"></a>01834 dval(rv0) = 1e300;
<a name="l01835"></a>01835 dval(rv0) *= dval(rv0);
<a name="l01836"></a>01836 <span class="preprocessor">#endif</span>
<a name="l01837"></a>01837 <span class="preprocessor"></span><span class="preprocessor">#else </span><span class="comment">/*IEEE_Arith*/</span>
<a name="l01838"></a>01838 word0(rv) = Big0;
<a name="l01839"></a>01839 word1(rv) = Big1;
<a name="l01840"></a>01840 <span class="preprocessor">#endif </span><span class="comment">/*IEEE_Arith*/</span>
<a name="l01841"></a>01841 <span class="keywordflow">if</span> (bd0)
<a name="l01842"></a>01842 <span class="keywordflow">goto</span> retfree;
<a name="l01843"></a>01843 <span class="keywordflow">goto</span> ret;
<a name="l01844"></a>01844 }
<a name="l01845"></a>01845 e1 >>= 4;
<a name="l01846"></a>01846 <span class="keywordflow">for</span>(j = 0; e1 > 1; j++, e1 >>= 1)
<a name="l01847"></a>01847 <span class="keywordflow">if</span> (e1 & 1)
<a name="l01848"></a>01848 dval(rv) *= bigtens[j];
<a name="l01849"></a>01849 <span class="comment">/* The last multiplication could overflow. */</span>
<a name="l01850"></a>01850 word0(rv) -= P*Exp_msk1;
<a name="l01851"></a>01851 dval(rv) *= bigtens[j];
<a name="l01852"></a>01852 <span class="keywordflow">if</span> ((z = word0(rv) & Exp_mask)
<a name="l01853"></a>01853 > Exp_msk1*(DBL_MAX_EXP+Bias-P))
<a name="l01854"></a>01854 <span class="keywordflow">goto</span> ovfl;
<a name="l01855"></a>01855 <span class="keywordflow">if</span> (z > Exp_msk1*(DBL_MAX_EXP+Bias-1-P)) {
<a name="l01856"></a>01856 <span class="comment">/* set to largest number */</span>
<a name="l01857"></a>01857 <span class="comment">/* (Can't trust DBL_MAX) */</span>
<a name="l01858"></a>01858 word0(rv) = Big0;
<a name="l01859"></a>01859 word1(rv) = Big1;
<a name="l01860"></a>01860 }
<a name="l01861"></a>01861 <span class="keywordflow">else</span>
<a name="l01862"></a>01862 word0(rv) += P*Exp_msk1;
<a name="l01863"></a>01863 }
<a name="l01864"></a>01864 }
<a name="l01865"></a>01865 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (e1 < 0) {
<a name="l01866"></a>01866 e1 = -e1;
<a name="l01867"></a>01867 <span class="keywordflow">if</span> ((i = e1 & 15))
<a name="l01868"></a>01868 dval(rv) /= tens[i];
<a name="l01869"></a>01869 <span class="keywordflow">if</span> (e1 >>= 4) {
<a name="l01870"></a>01870 <span class="keywordflow">if</span> (e1 >= 1 << n_bigtens)
<a name="l01871"></a>01871 <span class="keywordflow">goto</span> undfl;
<a name="l01872"></a>01872 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l01873"></a>01873 <span class="preprocessor"></span> <span class="keywordflow">if</span> (e1 & Scale_Bit)
<a name="l01874"></a>01874 scale = 2*P;
<a name="l01875"></a>01875 <span class="keywordflow">for</span>(j = 0; e1 > 0; j++, e1 >>= 1)
<a name="l01876"></a>01876 <span class="keywordflow">if</span> (e1 & 1)
<a name="l01877"></a>01877 dval(rv) *= tinytens[j];
<a name="l01878"></a>01878 <span class="keywordflow">if</span> (scale && (j = 2*P + 1 - ((word0(rv) & Exp_mask)
<a name="l01879"></a>01879 >> Exp_shift)) > 0) {
<a name="l01880"></a>01880 <span class="comment">/* scaled rv is denormal; zap j low bits */</span>
<a name="l01881"></a>01881 <span class="keywordflow">if</span> (j >= 32) {
<a name="l01882"></a>01882 word1(rv) = 0;
<a name="l01883"></a>01883 <span class="keywordflow">if</span> (j >= 53)
<a name="l01884"></a>01884 word0(rv) = (P+2)*Exp_msk1;
<a name="l01885"></a>01885 <span class="keywordflow">else</span>
<a name="l01886"></a>01886 word0(rv) &= 0xffffffff << (j-32);
<a name="l01887"></a>01887 }
<a name="l01888"></a>01888 <span class="keywordflow">else</span>
<a name="l01889"></a>01889 word1(rv) &= 0xffffffff << j;
<a name="l01890"></a>01890 }
<a name="l01891"></a>01891 <span class="preprocessor">#else</span>
<a name="l01892"></a>01892 <span class="preprocessor"></span> <span class="keywordflow">for</span>(j = 0; e1 > 1; j++, e1 >>= 1)
<a name="l01893"></a>01893 <span class="keywordflow">if</span> (e1 & 1)
<a name="l01894"></a>01894 dval(rv) *= tinytens[j];
<a name="l01895"></a>01895 <span class="comment">/* The last multiplication could underflow. */</span>
<a name="l01896"></a>01896 dval(rv0) = dval(rv);
<a name="l01897"></a>01897 dval(rv) *= tinytens[j];
<a name="l01898"></a>01898 <span class="keywordflow">if</span> (!dval(rv)) {
<a name="l01899"></a>01899 dval(rv) = 2.*dval(rv0);
<a name="l01900"></a>01900 dval(rv) *= tinytens[j];
<a name="l01901"></a>01901 <span class="preprocessor">#endif</span>
<a name="l01902"></a>01902 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!dval(rv)) {
<a name="l01903"></a>01903 undfl:
<a name="l01904"></a>01904 dval(rv) = 0.;
<a name="l01905"></a>01905 <span class="preprocessor">#ifndef NO_ERRNO</span>
<a name="l01906"></a>01906 <span class="preprocessor"></span> errno = ERANGE;
<a name="l01907"></a>01907 <span class="preprocessor">#endif</span>
<a name="l01908"></a>01908 <span class="preprocessor"></span> <span class="keywordflow">if</span> (bd0)
<a name="l01909"></a>01909 <span class="keywordflow">goto</span> retfree;
<a name="l01910"></a>01910 <span class="keywordflow">goto</span> ret;
<a name="l01911"></a>01911 }
<a name="l01912"></a>01912 <span class="preprocessor">#ifndef Avoid_Underflow</span>
<a name="l01913"></a>01913 <span class="preprocessor"></span> word0(rv) = Tiny0;
<a name="l01914"></a>01914 word1(rv) = Tiny1;
<a name="l01915"></a>01915 <span class="comment">/* The refinement below will clean</span>
<a name="l01916"></a>01916 <span class="comment"> * this approximation up.</span>
<a name="l01917"></a>01917 <span class="comment"> */</span>
<a name="l01918"></a>01918 }
<a name="l01919"></a>01919 <span class="preprocessor">#endif</span>
<a name="l01920"></a>01920 <span class="preprocessor"></span> }
<a name="l01921"></a>01921 }
<a name="l01922"></a>01922
<a name="l01923"></a>01923 <span class="comment">/* Now the hard part -- adjusting rv to the correct value.*/</span>
<a name="l01924"></a>01924
<a name="l01925"></a>01925 <span class="comment">/* Put digits into bd: true value = bd * 10^e */</span>
<a name="l01926"></a>01926
<a name="l01927"></a>01927 bd0 = s2b(s0, nd0, nd, y);
<a name="l01928"></a>01928
<a name="l01929"></a>01929 <span class="keywordflow">for</span>(;;) {
<a name="l01930"></a>01930 bd = Balloc(bd0->k);
<a name="l01931"></a>01931 Bcopy(bd, bd0);
<a name="l01932"></a>01932 bb = d2b(dval(rv), &bbe, &bbbits); <span class="comment">/* rv = bb * 2^bbe */</span>
<a name="l01933"></a>01933 bs = i2b(1);
<a name="l01934"></a>01934
<a name="l01935"></a>01935 <span class="keywordflow">if</span> (e >= 0) {
<a name="l01936"></a>01936 bb2 = bb5 = 0;
<a name="l01937"></a>01937 bd2 = bd5 = e;
<a name="l01938"></a>01938 }
<a name="l01939"></a>01939 <span class="keywordflow">else</span> {
<a name="l01940"></a>01940 bb2 = bb5 = -e;
<a name="l01941"></a>01941 bd2 = bd5 = 0;
<a name="l01942"></a>01942 }
<a name="l01943"></a>01943 <span class="keywordflow">if</span> (bbe >= 0)
<a name="l01944"></a>01944 bb2 += bbe;
<a name="l01945"></a>01945 <span class="keywordflow">else</span>
<a name="l01946"></a>01946 bd2 -= bbe;
<a name="l01947"></a>01947 bs2 = bb2;
<a name="l01948"></a>01948 <span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l01949"></a>01949 <span class="preprocessor"></span> <span class="keywordflow">if</span> (rounding != 1)
<a name="l01950"></a>01950 bs2++;
<a name="l01951"></a>01951 <span class="preprocessor">#endif</span>
<a name="l01952"></a>01952 <span class="preprocessor"></span><span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l01953"></a>01953 <span class="preprocessor"></span> j = bbe - scale;
<a name="l01954"></a>01954 i = j + bbbits - 1; <span class="comment">/* logb(rv) */</span>
<a name="l01955"></a>01955 <span class="keywordflow">if</span> (i < Emin) <span class="comment">/* denormal */</span>
<a name="l01956"></a>01956 j += P - Emin;
<a name="l01957"></a>01957 <span class="keywordflow">else</span>
<a name="l01958"></a>01958 j = P + 1 - bbbits;
<a name="l01959"></a>01959 <span class="preprocessor">#else </span><span class="comment">/*Avoid_Underflow*/</span>
<a name="l01960"></a>01960 <span class="preprocessor">#ifdef Sudden_Underflow</span>
<a name="l01961"></a>01961 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
<a name="l01962"></a>01962 <span class="preprocessor"></span> j = 1 + 4*P - 3 - bbbits + ((bbe + bbbits - 1) & 3);
<a name="l01963"></a>01963 <span class="preprocessor">#else</span>
<a name="l01964"></a>01964 <span class="preprocessor"></span> j = P + 1 - bbbits;
<a name="l01965"></a>01965 <span class="preprocessor">#endif</span>
<a name="l01966"></a>01966 <span class="preprocessor"></span><span class="preprocessor">#else </span><span class="comment">/*Sudden_Underflow*/</span>
<a name="l01967"></a>01967 j = bbe;
<a name="l01968"></a>01968 i = j + bbbits - 1; <span class="comment">/* logb(rv) */</span>
<a name="l01969"></a>01969 <span class="keywordflow">if</span> (i < Emin) <span class="comment">/* denormal */</span>
<a name="l01970"></a>01970 j += P - Emin;
<a name="l01971"></a>01971 <span class="keywordflow">else</span>
<a name="l01972"></a>01972 j = P + 1 - bbbits;
<a name="l01973"></a>01973 <span class="preprocessor">#endif </span><span class="comment">/*Sudden_Underflow*/</span>
<a name="l01974"></a>01974 <span class="preprocessor">#endif </span><span class="comment">/*Avoid_Underflow*/</span>
<a name="l01975"></a>01975 bb2 += j;
<a name="l01976"></a>01976 bd2 += j;
<a name="l01977"></a>01977 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l01978"></a>01978 <span class="preprocessor"></span> bd2 += scale;
<a name="l01979"></a>01979 <span class="preprocessor">#endif</span>
<a name="l01980"></a>01980 <span class="preprocessor"></span> i = bb2 < bd2 ? bb2 : bd2;
<a name="l01981"></a>01981 <span class="keywordflow">if</span> (i > bs2)
<a name="l01982"></a>01982 i = bs2;
<a name="l01983"></a>01983 <span class="keywordflow">if</span> (i > 0) {
<a name="l01984"></a>01984 bb2 -= i;
<a name="l01985"></a>01985 bd2 -= i;
<a name="l01986"></a>01986 bs2 -= i;
<a name="l01987"></a>01987 }
<a name="l01988"></a>01988 <span class="keywordflow">if</span> (bb5 > 0) {
<a name="l01989"></a>01989 bs = pow5mult(bs, bb5);
<a name="l01990"></a>01990 bb1 = mult(bs, bb);
<a name="l01991"></a>01991 Bfree(bb);
<a name="l01992"></a>01992 bb = bb1;
<a name="l01993"></a>01993 }
<a name="l01994"></a>01994 <span class="keywordflow">if</span> (bb2 > 0)
<a name="l01995"></a>01995 bb = lshift(bb, bb2);
<a name="l01996"></a>01996 <span class="keywordflow">if</span> (bd5 > 0)
<a name="l01997"></a>01997 bd = pow5mult(bd, bd5);
<a name="l01998"></a>01998 <span class="keywordflow">if</span> (bd2 > 0)
<a name="l01999"></a>01999 bd = lshift(bd, bd2);
<a name="l02000"></a>02000 <span class="keywordflow">if</span> (bs2 > 0)
<a name="l02001"></a>02001 bs = lshift(bs, bs2);
<a name="l02002"></a>02002 delta = diff(bb, bd);
<a name="l02003"></a>02003 dsign = delta->sign;
<a name="l02004"></a>02004 delta->sign = 0;
<a name="l02005"></a>02005 i = cmp(delta, bs);
<a name="l02006"></a>02006 <span class="preprocessor">#ifdef Honor_FLT_ROUNDS</span>
<a name="l02007"></a>02007 <span class="preprocessor"></span> <span class="keywordflow">if</span> (rounding != 1) {
<a name="l02008"></a>02008 <span class="keywordflow">if</span> (i < 0) {
<a name="l02009"></a>02009 <span class="comment">/* Error is less than an ulp */</span>
<a name="l02010"></a>02010 <span class="keywordflow">if</span> (!delta->x[0] && delta->wds <= 1) {
<a name="l02011"></a>02011 <span class="comment">/* exact */</span>
<a name="l02012"></a>02012 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l02013"></a>02013 <span class="preprocessor"></span> inexact = 0;
<a name="l02014"></a>02014 <span class="preprocessor">#endif</span>
<a name="l02015"></a>02015 <span class="preprocessor"></span> <span class="keywordflow">break</span>;
<a name="l02016"></a>02016 }
<a name="l02017"></a>02017 <span class="keywordflow">if</span> (rounding) {
<a name="l02018"></a>02018 <span class="keywordflow">if</span> (dsign) {
<a name="l02019"></a>02019 adj = 1.;
<a name="l02020"></a>02020 <span class="keywordflow">goto</span> apply_adj;
<a name="l02021"></a>02021 }
<a name="l02022"></a>02022 }
<a name="l02023"></a>02023 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!dsign) {
<a name="l02024"></a>02024 adj = -1.;
<a name="l02025"></a>02025 <span class="keywordflow">if</span> (!word1(rv)
<a name="l02026"></a>02026 && !(word0(rv) & Frac_mask)) {
<a name="l02027"></a>02027 y = word0(rv) & Exp_mask;
<a name="l02028"></a>02028 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l02029"></a>02029 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!scale || y > 2*P*Exp_msk1)
<a name="l02030"></a>02030 <span class="preprocessor">#else</span>
<a name="l02031"></a>02031 <span class="preprocessor"></span> <span class="keywordflow">if</span> (y)
<a name="l02032"></a>02032 <span class="preprocessor">#endif</span>
<a name="l02033"></a>02033 <span class="preprocessor"></span> {
<a name="l02034"></a>02034 delta = lshift(delta,Log2P);
<a name="l02035"></a>02035 <span class="keywordflow">if</span> (cmp(delta, bs) <= 0)
<a name="l02036"></a>02036 adj = -0.5;
<a name="l02037"></a>02037 }
<a name="l02038"></a>02038 }
<a name="l02039"></a>02039 apply_adj:
<a name="l02040"></a>02040 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l02041"></a>02041 <span class="preprocessor"></span> <span class="keywordflow">if</span> (scale && (y = word0(rv) & Exp_mask)
<a name="l02042"></a>02042 <= 2*P*Exp_msk1)
<a name="l02043"></a>02043 word0(adj) += (2*P+1)*Exp_msk1 - y;
<a name="l02044"></a>02044 <span class="preprocessor">#else</span>
<a name="l02045"></a>02045 <span class="preprocessor"></span><span class="preprocessor">#ifdef Sudden_Underflow</span>
<a name="l02046"></a>02046 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((word0(rv) & Exp_mask) <=
<a name="l02047"></a>02047 P*Exp_msk1) {
<a name="l02048"></a>02048 word0(rv) += P*Exp_msk1;
<a name="l02049"></a>02049 dval(rv) += adj*ulp(dval(rv));
<a name="l02050"></a>02050 word0(rv) -= P*Exp_msk1;
<a name="l02051"></a>02051 }
<a name="l02052"></a>02052 <span class="keywordflow">else</span>
<a name="l02053"></a>02053 <span class="preprocessor">#endif </span><span class="comment">/*Sudden_Underflow*/</span>
<a name="l02054"></a>02054 <span class="preprocessor">#endif </span><span class="comment">/*Avoid_Underflow*/</span>
<a name="l02055"></a>02055 dval(rv) += adj*ulp(dval(rv));
<a name="l02056"></a>02056 }
<a name="l02057"></a>02057 <span class="keywordflow">break</span>;
<a name="l02058"></a>02058 }
<a name="l02059"></a>02059 adj = ratio(delta, bs);
<a name="l02060"></a>02060 <span class="keywordflow">if</span> (adj < 1.)
<a name="l02061"></a>02061 adj = 1.;
<a name="l02062"></a>02062 <span class="keywordflow">if</span> (adj <= 0x7ffffffe) {
<a name="l02063"></a>02063 <span class="comment">/* adj = rounding ? ceil(adj) : floor(adj); */</span>
<a name="l02064"></a>02064 y = adj;
<a name="l02065"></a>02065 <span class="keywordflow">if</span> (y != adj) {
<a name="l02066"></a>02066 <span class="keywordflow">if</span> (!((rounding>>1) ^ dsign))
<a name="l02067"></a>02067 y++;
<a name="l02068"></a>02068 adj = y;
<a name="l02069"></a>02069 }
<a name="l02070"></a>02070 }
<a name="l02071"></a>02071 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l02072"></a>02072 <span class="preprocessor"></span> <span class="keywordflow">if</span> (scale && (y = word0(rv) & Exp_mask) <= 2*P*Exp_msk1)
<a name="l02073"></a>02073 word0(adj) += (2*P+1)*Exp_msk1 - y;
<a name="l02074"></a>02074 <span class="preprocessor">#else</span>
<a name="l02075"></a>02075 <span class="preprocessor"></span><span class="preprocessor">#ifdef Sudden_Underflow</span>
<a name="l02076"></a>02076 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((word0(rv) & Exp_mask) <= P*Exp_msk1) {
<a name="l02077"></a>02077 word0(rv) += P*Exp_msk1;
<a name="l02078"></a>02078 adj *= ulp(dval(rv));
<a name="l02079"></a>02079 <span class="keywordflow">if</span> (dsign)
<a name="l02080"></a>02080 dval(rv) += adj;
<a name="l02081"></a>02081 <span class="keywordflow">else</span>
<a name="l02082"></a>02082 dval(rv) -= adj;
<a name="l02083"></a>02083 word0(rv) -= P*Exp_msk1;
<a name="l02084"></a>02084 <span class="keywordflow">goto</span> cont;
<a name="l02085"></a>02085 }
<a name="l02086"></a>02086 <span class="preprocessor">#endif </span><span class="comment">/*Sudden_Underflow*/</span>
<a name="l02087"></a>02087 <span class="preprocessor">#endif </span><span class="comment">/*Avoid_Underflow*/</span>
<a name="l02088"></a>02088 adj *= ulp(dval(rv));
<a name="l02089"></a>02089 <span class="keywordflow">if</span> (dsign)
<a name="l02090"></a>02090 dval(rv) += adj;
<a name="l02091"></a>02091 <span class="keywordflow">else</span>
<a name="l02092"></a>02092 dval(rv) -= adj;
<a name="l02093"></a>02093 <span class="keywordflow">goto</span> cont;
<a name="l02094"></a>02094 }
<a name="l02095"></a>02095 <span class="preprocessor">#endif </span><span class="comment">/*Honor_FLT_ROUNDS*/</span>
<a name="l02096"></a>02096
<a name="l02097"></a>02097 <span class="keywordflow">if</span> (i < 0) {
<a name="l02098"></a>02098 <span class="comment">/* Error is less than half an ulp -- check for</span>
<a name="l02099"></a>02099 <span class="comment"> * special case of mantissa a power of two.</span>
<a name="l02100"></a>02100 <span class="comment"> */</span>
<a name="l02101"></a>02101 <span class="keywordflow">if</span> (dsign || word1(rv) || word0(rv) & Bndry_mask
<a name="l02102"></a>02102 #ifdef IEEE_Arith
<a name="l02103"></a>02103 #ifdef Avoid_Underflow
<a name="l02104"></a>02104 || (word0(rv) & Exp_mask) <= (2*P+1)*Exp_msk1
<a name="l02105"></a>02105 #<span class="keywordflow">else</span>
<a name="l02106"></a>02106 || (word0(rv) & Exp_mask) <= Exp_msk1
<a name="l02107"></a>02107 #endif
<a name="l02108"></a>02108 #endif
<a name="l02109"></a>02109 ) {
<a name="l02110"></a>02110 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l02111"></a>02111 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!delta->x[0] && delta->wds <= 1)
<a name="l02112"></a>02112 inexact = 0;
<a name="l02113"></a>02113 <span class="preprocessor">#endif</span>
<a name="l02114"></a>02114 <span class="preprocessor"></span> <span class="keywordflow">break</span>;
<a name="l02115"></a>02115 }
<a name="l02116"></a>02116 <span class="keywordflow">if</span> (!delta->x[0] && delta->wds <= 1) {
<a name="l02117"></a>02117 <span class="comment">/* exact result */</span>
<a name="l02118"></a>02118 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l02119"></a>02119 <span class="preprocessor"></span> inexact = 0;
<a name="l02120"></a>02120 <span class="preprocessor">#endif</span>
<a name="l02121"></a>02121 <span class="preprocessor"></span> <span class="keywordflow">break</span>;
<a name="l02122"></a>02122 }
<a name="l02123"></a>02123 delta = lshift(delta,Log2P);
<a name="l02124"></a>02124 <span class="keywordflow">if</span> (cmp(delta, bs) > 0)
<a name="l02125"></a>02125 <span class="keywordflow">goto</span> drop_down;
<a name="l02126"></a>02126 <span class="keywordflow">break</span>;
<a name="l02127"></a>02127 }
<a name="l02128"></a>02128 <span class="keywordflow">if</span> (i == 0) {
<a name="l02129"></a>02129 <span class="comment">/* exactly half-way between */</span>
<a name="l02130"></a>02130 <span class="keywordflow">if</span> (dsign) {
<a name="l02131"></a>02131 <span class="keywordflow">if</span> ((word0(rv) & Bndry_mask1) == Bndry_mask1
<a name="l02132"></a>02132 && word1(rv) == (
<a name="l02133"></a>02133 #ifdef Avoid_Underflow
<a name="l02134"></a>02134 (scale && (y = word0(rv) & Exp_mask) <= 2*P*Exp_msk1)
<a name="l02135"></a>02135 ? (0xffffffff & (0xffffffff << (2*P+1-(y>>Exp_shift)))) :
<a name="l02136"></a>02136 #endif
<a name="l02137"></a>02137 0xffffffff)) {
<a name="l02138"></a>02138 <span class="comment">/*boundary case -- increment exponent*/</span>
<a name="l02139"></a>02139 word0(rv) = (word0(rv) & Exp_mask)
<a name="l02140"></a>02140 + Exp_msk1
<a name="l02141"></a>02141 #ifdef IBM
<a name="l02142"></a>02142 | Exp_msk1 >> 4
<a name="l02143"></a>02143 #endif
<a name="l02144"></a>02144 ;
<a name="l02145"></a>02145 word1(rv) = 0;
<a name="l02146"></a>02146 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l02147"></a>02147 <span class="preprocessor"></span> dsign = 0;
<a name="l02148"></a>02148 <span class="preprocessor">#endif</span>
<a name="l02149"></a>02149 <span class="preprocessor"></span> <span class="keywordflow">break</span>;
<a name="l02150"></a>02150 }
<a name="l02151"></a>02151 }
<a name="l02152"></a>02152 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!(word0(rv) & Bndry_mask) && !word1(rv)) {
<a name="l02153"></a>02153 drop_down:
<a name="l02154"></a>02154 <span class="comment">/* boundary case -- decrement exponent */</span>
<a name="l02155"></a>02155 <span class="preprocessor">#ifdef Sudden_Underflow </span><span class="comment">/*{{*/</span>
<a name="l02156"></a>02156 L = word0(rv) & Exp_mask;
<a name="l02157"></a>02157 <span class="preprocessor">#ifdef IBM</span>
<a name="l02158"></a>02158 <span class="preprocessor"></span> <span class="keywordflow">if</span> (L < Exp_msk1)
<a name="l02159"></a>02159 <span class="preprocessor">#else</span>
<a name="l02160"></a>02160 <span class="preprocessor"></span><span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l02161"></a>02161 <span class="preprocessor"></span> <span class="keywordflow">if</span> (L <= (scale ? (2*P+1)*Exp_msk1 : Exp_msk1))
<a name="l02162"></a>02162 <span class="preprocessor">#else</span>
<a name="l02163"></a>02163 <span class="preprocessor"></span> <span class="keywordflow">if</span> (L <= Exp_msk1)
<a name="l02164"></a>02164 <span class="preprocessor">#endif </span><span class="comment">/*Avoid_Underflow*/</span>
<a name="l02165"></a>02165 <span class="preprocessor">#endif </span><span class="comment">/*IBM*/</span>
<a name="l02166"></a>02166 <span class="keywordflow">goto</span> undfl;
<a name="l02167"></a>02167 L -= Exp_msk1;
<a name="l02168"></a>02168 <span class="preprocessor">#else </span><span class="comment">/*Sudden_Underflow}{*/</span>
<a name="l02169"></a>02169 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l02170"></a>02170 <span class="preprocessor"></span> <span class="keywordflow">if</span> (scale) {
<a name="l02171"></a>02171 L = word0(rv) & Exp_mask;
<a name="l02172"></a>02172 <span class="keywordflow">if</span> (L <= (2*P+1)*Exp_msk1) {
<a name="l02173"></a>02173 <span class="keywordflow">if</span> (L > (P+2)*Exp_msk1)
<a name="l02174"></a>02174 <span class="comment">/* round even ==> */</span>
<a name="l02175"></a>02175 <span class="comment">/* accept rv */</span>
<a name="l02176"></a>02176 <span class="keywordflow">break</span>;
<a name="l02177"></a>02177 <span class="comment">/* rv = smallest denormal */</span>
<a name="l02178"></a>02178 <span class="keywordflow">goto</span> undfl;
<a name="l02179"></a>02179 }
<a name="l02180"></a>02180 }
<a name="l02181"></a>02181 <span class="preprocessor">#endif </span><span class="comment">/*Avoid_Underflow*/</span>
<a name="l02182"></a>02182 L = (word0(rv) & Exp_mask) - Exp_msk1;
<a name="l02183"></a>02183 <span class="preprocessor">#endif </span><span class="comment">/*Sudden_Underflow}}*/</span>
<a name="l02184"></a>02184 word0(rv) = L | Bndry_mask1;
<a name="l02185"></a>02185 word1(rv) = 0xffffffff;
<a name="l02186"></a>02186 <span class="preprocessor">#ifdef IBM</span>
<a name="l02187"></a>02187 <span class="preprocessor"></span> <span class="keywordflow">goto</span> cont;
<a name="l02188"></a>02188 <span class="preprocessor">#else</span>
<a name="l02189"></a>02189 <span class="preprocessor"></span> <span class="keywordflow">break</span>;
<a name="l02190"></a>02190 <span class="preprocessor">#endif</span>
<a name="l02191"></a>02191 <span class="preprocessor"></span> }
<a name="l02192"></a>02192 <span class="preprocessor">#ifndef ROUND_BIASED</span>
<a name="l02193"></a>02193 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!(word1(rv) & LSB))
<a name="l02194"></a>02194 <span class="keywordflow">break</span>;
<a name="l02195"></a>02195 <span class="preprocessor">#endif</span>
<a name="l02196"></a>02196 <span class="preprocessor"></span> <span class="keywordflow">if</span> (dsign)
<a name="l02197"></a>02197 dval(rv) += ulp(dval(rv));
<a name="l02198"></a>02198 <span class="preprocessor">#ifndef ROUND_BIASED</span>
<a name="l02199"></a>02199 <span class="preprocessor"></span> <span class="keywordflow">else</span> {
<a name="l02200"></a>02200 dval(rv) -= ulp(dval(rv));
<a name="l02201"></a>02201 <span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l02202"></a>02202 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!dval(rv))
<a name="l02203"></a>02203 <span class="keywordflow">goto</span> undfl;
<a name="l02204"></a>02204 <span class="preprocessor">#endif</span>
<a name="l02205"></a>02205 <span class="preprocessor"></span> }
<a name="l02206"></a>02206 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l02207"></a>02207 <span class="preprocessor"></span> dsign = 1 - dsign;
<a name="l02208"></a>02208 <span class="preprocessor">#endif</span>
<a name="l02209"></a>02209 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l02210"></a>02210 <span class="preprocessor"></span> <span class="keywordflow">break</span>;
<a name="l02211"></a>02211 }
<a name="l02212"></a>02212 <span class="keywordflow">if</span> ((aadj = ratio(delta, bs)) <= 2.) {
<a name="l02213"></a>02213 <span class="keywordflow">if</span> (dsign)
<a name="l02214"></a>02214 aadj = dval(aadj1) = 1.;
<a name="l02215"></a>02215 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (word1(rv) || word0(rv) & Bndry_mask) {
<a name="l02216"></a>02216 <span class="preprocessor">#ifndef Sudden_Underflow</span>
<a name="l02217"></a>02217 <span class="preprocessor"></span> <span class="keywordflow">if</span> (word1(rv) == Tiny1 && !word0(rv))
<a name="l02218"></a>02218 <span class="keywordflow">goto</span> undfl;
<a name="l02219"></a>02219 <span class="preprocessor">#endif</span>
<a name="l02220"></a>02220 <span class="preprocessor"></span> aadj = 1.;
<a name="l02221"></a>02221 dval(aadj1) = -1.;
<a name="l02222"></a>02222 }
<a name="l02223"></a>02223 <span class="keywordflow">else</span> {
<a name="l02224"></a>02224 <span class="comment">/* special case -- power of FLT_RADIX to be */</span>
<a name="l02225"></a>02225 <span class="comment">/* rounded down... */</span>
<a name="l02226"></a>02226
<a name="l02227"></a>02227 <span class="keywordflow">if</span> (aadj < 2./FLT_RADIX)
<a name="l02228"></a>02228 aadj = 1./FLT_RADIX;
<a name="l02229"></a>02229 <span class="keywordflow">else</span>
<a name="l02230"></a>02230 aadj *= 0.5;
<a name="l02231"></a>02231 dval(aadj1) = -aadj;
<a name="l02232"></a>02232 }
<a name="l02233"></a>02233 }
<a name="l02234"></a>02234 <span class="keywordflow">else</span> {
<a name="l02235"></a>02235 aadj *= 0.5;
<a name="l02236"></a>02236 dval(aadj1) = dsign ? aadj : -aadj;
<a name="l02237"></a>02237 <span class="preprocessor">#ifdef Check_FLT_ROUNDS</span>
<a name="l02238"></a>02238 <span class="preprocessor"></span> <span class="keywordflow">switch</span>(Rounding) {
<a name="l02239"></a>02239 <span class="keywordflow">case</span> 2: <span class="comment">/* towards +infinity */</span>
<a name="l02240"></a>02240 dval(aadj1) -= 0.5;
<a name="l02241"></a>02241 <span class="keywordflow">break</span>;
<a name="l02242"></a>02242 <span class="keywordflow">case</span> 0: <span class="comment">/* towards 0 */</span>
<a name="l02243"></a>02243 <span class="keywordflow">case</span> 3: <span class="comment">/* towards -infinity */</span>
<a name="l02244"></a>02244 dval(aadj1) += 0.5;
<a name="l02245"></a>02245 }
<a name="l02246"></a>02246 <span class="preprocessor">#else</span>
<a name="l02247"></a>02247 <span class="preprocessor"></span> <span class="keywordflow">if</span> (Flt_Rounds == 0)
<a name="l02248"></a>02248 dval(aadj1) += 0.5;
<a name="l02249"></a>02249 <span class="preprocessor">#endif </span><span class="comment">/*Check_FLT_ROUNDS*/</span>
<a name="l02250"></a>02250 }
<a name="l02251"></a>02251 y = word0(rv) & Exp_mask;
<a name="l02252"></a>02252
<a name="l02253"></a>02253 <span class="comment">/* Check for overflow */</span>
<a name="l02254"></a>02254
<a name="l02255"></a>02255 <span class="keywordflow">if</span> (y == Exp_msk1*(DBL_MAX_EXP+Bias-1)) {
<a name="l02256"></a>02256 dval(rv0) = dval(rv);
<a name="l02257"></a>02257 word0(rv) -= P*Exp_msk1;
<a name="l02258"></a>02258 adj = dval(aadj1) * ulp(dval(rv));
<a name="l02259"></a>02259 dval(rv) += adj;
<a name="l02260"></a>02260 <span class="keywordflow">if</span> ((word0(rv) & Exp_mask) >=
<a name="l02261"></a>02261 Exp_msk1*(DBL_MAX_EXP+Bias-P)) {
<a name="l02262"></a>02262 <span class="keywordflow">if</span> (word0(rv0) == Big0 && word1(rv0) == Big1)
<a name="l02263"></a>02263 <span class="keywordflow">goto</span> ovfl;
<a name="l02264"></a>02264 word0(rv) = Big0;
<a name="l02265"></a>02265 word1(rv) = Big1;
<a name="l02266"></a>02266 <span class="keywordflow">goto</span> cont;
<a name="l02267"></a>02267 }
<a name="l02268"></a>02268 <span class="keywordflow">else</span>
<a name="l02269"></a>02269 word0(rv) += P*Exp_msk1;
<a name="l02270"></a>02270 }
<a name="l02271"></a>02271 <span class="keywordflow">else</span> {
<a name="l02272"></a>02272 <span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l02273"></a>02273 <span class="preprocessor"></span> <span class="keywordflow">if</span> (scale && y <= 2*P*Exp_msk1) {
<a name="l02274"></a>02274 <span class="keywordflow">if</span> (aadj <= 0x7fffffff) {
<a name="l02275"></a>02275 <span class="keywordflow">if</span> ((z = (uint32)aadj) <= 0)
<a name="l02276"></a>02276 z = 1;
<a name="l02277"></a>02277 aadj = z;
<a name="l02278"></a>02278 dval(aadj1) = dsign ? aadj : -aadj;
<a name="l02279"></a>02279 }
<a name="l02280"></a>02280 word0(aadj1) += (2*P+1)*Exp_msk1 - y;
<a name="l02281"></a>02281 }
<a name="l02282"></a>02282 adj = dval(aadj1) * ulp(dval(rv));
<a name="l02283"></a>02283 dval(rv) += adj;
<a name="l02284"></a>02284 <span class="preprocessor">#else</span>
<a name="l02285"></a>02285 <span class="preprocessor"></span><span class="preprocessor">#ifdef Sudden_Underflow</span>
<a name="l02286"></a>02286 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((word0(rv) & Exp_mask) <= P*Exp_msk1) {
<a name="l02287"></a>02287 dval(rv0) = dval(rv);
<a name="l02288"></a>02288 word0(rv) += P*Exp_msk1;
<a name="l02289"></a>02289 adj = aadj1 * ulp(dval(rv));
<a name="l02290"></a>02290 dval(rv) += adj;
<a name="l02291"></a>02291 <span class="preprocessor">#ifdef IBM</span>
<a name="l02292"></a>02292 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((word0(rv) & Exp_mask) < P*Exp_msk1)
<a name="l02293"></a>02293 <span class="preprocessor">#else</span>
<a name="l02294"></a>02294 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((word0(rv) & Exp_mask) <= P*Exp_msk1)
<a name="l02295"></a>02295 <span class="preprocessor">#endif</span>
<a name="l02296"></a>02296 <span class="preprocessor"></span> {
<a name="l02297"></a>02297 <span class="keywordflow">if</span> (word0(rv0) == Tiny0
<a name="l02298"></a>02298 && word1(rv0) == Tiny1)
<a name="l02299"></a>02299 <span class="keywordflow">goto</span> undfl;
<a name="l02300"></a>02300 word0(rv) = Tiny0;
<a name="l02301"></a>02301 word1(rv) = Tiny1;
<a name="l02302"></a>02302 <span class="keywordflow">goto</span> cont;
<a name="l02303"></a>02303 }
<a name="l02304"></a>02304 <span class="keywordflow">else</span>
<a name="l02305"></a>02305 word0(rv) -= P*Exp_msk1;
<a name="l02306"></a>02306 }
<a name="l02307"></a>02307 <span class="keywordflow">else</span> {
<a name="l02308"></a>02308 adj = aadj1 * ulp(dval(rv));
<a name="l02309"></a>02309 dval(rv) += adj;
<a name="l02310"></a>02310 }
<a name="l02311"></a>02311 <span class="preprocessor">#else </span><span class="comment">/*Sudden_Underflow*/</span>
<a name="l02312"></a>02312 <span class="comment">/* Compute adj so that the IEEE rounding rules will</span>
<a name="l02313"></a>02313 <span class="comment"> * correctly round rv + adj in some half-way cases.</span>
<a name="l02314"></a>02314 <span class="comment"> * If rv * ulp(rv) is denormalized (i.e.,</span>
<a name="l02315"></a>02315 <span class="comment"> * y <= (P-1)*Exp_msk1), we must adjust aadj to avoid</span>
<a name="l02316"></a>02316 <span class="comment"> * trouble from bits lost to denormalization;</span>
<a name="l02317"></a>02317 <span class="comment"> * example: 1.2e-307 .</span>
<a name="l02318"></a>02318 <span class="comment"> */</span>
<a name="l02319"></a>02319 <span class="keywordflow">if</span> (y <= (P-1)*Exp_msk1 && aadj > 1.) {
<a name="l02320"></a>02320 aadj1 = (double)(<span class="keywordtype">int</span>)(aadj + 0.5);
<a name="l02321"></a>02321 <span class="keywordflow">if</span> (!dsign)
<a name="l02322"></a>02322 aadj1 = -aadj1;
<a name="l02323"></a>02323 }
<a name="l02324"></a>02324 adj = aadj1 * ulp(dval(rv));
<a name="l02325"></a>02325 dval(rv) += adj;
<a name="l02326"></a>02326 <span class="preprocessor">#endif </span><span class="comment">/*Sudden_Underflow*/</span>
<a name="l02327"></a>02327 <span class="preprocessor">#endif </span><span class="comment">/*Avoid_Underflow*/</span>
<a name="l02328"></a>02328 }
<a name="l02329"></a>02329 z = word0(rv) & Exp_mask;
<a name="l02330"></a>02330 <span class="preprocessor">#ifndef SET_INEXACT</span>
<a name="l02331"></a>02331 <span class="preprocessor"></span><span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l02332"></a>02332 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!scale)
<a name="l02333"></a>02333 <span class="preprocessor">#endif</span>
<a name="l02334"></a>02334 <span class="preprocessor"></span> <span class="keywordflow">if</span> (y == z) {
<a name="l02335"></a>02335 <span class="comment">/* Can we stop now? */</span>
<a name="l02336"></a>02336 L = (Long)aadj;
<a name="l02337"></a>02337 aadj -= L;
<a name="l02338"></a>02338 <span class="comment">/* The tolerances below are conservative. */</span>
<a name="l02339"></a>02339 <span class="keywordflow">if</span> (dsign || word1(rv) || word0(rv) & Bndry_mask) {
<a name="l02340"></a>02340 <span class="keywordflow">if</span> (aadj < .4999999 || aadj > .5000001)
<a name="l02341"></a>02341 <span class="keywordflow">break</span>;
<a name="l02342"></a>02342 }
<a name="l02343"></a>02343 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (aadj < .4999999/FLT_RADIX)
<a name="l02344"></a>02344 <span class="keywordflow">break</span>;
<a name="l02345"></a>02345 }
<a name="l02346"></a>02346 <span class="preprocessor">#endif</span>
<a name="l02347"></a>02347 <span class="preprocessor"></span> cont:
<a name="l02348"></a>02348 Bfree(bb);
<a name="l02349"></a>02349 Bfree(bd);
<a name="l02350"></a>02350 Bfree(bs);
<a name="l02351"></a>02351 Bfree(delta);
<a name="l02352"></a>02352 }
<a name="l02353"></a>02353 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l02354"></a>02354 <span class="preprocessor"></span> <span class="keywordflow">if</span> (inexact) {
<a name="l02355"></a>02355 <span class="keywordflow">if</span> (!oldinexact) {
<a name="l02356"></a>02356 word0(rv0) = Exp_1 + (70 << Exp_shift);
<a name="l02357"></a>02357 word1(rv0) = 0;
<a name="l02358"></a>02358 dval(rv0) += 1.;
<a name="l02359"></a>02359 }
<a name="l02360"></a>02360 }
<a name="l02361"></a>02361 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!oldinexact)
<a name="l02362"></a>02362 clear_inexact();
<a name="l02363"></a>02363 <span class="preprocessor">#endif</span>
<a name="l02364"></a>02364 <span class="preprocessor"></span><span class="preprocessor">#ifdef Avoid_Underflow</span>
<a name="l02365"></a>02365 <span class="preprocessor"></span> <span class="keywordflow">if</span> (scale) {
<a name="l02366"></a>02366 word0(rv0) = Exp_1 - 2*P*Exp_msk1;
<a name="l02367"></a>02367 word1(rv0) = 0;
<a name="l02368"></a>02368 dval(rv) *= dval(rv0);
<a name="l02369"></a>02369 <span class="preprocessor">#ifndef NO_ERRNO</span>
<a name="l02370"></a>02370 <span class="preprocessor"></span> <span class="comment">/* try to avoid the bug of testing an 8087 register value */</span>
<a name="l02371"></a>02371 <span class="keywordflow">if</span> (word0(rv) == 0 && word1(rv) == 0)
<a name="l02372"></a>02372 errno = ERANGE;
<a name="l02373"></a>02373 <span class="preprocessor">#endif</span>
<a name="l02374"></a>02374 <span class="preprocessor"></span> }
<a name="l02375"></a>02375 <span class="preprocessor">#endif </span><span class="comment">/* Avoid_Underflow */</span>
<a name="l02376"></a>02376 <span class="preprocessor">#ifdef SET_INEXACT</span>
<a name="l02377"></a>02377 <span class="preprocessor"></span> <span class="keywordflow">if</span> (inexact && !(word0(rv) & Exp_mask)) {
<a name="l02378"></a>02378 <span class="comment">/* set underflow bit */</span>
<a name="l02379"></a>02379 dval(rv0) = 1e-300;
<a name="l02380"></a>02380 dval(rv0) *= dval(rv0);
<a name="l02381"></a>02381 }
<a name="l02382"></a>02382 <span class="preprocessor">#endif</span>
<a name="l02383"></a>02383 <span class="preprocessor"></span> retfree:
<a name="l02384"></a>02384 Bfree(bb);
<a name="l02385"></a>02385 Bfree(bd);
<a name="l02386"></a>02386 Bfree(bs);
<a name="l02387"></a>02387 Bfree(bd0);
<a name="l02388"></a>02388 Bfree(delta);
<a name="l02389"></a>02389 ret:
<a name="l02390"></a>02390 <span class="keywordflow">if</span> (se)
<a name="l02391"></a>02391 *se = (<span class="keywordtype">char</span> *)s;
<a name="l02392"></a>02392 <span class="keywordflow">return</span> sign ? -dval(rv) : dval(rv);
<a name="l02393"></a>02393 }
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><b>dtoa.c</b> </li>
<li class="footer">Generated on Tue Apr 19 2011 for SphinxBase by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.3 </li>
</ul>
</div>
</body>
</html>
distrib
>
Fedora
>
14
>
x86_64
>
media
>
updates
>
by-pkgid
>
0b420d0fce195cf4115dc6a3be5c2da2
>
files
>
96
