PageRenderTime 67ms CodeModel.GetById 14ms RepoModel.GetById 0ms app.codeStats 1ms

/a00977_source.html

https://github.com/krackeroda/contiki-doxygen
HTML | 2001 lines | 2000 code | 0 blank | 1 comment | 0 complexity | c4bf3e180ae0be45677dc0db11e1f134 MD5 | raw file
    

  1. <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
    2. 

  2. <html xmlns="http://www.w3.org/1999/xhtml">
    3. 

  3. <head>
    4. 

  4. <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
    5. 

  5. <title>Contiki 2.5: cpu/stm32w108/e_stdio/src/small_mprec.c Source File</title>
    6. 

  6. <link href="tabs.css" rel="stylesheet" type="text/css"/>
    7. 

  7. <link href="doxygen.css" rel="stylesheet" type="text/css"/>
    8. 

  8. </head>
    9. 

  9. <body>
    10. 

  10. <!-- Generated by Doxygen 1.6.1 -->
    11. 

  11. <div class="navigation" id="top">
    12. 

  12.   <div class="tabs">
    13. 

  13.     <ul>
    14. 

  14.       <li><a href="main.html"><span>Main&nbsp;Page</span></a></li>
    15. 

  15.       <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
    16. 

  16.       <li><a href="modules.html"><span>Modules</span></a></li>
    17. 

  17.       <li><a href="annotated.html"><span>Data&nbsp;Structures</span></a></li>
    18. 

  18.       <li class="current"><a href="files.html"><span>Files</span></a></li>
    19. 

  19.       <li><a href="dirs.html"><span>Directories</span></a></li>
    20. 

  20.       <li><a href="examples.html"><span>Examples</span></a></li>
    21. 

  21.     </ul>
    22. 

  22.   </div>
    23. 

  23.   <div class="tabs">
    24. 

  24.     <ul>
    25. 

  25.       <li><a href="files.html"><span>File&nbsp;List</span></a></li>
    26. 

  26.       <li><a href="globals.html"><span>Globals</span></a></li>
    27. 

  27.     </ul>
    28. 

  28.   </div>
    29. 

  29.   <div class="navpath"><a class="el" href="dir_2bb2cfd8296a7c3e25e97aa2e3d0a212.html">cpu</a>&nbsp;&raquo&nbsp;<a class="el" href="dir_e68658a80db834fb0d1d37b2918a44a9.html">stm32w108</a>&nbsp;&raquo&nbsp;<a class="el" href="dir_3f7decbb5751dc5c993c752361ce029c.html">e_stdio</a>&nbsp;&raquo&nbsp;<a class="el" href="dir_93ef7220dffdb5a19e30c8138778adf2.html">src</a>
    30. 

  30.   </div>
    31. 

  31. </div>
    32. 

  32. <div class="contents">
    33. 

  33. <h1>small_mprec.c</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/****************************************************************</span>
    34. 

  34. <a name="l00002"></a>00002 <span class="comment"> *</span>
    35. 

  35. <a name="l00003"></a>00003 <span class="comment"> * The author of this software is David M. Gay.</span>
    36. 

  36. <a name="l00004"></a>00004 <span class="comment"> *</span>
    37. 

  37. <a name="l00005"></a>00005 <span class="comment"> * Copyright (c) 1991 by AT&amp;T.</span>
    38. 

  38. <a name="l00006"></a>00006 <span class="comment"> *</span>
    39. 

  39. <a name="l00007"></a>00007 <span class="comment"> * Permission to use, copy, modify, and distribute this software for any</span>
    40. 

  40. <a name="l00008"></a>00008 <span class="comment"> * purpose without fee is hereby granted, provided that this entire notice</span>
    41. 

  41. <a name="l00009"></a>00009 <span class="comment"> * is included in all copies of any software which is or includes a copy</span>
    42. 

  42. <a name="l00010"></a>00010 <span class="comment"> * or modification of this software and in all copies of the supporting</span>
    43. 

  43. <a name="l00011"></a>00011 <span class="comment"> * documentation for such software.</span>
    44. 

  44. <a name="l00012"></a>00012 <span class="comment"> *</span>
    45. 

  45. <a name="l00013"></a>00013 <span class="comment"> * THIS SOFTWARE IS BEING PROVIDED &quot;AS IS&quot;, WITHOUT ANY EXPRESS OR IMPLIED</span>
    46. 

  46. <a name="l00014"></a>00014 <span class="comment"> * WARRANTY.  IN PARTICULAR, NEITHER THE AUTHOR NOR AT&amp;T MAKES ANY</span>
    47. 

  47. <a name="l00015"></a>00015 <span class="comment"> * REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY</span>
    48. 

  48. <a name="l00016"></a>00016 <span class="comment"> * OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.</span>
    49. 

  49. <a name="l00017"></a>00017 <span class="comment"> *</span>
    50. 

  50. <a name="l00018"></a>00018 <span class="comment"> ***************************************************************/</span>
    51. 

  51. <a name="l00019"></a>00019 
    52. 

  52. <a name="l00020"></a>00020 <span class="comment">/* Please send bug reports to</span>
    53. 

  53. <a name="l00021"></a>00021 <span class="comment">        David M. Gay</span>
    54. 

  54. <a name="l00022"></a>00022 <span class="comment">        AT&amp;T Bell Laboratories, Room 2C-463</span>
    55. 

  55. <a name="l00023"></a>00023 <span class="comment">        600 Mountain Avenue</span>
    56. 

  56. <a name="l00024"></a>00024 <span class="comment">        Murray Hill, NJ 07974-2070</span>
    57. 

  57. <a name="l00025"></a>00025 <span class="comment">        U.S.A.</span>
    58. 

  58. <a name="l00026"></a>00026 <span class="comment">        dmg@research.att.com or research!dmg</span>
    59. 

  59. <a name="l00027"></a>00027 <span class="comment"> */</span>
    60. 

  60. <a name="l00028"></a>00028 
    61. 

  61. <a name="l00029"></a>00029 <span class="comment">/* strtod for IEEE-, VAX-, and IBM-arithmetic machines.</span>
    62. 

  62. <a name="l00030"></a>00030 <span class="comment"> *</span>
    63. 

  63. <a name="l00031"></a>00031 <span class="comment"> * This strtod returns a nearest machine number to the input decimal</span>
    64. 

  64. <a name="l00032"></a>00032 <span class="comment"> * string (or sets errno to ERANGE).  With IEEE arithmetic, ties are</span>
    65. 

  65. <a name="l00033"></a>00033 <span class="comment"> * broken by the IEEE round-even rule.  Otherwise ties are broken by</span>
    66. 

  66. <a name="l00034"></a>00034 <span class="comment"> * biased rounding (add half and chop).</span>
    67. 

  67. <a name="l00035"></a>00035 <span class="comment"> *</span>
    68. 

  68. <a name="l00036"></a>00036 <span class="comment"> * Inspired loosely by William D. Clinger&apos;s paper &quot;How to Read Floating</span>
    69. 

  69. <a name="l00037"></a>00037 <span class="comment"> * Point Numbers Accurately&quot; [Proc. ACM SIGPLAN &apos;90, pp. 92-101].</span>
    70. 

  70. <a name="l00038"></a>00038 <span class="comment"> *</span>
    71. 

  71. <a name="l00039"></a>00039 <span class="comment"> * Modifications:</span>
    72. 

  72. <a name="l00040"></a>00040 <span class="comment"> *</span>
    73. 

  73. <a name="l00041"></a>00041 <span class="comment"> *      1. We only require IEEE, IBM, or VAX double-precision</span>
    74. 

  74. <a name="l00042"></a>00042 <span class="comment"> *              arithmetic (not IEEE double-extended).</span>
    75. 

  75. <a name="l00043"></a>00043 <span class="comment"> *      2. We get by with floating-point arithmetic in a case that</span>
    76. 

  76. <a name="l00044"></a>00044 <span class="comment"> *              Clinger missed -- when we&apos;re computing d * 10^n</span>
    77. 

  77. <a name="l00045"></a>00045 <span class="comment"> *              for a small integer d and the integer n is not too</span>
    78. 

  78. <a name="l00046"></a>00046 <span class="comment"> *              much larger than 22 (the maximum integer k for which</span>
    79. 

  79. <a name="l00047"></a>00047 <span class="comment"> *              we can represent 10^k exactly), we may be able to</span>
    80. 

  80. <a name="l00048"></a>00048 <span class="comment"> *              compute (d*10^k) * 10^(e-k) with just one roundoff.</span>
    81. 

  81. <a name="l00049"></a>00049 <span class="comment"> *      3. Rather than a bit-at-a-time adjustment of the binary</span>
    82. 

  82. <a name="l00050"></a>00050 <span class="comment"> *              result in the hard case, we use floating-point</span>
    83. 

  83. <a name="l00051"></a>00051 <span class="comment"> *              arithmetic to determine the adjustment to within</span>
    84. 

  84. <a name="l00052"></a>00052 <span class="comment"> *              one bit; only in really hard cases do we need to</span>
    85. 

  85. <a name="l00053"></a>00053 <span class="comment"> *              compute a second residual.</span>
    86. 

  86. <a name="l00054"></a>00054 <span class="comment"> *      4. Because of 3., we don&apos;t need a large table of powers of 10</span>
    87. 

  87. <a name="l00055"></a>00055 <span class="comment"> *              for ten-to-e (just some small tables, e.g. of 10^k</span>
    88. 

  88. <a name="l00056"></a>00056 <span class="comment"> *              for 0 &lt;= k &lt;= 22).</span>
    89. 

  89. <a name="l00057"></a>00057 <span class="comment"> */</span>
    90. 

  90. <a name="l00058"></a>00058 
    91. 

  91. <a name="l00059"></a>00059 <span class="comment">/*</span>
    92. 

  92. <a name="l00060"></a>00060 <span class="comment"> * #define IEEE_8087 for IEEE-arithmetic machines where the least</span>
    93. 

  93. <a name="l00061"></a>00061 <span class="comment"> *      significant byte has the lowest address.</span>
    94. 

  94. <a name="l00062"></a>00062 <span class="comment"> * #define IEEE_MC68k for IEEE-arithmetic machines where the most</span>
    95. 

  95. <a name="l00063"></a>00063 <span class="comment"> *      significant byte has the lowest address.</span>
    96. 

  96. <a name="l00064"></a>00064 <span class="comment"> * #define Sudden_Underflow for IEEE-format machines without gradual</span>
    97. 

  97. <a name="l00065"></a>00065 <span class="comment"> *      underflow (i.e., that flush to zero on underflow).</span>
    98. 

  98. <a name="l00066"></a>00066 <span class="comment"> * #define IBM for IBM mainframe-style floating-point arithmetic.</span>
    99. 

  99. <a name="l00067"></a>00067 <span class="comment"> * #define VAX for VAX-style floating-point arithmetic.</span>
    100. 

  100. <a name="l00068"></a>00068 <span class="comment"> * #define Unsigned_Shifts if &gt;&gt; does treats its left operand as unsigned.</span>
    101. 

  101. <a name="l00069"></a>00069 <span class="comment"> * #define No_leftright to omit left-right logic in fast floating-point</span>
    102. 

  102. <a name="l00070"></a>00070 <span class="comment"> *      computation of dtoa.</span>
    103. 

  103. <a name="l00071"></a>00071 <span class="comment"> * #define Check_FLT_ROUNDS if FLT_ROUNDS can assume the values 2 or 3.</span>
    104. 

  104. <a name="l00072"></a>00072 <span class="comment"> * #define RND_PRODQUOT to use rnd_prod and rnd_quot (assembly routines</span>
    105. 

  105. <a name="l00073"></a>00073 <span class="comment"> *      that use extended-precision instructions to compute rounded</span>
    106. 

  106. <a name="l00074"></a>00074 <span class="comment"> *      products and quotients) with IBM.</span>
    107. 

  107. <a name="l00075"></a>00075 <span class="comment"> * #define ROUND_BIASED for IEEE-format with biased rounding.</span>
    108. 

  108. <a name="l00076"></a>00076 <span class="comment"> * #define Inaccurate_Divide for IEEE-format with correctly rounded</span>
    109. 

  109. <a name="l00077"></a>00077 <span class="comment"> *      products but inaccurate quotients, e.g., for Intel i860.</span>
    110. 

  110. <a name="l00078"></a>00078 <span class="comment"> * #define Just_16 to store 16 bits per 32-bit long when doing high-precision</span>
    111. 

  111. <a name="l00079"></a>00079 <span class="comment"> *      integer arithmetic.  Whether this speeds things up or slows things</span>
    112. 

  112. <a name="l00080"></a>00080 <span class="comment"> *      down depends on the machine and the number being converted.</span>
    113. 

  113. <a name="l00081"></a>00081 <span class="comment"> */</span>
    114. 

  114. <a name="l00082"></a>00082 
    115. 

  115. <a name="l00083"></a>00083 
    116. 

  116. <a name="l00084"></a>00084 
    117. 

  117. <a name="l00085"></a>00085 <span class="preprocessor">#include &lt;_ansi.h&gt;</span>
    118. 

  118. <a name="l00086"></a>00086 <span class="preprocessor">#include &lt;stdlib.h&gt;</span>
    119. 

  119. <a name="l00087"></a>00087 <span class="preprocessor">#include &lt;string.h&gt;</span>
    120. 

  120. <a name="l00088"></a>00088 <span class="preprocessor">#include &lt;reent.h&gt;</span>
    121. 

  121. <a name="l00089"></a>00089 <span class="preprocessor">#include &quot;small_mprec.h&quot;</span>
    122. 

  122. <a name="l00090"></a>00090 
    123. 

  123. <a name="l00091"></a>00091 <span class="comment">/* reent.c knows this value */</span>
    124. 

  124. <a name="l00092"></a>00092 <span class="preprocessor">#define _Kmax 15</span>
    125. 

  125. <a name="l00093"></a>00093 <span class="preprocessor"></span>
    126. 

  126. <a name="l00094"></a>00094 <span class="preprocessor">#if defined (_SMALL_PRINTF) || defined(SMALL_SCANF)</span>
    127. 

  127. <a name="l00095"></a>00095 <span class="preprocessor"></span><span class="preprocessor">#define SMALL_LIB</span>
    128. 

  128. <a name="l00096"></a>00096 <span class="preprocessor"></span><span class="preprocessor">#else</span>
    129. 

  129. <a name="l00097"></a>00097 <span class="preprocessor"></span><span class="preprocessor">#define FULL_LIB</span>
    130. 

  130. <a name="l00098"></a>00098 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
    131. 

  131. <a name="l00099"></a>00099 <span class="preprocessor"></span>
    132. 

  132. <a name="l00100"></a>00100 <span class="comment">/* SMALL_LIB is only defined if _SMALL_PRINTF or SMALL_SCANF have been defined</span>
    133. 

  133. <a name="l00101"></a>00101 <span class="comment"> * which means that if you do only specified _SMALL_PRINTF and not SMALL_SCANF</span>
    134. 

  134. <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>
    135. 

  135. <a name="l00103"></a>00103 <span class="comment"> * performed for both printf and scanf </span>
    136. 

  136. <a name="l00104"></a>00104 <span class="comment"> */</span>
    137. 

  137. <a name="l00105"></a>00105 
    138. 

  138. <a name="l00106"></a>00106 
    139. 

  139. <a name="l00107"></a>00107 
    140. 

  140. <a name="l00108"></a>00108 <span class="preprocessor">#ifdef FULL_LIB</span>
    141. 

  141. <a name="l00109"></a>00109 <span class="preprocessor"></span>
    142. 

  142. <a name="l00110"></a>00110 
    143. 

  143. <a name="l00111"></a>00111 
    144. 

  144. <a name="l00112"></a>00112 _Bigint *
    145. 

  145. <a name="l00113"></a>00113 _DEFUN (Balloc, (ptr, k), <span class="keyword">struct</span> _reent *ptr _AND <span class="keywordtype">int</span> k)
    146. 

  146. <a name="l00114"></a>00114 {
    147. 

  147. <a name="l00115"></a>00115   <span class="keywordtype">int</span> x;
    148. 

  148. <a name="l00116"></a>00116   _Bigint *rv ;
    149. 

  149. <a name="l00117"></a>00117 
    150. 

  150. <a name="l00118"></a>00118   _REENT_CHECK_MP(ptr);
    151. 

  151. <a name="l00119"></a>00119   <span class="keywordflow">if</span> (_REENT_MP_FREELIST(ptr) == NULL)
    152. 

  152. <a name="l00120"></a>00120     {
    153. 

  153. <a name="l00121"></a>00121       <span class="comment">/* Allocate a list of pointers to the mprec objects */</span>
    154. 

  154. <a name="l00122"></a>00122       _REENT_MP_FREELIST(ptr) = (<span class="keyword">struct </span>_Bigint **) _calloc_r (ptr, 
    155. 

  155. <a name="l00123"></a>00123                                                       <span class="keyword">sizeof</span> (<span class="keyword">struct</span> _Bigint *),
    156. 

  156. <a name="l00124"></a>00124                                                       _Kmax + 1);
    157. 

  157. <a name="l00125"></a>00125       <span class="keywordflow">if</span> (_REENT_MP_FREELIST(ptr) == NULL)
    158. 

  158. <a name="l00126"></a>00126         {
    159. 

  159. <a name="l00127"></a>00127           <span class="keywordflow">return</span> NULL;
    160. 

  160. <a name="l00128"></a>00128         }
    161. 

  161. <a name="l00129"></a>00129     }
    162. 

  162. <a name="l00130"></a>00130 
    163. 

  163. <a name="l00131"></a>00131   <span class="keywordflow">if</span> ((rv = _REENT_MP_FREELIST(ptr)[k]) != 0)
    164. 

  164. <a name="l00132"></a>00132     {
    165. 

  165. <a name="l00133"></a>00133       _REENT_MP_FREELIST(ptr)[k] = rv-&gt;_next;
    166. 

  166. <a name="l00134"></a>00134     }
    167. 

  167. <a name="l00135"></a>00135   <span class="keywordflow">else</span>
    168. 

  168. <a name="l00136"></a>00136     {
    169. 

  169. <a name="l00137"></a>00137       x = 1 &lt;&lt; k;
    170. 

  170. <a name="l00138"></a>00138       <span class="comment">/* Allocate an mprec Bigint and stick in in the freelist */</span>
    171. 

  171. <a name="l00139"></a>00139       rv = (_Bigint *) _calloc_r (ptr,
    172. 

  172. <a name="l00140"></a>00140                                   1,
    173. 

  173. <a name="l00141"></a>00141                                   <span class="keyword">sizeof</span> (_Bigint) +
    174. 

  174. <a name="l00142"></a>00142                                   (x-1) * <span class="keyword">sizeof</span>(rv-&gt;_x));
    175. 

  175. <a name="l00143"></a>00143       <span class="keywordflow">if</span> (rv == NULL) <span class="keywordflow">return</span> NULL;
    176. 

  176. <a name="l00144"></a>00144       rv-&gt;_k = k;
    177. 

  177. <a name="l00145"></a>00145       rv-&gt;_maxwds = x;
    178. 

  178. <a name="l00146"></a>00146     }
    179. 

  179. <a name="l00147"></a>00147   rv-&gt;_sign = rv-&gt;_wds = 0;
    180. 

  180. <a name="l00148"></a>00148   <span class="keywordflow">return</span> rv;
    181. 

  181. <a name="l00149"></a>00149 }
    182. 

  182. <a name="l00150"></a>00150 
    183. 

  183. <a name="l00151"></a>00151 <span class="keywordtype">void</span>
    184. 

  184. <a name="l00152"></a>00152 _DEFUN (Bfree, (ptr, v), <span class="keyword">struct</span> _reent *ptr _AND _Bigint * v)
    185. 

  185. <a name="l00153"></a>00153 {
    186. 

  186. <a name="l00154"></a>00154   _REENT_CHECK_MP(ptr);
    187. 

  187. <a name="l00155"></a>00155   <span class="keywordflow">if</span> (v)
    188. 

  188. <a name="l00156"></a>00156     {
    189. 

  189. <a name="l00157"></a>00157       v-&gt;_next = _REENT_MP_FREELIST(ptr)[v-&gt;_k];
    190. 

  190. <a name="l00158"></a>00158       _REENT_MP_FREELIST(ptr)[v-&gt;_k] = v;
    191. 

  191. <a name="l00159"></a>00159     }
    192. 

  192. <a name="l00160"></a>00160 }
    193. 

  193. <a name="l00161"></a>00161 
    194. 

  194. <a name="l00162"></a>00162 
    195. 

  195. <a name="l00163"></a>00163 _Bigint *
    196. 

  196. <a name="l00164"></a>00164 _DEFUN (multadd, (ptr, b, m, a),
    197. 

  197. <a name="l00165"></a>00165         <span class="keyword">struct</span> _reent *ptr _AND
    198. 

  198. <a name="l00166"></a>00166         _Bigint * b _AND
    199. 

  199. <a name="l00167"></a>00167         <span class="keywordtype">int</span> m _AND
    200. 

  200. <a name="l00168"></a>00168         <span class="keywordtype">int</span> a)
    201. 

  201. <a name="l00169"></a>00169 {
    202. 

  202. <a name="l00170"></a>00170   <span class="keywordtype">int</span> i, wds;
    203. 

  203. <a name="l00171"></a>00171   __ULong *x, y;
    204. 

  204. <a name="l00172"></a>00172 <span class="preprocessor">#ifdef Pack_32</span>
    205. 

  205. <a name="l00173"></a>00173 <span class="preprocessor"></span>  __ULong xi, z;
    206. 

  206. <a name="l00174"></a>00174 <span class="preprocessor">#endif</span>
    207. 

  207. <a name="l00175"></a>00175 <span class="preprocessor"></span>  _Bigint *b1;
    208. 

  208. <a name="l00176"></a>00176 
    209. 

  209. <a name="l00177"></a>00177   wds = b-&gt;_wds;
    210. 

  210. <a name="l00178"></a>00178   x = b-&gt;_x;
    211. 

  211. <a name="l00179"></a>00179   i = 0;
    212. 

  212. <a name="l00180"></a>00180   <span class="keywordflow">do</span>
    213. 

  213. <a name="l00181"></a>00181     {
    214. 

  214. <a name="l00182"></a>00182 <span class="preprocessor">#ifdef Pack_32</span>
    215. 

  215. <a name="l00183"></a>00183 <span class="preprocessor"></span>      xi = *x;
    216. 

  216. <a name="l00184"></a>00184       y = (xi &amp; 0xffff) * m + a;
    217. 

  217. <a name="l00185"></a>00185       z = (xi &gt;&gt; 16) * m + (y &gt;&gt; 16);
    218. 

  218. <a name="l00186"></a>00186       a = (int) (z &gt;&gt; 16);
    219. 

  219. <a name="l00187"></a>00187       *x++ = (z &lt;&lt; 16) + (y &amp; 0xffff);
    220. 

  220. <a name="l00188"></a>00188 <span class="preprocessor">#else</span>
    221. 

  221. <a name="l00189"></a>00189 <span class="preprocessor"></span>      y = *x * m + a;
    222. 

  222. <a name="l00190"></a>00190       a = (int) (y &gt;&gt; 16);
    223. 

  223. <a name="l00191"></a>00191       *x++ = y &amp; 0xffff;
    224. 

  224. <a name="l00192"></a>00192 <span class="preprocessor">#endif</span>
    225. 

  225. <a name="l00193"></a>00193 <span class="preprocessor"></span>    }
    226. 

  226. <a name="l00194"></a>00194   <span class="keywordflow">while</span> (++i &lt; wds);
    227. 

  227. <a name="l00195"></a>00195   <span class="keywordflow">if</span> (a)
    228. 

  228. <a name="l00196"></a>00196     {
    229. 

  229. <a name="l00197"></a>00197       <span class="keywordflow">if</span> (wds &gt;= b-&gt;_maxwds)
    230. 

  230. <a name="l00198"></a>00198         {
    231. 

  231. <a name="l00199"></a>00199           b1 = Balloc (ptr, b-&gt;_k + 1);
    232. 

  232. <a name="l00200"></a>00200           Bcopy (b1, b);
    233. 

  233. <a name="l00201"></a>00201           Bfree (ptr, b);
    234. 

  234. <a name="l00202"></a>00202           b = b1;
    235. 

  235. <a name="l00203"></a>00203         }
    236. 

  236. <a name="l00204"></a>00204       b-&gt;_x[wds++] = a;
    237. 

  237. <a name="l00205"></a>00205       b-&gt;_wds = wds;
    238. 

  238. <a name="l00206"></a>00206     }
    239. 

  239. <a name="l00207"></a>00207   <span class="keywordflow">return</span> b;
    240. 

  240. <a name="l00208"></a>00208 }
    241. 

  241. <a name="l00209"></a>00209 
    242. 

  242. <a name="l00210"></a>00210 _Bigint *
    243. 

  243. <a name="l00211"></a>00211 _DEFUN (s2b, (ptr, s, nd0, nd, y9),
    244. 

  244. <a name="l00212"></a>00212         <span class="keyword">struct</span> _reent * ptr _AND
    245. 

  245. <a name="l00213"></a>00213         _CONST <span class="keywordtype">char</span> *s _AND
    246. 

  246. <a name="l00214"></a>00214         <span class="keywordtype">int</span> nd0 _AND
    247. 

  247. <a name="l00215"></a>00215         <span class="keywordtype">int</span> nd _AND
    248. 

  248. <a name="l00216"></a>00216         __ULong y9)
    249. 

  249. <a name="l00217"></a>00217 {
    250. 

  250. <a name="l00218"></a>00218   _Bigint *b;
    251. 

  251. <a name="l00219"></a>00219   <span class="keywordtype">int</span> i, k;
    252. 

  252. <a name="l00220"></a>00220   __Long x, y;
    253. 

  253. <a name="l00221"></a>00221 
    254. 

  254. <a name="l00222"></a>00222   x = (nd + 8) / 9;
    255. 

  255. <a name="l00223"></a>00223   <span class="keywordflow">for</span> (k = 0, y = 1; x &gt; y; y &lt;&lt;= 1, k++);
    256. 

  256. <a name="l00224"></a>00224 <span class="preprocessor">#ifdef Pack_32</span>
    257. 

  257. <a name="l00225"></a>00225 <span class="preprocessor"></span>  b = Balloc (ptr, k);
    258. 

  258. <a name="l00226"></a>00226   b-&gt;_x[0] = y9;
    259. 

  259. <a name="l00227"></a>00227   b-&gt;_wds = 1;
    260. 

  260. <a name="l00228"></a>00228 <span class="preprocessor">#else</span>
    261. 

  261. <a name="l00229"></a>00229 <span class="preprocessor"></span>  b = Balloc (ptr, k + 1);
    262. 

  262. <a name="l00230"></a>00230   b-&gt;_x[0] = y9 &amp; 0xffff;
    263. 

  263. <a name="l00231"></a>00231   b-&gt;_wds = (b-&gt;_x[1] = y9 &gt;&gt; 16) ? 2 : 1;
    264. 

  264. <a name="l00232"></a>00232 <span class="preprocessor">#endif</span>
    265. 

  265. <a name="l00233"></a>00233 <span class="preprocessor"></span>
    266. 

  266. <a name="l00234"></a>00234   i = 9;
    267. 

  267. <a name="l00235"></a>00235   <span class="keywordflow">if</span> (9 &lt; nd0)
    268. 

  268. <a name="l00236"></a>00236     {
    269. 

  269. <a name="l00237"></a>00237       s += 9;
    270. 

  270. <a name="l00238"></a>00238       <span class="keywordflow">do</span>
    271. 

  271. <a name="l00239"></a>00239         b = multadd (ptr, b, 10, *s++ - <span class="charliteral">&apos;0&apos;</span>);
    272. 

  272. <a name="l00240"></a>00240       <span class="keywordflow">while</span> (++i &lt; nd0);
    273. 

  273. <a name="l00241"></a>00241       s++;
    274. 

  274. <a name="l00242"></a>00242     }
    275. 

  275. <a name="l00243"></a>00243   <span class="keywordflow">else</span>
    276. 

  276. <a name="l00244"></a>00244     s += 10;
    277. 

  277. <a name="l00245"></a>00245   <span class="keywordflow">for</span> (; i &lt; nd; i++)
    278. 

  278. <a name="l00246"></a>00246     b = multadd (ptr, b, 10, *s++ - <span class="charliteral">&apos;0&apos;</span>);
    279. 

  279. <a name="l00247"></a>00247   <span class="keywordflow">return</span> b;
    280. 

  280. <a name="l00248"></a>00248 }
    281. 

  281. <a name="l00249"></a>00249 
    282. 

  282. <a name="l00250"></a>00250 <span class="keywordtype">int</span>
    283. 

  283. <a name="l00251"></a>00251 _DEFUN (hi0bits,
    284. 

  284. <a name="l00252"></a>00252         (x), <span class="keyword">register</span> __ULong x)
    285. 

  285. <a name="l00253"></a>00253 {
    286. 

  286. <a name="l00254"></a>00254   <span class="keyword">register</span> <span class="keywordtype">int</span> k = 0;
    287. 

  287. <a name="l00255"></a>00255 
    288. 

  288. <a name="l00256"></a>00256   <span class="keywordflow">if</span> (!(x &amp; 0xffff0000))
    289. 

  289. <a name="l00257"></a>00257     {
    290. 

  290. <a name="l00258"></a>00258       k = 16;
    291. 

  291. <a name="l00259"></a>00259       x &lt;&lt;= 16;
    292. 

  292. <a name="l00260"></a>00260     }
    293. 

  293. <a name="l00261"></a>00261   <span class="keywordflow">if</span> (!(x &amp; 0xff000000))
    294. 

  294. <a name="l00262"></a>00262     {
    295. 

  295. <a name="l00263"></a>00263       k += 8;
    296. 

  296. <a name="l00264"></a>00264       x &lt;&lt;= 8;
    297. 

  297. <a name="l00265"></a>00265     }
    298. 

  298. <a name="l00266"></a>00266   <span class="keywordflow">if</span> (!(x &amp; 0xf0000000))
    299. 

  299. <a name="l00267"></a>00267     {
    300. 

  300. <a name="l00268"></a>00268       k += 4;
    301. 

  301. <a name="l00269"></a>00269       x &lt;&lt;= 4;
    302. 

  302. <a name="l00270"></a>00270     }
    303. 

  303. <a name="l00271"></a>00271   <span class="keywordflow">if</span> (!(x &amp; 0xc0000000))
    304. 

  304. <a name="l00272"></a>00272     {
    305. 

  305. <a name="l00273"></a>00273       k += 2;
    306. 

  306. <a name="l00274"></a>00274       x &lt;&lt;= 2;
    307. 

  307. <a name="l00275"></a>00275     }
    308. 

  308. <a name="l00276"></a>00276   <span class="keywordflow">if</span> (!(x &amp; 0x80000000))
    309. 

  309. <a name="l00277"></a>00277     {
    310. 

  310. <a name="l00278"></a>00278       k++;
    311. 

  311. <a name="l00279"></a>00279       <span class="keywordflow">if</span> (!(x &amp; 0x40000000))
    312. 

  312. <a name="l00280"></a>00280         <span class="keywordflow">return</span> 32;
    313. 

  313. <a name="l00281"></a>00281     }
    314. 

  314. <a name="l00282"></a>00282   <span class="keywordflow">return</span> k;
    315. 

  315. <a name="l00283"></a>00283 }
    316. 

  316. <a name="l00284"></a>00284 
    317. 

  317. <a name="l00285"></a>00285 <span class="keywordtype">int</span>
    318. 

  318. <a name="l00286"></a>00286 _DEFUN (lo0bits, (y), __ULong *y)
    319. 

  319. <a name="l00287"></a>00287 {
    320. 

  320. <a name="l00288"></a>00288   <span class="keyword">register</span> <span class="keywordtype">int</span> k;
    321. 

  321. <a name="l00289"></a>00289   <span class="keyword">register</span> __ULong x = *y;
    322. 

  322. <a name="l00290"></a>00290 
    323. 

  323. <a name="l00291"></a>00291   <span class="keywordflow">if</span> (x &amp; 7)
    324. 

  324. <a name="l00292"></a>00292     {
    325. 

  325. <a name="l00293"></a>00293       <span class="keywordflow">if</span> (x &amp; 1)
    326. 

  326. <a name="l00294"></a>00294         <span class="keywordflow">return</span> 0;
    327. 

  327. <a name="l00295"></a>00295       <span class="keywordflow">if</span> (x &amp; 2)
    328. 

  328. <a name="l00296"></a>00296         {
    329. 

  329. <a name="l00297"></a>00297           *y = x &gt;&gt; 1;
    330. 

  330. <a name="l00298"></a>00298           <span class="keywordflow">return</span> 1;
    331. 

  331. <a name="l00299"></a>00299         }
    332. 

  332. <a name="l00300"></a>00300       *y = x &gt;&gt; 2;
    333. 

  333. <a name="l00301"></a>00301       <span class="keywordflow">return</span> 2;
    334. 

  334. <a name="l00302"></a>00302     }
    335. 

  335. <a name="l00303"></a>00303   k = 0;
    336. 

  336. <a name="l00304"></a>00304   <span class="keywordflow">if</span> (!(x &amp; 0xffff))
    337. 

  337. <a name="l00305"></a>00305     {
    338. 

  338. <a name="l00306"></a>00306       k = 16;
    339. 

  339. <a name="l00307"></a>00307       x &gt;&gt;= 16;
    340. 

  340. <a name="l00308"></a>00308     }
    341. 

  341. <a name="l00309"></a>00309   <span class="keywordflow">if</span> (!(x &amp; 0xff))
    342. 

  342. <a name="l00310"></a>00310     {
    343. 

  343. <a name="l00311"></a>00311       k += 8;
    344. 

  344. <a name="l00312"></a>00312       x &gt;&gt;= 8;
    345. 

  345. <a name="l00313"></a>00313     }
    346. 

  346. <a name="l00314"></a>00314   <span class="keywordflow">if</span> (!(x &amp; 0xf))
    347. 

  347. <a name="l00315"></a>00315     {
    348. 

  348. <a name="l00316"></a>00316       k += 4;
    349. 

  349. <a name="l00317"></a>00317       x &gt;&gt;= 4;
    350. 

  350. <a name="l00318"></a>00318     }
    351. 

  351. <a name="l00319"></a>00319   <span class="keywordflow">if</span> (!(x &amp; 0x3))
    352. 

  352. <a name="l00320"></a>00320     {
    353. 

  353. <a name="l00321"></a>00321       k += 2;
    354. 

  354. <a name="l00322"></a>00322       x &gt;&gt;= 2;
    355. 

  355. <a name="l00323"></a>00323     }
    356. 

  356. <a name="l00324"></a>00324   <span class="keywordflow">if</span> (!(x &amp; 1))
    357. 

  357. <a name="l00325"></a>00325     {
    358. 

  358. <a name="l00326"></a>00326       k++;
    359. 

  359. <a name="l00327"></a>00327       x &gt;&gt;= 1;
    360. 

  360. <a name="l00328"></a>00328       <span class="keywordflow">if</span> (!x &amp; 1)
    361. 

  361. <a name="l00329"></a>00329         <span class="keywordflow">return</span> 32;
    362. 

  362. <a name="l00330"></a>00330     }
    363. 

  363. <a name="l00331"></a>00331   *y = x;
    364. 

  364. <a name="l00332"></a>00332   <span class="keywordflow">return</span> k;
    365. 

  365. <a name="l00333"></a>00333 }
    366. 

  366. <a name="l00334"></a>00334 
    367. 

  367. <a name="l00335"></a>00335 _Bigint *
    368. 

  368. <a name="l00336"></a>00336 _DEFUN (i2b, (ptr, i), <span class="keyword">struct</span> _reent * ptr _AND <span class="keywordtype">int</span> i)
    369. 

  369. <a name="l00337"></a>00337 {
    370. 

  370. <a name="l00338"></a>00338   _Bigint *b;
    371. 

  371. <a name="l00339"></a>00339 
    372. 

  372. <a name="l00340"></a>00340   b = Balloc (ptr, 1);
    373. 

  373. <a name="l00341"></a>00341   b-&gt;_x[0] = i;
    374. 

  374. <a name="l00342"></a>00342   b-&gt;_wds = 1;
    375. 

  375. <a name="l00343"></a>00343   <span class="keywordflow">return</span> b;
    376. 

  376. <a name="l00344"></a>00344 }
    377. 

  377. <a name="l00345"></a>00345 
    378. 

  378. <a name="l00346"></a>00346 _Bigint *
    379. 

  379. <a name="l00347"></a>00347 _DEFUN (mult, (ptr, a, b), <span class="keyword">struct</span> _reent * ptr _AND _Bigint * a _AND _Bigint * b)
    380. 

  380. <a name="l00348"></a>00348 {
    381. 

  381. <a name="l00349"></a>00349   _Bigint *c;
    382. 

  382. <a name="l00350"></a>00350   <span class="keywordtype">int</span> k, wa, wb, wc;
    383. 

  383. <a name="l00351"></a>00351   __ULong carry, y, z;
    384. 

  384. <a name="l00352"></a>00352   __ULong *x, *xa, *xae, *xb, *xbe, *xc, *xc0;
    385. 

  385. <a name="l00353"></a>00353 <span class="preprocessor">#ifdef Pack_32</span>
    386. 

  386. <a name="l00354"></a>00354 <span class="preprocessor"></span>  __ULong z2;
    387. 

  387. <a name="l00355"></a>00355 <span class="preprocessor">#endif</span>
    388. 

  388. <a name="l00356"></a>00356 <span class="preprocessor"></span>
    389. 

  389. <a name="l00357"></a>00357   <span class="keywordflow">if</span> (a-&gt;_wds &lt; b-&gt;_wds)
    390. 

  390. <a name="l00358"></a>00358     {
    391. 

  391. <a name="l00359"></a>00359       c = a;
    392. 

  392. <a name="l00360"></a>00360       a = b;
    393. 

  393. <a name="l00361"></a>00361       b = c;
    394. 

  394. <a name="l00362"></a>00362     }
    395. 

  395. <a name="l00363"></a>00363   k = a-&gt;_k;
    396. 

  396. <a name="l00364"></a>00364   wa = a-&gt;_wds;
    397. 

  397. <a name="l00365"></a>00365   wb = b-&gt;_wds;
    398. 

  398. <a name="l00366"></a>00366   wc = wa + wb;
    399. 

  399. <a name="l00367"></a>00367   <span class="keywordflow">if</span> (wc &gt; a-&gt;_maxwds)
    400. 

  400. <a name="l00368"></a>00368     k++;
    401. 

  401. <a name="l00369"></a>00369   c = Balloc (ptr, k);
    402. 

  402. <a name="l00370"></a>00370   <span class="keywordflow">for</span> (x = c-&gt;_x, xa = x + wc; x &lt; xa; x++)
    403. 

  403. <a name="l00371"></a>00371     *x = 0;
    404. 

  404. <a name="l00372"></a>00372   xa = a-&gt;_x;
    405. 

  405. <a name="l00373"></a>00373   xae = xa + wa;
    406. 

  406. <a name="l00374"></a>00374   xb = b-&gt;_x;
    407. 

  407. <a name="l00375"></a>00375   xbe = xb + wb;
    408. 

  408. <a name="l00376"></a>00376   xc0 = c-&gt;_x;
    409. 

  409. <a name="l00377"></a>00377 <span class="preprocessor">#ifdef Pack_32</span>
    410. 

  410. <a name="l00378"></a>00378 <span class="preprocessor"></span>  <span class="keywordflow">for</span> (; xb &lt; xbe; xb++, xc0++)
    411. 

  411. <a name="l00379"></a>00379     {
    412. 

  412. <a name="l00380"></a>00380       <span class="keywordflow">if</span> ((y = *xb &amp; 0xffff) != 0)
    413. 

  413. <a name="l00381"></a>00381         {
    414. 

  414. <a name="l00382"></a>00382           x = xa;
    415. 

  415. <a name="l00383"></a>00383           xc = xc0;
    416. 

  416. <a name="l00384"></a>00384           carry = 0;
    417. 

  417. <a name="l00385"></a>00385           <span class="keywordflow">do</span>
    418. 

  418. <a name="l00386"></a>00386             {
    419. 

  419. <a name="l00387"></a>00387               z = (*x &amp; 0xffff) * y + (*xc &amp; 0xffff) + carry;
    420. 

  420. <a name="l00388"></a>00388               carry = z &gt;&gt; 16;
    421. 

  421. <a name="l00389"></a>00389               z2 = (*x++ &gt;&gt; 16) * y + (*xc &gt;&gt; 16) + carry;
    422. 

  422. <a name="l00390"></a>00390               carry = z2 &gt;&gt; 16;
    423. 

  423. <a name="l00391"></a>00391               Storeinc (xc, z2, z);
    424. 

  424. <a name="l00392"></a>00392             }
    425. 

  425. <a name="l00393"></a>00393           <span class="keywordflow">while</span> (x &lt; xae);
    426. 

  426. <a name="l00394"></a>00394           *xc = carry;
    427. 

  427. <a name="l00395"></a>00395         }
    428. 

  428. <a name="l00396"></a>00396       <span class="keywordflow">if</span> ((y = *xb &gt;&gt; 16) != 0)
    429. 

  429. <a name="l00397"></a>00397         {
    430. 

  430. <a name="l00398"></a>00398           x = xa;
    431. 

  431. <a name="l00399"></a>00399           xc = xc0;
    432. 

  432. <a name="l00400"></a>00400           carry = 0;
    433. 

  433. <a name="l00401"></a>00401           z2 = *xc;
    434. 

  434. <a name="l00402"></a>00402           <span class="keywordflow">do</span>
    435. 

  435. <a name="l00403"></a>00403             {
    436. 

  436. <a name="l00404"></a>00404               z = (*x &amp; 0xffff) * y + (*xc &gt;&gt; 16) + carry;
    437. 

  437. <a name="l00405"></a>00405               carry = z &gt;&gt; 16;
    438. 

  438. <a name="l00406"></a>00406               Storeinc (xc, z, z2);
    439. 

  439. <a name="l00407"></a>00407               z2 = (*x++ &gt;&gt; 16) * y + (*xc &amp; 0xffff) + carry;
    440. 

  440. <a name="l00408"></a>00408               carry = z2 &gt;&gt; 16;
    441. 

  441. <a name="l00409"></a>00409             }
    442. 

  442. <a name="l00410"></a>00410           <span class="keywordflow">while</span> (x &lt; xae);
    443. 

  443. <a name="l00411"></a>00411           *xc = z2;
    444. 

  444. <a name="l00412"></a>00412         }
    445. 

  445. <a name="l00413"></a>00413     }
    446. 

  446. <a name="l00414"></a>00414 <span class="preprocessor">#else</span>
    447. 

  447. <a name="l00415"></a>00415 <span class="preprocessor"></span>  <span class="keywordflow">for</span> (; xb &lt; xbe; xc0++)
    448. 

  448. <a name="l00416"></a>00416     {
    449. 

  449. <a name="l00417"></a>00417       <span class="keywordflow">if</span> (y = *xb++)
    450. 

  450. <a name="l00418"></a>00418         {
    451. 

  451. <a name="l00419"></a>00419           x = xa;
    452. 

  452. <a name="l00420"></a>00420           xc = xc0;
    453. 

  453. <a name="l00421"></a>00421           carry = 0;
    454. 

  454. <a name="l00422"></a>00422           <span class="keywordflow">do</span>
    455. 

  455. <a name="l00423"></a>00423             {
    456. 

  456. <a name="l00424"></a>00424               z = *x++ * y + *xc + carry;
    457. 

  457. <a name="l00425"></a>00425               carry = z &gt;&gt; 16;
    458. 

  458. <a name="l00426"></a>00426               *xc++ = z &amp; 0xffff;
    459. 

  459. <a name="l00427"></a>00427             }
    460. 

  460. <a name="l00428"></a>00428           <span class="keywordflow">while</span> (x &lt; xae);
    461. 

  461. <a name="l00429"></a>00429           *xc = carry;
    462. 

  462. <a name="l00430"></a>00430         }
    463. 

  463. <a name="l00431"></a>00431     }
    464. 

  464. <a name="l00432"></a>00432 <span class="preprocessor">#endif</span>
    465. 

  465. <a name="l00433"></a>00433 <span class="preprocessor"></span>  <span class="keywordflow">for</span> (xc0 = c-&gt;_x, xc = xc0 + wc; wc &gt; 0 &amp;&amp; !*--xc; --wc);
    466. 

  466. <a name="l00434"></a>00434   c-&gt;_wds = wc;
    467. 

  467. <a name="l00435"></a>00435   <span class="keywordflow">return</span> c;
    468. 

  468. <a name="l00436"></a>00436 }
    469. 

  469. <a name="l00437"></a>00437 
    470. 

  470. <a name="l00438"></a>00438 _Bigint *
    471. 

  471. <a name="l00439"></a>00439 _DEFUN (pow5mult,
    472. 

  472. <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)
    473. 

  473. <a name="l00441"></a>00441 {
    474. 

  474. <a name="l00442"></a>00442   _Bigint *b1, *p5, *p51;
    475. 

  475. <a name="l00443"></a>00443   <span class="keywordtype">int</span> i;
    476. 

  476. <a name="l00444"></a>00444   <span class="keyword">static</span> _CONST <span class="keywordtype">int</span> p05[3] = {5, 25, 125};
    477. 

  477. <a name="l00445"></a>00445 
    478. 

  478. <a name="l00446"></a>00446   <span class="keywordflow">if</span> ((i = k &amp; 3) != 0)
    479. 

  479. <a name="l00447"></a>00447     b = multadd (ptr, b, p05[i - 1], 0);
    480. 

  480. <a name="l00448"></a>00448 
    481. 

  481. <a name="l00449"></a>00449   <span class="keywordflow">if</span> (!(k &gt;&gt;= 2))
    482. 

  482. <a name="l00450"></a>00450     <span class="keywordflow">return</span> b;
    483. 

  483. <a name="l00451"></a>00451   _REENT_CHECK_MP(ptr);
    484. 

  484. <a name="l00452"></a>00452   <span class="keywordflow">if</span> (!(p5 = _REENT_MP_P5S(ptr)))
    485. 

  485. <a name="l00453"></a>00453     {
    486. 

  486. <a name="l00454"></a>00454       <span class="comment">/* first time */</span>
    487. 

  487. <a name="l00455"></a>00455       p5 = _REENT_MP_P5S(ptr) = i2b (ptr, 625);
    488. 

  488. <a name="l00456"></a>00456       p5-&gt;_next = 0;
    489. 

  489. <a name="l00457"></a>00457     }
    490. 

  490. <a name="l00458"></a>00458   <span class="keywordflow">for</span> (;;)
    491. 

  491. <a name="l00459"></a>00459     {
    492. 

  492. <a name="l00460"></a>00460       <span class="keywordflow">if</span> (k &amp; 1)
    493. 

  493. <a name="l00461"></a>00461         {
    494. 

  494. <a name="l00462"></a>00462           b1 = mult (ptr, b, p5);
    495. 

  495. <a name="l00463"></a>00463           Bfree (ptr, b);
    496. 

  496. <a name="l00464"></a>00464           b = b1;
    497. 

  497. <a name="l00465"></a>00465         }
    498. 

  498. <a name="l00466"></a>00466       <span class="keywordflow">if</span> (!(k &gt;&gt;= 1))
    499. 

  499. <a name="l00467"></a>00467         <span class="keywordflow">break</span>;
    500. 

  500. <a name="l00468"></a>00468       <span class="keywordflow">if</span> (!(p51 = p5-&gt;_next))
    501. 

  501. <a name="l00469"></a>00469         {
    502. 

  502. <a name="l00470"></a>00470           p51 = p5-&gt;_next = mult (ptr, p5, p5);
    503. 

  503. <a name="l00471"></a>00471           p51-&gt;_next = 0;
    504. 

  504. <a name="l00472"></a>00472         }
    505. 

  505. <a name="l00473"></a>00473       p5 = p51;
    506. 

  506. <a name="l00474"></a>00474     }
    507. 

  507. <a name="l00475"></a>00475   <span class="keywordflow">return</span> b;
    508. 

  508. <a name="l00476"></a>00476 }
    509. 

  509. <a name="l00477"></a>00477 
    510. 

  510. <a name="l00478"></a>00478 _Bigint *
    511. 

  511. <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)
    512. 

  512. <a name="l00480"></a>00480 {
    513. 

  513. <a name="l00481"></a>00481   <span class="keywordtype">int</span> i, k1, n, n1;
    514. 

  514. <a name="l00482"></a>00482   _Bigint *b1;
    515. 

  515. <a name="l00483"></a>00483   __ULong *x, *x1, *xe, z;
    516. 

  516. <a name="l00484"></a>00484 
    517. 

  517. <a name="l00485"></a>00485 <span class="preprocessor">#ifdef Pack_32</span>
    518. 

  518. <a name="l00486"></a>00486 <span class="preprocessor"></span>  n = k &gt;&gt; 5;
    519. 

  519. <a name="l00487"></a>00487 <span class="preprocessor">#else</span>
    520. 

  520. <a name="l00488"></a>00488 <span class="preprocessor"></span>  n = k &gt;&gt; 4;
    521. 

  521. <a name="l00489"></a>00489 <span class="preprocessor">#endif</span>
    522. 

  522. <a name="l00490"></a>00490 <span class="preprocessor"></span>  k1 = b-&gt;_k;
    523. 

  523. <a name="l00491"></a>00491   n1 = n + b-&gt;_wds + 1;
    524. 

  524. <a name="l00492"></a>00492   <span class="keywordflow">for</span> (i = b-&gt;_maxwds; n1 &gt; i; i &lt;&lt;= 1)
    525. 

  525. <a name="l00493"></a>00493     k1++;
    526. 

  526. <a name="l00494"></a>00494   b1 = Balloc (ptr, k1);
    527. 

  527. <a name="l00495"></a>00495   x1 = b1-&gt;_x;
    528. 

  528. <a name="l00496"></a>00496   <span class="keywordflow">for</span> (i = 0; i &lt; n; i++)
    529. 

  529. <a name="l00497"></a>00497     *x1++ = 0;
    530. 

  530. <a name="l00498"></a>00498   x = b-&gt;_x;
    531. 

  531. <a name="l00499"></a>00499   xe = x + b-&gt;_wds;
    532. 

  532. <a name="l00500"></a>00500 <span class="preprocessor">#ifdef Pack_32</span>
    533. 

  533. <a name="l00501"></a>00501 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (k &amp;= 0x1f)
    534. 

  534. <a name="l00502"></a>00502     {
    535. 

  535. <a name="l00503"></a>00503       k1 = 32 - k;
    536. 

  536. <a name="l00504"></a>00504       z = 0;
    537. 

  537. <a name="l00505"></a>00505       <span class="keywordflow">do</span>
    538. 

  538. <a name="l00506"></a>00506         {
    539. 

  539. <a name="l00507"></a>00507           *x1++ = *x &lt;&lt; k | z;
    540. 

  540. <a name="l00508"></a>00508           z = *x++ &gt;&gt; k1;
    541. 

  541. <a name="l00509"></a>00509         }
    542. 

  542. <a name="l00510"></a>00510       <span class="keywordflow">while</span> (x &lt; xe);
    543. 

  543. <a name="l00511"></a>00511       <span class="keywordflow">if</span> ((*x1 = z) != 0)
    544. 

  544. <a name="l00512"></a>00512         ++n1;
    545. 

  545. <a name="l00513"></a>00513     }
    546. 

  546. <a name="l00514"></a>00514 <span class="preprocessor">#else</span>
    547. 

  547. <a name="l00515"></a>00515 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (k &amp;= 0xf)
    548. 

  548. <a name="l00516"></a>00516     {
    549. 

  549. <a name="l00517"></a>00517       k1 = 16 - k;
    550. 

  550. <a name="l00518"></a>00518       z = 0;
    551. 

  551. <a name="l00519"></a>00519       <span class="keywordflow">do</span>
    552. 

  552. <a name="l00520"></a>00520         {
    553. 

  553. <a name="l00521"></a>00521           *x1++ = *x &lt;&lt; k &amp; 0xffff | z;
    554. 

  554. <a name="l00522"></a>00522           z = *x++ &gt;&gt; k1;
    555. 

  555. <a name="l00523"></a>00523         }
    556. 

  556. <a name="l00524"></a>00524       <span class="keywordflow">while</span> (x &lt; xe);
    557. 

  557. <a name="l00525"></a>00525       <span class="keywordflow">if</span> (*x1 = z)
    558. 

  558. <a name="l00526"></a>00526         ++n1;
    559. 

  559. <a name="l00527"></a>00527     }
    560. 

  560. <a name="l00528"></a>00528 <span class="preprocessor">#endif</span>
    561. 

  561. <a name="l00529"></a>00529 <span class="preprocessor"></span>  <span class="keywordflow">else</span>
    562. 

  562. <a name="l00530"></a>00530     <span class="keywordflow">do</span>
    563. 

  563. <a name="l00531"></a>00531       *x1++ = *x++;
    564. 

  564. <a name="l00532"></a>00532     <span class="keywordflow">while</span> (x &lt; xe);
    565. 

  565. <a name="l00533"></a>00533   b1-&gt;_wds = n1 - 1;
    566. 

  566. <a name="l00534"></a>00534   Bfree (ptr, b);
    567. 

  567. <a name="l00535"></a>00535   <span class="keywordflow">return</span> b1;
    568. 

  568. <a name="l00536"></a>00536 }
    569. 

  569. <a name="l00537"></a>00537 
    570. 

  570. <a name="l00538"></a>00538 <span class="keywordtype">int</span>
    571. 

  571. <a name="l00539"></a>00539 _DEFUN (cmp, (a, b), _Bigint * a _AND _Bigint * b)
    572. 

  572. <a name="l00540"></a>00540 {
    573. 

  573. <a name="l00541"></a>00541   __ULong *xa, *xa0, *xb, *xb0;
    574. 

  574. <a name="l00542"></a>00542   <span class="keywordtype">int</span> i, j;
    575. 

  575. <a name="l00543"></a>00543 
    576. 

  576. <a name="l00544"></a>00544   i = a-&gt;_wds;
    577. 

  577. <a name="l00545"></a>00545   j = b-&gt;_wds;
    578. 

  578. <a name="l00546"></a>00546 <span class="preprocessor">#ifdef DEBUG</span>
    579. 

  579. <a name="l00547"></a>00547 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (i &gt; 1 &amp;&amp; !a-&gt;_x[i - 1])
    580. 

  580. <a name="l00548"></a>00548     Bug (<span class="stringliteral">&quot;cmp called with a-&gt;_x[a-&gt;_wds-1] == 0&quot;</span>);
    581. 

  581. <a name="l00549"></a>00549   <span class="keywordflow">if</span> (j &gt; 1 &amp;&amp; !b-&gt;_x[j - 1])
    582. 

  582. <a name="l00550"></a>00550     Bug (<span class="stringliteral">&quot;cmp called with b-&gt;_x[b-&gt;_wds-1] == 0&quot;</span>);
    583. 

  583. <a name="l00551"></a>00551 <span class="preprocessor">#endif</span>
    584. 

  584. <a name="l00552"></a>00552 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (i -= j)
    585. 

  585. <a name="l00553"></a>00553     <span class="keywordflow">return</span> i;
    586. 

  586. <a name="l00554"></a>00554   xa0 = a-&gt;_x;
    587. 

  587. <a name="l00555"></a>00555   xa = xa0 + j;
    588. 

  588. <a name="l00556"></a>00556   xb0 = b-&gt;_x;
    589. 

  589. <a name="l00557"></a>00557   xb = xb0 + j;
    590. 

  590. <a name="l00558"></a>00558   <span class="keywordflow">for</span> (;;)
    591. 

  591. <a name="l00559"></a>00559     {
    592. 

  592. <a name="l00560"></a>00560       <span class="keywordflow">if</span> (*--xa != *--xb)
    593. 

  593. <a name="l00561"></a>00561         <span class="keywordflow">return</span> *xa &lt; *xb ? -1 : 1;
    594. 

  594. <a name="l00562"></a>00562       <span class="keywordflow">if</span> (xa &lt;= xa0)
    595. 

  595. <a name="l00563"></a>00563         <span class="keywordflow">break</span>;
    596. 

  596. <a name="l00564"></a>00564     }
    597. 

  597. <a name="l00565"></a>00565   <span class="keywordflow">return</span> 0;
    598. 

  598. <a name="l00566"></a>00566 }
    599. 

  599. <a name="l00567"></a>00567 
    600. 

  600. <a name="l00568"></a>00568 _Bigint *
    601. 

  601. <a name="l00569"></a>00569 _DEFUN (diff, (ptr, a, b), <span class="keyword">struct</span> _reent * ptr _AND
    602. 

  602. <a name="l00570"></a>00570         _Bigint * a _AND _Bigint * b)
    603. 

  603. <a name="l00571"></a>00571 {
    604. 

  604. <a name="l00572"></a>00572   _Bigint *c;
    605. 

  605. <a name="l00573"></a>00573   <span class="keywordtype">int</span> i, wa, wb;
    606. 

  606. <a name="l00574"></a>00574   __Long borrow, y;             <span class="comment">/* We need signed shifts here. */</span>
    607. 

  607. <a name="l00575"></a>00575   __ULong *xa, *xae, *xb, *xbe, *xc;
    608. 

  608. <a name="l00576"></a>00576 <span class="preprocessor">#ifdef Pack_32</span>
    609. 

  609. <a name="l00577"></a>00577 <span class="preprocessor"></span>  __Long z;
    610. 

  610. <a name="l00578"></a>00578 <span class="preprocessor">#endif</span>
    611. 

  611. <a name="l00579"></a>00579 <span class="preprocessor"></span>
    612. 

  612. <a name="l00580"></a>00580   i = cmp (a, b);
    613. 

  613. <a name="l00581"></a>00581   <span class="keywordflow">if</span> (!i)
    614. 

  614. <a name="l00582"></a>00582     {
    615. 

  615. <a name="l00583"></a>00583       c = Balloc (ptr, 0);
    616. 

  616. <a name="l00584"></a>00584       c-&gt;_wds = 1;
    617. 

  617. <a name="l00585"></a>00585       c-&gt;_x[0] = 0;
    618. 

  618. <a name="l00586"></a>00586       <span class="keywordflow">return</span> c;
    619. 

  619. <a name="l00587"></a>00587     }
    620. 

  620. <a name="l00588"></a>00588   <span class="keywordflow">if</span> (i &lt; 0)
    621. 

  621. <a name="l00589"></a>00589     {
    622. 

  622. <a name="l00590"></a>00590       c = a;
    623. 

  623. <a name="l00591"></a>00591       a = b;
    624. 

  624. <a name="l00592"></a>00592       b = c;
    625. 

  625. <a name="l00593"></a>00593       i = 1;
    626. 

  626. <a name="l00594"></a>00594     }
    627. 

  627. <a name="l00595"></a>00595   <span class="keywordflow">else</span>
    628. 

  628. <a name="l00596"></a>00596     i = 0;
    629. 

  629. <a name="l00597"></a>00597   c = Balloc (ptr, a-&gt;_k);
    630. 

  630. <a name="l00598"></a>00598   c-&gt;_sign = i;
    631. 

  631. <a name="l00599"></a>00599   wa = a-&gt;_wds;
    632. 

  632. <a name="l00600"></a>00600   xa = a-&gt;_x;
    633. 

  633. <a name="l00601"></a>00601   xae = xa + wa;
    634. 

  634. <a name="l00602"></a>00602   wb = b-&gt;_wds;
    635. 

  635. <a name="l00603"></a>00603   xb = b-&gt;_x;
    636. 

  636. <a name="l00604"></a>00604   xbe = xb + wb;
    637. 

  637. <a name="l00605"></a>00605   xc = c-&gt;_x;
    638. 

  638. <a name="l00606"></a>00606   borrow = 0;
    639. 

  639. <a name="l00607"></a>00607 <span class="preprocessor">#ifdef Pack_32</span>
    640. 

  640. <a name="l00608"></a>00608 <span class="preprocessor"></span>  <span class="keywordflow">do</span>
    641. 

  641. <a name="l00609"></a>00609     {
    642. 

  642. <a name="l00610"></a>00610       y = (*xa &amp; 0xffff) - (*xb &amp; 0xffff) + borrow;
    643. 

  643. <a name="l00611"></a>00611       borrow = y &gt;&gt; 16;
    644. 

  644. <a name="l00612"></a>00612       Sign_Extend (borrow, y);
    645. 

  645. <a name="l00613"></a>00613       z = (*xa++ &gt;&gt; 16) - (*xb++ &gt;&gt; 16) + borrow;
    646. 

  646. <a name="l00614"></a>00614       borrow = z &gt;&gt; 16;
    647. 

  647. <a name="l00615"></a>00615       Sign_Extend (borrow, z);
    648. 

  648. <a name="l00616"></a>00616       Storeinc (xc, z, y);
    649. 

  649. <a name="l00617"></a>00617     }
    650. 

  650. <a name="l00618"></a>00618   <span class="keywordflow">while</span> (xb &lt; xbe);
    651. 

  651. <a name="l00619"></a>00619   <span class="keywordflow">while</span> (xa &lt; xae)
    652. 

  652. <a name="l00620"></a>00620     {
    653. 

  653. <a name="l00621"></a>00621       y = (*xa &amp; 0xffff) + borrow;
    654. 

  654. <a name="l00622"></a>00622       borrow = y &gt;&gt; 16;
    655. 

  655. <a name="l00623"></a>00623       Sign_Extend (borrow, y);
    656. 

  656. <a name="l00624"></a>00624       z = (*xa++ &gt;&gt; 16) + borrow;
    657. 

  657. <a name="l00625"></a>00625       borrow = z &gt;&gt; 16;
    658. 

  658. <a name="l00626"></a>00626       Sign_Extend (borrow, z);
    659. 

  659. <a name="l00627"></a>00627       Storeinc (xc, z, y);
    660. 

  660. <a name="l00628"></a>00628     }
    661. 

  661. <a name="l00629"></a>00629 <span class="preprocessor">#else</span>
    662. 

  662. <a name="l00630"></a>00630 <span class="preprocessor"></span>  <span class="keywordflow">do</span>
    663. 

  663. <a name="l00631"></a>00631     {
    664. 

  664. <a name="l00632"></a>00632       y = *xa++ - *xb++ + borrow;
    665. 

  665. <a name="l00633"></a>00633       borrow = y &gt;&gt; 16;
    666. 

  666. <a name="l00634"></a>00634       Sign_Extend (borrow, y);
    667. 

  667. <a name="l00635"></a>00635       *xc++ = y &amp; 0xffff;
    668. 

  668. <a name="l00636"></a>00636     }
    669. 

  669. <a name="l00637"></a>00637   <span class="keywordflow">while</span> (xb &lt; xbe);
    670. 

  670. <a name="l00638"></a>00638   <span class="keywordflow">while</span> (xa &lt; xae)
    671. 

  671. <a name="l00639"></a>00639     {
    672. 

  672. <a name="l00640"></a>00640       y = *xa++ + borrow;
    673. 

  673. <a name="l00641"></a>00641       borrow = y &gt;&gt; 16;
    674. 

  674. <a name="l00642"></a>00642       Sign_Extend (borrow, y);
    675. 

  675. <a name="l00643"></a>00643       *xc++ = y &amp; 0xffff;
    676. 

  676. <a name="l00644"></a>00644     }
    677. 

  677. <a name="l00645"></a>00645 <span class="preprocessor">#endif</span>
    678. 

  678. <a name="l00646"></a>00646 <span class="preprocessor"></span>  <span class="keywordflow">while</span> (!*--xc)
    679. 

  679. <a name="l00647"></a>00647     wa--;
    680. 

  680. <a name="l00648"></a>00648   c-&gt;_wds = wa;
    681. 

  681. <a name="l00649"></a>00649   <span class="keywordflow">return</span> c;
    682. 

  682. <a name="l00650"></a>00650 }
    683. 

  683. <a name="l00651"></a>00651 
    684. 

  684. <a name="l00652"></a>00652 <span class="keywordtype">double</span>
    685. 

  685. <a name="l00653"></a>00653 _DEFUN (ulp, (_x), <span class="keywordtype">double</span> _x)
    686. 

  686. <a name="l00654"></a>00654 {
    687. 

  687. <a name="l00655"></a>00655   <span class="keyword">union </span>double_union x, a;
    688. 

  688. <a name="l00656"></a>00656   <span class="keyword">register</span> __Long L;
    689. 

  689. <a name="l00657"></a>00657 
    690. 

  690. <a name="l00658"></a>00658   x.d = _x;
    691. 

  691. <a name="l00659"></a>00659 
    692. 

  692. <a name="l00660"></a>00660   L = (word0 (x) &amp; Exp_mask) - (P - 1) * Exp_msk1;
    693. 

  693. <a name="l00661"></a>00661 <span class="preprocessor">#ifndef Sudden_Underflow</span>
    694. 

  694. <a name="l00662"></a>00662 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (L &gt; 0)
    695. 

  695. <a name="l00663"></a>00663     {
    696. 

  696. <a name="l00664"></a>00664 <span class="preprocessor">#endif</span>
    697. 

  697. <a name="l00665"></a>00665 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
    698. 

  698. <a name="l00666"></a>00666 <span class="preprocessor"></span>      L |= Exp_msk1 &gt;&gt; 4;
    699. 

  699. <a name="l00667"></a>00667 <span class="preprocessor">#endif</span>
    700. 

  700. <a name="l00668"></a>00668 <span class="preprocessor"></span>      word0 (a) = L;
    701. 

  701. <a name="l00669"></a>00669 <span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
    702. 

  702. <a name="l00670"></a>00670 <span class="preprocessor"></span>      word1 (a) = 0;
    703. 

  703. <a name="l00671"></a>00671 <span class="preprocessor">#endif</span>
    704. 

  704. <a name="l00672"></a>00672 <span class="preprocessor"></span>
    705. 

  705. <a name="l00673"></a>00673 <span class="preprocessor">#ifndef Sudden_Underflow</span>
    706. 

  706. <a name="l00674"></a>00674 <span class="preprocessor"></span>    }
    707. 

  707. <a name="l00675"></a>00675   <span class="keywordflow">else</span>
    708. 

  708. <a name="l00676"></a>00676     {
    709. 

  709. <a name="l00677"></a>00677       L = -L &gt;&gt; Exp_shift;
    710. 

  710. <a name="l00678"></a>00678       <span class="keywordflow">if</span> (L &lt; Exp_shift)
    711. 

  711. <a name="l00679"></a>00679         {
    712. 

  712. <a name="l00680"></a>00680           word0 (a) = 0x80000 &gt;&gt; L;
    713. 

  713. <a name="l00681"></a>00681 <span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
    714. 

  714. <a name="l00682"></a>00682 <span class="preprocessor"></span>          word1 (a) = 0;
    715. 

  715. <a name="l00683"></a>00683 <span class="preprocessor">#endif</span>
    716. 

  716. <a name="l00684"></a>00684 <span class="preprocessor"></span>        }
    717. 

  717. <a name="l00685"></a>00685       <span class="keywordflow">else</span>
    718. 

  718. <a name="l00686"></a>00686         {
    719. 

  719. <a name="l00687"></a>00687           word0 (a) = 0;
    720. 

  720. <a name="l00688"></a>00688           L -= Exp_shift;
    721. 

  721. <a name="l00689"></a>00689 <span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
    722. 

  722. <a name="l00690"></a>00690 <span class="preprocessor"></span>         word1 (a) = L &gt;= 31 ? 1 : 1 &lt;&lt; (31 - L);
    723. 

  723. <a name="l00691"></a>00691 <span class="preprocessor">#endif</span>
    724. 

  724. <a name="l00692"></a>00692 <span class="preprocessor"></span>        }
    725. 

  725. <a name="l00693"></a>00693     }
    726. 

  726. <a name="l00694"></a>00694 <span class="preprocessor">#endif</span>
    727. 

  727. <a name="l00695"></a>00695 <span class="preprocessor"></span>  <span class="keywordflow">return</span> a.d;
    728. 

  728. <a name="l00696"></a>00696 }
    729. 

  729. <a name="l00697"></a>00697 
    730. 

  730. <a name="l00698"></a>00698 <span class="keywordtype">double</span>
    731. 

  731. <a name="l00699"></a>00699 _DEFUN (b2d, (a, e),
    732. 

  732. <a name="l00700"></a>00700         _Bigint * a _AND <span class="keywordtype">int</span> *e)
    733. 

  733. <a name="l00701"></a>00701 {
    734. 

  734. <a name="l00702"></a>00702   __ULong *xa, *xa0, w, y, z;
    735. 

  735. <a name="l00703"></a>00703   <span class="keywordtype">int</span> k;
    736. 

  736. <a name="l00704"></a>00704   <span class="keyword">union </span>double_union d;
    737. 

  737. <a name="l00705"></a>00705 <span class="preprocessor">#ifdef VAX</span>
    738. 

  738. <a name="l00706"></a>00706 <span class="preprocessor"></span>  __ULong d0, d1;
    739. 

  739. <a name="l00707"></a>00707 <span class="preprocessor">#else</span>
    740. 

  740. <a name="l00708"></a>00708 <span class="preprocessor"></span><span class="preprocessor">#define d0 word0(d)</span>
    741. 

  741. <a name="l00709"></a>00709 <span class="preprocessor"></span><span class="preprocessor">#define d1 word1(d)</span>
    742. 

  742. <a name="l00710"></a>00710 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
    743. 

  743. <a name="l00711"></a>00711 <span class="preprocessor"></span>
    744. 

  744. <a name="l00712"></a>00712   xa0 = a-&gt;_x;
    745. 

  745. <a name="l00713"></a>00713   xa = xa0 + a-&gt;_wds;
    746. 

  746. <a name="l00714"></a>00714   y = *--xa;
    747. 

  747. <a name="l00715"></a>00715 <span class="preprocessor">#ifdef DEBUG</span>
    748. 

  748. <a name="l00716"></a>00716 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (!y)
    749. 

  749. <a name="l00717"></a>00717     Bug (<span class="stringliteral">&quot;zero y in b2d&quot;</span>);
    750. 

  750. <a name="l00718"></a>00718 <span class="preprocessor">#endif</span>
    751. 

  751. <a name="l00719"></a>00719 <span class="preprocessor"></span>  k = hi0bits (y);
    752. 

  752. <a name="l00720"></a>00720   *e = 32 - k;
    753. 

  753. <a name="l00721"></a>00721 <span class="preprocessor">#ifdef Pack_32</span>
    754. 

  754. <a name="l00722"></a>00722 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (k &lt; Ebits)
    755. 

  755. <a name="l00723"></a>00723     {
    756. 

  756. <a name="l00724"></a>00724       d0 = Exp_1 | y &gt;&gt; (Ebits - k);
    757. 

  757. <a name="l00725"></a>00725       w = xa &gt; xa0 ? *--xa : 0;
    758. 

  758. <a name="l00726"></a>00726 <span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
    759. 

  759. <a name="l00727"></a>00727 <span class="preprocessor"></span>      d1 = y &lt;&lt; ((32 - Ebits) + k) | w &gt;&gt; (Ebits - k);
    760. 

  760. <a name="l00728"></a>00728 <span class="preprocessor">#endif</span>
    761. 

  761. <a name="l00729"></a>00729 <span class="preprocessor"></span>      <span class="keywordflow">goto</span> ret_d;
    762. 

  762. <a name="l00730"></a>00730     }
    763. 

  763. <a name="l00731"></a>00731   z = xa &gt; xa0 ? *--xa : 0;
    764. 

  764. <a name="l00732"></a>00732   <span class="keywordflow">if</span> (k -= Ebits)
    765. 

  765. <a name="l00733"></a>00733     {
    766. 

  766. <a name="l00734"></a>00734       d0 = Exp_1 | y &lt;&lt; k | z &gt;&gt; (32 - k);
    767. 

  767. <a name="l00735"></a>00735       y = xa &gt; xa0 ? *--xa : 0;
    768. 

  768. <a name="l00736"></a>00736 <span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
    769. 

  769. <a name="l00737"></a>00737 <span class="preprocessor"></span>      d1 = z &lt;&lt; k | y &gt;&gt; (32 - k);
    770. 

  770. <a name="l00738"></a>00738 <span class="preprocessor">#endif</span>
    771. 

  771. <a name="l00739"></a>00739 <span class="preprocessor"></span>    }
    772. 

  772. <a name="l00740"></a>00740   <span class="keywordflow">else</span>
    773. 

  773. <a name="l00741"></a>00741     {
    774. 

  774. <a name="l00742"></a>00742       d0 = Exp_1 | y;
    775. 

  775. <a name="l00743"></a>00743 <span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
    776. 

  776. <a name="l00744"></a>00744 <span class="preprocessor"></span>      d1 = z;
    777. 

  777. <a name="l00745"></a>00745 <span class="preprocessor">#endif</span>
    778. 

  778. <a name="l00746"></a>00746 <span class="preprocessor"></span>    }
    779. 

  779. <a name="l00747"></a>00747 <span class="preprocessor">#else</span>
    780. 

  780. <a name="l00748"></a>00748 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (k &lt; Ebits + 16)
    781. 

  781. <a name="l00749"></a>00749     {
    782. 

  782. <a name="l00750"></a>00750       z = xa &gt; xa0 ? *--xa : 0;
    783. 

  783. <a name="l00751"></a>00751       d0 = Exp_1 | y &lt;&lt; k - Ebits | z &gt;&gt; Ebits + 16 - k;
    784. 

  784. <a name="l00752"></a>00752       w = xa &gt; xa0 ? *--xa : 0;
    785. 

  785. <a name="l00753"></a>00753       y = xa &gt; xa0 ? *--xa : 0;
    786. 

  786. <a name="l00754"></a>00754       d1 = z &lt;&lt; k + 16 - Ebits | w &lt;&lt; k - Ebits | y &gt;&gt; 16 + Ebits - k;
    787. 

  787. <a name="l00755"></a>00755       <span class="keywordflow">goto</span> ret_d;
    788. 

  788. <a name="l00756"></a>00756     }
    789. 

  789. <a name="l00757"></a>00757   z = xa &gt; xa0 ? *--xa : 0;
    790. 

  790. <a name="l00758"></a>00758   w = xa &gt; xa0 ? *--xa : 0;
    791. 

  791. <a name="l00759"></a>00759   k -= Ebits + 16;
    792. 

  792. <a name="l00760"></a>00760   d0 = Exp_1 | y &lt;&lt; k + 16 | z &lt;&lt; k | w &gt;&gt; 16 - k;
    793. 

  793. <a name="l00761"></a>00761   y = xa &gt; xa0 ? *--xa : 0;
    794. 

  794. <a name="l00762"></a>00762   d1 = w &lt;&lt; k + 16 | y &lt;&lt; k;
    795. 

  795. <a name="l00763"></a>00763 <span class="preprocessor">#endif</span>
    796. 

  796. <a name="l00764"></a>00764 <span class="preprocessor"></span>ret_d:
    797. 

  797. <a name="l00765"></a>00765 <span class="preprocessor">#ifdef VAX</span>
    798. 

  798. <a name="l00766"></a>00766 <span class="preprocessor"></span>  word0 (d) = d0 &gt;&gt; 16 | d0 &lt;&lt; 16;
    799. 

  799. <a name="l00767"></a>00767   word1 (d) = d1 &gt;&gt; 16 | d1 &lt;&lt; 16;
    800. 

  800. <a name="l00768"></a>00768 <span class="preprocessor">#else</span>
    801. 

  801. <a name="l00769"></a>00769 <span class="preprocessor"></span><span class="preprocessor">#undef d0</span>
    802. 

  802. <a name="l00770"></a>00770 <span class="preprocessor"></span><span class="preprocessor">#undef d1</span>
    803. 

  803. <a name="l00771"></a>00771 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
    804. 

  804. <a name="l00772"></a>00772 <span class="preprocessor"></span>  <span class="keywordflow">return</span> d.d;
    805. 

  805. <a name="l00773"></a>00773 }
    806. 

  806. <a name="l00774"></a>00774 
    807. 

  807. <a name="l00775"></a>00775 _Bigint *
    808. 

  808. <a name="l00776"></a>00776 _DEFUN (d2b,
    809. 

  809. <a name="l00777"></a>00777         (ptr, _d, e, bits),
    810. 

  810. <a name="l00778"></a>00778         <span class="keyword">struct</span> _reent * ptr _AND
    811. 

  811. <a name="l00779"></a>00779         <span class="keywordtype">double</span> _d _AND
    812. 

  812. <a name="l00780"></a>00780         <span class="keywordtype">int</span> *e _AND
    813. 

  813. <a name="l00781"></a>00781         <span class="keywordtype">int</span> *bits)
    814. 

  814. <a name="l00782"></a>00782 
    815. 

  815. <a name="l00783"></a>00783 {
    816. 

  816. <a name="l00784"></a>00784   <span class="keyword">union </span>double_union d;
    817. 

  817. <a name="l00785"></a>00785   _Bigint *b;
    818. 

  818. <a name="l00786"></a>00786   <span class="keywordtype">int</span> de, i, k;
    819. 

  819. <a name="l00787"></a>00787   __ULong *x, y, z;
    820. 

  820. <a name="l00788"></a>00788 <span class="preprocessor">#ifdef VAX</span>
    821. 

  821. <a name="l00789"></a>00789 <span class="preprocessor"></span>  __ULong d0, d1;
    822. 

  822. <a name="l00790"></a>00790 <span class="preprocessor">#endif</span>
    823. 

  823. <a name="l00791"></a>00791 <span class="preprocessor"></span>  d.d = _d;
    824. 

  824. <a name="l00792"></a>00792 <span class="preprocessor">#ifdef VAX</span>
    825. 

  825. <a name="l00793"></a>00793 <span class="preprocessor"></span>  d0 = word0 (d) &gt;&gt; 16 | word0 (d) &lt;&lt; 16;
    826. 

  826. <a name="l00794"></a>00794   d1 = word1 (d) &gt;&gt; 16 | word1 (d) &lt;&lt; 16;
    827. 

  827. <a name="l00795"></a>00795 <span class="preprocessor">#else</span>
    828. 

  828. <a name="l00796"></a>00796 <span class="preprocessor"></span><span class="preprocessor">#define d0 word0(d)</span>
    829. 

  829. <a name="l00797"></a>00797 <span class="preprocessor"></span><span class="preprocessor">#define d1 word1(d)</span>
    830. 

  830. <a name="l00798"></a>00798 <span class="preprocessor"></span>  d.d = _d;
    831. 

  831. <a name="l00799"></a>00799 <span class="preprocessor">#endif</span>
    832. 

  832. <a name="l00800"></a>00800 <span class="preprocessor"></span>
    833. 

  833. <a name="l00801"></a>00801 <span class="preprocessor">#ifdef Pack_32</span>
    834. 

  834. <a name="l00802"></a>00802 <span class="preprocessor"></span>  b = Balloc (ptr, 1);
    835. 

  835. <a name="l00803"></a>00803 <span class="preprocessor">#else</span>
    836. 

  836. <a name="l00804"></a>00804 <span class="preprocessor"></span>  b = Balloc (ptr, 2);
    837. 

  837. <a name="l00805"></a>00805 <span class="preprocessor">#endif</span>
    838. 

  838. <a name="l00806"></a>00806 <span class="preprocessor"></span>  x = b-&gt;_x;
    839. 

  839. <a name="l00807"></a>00807 
    840. 

  840. <a name="l00808"></a>00808   z = d0 &amp; Frac_mask;
    841. 

  841. <a name="l00809"></a>00809   d0 &amp;= 0x7fffffff;             <span class="comment">/* clear sign bit, which we ignore */</span>
    842. 

  842. <a name="l00810"></a>00810 <span class="preprocessor">#ifdef Sudden_Underflow</span>
    843. 

  843. <a name="l00811"></a>00811 <span class="preprocessor"></span>  de = (int) (d0 &gt;&gt; Exp_shift);
    844. 

  844. <a name="l00812"></a>00812 <span class="preprocessor">#ifndef IBM</span>
    845. 

  845. <a name="l00813"></a>00813 <span class="preprocessor"></span>  z |= Exp_msk11;
    846. 

  846. <a name="l00814"></a>00814 <span class="preprocessor">#endif</span>
    847. 

  847. <a name="l00815"></a>00815 <span class="preprocessor"></span><span class="preprocessor">#else</span>
    848. 

  848. <a name="l00816"></a>00816 <span class="preprocessor"></span>  <span class="keywordflow">if</span> ((de = (<span class="keywordtype">int</span>) (d0 &gt;&gt; Exp_shift)) != 0)
    849. 

  849. <a name="l00817"></a>00817     z |= Exp_msk1;
    850. 

  850. <a name="l00818"></a>00818 <span class="preprocessor">#endif</span>
    851. 

  851. <a name="l00819"></a>00819 <span class="preprocessor"></span><span class="preprocessor">#ifdef Pack_32</span>
    852. 

  852. <a name="l00820"></a>00820 <span class="preprocessor"></span><span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
    853. 

  853. <a name="l00821"></a>00821 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (d1)
    854. 

  854. <a name="l00822"></a>00822     {
    855. 

  855. <a name="l00823"></a>00823       y = d1;
    856. 

  856. <a name="l00824"></a>00824       k = lo0bits (&amp;y);
    857. 

  857. <a name="l00825"></a>00825       <span class="keywordflow">if</span> (k)
    858. 

  858. <a name="l00826"></a>00826         {
    859. 

  859. <a name="l00827"></a>00827          x[0] = y | z &lt;&lt; (32 - k);
    860. 

  860. <a name="l00828"></a>00828           z &gt;&gt;= k;
    861. 

  861. <a name="l00829"></a>00829         }
    862. 

  862. <a name="l00830"></a>00830       <span class="keywordflow">else</span>
    863. 

  863. <a name="l00831"></a>00831         x[0] = y;
    864. 

  864. <a name="l00832"></a>00832       i = b-&gt;_wds = (x[1] = z) ? 2 : 1;
    865. 

  865. <a name="l00833"></a>00833     }
    866. 

  866. <a name="l00834"></a>00834   <span class="keywordflow">else</span>
    867. 

  867. <a name="l00835"></a>00835 <span class="preprocessor">#endif</span>
    868. 

  868. <a name="l00836"></a>00836 <span class="preprocessor"></span>    {
    869. 

  869. <a name="l00837"></a>00837 <span class="preprocessor">#ifdef DEBUG</span>
    870. 

  870. <a name="l00838"></a>00838 <span class="preprocessor"></span>      <span class="keywordflow">if</span> (!z)
    871. 

  871. <a name="l00839"></a>00839         Bug (<span class="stringliteral">&quot;Zero passed to d2b&quot;</span>);
    872. 

  872. <a name="l00840"></a>00840 <span class="preprocessor">#endif</span>
    873. 

  873. <a name="l00841"></a>00841 <span class="preprocessor"></span>      k = lo0bits (&amp;z);
    874. 

  874. <a name="l00842"></a>00842       x[0] = z;
    875. 

  875. <a name="l00843"></a>00843       i = b-&gt;_wds = 1;
    876. 

  876. <a name="l00844"></a>00844 <span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
    877. 

  877. <a name="l00845"></a>00845 <span class="preprocessor"></span>      k += 32;
    878. 

  878. <a name="l00846"></a>00846 <span class="preprocessor">#endif</span>
    879. 

  879. <a name="l00847"></a>00847 <span class="preprocessor"></span>    }
    880. 

  880. <a name="l00848"></a>00848 <span class="preprocessor">#else</span>
    881. 

  881. <a name="l00849"></a>00849 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (d1)
    882. 

  882. <a name="l00850"></a>00850     {
    883. 

  883. <a name="l00851"></a>00851       y = d1;
    884. 

  884. <a name="l00852"></a>00852       k = lo0bits (&amp;y);
    885. 

  885. <a name="l00853"></a>00853       <span class="keywordflow">if</span> (k)
    886. 

  886. <a name="l00854"></a>00854         <span class="keywordflow">if</span> (k &gt;= 16)
    887. 

  887. <a name="l00855"></a>00855           {
    888. 

  888. <a name="l00856"></a>00856             x[0] = y | z &lt;&lt; 32 - k &amp; 0xffff;
    889. 

  889. <a name="l00857"></a>00857             x[1] = z &gt;&gt; k - 16 &amp; 0xffff;
    890. 

  890. <a name="l00858"></a>00858             x[2] = z &gt;&gt; k;
    891. 

  891. <a name="l00859"></a>00859             i = 2;
    892. 

  892. <a name="l00860"></a>00860           }
    893. 

  893. <a name="l00861"></a>00861         <span class="keywordflow">else</span>
    894. 

  894. <a name="l00862"></a>00862           {
    895. 

  895. <a name="l00863"></a>00863             x[0] = y &amp; 0xffff;
    896. 

  896. <a name="l00864"></a>00864             x[1] = y &gt;&gt; 16 | z &lt;&lt; 16 - k &amp; 0xffff;
    897. 

  897. <a name="l00865"></a>00865             x[2] = z &gt;&gt; k &amp; 0xffff;
    898. 

  898. <a name="l00866"></a>00866             x[3] = z &gt;&gt; k + 16;
    899. 

  899. <a name="l00867"></a>00867             i = 3;
    900. 

  900. <a name="l00868"></a>00868           }
    901. 

  901. <a name="l00869"></a>00869       <span class="keywordflow">else</span>
    902. 

  902. <a name="l00870"></a>00870         {
    903. 

  903. <a name="l00871"></a>00871           x[0] = y &amp; 0xffff;
    904. 

  904. <a name="l00872"></a>00872           x[1] = y &gt;&gt; 16;
    905. 

  905. <a name="l00873"></a>00873           x[2] = z &amp; 0xffff;
    906. 

  906. <a name="l00874"></a>00874           x[3] = z &gt;&gt; 16;
    907. 

  907. <a name="l00875"></a>00875           i = 3;
    908. 

  908. <a name="l00876"></a>00876         }
    909. 

  909. <a name="l00877"></a>00877     }
    910. 

  910. <a name="l00878"></a>00878   <span class="keywordflow">else</span>
    911. 

  911. <a name="l00879"></a>00879     {
    912. 

  912. <a name="l00880"></a>00880 <span class="preprocessor">#ifdef DEBUG</span>
    913. 

  913. <a name="l00881"></a>00881 <span class="preprocessor"></span>      <span class="keywordflow">if</span> (!z)
    914. 

  914. <a name="l00882"></a>00882         Bug (<span class="stringliteral">&quot;Zero passed to d2b&quot;</span>);
    915. 

  915. <a name="l00883"></a>00883 <span class="preprocessor">#endif</span>
    916. 

  916. <a name="l00884"></a>00884 <span class="preprocessor"></span>      k = lo0bits (&amp;z);
    917. 

  917. <a name="l00885"></a>00885       <span class="keywordflow">if</span> (k &gt;= 16)
    918. 

  918. <a name="l00886"></a>00886         {
    919. 

  919. <a name="l00887"></a>00887           x[0] = z;
    920. 

  920. <a name="l00888"></a>00888           i = 0;
    921. 

  921. <a name="l00889"></a>00889         }
    922. 

  922. <a name="l00890"></a>00890       <span class="keywordflow">else</span>
    923. 

  923. <a name="l00891"></a>00891         {
    924. 

  924. <a name="l00892"></a>00892           x[0] = z &amp; 0xffff;
    925. 

  925. <a name="l00893"></a>00893           x[1] = z &gt;&gt; 16;
    926. 

  926. <a name="l00894"></a>00894           i = 1;
    927. 

  927. <a name="l00895"></a>00895         }
    928. 

  928. <a name="l00896"></a>00896       k += 32;
    929. 

  929. <a name="l00897"></a>00897     }
    930. 

  930. <a name="l00898"></a>00898   <span class="keywordflow">while</span> (!x[i])
    931. 

  931. <a name="l00899"></a>00899     --i;
    932. 

  932. <a name="l00900"></a>00900   b-&gt;_wds = i + 1;
    933. 

  933. <a name="l00901"></a>00901 <span class="preprocessor">#endif</span>
    934. 

  934. <a name="l00902"></a>00902 <span class="preprocessor"></span><span class="preprocessor">#ifndef Sudden_Underflow</span>
    935. 

  935. <a name="l00903"></a>00903 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (de)
    936. 

  936. <a name="l00904"></a>00904     {
    937. 

  937. <a name="l00905"></a>00905 <span class="preprocessor">#endif</span>
    938. 

  938. <a name="l00906"></a>00906 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
    939. 

  939. <a name="l00907"></a>00907 <span class="preprocessor"></span>      *e = (de - Bias - (P - 1) &lt;&lt; 2) + k;
    940. 

  940. <a name="l00908"></a>00908       *bits = 4 * P + 8 - k - hi0bits (word0 (d) &amp; Frac_mask);
    941. 

  941. <a name="l00909"></a>00909 <span class="preprocessor">#else</span>
    942. 

  942. <a name="l00910"></a>00910 <span class="preprocessor"></span>      *e = de - Bias - (P - 1) + k;
    943. 

  943. <a name="l00911"></a>00911       *bits = P - k;
    944. 

  944. <a name="l00912"></a>00912 <span class="preprocessor">#endif</span>
    945. 

  945. <a name="l00913"></a>00913 <span class="preprocessor"></span><span class="preprocessor">#ifndef Sudden_Underflow</span>
    946. 

  946. <a name="l00914"></a>00914 <span class="preprocessor"></span>    }
    947. 

  947. <a name="l00915"></a>00915   <span class="keywordflow">else</span>
    948. 

  948. <a name="l00916"></a>00916     {
    949. 

  949. <a name="l00917"></a>00917       *e = de - Bias - (P - 1) + 1 + k;
    950. 

  950. <a name="l00918"></a>00918 <span class="preprocessor">#ifdef Pack_32</span>
    951. 

  951. <a name="l00919"></a>00919 <span class="preprocessor"></span>      *bits = 32 * i - hi0bits (x[i - 1]);
    952. 

  952. <a name="l00920"></a>00920 <span class="preprocessor">#else</span>
    953. 

  953. <a name="l00921"></a>00921 <span class="preprocessor"></span>      *bits = (i + 2) * 16 - hi0bits (x[i]);
    954. 

  954. <a name="l00922"></a>00922 <span class="preprocessor">#endif</span>
    955. 

  955. <a name="l00923"></a>00923 <span class="preprocessor"></span>    }
    956. 

  956. <a name="l00924"></a>00924 <span class="preprocessor">#endif</span>
    957. 

  957. <a name="l00925"></a>00925 <span class="preprocessor"></span>  <span class="keywordflow">return</span> b;
    958. 

  958. <a name="l00926"></a>00926 }
    959. 

  959. <a name="l00927"></a>00927 <span class="preprocessor">#undef d0</span>
    960. 

  960. <a name="l00928"></a>00928 <span class="preprocessor"></span><span class="preprocessor">#undef d1</span>
    961. 

  961. <a name="l00929"></a>00929 <span class="preprocessor"></span>
    962. 

  962. <a name="l00930"></a>00930 <span class="keywordtype">double</span>
    963. 

  963. <a name="l00931"></a>00931 _DEFUN (ratio, (a, b), _Bigint * a _AND _Bigint * b)
    964. 

  964. <a name="l00932"></a>00932 
    965. 

  965. <a name="l00933"></a>00933 {
    966. 

  966. <a name="l00934"></a>00934   <span class="keyword">union </span>double_union da, db;
    967. 

  967. <a name="l00935"></a>00935   <span class="keywordtype">int</span> k, ka, kb;
    968. 

  968. <a name="l00936"></a>00936 
    969. 

  969. <a name="l00937"></a>00937   da.d = b2d (a, &amp;ka);
    970. 

  970. <a name="l00938"></a>00938   db.d = b2d (b, &amp;kb);
    971. 

  971. <a name="l00939"></a>00939 <span class="preprocessor">#ifdef Pack_32</span>
    972. 

  972. <a name="l00940"></a>00940 <span class="preprocessor"></span>  k = ka - kb + 32 * (a-&gt;_wds - b-&gt;_wds);
    973. 

  973. <a name="l00941"></a>00941 <span class="preprocessor">#else</span>
    974. 

  974. <a name="l00942"></a>00942 <span class="preprocessor"></span>  k = ka - kb + 16 * (a-&gt;_wds - b-&gt;_wds);
    975. 

  975. <a name="l00943"></a>00943 <span class="preprocessor">#endif</span>
    976. 

  976. <a name="l00944"></a>00944 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
    977. 

  977. <a name="l00945"></a>00945 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (k &gt; 0)
    978. 

  978. <a name="l00946"></a>00946     {
    979. 

  979. <a name="l00947"></a>00947       word0 (da) += (k &gt;&gt; 2) * Exp_msk1;
    980. 

  980. <a name="l00948"></a>00948       <span class="keywordflow">if</span> (k &amp;= 3)
    981. 

  981. <a name="l00949"></a>00949         da.d *= 1 &lt;&lt; k;
    982. 

  982. <a name="l00950"></a>00950     }
    983. 

  983. <a name="l00951"></a>00951   <span class="keywordflow">else</span>
    984. 

  984. <a name="l00952"></a>00952     {
    985. 

  985. <a name="l00953"></a>00953       k = -k;
    986. 

  986. <a name="l00954"></a>00954       word0 (db) += (k &gt;&gt; 2) * Exp_msk1;
    987. 

  987. <a name="l00955"></a>00955       <span class="keywordflow">if</span> (k &amp;= 3)
    988. 

  988. <a name="l00956"></a>00956         db.d *= 1 &lt;&lt; k;
    989. 

  989. <a name="l00957"></a>00957     }
    990. 

  990. <a name="l00958"></a>00958 <span class="preprocessor">#else</span>
    991. 

  991. <a name="l00959"></a>00959 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (k &gt; 0)
    992. 

  992. <a name="l00960"></a>00960     word0 (da) += k * Exp_msk1;
    993. 

  993. <a name="l00961"></a>00961   <span class="keywordflow">else</span>
    994. 

  994. <a name="l00962"></a>00962     {
    995. 

  995. <a name="l00963"></a>00963       k = -k;
    996. 

  996. <a name="l00964"></a>00964       word0 (db) += k * Exp_msk1;
    997. 

  997. <a name="l00965"></a>00965     }
    998. 

  998. <a name="l00966"></a>00966 <span class="preprocessor">#endif</span>
    999. 

  999. <a name="l00967"></a>00967 <span class="preprocessor"></span>  <span class="keywordflow">return</span> da.d / db.d;
    1000. 

  1000. <a name="l00968"></a>00968 }
    1001. 

  1001. <a name="l00969"></a>00969 
    1002. 

  1002. <a name="l00970"></a>00970 
    1003. 

  1003. <a name="l00971"></a>00971 _CONST <span class="keywordtype">double</span>
    1004. 

  1004. <a name="l00972"></a>00972   tens[] =
    1005. 

  1005. <a name="l00973"></a>00973 {
    1006. 

  1006. <a name="l00974"></a>00974   1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9,
    1007. 

  1007. <a name="l00975"></a>00975   1e10, 1e11, 1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19,
    1008. 

  1008. <a name="l00976"></a>00976   1e20, 1e21, 1e22, 1e23, 1e24
    1009. 

  1009. <a name="l00977"></a>00977 
    1010. 

  1010. <a name="l00978"></a>00978 };
    1011. 

  1011. <a name="l00979"></a>00979 
    1012. 

  1012. <a name="l00980"></a>00980 <span class="preprocessor">#if !defined(_DOUBLE_IS_32BITS) &amp;&amp; !defined(__v800)</span>
    1013. 

  1013. <a name="l00981"></a>00981 <span class="preprocessor"></span>_CONST <span class="keywordtype">double</span> bigtens[] =
    1014. 

  1014. <a name="l00982"></a>00982 {1e16, 1e32, 1e64, 1e128, 1e256};
    1015. 

  1015. <a name="l00983"></a>00983 
    1016. 

  1016. <a name="l00984"></a>00984 _CONST <span class="keywordtype">double</span> tinytens[] =
    1017. 

  1017. <a name="l00985"></a>00985 {1e-16, 1e-32, 1e-64, 1e-128, 1e-256};
    1018. 

  1018. <a name="l00986"></a>00986 <span class="preprocessor">#else</span>
    1019. 

  1019. <a name="l00987"></a>00987 <span class="preprocessor"></span>_CONST <span class="keywordtype">double</span> bigtens[] =
    1020. 

  1020. <a name="l00988"></a>00988 {1e16, 1e32};
    1021. 

  1021. <a name="l00989"></a>00989 
    1022. 

  1022. <a name="l00990"></a>00990 _CONST <span class="keywordtype">double</span> tinytens[] =
    1023. 

  1023. <a name="l00991"></a>00991 {1e-16, 1e-32};
    1024. 

  1024. <a name="l00992"></a>00992 <span class="preprocessor">#endif</span>
    1025. 

  1025. <a name="l00993"></a>00993 <span class="preprocessor"></span>
    1026. 

  1026. <a name="l00994"></a>00994 
    1027. 

  1027. <a name="l00995"></a>00995 <span class="keywordtype">double</span>
    1028. 

  1028. <a name="l00996"></a>00996 _DEFUN (_mprec_log10, (dig),
    1029. 

  1029. <a name="l00997"></a>00997         <span class="keywordtype">int</span> dig)
    1030. 

  1030. <a name="l00998"></a>00998 {
    1031. 

  1031. <a name="l00999"></a>00999   <span class="keywordtype">double</span> v = 1.0;
    1032. 

  1032. <a name="l01000"></a>01000   <span class="keywordflow">if</span> (dig &lt; 24)
    1033. 

  1033. <a name="l01001"></a>01001     <span class="keywordflow">return</span> tens[dig];
    1034. 

  1034. <a name="l01002"></a>01002   <span class="keywordflow">while</span> (dig &gt; 0)
    1035. 

  1035. <a name="l01003"></a>01003     {
    1036. 

  1036. <a name="l01004"></a>01004       v *= 10;
    1037. 

  1037. <a name="l01005"></a>01005       dig--;
    1038. 

  1038. <a name="l01006"></a>01006     }
    1039. 

  1039. <a name="l01007"></a>01007   <span class="keywordflow">return</span> v;
    1040. 

  1040. <a name="l01008"></a>01008 }
    1041. 

  1041. <a name="l01009"></a>01009 
    1042. 

  1042. <a name="l01010"></a>01010 <span class="preprocessor">#endif  // SMALL_LIB</span>
    1043. 

  1043. <a name="l01011"></a>01011 <span class="preprocessor"></span>
    1044. 

  1044. <a name="l01012"></a>01012 
    1045. 

  1045. <a name="l01013"></a>01013 <span class="comment">/*****************************************************************************************/</span>
    1046. 

  1046. <a name="l01014"></a>01014 <span class="comment">/*                   FOR   SMALL_LIB                                                                                         */</span>
    1047. 

  1047. <a name="l01015"></a>01015 <span class="comment">/*****************************************************************************************/</span>
    1048. 

  1048. <a name="l01016"></a>01016 
    1049. 

  1049. <a name="l01017"></a>01017 
    1050. 

  1050. <a name="l01018"></a>01018 <span class="preprocessor">#ifdef SMALL_LIB        </span>
    1051. 

  1051. <a name="l01019"></a>01019 <span class="preprocessor"></span>
    1052. 

  1052. <a name="l01020"></a>01020   <span class="comment">/* </span>
    1053. 

  1053. <a name="l01021"></a>01021 <span class="comment">        *       For SMALL_LIB, all references to balloc or bfree have been taken off </span>
    1054. 

  1054. <a name="l01022"></a>01022 <span class="comment">   *    so as to avoided call of malloc libraries</span>
    1055. 

  1055. <a name="l01023"></a>01023 <span class="comment">        *       For each function returning a _Bigint * we added to the function a parameter</span>
    1056. 

  1056. <a name="l01024"></a>01024 <span class="comment">        *       of array type. The purpose of this array is to iniatialized pointers of _Bigint</span>
    1057. 

  1057. <a name="l01025"></a>01025 <span class="comment">        *       with the address of the array instead of the adress provided by balloc.</span>
    1058. 

  1058. <a name="l01026"></a>01026 <span class="comment">        *</span>
    1059. 

  1059. <a name="l01027"></a>01027 <span class="comment">        */</span>
    1060. 

  1060. <a name="l01028"></a>01028 
    1061. 

  1061. <a name="l01029"></a>01029 
    1062. 

  1062. <a name="l01030"></a>01030 
    1063. 

  1063. <a name="l01031"></a>01031 _Bigint *
    1064. 

  1064. <a name="l01032"></a>01032 _DEFUN (small_multadd, (ptr, b, m, a, tab),
    1065. 

  1065. <a name="l01033"></a>01033         <span class="keyword">struct</span> _reent *ptr _AND
    1066. 

  1066. <a name="l01034"></a>01034         _Bigint * b _AND
    1067. 

  1067. <a name="l01035"></a>01035         <span class="keywordtype">int</span> m _AND
    1068. 

  1068. <a name="l01036"></a>01036         <span class="keywordtype">int</span> a _AND
    1069. 

  1069. <a name="l01037"></a>01037         _Bigint tab[])
    1070. 

  1070. <a name="l01038"></a>01038 {
    1071. 

  1071. <a name="l01039"></a>01039    <span class="keywordtype">int</span> i, wds;
    1072. 

  1072. <a name="l01040"></a>01040   __ULong *x, y;
    1073. 

  1073. <a name="l01041"></a>01041 <span class="preprocessor">#ifdef Pack_32</span>
    1074. 

  1074. <a name="l01042"></a>01042 <span class="preprocessor"></span>  __ULong xi, z;
    1075. 

  1075. <a name="l01043"></a>01043 <span class="preprocessor">#endif</span>
    1076. 

  1076. <a name="l01044"></a>01044 <span class="preprocessor"></span>  _Bigint *b1;
    1077. 

  1077. <a name="l01045"></a>01045 
    1078. 

  1078. <a name="l01046"></a>01046   wds = b-&gt;_wds;
    1079. 

  1079. <a name="l01047"></a>01047   x = b-&gt;_x;
    1080. 

  1080. <a name="l01048"></a>01048   i = 0;
    1081. 

  1081. <a name="l01049"></a>01049   <span class="keywordflow">do</span>
    1082. 

  1082. <a name="l01050"></a>01050     {
    1083. 

  1083. <a name="l01051"></a>01051 <span class="preprocessor">#ifdef Pack_32</span>
    1084. 

  1084. <a name="l01052"></a>01052 <span class="preprocessor"></span>      xi = *x;
    1085. 

  1085. <a name="l01053"></a>01053       y = (xi &amp; 0xffff) * m + a;
    1086. 

  1086. <a name="l01054"></a>01054       z = (xi &gt;&gt; 16) * m + (y &gt;&gt; 16);
    1087. 

  1087. <a name="l01055"></a>01055       a = (int) (z &gt;&gt; 16);
    1088. 

  1088. <a name="l01056"></a>01056       *x++ = (z &lt;&lt; 16) + (y &amp; 0xffff);
    1089. 

  1089. <a name="l01057"></a>01057 <span class="preprocessor">#else</span>
    1090. 

  1090. <a name="l01058"></a>01058 <span class="preprocessor"></span>      y = *x * m + a;
    1091. 

  1091. <a name="l01059"></a>01059       a = (int) (y &gt;&gt; 16);
    1092. 

  1092. <a name="l01060"></a>01060       *x++ = y &amp; 0xffff;
    1093. 

  1093. <a name="l01061"></a>01061 <span class="preprocessor">#endif</span>
    1094. 

  1094. <a name="l01062"></a>01062 <span class="preprocessor"></span>    }
    1095. 

  1095. <a name="l01063"></a>01063   <span class="keywordflow">while</span> (++i &lt; wds);
    1096. 

  1096. <a name="l01064"></a>01064   <span class="keywordflow">if</span> (a)
    1097. 

  1097. <a name="l01065"></a>01065     {
    1098. 

  1098. <a name="l01066"></a>01066       <span class="keywordflow">if</span> (wds &gt;= b-&gt;_maxwds)
    1099. 

  1099. <a name="l01067"></a>01067         {
    1100. 

  1100. <a name="l01068"></a>01068           b1=&amp;tab[0];
    1101. 

  1101. <a name="l01069"></a>01069           b1-&gt;_k=b-&gt;_k+1;
    1102. 

  1102. <a name="l01070"></a>01070           b1-&gt;_maxwds = (1 &lt;&lt;(b-&gt;_k+1));
    1103. 

  1103. <a name="l01071"></a>01071           b1-&gt;_sign=b1-&gt;_wds=0;
    1104. 

  1104. <a name="l01072"></a>01072           Bcopy(b1,b);
    1105. 

  1105. <a name="l01073"></a>01073           b=b1;
    1106. 

  1106. <a name="l01074"></a>01074         }
    1107. 

  1107. <a name="l01075"></a>01075       b-&gt;_x[wds++] = a;
    1108. 

  1108. <a name="l01076"></a>01076       b-&gt;_wds = wds;
    1109. 

  1109. <a name="l01077"></a>01077     }
    1110. 

  1110. <a name="l01078"></a>01078   <span class="keywordflow">return</span> b;
    1111. 

  1111. <a name="l01079"></a>01079 }
    1112. 

  1112. <a name="l01080"></a>01080 
    1113. 

  1113. <a name="l01081"></a>01081 
    1114. 

  1114. <a name="l01082"></a>01082 _Bigint *
    1115. 

  1115. <a name="l01083"></a>01083 _DEFUN (small_s2b, (ptr, s, nd0, nd, y9,tab),
    1116. 

  1116. <a name="l01084"></a>01084         <span class="keyword">struct</span> _reent * ptr _AND
    1117. 

  1117. <a name="l01085"></a>01085         _CONST <span class="keywordtype">char</span> *s _AND
    1118. 

  1118. <a name="l01086"></a>01086         <span class="keywordtype">int</span> nd0 _AND
    1119. 

  1119. <a name="l01087"></a>01087         <span class="keywordtype">int</span> nd _AND
    1120. 

  1120. <a name="l01088"></a>01088         __ULong y9 _AND
    1121. 

  1121. <a name="l01089"></a>01089         _Bigint tab[])
    1122. 

  1122. <a name="l01090"></a>01090 {
    1123. 

  1123. <a name="l01091"></a>01091   _Bigint *b;
    1124. 

  1124. <a name="l01092"></a>01092   _Bigint tab_b[50];
    1125. 

  1125. <a name="l01093"></a>01093   <span class="keywordtype">int</span> i, k;
    1126. 

  1126. <a name="l01094"></a>01094   __Long x, y;
    1127. 

  1127. <a name="l01095"></a>01095 
    1128. 

  1128. <a name="l01096"></a>01096   x = (nd + 8) / 9;
    1129. 

  1129. <a name="l01097"></a>01097   <span class="keywordflow">for</span> (k = 0, y = 1; x &gt; y; y &lt;&lt;= 1, k++);
    1130. 

  1130. <a name="l01098"></a>01098 <span class="preprocessor">#ifdef Pack_32 </span>
    1131. 

  1131. <a name="l01099"></a>01099 <span class="preprocessor"></span>  b = &amp;tab[0];
    1132. 

  1132. <a name="l01100"></a>01100   b-&gt;_k=k;
    1133. 

  1133. <a name="l01101"></a>01101   b-&gt;_maxwds = 1 &lt;&lt;k;
    1134. 

  1134. <a name="l01102"></a>01102   b-&gt;_sign=0;
    1135. 

  1135. <a name="l01103"></a>01103   b-&gt;_x[0] = y9;
    1136. 

  1136. <a name="l01104"></a>01104   b-&gt;_wds = 1;
    1137. 

  1137. <a name="l01105"></a>01105 <span class="preprocessor">#else</span>
    1138. 

  1138. <a name="l01106"></a>01106 <span class="preprocessor"></span>  b = &amp;tab[0];
    1139. 

  1139. <a name="l01107"></a>01107    b = &amp;tab[0];
    1140. 

  1140. <a name="l01108"></a>01108   b-&gt;_k=k+1;
    1141. 

  1141. <a name="l01109"></a>01109   b-&gt;_mawxds = 1 &lt;&lt;(k+1);
    1142. 

  1142. <a name="l01110"></a>01110   b-&gt;_sign=0;
    1143. 

  1143. <a name="l01111"></a>01111   b-&gt;_x[0] = y9 &amp; 0xffff;
    1144. 

  1144. <a name="l01112"></a>01112   b-&gt;_wds = (b-&gt;_x[1] = y9 &gt;&gt; 16) ? 2 : 1;
    1145. 

  1145. <a name="l01113"></a>01113 <span class="preprocessor">#endif</span>
    1146. 

  1146. <a name="l01114"></a>01114 <span class="preprocessor"></span>
    1147. 

  1147. <a name="l01115"></a>01115   i = 9;
    1148. 

  1148. <a name="l01116"></a>01116   <span class="keywordflow">if</span> (9 &lt; nd0)
    1149. 

  1149. <a name="l01117"></a>01117     {
    1150. 

  1150. <a name="l01118"></a>01118       s += 9;
    1151. 

  1151. <a name="l01119"></a>01119       
    1152. 

  1152. <a name="l01120"></a>01120       <span class="keywordflow">while</span> (++i &lt; nd0);
    1153. 

  1153. <a name="l01121"></a>01121       s++;
    1154. 

  1154. <a name="l01122"></a>01122     }
    1155. 

  1155. <a name="l01123"></a>01123   <span class="keywordflow">else</span>
    1156. 

  1156. <a name="l01124"></a>01124     s += 10;
    1157. 

  1157. <a name="l01125"></a>01125   <span class="keywordflow">for</span> (; i &lt; nd; i++)
    1158. 

  1158. <a name="l01126"></a>01126     b = small_multadd (ptr, b, 10, *s++ - <span class="charliteral">&apos;0&apos;</span>,tab);
    1159. 

  1159. <a name="l01127"></a>01127   <span class="keywordflow">return</span> b;
    1160. 

  1160. <a name="l01128"></a>01128 }
    1161. 

  1161. <a name="l01129"></a>01129 
    1162. 

  1162. <a name="l01130"></a>01130 <span class="keywordtype">int</span>
    1163. 

  1163. <a name="l01131"></a>01131 _DEFUN (small_hi0bits,
    1164. 

  1164. <a name="l01132"></a>01132         (x), <span class="keyword">register</span> __ULong x)
    1165. 

  1165. <a name="l01133"></a>01133 {
    1166. 

  1166. <a name="l01134"></a>01134   <span class="keyword">register</span> <span class="keywordtype">int</span> k = 0;
    1167. 

  1167. <a name="l01135"></a>01135 
    1168. 

  1168. <a name="l01136"></a>01136   <span class="keywordflow">if</span> (!(x &amp; 0xffff0000))
    1169. 

  1169. <a name="l01137"></a>01137     {
    1170. 

  1170. <a name="l01138"></a>01138       k = 16;
    1171. 

  1171. <a name="l01139"></a>01139       x &lt;&lt;= 16;
    1172. 

  1172. <a name="l01140"></a>01140     }
    1173. 

  1173. <a name="l01141"></a>01141   <span class="keywordflow">if</span> (!(x &amp; 0xff000000))
    1174. 

  1174. <a name="l01142"></a>01142     {
    1175. 

  1175. <a name="l01143"></a>01143       k += 8;
    1176. 

  1176. <a name="l01144"></a>01144       x &lt;&lt;= 8;
    1177. 

  1177. <a name="l01145"></a>01145     }
    1178. 

  1178. <a name="l01146"></a>01146   <span class="keywordflow">if</span> (!(x &amp; 0xf0000000))
    1179. 

  1179. <a name="l01147"></a>01147     {
    1180. 

  1180. <a name="l01148"></a>01148       k += 4;
    1181. 

  1181. <a name="l01149"></a>01149       x &lt;&lt;= 4;
    1182. 

  1182. <a name="l01150"></a>01150     }
    1183. 

  1183. <a name="l01151"></a>01151   <span class="keywordflow">if</span> (!(x &amp; 0xc0000000))
    1184. 

  1184. <a name="l01152"></a>01152     {
    1185. 

  1185. <a name="l01153"></a>01153       k += 2;
    1186. 

  1186. <a name="l01154"></a>01154       x &lt;&lt;= 2;
    1187. 

  1187. <a name="l01155"></a>01155     }
    1188. 

  1188. <a name="l01156"></a>01156   <span class="keywordflow">if</span> (!(x &amp; 0x80000000))
    1189. 

  1189. <a name="l01157"></a>01157     {
    1190. 

  1190. <a name="l01158"></a>01158       k++;
    1191. 

  1191. <a name="l01159"></a>01159       <span class="keywordflow">if</span> (!(x &amp; 0x40000000))
    1192. 

  1192. <a name="l01160"></a>01160         <span class="keywordflow">return</span> 32;
    1193. 

  1193. <a name="l01161"></a>01161     }
    1194. 

  1194. <a name="l01162"></a>01162   <span class="keywordflow">return</span> k;
    1195. 

  1195. <a name="l01163"></a>01163 }
    1196. 

  1196. <a name="l01164"></a>01164 
    1197. 

  1197. <a name="l01165"></a>01165 <span class="keywordtype">int</span>
    1198. 

  1198. <a name="l01166"></a>01166 _DEFUN (small_lo0bits, (y), __ULong *y)
    1199. 

  1199. <a name="l01167"></a>01167 {
    1200. 

  1200. <a name="l01168"></a>01168   <span class="keyword">register</span> <span class="keywordtype">int</span> k;
    1201. 

  1201. <a name="l01169"></a>01169   <span class="keyword">register</span> __ULong x = *y;
    1202. 

  1202. <a name="l01170"></a>01170 
    1203. 

  1203. <a name="l01171"></a>01171   <span class="keywordflow">if</span> (x &amp; 7)
    1204. 

  1204. <a name="l01172"></a>01172     {
    1205. 

  1205. <a name="l01173"></a>01173       <span class="keywordflow">if</span> (x &amp; 1)
    1206. 

  1206. <a name="l01174"></a>01174         <span class="keywordflow">return</span> 0;
    1207. 

  1207. <a name="l01175"></a>01175       <span class="keywordflow">if</span> (x &amp; 2)
    1208. 

  1208. <a name="l01176"></a>01176         {
    1209. 

  1209. <a name="l01177"></a>01177           *y = x &gt;&gt; 1;
    1210. 

  1210. <a name="l01178"></a>01178           <span class="keywordflow">return</span> 1;
    1211. 

  1211. <a name="l01179"></a>01179         }
    1212. 

  1212. <a name="l01180"></a>01180       *y = x &gt;&gt; 2;
    1213. 

  1213. <a name="l01181"></a>01181       <span class="keywordflow">return</span> 2;
    1214. 

  1214. <a name="l01182"></a>01182     }
    1215. 

  1215. <a name="l01183"></a>01183   k = 0;
    1216. 

  1216. <a name="l01184"></a>01184   <span class="keywordflow">if</span> (!(x &amp; 0xffff))
    1217. 

  1217. <a name="l01185"></a>01185     {
    1218. 

  1218. <a name="l01186"></a>01186       k = 16;
    1219. 

  1219. <a name="l01187"></a>01187       x &gt;&gt;= 16;
    1220. 

  1220. <a name="l01188"></a>01188     }
    1221. 

  1221. <a name="l01189"></a>01189   <span class="keywordflow">if</span> (!(x &amp; 0xff))
    1222. 

  1222. <a name="l01190"></a>01190     {
    1223. 

  1223. <a name="l01191"></a>01191       k += 8;
    1224. 

  1224. <a name="l01192"></a>01192       x &gt;&gt;= 8;
    1225. 

  1225. <a name="l01193"></a>01193     }
    1226. 

  1226. <a name="l01194"></a>01194   <span class="keywordflow">if</span> (!(x &amp; 0xf))
    1227. 

  1227. <a name="l01195"></a>01195     {
    1228. 

  1228. <a name="l01196"></a>01196       k += 4;
    1229. 

  1229. <a name="l01197"></a>01197       x &gt;&gt;= 4;
    1230. 

  1230. <a name="l01198"></a>01198     }
    1231. 

  1231. <a name="l01199"></a>01199   <span class="keywordflow">if</span> (!(x &amp; 0x3))
    1232. 

  1232. <a name="l01200"></a>01200     {
    1233. 

  1233. <a name="l01201"></a>01201       k += 2;
    1234. 

  1234. <a name="l01202"></a>01202       x &gt;&gt;= 2;
    1235. 

  1235. <a name="l01203"></a>01203     }
    1236. 

  1236. <a name="l01204"></a>01204   <span class="keywordflow">if</span> (!(x &amp; 1))
    1237. 

  1237. <a name="l01205"></a>01205     {
    1238. 

  1238. <a name="l01206"></a>01206       k++;
    1239. 

  1239. <a name="l01207"></a>01207       x &gt;&gt;= 1;
    1240. 

  1240. <a name="l01208"></a>01208       <span class="keywordflow">if</span> (!x &amp; 1)
    1241. 

  1241. <a name="l01209"></a>01209         <span class="keywordflow">return</span> 32;
    1242. 

  1242. <a name="l01210"></a>01210     }
    1243. 

  1243. <a name="l01211"></a>01211   *y = x;
    1244. 

  1244. <a name="l01212"></a>01212   <span class="keywordflow">return</span> k;
    1245. 

  1245. <a name="l01213"></a>01213 }
    1246. 

  1246. <a name="l01214"></a>01214 
    1247. 

  1247. <a name="l01215"></a>01215 
    1248. 

  1248. <a name="l01216"></a>01216 _Bigint *
    1249. 

  1249. <a name="l01217"></a>01217 _DEFUN (small_i2b, (ptr, i,tab), <span class="keyword">struct</span> _reent * ptr _AND <span class="keywordtype">int</span> i _AND _Bigint tab[])
    1250. 

  1250. <a name="l01218"></a>01218 {
    1251. 

  1251. <a name="l01219"></a>01219    _Bigint *b;
    1252. 

  1252. <a name="l01220"></a>01220 
    1253. 

  1253. <a name="l01221"></a>01221   b=&amp;tab[0];
    1254. 

  1254. <a name="l01222"></a>01222   b-&gt;_k=1;
    1255. 

  1255. <a name="l01223"></a>01223   b-&gt;_maxwds = 1 &lt;&lt; 1;
    1256. 

  1256. <a name="l01224"></a>01224   b-&gt;_sign =0;
    1257. 

  1257. <a name="l01225"></a>01225   b-&gt;_x[0] = i;
    1258. 

  1258. <a name="l01226"></a>01226   b-&gt;_wds = 1;
    1259. 

  1259. <a name="l01227"></a>01227   <span class="keywordflow">return</span> b;
    1260. 

  1260. <a name="l01228"></a>01228 }
    1261. 

  1261. <a name="l01229"></a>01229 
    1262. 

  1262. <a name="l01230"></a>01230 
    1263. 

  1263. <a name="l01231"></a>01231 
    1264. 

  1264. <a name="l01232"></a>01232 _Bigint *
    1265. 

  1265. <a name="l01233"></a>01233 _DEFUN (small_mult, (ptr, a, b,tab), <span class="keyword">struct</span> _reent * ptr _AND _Bigint * a _AND _Bigint * b _AND _Bigint tab[])
    1266. 

  1266. <a name="l01234"></a>01234 {
    1267. 

  1267. <a name="l01235"></a>01235   _Bigint *c;
    1268. 

  1268. <a name="l01236"></a>01236   <span class="keywordtype">int</span> k, wa, wb, wc;
    1269. 

  1269. <a name="l01237"></a>01237   __ULong carry, y, z;
    1270. 

  1270. <a name="l01238"></a>01238   __ULong *x, *xa, *xae, *xb, *xbe, *xc, *xc0;
    1271. 

  1271. <a name="l01239"></a>01239 <span class="preprocessor">#ifdef Pack_32</span>
    1272. 

  1272. <a name="l01240"></a>01240 <span class="preprocessor"></span>  __ULong z2;
    1273. 

  1273. <a name="l01241"></a>01241 <span class="preprocessor">#endif</span>
    1274. 

  1274. <a name="l01242"></a>01242 <span class="preprocessor"></span>
    1275. 

  1275. <a name="l01243"></a>01243   <span class="keywordflow">if</span> (a-&gt;_wds &lt; b-&gt;_wds)
    1276. 

  1276. <a name="l01244"></a>01244     {
    1277. 

  1277. <a name="l01245"></a>01245       c = a;
    1278. 

  1278. <a name="l01246"></a>01246       a = b;
    1279. 

  1279. <a name="l01247"></a>01247       b = c;
    1280. 

  1280. <a name="l01248"></a>01248     }
    1281. 

  1281. <a name="l01249"></a>01249   k = a-&gt;_k;
    1282. 

  1282. <a name="l01250"></a>01250   wa = a-&gt;_wds;
    1283. 

  1283. <a name="l01251"></a>01251   wb = b-&gt;_wds;
    1284. 

  1284. <a name="l01252"></a>01252   wc = wa + wb;
    1285. 

  1285. <a name="l01253"></a>01253   <span class="keywordflow">if</span> (wc &gt; a-&gt;_maxwds)
    1286. 

  1286. <a name="l01254"></a>01254     k++;
    1287. 

  1287. <a name="l01255"></a>01255   c=&amp;tab[0];
    1288. 

  1288. <a name="l01256"></a>01256   c-&gt;_k=k;
    1289. 

  1289. <a name="l01257"></a>01257   c-&gt;_maxwds = 1 &lt;&lt; k;
    1290. 

  1290. <a name="l01258"></a>01258   c-&gt;_sign= c-&gt;_wds =0; 
    1291. 

  1291. <a name="l01259"></a>01259   
    1292. 

  1292. <a name="l01260"></a>01260   <span class="keywordflow">for</span> (x = c-&gt;_x, xa = x + wc; x &lt; xa; x++)
    1293. 

  1293. <a name="l01261"></a>01261     *x = 0;
    1294. 

  1294. <a name="l01262"></a>01262   xa = a-&gt;_x;
    1295. 

  1295. <a name="l01263"></a>01263   xae = xa + wa;
    1296. 

  1296. <a name="l01264"></a>01264   xb = b-&gt;_x;
    1297. 

  1297. <a name="l01265"></a>01265   xbe = xb + wb;
    1298. 

  1298. <a name="l01266"></a>01266   xc0 = c-&gt;_x;
    1299. 

  1299. <a name="l01267"></a>01267 <span class="preprocessor">#ifdef Pack_32</span>
    1300. 

  1300. <a name="l01268"></a>01268 <span class="preprocessor"></span>  <span class="keywordflow">for</span> (; xb &lt; xbe; xb++, xc0++)
    1301. 

  1301. <a name="l01269"></a>01269     {
    1302. 

  1302. <a name="l01270"></a>01270       <span class="keywordflow">if</span> ((y = *xb &amp; 0xffff) != 0)
    1303. 

  1303. <a name="l01271"></a>01271         {
    1304. 

  1304. <a name="l01272"></a>01272           x = xa;
    1305. 

  1305. <a name="l01273"></a>01273           xc = xc0;
    1306. 

  1306. <a name="l01274"></a>01274           carry = 0;
    1307. 

  1307. <a name="l01275"></a>01275           <span class="keywordflow">do</span>
    1308. 

  1308. <a name="l01276"></a>01276             {
    1309. 

  1309. <a name="l01277"></a>01277               z = (*x &amp; 0xffff) * y + (*xc &amp; 0xffff) + carry;
    1310. 

  1310. <a name="l01278"></a>01278               carry = z &gt;&gt; 16;
    1311. 

  1311. <a name="l01279"></a>01279               z2 = (*x++ &gt;&gt; 16) * y + (*xc &gt;&gt; 16) + carry;
    1312. 

  1312. <a name="l01280"></a>01280               carry = z2 &gt;&gt; 16;
    1313. 

  1313. <a name="l01281"></a>01281               Storeinc (xc, z2, z);
    1314. 

  1314. <a name="l01282"></a>01282             }
    1315. 

  1315. <a name="l01283"></a>01283           <span class="keywordflow">while</span> (x &lt; xae);
    1316. 

  1316. <a name="l01284"></a>01284           *xc = carry;
    1317. 

  1317. <a name="l01285"></a>01285         }
    1318. 

  1318. <a name="l01286"></a>01286       <span class="keywordflow">if</span> ((y = *xb &gt;&gt; 16) != 0)
    1319. 

  1319. <a name="l01287"></a>01287         {
    1320. 

  1320. <a name="l01288"></a>01288           x = xa;
    1321. 

  1321. <a name="l01289"></a>01289           xc = xc0;
    1322. 

  1322. <a name="l01290"></a>01290           carry = 0;
    1323. 

  1323. <a name="l01291"></a>01291           z2 = *xc;
    1324. 

  1324. <a name="l01292"></a>01292           <span class="keywordflow">do</span>
    1325. 

  1325. <a name="l01293"></a>01293             {
    1326. 

  1326. <a name="l01294"></a>01294               z = (*x &amp; 0xffff) * y + (*xc &gt;&gt; 16) + carry;
    1327. 

  1327. <a name="l01295"></a>01295               carry = z &gt;&gt; 16;
    1328. 

  1328. <a name="l01296"></a>01296               Storeinc (xc, z, z2);
    1329. 

  1329. <a name="l01297"></a>01297               z2 = (*x++ &gt;&gt; 16) * y + (*xc &amp; 0xffff) + carry;
    1330. 

  1330. <a name="l01298"></a>01298               carry = z2 &gt;&gt; 16;
    1331. 

  1331. <a name="l01299"></a>01299             }
    1332. 

  1332. <a name="l01300"></a>01300           <span class="keywordflow">while</span> (x &lt; xae);
    1333. 

  1333. <a name="l01301"></a>01301           *xc = z2;
    1334. 

  1334. <a name="l01302"></a>01302         }
    1335. 

  1335. <a name="l01303"></a>01303     }
    1336. 

  1336. <a name="l01304"></a>01304 <span class="preprocessor">#else</span>
    1337. 

  1337. <a name="l01305"></a>01305 <span class="preprocessor"></span>  <span class="keywordflow">for</span> (; xb &lt; xbe; xc0++)
    1338. 

  1338. <a name="l01306"></a>01306     {
    1339. 

  1339. <a name="l01307"></a>01307       <span class="keywordflow">if</span> (y = *xb++)
    1340. 

  1340. <a name="l01308"></a>01308         {
    1341. 

  1341. <a name="l01309"></a>01309           x = xa;
    1342. 

  1342. <a name="l01310"></a>01310           xc = xc0;
    1343. 

  1343. <a name="l01311"></a>01311           carry = 0;
    1344. 

  1344. <a name="l01312"></a>01312           <span class="keywordflow">do</span>
    1345. 

  1345. <a name="l01313"></a>01313             {
    1346. 

  1346. <a name="l01314"></a>01314               z = *x++ * y + *xc + carry;
    1347. 

  1347. <a name="l01315"></a>01315               carry = z &gt;&gt; 16;
    1348. 

  1348. <a name="l01316"></a>01316               *xc++ = z &amp; 0xffff;
    1349. 

  1349. <a name="l01317"></a>01317             }
    1350. 

  1350. <a name="l01318"></a>01318           <span class="keywordflow">while</span> (x &lt; xae);
    1351. 

  1351. <a name="l01319"></a>01319           *xc = carry;
    1352. 

  1352. <a name="l01320"></a>01320         }
    1353. 

  1353. <a name="l01321"></a>01321     }
    1354. 

  1354. <a name="l01322"></a>01322 <span class="preprocessor">#endif</span>
    1355. 

  1355. <a name="l01323"></a>01323 <span class="preprocessor"></span>  <span class="keywordflow">for</span> (xc0 = c-&gt;_x, xc = xc0 + wc; wc &gt; 0 &amp;&amp; !*--xc; --wc);
    1356. 

  1356. <a name="l01324"></a>01324   c-&gt;_wds = wc;
    1357. 

  1357. <a name="l01325"></a>01325   <span class="keywordflow">return</span> c;
    1358. 

  1358. <a name="l01326"></a>01326 }
    1359. 

  1359. <a name="l01327"></a>01327 
    1360. 

  1360. <a name="l01328"></a>01328 
    1361. 

  1361. <a name="l01329"></a>01329 
    1362. 

  1362. <a name="l01330"></a>01330 _Bigint *
    1363. 

  1363. <a name="l01331"></a>01331 _DEFUN (small_pow5mult,
    1364. 

  1364. <a name="l01332"></a>01332         (ptr, b, k, tab), <span class="keyword">struct</span> _reent * ptr _AND _Bigint * b _AND <span class="keywordtype">int</span> k _AND _Bigint tab[])
    1365. 

  1365. <a name="l01333"></a>01333 {
    1366. 

  1366. <a name="l01334"></a>01334   _Bigint *b1, *p5, *p51;
    1367. 

  1367. <a name="l01335"></a>01335   _Bigint tab_p5[50], tab_p5mult[50];
    1368. 

  1368. <a name="l01336"></a>01336   _Bigint tab_b2[40], tab_b1[40];
    1369. 

  1369. <a name="l01337"></a>01337   <span class="keywordtype">int</span> i;
    1370. 

  1370. <a name="l01338"></a>01338   <span class="keywordtype">int</span> k_sauv;
    1371. 

  1371. <a name="l01339"></a>01339   <span class="keyword">static</span> _CONST <span class="keywordtype">int</span> p05[3] = {5, 25, 125};
    1372. 

  1372. <a name="l01340"></a>01340   <span class="keywordflow">if</span> ((i = k &amp; 3) != 0){
    1373. 

  1373. <a name="l01341"></a>01341     k_sauv=k;
    1374. 

  1374. <a name="l01342"></a>01342     k_sauv &gt;&gt;= 2;
    1375. 

  1375. <a name="l01343"></a>01343     <span class="keywordflow">if</span> (!(k_sauv)){ <span class="comment">// we anticipate the case !(k&gt;&gt;=2) with return so as </span>
    1376. 

  1376. <a name="l01344"></a>01344                                          <span class="comment">//to provide the good address &amp;tab[0]     </span>
    1377. 

  1377. <a name="l01345"></a>01345      b = small_multadd (ptr, b, p05[i - 1], 0,&amp;tab[0]);
    1378. 

  1378. <a name="l01346"></a>01346      <span class="keywordflow">return</span> b;
    1379. 

  1379. <a name="l01347"></a>01347     }
    1380. 

  1380. <a name="l01348"></a>01348     <span class="keywordflow">else</span>{
    1381. 

  1381. <a name="l01349"></a>01349      b = small_multadd (ptr, b, p05[i - 1], 0,&amp;tab_b1[0]); <span class="comment">//&amp;tab_b1[0] is an temporary address that</span>
    1382. 

  1382. <a name="l01350"></a>01350                                                                                                                                                   <span class="comment">// that we provide to b</span>
    1383. 

  1383. <a name="l01351"></a>01351     }
    1384. 

  1384. <a name="l01352"></a>01352   }   
    1385. 

  1385. <a name="l01353"></a>01353   <span class="keywordflow">if</span> (!(k&gt;&gt;= 2)){
    1386. 

  1386. <a name="l01354"></a>01354     <span class="keywordflow">return</span> b; 
    1387. 

  1387. <a name="l01355"></a>01355   }   
    1388. 

  1388. <a name="l01356"></a>01356   <span class="keywordflow">if</span> (p5 != tab_p5 ){ <span class="comment">/* first time */</span>
    1389. 

  1389. <a name="l01357"></a>01357       p5 =small_i2b (ptr, 625,tab_p5); 
    1390. 

  1390. <a name="l01358"></a>01358       p5-&gt;_next = 0;
    1391. 

  1391. <a name="l01359"></a>01359   }
    1392. 

  1392. <a name="l01360"></a>01360    
    1393. 

  1393. <a name="l01361"></a>01361   <span class="keywordflow">for</span> (;;) {<span class="comment">// We are in a loop for each variable and call of mult we must provide a</span>
    1394. 

  1394. <a name="l01362"></a>01362                            <span class="comment">// an address which differs from the current address of the variable</span>
    1395. 

  1395. <a name="l01363"></a>01363                            <span class="comment">// that is why we add a test on the current address</span>
    1396. 

  1396. <a name="l01364"></a>01364 
    1397. 

  1397. <a name="l01365"></a>01365   <span class="keywordflow">if</span> (k &amp; 1){     
    1398. 

  1398. <a name="l01366"></a>01366           
    1399. 

  1399. <a name="l01367"></a>01367           k_sauv = k ;
    1400. 

  1400. <a name="l01368"></a>01368           <span class="keywordflow">if</span> (!(k_sauv &gt;&gt;= 1) ){ <span class="comment">// it is the last passage in the loop</span>
    1401. 

  1401. <a name="l01369"></a>01369                                                                          <span class="comment">// we must provide the good address</span>
    1402. 

  1402. <a name="l01370"></a>01370             b1 = small_mult (ptr, b, p5,&amp;tab[0]);
    1403. 

  1403. <a name="l01371"></a>01371             b  = b1;      
    1404. 

  1404. <a name="l01372"></a>01372             <span class="keywordflow">break</span>;
    1405. 

  1405. <a name="l01373"></a>01373           }
    1406. 

  1406. <a name="l01374"></a>01374           <span class="keywordflow">else</span> {
    1407. 

  1407. <a name="l01375"></a>01375             <span class="keywordflow">if</span> (b == &amp;tab_b1[0]){
    1408. 

  1408. <a name="l01376"></a>01376                b1 = small_mult (ptr, b, p5,&amp;tab_b2[0]);
    1409. 

  1409. <a name="l01377"></a>01377             }
    1410. 

  1410. <a name="l01378"></a>01378             <span class="keywordflow">else</span> {
    1411. 

  1411. <a name="l01379"></a>01379                b1 = small_mult (ptr, b, p5,&amp;tab_b1[0]);
    1412. 

  1412. <a name="l01380"></a>01380             }  
    1413. 

  1413. <a name="l01381"></a>01381           }
    1414. 

  1414. <a name="l01382"></a>01382           b  = b1;                
    1415. 

  1415. <a name="l01383"></a>01383   }
    1416. 

  1416. <a name="l01384"></a>01384   <span class="keywordflow">if</span> (!(k &gt;&gt;= 1))
    1417. 

  1417. <a name="l01385"></a>01385         <span class="keywordflow">break</span>;
    1418. 

  1418. <a name="l01386"></a>01386       <span class="keywordflow">if</span> (!(p51 = p5-&gt;_next))
    1419. 

  1419. <a name="l01387"></a>01387         {
    1420. 

  1420. <a name="l01388"></a>01388           <span class="keywordflow">if</span> ( p5 == &amp;tab_p5[0] ){
    1421. 

  1421. <a name="l01389"></a>01389           p51 = p5-&gt;_next = small_mult (ptr, p5, p5,&amp;tab_p5mult[0]);
    1422. 

  1422. <a name="l01390"></a>01390           }
    1423. 

  1423. <a name="l01391"></a>01391           <span class="keywordflow">else</span> {  
    1424. 

  1424. <a name="l01392"></a>01392           p51 = p5-&gt;_next = small_mult (ptr, p5, p5,&amp;tab_p5[0]);
    1425. 

  1425. <a name="l01393"></a>01393           }       
    1426. 

  1426. <a name="l01394"></a>01394           p51-&gt;_next = 0;
    1427. 

  1427. <a name="l01395"></a>01395         }
    1428. 

  1428. <a name="l01396"></a>01396       p5 = p51;
    1429. 

  1429. <a name="l01397"></a>01397     }
    1430. 

  1430. <a name="l01398"></a>01398   <span class="keywordflow">return</span> b;
    1431. 

  1431. <a name="l01399"></a>01399 }
    1432. 

  1432. <a name="l01400"></a>01400 
    1433. 

  1433. <a name="l01401"></a>01401 
    1434. 

  1434. <a name="l01402"></a>01402 _Bigint *
    1435. 

  1435. <a name="l01403"></a>01403 _DEFUN (small_lshift, (ptr, b, k,tab), <span class="keyword">struct</span> _reent * ptr _AND _Bigint * b _AND <span class="keywordtype">int</span> k _AND _Bigint tab[] )
    1436. 

  1436. <a name="l01404"></a>01404 {
    1437. 

  1437. <a name="l01405"></a>01405   <span class="keywordtype">int</span> i, k1, n, n1;
    1438. 

  1438. <a name="l01406"></a>01406   _Bigint *b1;
    1439. 

  1439. <a name="l01407"></a>01407   __ULong *x, *x1, *xe, z;
    1440. 

  1440. <a name="l01408"></a>01408 
    1441. 

  1441. <a name="l01409"></a>01409 <span class="preprocessor">#ifdef Pack_32</span>
    1442. 

  1442. <a name="l01410"></a>01410 <span class="preprocessor"></span>  n = k &gt;&gt; 5;
    1443. 

  1443. <a name="l01411"></a>01411 <span class="preprocessor">#else</span>
    1444. 

  1444. <a name="l01412"></a>01412 <span class="preprocessor"></span>  n = k &gt;&gt; 4;
    1445. 

  1445. <a name="l01413"></a>01413 <span class="preprocessor">#endif</span>
    1446. 

  1446. <a name="l01414"></a>01414 <span class="preprocessor"></span>  k1 = b-&gt;_k;
    1447. 

  1447. <a name="l01415"></a>01415   n1 = n + b-&gt;_wds + 1;
    1448. 

  1448. <a name="l01416"></a>01416   <span class="keywordflow">for</span> (i = b-&gt;_maxwds; n1 &gt; i; i &lt;&lt;= 1)
    1449. 

  1449. <a name="l01417"></a>01417   k1++;
    1450. 

  1450. <a name="l01418"></a>01418  <span class="comment">//b1 = Balloc (ptr, k1);</span>
    1451. 

  1451. <a name="l01419"></a>01419  b1=&amp;tab[0];
    1452. 

  1452. <a name="l01420"></a>01420  b1-&gt;_k=k1;
    1453. 

  1453. <a name="l01421"></a>01421  b1-&gt;_maxwds = 1 &lt;&lt; k1;
    1454. 

  1454. <a name="l01422"></a>01422  b1-&gt;_sign= b1-&gt;_wds =0;
    1455. 

  1455. <a name="l01423"></a>01423   x1 = b1-&gt;_x;
    1456. 

  1456. <a name="l01424"></a>01424   <span class="keywordflow">for</span> (i = 0; i &lt; n; i++)
    1457. 

  1457. <a name="l01425"></a>01425     *x1++ = 0;
    1458. 

  1458. <a name="l01426"></a>01426   x = b-&gt;_x;
    1459. 

  1459. <a name="l01427"></a>01427   xe = x + b-&gt;_wds;
    1460. 

  1460. <a name="l01428"></a>01428 <span class="preprocessor">#ifdef Pack_32</span>
    1461. 

  1461. <a name="l01429"></a>01429 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (k &amp;= 0x1f)
    1462. 

  1462. <a name="l01430"></a>01430     {
    1463. 

  1463. <a name="l01431"></a>01431       k1 = 32 - k;
    1464. 

  1464. <a name="l01432"></a>01432       z = 0;
    1465. 

  1465. <a name="l01433"></a>01433       <span class="keywordflow">do</span>
    1466. 

  1466. <a name="l01434"></a>01434         {
    1467. 

  1467. <a name="l01435"></a>01435           *x1++ = *x &lt;&lt; k | z;
    1468. 

  1468. <a name="l01436"></a>01436           z = *x++ &gt;&gt; k1;
    1469. 

  1469. <a name="l01437"></a>01437         }
    1470. 

  1470. <a name="l01438"></a>01438       <span class="keywordflow">while</span> (x &lt; xe);
    1471. 

  1471. <a name="l01439"></a>01439       <span class="keywordflow">if</span> ((*x1 = z) != 0)
    1472. 

  1472. <a name="l01440"></a>01440         ++n1;
    1473. 

  1473. <a name="l01441"></a>01441     }
    1474. 

  1474. <a name="l01442"></a>01442 <span class="preprocessor">#else</span>
    1475. 

  1475. <a name="l01443"></a>01443 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (k &amp;= 0xf)
    1476. 

  1476. <a name="l01444"></a>01444     {
    1477. 

  1477. <a name="l01445"></a>01445       k1 = 16 - k;
    1478. 

  1478. <a name="l01446"></a>01446       z = 0;
    1479. 

  1479. <a name="l01447"></a>01447       <span class="keywordflow">do</span>
    1480. 

  1480. <a name="l01448"></a>01448         {
    1481. 

  1481. <a name="l01449"></a>01449           *x1++ = *x &lt;&lt; k &amp; 0xffff | z;
    1482. 

  1482. <a name="l01450"></a>01450           z = *x++ &gt;&gt; k1;
    1483. 

  1483. <a name="l01451"></a>01451         }
    1484. 

  1484. <a name="l01452"></a>01452       <span class="keywordflow">while</span> (x &lt; xe);
    1485. 

  1485. <a name="l01453"></a>01453       <span class="keywordflow">if</span> (*x1 = z)
    1486. 

  1486. <a name="l01454"></a>01454         ++n1;
    1487. 

  1487. <a name="l01455"></a>01455     }
    1488. 

  1488. <a name="l01456"></a>01456 <span class="preprocessor">#endif</span>
    1489. 

  1489. <a name="l01457"></a>01457 <span class="preprocessor"></span>  <span class="keywordflow">else</span>
    1490. 

  1490. <a name="l01458"></a>01458     <span class="keywordflow">do</span>
    1491. 

  1491. <a name="l01459"></a>01459       *x1++ = *x++;
    1492. 

  1492. <a name="l01460"></a>01460     <span class="keywordflow">while</span> (x &lt; xe);
    1493. 

  1493. <a name="l01461"></a>01461   b1-&gt;_wds = n1 - 1;
    1494. 

  1494. <a name="l01462"></a>01462   <span class="comment">//Bfree (ptr, b);</span>
    1495. 

  1495. <a name="l01463"></a>01463   <span class="keywordflow">return</span> b1;
    1496. 

  1496. <a name="l01464"></a>01464 }
    1497. 

  1497. <a name="l01465"></a>01465 
    1498. 

  1498. <a name="l01466"></a>01466 <span class="keywordtype">int</span>
    1499. 

  1499. <a name="l01467"></a>01467 _DEFUN (small_cmp, (a, b), _Bigint * a _AND _Bigint * b)
    1500. 

  1500. <a name="l01468"></a>01468 {
    1501. 

  1501. <a name="l01469"></a>01469   __ULong *xa, *xa0, *xb, *xb0;
    1502. 

  1502. <a name="l01470"></a>01470   <span class="keywordtype">int</span> i, j;
    1503. 

  1503. <a name="l01471"></a>01471 
    1504. 

  1504. <a name="l01472"></a>01472   i = a-&gt;_wds;
    1505. 

  1505. <a name="l01473"></a>01473   j = b-&gt;_wds;
    1506. 

  1506. <a name="l01474"></a>01474 <span class="preprocessor">#ifdef DEBUG</span>
    1507. 

  1507. <a name="l01475"></a>01475 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (i &gt; 1 &amp;&amp; !a-&gt;_x[i - 1])
    1508. 

  1508. <a name="l01476"></a>01476     Bug (<span class="stringliteral">&quot;cmp called with a-&gt;_x[a-&gt;_wds-1] == 0&quot;</span>);
    1509. 

  1509. <a name="l01477"></a>01477   <span class="keywordflow">if</span> (j &gt; 1 &amp;&amp; !b-&gt;_x[j - 1])
    1510. 

  1510. <a name="l01478"></a>01478     Bug (<span class="stringliteral">&quot;cmp called with b-&gt;_x[b-&gt;_wds-1] == 0&quot;</span>);
    1511. 

  1511. <a name="l01479"></a>01479 <span class="preprocessor">#endif</span>
    1512. 

  1512. <a name="l01480"></a>01480 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (i -= j)
    1513. 

  1513. <a name="l01481"></a>01481     <span class="keywordflow">return</span> i;
    1514. 

  1514. <a name="l01482"></a>01482   xa0 = a-&gt;_x;
    1515. 

  1515. <a name="l01483"></a>01483   xa = xa0 + j;
    1516. 

  1516. <a name="l01484"></a>01484   xb0 = b-&gt;_x;
    1517. 

  1517. <a name="l01485"></a>01485   xb = xb0 + j;
    1518. 

  1518. <a name="l01486"></a>01486   <span class="keywordflow">for</span> (;;)
    1519. 

  1519. <a name="l01487"></a>01487     {
    1520. 

  1520. <a name="l01488"></a>01488       <span class="keywordflow">if</span> (*--xa != *--xb)
    1521. 

  1521. <a name="l01489"></a>01489         <span class="keywordflow">return</span> *xa &lt; *xb ? -1 : 1;
    1522. 

  1522. <a name="l01490"></a>01490       <span class="keywordflow">if</span> (xa &lt;= xa0)
    1523. 

  1523. <a name="l01491"></a>01491         <span class="keywordflow">break</span>;
    1524. 

  1524. <a name="l01492"></a>01492     }
    1525. 

  1525. <a name="l01493"></a>01493   <span class="keywordflow">return</span> 0;
    1526. 

  1526. <a name="l01494"></a>01494 }
    1527. 

  1527. <a name="l01495"></a>01495 
    1528. 

  1528. <a name="l01496"></a>01496 
    1529. 

  1529. <a name="l01497"></a>01497 
    1530. 

  1530. <a name="l01498"></a>01498 _Bigint *
    1531. 

  1531. <a name="l01499"></a>01499 _DEFUN (small_diff, (ptr, a, b,tab), <span class="keyword">struct</span> _reent * ptr _AND
    1532. 

  1532. <a name="l01500"></a>01500         _Bigint * a _AND _Bigint * b _AND _Bigint tab[])
    1533. 

  1533. <a name="l01501"></a>01501 {
    1534. 

  1534. <a name="l01502"></a>01502   _Bigint *c;
    1535. 

  1535. <a name="l01503"></a>01503   <span class="keywordtype">int</span> i, wa, wb;
    1536. 

  1536. <a name="l01504"></a>01504   __Long borrow, y;             <span class="comment">/* We need signed shifts here. */</span>
    1537. 

  1537. <a name="l01505"></a>01505   __ULong *xa, *xae, *xb, *xbe, *xc;
    1538. 

  1538. <a name="l01506"></a>01506 <span class="preprocessor">#ifdef Pack_32</span>
    1539. 

  1539. <a name="l01507"></a>01507 <span class="preprocessor"></span>  __Long z;
    1540. 

  1540. <a name="l01508"></a>01508 <span class="preprocessor">#endif</span>
    1541. 

  1541. <a name="l01509"></a>01509 <span class="preprocessor"></span>
    1542. 

  1542. <a name="l01510"></a>01510   i = small_cmp (a, b);
    1543. 

  1543. <a name="l01511"></a>01511   <span class="keywordflow">if</span> (!i)
    1544. 

  1544. <a name="l01512"></a>01512     {
    1545. 

  1545. <a name="l01513"></a>01513       c=&amp;tab[0];
    1546. 

  1546. <a name="l01514"></a>01514       c-&gt;_k = 0;
    1547. 

  1547. <a name="l01515"></a>01515       c-&gt;_maxwds = (1 &lt;&lt; 0) ;
    1548. 

  1548. <a name="l01516"></a>01516       c-&gt;_sign = 0 ;
    1549. 

  1549. <a name="l01517"></a>01517       c-&gt;_wds = 1;
    1550. 

  1550. <a name="l01518"></a>01518       c-&gt;_x[0] = 0;
    1551. 

  1551. <a name="l01519"></a>01519       <span class="keywordflow">return</span> c;
    1552. 

  1552. <a name="l01520"></a>01520     }
    1553. 

  1553. <a name="l01521"></a>01521   <span class="keywordflow">if</span> (i &lt; 0)
    1554. 

  1554. <a name="l01522"></a>01522     {
    1555. 

  1555. <a name="l01523"></a>01523       c = a;
    1556. 

  1556. <a name="l01524"></a>01524       a = b;
    1557. 

  1557. <a name="l01525"></a>01525       b = c;
    1558. 

  1558. <a name="l01526"></a>01526       i = 1;
    1559. 

  1559. <a name="l01527"></a>01527     }
    1560. 

  1560. <a name="l01528"></a>01528   <span class="keywordflow">else</span>
    1561. 

  1561. <a name="l01529"></a>01529   i = 0;
    1562. 

  1562. <a name="l01530"></a>01530   c=&amp;tab[0];
    1563. 

  1563. <a name="l01531"></a>01531   c-&gt;_k = a-&gt;_k;
    1564. 

  1564. <a name="l01532"></a>01532   c-&gt;_maxwds = (1 &lt;&lt; (a-&gt;_k)) ;
    1565. 

  1565. <a name="l01533"></a>01533   c-&gt;_wds = 0 ;
    1566. 

  1566. <a name="l01534"></a>01534   c-&gt;_sign = i;
    1567. 

  1567. <a name="l01535"></a>01535   wa = a-&gt;_wds;
    1568. 

  1568. <a name="l01536"></a>01536   xa = a-&gt;_x;
    1569. 

  1569. <a name="l01537"></a>01537   xae = xa + wa;
    1570. 

  1570. <a name="l01538"></a>01538   wb = b-&gt;_wds;
    1571. 

  1571. <a name="l01539"></a>01539   xb = b-&gt;_x;
    1572. 

  1572. <a name="l01540"></a>01540   xbe = xb + wb;
    1573. 

  1573. <a name="l01541"></a>01541   xc = c-&gt;_x;
    1574. 

  1574. <a name="l01542"></a>01542   borrow = 0;
    1575. 

  1575. <a name="l01543"></a>01543 <span class="preprocessor">#ifdef Pack_32</span>
    1576. 

  1576. <a name="l01544"></a>01544 <span class="preprocessor"></span>  <span class="keywordflow">do</span>
    1577. 

  1577. <a name="l01545"></a>01545     {
    1578. 

  1578. <a name="l01546"></a>01546       y = (*xa &amp; 0xffff) - (*xb &amp; 0xffff) + borrow;
    1579. 

  1579. <a name="l01547"></a>01547       borrow = y &gt;&gt; 16;
    1580. 

  1580. <a name="l01548"></a>01548       Sign_Extend (borrow, y);
    1581. 

  1581. <a name="l01549"></a>01549       z = (*xa++ &gt;&gt; 16) - (*xb++ &gt;&gt; 16) + borrow;
    1582. 

  1582. <a name="l01550"></a>01550       borrow = z &gt;&gt; 16;
    1583. 

  1583. <a name="l01551"></a>01551       Sign_Extend (borrow, z);
    1584. 

  1584. <a name="l01552"></a>01552       Storeinc (xc, z, y);
    1585. 

  1585. <a name="l01553"></a>01553     }
    1586. 

  1586. <a name="l01554"></a>01554   <span class="keywordflow">while</span> (xb &lt; xbe);
    1587. 

  1587. <a name="l01555"></a>01555   <span class="keywordflow">while</span> (xa &lt; xae)
    1588. 

  1588. <a name="l01556"></a>01556     {
    1589. 

  1589. <a name="l01557"></a>01557       y = (*xa &amp; 0xffff) + borrow;
    1590. 

  1590. <a name="l01558"></a>01558       borrow = y &gt;&gt; 16;
    1591. 

  1591. <a name="l01559"></a>01559       Sign_Extend (borrow, y);
    1592. 

  1592. <a name="l01560"></a>01560       z = (*xa++ &gt;&gt; 16) + borrow;
    1593. 

  1593. <a name="l01561"></a>01561       borrow = z &gt;&gt; 16;
    1594. 

  1594. <a name="l01562"></a>01562       Sign_Extend (borrow, z);
    1595. 

  1595. <a name="l01563"></a>01563       Storeinc (xc, z, y);
    1596. 

  1596. <a name="l01564"></a>01564     }
    1597. 

  1597. <a name="l01565"></a>01565 <span class="preprocessor">#else</span>
    1598. 

  1598. <a name="l01566"></a>01566 <span class="preprocessor"></span>  <span class="keywordflow">do</span>
    1599. 

  1599. <a name="l01567"></a>01567     {
    1600. 

  1600. <a name="l01568"></a>01568       y = *xa++ - *xb++ + borrow;
    1601. 

  1601. <a name="l01569"></a>01569       borrow = y &gt;&gt; 16;
    1602. 

  1602. <a name="l01570"></a>01570       Sign_Extend (borrow, y);
    1603. 

  1603. <a name="l01571"></a>01571       *xc++ = y &amp; 0xffff;
    1604. 

  1604. <a name="l01572"></a>01572     }
    1605. 

  1605. <a name="l01573"></a>01573   <span class="keywordflow">while</span> (xb &lt; xbe);
    1606. 

  1606. <a name="l01574"></a>01574   <span class="keywordflow">while</span> (xa &lt; xae)
    1607. 

  1607. <a name="l01575"></a>01575     {
    1608. 

  1608. <a name="l01576"></a>01576       y = *xa++ + borrow;
    1609. 

  1609. <a name="l01577"></a>01577       borrow = y &gt;&gt; 16;
    1610. 

  1610. <a name="l01578"></a>01578       Sign_Extend (borrow, y);
    1611. 

  1611. <a name="l01579"></a>01579       *xc++ = y &amp; 0xffff;
    1612. 

  1612. <a name="l01580"></a>01580     }
    1613. 

  1613. <a name="l01581"></a>01581 <span class="preprocessor">#endif</span>
    1614. 

  1614. <a name="l01582"></a>01582 <span class="preprocessor"></span>  <span class="keywordflow">while</span> (!*--xc)
    1615. 

  1615. <a name="l01583"></a>01583     wa--;
    1616. 

  1616. <a name="l01584"></a>01584   c-&gt;_wds = wa;
    1617. 

  1617. <a name="l01585"></a>01585   <span class="keywordflow">return</span> c;
    1618. 

  1618. <a name="l01586"></a>01586 }
    1619. 

  1619. <a name="l01587"></a>01587 
    1620. 

  1620. <a name="l01588"></a>01588 <span class="keywordtype">double</span>
    1621. 

  1621. <a name="l01589"></a>01589 _DEFUN (small_ulp, (_x), <span class="keywordtype">double</span> _x)
    1622. 

  1622. <a name="l01590"></a>01590 {
    1623. 

  1623. <a name="l01591"></a>01591   <span class="keyword">union </span>double_union x, a;
    1624. 

  1624. <a name="l01592"></a>01592   <span class="keyword">register</span> __Long L;
    1625. 

  1625. <a name="l01593"></a>01593 
    1626. 

  1626. <a name="l01594"></a>01594   x.d = _x;
    1627. 

  1627. <a name="l01595"></a>01595 
    1628. 

  1628. <a name="l01596"></a>01596   L = (word0 (x) &amp; Exp_mask) - (P - 1) * Exp_msk1;
    1629. 

  1629. <a name="l01597"></a>01597 <span class="preprocessor">#ifndef Sudden_Underflow</span>
    1630. 

  1630. <a name="l01598"></a>01598 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (L &gt; 0)
    1631. 

  1631. <a name="l01599"></a>01599     {
    1632. 

  1632. <a name="l01600"></a>01600 <span class="preprocessor">#endif</span>
    1633. 

  1633. <a name="l01601"></a>01601 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
    1634. 

  1634. <a name="l01602"></a>01602 <span class="preprocessor"></span>      L |= Exp_msk1 &gt;&gt; 4;
    1635. 

  1635. <a name="l01603"></a>01603 <span class="preprocessor">#endif</span>
    1636. 

  1636. <a name="l01604"></a>01604 <span class="preprocessor"></span>      word0 (a) = L;
    1637. 

  1637. <a name="l01605"></a>01605 <span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
    1638. 

  1638. <a name="l01606"></a>01606 <span class="preprocessor"></span>      word1 (a) = 0;
    1639. 

  1639. <a name="l01607"></a>01607 <span class="preprocessor">#endif</span>
    1640. 

  1640. <a name="l01608"></a>01608 <span class="preprocessor"></span>
    1641. 

  1641. <a name="l01609"></a>01609 <span class="preprocessor">#ifndef Sudden_Underflow</span>
    1642. 

  1642. <a name="l01610"></a>01610 <span class="preprocessor"></span>    }
    1643. 

  1643. <a name="l01611"></a>01611   <span class="keywordflow">else</span>
    1644. 

  1644. <a name="l01612"></a>01612     {
    1645. 

  1645. <a name="l01613"></a>01613       L = -L &gt;&gt; Exp_shift;
    1646. 

  1646. <a name="l01614"></a>01614       <span class="keywordflow">if</span> (L &lt; Exp_shift)
    1647. 

  1647. <a name="l01615"></a>01615         {
    1648. 

  1648. <a name="l01616"></a>01616           word0 (a) = 0x80000 &gt;&gt; L;
    1649. 

  1649. <a name="l01617"></a>01617 <span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
    1650. 

  1650. <a name="l01618"></a>01618 <span class="preprocessor"></span>          word1 (a) = 0;
    1651. 

  1651. <a name="l01619"></a>01619 <span class="preprocessor">#endif</span>
    1652. 

  1652. <a name="l01620"></a>01620 <span class="preprocessor"></span>        }
    1653. 

  1653. <a name="l01621"></a>01621       <span class="keywordflow">else</span>
    1654. 

  1654. <a name="l01622"></a>01622         {
    1655. 

  1655. <a name="l01623"></a>01623           word0 (a) = 0;
    1656. 

  1656. <a name="l01624"></a>01624           L -= Exp_shift;
    1657. 

  1657. <a name="l01625"></a>01625 <span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
    1658. 

  1658. <a name="l01626"></a>01626 <span class="preprocessor"></span>         word1 (a) = L &gt;= 31 ? 1 : 1 &lt;&lt; (31 - L);
    1659. 

  1659. <a name="l01627"></a>01627 <span class="preprocessor">#endif</span>
    1660. 

  1660. <a name="l01628"></a>01628 <span class="preprocessor"></span>        }
    1661. 

  1661. <a name="l01629"></a>01629     }
    1662. 

  1662. <a name="l01630"></a>01630 <span class="preprocessor">#endif</span>
    1663. 

  1663. <a name="l01631"></a>01631 <span class="preprocessor"></span>  <span class="keywordflow">return</span> a.d;
    1664. 

  1664. <a name="l01632"></a>01632 }
    1665. 

  1665. <a name="l01633"></a>01633 
    1666. 

  1666. <a name="l01634"></a>01634 <span class="keywordtype">double</span>
    1667. 

  1667. <a name="l01635"></a>01635 _DEFUN (small_b2d, (a, e),
    1668. 

  1668. <a name="l01636"></a>01636         _Bigint * a _AND <span class="keywordtype">int</span> *e)
    1669. 

  1669. <a name="l01637"></a>01637 {
    1670. 

  1670. <a name="l01638"></a>01638   __ULong *xa, *xa0, w, y, z;
    1671. 

  1671. <a name="l01639"></a>01639   <span class="keywordtype">int</span> k;
    1672. 

  1672. <a name="l01640"></a>01640   <span class="keyword">union </span>double_union d;
    1673. 

  1673. <a name="l01641"></a>01641 <span class="preprocessor">#ifdef VAX</span>
    1674. 

  1674. <a name="l01642"></a>01642 <span class="preprocessor"></span>  __ULong d0, d1;
    1675. 

  1675. <a name="l01643"></a>01643 <span class="preprocessor">#else</span>
    1676. 

  1676. <a name="l01644"></a>01644 <span class="preprocessor"></span><span class="preprocessor">#define d0 word0(d)</span>
    1677. 

  1677. <a name="l01645"></a>01645 <span class="preprocessor"></span><span class="preprocessor">#define d1 word1(d)</span>
    1678. 

  1678. <a name="l01646"></a>01646 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
    1679. 

  1679. <a name="l01647"></a>01647 <span class="preprocessor"></span>
    1680. 

  1680. <a name="l01648"></a>01648   xa0 = a-&gt;_x;
    1681. 

  1681. <a name="l01649"></a>01649   xa = xa0 + a-&gt;_wds;
    1682. 

  1682. <a name="l01650"></a>01650   y = *--xa;
    1683. 

  1683. <a name="l01651"></a>01651 <span class="preprocessor">#ifdef DEBUG</span>
    1684. 

  1684. <a name="l01652"></a>01652 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (!y)
    1685. 

  1685. <a name="l01653"></a>01653     Bug (<span class="stringliteral">&quot;zero y in b2d&quot;</span>);
    1686. 

  1686. <a name="l01654"></a>01654 <span class="preprocessor">#endif</span>
    1687. 

  1687. <a name="l01655"></a>01655 <span class="preprocessor"></span>  k = small_hi0bits (y);
    1688. 

  1688. <a name="l01656"></a>01656   *e = 32 - k;
    1689. 

  1689. <a name="l01657"></a>01657 <span class="preprocessor">#ifdef Pack_32</span>
    1690. 

  1690. <a name="l01658"></a>01658 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (k &lt; Ebits)
    1691. 

  1691. <a name="l01659"></a>01659     {
    1692. 

  1692. <a name="l01660"></a>01660       d0 = Exp_1 | y &gt;&gt; (Ebits - k);
    1693. 

  1693. <a name="l01661"></a>01661       w = xa &gt; xa0 ? *--xa : 0;
    1694. 

  1694. <a name="l01662"></a>01662 <span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
    1695. 

  1695. <a name="l01663"></a>01663 <span class="preprocessor"></span>      d1 = y &lt;&lt; ((32 - Ebits) + k) | w &gt;&gt; (Ebits - k);
    1696. 

  1696. <a name="l01664"></a>01664 <span class="preprocessor">#endif</span>
    1697. 

  1697. <a name="l01665"></a>01665 <span class="preprocessor"></span>      <span class="keywordflow">goto</span> ret_d;
    1698. 

  1698. <a name="l01666"></a>01666     }
    1699. 

  1699. <a name="l01667"></a>01667   z = xa &gt; xa0 ? *--xa : 0;
    1700. 

  1700. <a name="l01668"></a>01668   <span class="keywordflow">if</span> (k -= Ebits)
    1701. 

  1701. <a name="l01669"></a>01669     {
    1702. 

  1702. <a name="l01670"></a>01670       d0 = Exp_1 | y &lt;&lt; k | z &gt;&gt; (32 - k);
    1703. 

  1703. <a name="l01671"></a>01671       y = xa &gt; xa0 ? *--xa : 0;
    1704. 

  1704. <a name="l01672"></a>01672 <span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
    1705. 

  1705. <a name="l01673"></a>01673 <span class="preprocessor"></span>      d1 = z &lt;&lt; k | y &gt;&gt; (32 - k);
    1706. 

  1706. <a name="l01674"></a>01674 <span class="preprocessor">#endif</span>
    1707. 

  1707. <a name="l01675"></a>01675 <span class="preprocessor"></span>    }
    1708. 

  1708. <a name="l01676"></a>01676   <span class="keywordflow">else</span>
    1709. 

  1709. <a name="l01677"></a>01677     {
    1710. 

  1710. <a name="l01678"></a>01678       d0 = Exp_1 | y;
    1711. 

  1711. <a name="l01679"></a>01679 <span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
    1712. 

  1712. <a name="l01680"></a>01680 <span class="preprocessor"></span>      d1 = z;
    1713. 

  1713. <a name="l01681"></a>01681 <span class="preprocessor">#endif</span>
    1714. 

  1714. <a name="l01682"></a>01682 <span class="preprocessor"></span>    }
    1715. 

  1715. <a name="l01683"></a>01683 <span class="preprocessor">#else</span>
    1716. 

  1716. <a name="l01684"></a>01684 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (k &lt; Ebits + 16)
    1717. 

  1717. <a name="l01685"></a>01685     {
    1718. 

  1718. <a name="l01686"></a>01686       z = xa &gt; xa0 ? *--xa : 0;
    1719. 

  1719. <a name="l01687"></a>01687       d0 = Exp_1 | y &lt;&lt; k - Ebits | z &gt;&gt; Ebits + 16 - k;
    1720. 

  1720. <a name="l01688"></a>01688       w = xa &gt; xa0 ? *--xa : 0;
    1721. 

  1721. <a name="l01689"></a>01689       y = xa &gt; xa0 ? *--xa : 0;
    1722. 

  1722. <a name="l01690"></a>01690       d1 = z &lt;&lt; k + 16 - Ebits | w &lt;&lt; k - Ebits | y &gt;&gt; 16 + Ebits - k;
    1723. 

  1723. <a name="l01691"></a>01691       <span class="keywordflow">goto</span> ret_d;
    1724. 

  1724. <a name="l01692"></a>01692     }
    1725. 

  1725. <a name="l01693"></a>01693   z = xa &gt; xa0 ? *--xa : 0;
    1726. 

  1726. <a name="l01694"></a>01694   w = xa &gt; xa0 ? *--xa : 0;
    1727. 

  1727. <a name="l01695"></a>01695   k -= Ebits + 16;
    1728. 

  1728. <a name="l01696"></a>01696   d0 = Exp_1 | y &lt;&lt; k + 16 | z &lt;&lt; k | w &gt;&gt; 16 - k;
    1729. 

  1729. <a name="l01697"></a>01697   y = xa &gt; xa0 ? *--xa : 0;
    1730. 

  1730. <a name="l01698"></a>01698   d1 = w &lt;&lt; k + 16 | y &lt;&lt; k;
    1731. 

  1731. <a name="l01699"></a>01699 <span class="preprocessor">#endif</span>
    1732. 

  1732. <a name="l01700"></a>01700 <span class="preprocessor"></span>ret_d:
    1733. 

  1733. <a name="l01701"></a>01701 <span class="preprocessor">#ifdef VAX</span>
    1734. 

  1734. <a name="l01702"></a>01702 <span class="preprocessor"></span>  word0 (d) = d0 &gt;&gt; 16 | d0 &lt;&lt; 16;
    1735. 

  1735. <a name="l01703"></a>01703   word1 (d) = d1 &gt;&gt; 16 | d1 &lt;&lt; 16;
    1736. 

  1736. <a name="l01704"></a>01704 <span class="preprocessor">#else</span>
    1737. 

  1737. <a name="l01705"></a>01705 <span class="preprocessor"></span><span class="preprocessor">#undef d0</span>
    1738. 

  1738. <a name="l01706"></a>01706 <span class="preprocessor"></span><span class="preprocessor">#undef d1</span>
    1739. 

  1739. <a name="l01707"></a>01707 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
    1740. 

  1740. <a name="l01708"></a>01708 <span class="preprocessor"></span>  <span class="keywordflow">return</span> d.d;
    1741. 

  1741. <a name="l01709"></a>01709 }
    1742. 

  1742. <a name="l01710"></a>01710 
    1743. 

  1743. <a name="l01711"></a>01711 
    1744. 

  1744. <a name="l01712"></a>01712 _Bigint *
    1745. 

  1745. <a name="l01713"></a>01713 _DEFUN (small_d2b,
    1746. 

  1746. <a name="l01714"></a>01714         (ptr, _d, e, bits,tab),
    1747. 

  1747. <a name="l01715"></a>01715         <span class="keyword">struct</span> _reent * ptr _AND
    1748. 

  1748. <a name="l01716"></a>01716         <span class="keywordtype">double</span> _d _AND
    1749. 

  1749. <a name="l01717"></a>01717         <span class="keywordtype">int</span> *e _AND
    1750. 

  1750. <a name="l01718"></a>01718         <span class="keywordtype">int</span> *bits _AND
    1751. 

  1751. <a name="l01719"></a>01719         _Bigint tab[]
    1752. 

  1752. <a name="l01720"></a>01720         )
    1753. 

  1753. <a name="l01721"></a>01721 
    1754. 

  1754. <a name="l01722"></a>01722 {
    1755. 

  1755. <a name="l01723"></a>01723   <span class="keyword">union </span>double_union d;
    1756. 

  1756. <a name="l01724"></a>01724   _Bigint *b;
    1757. 

  1757. <a name="l01725"></a>01725   
    1758. 

  1758. <a name="l01726"></a>01726   <span class="keywordtype">int</span> de, i, k;
    1759. 

  1759. <a name="l01727"></a>01727   __ULong *x, y, z;
    1760. 

  1760. <a name="l01728"></a>01728 <span class="preprocessor">#ifdef VAX</span>
    1761. 

  1761. <a name="l01729"></a>01729 <span class="preprocessor"></span>  __ULong d0, d1;
    1762. 

  1762. <a name="l01730"></a>01730 <span class="preprocessor">#endif</span>
    1763. 

  1763. <a name="l01731"></a>01731 <span class="preprocessor"></span>  d.d = _d;
    1764. 

  1764. <a name="l01732"></a>01732 <span class="preprocessor">#ifdef VAX</span>
    1765. 

  1765. <a name="l01733"></a>01733 <span class="preprocessor"></span>  d0 = word0 (d) &gt;&gt; 16 | word0 (d) &lt;&lt; 16;
    1766. 

  1766. <a name="l01734"></a>01734   d1 = word1 (d) &gt;&gt; 16 | word1 (d) &lt;&lt; 16;
    1767. 

  1767. <a name="l01735"></a>01735 <span class="preprocessor">#else</span>
    1768. 

  1768. <a name="l01736"></a>01736 <span class="preprocessor"></span><span class="preprocessor">#define d0 word0(d)</span>
    1769. 

  1769. <a name="l01737"></a>01737 <span class="preprocessor"></span><span class="preprocessor">#define d1 word1(d)</span>
    1770. 

  1770. <a name="l01738"></a>01738 <span class="preprocessor"></span>  d.d = _d;
    1771. 

  1771. <a name="l01739"></a>01739 <span class="preprocessor">#endif</span>
    1772. 

  1772. <a name="l01740"></a>01740 <span class="preprocessor"></span>
    1773. 

  1773. <a name="l01741"></a>01741 <span class="preprocessor">#ifdef Pack_32</span>
    1774. 

  1774. <a name="l01742"></a>01742 <span class="preprocessor"></span>  b=&amp;tab[0];
    1775. 

  1775. <a name="l01743"></a>01743   b-&gt;_k = 1;
    1776. 

  1776. <a name="l01744"></a>01744   b-&gt;_maxwds = (1 &lt;&lt; 1) ;
    1777. 

  1777. <a name="l01745"></a>01745   b-&gt;_sign = b-&gt;_wds = 0 ;
    1778. 

  1778. <a name="l01746"></a>01746   
    1779. 

  1779. <a name="l01747"></a>01747 <span class="preprocessor">#else</span>
    1780. 

  1780. <a name="l01748"></a>01748 <span class="preprocessor"></span>  b=&amp;tab[0];
    1781. 

  1781. <a name="l01749"></a>01749   b-&gt;_k = 2;
    1782. 

  1782. <a name="l01750"></a>01750   b-&gt;_maxwds = (1 &lt;&lt; 2) ;
    1783. 

  1783. <a name="l01751"></a>01751   b-&gt;_sign = b-&gt;_wds = 0 ;
    1784. 

  1784. <a name="l01752"></a>01752 <span class="preprocessor">#endif </span>
    1785. 

  1785. <a name="l01753"></a>01753 <span class="preprocessor"></span>
    1786. 

  1786. <a name="l01754"></a>01754 
    1787. 

  1787. <a name="l01755"></a>01755   x = b-&gt;_x;
    1788. 

  1788. <a name="l01756"></a>01756 
    1789. 

  1789. <a name="l01757"></a>01757   z = d0 &amp; Frac_mask;
    1790. 

  1790. <a name="l01758"></a>01758   d0 &amp;= 0x7fffffff;             <span class="comment">/* clear sign bit, which we ignore */</span>
    1791. 

  1791. <a name="l01759"></a>01759 <span class="preprocessor">#ifdef Sudden_Underflow</span>
    1792. 

  1792. <a name="l01760"></a>01760 <span class="preprocessor"></span>  de = (int) (d0 &gt;&gt; Exp_shift);
    1793. 

  1793. <a name="l01761"></a>01761 <span class="preprocessor">#ifndef IBM</span>
    1794. 

  1794. <a name="l01762"></a>01762 <span class="preprocessor"></span>  z |= Exp_msk11;
    1795. 

  1795. <a name="l01763"></a>01763 <span class="preprocessor">#endif</span>
    1796. 

  1796. <a name="l01764"></a>01764 <span class="preprocessor"></span><span class="preprocessor">#else</span>
    1797. 

  1797. <a name="l01765"></a>01765 <span class="preprocessor"></span>  <span class="keywordflow">if</span> ((de = (<span class="keywordtype">int</span>) (d0 &gt;&gt; Exp_shift)) != 0)
    1798. 

  1798. <a name="l01766"></a>01766     z |= Exp_msk1;
    1799. 

  1799. <a name="l01767"></a>01767 <span class="preprocessor">#endif</span>
    1800. 

  1800. <a name="l01768"></a>01768 <span class="preprocessor"></span><span class="preprocessor">#ifdef Pack_32</span>
    1801. 

  1801. <a name="l01769"></a>01769 <span class="preprocessor"></span><span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
    1802. 

  1802. <a name="l01770"></a>01770 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (d1)
    1803. 

  1803. <a name="l01771"></a>01771     {
    1804. 

  1804. <a name="l01772"></a>01772       y = d1;
    1805. 

  1805. <a name="l01773"></a>01773       k = small_lo0bits (&amp;y);
    1806. 

  1806. <a name="l01774"></a>01774       <span class="keywordflow">if</span> (k)
    1807. 

  1807. <a name="l01775"></a>01775         {
    1808. 

  1808. <a name="l01776"></a>01776          x[0] = y | z &lt;&lt; (32 - k);
    1809. 

  1809. <a name="l01777"></a>01777           z &gt;&gt;= k;
    1810. 

  1810. <a name="l01778"></a>01778         }
    1811. 

  1811. <a name="l01779"></a>01779       <span class="keywordflow">else</span>
    1812. 

  1812. <a name="l01780"></a>01780         x[0] = y;
    1813. 

  1813. <a name="l01781"></a>01781       i = b-&gt;_wds = (x[1] = z) ? 2 : 1;
    1814. 

  1814. <a name="l01782"></a>01782     }
    1815. 

  1815. <a name="l01783"></a>01783   <span class="keywordflow">else</span>
    1816. 

  1816. <a name="l01784"></a>01784 <span class="preprocessor">#endif</span>
    1817. 

  1817. <a name="l01785"></a>01785 <span class="preprocessor"></span>    {
    1818. 

  1818. <a name="l01786"></a>01786 <span class="preprocessor">#ifdef DEBUG</span>
    1819. 

  1819. <a name="l01787"></a>01787 <span class="preprocessor"></span>      <span class="keywordflow">if</span> (!z)
    1820. 

  1820. <a name="l01788"></a>01788         Bug (<span class="stringliteral">&quot;Zero passed to d2b&quot;</span>);
    1821. 

  1821. <a name="l01789"></a>01789 <span class="preprocessor">#endif</span>
    1822. 

  1822. <a name="l01790"></a>01790 <span class="preprocessor"></span>      k = small_lo0bits (&amp;z);
    1823. 

  1823. <a name="l01791"></a>01791       x[0] = z;
    1824. 

  1824. <a name="l01792"></a>01792       i = b-&gt;_wds = 1;
    1825. 

  1825. <a name="l01793"></a>01793 <span class="preprocessor">#ifndef _DOUBLE_IS_32BITS</span>
    1826. 

  1826. <a name="l01794"></a>01794 <span class="preprocessor"></span>      k += 32;
    1827. 

  1827. <a name="l01795"></a>01795 <span class="preprocessor">#endif</span>
    1828. 

  1828. <a name="l01796"></a>01796 <span class="preprocessor"></span>    }
    1829. 

  1829. <a name="l01797"></a>01797 <span class="preprocessor">#else</span>
    1830. 

  1830. <a name="l01798"></a>01798 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (d1)
    1831. 

  1831. <a name="l01799"></a>01799     {
    1832. 

  1832. <a name="l01800"></a>01800       y = d1;
    1833. 

  1833. <a name="l01801"></a>01801       k = small_lo0bits (&amp;y);
    1834. 

  1834. <a name="l01802"></a>01802       <span class="keywordflow">if</span> (k)
    1835. 

  1835. <a name="l01803"></a>01803         <span class="keywordflow">if</span> (k &gt;= 16)
    1836. 

  1836. <a name="l01804"></a>01804           {
    1837. 

  1837. <a name="l01805"></a>01805             x[0] = y | z &lt;&lt; 32 - k &amp; 0xffff;
    1838. 

  1838. <a name="l01806"></a>01806             x[1] = z &gt;&gt; k - 16 &amp; 0xffff;
    1839. 

  1839. <a name="l01807"></a>01807             x[2] = z &gt;&gt; k;
    1840. 

  1840. <a name="l01808"></a>01808             i = 2;
    1841. 

  1841. <a name="l01809"></a>01809           }
    1842. 

  1842. <a name="l01810"></a>01810         <span class="keywordflow">else</span>
    1843. 

  1843. <a name="l01811"></a>01811           {
    1844. 

  1844. <a name="l01812"></a>01812             x[0] = y &amp; 0xffff;
    1845. 

  1845. <a name="l01813"></a>01813             x[1] = y &gt;&gt; 16 | z &lt;&lt; 16 - k &amp; 0xffff;
    1846. 

  1846. <a name="l01814"></a>01814             x[2] = z &gt;&gt; k &amp; 0xffff;
    1847. 

  1847. <a name="l01815"></a>01815             x[3] = z &gt;&gt; k + 16;
    1848. 

  1848. <a name="l01816"></a>01816             i = 3;
    1849. 

  1849. <a name="l01817"></a>01817           }
    1850. 

  1850. <a name="l01818"></a>01818       <span class="keywordflow">else</span>
    1851. 

  1851. <a name="l01819"></a>01819         {
    1852. 

  1852. <a name="l01820"></a>01820           x[0] = y &amp; 0xffff;
    1853. 

  1853. <a name="l01821"></a>01821           x[1] = y &gt;&gt; 16;
    1854. 

  1854. <a name="l01822"></a>01822           x[2] = z &amp; 0xffff;
    1855. 

  1855. <a name="l01823"></a>01823           x[3] = z &gt;&gt; 16;
    1856. 

  1856. <a name="l01824"></a>01824           i = 3;
    1857. 

  1857. <a name="l01825"></a>01825         }
    1858. 

  1858. <a name="l01826"></a>01826     }
    1859. 

  1859. <a name="l01827"></a>01827   <span class="keywordflow">else</span>
    1860. 

  1860. <a name="l01828"></a>01828     {
    1861. 

  1861. <a name="l01829"></a>01829 <span class="preprocessor">#ifdef DEBUG</span>
    1862. 

  1862. <a name="l01830"></a>01830 <span class="preprocessor"></span>      <span class="keywordflow">if</span> (!z)
    1863. 

  1863. <a name="l01831"></a>01831         Bug (<span class="stringliteral">&quot;Zero passed to d2b&quot;</span>);
    1864. 

  1864. <a name="l01832"></a>01832 <span class="preprocessor">#endif</span>
    1865. 

  1865. <a name="l01833"></a>01833 <span class="preprocessor"></span>      k = lo0bits (&amp;z);
    1866. 

  1866. <a name="l01834"></a>01834       <span class="keywordflow">if</span> (k &gt;= 16)
    1867. 

  1867. <a name="l01835"></a>01835         {
    1868. 

  1868. <a name="l01836"></a>01836           x[0] = z;
    1869. 

  1869. <a name="l01837"></a>01837           i = 0;
    1870. 

  1870. <a name="l01838"></a>01838         }
    1871. 

  1871. <a name="l01839"></a>01839       <span class="keywordflow">else</span>
    1872. 

  1872. <a name="l01840"></a>01840         {
    1873. 

  1873. <a name="l01841"></a>01841           x[0] = z &amp; 0xffff;
    1874. 

  1874. <a name="l01842"></a>01842           x[1] = z &gt;&gt; 16;
    1875. 

  1875. <a name="l01843"></a>01843           i = 1;
    1876. 

  1876. <a name="l01844"></a>01844         }
    1877. 

  1877. <a name="l01845"></a>01845       k += 32;
    1878. 

  1878. <a name="l01846"></a>01846     }
    1879. 

  1879. <a name="l01847"></a>01847   <span class="keywordflow">while</span> (!x[i])
    1880. 

  1880. <a name="l01848"></a>01848     --i;
    1881. 

  1881. <a name="l01849"></a>01849   b-&gt;_wds = i + 1;
    1882. 

  1882. <a name="l01850"></a>01850 <span class="preprocessor">#endif</span>
    1883. 

  1883. <a name="l01851"></a>01851 <span class="preprocessor"></span><span class="preprocessor">#ifndef Sudden_Underflow</span>
    1884. 

  1884. <a name="l01852"></a>01852 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (de)
    1885. 

  1885. <a name="l01853"></a>01853     {
    1886. 

  1886. <a name="l01854"></a>01854 <span class="preprocessor">#endif</span>
    1887. 

  1887. <a name="l01855"></a>01855 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
    1888. 

  1888. <a name="l01856"></a>01856 <span class="preprocessor"></span>      *e = (de - Bias - (P - 1) &lt;&lt; 2) + k;
    1889. 

  1889. <a name="l01857"></a>01857       *bits = 4 * P + 8 - k - small_hi0bits (word0 (d) &amp; Frac_mask);
    1890. 

  1890. <a name="l01858"></a>01858 <span class="preprocessor">#else</span>
    1891. 

  1891. <a name="l01859"></a>01859 <span class="preprocessor"></span>      *e = de - Bias - (P - 1) + k;
    1892. 

  1892. <a name="l01860"></a>01860       *bits = P - k;
    1893. 

  1893. <a name="l01861"></a>01861 <span class="preprocessor">#endif</span>
    1894. 

  1894. <a name="l01862"></a>01862 <span class="preprocessor"></span><span class="preprocessor">#ifndef Sudden_Underflow</span>
    1895. 

  1895. <a name="l01863"></a>01863 <span class="preprocessor"></span>    }
    1896. 

  1896. <a name="l01864"></a>01864   <span class="keywordflow">else</span>
    1897. 

  1897. <a name="l01865"></a>01865     {
    1898. 

  1898. <a name="l01866"></a>01866       *e = de - Bias - (P - 1) + 1 + k;
    1899. 

  1899. <a name="l01867"></a>01867 <span class="preprocessor">#ifdef Pack_32</span>
    1900. 

  1900. <a name="l01868"></a>01868 <span class="preprocessor"></span>      *bits = 32 * i - small_hi0bits (x[i - 1]);
    1901. 

  1901. <a name="l01869"></a>01869 <span class="preprocessor">#else</span>
    1902. 

  1902. <a name="l01870"></a>01870 <span class="preprocessor"></span>      *bits = (i + 2) * 16 - small_hi0bits (x[i]);
    1903. 

  1903. <a name="l01871"></a>01871 <span class="preprocessor">#endif</span>
    1904. 

  1904. <a name="l01872"></a>01872 <span class="preprocessor"></span>    }
    1905. 

  1905. <a name="l01873"></a>01873 <span class="preprocessor">#endif</span>
    1906. 

  1906. <a name="l01874"></a>01874 <span class="preprocessor"></span>  <span class="keywordflow">return</span> b;
    1907. 

  1907. <a name="l01875"></a>01875 }
    1908. 

  1908. <a name="l01876"></a>01876 <span class="preprocessor">#undef d0</span>
    1909. 

  1909. <a name="l01877"></a>01877 <span class="preprocessor"></span><span class="preprocessor">#undef d1</span>
    1910. 

  1910. <a name="l01878"></a>01878 <span class="preprocessor"></span>
    1911. 

  1911. <a name="l01879"></a>01879 <span class="keywordtype">double</span>
    1912. 

  1912. <a name="l01880"></a>01880 _DEFUN (small_ratio, (a, b), _Bigint * a _AND _Bigint * b)
    1913. 

  1913. <a name="l01881"></a>01881 
    1914. 

  1914. <a name="l01882"></a>01882 {
    1915. 

  1915. <a name="l01883"></a>01883   <span class="keyword">union </span>double_union da, db;
    1916. 

  1916. <a name="l01884"></a>01884   <span class="keywordtype">int</span> k, ka, kb;
    1917. 

  1917. <a name="l01885"></a>01885 
    1918. 

  1918. <a name="l01886"></a>01886   da.d = small_b2d (a, &amp;ka);
    1919. 

  1919. <a name="l01887"></a>01887   db.d = small_b2d (b, &amp;kb);
    1920. 

  1920. <a name="l01888"></a>01888 <span class="preprocessor">#ifdef Pack_32</span>
    1921. 

  1921. <a name="l01889"></a>01889 <span class="preprocessor"></span>  k = ka - kb + 32 * (a-&gt;_wds - b-&gt;_wds);
    1922. 

  1922. <a name="l01890"></a>01890 <span class="preprocessor">#else</span>
    1923. 

  1923. <a name="l01891"></a>01891 <span class="preprocessor"></span>  k = ka - kb + 16 * (a-&gt;_wds - b-&gt;_wds);
    1924. 

  1924. <a name="l01892"></a>01892 <span class="preprocessor">#endif</span>
    1925. 

  1925. <a name="l01893"></a>01893 <span class="preprocessor"></span><span class="preprocessor">#ifdef IBM</span>
    1926. 

  1926. <a name="l01894"></a>01894 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (k &gt; 0)
    1927. 

  1927. <a name="l01895"></a>01895     {
    1928. 

  1928. <a name="l01896"></a>01896       word0 (da) += (k &gt;&gt; 2) * Exp_msk1;
    1929. 

  1929. <a name="l01897"></a>01897       <span class="keywordflow">if</span> (k &amp;= 3)
    1930. 

  1930. <a name="l01898"></a>01898         da.d *= 1 &lt;&lt; k;
    1931. 

  1931. <a name="l01899"></a>01899     }
    1932. 

  1932. <a name="l01900"></a>01900   <span class="keywordflow">else</span>
    1933. 

  1933. <a name="l01901"></a>01901     {
    1934. 

  1934. <a name="l01902"></a>01902       k = -k;
    1935. 

  1935. <a name="l01903"></a>01903       word0 (db) += (k &gt;&gt; 2) * Exp_msk1;
    1936. 

  1936. <a name="l01904"></a>01904       <span class="keywordflow">if</span> (k &amp;= 3)
    1937. 

  1937. <a name="l01905"></a>01905         db.d *= 1 &lt;&lt; k;
    1938. 

  1938. <a name="l01906"></a>01906     }
    1939. 

  1939. <a name="l01907"></a>01907 <span class="preprocessor">#else</span>
    1940. 

  1940. <a name="l01908"></a>01908 <span class="preprocessor"></span>  <span class="keywordflow">if</span> (k &gt; 0)
    1941. 

  1941. <a name="l01909"></a>01909     word0 (da) += k * Exp_msk1;
    1942. 

  1942. <a name="l01910"></a>01910   <span class="keywordflow">else</span>
    1943. 

  1943. <a name="l01911"></a>01911     {
    1944. 

  1944. <a name="l01912"></a>01912       k = -k;
    1945. 

  1945. <a name="l01913"></a>01913       word0 (db) += k * Exp_msk1;
    1946. 

  1946. <a name="l01914"></a>01914     }
    1947. 

  1947. <a name="l01915"></a>01915 <span class="preprocessor">#endif</span>
    1948. 

  1948. <a name="l01916"></a>01916 <span class="preprocessor"></span>  <span class="keywordflow">return</span> da.d / db.d;
    1949. 

  1949. <a name="l01917"></a>01917 }
    1950. 

  1950. <a name="l01918"></a>01918 
    1951. 

  1951. <a name="l01919"></a>01919 
    1952. 

  1952. <a name="l01920"></a>01920 _CONST <span class="keywordtype">double</span>
    1953. 

  1953. <a name="l01921"></a>01921   small_tens[] =
    1954. 

  1954. <a name="l01922"></a>01922 {
    1955. 

  1955. <a name="l01923"></a>01923   1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9,
    1956. 

  1956. <a name="l01924"></a>01924   1e10, 1e11, 1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19,
    1957. 

  1957. <a name="l01925"></a>01925   1e20, 1e21, 1e22, 1e23, 1e24
    1958. 

  1958. <a name="l01926"></a>01926 
    1959. 

  1959. <a name="l01927"></a>01927 };
    1960. 

  1960. <a name="l01928"></a>01928 
    1961. 

  1961. <a name="l01929"></a>01929 <span class="preprocessor">#if !defined(_DOUBLE_IS_32BITS) &amp;&amp; !defined(__v800)</span>
    1962. 

  1962. <a name="l01930"></a>01930 <span class="preprocessor"></span>_CONST <span class="keywordtype">double</span> small_bigtens[] =
    1963. 

  1963. <a name="l01931"></a>01931 {1e16, 1e32, 1e64, 1e128, 1e256};
    1964. 

  1964. <a name="l01932"></a>01932 
    1965. 

  1965. <a name="l01933"></a>01933 _CONST <span class="keywordtype">double</span> small_tinytens[] =
    1966. 

  1966. <a name="l01934"></a>01934 {1e-16, 1e-32, 1e-64, 1e-128, 1e-256};
    1967. 

  1967. <a name="l01935"></a>01935 <span class="preprocessor">#else</span>
    1968. 

  1968. <a name="l01936"></a>01936 <span class="preprocessor"></span>_CONST <span class="keywordtype">double</span> small_bigtens[] =
    1969. 

  1969. <a name="l01937"></a>01937 {1e16, 1e32};
    1970. 

  1970. <a name="l01938"></a>01938 
    1971. 

  1971. <a name="l01939"></a>01939 _CONST <span class="keywordtype">double</span> small_tinytens[] =
    1972. 

  1972. <a name="l01940"></a>01940 {1e-16, 1e-32};
    1973. 

  1973. <a name="l01941"></a>01941 <span class="preprocessor">#endif</span>
    1974. 

  1974. <a name="l01942"></a>01942 <span class="preprocessor"></span>
    1975. 

  1975. <a name="l01943"></a>01943 
    1976. 

  1976. <a name="l01944"></a>01944 
    1977. 

  1977. <a name="l01945"></a>01945 
    1978. 

  1978. <a name="l01946"></a>01946 <span class="keywordtype">double</span>
    1979. 

  1979. <a name="l01947"></a>01947 _DEFUN (small__mprec_log10, (dig),
    1980. 

  1980. <a name="l01948"></a>01948         <span class="keywordtype">int</span> dig)
    1981. 

  1981. <a name="l01949"></a>01949 {
    1982. 

  1982. <a name="l01950"></a>01950   <span class="keywordtype">double</span> v = 1.0;
    1983. 

  1983. <a name="l01951"></a>01951   <span class="keywordflow">if</span> (dig &lt; 24)
    1984. 

  1984. <a name="l01952"></a>01952     <span class="keywordflow">return</span> small_tens[dig];
    1985. 

  1985. <a name="l01953"></a>01953   <span class="keywordflow">while</span> (dig &gt; 0)
    1986. 

  1986. <a name="l01954"></a>01954     {
    1987. 

  1987. <a name="l01955"></a>01955       v *= 10;
    1988. 

  1988. <a name="l01956"></a>01956       dig--;
    1989. 

  1989. <a name="l01957"></a>01957     }
    1990. 

  1990. <a name="l01958"></a>01958   <span class="keywordflow">return</span> v;
    1991. 

  1991. <a name="l01959"></a>01959 }
    1992. 

  1992. <a name="l01960"></a>01960 
    1993. 

  1993. <a name="l01961"></a>01961 <span class="preprocessor">#endif // SMALL_PRINTF</span>
    1994. 

  1994. <a name="l01962"></a>01962 <span class="preprocessor"></span>
    1995. 

  1995. <a name="l01963"></a>01963 
    1996. 

  1996. </pre></div></div>
    1997. 

  1997. <hr size="1"/><address style="text-align: right;"><small>Generated on Mon Apr 11 14:23:40 2011 for Contiki 2.5 by&nbsp;
    1998. 

  1998. <a href="http://www.doxygen.org/index.html">
    1999. 

  1999. <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.1 </small></address>
    2000. 

  2000. </body>
    2001. 

  2001. </html>
    2002. 

  2002.