libv8-freebsd 3.3.10.4
Sign up to get free protection for your applications and to get access to all the features.
- data/.gitignore +9 -0
- data/.gitmodules +3 -0
- data/Gemfile +4 -0
- data/README.md +75 -0
- data/Rakefile +115 -0
- data/ext/libv8/extconf.rb +27 -0
- data/lib/libv8.rb +15 -0
- data/lib/libv8/Makefile +39 -0
- data/lib/libv8/detect_cpu.rb +27 -0
- data/lib/libv8/fpic-on-freebsd-amd64.patch +16 -0
- data/lib/libv8/fpic-on-linux-amd64.patch +13 -0
- data/lib/libv8/scons/CHANGES.txt +5541 -0
- data/lib/libv8/scons/LICENSE.txt +20 -0
- data/lib/libv8/scons/MANIFEST +200 -0
- data/lib/libv8/scons/PKG-INFO +13 -0
- data/lib/libv8/scons/README.txt +243 -0
- data/lib/libv8/scons/RELEASE.txt +100 -0
- data/lib/libv8/scons/engine/SCons/Action.py +1257 -0
- data/lib/libv8/scons/engine/SCons/Builder.py +877 -0
- data/lib/libv8/scons/engine/SCons/CacheDir.py +216 -0
- data/lib/libv8/scons/engine/SCons/Conftest.py +793 -0
- data/lib/libv8/scons/engine/SCons/Debug.py +220 -0
- data/lib/libv8/scons/engine/SCons/Defaults.py +494 -0
- data/lib/libv8/scons/engine/SCons/Environment.py +2417 -0
- data/lib/libv8/scons/engine/SCons/Errors.py +205 -0
- data/lib/libv8/scons/engine/SCons/Executor.py +633 -0
- data/lib/libv8/scons/engine/SCons/Job.py +435 -0
- data/lib/libv8/scons/engine/SCons/Memoize.py +244 -0
- data/lib/libv8/scons/engine/SCons/Node/Alias.py +152 -0
- data/lib/libv8/scons/engine/SCons/Node/FS.py +3302 -0
- data/lib/libv8/scons/engine/SCons/Node/Python.py +128 -0
- data/lib/libv8/scons/engine/SCons/Node/__init__.py +1329 -0
- data/lib/libv8/scons/engine/SCons/Options/BoolOption.py +50 -0
- data/lib/libv8/scons/engine/SCons/Options/EnumOption.py +50 -0
- data/lib/libv8/scons/engine/SCons/Options/ListOption.py +50 -0
- data/lib/libv8/scons/engine/SCons/Options/PackageOption.py +50 -0
- data/lib/libv8/scons/engine/SCons/Options/PathOption.py +76 -0
- data/lib/libv8/scons/engine/SCons/Options/__init__.py +67 -0
- data/lib/libv8/scons/engine/SCons/PathList.py +231 -0
- data/lib/libv8/scons/engine/SCons/Platform/__init__.py +241 -0
- data/lib/libv8/scons/engine/SCons/Platform/aix.py +69 -0
- data/lib/libv8/scons/engine/SCons/Platform/cygwin.py +55 -0
- data/lib/libv8/scons/engine/SCons/Platform/darwin.py +70 -0
- data/lib/libv8/scons/engine/SCons/Platform/hpux.py +46 -0
- data/lib/libv8/scons/engine/SCons/Platform/irix.py +44 -0
- data/lib/libv8/scons/engine/SCons/Platform/os2.py +58 -0
- data/lib/libv8/scons/engine/SCons/Platform/posix.py +263 -0
- data/lib/libv8/scons/engine/SCons/Platform/sunos.py +50 -0
- data/lib/libv8/scons/engine/SCons/Platform/win32.py +385 -0
- data/lib/libv8/scons/engine/SCons/SConf.py +1030 -0
- data/lib/libv8/scons/engine/SCons/SConsign.py +389 -0
- data/lib/libv8/scons/engine/SCons/Scanner/C.py +132 -0
- data/lib/libv8/scons/engine/SCons/Scanner/D.py +73 -0
- data/lib/libv8/scons/engine/SCons/Scanner/Dir.py +109 -0
- data/lib/libv8/scons/engine/SCons/Scanner/Fortran.py +316 -0
- data/lib/libv8/scons/engine/SCons/Scanner/IDL.py +48 -0
- data/lib/libv8/scons/engine/SCons/Scanner/LaTeX.py +387 -0
- data/lib/libv8/scons/engine/SCons/Scanner/Prog.py +101 -0
- data/lib/libv8/scons/engine/SCons/Scanner/RC.py +55 -0
- data/lib/libv8/scons/engine/SCons/Scanner/__init__.py +413 -0
- data/lib/libv8/scons/engine/SCons/Script/Interactive.py +384 -0
- data/lib/libv8/scons/engine/SCons/Script/Main.py +1405 -0
- data/lib/libv8/scons/engine/SCons/Script/SConsOptions.py +939 -0
- data/lib/libv8/scons/engine/SCons/Script/SConscript.py +640 -0
- data/lib/libv8/scons/engine/SCons/Script/__init__.py +412 -0
- data/lib/libv8/scons/engine/SCons/Sig.py +63 -0
- data/lib/libv8/scons/engine/SCons/Subst.py +904 -0
- data/lib/libv8/scons/engine/SCons/Taskmaster.py +1025 -0
- data/lib/libv8/scons/engine/SCons/Tool/386asm.py +61 -0
- data/lib/libv8/scons/engine/SCons/Tool/BitKeeper.py +67 -0
- data/lib/libv8/scons/engine/SCons/Tool/CVS.py +73 -0
- data/lib/libv8/scons/engine/SCons/Tool/FortranCommon.py +263 -0
- data/lib/libv8/scons/engine/SCons/Tool/JavaCommon.py +323 -0
- data/lib/libv8/scons/engine/SCons/Tool/MSCommon/__init__.py +56 -0
- data/lib/libv8/scons/engine/SCons/Tool/MSCommon/arch.py +61 -0
- data/lib/libv8/scons/engine/SCons/Tool/MSCommon/common.py +240 -0
- data/lib/libv8/scons/engine/SCons/Tool/MSCommon/netframework.py +82 -0
- data/lib/libv8/scons/engine/SCons/Tool/MSCommon/sdk.py +391 -0
- data/lib/libv8/scons/engine/SCons/Tool/MSCommon/vc.py +459 -0
- data/lib/libv8/scons/engine/SCons/Tool/MSCommon/vs.py +526 -0
- data/lib/libv8/scons/engine/SCons/Tool/Perforce.py +103 -0
- data/lib/libv8/scons/engine/SCons/Tool/PharLapCommon.py +137 -0
- data/lib/libv8/scons/engine/SCons/Tool/RCS.py +64 -0
- data/lib/libv8/scons/engine/SCons/Tool/SCCS.py +64 -0
- data/lib/libv8/scons/engine/SCons/Tool/Subversion.py +71 -0
- data/lib/libv8/scons/engine/SCons/Tool/__init__.py +681 -0
- data/lib/libv8/scons/engine/SCons/Tool/aixc++.py +82 -0
- data/lib/libv8/scons/engine/SCons/Tool/aixcc.py +74 -0
- data/lib/libv8/scons/engine/SCons/Tool/aixf77.py +80 -0
- data/lib/libv8/scons/engine/SCons/Tool/aixlink.py +76 -0
- data/lib/libv8/scons/engine/SCons/Tool/applelink.py +71 -0
- data/lib/libv8/scons/engine/SCons/Tool/ar.py +63 -0
- data/lib/libv8/scons/engine/SCons/Tool/as.py +78 -0
- data/lib/libv8/scons/engine/SCons/Tool/bcc32.py +81 -0
- data/lib/libv8/scons/engine/SCons/Tool/c++.py +99 -0
- data/lib/libv8/scons/engine/SCons/Tool/cc.py +102 -0
- data/lib/libv8/scons/engine/SCons/Tool/cvf.py +58 -0
- data/lib/libv8/scons/engine/SCons/Tool/default.py +50 -0
- data/lib/libv8/scons/engine/SCons/Tool/dmd.py +240 -0
- data/lib/libv8/scons/engine/SCons/Tool/dvi.py +64 -0
- data/lib/libv8/scons/engine/SCons/Tool/dvipdf.py +125 -0
- data/lib/libv8/scons/engine/SCons/Tool/dvips.py +95 -0
- data/lib/libv8/scons/engine/SCons/Tool/f03.py +63 -0
- data/lib/libv8/scons/engine/SCons/Tool/f77.py +62 -0
- data/lib/libv8/scons/engine/SCons/Tool/f90.py +62 -0
- data/lib/libv8/scons/engine/SCons/Tool/f95.py +63 -0
- data/lib/libv8/scons/engine/SCons/Tool/filesystem.py +98 -0
- data/lib/libv8/scons/engine/SCons/Tool/fortran.py +62 -0
- data/lib/libv8/scons/engine/SCons/Tool/g++.py +90 -0
- data/lib/libv8/scons/engine/SCons/Tool/g77.py +73 -0
- data/lib/libv8/scons/engine/SCons/Tool/gas.py +53 -0
- data/lib/libv8/scons/engine/SCons/Tool/gcc.py +80 -0
- data/lib/libv8/scons/engine/SCons/Tool/gfortran.py +64 -0
- data/lib/libv8/scons/engine/SCons/Tool/gnulink.py +62 -0
- data/lib/libv8/scons/engine/SCons/Tool/gs.py +81 -0
- data/lib/libv8/scons/engine/SCons/Tool/hpc++.py +84 -0
- data/lib/libv8/scons/engine/SCons/Tool/hpcc.py +53 -0
- data/lib/libv8/scons/engine/SCons/Tool/hplink.py +77 -0
- data/lib/libv8/scons/engine/SCons/Tool/icc.py +59 -0
- data/lib/libv8/scons/engine/SCons/Tool/icl.py +52 -0
- data/lib/libv8/scons/engine/SCons/Tool/ifl.py +72 -0
- data/lib/libv8/scons/engine/SCons/Tool/ifort.py +88 -0
- data/lib/libv8/scons/engine/SCons/Tool/ilink.py +59 -0
- data/lib/libv8/scons/engine/SCons/Tool/ilink32.py +60 -0
- data/lib/libv8/scons/engine/SCons/Tool/install.py +283 -0
- data/lib/libv8/scons/engine/SCons/Tool/intelc.py +522 -0
- data/lib/libv8/scons/engine/SCons/Tool/ipkg.py +67 -0
- data/lib/libv8/scons/engine/SCons/Tool/jar.py +116 -0
- data/lib/libv8/scons/engine/SCons/Tool/javac.py +230 -0
- data/lib/libv8/scons/engine/SCons/Tool/javah.py +137 -0
- data/lib/libv8/scons/engine/SCons/Tool/latex.py +80 -0
- data/lib/libv8/scons/engine/SCons/Tool/lex.py +97 -0
- data/lib/libv8/scons/engine/SCons/Tool/link.py +122 -0
- data/lib/libv8/scons/engine/SCons/Tool/linkloc.py +112 -0
- data/lib/libv8/scons/engine/SCons/Tool/m4.py +63 -0
- data/lib/libv8/scons/engine/SCons/Tool/masm.py +77 -0
- data/lib/libv8/scons/engine/SCons/Tool/midl.py +88 -0
- data/lib/libv8/scons/engine/SCons/Tool/mingw.py +179 -0
- data/lib/libv8/scons/engine/SCons/Tool/mslib.py +64 -0
- data/lib/libv8/scons/engine/SCons/Tool/mslink.py +318 -0
- data/lib/libv8/scons/engine/SCons/Tool/mssdk.py +50 -0
- data/lib/libv8/scons/engine/SCons/Tool/msvc.py +278 -0
- data/lib/libv8/scons/engine/SCons/Tool/msvs.py +1806 -0
- data/lib/libv8/scons/engine/SCons/Tool/mwcc.py +207 -0
- data/lib/libv8/scons/engine/SCons/Tool/mwld.py +107 -0
- data/lib/libv8/scons/engine/SCons/Tool/nasm.py +72 -0
- data/lib/libv8/scons/engine/SCons/Tool/packaging/__init__.py +312 -0
- data/lib/libv8/scons/engine/SCons/Tool/packaging/ipk.py +185 -0
- data/lib/libv8/scons/engine/SCons/Tool/packaging/msi.py +527 -0
- data/lib/libv8/scons/engine/SCons/Tool/packaging/rpm.py +365 -0
- data/lib/libv8/scons/engine/SCons/Tool/packaging/src_tarbz2.py +43 -0
- data/lib/libv8/scons/engine/SCons/Tool/packaging/src_targz.py +43 -0
- data/lib/libv8/scons/engine/SCons/Tool/packaging/src_zip.py +43 -0
- data/lib/libv8/scons/engine/SCons/Tool/packaging/tarbz2.py +44 -0
- data/lib/libv8/scons/engine/SCons/Tool/packaging/targz.py +44 -0
- data/lib/libv8/scons/engine/SCons/Tool/packaging/zip.py +44 -0
- data/lib/libv8/scons/engine/SCons/Tool/pdf.py +78 -0
- data/lib/libv8/scons/engine/SCons/Tool/pdflatex.py +84 -0
- data/lib/libv8/scons/engine/SCons/Tool/pdftex.py +109 -0
- data/lib/libv8/scons/engine/SCons/Tool/qt.py +336 -0
- data/lib/libv8/scons/engine/SCons/Tool/rmic.py +126 -0
- data/lib/libv8/scons/engine/SCons/Tool/rpcgen.py +70 -0
- data/lib/libv8/scons/engine/SCons/Tool/rpm.py +132 -0
- data/lib/libv8/scons/engine/SCons/Tool/sgiar.py +68 -0
- data/lib/libv8/scons/engine/SCons/Tool/sgic++.py +58 -0
- data/lib/libv8/scons/engine/SCons/Tool/sgicc.py +53 -0
- data/lib/libv8/scons/engine/SCons/Tool/sgilink.py +62 -0
- data/lib/libv8/scons/engine/SCons/Tool/sunar.py +67 -0
- data/lib/libv8/scons/engine/SCons/Tool/sunc++.py +142 -0
- data/lib/libv8/scons/engine/SCons/Tool/suncc.py +58 -0
- data/lib/libv8/scons/engine/SCons/Tool/sunf77.py +63 -0
- data/lib/libv8/scons/engine/SCons/Tool/sunf90.py +64 -0
- data/lib/libv8/scons/engine/SCons/Tool/sunf95.py +64 -0
- data/lib/libv8/scons/engine/SCons/Tool/sunlink.py +76 -0
- data/lib/libv8/scons/engine/SCons/Tool/swig.py +183 -0
- data/lib/libv8/scons/engine/SCons/Tool/tar.py +73 -0
- data/lib/libv8/scons/engine/SCons/Tool/tex.py +866 -0
- data/lib/libv8/scons/engine/SCons/Tool/textfile.py +175 -0
- data/lib/libv8/scons/engine/SCons/Tool/tlib.py +53 -0
- data/lib/libv8/scons/engine/SCons/Tool/wix.py +99 -0
- data/lib/libv8/scons/engine/SCons/Tool/yacc.py +140 -0
- data/lib/libv8/scons/engine/SCons/Tool/zip.py +99 -0
- data/lib/libv8/scons/engine/SCons/Util.py +1492 -0
- data/lib/libv8/scons/engine/SCons/Variables/BoolVariable.py +89 -0
- data/lib/libv8/scons/engine/SCons/Variables/EnumVariable.py +103 -0
- data/lib/libv8/scons/engine/SCons/Variables/ListVariable.py +135 -0
- data/lib/libv8/scons/engine/SCons/Variables/PackageVariable.py +106 -0
- data/lib/libv8/scons/engine/SCons/Variables/PathVariable.py +147 -0
- data/lib/libv8/scons/engine/SCons/Variables/__init__.py +312 -0
- data/lib/libv8/scons/engine/SCons/Warnings.py +246 -0
- data/lib/libv8/scons/engine/SCons/__init__.py +49 -0
- data/lib/libv8/scons/engine/SCons/compat/__init__.py +237 -0
- data/lib/libv8/scons/engine/SCons/compat/_scons_builtins.py +150 -0
- data/lib/libv8/scons/engine/SCons/compat/_scons_collections.py +45 -0
- data/lib/libv8/scons/engine/SCons/compat/_scons_dbm.py +45 -0
- data/lib/libv8/scons/engine/SCons/compat/_scons_hashlib.py +76 -0
- data/lib/libv8/scons/engine/SCons/compat/_scons_io.py +45 -0
- data/lib/libv8/scons/engine/SCons/compat/_scons_sets.py +563 -0
- data/lib/libv8/scons/engine/SCons/compat/_scons_subprocess.py +1281 -0
- data/lib/libv8/scons/engine/SCons/cpp.py +589 -0
- data/lib/libv8/scons/engine/SCons/dblite.py +254 -0
- data/lib/libv8/scons/engine/SCons/exitfuncs.py +77 -0
- data/lib/libv8/scons/os_spawnv_fix.diff +83 -0
- data/lib/libv8/scons/scons-time.1 +1017 -0
- data/lib/libv8/scons/scons.1 +15225 -0
- data/lib/libv8/scons/sconsign.1 +208 -0
- data/lib/libv8/scons/script/scons +196 -0
- data/lib/libv8/scons/script/scons-time +1544 -0
- data/lib/libv8/scons/script/scons.bat +34 -0
- data/lib/libv8/scons/script/sconsign +514 -0
- data/lib/libv8/scons/setup.cfg +5 -0
- data/lib/libv8/scons/setup.py +423 -0
- data/lib/libv8/v8/.gitignore +35 -0
- data/lib/libv8/v8/AUTHORS +44 -0
- data/lib/libv8/v8/ChangeLog +2839 -0
- data/lib/libv8/v8/LICENSE +52 -0
- data/lib/libv8/v8/LICENSE.strongtalk +29 -0
- data/lib/libv8/v8/LICENSE.v8 +26 -0
- data/lib/libv8/v8/LICENSE.valgrind +45 -0
- data/lib/libv8/v8/SConstruct +1478 -0
- data/lib/libv8/v8/build/README.txt +49 -0
- data/lib/libv8/v8/build/all.gyp +18 -0
- data/lib/libv8/v8/build/armu.gypi +32 -0
- data/lib/libv8/v8/build/common.gypi +144 -0
- data/lib/libv8/v8/build/gyp_v8 +145 -0
- data/lib/libv8/v8/include/v8-debug.h +395 -0
- data/lib/libv8/v8/include/v8-preparser.h +117 -0
- data/lib/libv8/v8/include/v8-profiler.h +505 -0
- data/lib/libv8/v8/include/v8-testing.h +104 -0
- data/lib/libv8/v8/include/v8.h +4124 -0
- data/lib/libv8/v8/include/v8stdint.h +53 -0
- data/lib/libv8/v8/preparser/SConscript +38 -0
- data/lib/libv8/v8/preparser/preparser-process.cc +379 -0
- data/lib/libv8/v8/src/SConscript +368 -0
- data/lib/libv8/v8/src/accessors.cc +767 -0
- data/lib/libv8/v8/src/accessors.h +123 -0
- data/lib/libv8/v8/src/allocation-inl.h +49 -0
- data/lib/libv8/v8/src/allocation.cc +122 -0
- data/lib/libv8/v8/src/allocation.h +143 -0
- data/lib/libv8/v8/src/api.cc +5845 -0
- data/lib/libv8/v8/src/api.h +574 -0
- data/lib/libv8/v8/src/apinatives.js +110 -0
- data/lib/libv8/v8/src/apiutils.h +73 -0
- data/lib/libv8/v8/src/arguments.h +118 -0
- data/lib/libv8/v8/src/arm/assembler-arm-inl.h +353 -0
- data/lib/libv8/v8/src/arm/assembler-arm.cc +2661 -0
- data/lib/libv8/v8/src/arm/assembler-arm.h +1375 -0
- data/lib/libv8/v8/src/arm/builtins-arm.cc +1658 -0
- data/lib/libv8/v8/src/arm/code-stubs-arm.cc +6398 -0
- data/lib/libv8/v8/src/arm/code-stubs-arm.h +673 -0
- data/lib/libv8/v8/src/arm/codegen-arm.cc +52 -0
- data/lib/libv8/v8/src/arm/codegen-arm.h +91 -0
- data/lib/libv8/v8/src/arm/constants-arm.cc +152 -0
- data/lib/libv8/v8/src/arm/constants-arm.h +775 -0
- data/lib/libv8/v8/src/arm/cpu-arm.cc +120 -0
- data/lib/libv8/v8/src/arm/debug-arm.cc +317 -0
- data/lib/libv8/v8/src/arm/deoptimizer-arm.cc +754 -0
- data/lib/libv8/v8/src/arm/disasm-arm.cc +1506 -0
- data/lib/libv8/v8/src/arm/frames-arm.cc +45 -0
- data/lib/libv8/v8/src/arm/frames-arm.h +168 -0
- data/lib/libv8/v8/src/arm/full-codegen-arm.cc +4375 -0
- data/lib/libv8/v8/src/arm/ic-arm.cc +1562 -0
- data/lib/libv8/v8/src/arm/lithium-arm.cc +2206 -0
- data/lib/libv8/v8/src/arm/lithium-arm.h +2348 -0
- data/lib/libv8/v8/src/arm/lithium-codegen-arm.cc +4526 -0
- data/lib/libv8/v8/src/arm/lithium-codegen-arm.h +403 -0
- data/lib/libv8/v8/src/arm/lithium-gap-resolver-arm.cc +305 -0
- data/lib/libv8/v8/src/arm/lithium-gap-resolver-arm.h +84 -0
- data/lib/libv8/v8/src/arm/macro-assembler-arm.cc +3163 -0
- data/lib/libv8/v8/src/arm/macro-assembler-arm.h +1126 -0
- data/lib/libv8/v8/src/arm/regexp-macro-assembler-arm.cc +1287 -0
- data/lib/libv8/v8/src/arm/regexp-macro-assembler-arm.h +253 -0
- data/lib/libv8/v8/src/arm/simulator-arm.cc +3424 -0
- data/lib/libv8/v8/src/arm/simulator-arm.h +431 -0
- data/lib/libv8/v8/src/arm/stub-cache-arm.cc +4243 -0
- data/lib/libv8/v8/src/array.js +1366 -0
- data/lib/libv8/v8/src/assembler.cc +1207 -0
- data/lib/libv8/v8/src/assembler.h +858 -0
- data/lib/libv8/v8/src/ast-inl.h +112 -0
- data/lib/libv8/v8/src/ast.cc +1146 -0
- data/lib/libv8/v8/src/ast.h +2188 -0
- data/lib/libv8/v8/src/atomicops.h +167 -0
- data/lib/libv8/v8/src/atomicops_internals_arm_gcc.h +145 -0
- data/lib/libv8/v8/src/atomicops_internals_mips_gcc.h +169 -0
- data/lib/libv8/v8/src/atomicops_internals_x86_gcc.cc +133 -0
- data/lib/libv8/v8/src/atomicops_internals_x86_gcc.h +287 -0
- data/lib/libv8/v8/src/atomicops_internals_x86_macosx.h +301 -0
- data/lib/libv8/v8/src/atomicops_internals_x86_msvc.h +203 -0
- data/lib/libv8/v8/src/bignum-dtoa.cc +655 -0
- data/lib/libv8/v8/src/bignum-dtoa.h +81 -0
- data/lib/libv8/v8/src/bignum.cc +768 -0
- data/lib/libv8/v8/src/bignum.h +140 -0
- data/lib/libv8/v8/src/bootstrapper.cc +2184 -0
- data/lib/libv8/v8/src/bootstrapper.h +188 -0
- data/lib/libv8/v8/src/builtins.cc +1707 -0
- data/lib/libv8/v8/src/builtins.h +371 -0
- data/lib/libv8/v8/src/bytecodes-irregexp.h +105 -0
- data/lib/libv8/v8/src/cached-powers.cc +177 -0
- data/lib/libv8/v8/src/cached-powers.h +65 -0
- data/lib/libv8/v8/src/char-predicates-inl.h +94 -0
- data/lib/libv8/v8/src/char-predicates.h +67 -0
- data/lib/libv8/v8/src/checks.cc +110 -0
- data/lib/libv8/v8/src/checks.h +296 -0
- data/lib/libv8/v8/src/circular-queue-inl.h +53 -0
- data/lib/libv8/v8/src/circular-queue.cc +122 -0
- data/lib/libv8/v8/src/circular-queue.h +103 -0
- data/lib/libv8/v8/src/code-stubs.cc +267 -0
- data/lib/libv8/v8/src/code-stubs.h +1011 -0
- data/lib/libv8/v8/src/code.h +70 -0
- data/lib/libv8/v8/src/codegen.cc +231 -0
- data/lib/libv8/v8/src/codegen.h +84 -0
- data/lib/libv8/v8/src/compilation-cache.cc +540 -0
- data/lib/libv8/v8/src/compilation-cache.h +287 -0
- data/lib/libv8/v8/src/compiler.cc +786 -0
- data/lib/libv8/v8/src/compiler.h +312 -0
- data/lib/libv8/v8/src/contexts.cc +347 -0
- data/lib/libv8/v8/src/contexts.h +391 -0
- data/lib/libv8/v8/src/conversions-inl.h +106 -0
- data/lib/libv8/v8/src/conversions.cc +1131 -0
- data/lib/libv8/v8/src/conversions.h +135 -0
- data/lib/libv8/v8/src/counters.cc +93 -0
- data/lib/libv8/v8/src/counters.h +254 -0
- data/lib/libv8/v8/src/cpu-profiler-inl.h +101 -0
- data/lib/libv8/v8/src/cpu-profiler.cc +609 -0
- data/lib/libv8/v8/src/cpu-profiler.h +302 -0
- data/lib/libv8/v8/src/cpu.h +69 -0
- data/lib/libv8/v8/src/d8-debug.cc +367 -0
- data/lib/libv8/v8/src/d8-debug.h +158 -0
- data/lib/libv8/v8/src/d8-posix.cc +695 -0
- data/lib/libv8/v8/src/d8-readline.cc +130 -0
- data/lib/libv8/v8/src/d8-windows.cc +42 -0
- data/lib/libv8/v8/src/d8.cc +803 -0
- data/lib/libv8/v8/src/d8.gyp +91 -0
- data/lib/libv8/v8/src/d8.h +235 -0
- data/lib/libv8/v8/src/d8.js +2798 -0
- data/lib/libv8/v8/src/data-flow.cc +66 -0
- data/lib/libv8/v8/src/data-flow.h +205 -0
- data/lib/libv8/v8/src/date.js +1103 -0
- data/lib/libv8/v8/src/dateparser-inl.h +127 -0
- data/lib/libv8/v8/src/dateparser.cc +178 -0
- data/lib/libv8/v8/src/dateparser.h +266 -0
- data/lib/libv8/v8/src/debug-agent.cc +447 -0
- data/lib/libv8/v8/src/debug-agent.h +129 -0
- data/lib/libv8/v8/src/debug-debugger.js +2569 -0
- data/lib/libv8/v8/src/debug.cc +3165 -0
- data/lib/libv8/v8/src/debug.h +1057 -0
- data/lib/libv8/v8/src/deoptimizer.cc +1256 -0
- data/lib/libv8/v8/src/deoptimizer.h +602 -0
- data/lib/libv8/v8/src/disasm.h +80 -0
- data/lib/libv8/v8/src/disassembler.cc +343 -0
- data/lib/libv8/v8/src/disassembler.h +58 -0
- data/lib/libv8/v8/src/diy-fp.cc +58 -0
- data/lib/libv8/v8/src/diy-fp.h +117 -0
- data/lib/libv8/v8/src/double.h +238 -0
- data/lib/libv8/v8/src/dtoa.cc +103 -0
- data/lib/libv8/v8/src/dtoa.h +85 -0
- data/lib/libv8/v8/src/execution.cc +849 -0
- data/lib/libv8/v8/src/execution.h +297 -0
- data/lib/libv8/v8/src/extensions/experimental/break-iterator.cc +250 -0
- data/lib/libv8/v8/src/extensions/experimental/break-iterator.h +89 -0
- data/lib/libv8/v8/src/extensions/experimental/collator.cc +218 -0
- data/lib/libv8/v8/src/extensions/experimental/collator.h +69 -0
- data/lib/libv8/v8/src/extensions/experimental/experimental.gyp +94 -0
- data/lib/libv8/v8/src/extensions/experimental/i18n-extension.cc +78 -0
- data/lib/libv8/v8/src/extensions/experimental/i18n-extension.h +54 -0
- data/lib/libv8/v8/src/extensions/experimental/i18n-locale.cc +112 -0
- data/lib/libv8/v8/src/extensions/experimental/i18n-locale.h +60 -0
- data/lib/libv8/v8/src/extensions/experimental/i18n-utils.cc +43 -0
- data/lib/libv8/v8/src/extensions/experimental/i18n-utils.h +49 -0
- data/lib/libv8/v8/src/extensions/experimental/i18n.js +180 -0
- data/lib/libv8/v8/src/extensions/experimental/language-matcher.cc +251 -0
- data/lib/libv8/v8/src/extensions/experimental/language-matcher.h +95 -0
- data/lib/libv8/v8/src/extensions/externalize-string-extension.cc +141 -0
- data/lib/libv8/v8/src/extensions/externalize-string-extension.h +50 -0
- data/lib/libv8/v8/src/extensions/gc-extension.cc +58 -0
- data/lib/libv8/v8/src/extensions/gc-extension.h +49 -0
- data/lib/libv8/v8/src/factory.cc +1222 -0
- data/lib/libv8/v8/src/factory.h +442 -0
- data/lib/libv8/v8/src/fast-dtoa.cc +736 -0
- data/lib/libv8/v8/src/fast-dtoa.h +83 -0
- data/lib/libv8/v8/src/fixed-dtoa.cc +405 -0
- data/lib/libv8/v8/src/fixed-dtoa.h +55 -0
- data/lib/libv8/v8/src/flag-definitions.h +560 -0
- data/lib/libv8/v8/src/flags.cc +551 -0
- data/lib/libv8/v8/src/flags.h +79 -0
- data/lib/libv8/v8/src/frames-inl.h +247 -0
- data/lib/libv8/v8/src/frames.cc +1243 -0
- data/lib/libv8/v8/src/frames.h +870 -0
- data/lib/libv8/v8/src/full-codegen.cc +1374 -0
- data/lib/libv8/v8/src/full-codegen.h +771 -0
- data/lib/libv8/v8/src/func-name-inferrer.cc +92 -0
- data/lib/libv8/v8/src/func-name-inferrer.h +111 -0
- data/lib/libv8/v8/src/gdb-jit.cc +1555 -0
- data/lib/libv8/v8/src/gdb-jit.h +143 -0
- data/lib/libv8/v8/src/global-handles.cc +665 -0
- data/lib/libv8/v8/src/global-handles.h +284 -0
- data/lib/libv8/v8/src/globals.h +325 -0
- data/lib/libv8/v8/src/handles-inl.h +177 -0
- data/lib/libv8/v8/src/handles.cc +987 -0
- data/lib/libv8/v8/src/handles.h +382 -0
- data/lib/libv8/v8/src/hashmap.cc +230 -0
- data/lib/libv8/v8/src/hashmap.h +123 -0
- data/lib/libv8/v8/src/heap-inl.h +704 -0
- data/lib/libv8/v8/src/heap-profiler.cc +1173 -0
- data/lib/libv8/v8/src/heap-profiler.h +397 -0
- data/lib/libv8/v8/src/heap.cc +5930 -0
- data/lib/libv8/v8/src/heap.h +2268 -0
- data/lib/libv8/v8/src/hydrogen-instructions.cc +1769 -0
- data/lib/libv8/v8/src/hydrogen-instructions.h +3971 -0
- data/lib/libv8/v8/src/hydrogen.cc +6239 -0
- data/lib/libv8/v8/src/hydrogen.h +1202 -0
- data/lib/libv8/v8/src/ia32/assembler-ia32-inl.h +446 -0
- data/lib/libv8/v8/src/ia32/assembler-ia32.cc +2487 -0
- data/lib/libv8/v8/src/ia32/assembler-ia32.h +1144 -0
- data/lib/libv8/v8/src/ia32/builtins-ia32.cc +1621 -0
- data/lib/libv8/v8/src/ia32/code-stubs-ia32.cc +6198 -0
- data/lib/libv8/v8/src/ia32/code-stubs-ia32.h +517 -0
- data/lib/libv8/v8/src/ia32/codegen-ia32.cc +265 -0
- data/lib/libv8/v8/src/ia32/codegen-ia32.h +79 -0
- data/lib/libv8/v8/src/ia32/cpu-ia32.cc +88 -0
- data/lib/libv8/v8/src/ia32/debug-ia32.cc +312 -0
- data/lib/libv8/v8/src/ia32/deoptimizer-ia32.cc +774 -0
- data/lib/libv8/v8/src/ia32/disasm-ia32.cc +1628 -0
- data/lib/libv8/v8/src/ia32/frames-ia32.cc +45 -0
- data/lib/libv8/v8/src/ia32/frames-ia32.h +142 -0
- data/lib/libv8/v8/src/ia32/full-codegen-ia32.cc +4338 -0
- data/lib/libv8/v8/src/ia32/ic-ia32.cc +1597 -0
- data/lib/libv8/v8/src/ia32/lithium-codegen-ia32.cc +4461 -0
- data/lib/libv8/v8/src/ia32/lithium-codegen-ia32.h +375 -0
- data/lib/libv8/v8/src/ia32/lithium-gap-resolver-ia32.cc +475 -0
- data/lib/libv8/v8/src/ia32/lithium-gap-resolver-ia32.h +110 -0
- data/lib/libv8/v8/src/ia32/lithium-ia32.cc +2261 -0
- data/lib/libv8/v8/src/ia32/lithium-ia32.h +2396 -0
- data/lib/libv8/v8/src/ia32/macro-assembler-ia32.cc +2136 -0
- data/lib/libv8/v8/src/ia32/macro-assembler-ia32.h +775 -0
- data/lib/libv8/v8/src/ia32/regexp-macro-assembler-ia32.cc +1263 -0
- data/lib/libv8/v8/src/ia32/regexp-macro-assembler-ia32.h +216 -0
- data/lib/libv8/v8/src/ia32/simulator-ia32.cc +30 -0
- data/lib/libv8/v8/src/ia32/simulator-ia32.h +74 -0
- data/lib/libv8/v8/src/ia32/stub-cache-ia32.cc +3847 -0
- data/lib/libv8/v8/src/ic-inl.h +130 -0
- data/lib/libv8/v8/src/ic.cc +2577 -0
- data/lib/libv8/v8/src/ic.h +736 -0
- data/lib/libv8/v8/src/inspector.cc +63 -0
- data/lib/libv8/v8/src/inspector.h +62 -0
- data/lib/libv8/v8/src/interpreter-irregexp.cc +659 -0
- data/lib/libv8/v8/src/interpreter-irregexp.h +49 -0
- data/lib/libv8/v8/src/isolate-inl.h +50 -0
- data/lib/libv8/v8/src/isolate.cc +1869 -0
- data/lib/libv8/v8/src/isolate.h +1382 -0
- data/lib/libv8/v8/src/json-parser.cc +504 -0
- data/lib/libv8/v8/src/json-parser.h +161 -0
- data/lib/libv8/v8/src/json.js +342 -0
- data/lib/libv8/v8/src/jsregexp.cc +5385 -0
- data/lib/libv8/v8/src/jsregexp.h +1492 -0
- data/lib/libv8/v8/src/list-inl.h +212 -0
- data/lib/libv8/v8/src/list.h +174 -0
- data/lib/libv8/v8/src/lithium-allocator-inl.h +142 -0
- data/lib/libv8/v8/src/lithium-allocator.cc +2123 -0
- data/lib/libv8/v8/src/lithium-allocator.h +630 -0
- data/lib/libv8/v8/src/lithium.cc +190 -0
- data/lib/libv8/v8/src/lithium.h +597 -0
- data/lib/libv8/v8/src/liveedit-debugger.js +1082 -0
- data/lib/libv8/v8/src/liveedit.cc +1691 -0
- data/lib/libv8/v8/src/liveedit.h +180 -0
- data/lib/libv8/v8/src/liveobjectlist-inl.h +126 -0
- data/lib/libv8/v8/src/liveobjectlist.cc +2589 -0
- data/lib/libv8/v8/src/liveobjectlist.h +322 -0
- data/lib/libv8/v8/src/log-inl.h +59 -0
- data/lib/libv8/v8/src/log-utils.cc +428 -0
- data/lib/libv8/v8/src/log-utils.h +231 -0
- data/lib/libv8/v8/src/log.cc +1993 -0
- data/lib/libv8/v8/src/log.h +476 -0
- data/lib/libv8/v8/src/macro-assembler.h +120 -0
- data/lib/libv8/v8/src/macros.py +178 -0
- data/lib/libv8/v8/src/mark-compact.cc +3143 -0
- data/lib/libv8/v8/src/mark-compact.h +506 -0
- data/lib/libv8/v8/src/math.js +264 -0
- data/lib/libv8/v8/src/messages.cc +179 -0
- data/lib/libv8/v8/src/messages.h +113 -0
- data/lib/libv8/v8/src/messages.js +1096 -0
- data/lib/libv8/v8/src/mips/assembler-mips-inl.h +312 -0
- data/lib/libv8/v8/src/mips/assembler-mips.cc +1960 -0
- data/lib/libv8/v8/src/mips/assembler-mips.h +1138 -0
- data/lib/libv8/v8/src/mips/builtins-mips.cc +1628 -0
- data/lib/libv8/v8/src/mips/code-stubs-mips.cc +6656 -0
- data/lib/libv8/v8/src/mips/code-stubs-mips.h +682 -0
- data/lib/libv8/v8/src/mips/codegen-mips.cc +52 -0
- data/lib/libv8/v8/src/mips/codegen-mips.h +98 -0
- data/lib/libv8/v8/src/mips/constants-mips.cc +352 -0
- data/lib/libv8/v8/src/mips/constants-mips.h +739 -0
- data/lib/libv8/v8/src/mips/cpu-mips.cc +96 -0
- data/lib/libv8/v8/src/mips/debug-mips.cc +308 -0
- data/lib/libv8/v8/src/mips/deoptimizer-mips.cc +91 -0
- data/lib/libv8/v8/src/mips/disasm-mips.cc +1050 -0
- data/lib/libv8/v8/src/mips/frames-mips.cc +47 -0
- data/lib/libv8/v8/src/mips/frames-mips.h +219 -0
- data/lib/libv8/v8/src/mips/full-codegen-mips.cc +4388 -0
- data/lib/libv8/v8/src/mips/ic-mips.cc +1580 -0
- data/lib/libv8/v8/src/mips/lithium-codegen-mips.h +65 -0
- data/lib/libv8/v8/src/mips/lithium-mips.h +307 -0
- data/lib/libv8/v8/src/mips/macro-assembler-mips.cc +4056 -0
- data/lib/libv8/v8/src/mips/macro-assembler-mips.h +1214 -0
- data/lib/libv8/v8/src/mips/regexp-macro-assembler-mips.cc +1251 -0
- data/lib/libv8/v8/src/mips/regexp-macro-assembler-mips.h +252 -0
- data/lib/libv8/v8/src/mips/simulator-mips.cc +2621 -0
- data/lib/libv8/v8/src/mips/simulator-mips.h +401 -0
- data/lib/libv8/v8/src/mips/stub-cache-mips.cc +4285 -0
- data/lib/libv8/v8/src/mirror-debugger.js +2382 -0
- data/lib/libv8/v8/src/mksnapshot.cc +328 -0
- data/lib/libv8/v8/src/natives.h +64 -0
- data/lib/libv8/v8/src/objects-debug.cc +738 -0
- data/lib/libv8/v8/src/objects-inl.h +4323 -0
- data/lib/libv8/v8/src/objects-printer.cc +829 -0
- data/lib/libv8/v8/src/objects-visiting.cc +148 -0
- data/lib/libv8/v8/src/objects-visiting.h +424 -0
- data/lib/libv8/v8/src/objects.cc +10585 -0
- data/lib/libv8/v8/src/objects.h +6838 -0
- data/lib/libv8/v8/src/parser.cc +4997 -0
- data/lib/libv8/v8/src/parser.h +765 -0
- data/lib/libv8/v8/src/platform-cygwin.cc +779 -0
- data/lib/libv8/v8/src/platform-freebsd.cc +826 -0
- data/lib/libv8/v8/src/platform-linux.cc +1149 -0
- data/lib/libv8/v8/src/platform-macos.cc +830 -0
- data/lib/libv8/v8/src/platform-nullos.cc +479 -0
- data/lib/libv8/v8/src/platform-openbsd.cc +640 -0
- data/lib/libv8/v8/src/platform-posix.cc +424 -0
- data/lib/libv8/v8/src/platform-solaris.cc +762 -0
- data/lib/libv8/v8/src/platform-tls-mac.h +62 -0
- data/lib/libv8/v8/src/platform-tls-win32.h +62 -0
- data/lib/libv8/v8/src/platform-tls.h +50 -0
- data/lib/libv8/v8/src/platform-win32.cc +2021 -0
- data/lib/libv8/v8/src/platform.h +667 -0
- data/lib/libv8/v8/src/preparse-data-format.h +62 -0
- data/lib/libv8/v8/src/preparse-data.cc +183 -0
- data/lib/libv8/v8/src/preparse-data.h +225 -0
- data/lib/libv8/v8/src/preparser-api.cc +220 -0
- data/lib/libv8/v8/src/preparser.cc +1450 -0
- data/lib/libv8/v8/src/preparser.h +493 -0
- data/lib/libv8/v8/src/prettyprinter.cc +1493 -0
- data/lib/libv8/v8/src/prettyprinter.h +223 -0
- data/lib/libv8/v8/src/profile-generator-inl.h +128 -0
- data/lib/libv8/v8/src/profile-generator.cc +3098 -0
- data/lib/libv8/v8/src/profile-generator.h +1126 -0
- data/lib/libv8/v8/src/property.cc +105 -0
- data/lib/libv8/v8/src/property.h +365 -0
- data/lib/libv8/v8/src/proxy.js +83 -0
- data/lib/libv8/v8/src/regexp-macro-assembler-irregexp-inl.h +78 -0
- data/lib/libv8/v8/src/regexp-macro-assembler-irregexp.cc +471 -0
- data/lib/libv8/v8/src/regexp-macro-assembler-irregexp.h +142 -0
- data/lib/libv8/v8/src/regexp-macro-assembler-tracer.cc +373 -0
- data/lib/libv8/v8/src/regexp-macro-assembler-tracer.h +104 -0
- data/lib/libv8/v8/src/regexp-macro-assembler.cc +267 -0
- data/lib/libv8/v8/src/regexp-macro-assembler.h +243 -0
- data/lib/libv8/v8/src/regexp-stack.cc +111 -0
- data/lib/libv8/v8/src/regexp-stack.h +147 -0
- data/lib/libv8/v8/src/regexp.js +483 -0
- data/lib/libv8/v8/src/rewriter.cc +360 -0
- data/lib/libv8/v8/src/rewriter.h +50 -0
- data/lib/libv8/v8/src/runtime-profiler.cc +489 -0
- data/lib/libv8/v8/src/runtime-profiler.h +201 -0
- data/lib/libv8/v8/src/runtime.cc +12227 -0
- data/lib/libv8/v8/src/runtime.h +652 -0
- data/lib/libv8/v8/src/runtime.js +649 -0
- data/lib/libv8/v8/src/safepoint-table.cc +256 -0
- data/lib/libv8/v8/src/safepoint-table.h +270 -0
- data/lib/libv8/v8/src/scanner-base.cc +952 -0
- data/lib/libv8/v8/src/scanner-base.h +670 -0
- data/lib/libv8/v8/src/scanner.cc +345 -0
- data/lib/libv8/v8/src/scanner.h +146 -0
- data/lib/libv8/v8/src/scopeinfo.cc +646 -0
- data/lib/libv8/v8/src/scopeinfo.h +254 -0
- data/lib/libv8/v8/src/scopes.cc +1150 -0
- data/lib/libv8/v8/src/scopes.h +507 -0
- data/lib/libv8/v8/src/serialize.cc +1574 -0
- data/lib/libv8/v8/src/serialize.h +589 -0
- data/lib/libv8/v8/src/shell.h +55 -0
- data/lib/libv8/v8/src/simulator.h +43 -0
- data/lib/libv8/v8/src/small-pointer-list.h +163 -0
- data/lib/libv8/v8/src/smart-pointer.h +109 -0
- data/lib/libv8/v8/src/snapshot-common.cc +83 -0
- data/lib/libv8/v8/src/snapshot-empty.cc +54 -0
- data/lib/libv8/v8/src/snapshot.h +91 -0
- data/lib/libv8/v8/src/spaces-inl.h +529 -0
- data/lib/libv8/v8/src/spaces.cc +3145 -0
- data/lib/libv8/v8/src/spaces.h +2369 -0
- data/lib/libv8/v8/src/splay-tree-inl.h +310 -0
- data/lib/libv8/v8/src/splay-tree.h +205 -0
- data/lib/libv8/v8/src/string-search.cc +41 -0
- data/lib/libv8/v8/src/string-search.h +568 -0
- data/lib/libv8/v8/src/string-stream.cc +592 -0
- data/lib/libv8/v8/src/string-stream.h +191 -0
- data/lib/libv8/v8/src/string.js +994 -0
- data/lib/libv8/v8/src/strtod.cc +440 -0
- data/lib/libv8/v8/src/strtod.h +40 -0
- data/lib/libv8/v8/src/stub-cache.cc +1965 -0
- data/lib/libv8/v8/src/stub-cache.h +924 -0
- data/lib/libv8/v8/src/third_party/valgrind/valgrind.h +3925 -0
- data/lib/libv8/v8/src/token.cc +63 -0
- data/lib/libv8/v8/src/token.h +288 -0
- data/lib/libv8/v8/src/type-info.cc +507 -0
- data/lib/libv8/v8/src/type-info.h +272 -0
- data/lib/libv8/v8/src/unbound-queue-inl.h +95 -0
- data/lib/libv8/v8/src/unbound-queue.h +69 -0
- data/lib/libv8/v8/src/unicode-inl.h +238 -0
- data/lib/libv8/v8/src/unicode.cc +1624 -0
- data/lib/libv8/v8/src/unicode.h +280 -0
- data/lib/libv8/v8/src/uri.js +408 -0
- data/lib/libv8/v8/src/utils-inl.h +48 -0
- data/lib/libv8/v8/src/utils.cc +371 -0
- data/lib/libv8/v8/src/utils.h +800 -0
- data/lib/libv8/v8/src/v8-counters.cc +62 -0
- data/lib/libv8/v8/src/v8-counters.h +314 -0
- data/lib/libv8/v8/src/v8.cc +213 -0
- data/lib/libv8/v8/src/v8.h +131 -0
- data/lib/libv8/v8/src/v8checks.h +64 -0
- data/lib/libv8/v8/src/v8dll-main.cc +44 -0
- data/lib/libv8/v8/src/v8globals.h +512 -0
- data/lib/libv8/v8/src/v8memory.h +82 -0
- data/lib/libv8/v8/src/v8natives.js +1310 -0
- data/lib/libv8/v8/src/v8preparserdll-main.cc +39 -0
- data/lib/libv8/v8/src/v8threads.cc +464 -0
- data/lib/libv8/v8/src/v8threads.h +165 -0
- data/lib/libv8/v8/src/v8utils.h +319 -0
- data/lib/libv8/v8/src/variables.cc +114 -0
- data/lib/libv8/v8/src/variables.h +167 -0
- data/lib/libv8/v8/src/version.cc +116 -0
- data/lib/libv8/v8/src/version.h +68 -0
- data/lib/libv8/v8/src/vm-state-inl.h +138 -0
- data/lib/libv8/v8/src/vm-state.h +71 -0
- data/lib/libv8/v8/src/win32-headers.h +96 -0
- data/lib/libv8/v8/src/x64/assembler-x64-inl.h +462 -0
- data/lib/libv8/v8/src/x64/assembler-x64.cc +3027 -0
- data/lib/libv8/v8/src/x64/assembler-x64.h +1633 -0
- data/lib/libv8/v8/src/x64/builtins-x64.cc +1520 -0
- data/lib/libv8/v8/src/x64/code-stubs-x64.cc +5132 -0
- data/lib/libv8/v8/src/x64/code-stubs-x64.h +514 -0
- data/lib/libv8/v8/src/x64/codegen-x64.cc +146 -0
- data/lib/libv8/v8/src/x64/codegen-x64.h +76 -0
- data/lib/libv8/v8/src/x64/cpu-x64.cc +88 -0
- data/lib/libv8/v8/src/x64/debug-x64.cc +319 -0
- data/lib/libv8/v8/src/x64/deoptimizer-x64.cc +815 -0
- data/lib/libv8/v8/src/x64/disasm-x64.cc +1832 -0
- data/lib/libv8/v8/src/x64/frames-x64.cc +45 -0
- data/lib/libv8/v8/src/x64/frames-x64.h +130 -0
- data/lib/libv8/v8/src/x64/full-codegen-x64.cc +4318 -0
- data/lib/libv8/v8/src/x64/ic-x64.cc +1608 -0
- data/lib/libv8/v8/src/x64/lithium-codegen-x64.cc +4267 -0
- data/lib/libv8/v8/src/x64/lithium-codegen-x64.h +367 -0
- data/lib/libv8/v8/src/x64/lithium-gap-resolver-x64.cc +320 -0
- data/lib/libv8/v8/src/x64/lithium-gap-resolver-x64.h +74 -0
- data/lib/libv8/v8/src/x64/lithium-x64.cc +2202 -0
- data/lib/libv8/v8/src/x64/lithium-x64.h +2333 -0
- data/lib/libv8/v8/src/x64/macro-assembler-x64.cc +3745 -0
- data/lib/libv8/v8/src/x64/macro-assembler-x64.h +1290 -0
- data/lib/libv8/v8/src/x64/regexp-macro-assembler-x64.cc +1398 -0
- data/lib/libv8/v8/src/x64/regexp-macro-assembler-x64.h +282 -0
- data/lib/libv8/v8/src/x64/simulator-x64.cc +27 -0
- data/lib/libv8/v8/src/x64/simulator-x64.h +72 -0
- data/lib/libv8/v8/src/x64/stub-cache-x64.cc +3610 -0
- data/lib/libv8/v8/src/zone-inl.h +140 -0
- data/lib/libv8/v8/src/zone.cc +196 -0
- data/lib/libv8/v8/src/zone.h +240 -0
- data/lib/libv8/v8/tools/codemap.js +265 -0
- data/lib/libv8/v8/tools/consarray.js +93 -0
- data/lib/libv8/v8/tools/csvparser.js +78 -0
- data/lib/libv8/v8/tools/disasm.py +92 -0
- data/lib/libv8/v8/tools/freebsd-tick-processor +10 -0
- data/lib/libv8/v8/tools/gc-nvp-trace-processor.py +342 -0
- data/lib/libv8/v8/tools/gcmole/README +62 -0
- data/lib/libv8/v8/tools/gcmole/gccause.lua +60 -0
- data/lib/libv8/v8/tools/gcmole/gcmole.cc +1261 -0
- data/lib/libv8/v8/tools/gcmole/gcmole.lua +378 -0
- data/lib/libv8/v8/tools/generate-ten-powers.scm +286 -0
- data/lib/libv8/v8/tools/grokdump.py +841 -0
- data/lib/libv8/v8/tools/gyp/v8.gyp +995 -0
- data/lib/libv8/v8/tools/js2c.py +364 -0
- data/lib/libv8/v8/tools/jsmin.py +280 -0
- data/lib/libv8/v8/tools/linux-tick-processor +35 -0
- data/lib/libv8/v8/tools/ll_prof.py +942 -0
- data/lib/libv8/v8/tools/logreader.js +185 -0
- data/lib/libv8/v8/tools/mac-nm +18 -0
- data/lib/libv8/v8/tools/mac-tick-processor +6 -0
- data/lib/libv8/v8/tools/oom_dump/README +31 -0
- data/lib/libv8/v8/tools/oom_dump/SConstruct +42 -0
- data/lib/libv8/v8/tools/oom_dump/oom_dump.cc +288 -0
- data/lib/libv8/v8/tools/presubmit.py +305 -0
- data/lib/libv8/v8/tools/process-heap-prof.py +120 -0
- data/lib/libv8/v8/tools/profile.js +751 -0
- data/lib/libv8/v8/tools/profile_view.js +219 -0
- data/lib/libv8/v8/tools/run-valgrind.py +77 -0
- data/lib/libv8/v8/tools/splaytree.js +316 -0
- data/lib/libv8/v8/tools/stats-viewer.py +468 -0
- data/lib/libv8/v8/tools/test.py +1510 -0
- data/lib/libv8/v8/tools/tickprocessor-driver.js +59 -0
- data/lib/libv8/v8/tools/tickprocessor.js +877 -0
- data/lib/libv8/v8/tools/utils.py +96 -0
- data/lib/libv8/v8/tools/visual_studio/README.txt +12 -0
- data/lib/libv8/v8/tools/windows-tick-processor.bat +30 -0
- data/lib/libv8/version.rb +6 -0
- data/libv8.gemspec +36 -0
- data/thefrontside.png +0 -0
- metadata +776 -0
@@ -0,0 +1,1131 @@
|
|
1
|
+
// Copyright 2011 the V8 project authors. All rights reserved.
|
2
|
+
// Redistribution and use in source and binary forms, with or without
|
3
|
+
// modification, are permitted provided that the following conditions are
|
4
|
+
// met:
|
5
|
+
//
|
6
|
+
// * Redistributions of source code must retain the above copyright
|
7
|
+
// notice, this list of conditions and the following disclaimer.
|
8
|
+
// * Redistributions in binary form must reproduce the above
|
9
|
+
// copyright notice, this list of conditions and the following
|
10
|
+
// disclaimer in the documentation and/or other materials provided
|
11
|
+
// with the distribution.
|
12
|
+
// * Neither the name of Google Inc. nor the names of its
|
13
|
+
// contributors may be used to endorse or promote products derived
|
14
|
+
// from this software without specific prior written permission.
|
15
|
+
//
|
16
|
+
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
17
|
+
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
18
|
+
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
19
|
+
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
20
|
+
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
21
|
+
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
22
|
+
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
23
|
+
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
24
|
+
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
25
|
+
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
26
|
+
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
27
|
+
|
28
|
+
#include <stdarg.h>
|
29
|
+
#include <limits.h>
|
30
|
+
|
31
|
+
#include "v8.h"
|
32
|
+
|
33
|
+
#include "conversions-inl.h"
|
34
|
+
#include "dtoa.h"
|
35
|
+
#include "factory.h"
|
36
|
+
#include "scanner-base.h"
|
37
|
+
#include "strtod.h"
|
38
|
+
|
39
|
+
namespace v8 {
|
40
|
+
namespace internal {
|
41
|
+
|
42
|
+
namespace {
|
43
|
+
|
44
|
+
// C++-style iterator adaptor for StringInputBuffer
|
45
|
+
// (unlike C++ iterators the end-marker has different type).
|
46
|
+
class StringInputBufferIterator {
|
47
|
+
public:
|
48
|
+
class EndMarker {};
|
49
|
+
|
50
|
+
explicit StringInputBufferIterator(StringInputBuffer* buffer);
|
51
|
+
|
52
|
+
int operator*() const;
|
53
|
+
void operator++();
|
54
|
+
bool operator==(EndMarker const&) const { return end_; }
|
55
|
+
bool operator!=(EndMarker const& m) const { return !end_; }
|
56
|
+
|
57
|
+
private:
|
58
|
+
StringInputBuffer* const buffer_;
|
59
|
+
int current_;
|
60
|
+
bool end_;
|
61
|
+
};
|
62
|
+
|
63
|
+
|
64
|
+
StringInputBufferIterator::StringInputBufferIterator(
|
65
|
+
StringInputBuffer* buffer) : buffer_(buffer) {
|
66
|
+
++(*this);
|
67
|
+
}
|
68
|
+
|
69
|
+
int StringInputBufferIterator::operator*() const {
|
70
|
+
return current_;
|
71
|
+
}
|
72
|
+
|
73
|
+
|
74
|
+
void StringInputBufferIterator::operator++() {
|
75
|
+
end_ = !buffer_->has_more();
|
76
|
+
if (!end_) {
|
77
|
+
current_ = buffer_->GetNext();
|
78
|
+
}
|
79
|
+
}
|
80
|
+
}
|
81
|
+
|
82
|
+
|
83
|
+
template <class Iterator, class EndMark>
|
84
|
+
static bool SubStringEquals(Iterator* current,
|
85
|
+
EndMark end,
|
86
|
+
const char* substring) {
|
87
|
+
ASSERT(**current == *substring);
|
88
|
+
for (substring++; *substring != '\0'; substring++) {
|
89
|
+
++*current;
|
90
|
+
if (*current == end || **current != *substring) return false;
|
91
|
+
}
|
92
|
+
++*current;
|
93
|
+
return true;
|
94
|
+
}
|
95
|
+
|
96
|
+
|
97
|
+
// Maximum number of significant digits in decimal representation.
|
98
|
+
// The longest possible double in decimal representation is
|
99
|
+
// (2^53 - 1) * 2 ^ -1074 that is (2 ^ 53 - 1) * 5 ^ 1074 / 10 ^ 1074
|
100
|
+
// (768 digits). If we parse a number whose first digits are equal to a
|
101
|
+
// mean of 2 adjacent doubles (that could have up to 769 digits) the result
|
102
|
+
// must be rounded to the bigger one unless the tail consists of zeros, so
|
103
|
+
// we don't need to preserve all the digits.
|
104
|
+
const int kMaxSignificantDigits = 772;
|
105
|
+
|
106
|
+
|
107
|
+
static const double JUNK_STRING_VALUE = OS::nan_value();
|
108
|
+
|
109
|
+
|
110
|
+
// Returns true if a nonspace found and false if the end has reached.
|
111
|
+
template <class Iterator, class EndMark>
|
112
|
+
static inline bool AdvanceToNonspace(UnicodeCache* unicode_cache,
|
113
|
+
Iterator* current,
|
114
|
+
EndMark end) {
|
115
|
+
while (*current != end) {
|
116
|
+
if (!unicode_cache->IsWhiteSpace(**current)) return true;
|
117
|
+
++*current;
|
118
|
+
}
|
119
|
+
return false;
|
120
|
+
}
|
121
|
+
|
122
|
+
|
123
|
+
static bool isDigit(int x, int radix) {
|
124
|
+
return (x >= '0' && x <= '9' && x < '0' + radix)
|
125
|
+
|| (radix > 10 && x >= 'a' && x < 'a' + radix - 10)
|
126
|
+
|| (radix > 10 && x >= 'A' && x < 'A' + radix - 10);
|
127
|
+
}
|
128
|
+
|
129
|
+
|
130
|
+
static double SignedZero(bool negative) {
|
131
|
+
return negative ? -0.0 : 0.0;
|
132
|
+
}
|
133
|
+
|
134
|
+
|
135
|
+
// Parsing integers with radix 2, 4, 8, 16, 32. Assumes current != end.
|
136
|
+
template <int radix_log_2, class Iterator, class EndMark>
|
137
|
+
static double InternalStringToIntDouble(UnicodeCache* unicode_cache,
|
138
|
+
Iterator current,
|
139
|
+
EndMark end,
|
140
|
+
bool negative,
|
141
|
+
bool allow_trailing_junk) {
|
142
|
+
ASSERT(current != end);
|
143
|
+
|
144
|
+
// Skip leading 0s.
|
145
|
+
while (*current == '0') {
|
146
|
+
++current;
|
147
|
+
if (current == end) return SignedZero(negative);
|
148
|
+
}
|
149
|
+
|
150
|
+
int64_t number = 0;
|
151
|
+
int exponent = 0;
|
152
|
+
const int radix = (1 << radix_log_2);
|
153
|
+
|
154
|
+
do {
|
155
|
+
int digit;
|
156
|
+
if (*current >= '0' && *current <= '9' && *current < '0' + radix) {
|
157
|
+
digit = static_cast<char>(*current) - '0';
|
158
|
+
} else if (radix > 10 && *current >= 'a' && *current < 'a' + radix - 10) {
|
159
|
+
digit = static_cast<char>(*current) - 'a' + 10;
|
160
|
+
} else if (radix > 10 && *current >= 'A' && *current < 'A' + radix - 10) {
|
161
|
+
digit = static_cast<char>(*current) - 'A' + 10;
|
162
|
+
} else {
|
163
|
+
if (allow_trailing_junk ||
|
164
|
+
!AdvanceToNonspace(unicode_cache, ¤t, end)) {
|
165
|
+
break;
|
166
|
+
} else {
|
167
|
+
return JUNK_STRING_VALUE;
|
168
|
+
}
|
169
|
+
}
|
170
|
+
|
171
|
+
number = number * radix + digit;
|
172
|
+
int overflow = static_cast<int>(number >> 53);
|
173
|
+
if (overflow != 0) {
|
174
|
+
// Overflow occurred. Need to determine which direction to round the
|
175
|
+
// result.
|
176
|
+
int overflow_bits_count = 1;
|
177
|
+
while (overflow > 1) {
|
178
|
+
overflow_bits_count++;
|
179
|
+
overflow >>= 1;
|
180
|
+
}
|
181
|
+
|
182
|
+
int dropped_bits_mask = ((1 << overflow_bits_count) - 1);
|
183
|
+
int dropped_bits = static_cast<int>(number) & dropped_bits_mask;
|
184
|
+
number >>= overflow_bits_count;
|
185
|
+
exponent = overflow_bits_count;
|
186
|
+
|
187
|
+
bool zero_tail = true;
|
188
|
+
while (true) {
|
189
|
+
++current;
|
190
|
+
if (current == end || !isDigit(*current, radix)) break;
|
191
|
+
zero_tail = zero_tail && *current == '0';
|
192
|
+
exponent += radix_log_2;
|
193
|
+
}
|
194
|
+
|
195
|
+
if (!allow_trailing_junk &&
|
196
|
+
AdvanceToNonspace(unicode_cache, ¤t, end)) {
|
197
|
+
return JUNK_STRING_VALUE;
|
198
|
+
}
|
199
|
+
|
200
|
+
int middle_value = (1 << (overflow_bits_count - 1));
|
201
|
+
if (dropped_bits > middle_value) {
|
202
|
+
number++; // Rounding up.
|
203
|
+
} else if (dropped_bits == middle_value) {
|
204
|
+
// Rounding to even to consistency with decimals: half-way case rounds
|
205
|
+
// up if significant part is odd and down otherwise.
|
206
|
+
if ((number & 1) != 0 || !zero_tail) {
|
207
|
+
number++; // Rounding up.
|
208
|
+
}
|
209
|
+
}
|
210
|
+
|
211
|
+
// Rounding up may cause overflow.
|
212
|
+
if ((number & ((int64_t)1 << 53)) != 0) {
|
213
|
+
exponent++;
|
214
|
+
number >>= 1;
|
215
|
+
}
|
216
|
+
break;
|
217
|
+
}
|
218
|
+
++current;
|
219
|
+
} while (current != end);
|
220
|
+
|
221
|
+
ASSERT(number < ((int64_t)1 << 53));
|
222
|
+
ASSERT(static_cast<int64_t>(static_cast<double>(number)) == number);
|
223
|
+
|
224
|
+
if (exponent == 0) {
|
225
|
+
if (negative) {
|
226
|
+
if (number == 0) return -0.0;
|
227
|
+
number = -number;
|
228
|
+
}
|
229
|
+
return static_cast<double>(number);
|
230
|
+
}
|
231
|
+
|
232
|
+
ASSERT(number != 0);
|
233
|
+
// The double could be constructed faster from number (mantissa), exponent
|
234
|
+
// and sign. Assuming it's a rare case more simple code is used.
|
235
|
+
return static_cast<double>(negative ? -number : number) * pow(2.0, exponent);
|
236
|
+
}
|
237
|
+
|
238
|
+
|
239
|
+
template <class Iterator, class EndMark>
|
240
|
+
static double InternalStringToInt(UnicodeCache* unicode_cache,
|
241
|
+
Iterator current,
|
242
|
+
EndMark end,
|
243
|
+
int radix) {
|
244
|
+
const bool allow_trailing_junk = true;
|
245
|
+
const double empty_string_val = JUNK_STRING_VALUE;
|
246
|
+
|
247
|
+
if (!AdvanceToNonspace(unicode_cache, ¤t, end)) {
|
248
|
+
return empty_string_val;
|
249
|
+
}
|
250
|
+
|
251
|
+
bool negative = false;
|
252
|
+
bool leading_zero = false;
|
253
|
+
|
254
|
+
if (*current == '+') {
|
255
|
+
// Ignore leading sign; skip following spaces.
|
256
|
+
++current;
|
257
|
+
if (current == end) {
|
258
|
+
return JUNK_STRING_VALUE;
|
259
|
+
}
|
260
|
+
} else if (*current == '-') {
|
261
|
+
++current;
|
262
|
+
if (current == end) {
|
263
|
+
return JUNK_STRING_VALUE;
|
264
|
+
}
|
265
|
+
negative = true;
|
266
|
+
}
|
267
|
+
|
268
|
+
if (radix == 0) {
|
269
|
+
// Radix detection.
|
270
|
+
if (*current == '0') {
|
271
|
+
++current;
|
272
|
+
if (current == end) return SignedZero(negative);
|
273
|
+
if (*current == 'x' || *current == 'X') {
|
274
|
+
radix = 16;
|
275
|
+
++current;
|
276
|
+
if (current == end) return JUNK_STRING_VALUE;
|
277
|
+
} else {
|
278
|
+
radix = 8;
|
279
|
+
leading_zero = true;
|
280
|
+
}
|
281
|
+
} else {
|
282
|
+
radix = 10;
|
283
|
+
}
|
284
|
+
} else if (radix == 16) {
|
285
|
+
if (*current == '0') {
|
286
|
+
// Allow "0x" prefix.
|
287
|
+
++current;
|
288
|
+
if (current == end) return SignedZero(negative);
|
289
|
+
if (*current == 'x' || *current == 'X') {
|
290
|
+
++current;
|
291
|
+
if (current == end) return JUNK_STRING_VALUE;
|
292
|
+
} else {
|
293
|
+
leading_zero = true;
|
294
|
+
}
|
295
|
+
}
|
296
|
+
}
|
297
|
+
|
298
|
+
if (radix < 2 || radix > 36) return JUNK_STRING_VALUE;
|
299
|
+
|
300
|
+
// Skip leading zeros.
|
301
|
+
while (*current == '0') {
|
302
|
+
leading_zero = true;
|
303
|
+
++current;
|
304
|
+
if (current == end) return SignedZero(negative);
|
305
|
+
}
|
306
|
+
|
307
|
+
if (!leading_zero && !isDigit(*current, radix)) {
|
308
|
+
return JUNK_STRING_VALUE;
|
309
|
+
}
|
310
|
+
|
311
|
+
if (IsPowerOf2(radix)) {
|
312
|
+
switch (radix) {
|
313
|
+
case 2:
|
314
|
+
return InternalStringToIntDouble<1>(
|
315
|
+
unicode_cache, current, end, negative, allow_trailing_junk);
|
316
|
+
case 4:
|
317
|
+
return InternalStringToIntDouble<2>(
|
318
|
+
unicode_cache, current, end, negative, allow_trailing_junk);
|
319
|
+
case 8:
|
320
|
+
return InternalStringToIntDouble<3>(
|
321
|
+
unicode_cache, current, end, negative, allow_trailing_junk);
|
322
|
+
|
323
|
+
case 16:
|
324
|
+
return InternalStringToIntDouble<4>(
|
325
|
+
unicode_cache, current, end, negative, allow_trailing_junk);
|
326
|
+
|
327
|
+
case 32:
|
328
|
+
return InternalStringToIntDouble<5>(
|
329
|
+
unicode_cache, current, end, negative, allow_trailing_junk);
|
330
|
+
default:
|
331
|
+
UNREACHABLE();
|
332
|
+
}
|
333
|
+
}
|
334
|
+
|
335
|
+
if (radix == 10) {
|
336
|
+
// Parsing with strtod.
|
337
|
+
const int kMaxSignificantDigits = 309; // Doubles are less than 1.8e308.
|
338
|
+
// The buffer may contain up to kMaxSignificantDigits + 1 digits and a zero
|
339
|
+
// end.
|
340
|
+
const int kBufferSize = kMaxSignificantDigits + 2;
|
341
|
+
char buffer[kBufferSize];
|
342
|
+
int buffer_pos = 0;
|
343
|
+
while (*current >= '0' && *current <= '9') {
|
344
|
+
if (buffer_pos <= kMaxSignificantDigits) {
|
345
|
+
// If the number has more than kMaxSignificantDigits it will be parsed
|
346
|
+
// as infinity.
|
347
|
+
ASSERT(buffer_pos < kBufferSize);
|
348
|
+
buffer[buffer_pos++] = static_cast<char>(*current);
|
349
|
+
}
|
350
|
+
++current;
|
351
|
+
if (current == end) break;
|
352
|
+
}
|
353
|
+
|
354
|
+
if (!allow_trailing_junk &&
|
355
|
+
AdvanceToNonspace(unicode_cache, ¤t, end)) {
|
356
|
+
return JUNK_STRING_VALUE;
|
357
|
+
}
|
358
|
+
|
359
|
+
ASSERT(buffer_pos < kBufferSize);
|
360
|
+
buffer[buffer_pos] = '\0';
|
361
|
+
Vector<const char> buffer_vector(buffer, buffer_pos);
|
362
|
+
return negative ? -Strtod(buffer_vector, 0) : Strtod(buffer_vector, 0);
|
363
|
+
}
|
364
|
+
|
365
|
+
// The following code causes accumulating rounding error for numbers greater
|
366
|
+
// than ~2^56. It's explicitly allowed in the spec: "if R is not 2, 4, 8, 10,
|
367
|
+
// 16, or 32, then mathInt may be an implementation-dependent approximation to
|
368
|
+
// the mathematical integer value" (15.1.2.2).
|
369
|
+
|
370
|
+
int lim_0 = '0' + (radix < 10 ? radix : 10);
|
371
|
+
int lim_a = 'a' + (radix - 10);
|
372
|
+
int lim_A = 'A' + (radix - 10);
|
373
|
+
|
374
|
+
// NOTE: The code for computing the value may seem a bit complex at
|
375
|
+
// first glance. It is structured to use 32-bit multiply-and-add
|
376
|
+
// loops as long as possible to avoid loosing precision.
|
377
|
+
|
378
|
+
double v = 0.0;
|
379
|
+
bool done = false;
|
380
|
+
do {
|
381
|
+
// Parse the longest part of the string starting at index j
|
382
|
+
// possible while keeping the multiplier, and thus the part
|
383
|
+
// itself, within 32 bits.
|
384
|
+
unsigned int part = 0, multiplier = 1;
|
385
|
+
while (true) {
|
386
|
+
int d;
|
387
|
+
if (*current >= '0' && *current < lim_0) {
|
388
|
+
d = *current - '0';
|
389
|
+
} else if (*current >= 'a' && *current < lim_a) {
|
390
|
+
d = *current - 'a' + 10;
|
391
|
+
} else if (*current >= 'A' && *current < lim_A) {
|
392
|
+
d = *current - 'A' + 10;
|
393
|
+
} else {
|
394
|
+
done = true;
|
395
|
+
break;
|
396
|
+
}
|
397
|
+
|
398
|
+
// Update the value of the part as long as the multiplier fits
|
399
|
+
// in 32 bits. When we can't guarantee that the next iteration
|
400
|
+
// will not overflow the multiplier, we stop parsing the part
|
401
|
+
// by leaving the loop.
|
402
|
+
const unsigned int kMaximumMultiplier = 0xffffffffU / 36;
|
403
|
+
uint32_t m = multiplier * radix;
|
404
|
+
if (m > kMaximumMultiplier) break;
|
405
|
+
part = part * radix + d;
|
406
|
+
multiplier = m;
|
407
|
+
ASSERT(multiplier > part);
|
408
|
+
|
409
|
+
++current;
|
410
|
+
if (current == end) {
|
411
|
+
done = true;
|
412
|
+
break;
|
413
|
+
}
|
414
|
+
}
|
415
|
+
|
416
|
+
// Update the value and skip the part in the string.
|
417
|
+
v = v * multiplier + part;
|
418
|
+
} while (!done);
|
419
|
+
|
420
|
+
if (!allow_trailing_junk &&
|
421
|
+
AdvanceToNonspace(unicode_cache, ¤t, end)) {
|
422
|
+
return JUNK_STRING_VALUE;
|
423
|
+
}
|
424
|
+
|
425
|
+
return negative ? -v : v;
|
426
|
+
}
|
427
|
+
|
428
|
+
|
429
|
+
// Converts a string to a double value. Assumes the Iterator supports
|
430
|
+
// the following operations:
|
431
|
+
// 1. current == end (other ops are not allowed), current != end.
|
432
|
+
// 2. *current - gets the current character in the sequence.
|
433
|
+
// 3. ++current (advances the position).
|
434
|
+
template <class Iterator, class EndMark>
|
435
|
+
static double InternalStringToDouble(UnicodeCache* unicode_cache,
|
436
|
+
Iterator current,
|
437
|
+
EndMark end,
|
438
|
+
int flags,
|
439
|
+
double empty_string_val) {
|
440
|
+
// To make sure that iterator dereferencing is valid the following
|
441
|
+
// convention is used:
|
442
|
+
// 1. Each '++current' statement is followed by check for equality to 'end'.
|
443
|
+
// 2. If AdvanceToNonspace returned false then current == end.
|
444
|
+
// 3. If 'current' becomes be equal to 'end' the function returns or goes to
|
445
|
+
// 'parsing_done'.
|
446
|
+
// 4. 'current' is not dereferenced after the 'parsing_done' label.
|
447
|
+
// 5. Code before 'parsing_done' may rely on 'current != end'.
|
448
|
+
if (!AdvanceToNonspace(unicode_cache, ¤t, end)) {
|
449
|
+
return empty_string_val;
|
450
|
+
}
|
451
|
+
|
452
|
+
const bool allow_trailing_junk = (flags & ALLOW_TRAILING_JUNK) != 0;
|
453
|
+
|
454
|
+
// The longest form of simplified number is: "-<significant digits>'.1eXXX\0".
|
455
|
+
const int kBufferSize = kMaxSignificantDigits + 10;
|
456
|
+
char buffer[kBufferSize]; // NOLINT: size is known at compile time.
|
457
|
+
int buffer_pos = 0;
|
458
|
+
|
459
|
+
// Exponent will be adjusted if insignificant digits of the integer part
|
460
|
+
// or insignificant leading zeros of the fractional part are dropped.
|
461
|
+
int exponent = 0;
|
462
|
+
int significant_digits = 0;
|
463
|
+
int insignificant_digits = 0;
|
464
|
+
bool nonzero_digit_dropped = false;
|
465
|
+
bool fractional_part = false;
|
466
|
+
|
467
|
+
bool negative = false;
|
468
|
+
|
469
|
+
if (*current == '+') {
|
470
|
+
// Ignore leading sign.
|
471
|
+
++current;
|
472
|
+
if (current == end) return JUNK_STRING_VALUE;
|
473
|
+
} else if (*current == '-') {
|
474
|
+
++current;
|
475
|
+
if (current == end) return JUNK_STRING_VALUE;
|
476
|
+
negative = true;
|
477
|
+
}
|
478
|
+
|
479
|
+
static const char kInfinitySymbol[] = "Infinity";
|
480
|
+
if (*current == kInfinitySymbol[0]) {
|
481
|
+
if (!SubStringEquals(¤t, end, kInfinitySymbol)) {
|
482
|
+
return JUNK_STRING_VALUE;
|
483
|
+
}
|
484
|
+
|
485
|
+
if (!allow_trailing_junk &&
|
486
|
+
AdvanceToNonspace(unicode_cache, ¤t, end)) {
|
487
|
+
return JUNK_STRING_VALUE;
|
488
|
+
}
|
489
|
+
|
490
|
+
ASSERT(buffer_pos == 0);
|
491
|
+
return negative ? -V8_INFINITY : V8_INFINITY;
|
492
|
+
}
|
493
|
+
|
494
|
+
bool leading_zero = false;
|
495
|
+
if (*current == '0') {
|
496
|
+
++current;
|
497
|
+
if (current == end) return SignedZero(negative);
|
498
|
+
|
499
|
+
leading_zero = true;
|
500
|
+
|
501
|
+
// It could be hexadecimal value.
|
502
|
+
if ((flags & ALLOW_HEX) && (*current == 'x' || *current == 'X')) {
|
503
|
+
++current;
|
504
|
+
if (current == end || !isDigit(*current, 16)) {
|
505
|
+
return JUNK_STRING_VALUE; // "0x".
|
506
|
+
}
|
507
|
+
|
508
|
+
return InternalStringToIntDouble<4>(unicode_cache,
|
509
|
+
current,
|
510
|
+
end,
|
511
|
+
negative,
|
512
|
+
allow_trailing_junk);
|
513
|
+
}
|
514
|
+
|
515
|
+
// Ignore leading zeros in the integer part.
|
516
|
+
while (*current == '0') {
|
517
|
+
++current;
|
518
|
+
if (current == end) return SignedZero(negative);
|
519
|
+
}
|
520
|
+
}
|
521
|
+
|
522
|
+
bool octal = leading_zero && (flags & ALLOW_OCTALS) != 0;
|
523
|
+
|
524
|
+
// Copy significant digits of the integer part (if any) to the buffer.
|
525
|
+
while (*current >= '0' && *current <= '9') {
|
526
|
+
if (significant_digits < kMaxSignificantDigits) {
|
527
|
+
ASSERT(buffer_pos < kBufferSize);
|
528
|
+
buffer[buffer_pos++] = static_cast<char>(*current);
|
529
|
+
significant_digits++;
|
530
|
+
// Will later check if it's an octal in the buffer.
|
531
|
+
} else {
|
532
|
+
insignificant_digits++; // Move the digit into the exponential part.
|
533
|
+
nonzero_digit_dropped = nonzero_digit_dropped || *current != '0';
|
534
|
+
}
|
535
|
+
octal = octal && *current < '8';
|
536
|
+
++current;
|
537
|
+
if (current == end) goto parsing_done;
|
538
|
+
}
|
539
|
+
|
540
|
+
if (significant_digits == 0) {
|
541
|
+
octal = false;
|
542
|
+
}
|
543
|
+
|
544
|
+
if (*current == '.') {
|
545
|
+
if (octal && !allow_trailing_junk) return JUNK_STRING_VALUE;
|
546
|
+
if (octal) goto parsing_done;
|
547
|
+
|
548
|
+
++current;
|
549
|
+
if (current == end) {
|
550
|
+
if (significant_digits == 0 && !leading_zero) {
|
551
|
+
return JUNK_STRING_VALUE;
|
552
|
+
} else {
|
553
|
+
goto parsing_done;
|
554
|
+
}
|
555
|
+
}
|
556
|
+
|
557
|
+
if (significant_digits == 0) {
|
558
|
+
// octal = false;
|
559
|
+
// Integer part consists of 0 or is absent. Significant digits start after
|
560
|
+
// leading zeros (if any).
|
561
|
+
while (*current == '0') {
|
562
|
+
++current;
|
563
|
+
if (current == end) return SignedZero(negative);
|
564
|
+
exponent--; // Move this 0 into the exponent.
|
565
|
+
}
|
566
|
+
}
|
567
|
+
|
568
|
+
// We don't emit a '.', but adjust the exponent instead.
|
569
|
+
fractional_part = true;
|
570
|
+
|
571
|
+
// There is a fractional part.
|
572
|
+
while (*current >= '0' && *current <= '9') {
|
573
|
+
if (significant_digits < kMaxSignificantDigits) {
|
574
|
+
ASSERT(buffer_pos < kBufferSize);
|
575
|
+
buffer[buffer_pos++] = static_cast<char>(*current);
|
576
|
+
significant_digits++;
|
577
|
+
exponent--;
|
578
|
+
} else {
|
579
|
+
// Ignore insignificant digits in the fractional part.
|
580
|
+
nonzero_digit_dropped = nonzero_digit_dropped || *current != '0';
|
581
|
+
}
|
582
|
+
++current;
|
583
|
+
if (current == end) goto parsing_done;
|
584
|
+
}
|
585
|
+
}
|
586
|
+
|
587
|
+
if (!leading_zero && exponent == 0 && significant_digits == 0) {
|
588
|
+
// If leading_zeros is true then the string contains zeros.
|
589
|
+
// If exponent < 0 then string was [+-]\.0*...
|
590
|
+
// If significant_digits != 0 the string is not equal to 0.
|
591
|
+
// Otherwise there are no digits in the string.
|
592
|
+
return JUNK_STRING_VALUE;
|
593
|
+
}
|
594
|
+
|
595
|
+
// Parse exponential part.
|
596
|
+
if (*current == 'e' || *current == 'E') {
|
597
|
+
if (octal) return JUNK_STRING_VALUE;
|
598
|
+
++current;
|
599
|
+
if (current == end) {
|
600
|
+
if (allow_trailing_junk) {
|
601
|
+
goto parsing_done;
|
602
|
+
} else {
|
603
|
+
return JUNK_STRING_VALUE;
|
604
|
+
}
|
605
|
+
}
|
606
|
+
char sign = '+';
|
607
|
+
if (*current == '+' || *current == '-') {
|
608
|
+
sign = static_cast<char>(*current);
|
609
|
+
++current;
|
610
|
+
if (current == end) {
|
611
|
+
if (allow_trailing_junk) {
|
612
|
+
goto parsing_done;
|
613
|
+
} else {
|
614
|
+
return JUNK_STRING_VALUE;
|
615
|
+
}
|
616
|
+
}
|
617
|
+
}
|
618
|
+
|
619
|
+
if (current == end || *current < '0' || *current > '9') {
|
620
|
+
if (allow_trailing_junk) {
|
621
|
+
goto parsing_done;
|
622
|
+
} else {
|
623
|
+
return JUNK_STRING_VALUE;
|
624
|
+
}
|
625
|
+
}
|
626
|
+
|
627
|
+
const int max_exponent = INT_MAX / 2;
|
628
|
+
ASSERT(-max_exponent / 2 <= exponent && exponent <= max_exponent / 2);
|
629
|
+
int num = 0;
|
630
|
+
do {
|
631
|
+
// Check overflow.
|
632
|
+
int digit = *current - '0';
|
633
|
+
if (num >= max_exponent / 10
|
634
|
+
&& !(num == max_exponent / 10 && digit <= max_exponent % 10)) {
|
635
|
+
num = max_exponent;
|
636
|
+
} else {
|
637
|
+
num = num * 10 + digit;
|
638
|
+
}
|
639
|
+
++current;
|
640
|
+
} while (current != end && *current >= '0' && *current <= '9');
|
641
|
+
|
642
|
+
exponent += (sign == '-' ? -num : num);
|
643
|
+
}
|
644
|
+
|
645
|
+
if (!allow_trailing_junk &&
|
646
|
+
AdvanceToNonspace(unicode_cache, ¤t, end)) {
|
647
|
+
return JUNK_STRING_VALUE;
|
648
|
+
}
|
649
|
+
|
650
|
+
parsing_done:
|
651
|
+
exponent += insignificant_digits;
|
652
|
+
|
653
|
+
if (octal) {
|
654
|
+
return InternalStringToIntDouble<3>(unicode_cache,
|
655
|
+
buffer,
|
656
|
+
buffer + buffer_pos,
|
657
|
+
negative,
|
658
|
+
allow_trailing_junk);
|
659
|
+
}
|
660
|
+
|
661
|
+
if (nonzero_digit_dropped) {
|
662
|
+
buffer[buffer_pos++] = '1';
|
663
|
+
exponent--;
|
664
|
+
}
|
665
|
+
|
666
|
+
ASSERT(buffer_pos < kBufferSize);
|
667
|
+
buffer[buffer_pos] = '\0';
|
668
|
+
|
669
|
+
double converted = Strtod(Vector<const char>(buffer, buffer_pos), exponent);
|
670
|
+
return negative ? -converted : converted;
|
671
|
+
}
|
672
|
+
|
673
|
+
|
674
|
+
double StringToDouble(UnicodeCache* unicode_cache,
|
675
|
+
String* str, int flags, double empty_string_val) {
|
676
|
+
StringShape shape(str);
|
677
|
+
if (shape.IsSequentialAscii()) {
|
678
|
+
const char* begin = SeqAsciiString::cast(str)->GetChars();
|
679
|
+
const char* end = begin + str->length();
|
680
|
+
return InternalStringToDouble(unicode_cache, begin, end, flags,
|
681
|
+
empty_string_val);
|
682
|
+
} else if (shape.IsSequentialTwoByte()) {
|
683
|
+
const uc16* begin = SeqTwoByteString::cast(str)->GetChars();
|
684
|
+
const uc16* end = begin + str->length();
|
685
|
+
return InternalStringToDouble(unicode_cache, begin, end, flags,
|
686
|
+
empty_string_val);
|
687
|
+
} else {
|
688
|
+
StringInputBuffer buffer(str);
|
689
|
+
return InternalStringToDouble(unicode_cache,
|
690
|
+
StringInputBufferIterator(&buffer),
|
691
|
+
StringInputBufferIterator::EndMarker(),
|
692
|
+
flags,
|
693
|
+
empty_string_val);
|
694
|
+
}
|
695
|
+
}
|
696
|
+
|
697
|
+
|
698
|
+
double StringToInt(UnicodeCache* unicode_cache,
|
699
|
+
String* str,
|
700
|
+
int radix) {
|
701
|
+
StringShape shape(str);
|
702
|
+
if (shape.IsSequentialAscii()) {
|
703
|
+
const char* begin = SeqAsciiString::cast(str)->GetChars();
|
704
|
+
const char* end = begin + str->length();
|
705
|
+
return InternalStringToInt(unicode_cache, begin, end, radix);
|
706
|
+
} else if (shape.IsSequentialTwoByte()) {
|
707
|
+
const uc16* begin = SeqTwoByteString::cast(str)->GetChars();
|
708
|
+
const uc16* end = begin + str->length();
|
709
|
+
return InternalStringToInt(unicode_cache, begin, end, radix);
|
710
|
+
} else {
|
711
|
+
StringInputBuffer buffer(str);
|
712
|
+
return InternalStringToInt(unicode_cache,
|
713
|
+
StringInputBufferIterator(&buffer),
|
714
|
+
StringInputBufferIterator::EndMarker(),
|
715
|
+
radix);
|
716
|
+
}
|
717
|
+
}
|
718
|
+
|
719
|
+
|
720
|
+
double StringToDouble(UnicodeCache* unicode_cache,
|
721
|
+
const char* str, int flags, double empty_string_val) {
|
722
|
+
const char* end = str + StrLength(str);
|
723
|
+
return InternalStringToDouble(unicode_cache, str, end, flags,
|
724
|
+
empty_string_val);
|
725
|
+
}
|
726
|
+
|
727
|
+
|
728
|
+
double StringToDouble(UnicodeCache* unicode_cache,
|
729
|
+
Vector<const char> str,
|
730
|
+
int flags,
|
731
|
+
double empty_string_val) {
|
732
|
+
const char* end = str.start() + str.length();
|
733
|
+
return InternalStringToDouble(unicode_cache, str.start(), end, flags,
|
734
|
+
empty_string_val);
|
735
|
+
}
|
736
|
+
|
737
|
+
double StringToDouble(UnicodeCache* unicode_cache,
|
738
|
+
Vector<const uc16> str,
|
739
|
+
int flags,
|
740
|
+
double empty_string_val) {
|
741
|
+
const uc16* end = str.start() + str.length();
|
742
|
+
return InternalStringToDouble(unicode_cache, str.start(), end, flags,
|
743
|
+
empty_string_val);
|
744
|
+
}
|
745
|
+
|
746
|
+
|
747
|
+
const char* DoubleToCString(double v, Vector<char> buffer) {
|
748
|
+
switch (fpclassify(v)) {
|
749
|
+
case FP_NAN: return "NaN";
|
750
|
+
case FP_INFINITE: return (v < 0.0 ? "-Infinity" : "Infinity");
|
751
|
+
case FP_ZERO: return "0";
|
752
|
+
default: {
|
753
|
+
StringBuilder builder(buffer.start(), buffer.length());
|
754
|
+
int decimal_point;
|
755
|
+
int sign;
|
756
|
+
const int kV8DtoaBufferCapacity = kBase10MaximalLength + 1;
|
757
|
+
char decimal_rep[kV8DtoaBufferCapacity];
|
758
|
+
int length;
|
759
|
+
|
760
|
+
DoubleToAscii(v, DTOA_SHORTEST, 0,
|
761
|
+
Vector<char>(decimal_rep, kV8DtoaBufferCapacity),
|
762
|
+
&sign, &length, &decimal_point);
|
763
|
+
|
764
|
+
if (sign) builder.AddCharacter('-');
|
765
|
+
|
766
|
+
if (length <= decimal_point && decimal_point <= 21) {
|
767
|
+
// ECMA-262 section 9.8.1 step 6.
|
768
|
+
builder.AddString(decimal_rep);
|
769
|
+
builder.AddPadding('0', decimal_point - length);
|
770
|
+
|
771
|
+
} else if (0 < decimal_point && decimal_point <= 21) {
|
772
|
+
// ECMA-262 section 9.8.1 step 7.
|
773
|
+
builder.AddSubstring(decimal_rep, decimal_point);
|
774
|
+
builder.AddCharacter('.');
|
775
|
+
builder.AddString(decimal_rep + decimal_point);
|
776
|
+
|
777
|
+
} else if (decimal_point <= 0 && decimal_point > -6) {
|
778
|
+
// ECMA-262 section 9.8.1 step 8.
|
779
|
+
builder.AddString("0.");
|
780
|
+
builder.AddPadding('0', -decimal_point);
|
781
|
+
builder.AddString(decimal_rep);
|
782
|
+
|
783
|
+
} else {
|
784
|
+
// ECMA-262 section 9.8.1 step 9 and 10 combined.
|
785
|
+
builder.AddCharacter(decimal_rep[0]);
|
786
|
+
if (length != 1) {
|
787
|
+
builder.AddCharacter('.');
|
788
|
+
builder.AddString(decimal_rep + 1);
|
789
|
+
}
|
790
|
+
builder.AddCharacter('e');
|
791
|
+
builder.AddCharacter((decimal_point >= 0) ? '+' : '-');
|
792
|
+
int exponent = decimal_point - 1;
|
793
|
+
if (exponent < 0) exponent = -exponent;
|
794
|
+
builder.AddFormatted("%d", exponent);
|
795
|
+
}
|
796
|
+
return builder.Finalize();
|
797
|
+
}
|
798
|
+
}
|
799
|
+
}
|
800
|
+
|
801
|
+
|
802
|
+
const char* IntToCString(int n, Vector<char> buffer) {
|
803
|
+
bool negative = false;
|
804
|
+
if (n < 0) {
|
805
|
+
// We must not negate the most negative int.
|
806
|
+
if (n == kMinInt) return DoubleToCString(n, buffer);
|
807
|
+
negative = true;
|
808
|
+
n = -n;
|
809
|
+
}
|
810
|
+
// Build the string backwards from the least significant digit.
|
811
|
+
int i = buffer.length();
|
812
|
+
buffer[--i] = '\0';
|
813
|
+
do {
|
814
|
+
buffer[--i] = '0' + (n % 10);
|
815
|
+
n /= 10;
|
816
|
+
} while (n);
|
817
|
+
if (negative) buffer[--i] = '-';
|
818
|
+
return buffer.start() + i;
|
819
|
+
}
|
820
|
+
|
821
|
+
|
822
|
+
char* DoubleToFixedCString(double value, int f) {
|
823
|
+
const int kMaxDigitsBeforePoint = 21;
|
824
|
+
const double kFirstNonFixed = 1e21;
|
825
|
+
const int kMaxDigitsAfterPoint = 20;
|
826
|
+
ASSERT(f >= 0);
|
827
|
+
ASSERT(f <= kMaxDigitsAfterPoint);
|
828
|
+
|
829
|
+
bool negative = false;
|
830
|
+
double abs_value = value;
|
831
|
+
if (value < 0) {
|
832
|
+
abs_value = -value;
|
833
|
+
negative = true;
|
834
|
+
}
|
835
|
+
|
836
|
+
// If abs_value has more than kMaxDigitsBeforePoint digits before the point
|
837
|
+
// use the non-fixed conversion routine.
|
838
|
+
if (abs_value >= kFirstNonFixed) {
|
839
|
+
char arr[100];
|
840
|
+
Vector<char> buffer(arr, ARRAY_SIZE(arr));
|
841
|
+
return StrDup(DoubleToCString(value, buffer));
|
842
|
+
}
|
843
|
+
|
844
|
+
// Find a sufficiently precise decimal representation of n.
|
845
|
+
int decimal_point;
|
846
|
+
int sign;
|
847
|
+
// Add space for the '\0' byte.
|
848
|
+
const int kDecimalRepCapacity =
|
849
|
+
kMaxDigitsBeforePoint + kMaxDigitsAfterPoint + 1;
|
850
|
+
char decimal_rep[kDecimalRepCapacity];
|
851
|
+
int decimal_rep_length;
|
852
|
+
DoubleToAscii(value, DTOA_FIXED, f,
|
853
|
+
Vector<char>(decimal_rep, kDecimalRepCapacity),
|
854
|
+
&sign, &decimal_rep_length, &decimal_point);
|
855
|
+
|
856
|
+
// Create a representation that is padded with zeros if needed.
|
857
|
+
int zero_prefix_length = 0;
|
858
|
+
int zero_postfix_length = 0;
|
859
|
+
|
860
|
+
if (decimal_point <= 0) {
|
861
|
+
zero_prefix_length = -decimal_point + 1;
|
862
|
+
decimal_point = 1;
|
863
|
+
}
|
864
|
+
|
865
|
+
if (zero_prefix_length + decimal_rep_length < decimal_point + f) {
|
866
|
+
zero_postfix_length = decimal_point + f - decimal_rep_length -
|
867
|
+
zero_prefix_length;
|
868
|
+
}
|
869
|
+
|
870
|
+
unsigned rep_length =
|
871
|
+
zero_prefix_length + decimal_rep_length + zero_postfix_length;
|
872
|
+
StringBuilder rep_builder(rep_length + 1);
|
873
|
+
rep_builder.AddPadding('0', zero_prefix_length);
|
874
|
+
rep_builder.AddString(decimal_rep);
|
875
|
+
rep_builder.AddPadding('0', zero_postfix_length);
|
876
|
+
char* rep = rep_builder.Finalize();
|
877
|
+
|
878
|
+
// Create the result string by appending a minus and putting in a
|
879
|
+
// decimal point if needed.
|
880
|
+
unsigned result_size = decimal_point + f + 2;
|
881
|
+
StringBuilder builder(result_size + 1);
|
882
|
+
if (negative) builder.AddCharacter('-');
|
883
|
+
builder.AddSubstring(rep, decimal_point);
|
884
|
+
if (f > 0) {
|
885
|
+
builder.AddCharacter('.');
|
886
|
+
builder.AddSubstring(rep + decimal_point, f);
|
887
|
+
}
|
888
|
+
DeleteArray(rep);
|
889
|
+
return builder.Finalize();
|
890
|
+
}
|
891
|
+
|
892
|
+
|
893
|
+
static char* CreateExponentialRepresentation(char* decimal_rep,
|
894
|
+
int exponent,
|
895
|
+
bool negative,
|
896
|
+
int significant_digits) {
|
897
|
+
bool negative_exponent = false;
|
898
|
+
if (exponent < 0) {
|
899
|
+
negative_exponent = true;
|
900
|
+
exponent = -exponent;
|
901
|
+
}
|
902
|
+
|
903
|
+
// Leave room in the result for appending a minus, for a period, the
|
904
|
+
// letter 'e', a minus or a plus depending on the exponent, and a
|
905
|
+
// three digit exponent.
|
906
|
+
unsigned result_size = significant_digits + 7;
|
907
|
+
StringBuilder builder(result_size + 1);
|
908
|
+
|
909
|
+
if (negative) builder.AddCharacter('-');
|
910
|
+
builder.AddCharacter(decimal_rep[0]);
|
911
|
+
if (significant_digits != 1) {
|
912
|
+
builder.AddCharacter('.');
|
913
|
+
builder.AddString(decimal_rep + 1);
|
914
|
+
int rep_length = StrLength(decimal_rep);
|
915
|
+
builder.AddPadding('0', significant_digits - rep_length);
|
916
|
+
}
|
917
|
+
|
918
|
+
builder.AddCharacter('e');
|
919
|
+
builder.AddCharacter(negative_exponent ? '-' : '+');
|
920
|
+
builder.AddFormatted("%d", exponent);
|
921
|
+
return builder.Finalize();
|
922
|
+
}
|
923
|
+
|
924
|
+
|
925
|
+
|
926
|
+
char* DoubleToExponentialCString(double value, int f) {
|
927
|
+
const int kMaxDigitsAfterPoint = 20;
|
928
|
+
// f might be -1 to signal that f was undefined in JavaScript.
|
929
|
+
ASSERT(f >= -1 && f <= kMaxDigitsAfterPoint);
|
930
|
+
|
931
|
+
bool negative = false;
|
932
|
+
if (value < 0) {
|
933
|
+
value = -value;
|
934
|
+
negative = true;
|
935
|
+
}
|
936
|
+
|
937
|
+
// Find a sufficiently precise decimal representation of n.
|
938
|
+
int decimal_point;
|
939
|
+
int sign;
|
940
|
+
// f corresponds to the digits after the point. There is always one digit
|
941
|
+
// before the point. The number of requested_digits equals hence f + 1.
|
942
|
+
// And we have to add one character for the null-terminator.
|
943
|
+
const int kV8DtoaBufferCapacity = kMaxDigitsAfterPoint + 1 + 1;
|
944
|
+
// Make sure that the buffer is big enough, even if we fall back to the
|
945
|
+
// shortest representation (which happens when f equals -1).
|
946
|
+
ASSERT(kBase10MaximalLength <= kMaxDigitsAfterPoint + 1);
|
947
|
+
char decimal_rep[kV8DtoaBufferCapacity];
|
948
|
+
int decimal_rep_length;
|
949
|
+
|
950
|
+
if (f == -1) {
|
951
|
+
DoubleToAscii(value, DTOA_SHORTEST, 0,
|
952
|
+
Vector<char>(decimal_rep, kV8DtoaBufferCapacity),
|
953
|
+
&sign, &decimal_rep_length, &decimal_point);
|
954
|
+
f = decimal_rep_length - 1;
|
955
|
+
} else {
|
956
|
+
DoubleToAscii(value, DTOA_PRECISION, f + 1,
|
957
|
+
Vector<char>(decimal_rep, kV8DtoaBufferCapacity),
|
958
|
+
&sign, &decimal_rep_length, &decimal_point);
|
959
|
+
}
|
960
|
+
ASSERT(decimal_rep_length > 0);
|
961
|
+
ASSERT(decimal_rep_length <= f + 1);
|
962
|
+
|
963
|
+
int exponent = decimal_point - 1;
|
964
|
+
char* result =
|
965
|
+
CreateExponentialRepresentation(decimal_rep, exponent, negative, f+1);
|
966
|
+
|
967
|
+
return result;
|
968
|
+
}
|
969
|
+
|
970
|
+
|
971
|
+
char* DoubleToPrecisionCString(double value, int p) {
|
972
|
+
const int kMinimalDigits = 1;
|
973
|
+
const int kMaximalDigits = 21;
|
974
|
+
ASSERT(p >= kMinimalDigits && p <= kMaximalDigits);
|
975
|
+
USE(kMinimalDigits);
|
976
|
+
|
977
|
+
bool negative = false;
|
978
|
+
if (value < 0) {
|
979
|
+
value = -value;
|
980
|
+
negative = true;
|
981
|
+
}
|
982
|
+
|
983
|
+
// Find a sufficiently precise decimal representation of n.
|
984
|
+
int decimal_point;
|
985
|
+
int sign;
|
986
|
+
// Add one for the terminating null character.
|
987
|
+
const int kV8DtoaBufferCapacity = kMaximalDigits + 1;
|
988
|
+
char decimal_rep[kV8DtoaBufferCapacity];
|
989
|
+
int decimal_rep_length;
|
990
|
+
|
991
|
+
DoubleToAscii(value, DTOA_PRECISION, p,
|
992
|
+
Vector<char>(decimal_rep, kV8DtoaBufferCapacity),
|
993
|
+
&sign, &decimal_rep_length, &decimal_point);
|
994
|
+
ASSERT(decimal_rep_length <= p);
|
995
|
+
|
996
|
+
int exponent = decimal_point - 1;
|
997
|
+
|
998
|
+
char* result = NULL;
|
999
|
+
|
1000
|
+
if (exponent < -6 || exponent >= p) {
|
1001
|
+
result =
|
1002
|
+
CreateExponentialRepresentation(decimal_rep, exponent, negative, p);
|
1003
|
+
} else {
|
1004
|
+
// Use fixed notation.
|
1005
|
+
//
|
1006
|
+
// Leave room in the result for appending a minus, a period and in
|
1007
|
+
// the case where decimal_point is not positive for a zero in
|
1008
|
+
// front of the period.
|
1009
|
+
unsigned result_size = (decimal_point <= 0)
|
1010
|
+
? -decimal_point + p + 3
|
1011
|
+
: p + 2;
|
1012
|
+
StringBuilder builder(result_size + 1);
|
1013
|
+
if (negative) builder.AddCharacter('-');
|
1014
|
+
if (decimal_point <= 0) {
|
1015
|
+
builder.AddString("0.");
|
1016
|
+
builder.AddPadding('0', -decimal_point);
|
1017
|
+
builder.AddString(decimal_rep);
|
1018
|
+
builder.AddPadding('0', p - decimal_rep_length);
|
1019
|
+
} else {
|
1020
|
+
const int m = Min(decimal_rep_length, decimal_point);
|
1021
|
+
builder.AddSubstring(decimal_rep, m);
|
1022
|
+
builder.AddPadding('0', decimal_point - decimal_rep_length);
|
1023
|
+
if (decimal_point < p) {
|
1024
|
+
builder.AddCharacter('.');
|
1025
|
+
const int extra = negative ? 2 : 1;
|
1026
|
+
if (decimal_rep_length > decimal_point) {
|
1027
|
+
const int len = StrLength(decimal_rep + decimal_point);
|
1028
|
+
const int n = Min(len, p - (builder.position() - extra));
|
1029
|
+
builder.AddSubstring(decimal_rep + decimal_point, n);
|
1030
|
+
}
|
1031
|
+
builder.AddPadding('0', extra + (p - builder.position()));
|
1032
|
+
}
|
1033
|
+
}
|
1034
|
+
result = builder.Finalize();
|
1035
|
+
}
|
1036
|
+
|
1037
|
+
return result;
|
1038
|
+
}
|
1039
|
+
|
1040
|
+
|
1041
|
+
char* DoubleToRadixCString(double value, int radix) {
|
1042
|
+
ASSERT(radix >= 2 && radix <= 36);
|
1043
|
+
|
1044
|
+
// Character array used for conversion.
|
1045
|
+
static const char chars[] = "0123456789abcdefghijklmnopqrstuvwxyz";
|
1046
|
+
|
1047
|
+
// Buffer for the integer part of the result. 1024 chars is enough
|
1048
|
+
// for max integer value in radix 2. We need room for a sign too.
|
1049
|
+
static const int kBufferSize = 1100;
|
1050
|
+
char integer_buffer[kBufferSize];
|
1051
|
+
integer_buffer[kBufferSize - 1] = '\0';
|
1052
|
+
|
1053
|
+
// Buffer for the decimal part of the result. We only generate up
|
1054
|
+
// to kBufferSize - 1 chars for the decimal part.
|
1055
|
+
char decimal_buffer[kBufferSize];
|
1056
|
+
decimal_buffer[kBufferSize - 1] = '\0';
|
1057
|
+
|
1058
|
+
// Make sure the value is positive.
|
1059
|
+
bool is_negative = value < 0.0;
|
1060
|
+
if (is_negative) value = -value;
|
1061
|
+
|
1062
|
+
// Get the integer part and the decimal part.
|
1063
|
+
double integer_part = floor(value);
|
1064
|
+
double decimal_part = value - integer_part;
|
1065
|
+
|
1066
|
+
// Convert the integer part starting from the back. Always generate
|
1067
|
+
// at least one digit.
|
1068
|
+
int integer_pos = kBufferSize - 2;
|
1069
|
+
do {
|
1070
|
+
integer_buffer[integer_pos--] =
|
1071
|
+
chars[static_cast<int>(modulo(integer_part, radix))];
|
1072
|
+
integer_part /= radix;
|
1073
|
+
} while (integer_part >= 1.0);
|
1074
|
+
// Sanity check.
|
1075
|
+
ASSERT(integer_pos > 0);
|
1076
|
+
// Add sign if needed.
|
1077
|
+
if (is_negative) integer_buffer[integer_pos--] = '-';
|
1078
|
+
|
1079
|
+
// Convert the decimal part. Repeatedly multiply by the radix to
|
1080
|
+
// generate the next char. Never generate more than kBufferSize - 1
|
1081
|
+
// chars.
|
1082
|
+
//
|
1083
|
+
// TODO(1093998): We will often generate a full decimal_buffer of
|
1084
|
+
// chars because hitting zero will often not happen. The right
|
1085
|
+
// solution would be to continue until the string representation can
|
1086
|
+
// be read back and yield the original value. To implement this
|
1087
|
+
// efficiently, we probably have to modify dtoa.
|
1088
|
+
int decimal_pos = 0;
|
1089
|
+
while ((decimal_part > 0.0) && (decimal_pos < kBufferSize - 1)) {
|
1090
|
+
decimal_part *= radix;
|
1091
|
+
decimal_buffer[decimal_pos++] =
|
1092
|
+
chars[static_cast<int>(floor(decimal_part))];
|
1093
|
+
decimal_part -= floor(decimal_part);
|
1094
|
+
}
|
1095
|
+
decimal_buffer[decimal_pos] = '\0';
|
1096
|
+
|
1097
|
+
// Compute the result size.
|
1098
|
+
int integer_part_size = kBufferSize - 2 - integer_pos;
|
1099
|
+
// Make room for zero termination.
|
1100
|
+
unsigned result_size = integer_part_size + decimal_pos;
|
1101
|
+
// If the number has a decimal part, leave room for the period.
|
1102
|
+
if (decimal_pos > 0) result_size++;
|
1103
|
+
// Allocate result and fill in the parts.
|
1104
|
+
StringBuilder builder(result_size + 1);
|
1105
|
+
builder.AddSubstring(integer_buffer + integer_pos + 1, integer_part_size);
|
1106
|
+
if (decimal_pos > 0) builder.AddCharacter('.');
|
1107
|
+
builder.AddSubstring(decimal_buffer, decimal_pos);
|
1108
|
+
return builder.Finalize();
|
1109
|
+
}
|
1110
|
+
|
1111
|
+
|
1112
|
+
static Mutex* dtoa_lock_one = OS::CreateMutex();
|
1113
|
+
static Mutex* dtoa_lock_zero = OS::CreateMutex();
|
1114
|
+
|
1115
|
+
|
1116
|
+
} } // namespace v8::internal
|
1117
|
+
|
1118
|
+
|
1119
|
+
extern "C" {
|
1120
|
+
void ACQUIRE_DTOA_LOCK(int n) {
|
1121
|
+
ASSERT(n == 0 || n == 1);
|
1122
|
+
(n == 0 ? v8::internal::dtoa_lock_zero : v8::internal::dtoa_lock_one)->Lock();
|
1123
|
+
}
|
1124
|
+
|
1125
|
+
|
1126
|
+
void FREE_DTOA_LOCK(int n) {
|
1127
|
+
ASSERT(n == 0 || n == 1);
|
1128
|
+
(n == 0 ? v8::internal::dtoa_lock_zero : v8::internal::dtoa_lock_one)->
|
1129
|
+
Unlock();
|
1130
|
+
}
|
1131
|
+
}
|