therubyracer 0.4.9-x86-linux

Sign up to get free protection for your applications and to get access to all the features.

Potentially problematic release.


This version of therubyracer might be problematic. Click here for more details.

Files changed (637) hide show
  1. data/.gitignore +11 -0
  2. data/.gitmodules +3 -0
  3. data/Doxyfile +1514 -0
  4. data/History.txt +43 -0
  5. data/README.rdoc +157 -0
  6. data/Rakefile +51 -0
  7. data/docs/data_conversion.txt +18 -0
  8. data/ext/v8/callbacks.cpp +160 -0
  9. data/ext/v8/callbacks.h +14 -0
  10. data/ext/v8/convert_ruby.cpp +8 -0
  11. data/ext/v8/convert_ruby.h +99 -0
  12. data/ext/v8/convert_string.cpp +10 -0
  13. data/ext/v8/convert_string.h +73 -0
  14. data/ext/v8/convert_v8.cpp +9 -0
  15. data/ext/v8/convert_v8.h +121 -0
  16. data/ext/v8/converters.cpp +83 -0
  17. data/ext/v8/converters.h +23 -0
  18. data/ext/v8/extconf.rb +36 -0
  19. data/ext/v8/upstream/2.0.6/.gitignore +26 -0
  20. data/ext/v8/upstream/2.0.6/AUTHORS +23 -0
  21. data/ext/v8/upstream/2.0.6/ChangeLog +1479 -0
  22. data/ext/v8/upstream/2.0.6/LICENSE +55 -0
  23. data/ext/v8/upstream/2.0.6/SConstruct +1028 -0
  24. data/ext/v8/upstream/2.0.6/include/v8-debug.h +275 -0
  25. data/ext/v8/upstream/2.0.6/include/v8.h +3236 -0
  26. data/ext/v8/upstream/2.0.6/src/SConscript +283 -0
  27. data/ext/v8/upstream/2.0.6/src/accessors.cc +695 -0
  28. data/ext/v8/upstream/2.0.6/src/accessors.h +114 -0
  29. data/ext/v8/upstream/2.0.6/src/allocation.cc +198 -0
  30. data/ext/v8/upstream/2.0.6/src/allocation.h +169 -0
  31. data/ext/v8/upstream/2.0.6/src/api.cc +3831 -0
  32. data/ext/v8/upstream/2.0.6/src/api.h +479 -0
  33. data/ext/v8/upstream/2.0.6/src/apinatives.js +110 -0
  34. data/ext/v8/upstream/2.0.6/src/apiutils.h +69 -0
  35. data/ext/v8/upstream/2.0.6/src/arguments.h +97 -0
  36. data/ext/v8/upstream/2.0.6/src/arm/assembler-arm-inl.h +277 -0
  37. data/ext/v8/upstream/2.0.6/src/arm/assembler-arm.cc +1821 -0
  38. data/ext/v8/upstream/2.0.6/src/arm/assembler-arm.h +1027 -0
  39. data/ext/v8/upstream/2.0.6/src/arm/assembler-thumb2-inl.h +267 -0
  40. data/ext/v8/upstream/2.0.6/src/arm/assembler-thumb2.cc +1821 -0
  41. data/ext/v8/upstream/2.0.6/src/arm/assembler-thumb2.h +1027 -0
  42. data/ext/v8/upstream/2.0.6/src/arm/builtins-arm.cc +1271 -0
  43. data/ext/v8/upstream/2.0.6/src/arm/codegen-arm-inl.h +74 -0
  44. data/ext/v8/upstream/2.0.6/src/arm/codegen-arm.cc +6682 -0
  45. data/ext/v8/upstream/2.0.6/src/arm/codegen-arm.h +535 -0
  46. data/ext/v8/upstream/2.0.6/src/arm/constants-arm.cc +112 -0
  47. data/ext/v8/upstream/2.0.6/src/arm/constants-arm.h +347 -0
  48. data/ext/v8/upstream/2.0.6/src/arm/cpu-arm.cc +132 -0
  49. data/ext/v8/upstream/2.0.6/src/arm/debug-arm.cc +213 -0
  50. data/ext/v8/upstream/2.0.6/src/arm/disasm-arm.cc +1166 -0
  51. data/ext/v8/upstream/2.0.6/src/arm/fast-codegen-arm.cc +1698 -0
  52. data/ext/v8/upstream/2.0.6/src/arm/frames-arm.cc +123 -0
  53. data/ext/v8/upstream/2.0.6/src/arm/frames-arm.h +162 -0
  54. data/ext/v8/upstream/2.0.6/src/arm/ic-arm.cc +849 -0
  55. data/ext/v8/upstream/2.0.6/src/arm/jump-target-arm.cc +238 -0
  56. data/ext/v8/upstream/2.0.6/src/arm/macro-assembler-arm.cc +1259 -0
  57. data/ext/v8/upstream/2.0.6/src/arm/macro-assembler-arm.h +423 -0
  58. data/ext/v8/upstream/2.0.6/src/arm/regexp-macro-assembler-arm.cc +1266 -0
  59. data/ext/v8/upstream/2.0.6/src/arm/regexp-macro-assembler-arm.h +282 -0
  60. data/ext/v8/upstream/2.0.6/src/arm/register-allocator-arm-inl.h +103 -0
  61. data/ext/v8/upstream/2.0.6/src/arm/register-allocator-arm.cc +59 -0
  62. data/ext/v8/upstream/2.0.6/src/arm/register-allocator-arm.h +43 -0
  63. data/ext/v8/upstream/2.0.6/src/arm/simulator-arm.cc +2264 -0
  64. data/ext/v8/upstream/2.0.6/src/arm/simulator-arm.h +306 -0
  65. data/ext/v8/upstream/2.0.6/src/arm/stub-cache-arm.cc +1516 -0
  66. data/ext/v8/upstream/2.0.6/src/arm/virtual-frame-arm.cc +412 -0
  67. data/ext/v8/upstream/2.0.6/src/arm/virtual-frame-arm.h +532 -0
  68. data/ext/v8/upstream/2.0.6/src/array.js +1154 -0
  69. data/ext/v8/upstream/2.0.6/src/assembler.cc +772 -0
  70. data/ext/v8/upstream/2.0.6/src/assembler.h +525 -0
  71. data/ext/v8/upstream/2.0.6/src/ast.cc +512 -0
  72. data/ext/v8/upstream/2.0.6/src/ast.h +1820 -0
  73. data/ext/v8/upstream/2.0.6/src/bootstrapper.cc +1680 -0
  74. data/ext/v8/upstream/2.0.6/src/bootstrapper.h +103 -0
  75. data/ext/v8/upstream/2.0.6/src/builtins.cc +851 -0
  76. data/ext/v8/upstream/2.0.6/src/builtins.h +245 -0
  77. data/ext/v8/upstream/2.0.6/src/bytecodes-irregexp.h +104 -0
  78. data/ext/v8/upstream/2.0.6/src/char-predicates-inl.h +86 -0
  79. data/ext/v8/upstream/2.0.6/src/char-predicates.h +65 -0
  80. data/ext/v8/upstream/2.0.6/src/checks.cc +100 -0
  81. data/ext/v8/upstream/2.0.6/src/checks.h +284 -0
  82. data/ext/v8/upstream/2.0.6/src/code-stubs.cc +164 -0
  83. data/ext/v8/upstream/2.0.6/src/code-stubs.h +164 -0
  84. data/ext/v8/upstream/2.0.6/src/code.h +68 -0
  85. data/ext/v8/upstream/2.0.6/src/codegen-inl.h +88 -0
  86. data/ext/v8/upstream/2.0.6/src/codegen.cc +504 -0
  87. data/ext/v8/upstream/2.0.6/src/codegen.h +522 -0
  88. data/ext/v8/upstream/2.0.6/src/compilation-cache.cc +490 -0
  89. data/ext/v8/upstream/2.0.6/src/compilation-cache.h +98 -0
  90. data/ext/v8/upstream/2.0.6/src/compiler.cc +1132 -0
  91. data/ext/v8/upstream/2.0.6/src/compiler.h +107 -0
  92. data/ext/v8/upstream/2.0.6/src/contexts.cc +256 -0
  93. data/ext/v8/upstream/2.0.6/src/contexts.h +345 -0
  94. data/ext/v8/upstream/2.0.6/src/conversions-inl.h +95 -0
  95. data/ext/v8/upstream/2.0.6/src/conversions.cc +709 -0
  96. data/ext/v8/upstream/2.0.6/src/conversions.h +118 -0
  97. data/ext/v8/upstream/2.0.6/src/counters.cc +78 -0
  98. data/ext/v8/upstream/2.0.6/src/counters.h +239 -0
  99. data/ext/v8/upstream/2.0.6/src/cpu.h +65 -0
  100. data/ext/v8/upstream/2.0.6/src/d8-debug.cc +345 -0
  101. data/ext/v8/upstream/2.0.6/src/d8-debug.h +155 -0
  102. data/ext/v8/upstream/2.0.6/src/d8-posix.cc +675 -0
  103. data/ext/v8/upstream/2.0.6/src/d8-readline.cc +128 -0
  104. data/ext/v8/upstream/2.0.6/src/d8-windows.cc +42 -0
  105. data/ext/v8/upstream/2.0.6/src/d8.cc +776 -0
  106. data/ext/v8/upstream/2.0.6/src/d8.h +225 -0
  107. data/ext/v8/upstream/2.0.6/src/d8.js +1625 -0
  108. data/ext/v8/upstream/2.0.6/src/date-delay.js +1138 -0
  109. data/ext/v8/upstream/2.0.6/src/dateparser-inl.h +114 -0
  110. data/ext/v8/upstream/2.0.6/src/dateparser.cc +186 -0
  111. data/ext/v8/upstream/2.0.6/src/dateparser.h +240 -0
  112. data/ext/v8/upstream/2.0.6/src/debug-agent.cc +425 -0
  113. data/ext/v8/upstream/2.0.6/src/debug-agent.h +129 -0
  114. data/ext/v8/upstream/2.0.6/src/debug-delay.js +2073 -0
  115. data/ext/v8/upstream/2.0.6/src/debug.cc +2751 -0
  116. data/ext/v8/upstream/2.0.6/src/debug.h +866 -0
  117. data/ext/v8/upstream/2.0.6/src/disasm.h +77 -0
  118. data/ext/v8/upstream/2.0.6/src/disassembler.cc +318 -0
  119. data/ext/v8/upstream/2.0.6/src/disassembler.h +56 -0
  120. data/ext/v8/upstream/2.0.6/src/dtoa-config.c +91 -0
  121. data/ext/v8/upstream/2.0.6/src/execution.cc +701 -0
  122. data/ext/v8/upstream/2.0.6/src/execution.h +312 -0
  123. data/ext/v8/upstream/2.0.6/src/factory.cc +957 -0
  124. data/ext/v8/upstream/2.0.6/src/factory.h +393 -0
  125. data/ext/v8/upstream/2.0.6/src/fast-codegen.cc +725 -0
  126. data/ext/v8/upstream/2.0.6/src/fast-codegen.h +371 -0
  127. data/ext/v8/upstream/2.0.6/src/flag-definitions.h +426 -0
  128. data/ext/v8/upstream/2.0.6/src/flags.cc +555 -0
  129. data/ext/v8/upstream/2.0.6/src/flags.h +81 -0
  130. data/ext/v8/upstream/2.0.6/src/frame-element.cc +45 -0
  131. data/ext/v8/upstream/2.0.6/src/frame-element.h +235 -0
  132. data/ext/v8/upstream/2.0.6/src/frames-inl.h +215 -0
  133. data/ext/v8/upstream/2.0.6/src/frames.cc +749 -0
  134. data/ext/v8/upstream/2.0.6/src/frames.h +659 -0
  135. data/ext/v8/upstream/2.0.6/src/func-name-inferrer.cc +76 -0
  136. data/ext/v8/upstream/2.0.6/src/func-name-inferrer.h +135 -0
  137. data/ext/v8/upstream/2.0.6/src/global-handles.cc +516 -0
  138. data/ext/v8/upstream/2.0.6/src/global-handles.h +180 -0
  139. data/ext/v8/upstream/2.0.6/src/globals.h +608 -0
  140. data/ext/v8/upstream/2.0.6/src/handles-inl.h +76 -0
  141. data/ext/v8/upstream/2.0.6/src/handles.cc +811 -0
  142. data/ext/v8/upstream/2.0.6/src/handles.h +367 -0
  143. data/ext/v8/upstream/2.0.6/src/hashmap.cc +226 -0
  144. data/ext/v8/upstream/2.0.6/src/hashmap.h +120 -0
  145. data/ext/v8/upstream/2.0.6/src/heap-inl.h +407 -0
  146. data/ext/v8/upstream/2.0.6/src/heap-profiler.cc +695 -0
  147. data/ext/v8/upstream/2.0.6/src/heap-profiler.h +277 -0
  148. data/ext/v8/upstream/2.0.6/src/heap.cc +4204 -0
  149. data/ext/v8/upstream/2.0.6/src/heap.h +1704 -0
  150. data/ext/v8/upstream/2.0.6/src/ia32/assembler-ia32-inl.h +325 -0
  151. data/ext/v8/upstream/2.0.6/src/ia32/assembler-ia32.cc +2375 -0
  152. data/ext/v8/upstream/2.0.6/src/ia32/assembler-ia32.h +914 -0
  153. data/ext/v8/upstream/2.0.6/src/ia32/builtins-ia32.cc +1222 -0
  154. data/ext/v8/upstream/2.0.6/src/ia32/codegen-ia32-inl.h +46 -0
  155. data/ext/v8/upstream/2.0.6/src/ia32/codegen-ia32.cc +9770 -0
  156. data/ext/v8/upstream/2.0.6/src/ia32/codegen-ia32.h +834 -0
  157. data/ext/v8/upstream/2.0.6/src/ia32/cpu-ia32.cc +79 -0
  158. data/ext/v8/upstream/2.0.6/src/ia32/debug-ia32.cc +208 -0
  159. data/ext/v8/upstream/2.0.6/src/ia32/disasm-ia32.cc +1357 -0
  160. data/ext/v8/upstream/2.0.6/src/ia32/fast-codegen-ia32.cc +1813 -0
  161. data/ext/v8/upstream/2.0.6/src/ia32/frames-ia32.cc +111 -0
  162. data/ext/v8/upstream/2.0.6/src/ia32/frames-ia32.h +135 -0
  163. data/ext/v8/upstream/2.0.6/src/ia32/ic-ia32.cc +1490 -0
  164. data/ext/v8/upstream/2.0.6/src/ia32/jump-target-ia32.cc +432 -0
  165. data/ext/v8/upstream/2.0.6/src/ia32/macro-assembler-ia32.cc +1517 -0
  166. data/ext/v8/upstream/2.0.6/src/ia32/macro-assembler-ia32.h +528 -0
  167. data/ext/v8/upstream/2.0.6/src/ia32/regexp-macro-assembler-ia32.cc +1219 -0
  168. data/ext/v8/upstream/2.0.6/src/ia32/regexp-macro-assembler-ia32.h +230 -0
  169. data/ext/v8/upstream/2.0.6/src/ia32/register-allocator-ia32-inl.h +82 -0
  170. data/ext/v8/upstream/2.0.6/src/ia32/register-allocator-ia32.cc +99 -0
  171. data/ext/v8/upstream/2.0.6/src/ia32/register-allocator-ia32.h +43 -0
  172. data/ext/v8/upstream/2.0.6/src/ia32/simulator-ia32.cc +30 -0
  173. data/ext/v8/upstream/2.0.6/src/ia32/simulator-ia32.h +62 -0
  174. data/ext/v8/upstream/2.0.6/src/ia32/stub-cache-ia32.cc +1961 -0
  175. data/ext/v8/upstream/2.0.6/src/ia32/virtual-frame-ia32.cc +1105 -0
  176. data/ext/v8/upstream/2.0.6/src/ia32/virtual-frame-ia32.h +580 -0
  177. data/ext/v8/upstream/2.0.6/src/ic-inl.h +93 -0
  178. data/ext/v8/upstream/2.0.6/src/ic.cc +1426 -0
  179. data/ext/v8/upstream/2.0.6/src/ic.h +443 -0
  180. data/ext/v8/upstream/2.0.6/src/interpreter-irregexp.cc +646 -0
  181. data/ext/v8/upstream/2.0.6/src/interpreter-irregexp.h +48 -0
  182. data/ext/v8/upstream/2.0.6/src/json-delay.js +254 -0
  183. data/ext/v8/upstream/2.0.6/src/jsregexp.cc +5234 -0
  184. data/ext/v8/upstream/2.0.6/src/jsregexp.h +1439 -0
  185. data/ext/v8/upstream/2.0.6/src/jump-target-inl.h +49 -0
  186. data/ext/v8/upstream/2.0.6/src/jump-target.cc +383 -0
  187. data/ext/v8/upstream/2.0.6/src/jump-target.h +280 -0
  188. data/ext/v8/upstream/2.0.6/src/list-inl.h +166 -0
  189. data/ext/v8/upstream/2.0.6/src/list.h +158 -0
  190. data/ext/v8/upstream/2.0.6/src/log-inl.h +126 -0
  191. data/ext/v8/upstream/2.0.6/src/log-utils.cc +503 -0
  192. data/ext/v8/upstream/2.0.6/src/log-utils.h +292 -0
  193. data/ext/v8/upstream/2.0.6/src/log.cc +1457 -0
  194. data/ext/v8/upstream/2.0.6/src/log.h +371 -0
  195. data/ext/v8/upstream/2.0.6/src/macro-assembler.h +93 -0
  196. data/ext/v8/upstream/2.0.6/src/macros.py +137 -0
  197. data/ext/v8/upstream/2.0.6/src/mark-compact.cc +2007 -0
  198. data/ext/v8/upstream/2.0.6/src/mark-compact.h +442 -0
  199. data/ext/v8/upstream/2.0.6/src/math.js +263 -0
  200. data/ext/v8/upstream/2.0.6/src/memory.h +74 -0
  201. data/ext/v8/upstream/2.0.6/src/messages.cc +177 -0
  202. data/ext/v8/upstream/2.0.6/src/messages.h +112 -0
  203. data/ext/v8/upstream/2.0.6/src/messages.js +937 -0
  204. data/ext/v8/upstream/2.0.6/src/mirror-delay.js +2332 -0
  205. data/ext/v8/upstream/2.0.6/src/mksnapshot.cc +169 -0
  206. data/ext/v8/upstream/2.0.6/src/natives.h +63 -0
  207. data/ext/v8/upstream/2.0.6/src/objects-debug.cc +1317 -0
  208. data/ext/v8/upstream/2.0.6/src/objects-inl.h +3044 -0
  209. data/ext/v8/upstream/2.0.6/src/objects.cc +8306 -0
  210. data/ext/v8/upstream/2.0.6/src/objects.h +4960 -0
  211. data/ext/v8/upstream/2.0.6/src/oprofile-agent.cc +116 -0
  212. data/ext/v8/upstream/2.0.6/src/oprofile-agent.h +69 -0
  213. data/ext/v8/upstream/2.0.6/src/parser.cc +4810 -0
  214. data/ext/v8/upstream/2.0.6/src/parser.h +195 -0
  215. data/ext/v8/upstream/2.0.6/src/platform-freebsd.cc +645 -0
  216. data/ext/v8/upstream/2.0.6/src/platform-linux.cc +808 -0
  217. data/ext/v8/upstream/2.0.6/src/platform-macos.cc +643 -0
  218. data/ext/v8/upstream/2.0.6/src/platform-nullos.cc +454 -0
  219. data/ext/v8/upstream/2.0.6/src/platform-openbsd.cc +597 -0
  220. data/ext/v8/upstream/2.0.6/src/platform-posix.cc +380 -0
  221. data/ext/v8/upstream/2.0.6/src/platform-win32.cc +1908 -0
  222. data/ext/v8/upstream/2.0.6/src/platform.h +556 -0
  223. data/ext/v8/upstream/2.0.6/src/prettyprinter.cc +1511 -0
  224. data/ext/v8/upstream/2.0.6/src/prettyprinter.h +219 -0
  225. data/ext/v8/upstream/2.0.6/src/property.cc +96 -0
  226. data/ext/v8/upstream/2.0.6/src/property.h +327 -0
  227. data/ext/v8/upstream/2.0.6/src/regexp-delay.js +406 -0
  228. data/ext/v8/upstream/2.0.6/src/regexp-macro-assembler-irregexp-inl.h +78 -0
  229. data/ext/v8/upstream/2.0.6/src/regexp-macro-assembler-irregexp.cc +464 -0
  230. data/ext/v8/upstream/2.0.6/src/regexp-macro-assembler-irregexp.h +141 -0
  231. data/ext/v8/upstream/2.0.6/src/regexp-macro-assembler-tracer.cc +356 -0
  232. data/ext/v8/upstream/2.0.6/src/regexp-macro-assembler-tracer.h +103 -0
  233. data/ext/v8/upstream/2.0.6/src/regexp-macro-assembler.cc +240 -0
  234. data/ext/v8/upstream/2.0.6/src/regexp-macro-assembler.h +220 -0
  235. data/ext/v8/upstream/2.0.6/src/regexp-stack.cc +103 -0
  236. data/ext/v8/upstream/2.0.6/src/regexp-stack.h +123 -0
  237. data/ext/v8/upstream/2.0.6/src/register-allocator-inl.h +74 -0
  238. data/ext/v8/upstream/2.0.6/src/register-allocator.cc +100 -0
  239. data/ext/v8/upstream/2.0.6/src/register-allocator.h +295 -0
  240. data/ext/v8/upstream/2.0.6/src/rewriter.cc +855 -0
  241. data/ext/v8/upstream/2.0.6/src/rewriter.h +54 -0
  242. data/ext/v8/upstream/2.0.6/src/runtime.cc +8163 -0
  243. data/ext/v8/upstream/2.0.6/src/runtime.h +432 -0
  244. data/ext/v8/upstream/2.0.6/src/runtime.js +626 -0
  245. data/ext/v8/upstream/2.0.6/src/scanner.cc +1098 -0
  246. data/ext/v8/upstream/2.0.6/src/scanner.h +425 -0
  247. data/ext/v8/upstream/2.0.6/src/scopeinfo.cc +649 -0
  248. data/ext/v8/upstream/2.0.6/src/scopeinfo.h +236 -0
  249. data/ext/v8/upstream/2.0.6/src/scopes.cc +963 -0
  250. data/ext/v8/upstream/2.0.6/src/scopes.h +401 -0
  251. data/ext/v8/upstream/2.0.6/src/serialize.cc +1260 -0
  252. data/ext/v8/upstream/2.0.6/src/serialize.h +404 -0
  253. data/ext/v8/upstream/2.0.6/src/shell.h +55 -0
  254. data/ext/v8/upstream/2.0.6/src/simulator.h +41 -0
  255. data/ext/v8/upstream/2.0.6/src/smart-pointer.h +109 -0
  256. data/ext/v8/upstream/2.0.6/src/snapshot-common.cc +97 -0
  257. data/ext/v8/upstream/2.0.6/src/snapshot-empty.cc +40 -0
  258. data/ext/v8/upstream/2.0.6/src/snapshot.h +59 -0
  259. data/ext/v8/upstream/2.0.6/src/spaces-inl.h +372 -0
  260. data/ext/v8/upstream/2.0.6/src/spaces.cc +2864 -0
  261. data/ext/v8/upstream/2.0.6/src/spaces.h +2072 -0
  262. data/ext/v8/upstream/2.0.6/src/string-stream.cc +584 -0
  263. data/ext/v8/upstream/2.0.6/src/string-stream.h +189 -0
  264. data/ext/v8/upstream/2.0.6/src/string.js +901 -0
  265. data/ext/v8/upstream/2.0.6/src/stub-cache.cc +1108 -0
  266. data/ext/v8/upstream/2.0.6/src/stub-cache.h +578 -0
  267. data/ext/v8/upstream/2.0.6/src/third_party/dtoa/COPYING +15 -0
  268. data/ext/v8/upstream/2.0.6/src/third_party/dtoa/dtoa.c +3330 -0
  269. data/ext/v8/upstream/2.0.6/src/third_party/valgrind/valgrind.h +3925 -0
  270. data/ext/v8/upstream/2.0.6/src/token.cc +56 -0
  271. data/ext/v8/upstream/2.0.6/src/token.h +270 -0
  272. data/ext/v8/upstream/2.0.6/src/top.cc +991 -0
  273. data/ext/v8/upstream/2.0.6/src/top.h +459 -0
  274. data/ext/v8/upstream/2.0.6/src/unicode-inl.h +238 -0
  275. data/ext/v8/upstream/2.0.6/src/unicode.cc +749 -0
  276. data/ext/v8/upstream/2.0.6/src/unicode.h +279 -0
  277. data/ext/v8/upstream/2.0.6/src/uri.js +415 -0
  278. data/ext/v8/upstream/2.0.6/src/usage-analyzer.cc +426 -0
  279. data/ext/v8/upstream/2.0.6/src/usage-analyzer.h +40 -0
  280. data/ext/v8/upstream/2.0.6/src/utils.cc +322 -0
  281. data/ext/v8/upstream/2.0.6/src/utils.h +592 -0
  282. data/ext/v8/upstream/2.0.6/src/v8-counters.cc +55 -0
  283. data/ext/v8/upstream/2.0.6/src/v8-counters.h +198 -0
  284. data/ext/v8/upstream/2.0.6/src/v8.cc +193 -0
  285. data/ext/v8/upstream/2.0.6/src/v8.h +119 -0
  286. data/ext/v8/upstream/2.0.6/src/v8natives.js +846 -0
  287. data/ext/v8/upstream/2.0.6/src/v8threads.cc +450 -0
  288. data/ext/v8/upstream/2.0.6/src/v8threads.h +144 -0
  289. data/ext/v8/upstream/2.0.6/src/variables.cc +163 -0
  290. data/ext/v8/upstream/2.0.6/src/variables.h +235 -0
  291. data/ext/v8/upstream/2.0.6/src/version.cc +88 -0
  292. data/ext/v8/upstream/2.0.6/src/version.h +64 -0
  293. data/ext/v8/upstream/2.0.6/src/virtual-frame.cc +381 -0
  294. data/ext/v8/upstream/2.0.6/src/virtual-frame.h +44 -0
  295. data/ext/v8/upstream/2.0.6/src/x64/assembler-x64-inl.h +352 -0
  296. data/ext/v8/upstream/2.0.6/src/x64/assembler-x64.cc +2539 -0
  297. data/ext/v8/upstream/2.0.6/src/x64/assembler-x64.h +1399 -0
  298. data/ext/v8/upstream/2.0.6/src/x64/builtins-x64.cc +1255 -0
  299. data/ext/v8/upstream/2.0.6/src/x64/codegen-x64-inl.h +46 -0
  300. data/ext/v8/upstream/2.0.6/src/x64/codegen-x64.cc +8223 -0
  301. data/ext/v8/upstream/2.0.6/src/x64/codegen-x64.h +785 -0
  302. data/ext/v8/upstream/2.0.6/src/x64/cpu-x64.cc +79 -0
  303. data/ext/v8/upstream/2.0.6/src/x64/debug-x64.cc +202 -0
  304. data/ext/v8/upstream/2.0.6/src/x64/disasm-x64.cc +1596 -0
  305. data/ext/v8/upstream/2.0.6/src/x64/fast-codegen-x64.cc +1820 -0
  306. data/ext/v8/upstream/2.0.6/src/x64/frames-x64.cc +109 -0
  307. data/ext/v8/upstream/2.0.6/src/x64/frames-x64.h +121 -0
  308. data/ext/v8/upstream/2.0.6/src/x64/ic-x64.cc +1392 -0
  309. data/ext/v8/upstream/2.0.6/src/x64/jump-target-x64.cc +432 -0
  310. data/ext/v8/upstream/2.0.6/src/x64/macro-assembler-x64.cc +2409 -0
  311. data/ext/v8/upstream/2.0.6/src/x64/macro-assembler-x64.h +765 -0
  312. data/ext/v8/upstream/2.0.6/src/x64/regexp-macro-assembler-x64.cc +1337 -0
  313. data/ext/v8/upstream/2.0.6/src/x64/regexp-macro-assembler-x64.h +295 -0
  314. data/ext/v8/upstream/2.0.6/src/x64/register-allocator-x64-inl.h +86 -0
  315. data/ext/v8/upstream/2.0.6/src/x64/register-allocator-x64.cc +84 -0
  316. data/ext/v8/upstream/2.0.6/src/x64/register-allocator-x64.h +43 -0
  317. data/ext/v8/upstream/2.0.6/src/x64/simulator-x64.cc +27 -0
  318. data/ext/v8/upstream/2.0.6/src/x64/simulator-x64.h +63 -0
  319. data/ext/v8/upstream/2.0.6/src/x64/stub-cache-x64.cc +1884 -0
  320. data/ext/v8/upstream/2.0.6/src/x64/virtual-frame-x64.cc +1089 -0
  321. data/ext/v8/upstream/2.0.6/src/x64/virtual-frame-x64.h +560 -0
  322. data/ext/v8/upstream/2.0.6/src/zone-inl.h +297 -0
  323. data/ext/v8/upstream/2.0.6/src/zone.cc +193 -0
  324. data/ext/v8/upstream/2.0.6/src/zone.h +305 -0
  325. data/ext/v8/upstream/2.0.6/tools/codemap.js +258 -0
  326. data/ext/v8/upstream/2.0.6/tools/consarray.js +93 -0
  327. data/ext/v8/upstream/2.0.6/tools/csvparser.js +98 -0
  328. data/ext/v8/upstream/2.0.6/tools/gyp/v8.gyp +620 -0
  329. data/ext/v8/upstream/2.0.6/tools/js2c.py +376 -0
  330. data/ext/v8/upstream/2.0.6/tools/jsmin.py +280 -0
  331. data/ext/v8/upstream/2.0.6/tools/linux-tick-processor +24 -0
  332. data/ext/v8/upstream/2.0.6/tools/linux-tick-processor.py +78 -0
  333. data/ext/v8/upstream/2.0.6/tools/logreader.js +320 -0
  334. data/ext/v8/upstream/2.0.6/tools/mac-nm +18 -0
  335. data/ext/v8/upstream/2.0.6/tools/mac-tick-processor +6 -0
  336. data/ext/v8/upstream/2.0.6/tools/oprofile/annotate +7 -0
  337. data/ext/v8/upstream/2.0.6/tools/oprofile/common +19 -0
  338. data/ext/v8/upstream/2.0.6/tools/oprofile/dump +7 -0
  339. data/ext/v8/upstream/2.0.6/tools/oprofile/report +7 -0
  340. data/ext/v8/upstream/2.0.6/tools/oprofile/reset +7 -0
  341. data/ext/v8/upstream/2.0.6/tools/oprofile/run +14 -0
  342. data/ext/v8/upstream/2.0.6/tools/oprofile/shutdown +7 -0
  343. data/ext/v8/upstream/2.0.6/tools/oprofile/start +7 -0
  344. data/ext/v8/upstream/2.0.6/tools/presubmit.py +299 -0
  345. data/ext/v8/upstream/2.0.6/tools/process-heap-prof.py +120 -0
  346. data/ext/v8/upstream/2.0.6/tools/profile.js +621 -0
  347. data/ext/v8/upstream/2.0.6/tools/profile_view.js +224 -0
  348. data/ext/v8/upstream/2.0.6/tools/run-valgrind.py +77 -0
  349. data/ext/v8/upstream/2.0.6/tools/splaytree.js +322 -0
  350. data/ext/v8/upstream/2.0.6/tools/splaytree.py +226 -0
  351. data/ext/v8/upstream/2.0.6/tools/stats-viewer.py +456 -0
  352. data/ext/v8/upstream/2.0.6/tools/test.py +1370 -0
  353. data/ext/v8/upstream/2.0.6/tools/tickprocessor-driver.js +53 -0
  354. data/ext/v8/upstream/2.0.6/tools/tickprocessor.js +731 -0
  355. data/ext/v8/upstream/2.0.6/tools/tickprocessor.py +535 -0
  356. data/ext/v8/upstream/2.0.6/tools/utils.py +82 -0
  357. data/ext/v8/upstream/2.0.6/tools/visual_studio/README.txt +71 -0
  358. data/ext/v8/upstream/2.0.6/tools/visual_studio/arm.vsprops +14 -0
  359. data/ext/v8/upstream/2.0.6/tools/visual_studio/common.vsprops +35 -0
  360. data/ext/v8/upstream/2.0.6/tools/visual_studio/d8.vcproj +199 -0
  361. data/ext/v8/upstream/2.0.6/tools/visual_studio/d8_arm.vcproj +199 -0
  362. data/ext/v8/upstream/2.0.6/tools/visual_studio/d8_x64.vcproj +201 -0
  363. data/ext/v8/upstream/2.0.6/tools/visual_studio/d8js2c.cmd +6 -0
  364. data/ext/v8/upstream/2.0.6/tools/visual_studio/debug.vsprops +17 -0
  365. data/ext/v8/upstream/2.0.6/tools/visual_studio/ia32.vsprops +13 -0
  366. data/ext/v8/upstream/2.0.6/tools/visual_studio/js2c.cmd +6 -0
  367. data/ext/v8/upstream/2.0.6/tools/visual_studio/release.vsprops +24 -0
  368. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8.sln +101 -0
  369. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8.vcproj +223 -0
  370. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_arm.sln +74 -0
  371. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_arm.vcproj +223 -0
  372. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_base.vcproj +971 -0
  373. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_base_arm.vcproj +983 -0
  374. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_base_x64.vcproj +959 -0
  375. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_cctest.vcproj +255 -0
  376. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_cctest_arm.vcproj +243 -0
  377. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_cctest_x64.vcproj +257 -0
  378. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_mksnapshot.vcproj +151 -0
  379. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_mksnapshot_x64.vcproj +151 -0
  380. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_process_sample.vcproj +151 -0
  381. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_process_sample_arm.vcproj +151 -0
  382. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_process_sample_x64.vcproj +151 -0
  383. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_shell_sample.vcproj +151 -0
  384. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_shell_sample_arm.vcproj +151 -0
  385. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_shell_sample_x64.vcproj +153 -0
  386. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_snapshot.vcproj +142 -0
  387. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_snapshot_cc.vcproj +92 -0
  388. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_snapshot_cc_x64.vcproj +92 -0
  389. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_snapshot_x64.vcproj +142 -0
  390. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_x64.sln +101 -0
  391. data/ext/v8/upstream/2.0.6/tools/visual_studio/v8_x64.vcproj +223 -0
  392. data/ext/v8/upstream/2.0.6/tools/visual_studio/x64.vsprops +13 -0
  393. data/ext/v8/upstream/2.0.6/tools/windows-tick-processor.bat +5 -0
  394. data/ext/v8/upstream/2.0.6/tools/windows-tick-processor.py +137 -0
  395. data/ext/v8/upstream/Makefile +31 -0
  396. data/ext/v8/upstream/no-strict-aliasing.patch +13 -0
  397. data/ext/v8/upstream/scons/CHANGES.txt +5183 -0
  398. data/ext/v8/upstream/scons/LICENSE.txt +20 -0
  399. data/ext/v8/upstream/scons/MANIFEST +202 -0
  400. data/ext/v8/upstream/scons/PKG-INFO +13 -0
  401. data/ext/v8/upstream/scons/README.txt +273 -0
  402. data/ext/v8/upstream/scons/RELEASE.txt +1040 -0
  403. data/ext/v8/upstream/scons/engine/SCons/Action.py +1256 -0
  404. data/ext/v8/upstream/scons/engine/SCons/Builder.py +868 -0
  405. data/ext/v8/upstream/scons/engine/SCons/CacheDir.py +217 -0
  406. data/ext/v8/upstream/scons/engine/SCons/Conftest.py +794 -0
  407. data/ext/v8/upstream/scons/engine/SCons/Debug.py +237 -0
  408. data/ext/v8/upstream/scons/engine/SCons/Defaults.py +485 -0
  409. data/ext/v8/upstream/scons/engine/SCons/Environment.py +2327 -0
  410. data/ext/v8/upstream/scons/engine/SCons/Errors.py +207 -0
  411. data/ext/v8/upstream/scons/engine/SCons/Executor.py +636 -0
  412. data/ext/v8/upstream/scons/engine/SCons/Job.py +435 -0
  413. data/ext/v8/upstream/scons/engine/SCons/Memoize.py +292 -0
  414. data/ext/v8/upstream/scons/engine/SCons/Node/Alias.py +153 -0
  415. data/ext/v8/upstream/scons/engine/SCons/Node/FS.py +3220 -0
  416. data/ext/v8/upstream/scons/engine/SCons/Node/Python.py +128 -0
  417. data/ext/v8/upstream/scons/engine/SCons/Node/__init__.py +1341 -0
  418. data/ext/v8/upstream/scons/engine/SCons/Options/BoolOption.py +50 -0
  419. data/ext/v8/upstream/scons/engine/SCons/Options/EnumOption.py +50 -0
  420. data/ext/v8/upstream/scons/engine/SCons/Options/ListOption.py +50 -0
  421. data/ext/v8/upstream/scons/engine/SCons/Options/PackageOption.py +50 -0
  422. data/ext/v8/upstream/scons/engine/SCons/Options/PathOption.py +76 -0
  423. data/ext/v8/upstream/scons/engine/SCons/Options/__init__.py +74 -0
  424. data/ext/v8/upstream/scons/engine/SCons/PathList.py +232 -0
  425. data/ext/v8/upstream/scons/engine/SCons/Platform/__init__.py +236 -0
  426. data/ext/v8/upstream/scons/engine/SCons/Platform/aix.py +70 -0
  427. data/ext/v8/upstream/scons/engine/SCons/Platform/cygwin.py +55 -0
  428. data/ext/v8/upstream/scons/engine/SCons/Platform/darwin.py +46 -0
  429. data/ext/v8/upstream/scons/engine/SCons/Platform/hpux.py +46 -0
  430. data/ext/v8/upstream/scons/engine/SCons/Platform/irix.py +44 -0
  431. data/ext/v8/upstream/scons/engine/SCons/Platform/os2.py +58 -0
  432. data/ext/v8/upstream/scons/engine/SCons/Platform/posix.py +264 -0
  433. data/ext/v8/upstream/scons/engine/SCons/Platform/sunos.py +50 -0
  434. data/ext/v8/upstream/scons/engine/SCons/Platform/win32.py +386 -0
  435. data/ext/v8/upstream/scons/engine/SCons/SConf.py +1038 -0
  436. data/ext/v8/upstream/scons/engine/SCons/SConsign.py +381 -0
  437. data/ext/v8/upstream/scons/engine/SCons/Scanner/C.py +132 -0
  438. data/ext/v8/upstream/scons/engine/SCons/Scanner/D.py +74 -0
  439. data/ext/v8/upstream/scons/engine/SCons/Scanner/Dir.py +111 -0
  440. data/ext/v8/upstream/scons/engine/SCons/Scanner/Fortran.py +320 -0
  441. data/ext/v8/upstream/scons/engine/SCons/Scanner/IDL.py +48 -0
  442. data/ext/v8/upstream/scons/engine/SCons/Scanner/LaTeX.py +378 -0
  443. data/ext/v8/upstream/scons/engine/SCons/Scanner/Prog.py +103 -0
  444. data/ext/v8/upstream/scons/engine/SCons/Scanner/RC.py +55 -0
  445. data/ext/v8/upstream/scons/engine/SCons/Scanner/__init__.py +415 -0
  446. data/ext/v8/upstream/scons/engine/SCons/Script/Interactive.py +386 -0
  447. data/ext/v8/upstream/scons/engine/SCons/Script/Main.py +1360 -0
  448. data/ext/v8/upstream/scons/engine/SCons/Script/SConsOptions.py +944 -0
  449. data/ext/v8/upstream/scons/engine/SCons/Script/SConscript.py +642 -0
  450. data/ext/v8/upstream/scons/engine/SCons/Script/__init__.py +414 -0
  451. data/ext/v8/upstream/scons/engine/SCons/Sig.py +63 -0
  452. data/ext/v8/upstream/scons/engine/SCons/Subst.py +911 -0
  453. data/ext/v8/upstream/scons/engine/SCons/Taskmaster.py +1030 -0
  454. data/ext/v8/upstream/scons/engine/SCons/Tool/386asm.py +61 -0
  455. data/ext/v8/upstream/scons/engine/SCons/Tool/BitKeeper.py +65 -0
  456. data/ext/v8/upstream/scons/engine/SCons/Tool/CVS.py +73 -0
  457. data/ext/v8/upstream/scons/engine/SCons/Tool/FortranCommon.py +247 -0
  458. data/ext/v8/upstream/scons/engine/SCons/Tool/JavaCommon.py +324 -0
  459. data/ext/v8/upstream/scons/engine/SCons/Tool/MSCommon/__init__.py +56 -0
  460. data/ext/v8/upstream/scons/engine/SCons/Tool/MSCommon/arch.py +61 -0
  461. data/ext/v8/upstream/scons/engine/SCons/Tool/MSCommon/common.py +210 -0
  462. data/ext/v8/upstream/scons/engine/SCons/Tool/MSCommon/netframework.py +84 -0
  463. data/ext/v8/upstream/scons/engine/SCons/Tool/MSCommon/sdk.py +321 -0
  464. data/ext/v8/upstream/scons/engine/SCons/Tool/MSCommon/vc.py +367 -0
  465. data/ext/v8/upstream/scons/engine/SCons/Tool/MSCommon/vs.py +497 -0
  466. data/ext/v8/upstream/scons/engine/SCons/Tool/Perforce.py +104 -0
  467. data/ext/v8/upstream/scons/engine/SCons/Tool/PharLapCommon.py +138 -0
  468. data/ext/v8/upstream/scons/engine/SCons/Tool/RCS.py +64 -0
  469. data/ext/v8/upstream/scons/engine/SCons/Tool/SCCS.py +64 -0
  470. data/ext/v8/upstream/scons/engine/SCons/Tool/Subversion.py +71 -0
  471. data/ext/v8/upstream/scons/engine/SCons/Tool/__init__.py +675 -0
  472. data/ext/v8/upstream/scons/engine/SCons/Tool/aixc++.py +82 -0
  473. data/ext/v8/upstream/scons/engine/SCons/Tool/aixcc.py +74 -0
  474. data/ext/v8/upstream/scons/engine/SCons/Tool/aixf77.py +80 -0
  475. data/ext/v8/upstream/scons/engine/SCons/Tool/aixlink.py +76 -0
  476. data/ext/v8/upstream/scons/engine/SCons/Tool/applelink.py +71 -0
  477. data/ext/v8/upstream/scons/engine/SCons/Tool/ar.py +63 -0
  478. data/ext/v8/upstream/scons/engine/SCons/Tool/as.py +78 -0
  479. data/ext/v8/upstream/scons/engine/SCons/Tool/bcc32.py +82 -0
  480. data/ext/v8/upstream/scons/engine/SCons/Tool/c++.py +99 -0
  481. data/ext/v8/upstream/scons/engine/SCons/Tool/cc.py +114 -0
  482. data/ext/v8/upstream/scons/engine/SCons/Tool/cvf.py +58 -0
  483. data/ext/v8/upstream/scons/engine/SCons/Tool/default.py +50 -0
  484. data/ext/v8/upstream/scons/engine/SCons/Tool/dmd.py +224 -0
  485. data/ext/v8/upstream/scons/engine/SCons/Tool/dvi.py +64 -0
  486. data/ext/v8/upstream/scons/engine/SCons/Tool/dvipdf.py +125 -0
  487. data/ext/v8/upstream/scons/engine/SCons/Tool/dvips.py +94 -0
  488. data/ext/v8/upstream/scons/engine/SCons/Tool/f77.py +62 -0
  489. data/ext/v8/upstream/scons/engine/SCons/Tool/f90.py +62 -0
  490. data/ext/v8/upstream/scons/engine/SCons/Tool/f95.py +63 -0
  491. data/ext/v8/upstream/scons/engine/SCons/Tool/filesystem.py +98 -0
  492. data/ext/v8/upstream/scons/engine/SCons/Tool/fortran.py +63 -0
  493. data/ext/v8/upstream/scons/engine/SCons/Tool/g++.py +90 -0
  494. data/ext/v8/upstream/scons/engine/SCons/Tool/g77.py +73 -0
  495. data/ext/v8/upstream/scons/engine/SCons/Tool/gas.py +53 -0
  496. data/ext/v8/upstream/scons/engine/SCons/Tool/gcc.py +80 -0
  497. data/ext/v8/upstream/scons/engine/SCons/Tool/gfortran.py +64 -0
  498. data/ext/v8/upstream/scons/engine/SCons/Tool/gnulink.py +63 -0
  499. data/ext/v8/upstream/scons/engine/SCons/Tool/gs.py +81 -0
  500. data/ext/v8/upstream/scons/engine/SCons/Tool/hpc++.py +85 -0
  501. data/ext/v8/upstream/scons/engine/SCons/Tool/hpcc.py +53 -0
  502. data/ext/v8/upstream/scons/engine/SCons/Tool/hplink.py +77 -0
  503. data/ext/v8/upstream/scons/engine/SCons/Tool/icc.py +59 -0
  504. data/ext/v8/upstream/scons/engine/SCons/Tool/icl.py +52 -0
  505. data/ext/v8/upstream/scons/engine/SCons/Tool/ifl.py +72 -0
  506. data/ext/v8/upstream/scons/engine/SCons/Tool/ifort.py +90 -0
  507. data/ext/v8/upstream/scons/engine/SCons/Tool/ilink.py +59 -0
  508. data/ext/v8/upstream/scons/engine/SCons/Tool/ilink32.py +60 -0
  509. data/ext/v8/upstream/scons/engine/SCons/Tool/install.py +229 -0
  510. data/ext/v8/upstream/scons/engine/SCons/Tool/intelc.py +490 -0
  511. data/ext/v8/upstream/scons/engine/SCons/Tool/ipkg.py +71 -0
  512. data/ext/v8/upstream/scons/engine/SCons/Tool/jar.py +110 -0
  513. data/ext/v8/upstream/scons/engine/SCons/Tool/javac.py +234 -0
  514. data/ext/v8/upstream/scons/engine/SCons/Tool/javah.py +138 -0
  515. data/ext/v8/upstream/scons/engine/SCons/Tool/latex.py +79 -0
  516. data/ext/v8/upstream/scons/engine/SCons/Tool/lex.py +99 -0
  517. data/ext/v8/upstream/scons/engine/SCons/Tool/link.py +121 -0
  518. data/ext/v8/upstream/scons/engine/SCons/Tool/linkloc.py +112 -0
  519. data/ext/v8/upstream/scons/engine/SCons/Tool/m4.py +63 -0
  520. data/ext/v8/upstream/scons/engine/SCons/Tool/masm.py +77 -0
  521. data/ext/v8/upstream/scons/engine/SCons/Tool/midl.py +90 -0
  522. data/ext/v8/upstream/scons/engine/SCons/Tool/mingw.py +159 -0
  523. data/ext/v8/upstream/scons/engine/SCons/Tool/mslib.py +64 -0
  524. data/ext/v8/upstream/scons/engine/SCons/Tool/mslink.py +266 -0
  525. data/ext/v8/upstream/scons/engine/SCons/Tool/mssdk.py +50 -0
  526. data/ext/v8/upstream/scons/engine/SCons/Tool/msvc.py +269 -0
  527. data/ext/v8/upstream/scons/engine/SCons/Tool/msvs.py +1439 -0
  528. data/ext/v8/upstream/scons/engine/SCons/Tool/mwcc.py +208 -0
  529. data/ext/v8/upstream/scons/engine/SCons/Tool/mwld.py +107 -0
  530. data/ext/v8/upstream/scons/engine/SCons/Tool/nasm.py +72 -0
  531. data/ext/v8/upstream/scons/engine/SCons/Tool/packaging/__init__.py +314 -0
  532. data/ext/v8/upstream/scons/engine/SCons/Tool/packaging/ipk.py +185 -0
  533. data/ext/v8/upstream/scons/engine/SCons/Tool/packaging/msi.py +526 -0
  534. data/ext/v8/upstream/scons/engine/SCons/Tool/packaging/rpm.py +367 -0
  535. data/ext/v8/upstream/scons/engine/SCons/Tool/packaging/src_tarbz2.py +43 -0
  536. data/ext/v8/upstream/scons/engine/SCons/Tool/packaging/src_targz.py +43 -0
  537. data/ext/v8/upstream/scons/engine/SCons/Tool/packaging/src_zip.py +43 -0
  538. data/ext/v8/upstream/scons/engine/SCons/Tool/packaging/tarbz2.py +44 -0
  539. data/ext/v8/upstream/scons/engine/SCons/Tool/packaging/targz.py +44 -0
  540. data/ext/v8/upstream/scons/engine/SCons/Tool/packaging/zip.py +44 -0
  541. data/ext/v8/upstream/scons/engine/SCons/Tool/pdf.py +78 -0
  542. data/ext/v8/upstream/scons/engine/SCons/Tool/pdflatex.py +83 -0
  543. data/ext/v8/upstream/scons/engine/SCons/Tool/pdftex.py +108 -0
  544. data/ext/v8/upstream/scons/engine/SCons/Tool/qt.py +336 -0
  545. data/ext/v8/upstream/scons/engine/SCons/Tool/rmic.py +121 -0
  546. data/ext/v8/upstream/scons/engine/SCons/Tool/rpcgen.py +70 -0
  547. data/ext/v8/upstream/scons/engine/SCons/Tool/rpm.py +132 -0
  548. data/ext/v8/upstream/scons/engine/SCons/Tool/sgiar.py +68 -0
  549. data/ext/v8/upstream/scons/engine/SCons/Tool/sgic++.py +58 -0
  550. data/ext/v8/upstream/scons/engine/SCons/Tool/sgicc.py +53 -0
  551. data/ext/v8/upstream/scons/engine/SCons/Tool/sgilink.py +63 -0
  552. data/ext/v8/upstream/scons/engine/SCons/Tool/sunar.py +67 -0
  553. data/ext/v8/upstream/scons/engine/SCons/Tool/sunc++.py +142 -0
  554. data/ext/v8/upstream/scons/engine/SCons/Tool/suncc.py +58 -0
  555. data/ext/v8/upstream/scons/engine/SCons/Tool/sunf77.py +63 -0
  556. data/ext/v8/upstream/scons/engine/SCons/Tool/sunf90.py +64 -0
  557. data/ext/v8/upstream/scons/engine/SCons/Tool/sunf95.py +64 -0
  558. data/ext/v8/upstream/scons/engine/SCons/Tool/sunlink.py +77 -0
  559. data/ext/v8/upstream/scons/engine/SCons/Tool/swig.py +186 -0
  560. data/ext/v8/upstream/scons/engine/SCons/Tool/tar.py +73 -0
  561. data/ext/v8/upstream/scons/engine/SCons/Tool/tex.py +805 -0
  562. data/ext/v8/upstream/scons/engine/SCons/Tool/textfile.py +175 -0
  563. data/ext/v8/upstream/scons/engine/SCons/Tool/tlib.py +53 -0
  564. data/ext/v8/upstream/scons/engine/SCons/Tool/wix.py +100 -0
  565. data/ext/v8/upstream/scons/engine/SCons/Tool/yacc.py +131 -0
  566. data/ext/v8/upstream/scons/engine/SCons/Tool/zip.py +100 -0
  567. data/ext/v8/upstream/scons/engine/SCons/Util.py +1645 -0
  568. data/ext/v8/upstream/scons/engine/SCons/Variables/BoolVariable.py +91 -0
  569. data/ext/v8/upstream/scons/engine/SCons/Variables/EnumVariable.py +107 -0
  570. data/ext/v8/upstream/scons/engine/SCons/Variables/ListVariable.py +139 -0
  571. data/ext/v8/upstream/scons/engine/SCons/Variables/PackageVariable.py +109 -0
  572. data/ext/v8/upstream/scons/engine/SCons/Variables/PathVariable.py +147 -0
  573. data/ext/v8/upstream/scons/engine/SCons/Variables/__init__.py +317 -0
  574. data/ext/v8/upstream/scons/engine/SCons/Warnings.py +228 -0
  575. data/ext/v8/upstream/scons/engine/SCons/__init__.py +49 -0
  576. data/ext/v8/upstream/scons/engine/SCons/compat/__init__.py +302 -0
  577. data/ext/v8/upstream/scons/engine/SCons/compat/_scons_UserString.py +98 -0
  578. data/ext/v8/upstream/scons/engine/SCons/compat/_scons_hashlib.py +91 -0
  579. data/ext/v8/upstream/scons/engine/SCons/compat/_scons_itertools.py +124 -0
  580. data/ext/v8/upstream/scons/engine/SCons/compat/_scons_optparse.py +1725 -0
  581. data/ext/v8/upstream/scons/engine/SCons/compat/_scons_sets.py +583 -0
  582. data/ext/v8/upstream/scons/engine/SCons/compat/_scons_sets15.py +176 -0
  583. data/ext/v8/upstream/scons/engine/SCons/compat/_scons_shlex.py +325 -0
  584. data/ext/v8/upstream/scons/engine/SCons/compat/_scons_subprocess.py +1296 -0
  585. data/ext/v8/upstream/scons/engine/SCons/compat/_scons_textwrap.py +382 -0
  586. data/ext/v8/upstream/scons/engine/SCons/compat/builtins.py +187 -0
  587. data/ext/v8/upstream/scons/engine/SCons/cpp.py +598 -0
  588. data/ext/v8/upstream/scons/engine/SCons/dblite.py +248 -0
  589. data/ext/v8/upstream/scons/engine/SCons/exitfuncs.py +77 -0
  590. data/ext/v8/upstream/scons/os_spawnv_fix.diff +83 -0
  591. data/ext/v8/upstream/scons/scons-time.1 +1017 -0
  592. data/ext/v8/upstream/scons/scons.1 +15179 -0
  593. data/ext/v8/upstream/scons/sconsign.1 +208 -0
  594. data/ext/v8/upstream/scons/script/scons +184 -0
  595. data/ext/v8/upstream/scons/script/scons-time +1529 -0
  596. data/ext/v8/upstream/scons/script/scons.bat +31 -0
  597. data/ext/v8/upstream/scons/script/sconsign +508 -0
  598. data/ext/v8/upstream/scons/setup.cfg +6 -0
  599. data/ext/v8/upstream/scons/setup.py +427 -0
  600. data/ext/v8/v8.cpp +89 -0
  601. data/ext/v8/v8_cxt.cpp +92 -0
  602. data/ext/v8/v8_cxt.h +20 -0
  603. data/ext/v8/v8_func.cpp +10 -0
  604. data/ext/v8/v8_func.h +11 -0
  605. data/ext/v8/v8_msg.cpp +54 -0
  606. data/ext/v8/v8_msg.h +18 -0
  607. data/ext/v8/v8_obj.cpp +52 -0
  608. data/ext/v8/v8_obj.h +13 -0
  609. data/ext/v8/v8_ref.cpp +26 -0
  610. data/ext/v8/v8_ref.h +31 -0
  611. data/ext/v8/v8_script.cpp +20 -0
  612. data/ext/v8/v8_script.h +8 -0
  613. data/ext/v8/v8_standalone.cpp +69 -0
  614. data/ext/v8/v8_standalone.h +31 -0
  615. data/ext/v8/v8_str.cpp +17 -0
  616. data/ext/v8/v8_str.h +9 -0
  617. data/ext/v8/v8_template.cpp +53 -0
  618. data/ext/v8/v8_template.h +13 -0
  619. data/lib/v8.rb +10 -0
  620. data/lib/v8/context.rb +101 -0
  621. data/lib/v8/object.rb +38 -0
  622. data/lib/v8/to.rb +33 -0
  623. data/lib/v8/v8.so +0 -0
  624. data/script/console +10 -0
  625. data/script/destroy +14 -0
  626. data/script/generate +14 -0
  627. data/spec/ext/cxt_spec.rb +25 -0
  628. data/spec/ext/obj_spec.rb +13 -0
  629. data/spec/redjs/jsapi_spec.rb +405 -0
  630. data/spec/redjs/tap.rb +8 -0
  631. data/spec/redjs_helper.rb +3 -0
  632. data/spec/spec.opts +1 -0
  633. data/spec/spec_helper.rb +14 -0
  634. data/spec/v8/to_spec.rb +15 -0
  635. data/tasks/rspec.rake +21 -0
  636. data/therubyracer.gemspec +680 -0
  637. metadata +697 -0
