b_log.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471
  1. /*
  2. * Copyright (c) 1992, 1993
  3. * The Regents of the University of California. All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions
  7. * are met:
  8. * 1. Redistributions of source code must retain the above copyright
  9. * notice, this list of conditions and the following disclaimer.
  10. * 2. Redistributions in binary form must reproduce the above copyright
  11. * notice, this list of conditions and the following disclaimer in the
  12. * documentation and/or other materials provided with the distribution.
  13. * 3. All advertising materials mentioning features or use of this software
  14. * must display the following acknowledgement:
  15. * This product includes software developed by the University of
  16. * California, Berkeley and its contributors.
  17. * 4. Neither the name of the University nor the names of its contributors
  18. * may be used to endorse or promote products derived from this software
  19. * without specific prior written permission.
  20. *
  21. * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  22. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24. * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  25. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31. * SUCH DAMAGE.
  32. */
  33. /* @(#)log.c 8.2 (Berkeley) 11/30/93 */
  34. #include "cdefs-compat.h"
  35. //__FBSDID("$FreeBSD: src/lib/msun/bsdsrc/b_log.c,v 1.9 2008/02/22 02:26:51 das Exp $");
  36. #include <openlibm.h>
  37. #include <errno.h>
  38. #include "mathimpl.h"
  39. /* Table-driven natural logarithm.
  40. *
  41. * This code was derived, with minor modifications, from:
  42. * Peter Tang, "Table-Driven Implementation of the
  43. * Logarithm in IEEE Floating-Point arithmetic." ACM Trans.
  44. * Math Software, vol 16. no 4, pp 378-400, Dec 1990).
  45. *
  46. * Calculates log(2^m*F*(1+f/F)), |f/j| <= 1/256,
  47. * where F = j/128 for j an integer in [0, 128].
  48. *
  49. * log(2^m) = log2_hi*m + log2_tail*m
  50. * since m is an integer, the dominant term is exact.
  51. * m has at most 10 digits (for subnormal numbers),
  52. * and log2_hi has 11 trailing zero bits.
  53. *
  54. * log(F) = logF_hi[j] + logF_lo[j] is in tabular form in log_table.h
  55. * logF_hi[] + 512 is exact.
  56. *
  57. * log(1+f/F) = 2*f/(2*F + f) + 1/12 * (2*f/(2*F + f))**3 + ...
  58. * the leading term is calculated to extra precision in two
  59. * parts, the larger of which adds exactly to the dominant
  60. * m and F terms.
  61. * There are two cases:
  62. * 1. when m, j are non-zero (m | j), use absolute
  63. * precision for the leading term.
  64. * 2. when m = j = 0, |1-x| < 1/256, and log(x) ~= (x-1).
  65. * In this case, use a relative precision of 24 bits.
  66. * (This is done differently in the original paper)
  67. *
  68. * Special cases:
  69. * 0 return signalling -Inf
  70. * neg return signalling NaN
  71. * +Inf return +Inf
  72. */
  73. #define N 128
  74. /* Table of log(Fj) = logF_head[j] + logF_tail[j], for Fj = 1+j/128.
  75. * Used for generation of extend precision logarithms.
  76. * The constant 35184372088832 is 2^45, so the divide is exact.
  77. * It ensures correct reading of logF_head, even for inaccurate
  78. * decimal-to-binary conversion routines. (Everybody gets the
  79. * right answer for integers less than 2^53.)
  80. * Values for log(F) were generated using error < 10^-57 absolute
  81. * with the bc -l package.
  82. */
  83. static double A1 = .08333333333333178827;
  84. static double A2 = .01250000000377174923;
  85. static double A3 = .002232139987919447809;
  86. static double A4 = .0004348877777076145742;
  87. static double logF_head[N+1] = {
  88. 0.,
  89. .007782140442060381246,
  90. .015504186535963526694,
  91. .023167059281547608406,
  92. .030771658666765233647,
  93. .038318864302141264488,
  94. .045809536031242714670,
  95. .053244514518837604555,
  96. .060624621816486978786,
  97. .067950661908525944454,
  98. .075223421237524235039,
  99. .082443669210988446138,
  100. .089612158689760690322,
  101. .096729626458454731618,
  102. .103796793681567578460,
  103. .110814366340264314203,
  104. .117783035656430001836,
  105. .124703478501032805070,
  106. .131576357788617315236,
  107. .138402322859292326029,
  108. .145182009844575077295,
  109. .151916042025732167530,
  110. .158605030176659056451,
  111. .165249572895390883786,
  112. .171850256926518341060,
  113. .178407657472689606947,
  114. .184922338493834104156,
  115. .191394852999565046047,
  116. .197825743329758552135,
  117. .204215541428766300668,
  118. .210564769107350002741,
  119. .216873938300523150246,
  120. .223143551314024080056,
  121. .229374101064877322642,
  122. .235566071312860003672,
  123. .241719936886966024758,
  124. .247836163904594286577,
  125. .253915209980732470285,
  126. .259957524436686071567,
  127. .265963548496984003577,
  128. .271933715484010463114,
  129. .277868451003087102435,
  130. .283768173130738432519,
  131. .289633292582948342896,
  132. .295464212893421063199,
  133. .301261330578199704177,
  134. .307025035294827830512,
  135. .312755710004239517729,
  136. .318453731118097493890,
  137. .324119468654316733591,
  138. .329753286372579168528,
  139. .335355541920762334484,
  140. .340926586970454081892,
  141. .346466767346100823488,
  142. .351976423156884266063,
  143. .357455888922231679316,
  144. .362905493689140712376,
  145. .368325561158599157352,
  146. .373716409793814818840,
  147. .379078352934811846353,
  148. .384411698910298582632,
  149. .389716751140440464951,
  150. .394993808240542421117,
  151. .400243164127459749579,
  152. .405465108107819105498,
  153. .410659924985338875558,
  154. .415827895143593195825,
  155. .420969294644237379543,
  156. .426084395310681429691,
  157. .431173464818130014464,
  158. .436236766774527495726,
  159. .441274560805140936281,
  160. .446287102628048160113,
  161. .451274644139630254358,
  162. .456237433481874177232,
  163. .461175715122408291790,
  164. .466089729924533457960,
  165. .470979715219073113985,
  166. .475845904869856894947,
  167. .480688529345570714212,
  168. .485507815781602403149,
  169. .490303988045525329653,
  170. .495077266798034543171,
  171. .499827869556611403822,
  172. .504556010751912253908,
  173. .509261901790523552335,
  174. .513945751101346104405,
  175. .518607764208354637958,
  176. .523248143765158602036,
  177. .527867089620485785417,
  178. .532464798869114019908,
  179. .537041465897345915436,
  180. .541597282432121573947,
  181. .546132437597407260909,
  182. .550647117952394182793,
  183. .555141507540611200965,
  184. .559615787935399566777,
  185. .564070138285387656651,
  186. .568504735352689749561,
  187. .572919753562018740922,
  188. .577315365035246941260,
  189. .581691739635061821900,
  190. .586049045003164792433,
  191. .590387446602107957005,
  192. .594707107746216934174,
  193. .599008189645246602594,
  194. .603290851438941899687,
  195. .607555250224322662688,
  196. .611801541106615331955,
  197. .616029877215623855590,
  198. .620240409751204424537,
  199. .624433288012369303032,
  200. .628608659422752680256,
  201. .632766669570628437213,
  202. .636907462236194987781,
  203. .641031179420679109171,
  204. .645137961373620782978,
  205. .649227946625615004450,
  206. .653301272011958644725,
  207. .657358072709030238911,
  208. .661398482245203922502,
  209. .665422632544505177065,
  210. .669430653942981734871,
  211. .673422675212350441142,
  212. .677398823590920073911,
  213. .681359224807238206267,
  214. .685304003098281100392,
  215. .689233281238557538017,
  216. .693147180560117703862
  217. };
  218. static double logF_tail[N+1] = {
  219. 0.,
  220. -.00000000000000543229938420049,
  221. .00000000000000172745674997061,
  222. -.00000000000001323017818229233,
  223. -.00000000000001154527628289872,
  224. -.00000000000000466529469958300,
  225. .00000000000005148849572685810,
  226. -.00000000000002532168943117445,
  227. -.00000000000005213620639136504,
  228. -.00000000000001819506003016881,
  229. .00000000000006329065958724544,
  230. .00000000000008614512936087814,
  231. -.00000000000007355770219435028,
  232. .00000000000009638067658552277,
  233. .00000000000007598636597194141,
  234. .00000000000002579999128306990,
  235. -.00000000000004654729747598444,
  236. -.00000000000007556920687451336,
  237. .00000000000010195735223708472,
  238. -.00000000000017319034406422306,
  239. -.00000000000007718001336828098,
  240. .00000000000010980754099855238,
  241. -.00000000000002047235780046195,
  242. -.00000000000008372091099235912,
  243. .00000000000014088127937111135,
  244. .00000000000012869017157588257,
  245. .00000000000017788850778198106,
  246. .00000000000006440856150696891,
  247. .00000000000016132822667240822,
  248. -.00000000000007540916511956188,
  249. -.00000000000000036507188831790,
  250. .00000000000009120937249914984,
  251. .00000000000018567570959796010,
  252. -.00000000000003149265065191483,
  253. -.00000000000009309459495196889,
  254. .00000000000017914338601329117,
  255. -.00000000000001302979717330866,
  256. .00000000000023097385217586939,
  257. .00000000000023999540484211737,
  258. .00000000000015393776174455408,
  259. -.00000000000036870428315837678,
  260. .00000000000036920375082080089,
  261. -.00000000000009383417223663699,
  262. .00000000000009433398189512690,
  263. .00000000000041481318704258568,
  264. -.00000000000003792316480209314,
  265. .00000000000008403156304792424,
  266. -.00000000000034262934348285429,
  267. .00000000000043712191957429145,
  268. -.00000000000010475750058776541,
  269. -.00000000000011118671389559323,
  270. .00000000000037549577257259853,
  271. .00000000000013912841212197565,
  272. .00000000000010775743037572640,
  273. .00000000000029391859187648000,
  274. -.00000000000042790509060060774,
  275. .00000000000022774076114039555,
  276. .00000000000010849569622967912,
  277. -.00000000000023073801945705758,
  278. .00000000000015761203773969435,
  279. .00000000000003345710269544082,
  280. -.00000000000041525158063436123,
  281. .00000000000032655698896907146,
  282. -.00000000000044704265010452446,
  283. .00000000000034527647952039772,
  284. -.00000000000007048962392109746,
  285. .00000000000011776978751369214,
  286. -.00000000000010774341461609578,
  287. .00000000000021863343293215910,
  288. .00000000000024132639491333131,
  289. .00000000000039057462209830700,
  290. -.00000000000026570679203560751,
  291. .00000000000037135141919592021,
  292. -.00000000000017166921336082431,
  293. -.00000000000028658285157914353,
  294. -.00000000000023812542263446809,
  295. .00000000000006576659768580062,
  296. -.00000000000028210143846181267,
  297. .00000000000010701931762114254,
  298. .00000000000018119346366441110,
  299. .00000000000009840465278232627,
  300. -.00000000000033149150282752542,
  301. -.00000000000018302857356041668,
  302. -.00000000000016207400156744949,
  303. .00000000000048303314949553201,
  304. -.00000000000071560553172382115,
  305. .00000000000088821239518571855,
  306. -.00000000000030900580513238244,
  307. -.00000000000061076551972851496,
  308. .00000000000035659969663347830,
  309. .00000000000035782396591276383,
  310. -.00000000000046226087001544578,
  311. .00000000000062279762917225156,
  312. .00000000000072838947272065741,
  313. .00000000000026809646615211673,
  314. -.00000000000010960825046059278,
  315. .00000000000002311949383800537,
  316. -.00000000000058469058005299247,
  317. -.00000000000002103748251144494,
  318. -.00000000000023323182945587408,
  319. -.00000000000042333694288141916,
  320. -.00000000000043933937969737844,
  321. .00000000000041341647073835565,
  322. .00000000000006841763641591466,
  323. .00000000000047585534004430641,
  324. .00000000000083679678674757695,
  325. -.00000000000085763734646658640,
  326. .00000000000021913281229340092,
  327. -.00000000000062242842536431148,
  328. -.00000000000010983594325438430,
  329. .00000000000065310431377633651,
  330. -.00000000000047580199021710769,
  331. -.00000000000037854251265457040,
  332. .00000000000040939233218678664,
  333. .00000000000087424383914858291,
  334. .00000000000025218188456842882,
  335. -.00000000000003608131360422557,
  336. -.00000000000050518555924280902,
  337. .00000000000078699403323355317,
  338. -.00000000000067020876961949060,
  339. .00000000000016108575753932458,
  340. .00000000000058527188436251509,
  341. -.00000000000035246757297904791,
  342. -.00000000000018372084495629058,
  343. .00000000000088606689813494916,
  344. .00000000000066486268071468700,
  345. .00000000000063831615170646519,
  346. .00000000000025144230728376072,
  347. -.00000000000017239444525614834
  348. };
  349. #if 0
  350. double
  351. #ifdef _ANSI_SOURCE
  352. log(double x)
  353. #else
  354. log(x) double x;
  355. #endif
  356. {
  357. int m, j;
  358. double F, f, g, q, u, u2, v, zero = 0.0, one = 1.0;
  359. volatile double u1;
  360. /* Catch special cases */
  361. if (x <= 0)
  362. if (x == zero) /* log(0) = -Inf */
  363. return (-one/zero);
  364. else /* log(neg) = NaN */
  365. return (zero/zero);
  366. else if (!finite(x))
  367. return (x+x); /* x = NaN, Inf */
  368. /* Argument reduction: 1 <= g < 2; x/2^m = g; */
  369. /* y = F*(1 + f/F) for |f| <= 2^-8 */
  370. m = logb(x);
  371. g = ldexp(x, -m);
  372. if (m == -1022) {
  373. j = logb(g), m += j;
  374. g = ldexp(g, -j);
  375. }
  376. j = N*(g-1) + .5;
  377. F = (1.0/N) * j + 1; /* F*128 is an integer in [128, 512] */
  378. f = g - F;
  379. /* Approximate expansion for log(1+f/F) ~= u + q */
  380. g = 1/(2*F+f);
  381. u = 2*f*g;
  382. v = u*u;
  383. q = u*v*(A1 + v*(A2 + v*(A3 + v*A4)));
  384. /* case 1: u1 = u rounded to 2^-43 absolute. Since u < 2^-8,
  385. * u1 has at most 35 bits, and F*u1 is exact, as F has < 8 bits.
  386. * It also adds exactly to |m*log2_hi + log_F_head[j] | < 750
  387. */
  388. if (m | j)
  389. u1 = u + 513, u1 -= 513;
  390. /* case 2: |1-x| < 1/256. The m- and j- dependent terms are zero;
  391. * u1 = u to 24 bits.
  392. */
  393. else
  394. u1 = u, TRUNC(u1);
  395. u2 = (2.0*(f - F*u1) - u1*f) * g;
  396. /* u1 + u2 = 2f/(2F+f) to extra precision. */
  397. /* log(x) = log(2^m*F*(1+f/F)) = */
  398. /* (m*log2_hi+logF_head[j]+u1) + (m*log2_lo+logF_tail[j]+q); */
  399. /* (exact) + (tiny) */
  400. u1 += m*logF_head[N] + logF_head[j]; /* exact */
  401. u2 = (u2 + logF_tail[j]) + q; /* tiny */
  402. u2 += logF_tail[N]*m;
  403. return (u1 + u2);
  404. }
  405. #endif
  406. /*
  407. * Extra precision variant, returning struct {double a, b;};
  408. * log(x) = a+b to 63 bits, with a rounded to 26 bits.
  409. */
  410. struct Double
  411. #ifdef _ANSI_SOURCE
  412. __log__D(double x)
  413. #else
  414. __log__D(x) double x;
  415. #endif
  416. {
  417. int m, j;
  418. double F, f, g, q, u, v, u2;
  419. volatile double u1;
  420. struct Double r;
  421. /* Argument reduction: 1 <= g < 2; x/2^m = g; */
  422. /* y = F*(1 + f/F) for |f| <= 2^-8 */
  423. m = logb(x);
  424. g = ldexp(x, -m);
  425. if (m == -1022) {
  426. j = logb(g), m += j;
  427. g = ldexp(g, -j);
  428. }
  429. j = N*(g-1) + .5;
  430. F = (1.0/N) * j + 1;
  431. f = g - F;
  432. g = 1/(2*F+f);
  433. u = 2*f*g;
  434. v = u*u;
  435. q = u*v*(A1 + v*(A2 + v*(A3 + v*A4)));
  436. if (m | j)
  437. u1 = u + 513, u1 -= 513;
  438. else
  439. u1 = u, TRUNC(u1);
  440. u2 = (2.0*(f - F*u1) - u1*f) * g;
  441. u1 += m*logF_head[N] + logF_head[j];
  442. u2 += logF_tail[j]; u2 += q;
  443. u2 += logF_tail[N]*m;
  444. r.a = u1 + u2; /* Only difference is here */
  445. TRUNC(r.a);
  446. r.b = (u1 - r.a) + u2;
  447. return (r);
  448. }