libv8 3.3.10.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (700) hide show
  1. data/.gitignore +8 -0
  2. data/.gitmodules +3 -0
  3. data/Gemfile +4 -0
  4. data/README.md +44 -0
  5. data/Rakefile +73 -0
  6. data/ext/libv8/extconf.rb +9 -0
  7. data/lib/libv8.rb +15 -0
  8. data/lib/libv8/Makefile +38 -0
  9. data/lib/libv8/detect_cpu.rb +27 -0
  10. data/lib/libv8/fpic-on-linux-amd64.patch +13 -0
  11. data/lib/libv8/scons/CHANGES.txt +5334 -0
  12. data/lib/libv8/scons/LICENSE.txt +20 -0
  13. data/lib/libv8/scons/MANIFEST +199 -0
  14. data/lib/libv8/scons/PKG-INFO +13 -0
  15. data/lib/libv8/scons/README.txt +243 -0
  16. data/lib/libv8/scons/RELEASE.txt +98 -0
  17. data/lib/libv8/scons/engine/SCons/Action.py +1241 -0
  18. data/lib/libv8/scons/engine/SCons/Builder.py +877 -0
  19. data/lib/libv8/scons/engine/SCons/CacheDir.py +216 -0
  20. data/lib/libv8/scons/engine/SCons/Conftest.py +793 -0
  21. data/lib/libv8/scons/engine/SCons/Debug.py +220 -0
  22. data/lib/libv8/scons/engine/SCons/Defaults.py +480 -0
  23. data/lib/libv8/scons/engine/SCons/Environment.py +2318 -0
  24. data/lib/libv8/scons/engine/SCons/Errors.py +205 -0
  25. data/lib/libv8/scons/engine/SCons/Executor.py +633 -0
  26. data/lib/libv8/scons/engine/SCons/Job.py +435 -0
  27. data/lib/libv8/scons/engine/SCons/Memoize.py +244 -0
  28. data/lib/libv8/scons/engine/SCons/Node/Alias.py +152 -0
  29. data/lib/libv8/scons/engine/SCons/Node/FS.py +3142 -0
  30. data/lib/libv8/scons/engine/SCons/Node/Python.py +128 -0
  31. data/lib/libv8/scons/engine/SCons/Node/__init__.py +1328 -0
  32. data/lib/libv8/scons/engine/SCons/Options/BoolOption.py +50 -0
  33. data/lib/libv8/scons/engine/SCons/Options/EnumOption.py +50 -0
  34. data/lib/libv8/scons/engine/SCons/Options/ListOption.py +50 -0
  35. data/lib/libv8/scons/engine/SCons/Options/PackageOption.py +50 -0
  36. data/lib/libv8/scons/engine/SCons/Options/PathOption.py +76 -0
  37. data/lib/libv8/scons/engine/SCons/Options/__init__.py +67 -0
  38. data/lib/libv8/scons/engine/SCons/PathList.py +231 -0
  39. data/lib/libv8/scons/engine/SCons/Platform/__init__.py +241 -0
  40. data/lib/libv8/scons/engine/SCons/Platform/aix.py +69 -0
  41. data/lib/libv8/scons/engine/SCons/Platform/cygwin.py +55 -0
  42. data/lib/libv8/scons/engine/SCons/Platform/darwin.py +46 -0
  43. data/lib/libv8/scons/engine/SCons/Platform/hpux.py +46 -0
  44. data/lib/libv8/scons/engine/SCons/Platform/irix.py +44 -0
  45. data/lib/libv8/scons/engine/SCons/Platform/os2.py +58 -0
  46. data/lib/libv8/scons/engine/SCons/Platform/posix.py +263 -0
  47. data/lib/libv8/scons/engine/SCons/Platform/sunos.py +50 -0
  48. data/lib/libv8/scons/engine/SCons/Platform/win32.py +385 -0
  49. data/lib/libv8/scons/engine/SCons/SConf.py +1030 -0
  50. data/lib/libv8/scons/engine/SCons/SConsign.py +383 -0
  51. data/lib/libv8/scons/engine/SCons/Scanner/C.py +132 -0
  52. data/lib/libv8/scons/engine/SCons/Scanner/D.py +73 -0
  53. data/lib/libv8/scons/engine/SCons/Scanner/Dir.py +109 -0
  54. data/lib/libv8/scons/engine/SCons/Scanner/Fortran.py +316 -0
  55. data/lib/libv8/scons/engine/SCons/Scanner/IDL.py +48 -0
  56. data/lib/libv8/scons/engine/SCons/Scanner/LaTeX.py +384 -0
  57. data/lib/libv8/scons/engine/SCons/Scanner/Prog.py +101 -0
  58. data/lib/libv8/scons/engine/SCons/Scanner/RC.py +55 -0
  59. data/lib/libv8/scons/engine/SCons/Scanner/__init__.py +413 -0
  60. data/lib/libv8/scons/engine/SCons/Script/Interactive.py +384 -0
  61. data/lib/libv8/scons/engine/SCons/Script/Main.py +1334 -0
  62. data/lib/libv8/scons/engine/SCons/Script/SConsOptions.py +939 -0
  63. data/lib/libv8/scons/engine/SCons/Script/SConscript.py +640 -0
  64. data/lib/libv8/scons/engine/SCons/Script/__init__.py +412 -0
  65. data/lib/libv8/scons/engine/SCons/Sig.py +63 -0
  66. data/lib/libv8/scons/engine/SCons/Subst.py +904 -0
  67. data/lib/libv8/scons/engine/SCons/Taskmaster.py +1017 -0
  68. data/lib/libv8/scons/engine/SCons/Tool/386asm.py +61 -0
  69. data/lib/libv8/scons/engine/SCons/Tool/BitKeeper.py +67 -0
  70. data/lib/libv8/scons/engine/SCons/Tool/CVS.py +73 -0
  71. data/lib/libv8/scons/engine/SCons/Tool/FortranCommon.py +246 -0
  72. data/lib/libv8/scons/engine/SCons/Tool/JavaCommon.py +323 -0
  73. data/lib/libv8/scons/engine/SCons/Tool/MSCommon/__init__.py +56 -0
  74. data/lib/libv8/scons/engine/SCons/Tool/MSCommon/arch.py +61 -0
  75. data/lib/libv8/scons/engine/SCons/Tool/MSCommon/common.py +240 -0
  76. data/lib/libv8/scons/engine/SCons/Tool/MSCommon/netframework.py +82 -0
  77. data/lib/libv8/scons/engine/SCons/Tool/MSCommon/sdk.py +391 -0
  78. data/lib/libv8/scons/engine/SCons/Tool/MSCommon/vc.py +456 -0
  79. data/lib/libv8/scons/engine/SCons/Tool/MSCommon/vs.py +499 -0
  80. data/lib/libv8/scons/engine/SCons/Tool/Perforce.py +103 -0
  81. data/lib/libv8/scons/engine/SCons/Tool/PharLapCommon.py +137 -0
  82. data/lib/libv8/scons/engine/SCons/Tool/RCS.py +64 -0
  83. data/lib/libv8/scons/engine/SCons/Tool/SCCS.py +64 -0
  84. data/lib/libv8/scons/engine/SCons/Tool/Subversion.py +71 -0
  85. data/lib/libv8/scons/engine/SCons/Tool/__init__.py +681 -0
  86. data/lib/libv8/scons/engine/SCons/Tool/aixc++.py +82 -0
  87. data/lib/libv8/scons/engine/SCons/Tool/aixcc.py +74 -0
  88. data/lib/libv8/scons/engine/SCons/Tool/aixf77.py +80 -0
  89. data/lib/libv8/scons/engine/SCons/Tool/aixlink.py +76 -0
  90. data/lib/libv8/scons/engine/SCons/Tool/applelink.py +71 -0
  91. data/lib/libv8/scons/engine/SCons/Tool/ar.py +63 -0
  92. data/lib/libv8/scons/engine/SCons/Tool/as.py +78 -0
  93. data/lib/libv8/scons/engine/SCons/Tool/bcc32.py +81 -0
  94. data/lib/libv8/scons/engine/SCons/Tool/c++.py +99 -0
  95. data/lib/libv8/scons/engine/SCons/Tool/cc.py +102 -0
  96. data/lib/libv8/scons/engine/SCons/Tool/cvf.py +58 -0
  97. data/lib/libv8/scons/engine/SCons/Tool/default.py +50 -0
  98. data/lib/libv8/scons/engine/SCons/Tool/dmd.py +223 -0
  99. data/lib/libv8/scons/engine/SCons/Tool/dvi.py +64 -0
  100. data/lib/libv8/scons/engine/SCons/Tool/dvipdf.py +124 -0
  101. data/lib/libv8/scons/engine/SCons/Tool/dvips.py +94 -0
  102. data/lib/libv8/scons/engine/SCons/Tool/f77.py +62 -0
  103. data/lib/libv8/scons/engine/SCons/Tool/f90.py +62 -0
  104. data/lib/libv8/scons/engine/SCons/Tool/f95.py +63 -0
  105. data/lib/libv8/scons/engine/SCons/Tool/filesystem.py +98 -0
  106. data/lib/libv8/scons/engine/SCons/Tool/fortran.py +62 -0
  107. data/lib/libv8/scons/engine/SCons/Tool/g++.py +90 -0
  108. data/lib/libv8/scons/engine/SCons/Tool/g77.py +73 -0
  109. data/lib/libv8/scons/engine/SCons/Tool/gas.py +53 -0
  110. data/lib/libv8/scons/engine/SCons/Tool/gcc.py +80 -0
  111. data/lib/libv8/scons/engine/SCons/Tool/gfortran.py +64 -0
  112. data/lib/libv8/scons/engine/SCons/Tool/gnulink.py +63 -0
  113. data/lib/libv8/scons/engine/SCons/Tool/gs.py +81 -0
  114. data/lib/libv8/scons/engine/SCons/Tool/hpc++.py +84 -0
  115. data/lib/libv8/scons/engine/SCons/Tool/hpcc.py +53 -0
  116. data/lib/libv8/scons/engine/SCons/Tool/hplink.py +77 -0
  117. data/lib/libv8/scons/engine/SCons/Tool/icc.py +59 -0
  118. data/lib/libv8/scons/engine/SCons/Tool/icl.py +52 -0
  119. data/lib/libv8/scons/engine/SCons/Tool/ifl.py +72 -0
  120. data/lib/libv8/scons/engine/SCons/Tool/ifort.py +88 -0
  121. data/lib/libv8/scons/engine/SCons/Tool/ilink.py +59 -0
  122. data/lib/libv8/scons/engine/SCons/Tool/ilink32.py +60 -0
  123. data/lib/libv8/scons/engine/SCons/Tool/install.py +229 -0
  124. data/lib/libv8/scons/engine/SCons/Tool/intelc.py +482 -0
  125. data/lib/libv8/scons/engine/SCons/Tool/ipkg.py +67 -0
  126. data/lib/libv8/scons/engine/SCons/Tool/jar.py +110 -0
  127. data/lib/libv8/scons/engine/SCons/Tool/javac.py +230 -0
  128. data/lib/libv8/scons/engine/SCons/Tool/javah.py +137 -0
  129. data/lib/libv8/scons/engine/SCons/Tool/latex.py +79 -0
  130. data/lib/libv8/scons/engine/SCons/Tool/lex.py +97 -0
  131. data/lib/libv8/scons/engine/SCons/Tool/link.py +121 -0
  132. data/lib/libv8/scons/engine/SCons/Tool/linkloc.py +112 -0
  133. data/lib/libv8/scons/engine/SCons/Tool/m4.py +63 -0
  134. data/lib/libv8/scons/engine/SCons/Tool/masm.py +77 -0
  135. data/lib/libv8/scons/engine/SCons/Tool/midl.py +88 -0
  136. data/lib/libv8/scons/engine/SCons/Tool/mingw.py +158 -0
  137. data/lib/libv8/scons/engine/SCons/Tool/mslib.py +64 -0
  138. data/lib/libv8/scons/engine/SCons/Tool/mslink.py +266 -0
  139. data/lib/libv8/scons/engine/SCons/Tool/mssdk.py +50 -0
  140. data/lib/libv8/scons/engine/SCons/Tool/msvc.py +268 -0
  141. data/lib/libv8/scons/engine/SCons/Tool/msvs.py +1388 -0
  142. data/lib/libv8/scons/engine/SCons/Tool/mwcc.py +207 -0
  143. data/lib/libv8/scons/engine/SCons/Tool/mwld.py +107 -0
  144. data/lib/libv8/scons/engine/SCons/Tool/nasm.py +72 -0
  145. data/lib/libv8/scons/engine/SCons/Tool/packaging/__init__.py +312 -0
  146. data/lib/libv8/scons/engine/SCons/Tool/packaging/ipk.py +185 -0
  147. data/lib/libv8/scons/engine/SCons/Tool/packaging/msi.py +527 -0
  148. data/lib/libv8/scons/engine/SCons/Tool/packaging/rpm.py +365 -0
  149. data/lib/libv8/scons/engine/SCons/Tool/packaging/src_tarbz2.py +43 -0
  150. data/lib/libv8/scons/engine/SCons/Tool/packaging/src_targz.py +43 -0
  151. data/lib/libv8/scons/engine/SCons/Tool/packaging/src_zip.py +43 -0
  152. data/lib/libv8/scons/engine/SCons/Tool/packaging/tarbz2.py +44 -0
  153. data/lib/libv8/scons/engine/SCons/Tool/packaging/targz.py +44 -0
  154. data/lib/libv8/scons/engine/SCons/Tool/packaging/zip.py +44 -0
  155. data/lib/libv8/scons/engine/SCons/Tool/pdf.py +78 -0
  156. data/lib/libv8/scons/engine/SCons/Tool/pdflatex.py +83 -0
  157. data/lib/libv8/scons/engine/SCons/Tool/pdftex.py +108 -0
  158. data/lib/libv8/scons/engine/SCons/Tool/qt.py +336 -0
  159. data/lib/libv8/scons/engine/SCons/Tool/rmic.py +120 -0
  160. data/lib/libv8/scons/engine/SCons/Tool/rpcgen.py +70 -0
  161. data/lib/libv8/scons/engine/SCons/Tool/rpm.py +132 -0
  162. data/lib/libv8/scons/engine/SCons/Tool/sgiar.py +68 -0
  163. data/lib/libv8/scons/engine/SCons/Tool/sgic++.py +58 -0
  164. data/lib/libv8/scons/engine/SCons/Tool/sgicc.py +53 -0
  165. data/lib/libv8/scons/engine/SCons/Tool/sgilink.py +63 -0
  166. data/lib/libv8/scons/engine/SCons/Tool/sunar.py +67 -0
  167. data/lib/libv8/scons/engine/SCons/Tool/sunc++.py +142 -0
  168. data/lib/libv8/scons/engine/SCons/Tool/suncc.py +58 -0
  169. data/lib/libv8/scons/engine/SCons/Tool/sunf77.py +63 -0
  170. data/lib/libv8/scons/engine/SCons/Tool/sunf90.py +64 -0
  171. data/lib/libv8/scons/engine/SCons/Tool/sunf95.py +64 -0
  172. data/lib/libv8/scons/engine/SCons/Tool/sunlink.py +77 -0
  173. data/lib/libv8/scons/engine/SCons/Tool/swig.py +182 -0
  174. data/lib/libv8/scons/engine/SCons/Tool/tar.py +73 -0
  175. data/lib/libv8/scons/engine/SCons/Tool/tex.py +813 -0
  176. data/lib/libv8/scons/engine/SCons/Tool/textfile.py +175 -0
  177. data/lib/libv8/scons/engine/SCons/Tool/tlib.py +53 -0
  178. data/lib/libv8/scons/engine/SCons/Tool/wix.py +99 -0
  179. data/lib/libv8/scons/engine/SCons/Tool/yacc.py +130 -0
  180. data/lib/libv8/scons/engine/SCons/Tool/zip.py +99 -0
  181. data/lib/libv8/scons/engine/SCons/Util.py +1492 -0
  182. data/lib/libv8/scons/engine/SCons/Variables/BoolVariable.py +89 -0
  183. data/lib/libv8/scons/engine/SCons/Variables/EnumVariable.py +103 -0
  184. data/lib/libv8/scons/engine/SCons/Variables/ListVariable.py +135 -0
  185. data/lib/libv8/scons/engine/SCons/Variables/PackageVariable.py +106 -0
  186. data/lib/libv8/scons/engine/SCons/Variables/PathVariable.py +147 -0
  187. data/lib/libv8/scons/engine/SCons/Variables/__init__.py +312 -0
  188. data/lib/libv8/scons/engine/SCons/Warnings.py +246 -0
  189. data/lib/libv8/scons/engine/SCons/__init__.py +49 -0
  190. data/lib/libv8/scons/engine/SCons/compat/__init__.py +237 -0
  191. data/lib/libv8/scons/engine/SCons/compat/_scons_builtins.py +150 -0
  192. data/lib/libv8/scons/engine/SCons/compat/_scons_collections.py +45 -0
  193. data/lib/libv8/scons/engine/SCons/compat/_scons_dbm.py +45 -0
  194. data/lib/libv8/scons/engine/SCons/compat/_scons_hashlib.py +76 -0
  195. data/lib/libv8/scons/engine/SCons/compat/_scons_io.py +45 -0
  196. data/lib/libv8/scons/engine/SCons/compat/_scons_sets.py +563 -0
  197. data/lib/libv8/scons/engine/SCons/compat/_scons_subprocess.py +1281 -0
  198. data/lib/libv8/scons/engine/SCons/cpp.py +589 -0
  199. data/lib/libv8/scons/engine/SCons/dblite.py +251 -0
  200. data/lib/libv8/scons/engine/SCons/exitfuncs.py +77 -0
  201. data/lib/libv8/scons/os_spawnv_fix.diff +83 -0
  202. data/lib/libv8/scons/scons-time.1 +1017 -0
  203. data/lib/libv8/scons/scons.1 +15219 -0
  204. data/lib/libv8/scons/sconsign.1 +208 -0
  205. data/lib/libv8/scons/script/scons +196 -0
  206. data/lib/libv8/scons/script/scons-time +1544 -0
  207. data/lib/libv8/scons/script/scons.bat +31 -0
  208. data/lib/libv8/scons/script/sconsign +513 -0
  209. data/lib/libv8/scons/setup.cfg +6 -0
  210. data/lib/libv8/scons/setup.py +425 -0
  211. data/lib/libv8/v8/.gitignore +35 -0
  212. data/lib/libv8/v8/AUTHORS +44 -0
  213. data/lib/libv8/v8/ChangeLog +2839 -0
  214. data/lib/libv8/v8/LICENSE +52 -0
  215. data/lib/libv8/v8/LICENSE.strongtalk +29 -0
  216. data/lib/libv8/v8/LICENSE.v8 +26 -0
  217. data/lib/libv8/v8/LICENSE.valgrind +45 -0
  218. data/lib/libv8/v8/SConstruct +1478 -0
  219. data/lib/libv8/v8/build/README.txt +49 -0
  220. data/lib/libv8/v8/build/all.gyp +18 -0
  221. data/lib/libv8/v8/build/armu.gypi +32 -0
  222. data/lib/libv8/v8/build/common.gypi +144 -0
  223. data/lib/libv8/v8/build/gyp_v8 +145 -0
  224. data/lib/libv8/v8/include/v8-debug.h +395 -0
  225. data/lib/libv8/v8/include/v8-preparser.h +117 -0
  226. data/lib/libv8/v8/include/v8-profiler.h +505 -0
  227. data/lib/libv8/v8/include/v8-testing.h +104 -0
  228. data/lib/libv8/v8/include/v8.h +4124 -0
  229. data/lib/libv8/v8/include/v8stdint.h +53 -0
  230. data/lib/libv8/v8/preparser/SConscript +38 -0
  231. data/lib/libv8/v8/preparser/preparser-process.cc +379 -0
  232. data/lib/libv8/v8/src/SConscript +368 -0
  233. data/lib/libv8/v8/src/accessors.cc +767 -0
  234. data/lib/libv8/v8/src/accessors.h +123 -0
  235. data/lib/libv8/v8/src/allocation-inl.h +49 -0
  236. data/lib/libv8/v8/src/allocation.cc +122 -0
  237. data/lib/libv8/v8/src/allocation.h +143 -0
  238. data/lib/libv8/v8/src/api.cc +5845 -0
  239. data/lib/libv8/v8/src/api.h +574 -0
  240. data/lib/libv8/v8/src/apinatives.js +110 -0
  241. data/lib/libv8/v8/src/apiutils.h +73 -0
  242. data/lib/libv8/v8/src/arguments.h +118 -0
  243. data/lib/libv8/v8/src/arm/assembler-arm-inl.h +353 -0
  244. data/lib/libv8/v8/src/arm/assembler-arm.cc +2661 -0
  245. data/lib/libv8/v8/src/arm/assembler-arm.h +1375 -0
  246. data/lib/libv8/v8/src/arm/builtins-arm.cc +1658 -0
  247. data/lib/libv8/v8/src/arm/code-stubs-arm.cc +6398 -0
  248. data/lib/libv8/v8/src/arm/code-stubs-arm.h +673 -0
  249. data/lib/libv8/v8/src/arm/codegen-arm.cc +52 -0
  250. data/lib/libv8/v8/src/arm/codegen-arm.h +91 -0
  251. data/lib/libv8/v8/src/arm/constants-arm.cc +152 -0
  252. data/lib/libv8/v8/src/arm/constants-arm.h +775 -0
  253. data/lib/libv8/v8/src/arm/cpu-arm.cc +120 -0
  254. data/lib/libv8/v8/src/arm/debug-arm.cc +317 -0
  255. data/lib/libv8/v8/src/arm/deoptimizer-arm.cc +754 -0
  256. data/lib/libv8/v8/src/arm/disasm-arm.cc +1506 -0
  257. data/lib/libv8/v8/src/arm/frames-arm.cc +45 -0
  258. data/lib/libv8/v8/src/arm/frames-arm.h +168 -0
  259. data/lib/libv8/v8/src/arm/full-codegen-arm.cc +4375 -0
  260. data/lib/libv8/v8/src/arm/ic-arm.cc +1562 -0
  261. data/lib/libv8/v8/src/arm/lithium-arm.cc +2206 -0
  262. data/lib/libv8/v8/src/arm/lithium-arm.h +2348 -0
  263. data/lib/libv8/v8/src/arm/lithium-codegen-arm.cc +4526 -0
  264. data/lib/libv8/v8/src/arm/lithium-codegen-arm.h +403 -0
  265. data/lib/libv8/v8/src/arm/lithium-gap-resolver-arm.cc +305 -0
  266. data/lib/libv8/v8/src/arm/lithium-gap-resolver-arm.h +84 -0
  267. data/lib/libv8/v8/src/arm/macro-assembler-arm.cc +3163 -0
  268. data/lib/libv8/v8/src/arm/macro-assembler-arm.h +1126 -0
  269. data/lib/libv8/v8/src/arm/regexp-macro-assembler-arm.cc +1287 -0
  270. data/lib/libv8/v8/src/arm/regexp-macro-assembler-arm.h +253 -0
  271. data/lib/libv8/v8/src/arm/simulator-arm.cc +3424 -0
  272. data/lib/libv8/v8/src/arm/simulator-arm.h +431 -0
  273. data/lib/libv8/v8/src/arm/stub-cache-arm.cc +4243 -0
  274. data/lib/libv8/v8/src/array.js +1366 -0
  275. data/lib/libv8/v8/src/assembler.cc +1207 -0
  276. data/lib/libv8/v8/src/assembler.h +858 -0
  277. data/lib/libv8/v8/src/ast-inl.h +112 -0
  278. data/lib/libv8/v8/src/ast.cc +1146 -0
  279. data/lib/libv8/v8/src/ast.h +2188 -0
  280. data/lib/libv8/v8/src/atomicops.h +167 -0
  281. data/lib/libv8/v8/src/atomicops_internals_arm_gcc.h +145 -0
  282. data/lib/libv8/v8/src/atomicops_internals_mips_gcc.h +169 -0
  283. data/lib/libv8/v8/src/atomicops_internals_x86_gcc.cc +133 -0
  284. data/lib/libv8/v8/src/atomicops_internals_x86_gcc.h +287 -0
  285. data/lib/libv8/v8/src/atomicops_internals_x86_macosx.h +301 -0
  286. data/lib/libv8/v8/src/atomicops_internals_x86_msvc.h +203 -0
  287. data/lib/libv8/v8/src/bignum-dtoa.cc +655 -0
  288. data/lib/libv8/v8/src/bignum-dtoa.h +81 -0
  289. data/lib/libv8/v8/src/bignum.cc +768 -0
  290. data/lib/libv8/v8/src/bignum.h +140 -0
  291. data/lib/libv8/v8/src/bootstrapper.cc +2184 -0
  292. data/lib/libv8/v8/src/bootstrapper.h +188 -0
  293. data/lib/libv8/v8/src/builtins.cc +1707 -0
  294. data/lib/libv8/v8/src/builtins.h +371 -0
  295. data/lib/libv8/v8/src/bytecodes-irregexp.h +105 -0
  296. data/lib/libv8/v8/src/cached-powers.cc +177 -0
  297. data/lib/libv8/v8/src/cached-powers.h +65 -0
  298. data/lib/libv8/v8/src/char-predicates-inl.h +94 -0
  299. data/lib/libv8/v8/src/char-predicates.h +67 -0
  300. data/lib/libv8/v8/src/checks.cc +110 -0
  301. data/lib/libv8/v8/src/checks.h +296 -0
  302. data/lib/libv8/v8/src/circular-queue-inl.h +53 -0
  303. data/lib/libv8/v8/src/circular-queue.cc +122 -0
  304. data/lib/libv8/v8/src/circular-queue.h +103 -0
  305. data/lib/libv8/v8/src/code-stubs.cc +267 -0
  306. data/lib/libv8/v8/src/code-stubs.h +1011 -0
  307. data/lib/libv8/v8/src/code.h +70 -0
  308. data/lib/libv8/v8/src/codegen.cc +231 -0
  309. data/lib/libv8/v8/src/codegen.h +84 -0
  310. data/lib/libv8/v8/src/compilation-cache.cc +540 -0
  311. data/lib/libv8/v8/src/compilation-cache.h +287 -0
  312. data/lib/libv8/v8/src/compiler.cc +786 -0
  313. data/lib/libv8/v8/src/compiler.h +312 -0
  314. data/lib/libv8/v8/src/contexts.cc +347 -0
  315. data/lib/libv8/v8/src/contexts.h +391 -0
  316. data/lib/libv8/v8/src/conversions-inl.h +106 -0
  317. data/lib/libv8/v8/src/conversions.cc +1131 -0
  318. data/lib/libv8/v8/src/conversions.h +135 -0
  319. data/lib/libv8/v8/src/counters.cc +93 -0
  320. data/lib/libv8/v8/src/counters.h +254 -0
  321. data/lib/libv8/v8/src/cpu-profiler-inl.h +101 -0
  322. data/lib/libv8/v8/src/cpu-profiler.cc +609 -0
  323. data/lib/libv8/v8/src/cpu-profiler.h +302 -0
  324. data/lib/libv8/v8/src/cpu.h +69 -0
  325. data/lib/libv8/v8/src/d8-debug.cc +367 -0
  326. data/lib/libv8/v8/src/d8-debug.h +158 -0
  327. data/lib/libv8/v8/src/d8-posix.cc +695 -0
  328. data/lib/libv8/v8/src/d8-readline.cc +130 -0
  329. data/lib/libv8/v8/src/d8-windows.cc +42 -0
  330. data/lib/libv8/v8/src/d8.cc +803 -0
  331. data/lib/libv8/v8/src/d8.gyp +91 -0
  332. data/lib/libv8/v8/src/d8.h +235 -0
  333. data/lib/libv8/v8/src/d8.js +2798 -0
  334. data/lib/libv8/v8/src/data-flow.cc +66 -0
  335. data/lib/libv8/v8/src/data-flow.h +205 -0
  336. data/lib/libv8/v8/src/date.js +1103 -0
  337. data/lib/libv8/v8/src/dateparser-inl.h +127 -0
  338. data/lib/libv8/v8/src/dateparser.cc +178 -0
  339. data/lib/libv8/v8/src/dateparser.h +266 -0
  340. data/lib/libv8/v8/src/debug-agent.cc +447 -0
  341. data/lib/libv8/v8/src/debug-agent.h +129 -0
  342. data/lib/libv8/v8/src/debug-debugger.js +2569 -0
  343. data/lib/libv8/v8/src/debug.cc +3165 -0
  344. data/lib/libv8/v8/src/debug.h +1057 -0
  345. data/lib/libv8/v8/src/deoptimizer.cc +1256 -0
  346. data/lib/libv8/v8/src/deoptimizer.h +602 -0
  347. data/lib/libv8/v8/src/disasm.h +80 -0
  348. data/lib/libv8/v8/src/disassembler.cc +343 -0
  349. data/lib/libv8/v8/src/disassembler.h +58 -0
  350. data/lib/libv8/v8/src/diy-fp.cc +58 -0
  351. data/lib/libv8/v8/src/diy-fp.h +117 -0
  352. data/lib/libv8/v8/src/double.h +238 -0
  353. data/lib/libv8/v8/src/dtoa.cc +103 -0
  354. data/lib/libv8/v8/src/dtoa.h +85 -0
  355. data/lib/libv8/v8/src/execution.cc +849 -0
  356. data/lib/libv8/v8/src/execution.h +297 -0
  357. data/lib/libv8/v8/src/extensions/experimental/break-iterator.cc +250 -0
  358. data/lib/libv8/v8/src/extensions/experimental/break-iterator.h +89 -0
  359. data/lib/libv8/v8/src/extensions/experimental/collator.cc +218 -0
  360. data/lib/libv8/v8/src/extensions/experimental/collator.h +69 -0
  361. data/lib/libv8/v8/src/extensions/experimental/experimental.gyp +94 -0
  362. data/lib/libv8/v8/src/extensions/experimental/i18n-extension.cc +78 -0
  363. data/lib/libv8/v8/src/extensions/experimental/i18n-extension.h +54 -0
  364. data/lib/libv8/v8/src/extensions/experimental/i18n-locale.cc +112 -0
  365. data/lib/libv8/v8/src/extensions/experimental/i18n-locale.h +60 -0
  366. data/lib/libv8/v8/src/extensions/experimental/i18n-utils.cc +43 -0
  367. data/lib/libv8/v8/src/extensions/experimental/i18n-utils.h +49 -0
  368. data/lib/libv8/v8/src/extensions/experimental/i18n.js +180 -0
  369. data/lib/libv8/v8/src/extensions/experimental/language-matcher.cc +251 -0
  370. data/lib/libv8/v8/src/extensions/experimental/language-matcher.h +95 -0
  371. data/lib/libv8/v8/src/extensions/externalize-string-extension.cc +141 -0
  372. data/lib/libv8/v8/src/extensions/externalize-string-extension.h +50 -0
  373. data/lib/libv8/v8/src/extensions/gc-extension.cc +58 -0
  374. data/lib/libv8/v8/src/extensions/gc-extension.h +49 -0
  375. data/lib/libv8/v8/src/factory.cc +1222 -0
  376. data/lib/libv8/v8/src/factory.h +442 -0
  377. data/lib/libv8/v8/src/fast-dtoa.cc +736 -0
  378. data/lib/libv8/v8/src/fast-dtoa.h +83 -0
  379. data/lib/libv8/v8/src/fixed-dtoa.cc +405 -0
  380. data/lib/libv8/v8/src/fixed-dtoa.h +55 -0
  381. data/lib/libv8/v8/src/flag-definitions.h +560 -0
  382. data/lib/libv8/v8/src/flags.cc +551 -0
  383. data/lib/libv8/v8/src/flags.h +79 -0
  384. data/lib/libv8/v8/src/frames-inl.h +247 -0
  385. data/lib/libv8/v8/src/frames.cc +1243 -0
  386. data/lib/libv8/v8/src/frames.h +870 -0
  387. data/lib/libv8/v8/src/full-codegen.cc +1374 -0
  388. data/lib/libv8/v8/src/full-codegen.h +771 -0
  389. data/lib/libv8/v8/src/func-name-inferrer.cc +92 -0
  390. data/lib/libv8/v8/src/func-name-inferrer.h +111 -0
  391. data/lib/libv8/v8/src/gdb-jit.cc +1555 -0
  392. data/lib/libv8/v8/src/gdb-jit.h +143 -0
  393. data/lib/libv8/v8/src/global-handles.cc +665 -0
  394. data/lib/libv8/v8/src/global-handles.h +284 -0
  395. data/lib/libv8/v8/src/globals.h +325 -0
  396. data/lib/libv8/v8/src/handles-inl.h +177 -0
  397. data/lib/libv8/v8/src/handles.cc +987 -0
  398. data/lib/libv8/v8/src/handles.h +382 -0
  399. data/lib/libv8/v8/src/hashmap.cc +230 -0
  400. data/lib/libv8/v8/src/hashmap.h +123 -0
  401. data/lib/libv8/v8/src/heap-inl.h +704 -0
  402. data/lib/libv8/v8/src/heap-profiler.cc +1173 -0
  403. data/lib/libv8/v8/src/heap-profiler.h +397 -0
  404. data/lib/libv8/v8/src/heap.cc +5930 -0
  405. data/lib/libv8/v8/src/heap.h +2268 -0
  406. data/lib/libv8/v8/src/hydrogen-instructions.cc +1769 -0
  407. data/lib/libv8/v8/src/hydrogen-instructions.h +3971 -0
  408. data/lib/libv8/v8/src/hydrogen.cc +6239 -0
  409. data/lib/libv8/v8/src/hydrogen.h +1202 -0
  410. data/lib/libv8/v8/src/ia32/assembler-ia32-inl.h +446 -0
  411. data/lib/libv8/v8/src/ia32/assembler-ia32.cc +2487 -0
  412. data/lib/libv8/v8/src/ia32/assembler-ia32.h +1144 -0
  413. data/lib/libv8/v8/src/ia32/builtins-ia32.cc +1621 -0
  414. data/lib/libv8/v8/src/ia32/code-stubs-ia32.cc +6198 -0
  415. data/lib/libv8/v8/src/ia32/code-stubs-ia32.h +517 -0
  416. data/lib/libv8/v8/src/ia32/codegen-ia32.cc +265 -0
  417. data/lib/libv8/v8/src/ia32/codegen-ia32.h +79 -0
  418. data/lib/libv8/v8/src/ia32/cpu-ia32.cc +88 -0
  419. data/lib/libv8/v8/src/ia32/debug-ia32.cc +312 -0
  420. data/lib/libv8/v8/src/ia32/deoptimizer-ia32.cc +774 -0
  421. data/lib/libv8/v8/src/ia32/disasm-ia32.cc +1628 -0
  422. data/lib/libv8/v8/src/ia32/frames-ia32.cc +45 -0
  423. data/lib/libv8/v8/src/ia32/frames-ia32.h +142 -0
  424. data/lib/libv8/v8/src/ia32/full-codegen-ia32.cc +4338 -0
  425. data/lib/libv8/v8/src/ia32/ic-ia32.cc +1597 -0
  426. data/lib/libv8/v8/src/ia32/lithium-codegen-ia32.cc +4461 -0
  427. data/lib/libv8/v8/src/ia32/lithium-codegen-ia32.h +375 -0
  428. data/lib/libv8/v8/src/ia32/lithium-gap-resolver-ia32.cc +475 -0
  429. data/lib/libv8/v8/src/ia32/lithium-gap-resolver-ia32.h +110 -0
  430. data/lib/libv8/v8/src/ia32/lithium-ia32.cc +2261 -0
  431. data/lib/libv8/v8/src/ia32/lithium-ia32.h +2396 -0
  432. data/lib/libv8/v8/src/ia32/macro-assembler-ia32.cc +2136 -0
  433. data/lib/libv8/v8/src/ia32/macro-assembler-ia32.h +775 -0
  434. data/lib/libv8/v8/src/ia32/regexp-macro-assembler-ia32.cc +1263 -0
  435. data/lib/libv8/v8/src/ia32/regexp-macro-assembler-ia32.h +216 -0
  436. data/lib/libv8/v8/src/ia32/simulator-ia32.cc +30 -0
  437. data/lib/libv8/v8/src/ia32/simulator-ia32.h +74 -0
  438. data/lib/libv8/v8/src/ia32/stub-cache-ia32.cc +3847 -0
  439. data/lib/libv8/v8/src/ic-inl.h +130 -0
  440. data/lib/libv8/v8/src/ic.cc +2577 -0
  441. data/lib/libv8/v8/src/ic.h +736 -0
  442. data/lib/libv8/v8/src/inspector.cc +63 -0
  443. data/lib/libv8/v8/src/inspector.h +62 -0
  444. data/lib/libv8/v8/src/interpreter-irregexp.cc +659 -0
  445. data/lib/libv8/v8/src/interpreter-irregexp.h +49 -0
  446. data/lib/libv8/v8/src/isolate-inl.h +50 -0
  447. data/lib/libv8/v8/src/isolate.cc +1869 -0
  448. data/lib/libv8/v8/src/isolate.h +1382 -0
  449. data/lib/libv8/v8/src/json-parser.cc +504 -0
  450. data/lib/libv8/v8/src/json-parser.h +161 -0
  451. data/lib/libv8/v8/src/json.js +342 -0
  452. data/lib/libv8/v8/src/jsregexp.cc +5385 -0
  453. data/lib/libv8/v8/src/jsregexp.h +1492 -0
  454. data/lib/libv8/v8/src/list-inl.h +212 -0
  455. data/lib/libv8/v8/src/list.h +174 -0
  456. data/lib/libv8/v8/src/lithium-allocator-inl.h +142 -0
  457. data/lib/libv8/v8/src/lithium-allocator.cc +2123 -0
  458. data/lib/libv8/v8/src/lithium-allocator.h +630 -0
  459. data/lib/libv8/v8/src/lithium.cc +190 -0
  460. data/lib/libv8/v8/src/lithium.h +597 -0
  461. data/lib/libv8/v8/src/liveedit-debugger.js +1082 -0
  462. data/lib/libv8/v8/src/liveedit.cc +1691 -0
  463. data/lib/libv8/v8/src/liveedit.h +180 -0
  464. data/lib/libv8/v8/src/liveobjectlist-inl.h +126 -0
  465. data/lib/libv8/v8/src/liveobjectlist.cc +2589 -0
  466. data/lib/libv8/v8/src/liveobjectlist.h +322 -0
  467. data/lib/libv8/v8/src/log-inl.h +59 -0
  468. data/lib/libv8/v8/src/log-utils.cc +428 -0
  469. data/lib/libv8/v8/src/log-utils.h +231 -0
  470. data/lib/libv8/v8/src/log.cc +1993 -0
  471. data/lib/libv8/v8/src/log.h +476 -0
  472. data/lib/libv8/v8/src/macro-assembler.h +120 -0
  473. data/lib/libv8/v8/src/macros.py +178 -0
  474. data/lib/libv8/v8/src/mark-compact.cc +3143 -0
  475. data/lib/libv8/v8/src/mark-compact.h +506 -0
  476. data/lib/libv8/v8/src/math.js +264 -0
  477. data/lib/libv8/v8/src/messages.cc +179 -0
  478. data/lib/libv8/v8/src/messages.h +113 -0
  479. data/lib/libv8/v8/src/messages.js +1096 -0
  480. data/lib/libv8/v8/src/mips/assembler-mips-inl.h +312 -0
  481. data/lib/libv8/v8/src/mips/assembler-mips.cc +1960 -0
  482. data/lib/libv8/v8/src/mips/assembler-mips.h +1138 -0
  483. data/lib/libv8/v8/src/mips/builtins-mips.cc +1628 -0
  484. data/lib/libv8/v8/src/mips/code-stubs-mips.cc +6656 -0
  485. data/lib/libv8/v8/src/mips/code-stubs-mips.h +682 -0
  486. data/lib/libv8/v8/src/mips/codegen-mips.cc +52 -0
  487. data/lib/libv8/v8/src/mips/codegen-mips.h +98 -0
  488. data/lib/libv8/v8/src/mips/constants-mips.cc +352 -0
  489. data/lib/libv8/v8/src/mips/constants-mips.h +739 -0
  490. data/lib/libv8/v8/src/mips/cpu-mips.cc +96 -0
  491. data/lib/libv8/v8/src/mips/debug-mips.cc +308 -0
  492. data/lib/libv8/v8/src/mips/deoptimizer-mips.cc +91 -0
  493. data/lib/libv8/v8/src/mips/disasm-mips.cc +1050 -0
  494. data/lib/libv8/v8/src/mips/frames-mips.cc +47 -0
  495. data/lib/libv8/v8/src/mips/frames-mips.h +219 -0
  496. data/lib/libv8/v8/src/mips/full-codegen-mips.cc +4388 -0
  497. data/lib/libv8/v8/src/mips/ic-mips.cc +1580 -0
  498. data/lib/libv8/v8/src/mips/lithium-codegen-mips.h +65 -0
  499. data/lib/libv8/v8/src/mips/lithium-mips.h +307 -0
  500. data/lib/libv8/v8/src/mips/macro-assembler-mips.cc +4056 -0
  501. data/lib/libv8/v8/src/mips/macro-assembler-mips.h +1214 -0
  502. data/lib/libv8/v8/src/mips/regexp-macro-assembler-mips.cc +1251 -0
  503. data/lib/libv8/v8/src/mips/regexp-macro-assembler-mips.h +252 -0
  504. data/lib/libv8/v8/src/mips/simulator-mips.cc +2621 -0
  505. data/lib/libv8/v8/src/mips/simulator-mips.h +401 -0
  506. data/lib/libv8/v8/src/mips/stub-cache-mips.cc +4285 -0
  507. data/lib/libv8/v8/src/mirror-debugger.js +2382 -0
  508. data/lib/libv8/v8/src/mksnapshot.cc +328 -0
  509. data/lib/libv8/v8/src/natives.h +64 -0
  510. data/lib/libv8/v8/src/objects-debug.cc +738 -0
  511. data/lib/libv8/v8/src/objects-inl.h +4323 -0
  512. data/lib/libv8/v8/src/objects-printer.cc +829 -0
  513. data/lib/libv8/v8/src/objects-visiting.cc +148 -0
  514. data/lib/libv8/v8/src/objects-visiting.h +424 -0
  515. data/lib/libv8/v8/src/objects.cc +10585 -0
  516. data/lib/libv8/v8/src/objects.h +6838 -0
  517. data/lib/libv8/v8/src/parser.cc +4997 -0
  518. data/lib/libv8/v8/src/parser.h +765 -0
  519. data/lib/libv8/v8/src/platform-cygwin.cc +779 -0
  520. data/lib/libv8/v8/src/platform-freebsd.cc +826 -0
  521. data/lib/libv8/v8/src/platform-linux.cc +1149 -0
  522. data/lib/libv8/v8/src/platform-macos.cc +830 -0
  523. data/lib/libv8/v8/src/platform-nullos.cc +479 -0
  524. data/lib/libv8/v8/src/platform-openbsd.cc +640 -0
  525. data/lib/libv8/v8/src/platform-posix.cc +424 -0
  526. data/lib/libv8/v8/src/platform-solaris.cc +762 -0
  527. data/lib/libv8/v8/src/platform-tls-mac.h +62 -0
  528. data/lib/libv8/v8/src/platform-tls-win32.h +62 -0
  529. data/lib/libv8/v8/src/platform-tls.h +50 -0
  530. data/lib/libv8/v8/src/platform-win32.cc +2021 -0
  531. data/lib/libv8/v8/src/platform.h +667 -0
  532. data/lib/libv8/v8/src/preparse-data-format.h +62 -0
  533. data/lib/libv8/v8/src/preparse-data.cc +183 -0
  534. data/lib/libv8/v8/src/preparse-data.h +225 -0
  535. data/lib/libv8/v8/src/preparser-api.cc +220 -0
  536. data/lib/libv8/v8/src/preparser.cc +1450 -0
  537. data/lib/libv8/v8/src/preparser.h +493 -0
  538. data/lib/libv8/v8/src/prettyprinter.cc +1493 -0
  539. data/lib/libv8/v8/src/prettyprinter.h +223 -0
  540. data/lib/libv8/v8/src/profile-generator-inl.h +128 -0
  541. data/lib/libv8/v8/src/profile-generator.cc +3098 -0
  542. data/lib/libv8/v8/src/profile-generator.h +1126 -0
  543. data/lib/libv8/v8/src/property.cc +105 -0
  544. data/lib/libv8/v8/src/property.h +365 -0
  545. data/lib/libv8/v8/src/proxy.js +83 -0
  546. data/lib/libv8/v8/src/regexp-macro-assembler-irregexp-inl.h +78 -0
  547. data/lib/libv8/v8/src/regexp-macro-assembler-irregexp.cc +471 -0
  548. data/lib/libv8/v8/src/regexp-macro-assembler-irregexp.h +142 -0
  549. data/lib/libv8/v8/src/regexp-macro-assembler-tracer.cc +373 -0
  550. data/lib/libv8/v8/src/regexp-macro-assembler-tracer.h +104 -0
  551. data/lib/libv8/v8/src/regexp-macro-assembler.cc +267 -0
  552. data/lib/libv8/v8/src/regexp-macro-assembler.h +243 -0
  553. data/lib/libv8/v8/src/regexp-stack.cc +111 -0
  554. data/lib/libv8/v8/src/regexp-stack.h +147 -0
  555. data/lib/libv8/v8/src/regexp.js +483 -0
  556. data/lib/libv8/v8/src/rewriter.cc +360 -0
  557. data/lib/libv8/v8/src/rewriter.h +50 -0
  558. data/lib/libv8/v8/src/runtime-profiler.cc +489 -0
  559. data/lib/libv8/v8/src/runtime-profiler.h +201 -0
  560. data/lib/libv8/v8/src/runtime.cc +12227 -0
  561. data/lib/libv8/v8/src/runtime.h +652 -0
  562. data/lib/libv8/v8/src/runtime.js +649 -0
  563. data/lib/libv8/v8/src/safepoint-table.cc +256 -0
  564. data/lib/libv8/v8/src/safepoint-table.h +270 -0
  565. data/lib/libv8/v8/src/scanner-base.cc +952 -0
  566. data/lib/libv8/v8/src/scanner-base.h +670 -0
  567. data/lib/libv8/v8/src/scanner.cc +345 -0
  568. data/lib/libv8/v8/src/scanner.h +146 -0
  569. data/lib/libv8/v8/src/scopeinfo.cc +646 -0
  570. data/lib/libv8/v8/src/scopeinfo.h +254 -0
  571. data/lib/libv8/v8/src/scopes.cc +1150 -0
  572. data/lib/libv8/v8/src/scopes.h +507 -0
  573. data/lib/libv8/v8/src/serialize.cc +1574 -0
  574. data/lib/libv8/v8/src/serialize.h +589 -0
  575. data/lib/libv8/v8/src/shell.h +55 -0
  576. data/lib/libv8/v8/src/simulator.h +43 -0
  577. data/lib/libv8/v8/src/small-pointer-list.h +163 -0
  578. data/lib/libv8/v8/src/smart-pointer.h +109 -0
  579. data/lib/libv8/v8/src/snapshot-common.cc +83 -0
  580. data/lib/libv8/v8/src/snapshot-empty.cc +54 -0
  581. data/lib/libv8/v8/src/snapshot.h +91 -0
  582. data/lib/libv8/v8/src/spaces-inl.h +529 -0
  583. data/lib/libv8/v8/src/spaces.cc +3145 -0
  584. data/lib/libv8/v8/src/spaces.h +2369 -0
  585. data/lib/libv8/v8/src/splay-tree-inl.h +310 -0
  586. data/lib/libv8/v8/src/splay-tree.h +205 -0
  587. data/lib/libv8/v8/src/string-search.cc +41 -0
  588. data/lib/libv8/v8/src/string-search.h +568 -0
  589. data/lib/libv8/v8/src/string-stream.cc +592 -0
  590. data/lib/libv8/v8/src/string-stream.h +191 -0
  591. data/lib/libv8/v8/src/string.js +994 -0
  592. data/lib/libv8/v8/src/strtod.cc +440 -0
  593. data/lib/libv8/v8/src/strtod.h +40 -0
  594. data/lib/libv8/v8/src/stub-cache.cc +1965 -0
  595. data/lib/libv8/v8/src/stub-cache.h +924 -0
  596. data/lib/libv8/v8/src/third_party/valgrind/valgrind.h +3925 -0
  597. data/lib/libv8/v8/src/token.cc +63 -0
  598. data/lib/libv8/v8/src/token.h +288 -0
  599. data/lib/libv8/v8/src/type-info.cc +507 -0
  600. data/lib/libv8/v8/src/type-info.h +272 -0
  601. data/lib/libv8/v8/src/unbound-queue-inl.h +95 -0
  602. data/lib/libv8/v8/src/unbound-queue.h +69 -0
  603. data/lib/libv8/v8/src/unicode-inl.h +238 -0
  604. data/lib/libv8/v8/src/unicode.cc +1624 -0
  605. data/lib/libv8/v8/src/unicode.h +280 -0
  606. data/lib/libv8/v8/src/uri.js +408 -0
  607. data/lib/libv8/v8/src/utils-inl.h +48 -0
  608. data/lib/libv8/v8/src/utils.cc +371 -0
  609. data/lib/libv8/v8/src/utils.h +800 -0
  610. data/lib/libv8/v8/src/v8-counters.cc +62 -0
  611. data/lib/libv8/v8/src/v8-counters.h +314 -0
  612. data/lib/libv8/v8/src/v8.cc +213 -0
  613. data/lib/libv8/v8/src/v8.h +131 -0
  614. data/lib/libv8/v8/src/v8checks.h +64 -0
  615. data/lib/libv8/v8/src/v8dll-main.cc +44 -0
  616. data/lib/libv8/v8/src/v8globals.h +512 -0
  617. data/lib/libv8/v8/src/v8memory.h +82 -0
  618. data/lib/libv8/v8/src/v8natives.js +1310 -0
  619. data/lib/libv8/v8/src/v8preparserdll-main.cc +39 -0
  620. data/lib/libv8/v8/src/v8threads.cc +464 -0
  621. data/lib/libv8/v8/src/v8threads.h +165 -0
  622. data/lib/libv8/v8/src/v8utils.h +319 -0
  623. data/lib/libv8/v8/src/variables.cc +114 -0
  624. data/lib/libv8/v8/src/variables.h +167 -0
  625. data/lib/libv8/v8/src/version.cc +116 -0
  626. data/lib/libv8/v8/src/version.h +68 -0
  627. data/lib/libv8/v8/src/vm-state-inl.h +138 -0
  628. data/lib/libv8/v8/src/vm-state.h +71 -0
  629. data/lib/libv8/v8/src/win32-headers.h +96 -0
  630. data/lib/libv8/v8/src/x64/assembler-x64-inl.h +462 -0
  631. data/lib/libv8/v8/src/x64/assembler-x64.cc +3027 -0
  632. data/lib/libv8/v8/src/x64/assembler-x64.h +1633 -0
  633. data/lib/libv8/v8/src/x64/builtins-x64.cc +1520 -0
  634. data/lib/libv8/v8/src/x64/code-stubs-x64.cc +5132 -0
  635. data/lib/libv8/v8/src/x64/code-stubs-x64.h +514 -0
  636. data/lib/libv8/v8/src/x64/codegen-x64.cc +146 -0
  637. data/lib/libv8/v8/src/x64/codegen-x64.h +76 -0
  638. data/lib/libv8/v8/src/x64/cpu-x64.cc +88 -0
  639. data/lib/libv8/v8/src/x64/debug-x64.cc +319 -0
  640. data/lib/libv8/v8/src/x64/deoptimizer-x64.cc +815 -0
  641. data/lib/libv8/v8/src/x64/disasm-x64.cc +1832 -0
  642. data/lib/libv8/v8/src/x64/frames-x64.cc +45 -0
  643. data/lib/libv8/v8/src/x64/frames-x64.h +130 -0
  644. data/lib/libv8/v8/src/x64/full-codegen-x64.cc +4318 -0
  645. data/lib/libv8/v8/src/x64/ic-x64.cc +1608 -0
  646. data/lib/libv8/v8/src/x64/lithium-codegen-x64.cc +4267 -0
  647. data/lib/libv8/v8/src/x64/lithium-codegen-x64.h +367 -0
  648. data/lib/libv8/v8/src/x64/lithium-gap-resolver-x64.cc +320 -0
  649. data/lib/libv8/v8/src/x64/lithium-gap-resolver-x64.h +74 -0
  650. data/lib/libv8/v8/src/x64/lithium-x64.cc +2202 -0
  651. data/lib/libv8/v8/src/x64/lithium-x64.h +2333 -0
  652. data/lib/libv8/v8/src/x64/macro-assembler-x64.cc +3745 -0
  653. data/lib/libv8/v8/src/x64/macro-assembler-x64.h +1290 -0
  654. data/lib/libv8/v8/src/x64/regexp-macro-assembler-x64.cc +1398 -0
  655. data/lib/libv8/v8/src/x64/regexp-macro-assembler-x64.h +282 -0
  656. data/lib/libv8/v8/src/x64/simulator-x64.cc +27 -0
  657. data/lib/libv8/v8/src/x64/simulator-x64.h +72 -0
  658. data/lib/libv8/v8/src/x64/stub-cache-x64.cc +3610 -0
  659. data/lib/libv8/v8/src/zone-inl.h +140 -0
  660. data/lib/libv8/v8/src/zone.cc +196 -0
  661. data/lib/libv8/v8/src/zone.h +240 -0
  662. data/lib/libv8/v8/tools/codemap.js +265 -0
  663. data/lib/libv8/v8/tools/consarray.js +93 -0
  664. data/lib/libv8/v8/tools/csvparser.js +78 -0
  665. data/lib/libv8/v8/tools/disasm.py +92 -0
  666. data/lib/libv8/v8/tools/freebsd-tick-processor +10 -0
  667. data/lib/libv8/v8/tools/gc-nvp-trace-processor.py +342 -0
  668. data/lib/libv8/v8/tools/gcmole/README +62 -0
  669. data/lib/libv8/v8/tools/gcmole/gccause.lua +60 -0
  670. data/lib/libv8/v8/tools/gcmole/gcmole.cc +1261 -0
  671. data/lib/libv8/v8/tools/gcmole/gcmole.lua +378 -0
  672. data/lib/libv8/v8/tools/generate-ten-powers.scm +286 -0
  673. data/lib/libv8/v8/tools/grokdump.py +841 -0
  674. data/lib/libv8/v8/tools/gyp/v8.gyp +995 -0
  675. data/lib/libv8/v8/tools/js2c.py +364 -0
  676. data/lib/libv8/v8/tools/jsmin.py +280 -0
  677. data/lib/libv8/v8/tools/linux-tick-processor +35 -0
  678. data/lib/libv8/v8/tools/ll_prof.py +942 -0
  679. data/lib/libv8/v8/tools/logreader.js +185 -0
  680. data/lib/libv8/v8/tools/mac-nm +18 -0
  681. data/lib/libv8/v8/tools/mac-tick-processor +6 -0
  682. data/lib/libv8/v8/tools/oom_dump/README +31 -0
  683. data/lib/libv8/v8/tools/oom_dump/SConstruct +42 -0
  684. data/lib/libv8/v8/tools/oom_dump/oom_dump.cc +288 -0
  685. data/lib/libv8/v8/tools/presubmit.py +305 -0
  686. data/lib/libv8/v8/tools/process-heap-prof.py +120 -0
  687. data/lib/libv8/v8/tools/profile.js +751 -0
  688. data/lib/libv8/v8/tools/profile_view.js +219 -0
  689. data/lib/libv8/v8/tools/run-valgrind.py +77 -0
  690. data/lib/libv8/v8/tools/splaytree.js +316 -0
  691. data/lib/libv8/v8/tools/stats-viewer.py +468 -0
  692. data/lib/libv8/v8/tools/test.py +1510 -0
  693. data/lib/libv8/v8/tools/tickprocessor-driver.js +59 -0
  694. data/lib/libv8/v8/tools/tickprocessor.js +877 -0
  695. data/lib/libv8/v8/tools/utils.py +96 -0
  696. data/lib/libv8/v8/tools/visual_studio/README.txt +12 -0
  697. data/lib/libv8/v8/tools/windows-tick-processor.bat +30 -0
  698. data/lib/libv8/version.rb +4 -0
  699. data/libv8.gemspec +31 -0
  700. metadata +800 -0