@@ -0,0 +1,1439 @@
1
+ // Copyright 2006-2008 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
+ #ifndef V8_JSREGEXP_H_
29
+ #define V8_JSREGEXP_H_
30
+
31
+ #include "macro-assembler.h"
32
+
33
+ namespace v8 {
34
+ namespace internal {
35
+
36
+
37
+ class RegExpMacroAssembler;
38
+
39
+
40
+ class RegExpImpl {
41
+ public:
42
+ // Whether V8 is compiled with native regexp support or not.
43
+ static bool UsesNativeRegExp() {
44
+ #ifdef V8_NATIVE_REGEXP
45
+ return true;
46
+ #else
47
+ return false;
48
+ #endif
49
+ }
50
+
51
+ // Creates a regular expression literal in the old space.
52
+ // This function calls the garbage collector if necessary.
53
+ static Handle<Object> CreateRegExpLiteral(Handle<JSFunction> constructor,
54
+ Handle<String> pattern,
55
+ Handle<String> flags,
56
+ bool* has_pending_exception);
57
+
58
+ // Returns a string representation of a regular expression.
59
+ // Implements RegExp.prototype.toString, see ECMA-262 section 15.10.6.4.
60
+ // This function calls the garbage collector if necessary.
61
+ static Handle<String> ToString(Handle<Object> value);
62
+
63
+ // Parses the RegExp pattern and prepares the JSRegExp object with
64
+ // generic data and choice of implementation - as well as what
65
+ // the implementation wants to store in the data field.
66
+ // Returns false if compilation fails.
67
+ static Handle<Object> Compile(Handle<JSRegExp> re,
68
+ Handle<String> pattern,
69
+ Handle<String> flags);
70
+
71
+ // See ECMA-262 section 15.10.6.2.
72
+ // This function calls the garbage collector if necessary.
73
+ static Handle<Object> Exec(Handle<JSRegExp> regexp,
74
+ Handle<String> subject,
75
+ int index,
76
+ Handle<JSArray> lastMatchInfo);
77
+
78
+ // Prepares a JSRegExp object with Irregexp-specific data.
79
+ static void IrregexpPrepare(Handle<JSRegExp> re,
80
+ Handle<String> pattern,
81
+ JSRegExp::Flags flags,
82
+ int capture_register_count);
83
+
84
+
85
+ static void AtomCompile(Handle<JSRegExp> re,
86
+ Handle<String> pattern,
87
+ JSRegExp::Flags flags,
88
+ Handle<String> match_pattern);
89
+
90
+ static Handle<Object> AtomExec(Handle<JSRegExp> regexp,
91
+ Handle<String> subject,
92
+ int index,
93
+ Handle<JSArray> lastMatchInfo);
94
+
95
+ // Execute an Irregexp bytecode pattern.
96
+ // On a successful match, the result is a JSArray containing
97
+ // captured positions. On a failure, the result is the null value.
98
+ // Returns an empty handle in case of an exception.
99
+ static Handle<Object> IrregexpExec(Handle<JSRegExp> regexp,
100
+ Handle<String> subject,
101
+ int index,
102
+ Handle<JSArray> lastMatchInfo);
103
+
104
+ // Array index in the lastMatchInfo array.
105
+ static const int kLastCaptureCount = 0;
106
+ static const int kLastSubject = 1;
107
+ static const int kLastInput = 2;
108
+ static const int kFirstCapture = 3;
109
+ static const int kLastMatchOverhead = 3;
110
+
111
+ // Direct offset into the lastMatchInfo array.
112
+ static const int kLastCaptureCountOffset =
113
+ FixedArray::kHeaderSize + kLastCaptureCount * kPointerSize;
114
+ static const int kLastSubjectOffset =
115
+ FixedArray::kHeaderSize + kLastSubject * kPointerSize;
116
+ static const int kLastInputOffset =
117
+ FixedArray::kHeaderSize + kLastInput * kPointerSize;
118
+ static const int kFirstCaptureOffset =
119
+ FixedArray::kHeaderSize + kFirstCapture * kPointerSize;
120
+
121
+ // Used to access the lastMatchInfo array.
122
+ static int GetCapture(FixedArray* array, int index) {
123
+ return Smi::cast(array->get(index + kFirstCapture))->value();
124
+ }
125
+
126
+ static void SetLastCaptureCount(FixedArray* array, int to) {
127
+ array->set(kLastCaptureCount, Smi::FromInt(to));
128
+ }
129
+
130
+ static void SetLastSubject(FixedArray* array, String* to) {
131
+ array->set(kLastSubject, to);
132
+ }
133
+
134
+ static void SetLastInput(FixedArray* array, String* to) {
135
+ array->set(kLastInput, to);
136
+ }
137
+
138
+ static void SetCapture(FixedArray* array, int index, int to) {
139
+ array->set(index + kFirstCapture, Smi::FromInt(to));
140
+ }
141
+
142
+ static int GetLastCaptureCount(FixedArray* array) {
143
+ return Smi::cast(array->get(kLastCaptureCount))->value();
144
+ }
145
+
146
+ // For acting on the JSRegExp data FixedArray.
147
+ static int IrregexpMaxRegisterCount(FixedArray* re);
148
+ static void SetIrregexpMaxRegisterCount(FixedArray* re, int value);
149
+ static int IrregexpNumberOfCaptures(FixedArray* re);
150
+ static int IrregexpNumberOfRegisters(FixedArray* re);
151
+ static ByteArray* IrregexpByteCode(FixedArray* re, bool is_ascii);
152
+ static Code* IrregexpNativeCode(FixedArray* re, bool is_ascii);
153
+
154
+ private:
155
+ static String* last_ascii_string_;
156
+ static String* two_byte_cached_string_;
157
+
158
+ static bool CompileIrregexp(Handle<JSRegExp> re, bool is_ascii);
159
+ static inline bool EnsureCompiledIrregexp(Handle<JSRegExp> re, bool is_ascii);
160
+
161
+
162
+ // Set the subject cache. The previous string buffer is not deleted, so the
163
+ // caller should ensure that it doesn't leak.
164
+ static void SetSubjectCache(String* subject,
165
+ char* utf8_subject,
166
+ int uft8_length,
167
+ int character_position,
168
+ int utf8_position);
169
+
170
+ // A one element cache of the last utf8_subject string and its length. The
171
+ // subject JS String object is cached in the heap. We also cache a
172
+ // translation between position and utf8 position.
173
+ static char* utf8_subject_cache_;
174
+ static int utf8_length_cache_;
175
+ static int utf8_position_;
176
+ static int character_position_;
177
+ };
178
+
179
+
180
+ // Represents the location of one element relative to the intersection of
181
+ // two sets. Corresponds to the four areas of a Venn diagram.
182
+ enum ElementInSetsRelation {
183
+ kInsideNone = 0,
184
+ kInsideFirst = 1,
185
+ kInsideSecond = 2,
186
+ kInsideBoth = 3
187
+ };
188
+
189
+
190
+ // Represents the relation of two sets.
191
+ // Sets can be either disjoint, partially or fully overlapping, or equal.
192
+ class SetRelation BASE_EMBEDDED {
193
+ public:
194
+ // Relation is represented by a bit saying whether there are elements in
195
+ // one set that is not in the other, and a bit saying that there are elements
196
+ // that are in both sets.
197
+
198
+ // Location of an element. Corresponds to the internal areas of
199
+ // a Venn diagram.
200
+ enum {
201
+ kInFirst = 1 << kInsideFirst,
202
+ kInSecond = 1 << kInsideSecond,
203
+ kInBoth = 1 << kInsideBoth
204
+ };
205
+ SetRelation() : bits_(0) {}
206
+ ~SetRelation() {}
207
+ // Add the existence of objects in a particular
208
+ void SetElementsInFirstSet() { bits_ |= kInFirst; }
209
+ void SetElementsInSecondSet() { bits_ |= kInSecond; }
210
+ void SetElementsInBothSets() { bits_ |= kInBoth; }
211
+ // Check the currently known relation of the sets (common functions only,
212
+ // for other combinations, use value() to get the bits and check them
213
+ // manually).
214
+ // Sets are completely disjoint.
215
+ bool Disjoint() { return (bits_ & kInBoth) == 0; }
216
+ // Sets are equal.
217
+ bool Equals() { return (bits_ & (kInFirst | kInSecond)) == 0; }
218
+ // First set contains second.
219
+ bool Contains() { return (bits_ & kInSecond) == 0; }
220
+ // Second set contains first.
221
+ bool ContainedIn() { return (bits_ & kInFirst) == 0; }
222
+ bool NonTrivialIntersection() {
223
+ return (bits_ == (kInFirst | kInSecond | kInBoth));
224
+ }
225
+ int value() { return bits_; }
226
+ private:
227
+ int bits_;
228
+ };
229
+
230
+
231
+ class CharacterRange {
232
+ public:
233
+ CharacterRange() : from_(0), to_(0) { }
234
+ // For compatibility with the CHECK_OK macro
235
+ CharacterRange(void* null) { ASSERT_EQ(NULL, null); } //NOLINT
236
+ CharacterRange(uc16 from, uc16 to) : from_(from), to_(to) { }
237
+ static void AddClassEscape(uc16 type, ZoneList<CharacterRange>* ranges);
238
+ static Vector<const uc16> GetWordBounds();
239
+ static inline CharacterRange Singleton(uc16 value) {
240
+ return CharacterRange(value, value);
241
+ }
242
+ static inline CharacterRange Range(uc16 from, uc16 to) {
243
+ ASSERT(from <= to);
244
+ return CharacterRange(from, to);
245
+ }
246
+ static inline CharacterRange Everything() {
247
+ return CharacterRange(0, 0xFFFF);
248
+ }
249
+ bool Contains(uc16 i) { return from_ <= i && i <= to_; }
250
+ uc16 from() const { return from_; }
251
+ void set_from(uc16 value) { from_ = value; }
252
+ uc16 to() const { return to_; }
253
+ void set_to(uc16 value) { to_ = value; }
254
+ bool is_valid() { return from_ <= to_; }
255
+ bool IsEverything(uc16 max) { return from_ == 0 && to_ >= max; }
256
+ bool IsSingleton() { return (from_ == to_); }
257
+ void AddCaseEquivalents(ZoneList<CharacterRange>* ranges, bool is_ascii);
258
+ static void Split(ZoneList<CharacterRange>* base,
259
+ Vector<const uc16> overlay,
260
+ ZoneList<CharacterRange>** included,
261
+ ZoneList<CharacterRange>** excluded);
262
+ // Whether a range list is in canonical form: Ranges ordered by from value,
263
+ // and ranges non-overlapping and non-adjacent.
264
+ static bool IsCanonical(ZoneList<CharacterRange>* ranges);
265
+ // Convert range list to canonical form. The characters covered by the ranges
266
+ // will still be the same, but no character is in more than one range, and
267
+ // adjacent ranges are merged. The resulting list may be shorter than the
268
+ // original, but cannot be longer.
269
+ static void Canonicalize(ZoneList<CharacterRange>* ranges);
270
+ // Check how the set of characters defined by a CharacterRange list relates
271
+ // to the set of word characters. List must be in canonical form.
272
+ static SetRelation WordCharacterRelation(ZoneList<CharacterRange>* ranges);
273
+ // Takes two character range lists (representing character sets) in canonical
274
+ // form and merges them.
275
+ // The characters that are only covered by the first set are added to
276
+ // first_set_only_out. the characters that are only in the second set are
277
+ // added to second_set_only_out, and the characters that are in both are
278
+ // added to both_sets_out.
279
+ // The pointers to first_set_only_out, second_set_only_out and both_sets_out
280
+ // should be to empty lists, but they need not be distinct, and may be NULL.
281
+ // If NULL, the characters are dropped, and if two arguments are the same
282
+ // pointer, the result is the union of the two sets that would be created
283
+ // if the pointers had been distinct.
284
+ // This way, the Merge function can compute all the usual set operations:
285
+ // union (all three out-sets are equal), intersection (only both_sets_out is
286
+ // non-NULL), and set difference (only first_set is non-NULL).
287
+ static void Merge(ZoneList<CharacterRange>* first_set,
288
+ ZoneList<CharacterRange>* second_set,
289
+ ZoneList<CharacterRange>* first_set_only_out,
290
+ ZoneList<CharacterRange>* second_set_only_out,
291
+ ZoneList<CharacterRange>* both_sets_out);
292
+ // Negate the contents of a character range in canonical form.
293
+ static void Negate(ZoneList<CharacterRange>* src,
294
+ ZoneList<CharacterRange>* dst);
295
+ static const int kRangeCanonicalizeMax = 0x346;
296
+ static const int kStartMarker = (1 << 24);
297
+ static const int kPayloadMask = (1 << 24) - 1;
298
+
299
+ private:
300
+ uc16 from_;
301
+ uc16 to_;
302
+ };
303
+
304
+
305
+ // A set of unsigned integers that behaves especially well on small
306
+ // integers (< 32). May do zone-allocation.
307
+ class OutSet: public ZoneObject {
308
+ public:
309
+ OutSet() : first_(0), remaining_(NULL), successors_(NULL) { }
310
+ OutSet* Extend(unsigned value);
311
+ bool Get(unsigned value);
312
+ static const unsigned kFirstLimit = 32;
313
+
314
+ private:
315
+ // Destructively set a value in this set. In most cases you want
316
+ // to use Extend instead to ensure that only one instance exists
317
+ // that contains the same values.
318
+ void Set(unsigned value);
319
+
320
+ // The successors are a list of sets that contain the same values
321
+ // as this set and the one more value that is not present in this
322
+ // set.
323
+ ZoneList<OutSet*>* successors() { return successors_; }
324
+
325
+ OutSet(uint32_t first, ZoneList<unsigned>* remaining)
326
+ : first_(first), remaining_(remaining), successors_(NULL) { }
327
+ uint32_t first_;
328
+ ZoneList<unsigned>* remaining_;
329
+ ZoneList<OutSet*>* successors_;
330
+ friend class Trace;
331
+ };
332
+
333
+
334
+ // A mapping from integers, specified as ranges, to a set of integers.
335
+ // Used for mapping character ranges to choices.
336
+ class DispatchTable : public ZoneObject {
337
+ public:
338
+ class Entry {
339
+ public:
340
+ Entry() : from_(0), to_(0), out_set_(NULL) { }
341
+ Entry(uc16 from, uc16 to, OutSet* out_set)
342
+ : from_(from), to_(to), out_set_(out_set) { }
343
+ uc16 from() { return from_; }
344
+ uc16 to() { return to_; }
345
+ void set_to(uc16 value) { to_ = value; }
346
+ void AddValue(int value) { out_set_ = out_set_->Extend(value); }
347
+ OutSet* out_set() { return out_set_; }
348
+ private:
349
+ uc16 from_;
350
+ uc16 to_;
351
+ OutSet* out_set_;
352
+ };
353
+
354
+ class Config {
355
+ public:
356
+ typedef uc16 Key;
357
+ typedef Entry Value;
358
+ static const uc16 kNoKey;
359
+ static const Entry kNoValue;
360
+ static inline int Compare(uc16 a, uc16 b) {
361
+ if (a == b)
362
+ return 0;
363
+ else if (a < b)
364
+ return -1;
365
+ else
366
+ return 1;
367
+ }
368
+ };
369
+
370
+ void AddRange(CharacterRange range, int value);
371
+ OutSet* Get(uc16 value);
372
+ void Dump();
373
+
374
+ template <typename Callback>
375
+ void ForEach(Callback* callback) { return tree()->ForEach(callback); }
376
+ private:
377
+ // There can't be a static empty set since it allocates its
378
+ // successors in a zone and caches them.
379
+ OutSet* empty() { return &empty_; }
380
+ OutSet empty_;
381
+ ZoneSplayTree<Config>* tree() { return &tree_; }
382
+ ZoneSplayTree<Config> tree_;
383
+ };
384
+
385
+
386
+ #define FOR_EACH_NODE_TYPE(VISIT) \
387
+ VISIT(End) \
388
+ VISIT(Action) \
389
+ VISIT(Choice) \
390
+ VISIT(BackReference) \
391
+ VISIT(Assertion) \
392
+ VISIT(Text)
393
+
394
+
395
+ #define FOR_EACH_REG_EXP_TREE_TYPE(VISIT) \
396
+ VISIT(Disjunction) \
397
+ VISIT(Alternative) \
398
+ VISIT(Assertion) \
399
+ VISIT(CharacterClass) \
400
+ VISIT(Atom) \
401
+ VISIT(Quantifier) \
402
+ VISIT(Capture) \
403
+ VISIT(Lookahead) \
404
+ VISIT(BackReference) \
405
+ VISIT(Empty) \
406
+ VISIT(Text)
407
+
408
+
409
+ #define FORWARD_DECLARE(Name) class RegExp##Name;
410
+ FOR_EACH_REG_EXP_TREE_TYPE(FORWARD_DECLARE)
411
+ #undef FORWARD_DECLARE
412
+
413
+
414
+ class TextElement {
415
+ public:
416
+ enum Type {UNINITIALIZED, ATOM, CHAR_CLASS};
417
+ TextElement() : type(UNINITIALIZED) { }
418
+ explicit TextElement(Type t) : type(t), cp_offset(-1) { }
419
+ static TextElement Atom(RegExpAtom* atom);
420
+ static TextElement CharClass(RegExpCharacterClass* char_class);
421
+ int length();
422
+ Type type;
423
+ union {
424
+ RegExpAtom* u_atom;
425
+ RegExpCharacterClass* u_char_class;
426
+ } data;
427
+ int cp_offset;
428
+ };
429
+
430
+
431
+ class Trace;
432
+
433
+
434
+ struct NodeInfo {
435
+ NodeInfo()
436
+ : being_analyzed(false),
437
+ been_analyzed(false),
438
+ follows_word_interest(false),
439
+ follows_newline_interest(false),
440
+ follows_start_interest(false),
441
+ at_end(false),
442
+ visited(false) { }
443
+
444
+ // Returns true if the interests and assumptions of this node
445
+ // matches the given one.
446
+ bool Matches(NodeInfo* that) {
447
+ return (at_end == that->at_end) &&
448
+ (follows_word_interest == that->follows_word_interest) &&
449
+ (follows_newline_interest == that->follows_newline_interest) &&
450
+ (follows_start_interest == that->follows_start_interest);
451
+ }
452
+
453
+ // Updates the interests of this node given the interests of the
454
+ // node preceding it.
455
+ void AddFromPreceding(NodeInfo* that) {
456
+ at_end |= that->at_end;
457
+ follows_word_interest |= that->follows_word_interest;
458
+ follows_newline_interest |= that->follows_newline_interest;
459
+ follows_start_interest |= that->follows_start_interest;
460
+ }
461
+
462
+ bool HasLookbehind() {
463
+ return follows_word_interest ||
464
+ follows_newline_interest ||
465
+ follows_start_interest;
466
+ }
467
+
468
+ // Sets the interests of this node to include the interests of the
469
+ // following node.
470
+ void AddFromFollowing(NodeInfo* that) {
471
+ follows_word_interest |= that->follows_word_interest;
472
+ follows_newline_interest |= that->follows_newline_interest;
473
+ follows_start_interest |= that->follows_start_interest;
474
+ }
475
+
476
+ void ResetCompilationState() {
477
+ being_analyzed = false;
478
+ been_analyzed = false;
479
+ }
480
+
481
+ bool being_analyzed: 1;
482
+ bool been_analyzed: 1;
483
+
484
+ // These bits are set of this node has to know what the preceding
485
+ // character was.
486
+ bool follows_word_interest: 1;
487
+ bool follows_newline_interest: 1;
488
+ bool follows_start_interest: 1;
489
+
490
+ bool at_end: 1;
491
+ bool visited: 1;
492
+ };
493
+
494
+
495
+ class SiblingList {
496
+ public:
497
+ SiblingList() : list_(NULL) { }
498
+ int length() {
499
+ return list_ == NULL ? 0 : list_->length();
500
+ }
501
+ void Ensure(RegExpNode* parent) {
502
+ if (list_ == NULL) {
503
+ list_ = new ZoneList<RegExpNode*>(2);
504
+ list_->Add(parent);
505
+ }
506
+ }
507
+ void Add(RegExpNode* node) { list_->Add(node); }
508
+ RegExpNode* Get(int index) { return list_->at(index); }
509
+ private:
510
+ ZoneList<RegExpNode*>* list_;
511
+ };
512
+
513
+
514
+ // Details of a quick mask-compare check that can look ahead in the
515
+ // input stream.
516
+ class QuickCheckDetails {
517
+ public:
518
+ QuickCheckDetails()
519
+ : characters_(0),
520
+ mask_(0),
521
+ value_(0),
522
+ cannot_match_(false) { }
523
+ explicit QuickCheckDetails(int characters)
524
+ : characters_(characters),
525
+ mask_(0),
526
+ value_(0),
527
+ cannot_match_(false) { }
528
+ bool Rationalize(bool ascii);
529
+ // Merge in the information from another branch of an alternation.
530
+ void Merge(QuickCheckDetails* other, int from_index);
531
+ // Advance the current position by some amount.
532
+ void Advance(int by, bool ascii);
533
+ void Clear();
534
+ bool cannot_match() { return cannot_match_; }
535
+ void set_cannot_match() { cannot_match_ = true; }
536
+ struct Position {
537
+ Position() : mask(0), value(0), determines_perfectly(false) { }
538
+ uc16 mask;
539
+ uc16 value;
540
+ bool determines_perfectly;
541
+ };
542
+ int characters() { return characters_; }
543
+ void set_characters(int characters) { characters_ = characters; }
544
+ Position* positions(int index) {
545
+ ASSERT(index >= 0);
546
+ ASSERT(index < characters_);
547
+ return positions_ + index;
548
+ }
549
+ uint32_t mask() { return mask_; }
550
+ uint32_t value() { return value_; }
551
+
552
+ private:
553
+ // How many characters do we have quick check information from. This is
554
+ // the same for all branches of a choice node.
555
+ int characters_;
556
+ Position positions_[4];
557
+ // These values are the condensate of the above array after Rationalize().
558
+ uint32_t mask_;
559
+ uint32_t value_;
560
+ // If set to true, there is no way this quick check can match at all.
561
+ // E.g., if it requires to be at the start of the input, and isn't.
562
+ bool cannot_match_;
563
+ };
564
+
565
+
566
+ class RegExpNode: public ZoneObject {
567
+ public:
568
+ RegExpNode() : first_character_set_(NULL), trace_count_(0) { }
569
+ virtual ~RegExpNode();
570
+ virtual void Accept(NodeVisitor* visitor) = 0;
571
+ // Generates a goto to this node or actually generates the code at this point.
572
+ virtual void Emit(RegExpCompiler* compiler, Trace* trace) = 0;
573
+ // How many characters must this node consume at a minimum in order to
574
+ // succeed. If we have found at least 'still_to_find' characters that
575
+ // must be consumed there is no need to ask any following nodes whether
576
+ // they are sure to eat any more characters.
577
+ virtual int EatsAtLeast(int still_to_find, int recursion_depth) = 0;
578
+ // Emits some quick code that checks whether the preloaded characters match.
579
+ // Falls through on certain failure, jumps to the label on possible success.
580
+ // If the node cannot make a quick check it does nothing and returns false.
581
+ bool EmitQuickCheck(RegExpCompiler* compiler,
582
+ Trace* trace,
583
+ bool preload_has_checked_bounds,
584
+ Label* on_possible_success,
585
+ QuickCheckDetails* details_return,
586
+ bool fall_through_on_failure);
587
+ // For a given number of characters this returns a mask and a value. The
588
+ // next n characters are anded with the mask and compared with the value.
589
+ // A comparison failure indicates the node cannot match the next n characters.
590
+ // A comparison success indicates the node may match.
591
+ virtual void GetQuickCheckDetails(QuickCheckDetails* details,
592
+ RegExpCompiler* compiler,
593
+ int characters_filled_in,
594
+ bool not_at_start) = 0;
595
+ static const int kNodeIsTooComplexForGreedyLoops = -1;
596
+ virtual int GreedyLoopTextLength() { return kNodeIsTooComplexForGreedyLoops; }
597
+ Label* label() { return &label_; }
598
+ // If non-generic code is generated for a node (ie the node is not at the
599
+ // start of the trace) then it cannot be reused. This variable sets a limit
600
+ // on how often we allow that to happen before we insist on starting a new
601
+ // trace and generating generic code for a node that can be reused by flushing
602
+ // the deferred actions in the current trace and generating a goto.
603
+ static const int kMaxCopiesCodeGenerated = 10;
604
+
605
+ NodeInfo* info() { return &info_; }
606
+
607
+ void AddSibling(RegExpNode* node) { siblings_.Add(node); }
608
+
609
+ // Static version of EnsureSibling that expresses the fact that the
610
+ // result has the same type as the input.
611
+ template <class C>
612
+ static C* EnsureSibling(C* node, NodeInfo* info, bool* cloned) {
613
+ return static_cast<C*>(node->EnsureSibling(info, cloned));
614
+ }
615
+
616
+ SiblingList* siblings() { return &siblings_; }
617
+ void set_siblings(SiblingList* other) { siblings_ = *other; }
618
+
619
+ // Return the set of possible next characters recognized by the regexp
620
+ // (or a safe subset, potentially the set of all characters).
621
+ ZoneList<CharacterRange>* FirstCharacterSet();
622
+
623
+ // Compute (if possible within the budget of traversed nodes) the
624
+ // possible first characters of the input matched by this node and
625
+ // its continuation. Returns the remaining budget after the computation.
626
+ // If the budget is spent, the result is negative, and the cached
627
+ // first_character_set_ value isn't set.
628
+ virtual int ComputeFirstCharacterSet(int budget);
629
+
630
+ // Get and set the cached first character set value.
631
+ ZoneList<CharacterRange>* first_character_set() {
632
+ return first_character_set_;
633
+ }
634
+ void set_first_character_set(ZoneList<CharacterRange>* character_set) {
635
+ first_character_set_ = character_set;
636
+ }
637
+
638
+ protected:
639
+ enum LimitResult { DONE, CONTINUE };
640
+ static const int kComputeFirstCharacterSetFail = -1;
641
+
642
+ LimitResult LimitVersions(RegExpCompiler* compiler, Trace* trace);
643
+
644
+ // Returns a sibling of this node whose interests and assumptions
645
+ // match the ones in the given node info. If no sibling exists NULL
646
+ // is returned.
647
+ RegExpNode* TryGetSibling(NodeInfo* info);
648
+
649
+ // Returns a sibling of this node whose interests match the ones in
650
+ // the given node info. The info must not contain any assertions.
651
+ // If no node exists a new one will be created by cloning the current
652
+ // node. The result will always be an instance of the same concrete
653
+ // class as this node.
654
+ RegExpNode* EnsureSibling(NodeInfo* info, bool* cloned);
655
+
656
+ // Returns a clone of this node initialized using the copy constructor
657
+ // of its concrete class. Note that the node may have to be pre-
658
+ // processed before it is on a usable state.
659
+ virtual RegExpNode* Clone() = 0;
660
+
661
+ private:
662
+ static const int kFirstCharBudget = 10;
663
+ Label label_;
664
+ NodeInfo info_;
665
+ SiblingList siblings_;
666
+ ZoneList<CharacterRange>* first_character_set_;
667
+ // This variable keeps track of how many times code has been generated for
668
+ // this node (in different traces). We don't keep track of where the
669
+ // generated code is located unless the code is generated at the start of
670
+ // a trace, in which case it is generic and can be reused by flushing the
671
+ // deferred operations in the current trace and generating a goto.
672
+ int trace_count_;
673
+ };
674
+
675
+
676
+ // A simple closed interval.
677
+ class Interval {
678
+ public:
679
+ Interval() : from_(kNone), to_(kNone) { }
680
+ Interval(int from, int to) : from_(from), to_(to) { }
681
+ Interval Union(Interval that) {
682
+ if (that.from_ == kNone)
683
+ return *this;
684
+ else if (from_ == kNone)
685
+ return that;
686
+ else
687
+ return Interval(Min(from_, that.from_), Max(to_, that.to_));
688
+ }
689
+ bool Contains(int value) {
690
+ return (from_ <= value) && (value <= to_);
691
+ }
692
+ bool is_empty() { return from_ == kNone; }
693
+ int from() { return from_; }
694
+ int to() { return to_; }
695
+ static Interval Empty() { return Interval(); }
696
+ static const int kNone = -1;
697
+ private:
698
+ int from_;
699
+ int to_;
700
+ };
701
+
702
+
703
+ class SeqRegExpNode: public RegExpNode {
704
+ public:
705
+ explicit SeqRegExpNode(RegExpNode* on_success)
706
+ : on_success_(on_success) { }
707
+ RegExpNode* on_success() { return on_success_; }
708
+ void set_on_success(RegExpNode* node) { on_success_ = node; }
709
+ private:
710
+ RegExpNode* on_success_;
711
+ };
712
+
713
+
714
+ class ActionNode: public SeqRegExpNode {
715
+ public:
716
+ enum Type {
717
+ SET_REGISTER,
718
+ INCREMENT_REGISTER,
719
+ STORE_POSITION,
720
+ BEGIN_SUBMATCH,
721
+ POSITIVE_SUBMATCH_SUCCESS,
722
+ EMPTY_MATCH_CHECK,
723
+ CLEAR_CAPTURES
724
+ };
725
+ static ActionNode* SetRegister(int reg, int val, RegExpNode* on_success);
726
+ static ActionNode* IncrementRegister(int reg, RegExpNode* on_success);
727
+ static ActionNode* StorePosition(int reg,
728
+ bool is_capture,
729
+ RegExpNode* on_success);
730
+ static ActionNode* ClearCaptures(Interval range, RegExpNode* on_success);
731
+ static ActionNode* BeginSubmatch(int stack_pointer_reg,
732
+ int position_reg,
733
+ RegExpNode* on_success);
734
+ static ActionNode* PositiveSubmatchSuccess(int stack_pointer_reg,
735
+ int restore_reg,
736
+ int clear_capture_count,
737
+ int clear_capture_from,
738
+ RegExpNode* on_success);
739
+ static ActionNode* EmptyMatchCheck(int start_register,
740
+ int repetition_register,
741
+ int repetition_limit,
742
+ RegExpNode* on_success);
743
+ virtual void Accept(NodeVisitor* visitor);
744
+ virtual void Emit(RegExpCompiler* compiler, Trace* trace);
745
+ virtual int EatsAtLeast(int still_to_find, int recursion_depth);
746
+ virtual void GetQuickCheckDetails(QuickCheckDetails* details,
747
+ RegExpCompiler* compiler,
748
+ int filled_in,
749
+ bool not_at_start) {
750
+ return on_success()->GetQuickCheckDetails(
751
+ details, compiler, filled_in, not_at_start);
752
+ }
753
+ Type type() { return type_; }
754
+ // TODO(erikcorry): We should allow some action nodes in greedy loops.
755
+ virtual int GreedyLoopTextLength() { return kNodeIsTooComplexForGreedyLoops; }
756
+ virtual ActionNode* Clone() { return new ActionNode(*this); }
757
+ virtual int ComputeFirstCharacterSet(int budget);
758
+ private:
759
+ union {
760
+ struct {
761
+ int reg;
762
+ int value;
763
+ } u_store_register;
764
+ struct {
765
+ int reg;
766
+ } u_increment_register;
767
+ struct {
768
+ int reg;
769
+ bool is_capture;
770
+ } u_position_register;
771
+ struct {
772
+ int stack_pointer_register;
773
+ int current_position_register;
774
+ int clear_register_count;
775
+ int clear_register_from;
776
+ } u_submatch;
777
+ struct {
778
+ int start_register;
779
+ int repetition_register;
780
+ int repetition_limit;
781
+ } u_empty_match_check;
782
+ struct {
783
+ int range_from;
784
+ int range_to;
785
+ } u_clear_captures;
786
+ } data_;
787
+ ActionNode(Type type, RegExpNode* on_success)
788
+ : SeqRegExpNode(on_success),
789
+ type_(type) { }
790
+ Type type_;
791
+ friend class DotPrinter;
792
+ };
793
+
794
+
795
+ class TextNode: public SeqRegExpNode {
796
+ public:
797
+ TextNode(ZoneList<TextElement>* elms,
798
+ RegExpNode* on_success)
799
+ : SeqRegExpNode(on_success),
800
+ elms_(elms) { }
801
+ TextNode(RegExpCharacterClass* that,
802
+ RegExpNode* on_success)
803
+ : SeqRegExpNode(on_success),
804
+ elms_(new ZoneList<TextElement>(1)) {
805
+ elms_->Add(TextElement::CharClass(that));
806
+ }
807
+ virtual void Accept(NodeVisitor* visitor);
808
+ virtual void Emit(RegExpCompiler* compiler, Trace* trace);
809
+ virtual int EatsAtLeast(int still_to_find, int recursion_depth);
810
+ virtual void GetQuickCheckDetails(QuickCheckDetails* details,
811
+ RegExpCompiler* compiler,
812
+ int characters_filled_in,
813
+ bool not_at_start);
814
+ ZoneList<TextElement>* elements() { return elms_; }
815
+ void MakeCaseIndependent(bool is_ascii);
816
+ virtual int GreedyLoopTextLength();
817
+ virtual TextNode* Clone() {
818
+ TextNode* result = new TextNode(*this);
819
+ result->CalculateOffsets();
820
+ return result;
821
+ }
822
+ void CalculateOffsets();
823
+ virtual int ComputeFirstCharacterSet(int budget);
824
+ private:
825
+ enum TextEmitPassType {
826
+ NON_ASCII_MATCH, // Check for characters that can't match.
827
+ SIMPLE_CHARACTER_MATCH, // Case-dependent single character check.
828
+ NON_LETTER_CHARACTER_MATCH, // Check characters that have no case equivs.
829
+ CASE_CHARACTER_MATCH, // Case-independent single character check.
830
+ CHARACTER_CLASS_MATCH // Character class.
831
+ };
832
+ static bool SkipPass(int pass, bool ignore_case);
833
+ static const int kFirstRealPass = SIMPLE_CHARACTER_MATCH;
834
+ static const int kLastPass = CHARACTER_CLASS_MATCH;
835
+ void TextEmitPass(RegExpCompiler* compiler,
836
+ TextEmitPassType pass,
837
+ bool preloaded,
838
+ Trace* trace,
839
+ bool first_element_checked,
840
+ int* checked_up_to);
841
+ int Length();
842
+ ZoneList<TextElement>* elms_;
843
+ };
844
+
845
+
846
+ class AssertionNode: public SeqRegExpNode {
847
+ public:
848
+ enum AssertionNodeType {
849
+ AT_END,
850
+ AT_START,
851
+ AT_BOUNDARY,
852
+ AT_NON_BOUNDARY,
853
+ AFTER_NEWLINE,
854
+ // Types not directly expressible in regexp syntax.
855
+ // Used for modifying a boundary node if its following character is
856
+ // known to be word and/or non-word.
857
+ AFTER_NONWORD_CHARACTER,
858
+ AFTER_WORD_CHARACTER
859
+ };
860
+ static AssertionNode* AtEnd(RegExpNode* on_success) {
861
+ return new AssertionNode(AT_END, on_success);
862
+ }
863
+ static AssertionNode* AtStart(RegExpNode* on_success) {
864
+ return new AssertionNode(AT_START, on_success);
865
+ }
866
+ static AssertionNode* AtBoundary(RegExpNode* on_success) {
867
+ return new AssertionNode(AT_BOUNDARY, on_success);
868
+ }
869
+ static AssertionNode* AtNonBoundary(RegExpNode* on_success) {
870
+ return new AssertionNode(AT_NON_BOUNDARY, on_success);
871
+ }
872
+ static AssertionNode* AfterNewline(RegExpNode* on_success) {
873
+ return new AssertionNode(AFTER_NEWLINE, on_success);
874
+ }
875
+ virtual void Accept(NodeVisitor* visitor);
876
+ virtual void Emit(RegExpCompiler* compiler, Trace* trace);
877
+ virtual int EatsAtLeast(int still_to_find, int recursion_depth);
878
+ virtual void GetQuickCheckDetails(QuickCheckDetails* details,
879
+ RegExpCompiler* compiler,
880
+ int filled_in,
881
+ bool not_at_start);
882
+ virtual int ComputeFirstCharacterSet(int budget);
883
+ virtual AssertionNode* Clone() { return new AssertionNode(*this); }
884
+ AssertionNodeType type() { return type_; }
885
+ void set_type(AssertionNodeType type) { type_ = type; }
886
+ private:
887
+ AssertionNode(AssertionNodeType t, RegExpNode* on_success)
888
+ : SeqRegExpNode(on_success), type_(t) { }
889
+ AssertionNodeType type_;
890
+ };
891
+
892
+
893
+ class BackReferenceNode: public SeqRegExpNode {
894
+ public:
895
+ BackReferenceNode(int start_reg,
896
+ int end_reg,
897
+ RegExpNode* on_success)
898
+ : SeqRegExpNode(on_success),
899
+ start_reg_(start_reg),
900
+ end_reg_(end_reg) { }
901
+ virtual void Accept(NodeVisitor* visitor);
902
+ int start_register() { return start_reg_; }
903
+ int end_register() { return end_reg_; }
904
+ virtual void Emit(RegExpCompiler* compiler, Trace* trace);
905
+ virtual int EatsAtLeast(int still_to_find, int recursion_depth);
906
+ virtual void GetQuickCheckDetails(QuickCheckDetails* details,
907
+ RegExpCompiler* compiler,
908
+ int characters_filled_in,
909
+ bool not_at_start) {
910
+ return;
911
+ }
912
+ virtual BackReferenceNode* Clone() { return new BackReferenceNode(*this); }
913
+ virtual int ComputeFirstCharacterSet(int budget);
914
+ private:
915
+ int start_reg_;
916
+ int end_reg_;
917
+ };
918
+
919
+
920
+ class EndNode: public RegExpNode {
921
+ public:
922
+ enum Action { ACCEPT, BACKTRACK, NEGATIVE_SUBMATCH_SUCCESS };
923
+ explicit EndNode(Action action) : action_(action) { }
924
+ virtual void Accept(NodeVisitor* visitor);
925
+ virtual void Emit(RegExpCompiler* compiler, Trace* trace);
926
+ virtual int EatsAtLeast(int still_to_find, int recursion_depth) { return 0; }
927
+ virtual void GetQuickCheckDetails(QuickCheckDetails* details,
928
+ RegExpCompiler* compiler,
929
+ int characters_filled_in,
930
+ bool not_at_start) {
931
+ // Returning 0 from EatsAtLeast should ensure we never get here.
932
+ UNREACHABLE();
933
+ }
934
+ virtual EndNode* Clone() { return new EndNode(*this); }
935
+ private:
936
+ Action action_;
937
+ };
938
+
939
+
940
+ class NegativeSubmatchSuccess: public EndNode {
941
+ public:
942
+ NegativeSubmatchSuccess(int stack_pointer_reg,
943
+ int position_reg,
944
+ int clear_capture_count,
945
+ int clear_capture_start)
946
+ : EndNode(NEGATIVE_SUBMATCH_SUCCESS),
947
+ stack_pointer_register_(stack_pointer_reg),
948
+ current_position_register_(position_reg),
949
+ clear_capture_count_(clear_capture_count),
950
+ clear_capture_start_(clear_capture_start) { }
951
+ virtual void Emit(RegExpCompiler* compiler, Trace* trace);
952
+
953
+ private:
954
+ int stack_pointer_register_;
955
+ int current_position_register_;
956
+ int clear_capture_count_;
957
+ int clear_capture_start_;
958
+ };
959
+
960
+
961
+ class Guard: public ZoneObject {
962
+ public:
963
+ enum Relation { LT, GEQ };
964
+ Guard(int reg, Relation op, int value)
965
+ : reg_(reg),
966
+ op_(op),
967
+ value_(value) { }
968
+ int reg() { return reg_; }
969
+ Relation op() { return op_; }
970
+ int value() { return value_; }
971
+
972
+ private:
973
+ int reg_;
974
+ Relation op_;
975
+ int value_;
976
+ };
977
+
978
+
979
+ class GuardedAlternative {
980
+ public:
981
+ explicit GuardedAlternative(RegExpNode* node) : node_(node), guards_(NULL) { }
982
+ void AddGuard(Guard* guard);
983
+ RegExpNode* node() { return node_; }
984
+ void set_node(RegExpNode* node) { node_ = node; }
985
+ ZoneList<Guard*>* guards() { return guards_; }
986
+
987
+ private:
988
+ RegExpNode* node_;
989
+ ZoneList<Guard*>* guards_;
990
+ };
991
+
992
+
993
+ class AlternativeGeneration;
994
+
995
+
996
+ class ChoiceNode: public RegExpNode {
997
+ public:
998
+ explicit ChoiceNode(int expected_size)
999
+ : alternatives_(new ZoneList<GuardedAlternative>(expected_size)),
1000
+ table_(NULL),
1001
+ not_at_start_(false),
1002
+ being_calculated_(false) { }
1003
+ virtual void Accept(NodeVisitor* visitor);
1004
+ void AddAlternative(GuardedAlternative node) { alternatives()->Add(node); }
1005
+ ZoneList<GuardedAlternative>* alternatives() { return alternatives_; }
1006
+ DispatchTable* GetTable(bool ignore_case);
1007
+ virtual void Emit(RegExpCompiler* compiler, Trace* trace);
1008
+ virtual int EatsAtLeast(int still_to_find, int recursion_depth);
1009
+ int EatsAtLeastHelper(int still_to_find,
1010
+ int recursion_depth,
1011
+ RegExpNode* ignore_this_node);
1012
+ virtual void GetQuickCheckDetails(QuickCheckDetails* details,
1013
+ RegExpCompiler* compiler,
1014
+ int characters_filled_in,
1015
+ bool not_at_start);
1016
+ virtual ChoiceNode* Clone() { return new ChoiceNode(*this); }
1017
+
1018
+ bool being_calculated() { return being_calculated_; }
1019
+ bool not_at_start() { return not_at_start_; }
1020
+ void set_not_at_start() { not_at_start_ = true; }
1021
+ void set_being_calculated(bool b) { being_calculated_ = b; }
1022
+ virtual bool try_to_emit_quick_check_for_alternative(int i) { return true; }
1023
+
1024
+ protected:
1025
+ int GreedyLoopTextLength(GuardedAlternative* alternative);
1026
+ ZoneList<GuardedAlternative>* alternatives_;
1027
+
1028
+ private:
1029
+ friend class DispatchTableConstructor;
1030
+ friend class Analysis;
1031
+ void GenerateGuard(RegExpMacroAssembler* macro_assembler,
1032
+ Guard* guard,
1033
+ Trace* trace);
1034
+ int CalculatePreloadCharacters(RegExpCompiler* compiler);
1035
+ void EmitOutOfLineContinuation(RegExpCompiler* compiler,
1036
+ Trace* trace,
1037
+ GuardedAlternative alternative,
1038
+ AlternativeGeneration* alt_gen,
1039
+ int preload_characters,
1040
+ bool next_expects_preload);
1041
+ DispatchTable* table_;
1042
+ // If true, this node is never checked at the start of the input.
1043
+ // Allows a new trace to start with at_start() set to false.
1044
+ bool not_at_start_;
1045
+ bool being_calculated_;
1046
+ };
1047
+
1048
+
1049
+ class NegativeLookaheadChoiceNode: public ChoiceNode {
1050
+ public:
1051
+ explicit NegativeLookaheadChoiceNode(GuardedAlternative this_must_fail,
1052
+ GuardedAlternative then_do_this)
1053
+ : ChoiceNode(2) {
1054
+ AddAlternative(this_must_fail);
1055
+ AddAlternative(then_do_this);
1056
+ }
1057
+ virtual int EatsAtLeast(int still_to_find, int recursion_depth);
1058
+ virtual void GetQuickCheckDetails(QuickCheckDetails* details,
1059
+ RegExpCompiler* compiler,
1060
+ int characters_filled_in,
1061
+ bool not_at_start);
1062
+ // For a negative lookahead we don't emit the quick check for the
1063
+ // alternative that is expected to fail. This is because quick check code
1064
+ // starts by loading enough characters for the alternative that takes fewest
1065
+ // characters, but on a negative lookahead the negative branch did not take
1066
+ // part in that calculation (EatsAtLeast) so the assumptions don't hold.
1067
+ virtual bool try_to_emit_quick_check_for_alternative(int i) { return i != 0; }
1068
+ virtual int ComputeFirstCharacterSet(int budget);
1069
+ };
1070
+
1071
+
1072
+ class LoopChoiceNode: public ChoiceNode {
1073
+ public:
1074
+ explicit LoopChoiceNode(bool body_can_be_zero_length)
1075
+ : ChoiceNode(2),
1076
+ loop_node_(NULL),
1077
+ continue_node_(NULL),
1078
+ body_can_be_zero_length_(body_can_be_zero_length) { }
1079
+ void AddLoopAlternative(GuardedAlternative alt);
1080
+ void AddContinueAlternative(GuardedAlternative alt);
1081
+ virtual void Emit(RegExpCompiler* compiler, Trace* trace);
1082
+ virtual int EatsAtLeast(int still_to_find, int recursion_depth);
1083
+ virtual void GetQuickCheckDetails(QuickCheckDetails* details,
1084
+ RegExpCompiler* compiler,
1085
+ int characters_filled_in,
1086
+ bool not_at_start);
1087
+ virtual int ComputeFirstCharacterSet(int budget);
1088
+ virtual LoopChoiceNode* Clone() { return new LoopChoiceNode(*this); }
1089
+ RegExpNode* loop_node() { return loop_node_; }
1090
+ RegExpNode* continue_node() { return continue_node_; }
1091
+ bool body_can_be_zero_length() { return body_can_be_zero_length_; }
1092
+ virtual void Accept(NodeVisitor* visitor);
1093
+
1094
+ private:
1095
+ // AddAlternative is made private for loop nodes because alternatives
1096
+ // should not be added freely, we need to keep track of which node
1097
+ // goes back to the node itself.
1098
+ void AddAlternative(GuardedAlternative node) {
1099
+ ChoiceNode::AddAlternative(node);
1100
+ }
1101
+
1102
+ RegExpNode* loop_node_;
1103
+ RegExpNode* continue_node_;
1104
+ bool body_can_be_zero_length_;
1105
+ };
1106
+
1107
+
1108
+ // There are many ways to generate code for a node. This class encapsulates
1109
+ // the current way we should be generating. In other words it encapsulates
1110
+ // the current state of the code generator. The effect of this is that we
1111
+ // generate code for paths that the matcher can take through the regular
1112
+ // expression. A given node in the regexp can be code-generated several times
1113
+ // as it can be part of several traces. For example for the regexp:
1114
+ // /foo(bar|ip)baz/ the code to match baz will be generated twice, once as part
1115
+ // of the foo-bar-baz trace and once as part of the foo-ip-baz trace. The code
1116
+ // to match foo is generated only once (the traces have a common prefix). The
1117
+ // code to store the capture is deferred and generated (twice) after the places
1118
+ // where baz has been matched.
1119
+ class Trace {
1120
+ public:
1121
+ // A value for a property that is either known to be true, know to be false,
1122
+ // or not known.
1123
+ enum TriBool {
1124
+ UNKNOWN = -1, FALSE = 0, TRUE = 1
1125
+ };
1126
+
1127
+ class DeferredAction {
1128
+ public:
1129
+ DeferredAction(ActionNode::Type type, int reg)
1130
+ : type_(type), reg_(reg), next_(NULL) { }
1131
+ DeferredAction* next() { return next_; }
1132
+ bool Mentions(int reg);
1133
+ int reg() { return reg_; }
1134
+ ActionNode::Type type() { return type_; }
1135
+ private:
1136
+ ActionNode::Type type_;
1137
+ int reg_;
1138
+ DeferredAction* next_;
1139
+ friend class Trace;
1140
+ };
1141
+
1142
+ class DeferredCapture : public DeferredAction {
1143
+ public:
1144
+ DeferredCapture(int reg, bool is_capture, Trace* trace)
1145
+ : DeferredAction(ActionNode::STORE_POSITION, reg),
1146
+ cp_offset_(trace->cp_offset()),
1147
+ is_capture_(is_capture) { }
1148
+ int cp_offset() { return cp_offset_; }
1149
+ bool is_capture() { return is_capture_; }
1150
+ private:
1151
+ int cp_offset_;
1152
+ bool is_capture_;
1153
+ void set_cp_offset(int cp_offset) { cp_offset_ = cp_offset; }
1154
+ };
1155
+
1156
+ class DeferredSetRegister : public DeferredAction {
1157
+ public:
1158
+ DeferredSetRegister(int reg, int value)
1159
+ : DeferredAction(ActionNode::SET_REGISTER, reg),
1160
+ value_(value) { }
1161
+ int value() { return value_; }
1162
+ private:
1163
+ int value_;
1164
+ };
1165
+
1166
+ class DeferredClearCaptures : public DeferredAction {
1167
+ public:
1168
+ explicit DeferredClearCaptures(Interval range)
1169
+ : DeferredAction(ActionNode::CLEAR_CAPTURES, -1),
1170
+ range_(range) { }
1171
+ Interval range() { return range_; }
1172
+ private:
1173
+ Interval range_;
1174
+ };
1175
+
1176
+ class DeferredIncrementRegister : public DeferredAction {
1177
+ public:
1178
+ explicit DeferredIncrementRegister(int reg)
1179
+ : DeferredAction(ActionNode::INCREMENT_REGISTER, reg) { }
1180
+ };
1181
+
1182
+ Trace()
1183
+ : cp_offset_(0),
1184
+ actions_(NULL),
1185
+ backtrack_(NULL),
1186
+ stop_node_(NULL),
1187
+ loop_label_(NULL),
1188
+ characters_preloaded_(0),
1189
+ bound_checked_up_to_(0),
1190
+ flush_budget_(100),
1191
+ at_start_(UNKNOWN) { }
1192
+
1193
+ // End the trace. This involves flushing the deferred actions in the trace
1194
+ // and pushing a backtrack location onto the backtrack stack. Once this is
1195
+ // done we can start a new trace or go to one that has already been
1196
+ // generated.
1197
+ void Flush(RegExpCompiler* compiler, RegExpNode* successor);
1198
+ int cp_offset() { return cp_offset_; }
1199
+ DeferredAction* actions() { return actions_; }
1200
+ // A trivial trace is one that has no deferred actions or other state that
1201
+ // affects the assumptions used when generating code. There is no recorded
1202
+ // backtrack location in a trivial trace, so with a trivial trace we will
1203
+ // generate code that, on a failure to match, gets the backtrack location
1204
+ // from the backtrack stack rather than using a direct jump instruction. We
1205
+ // always start code generation with a trivial trace and non-trivial traces
1206
+ // are created as we emit code for nodes or add to the list of deferred
1207
+ // actions in the trace. The location of the code generated for a node using
1208
+ // a trivial trace is recorded in a label in the node so that gotos can be
1209
+ // generated to that code.
1210
+ bool is_trivial() {
1211
+ return backtrack_ == NULL &&
1212
+ actions_ == NULL &&
1213
+ cp_offset_ == 0 &&
1214
+ characters_preloaded_ == 0 &&
1215
+ bound_checked_up_to_ == 0 &&
1216
+ quick_check_performed_.characters() == 0 &&
1217
+ at_start_ == UNKNOWN;
1218
+ }
1219
+ TriBool at_start() { return at_start_; }
1220
+ void set_at_start(bool at_start) { at_start_ = at_start ? TRUE : FALSE; }
1221
+ Label* backtrack() { return backtrack_; }
1222
+ Label* loop_label() { return loop_label_; }
1223
+ RegExpNode* stop_node() { return stop_node_; }
1224
+ int characters_preloaded() { return characters_preloaded_; }
1225
+ int bound_checked_up_to() { return bound_checked_up_to_; }
1226
+ int flush_budget() { return flush_budget_; }
1227
+ QuickCheckDetails* quick_check_performed() { return &quick_check_performed_; }
1228
+ bool mentions_reg(int reg);
1229
+ // Returns true if a deferred position store exists to the specified
1230
+ // register and stores the offset in the out-parameter. Otherwise
1231
+ // returns false.
1232
+ bool GetStoredPosition(int reg, int* cp_offset);
1233
+ // These set methods and AdvanceCurrentPositionInTrace should be used only on
1234
+ // new traces - the intention is that traces are immutable after creation.
1235
+ void add_action(DeferredAction* new_action) {
1236
+ ASSERT(new_action->next_ == NULL);
1237
+ new_action->next_ = actions_;
1238
+ actions_ = new_action;
1239
+ }
1240
+ void set_backtrack(Label* backtrack) { backtrack_ = backtrack; }
1241
+ void set_stop_node(RegExpNode* node) { stop_node_ = node; }
1242
+ void set_loop_label(Label* label) { loop_label_ = label; }
1243
+ void set_characters_preloaded(int count) { characters_preloaded_ = count; }
1244
+ void set_bound_checked_up_to(int to) { bound_checked_up_to_ = to; }
1245
+ void set_flush_budget(int to) { flush_budget_ = to; }
1246
+ void set_quick_check_performed(QuickCheckDetails* d) {
1247
+ quick_check_performed_ = *d;
1248
+ }
1249
+ void InvalidateCurrentCharacter();
1250
+ void AdvanceCurrentPositionInTrace(int by, RegExpCompiler* compiler);
1251
+ private:
1252
+ int FindAffectedRegisters(OutSet* affected_registers);
1253
+ void PerformDeferredActions(RegExpMacroAssembler* macro,
1254
+ int max_register,
1255
+ OutSet& affected_registers,
1256
+ OutSet* registers_to_pop,
1257
+ OutSet* registers_to_clear);
1258
+ void RestoreAffectedRegisters(RegExpMacroAssembler* macro,
1259
+ int max_register,
1260
+ OutSet& registers_to_pop,
1261
+ OutSet& registers_to_clear);
1262
+ int cp_offset_;
1263
+ DeferredAction* actions_;
1264
+ Label* backtrack_;
1265
+ RegExpNode* stop_node_;
1266
+ Label* loop_label_;
1267
+ int characters_preloaded_;
1268
+ int bound_checked_up_to_;
1269
+ QuickCheckDetails quick_check_performed_;
1270
+ int flush_budget_;
1271
+ TriBool at_start_;
1272
+ };
1273
+
1274
+
1275
+ class NodeVisitor {
1276
+ public:
1277
+ virtual ~NodeVisitor() { }
1278
+ #define DECLARE_VISIT(Type) \
1279
+ virtual void Visit##Type(Type##Node* that) = 0;
1280
+ FOR_EACH_NODE_TYPE(DECLARE_VISIT)
1281
+ #undef DECLARE_VISIT
1282
+ virtual void VisitLoopChoice(LoopChoiceNode* that) { VisitChoice(that); }
1283
+ };
1284
+
1285
+
1286
+ // Node visitor used to add the start set of the alternatives to the
1287
+ // dispatch table of a choice node.
1288
+ class DispatchTableConstructor: public NodeVisitor {
1289
+ public:
1290
+ DispatchTableConstructor(DispatchTable* table, bool ignore_case)
1291
+ : table_(table),
1292
+ choice_index_(-1),
1293
+ ignore_case_(ignore_case) { }
1294
+
1295
+ void BuildTable(ChoiceNode* node);
1296
+
1297
+ void AddRange(CharacterRange range) {
1298
+ table()->AddRange(range, choice_index_);
1299
+ }
1300
+
1301
+ void AddInverse(ZoneList<CharacterRange>* ranges);
1302
+
1303
+ #define DECLARE_VISIT(Type) \
1304
+ virtual void Visit##Type(Type##Node* that);
1305
+ FOR_EACH_NODE_TYPE(DECLARE_VISIT)
1306
+ #undef DECLARE_VISIT
1307
+
1308
+ DispatchTable* table() { return table_; }
1309
+ void set_choice_index(int value) { choice_index_ = value; }
1310
+
1311
+ protected:
1312
+ DispatchTable* table_;
1313
+ int choice_index_;
1314
+ bool ignore_case_;
1315
+ };
1316
+
1317
+
1318
+ // Assertion propagation moves information about assertions such as
1319
+ // \b to the affected nodes. For instance, in /.\b./ information must
1320
+ // be propagated to the first '.' that whatever follows needs to know
1321
+ // if it matched a word or a non-word, and to the second '.' that it
1322
+ // has to check if it succeeds a word or non-word. In this case the
1323
+ // result will be something like:
1324
+ //
1325
+ // +-------+ +------------+
1326
+ // | . | | . |
1327
+ // +-------+ ---> +------------+
1328
+ // | word? | | check word |
1329
+ // +-------+ +------------+
1330
+ class Analysis: public NodeVisitor {
1331
+ public:
1332
+ Analysis(bool ignore_case, bool is_ascii)
1333
+ : ignore_case_(ignore_case),
1334
+ is_ascii_(is_ascii),
1335
+ error_message_(NULL) { }
1336
+ void EnsureAnalyzed(RegExpNode* node);
1337
+
1338
+ #define DECLARE_VISIT(Type) \
1339
+ virtual void Visit##Type(Type##Node* that);
1340
+ FOR_EACH_NODE_TYPE(DECLARE_VISIT)
1341
+ #undef DECLARE_VISIT
1342
+ virtual void VisitLoopChoice(LoopChoiceNode* that);
1343
+
1344
+ bool has_failed() { return error_message_ != NULL; }
1345
+ const char* error_message() {
1346
+ ASSERT(error_message_ != NULL);
1347
+ return error_message_;
1348
+ }
1349
+ void fail(const char* error_message) {
1350
+ error_message_ = error_message;
1351
+ }
1352
+ private:
1353
+ bool ignore_case_;
1354
+ bool is_ascii_;
1355
+ const char* error_message_;
1356
+
1357
+ DISALLOW_IMPLICIT_CONSTRUCTORS(Analysis);
1358
+ };
1359
+
1360
+
1361
+ struct RegExpCompileData {
1362
+ RegExpCompileData()
1363
+ : tree(NULL),
1364
+ node(NULL),
1365
+ simple(true),
1366
+ contains_anchor(false),
1367
+ capture_count(0) { }
1368
+ RegExpTree* tree;
1369
+ RegExpNode* node;
1370
+ bool simple;
1371
+ bool contains_anchor;
1372
+ Handle<String> error;
1373
+ int capture_count;
1374
+ };
1375
+
1376
+
1377
+ class RegExpEngine: public AllStatic {
1378
+ public:
1379
+ struct CompilationResult {
1380
+ explicit CompilationResult(const char* error_message)
1381
+ : error_message(error_message),
1382
+ code(Heap::the_hole_value()),
1383
+ num_registers(0) {}
1384
+ CompilationResult(Object* code, int registers)
1385
+ : error_message(NULL),
1386
+ code(code),
1387
+ num_registers(registers) {}
1388
+ const char* error_message;
1389
+ Object* code;
1390
+ int num_registers;
1391
+ };
1392
+
1393
+ static CompilationResult Compile(RegExpCompileData* input,
1394
+ bool ignore_case,
1395
+ bool multiline,
1396
+ Handle<String> pattern,
1397
+ bool is_ascii);
1398
+
1399
+ static void DotPrint(const char* label, RegExpNode* node, bool ignore_case);
1400
+ };
1401
+
1402
+
1403
+ class OffsetsVector {
1404
+ public:
1405
+ inline OffsetsVector(int num_registers)
1406
+ : offsets_vector_length_(num_registers) {
1407
+ if (offsets_vector_length_ > kStaticOffsetsVectorSize) {
1408
+ vector_ = NewArray<int>(offsets_vector_length_);
1409
+ } else {
1410
+ vector_ = static_offsets_vector_;
1411
+ }
1412
+ }
1413
+ inline ~OffsetsVector() {
1414
+ if (offsets_vector_length_ > kStaticOffsetsVectorSize) {
1415
+ DeleteArray(vector_);
1416
+ vector_ = NULL;
1417
+ }
1418
+ }
1419
+ inline int* vector() { return vector_; }
1420
+ inline int length() { return offsets_vector_length_; }
1421
+
1422
+ static const int kStaticOffsetsVectorSize = 50;
1423
+
1424
+ private:
1425
+ static Address static_offsets_vector_address() {
1426
+ return reinterpret_cast<Address>(&static_offsets_vector_);
1427
+ }
1428
+
1429
+ int* vector_;
1430
+ int offsets_vector_length_;
1431
+ static int static_offsets_vector_[kStaticOffsetsVectorSize];
1432
+
1433
+ friend class ExternalReference;
1434
+ };
1435
+
1436
+
1437
+ } } // namespace v8::internal
1438
+
1439
+ #endif // V8_JSREGEXP_H_