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.
- data/CHANGELOG.rdoc +12 -0
- data/Manifest.txt +4 -285
- data/Rakefile +13 -20
- data/ext/tracemonkey/global.cc +4 -1
- data/ext/tracemonkey/js.cc +30 -33
- data/ext/tracemonkey/runtime.cc +96 -6
- data/ext/tracemonkey/split_global.cc +0 -5
- data/ext/tracemonkey/tracemonkey.h +2 -2
- data/lib/johnson.rb +2 -2
- data/lib/johnson/runtime.rb +25 -15
- data/lib/johnson/tracemonkey/runtime.rb +6 -3
- data/vendor/tracemonkey/config/system-headers +1 -3
- data/vendor/tracemonkey/jscntxt.h +5 -2
- data/vendor/tracemonkey/jsdbgapi.cpp +9 -1
- data/vendor/tracemonkey/jsdbgapi.h +4 -0
- data/vendor/tracemonkey/tests/ecma/NativeObjects/browser.js +0 -0
- data/vendor/tracemonkey/tests/ecma/NativeObjects/jstests.list +0 -0
- data/vendor/tracemonkey/tests/ecma_3_1/Object/jstests.list +1 -1
- data/vendor/tracemonkey/tests/js1_3/misc/browser.js +0 -0
- data/vendor/tracemonkey/tests/js1_3/misc/jstests.list +0 -0
- data/vendor/tracemonkey/tests/js1_5/Regress/jstests.list +4 -4
- data/vendor/tracemonkey/tests/js1_5/Scope/jstests.list +1 -1
- data/vendor/tracemonkey/tests/js1_5/decompilation/jstests.list +2 -2
- data/vendor/tracemonkey/tests/js1_7/decompilation/jstests.list +1 -1
- data/vendor/tracemonkey/tests/shell.js +2 -1
- metadata +51 -309
- data/ext/spidermonkey/context.c +0 -116
- data/ext/spidermonkey/context.h +0 -19
- data/ext/spidermonkey/conversions.c +0 -361
- data/ext/spidermonkey/conversions.h +0 -31
- data/ext/spidermonkey/debugger.c +0 -234
- data/ext/spidermonkey/debugger.h +0 -10
- data/ext/spidermonkey/extconf.rb +0 -32
- data/ext/spidermonkey/extensions.c +0 -37
- data/ext/spidermonkey/extensions.h +0 -12
- data/ext/spidermonkey/global.c +0 -40
- data/ext/spidermonkey/global.h +0 -11
- data/ext/spidermonkey/idhash.c +0 -16
- data/ext/spidermonkey/idhash.h +0 -8
- data/ext/spidermonkey/immutable_node.c +0 -1153
- data/ext/spidermonkey/immutable_node.c.erb +0 -523
- data/ext/spidermonkey/immutable_node.h +0 -22
- data/ext/spidermonkey/jroot.h +0 -197
- data/ext/spidermonkey/js_land_proxy.c +0 -620
- data/ext/spidermonkey/js_land_proxy.h +0 -20
- data/ext/spidermonkey/ruby_land_proxy.c +0 -618
- data/ext/spidermonkey/ruby_land_proxy.h +0 -38
- data/ext/spidermonkey/runtime.c +0 -396
- data/ext/spidermonkey/runtime.h +0 -27
- data/ext/spidermonkey/spidermonkey.c +0 -22
- data/ext/spidermonkey/spidermonkey.h +0 -29
- data/lib/johnson/spidermonkey.rb +0 -12
- data/lib/johnson/spidermonkey/context.rb +0 -10
- data/lib/johnson/spidermonkey/debugger.rb +0 -67
- data/lib/johnson/spidermonkey/immutable_node.rb +0 -282
- data/lib/johnson/spidermonkey/js_land_proxy.rb +0 -64
- data/lib/johnson/spidermonkey/mutable_tree_visitor.rb +0 -242
- data/lib/johnson/spidermonkey/ruby_land_proxy.rb +0 -17
- data/lib/johnson/spidermonkey/runtime.rb +0 -74
- data/test/johnson/spidermonkey/context_test.rb +0 -21
- data/test/johnson/spidermonkey/immutable_node_test.rb +0 -34
- data/test/johnson/spidermonkey/js_land_proxy_test.rb +0 -273
- data/test/johnson/spidermonkey/ruby_land_proxy_test.rb +0 -274
- data/test/johnson/spidermonkey/runtime_test.rb +0 -41
- data/vendor/spidermonkey/.cvsignore +0 -9
- data/vendor/spidermonkey/Makefile.in +0 -449
- data/vendor/spidermonkey/Makefile.ref +0 -365
- data/vendor/spidermonkey/README.html +0 -820
- data/vendor/spidermonkey/SpiderMonkey.rsp +0 -12
- data/vendor/spidermonkey/Y.js +0 -19
- data/vendor/spidermonkey/build.mk +0 -43
- data/vendor/spidermonkey/config.mk +0 -192
- data/vendor/spidermonkey/config/AIX4.1.mk +0 -65
- data/vendor/spidermonkey/config/AIX4.2.mk +0 -64
- data/vendor/spidermonkey/config/AIX4.3.mk +0 -65
- data/vendor/spidermonkey/config/Darwin.mk +0 -83
- data/vendor/spidermonkey/config/Darwin1.3.mk +0 -81
- data/vendor/spidermonkey/config/Darwin1.4.mk +0 -41
- data/vendor/spidermonkey/config/Darwin5.2.mk +0 -81
- data/vendor/spidermonkey/config/Darwin5.3.mk +0 -81
- data/vendor/spidermonkey/config/HP-UXB.10.10.mk +0 -77
- data/vendor/spidermonkey/config/HP-UXB.10.20.mk +0 -77
- data/vendor/spidermonkey/config/HP-UXB.11.00.mk +0 -80
- data/vendor/spidermonkey/config/IRIX.mk +0 -87
- data/vendor/spidermonkey/config/IRIX5.3.mk +0 -44
- data/vendor/spidermonkey/config/IRIX6.1.mk +0 -44
- data/vendor/spidermonkey/config/IRIX6.2.mk +0 -44
- data/vendor/spidermonkey/config/IRIX6.3.mk +0 -44
- data/vendor/spidermonkey/config/IRIX6.5.mk +0 -44
- data/vendor/spidermonkey/config/Linux_All.mk +0 -103
- data/vendor/spidermonkey/config/Mac_OS10.0.mk +0 -82
- data/vendor/spidermonkey/config/OSF1V4.0.mk +0 -72
- data/vendor/spidermonkey/config/OSF1V5.0.mk +0 -69
- data/vendor/spidermonkey/config/SunOS4.1.4.mk +0 -101
- data/vendor/spidermonkey/config/SunOS5.10.mk +0 -50
- data/vendor/spidermonkey/config/SunOS5.3.mk +0 -91
- data/vendor/spidermonkey/config/SunOS5.4.mk +0 -92
- data/vendor/spidermonkey/config/SunOS5.5.1.mk +0 -44
- data/vendor/spidermonkey/config/SunOS5.5.mk +0 -87
- data/vendor/spidermonkey/config/SunOS5.6.mk +0 -89
- data/vendor/spidermonkey/config/SunOS5.7.mk +0 -44
- data/vendor/spidermonkey/config/SunOS5.8.mk +0 -44
- data/vendor/spidermonkey/config/SunOS5.9.mk +0 -44
- data/vendor/spidermonkey/config/WINNT4.0.mk +0 -117
- data/vendor/spidermonkey/config/WINNT5.0.mk +0 -117
- data/vendor/spidermonkey/config/WINNT5.1.mk +0 -117
- data/vendor/spidermonkey/config/WINNT5.2.mk +0 -117
- data/vendor/spidermonkey/config/WINNT6.0.mk +0 -117
- data/vendor/spidermonkey/config/dgux.mk +0 -64
- data/vendor/spidermonkey/editline/Makefile.ref +0 -144
- data/vendor/spidermonkey/editline/README +0 -83
- data/vendor/spidermonkey/editline/editline.3 +0 -175
- data/vendor/spidermonkey/editline/editline.c +0 -1369
- data/vendor/spidermonkey/editline/editline.h +0 -135
- data/vendor/spidermonkey/editline/sysunix.c +0 -182
- data/vendor/spidermonkey/editline/unix.h +0 -82
- data/vendor/spidermonkey/fdlibm/.cvsignore +0 -7
- data/vendor/spidermonkey/fdlibm/Makefile.in +0 -127
- data/vendor/spidermonkey/fdlibm/Makefile.ref +0 -192
- data/vendor/spidermonkey/fdlibm/e_acos.c +0 -147
- data/vendor/spidermonkey/fdlibm/e_acosh.c +0 -105
- data/vendor/spidermonkey/fdlibm/e_asin.c +0 -156
- data/vendor/spidermonkey/fdlibm/e_atan2.c +0 -165
- data/vendor/spidermonkey/fdlibm/e_atanh.c +0 -110
- data/vendor/spidermonkey/fdlibm/e_cosh.c +0 -133
- data/vendor/spidermonkey/fdlibm/e_exp.c +0 -202
- data/vendor/spidermonkey/fdlibm/e_fmod.c +0 -184
- data/vendor/spidermonkey/fdlibm/e_gamma.c +0 -71
- data/vendor/spidermonkey/fdlibm/e_gamma_r.c +0 -70
- data/vendor/spidermonkey/fdlibm/e_hypot.c +0 -173
- data/vendor/spidermonkey/fdlibm/e_j0.c +0 -524
- data/vendor/spidermonkey/fdlibm/e_j1.c +0 -523
- data/vendor/spidermonkey/fdlibm/e_jn.c +0 -315
- data/vendor/spidermonkey/fdlibm/e_lgamma.c +0 -71
- data/vendor/spidermonkey/fdlibm/e_lgamma_r.c +0 -347
- data/vendor/spidermonkey/fdlibm/e_log.c +0 -184
- data/vendor/spidermonkey/fdlibm/e_log10.c +0 -134
- data/vendor/spidermonkey/fdlibm/e_pow.c +0 -386
- data/vendor/spidermonkey/fdlibm/e_rem_pio2.c +0 -222
- data/vendor/spidermonkey/fdlibm/e_remainder.c +0 -120
- data/vendor/spidermonkey/fdlibm/e_scalb.c +0 -89
- data/vendor/spidermonkey/fdlibm/e_sinh.c +0 -122
- data/vendor/spidermonkey/fdlibm/e_sqrt.c +0 -497
- data/vendor/spidermonkey/fdlibm/fdlibm.h +0 -273
- data/vendor/spidermonkey/fdlibm/fdlibm.mak +0 -1453
- data/vendor/spidermonkey/fdlibm/fdlibm.mdp +0 -0
- data/vendor/spidermonkey/fdlibm/k_cos.c +0 -135
- data/vendor/spidermonkey/fdlibm/k_rem_pio2.c +0 -354
- data/vendor/spidermonkey/fdlibm/k_sin.c +0 -114
- data/vendor/spidermonkey/fdlibm/k_standard.c +0 -785
- data/vendor/spidermonkey/fdlibm/k_tan.c +0 -170
- data/vendor/spidermonkey/fdlibm/s_asinh.c +0 -101
- data/vendor/spidermonkey/fdlibm/s_atan.c +0 -175
- data/vendor/spidermonkey/fdlibm/s_cbrt.c +0 -133
- data/vendor/spidermonkey/fdlibm/s_ceil.c +0 -120
- data/vendor/spidermonkey/fdlibm/s_copysign.c +0 -72
- data/vendor/spidermonkey/fdlibm/s_cos.c +0 -118
- data/vendor/spidermonkey/fdlibm/s_erf.c +0 -356
- data/vendor/spidermonkey/fdlibm/s_expm1.c +0 -267
- data/vendor/spidermonkey/fdlibm/s_fabs.c +0 -70
- data/vendor/spidermonkey/fdlibm/s_finite.c +0 -71
- data/vendor/spidermonkey/fdlibm/s_floor.c +0 -121
- data/vendor/spidermonkey/fdlibm/s_frexp.c +0 -99
- data/vendor/spidermonkey/fdlibm/s_ilogb.c +0 -85
- data/vendor/spidermonkey/fdlibm/s_isnan.c +0 -74
- data/vendor/spidermonkey/fdlibm/s_ldexp.c +0 -66
- data/vendor/spidermonkey/fdlibm/s_lib_version.c +0 -73
- data/vendor/spidermonkey/fdlibm/s_log1p.c +0 -211
- data/vendor/spidermonkey/fdlibm/s_logb.c +0 -79
- data/vendor/spidermonkey/fdlibm/s_matherr.c +0 -64
- data/vendor/spidermonkey/fdlibm/s_modf.c +0 -132
- data/vendor/spidermonkey/fdlibm/s_nextafter.c +0 -124
- data/vendor/spidermonkey/fdlibm/s_rint.c +0 -131
- data/vendor/spidermonkey/fdlibm/s_scalbn.c +0 -107
- data/vendor/spidermonkey/fdlibm/s_signgam.c +0 -40
- data/vendor/spidermonkey/fdlibm/s_significand.c +0 -68
- data/vendor/spidermonkey/fdlibm/s_sin.c +0 -118
- data/vendor/spidermonkey/fdlibm/s_tan.c +0 -112
- data/vendor/spidermonkey/fdlibm/s_tanh.c +0 -122
- data/vendor/spidermonkey/fdlibm/w_acos.c +0 -78
- data/vendor/spidermonkey/fdlibm/w_acosh.c +0 -78
- data/vendor/spidermonkey/fdlibm/w_asin.c +0 -80
- data/vendor/spidermonkey/fdlibm/w_atan2.c +0 -79
- data/vendor/spidermonkey/fdlibm/w_atanh.c +0 -81
- data/vendor/spidermonkey/fdlibm/w_cosh.c +0 -77
- data/vendor/spidermonkey/fdlibm/w_exp.c +0 -88
- data/vendor/spidermonkey/fdlibm/w_fmod.c +0 -78
- data/vendor/spidermonkey/fdlibm/w_gamma.c +0 -85
- data/vendor/spidermonkey/fdlibm/w_gamma_r.c +0 -81
- data/vendor/spidermonkey/fdlibm/w_hypot.c +0 -78
- data/vendor/spidermonkey/fdlibm/w_j0.c +0 -105
- data/vendor/spidermonkey/fdlibm/w_j1.c +0 -106
- data/vendor/spidermonkey/fdlibm/w_jn.c +0 -128
- data/vendor/spidermonkey/fdlibm/w_lgamma.c +0 -85
- data/vendor/spidermonkey/fdlibm/w_lgamma_r.c +0 -81
- data/vendor/spidermonkey/fdlibm/w_log.c +0 -78
- data/vendor/spidermonkey/fdlibm/w_log10.c +0 -81
- data/vendor/spidermonkey/fdlibm/w_pow.c +0 -99
- data/vendor/spidermonkey/fdlibm/w_remainder.c +0 -77
- data/vendor/spidermonkey/fdlibm/w_scalb.c +0 -95
- data/vendor/spidermonkey/fdlibm/w_sinh.c +0 -77
- data/vendor/spidermonkey/fdlibm/w_sqrt.c +0 -77
- data/vendor/spidermonkey/javascript-trace.d +0 -73
- data/vendor/spidermonkey/js.c +0 -3951
- data/vendor/spidermonkey/js.mdp +0 -0
- data/vendor/spidermonkey/js.msg +0 -308
- data/vendor/spidermonkey/js.pkg +0 -2
- data/vendor/spidermonkey/js3240.rc +0 -79
- data/vendor/spidermonkey/jsOS240.def +0 -654
- data/vendor/spidermonkey/jsapi.c +0 -5836
- data/vendor/spidermonkey/jsapi.h +0 -2624
- data/vendor/spidermonkey/jsarena.c +0 -450
- data/vendor/spidermonkey/jsarena.h +0 -318
- data/vendor/spidermonkey/jsarray.c +0 -2996
- data/vendor/spidermonkey/jsarray.h +0 -127
- data/vendor/spidermonkey/jsatom.c +0 -1045
- data/vendor/spidermonkey/jsatom.h +0 -442
- data/vendor/spidermonkey/jsbit.h +0 -253
- data/vendor/spidermonkey/jsbool.c +0 -176
- data/vendor/spidermonkey/jsbool.h +0 -73
- data/vendor/spidermonkey/jsclist.h +0 -139
- data/vendor/spidermonkey/jscntxt.c +0 -1348
- data/vendor/spidermonkey/jscntxt.h +0 -1120
- data/vendor/spidermonkey/jscompat.h +0 -57
- data/vendor/spidermonkey/jsconfig.h +0 -248
- data/vendor/spidermonkey/jsconfig.mk +0 -181
- data/vendor/spidermonkey/jscpucfg.c +0 -396
- data/vendor/spidermonkey/jscpucfg.h +0 -212
- data/vendor/spidermonkey/jsdate.c +0 -2390
- data/vendor/spidermonkey/jsdate.h +0 -124
- data/vendor/spidermonkey/jsdbgapi.c +0 -1802
- data/vendor/spidermonkey/jsdbgapi.h +0 -464
- data/vendor/spidermonkey/jsdhash.c +0 -868
- data/vendor/spidermonkey/jsdhash.h +0 -592
- data/vendor/spidermonkey/jsdtoa.c +0 -3167
- data/vendor/spidermonkey/jsdtoa.h +0 -130
- data/vendor/spidermonkey/jsdtracef.c +0 -317
- data/vendor/spidermonkey/jsdtracef.h +0 -77
- data/vendor/spidermonkey/jsemit.c +0 -6909
- data/vendor/spidermonkey/jsemit.h +0 -741
- data/vendor/spidermonkey/jsexn.c +0 -1371
- data/vendor/spidermonkey/jsexn.h +0 -96
- data/vendor/spidermonkey/jsfile.c +0 -2736
- data/vendor/spidermonkey/jsfile.h +0 -56
- data/vendor/spidermonkey/jsfile.msg +0 -90
- data/vendor/spidermonkey/jsfun.c +0 -2634
- data/vendor/spidermonkey/jsfun.h +0 -254
- data/vendor/spidermonkey/jsgc.c +0 -3562
- data/vendor/spidermonkey/jsgc.h +0 -403
- data/vendor/spidermonkey/jshash.c +0 -476
- data/vendor/spidermonkey/jshash.h +0 -151
- data/vendor/spidermonkey/jsify.pl +0 -485
- data/vendor/spidermonkey/jsinterp.c +0 -7007
- data/vendor/spidermonkey/jsinterp.h +0 -525
- data/vendor/spidermonkey/jsinvoke.c +0 -43
- data/vendor/spidermonkey/jsiter.c +0 -1067
- data/vendor/spidermonkey/jsiter.h +0 -122
- data/vendor/spidermonkey/jskeyword.tbl +0 -124
- data/vendor/spidermonkey/jskwgen.c +0 -460
- data/vendor/spidermonkey/jslibmath.h +0 -266
- data/vendor/spidermonkey/jslock.c +0 -1309
- data/vendor/spidermonkey/jslock.h +0 -313
- data/vendor/spidermonkey/jslocko.asm +0 -60
- data/vendor/spidermonkey/jslog2.c +0 -94
- data/vendor/spidermonkey/jslong.c +0 -264
- data/vendor/spidermonkey/jslong.h +0 -412
- data/vendor/spidermonkey/jsmath.c +0 -567
- data/vendor/spidermonkey/jsmath.h +0 -57
- data/vendor/spidermonkey/jsnum.c +0 -1239
- data/vendor/spidermonkey/jsnum.h +0 -283
- data/vendor/spidermonkey/jsobj.c +0 -5282
- data/vendor/spidermonkey/jsobj.h +0 -709
- data/vendor/spidermonkey/jsopcode.c +0 -5245
- data/vendor/spidermonkey/jsopcode.h +0 -394
- data/vendor/spidermonkey/jsopcode.tbl +0 -523
- data/vendor/spidermonkey/jsotypes.h +0 -202
- data/vendor/spidermonkey/jsparse.c +0 -6704
- data/vendor/spidermonkey/jsparse.h +0 -511
- data/vendor/spidermonkey/jsprf.c +0 -1264
- data/vendor/spidermonkey/jsprf.h +0 -150
- data/vendor/spidermonkey/jsproto.tbl +0 -128
- data/vendor/spidermonkey/jsprvtd.h +0 -267
- data/vendor/spidermonkey/jspubtd.h +0 -744
- data/vendor/spidermonkey/jsregexp.c +0 -4364
- data/vendor/spidermonkey/jsregexp.h +0 -183
- data/vendor/spidermonkey/jsreops.tbl +0 -145
- data/vendor/spidermonkey/jsscan.c +0 -2012
- data/vendor/spidermonkey/jsscan.h +0 -387
- data/vendor/spidermonkey/jsscope.c +0 -1957
- data/vendor/spidermonkey/jsscope.h +0 -418
- data/vendor/spidermonkey/jsscript.c +0 -1832
- data/vendor/spidermonkey/jsscript.h +0 -287
- data/vendor/spidermonkey/jsshell.msg +0 -50
- data/vendor/spidermonkey/jsstddef.h +0 -83
- data/vendor/spidermonkey/jsstr.c +0 -5005
- data/vendor/spidermonkey/jsstr.h +0 -641
- data/vendor/spidermonkey/jstypes.h +0 -475
- data/vendor/spidermonkey/jsutil.c +0 -345
- data/vendor/spidermonkey/jsutil.h +0 -157
- data/vendor/spidermonkey/jsxdrapi.c +0 -800
- data/vendor/spidermonkey/jsxdrapi.h +0 -218
- data/vendor/spidermonkey/jsxml.c +0 -8476
- data/vendor/spidermonkey/jsxml.h +0 -349
- data/vendor/spidermonkey/lock_SunOS.s +0 -119
- data/vendor/spidermonkey/perfect.js +0 -39
- data/vendor/spidermonkey/plify_jsdhash.sed +0 -36
- data/vendor/spidermonkey/prmjtime.c +0 -846
- data/vendor/spidermonkey/prmjtime.h +0 -103
- data/vendor/spidermonkey/resource.h +0 -15
- data/vendor/spidermonkey/rules.mk +0 -197
- data/vendor/spidermonkey/win32.order +0 -384
@@ -1,264 +0,0 @@
|
|
1
|
-
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
2
|
-
/* ***** BEGIN LICENSE BLOCK *****
|
3
|
-
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
4
|
-
*
|
5
|
-
* The contents of this file are subject to the Mozilla Public License Version
|
6
|
-
* 1.1 (the "License"); you may not use this file except in compliance with
|
7
|
-
* the License. You may obtain a copy of the License at
|
8
|
-
* http://www.mozilla.org/MPL/
|
9
|
-
*
|
10
|
-
* Software distributed under the License is distributed on an "AS IS" basis,
|
11
|
-
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
12
|
-
* for the specific language governing rights and limitations under the
|
13
|
-
* License.
|
14
|
-
*
|
15
|
-
* The Original Code is Mozilla Communicator client code, released
|
16
|
-
* March 31, 1998.
|
17
|
-
*
|
18
|
-
* The Initial Developer of the Original Code is
|
19
|
-
* Netscape Communications Corporation.
|
20
|
-
* Portions created by the Initial Developer are Copyright (C) 1998
|
21
|
-
* the Initial Developer. All Rights Reserved.
|
22
|
-
*
|
23
|
-
* Contributor(s):
|
24
|
-
*
|
25
|
-
* Alternatively, the contents of this file may be used under the terms of
|
26
|
-
* either of the GNU General Public License Version 2 or later (the "GPL"),
|
27
|
-
* or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
28
|
-
* in which case the provisions of the GPL or the LGPL are applicable instead
|
29
|
-
* of those above. If you wish to allow use of your version of this file only
|
30
|
-
* under the terms of either the GPL or the LGPL, and not to allow others to
|
31
|
-
* use your version of this file under the terms of the MPL, indicate your
|
32
|
-
* decision by deleting the provisions above and replace them with the notice
|
33
|
-
* and other provisions required by the GPL or the LGPL. If you do not delete
|
34
|
-
* the provisions above, a recipient may use your version of this file under
|
35
|
-
* the terms of any one of the MPL, the GPL or the LGPL.
|
36
|
-
*
|
37
|
-
* ***** END LICENSE BLOCK ***** */
|
38
|
-
|
39
|
-
#include "jsstddef.h"
|
40
|
-
#include "jstypes.h"
|
41
|
-
#include "jslong.h"
|
42
|
-
|
43
|
-
#ifndef JS_HAVE_LONG_LONG
|
44
|
-
/*
|
45
|
-
** Divide 64-bit a by 32-bit b, which must be normalized so its high bit is 1.
|
46
|
-
*/
|
47
|
-
static void norm_udivmod32(JSUint32 *qp, JSUint32 *rp, JSUint64 a, JSUint32 b)
|
48
|
-
{
|
49
|
-
JSUint32 d1, d0, q1, q0;
|
50
|
-
JSUint32 r1, r0, m;
|
51
|
-
|
52
|
-
d1 = jshi16(b);
|
53
|
-
d0 = jslo16(b);
|
54
|
-
r1 = a.hi % d1;
|
55
|
-
q1 = a.hi / d1;
|
56
|
-
m = q1 * d0;
|
57
|
-
r1 = (r1 << 16) | jshi16(a.lo);
|
58
|
-
if (r1 < m) {
|
59
|
-
q1--, r1 += b;
|
60
|
-
if (r1 >= b /* i.e., we didn't get a carry when adding to r1 */
|
61
|
-
&& r1 < m) {
|
62
|
-
q1--, r1 += b;
|
63
|
-
}
|
64
|
-
}
|
65
|
-
r1 -= m;
|
66
|
-
r0 = r1 % d1;
|
67
|
-
q0 = r1 / d1;
|
68
|
-
m = q0 * d0;
|
69
|
-
r0 = (r0 << 16) | jslo16(a.lo);
|
70
|
-
if (r0 < m) {
|
71
|
-
q0--, r0 += b;
|
72
|
-
if (r0 >= b
|
73
|
-
&& r0 < m) {
|
74
|
-
q0--, r0 += b;
|
75
|
-
}
|
76
|
-
}
|
77
|
-
*qp = (q1 << 16) | q0;
|
78
|
-
*rp = r0 - m;
|
79
|
-
}
|
80
|
-
|
81
|
-
static JSUint32 CountLeadingZeros(JSUint32 a)
|
82
|
-
{
|
83
|
-
JSUint32 t;
|
84
|
-
JSUint32 r = 32;
|
85
|
-
|
86
|
-
if ((t = a >> 16) != 0)
|
87
|
-
r -= 16, a = t;
|
88
|
-
if ((t = a >> 8) != 0)
|
89
|
-
r -= 8, a = t;
|
90
|
-
if ((t = a >> 4) != 0)
|
91
|
-
r -= 4, a = t;
|
92
|
-
if ((t = a >> 2) != 0)
|
93
|
-
r -= 2, a = t;
|
94
|
-
if ((t = a >> 1) != 0)
|
95
|
-
r -= 1, a = t;
|
96
|
-
if (a & 1)
|
97
|
-
r--;
|
98
|
-
return r;
|
99
|
-
}
|
100
|
-
|
101
|
-
JS_PUBLIC_API(void) jsll_udivmod(JSUint64 *qp, JSUint64 *rp, JSUint64 a, JSUint64 b)
|
102
|
-
{
|
103
|
-
JSUint32 n0, n1, n2;
|
104
|
-
JSUint32 q0, q1;
|
105
|
-
JSUint32 rsh, lsh;
|
106
|
-
|
107
|
-
n0 = a.lo;
|
108
|
-
n1 = a.hi;
|
109
|
-
|
110
|
-
if (b.hi == 0) {
|
111
|
-
if (b.lo > n1) {
|
112
|
-
/* (0 q0) = (n1 n0) / (0 D0) */
|
113
|
-
|
114
|
-
lsh = CountLeadingZeros(b.lo);
|
115
|
-
|
116
|
-
if (lsh) {
|
117
|
-
/*
|
118
|
-
* Normalize, i.e. make the most significant bit of the
|
119
|
-
* denominator be set.
|
120
|
-
*/
|
121
|
-
b.lo = b.lo << lsh;
|
122
|
-
n1 = (n1 << lsh) | (n0 >> (32 - lsh));
|
123
|
-
n0 = n0 << lsh;
|
124
|
-
}
|
125
|
-
|
126
|
-
a.lo = n0, a.hi = n1;
|
127
|
-
norm_udivmod32(&q0, &n0, a, b.lo);
|
128
|
-
q1 = 0;
|
129
|
-
|
130
|
-
/* remainder is in n0 >> lsh */
|
131
|
-
} else {
|
132
|
-
/* (q1 q0) = (n1 n0) / (0 d0) */
|
133
|
-
|
134
|
-
if (b.lo == 0) /* user wants to divide by zero! */
|
135
|
-
b.lo = 1 / b.lo; /* so go ahead and crash */
|
136
|
-
|
137
|
-
lsh = CountLeadingZeros(b.lo);
|
138
|
-
|
139
|
-
if (lsh == 0) {
|
140
|
-
/*
|
141
|
-
* From (n1 >= b.lo)
|
142
|
-
* && (the most significant bit of b.lo is set),
|
143
|
-
* conclude that
|
144
|
-
* (the most significant bit of n1 is set)
|
145
|
-
* && (the leading quotient digit q1 = 1).
|
146
|
-
*
|
147
|
-
* This special case is necessary, not an optimization
|
148
|
-
* (Shifts counts of 32 are undefined).
|
149
|
-
*/
|
150
|
-
n1 -= b.lo;
|
151
|
-
q1 = 1;
|
152
|
-
} else {
|
153
|
-
/*
|
154
|
-
* Normalize.
|
155
|
-
*/
|
156
|
-
rsh = 32 - lsh;
|
157
|
-
|
158
|
-
b.lo = b.lo << lsh;
|
159
|
-
n2 = n1 >> rsh;
|
160
|
-
n1 = (n1 << lsh) | (n0 >> rsh);
|
161
|
-
n0 = n0 << lsh;
|
162
|
-
|
163
|
-
a.lo = n1, a.hi = n2;
|
164
|
-
norm_udivmod32(&q1, &n1, a, b.lo);
|
165
|
-
}
|
166
|
-
|
167
|
-
/* n1 != b.lo... */
|
168
|
-
|
169
|
-
a.lo = n0, a.hi = n1;
|
170
|
-
norm_udivmod32(&q0, &n0, a, b.lo);
|
171
|
-
|
172
|
-
/* remainder in n0 >> lsh */
|
173
|
-
}
|
174
|
-
|
175
|
-
if (rp) {
|
176
|
-
rp->lo = n0 >> lsh;
|
177
|
-
rp->hi = 0;
|
178
|
-
}
|
179
|
-
} else {
|
180
|
-
if (b.hi > n1) {
|
181
|
-
/* (0 0) = (n1 n0) / (D1 d0) */
|
182
|
-
|
183
|
-
q0 = 0;
|
184
|
-
q1 = 0;
|
185
|
-
|
186
|
-
/* remainder in (n1 n0) */
|
187
|
-
if (rp) {
|
188
|
-
rp->lo = n0;
|
189
|
-
rp->hi = n1;
|
190
|
-
}
|
191
|
-
} else {
|
192
|
-
/* (0 q0) = (n1 n0) / (d1 d0) */
|
193
|
-
|
194
|
-
lsh = CountLeadingZeros(b.hi);
|
195
|
-
if (lsh == 0) {
|
196
|
-
/*
|
197
|
-
* From (n1 >= b.hi)
|
198
|
-
* && (the most significant bit of b.hi is set),
|
199
|
-
* conclude that
|
200
|
-
* (the most significant bit of n1 is set)
|
201
|
-
* && (the quotient digit q0 = 0 or 1).
|
202
|
-
*
|
203
|
-
* This special case is necessary, not an optimization.
|
204
|
-
*/
|
205
|
-
|
206
|
-
/*
|
207
|
-
* The condition on the next line takes advantage of that
|
208
|
-
* n1 >= b.hi (true due to control flow).
|
209
|
-
*/
|
210
|
-
if (n1 > b.hi || n0 >= b.lo) {
|
211
|
-
q0 = 1;
|
212
|
-
a.lo = n0, a.hi = n1;
|
213
|
-
JSLL_SUB(a, a, b);
|
214
|
-
} else {
|
215
|
-
q0 = 0;
|
216
|
-
}
|
217
|
-
q1 = 0;
|
218
|
-
|
219
|
-
if (rp) {
|
220
|
-
rp->lo = n0;
|
221
|
-
rp->hi = n1;
|
222
|
-
}
|
223
|
-
} else {
|
224
|
-
JSInt64 m;
|
225
|
-
|
226
|
-
/*
|
227
|
-
* Normalize.
|
228
|
-
*/
|
229
|
-
rsh = 32 - lsh;
|
230
|
-
|
231
|
-
b.hi = (b.hi << lsh) | (b.lo >> rsh);
|
232
|
-
b.lo = b.lo << lsh;
|
233
|
-
n2 = n1 >> rsh;
|
234
|
-
n1 = (n1 << lsh) | (n0 >> rsh);
|
235
|
-
n0 = n0 << lsh;
|
236
|
-
|
237
|
-
a.lo = n1, a.hi = n2;
|
238
|
-
norm_udivmod32(&q0, &n1, a, b.hi);
|
239
|
-
JSLL_MUL32(m, q0, b.lo);
|
240
|
-
|
241
|
-
if ((m.hi > n1) || ((m.hi == n1) && (m.lo > n0))) {
|
242
|
-
q0--;
|
243
|
-
JSLL_SUB(m, m, b);
|
244
|
-
}
|
245
|
-
|
246
|
-
q1 = 0;
|
247
|
-
|
248
|
-
/* Remainder is ((n1 n0) - (m1 m0)) >> lsh */
|
249
|
-
if (rp) {
|
250
|
-
a.lo = n0, a.hi = n1;
|
251
|
-
JSLL_SUB(a, a, m);
|
252
|
-
rp->lo = (a.hi << rsh) | (a.lo >> lsh);
|
253
|
-
rp->hi = a.hi >> lsh;
|
254
|
-
}
|
255
|
-
}
|
256
|
-
}
|
257
|
-
}
|
258
|
-
|
259
|
-
if (qp) {
|
260
|
-
qp->lo = q0;
|
261
|
-
qp->hi = q1;
|
262
|
-
}
|
263
|
-
}
|
264
|
-
#endif /* !JS_HAVE_LONG_LONG */
|
@@ -1,412 +0,0 @@
|
|
1
|
-
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
2
|
-
/* ***** BEGIN LICENSE BLOCK *****
|
3
|
-
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
4
|
-
*
|
5
|
-
* The contents of this file are subject to the Mozilla Public License Version
|
6
|
-
* 1.1 (the "License"); you may not use this file except in compliance with
|
7
|
-
* the License. You may obtain a copy of the License at
|
8
|
-
* http://www.mozilla.org/MPL/
|
9
|
-
*
|
10
|
-
* Software distributed under the License is distributed on an "AS IS" basis,
|
11
|
-
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
12
|
-
* for the specific language governing rights and limitations under the
|
13
|
-
* License.
|
14
|
-
*
|
15
|
-
* The Original Code is Mozilla Communicator client code, released
|
16
|
-
* March 31, 1998.
|
17
|
-
*
|
18
|
-
* The Initial Developer of the Original Code is
|
19
|
-
* Netscape Communications Corporation.
|
20
|
-
* Portions created by the Initial Developer are Copyright (C) 1998
|
21
|
-
* the Initial Developer. All Rights Reserved.
|
22
|
-
*
|
23
|
-
* Contributor(s):
|
24
|
-
*
|
25
|
-
* Alternatively, the contents of this file may be used under the terms of
|
26
|
-
* either of the GNU General Public License Version 2 or later (the "GPL"),
|
27
|
-
* or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
28
|
-
* in which case the provisions of the GPL or the LGPL are applicable instead
|
29
|
-
* of those above. If you wish to allow use of your version of this file only
|
30
|
-
* under the terms of either the GPL or the LGPL, and not to allow others to
|
31
|
-
* use your version of this file under the terms of the MPL, indicate your
|
32
|
-
* decision by deleting the provisions above and replace them with the notice
|
33
|
-
* and other provisions required by the GPL or the LGPL. If you do not delete
|
34
|
-
* the provisions above, a recipient may use your version of this file under
|
35
|
-
* the terms of any one of the MPL, the GPL or the LGPL.
|
36
|
-
*
|
37
|
-
* ***** END LICENSE BLOCK ***** */
|
38
|
-
|
39
|
-
/*
|
40
|
-
** File: jslong.h
|
41
|
-
** Description: Portable access to 64 bit numerics
|
42
|
-
**
|
43
|
-
** Long-long (64-bit signed integer type) support. Some C compilers
|
44
|
-
** don't support 64 bit integers yet, so we use these macros to
|
45
|
-
** support both machines that do and don't.
|
46
|
-
**/
|
47
|
-
#ifndef jslong_h___
|
48
|
-
#define jslong_h___
|
49
|
-
|
50
|
-
#include "jstypes.h"
|
51
|
-
|
52
|
-
JS_BEGIN_EXTERN_C
|
53
|
-
|
54
|
-
#ifdef JS_HAVE_LONG_LONG
|
55
|
-
|
56
|
-
#if JS_BYTES_PER_LONG == 8
|
57
|
-
#define JSLL_INIT(hi, lo) ((hi ## L << 32) + lo ## L)
|
58
|
-
#elif (defined(WIN32) || defined(WIN16)) && !defined(__GNUC__)
|
59
|
-
#define JSLL_INIT(hi, lo) ((hi ## i64 << 32) + lo ## i64)
|
60
|
-
#else
|
61
|
-
#define JSLL_INIT(hi, lo) ((hi ## LL << 32) + lo ## LL)
|
62
|
-
#endif
|
63
|
-
|
64
|
-
/***********************************************************************
|
65
|
-
** MACROS: JSLL_*
|
66
|
-
** DESCRIPTION:
|
67
|
-
** The following macros define portable access to the 64 bit
|
68
|
-
** math facilities.
|
69
|
-
**
|
70
|
-
***********************************************************************/
|
71
|
-
|
72
|
-
/***********************************************************************
|
73
|
-
** MACROS: JSLL_<relational operators>
|
74
|
-
**
|
75
|
-
** JSLL_IS_ZERO Test for zero
|
76
|
-
** JSLL_EQ Test for equality
|
77
|
-
** JSLL_NE Test for inequality
|
78
|
-
** JSLL_GE_ZERO Test for zero or positive
|
79
|
-
** JSLL_CMP Compare two values
|
80
|
-
***********************************************************************/
|
81
|
-
#define JSLL_IS_ZERO(a) ((a) == 0)
|
82
|
-
#define JSLL_EQ(a, b) ((a) == (b))
|
83
|
-
#define JSLL_NE(a, b) ((a) != (b))
|
84
|
-
#define JSLL_GE_ZERO(a) ((a) >= 0)
|
85
|
-
#define JSLL_CMP(a, op, b) ((JSInt64)(a) op (JSInt64)(b))
|
86
|
-
#define JSLL_UCMP(a, op, b) ((JSUint64)(a) op (JSUint64)(b))
|
87
|
-
|
88
|
-
/***********************************************************************
|
89
|
-
** MACROS: JSLL_<logical operators>
|
90
|
-
**
|
91
|
-
** JSLL_AND Logical and
|
92
|
-
** JSLL_OR Logical or
|
93
|
-
** JSLL_XOR Logical exclusion
|
94
|
-
** JSLL_OR2 A disgusting deviation
|
95
|
-
** JSLL_NOT Negation (one's compliment)
|
96
|
-
***********************************************************************/
|
97
|
-
#define JSLL_AND(r, a, b) ((r) = (a) & (b))
|
98
|
-
#define JSLL_OR(r, a, b) ((r) = (a) | (b))
|
99
|
-
#define JSLL_XOR(r, a, b) ((r) = (a) ^ (b))
|
100
|
-
#define JSLL_OR2(r, a) ((r) = (r) | (a))
|
101
|
-
#define JSLL_NOT(r, a) ((r) = ~(a))
|
102
|
-
|
103
|
-
/***********************************************************************
|
104
|
-
** MACROS: JSLL_<mathematical operators>
|
105
|
-
**
|
106
|
-
** JSLL_NEG Negation (two's compliment)
|
107
|
-
** JSLL_ADD Summation (two's compliment)
|
108
|
-
** JSLL_SUB Difference (two's compliment)
|
109
|
-
***********************************************************************/
|
110
|
-
#define JSLL_NEG(r, a) ((r) = -(a))
|
111
|
-
#define JSLL_ADD(r, a, b) ((r) = (a) + (b))
|
112
|
-
#define JSLL_SUB(r, a, b) ((r) = (a) - (b))
|
113
|
-
|
114
|
-
/***********************************************************************
|
115
|
-
** MACROS: JSLL_<mathematical operators>
|
116
|
-
**
|
117
|
-
** JSLL_MUL Product (two's compliment)
|
118
|
-
** JSLL_DIV Quotient (two's compliment)
|
119
|
-
** JSLL_MOD Modulus (two's compliment)
|
120
|
-
***********************************************************************/
|
121
|
-
#define JSLL_MUL(r, a, b) ((r) = (a) * (b))
|
122
|
-
#define JSLL_DIV(r, a, b) ((r) = (a) / (b))
|
123
|
-
#define JSLL_MOD(r, a, b) ((r) = (a) % (b))
|
124
|
-
|
125
|
-
/***********************************************************************
|
126
|
-
** MACROS: JSLL_<shifting operators>
|
127
|
-
**
|
128
|
-
** JSLL_SHL Shift left [0..64] bits
|
129
|
-
** JSLL_SHR Shift right [0..64] bits with sign extension
|
130
|
-
** JSLL_USHR Unsigned shift right [0..64] bits
|
131
|
-
** JSLL_ISHL Signed shift left [0..64] bits
|
132
|
-
***********************************************************************/
|
133
|
-
#define JSLL_SHL(r, a, b) ((r) = (JSInt64)(a) << (b))
|
134
|
-
#define JSLL_SHR(r, a, b) ((r) = (JSInt64)(a) >> (b))
|
135
|
-
#define JSLL_USHR(r, a, b) ((r) = (JSUint64)(a) >> (b))
|
136
|
-
#define JSLL_ISHL(r, a, b) ((r) = (JSInt64)(a) << (b))
|
137
|
-
|
138
|
-
/***********************************************************************
|
139
|
-
** MACROS: JSLL_<conversion operators>
|
140
|
-
**
|
141
|
-
** JSLL_L2I Convert to signed 32 bit
|
142
|
-
** JSLL_L2UI Convert to unsigned 32 bit
|
143
|
-
** JSLL_L2F Convert to floating point
|
144
|
-
** JSLL_L2D Convert to floating point
|
145
|
-
** JSLL_I2L Convert signed to 64 bit
|
146
|
-
** JSLL_UI2L Convert unsigned to 64 bit
|
147
|
-
** JSLL_F2L Convert float to 64 bit
|
148
|
-
** JSLL_D2L Convert float to 64 bit
|
149
|
-
***********************************************************************/
|
150
|
-
#define JSLL_L2I(i, l) ((i) = (JSInt32)(l))
|
151
|
-
#define JSLL_L2UI(ui, l) ((ui) = (JSUint32)(l))
|
152
|
-
#define JSLL_L2F(f, l) ((f) = (JSFloat64)(l))
|
153
|
-
#define JSLL_L2D(d, l) ((d) = (JSFloat64)(l))
|
154
|
-
|
155
|
-
#define JSLL_I2L(l, i) ((l) = (JSInt64)(i))
|
156
|
-
#define JSLL_UI2L(l, ui) ((l) = (JSInt64)(ui))
|
157
|
-
#define JSLL_F2L(l, f) ((l) = (JSInt64)(f))
|
158
|
-
#define JSLL_D2L(l, d) ((l) = (JSInt64)(d))
|
159
|
-
|
160
|
-
/***********************************************************************
|
161
|
-
** MACROS: JSLL_UDIVMOD
|
162
|
-
** DESCRIPTION:
|
163
|
-
** Produce both a quotient and a remainder given an unsigned
|
164
|
-
** INPUTS: JSUint64 a: The dividend of the operation
|
165
|
-
** JSUint64 b: The quotient of the operation
|
166
|
-
** OUTPUTS: JSUint64 *qp: pointer to quotient
|
167
|
-
** JSUint64 *rp: pointer to remainder
|
168
|
-
***********************************************************************/
|
169
|
-
#define JSLL_UDIVMOD(qp, rp, a, b) \
|
170
|
-
(*(qp) = ((JSUint64)(a) / (b)), \
|
171
|
-
*(rp) = ((JSUint64)(a) % (b)))
|
172
|
-
|
173
|
-
#else /* !JS_HAVE_LONG_LONG */
|
174
|
-
|
175
|
-
#ifdef IS_LITTLE_ENDIAN
|
176
|
-
#define JSLL_INIT(hi, lo) {JS_INT32(lo), JS_INT32(hi)}
|
177
|
-
#else
|
178
|
-
#define JSLL_INIT(hi, lo) {JS_INT32(hi), JS_INT32(lo)}
|
179
|
-
#endif
|
180
|
-
|
181
|
-
#define JSLL_IS_ZERO(a) (((a).hi == 0) && ((a).lo == 0))
|
182
|
-
#define JSLL_EQ(a, b) (((a).hi == (b).hi) && ((a).lo == (b).lo))
|
183
|
-
#define JSLL_NE(a, b) (((a).hi != (b).hi) || ((a).lo != (b).lo))
|
184
|
-
#define JSLL_GE_ZERO(a) (((a).hi >> 31) == 0)
|
185
|
-
|
186
|
-
#ifdef DEBUG
|
187
|
-
#define JSLL_CMP(a, op, b) (JS_ASSERT((#op)[1] != '='), JSLL_REAL_CMP(a, op, b))
|
188
|
-
#define JSLL_UCMP(a, op, b) (JS_ASSERT((#op)[1] != '='), JSLL_REAL_UCMP(a, op, b))
|
189
|
-
#else
|
190
|
-
#define JSLL_CMP(a, op, b) JSLL_REAL_CMP(a, op, b)
|
191
|
-
#define JSLL_UCMP(a, op, b) JSLL_REAL_UCMP(a, op, b)
|
192
|
-
#endif
|
193
|
-
|
194
|
-
#define JSLL_REAL_CMP(a,op,b) (((JSInt32)(a).hi op (JSInt32)(b).hi) || \
|
195
|
-
(((a).hi == (b).hi) && ((a).lo op (b).lo)))
|
196
|
-
#define JSLL_REAL_UCMP(a,op,b) (((a).hi op (b).hi) || \
|
197
|
-
(((a).hi == (b).hi) && ((a).lo op (b).lo)))
|
198
|
-
|
199
|
-
#define JSLL_AND(r, a, b) ((r).lo = (a).lo & (b).lo, \
|
200
|
-
(r).hi = (a).hi & (b).hi)
|
201
|
-
#define JSLL_OR(r, a, b) ((r).lo = (a).lo | (b).lo, \
|
202
|
-
(r).hi = (a).hi | (b).hi)
|
203
|
-
#define JSLL_XOR(r, a, b) ((r).lo = (a).lo ^ (b).lo, \
|
204
|
-
(r).hi = (a).hi ^ (b).hi)
|
205
|
-
#define JSLL_OR2(r, a) ((r).lo = (r).lo | (a).lo, \
|
206
|
-
(r).hi = (r).hi | (a).hi)
|
207
|
-
#define JSLL_NOT(r, a) ((r).lo = ~(a).lo, \
|
208
|
-
(r).hi = ~(a).hi)
|
209
|
-
|
210
|
-
#define JSLL_NEG(r, a) ((r).lo = -(JSInt32)(a).lo, \
|
211
|
-
(r).hi = -(JSInt32)(a).hi - ((r).lo != 0))
|
212
|
-
#define JSLL_ADD(r, a, b) { \
|
213
|
-
JSInt64 _a, _b; \
|
214
|
-
_a = a; _b = b; \
|
215
|
-
(r).lo = _a.lo + _b.lo; \
|
216
|
-
(r).hi = _a.hi + _b.hi + ((r).lo < _b.lo); \
|
217
|
-
}
|
218
|
-
|
219
|
-
#define JSLL_SUB(r, a, b) { \
|
220
|
-
JSInt64 _a, _b; \
|
221
|
-
_a = a; _b = b; \
|
222
|
-
(r).lo = _a.lo - _b.lo; \
|
223
|
-
(r).hi = _a.hi - _b.hi - (_a.lo < _b.lo); \
|
224
|
-
}
|
225
|
-
|
226
|
-
#define JSLL_MUL(r, a, b) { \
|
227
|
-
JSInt64 _a, _b; \
|
228
|
-
_a = a; _b = b; \
|
229
|
-
JSLL_MUL32(r, _a.lo, _b.lo); \
|
230
|
-
(r).hi += _a.hi * _b.lo + _a.lo * _b.hi; \
|
231
|
-
}
|
232
|
-
|
233
|
-
#define jslo16(a) ((a) & JS_BITMASK(16))
|
234
|
-
#define jshi16(a) ((a) >> 16)
|
235
|
-
|
236
|
-
#define JSLL_MUL32(r, a, b) { \
|
237
|
-
JSUint32 _a1, _a0, _b1, _b0, _y0, _y1, _y2, _y3; \
|
238
|
-
_a1 = jshi16(a), _a0 = jslo16(a); \
|
239
|
-
_b1 = jshi16(b), _b0 = jslo16(b); \
|
240
|
-
_y0 = _a0 * _b0; \
|
241
|
-
_y1 = _a0 * _b1; \
|
242
|
-
_y2 = _a1 * _b0; \
|
243
|
-
_y3 = _a1 * _b1; \
|
244
|
-
_y1 += jshi16(_y0); /* can't carry */ \
|
245
|
-
_y1 += _y2; /* might carry */ \
|
246
|
-
if (_y1 < _y2) \
|
247
|
-
_y3 += (JSUint32)(JS_BIT(16)); /* propagate */ \
|
248
|
-
(r).lo = (jslo16(_y1) << 16) + jslo16(_y0); \
|
249
|
-
(r).hi = _y3 + jshi16(_y1); \
|
250
|
-
}
|
251
|
-
|
252
|
-
#define JSLL_UDIVMOD(qp, rp, a, b) jsll_udivmod(qp, rp, a, b)
|
253
|
-
|
254
|
-
extern JS_PUBLIC_API(void) jsll_udivmod(JSUint64 *qp, JSUint64 *rp, JSUint64 a, JSUint64 b);
|
255
|
-
|
256
|
-
#define JSLL_DIV(r, a, b) { \
|
257
|
-
JSInt64 _a, _b; \
|
258
|
-
JSUint32 _negative = (JSInt32)(a).hi < 0; \
|
259
|
-
if (_negative) { \
|
260
|
-
JSLL_NEG(_a, a); \
|
261
|
-
} else { \
|
262
|
-
_a = a; \
|
263
|
-
} \
|
264
|
-
if ((JSInt32)(b).hi < 0) { \
|
265
|
-
_negative ^= 1; \
|
266
|
-
JSLL_NEG(_b, b); \
|
267
|
-
} else { \
|
268
|
-
_b = b; \
|
269
|
-
} \
|
270
|
-
JSLL_UDIVMOD(&(r), 0, _a, _b); \
|
271
|
-
if (_negative) \
|
272
|
-
JSLL_NEG(r, r); \
|
273
|
-
}
|
274
|
-
|
275
|
-
#define JSLL_MOD(r, a, b) { \
|
276
|
-
JSInt64 _a, _b; \
|
277
|
-
JSUint32 _negative = (JSInt32)(a).hi < 0; \
|
278
|
-
if (_negative) { \
|
279
|
-
JSLL_NEG(_a, a); \
|
280
|
-
} else { \
|
281
|
-
_a = a; \
|
282
|
-
} \
|
283
|
-
if ((JSInt32)(b).hi < 0) { \
|
284
|
-
JSLL_NEG(_b, b); \
|
285
|
-
} else { \
|
286
|
-
_b = b; \
|
287
|
-
} \
|
288
|
-
JSLL_UDIVMOD(0, &(r), _a, _b); \
|
289
|
-
if (_negative) \
|
290
|
-
JSLL_NEG(r, r); \
|
291
|
-
}
|
292
|
-
|
293
|
-
#define JSLL_SHL(r, a, b) { \
|
294
|
-
if (b) { \
|
295
|
-
JSInt64 _a; \
|
296
|
-
_a = a; \
|
297
|
-
if ((b) < 32) { \
|
298
|
-
(r).lo = _a.lo << ((b) & 31); \
|
299
|
-
(r).hi = (_a.hi << ((b) & 31)) | (_a.lo >> (32 - (b))); \
|
300
|
-
} else { \
|
301
|
-
(r).lo = 0; \
|
302
|
-
(r).hi = _a.lo << ((b) & 31); \
|
303
|
-
} \
|
304
|
-
} else { \
|
305
|
-
(r) = (a); \
|
306
|
-
} \
|
307
|
-
}
|
308
|
-
|
309
|
-
/* a is an JSInt32, b is JSInt32, r is JSInt64 */
|
310
|
-
#define JSLL_ISHL(r, a, b) { \
|
311
|
-
if (b) { \
|
312
|
-
JSInt64 _a; \
|
313
|
-
_a.lo = (a); \
|
314
|
-
_a.hi = 0; \
|
315
|
-
if ((b) < 32) { \
|
316
|
-
(r).lo = (a) << ((b) & 31); \
|
317
|
-
(r).hi = ((a) >> (32 - (b))); \
|
318
|
-
} else { \
|
319
|
-
(r).lo = 0; \
|
320
|
-
(r).hi = (a) << ((b) & 31); \
|
321
|
-
} \
|
322
|
-
} else { \
|
323
|
-
(r).lo = (a); \
|
324
|
-
(r).hi = 0; \
|
325
|
-
} \
|
326
|
-
}
|
327
|
-
|
328
|
-
#define JSLL_SHR(r, a, b) { \
|
329
|
-
if (b) { \
|
330
|
-
JSInt64 _a; \
|
331
|
-
_a = a; \
|
332
|
-
if ((b) < 32) { \
|
333
|
-
(r).lo = (_a.hi << (32 - (b))) | (_a.lo >> ((b) & 31)); \
|
334
|
-
(r).hi = (JSInt32)_a.hi >> ((b) & 31); \
|
335
|
-
} else { \
|
336
|
-
(r).lo = (JSInt32)_a.hi >> ((b) & 31); \
|
337
|
-
(r).hi = (JSInt32)_a.hi >> 31; \
|
338
|
-
} \
|
339
|
-
} else { \
|
340
|
-
(r) = (a); \
|
341
|
-
} \
|
342
|
-
}
|
343
|
-
|
344
|
-
#define JSLL_USHR(r, a, b) { \
|
345
|
-
if (b) { \
|
346
|
-
JSInt64 _a; \
|
347
|
-
_a = a; \
|
348
|
-
if ((b) < 32) { \
|
349
|
-
(r).lo = (_a.hi << (32 - (b))) | (_a.lo >> ((b) & 31)); \
|
350
|
-
(r).hi = _a.hi >> ((b) & 31); \
|
351
|
-
} else { \
|
352
|
-
(r).lo = _a.hi >> ((b) & 31); \
|
353
|
-
(r).hi = 0; \
|
354
|
-
} \
|
355
|
-
} else { \
|
356
|
-
(r) = (a); \
|
357
|
-
} \
|
358
|
-
}
|
359
|
-
|
360
|
-
#define JSLL_L2I(i, l) ((i) = (l).lo)
|
361
|
-
#define JSLL_L2UI(ui, l) ((ui) = (l).lo)
|
362
|
-
#define JSLL_L2F(f, l) { double _d; JSLL_L2D(_d, l); (f) = (JSFloat64)_d; }
|
363
|
-
|
364
|
-
#define JSLL_L2D(d, l) { \
|
365
|
-
int _negative; \
|
366
|
-
JSInt64 _absval; \
|
367
|
-
\
|
368
|
-
_negative = (l).hi >> 31; \
|
369
|
-
if (_negative) { \
|
370
|
-
JSLL_NEG(_absval, l); \
|
371
|
-
} else { \
|
372
|
-
_absval = l; \
|
373
|
-
} \
|
374
|
-
(d) = (double)_absval.hi * 4.294967296e9 + _absval.lo; \
|
375
|
-
if (_negative) \
|
376
|
-
(d) = -(d); \
|
377
|
-
}
|
378
|
-
|
379
|
-
#define JSLL_I2L(l, i) { JSInt32 _i = (i) >> 31; (l).lo = (i); (l).hi = _i; }
|
380
|
-
#define JSLL_UI2L(l, ui) ((l).lo = (ui), (l).hi = 0)
|
381
|
-
#define JSLL_F2L(l, f) { double _d = (double)f; JSLL_D2L(l, _d); }
|
382
|
-
|
383
|
-
#define JSLL_D2L(l, d) { \
|
384
|
-
int _negative; \
|
385
|
-
double _absval, _d_hi; \
|
386
|
-
JSInt64 _lo_d; \
|
387
|
-
\
|
388
|
-
_negative = ((d) < 0); \
|
389
|
-
_absval = _negative ? -(d) : (d); \
|
390
|
-
\
|
391
|
-
(l).hi = _absval / 4.294967296e9; \
|
392
|
-
(l).lo = 0; \
|
393
|
-
JSLL_L2D(_d_hi, l); \
|
394
|
-
_absval -= _d_hi; \
|
395
|
-
_lo_d.hi = 0; \
|
396
|
-
if (_absval < 0) { \
|
397
|
-
_lo_d.lo = -_absval; \
|
398
|
-
JSLL_SUB(l, l, _lo_d); \
|
399
|
-
} else { \
|
400
|
-
_lo_d.lo = _absval; \
|
401
|
-
JSLL_ADD(l, l, _lo_d); \
|
402
|
-
} \
|
403
|
-
\
|
404
|
-
if (_negative) \
|
405
|
-
JSLL_NEG(l, l); \
|
406
|
-
}
|
407
|
-
|
408
|
-
#endif /* !JS_HAVE_LONG_LONG */
|
409
|
-
|
410
|
-
JS_END_EXTERN_C
|
411
|
-
|
412
|
-
#endif /* jslong_h___ */
|