johnson 2.0.0.pre1 → 2.0.0.pre2

Sign up to get free protection for your applications and to get access to all the features.
Files changed (311) hide show
  1. data/CHANGELOG.rdoc +12 -0
  2. data/Manifest.txt +4 -285
  3. data/Rakefile +13 -20
  4. data/ext/tracemonkey/global.cc +4 -1
  5. data/ext/tracemonkey/js.cc +30 -33
  6. data/ext/tracemonkey/runtime.cc +96 -6
  7. data/ext/tracemonkey/split_global.cc +0 -5
  8. data/ext/tracemonkey/tracemonkey.h +2 -2
  9. data/lib/johnson.rb +2 -2
  10. data/lib/johnson/runtime.rb +25 -15
  11. data/lib/johnson/tracemonkey/runtime.rb +6 -3
  12. data/vendor/tracemonkey/config/system-headers +1 -3
  13. data/vendor/tracemonkey/jscntxt.h +5 -2
  14. data/vendor/tracemonkey/jsdbgapi.cpp +9 -1
  15. data/vendor/tracemonkey/jsdbgapi.h +4 -0
  16. data/vendor/tracemonkey/tests/ecma/NativeObjects/browser.js +0 -0
  17. data/vendor/tracemonkey/tests/ecma/NativeObjects/jstests.list +0 -0
  18. data/vendor/tracemonkey/tests/ecma_3_1/Object/jstests.list +1 -1
  19. data/vendor/tracemonkey/tests/js1_3/misc/browser.js +0 -0
  20. data/vendor/tracemonkey/tests/js1_3/misc/jstests.list +0 -0
  21. data/vendor/tracemonkey/tests/js1_5/Regress/jstests.list +4 -4
  22. data/vendor/tracemonkey/tests/js1_5/Scope/jstests.list +1 -1
  23. data/vendor/tracemonkey/tests/js1_5/decompilation/jstests.list +2 -2
  24. data/vendor/tracemonkey/tests/js1_7/decompilation/jstests.list +1 -1
  25. data/vendor/tracemonkey/tests/shell.js +2 -1
  26. metadata +51 -309
  27. data/ext/spidermonkey/context.c +0 -116
  28. data/ext/spidermonkey/context.h +0 -19
  29. data/ext/spidermonkey/conversions.c +0 -361
  30. data/ext/spidermonkey/conversions.h +0 -31
  31. data/ext/spidermonkey/debugger.c +0 -234
  32. data/ext/spidermonkey/debugger.h +0 -10
  33. data/ext/spidermonkey/extconf.rb +0 -32
  34. data/ext/spidermonkey/extensions.c +0 -37
  35. data/ext/spidermonkey/extensions.h +0 -12
  36. data/ext/spidermonkey/global.c +0 -40
  37. data/ext/spidermonkey/global.h +0 -11
  38. data/ext/spidermonkey/idhash.c +0 -16
  39. data/ext/spidermonkey/idhash.h +0 -8
  40. data/ext/spidermonkey/immutable_node.c +0 -1153
  41. data/ext/spidermonkey/immutable_node.c.erb +0 -523
  42. data/ext/spidermonkey/immutable_node.h +0 -22
  43. data/ext/spidermonkey/jroot.h +0 -197
  44. data/ext/spidermonkey/js_land_proxy.c +0 -620
  45. data/ext/spidermonkey/js_land_proxy.h +0 -20
  46. data/ext/spidermonkey/ruby_land_proxy.c +0 -618
  47. data/ext/spidermonkey/ruby_land_proxy.h +0 -38
  48. data/ext/spidermonkey/runtime.c +0 -396
  49. data/ext/spidermonkey/runtime.h +0 -27
  50. data/ext/spidermonkey/spidermonkey.c +0 -22
  51. data/ext/spidermonkey/spidermonkey.h +0 -29
  52. data/lib/johnson/spidermonkey.rb +0 -12
  53. data/lib/johnson/spidermonkey/context.rb +0 -10
  54. data/lib/johnson/spidermonkey/debugger.rb +0 -67
  55. data/lib/johnson/spidermonkey/immutable_node.rb +0 -282
  56. data/lib/johnson/spidermonkey/js_land_proxy.rb +0 -64
  57. data/lib/johnson/spidermonkey/mutable_tree_visitor.rb +0 -242
  58. data/lib/johnson/spidermonkey/ruby_land_proxy.rb +0 -17
  59. data/lib/johnson/spidermonkey/runtime.rb +0 -74
  60. data/test/johnson/spidermonkey/context_test.rb +0 -21
  61. data/test/johnson/spidermonkey/immutable_node_test.rb +0 -34
  62. data/test/johnson/spidermonkey/js_land_proxy_test.rb +0 -273
  63. data/test/johnson/spidermonkey/ruby_land_proxy_test.rb +0 -274
  64. data/test/johnson/spidermonkey/runtime_test.rb +0 -41
  65. data/vendor/spidermonkey/.cvsignore +0 -9
  66. data/vendor/spidermonkey/Makefile.in +0 -449
  67. data/vendor/spidermonkey/Makefile.ref +0 -365
  68. data/vendor/spidermonkey/README.html +0 -820
  69. data/vendor/spidermonkey/SpiderMonkey.rsp +0 -12
  70. data/vendor/spidermonkey/Y.js +0 -19
  71. data/vendor/spidermonkey/build.mk +0 -43
  72. data/vendor/spidermonkey/config.mk +0 -192
  73. data/vendor/spidermonkey/config/AIX4.1.mk +0 -65
  74. data/vendor/spidermonkey/config/AIX4.2.mk +0 -64
  75. data/vendor/spidermonkey/config/AIX4.3.mk +0 -65
  76. data/vendor/spidermonkey/config/Darwin.mk +0 -83
  77. data/vendor/spidermonkey/config/Darwin1.3.mk +0 -81
  78. data/vendor/spidermonkey/config/Darwin1.4.mk +0 -41
  79. data/vendor/spidermonkey/config/Darwin5.2.mk +0 -81
  80. data/vendor/spidermonkey/config/Darwin5.3.mk +0 -81
  81. data/vendor/spidermonkey/config/HP-UXB.10.10.mk +0 -77
  82. data/vendor/spidermonkey/config/HP-UXB.10.20.mk +0 -77
  83. data/vendor/spidermonkey/config/HP-UXB.11.00.mk +0 -80
  84. data/vendor/spidermonkey/config/IRIX.mk +0 -87
  85. data/vendor/spidermonkey/config/IRIX5.3.mk +0 -44
  86. data/vendor/spidermonkey/config/IRIX6.1.mk +0 -44
  87. data/vendor/spidermonkey/config/IRIX6.2.mk +0 -44
  88. data/vendor/spidermonkey/config/IRIX6.3.mk +0 -44
  89. data/vendor/spidermonkey/config/IRIX6.5.mk +0 -44
  90. data/vendor/spidermonkey/config/Linux_All.mk +0 -103
  91. data/vendor/spidermonkey/config/Mac_OS10.0.mk +0 -82
  92. data/vendor/spidermonkey/config/OSF1V4.0.mk +0 -72
  93. data/vendor/spidermonkey/config/OSF1V5.0.mk +0 -69
  94. data/vendor/spidermonkey/config/SunOS4.1.4.mk +0 -101
  95. data/vendor/spidermonkey/config/SunOS5.10.mk +0 -50
  96. data/vendor/spidermonkey/config/SunOS5.3.mk +0 -91
  97. data/vendor/spidermonkey/config/SunOS5.4.mk +0 -92
  98. data/vendor/spidermonkey/config/SunOS5.5.1.mk +0 -44
  99. data/vendor/spidermonkey/config/SunOS5.5.mk +0 -87
  100. data/vendor/spidermonkey/config/SunOS5.6.mk +0 -89
  101. data/vendor/spidermonkey/config/SunOS5.7.mk +0 -44
  102. data/vendor/spidermonkey/config/SunOS5.8.mk +0 -44
  103. data/vendor/spidermonkey/config/SunOS5.9.mk +0 -44
  104. data/vendor/spidermonkey/config/WINNT4.0.mk +0 -117
  105. data/vendor/spidermonkey/config/WINNT5.0.mk +0 -117
  106. data/vendor/spidermonkey/config/WINNT5.1.mk +0 -117
  107. data/vendor/spidermonkey/config/WINNT5.2.mk +0 -117
  108. data/vendor/spidermonkey/config/WINNT6.0.mk +0 -117
  109. data/vendor/spidermonkey/config/dgux.mk +0 -64
  110. data/vendor/spidermonkey/editline/Makefile.ref +0 -144
  111. data/vendor/spidermonkey/editline/README +0 -83
  112. data/vendor/spidermonkey/editline/editline.3 +0 -175
  113. data/vendor/spidermonkey/editline/editline.c +0 -1369
  114. data/vendor/spidermonkey/editline/editline.h +0 -135
  115. data/vendor/spidermonkey/editline/sysunix.c +0 -182
  116. data/vendor/spidermonkey/editline/unix.h +0 -82
  117. data/vendor/spidermonkey/fdlibm/.cvsignore +0 -7
  118. data/vendor/spidermonkey/fdlibm/Makefile.in +0 -127
  119. data/vendor/spidermonkey/fdlibm/Makefile.ref +0 -192
  120. data/vendor/spidermonkey/fdlibm/e_acos.c +0 -147
  121. data/vendor/spidermonkey/fdlibm/e_acosh.c +0 -105
  122. data/vendor/spidermonkey/fdlibm/e_asin.c +0 -156
  123. data/vendor/spidermonkey/fdlibm/e_atan2.c +0 -165
  124. data/vendor/spidermonkey/fdlibm/e_atanh.c +0 -110
  125. data/vendor/spidermonkey/fdlibm/e_cosh.c +0 -133
  126. data/vendor/spidermonkey/fdlibm/e_exp.c +0 -202
  127. data/vendor/spidermonkey/fdlibm/e_fmod.c +0 -184
  128. data/vendor/spidermonkey/fdlibm/e_gamma.c +0 -71
  129. data/vendor/spidermonkey/fdlibm/e_gamma_r.c +0 -70
  130. data/vendor/spidermonkey/fdlibm/e_hypot.c +0 -173
  131. data/vendor/spidermonkey/fdlibm/e_j0.c +0 -524
  132. data/vendor/spidermonkey/fdlibm/e_j1.c +0 -523
  133. data/vendor/spidermonkey/fdlibm/e_jn.c +0 -315
  134. data/vendor/spidermonkey/fdlibm/e_lgamma.c +0 -71
  135. data/vendor/spidermonkey/fdlibm/e_lgamma_r.c +0 -347
  136. data/vendor/spidermonkey/fdlibm/e_log.c +0 -184
  137. data/vendor/spidermonkey/fdlibm/e_log10.c +0 -134
  138. data/vendor/spidermonkey/fdlibm/e_pow.c +0 -386
  139. data/vendor/spidermonkey/fdlibm/e_rem_pio2.c +0 -222
  140. data/vendor/spidermonkey/fdlibm/e_remainder.c +0 -120
  141. data/vendor/spidermonkey/fdlibm/e_scalb.c +0 -89
  142. data/vendor/spidermonkey/fdlibm/e_sinh.c +0 -122
  143. data/vendor/spidermonkey/fdlibm/e_sqrt.c +0 -497
  144. data/vendor/spidermonkey/fdlibm/fdlibm.h +0 -273
  145. data/vendor/spidermonkey/fdlibm/fdlibm.mak +0 -1453
  146. data/vendor/spidermonkey/fdlibm/fdlibm.mdp +0 -0
  147. data/vendor/spidermonkey/fdlibm/k_cos.c +0 -135
  148. data/vendor/spidermonkey/fdlibm/k_rem_pio2.c +0 -354
  149. data/vendor/spidermonkey/fdlibm/k_sin.c +0 -114
  150. data/vendor/spidermonkey/fdlibm/k_standard.c +0 -785
  151. data/vendor/spidermonkey/fdlibm/k_tan.c +0 -170
  152. data/vendor/spidermonkey/fdlibm/s_asinh.c +0 -101
  153. data/vendor/spidermonkey/fdlibm/s_atan.c +0 -175
  154. data/vendor/spidermonkey/fdlibm/s_cbrt.c +0 -133
  155. data/vendor/spidermonkey/fdlibm/s_ceil.c +0 -120
  156. data/vendor/spidermonkey/fdlibm/s_copysign.c +0 -72
  157. data/vendor/spidermonkey/fdlibm/s_cos.c +0 -118
  158. data/vendor/spidermonkey/fdlibm/s_erf.c +0 -356
  159. data/vendor/spidermonkey/fdlibm/s_expm1.c +0 -267
  160. data/vendor/spidermonkey/fdlibm/s_fabs.c +0 -70
  161. data/vendor/spidermonkey/fdlibm/s_finite.c +0 -71
  162. data/vendor/spidermonkey/fdlibm/s_floor.c +0 -121
  163. data/vendor/spidermonkey/fdlibm/s_frexp.c +0 -99
  164. data/vendor/spidermonkey/fdlibm/s_ilogb.c +0 -85
  165. data/vendor/spidermonkey/fdlibm/s_isnan.c +0 -74
  166. data/vendor/spidermonkey/fdlibm/s_ldexp.c +0 -66
  167. data/vendor/spidermonkey/fdlibm/s_lib_version.c +0 -73
  168. data/vendor/spidermonkey/fdlibm/s_log1p.c +0 -211
  169. data/vendor/spidermonkey/fdlibm/s_logb.c +0 -79
  170. data/vendor/spidermonkey/fdlibm/s_matherr.c +0 -64
  171. data/vendor/spidermonkey/fdlibm/s_modf.c +0 -132
  172. data/vendor/spidermonkey/fdlibm/s_nextafter.c +0 -124
  173. data/vendor/spidermonkey/fdlibm/s_rint.c +0 -131
  174. data/vendor/spidermonkey/fdlibm/s_scalbn.c +0 -107
  175. data/vendor/spidermonkey/fdlibm/s_signgam.c +0 -40
  176. data/vendor/spidermonkey/fdlibm/s_significand.c +0 -68
  177. data/vendor/spidermonkey/fdlibm/s_sin.c +0 -118
  178. data/vendor/spidermonkey/fdlibm/s_tan.c +0 -112
  179. data/vendor/spidermonkey/fdlibm/s_tanh.c +0 -122
  180. data/vendor/spidermonkey/fdlibm/w_acos.c +0 -78
  181. data/vendor/spidermonkey/fdlibm/w_acosh.c +0 -78
  182. data/vendor/spidermonkey/fdlibm/w_asin.c +0 -80
  183. data/vendor/spidermonkey/fdlibm/w_atan2.c +0 -79
  184. data/vendor/spidermonkey/fdlibm/w_atanh.c +0 -81
  185. data/vendor/spidermonkey/fdlibm/w_cosh.c +0 -77
  186. data/vendor/spidermonkey/fdlibm/w_exp.c +0 -88
  187. data/vendor/spidermonkey/fdlibm/w_fmod.c +0 -78
  188. data/vendor/spidermonkey/fdlibm/w_gamma.c +0 -85
  189. data/vendor/spidermonkey/fdlibm/w_gamma_r.c +0 -81
  190. data/vendor/spidermonkey/fdlibm/w_hypot.c +0 -78
  191. data/vendor/spidermonkey/fdlibm/w_j0.c +0 -105
  192. data/vendor/spidermonkey/fdlibm/w_j1.c +0 -106
  193. data/vendor/spidermonkey/fdlibm/w_jn.c +0 -128
  194. data/vendor/spidermonkey/fdlibm/w_lgamma.c +0 -85
  195. data/vendor/spidermonkey/fdlibm/w_lgamma_r.c +0 -81
  196. data/vendor/spidermonkey/fdlibm/w_log.c +0 -78
  197. data/vendor/spidermonkey/fdlibm/w_log10.c +0 -81
  198. data/vendor/spidermonkey/fdlibm/w_pow.c +0 -99
  199. data/vendor/spidermonkey/fdlibm/w_remainder.c +0 -77
  200. data/vendor/spidermonkey/fdlibm/w_scalb.c +0 -95
  201. data/vendor/spidermonkey/fdlibm/w_sinh.c +0 -77
  202. data/vendor/spidermonkey/fdlibm/w_sqrt.c +0 -77
  203. data/vendor/spidermonkey/javascript-trace.d +0 -73
  204. data/vendor/spidermonkey/js.c +0 -3951
  205. data/vendor/spidermonkey/js.mdp +0 -0
  206. data/vendor/spidermonkey/js.msg +0 -308
  207. data/vendor/spidermonkey/js.pkg +0 -2
  208. data/vendor/spidermonkey/js3240.rc +0 -79
  209. data/vendor/spidermonkey/jsOS240.def +0 -654
  210. data/vendor/spidermonkey/jsapi.c +0 -5836
  211. data/vendor/spidermonkey/jsapi.h +0 -2624
  212. data/vendor/spidermonkey/jsarena.c +0 -450
  213. data/vendor/spidermonkey/jsarena.h +0 -318
  214. data/vendor/spidermonkey/jsarray.c +0 -2996
  215. data/vendor/spidermonkey/jsarray.h +0 -127
  216. data/vendor/spidermonkey/jsatom.c +0 -1045
  217. data/vendor/spidermonkey/jsatom.h +0 -442
  218. data/vendor/spidermonkey/jsbit.h +0 -253
  219. data/vendor/spidermonkey/jsbool.c +0 -176
  220. data/vendor/spidermonkey/jsbool.h +0 -73
  221. data/vendor/spidermonkey/jsclist.h +0 -139
  222. data/vendor/spidermonkey/jscntxt.c +0 -1348
  223. data/vendor/spidermonkey/jscntxt.h +0 -1120
  224. data/vendor/spidermonkey/jscompat.h +0 -57
  225. data/vendor/spidermonkey/jsconfig.h +0 -248
  226. data/vendor/spidermonkey/jsconfig.mk +0 -181
  227. data/vendor/spidermonkey/jscpucfg.c +0 -396
  228. data/vendor/spidermonkey/jscpucfg.h +0 -212
  229. data/vendor/spidermonkey/jsdate.c +0 -2390
  230. data/vendor/spidermonkey/jsdate.h +0 -124
  231. data/vendor/spidermonkey/jsdbgapi.c +0 -1802
  232. data/vendor/spidermonkey/jsdbgapi.h +0 -464
  233. data/vendor/spidermonkey/jsdhash.c +0 -868
  234. data/vendor/spidermonkey/jsdhash.h +0 -592
  235. data/vendor/spidermonkey/jsdtoa.c +0 -3167
  236. data/vendor/spidermonkey/jsdtoa.h +0 -130
  237. data/vendor/spidermonkey/jsdtracef.c +0 -317
  238. data/vendor/spidermonkey/jsdtracef.h +0 -77
  239. data/vendor/spidermonkey/jsemit.c +0 -6909
  240. data/vendor/spidermonkey/jsemit.h +0 -741
  241. data/vendor/spidermonkey/jsexn.c +0 -1371
  242. data/vendor/spidermonkey/jsexn.h +0 -96
  243. data/vendor/spidermonkey/jsfile.c +0 -2736
  244. data/vendor/spidermonkey/jsfile.h +0 -56
  245. data/vendor/spidermonkey/jsfile.msg +0 -90
  246. data/vendor/spidermonkey/jsfun.c +0 -2634
  247. data/vendor/spidermonkey/jsfun.h +0 -254
  248. data/vendor/spidermonkey/jsgc.c +0 -3562
  249. data/vendor/spidermonkey/jsgc.h +0 -403
  250. data/vendor/spidermonkey/jshash.c +0 -476
  251. data/vendor/spidermonkey/jshash.h +0 -151
  252. data/vendor/spidermonkey/jsify.pl +0 -485
  253. data/vendor/spidermonkey/jsinterp.c +0 -7007
  254. data/vendor/spidermonkey/jsinterp.h +0 -525
  255. data/vendor/spidermonkey/jsinvoke.c +0 -43
  256. data/vendor/spidermonkey/jsiter.c +0 -1067
  257. data/vendor/spidermonkey/jsiter.h +0 -122
  258. data/vendor/spidermonkey/jskeyword.tbl +0 -124
  259. data/vendor/spidermonkey/jskwgen.c +0 -460
  260. data/vendor/spidermonkey/jslibmath.h +0 -266
  261. data/vendor/spidermonkey/jslock.c +0 -1309
  262. data/vendor/spidermonkey/jslock.h +0 -313
  263. data/vendor/spidermonkey/jslocko.asm +0 -60
  264. data/vendor/spidermonkey/jslog2.c +0 -94
  265. data/vendor/spidermonkey/jslong.c +0 -264
  266. data/vendor/spidermonkey/jslong.h +0 -412
  267. data/vendor/spidermonkey/jsmath.c +0 -567
  268. data/vendor/spidermonkey/jsmath.h +0 -57
  269. data/vendor/spidermonkey/jsnum.c +0 -1239
  270. data/vendor/spidermonkey/jsnum.h +0 -283
  271. data/vendor/spidermonkey/jsobj.c +0 -5282
  272. data/vendor/spidermonkey/jsobj.h +0 -709
  273. data/vendor/spidermonkey/jsopcode.c +0 -5245
  274. data/vendor/spidermonkey/jsopcode.h +0 -394
  275. data/vendor/spidermonkey/jsopcode.tbl +0 -523
  276. data/vendor/spidermonkey/jsotypes.h +0 -202
  277. data/vendor/spidermonkey/jsparse.c +0 -6704
  278. data/vendor/spidermonkey/jsparse.h +0 -511
  279. data/vendor/spidermonkey/jsprf.c +0 -1264
  280. data/vendor/spidermonkey/jsprf.h +0 -150
  281. data/vendor/spidermonkey/jsproto.tbl +0 -128
  282. data/vendor/spidermonkey/jsprvtd.h +0 -267
  283. data/vendor/spidermonkey/jspubtd.h +0 -744
  284. data/vendor/spidermonkey/jsregexp.c +0 -4364
  285. data/vendor/spidermonkey/jsregexp.h +0 -183
  286. data/vendor/spidermonkey/jsreops.tbl +0 -145
  287. data/vendor/spidermonkey/jsscan.c +0 -2012
  288. data/vendor/spidermonkey/jsscan.h +0 -387
  289. data/vendor/spidermonkey/jsscope.c +0 -1957
  290. data/vendor/spidermonkey/jsscope.h +0 -418
  291. data/vendor/spidermonkey/jsscript.c +0 -1832
  292. data/vendor/spidermonkey/jsscript.h +0 -287
  293. data/vendor/spidermonkey/jsshell.msg +0 -50
  294. data/vendor/spidermonkey/jsstddef.h +0 -83
  295. data/vendor/spidermonkey/jsstr.c +0 -5005
  296. data/vendor/spidermonkey/jsstr.h +0 -641
  297. data/vendor/spidermonkey/jstypes.h +0 -475
  298. data/vendor/spidermonkey/jsutil.c +0 -345
  299. data/vendor/spidermonkey/jsutil.h +0 -157
  300. data/vendor/spidermonkey/jsxdrapi.c +0 -800
  301. data/vendor/spidermonkey/jsxdrapi.h +0 -218
  302. data/vendor/spidermonkey/jsxml.c +0 -8476
  303. data/vendor/spidermonkey/jsxml.h +0 -349
  304. data/vendor/spidermonkey/lock_SunOS.s +0 -119
  305. data/vendor/spidermonkey/perfect.js +0 -39
  306. data/vendor/spidermonkey/plify_jsdhash.sed +0 -36
  307. data/vendor/spidermonkey/prmjtime.c +0 -846
  308. data/vendor/spidermonkey/prmjtime.h +0 -103
  309. data/vendor/spidermonkey/resource.h +0 -15
  310. data/vendor/spidermonkey/rules.mk +0 -197
  311. data/vendor/spidermonkey/win32.order +0 -384