@@ -0,0 +1,1366 @@
1
+ // Copyright 2010 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
+ // This file relies on the fact that the following declarations have been made
29
+ // in runtime.js:
30
+ // const $Array = global.Array;
31
+
32
+ // -------------------------------------------------------------------
33
+
34
+ // Global list of arrays visited during toString, toLocaleString and
35
+ // join invocations.
36
+ var visited_arrays = new InternalArray();
37
+
38
+
39
+ // Gets a sorted array of array keys. Useful for operations on sparse
40
+ // arrays. Dupes have not been removed.
41
+ function GetSortedArrayKeys(array, intervals) {
42
+ var length = intervals.length;
43
+ var keys = [];
44
+ for (var k = 0; k < length; k++) {
45
+ var key = intervals[k];
46
+ if (key < 0) {
47
+ var j = -1 - key;
48
+ var limit = j + intervals[++k];
49
+ for (; j < limit; j++) {
50
+ var e = array[j];
51
+ if (!IS_UNDEFINED(e) || j in array) {
52
+ keys.push(j);
53
+ }
54
+ }
55
+ } else {
56
+ // The case where key is undefined also ends here.
57
+ if (!IS_UNDEFINED(key)) {
58
+ var e = array[key];
59
+ if (!IS_UNDEFINED(e) || key in array) {
60
+ keys.push(key);
61
+ }
62
+ }
63
+ }
64
+ }
65
+ keys.sort(function(a, b) { return a - b; });
66
+ return keys;
67
+ }
68
+
69
+
70
+ function SparseJoinWithSeparator(array, len, convert, separator) {
71
+ var keys = GetSortedArrayKeys(array, %GetArrayKeys(array, len));
72
+ var totalLength = 0;
73
+ var elements = new InternalArray(keys.length * 2);
74
+ var previousKey = -1;
75
+ for (var i = 0; i < keys.length; i++) {
76
+ var key = keys[i];
77
+ if (key != previousKey) { // keys may contain duplicates.
78
+ var e = array[key];
79
+ if (!IS_STRING(e)) e = convert(e);
80
+ elements[i * 2] = key;
81
+ elements[i * 2 + 1] = e;
82
+ previousKey = key;
83
+ }
84
+ }
85
+ return %SparseJoinWithSeparator(elements, len, separator);
86
+ }
87
+
88
+
89
+ // Optimized for sparse arrays if separator is ''.
90
+ function SparseJoin(array, len, convert) {
91
+ var keys = GetSortedArrayKeys(array, %GetArrayKeys(array, len));
92
+ var last_key = -1;
93
+ var keys_length = keys.length;
94
+
95
+ var elements = new InternalArray(keys_length);
96
+ var elements_length = 0;
97
+
98
+ for (var i = 0; i < keys_length; i++) {
99
+ var key = keys[i];
100
+ if (key != last_key) {
101
+ var e = array[key];
102
+ if (!IS_STRING(e)) e = convert(e);
103
+ elements[elements_length++] = e;
104
+ last_key = key;
105
+ }
106
+ }
107
+ return %StringBuilderConcat(elements, elements_length, '');
108
+ }
109
+
110
+
111
+ function UseSparseVariant(object, length, is_array) {
112
+ return is_array &&
113
+ length > 1000 &&
114
+ (!%_IsSmi(length) ||
115
+ %EstimateNumberOfElements(object) < (length >> 2));
116
+ }
117
+
118
+
119
+ function Join(array, length, separator, convert) {
120
+ if (length == 0) return '';
121
+
122
+ var is_array = IS_ARRAY(array);
123
+
124
+ if (is_array) {
125
+ // If the array is cyclic, return the empty string for already
126
+ // visited arrays.
127
+ if (!%PushIfAbsent(visited_arrays, array)) return '';
128
+ }
129
+
130
+ // Attempt to convert the elements.
131
+ try {
132
+ if (UseSparseVariant(array, length, is_array)) {
133
+ if (separator.length == 0) {
134
+ return SparseJoin(array, length, convert);
135
+ } else {
136
+ return SparseJoinWithSeparator(array, length, convert, separator);
137
+ }
138
+ }
139
+
140
+ // Fast case for one-element arrays.
141
+ if (length == 1) {
142
+ var e = array[0];
143
+ if (IS_STRING(e)) return e;
144
+ return convert(e);
145
+ }
146
+
147
+ // Construct an array for the elements.
148
+ var elements = new InternalArray(length);
149
+
150
+ // We pull the empty separator check outside the loop for speed!
151
+ if (separator.length == 0) {
152
+ var elements_length = 0;
153
+ for (var i = 0; i < length; i++) {
154
+ var e = array[i];
155
+ if (!IS_STRING(e)) e = convert(e);
156
+ elements[elements_length++] = e;
157
+ }
158
+ elements.length = elements_length;
159
+ var result = %_FastAsciiArrayJoin(elements, '');
160
+ if (!IS_UNDEFINED(result)) return result;
161
+ return %StringBuilderConcat(elements, elements_length, '');
162
+ }
163
+ // Non-empty separator case.
164
+ // If the first element is a number then use the heuristic that the
165
+ // remaining elements are also likely to be numbers.
166
+ if (!IS_NUMBER(array[0])) {
167
+ for (var i = 0; i < length; i++) {
168
+ var e = array[i];
169
+ if (!IS_STRING(e)) e = convert(e);
170
+ elements[i] = e;
171
+ }
172
+ } else {
173
+ for (var i = 0; i < length; i++) {
174
+ var e = array[i];
175
+ if (IS_NUMBER(e)) {
176
+ e = %_NumberToString(e);
177
+ } else if (!IS_STRING(e)) {
178
+ e = convert(e);
179
+ }
180
+ elements[i] = e;
181
+ }
182
+ }
183
+ var result = %_FastAsciiArrayJoin(elements, separator);
184
+ if (!IS_UNDEFINED(result)) return result;
185
+
186
+ return %StringBuilderJoin(elements, length, separator);
187
+ } finally {
188
+ // Make sure to remove the last element of the visited array no
189
+ // matter what happens.
190
+ if (is_array) visited_arrays.length = visited_arrays.length - 1;
191
+ }
192
+ }
193
+
194
+
195
+ function ConvertToString(x) {
196
+ // Assumes x is a non-string.
197
+ if (IS_NUMBER(x)) return %_NumberToString(x);
198
+ if (IS_BOOLEAN(x)) return x ? 'true' : 'false';
199
+ return (IS_NULL_OR_UNDEFINED(x)) ? '' : %ToString(%DefaultString(x));
200
+ }
201
+
202
+
203
+ function ConvertToLocaleString(e) {
204
+ if (e == null) {
205
+ return '';
206
+ } else {
207
+ // e_obj's toLocaleString might be overwritten, check if it is a function.
208
+ // Call ToString if toLocaleString is not a function.
209
+ // See issue 877615.
210
+ var e_obj = ToObject(e);
211
+ if (IS_FUNCTION(e_obj.toLocaleString))
212
+ return ToString(e_obj.toLocaleString());
213
+ else
214
+ return ToString(e);
215
+ }
216
+ }
217
+
218
+
219
+ // This function implements the optimized splice implementation that can use
220
+ // special array operations to handle sparse arrays in a sensible fashion.
221
+ function SmartSlice(array, start_i, del_count, len, deleted_elements) {
222
+ // Move deleted elements to a new array (the return value from splice).
223
+ // Intervals array can contain keys and intervals. See comment in Concat.
224
+ var intervals = %GetArrayKeys(array, start_i + del_count);
225
+ var length = intervals.length;
226
+ for (var k = 0; k < length; k++) {
227
+ var key = intervals[k];
228
+ if (key < 0) {
229
+ var j = -1 - key;
230
+ var interval_limit = j + intervals[++k];
231
+ if (j < start_i) {
232
+ j = start_i;
233
+ }
234
+ for (; j < interval_limit; j++) {
235
+ // ECMA-262 15.4.4.12 line 10. The spec could also be
236
+ // interpreted such that %HasLocalProperty would be the
237
+ // appropriate test. We follow KJS in consulting the
238
+ // prototype.
239
+ var current = array[j];
240
+ if (!IS_UNDEFINED(current) || j in array) {
241
+ deleted_elements[j - start_i] = current;
242
+ }
243
+ }
244
+ } else {
245
+ if (!IS_UNDEFINED(key)) {
246
+ if (key >= start_i) {
247
+ // ECMA-262 15.4.4.12 line 10. The spec could also be
248
+ // interpreted such that %HasLocalProperty would be the
249
+ // appropriate test. We follow KJS in consulting the
250
+ // prototype.
251
+ var current = array[key];
252
+ if (!IS_UNDEFINED(current) || key in array) {
253
+ deleted_elements[key - start_i] = current;
254
+ }
255
+ }
256
+ }
257
+ }
258
+ }
259
+ }
260
+
261
+
262
+ // This function implements the optimized splice implementation that can use
263
+ // special array operations to handle sparse arrays in a sensible fashion.
264
+ function SmartMove(array, start_i, del_count, len, num_additional_args) {
265
+ // Move data to new array.
266
+ var new_array = new InternalArray(len - del_count + num_additional_args);
267
+ var intervals = %GetArrayKeys(array, len);
268
+ var length = intervals.length;
269
+ for (var k = 0; k < length; k++) {
270
+ var key = intervals[k];
271
+ if (key < 0) {
272
+ var j = -1 - key;
273
+ var interval_limit = j + intervals[++k];
274
+ while (j < start_i && j < interval_limit) {
275
+ // The spec could also be interpreted such that
276
+ // %HasLocalProperty would be the appropriate test. We follow
277
+ // KJS in consulting the prototype.
278
+ var current = array[j];
279
+ if (!IS_UNDEFINED(current) || j in array) {
280
+ new_array[j] = current;
281
+ }
282
+ j++;
283
+ }
284
+ j = start_i + del_count;
285
+ while (j < interval_limit) {
286
+ // ECMA-262 15.4.4.12 lines 24 and 41. The spec could also be
287
+ // interpreted such that %HasLocalProperty would be the
288
+ // appropriate test. We follow KJS in consulting the
289
+ // prototype.
290
+ var current = array[j];
291
+ if (!IS_UNDEFINED(current) || j in array) {
292
+ new_array[j - del_count + num_additional_args] = current;
293
+ }
294
+ j++;
295
+ }
296
+ } else {
297
+ if (!IS_UNDEFINED(key)) {
298
+ if (key < start_i) {
299
+ // The spec could also be interpreted such that
300
+ // %HasLocalProperty would be the appropriate test. We follow
301
+ // KJS in consulting the prototype.
302
+ var current = array[key];
303
+ if (!IS_UNDEFINED(current) || key in array) {
304
+ new_array[key] = current;
305
+ }
306
+ } else if (key >= start_i + del_count) {
307
+ // ECMA-262 15.4.4.12 lines 24 and 41. The spec could also
308
+ // be interpreted such that %HasLocalProperty would be the
309
+ // appropriate test. We follow KJS in consulting the
310
+ // prototype.
311
+ var current = array[key];
312
+ if (!IS_UNDEFINED(current) || key in array) {
313
+ new_array[key - del_count + num_additional_args] = current;
314
+ }
315
+ }
316
+ }
317
+ }
318
+ }
319
+ // Move contents of new_array into this array
320
+ %MoveArrayContents(new_array, array);
321
+ }
322
+
323
+
324
+ // This is part of the old simple-minded splice. We are using it either
325
+ // because the receiver is not an array (so we have no choice) or because we
326
+ // know we are not deleting or moving a lot of elements.
327
+ function SimpleSlice(array, start_i, del_count, len, deleted_elements) {
328
+ for (var i = 0; i < del_count; i++) {
329
+ var index = start_i + i;
330
+ // The spec could also be interpreted such that %HasLocalProperty
331
+ // would be the appropriate test. We follow KJS in consulting the
332
+ // prototype.
333
+ var current = array[index];
334
+ if (!IS_UNDEFINED(current) || index in array)
335
+ deleted_elements[i] = current;
336
+ }
337
+ }
338
+
339
+
340
+ function SimpleMove(array, start_i, del_count, len, num_additional_args) {
341
+ if (num_additional_args !== del_count) {
342
+ // Move the existing elements after the elements to be deleted
343
+ // to the right position in the resulting array.
344
+ if (num_additional_args > del_count) {
345
+ for (var i = len - del_count; i > start_i; i--) {
346
+ var from_index = i + del_count - 1;
347
+ var to_index = i + num_additional_args - 1;
348
+ // The spec could also be interpreted such that
349
+ // %HasLocalProperty would be the appropriate test. We follow
350
+ // KJS in consulting the prototype.
351
+ var current = array[from_index];
352
+ if (!IS_UNDEFINED(current) || from_index in array) {
353
+ array[to_index] = current;
354
+ } else {
355
+ delete array[to_index];
356
+ }
357
+ }
358
+ } else {
359
+ for (var i = start_i; i < len - del_count; i++) {
360
+ var from_index = i + del_count;
361
+ var to_index = i + num_additional_args;
362
+ // The spec could also be interpreted such that
363
+ // %HasLocalProperty would be the appropriate test. We follow
364
+ // KJS in consulting the prototype.
365
+ var current = array[from_index];
366
+ if (!IS_UNDEFINED(current) || from_index in array) {
367
+ array[to_index] = current;
368
+ } else {
369
+ delete array[to_index];
370
+ }
371
+ }
372
+ for (var i = len; i > len - del_count + num_additional_args; i--) {
373
+ delete array[i - 1];
374
+ }
375
+ }
376
+ }
377
+ }
378
+
379
+
380
+ // -------------------------------------------------------------------
381
+
382
+
383
+ function ArrayToString() {
384
+ if (!IS_ARRAY(this)) {
385
+ throw new $TypeError('Array.prototype.toString is not generic');
386
+ }
387
+ return Join(this, this.length, ',', ConvertToString);
388
+ }
389
+
390
+
391
+ function ArrayToLocaleString() {
392
+ if (!IS_ARRAY(this)) {
393
+ throw new $TypeError('Array.prototype.toString is not generic');
394
+ }
395
+ return Join(this, this.length, ',', ConvertToLocaleString);
396
+ }
397
+
398
+
399
+ function ArrayJoin(separator) {
400
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
401
+ throw MakeTypeError("called_on_null_or_undefined",
402
+ ["Array.prototype.join"]);
403
+ }
404
+
405
+ if (IS_UNDEFINED(separator)) {
406
+ separator = ',';
407
+ } else if (!IS_STRING(separator)) {
408
+ separator = NonStringToString(separator);
409
+ }
410
+
411
+ var result = %_FastAsciiArrayJoin(this, separator);
412
+ if (!IS_UNDEFINED(result)) return result;
413
+
414
+ return Join(this, TO_UINT32(this.length), separator, ConvertToString);
415
+ }
416
+
417
+
418
+ // Removes the last element from the array and returns it. See
419
+ // ECMA-262, section 15.4.4.6.
420
+ function ArrayPop() {
421
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
422
+ throw MakeTypeError("called_on_null_or_undefined",
423
+ ["Array.prototype.pop"]);
424
+ }
425
+
426
+ var n = TO_UINT32(this.length);
427
+ if (n == 0) {
428
+ this.length = n;
429
+ return;
430
+ }
431
+ n--;
432
+ var value = this[n];
433
+ this.length = n;
434
+ delete this[n];
435
+ return value;
436
+ }
437
+
438
+
439
+ // Appends the arguments to the end of the array and returns the new
440
+ // length of the array. See ECMA-262, section 15.4.4.7.
441
+ function ArrayPush() {
442
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
443
+ throw MakeTypeError("called_on_null_or_undefined",
444
+ ["Array.prototype.push"]);
445
+ }
446
+
447
+ var n = TO_UINT32(this.length);
448
+ var m = %_ArgumentsLength();
449
+ for (var i = 0; i < m; i++) {
450
+ this[i+n] = %_Arguments(i);
451
+ }
452
+ this.length = n + m;
453
+ return this.length;
454
+ }
455
+
456
+
457
+ function ArrayConcat(arg1) { // length == 1
458
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
459
+ throw MakeTypeError("called_on_null_or_undefined",
460
+ ["Array.prototype.concat"]);
461
+ }
462
+
463
+ var arg_count = %_ArgumentsLength();
464
+ var arrays = new InternalArray(1 + arg_count);
465
+ arrays[0] = this;
466
+ for (var i = 0; i < arg_count; i++) {
467
+ arrays[i + 1] = %_Arguments(i);
468
+ }
469
+
470
+ return %ArrayConcat(arrays);
471
+ }
472
+
473
+
474
+ // For implementing reverse() on large, sparse arrays.
475
+ function SparseReverse(array, len) {
476
+ var keys = GetSortedArrayKeys(array, %GetArrayKeys(array, len));
477
+ var high_counter = keys.length - 1;
478
+ var low_counter = 0;
479
+ while (low_counter <= high_counter) {
480
+ var i = keys[low_counter];
481
+ var j = keys[high_counter];
482
+
483
+ var j_complement = len - j - 1;
484
+ var low, high;
485
+
486
+ if (j_complement <= i) {
487
+ high = j;
488
+ while (keys[--high_counter] == j);
489
+ low = j_complement;
490
+ }
491
+ if (j_complement >= i) {
492
+ low = i;
493
+ while (keys[++low_counter] == i);
494
+ high = len - i - 1;
495
+ }
496
+
497
+ var current_i = array[low];
498
+ if (!IS_UNDEFINED(current_i) || low in array) {
499
+ var current_j = array[high];
500
+ if (!IS_UNDEFINED(current_j) || high in array) {
501
+ array[low] = current_j;
502
+ array[high] = current_i;
503
+ } else {
504
+ array[high] = current_i;
505
+ delete array[low];
506
+ }
507
+ } else {
508
+ var current_j = array[high];
509
+ if (!IS_UNDEFINED(current_j) || high in array) {
510
+ array[low] = current_j;
511
+ delete array[high];
512
+ }
513
+ }
514
+ }
515
+ }
516
+
517
+
518
+ function ArrayReverse() {
519
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
520
+ throw MakeTypeError("called_on_null_or_undefined",
521
+ ["Array.prototype.reverse"]);
522
+ }
523
+
524
+ var j = TO_UINT32(this.length) - 1;
525
+
526
+ if (UseSparseVariant(this, j, IS_ARRAY(this))) {
527
+ SparseReverse(this, j+1);
528
+ return this;
529
+ }
530
+
531
+ for (var i = 0; i < j; i++, j--) {
532
+ var current_i = this[i];
533
+ if (!IS_UNDEFINED(current_i) || i in this) {
534
+ var current_j = this[j];
535
+ if (!IS_UNDEFINED(current_j) || j in this) {
536
+ this[i] = current_j;
537
+ this[j] = current_i;
538
+ } else {
539
+ this[j] = current_i;
540
+ delete this[i];
541
+ }
542
+ } else {
543
+ var current_j = this[j];
544
+ if (!IS_UNDEFINED(current_j) || j in this) {
545
+ this[i] = current_j;
546
+ delete this[j];
547
+ }
548
+ }
549
+ }
550
+ return this;
551
+ }
552
+
553
+
554
+ function ArrayShift() {
555
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
556
+ throw MakeTypeError("called_on_null_or_undefined",
557
+ ["Array.prototype.shift"]);
558
+ }
559
+
560
+ var len = TO_UINT32(this.length);
561
+
562
+ if (len === 0) {
563
+ this.length = 0;
564
+ return;
565
+ }
566
+
567
+ var first = this[0];
568
+
569
+ if (IS_ARRAY(this))
570
+ SmartMove(this, 0, 1, len, 0);
571
+ else
572
+ SimpleMove(this, 0, 1, len, 0);
573
+
574
+ this.length = len - 1;
575
+
576
+ return first;
577
+ }
578
+
579
+
580
+ function ArrayUnshift(arg1) { // length == 1
581
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
582
+ throw MakeTypeError("called_on_null_or_undefined",
583
+ ["Array.prototype.unshift"]);
584
+ }
585
+
586
+ var len = TO_UINT32(this.length);
587
+ var num_arguments = %_ArgumentsLength();
588
+
589
+ if (IS_ARRAY(this))
590
+ SmartMove(this, 0, 0, len, num_arguments);
591
+ else
592
+ SimpleMove(this, 0, 0, len, num_arguments);
593
+
594
+ for (var i = 0; i < num_arguments; i++) {
595
+ this[i] = %_Arguments(i);
596
+ }
597
+
598
+ this.length = len + num_arguments;
599
+
600
+ return len + num_arguments;
601
+ }
602
+
603
+
604
+ function ArraySlice(start, end) {
605
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
606
+ throw MakeTypeError("called_on_null_or_undefined",
607
+ ["Array.prototype.slice"]);
608
+ }
609
+
610
+ var len = TO_UINT32(this.length);
611
+ var start_i = TO_INTEGER(start);
612
+ var end_i = len;
613
+
614
+ if (end !== void 0) end_i = TO_INTEGER(end);
615
+
616
+ if (start_i < 0) {
617
+ start_i += len;
618
+ if (start_i < 0) start_i = 0;
619
+ } else {
620
+ if (start_i > len) start_i = len;
621
+ }
622
+
623
+ if (end_i < 0) {
624
+ end_i += len;
625
+ if (end_i < 0) end_i = 0;
626
+ } else {
627
+ if (end_i > len) end_i = len;
628
+ }
629
+
630
+ var result = [];
631
+
632
+ if (end_i < start_i) return result;
633
+
634
+ if (IS_ARRAY(this)) {
635
+ SmartSlice(this, start_i, end_i - start_i, len, result);
636
+ } else {
637
+ SimpleSlice(this, start_i, end_i - start_i, len, result);
638
+ }
639
+
640
+ result.length = end_i - start_i;
641
+
642
+ return result;
643
+ }
644
+
645
+
646
+ function ArraySplice(start, delete_count) {
647
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
648
+ throw MakeTypeError("called_on_null_or_undefined",
649
+ ["Array.prototype.splice"]);
650
+ }
651
+
652
+ var num_arguments = %_ArgumentsLength();
653
+
654
+ var len = TO_UINT32(this.length);
655
+ var start_i = TO_INTEGER(start);
656
+
657
+ if (start_i < 0) {
658
+ start_i += len;
659
+ if (start_i < 0) start_i = 0;
660
+ } else {
661
+ if (start_i > len) start_i = len;
662
+ }
663
+
664
+ // SpiderMonkey, TraceMonkey and JSC treat the case where no delete count is
665
+ // given as a request to delete all the elements from the start.
666
+ // And it differs from the case of undefined delete count.
667
+ // This does not follow ECMA-262, but we do the same for
668
+ // compatibility.
669
+ var del_count = 0;
670
+ if (num_arguments == 1) {
671
+ del_count = len - start_i;
672
+ } else {
673
+ del_count = TO_INTEGER(delete_count);
674
+ if (del_count < 0) del_count = 0;
675
+ if (del_count > len - start_i) del_count = len - start_i;
676
+ }
677
+
678
+ var deleted_elements = [];
679
+ deleted_elements.length = del_count;
680
+
681
+ // Number of elements to add.
682
+ var num_additional_args = 0;
683
+ if (num_arguments > 2) {
684
+ num_additional_args = num_arguments - 2;
685
+ }
686
+
687
+ var use_simple_splice = true;
688
+
689
+ if (IS_ARRAY(this) && num_additional_args !== del_count) {
690
+ // If we are only deleting/moving a few things near the end of the
691
+ // array then the simple version is going to be faster, because it
692
+ // doesn't touch most of the array.
693
+ var estimated_non_hole_elements = %EstimateNumberOfElements(this);
694
+ if (len > 20 && (estimated_non_hole_elements >> 2) < (len - start_i)) {
695
+ use_simple_splice = false;
696
+ }
697
+ }
698
+
699
+ if (use_simple_splice) {
700
+ SimpleSlice(this, start_i, del_count, len, deleted_elements);
701
+ SimpleMove(this, start_i, del_count, len, num_additional_args);
702
+ } else {
703
+ SmartSlice(this, start_i, del_count, len, deleted_elements);
704
+ SmartMove(this, start_i, del_count, len, num_additional_args);
705
+ }
706
+
707
+ // Insert the arguments into the resulting array in
708
+ // place of the deleted elements.
709
+ var i = start_i;
710
+ var arguments_index = 2;
711
+ var arguments_length = %_ArgumentsLength();
712
+ while (arguments_index < arguments_length) {
713
+ this[i++] = %_Arguments(arguments_index++);
714
+ }
715
+ this.length = len - del_count + num_additional_args;
716
+
717
+ // Return the deleted elements.
718
+ return deleted_elements;
719
+ }
720
+
721
+
722
+ function ArraySort(comparefn) {
723
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
724
+ throw MakeTypeError("called_on_null_or_undefined",
725
+ ["Array.prototype.sort"]);
726
+ }
727
+
728
+ // In-place QuickSort algorithm.
729
+ // For short (length <= 22) arrays, insertion sort is used for efficiency.
730
+
731
+ if (!IS_FUNCTION(comparefn)) {
732
+ comparefn = function (x, y) {
733
+ if (x === y) return 0;
734
+ if (%_IsSmi(x) && %_IsSmi(y)) {
735
+ return %SmiLexicographicCompare(x, y);
736
+ }
737
+ x = ToString(x);
738
+ y = ToString(y);
739
+ if (x == y) return 0;
740
+ else return x < y ? -1 : 1;
741
+ };
742
+ }
743
+ var global_receiver = %GetGlobalReceiver();
744
+
745
+ function InsertionSort(a, from, to) {
746
+ for (var i = from + 1; i < to; i++) {
747
+ var element = a[i];
748
+ for (var j = i - 1; j >= from; j--) {
749
+ var tmp = a[j];
750
+ var order = %_CallFunction(global_receiver, tmp, element, comparefn);
751
+ if (order > 0) {
752
+ a[j + 1] = tmp;
753
+ } else {
754
+ break;
755
+ }
756
+ }
757
+ a[j + 1] = element;
758
+ }
759
+ }
760
+
761
+ function QuickSort(a, from, to) {
762
+ // Insertion sort is faster for short arrays.
763
+ if (to - from <= 10) {
764
+ InsertionSort(a, from, to);
765
+ return;
766
+ }
767
+ // Find a pivot as the median of first, last and middle element.
768
+ var v0 = a[from];
769
+ var v1 = a[to - 1];
770
+ var middle_index = from + ((to - from) >> 1);
771
+ var v2 = a[middle_index];
772
+ var c01 = %_CallFunction(global_receiver, v0, v1, comparefn);
773
+ if (c01 > 0) {
774
+ // v1 < v0, so swap them.
775
+ var tmp = v0;
776
+ v0 = v1;
777
+ v1 = tmp;
778
+ } // v0 <= v1.
779
+ var c02 = %_CallFunction(global_receiver, v0, v2, comparefn);
780
+ if (c02 >= 0) {
781
+ // v2 <= v0 <= v1.
782
+ var tmp = v0;
783
+ v0 = v2;
784
+ v2 = v1;
785
+ v1 = tmp;
786
+ } else {
787
+ // v0 <= v1 && v0 < v2
788
+ var c12 = %_CallFunction(global_receiver, v1, v2, comparefn);
789
+ if (c12 > 0) {
790
+ // v0 <= v2 < v1
791
+ var tmp = v1;
792
+ v1 = v2;
793
+ v2 = tmp;
794
+ }
795
+ }
796
+ // v0 <= v1 <= v2
797
+ a[from] = v0;
798
+ a[to - 1] = v2;
799
+ var pivot = v1;
800
+ var low_end = from + 1; // Upper bound of elements lower than pivot.
801
+ var high_start = to - 1; // Lower bound of elements greater than pivot.
802
+ a[middle_index] = a[low_end];
803
+ a[low_end] = pivot;
804
+
805
+ // From low_end to i are elements equal to pivot.
806
+ // From i to high_start are elements that haven't been compared yet.
807
+ partition: for (var i = low_end + 1; i < high_start; i++) {
808
+ var element = a[i];
809
+ var order = %_CallFunction(global_receiver, element, pivot, comparefn);
810
+ if (order < 0) {
811
+ %_SwapElements(a, i, low_end);
812
+ low_end++;
813
+ } else if (order > 0) {
814
+ do {
815
+ high_start--;
816
+ if (high_start == i) break partition;
817
+ var top_elem = a[high_start];
818
+ order = %_CallFunction(global_receiver, top_elem, pivot, comparefn);
819
+ } while (order > 0);
820
+ %_SwapElements(a, i, high_start);
821
+ if (order < 0) {
822
+ %_SwapElements(a, i, low_end);
823
+ low_end++;
824
+ }
825
+ }
826
+ }
827
+ QuickSort(a, from, low_end);
828
+ QuickSort(a, high_start, to);
829
+ }
830
+
831
+ // Copy elements in the range 0..length from obj's prototype chain
832
+ // to obj itself, if obj has holes. Return one more than the maximal index
833
+ // of a prototype property.
834
+ function CopyFromPrototype(obj, length) {
835
+ var max = 0;
836
+ for (var proto = obj.__proto__; proto; proto = proto.__proto__) {
837
+ var indices = %GetArrayKeys(proto, length);
838
+ if (indices.length > 0) {
839
+ if (indices[0] == -1) {
840
+ // It's an interval.
841
+ var proto_length = indices[1];
842
+ for (var i = 0; i < proto_length; i++) {
843
+ if (!obj.hasOwnProperty(i) && proto.hasOwnProperty(i)) {
844
+ obj[i] = proto[i];
845
+ if (i >= max) { max = i + 1; }
846
+ }
847
+ }
848
+ } else {
849
+ for (var i = 0; i < indices.length; i++) {
850
+ var index = indices[i];
851
+ if (!IS_UNDEFINED(index) &&
852
+ !obj.hasOwnProperty(index) && proto.hasOwnProperty(index)) {
853
+ obj[index] = proto[index];
854
+ if (index >= max) { max = index + 1; }
855
+ }
856
+ }
857
+ }
858
+ }
859
+ }
860
+ return max;
861
+ }
862
+
863
+ // Set a value of "undefined" on all indices in the range from..to
864
+ // where a prototype of obj has an element. I.e., shadow all prototype
865
+ // elements in that range.
866
+ function ShadowPrototypeElements(obj, from, to) {
867
+ for (var proto = obj.__proto__; proto; proto = proto.__proto__) {
868
+ var indices = %GetArrayKeys(proto, to);
869
+ if (indices.length > 0) {
870
+ if (indices[0] == -1) {
871
+ // It's an interval.
872
+ var proto_length = indices[1];
873
+ for (var i = from; i < proto_length; i++) {
874
+ if (proto.hasOwnProperty(i)) {
875
+ obj[i] = void 0;
876
+ }
877
+ }
878
+ } else {
879
+ for (var i = 0; i < indices.length; i++) {
880
+ var index = indices[i];
881
+ if (!IS_UNDEFINED(index) && from <= index &&
882
+ proto.hasOwnProperty(index)) {
883
+ obj[index] = void 0;
884
+ }
885
+ }
886
+ }
887
+ }
888
+ }
889
+ }
890
+
891
+ function SafeRemoveArrayHoles(obj) {
892
+ // Copy defined elements from the end to fill in all holes and undefineds
893
+ // in the beginning of the array. Write undefineds and holes at the end
894
+ // after loop is finished.
895
+ var first_undefined = 0;
896
+ var last_defined = length - 1;
897
+ var num_holes = 0;
898
+ while (first_undefined < last_defined) {
899
+ // Find first undefined element.
900
+ while (first_undefined < last_defined &&
901
+ !IS_UNDEFINED(obj[first_undefined])) {
902
+ first_undefined++;
903
+ }
904
+ // Maintain the invariant num_holes = the number of holes in the original
905
+ // array with indices <= first_undefined or > last_defined.
906
+ if (!obj.hasOwnProperty(first_undefined)) {
907
+ num_holes++;
908
+ }
909
+
910
+ // Find last defined element.
911
+ while (first_undefined < last_defined &&
912
+ IS_UNDEFINED(obj[last_defined])) {
913
+ if (!obj.hasOwnProperty(last_defined)) {
914
+ num_holes++;
915
+ }
916
+ last_defined--;
917
+ }
918
+ if (first_undefined < last_defined) {
919
+ // Fill in hole or undefined.
920
+ obj[first_undefined] = obj[last_defined];
921
+ obj[last_defined] = void 0;
922
+ }
923
+ }
924
+ // If there were any undefineds in the entire array, first_undefined
925
+ // points to one past the last defined element. Make this true if
926
+ // there were no undefineds, as well, so that first_undefined == number
927
+ // of defined elements.
928
+ if (!IS_UNDEFINED(obj[first_undefined])) first_undefined++;
929
+ // Fill in the undefineds and the holes. There may be a hole where
930
+ // an undefined should be and vice versa.
931
+ var i;
932
+ for (i = first_undefined; i < length - num_holes; i++) {
933
+ obj[i] = void 0;
934
+ }
935
+ for (i = length - num_holes; i < length; i++) {
936
+ // For compatability with Webkit, do not expose elements in the prototype.
937
+ if (i in obj.__proto__) {
938
+ obj[i] = void 0;
939
+ } else {
940
+ delete obj[i];
941
+ }
942
+ }
943
+
944
+ // Return the number of defined elements.
945
+ return first_undefined;
946
+ }
947
+
948
+ var length = TO_UINT32(this.length);
949
+ if (length < 2) return this;
950
+
951
+ var is_array = IS_ARRAY(this);
952
+ var max_prototype_element;
953
+ if (!is_array) {
954
+ // For compatibility with JSC, we also sort elements inherited from
955
+ // the prototype chain on non-Array objects.
956
+ // We do this by copying them to this object and sorting only
957
+ // local elements. This is not very efficient, but sorting with
958
+ // inherited elements happens very, very rarely, if at all.
959
+ // The specification allows "implementation dependent" behavior
960
+ // if an element on the prototype chain has an element that
961
+ // might interact with sorting.
962
+ max_prototype_element = CopyFromPrototype(this, length);
963
+ }
964
+
965
+ var num_non_undefined = %RemoveArrayHoles(this, length);
966
+ if (num_non_undefined == -1) {
967
+ // There were indexed accessors in the array. Move array holes and
968
+ // undefineds to the end using a Javascript function that is safe
969
+ // in the presence of accessors.
970
+ num_non_undefined = SafeRemoveArrayHoles(this);
971
+ }
972
+
973
+ QuickSort(this, 0, num_non_undefined);
974
+
975
+ if (!is_array && (num_non_undefined + 1 < max_prototype_element)) {
976
+ // For compatibility with JSC, we shadow any elements in the prototype
977
+ // chain that has become exposed by sort moving a hole to its position.
978
+ ShadowPrototypeElements(this, num_non_undefined, max_prototype_element);
979
+ }
980
+
981
+ return this;
982
+ }
983
+
984
+
985
+ // The following functions cannot be made efficient on sparse arrays while
986
+ // preserving the semantics, since the calls to the receiver function can add
987
+ // or delete elements from the array.
988
+ function ArrayFilter(f, receiver) {
989
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
990
+ throw MakeTypeError("called_on_null_or_undefined",
991
+ ["Array.prototype.filter"]);
992
+ }
993
+
994
+ if (!IS_FUNCTION(f)) {
995
+ throw MakeTypeError('called_non_callable', [ f ]);
996
+ }
997
+ // Pull out the length so that modifications to the length in the
998
+ // loop will not affect the looping.
999
+ var length = this.length;
1000
+ var result = [];
1001
+ var result_length = 0;
1002
+ for (var i = 0; i < length; i++) {
1003
+ var current = this[i];
1004
+ if (!IS_UNDEFINED(current) || i in this) {
1005
+ if (f.call(receiver, current, i, this)) {
1006
+ result[result_length++] = current;
1007
+ }
1008
+ }
1009
+ }
1010
+ return result;
1011
+ }
1012
+
1013
+
1014
+ function ArrayForEach(f, receiver) {
1015
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
1016
+ throw MakeTypeError("called_on_null_or_undefined",
1017
+ ["Array.prototype.forEach"]);
1018
+ }
1019
+
1020
+ if (!IS_FUNCTION(f)) {
1021
+ throw MakeTypeError('called_non_callable', [ f ]);
1022
+ }
1023
+ // Pull out the length so that modifications to the length in the
1024
+ // loop will not affect the looping.
1025
+ var length = TO_UINT32(this.length);
1026
+ for (var i = 0; i < length; i++) {
1027
+ var current = this[i];
1028
+ if (!IS_UNDEFINED(current) || i in this) {
1029
+ f.call(receiver, current, i, this);
1030
+ }
1031
+ }
1032
+ }
1033
+
1034
+
1035
+ // Executes the function once for each element present in the
1036
+ // array until it finds one where callback returns true.
1037
+ function ArraySome(f, receiver) {
1038
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
1039
+ throw MakeTypeError("called_on_null_or_undefined",
1040
+ ["Array.prototype.some"]);
1041
+ }
1042
+
1043
+ if (!IS_FUNCTION(f)) {
1044
+ throw MakeTypeError('called_non_callable', [ f ]);
1045
+ }
1046
+ // Pull out the length so that modifications to the length in the
1047
+ // loop will not affect the looping.
1048
+ var length = TO_UINT32(this.length);
1049
+ for (var i = 0; i < length; i++) {
1050
+ var current = this[i];
1051
+ if (!IS_UNDEFINED(current) || i in this) {
1052
+ if (f.call(receiver, current, i, this)) return true;
1053
+ }
1054
+ }
1055
+ return false;
1056
+ }
1057
+
1058
+
1059
+ function ArrayEvery(f, receiver) {
1060
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
1061
+ throw MakeTypeError("called_on_null_or_undefined",
1062
+ ["Array.prototype.every"]);
1063
+ }
1064
+
1065
+ if (!IS_FUNCTION(f)) {
1066
+ throw MakeTypeError('called_non_callable', [ f ]);
1067
+ }
1068
+ // Pull out the length so that modifications to the length in the
1069
+ // loop will not affect the looping.
1070
+ var length = TO_UINT32(this.length);
1071
+ for (var i = 0; i < length; i++) {
1072
+ var current = this[i];
1073
+ if (!IS_UNDEFINED(current) || i in this) {
1074
+ if (!f.call(receiver, current, i, this)) return false;
1075
+ }
1076
+ }
1077
+ return true;
1078
+ }
1079
+
1080
+ function ArrayMap(f, receiver) {
1081
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
1082
+ throw MakeTypeError("called_on_null_or_undefined",
1083
+ ["Array.prototype.map"]);
1084
+ }
1085
+
1086
+ if (!IS_FUNCTION(f)) {
1087
+ throw MakeTypeError('called_non_callable', [ f ]);
1088
+ }
1089
+ // Pull out the length so that modifications to the length in the
1090
+ // loop will not affect the looping.
1091
+ var length = TO_UINT32(this.length);
1092
+ var result = new $Array();
1093
+ var accumulator = new InternalArray(length);
1094
+ for (var i = 0; i < length; i++) {
1095
+ var current = this[i];
1096
+ if (!IS_UNDEFINED(current) || i in this) {
1097
+ accumulator[i] = f.call(receiver, current, i, this);
1098
+ }
1099
+ }
1100
+ %MoveArrayContents(accumulator, result);
1101
+ return result;
1102
+ }
1103
+
1104
+
1105
+ function ArrayIndexOf(element, index) {
1106
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
1107
+ throw MakeTypeError("called_on_null_or_undefined",
1108
+ ["Array.prototype.indexOf"]);
1109
+ }
1110
+
1111
+ var length = TO_UINT32(this.length);
1112
+ if (length == 0) return -1;
1113
+ if (IS_UNDEFINED(index)) {
1114
+ index = 0;
1115
+ } else {
1116
+ index = TO_INTEGER(index);
1117
+ // If index is negative, index from the end of the array.
1118
+ if (index < 0) {
1119
+ index = length + index;
1120
+ // If index is still negative, search the entire array.
1121
+ if (index < 0) index = 0;
1122
+ }
1123
+ }
1124
+ var min = index;
1125
+ var max = length;
1126
+ if (UseSparseVariant(this, length, IS_ARRAY(this))) {
1127
+ var intervals = %GetArrayKeys(this, length);
1128
+ if (intervals.length == 2 && intervals[0] < 0) {
1129
+ // A single interval.
1130
+ var intervalMin = -(intervals[0] + 1);
1131
+ var intervalMax = intervalMin + intervals[1];
1132
+ if (min < intervalMin) min = intervalMin;
1133
+ max = intervalMax; // Capped by length already.
1134
+ // Fall through to loop below.
1135
+ } else {
1136
+ if (intervals.length == 0) return -1;
1137
+ // Get all the keys in sorted order.
1138
+ var sortedKeys = GetSortedArrayKeys(this, intervals);
1139
+ var n = sortedKeys.length;
1140
+ var i = 0;
1141
+ while (i < n && sortedKeys[i] < index) i++;
1142
+ while (i < n) {
1143
+ var key = sortedKeys[i];
1144
+ if (!IS_UNDEFINED(key) && this[key] === element) return key;
1145
+ i++;
1146
+ }
1147
+ return -1;
1148
+ }
1149
+ }
1150
+ // Lookup through the array.
1151
+ if (!IS_UNDEFINED(element)) {
1152
+ for (var i = min; i < max; i++) {
1153
+ if (this[i] === element) return i;
1154
+ }
1155
+ return -1;
1156
+ }
1157
+ // Lookup through the array.
1158
+ for (var i = min; i < max; i++) {
1159
+ if (IS_UNDEFINED(this[i]) && i in this) {
1160
+ return i;
1161
+ }
1162
+ }
1163
+ return -1;
1164
+ }
1165
+
1166
+
1167
+ function ArrayLastIndexOf(element, index) {
1168
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
1169
+ throw MakeTypeError("called_on_null_or_undefined",
1170
+ ["Array.prototype.lastIndexOf"]);
1171
+ }
1172
+
1173
+ var length = TO_UINT32(this.length);
1174
+ if (length == 0) return -1;
1175
+ if (%_ArgumentsLength() < 2) {
1176
+ index = length - 1;
1177
+ } else {
1178
+ index = TO_INTEGER(index);
1179
+ // If index is negative, index from end of the array.
1180
+ if (index < 0) index += length;
1181
+ // If index is still negative, do not search the array.
1182
+ if (index < 0) return -1;
1183
+ else if (index >= length) index = length - 1;
1184
+ }
1185
+ var min = 0;
1186
+ var max = index;
1187
+ if (UseSparseVariant(this, length, IS_ARRAY(this))) {
1188
+ var intervals = %GetArrayKeys(this, index + 1);
1189
+ if (intervals.length == 2 && intervals[0] < 0) {
1190
+ // A single interval.
1191
+ var intervalMin = -(intervals[0] + 1);
1192
+ var intervalMax = intervalMin + intervals[1];
1193
+ if (min < intervalMin) min = intervalMin;
1194
+ max = intervalMax; // Capped by index already.
1195
+ // Fall through to loop below.
1196
+ } else {
1197
+ if (intervals.length == 0) return -1;
1198
+ // Get all the keys in sorted order.
1199
+ var sortedKeys = GetSortedArrayKeys(this, intervals);
1200
+ var i = sortedKeys.length - 1;
1201
+ while (i >= 0) {
1202
+ var key = sortedKeys[i];
1203
+ if (!IS_UNDEFINED(key) && this[key] === element) return key;
1204
+ i--;
1205
+ }
1206
+ return -1;
1207
+ }
1208
+ }
1209
+ // Lookup through the array.
1210
+ if (!IS_UNDEFINED(element)) {
1211
+ for (var i = max; i >= min; i--) {
1212
+ if (this[i] === element) return i;
1213
+ }
1214
+ return -1;
1215
+ }
1216
+ for (var i = max; i >= min; i--) {
1217
+ if (IS_UNDEFINED(this[i]) && i in this) {
1218
+ return i;
1219
+ }
1220
+ }
1221
+ return -1;
1222
+ }
1223
+
1224
+
1225
+ function ArrayReduce(callback, current) {
1226
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
1227
+ throw MakeTypeError("called_on_null_or_undefined",
1228
+ ["Array.prototype.reduce"]);
1229
+ }
1230
+
1231
+ if (!IS_FUNCTION(callback)) {
1232
+ throw MakeTypeError('called_non_callable', [callback]);
1233
+ }
1234
+ // Pull out the length so that modifications to the length in the
1235
+ // loop will not affect the looping.
1236
+ var length = this.length;
1237
+ var i = 0;
1238
+
1239
+ find_initial: if (%_ArgumentsLength() < 2) {
1240
+ for (; i < length; i++) {
1241
+ current = this[i];
1242
+ if (!IS_UNDEFINED(current) || i in this) {
1243
+ i++;
1244
+ break find_initial;
1245
+ }
1246
+ }
1247
+ throw MakeTypeError('reduce_no_initial', []);
1248
+ }
1249
+
1250
+ for (; i < length; i++) {
1251
+ var element = this[i];
1252
+ if (!IS_UNDEFINED(element) || i in this) {
1253
+ current = callback.call(null, current, element, i, this);
1254
+ }
1255
+ }
1256
+ return current;
1257
+ }
1258
+
1259
+ function ArrayReduceRight(callback, current) {
1260
+ if (IS_NULL_OR_UNDEFINED(this) && !IS_UNDETECTABLE(this)) {
1261
+ throw MakeTypeError("called_on_null_or_undefined",
1262
+ ["Array.prototype.reduceRight"]);
1263
+ }
1264
+
1265
+ if (!IS_FUNCTION(callback)) {
1266
+ throw MakeTypeError('called_non_callable', [callback]);
1267
+ }
1268
+ var i = this.length - 1;
1269
+
1270
+ find_initial: if (%_ArgumentsLength() < 2) {
1271
+ for (; i >= 0; i--) {
1272
+ current = this[i];
1273
+ if (!IS_UNDEFINED(current) || i in this) {
1274
+ i--;
1275
+ break find_initial;
1276
+ }
1277
+ }
1278
+ throw MakeTypeError('reduce_no_initial', []);
1279
+ }
1280
+
1281
+ for (; i >= 0; i--) {
1282
+ var element = this[i];
1283
+ if (!IS_UNDEFINED(element) || i in this) {
1284
+ current = callback.call(null, current, element, i, this);
1285
+ }
1286
+ }
1287
+ return current;
1288
+ }
1289
+
1290
+ // ES5, 15.4.3.2
1291
+ function ArrayIsArray(obj) {
1292
+ return IS_ARRAY(obj);
1293
+ }
1294
+
1295
+
1296
+ // -------------------------------------------------------------------
1297
+ function SetupArray() {
1298
+ // Setup non-enumerable constructor property on the Array.prototype
1299
+ // object.
1300
+ %SetProperty($Array.prototype, "constructor", $Array, DONT_ENUM);
1301
+
1302
+ // Setup non-enumerable functions on the Array object.
1303
+ InstallFunctions($Array, DONT_ENUM, $Array(
1304
+ "isArray", ArrayIsArray
1305
+ ));
1306
+
1307
+ var specialFunctions = %SpecialArrayFunctions({});
1308
+
1309
+ function getFunction(name, jsBuiltin, len) {
1310
+ var f = jsBuiltin;
1311
+ if (specialFunctions.hasOwnProperty(name)) {
1312
+ f = specialFunctions[name];
1313
+ }
1314
+ if (!IS_UNDEFINED(len)) {
1315
+ %FunctionSetLength(f, len);
1316
+ }
1317
+ return f;
1318
+ }
1319
+
1320
+ // Setup non-enumerable functions of the Array.prototype object and
1321
+ // set their names.
1322
+ // Manipulate the length of some of the functions to meet
1323
+ // expectations set by ECMA-262 or Mozilla.
1324
+ InstallFunctionsOnHiddenPrototype($Array.prototype, DONT_ENUM, $Array(
1325
+ "toString", getFunction("toString", ArrayToString),
1326
+ "toLocaleString", getFunction("toLocaleString", ArrayToLocaleString),
1327
+ "join", getFunction("join", ArrayJoin),
1328
+ "pop", getFunction("pop", ArrayPop),
1329
+ "push", getFunction("push", ArrayPush, 1),
1330
+ "concat", getFunction("concat", ArrayConcat, 1),
1331
+ "reverse", getFunction("reverse", ArrayReverse),
1332
+ "shift", getFunction("shift", ArrayShift),
1333
+ "unshift", getFunction("unshift", ArrayUnshift, 1),
1334
+ "slice", getFunction("slice", ArraySlice, 2),
1335
+ "splice", getFunction("splice", ArraySplice, 2),
1336
+ "sort", getFunction("sort", ArraySort),
1337
+ "filter", getFunction("filter", ArrayFilter, 1),
1338
+ "forEach", getFunction("forEach", ArrayForEach, 1),
1339
+ "some", getFunction("some", ArraySome, 1),
1340
+ "every", getFunction("every", ArrayEvery, 1),
1341
+ "map", getFunction("map", ArrayMap, 1),
1342
+ "indexOf", getFunction("indexOf", ArrayIndexOf, 1),
1343
+ "lastIndexOf", getFunction("lastIndexOf", ArrayLastIndexOf, 1),
1344
+ "reduce", getFunction("reduce", ArrayReduce, 1),
1345
+ "reduceRight", getFunction("reduceRight", ArrayReduceRight, 1)
1346
+ ));
1347
+
1348
+ %FinishArrayPrototypeSetup($Array.prototype);
1349
+
1350
+ // The internal Array prototype doesn't need to be fancy, since it's never
1351
+ // exposed to user code, so no hidden prototypes or DONT_ENUM attributes
1352
+ // are necessary.
1353
+ // The null __proto__ ensures that we never inherit any user created
1354
+ // getters or setters from, e.g., Object.prototype.
1355
+ InternalArray.prototype.__proto__ = null;
1356
+ // Adding only the functions that are actually used, and a toString.
1357
+ InternalArray.prototype.join = getFunction("join", ArrayJoin);
1358
+ InternalArray.prototype.pop = getFunction("pop", ArrayPop);
1359
+ InternalArray.prototype.push = getFunction("push", ArrayPush);
1360
+ InternalArray.prototype.toString = function() {
1361
+ return "Internal Array, length " + this.length;
1362
+ };
1363
+ }
1364
+
1365
+
1366
+ SetupArray();