/a00977_source.html
HTML | 2001 lines | 2000 code | 0 blank | 1 comment | 0 complexity | c4bf3e180ae0be45677dc0db11e1f134 MD5 | raw file
Large files files are truncated, but you can click here to view the full file
- <!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>Contiki 2.5: cpu/stm32w108/e_stdio/src/small_mprec.c Source File</title>
- <link href="tabs.css" rel="stylesheet" type="text/css"/>
- <link href="doxygen.css" rel="stylesheet" type="text/css"/>
- </head>
- <body>
- <!-- Generated by Doxygen 1.6.1 -->
- <div class="navigation" id="top">
- <div class="tabs">
- <ul>
- <li><a href="main.html"><span>Main Page</span></a></li>
- <li><a href="pages.html"><span>Related Pages</span></a></li>
- <li><a href="modules.html"><span>Modules</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>
- <li><a href="dirs.html"><span>Directories</span></a></li>
- <li><a href="examples.html"><span>Examples</span></a></li>
- </ul>
- </div>
- <div class="tabs">
- <ul>
- <li><a href="files.html"><span>File List</span></a></li>
- <li><a href="globals.html"><span>Globals</span></a></li>
- </ul>
- </div>
- <div class="navpath"><a class="el" href="dir_2bb2cfd8296a7c3e25e97aa2e3d0a212.html">cpu</a> » <a class="el" href="dir_e68658a80db834fb0d1d37b2918a44a9.html">stm32w108</a> » <a class="el" href="dir_3f7decbb5751dc5c993c752361ce029c.html">e_stdio</a> » <a class="el" href="dir_93ef7220dffdb5a19e30c8138778adf2.html">src</a>
- </div>
- </div>
- <div class="contents">
- <h1>small_mprec.c</h1><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 by AT&T.</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 AT&T MAKES ANY</span>
- <a name="l00015"></a>00015 <span class="comment"> * REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY</span>
- <a name="l00016"></a>00016 <span class="comment"> * OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.</span>
- <a name="l00017"></a>00017 <span class="comment"> *</span>
- <a name="l00018"></a>00018 <span class="comment"> ***************************************************************/</span>
- <a name="l00019"></a>00019
- <a name="l00020"></a>00020 <span class="comment">/* Please send bug reports to</span>
- <a name="l00021"></a>00021 <span class="comment"> David M. Gay</span>
- <a name="l00022"></a>00022 <span class="comment"> AT&T Bell Laboratories, Room 2C-463</span>
- <a name="l00023"></a>00023 <span class="comment"> 600 Mountain Avenue</span>
- <a name="l00024"></a>00024 <span class="comment"> Murray Hill, NJ 07974-2070</span>
- <a name="l00025"></a>00025 <span class="comment"> U.S.A.</span>
- <a name="l00026"></a>00026 <span class="comment"> dmg@research.att.com or research!dmg</span>
- <a name="l00027"></a>00027 <span class="comment"> */</span>
- <a name="l00028"></a>00028
- <a name="l00029"></a>00029 <span class="comment">/* strtod for IEEE-, VAX-, and IBM-arithmetic machines.</span>
- <a name="l00030"></a>00030 <span class="comment"> *</span>
- <a name="l00031"></a>00031 <span class="comment"> * This strtod returns a nearest machine number to the input decimal</span>
- <a name="l00032"></a>00032 <span class="comment"> * string (or sets errno to ERANGE). With IEEE arithmetic, ties are</span>
- <a name="l00033"></a>00033 <span class="comment"> * broken by the IEEE round-even rule. Otherwise ties are broken by</span>
- <a name="l00034"></a>00034 <span class="comment"> * biased rounding (add half and chop).</span>
- <a name="l00035"></a>00035 <span class="comment"> *</span>
- <a name="l00036"></a>00036 <span class="comment"> * Inspired loosely by William D. Clinger's paper "How to Read Floating</span>
- <a name="l00037"></a>00037 <span class="comment"> * Point Numbers Accurately" [Proc. ACM SIGPLAN '90, pp. 92-101].</span>
- <a name="l00038"></a>00038 <span class="comment"> *</span>
- <a name="l00039"></a>00039 <span class="comment"> * Modifications:</span>
- <a name="l00040"></a>00040 <span class="comment"> *</span>
- <a name="l00041"></a>00041 <span class="comment"> * 1. We only require IEEE, IBM, or VAX double-precision</span>
- <a name="l00042"></a>00042 <span class="comment"> * arithmetic (not IEEE double-extended).</span>
- <a name="l00043"></a>00043 <span class="comment"> * 2. We get by with floating-point arithmetic in a case that</span>
- <a name="l00044"></a>00044 <span class="comment"> * Clinger missed -- when we're computing d * 10^n</span>
- <a name="l00045"></a>00045 <span class="comment"> * for a small integer d and the integer n is not too</span>
- <a name="l00046"></a>00046 <span class="comment"> * much larger than 22 (the maximum integer k for which</span>
- <a name="l00047"></a>00047 <span class="comment"> * we can represent 10^k exactly), we may be able to</span>
- <a name="l00048"></a>00048 <span class="comment"> * compute (d*10^k) * 10^(e-k) with just one roundoff.</span>
- <a name="l00049"></a>00049 <span class="comment"> * 3. Rather than a bit-at-a-time adjustment of the binary</span>
- <a name="l00050"></a>00050 <span class="comment"> * result in the hard case, we use floating-point</span>
- <a name="l00051"></a>00051 <span class="comment"> * arithmetic to determine the adjustment to within</span>
- <a name="l00052"></a>00052 <span class="comment"> * one bit; only in really hard cases do we need to</span>
- <a name="l00053"></a>00053 <span class="comment"> * compute a second residual.</span>
- <a name="l00054"></a>00054 <span class="comment"> * 4. Because of 3., we don't need a large table of powers of 10</span>
- <a name="l00055"></a>00055 <span class="comment"> * for ten-to-e (just some small tables, e.g. of 10^k</span>
- <a name="l00056"></a>00056 <span class="comment"> * for 0 <= k <= 22).</span>
- <a name="l00057"></a>00057 <span class="comment"> */</span>
- <a name="l00058"></a>00058
- <a name="l00059"></a>00059 <span class="comment">/*</span>
- <a name="l00060"></a>00060 <span class="comment"> * #define IEEE_8087 for IEEE-arithmetic machines where the least</span>
- <a name="l00061"></a>00061 <span class="comment"> * significant byte has the lowest address.</span>
- <a name="l00062"></a>00062 <span class="comment"> * #define IEEE_MC68k for IEEE-arithmetic machines where the most</span>
- <a name="l00063"></a>00063 <span class="comment"> * significant byte has the lowest address.</span>
- <a name="l00064"></a>00064 <span class="comment"> * #define Sudden_Underflow for IEEE-format machines without gradual</span>
- <a name="l00065"></a>00065 <span class="comment"> * underflow (i.e., that flush to zero on underflow).</span>
- <a name="l00066"></a>00066 <span class="comment"> * #define IBM for IBM mainframe-style floating-point arithmetic.</span>
- <a name="l00067"></a>00067 <span class="comment"> * #define VAX for VAX-style floating-point arithmetic.</span>
- <a name="l00068"></a>00068 <span class="comment"> * #define Unsigned_Shifts if >> does treats its left operand as unsigned.</span>
- <a name="l00069"></a>00069 <span class="comment"> * #define No_leftright to omit left-right logic in fast floating-point</span>
- <a name="l00070"></a>00070 <span class="comment"> * computation of dtoa.</span>
- <a name="l00071"></a>00071 <span class="comment"> * #define Check_FLT_ROUNDS if FLT_ROUNDS can assume the values 2 or 3.</span>
- <a name="l00072"></a>00072 <span class="comment"> * #define RND_PRODQUOT to use rnd_prod and rnd_quot (assembly routines</span>
- <a name="l00073"></a>00073 <span class="comment"> * that use extended-precision instructions to compute rounded</span>
- <a name="l00074"></a>00074 <span class="comment"> * products and quotients) with IBM.</span>
- <a name="l00075"></a>00075 <span class="comment"> * #define ROUND_BIASED for IEEE-format with biased rounding.</span>
- <a name="l00076"></a>00076 <span class="comment"> * #define Inaccurate_Divide for IEEE-format with correctly rounded</span>
- <a name="l00077"></a>00077 <span class="comment"> * products but inaccurate quotients, e.g., for Intel i860.</span>
- <a name="l00078"></a>00078 <span class="comment"> * #define Just_16 to store 16 bits per 32-bit long when doing high-precision</span>
- <a name="l00079"></a>00079 <span class="comment"> * integer arithmetic. Whether this speeds things up or slows things</span>
- <a name="l00080"></a>00080 <span class="comment"> * down depends on the machine and the number being converted.</span>
- <a name="l00081"></a>00081 <span class="comment"> */</span>
- <a name="l00082"></a>00082
- <a name="l00083"></a>00083
- <a name="l00084"></a>00084
- <a name="l00085"></a>00085 <span class="preprocessor">#include <_ansi.h></span>
- <a name="l00086"></a>00086 <span class="preprocessor">#include <stdlib.h></span>
- <a name="l00087"></a>00087 <span class="preprocessor">#include <string.h></span>
- <a name="l00088"></a>00088 <span class="preprocessor">#include <reent.h></span>
- <a name="l00089"></a>00089 <span class="preprocessor">#include "small_mprec.h"</span>
- <a name="l00090"></a>00090
- <a name="l00091"></a>00091 <span class="comment">/* reent.c knows this value */</span>
- <a name="l00092"></a>00092 <span class="preprocessor">#define _Kmax 15</span>
- <a name="l00093"></a>00093 <span class="preprocessor"></span>
- <a name="l00094"></a>00094 <span class="preprocessor">#if defined (_SMALL_PRINTF) || defined(SMALL_SCANF)</span>
- <a name="l00095"></a>00095 <span class="preprocessor"></span><span class="preprocessor">#define SMALL_LIB</span>
- <a name="l00096"></a>00096 <span class="preprocessor"></span><span class="preprocessor">#else</span>
- <a name="l00097"></a>00097 <span class="preprocessor"></span><span class="preprocessor">#define FULL_LIB</span>
- <a name="l00098"></a>00098 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
- <a name="l00099"></a>00099 <span class="preprocessor"></span>
- <a name="l00100"></a>00100 <span class="comment">/* SMALL_LIB is only defined if _SMALL_PRINTF or SMALL_SCANF have been defined</span>
- <a name="l00101"></a>00101 <span class="comment"> * which means that if you do only specified _SMALL_PRINTF and not SMALL_SCANF</span>
- <a name="l00102"></a>00102 <span class="comment"> * optimization about call of balloc in small_dtoa_r.c or smal_strtod.c will be</span>
- <a name="l00103"></a>00103 <span class="comment"> * performed for both printf and scanf </span>
- <a name="l00104"></a>00104 <span class="comment"> */</span>
- <a name="l00105"></a>00105
- <a name="l00106"></a>00106
- <a name="l00107"></a>00107
- <a name="l00108"></a>00108 <span class="preprocessor">#ifdef FULL_LIB</span>
- <a name="l00109"></a>00109 <span class="preprocessor"></span>
- <a name="l00110"></a>00110
- <a name="l00111"></a>00111
- <a name="l00112"></a>00112 _Bigint *
- <a name="l00113"></a>00113 _DEFUN (Balloc, (ptr, k), <span class="keyword">struct</span> _reent *ptr _AND <span class="keywordtype">int</span> k)
- <a name="l00114"></a>00114 {
- <a name="l00115"></a>00115 <span class="keywordtype">int</span> x;
- <a name="l00116"></a>00116 _Bigint *rv ;
- <a name="l00117"></a>00117
- <a name="l00118"></a>00118 _REENT_CHECK_MP(ptr);
- <a name="l00119"></a>00119 <span class="keywordflow">if</span> (_REENT_MP_FREELIST(ptr) == NULL)
- <a name="l00120"></a>00120 {
- <a name="l00121"></a>00121 <span class="comment">/* Allocate a list of pointers to the mprec objects */</span>
- <a name="l00122"></a>00122 _REENT_MP_FREELIST(ptr) = (<span class="keyword">struct </span>_Bigint **) _calloc_r (ptr,
- <a name="l00123"></a>00123 <span class="keyword">sizeof</span> (<span class="keyword">struct</span> _Bigint *),
- <a name="l00124"></a>00124 _Kmax + 1);
- <a name="l00125"></a>00125 <span class="keywordflow">if</span> (_REENT_MP_FREELIST(ptr) == NULL)
- <a name="l00126"></a>00126 {
- <a name="l00127"></a>00127 <span class="keywordflow">return</span> NULL;
- <a name="l00128"></a>00128 }
- <a name="l00129"></a>00129 }
- <a name="l00130"></a>00130
- <a name="l00131"></a>00131 <span class="keywordflow">if</span> ((rv = _REENT_MP_FREELIST(ptr)[k]) != 0)
- <a name="l00132"></a>00132 {
- <a name="l00133"></a>00133 _REENT_MP_FREELIST(ptr)[k] = rv->_next;
- <a name="l00134"></a>00134 }
- <a name="l00135"></a>00135 <span class="keywordflow">else</span>
- <a name="l00136"></a>00136 {
- <a name="l00137"></a>00137 x = 1 << k;
- <a name="l00138"></a>00138 <span class="comment">/* Allocate an mprec Bigint and stick in in the freelist */</span>
- <a name="l00139"></a>00139 rv = (_Bigint *) _calloc_r (ptr,
- <a name="l00140"></a>00140 1,
- <a name="l00141"></a>00141 <span class="keyword">sizeof</span> (_Bigint) +
- <a name="l00142"></a>00142 (x-1) * <span class="keyword">sizeof</span>(rv->_x));
- <a name="l00143"></a>00143 <span class="keywordflow">if</span> (rv == NULL) <span class="keywordflow">return</span> NULL;
- <a name="l00144"></a>00144 rv->_k = k;
- <a name="l00145"></a>00145 rv->_maxwds = x;
- <a name="l00146"></a>00146 }
- <a name="l00147"></a>00147 rv->_sign = rv->_wds = 0;
- <a name="l00148"></a>00148 <span class="keywordflow">return</span> rv;
- <a name="l00149"></a>00149 }
- <a name="l00150"></a>00150
- <a name="l00151"></a>00151 <span class="keywordtype">void</span>
- <a name="l00152"></a>00152 _DEFUN (Bfree, (ptr, v), <span class="keyword">struct</span> _reent *ptr _AND _Bigint * v)
- <a name="l00153"></a>00153 {
- <a name="l00154"></a>00154 _REENT_CHECK_MP(ptr);
- <a name="l00155"></a>00155 <span class="keywordflow">if</span> (v)
- <a name="l00156"></a>00156 {
- <a name="l00157"></a>00157 v->_next = _REENT_MP_FREELIST(ptr)[v->_k];
- <a name="l00158"></a>00158 _REENT_MP_FREELIST(ptr)[v->_k] = v;
- <a name="l00159"></a>00159 }
- <a name="l00160"></a>00160 }
- <a name="l00161"></a>00161
- <a name="l00162"></a>00162
- <a name="l00163"></a>00163 _Bigint *
- <a name="l00164"></a>00164 _DEFUN (multadd, (ptr, b, m, a),
- <a name="l00165"></a>00165 <span class="keyword">struct</span> _reent *ptr _AND
- <a name="l00166"></a>00166 _Bigint * b _AND
- <a name="l00167"></a>00167 <span class="keywordtype">int</span> m _AND
- <a name="l00168"></a>00168 <span class="keywordtype">int</span> a)
- <a name="l00169"></a>00169 {
- <a name="l00170"></a>00170 <span class="keywordtype">int</span> i, wds;
- <a name="l00171"></a>00171 __ULong *x, y;
- <a name="l00172"></a>00172 <span class="preprocessor">#ifdef Pack_32</span>
- <a name="l00173"></a>00173 <span class="preprocessor"></span> __ULong xi, z;
- <a name="l00174"></a>00174 <span class="preprocessor">#endif</span>
- <a name="l00175"></a>00175 <span class="preprocessor"></span> _Bigint *b1;
- <a name="l00176"></a>00176
- <a name="l00177"></a>00177 wds = b->_wds;
- <a name="l00178"></a>00178 x = b->_x;
- <a name="l00179"></a>00179 i = 0;
- <a name="l00180"></a>00180 <span class="keywordflow">do</span>
- <a name="l00181"></a>00181 {
- <a name="l00182"></a>00182 <span class="preprocessor">#ifdef Pack_32</span>
- <a name="l00183"></a>00183 <span class="preprocessor"></span> xi = *x;
- <a name="l00184"></a>00184 y = (xi & 0xffff) * m + a;
- <a name="l00185"></a>00185 z = (xi >> 16) * m + (y >> 16);
- <a name="l00186"></a>00186 a = (int) (z >> 16);
- <a name="l00187"></a>00187 *x++ = (z << 16) + (y & 0xffff);
- <a name="l00188"></a>00188 <span class="preprocessor">#else</span>
- <a name="l00189"></a>00189 <span class="preprocessor"></span> y = *x * m + a;
- <a name="l00190"></a>00190 a = (int) (y >> 16);
- <a name="l00191"></a>00191 *x++ = y & 0xffff;
- <a name="l00192"></a>00192 <span class="preprocessor">#endif</span>
- <a name="l00193"></a>00193 <span class="preprocessor"></span> }
- <a name="l00194"></a>00194 <span class="keywordflow">while</span> (++i < wds);
- <a name="l00195"></a>00195 <span class="keywordflow">if</span> (a)
- <a name="l00196"></a>00196 {
- <a name="l00197"></a>00197 <span class="keywordflow">if</span> (wds >= b->_maxwds)
- <a name="l00198"></a>00198 {
- <a name="l00199"></a>00199 b1 = Balloc (ptr, b->_k + 1);
- <a name="l00200"></a>00200 Bcopy (b1, b);
- <a name="l00201"></a>00201 Bfree (ptr, b);
- <a name="l00202"></a>00202 b = b1;
- <a name="l00203"></a>00203 }
- <a name="l00204"></a>00204 b->_x[wds++] = a;
- <a name="l00205"></a>00205 b->_wds = wds;
- <a name="l00206"></a>00206 }
- <a name="l00207"></a>00207 <span class="keywordflow">return</span> b;
- <a name="l00208"></a>00208 }
- <a name="l00209"></a>00209
- <a name="l00210"></a>00210 _Bigint *
- <a name="l00211"></a>00211 _DEFUN (s2b, (ptr, s, nd0, nd, y9),
- <a name="l00212"></a>00212 <span class="keyword">struct</span> _reent * ptr _AND
- <a name="l00213"></a>00213 _CONST <span class="keywordtype">char</span> *s _AND
- <a name="l00214"></a>00214 <span class="keywordtype">int</span> nd0 _AND
- <a name="l00215"></a>00215 <span class="keywordtype">int</span> nd _AND
- <a name="l00216"></a>00216 __ULong y9)
- <a name="l00217"></a>00217 {
- <a name="l00218"></a>00218 _Bigint *b;
- <a name="l00219"></a>00219 <span class="keywordtype">int</span> i, k;
- <a name="l00220"></a>00220 __Long x, y;
- <a name="l00221"></a>00221
- <a name="l00222"></a>00222 x = (nd + 8) / 9;
- <a name="l00223"></a>00223 <span class="keywordflow">for</span> (k = 0, y = 1; x > y; y <<= 1, k++);
- <a name="l00224"></a>00224 <span class="preprocessor">#ifdef Pack_32</span>
- <a name="l00225"></a>00225 <span class="preprocessor"></span> b = Balloc (ptr, k);
- <a name="l00226"></a>00226 b->_x[0] = y9;
- <a name="l00227"></a>00227 b->_wds = 1;
- <a name="l00228"></a>00228 <span class="preprocessor">#else</span>
- <a name="l00229"></a>00229 <span class="preprocessor"></span> b = Balloc (ptr, k + 1);
- <a name="l00230"></a>00230 b->_x[0] = y9 & 0xffff;
- <a name="l00231"></a>00231 b->_wds = (b->_x[1] = y9 >> 16) ? 2 : 1;
- <a name="l00232"></a>00232 <span class="preprocessor">#endif</span>
- <a name="l00233"></a>00233 <span class="preprocessor"></span>
- <a name="l00234"></a>00234 i = 9;
- <a name="l00235"></a>00235 <span class="keywordflow">if</span> (9 < nd0)
- <a name="l00236"></a>00236 {
- <a name="l00237"></a>00237 s += 9;
- <a name="l00238"></a>00238 <span class="keywordflow">do</span>
- <a name="l00239"></a>00239 b = multadd (ptr, b, 10, *s++ - <span class="charliteral">'0'</span>);
- <a name="l00240"></a>00240 <span class="keywordflow">while</span> (++i < nd0);
- <a name="l00241"></a>00241 s++;
- <a name="l00242"></a>00242 }
- <a name="l00243"></a>00243 <span class="keywordflow">else</span>
- <a name="l00244"></a>00244 s += 10;
- <a name="l00245"></a>00245 <span class="keywordflow">for</span> (; i < nd; i++)
- <a name="l00246"></a>00246 b = multadd (ptr, b, 10, *s++ - <span class="charliteral">'0'</span>);
- <a name="l00247"></a>00247 <span class="keywordflow">return</span> b;
- <a name="l00248"></a>00248 }
- <a name="l00249"></a>00249
- <a name="l00250"></a>00250 <span class="keywordtype">int</span>
- <a name="l00251"></a>00251 _DEFUN (hi0bits,
- <a name="l00252"></a>00252 (x), <span class="keyword">register</span> __ULong x)
- <a name="l00253"></a>00253 {
- <a name="l00254"></a>00254 <span class="keyword">register</span> <span class="keywordtype">int</span> k = 0;
- <a name="l00255"></a>00255
- <a name="l00256"></a>00256 <span class="keywordflow">if</span> (!(x & 0xffff0000))
- <a name="l00257"></a>00257 {
- <a name="l00258"></a>00258 k = 16;
- <a name="l00259"></a>00259 x <<= 16;
- <a name="l00260"></a>00260 }
- <a name="l00261"></a>00261 <span class="keywordflow">if</span> (!(x & 0xff000000))
- <a name="l00262"></a>00262 {
- <a name="l00263"></a>00263 k += 8;
- <a name="l00264"></a>00264 x <<= 8;
- <a name="l00265"></a>00265 }
- <a name="l00266"></a>00266 <span class="keywordflow">if</span> (!(x & 0xf0000000))
- <a name="l00267"></a>00267 {
- <a name="l00268"></a>00268 k += 4;
- <a name="l00269"></a>00269 x <<= 4;
- <a name="l00270"></a>00270 }
- <a name="l00271"></a>00271 <span class="keywordflow">if</span> (!(x & 0xc0000000))
- <a name="l00272"></a>00272 {
- <a name="l00273"></a>00273 k += 2;
- <a name="l00274"></a>00274 x <<= 2;
- <a name="l00275"></a>00275 }
- <a name="l00276"></a>00276 <span class="keywordflow">if</span> (!(x & 0x80000000))
- <a name="l00277"></a>00277 {
- <a name="l00278"></a>00278 k++;
- <a name="l00279"></a>00279 <span class="keywordflow">if</span> (!(x & 0x40000000))
- <a name="l00280"></a>00280 <span class="keywordflow">return</span> 32;
- <a name="l00281"></a>00281 }
- <a name="l00282"></a>00282 <span class="keywordflow">return</span> k;
- <a name="l00283"></a>00283 }
- <a name="l00284"></a>00284
- <a name="l00285"></a>00285 <span class="keywordtype">int</span>
- <a name="l00286"></a>00286 _DEFUN (lo0bits, (y), __ULong *y)
- <a name="l00287"></a>00287 {
- <a name="l00288"></a>00288 <span class="keyword">register</span> <span class="keywordtype">int</span> k;
- <a name="l00289"></a>00289 <span class="keyword">register</span> __ULong x = *y;
- <a name="l00290"></a>00290
- <a name="l00291"></a>00291 <span class="keywordflow">if</span> (x & 7)
- <a name="l00292"></a>00292 {
- <a name="l00293"></a>00293 <span class="keywordflow">if</span> (x & 1)
- <a name="l00294"></a>00294 <span class="keywordflow">return</span> 0;
- <a name="l00295"></a>00295 <span class="keywordflow">if</span> (x & 2)
- <a name="l00296"></a>00296 {
- <a name="l00297"></a>00297 *y = x >> 1;
- <a name="l00298"></a>00298 <span class="keywordflow">return</span> 1;
- <a name="l00299"></a>00299 }
- <a name="l00300"></a>00300 *y = x >> 2;
- <a name="l00301"></a>00301 <span class="keywordflow">return</span> 2;
- <a name="l00302"></a>00302 }
- <a name="l00303"></a>00303 k = 0;
- <a name="l00304"></a>00304 <span class="keywordflow">if</span> (!(x & 0xffff))
- <a name="l00305"></a>00305 {
- <a name="l00306"></a>00306 k = 16;
- <a name="l00307"></a>00307 x >>= 16;
- <a name="l00308"></a>00308 }
- <a name="l00309"></a>00309 <span class="keywordflow">if</span> (!(x & 0xff))
- <a name="l00310"></a>00310 {
- <a name="l00311"></a>00311 k += 8;
- <a name="l00312"></a>00312 x >>= 8;
- <a name="l00313"></a>00313 }
- <a name="l00314"></a>00314 <span class="keywordflow">if</span> (!(x & 0xf))
- <a name="l00315"></a>00315 {
- <a name="l00316"></a>00316 k += 4;
- <a name="l00317"></a>00317 x >>= 4;
- <a name="l00318"></a>00318 }
- <a name="l00319"></a>00319 <span class="keywordflow">if</span> (!(x & 0x3))
- <a name="l00320"></a>00320 {
- <a name="l00321"></a>00321 k += 2;
- <a name="l00322"></a>00322 x >>= 2;
- <a name="l00323"></a>00323 }
- <a name="l00324"></a>00324 <span class="keywordflow">if</span> (!(x & 1))
- <a name="l00325"></a>00325 {
- <a name="l00326"></a>00326 k++;
- <a name="l00327"></a>00327 x >>= 1;
- <a name="l00328"></a>00328 <span class="keywordflow">if</span> (!x & 1)
- <a name="l00329"></a>00329 <span class="keywordflow">return</span> 32;
- <a name="l00330"></a>00330 }
- <a name="l00331"></a>00331 *y = x;
- <a name="l00332"></a>00332 <span class="keywordflow">return</span> k;
- <a name="l00333"></a>00333 }
- <a name="l00334"></a>00334
- <a name="l00335"></a>00335 _Bigint *
- <a name="l00336"></a>00336 _DEFUN (i2b, (ptr, i), <span class="keyword">struct</span> _reent * ptr _AND <span class="keywordtype">int</span> i)
- <a name="l00337"></a>00337 {
- <a name="l00338"></a>00338 _Bigint *b;
- <a name="l00339"></a>00339
- <a name="l00340"></a>00340 b = Balloc (ptr, 1);
- <a name="l00341"></a>00341 b->_x[0] = i;
- <a name="l00342"></a>00342 b->_wds = 1;
- <a name="l00343"></a>00343 <span class="keywordflow">return</span> b;
- <a name="l00344"></a>00344 }
- <a name="l00345"></a>00345
- <a name="l00346"></a>00346 _Bigint *
- <a name="l00347"></a>00347 _DEFUN (mult, (ptr, a, b), <span class="keyword">struct</span> _reent * ptr _AND _Bigint * a _AND _Bigint * b)
- <a name="l00348"></a>00348 {
- <a name="l00349"></a>00349 _Bigint *c;
- <a name="l00350"></a>00350 <span class="keywordtype">int</span> k, wa, wb, wc;
- <a name="l00351"></a>00351 __ULong carry, y, z;
- <a name="l00352"></a>00352 __ULong *x, *xa, *xae, *xb, *xbe, *xc, *xc0;
- <a name="l00353"></a>00353 <span class="preprocessor">#ifdef Pack_32</span>
- <a name="l00354"></a>00354 <span class="preprocessor"></span> __ULong z2;
- <a name="l00355"></a>00355 <span class="preprocessor">#endif</span>
- <a name="l00356"></a>00356 <span class="preprocessor"></span>
- <a name="l00357"></a>00357 <span class="keywordflow">if</span> (a->_wds < b->_wds)
- <a name="l00358"></a>00358 {
- <a name="l00359"></a>00359 c = a;
- <a name="l00360"></a>00360 a = b;
- <a name="l00361"></a>00361 b = c;
- <a name="l00362"></a>00362 }
- <a name="l00363"></a>00363 k = a->_k;
- <a name="l00364"></a>00364 wa = a->_wds;
- <a name="l00365"></a>00365 wb = b->_wds;
- <a name="l00366"></a>00366 wc = wa + wb;
- <a name="l00367"></a>00367 <span class="keywordflow">if</span> (wc > a->_maxwds)
- <a name="l00368"></a>00368 k++;
- <a name="l00369"></a>00369 c = Balloc (ptr, k);
- <a name="l00370"></a>00370 <span class="keywordflow">for</span> (x = c->_x, xa = x + wc; x < xa; x++)
- <a name="l00371"></a>00371 *x = 0;
- <a name="l00372"></a>00372 xa = a->_x;
- <a name="l00373"></a>00373 xae = xa + wa;
- <a name="l00374"></a>00374 xb = b->_x;
- <a name="l00375"></a>00375 xbe = xb + wb;
- <a name="l00376"></a>00376 xc0 = c->_x;
- <a name="l00377"></a>00377 <span class="preprocessor">#ifdef Pack_32</span>
- <a name="l00378"></a>00378 <span class="preprocessor"></span> <span class="keywordflow">for</span> (; xb < xbe; xb++, xc0++)
- <a name="l00379"></a>00379 {
- <a name="l00380"></a>00380 <span class="keywordflow">if</span> ((y = *xb & 0xffff) != 0)
- <a name="l00381"></a>00381 {
- <a name="l00382"></a>00382 x = xa;
- <a name="l00383"></a>00383 xc = xc0;
- <a name="l00384"></a>00384 carry = 0;
- <a name="l00385"></a>00385 <span class="keywordflow">do</span>
- <a name="l00386"></a>00386 {
- <a name="l00387"></a>00387 z = (*x & 0xffff) * y + (*xc & 0xffff) + carry;
- <a name="l00388"></a>00388 carry = z >> 16;
- <a name="l00389"></a>00389 z2 = (*x++ >> 16) * y + (*xc >> 16) + carry;
- <a name="l00390"></a>00390 carry = z2 >> 16;
- <a name="l00391"></a>00391 Storeinc (xc, z2, z);
- <a name="l00392"></a>00392 }
- <a name="l00393"></a>00393 <span class="keywordflow">while</span> (x < xae);
- <a name="l00394"></a>00394 *xc = carry;
- <a name="l00395"></a>00395 }
- <a name="l00396"></a>00396 <span class="keywordflow">if</span> ((y = *xb >> 16) != 0)
- <a name="l00397"></a>00397 {
- <a name="l00398"></a>00398 x = xa;
- <a name="l00399"></a>00399 xc = xc0;
- <a name="l00400"></a>00400 carry = 0;
- <a name="l00401"></a>00401 z2 = *xc;
- <a name="l00402"></a>00402 <span class="keywordflow">do</span>
- <a name="l00403"></a>00403 {
- <a name="l00404"></a>00404 z = (*x & 0xffff) * y + (*xc >> 16) + carry;
- <a name="l00405"></a>00405 carry = z >> 16;
- <a name="l00406"></a>00406 Storeinc (xc, z, z2);
- <a name="l00407"></a>00407 z2 = (*x++ >> 16) * y + (*xc & 0xffff) + carry;
- <a name="l00408"></a>00408 carry = z2 >> 16;
- <a name="l00409"></a>00409 }
- <a name="l00410"></a>00410 <span class="keywordflow">while</span> (x < xae);
- <a name="l00411"></a>00411 *xc = z2;
- <a name="l00412"></a>00412 }
- <a name="l00413"></a>00413 }
- <a name="l00414"></a>00414 <span class="preprocessor">#else</span>
- <a name="l00415"></a>00415 <span class="preprocessor"></span> <span class="keywordflow">for</span> (; xb < xbe; xc0++)
- <a name="l00416"></a>00416 {
- <a name="l00417"></a>00417 <span class="keywordflow">if</span> (y = *xb++)
- <a name="l00418"></a>00418 {
- <a name="l00419"></a>00419 x = xa;
- <a name="l00420"></a>00420 xc = xc0;
- <a name="l00421"></a>00421 carry = 0;
- <a name="l00422"></a>00422 <span class="keywordflow">do</span>
- <a name="l00423"></a>00423 {
- <a name="l00424"></a>00424 z = *x++ * y + *xc + carry;
- <a name="l00425"></a>00425 carry = z >> 16;
- <a name="l00426"></a>00426 *xc++ = z & 0xffff;
- <a name="l00427"></a>00427 }
- <a name="l00428"></a>00428 <span class="keywordflow">while</span> (x < xae);
- <a name="l00429"></a>00429 *xc = carry;
- <a name="l00430"></a>00430 }
- <a name="l00431"></a>00431 }
- <a name="l00432"></a>00432 <span class="preprocessor">#endif</span>
- <a name="l00433"></a>00433 <span class="preprocessor"></span> <span class="keywordflow">for</span> (xc0 = c->_x, xc = xc0 + wc; wc > 0 && !*--xc; --wc);
- <a name="l00434"></a>00434 c->_wds = wc;
- <a name="l00435"></a>00435 <span class="keywordflow">return</span> c;
- <a name="l00436"></a>00436 }
- <a name="l00437"></a>00437
- <a name="l00438"></a>00438 _Bigint *
- <a name="l00439"></a>00439 _DEFUN (pow5mult,
- <a name="l00440"></a>00440 (ptr, b, k), <span class="keyword">struct</span> _reent * ptr _AND _Bigint * b _AND <span class="keywordtype">int</span> k)
- <a name="l00441"></a>00441 {
- <a name="l00442"></a>00442 _Bigint *b1, *p5, *p51;
- <a name="l00443"></a>00443 <span class="keywordtype">int</span> i;
- <a name="l00444"></a>00444 <span class="keyword">static</span> _CONST <span class="keywordtype">int</span> p05[3] = {5, 25, 125};
- <a name="l00445"></a>00445
- <a name="l00446"></a>00446 <span class="keywordflow">if</span> ((i = k & 3) != 0)
- <a name="l00447"></a>00447 b = multadd (ptr, b, p05[i - 1], 0);
- <a name="l00448"></a>00448
- <a name="l00449"></a>00449 <span class="keywordflow">if</span> (!(k >>= 2))
- <a name="l00450"></a>00450 <span class="keywordflow">return</span> b;
- <a name="l00451"></a>00451 _REENT_CHECK_MP(ptr);
- <a name="l00452"></a>00452 <span class="keywordflow">if</span> (!(p5 = _REENT_MP_P5S(ptr)))
- <a name="l00453"></a>00453 {
- <a name="l00454"></a>00454 <span class="comment">/* first time */</span>
- <a name="l00455"></a>00455 p5 = _REENT_MP_P5S(ptr) = i2b (ptr, 625);
- <a name="l00456"></a>00456 p5->_next = 0;
- <a name="l00457"></a>00457 }
- <a name="l00458"></a>00458 <span class="keywordflow">for</span> (;;)
- <a name="l00459"></a>00459 {
- <a name="l00460"></a>00460 <span class="keywordflow">if</span> (k & 1)
- <a name="l00461"></a>00461 {
- <a name="l00462"></a>00462 b1 = mult (ptr, b, p5);
- <a name="l00463"></a>00463 Bfree (ptr, b);
- <a name="l00464"></a>00464 b = b1;
- <a name="l00465"></a>00465 }
- <a name="l00466"></a>00466 <span class="keywordflow">if</span> (!(k >>= 1))
- <a name="l00467"></a>00467 <span class="keywordflow">break</span>;
- <a name="l00468"></a>00468 <span class="keywordflow">if</span> (!(p51 = p5->_next))
- <a name="l00469"></a>00469 {
- <a name="l00470"></a>00470 p51 = p5->_next = mult (ptr, p5, p5);
- <a name="l00471"></a>00471 p51->_next = 0;
- <a name="l00472"></a>00472 }
- <a name="l00473"></a>00473 p5 = p51;
- <a name="l00474"></a>00474 }
- <a name="l00475"></a>00475 <span class="keywordflow">return</span> b;
- <a name="l00476"></a>00476 }
- <a name="l00477"></a>00477
- <a name="l00478"></a>00478 _Bigint *
- <a name="l00479"></a>00479 _DEFUN (lshift, (ptr, b, k), <span class="keyword">struct</span> _reent * ptr _AND _Bigint * b _AND <span class="keywordtype">int</span> k)
- <a name="l00480"></a>00480 {
- <a name="l00481"></a>00481 <span class="keywordtype">int</span> i, k1, n, n1;
- <a name="l00482"></a>00482 _Bigint *b1;
- <a name="l00483"></a>00483 __ULong *x, *x1, *xe, z;
- <a name="l00484"></a>00484
- <a name="l00485"></a>00485 <span class="preprocessor">#ifdef Pack_32</span>
- <a name="l00486"></a>00486 <span class="preprocessor"></span> n = k >> 5;
- <a name="l00487"></a>00487 <span class="preprocessor">#else</span>
- <a name="l00488"></a>00488 <span class="preprocessor"></span> n = k >> 4;
- <a name="l00489"></a>00489 <span class="preprocessor">#endif</span>
- <a name="l00490"></a>00490 <span class="preprocessor"></span> k1 = b->_k;
- <a name="l00491"></a>00491 n1 = n + b->_wds + 1;
- <a name="l00492"></a>00492 <span class="keywordflow">for</span> (i = b->_maxwds; n1 > i; i <<= 1)
- <a name="l00493"></a>00493 k1++;
- <a name="l00494"></a>00494 b1 = Balloc (ptr, k1);
- <a name="l00495"></a>00495 x1 = b1->_x;
- <a name="l00496"></a>00496 <span class="keywordflow">for</span> (i = 0; i < n; i++)
- <a name="l00497"></a>00497 *x1++ = 0;
- <a name="l00498"></a>00498 x = b->_x;
- <a name="l00499"></a>00499 xe = x + b->_wds;
- <a name="l00500"></a>00500 <span class="preprocessor">#ifdef Pack_32</span>
- <a name="l00501"></a>00501 <span class="preprocessor"></span> <span class="keywordflow">if</span> (k &= 0x1f)
- <a name="l00502"></a>00502 {
- <a name="l00503"></a>00503 k1 = 32 - k;
- <a name="l00504"></a>00504 z = 0;
- <a name="l00505"></a>00505 <span class="keywordflow">do</span>
- <a name="l00506"></a>00506 {
- <a name="l00507"></a>00507 *x1++ = *x << k | z;
- <a name="l00508"></a>00508 z = *x++ >> k1;
- <a name="l00509"></a>00509 }
- <a name="l00510"></a>00510 <span class="keywordflow">while</span> (x < xe);
- <a name="l00511"></a>00511 <span class="keywordflow">if</span> ((*x1 = z) != 0)
- <a name="l00512"></a>00512 ++n1;
- <a name="l00513"></a>00513 }
- <a name="l00514"></a>00514 <span class="preprocessor">#else</span>
- <a name="l00515"></a>00515 <span class="preprocessor"></span> <span class="keywordflow">if</span> (k &= 0xf)
- <a name="l00516"></a>00516 {
- <a name="l00517"></a>00517 k1 = 16 - k;
- <a name="l00518"></a>00518 z = 0;
- <a name="l00519"></a>00519 <span class="keywordflow">do</span>
- <a name="l00520"></a>00520 {
- <a name="l00521"></a>00521 *x1++ = *x << k & 0xffff | z;
- <a name="l00522"></a>00522 z = *x++ >> k1;
- <a name="l00523"></a>00523 }
- <a name="l00524"></a>00524 <span class="keywordflow">while</span> (x < xe);
- <a name="l00525"></a>00525 <span class="keywordflow">if</span> (*x1 = z)
- <a name="l00526"></a>00526 ++n1;
- <a name="l00527"></a>00527 }
- <a name="l00528"></a>00528 <span class="preprocessor">#endif</span>
- <a name="l00529"></a>00529 <span class="preprocessor"></span> <span class="keywordflow">else</span>
- <a name="l00530"></a>00530 <span class="keywordflow">do</span>
- <a name="l00531"></a>00531 *x1++ = *x++;
- <a name="l00532"></a>00532 <span class="keywordflow">while</span> (x < xe);
- <a name="l00533"></a>00533 b1->_wds = n1 - 1;
- <a name="l00534"></a>00534 Bfree (ptr, b);
- <a name="l00535"></a>00535 <span class="keywordflow">return</span> b1;
- <a name="l00536"></a>00536 }
- <a name="l00537"></a>00537
- <a name="l00538"></a>00538 <span class="keywordtype">int</span>
- <a name="l00539"></a>00539 _DEFUN (cmp, (a, b), _Bigint * a _AND _Bigint * b)
- <a name="l00540"></a>00540 {
- <a name="l00541"></a>00541 __ULong *xa, *xa0, *xb, *xb0;
- <a name="l00542"></a>00542 <span class="keywordtype">int</span> i, j;
- <a name="l00543"></a>00543
- <a name="l00544"></a>00544 i = a->_wds;
- <a name="l00545"></a>00545 j = b->_wds;
- <a name="l00546"></a>00546 <span class="preprocessor">#ifdef DEBUG</span>
- <a name="l00547"></a>00547 <span class="preprocessor"></span> <span class="keywordflow">if</span> (i > 1 && !a->_x[i - 1])
- <a name="l00548"></a>00548 Bug (<span class="stringliteral">"cmp called with a->_x[a->_wds-1] == 0"</span>);
- <a name="l00549"></a>00549 <span class="keywordflow">if</span> (j > 1 && !b->_x[j - 1])
- <a name="l00550"></a>00550 Bug (<span class="stringliteral">"cmp called with b->_x[b->_wds-1] == 0"</span>);
- <a name="l00551"></a>00551 <span class="preprocessor">#endif</span>
- <a name="l00552"></a>00552 <span class="preprocessor"></span> <span class="keywordflow">if</span> (i -= j)
- <a name="l00553"></a>00553 <span class="keywordflow">return</span> i;
- <a name="l00554"></a>00554 xa0 = a->_x;
- <a name="l00555"></a>00555 xa = xa0 + j;
- <a name="l00556"></a>00556 xb0 = b->_x;
- <a name="l00557"></a>00557 xb = xb0 + j;
- <a name="l00558"></a>00558 <span class="keywordflow">for</span> (;;)
- <a name="l00559"></a>00559 {
- <a name="l00560"></a>00560 <span class="keywordflow">if</span> (*--xa != *--xb)
- <a name="l00561"></a>00561 <span class="keywordflow">return</span> *xa < *xb ? -1 : 1;
- <a name="l00562"></a>00562 <span class="keywordflow">if</span> (xa <= xa0)
- <a name="l00563"></a>00563 <span class="keywordflow">break</span>;
- <a name="l00564"></a>00564 }
- <a name="l00565"></a>00565 <span class="keywordflow">return</span> 0;
- <a name="l00566"></a>00566 }
- <a name="l00567"></a>00567
- <a name="l00568"></a>00568 _Bigint *
- <a name="l00569"></a>00569 _DEFUN (diff, (ptr, a, b), <span class="keyword">struct</span> _reent * ptr _AND
- <a name="l00570"></a>00570 _Bigint * a _AND _Bigint * b)
- <a name="l00571"></a>00571 {
- <a name="l00572"></a>00572 _Bigint *c;
- <a name="l00573"></a>00573 <span class="keywordtype">int</span> i, wa, wb;
- <a name="l00574"></a>00574 __Long borrow, y; <span class="comment">/* We need signed shifts here. */</span>
- <a name="l00575"></a>00575 __ULong *xa, *xae, *xb, *xbe, *xc;
- <a name="l00576"></a>00576 <span class="preprocessor">#ifdef Pack_32</span>
- <a name="l00577"></a>00577 <span class="preprocessor"></span> __Long z;
- <a name="l00578"></a>00578 <span class="preprocessor">#endif</span>
- <a name="l00579"></a>00579 <span class="preprocessor"></span>
- <a name="l00580"></a>00580 i = cmp (a, b);
- <a name="l00581"></a>00581 <span class="keywordflow">if</span> (!i)
- <a name="l00582"></a>00582 {
- <a name="l00583"></a>00583 c = Balloc (ptr, 0);
- <a name="l00584"></a>00584 c->_wds = 1;
- <a name="l00585"></a>00585 c->_x[0] = 0;
- <a name="l00586"></a>00586 <span class="keywordflow">return</span> c;
- <a name="l00587"></a>00587 }
- <a name="l00588"></a>00588 <span class="keywordflow">if</span> (i < 0)
- <a name="l00589"></a>00589 {
- <a name="l00590"></a>00590 c = a;
- <a name="l00591"></a>00591 a = b;
- <a name="l00592"></a>00592 b = c;
- <a name="l00593"></a>00593 i = 1;
- <a name="l00594"></a>00594 }
- <a name="l00595"></a>00595 <span class="keywordflow">else</span>
- <a name="l00596"></a>00596 i = 0;
- <a name="l00597"></a>00597 c = Balloc (ptr, a->_k);
- <a name="l00598"></a>00598 c->_sign = i;
- <a name="l00599"></a>00599 wa = a->_wds;
- <a name="l00600"></a>00600 xa = a->_x;
- <a name="l00601"></a>00601 xae = xa + wa;
- <a name="l00602"></a>00602 wb = b->_wds;
- <a name="l00603"></a>00603 xb = b->_x;
- <a name="l00604"></a>00604 xbe = xb + wb;
- <a name="l00605"></a>00605 xc = c->_x;
- <a name="l00606"></a>00606 borrow = 0;
- <a name="l00607"></a>00607 <span class="preprocessor">#ifdef Pack_32</span>
- <a name="l00608"></a>00608 <span class="preprocessor"></span> <span class="keywordflow">do</span>
- <a name="l00609"></a>00609 {
- <a name="l00610"></a>00610 y = (*xa & 0xffff) - (*xb & 0xffff) + borrow;
- <a name="l00611"></a>00611 borrow = y >> 16;
- <a name="l00612"></a>00612 Sign_Extend (borrow, y);
- <a name="l00613"></a>00613 z = (*xa++ >> 16) - (*xb++ >> 16) + borrow;
- <a name="l00614"></a>00614 borrow = z >> 16;
- <a name="l00615"></a>00615 Sign_Extend (borrow, z);
- <a name="l00616"></a>00616 Storeinc (xc, z, y);
- <a name="l00617"></a>00617 }
- <a name="l00618"></a>00618 <span class="keywordflow">while</span> (xb < xbe);
- <a name="l00619"></a>00619 <span class="keywordflow">while</span> (xa < xae)
- <a name="l00620"></a>00620 {
- <a name="l00621"></a>00621 y = (*xa & 0xffff) + borrow;
- <a name="l00622"></a>00622 borrow = y >> 16;
- <a name="l00623"></a>00623 Sign_Extend (borrow, y);
- <a name="l00624"></a>00624 z = (*xa++ >> 16) + borrow;
- <a name="l00625"></a>00625 borrow = z >> 16;
- <a name="l00626"></a>00626 Sign_Extend (borrow, z);
- <a name="l00627"></a>00627 Storeinc (xc, z, y);
- <a name="l00628"></a>00628 }
- <a name="l00629"></a>00629 <span class="preprocessor">#else</span>
- <a name="l00630"></a>00630 <span class="preprocessor"></span> <span class="keywordflow">do</span>
- <a name="l00631"></a>00631 {
- <a name="l00632"></a>00632 y = *xa++ - *xb++ + borrow;
- <a name="l00633"></a>00633 borrow = y >> 16;
- <a name="l00634"></a>00634 Sign_Extend (borrow, y);
- <a name="l00635"></a>00635 *xc++ = y & 0xffff;
- <a name="l00636"></a>00636 }
- <a name="l00637"></a>00637 <span class="keywordflow">while</span> (xb < xbe);
- <a name="l00638"></a>00638 <span class="keywordflow">while</span> (xa < xae)
- <a name="l00639"></a>00639 {
- <a name="l00640"></a>00640 y = *xa++ + borrow;
- <a name="l00641"></a>00641 borrow = y >> 16;
- <a name="l00642"></a>00642 Sign_Extend (borrow, y);
- <a name="l00643"></a>00643 *xc++ = y & 0xffff;
- <a name="l00644"></a>00644 }
- <a name="l00645"></a>00645 <span class="preprocessor">#endif</span>
- <a name="l00646"></a>00646 <span class="preprocessor"></span> <span class="keywordflow">while</span> (!*--xc)
- <a name="l00647"></a>00647 wa--;
- <a name="l00648"></a>00648 c->_wds = wa;
- <a name="l00649"></a>00649 <span class="keywordflow">return</span> c;
- <a name="l00650"></a>00650 }
- <a name="l00651"></a>00651
- <a name="l00652"></a>00652 <span class="keywordtype">double</span>
- <a name="l00653"></a>00653 _DEFUN (ulp, (_x), <span class="keywordtype">double</span> _x)
- <a name="l00654"></a>00654 {
- <a name="l00655"></a>00655 <span class="keyword">union </span>double_union x, a;
- <a name="l00656"></a>00656 <span class="keyword">register</span> __Long L;
- <a name="l00657"></a>00657
- <a name="l00658"></a>00658 x.d = _x;
- <a name="l00659"></a>00659
- <a name="l00660"></a>00660 L = (word0 (x) & Exp_mask) - (P - 1) * Exp_msk1;
- <a name="l00661"></a>00661 <span class="preprocessor">#ifndef Sudden_Underflow</span>
- <a name="l00662"></a>00662 <span class="preprocessor"></span> <span class="keywordflow">if</span> (L > 0)
- <a name="l00663"></a>00663 {
- <a name="l00664"></a>00664 <span class="preprocessor">#endif</span>
- <a name="l00665"></a>00665 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
- <a name="l00666"></a>00666 <span class="preprocessor"></span> L |= Exp_msk1 >> 4;
- <a name="l00667"></a>00667 <span class="preprocessor">#endif</span>
- <a name="l00668"></a>00668 <span class="preprocessor"></span> word0 (a) = L;
- <a name="l00669"></a>00669 <span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
- <a name="l00670"></a>00670 <span class="preprocessor"></span> word1 (a) = 0;
- <a name="l00671"></a>00671 <span class="preprocessor">#endif</span>
- <a name="l00672"></a>00672 <span class="preprocessor"></span>
- <a name="l00673"></a>00673 <span class="preprocessor">#ifndef Sudden_Underflow</span>
- <a name="l00674"></a>00674 <span class="preprocessor"></span> }
- <a name="l00675"></a>00675 <span class="keywordflow">else</span>
- <a name="l00676"></a>00676 {
- <a name="l00677"></a>00677 L = -L >> Exp_shift;
- <a name="l00678"></a>00678 <span class="keywordflow">if</span> (L < Exp_shift)
- <a name="l00679"></a>00679 {
- <a name="l00680"></a>00680 word0 (a) = 0x80000 >> L;
- <a name="l00681"></a>00681 <span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
- <a name="l00682"></a>00682 <span class="preprocessor"></span> word1 (a) = 0;
- <a name="l00683"></a>00683 <span class="preprocessor">#endif</span>
- <a name="l00684"></a>00684 <span class="preprocessor"></span> }
- <a name="l00685"></a>00685 <span class="keywordflow">else</span>
- <a name="l00686"></a>00686 {
- <a name="l00687"></a>00687 word0 (a) = 0;
- <a name="l00688"></a>00688 L -= Exp_shift;
- <a name="l00689"></a>00689 <span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
- <a name="l00690"></a>00690 <span class="preprocessor"></span> word1 (a) = L >= 31 ? 1 : 1 << (31 - L);
- <a name="l00691"></a>00691 <span class="preprocessor">#endif</span>
- <a name="l00692"></a>00692 <span class="preprocessor"></span> }
- <a name="l00693"></a>00693 }
- <a name="l00694"></a>00694 <span class="preprocessor">#endif</span>
- <a name="l00695"></a>00695 <span class="preprocessor"></span> <span class="keywordflow">return</span> a.d;
- <a name="l00696"></a>00696 }
- <a name="l00697"></a>00697
- <a name="l00698"></a>00698 <span class="keywordtype">double</span>
- <a name="l00699"></a>00699 _DEFUN (b2d, (a, e),
- <a name="l00700"></a>00700 _Bigint * a _AND <span class="keywordtype">int</span> *e)
- <a name="l00701"></a>00701 {
- <a name="l00702"></a>00702 __ULong *xa, *xa0, w, y, z;
- <a name="l00703"></a>00703 <span class="keywordtype">int</span> k;
- <a name="l00704"></a>00704 <span class="keyword">union </span>double_union d;
- <a name="l00705"></a>00705 <span class="preprocessor">#ifdef VAX</span>
- <a name="l00706"></a>00706 <span class="preprocessor"></span> __ULong d0, d1;
- <a name="l00707"></a>00707 <span class="preprocessor">#else</span>
- <a name="l00708"></a>00708 <span class="preprocessor"></span><span class="preprocessor">#define d0 word0(d)</span>
- <a name="l00709"></a>00709 <span class="preprocessor"></span><span class="preprocessor">#define d1 word1(d)</span>
- <a name="l00710"></a>00710 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
- <a name="l00711"></a>00711 <span class="preprocessor"></span>
- <a name="l00712"></a>00712 xa0 = a->_x;
- <a name="l00713"></a>00713 xa = xa0 + a->_wds;
- <a name="l00714"></a>00714 y = *--xa;
- <a name="l00715"></a>00715 <span class="preprocessor">#ifdef DEBUG</span>
- <a name="l00716"></a>00716 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!y)
- <a name="l00717"></a>00717 Bug (<span class="stringliteral">"zero y in b2d"</span>);
- <a name="l00718"></a>00718 <span class="preprocessor">#endif</span>
- <a name="l00719"></a>00719 <span class="preprocessor"></span> k = hi0bits (y);
- <a name="l00720"></a>00720 *e = 32 - k;
- <a name="l00721"></a>00721 <span class="preprocessor">#ifdef Pack_32</span>
- <a name="l00722"></a>00722 <span class="preprocessor"></span> <span class="keywordflow">if</span> (k < Ebits)
- <a name="l00723"></a>00723 {
- <a name="l00724"></a>00724 d0 = Exp_1 | y >> (Ebits - k);
- <a name="l00725"></a>00725 w = xa > xa0 ? *--xa : 0;
- <a name="l00726"></a>00726 <span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
- <a name="l00727"></a>00727 <span class="preprocessor"></span> d1 = y << ((32 - Ebits) + k) | w >> (Ebits - k);
- <a name="l00728"></a>00728 <span class="preprocessor">#endif</span>
- <a name="l00729"></a>00729 <span class="preprocessor"></span> <span class="keywordflow">goto</span> ret_d;
- <a name="l00730"></a>00730 }
- <a name="l00731"></a>00731 z = xa > xa0 ? *--xa : 0;
- <a name="l00732"></a>00732 <span class="keywordflow">if</span> (k -= Ebits)
- <a name="l00733"></a>00733 {
- <a name="l00734"></a>00734 d0 = Exp_1 |…
Large files files are truncated, but you can click here to view the full file