@@ -1,135 +0,0 @@
1
- /* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
2
- *
3
- * ***** BEGIN LICENSE BLOCK *****
4
- * Version: MPL 1.1/GPL 2.0/LGPL 2.1
5
- *
6
- * The contents of this file are subject to the Mozilla Public License Version
7
- * 1.1 (the "License"); you may not use this file except in compliance with
8
- * the License. You may obtain a copy of the License at
9
- * http://www.mozilla.org/MPL/
10
- *
11
- * Software distributed under the License is distributed on an "AS IS" basis,
12
- * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
13
- * for the specific language governing rights and limitations under the
14
- * License.
15
- *
16
- * The Original Code is Mozilla Communicator client code, released
17
- * March 31, 1998.
18
- *
19
- * The Initial Developer of the Original Code is
20
- * Sun Microsystems, Inc.
21
- * Portions created by the Initial Developer are Copyright (C) 1998
22
- * the Initial Developer. All Rights Reserved.
23
- *
24
- * Contributor(s):
25
- *
26
- * Alternatively, the contents of this file may be used under the terms of
27
- * either of the GNU General Public License Version 2 or later (the "GPL"),
28
- * or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
29
- * in which case the provisions of the GPL or the LGPL are applicable instead
30
- * of those above. If you wish to allow use of your version of this file only
31
- * under the terms of either the GPL or the LGPL, and not to allow others to
32
- * use your version of this file under the terms of the MPL, indicate your
33
- * decision by deleting the provisions above and replace them with the notice
34
- * and other provisions required by the GPL or the LGPL. If you do not delete
35
- * the provisions above, a recipient may use your version of this file under
36
- * the terms of any one of the MPL, the GPL or the LGPL.
37
- *
38
- * ***** END LICENSE BLOCK ***** */
39
-
40
- /* @(#)k_cos.c 1.3 95/01/18 */
41
- /*
42
- * ====================================================
43
- * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
44
- *
45
- * Developed at SunSoft, a Sun Microsystems, Inc. business.
46
- * Permission to use, copy, modify, and distribute this
47
- * software is freely granted, provided that this notice
48
- * is preserved.
49
- * ====================================================
50
- */
51
-
52
- /*
53
- * __kernel_cos( x, y )
54
- * kernel cos function on [-pi/4, pi/4], pi/4 ~ 0.785398164
55
- * Input x is assumed to be bounded by ~pi/4 in magnitude.
56
- * Input y is the tail of x.
57
- *
58
- * Algorithm
59
- * 1. Since cos(-x) = cos(x), we need only to consider positive x.
60
- * 2. if x < 2^-27 (hx<0x3e400000 0), return 1 with inexact if x!=0.
61
- * 3. cos(x) is approximated by a polynomial of degree 14 on
62
- * [0,pi/4]
63
- * 4 14
64
- * cos(x) ~ 1 - x*x/2 + C1*x + ... + C6*x
65
- * where the remez error is
66
- *
67
- * | 2 4 6 8 10 12 14 | -58
68
- * |cos(x)-(1-.5*x +C1*x +C2*x +C3*x +C4*x +C5*x +C6*x )| <= 2
69
- * | |
70
- *
71
- * 4 6 8 10 12 14
72
- * 4. let r = C1*x +C2*x +C3*x +C4*x +C5*x +C6*x , then
73
- * cos(x) = 1 - x*x/2 + r
74
- * since cos(x+y) ~ cos(x) - sin(x)*y
75
- * ~ cos(x) - x*y,
76
- * a correction term is necessary in cos(x) and hence
77
- * cos(x+y) = 1 - (x*x/2 - (r - x*y))
78
- * For better accuracy when x > 0.3, let qx = |x|/4 with
79
- * the last 32 bits mask off, and if x > 0.78125, let qx = 0.28125.
80
- * Then
81
- * cos(x+y) = (1-qx) - ((x*x/2-qx) - (r-x*y)).
82
- * Note that 1-qx and (x*x/2-qx) is EXACT here, and the
83
- * magnitude of the latter is at least a quarter of x*x/2,
84
- * thus, reducing the rounding error in the subtraction.
85
- */
86
-
87
- #include "fdlibm.h"
88
-
89
- #ifdef __STDC__
90
- static const double
91
- #else
92
- static double
93
- #endif
94
- one = 1.00000000000000000000e+00, /* 0x3FF00000, 0x00000000 */
95
- C1 = 4.16666666666666019037e-02, /* 0x3FA55555, 0x5555554C */
96
- C2 = -1.38888888888741095749e-03, /* 0xBF56C16C, 0x16C15177 */
97
- C3 = 2.48015872894767294178e-05, /* 0x3EFA01A0, 0x19CB1590 */
98
- C4 = -2.75573143513906633035e-07, /* 0xBE927E4F, 0x809C52AD */
99
- C5 = 2.08757232129817482790e-09, /* 0x3E21EE9E, 0xBDB4B1C4 */
100
- C6 = -1.13596475577881948265e-11; /* 0xBDA8FAE9, 0xBE8838D4 */
101
-
102
- #ifdef __STDC__
103
- double __kernel_cos(double x, double y)
104
- #else
105
- double __kernel_cos(x, y)
106
- double x,y;
107
- #endif
108
- {
109
- fd_twoints u;
110
- double qx = 0;
111
- double a,hz,z,r;
112
- int ix;
113
- u.d = x;
114
- ix = __HI(u)&0x7fffffff; /* ix = |x|'s high word*/
115
- if(ix<0x3e400000) { /* if x < 2**27 */
116
- if(((int)x)==0) return one; /* generate inexact */
117
- }
118
- z = x*x;
119
- r = z*(C1+z*(C2+z*(C3+z*(C4+z*(C5+z*C6)))));
120
- if(ix < 0x3FD33333) /* if |x| < 0.3 */
121
- return one - (0.5*z - (z*r - x*y));
122
- else {
123
- if(ix > 0x3fe90000) { /* x > 0.78125 */
124
- qx = 0.28125;
125
- } else {
126
- u.d = qx;
127
- __HI(u) = ix-0x00200000; /* x/4 */
128
- __LO(u) = 0;
129
- qx = u.d;
130
- }
131
- hz = 0.5*z-qx;
132
- a = one-qx;
133
- return a - (hz - (z*r-x*y));
134
- }
135
- }
@@ -1,354 +0,0 @@
1
- /* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
2
- *
3
- * ***** BEGIN LICENSE BLOCK *****
4
- * Version: MPL 1.1/GPL 2.0/LGPL 2.1
5
- *
6
- * The contents of this file are subject to the Mozilla Public License Version
7
- * 1.1 (the "License"); you may not use this file except in compliance with
8
- * the License. You may obtain a copy of the License at
9
- * http://www.mozilla.org/MPL/
10
- *
11
- * Software distributed under the License is distributed on an "AS IS" basis,
12
- * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
13
- * for the specific language governing rights and limitations under the
14
- * License.
15
- *
16
- * The Original Code is Mozilla Communicator client code, released
17
- * March 31, 1998.
18
- *
19
- * The Initial Developer of the Original Code is
20
- * Sun Microsystems, Inc.
21
- * Portions created by the Initial Developer are Copyright (C) 1998
22
- * the Initial Developer. All Rights Reserved.
23
- *
24
- * Contributor(s):
25
- *
26
- * Alternatively, the contents of this file may be used under the terms of
27
- * either of the GNU General Public License Version 2 or later (the "GPL"),
28
- * or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
29
- * in which case the provisions of the GPL or the LGPL are applicable instead
30
- * of those above. If you wish to allow use of your version of this file only
31
- * under the terms of either the GPL or the LGPL, and not to allow others to
32
- * use your version of this file under the terms of the MPL, indicate your
33
- * decision by deleting the provisions above and replace them with the notice
34
- * and other provisions required by the GPL or the LGPL. If you do not delete
35
- * the provisions above, a recipient may use your version of this file under
36
- * the terms of any one of the MPL, the GPL or the LGPL.
37
- *
38
- * ***** END LICENSE BLOCK ***** */
39
-
40
- /* @(#)k_rem_pio2.c 1.3 95/01/18 */
41
- /*
42
- * ====================================================
43
- * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
44
- *
45
- * Developed at SunSoft, a Sun Microsystems, Inc. business.
46
- * Permission to use, copy, modify, and distribute this
47
- * software is freely granted, provided that this notice
48
- * is preserved.
49
- * ====================================================
50
- */
51
-
52
- /*
53
- * __kernel_rem_pio2(x,y,e0,nx,prec,ipio2)
54
- * double x[],y[]; int e0,nx,prec; int ipio2[];
55
- *
56
- * __kernel_rem_pio2 return the last three digits of N with
57
- * y = x - N*pi/2
58
- * so that |y| < pi/2.
59
- *
60
- * The method is to compute the integer (mod 8) and fraction parts of
61
- * (2/pi)*x without doing the full multiplication. In general we
62
- * skip the part of the product that are known to be a huge integer (
63
- * more accurately, = 0 mod 8 ). Thus the number of operations are
64
- * independent of the exponent of the input.
65
- *
66
- * (2/pi) is represented by an array of 24-bit integers in ipio2[].
67
- *
68
- * Input parameters:
69
- * x[] The input value (must be positive) is broken into nx
70
- * pieces of 24-bit integers in double precision format.
71
- * x[i] will be the i-th 24 bit of x. The scaled exponent
72
- * of x[0] is given in input parameter e0 (i.e., x[0]*2^e0
73
- * match x's up to 24 bits.
74
- *
75
- * Example of breaking a double positive z into x[0]+x[1]+x[2]:
76
- * e0 = ilogb(z)-23
77
- * z = scalbn(z,-e0)
78
- * for i = 0,1,2
79
- * x[i] = floor(z)
80
- * z = (z-x[i])*2**24
81
- *
82
- *
83
- * y[] ouput result in an array of double precision numbers.
84
- * The dimension of y[] is:
85
- * 24-bit precision 1
86
- * 53-bit precision 2
87
- * 64-bit precision 2
88
- * 113-bit precision 3
89
- * The actual value is the sum of them. Thus for 113-bit
90
- * precison, one may have to do something like:
91
- *
92
- * long double t,w,r_head, r_tail;
93
- * t = (long double)y[2] + (long double)y[1];
94
- * w = (long double)y[0];
95
- * r_head = t+w;
96
- * r_tail = w - (r_head - t);
97
- *
98
- * e0 The exponent of x[0]
99
- *
100
- * nx dimension of x[]
101
- *
102
- * prec an integer indicating the precision:
103
- * 0 24 bits (single)
104
- * 1 53 bits (double)
105
- * 2 64 bits (extended)
106
- * 3 113 bits (quad)
107
- *
108
- * ipio2[]
109
- * integer array, contains the (24*i)-th to (24*i+23)-th
110
- * bit of 2/pi after binary point. The corresponding
111
- * floating value is
112
- *
113
- * ipio2[i] * 2^(-24(i+1)).
114
- *
115
- * External function:
116
- * double scalbn(), floor();
117
- *
118
- *
119
- * Here is the description of some local variables:
120
- *
121
- * jk jk+1 is the initial number of terms of ipio2[] needed
122
- * in the computation. The recommended value is 2,3,4,
123
- * 6 for single, double, extended,and quad.
124
- *
125
- * jz local integer variable indicating the number of
126
- * terms of ipio2[] used.
127
- *
128
- * jx nx - 1
129
- *
130
- * jv index for pointing to the suitable ipio2[] for the
131
- * computation. In general, we want
132
- * ( 2^e0*x[0] * ipio2[jv-1]*2^(-24jv) )/8
133
- * is an integer. Thus
134
- * e0-3-24*jv >= 0 or (e0-3)/24 >= jv
135
- * Hence jv = max(0,(e0-3)/24).
136
- *
137
- * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
138
- *
139
- * q[] double array with integral value, representing the
140
- * 24-bits chunk of the product of x and 2/pi.
141
- *
142
- * q0 the corresponding exponent of q[0]. Note that the
143
- * exponent for q[i] would be q0-24*i.
144
- *
145
- * PIo2[] double precision array, obtained by cutting pi/2
146
- * into 24 bits chunks.
147
- *
148
- * f[] ipio2[] in floating point
149
- *
150
- * iq[] integer array by breaking up q[] in 24-bits chunk.
151
- *
152
- * fq[] final product of x*(2/pi) in fq[0],..,fq[jk]
153
- *
154
- * ih integer. If >0 it indicates q[] is >= 0.5, hence
155
- * it also indicates the *sign* of the result.
156
- *
157
- */
158
-
159
-
160
- /*
161
- * Constants:
162
- * The hexadecimal values are the intended ones for the following
163
- * constants. The decimal values may be used, provided that the
164
- * compiler will convert from decimal to binary accurately enough
165
- * to produce the hexadecimal values shown.
166
- */
167
-
168
- #include "fdlibm.h"
169
-
170
- #ifdef __STDC__
171
- static const int init_jk[] = {2,3,4,6}; /* initial value for jk */
172
- #else
173
- static int init_jk[] = {2,3,4,6};
174
- #endif
175
-
176
- #ifdef __STDC__
177
- static const double PIo2[] = {
178
- #else
179
- static double PIo2[] = {
180
- #endif
181
- 1.57079625129699707031e+00, /* 0x3FF921FB, 0x40000000 */
182
- 7.54978941586159635335e-08, /* 0x3E74442D, 0x00000000 */
183
- 5.39030252995776476554e-15, /* 0x3CF84698, 0x80000000 */
184
- 3.28200341580791294123e-22, /* 0x3B78CC51, 0x60000000 */
185
- 1.27065575308067607349e-29, /* 0x39F01B83, 0x80000000 */
186
- 1.22933308981111328932e-36, /* 0x387A2520, 0x40000000 */
187
- 2.73370053816464559624e-44, /* 0x36E38222, 0x80000000 */
188
- 2.16741683877804819444e-51, /* 0x3569F31D, 0x00000000 */
189
- };
190
-
191
- #ifdef __STDC__
192
- static const double
193
- #else
194
- static double
195
- #endif
196
- zero = 0.0,
197
- one = 1.0,
198
- two24 = 1.67772160000000000000e+07, /* 0x41700000, 0x00000000 */
199
- twon24 = 5.96046447753906250000e-08; /* 0x3E700000, 0x00000000 */
200
-
201
- #ifdef __STDC__
202
- int __kernel_rem_pio2(double *x, double *y, int e0, int nx, int prec, const int *ipio2)
203
- #else
204
- int __kernel_rem_pio2(x,y,e0,nx,prec,ipio2)
205
- double x[], y[]; int e0,nx,prec; int ipio2[];
206
- #endif
207
- {
208
- int jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih;
209
- double z,fw,f[20],fq[20],q[20];
210
-
211
- /* initialize jk*/
212
- jk = init_jk[prec];
213
- jp = jk;
214
-
215
- /* determine jx,jv,q0, note that 3>q0 */
216
- jx = nx-1;
217
- jv = (e0-3)/24; if(jv<0) jv=0;
218
- q0 = e0-24*(jv+1);
219
-
220
- /* set up f[0] to f[jx+jk] where f[jx+jk] = ipio2[jv+jk] */
221
- j = jv-jx; m = jx+jk;
222
- for(i=0;i<=m;i++,j++) f[i] = (j<0)? zero : (double) ipio2[j];
223
-
224
- /* compute q[0],q[1],...q[jk] */
225
- for (i=0;i<=jk;i++) {
226
- for(j=0,fw=0.0;j<=jx;j++) fw += x[j]*f[jx+i-j]; q[i] = fw;
227
- }
228
-
229
- jz = jk;
230
- recompute:
231
- /* distill q[] into iq[] reversingly */
232
- for(i=0,j=jz,z=q[jz];j>0;i++,j--) {
233
- fw = (double)((int)(twon24* z));
234
- iq[i] = (int)(z-two24*fw);
235
- z = q[j-1]+fw;
236
- }
237
-
238
- /* compute n */
239
- z = fd_scalbn(z,q0); /* actual value of z */
240
- z -= 8.0*fd_floor(z*0.125); /* trim off integer >= 8 */
241
- n = (int) z;
242
- z -= (double)n;
243
- ih = 0;
244
- if(q0>0) { /* need iq[jz-1] to determine n */
245
- i = (iq[jz-1]>>(24-q0)); n += i;
246
- iq[jz-1] -= i<<(24-q0);
247
- ih = iq[jz-1]>>(23-q0);
248
- }
249
- else if(q0==0) ih = iq[jz-1]>>23;
250
- else if(z>=0.5) ih=2;
251
-
252
- if(ih>0) { /* q > 0.5 */
253
- n += 1; carry = 0;
254
- for(i=0;i<jz ;i++) { /* compute 1-q */
255
- j = iq[i];
256
- if(carry==0) {
257
- if(j!=0) {
258
- carry = 1; iq[i] = 0x1000000- j;
259
- }
260
- } else iq[i] = 0xffffff - j;
261
- }
262
- if(q0>0) { /* rare case: chance is 1 in 12 */
263
- switch(q0) {
264
- case 1:
265
- iq[jz-1] &= 0x7fffff; break;
266
- case 2:
267
- iq[jz-1] &= 0x3fffff; break;
268
- }
269
- }
270
- if(ih==2) {
271
- z = one - z;
272
- if(carry!=0) z -= fd_scalbn(one,q0);
273
- }
274
- }
275
-
276
- /* check if recomputation is needed */
277
- if(z==zero) {
278
- j = 0;
279
- for (i=jz-1;i>=jk;i--) j |= iq[i];
280
- if(j==0) { /* need recomputation */
281
- for(k=1;iq[jk-k]==0;k++); /* k = no. of terms needed */
282
-
283
- for(i=jz+1;i<=jz+k;i++) { /* add q[jz+1] to q[jz+k] */
284
- f[jx+i] = (double) ipio2[jv+i];
285
- for(j=0,fw=0.0;j<=jx;j++) fw += x[j]*f[jx+i-j];
286
- q[i] = fw;
287
- }
288
- jz += k;
289
- goto recompute;
290
- }
291
- }
292
-
293
- /* chop off zero terms */
294
- if(z==0.0) {
295
- jz -= 1; q0 -= 24;
296
- while(iq[jz]==0) { jz--; q0-=24;}
297
- } else { /* break z into 24-bit if necessary */
298
- z = fd_scalbn(z,-q0);
299
- if(z>=two24) {
300
- fw = (double)((int)(twon24*z));
301
- iq[jz] = (int)(z-two24*fw);
302
- jz += 1; q0 += 24;
303
- iq[jz] = (int) fw;
304
- } else iq[jz] = (int) z ;
305
- }
306
-
307
- /* convert integer "bit" chunk to floating-point value */
308
- fw = fd_scalbn(one,q0);
309
- for(i=jz;i>=0;i--) {
310
- q[i] = fw*(double)iq[i]; fw*=twon24;
311
- }
312
-
313
- /* compute PIo2[0,...,jp]*q[jz,...,0] */
314
- for(i=jz;i>=0;i--) {
315
- for(fw=0.0,k=0;k<=jp&&k<=jz-i;k++) fw += PIo2[k]*q[i+k];
316
- fq[jz-i] = fw;
317
- }
318
-
319
- /* compress fq[] into y[] */
320
- switch(prec) {
321
- case 0:
322
- fw = 0.0;
323
- for (i=jz;i>=0;i--) fw += fq[i];
324
- y[0] = (ih==0)? fw: -fw;
325
- break;
326
- case 1:
327
- case 2:
328
- fw = 0.0;
329
- for (i=jz;i>=0;i--) fw += fq[i];
330
- y[0] = (ih==0)? fw: -fw;
331
- fw = fq[0]-fw;
332
- for (i=1;i<=jz;i++) fw += fq[i];
333
- y[1] = (ih==0)? fw: -fw;
334
- break;
335
- case 3: /* painful */
336
- for (i=jz;i>0;i--) {
337
- fw = fq[i-1]+fq[i];
338
- fq[i] += fq[i-1]-fw;
339
- fq[i-1] = fw;
340
- }
341
- for (i=jz;i>1;i--) {
342
- fw = fq[i-1]+fq[i];
343
- fq[i] += fq[i-1]-fw;
344
- fq[i-1] = fw;
345
- }
346
- for (fw=0.0,i=jz;i>=2;i--) fw += fq[i];
347
- if(ih==0) {
348
- y[0] = fq[0]; y[1] = fq[1]; y[2] = fw;
349
- } else {
350
- y[0] = -fq[0]; y[1] = -fq[1]; y[2] = -fw;
351
- }
352
- }
353
- return n&7;
354
- }