From ec80f7bacd8c53cf53eade6656b35b573e39c248 Mon Sep 17 00:00:00 2001
From: Jeremy Hu <huxingyi@msn.com>
Date: Thu, 16 Jan 2020 22:37:16 +0930
Subject: [PATCH] Fix quickjs build on win64 Add back script system and fix
 build error on windows 64 bit system.

---
 dust3d.pro                                    |    31 +
 languages/dust3d_zh_CN.ts                     |     4 +
 resources.qrc                                 |     2 +
 resources/model-procedural-tree.ds3           |   881 +
 src/document.cpp                              |   210 +
 src/document.h                                |    25 +
 src/documentwindow.cpp                        |    55 +-
 src/documentwindow.h                          |     1 +
 src/scripteditwidget.cpp                      |   153 +
 src/scripteditwidget.h                        |    99 +
 src/scriptrunner.cpp                          |   884 +
 src/scriptrunner.h                            |   114 +
 src/scriptvariableswidget.cpp                 |   194 +
 src/scriptvariableswidget.h                   |    25 +
 src/scriptwidget.cpp                          |    68 +
 src/scriptwidget.h                            |    22 +
 src/variablesxml.cpp                          |    64 +
 src/variablesxml.h                            |     9 +
 .../quickjs-2019-07-09-dust3d/Makefile        |   463 +
 .../quickjs/quickjs-2019-07-09-dust3d/TODO    |    83 +
 .../quickjs/quickjs-2019-07-09-dust3d/VERSION |     1 +
 .../quickjs/quickjs-2019-07-09-dust3d/bjson.c |    88 +
 .../quickjs-2019-07-09-dust3d/cutils.c        |   642 +
 .../quickjs-2019-07-09-dust3d/cutils.h        |   383 +
 .../doc/jsbignum.html                         |  1054 +
 .../doc/jsbignum.pdf                          |   Bin 0 -> 200966 bytes
 .../doc/jsbignum.texi                         |   844 +
 .../doc/quickjs.html                          |  1050 +
 .../quickjs-2019-07-09-dust3d/doc/quickjs.pdf |   Bin 0 -> 154471 bytes
 .../doc/quickjs.texi                          |   817 +
 .../examples/c_module.js                      |     6 +
 .../quickjs-2019-07-09-dust3d/examples/fib.c  |    72 +
 .../examples/fib_module.js                    |    10 +
 .../examples/hello.js                         |     1 +
 .../examples/hello_module.js                  |     6 +
 .../quickjs-2019-07-09-dust3d/examples/pi.js  |    66 +
 .../quickjs-2019-07-09-dust3d/jscompress.c    |   918 +
 .../quickjs/quickjs-2019-07-09-dust3d/libbf.c |  5805 ++
 .../quickjs/quickjs-2019-07-09-dust3d/libbf.h |   350 +
 .../libregexp-opcode.h                        |    58 +
 .../quickjs-2019-07-09-dust3d/libregexp.c     |  2567 +
 .../quickjs-2019-07-09-dust3d/libregexp.h     |    91 +
 .../libunicode-table.h                        |  4269 ++
 .../quickjs-2019-07-09-dust3d/libunicode.c    |  1540 +
 .../quickjs-2019-07-09-dust3d/libunicode.h    |   124 +
 .../quickjs/quickjs-2019-07-09-dust3d/list.h  |   100 +
 .../quickjs/quickjs-2019-07-09-dust3d/qjs.c   |   466 +
 .../quickjs/quickjs-2019-07-09-dust3d/qjsc.c  |   636 +
 .../quickjs-2019-07-09-dust3d/qjscalc.js      |  2454 +
 .../quickjs-2019-07-09-dust3d/quickjs-atom.h  |   274 +
 .../quickjs-2019-07-09-dust3d/quickjs-libc.c  |  1825 +
 .../quickjs-2019-07-09-dust3d/quickjs-libc.h  |    44 +
 .../quickjs-opcode.h                          |   354 +
 .../quickjs-2019-07-09-dust3d/quickjs.c       | 48183 ++++++++++++++++
 .../quickjs-2019-07-09-dust3d/quickjs.h       |   909 +
 .../quickjs-2019-07-09-dust3d/readme.txt      |     1 +
 .../quickjs-2019-07-09-dust3d/release.sh      |    85 +
 .../quickjs/quickjs-2019-07-09-dust3d/repl.js |  1504 +
 .../quickjs-2019-07-09-dust3d/run-test262.c   |  1970 +
 .../quickjs-2019-07-09-dust3d/test262.conf    |   173 +
 .../test262_errors.txt                        |     0
 .../quickjs-2019-07-09-dust3d/test262bn.conf  |   175 +
 .../test262bn_errors.txt                      |     0
 .../quickjs-2019-07-09-dust3d/test262o.conf   |   404 +
 .../test262o_errors.txt                       |     0
 .../tests/microbench.js                       |  1004 +
 .../tests/test262.patch                       |   683 +
 .../tests/test_bignum.js                      |   269 +
 .../tests/test_bjson.js                       |   119 +
 .../tests/test_builtin.js                     |   598 +
 .../tests/test_closure.js                     |   221 +
 .../tests/test_loop.js                        |   368 +
 .../tests/test_op.js                          |   302 +
 .../tests/test_std.js                         |   147 +
 .../quickjs-2019-07-09-dust3d/unicode_gen.c   |  3056 +
 .../unicode_gen_def.h                         |   275 +
 thirdparty/three.js/LICENSE                   |    21 +
 thirdparty/three.js/README.md                 |     1 +
 thirdparty/three.js/dust3d.three.js           |  1455 +
 79 files changed, 92224 insertions(+), 1 deletion(-)
 create mode 100755 resources/model-procedural-tree.ds3
 create mode 100755 src/scripteditwidget.cpp
 create mode 100755 src/scripteditwidget.h
 create mode 100755 src/scriptrunner.cpp
 create mode 100755 src/scriptrunner.h
 create mode 100755 src/scriptvariableswidget.cpp
 create mode 100755 src/scriptvariableswidget.h
 create mode 100755 src/scriptwidget.cpp
 create mode 100755 src/scriptwidget.h
 create mode 100755 src/variablesxml.cpp
 create mode 100755 src/variablesxml.h
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/Makefile
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/TODO
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/VERSION
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/bjson.c
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/cutils.c
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/cutils.h
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.html
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.pdf
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.texi
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.html
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.pdf
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.texi
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/c_module.js
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/fib.c
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/fib_module.js
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/hello.js
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/hello_module.js
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/pi.js
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/jscompress.c
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/libbf.c
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/libbf.h
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp-opcode.h
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp.c
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp.h
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode-table.h
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode.c
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode.h
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/list.h
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjs.c
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjsc.c
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjscalc.js
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-atom.h
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-libc.c
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-libc.h
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-opcode.h
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs.c
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs.h
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/readme.txt
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/release.sh
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/repl.js
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/run-test262.c
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262.conf
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262_errors.txt
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262bn.conf
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262bn_errors.txt
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262o.conf
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262o_errors.txt
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/microbench.js
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test262.patch
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_bignum.js
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_bjson.js
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_builtin.js
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_closure.js
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_loop.js
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_op.js
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_std.js
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/unicode_gen.c
 create mode 100755 thirdparty/quickjs/quickjs-2019-07-09-dust3d/unicode_gen_def.h
 create mode 100755 thirdparty/three.js/LICENSE
 create mode 100755 thirdparty/three.js/README.md
 create mode 100755 thirdparty/three.js/dust3d.three.js

diff --git a/dust3d.pro b/dust3d.pro
index 70981631..a60efbed 100644
--- a/dust3d.pro
+++ b/dust3d.pro
@@ -398,6 +398,21 @@ HEADERS += src/preferences.h
 
 HEADERS += src/shadervertex.h
 
+SOURCES += src/scripteditwidget.cpp
+HEADERS += src/scripteditwidget.h
+
+SOURCES += src/scriptvariableswidget.cpp
+HEADERS += src/scriptvariableswidget.h
+
+SOURCES += src/scriptwidget.cpp
+HEADERS += src/scriptwidget.h
+
+SOURCES += src/scriptrunner.cpp
+HEADERS += src/scriptrunner.h
+
+SOURCES += src/variablesxml.cpp
+HEADERS += src/variablesxml.h
+
 SOURCES += src/updateschecker.cpp
 HEADERS += src/updateschecker.h
 
@@ -741,6 +756,22 @@ HEADERS += thirdparty/bullet3/src/BulletCollision/NarrowPhaseCollision/btGjkEpa2
 SOURCES += thirdparty/bullet3/src/BulletCollision/CollisionShapes/btBoxShape.cpp
 HEADERS += thirdparty/bullet3/src/BulletCollision/CollisionShapes/btBoxShape.h
 
+INCLUDEPATH += thirdparty/quickjs/quickjs-2019-07-09-dust3d
+
+DEFINES += "CONFIG_VERSION=\"\\\"2019-07-09\\\"\""
+
+SOURCES += thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs.c
+HEADERS += thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs.h
+
+SOURCES += thirdparty/quickjs/quickjs-2019-07-09-dust3d/cutils.c
+HEADERS += thirdparty/quickjs/quickjs-2019-07-09-dust3d/cutils.h
+
+SOURCES += thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode.c
+HEADERS += thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode.h
+
+SOURCES += thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp.c
+HEADERS += thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp.h
+
 INCLUDEPATH += thirdparty/crc64
 
 SOURCES += thirdparty/crc64/crc64.c
diff --git a/languages/dust3d_zh_CN.ts b/languages/dust3d_zh_CN.ts
index d02f909e..13619237 100644
--- a/languages/dust3d_zh_CN.ts
+++ b/languages/dust3d_zh_CN.ts
@@ -398,6 +398,10 @@ Tips:
         <source>Toggle Color</source>
         <translation>打开/关闭颜色</translation>
     </message>
+    <message>
+        <source>Script</source>
+        <translation>脚本</translation>
+    </message>
 </context>
 <context>
     <name>ExportPreviewWidget</name>
diff --git a/resources.qrc b/resources.qrc
index bbb815bd..0f0cd02e 100644
--- a/resources.qrc
+++ b/resources.qrc
@@ -14,6 +14,7 @@
     <file>resources/model-meerkat.ds3</file>
     <file>resources/model-mosquito.ds3</file>
     <file>resources/model-seagull.ds3</file>
+    <file>resources/model-procedural-tree.ds3</file>
     <file>resources/triangle.png</file>
     <file>resources/quad.png</file>
     <file>resources/pentagon.png</file>
@@ -25,6 +26,7 @@
     <file>shaders/default.frag</file>
     <file>shaders/default.core.vert</file>
     <file>shaders/default.core.frag</file>
+    <file>thirdparty/three.js/dust3d.three.js</file>
     <file>languages/dust3d_zh_CN.qm</file>
     <file>ACKNOWLEDGEMENTS.html</file>
     <file>AUTHORS</file>
diff --git a/resources/model-procedural-tree.ds3 b/resources/model-procedural-tree.ds3
new file mode 100755
index 00000000..3e3c29a9
--- /dev/null
+++ b/resources/model-procedural-tree.ds3
@@ -0,0 +1,881 @@
+DUST3D 1.0 xml 0000000257
+<?xml version="1.0" encoding="UTF-8"?>
+<ds3>
+    <model name="model.xml" offset="0" size="117317"/>
+    <script name="model.js" offset="117317" size="8514"/>
+    <variable name="variables.xml" offset="125831" size="1793"/>
+</ds3>
+<?xml version="1.0" encoding="UTF-8"?>
+<canvas originX="0.506767" originY="0.615943" originZ="1.08543" rigType="None">
+    <nodes>
+        <node id="{001eb845-4bed-4de5-9803-ba8ca7faafaf}" partId="{87fbd826-5677-48f5-83d3-8091d48ef8d7}" radius="0" x="0.624675" y="0.232533" z="1.08441"/>
+        <node id="{021bd224-eaac-49a1-a91f-0f2406f26f8a}" partId="{8f49f8aa-cb67-4955-9063-92e33042cb02}" radius="0.00829716" x="0.529162" y="0.319461" z="0.834381"/>
+        <node id="{02b8c92c-3aad-43b4-b2d6-eb0659a8a206}" partId="{36c17734-cbeb-4637-822c-71f680aa5a49}" radius="0.0094301" x="0.58636" y="0.281492" z="0.751192"/>
+        <node id="{0390d0a1-814a-4705-999e-5932354f0244}" partId="{e47c18bd-1154-48f4-96d5-954787c54562}" radius="0.00841411" x="0.518194" y="0.26891" z="1.02987"/>
+        <node id="{0402a0e9-9712-4d9c-b022-ea25f2ed64d0}" partId="{504953c2-aef4-4f37-be54-8f23c1f3f0fc}" radius="0" x="0.508304" y="0.322731" z="0.792632"/>
+        <node id="{0434ac30-312c-4b70-984e-5a0971e9eb75}" partId="{5b7db920-6126-4e3a-a16d-2fa6c227a696}" radius="0.00817509" x="0.50548" y="0.256846" z="1.00709"/>
+        <node id="{052c2ec6-ad61-40af-b659-14a23612734d}" partId="{36c17734-cbeb-4637-822c-71f680aa5a49}" radius="0" x="0.593867" y="0.274461" z="0.741533"/>
+        <node id="{05438075-6182-4f45-80c2-35625897b718}" partId="{a96bc03c-93f9-4cfd-abd4-e8d135fc8b49}" radius="0.00541154" x="0.497586" y="0.140403" z="1.00711"/>
+        <node id="{0582fcb5-78cf-4f27-bd85-0ccd279e8713}" partId="{504953c2-aef4-4f37-be54-8f23c1f3f0fc}" radius="0.0112927" x="0.50664" y="0.338481" z="0.812135"/>
+        <node id="{05c483ea-2649-48b1-80f9-f23a57335a5f}" partId="{52d54b31-5e73-444b-8bae-2ebc51ff209e}" radius="0.00121829" x="0.540098" y="0.379707" z="0.858939"/>
+        <node id="{067095a4-8e69-40d7-bc00-9c0a7f4e1e3c}" partId="{092b0f10-67c1-4032-9c49-168067836057}" radius="0.0036703" x="0.518194" y="0.26891" z="1.02987"/>
+        <node id="{06f82254-ab2d-44f4-bc96-3814316535a9}" partId="{6be248ef-32e3-43b0-b4bc-9e9cc8fae38e}" radius="0.00804375" x="0.540098" y="0.379707" z="0.858939"/>
+        <node id="{0711915a-a413-42b5-8022-35668c45d39b}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" radius="0.0192266" x="0.52941" y="0.945103" z="1.02527"/>
+        <node id="{071305c7-8044-4c28-8ccc-4f74cffb61cc}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" radius="0.0205617" x="0.526812" y="1.00058" z="1.01213"/>
+        <node id="{096379fc-4ca1-4c6d-b242-e353a20ffc88}" partId="{87fbd826-5677-48f5-83d3-8091d48ef8d7}" radius="0.0114691" x="0.61185" y="0.235283" z="1.07547"/>
+        <node id="{09f3f5fa-46f1-476c-aa35-3df95debd16f}" partId="{1716cb6d-01ed-4522-9ea3-7470418c6b51}" radius="0.00705143" x="0.733929" y="0.0905315" z="1.08278"/>
+        <node id="{0a8e8fb2-9858-49d2-8686-6ed728dccbc2}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" radius="0.00743484" x="0.521034" y="0.321097" z="1.03678"/>
+        <node id="{0b4f4946-8ff1-4efe-bdfe-0b611af6a655}" partId="{b5812967-d429-4214-a11c-f04918089461}" radius="0.00854656" x="0.763122" y="0.056545" z="1.12847"/>
+        <node id="{0b58ba98-f204-40ee-be03-f62292b2d250}" partId="{f1b78adc-6fdc-4414-bab8-8e98890a21ca}" radius="0" x="0.431781" y="0.219264" z="0.994834"/>
+        <node id="{0bd7865d-7f8d-46cb-a1ba-4ed601bf62fe}" partId="{01f7a857-f594-42fc-8b5d-b3bdae4dacda}" radius="0.0117866" x="0.747991" y="0.0634021" z="1.10862"/>
+        <node id="{0c131c2e-c763-4239-aae8-c71e219bb2ff}" partId="{9b4be491-12d5-4eea-8ee9-87dff887b292}" radius="0.0120206" x="0.517528" y="0.197616" z="1.01863"/>
+        <node id="{0c3ed74f-ee80-41a9-8568-1487fe0cfd7c}" partId="{8f49f8aa-cb67-4955-9063-92e33042cb02}" radius="0.0165943" x="0.52147" y="0.327551" z="0.829132"/>
+        <node id="{0e5d29f3-fb8f-4d5c-b156-e4a3e028d97d}" partId="{389a356e-22e6-4172-8c0d-1b835462d7b5}" radius="0.0136131" x="0.462094" y="0.0440756" z="0.990634"/>
+        <node id="{0f14d7ef-6d9e-42aa-afea-17e850abd25d}" partId="{f1b78adc-6fdc-4414-bab8-8e98890a21ca}" radius="0.00665101" x="0.436937" y="0.226714" z="0.995019"/>
+        <node id="{0f798576-2812-4db6-b605-9ef70f713c8b}" partId="{700ce49d-5978-4ae1-847e-404fdc912625}" radius="0.0181634" x="0.478383" y="0.0799667" z="0.997972"/>
+        <node id="{10582ab2-cd50-47a0-bb86-9272f251af03}" partId="{5b7db920-6126-4e3a-a16d-2fa6c227a696}" radius="0" x="0.511773" y="0.247377" z="1.00342"/>
+        <node id="{105d5ada-f06b-474f-82a7-34fbfa628526}" partId="{3c4883ad-20db-4f7c-a728-e11bc72de231}" radius="0" x="0.490709" y="0.279837" z="1.03157"/>
+        <node id="{10d61f38-3849-4852-9dd1-2be2ad90d468}" partId="{bb6e0337-94a1-4b8b-8894-9f40dc5577b5}" radius="0" x="0.794786" y="0.0436219" z="1.08823"/>
+        <node id="{117ef567-17a0-425e-9fcb-ae1610e91539}" partId="{9538c8a9-1e82-4d5a-8e0e-b7a0d701c5f9}" radius="0.0113278" x="0.435208" y="-0.122352" z="0.947148"/>
+        <node id="{1207414b-6386-42f4-b3b4-e774497e4fa9}" partId="{1716cb6d-01ed-4522-9ea3-7470418c6b51}" radius="0" x="0.741845" y="0.083804" z="1.08452"/>
+        <node id="{14a0dfc1-38c0-4544-b5d4-65bdbe60b622}" partId="{1aca42d2-f80a-4516-a8bf-0a066935d31c}" radius="0.0151557" x="0.514648" y="0.144772" z="1.01763"/>
+        <node id="{14a9c743-142c-43a6-8962-5dbf6514c38a}" partId="{700ce49d-5978-4ae1-847e-404fdc912625}" radius="0.00908169" x="0.481651" y="0.106262" z="0.991808"/>
+        <node id="{15283e25-d483-44c6-b530-113073ae54d0}" partId="{8f49f8aa-cb67-4955-9063-92e33042cb02}" radius="0.00829716" x="0.506086" y="0.343731" z="0.818635"/>
+        <node id="{15d886b0-181e-4e8d-84c4-21da599037c1}" partId="{c4ac9d40-ad41-4b17-8098-04fc2dec48a2}" radius="0.00684339" x="0.690864" y="0.148628" z="1.10365"/>
+        <node id="{164fc21c-131b-42a2-a47b-3b2d930222c6}" partId="{b78ff84d-5acd-4b46-a58b-564abba2c7e2}" radius="0.00625545" x="0.499048" y="0.16079" z="1.02006"/>
+        <node id="{172dd203-fbf9-4d7f-aafe-b751b7f943de}" partId="{78887fc7-dcfb-4d38-9eac-f8beaa99dce3}" radius="0.000446346" x="0.492055" y="0.304378" z="0.779797"/>
+        <node id="{173d8166-2d8d-4792-9187-d1f0dccb3713}" partId="{f0f8818f-5795-4520-b544-ca04abca2521}" radius="0.0172223" x="0.507138" y="0.138639" z="1.03023"/>
+        <node id="{17408e0e-5237-45ce-8f5c-de1034fcf23c}" partId="{13988a54-a274-49e0-aaf3-e5de769e18c1}" radius="0.00241779" x="0.639106" y="0.195709" z="1.06841"/>
+        <node id="{17722f68-bf1b-49d6-a22a-44a5fd7cd1f4}" partId="{1b950787-9a25-4f55-9d21-9d6d12eaff28}" radius="0" x="0.633481" y="0.217282" z="1.08241"/>
+        <node id="{18a7f970-0d2e-4d47-a307-32c94a9105a3}" partId="{50b2e680-31ba-4d62-9c93-10c51edea1bf}" radius="0.00147754" x="0.549438" y="0.337811" z="0.818152"/>
+        <node id="{1957320f-7dec-4069-a2b2-502d9a18442e}" partId="{b78ff84d-5acd-4b46-a58b-564abba2c7e2}" radius="0.0125109" x="0.497234" y="0.142519" z="1.01624"/>
+        <node id="{199423e1-60c0-4b3c-b65a-3ab127cadf99}" partId="{092b0f10-67c1-4032-9c49-168067836057}" radius="0.00211381" x="0.459929" y="0.0522857" z="0.985105"/>
+        <node id="{1ad678c9-b640-43d5-af1c-92ddfc540416}" partId="{9279a14a-691a-436c-ae9e-efd74fa28300}" radius="0.0138378" x="0.514346" y="0.194111" z="1.00654"/>
+        <node id="{1b515278-0117-48fe-a1fe-e772057573d9}" partId="{092b0f10-67c1-4032-9c49-168067836057}" radius="0.00127211" x="0.453427" y="-0.0558037" z="0.967476"/>
+        <node id="{1c85074d-db26-4962-9694-26df45d957c6}" partId="{092b0f10-67c1-4032-9c49-168067836057}" radius="0.00167325" x="0.465511" y="-0.00179739" z="0.96585"/>
+        <node id="{1d21ff2c-ba5f-4997-98db-a1ed63d01db3}" partId="{092b0f10-67c1-4032-9c49-168067836057}" radius="0.00246233" x="0.481651" y="0.106262" z="0.991808"/>
+        <node id="{1f0d5b25-4f21-4fd6-9142-0d56a594dd2c}" partId="{6986bf40-3089-4db5-bcc4-533d7ed960e3}" radius="0.00937295" x="0.520745" y="0.486083" z="0.929637"/>
+        <node id="{2015db8c-2d22-40d9-8605-073117da143a}" partId="{d8f9b36d-cec1-4026-a344-16edbbc0fc13}" radius="0.0190246" x="0.530833" y="0.31094" z="1.03841"/>
+        <node id="{21a051be-53a6-442c-8c87-e5572e6ff05e}" partId="{46304293-800c-4e01-8fc2-5135561ecc2d}" radius="0" x="0.523872" y="0.173925" z="0.975074"/>
+        <node id="{221a1797-ed67-4cfd-9cd8-34823e651ed3}" partId="{78887fc7-dcfb-4d38-9eac-f8beaa99dce3}" radius="0.000920665" x="0.506086" y="0.343731" z="0.818635"/>
+        <node id="{24b1db2c-8e14-4670-a523-bd31ab7758aa}" partId="{700ce49d-5978-4ae1-847e-404fdc912625}" radius="0" x="0.475115" y="0.0536713" z="1.00414"/>
+        <node id="{2501c90c-247d-42a1-b2fb-411d88b95e3a}" partId="{36c17734-cbeb-4637-822c-71f680aa5a49}" radius="0.0188602" x="0.578853" y="0.288523" z="0.760851"/>
+        <node id="{27430d2c-0651-4361-a581-d304fcd67e22}" partId="{709b8a08-78b0-4a8d-9978-27eb2eda8b93}" radius="0.0151221" x="0.574997" y="0.329256" z="0.826992"/>
+        <node id="{28381152-78fe-4c2d-8c3c-c776138efa17}" partId="{9538c8a9-1e82-4d5a-8e0e-b7a0d701c5f9}" radius="0.0113278" x="0.438589" y="-0.115943" z="0.942864"/>
+        <node id="{29686a15-7ddb-4717-a196-0412164025ef}" partId="{80845e66-2299-48ca-8cbf-77b55a536c0c}" radius="0.0055478" x="0.621696" y="0.233828" z="1.06758"/>
+        <node id="{2acf141a-f327-4469-bde3-ea54de99f8d6}" partId="{b78ff84d-5acd-4b46-a58b-564abba2c7e2}" radius="0" x="0.49542" y="0.124248" z="1.01241"/>
+        <node id="{2b2d6ee4-f105-491c-b098-4de0613fd37c}" partId="{c3e8e9c2-eb6f-4d7f-8f72-6d4cd3003c26}" radius="0.00652467" x="0.541733" y="0.286743" z="0.791092"/>
+        <node id="{2cc27239-bf74-49d5-b82d-0998c0103d6d}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" radius="0.0146973" x="0.517154" y="0.661798" z="1.02082"/>
+        <node id="{2ebd2648-14b0-4a21-b97b-7b34f021991b}" partId="{504953c2-aef4-4f37-be54-8f23c1f3f0fc}" radius="0.0112927" x="0.507195" y="0.333231" z="0.805634"/>
+        <node id="{308ce17b-2a9a-4e10-b3f6-aaed5190c957}" partId="{57dbdd98-cd36-4a18-a1b9-a22884c6b343}" radius="0.0116368" x="0.551163" y="0.337131" z="0.830778"/>
+        <node id="{31a4515c-5fd8-4e34-923e-750b726395f2}" partId="{d049e679-f4f6-412e-963c-1019667439e8}" radius="0.00985783" x="0.452406" y="0.249066" z="0.995575"/>
+        <node id="{32cc74f0-3f2c-450d-845d-9baabb852655}" partId="{9b4be491-12d5-4eea-8ee9-87dff887b292}" radius="0.0060103" x="0.520059" y="0.18953" z="1.0216"/>
+        <node id="{33cae706-74fd-423d-a240-a32c23657dcf}" partId="{6986bf40-3089-4db5-bcc4-533d7ed960e3}" radius="0.0187459" x="0.520931" y="0.493208" z="0.941731"/>
+        <node id="{3424cf20-48a1-4e64-be63-5890321cdbcd}" partId="{0564a8bf-85c6-4bd7-bad1-8cb70a2bacd9}" radius="0.00623232" x="0.505899" y="0.186592" z="1.01412"/>
+        <node id="{353010d5-28a2-4ce3-a465-12289cbadb21}" partId="{4c083326-6b05-4a2d-85ce-576dc7dd5c34}" radius="0.0152136" x="0.570093" y="0.29639" z="0.772941"/>
+        <node id="{3547bb94-25b4-4740-a5e9-15046267f0f9}" partId="{0564a8bf-85c6-4bd7-bad1-8cb70a2bacd9}" radius="0.0124646" x="0.508088" y="0.195657" z="1.01365"/>
+        <node id="{35bf1780-fe7c-46dd-a93e-99896e097cf2}" partId="{700ce49d-5978-4ae1-847e-404fdc912625}" radius="0.00908169" x="0.476749" y="0.066819" z="1.00105"/>
+        <node id="{36e6565b-5c7c-4203-9757-b7afa6731c57}" partId="{87fbd826-5677-48f5-83d3-8091d48ef8d7}" radius="0.0114691" x="0.605438" y="0.236659" z="1.071"/>
+        <node id="{379bec20-9be3-4a64-b259-d3ed4e84ebbc}" partId="{c4ac9d40-ad41-4b17-8098-04fc2dec48a2}" radius="0.00684339" x="0.675597" y="0.153363" z="1.08021"/>
+        <node id="{3932e31f-34f7-47da-8a0d-032bec47e53c}" partId="{6be248ef-32e3-43b0-b4bc-9e9cc8fae38e}" radius="0.00804375" x="0.568858" y="0.358377" z="0.853901"/>
+        <node id="{39e3219e-a74d-4dd0-bedd-eb4fa010f34a}" partId="{1aca42d2-f80a-4516-a8bf-0a066935d31c}" radius="0" x="0.530247" y="0.128753" z="1.01521"/>
+        <node id="{3b94ce3c-27ef-41af-87d1-4227ca2045f1}" partId="{b78ff84d-5acd-4b46-a58b-564abba2c7e2}" radius="0.00625545" x="0.496327" y="0.133384" z="1.01432"/>
+        <node id="{3cce2c34-9aab-46dc-bbd3-3a73327a8875}" partId="{da7592eb-3353-4084-bff2-f31d92be4236}" radius="0.005" x="0.440492" y="0.329685" z="0.713406"/>
+        <node id="{4029708e-b1f7-4f53-832e-d0983bfcd651}" partId="{1aaacb49-c100-4361-b227-422bc9c3a3b9}" radius="0.0167333" x="0.499882" y="0.295433" z="0.775861"/>
+        <node id="{404cdbf7-ef7b-4529-b04b-d775162d0edb}" partId="{1b950787-9a25-4f55-9d21-9d6d12eaff28}" radius="0.0147381" x="0.616253" y="0.227658" z="1.07447"/>
+        <node id="{408119ac-6fc0-40f5-b60c-99b7cc9517ae}" partId="{13988a54-a274-49e0-aaf3-e5de769e18c1}" radius="0.00288021" x="0.599025" y="0.238034" z="1.06653"/>
+        <node id="{40b1d9b4-f4ee-4c7d-8172-a9e0fc4d5654}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" radius="0.0111563" x="0.524322" y="0.493489" z="1.03635"/>
+        <node id="{427a3b1a-021e-4685-b78b-6080d8585450}" partId="{c3e8e9c2-eb6f-4d7f-8f72-6d4cd3003c26}" radius="0" x="0.534364" y="0.281462" z="0.794733"/>
+        <node id="{442d48bd-1797-45dc-8e4f-d121fb89237c}" partId="{0564a8bf-85c6-4bd7-bad1-8cb70a2bacd9}" radius="0.0124646" x="0.510277" y="0.204723" z="1.01318"/>
+        <node id="{44dfeb44-b697-4c87-b313-325d3826cc63}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" radius="0.00955646" x="0.52" y="0.437582" z="1.01435"/>
+        <node id="{44e13dd8-a3d2-4d4f-af81-372da15218d2}" partId="{62493532-0802-4e69-af81-89a1e382185d}" radius="0.00699227" x="0.755476" y="0.0488206" z="1.07007"/>
+        <node id="{4684632b-e51c-414e-aa21-df1ee91ea834}" partId="{2e4d7f86-270e-44c8-8e6c-27c9d1badd8d}" radius="0.0175657" x="0.484479" y="0.285846" z="0.796773"/>
+        <node id="{48417392-2b8f-49a5-a628-ab7fc4c944d4}" partId="{504953c2-aef4-4f37-be54-8f23c1f3f0fc}" radius="0.00564634" x="0.506086" y="0.343731" z="0.818635"/>
+        <node id="{491add8b-4be8-4171-b647-24334b050892}" partId="{8fa5ba18-7e7f-4713-bd40-6ac223f08d12}" radius="0.00547236" x="0.474945" y="0.0887811" z="0.976214"/>
+        <node id="{4b7f18aa-704e-4f55-9f69-16b0f38237ce}" partId="{9538c8a9-1e82-4d5a-8e0e-b7a0d701c5f9}" radius="0" x="0.428445" y="-0.135171" z="0.955714"/>
+        <node id="{4c81714b-6ac4-45d8-b4f0-c98539911521}" partId="{da7592eb-3353-4084-bff2-f31d92be4236}" radius="0.0159439" x="0.402189" y="0.341997" z="0.713406"/>
+        <node id="{4d0f2620-8a2a-496f-ad0a-4d8002493035}" partId="{9b4be491-12d5-4eea-8ee9-87dff887b292}" radius="0.0060103" x="0.512466" y="0.213789" z="1.01271"/>
+        <node id="{5064c6c5-783a-44e5-8e70-49c8c9cc2416}" partId="{534e034a-1fef-4d7d-82e4-12f7b8e82728}" radius="0.0107256" x="0.528141" y="0.30701" z="1.0341"/>
+        <node id="{511c7a39-b0e7-4502-8bd3-730ae05506f0}" partId="{f0f8818f-5795-4520-b544-ca04abca2521}" radius="0.00861113" x="0.511183" y="0.127563" z="1.03531"/>
+        <node id="{516a356a-f5a0-4c65-9f17-8d186eeccaa2}" partId="{f0f8818f-5795-4520-b544-ca04abca2521}" radius="0.0172223" x="0.503093" y="0.149714" z="1.02514"/>
+        <node id="{516d36d9-b1db-4de8-8503-7ea829120487}" partId="{57dbdd98-cd36-4a18-a1b9-a22884c6b343}" radius="0" x="0.537046" y="0.325127" z="0.849158"/>
+        <node id="{528a1707-5b77-4963-a34e-db9dba558205}" partId="{6986bf40-3089-4db5-bcc4-533d7ed960e3}" radius="0.0187459" x="0.521116" y="0.500333" z="0.953824"/>
+        <node id="{52cc908a-1fa5-415d-9d64-51bb469706d7}" partId="{13988a54-a274-49e0-aaf3-e5de769e18c1}" radius="0.00089087" x="0.755719" y="0.068247" z="1.0946"/>
+        <node id="{5399b1af-6473-4df5-96cc-13e6e28784c1}" partId="{3a4bc54a-f2cc-40d9-82c3-4c1acd434048}" radius="0.0125641" x="0.516931" y="0.31407" z="1.03225"/>
+        <node id="{53f27881-5a75-4c22-b2cf-7b2d05ee1d8e}" partId="{524194d6-bde6-4708-b189-16535335dc5a}" radius="0" x="0.505946" y="0.310252" z="1.07969"/>
+        <node id="{55340a9c-d66d-4d5d-a189-6d658d599e53}" partId="{deb52d1d-f439-4144-9284-6b990b239ae5}" radius="0" x="0.572779" y="0.393653" z="0.869869"/>
+        <node id="{55b5bb5d-d614-4cd3-b331-8819186ed572}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" radius="0.0127438" x="0.50217" y="0.607202" z="1.02431"/>
+        <node id="{567a286a-bf1d-4291-b979-ba69733646f5}" partId="{4c083326-6b05-4a2d-85ce-576dc7dd5c34}" radius="0.0152136" x="0.576346" y="0.290194" z="0.765713"/>
+        <node id="{567bcfd4-255f-478d-a9fe-362f2f832ff6}" partId="{80845e66-2299-48ca-8cbf-77b55a536c0c}" radius="0" x="0.629253" y="0.232427" z="1.06793"/>
+        <node id="{58321009-70bf-48ba-bbe7-f5afcd9e56f3}" partId="{57dbdd98-cd36-4a18-a1b9-a22884c6b343}" radius="0.00581841" x="0.541752" y="0.329128" z="0.843031"/>
+        <node id="{58bd7c83-b479-4e17-b4df-754316eef264}" partId="{092b0f10-67c1-4032-9c49-168067836057}" radius="0.000961544" x="0.44197" y="-0.109533" z="0.938581"/>
+        <node id="{593f1c87-b152-41e0-98b6-07acf061f646}" partId="{534e034a-1fef-4d7d-82e4-12f7b8e82728}" radius="0.00536282" x="0.531694" y="0.299966" z="1.03276"/>
+        <node id="{59fe931d-cbf2-47e6-b35e-0edcf8ad6830}" partId="{f0f8818f-5795-4520-b544-ca04abca2521}" radius="0.00861113" x="0.499048" y="0.16079" z="1.02006"/>
+        <node id="{5a7cf847-a78d-4877-9d4f-94cd9bb9eca8}" partId="{6be248ef-32e3-43b0-b4bc-9e9cc8fae38e}" radius="0" x="0.578445" y="0.351266" z="0.852222"/>
+        <node id="{5df7e38f-b9da-4c41-800c-56b5d25952b6}" partId="{1b950787-9a25-4f55-9d21-9d6d12eaff28}" radius="0.00736903" x="0.624867" y="0.22247" z="1.07844"/>
+        <node id="{5e465c5c-fdc5-4c81-95dc-4729f981df5c}" partId="{1cb0fafb-2cee-4fba-b0c6-ffbe586ba374}" radius="0.00660156" x="0.437669" y="0.226572" z="0.991136"/>
+        <node id="{5eb9bd01-2f33-4a6d-bb01-4a8a6cc7469c}" partId="{6be248ef-32e3-43b0-b4bc-9e9cc8fae38e}" radius="0.0160875" x="0.559272" y="0.365487" z="0.85558"/>
+        <node id="{61ba80ab-f761-4889-a07e-7b2b7ff91e5c}" partId="{36c17734-cbeb-4637-822c-71f680aa5a49}" radius="0.0094301" x="0.563839" y="0.302585" z="0.780169"/>
+        <node id="{6394e5cc-a367-4664-a9af-753d41b82ba6}" partId="{bb6e0337-94a1-4b8b-8894-9f40dc5577b5}" radius="0.0157834" x="0.775252" y="0.0559345" z="1.09142"/>
+        <node id="{644464d2-775c-42ec-8544-206fe7d11fe7}" partId="{3c4883ad-20db-4f7c-a728-e11bc72de231}" radius="0.00885373" x="0.521034" y="0.321097" z="1.03678"/>
+        <node id="{651c39df-7b14-4fd3-beb3-592efcb25842}" partId="{ae6741e2-ad53-4265-8b9b-310b65badd1e}" radius="0.0202136" x="0.471153" y="0.0252876" z="0.992578"/>
+        <node id="{66c32673-0a5b-4c93-8dd8-26ea2e206aa9}" partId="{5e45c98d-9283-4386-b0ae-e6a8f85f2dad}" radius="0.018684" x="0.508007" y="0.30584" z="1.01773"/>
+        <node id="{68be0242-2557-4881-b306-25936e0ac472}" partId="{c4c54ceb-2b1e-476c-8785-6fa69f041925}" radius="0.00374236" x="0.521034" y="0.321097" z="1.03678"/>
+        <node id="{6a16e994-9730-49a8-81f7-d9bcaf0d3614}" partId="{d8f9b36d-cec1-4026-a344-16edbbc0fc13}" radius="0" x="0.56023" y="0.280472" z="1.04329"/>
+        <node id="{6b2ab6a9-c11c-4c88-b4f9-b66df3f09e4f}" partId="{01f7a857-f594-42fc-8b5d-b3bdae4dacda}" radius="0.0117866" x="0.751855" y="0.0658246" z="1.10161"/>
+        <node id="{6b586d8c-e5a3-4405-b346-0d07c1fc587b}" partId="{499562a3-978a-46b8-82ac-ad5a45c3288b}" radius="0.0146164" x="0.561272" y="0.296321" z="0.771565"/>
+        <node id="{6c9d6544-ff34-4259-8d31-72393a4d7629}" partId="{a96bc03c-93f9-4cfd-abd4-e8d135fc8b49}" radius="0.0108231" x="0.498074" y="0.147199" z="1.01143"/>
+        <node id="{6cbb96e6-231d-4ac1-b9ec-75b258b16a1e}" partId="{3a4bc54a-f2cc-40d9-82c3-4c1acd434048}" radius="0" x="0.504622" y="0.292991" z="1.01866"/>
+        <node id="{6d108c14-4e3d-4273-8cee-084390309386}" partId="{499562a3-978a-46b8-82ac-ad5a45c3288b}" radius="0" x="0.55357" y="0.277529" z="0.745752"/>
+        <node id="{6d6619eb-70e2-48e4-b8a6-0ff52d14584b}" partId="{1aca42d2-f80a-4516-a8bf-0a066935d31c}" radius="0.00757784" x="0.499048" y="0.16079" z="1.02006"/>
+        <node id="{6dea3dfc-6305-4221-81f8-d59379db1f8c}" partId="{50b2e680-31ba-4d62-9c93-10c51edea1bf}" radius="0.00562501" x="0.521301" y="0.507458" z="0.965918"/>
+        <node id="{6e591cdf-09bd-478c-a604-ac7d19acf528}" partId="{1aaacb49-c100-4361-b227-422bc9c3a3b9}" radius="0.00836663" x="0.515537" y="0.277544" z="0.767988"/>
+        <node id="{6ef80ba2-4d3c-4a6e-a901-e5ddc913a272}" partId="{6be248ef-32e3-43b0-b4bc-9e9cc8fae38e}" radius="0.0160875" x="0.549685" y="0.372597" z="0.85726"/>
+        <node id="{6fd6b2c1-ab1f-4904-ac30-2f800bbfc95a}" partId="{50b2e680-31ba-4d62-9c93-10c51edea1bf}" radius="0.00439503" x="0.51987" y="0.465217" z="0.933138"/>
+        <node id="{7057282d-6ae5-4d7e-b10e-85ae69c7f72a}" partId="{62493532-0802-4e69-af81-89a1e382185d}" radius="0.00699227" x="0.755719" y="0.068247" z="1.0946"/>
+        <node id="{70da7060-9223-4ac9-b6ca-ea16eeb20d45}" partId="{ae6741e2-ad53-4265-8b9b-310b65badd1e}" radius="0.0101068" x="0.459929" y="0.0522857" z="0.985105"/>
+        <node id="{7153e3f6-ba74-4b9a-9a48-1f6b454b3678}" partId="{e47c18bd-1154-48f4-96d5-954787c54562}" radius="0.0168282" x="0.518851" y="0.256622" z="1.02709"/>
+        <node id="{71b98c98-8654-42d8-b58a-22688b722630}" partId="{c3e8e9c2-eb6f-4d7f-8f72-6d4cd3003c26}" radius="0.0130493" x="0.549102" y="0.292024" z="0.787451"/>
+        <node id="{7285fcb8-4779-4e60-a474-4641c0943463}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" radius="0.016105" x="0.533222" y="0.721447" z="1.02103"/>
+        <node id="{7293a322-fbad-4c7b-a059-606020ff09bf}" partId="{504953c2-aef4-4f37-be54-8f23c1f3f0fc}" radius="0.00564634" x="0.507749" y="0.327981" z="0.799133"/>
+        <node id="{734ab0d5-d4d8-485a-b521-ebd36a3a8720}" partId="{9279a14a-691a-436c-ae9e-efd74fa28300}" radius="0" x="0.516227" y="0.174434" z="1.00037"/>
+        <node id="{7351a5f6-983d-4fdf-83c9-be734363f2ca}" partId="{deb52d1d-f439-4144-9284-6b990b239ae5}" radius="0.0173385" x="0.544025" y="0.414478" z="0.884335"/>
+        <node id="{73951d38-c2aa-4577-927b-7e9429d1f0db}" partId="{1cb0fafb-2cee-4fba-b0c6-ffbe586ba374}" radius="0.0132031" x="0.442581" y="0.23407" z="0.992616"/>
+        <node id="{73b1a616-30a5-44a9-a246-76ff142d228b}" partId="{9b4be491-12d5-4eea-8ee9-87dff887b292}" radius="0" x="0.52259" y="0.181444" z="1.02456"/>
+        <node id="{743d083e-3e96-4eb7-9c5f-0f0cee310915}" partId="{1cb0fafb-2cee-4fba-b0c6-ffbe586ba374}" radius="0.0132031" x="0.447494" y="0.241568" z="0.994095"/>
+        <node id="{74620eab-e43b-44e3-be3a-68f3838cda88}" partId="{524194d6-bde6-4708-b189-16535335dc5a}" radius="0.0166743" x="0.51349" y="0.315674" z="1.05824"/>
+        <node id="{751fee8a-4d20-44bf-b68f-24b908abf032}" partId="{13988a54-a274-49e0-aaf3-e5de769e18c1}" radius="0.00140585" x="0.710183" y="0.110714" z="1.07757"/>
+        <node id="{75239010-9a3d-434c-a036-a8a59a0fe3d6}" partId="{3a4bc54a-f2cc-40d9-82c3-4c1acd434048}" radius="0.0125641" x="0.512828" y="0.307044" z="1.02772"/>
+        <node id="{75d10124-3ee1-47f1-8e95-b397c0f35fe9}" partId="{c3e8e9c2-eb6f-4d7f-8f72-6d4cd3003c26}" radius="0.00652467" x="0.563839" y="0.302585" z="0.780169"/>
+        <node id="{76a160cd-60d5-4010-bd9a-6032c97f67b8}" partId="{bb6e0337-94a1-4b8b-8894-9f40dc5577b5}" radius="0.00789172" x="0.755719" y="0.068247" z="1.0946"/>
+        <node id="{78b55011-5b1b-4c44-9240-71968c7ad7f8}" partId="{c4ac9d40-ad41-4b17-8098-04fc2dec48a2}" radius="0" x="0.695953" y="0.147049" z="1.11147"/>
+        <node id="{78daab6a-4bd3-44b5-b9a8-785d8e08bb78}" partId="{9279a14a-691a-436c-ae9e-efd74fa28300}" radius="0.0069189" x="0.515287" y="0.184273" z="1.00346"/>
+        <node id="{796b1ebe-9414-4ec1-b58b-f3cdf6006d6e}" partId="{2e4d7f86-270e-44c8-8e6c-27c9d1badd8d}" radius="0.0175657" x="0.488267" y="0.295112" z="0.788285"/>
+        <node id="{7a7cf872-03e0-4655-92e7-0af10466cc83}" partId="{da7592eb-3353-4084-bff2-f31d92be4236}" radius="0.005" x="0.473324" y="0.317373" z="0.713406"/>
+        <node id="{7b04a282-03d9-4a06-bec2-b48417956ce9}" partId="{acdc210c-e671-486e-9611-b9244c016807}" radius="0.0124613" x="0.49815" y="0.536441" z="1.01508"/>
+        <node id="{7b4bad9a-3192-479a-bc39-3d486444fe72}" partId="{acdc210c-e671-486e-9611-b9244c016807}" radius="0.0124613" x="0.50195" y="0.541687" z="1.00836"/>
+        <node id="{7c5da7e3-9eab-47f1-9736-c53bcf1e8efa}" partId="{01f7a857-f594-42fc-8b5d-b3bdae4dacda}" radius="0.00589328" x="0.744128" y="0.0609797" z="1.11563"/>
+        <node id="{7dfc521a-3f80-4e32-93c9-85fe7b84dd93}" partId="{ae6741e2-ad53-4265-8b9b-310b65badd1e}" radius="0" x="0.482376" y="-0.00171058" z="1.00005"/>
+        <node id="{7e3c29a3-b4f3-466d-a888-a05b5e1704e6}" partId="{524194d6-bde6-4708-b189-16535335dc5a}" radius="0.00833715" x="0.521034" y="0.321097" z="1.03678"/>
+        <node id="{7e6244ae-8921-4012-9dfd-badac7408adb}" partId="{50b2e680-31ba-4d62-9c93-10c51edea1bf}" radius="0.0033768" x="0.53444" y="0.421419" z="0.889157"/>
+        <node id="{7e852b72-9d70-4dfd-9bfc-f857d3dbbb16}" partId="{acdc210c-e671-486e-9611-b9244c016807}" radius="0.00623065" x="0.50575" y="0.546933" z="1.00164"/>
+        <node id="{7f3333db-755a-4a86-a2d7-2126da8f6a49}" partId="{d049e679-f4f6-412e-963c-1019667439e8}" radius="0" x="0.47453" y="0.202963" z="0.972421"/>
+        <node id="{80e3c868-985f-4c6d-a57d-34e359987138}" partId="{f1b78adc-6fdc-4414-bab8-8e98890a21ca}" radius="0.00665101" x="0.452406" y="0.249066" z="0.995575"/>
+        <node id="{80faa256-324d-4c76-b4e6-491956155230}" partId="{8fa5ba18-7e7f-4713-bd40-6ac223f08d12}" radius="0.0109447" x="0.479416" y="0.100435" z="0.98661"/>
+        <node id="{818b69e5-7a8b-41dd-970a-90348c5b766c}" partId="{deb52d1d-f439-4144-9284-6b990b239ae5}" radius="0.00866923" x="0.563195" y="0.400594" z="0.874691"/>
+        <node id="{833ad6bd-3219-4093-9689-2f7cbe8ac8fc}" partId="{5e45c98d-9283-4386-b0ae-e6a8f85f2dad}" radius="0.00934199" x="0.521034" y="0.321097" z="1.03678"/>
+        <node id="{8471ffad-53be-4a68-ab72-97d32d7308fc}" partId="{9279a14a-691a-436c-ae9e-efd74fa28300}" radius="0.0138378" x="0.513406" y="0.20395" z="1.00963"/>
+        <node id="{84db1f93-1858-4a96-be7f-7a383a1430df}" partId="{deb52d1d-f439-4144-9284-6b990b239ae5}" radius="0.0173385" x="0.55361" y="0.407536" z="0.879513"/>
+        <node id="{84e6a0cf-c4e1-478c-8fed-a5cc25d9be5f}" partId="{87fbd826-5677-48f5-83d3-8091d48ef8d7}" radius="0.00573453" x="0.618263" y="0.233908" z="1.07994"/>
+        <node id="{8540d159-7f70-44d7-86d2-471873be9bdb}" partId="{092b0f10-67c1-4032-9c49-168067836057}" radius="0.00407143" x="0.521034" y="0.321097" z="1.03678"/>
+        <node id="{85cd375b-8df3-4653-855e-2a7bb3f623fe}" partId="{709b8a08-78b0-4a8d-9978-27eb2eda8b93}" radius="0.00756106" x="0.555869" y="0.341132" z="0.824651"/>
+        <node id="{85fceff6-5c5b-4882-9f92-e45d6c5613fe}" partId="{534e034a-1fef-4d7d-82e4-12f7b8e82728}" radius="0" x="0.535248" y="0.292922" z="1.03142"/>
+        <node id="{8626c044-fef3-47d2-a38f-944010bdef05}" partId="{57dbdd98-cd36-4a18-a1b9-a22884c6b343}" radius="0.00581841" x="0.555869" y="0.341132" z="0.824651"/>
+        <node id="{869cd102-81cd-4c15-b377-955b61d44d30}" partId="{8f49f8aa-cb67-4955-9063-92e33042cb02}" radius="0.0165943" x="0.513778" y="0.335641" z="0.823884"/>
+        <node id="{86a40600-8eac-4094-81a0-a1d698c94d2d}" partId="{4c083326-6b05-4a2d-85ce-576dc7dd5c34}" radius="0.00760679" x="0.563839" y="0.302585" z="0.780169"/>
+        <node id="{86e86e5e-2ee3-46e3-ae87-6f88b27d3855}" partId="{9279a14a-691a-436c-ae9e-efd74fa28300}" radius="0.0069189" x="0.512466" y="0.213789" z="1.01271"/>
+        <node id="{878d0098-c6f5-4a98-8e1e-d469396b6b4d}" partId="{80845e66-2299-48ca-8cbf-77b55a536c0c}" radius="0.0110956" x="0.606582" y="0.236632" z="1.06688"/>
+        <node id="{881104c8-1859-4bd6-8bc1-fe2f5e807e98}" partId="{acdc210c-e671-486e-9611-b9244c016807}" radius="0.00623065" x="0.494351" y="0.531195" z="1.0218"/>
+        <node id="{8b37e76a-099c-4b5d-af5c-26c1fe4f55ab}" partId="{b5812967-d429-4214-a11c-f04918089461}" radius="0" x="0.76559" y="0.0526443" z="1.13977"/>
+        <node id="{8ba09bc4-ac19-42ad-8b41-31683e1dc872}" partId="{5e45c98d-9283-4386-b0ae-e6a8f85f2dad}" radius="0" x="0.494981" y="0.290583" z="0.998667"/>
+        <node id="{8dc941af-cffe-4f7b-aa0a-b0db5a0e5e1d}" partId="{da7592eb-3353-4084-bff2-f31d92be4236}" radius="0.005" x="0.314637" y="0.336525" z="0.713406"/>
+        <node id="{8e43cbd3-2aa9-4265-95b8-92056c4c4737}" partId="{534e034a-1fef-4d7d-82e4-12f7b8e82728}" radius="0.00536282" x="0.521034" y="0.321097" z="1.03678"/>
+        <node id="{8f367bd2-114c-4d04-96c5-bbb53a16d8ba}" partId="{9b4be491-12d5-4eea-8ee9-87dff887b292}" radius="0.0120206" x="0.514997" y="0.205702" z="1.01567"/>
+        <node id="{90999c8b-a2c9-459f-847e-0fde4493fbff}" partId="{1aca42d2-f80a-4516-a8bf-0a066935d31c}" radius="0.00757784" x="0.522448" y="0.136762" z="1.01642"/>
+        <node id="{927f0b23-db5a-49e7-8d0f-bcc811f7752e}" partId="{709b8a08-78b0-4a8d-9978-27eb2eda8b93}" radius="0.0151221" x="0.565433" y="0.335194" z="0.825821"/>
+        <node id="{9362b987-f419-4f31-bfaf-9539700ad242}" partId="{e47c18bd-1154-48f4-96d5-954787c54562}" radius="0.0168282" x="0.519508" y="0.244335" z="1.0243"/>
+        <node id="{94362d37-639a-40ff-b191-5c0a6e19f664}" partId="{d049e679-f4f6-412e-963c-1019667439e8}" radius="0.0197157" x="0.457937" y="0.23754" z="0.989787"/>
+        <node id="{9530cb12-6d41-4bd3-8175-1ba24943e21b}" partId="{52d54b31-5e73-444b-8bae-2ebc51ff209e}" radius="0.000272999" x="0.569785" y="0.264018" z="0.742748"/>
+        <node id="{95ad6172-babb-45c4-a96d-4d734ba6a25e}" partId="{46304293-800c-4e01-8fc2-5135561ecc2d}" radius="0.00943412" x="0.52102" y="0.183891" z="0.984483"/>
+        <node id="{973af58c-b3f5-4346-b614-413eb42ca621}" partId="{1b950787-9a25-4f55-9d21-9d6d12eaff28}" radius="0.00736903" x="0.599025" y="0.238034" z="1.06653"/>
+        <node id="{979a9d6c-f734-4f25-a0fc-04310bd4646b}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" radius="0.00903996" x="0.513921" y="0.377636" z="1.03506"/>
+        <node id="{9a7851b9-a7e8-4666-a13e-5cb7a8cc09c4}" partId="{36c17734-cbeb-4637-822c-71f680aa5a49}" radius="0.0188602" x="0.571346" y="0.295554" z="0.77051"/>
+        <node id="{9bf0c1e8-8582-442c-90a4-5037d7219b21}" partId="{52d54b31-5e73-444b-8bae-2ebc51ff209e}" radius="0.000953281" x="0.555869" y="0.341132" z="0.824651"/>
+        <node id="{9c766968-443b-4e52-88ce-f1f20d377b5c}" partId="{1aaacb49-c100-4361-b227-422bc9c3a3b9}" radius="0.00836663" x="0.492055" y="0.304378" z="0.779797"/>
+        <node id="{9c857bb2-10b3-45e0-8271-3272e88a8bd7}" partId="{acdc210c-e671-486e-9611-b9244c016807}" radius="0" x="0.490551" y="0.525949" z="1.02853"/>
+        <node id="{9d65e303-67cf-4bbb-ab6a-09120b410c7b}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" radius="0.0194515" x="0.519038" y="0.887627" z="1.02668"/>
+        <node id="{9db4d842-ce14-4854-a532-d10650139dfc}" partId="{b5812967-d429-4214-a11c-f04918089461}" radius="0.0170931" x="0.758187" y="0.0643464" z="1.10589"/>
+        <node id="{9e8b06ca-12a6-4927-bd46-4d3f479230ae}" partId="{46304293-800c-4e01-8fc2-5135561ecc2d}" radius="0.00943412" x="0.512466" y="0.213789" z="1.01271"/>
+        <node id="{a08ef2a3-d98f-44ab-9765-c725baf366dc}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" radius="0.0182872" x="0.515107" y="0.833052" z="1.01116"/>
+        <node id="{a0a9a94a-672a-45e8-a0bb-31be9300b41f}" partId="{13988a54-a274-49e0-aaf3-e5de769e18c1}" radius="0.00391173" x="0.521034" y="0.321097" z="1.03678"/>
+        <node id="{a1101b66-19df-47af-9d58-822ff9eb26b9}" partId="{b5812967-d429-4214-a11c-f04918089461}" radius="0.0170931" x="0.760655" y="0.0604457" z="1.11718"/>
+        <node id="{a242b2bf-afe5-4672-aa61-e97e99e68a4c}" partId="{13988a54-a274-49e0-aaf3-e5de769e18c1}" radius="0.00193612" x="0.675597" y="0.153363" z="1.08021"/>
+        <node id="{a370ab3d-5136-42d7-9aa9-ac3bed89d137}" partId="{e47c18bd-1154-48f4-96d5-954787c54562}" radius="0.00841411" x="0.520166" y="0.232048" z="1.02152"/>
+        <node id="{a3e0771b-c680-4c0c-8fcf-acd03fab6785}" partId="{c4c54ceb-2b1e-476c-8785-6fa69f041925}" radius="0.00268242" x="0.452406" y="0.249066" z="0.995575"/>
+        <node id="{a3e169ff-fc5f-4dcd-b7c5-0a14fa29b73e}" partId="{499562a3-978a-46b8-82ac-ad5a45c3288b}" radius="0.00730822" x="0.556137" y="0.283793" z="0.754356"/>
+        <node id="{a6209995-831e-4084-afeb-32704ca086bf}" partId="{1716cb6d-01ed-4522-9ea3-7470418c6b51}" radius="0.0141029" x="0.726014" y="0.097259" z="1.08104"/>
+        <node id="{a7137baa-7fe5-4d1c-b9f2-11b8bf6be38a}" partId="{b5812967-d429-4214-a11c-f04918089461}" radius="0.00854656" x="0.755719" y="0.068247" z="1.0946"/>
+        <node id="{a88191b2-a7cd-4b7a-be30-d5d97c3a0b48}" partId="{524194d6-bde6-4708-b189-16535335dc5a}" radius="0.0166743" x="0.517262" y="0.318385" z="1.04751"/>
+        <node id="{a9746f2b-b2ba-40a7-a405-d34b982c683f}" partId="{50b2e680-31ba-4d62-9c93-10c51edea1bf}" radius="0.0024147" x="0.540098" y="0.379707" z="0.858939"/>
+        <node id="{aa1e35db-d9de-48a1-9b6a-e18a54ac4435}" partId="{f1b78adc-6fdc-4414-bab8-8e98890a21ca}" radius="0.013302" x="0.44725" y="0.241616" z="0.99539"/>
+        <node id="{aac479ee-6f32-4c7a-b2e6-5e2c1df8c251}" partId="{50b2e680-31ba-4d62-9c93-10c51edea1bf}" radius="0.00682936" x="0.50575" y="0.546933" z="1.00164"/>
+        <node id="{adbd9948-2566-46d3-8603-0d4ecf4c9fa4}" partId="{2e4d7f86-270e-44c8-8e6c-27c9d1badd8d}" radius="0.00878287" x="0.492055" y="0.304378" z="0.779797"/>
+        <node id="{adda25df-58c1-4e63-ba09-c05ec91ac643}" partId="{c4c54ceb-2b1e-476c-8785-6fa69f041925}" radius="0.00123233" x="0.385379" y="0.176643" z="0.939178"/>
+        <node id="{aefc096e-5901-425f-a831-6a0ddbd50399}" partId="{bb6e0337-94a1-4b8b-8894-9f40dc5577b5}" radius="0.0157834" x="0.765485" y="0.0620907" z="1.09301"/>
+        <node id="{b1a5e801-c4b0-4478-aad0-41c40133502e}" partId="{a96bc03c-93f9-4cfd-abd4-e8d135fc8b49}" radius="0" x="0.497099" y="0.133608" z="1.0028"/>
+        <node id="{b1d0b918-225b-4399-a8d8-e90b84b5f5be}" partId="{534e034a-1fef-4d7d-82e4-12f7b8e82728}" radius="0.0107256" x="0.524587" y="0.314053" z="1.03544"/>
+        <node id="{b256069f-8463-4f7d-b6e0-30af0bbf2898}" partId="{c4ac9d40-ad41-4b17-8098-04fc2dec48a2}" radius="0.0136868" x="0.685775" y="0.150206" z="1.09584"/>
+        <node id="{b31ca9d5-5b56-4c42-bebf-4d2d6aef739f}" partId="{78887fc7-dcfb-4d38-9eac-f8beaa99dce3}" radius="0.00136076" x="0.524949" y="0.382805" z="0.856618"/>
+        <node id="{b4b3a668-fd69-4887-ba98-abe5dae57101}" partId="{deb52d1d-f439-4144-9284-6b990b239ae5}" radius="0.00866923" x="0.53444" y="0.421419" z="0.889157"/>
+        <node id="{b71171d7-1d32-46f7-8fca-fcc3a7a5a46e}" partId="{ae6741e2-ad53-4265-8b9b-310b65badd1e}" radius="0.0101068" x="0.476764" y="0.0117885" z="0.996314"/>
+        <node id="{ba04e35f-5b85-46bf-84f6-f4b253125471}" partId="{4c083326-6b05-4a2d-85ce-576dc7dd5c34}" radius="0" x="0.588853" y="0.277802" z="0.751257"/>
+        <node id="{ba05b4f6-6652-449b-ad37-d4b09bda988b}" partId="{c4ac9d40-ad41-4b17-8098-04fc2dec48a2}" radius="0.0136868" x="0.680686" y="0.151785" z="1.08803"/>
+        <node id="{ba2664a7-be02-420f-b744-931e66efefe0}" partId="{1b950787-9a25-4f55-9d21-9d6d12eaff28}" radius="0.0147381" x="0.607639" y="0.232846" z="1.0705"/>
+        <node id="{baa52d8a-ed0e-4138-bc8b-6a72054cfe95}" partId="{499562a3-978a-46b8-82ac-ad5a45c3288b}" radius="0.0146164" x="0.558704" y="0.290057" z="0.76296"/>
+        <node id="{bbab93bd-50a6-47f4-b608-00091b262e97}" partId="{46304293-800c-4e01-8fc2-5135561ecc2d}" radius="0.0188682" x="0.515317" y="0.203823" z="1.0033"/>
+        <node id="{bbdd82a9-286b-4c1c-b007-745c306e4f14}" partId="{709b8a08-78b0-4a8d-9978-27eb2eda8b93}" radius="0" x="0.594126" y="0.31738" z="0.829333"/>
+        <node id="{bd244a0f-1d5e-4307-85b7-f764e6c1304b}" partId="{4c083326-6b05-4a2d-85ce-576dc7dd5c34}" radius="0.00760679" x="0.5826" y="0.283998" z="0.758485"/>
+        <node id="{c1052900-009d-4ab3-9734-684f91bdab25}" partId="{01f7a857-f594-42fc-8b5d-b3bdae4dacda}" radius="0.00589328" x="0.755719" y="0.068247" z="1.0946"/>
+        <node id="{c1a57de4-5129-46f3-ace2-c662a6c079b8}" partId="{709b8a08-78b0-4a8d-9978-27eb2eda8b93}" radius="0.00756106" x="0.584562" y="0.323318" z="0.828163"/>
+        <node id="{c319f392-3b4d-4f01-a0f8-50ef45168844}" partId="{2e4d7f86-270e-44c8-8e6c-27c9d1badd8d}" radius="0" x="0.476903" y="0.267313" z="0.813748"/>
+        <node id="{c42a3e99-b6aa-4c26-8579-44228dd34b4b}" partId="{389a356e-22e6-4172-8c0d-1b835462d7b5}" radius="0.00680655" x="0.466423" y="0.0276555" z="1.00169"/>
+        <node id="{c5cfd17f-ec0b-433b-b36b-f126b540b6a6}" partId="{092b0f10-67c1-4032-9c49-168067836057}" radius="0.00304648" x="0.512466" y="0.213789" z="1.01271"/>
+        <node id="{c62e9181-4388-4e00-a10a-8a61eb93c4ae}" partId="{80845e66-2299-48ca-8cbf-77b55a536c0c}" radius="0.0055478" x="0.599025" y="0.238034" z="1.06653"/>
+        <node id="{c78986e6-a263-42cf-b5f1-8b9fdc6f74a8}" partId="{57dbdd98-cd36-4a18-a1b9-a22884c6b343}" radius="0.0116368" x="0.546458" y="0.33313" z="0.836904"/>
+        <node id="{c7bd203d-7b04-47a9-a394-d7d1f18555c4}" partId="{8fa5ba18-7e7f-4713-bd40-6ac223f08d12}" radius="0.0109447" x="0.47718" y="0.0946081" z="0.981412"/>
+        <node id="{c8d861a6-491b-42d4-8e07-73e5df7c019b}" partId="{c4c54ceb-2b1e-476c-8785-6fa69f041925}" radius="0.00318423" x="0.486602" y="0.285251" z="1.0181"/>
+        <node id="{c9174f26-59b1-4382-8214-bc4a91f1759e}" partId="{d8f9b36d-cec1-4026-a344-16edbbc0fc13}" radius="0.00951228" x="0.550431" y="0.290628" z="1.04166"/>
+        <node id="{ccd8ef94-281b-4dfb-ab29-b50dfe17a770}" partId="{389a356e-22e6-4172-8c0d-1b835462d7b5}" radius="0.0136131" x="0.464259" y="0.0358656" z="0.996163"/>
+        <node id="{ce3ca970-0d64-4ee1-92ef-8720f608f05f}" partId="{9538c8a9-1e82-4d5a-8e0e-b7a0d701c5f9}" radius="0.0056639" x="0.431826" y="-0.128762" z="0.951431"/>
+        <node id="{ce8a93e4-e574-4e93-82b1-fbd2ca77ef0f}" partId="{e47c18bd-1154-48f4-96d5-954787c54562}" radius="0" x="0.520823" y="0.219761" z="1.01874"/>
+        <node id="{cea888e7-491c-40e5-be50-e60137d4c8a4}" partId="{8fa5ba18-7e7f-4713-bd40-6ac223f08d12}" radius="0.00547236" x="0.481651" y="0.106262" z="0.991808"/>
+        <node id="{cede8a6a-4e51-4c07-8581-0999b4705616}" partId="{3c4883ad-20db-4f7c-a728-e11bc72de231}" radius="0.0177075" x="0.513452" y="0.310782" z="1.03548"/>
+        <node id="{cf6b2e2b-89ef-442c-87ca-74d86de7afdc}" partId="{13988a54-a274-49e0-aaf3-e5de769e18c1}" radius="0.00349248" x="0.572339" y="0.280627" z="1.0527"/>
+        <node id="{cf75b27e-3656-4130-8543-d07cbc98b9c9}" partId="{da7592eb-3353-4084-bff2-f31d92be4236}" radius="0.005" x="0.377565" y="0.340629" z="0.713406"/>
+        <node id="{d043181f-393b-4e20-8ad5-bc2c04e61bfd}" partId="{2e4d7f86-270e-44c8-8e6c-27c9d1badd8d}" radius="0.00878287" x="0.480691" y="0.27658" z="0.80526"/>
+        <node id="{d1325b2e-e338-4239-9988-1d1dc6c44a6d}" partId="{87fbd826-5677-48f5-83d3-8091d48ef8d7}" radius="0.00573453" x="0.599025" y="0.238034" z="1.06653"/>
+        <node id="{d2de90d6-ac0c-4bdd-b5e3-573960fad70c}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" radius="0.00622413" x="0.53858" y="0.264806" z="1.03477"/>
+        <node id="{d2f4e68c-bc10-46d3-b82c-aadf00fa23e2}" partId="{499562a3-978a-46b8-82ac-ad5a45c3288b}" radius="0.00730822" x="0.563839" y="0.302585" z="0.780169"/>
+        <node id="{d36ed08a-2202-41de-9601-76d275344502}" partId="{1aaacb49-c100-4361-b227-422bc9c3a3b9}" radius="0.0167333" x="0.507709" y="0.286489" z="0.771924"/>
+        <node id="{d5be35fe-16ec-40bd-b41b-d92171f18a01}" partId="{0564a8bf-85c6-4bd7-bad1-8cb70a2bacd9}" radius="0" x="0.50371" y="0.177526" z="1.0146"/>
+        <node id="{d69b0b89-1efb-4918-baf5-d0cc0d5b972c}" partId="{389a356e-22e6-4172-8c0d-1b835462d7b5}" radius="0.00680655" x="0.459929" y="0.0522857" z="0.985105"/>
+        <node id="{d7bf67d3-f4df-45b3-8a40-2dabc5e41d32}" partId="{1aaacb49-c100-4361-b227-422bc9c3a3b9}" radius="0" x="0.523364" y="0.268599" z="0.764051"/>
+        <node id="{d866de28-dae4-40ce-b547-81e4cf5c1bfc}" partId="{01f7a857-f594-42fc-8b5d-b3bdae4dacda}" radius="0" x="0.740264" y="0.0585572" z="1.12263"/>
+        <node id="{da2809c9-3b46-4621-a9da-abfa3839f9f5}" partId="{62493532-0802-4e69-af81-89a1e382185d}" radius="0" x="0.755395" y="0.0423452" z="1.0619"/>
+        <node id="{daa6e549-8d8c-4219-b312-84b523aa4f51}" partId="{1cb0fafb-2cee-4fba-b0c6-ffbe586ba374}" radius="0.00660156" x="0.452406" y="0.249066" z="0.995575"/>
+        <node id="{dc0aaf45-eb00-49b6-8e81-fa979245ac09}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" radius="0.0124874" x="0.50575" y="0.546933" z="1.00164"/>
+        <node id="{dedcce23-b5ab-4e30-a62a-29155b8d5e2a}" partId="{9538c8a9-1e82-4d5a-8e0e-b7a0d701c5f9}" radius="0.0056639" x="0.44197" y="-0.109533" z="0.938581"/>
+        <node id="{df693fdf-c112-4501-afcc-243afa0c4611}" partId="{5e45c98d-9283-4386-b0ae-e6a8f85f2dad}" radius="0.00934199" x="0.501494" y="0.298212" z="1.0082"/>
+        <node id="{dfd92d67-a666-4f9e-a606-217795b284cc}" partId="{092b0f10-67c1-4032-9c49-168067836057}" radius="0.00284921" x="0.499048" y="0.16079" z="1.02006"/>
+        <node id="{e04cf7e6-1351-49fc-acd7-67ea3641d678}" partId="{d049e679-f4f6-412e-963c-1019667439e8}" radius="0.00985783" x="0.468999" y="0.214489" z="0.97821"/>
+        <node id="{e08afd53-006d-4434-9905-0ef150d16cd9}" partId="{a96bc03c-93f9-4cfd-abd4-e8d135fc8b49}" radius="0.00541154" x="0.499048" y="0.16079" z="1.02006"/>
+        <node id="{e2bae992-d1d2-4fdd-9a30-dba9c62f5322}" partId="{3c4883ad-20db-4f7c-a728-e11bc72de231}" radius="0.00885373" x="0.49829" y="0.290152" z="1.03287"/>
+        <node id="{e2f0521a-2b2d-4c9b-b806-d6f4c2d078f4}" partId="{46304293-800c-4e01-8fc2-5135561ecc2d}" radius="0.0188682" x="0.518169" y="0.193857" z="0.993893"/>
+        <node id="{e3592e6e-2c54-4f3c-8745-e35f79c472d2}" partId="{78887fc7-dcfb-4d38-9eac-f8beaa99dce3}" radius="0.00174188" x="0.53444" y="0.421419" z="0.889157"/>
+        <node id="{e3a311f1-ab14-4e80-80dc-9f882721d9a8}" partId="{c4c54ceb-2b1e-476c-8785-6fa69f041925}" radius="0.00196966" x="0.419713" y="0.213334" z="0.965049"/>
+        <node id="{e5a7a6e8-c4de-4ea6-a175-93b87b709bee}" partId="{a96bc03c-93f9-4cfd-abd4-e8d135fc8b49}" radius="0.0108231" x="0.498561" y="0.153995" z="1.01574"/>
+        <node id="{e5afd1fe-e4a7-4e2a-90cf-1cb2a55fe07e}" partId="{8f49f8aa-cb67-4955-9063-92e33042cb02}" radius="0" x="0.536854" y="0.311372" z="0.83963"/>
+        <node id="{e5cbc93e-98eb-45b3-9046-1d60f009b382}" partId="{524194d6-bde6-4708-b189-16535335dc5a}" radius="0.00833715" x="0.509718" y="0.312963" z="1.06896"/>
+        <node id="{e785bb5a-3352-4545-a008-17d16d82c906}" partId="{c3e8e9c2-eb6f-4d7f-8f72-6d4cd3003c26}" radius="0.0130493" x="0.55647" y="0.297305" z="0.78381"/>
+        <node id="{e79795d5-e758-4acb-8559-7f1033c9b02f}" partId="{da7592eb-3353-4084-bff2-f31d92be4236}" radius="0.005" x="0.343365" y="0.340629" z="0.713406"/>
+        <node id="{e7bc4edf-781b-4916-8abe-a304cda6ae75}" partId="{62493532-0802-4e69-af81-89a1e382185d}" radius="0.0139845" x="0.755557" y="0.0552961" z="1.07825"/>
+        <node id="{e90118b2-e7ef-4ebc-ba06-784613255d46}" partId="{5e45c98d-9283-4386-b0ae-e6a8f85f2dad}" radius="0.018684" x="0.51452" y="0.313468" z="1.02725"/>
+        <node id="{e94df7f8-d0ca-478e-aed1-25fa8d60b9fd}" partId="{b78ff84d-5acd-4b46-a58b-564abba2c7e2}" radius="0.0125109" x="0.498141" y="0.151655" z="1.01815"/>
+        <node id="{eb4fb92f-f8ea-49ef-b132-ae6b72fa6ea4}" partId="{ae6741e2-ad53-4265-8b9b-310b65badd1e}" radius="0.0202136" x="0.465541" y="0.0387866" z="0.988842"/>
+        <node id="{eb6898b8-464b-4d10-9c56-9479d47438af}" partId="{8fa5ba18-7e7f-4713-bd40-6ac223f08d12}" radius="0" x="0.47271" y="0.0829541" z="0.971016"/>
+        <node id="{ebe51975-e81f-45a6-aa7d-ca216cc56c8b}" partId="{5b7db920-6126-4e3a-a16d-2fa6c227a696}" radius="0.0163502" x="0.499188" y="0.266314" z="1.01076"/>
+        <node id="{ebe6c9ed-8cd5-4d44-acda-3846acf13ec1}" partId="{5b7db920-6126-4e3a-a16d-2fa6c227a696}" radius="0.00817509" x="0.486602" y="0.285251" z="1.0181"/>
+        <node id="{edb9977c-0dd1-4472-8534-dbeb127c9d16}" partId="{1716cb6d-01ed-4522-9ea3-7470418c6b51}" radius="0.00705143" x="0.710183" y="0.110714" z="1.07757"/>
+        <node id="{eddf44c5-0c61-446b-a724-4456c024978a}" partId="{1cb0fafb-2cee-4fba-b0c6-ffbe586ba374}" radius="0" x="0.432757" y="0.219074" z="0.989657"/>
+        <node id="{ee43d10c-d4f1-4315-a3c2-618c2ce40d6a}" partId="{6986bf40-3089-4db5-bcc4-533d7ed960e3}" radius="0" x="0.52056" y="0.478958" z="0.917544"/>
+        <node id="{f06b2588-283a-4bcc-a9e5-00f5cb6c9c57}" partId="{700ce49d-5978-4ae1-847e-404fdc912625}" radius="0.0181634" x="0.480017" y="0.0931144" z="0.99489"/>
+        <node id="{f17183a2-5ecc-4b81-9399-5d3cfbb2eea2}" partId="{389a356e-22e6-4172-8c0d-1b835462d7b5}" radius="0" x="0.468588" y="0.0194454" z="1.00722"/>
+        <node id="{f1d52a81-d771-49f4-96f7-079e891415be}" partId="{62493532-0802-4e69-af81-89a1e382185d}" radius="0.0139845" x="0.755638" y="0.0617716" z="1.08642"/>
+        <node id="{f2778fa6-19d7-47dd-afc8-1e4f355c6475}" partId="{3a4bc54a-f2cc-40d9-82c3-4c1acd434048}" radius="0.00628206" x="0.508725" y="0.300017" z="1.02319"/>
+        <node id="{f419bd71-f788-4382-9479-6cc8b7e240c4}" partId="{d8f9b36d-cec1-4026-a344-16edbbc0fc13}" radius="0.00951228" x="0.521034" y="0.321097" z="1.03678"/>
+        <node id="{f5692d54-1eb7-4c3c-8e99-5323bd0046d4}" partId="{d8f9b36d-cec1-4026-a344-16edbbc0fc13}" radius="0.0190246" x="0.540632" y="0.300784" z="1.04004"/>
+        <node id="{f5c1ef85-7999-4224-845f-cfc4e07e2ef3}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" radius="0.0051308" x="0.53799" y="0.208533" z="1.01087"/>
+        <node id="{f6050cf2-105d-43b6-ade2-625e690e55f8}" partId="{5b7db920-6126-4e3a-a16d-2fa6c227a696}" radius="0.0163502" x="0.492895" y="0.275783" z="1.01443"/>
+        <node id="{f650f5b5-094c-41d1-b3b2-ece8be532cc1}" partId="{d049e679-f4f6-412e-963c-1019667439e8}" radius="0.0197157" x="0.463468" y="0.226014" z="0.983998"/>
+        <node id="{f738f338-39e1-495e-a94e-5e914d4d5317}" partId="{f0f8818f-5795-4520-b544-ca04abca2521}" radius="0" x="0.515228" y="0.116487" z="1.0404"/>
+        <node id="{f797fc7d-48c3-4a02-8215-11b2575f7982}" partId="{0564a8bf-85c6-4bd7-bad1-8cb70a2bacd9}" radius="0.00623232" x="0.512466" y="0.213789" z="1.01271"/>
+        <node id="{f7984a7e-fd12-4428-8e71-9b9e913492fb}" partId="{f1b78adc-6fdc-4414-bab8-8e98890a21ca}" radius="0.013302" x="0.442093" y="0.234165" z="0.995204"/>
+        <node id="{f7c408de-4dc2-4201-8ab9-f02c04a19893}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" radius="0.0169183" x="0.509819" y="0.77672" z="1.03141"/>
+        <node id="{f7c9ef1b-11cc-4f1e-b217-322279b063b3}" partId="{bb6e0337-94a1-4b8b-8894-9f40dc5577b5}" radius="0.00789172" x="0.785019" y="0.0497782" z="1.08983"/>
+        <node id="{f8e96450-96e9-4f56-b89c-3c74d76de271}" partId="{1716cb6d-01ed-4522-9ea3-7470418c6b51}" radius="0.0141029" x="0.718098" y="0.103986" z="1.07931"/>
+        <node id="{fb5b878a-9ef0-4869-9dc9-4e8d6f623440}" partId="{80845e66-2299-48ca-8cbf-77b55a536c0c}" radius="0.0110956" x="0.614139" y="0.23523" z="1.06723"/>
+        <node id="{fcba37c4-7372-43df-9d2e-5404cc9a1b91}" partId="{6986bf40-3089-4db5-bcc4-533d7ed960e3}" radius="0.00937295" x="0.521301" y="0.507458" z="0.965918"/>
+        <node id="{fd311c21-d781-4437-bfd3-414ae999f244}" partId="{3c4883ad-20db-4f7c-a728-e11bc72de231}" radius="0.0177075" x="0.505871" y="0.300467" z="1.03418"/>
+        <node id="{fd8dd98f-7c73-48e4-bdf0-904f2e2271e5}" partId="{52d54b31-5e73-444b-8bae-2ebc51ff209e}" radius="0.000615901" x="0.563839" y="0.302585" z="0.780169"/>
+        <node id="{fda59363-53f2-4d4d-a6ad-dce8aee17257}" partId="{3a4bc54a-f2cc-40d9-82c3-4c1acd434048}" radius="0.00628206" x="0.521034" y="0.321097" z="1.03678"/>
+        <node id="{fe831613-5b6a-43f2-a789-b7c0ce027d0a}" partId="{1aca42d2-f80a-4516-a8bf-0a066935d31c}" radius="0.0151557" x="0.506848" y="0.152781" z="1.01884"/>
+    </nodes>
+    <edges>
+        <edge from="{6c9d6544-ff34-4259-8d31-72393a4d7629}" id="{0096dcff-d08a-41e2-9c15-cc57943d039f}" partId="{a96bc03c-93f9-4cfd-abd4-e8d135fc8b49}" to="{05438075-6182-4f45-80c2-35625897b718}"/>
+        <edge from="{067095a4-8e69-40d7-bc00-9c0a7f4e1e3c}" id="{01176b68-f37c-4738-9f49-ba5b00869789}" partId="{092b0f10-67c1-4032-9c49-168067836057}" to="{c5cfd17f-ec0b-433b-b36b-f126b540b6a6}"/>
+        <edge from="{86e86e5e-2ee3-46e3-ae87-6f88b27d3855}" id="{020cc0b2-ca8d-44ee-86aa-69b35311fdfa}" partId="{9279a14a-691a-436c-ae9e-efd74fa28300}" to="{8471ffad-53be-4a68-ab72-97d32d7308fc}"/>
+        <edge from="{e2f0521a-2b2d-4c9b-b806-d6f4c2d078f4}" id="{033ddc37-8b89-4f86-b344-0955e617f39e}" partId="{46304293-800c-4e01-8fc2-5135561ecc2d}" to="{95ad6172-babb-45c4-a96d-4d734ba6a25e}"/>
+        <edge from="{df693fdf-c112-4501-afcc-243afa0c4611}" id="{0359760c-8bbe-4290-88e6-ac58b26abc87}" partId="{5e45c98d-9283-4386-b0ae-e6a8f85f2dad}" to="{8ba09bc4-ac19-42ad-8b41-31683e1dc872}"/>
+        <edge from="{3932e31f-34f7-47da-8a0d-032bec47e53c}" id="{03e45417-242e-4896-b1f5-2e2c3354943e}" partId="{6be248ef-32e3-43b0-b4bc-9e9cc8fae38e}" to="{5a7cf847-a78d-4877-9d4f-94cd9bb9eca8}"/>
+        <edge from="{78daab6a-4bd3-44b5-b9a8-785d8e08bb78}" id="{047b1783-1287-4175-91cd-771c9f57e81e}" partId="{9279a14a-691a-436c-ae9e-efd74fa28300}" to="{734ab0d5-d4d8-485a-b521-ebd36a3a8720}"/>
+        <edge from="{b31ca9d5-5b56-4c42-bebf-4d2d6aef739f}" id="{05675c45-4b4d-4ca1-9ef9-34dc12c16a9d}" partId="{78887fc7-dcfb-4d38-9eac-f8beaa99dce3}" to="{221a1797-ed67-4cfd-9cd8-34823e651ed3}"/>
+        <edge from="{28381152-78fe-4c2d-8c3c-c776138efa17}" id="{059c952e-c740-42a3-b8b9-201b71f59f88}" partId="{9538c8a9-1e82-4d5a-8e0e-b7a0d701c5f9}" to="{117ef567-17a0-425e-9fcb-ae1610e91539}"/>
+        <edge from="{a1101b66-19df-47af-9d58-822ff9eb26b9}" id="{08183a72-f98a-486c-a5fc-1fbdd8388ce4}" partId="{b5812967-d429-4214-a11c-f04918089461}" to="{0b4f4946-8ff1-4efe-bdfe-0b611af6a655}"/>
+        <edge from="{dedcce23-b5ab-4e30-a62a-29155b8d5e2a}" id="{09104af4-aaaa-476b-a2ca-14037f001996}" partId="{9538c8a9-1e82-4d5a-8e0e-b7a0d701c5f9}" to="{28381152-78fe-4c2d-8c3c-c776138efa17}"/>
+        <edge from="{071305c7-8044-4c28-8ccc-4f74cffb61cc}" id="{096d65ab-e733-487d-9134-a295c3cad472}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" to="{0711915a-a413-42b5-8022-35668c45d39b}"/>
+        <edge from="{55b5bb5d-d614-4cd3-b331-8819186ed572}" id="{0a23f811-2056-415d-83fa-d7c16be92cc2}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" to="{dc0aaf45-eb00-49b6-8e81-fa979245ac09}"/>
+        <edge from="{4c81714b-6ac4-45d8-b4f0-c98539911521}" id="{0a325591-d1f0-490b-a602-57396ad4d84e}" partId="{da7592eb-3353-4084-bff2-f31d92be4236}" to="{3cce2c34-9aab-46dc-bbd3-3a73327a8875}"/>
+        <edge from="{d1325b2e-e338-4239-9988-1d1dc6c44a6d}" id="{0b95966e-58f0-48f9-b474-8d6af804f41f}" partId="{87fbd826-5677-48f5-83d3-8091d48ef8d7}" to="{36e6565b-5c7c-4203-9757-b7afa6731c57}"/>
+        <edge from="{cf75b27e-3656-4130-8543-d07cbc98b9c9}" id="{0b9bf276-d38e-44bb-a0ed-47037621de51}" partId="{da7592eb-3353-4084-bff2-f31d92be4236}" to="{4c81714b-6ac4-45d8-b4f0-c98539911521}"/>
+        <edge from="{1b515278-0117-48fe-a1fe-e772057573d9}" id="{0c223e7d-82d3-40d2-b5e9-47a11ac3f7d6}" partId="{092b0f10-67c1-4032-9c49-168067836057}" to="{58bd7c83-b479-4e17-b4df-754316eef264}"/>
+        <edge from="{c78986e6-a263-42cf-b5f1-8b9fdc6f74a8}" id="{0d097ed2-6598-46f3-ac76-381fecf64297}" partId="{57dbdd98-cd36-4a18-a1b9-a22884c6b343}" to="{58321009-70bf-48ba-bbe7-f5afcd9e56f3}"/>
+        <edge from="{9c766968-443b-4e52-88ce-f1f20d377b5c}" id="{0d263e4e-5038-4640-bbab-e9f346dde7fc}" partId="{1aaacb49-c100-4361-b227-422bc9c3a3b9}" to="{4029708e-b1f7-4f53-832e-d0983bfcd651}"/>
+        <edge from="{a242b2bf-afe5-4672-aa61-e97e99e68a4c}" id="{0e574fe6-7f52-4218-bdd0-4a2950e2a97f}" partId="{13988a54-a274-49e0-aaf3-e5de769e18c1}" to="{751fee8a-4d20-44bf-b68f-24b908abf032}"/>
+        <edge from="{e94df7f8-d0ca-478e-aed1-25fa8d60b9fd}" id="{0fda6aea-37d5-4b90-9848-c5bcdb037f5e}" partId="{b78ff84d-5acd-4b46-a58b-564abba2c7e2}" to="{1957320f-7dec-4069-a2b2-502d9a18442e}"/>
+        <edge from="{1c85074d-db26-4962-9694-26df45d957c6}" id="{0ff4697b-f1cf-4ba4-9980-21185fc9346b}" partId="{092b0f10-67c1-4032-9c49-168067836057}" to="{1b515278-0117-48fe-a1fe-e772057573d9}"/>
+        <edge from="{e08afd53-006d-4434-9905-0ef150d16cd9}" id="{11530bb9-039f-4978-add5-ac73b953a642}" partId="{a96bc03c-93f9-4cfd-abd4-e8d135fc8b49}" to="{e5a7a6e8-c4de-4ea6-a175-93b87b709bee}"/>
+        <edge from="{74620eab-e43b-44e3-be3a-68f3838cda88}" id="{13ed1669-4641-4c72-b633-c689cf72774b}" partId="{524194d6-bde6-4708-b189-16535335dc5a}" to="{e5cbc93e-98eb-45b3-9046-1d60f009b382}"/>
+        <edge from="{751fee8a-4d20-44bf-b68f-24b908abf032}" id="{143d5474-8a3d-4dcc-a628-d6a248c14426}" partId="{13988a54-a274-49e0-aaf3-e5de769e18c1}" to="{52cc908a-1fa5-415d-9d64-51bb469706d7}"/>
+        <edge from="{ce3ca970-0d64-4ee1-92ef-8720f608f05f}" id="{15b5d349-7cae-47c2-84a9-c453a3b9525d}" partId="{9538c8a9-1e82-4d5a-8e0e-b7a0d701c5f9}" to="{4b7f18aa-704e-4f55-9f69-16b0f38237ce}"/>
+        <edge from="{94362d37-639a-40ff-b191-5c0a6e19f664}" id="{164e77ed-3ed5-4eae-bb17-95fc1050d41c}" partId="{d049e679-f4f6-412e-963c-1019667439e8}" to="{f650f5b5-094c-41d1-b3b2-ece8be532cc1}"/>
+        <edge from="{979a9d6c-f734-4f25-a0fc-04310bd4646b}" id="{16adf7ad-d523-471c-bf19-7f7061996f65}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" to="{0a8e8fb2-9858-49d2-8686-6ed728dccbc2}"/>
+        <edge from="{8540d159-7f70-44d7-86d2-471873be9bdb}" id="{17b22263-b406-4709-b49a-a678eff4c7ed}" partId="{092b0f10-67c1-4032-9c49-168067836057}" to="{067095a4-8e69-40d7-bc00-9c0a7f4e1e3c}"/>
+        <edge from="{9db4d842-ce14-4854-a532-d10650139dfc}" id="{194e24c6-3018-4ae0-b9df-661cfdaeaf8a}" partId="{b5812967-d429-4214-a11c-f04918089461}" to="{a1101b66-19df-47af-9d58-822ff9eb26b9}"/>
+        <edge from="{aac479ee-6f32-4c7a-b2e6-5e2c1df8c251}" id="{1e0061ef-fe00-4405-9933-f6c47df15f7d}" partId="{50b2e680-31ba-4d62-9c93-10c51edea1bf}" to="{6dea3dfc-6305-4221-81f8-d59379db1f8c}"/>
+        <edge from="{e7bc4edf-781b-4916-8abe-a304cda6ae75}" id="{1e13cfd6-41dd-4eb3-a927-a5f4eadec2c4}" partId="{62493532-0802-4e69-af81-89a1e382185d}" to="{44e13dd8-a3d2-4d4f-af81-372da15218d2}"/>
+        <edge from="{353010d5-28a2-4ce3-a465-12289cbadb21}" id="{1e500235-b08c-40a9-84ae-50884a9cebaa}" partId="{4c083326-6b05-4a2d-85ce-576dc7dd5c34}" to="{567a286a-bf1d-4291-b979-ba69733646f5}"/>
+        <edge from="{7285fcb8-4779-4e60-a474-4641c0943463}" id="{1ec67251-fbda-4557-b1e7-571366b78c01}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" to="{2cc27239-bf74-49d5-b82d-0998c0103d6d}"/>
+        <edge from="{cede8a6a-4e51-4c07-8581-0999b4705616}" id="{206685c9-6f62-42e1-a882-b8c77b81d8c1}" partId="{3c4883ad-20db-4f7c-a728-e11bc72de231}" to="{fd311c21-d781-4437-bfd3-414ae999f244}"/>
+        <edge from="{7153e3f6-ba74-4b9a-9a48-1f6b454b3678}" id="{21503cae-2040-4dca-804b-6121ad0c87f4}" partId="{e47c18bd-1154-48f4-96d5-954787c54562}" to="{9362b987-f419-4f31-bfaf-9539700ad242}"/>
+        <edge from="{199423e1-60c0-4b3c-b65a-3ab127cadf99}" id="{228c7b8d-ee59-401d-8ad9-ad209eed864a}" partId="{092b0f10-67c1-4032-9c49-168067836057}" to="{1c85074d-db26-4962-9694-26df45d957c6}"/>
+        <edge from="{aa1e35db-d9de-48a1-9b6a-e18a54ac4435}" id="{23248007-e8ab-41b9-a06e-b7e2030b7737}" partId="{f1b78adc-6fdc-4414-bab8-8e98890a21ca}" to="{f7984a7e-fd12-4428-8e71-9b9e913492fb}"/>
+        <edge from="{ba2664a7-be02-420f-b744-931e66efefe0}" id="{2334c6c9-8937-4ca3-8ba3-fadf7bf22add}" partId="{1b950787-9a25-4f55-9d21-9d6d12eaff28}" to="{404cdbf7-ef7b-4529-b04b-d775162d0edb}"/>
+        <edge from="{80e3c868-985f-4c6d-a57d-34e359987138}" id="{23d3917a-6afd-4d2e-9e7e-3d5192bad5bc}" partId="{f1b78adc-6fdc-4414-bab8-8e98890a21ca}" to="{aa1e35db-d9de-48a1-9b6a-e18a54ac4435}"/>
+        <edge from="{f797fc7d-48c3-4a02-8215-11b2575f7982}" id="{25d4d757-7c7a-4e49-91c1-1c1331da8631}" partId="{0564a8bf-85c6-4bd7-bad1-8cb70a2bacd9}" to="{442d48bd-1797-45dc-8e4f-d121fb89237c}"/>
+        <edge from="{379bec20-9be3-4a64-b259-d3ed4e84ebbc}" id="{263c2d30-e148-4a3c-bc8d-a5288a19b0d2}" partId="{c4ac9d40-ad41-4b17-8098-04fc2dec48a2}" to="{ba05b4f6-6652-449b-ad37-d4b09bda988b}"/>
+        <edge from="{491add8b-4be8-4171-b647-24334b050892}" id="{26f34c35-7953-4d1d-9817-69bdcc8407ad}" partId="{8fa5ba18-7e7f-4713-bd40-6ac223f08d12}" to="{eb6898b8-464b-4d10-9c56-9479d47438af}"/>
+        <edge from="{a08ef2a3-d98f-44ab-9765-c725baf366dc}" id="{286131bc-5708-43b9-b354-24b62c64954c}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" to="{f7c408de-4dc2-4201-8ab9-f02c04a19893}"/>
+        <edge from="{b1d0b918-225b-4399-a8d8-e90b84b5f5be}" id="{286e9d03-480a-4fbc-aeaf-db6df72b15dd}" partId="{534e034a-1fef-4d7d-82e4-12f7b8e82728}" to="{5064c6c5-783a-44e5-8e70-49c8c9cc2416}"/>
+        <edge from="{7b4bad9a-3192-479a-bc39-3d486444fe72}" id="{2920953c-c0ce-42ec-9ed4-6260647a45f0}" partId="{acdc210c-e671-486e-9611-b9244c016807}" to="{7b04a282-03d9-4a06-bec2-b48417956ce9}"/>
+        <edge from="{f7c9ef1b-11cc-4f1e-b217-322279b063b3}" id="{2a4d76e0-cffe-40d0-a0d0-68880c787890}" partId="{bb6e0337-94a1-4b8b-8894-9f40dc5577b5}" to="{10d61f38-3849-4852-9dd1-2be2ad90d468}"/>
+        <edge from="{cf6b2e2b-89ef-442c-87ca-74d86de7afdc}" id="{2abfe96f-0c4b-41c3-8985-9525a5d0598c}" partId="{13988a54-a274-49e0-aaf3-e5de769e18c1}" to="{408119ac-6fc0-40f5-b60c-99b7cc9517ae}"/>
+        <edge from="{15283e25-d483-44c6-b530-113073ae54d0}" id="{2b9ff78a-67ef-4314-ae2e-6ff837fa5dfe}" partId="{8f49f8aa-cb67-4955-9063-92e33042cb02}" to="{869cd102-81cd-4c15-b377-955b61d44d30}"/>
+        <edge from="{aefc096e-5901-425f-a831-6a0ddbd50399}" id="{2bd8eed2-1818-42ff-a5bc-5a69c04c9710}" partId="{bb6e0337-94a1-4b8b-8894-9f40dc5577b5}" to="{6394e5cc-a367-4664-a9af-753d41b82ba6}"/>
+        <edge from="{a0a9a94a-672a-45e8-a0bb-31be9300b41f}" id="{2fa4feb6-24c7-42a4-9747-d3b9a86047fc}" partId="{13988a54-a274-49e0-aaf3-e5de769e18c1}" to="{cf6b2e2b-89ef-442c-87ca-74d86de7afdc}"/>
+        <edge from="{4684632b-e51c-414e-aa21-df1ee91ea834}" id="{30ee3f2e-eda0-4038-b30e-13f2635a5b24}" partId="{2e4d7f86-270e-44c8-8e6c-27c9d1badd8d}" to="{d043181f-393b-4e20-8ad5-bc2c04e61bfd}"/>
+        <edge from="{796b1ebe-9414-4ec1-b58b-f3cdf6006d6e}" id="{32b0e144-7a1b-4ccf-9c59-05e1b504344b}" partId="{2e4d7f86-270e-44c8-8e6c-27c9d1badd8d}" to="{4684632b-e51c-414e-aa21-df1ee91ea834}"/>
+        <edge from="{44e13dd8-a3d2-4d4f-af81-372da15218d2}" id="{3375cef7-ad82-44fc-b7a9-1eade3908a5d}" partId="{62493532-0802-4e69-af81-89a1e382185d}" to="{da2809c9-3b46-4621-a9da-abfa3839f9f5}"/>
+        <edge from="{6fd6b2c1-ab1f-4904-ac30-2f800bbfc95a}" id="{338bc346-e040-404b-be5d-d986734f8055}" partId="{50b2e680-31ba-4d62-9c93-10c51edea1bf}" to="{7e6244ae-8921-4012-9dfd-badac7408adb}"/>
+        <edge from="{9d65e303-67cf-4bbb-ab6a-09120b410c7b}" id="{33b9ba1c-f491-4ac4-95f1-b5db2ba17afd}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" to="{a08ef2a3-d98f-44ab-9765-c725baf366dc}"/>
+        <edge from="{e04cf7e6-1351-49fc-acd7-67ea3641d678}" id="{34179ba5-9481-4bb6-984a-390c87e013c9}" partId="{d049e679-f4f6-412e-963c-1019667439e8}" to="{7f3333db-755a-4a86-a2d7-2126da8f6a49}"/>
+        <edge from="{973af58c-b3f5-4346-b614-413eb42ca621}" id="{34c6b443-96c5-4c99-bfe5-8e78332609e4}" partId="{1b950787-9a25-4f55-9d21-9d6d12eaff28}" to="{ba2664a7-be02-420f-b744-931e66efefe0}"/>
+        <edge from="{6d6619eb-70e2-48e4-b8a6-0ff52d14584b}" id="{35e4a4db-5369-409e-977d-4c58ea33a724}" partId="{1aca42d2-f80a-4516-a8bf-0a066935d31c}" to="{fe831613-5b6a-43f2-a789-b7c0ce027d0a}"/>
+        <edge from="{927f0b23-db5a-49e7-8d0f-bcc811f7752e}" id="{365ffd29-e221-4516-9156-775ed09c8f04}" partId="{709b8a08-78b0-4a8d-9978-27eb2eda8b93}" to="{27430d2c-0651-4361-a581-d304fcd67e22}"/>
+        <edge from="{84e6a0cf-c4e1-478c-8fed-a5cc25d9be5f}" id="{39385155-0aff-47ae-a9b5-f0d9a78424a8}" partId="{87fbd826-5677-48f5-83d3-8091d48ef8d7}" to="{001eb845-4bed-4de5-9803-ba8ca7faafaf}"/>
+        <edge from="{80faa256-324d-4c76-b4e6-491956155230}" id="{39b7e869-e586-4943-b6e5-76214e99d6b4}" partId="{8fa5ba18-7e7f-4713-bd40-6ac223f08d12}" to="{c7bd203d-7b04-47a9-a394-d7d1f18555c4}"/>
+        <edge from="{3547bb94-25b4-4740-a5e9-15046267f0f9}" id="{3a2dab82-5eb6-46db-b4b8-1afe92b105f7}" partId="{0564a8bf-85c6-4bd7-bad1-8cb70a2bacd9}" to="{3424cf20-48a1-4e64-be63-5890321cdbcd}"/>
+        <edge from="{05438075-6182-4f45-80c2-35625897b718}" id="{3b7d0700-ee48-4c52-8713-e89755f6ec41}" partId="{a96bc03c-93f9-4cfd-abd4-e8d135fc8b49}" to="{b1a5e801-c4b0-4478-aad0-41c40133502e}"/>
+        <edge from="{2501c90c-247d-42a1-b2fb-411d88b95e3a}" id="{3cc889ef-5ff2-4655-abe0-fa4878665305}" partId="{36c17734-cbeb-4637-822c-71f680aa5a49}" to="{02b8c92c-3aad-43b4-b2d6-eb0659a8a206}"/>
+        <edge from="{833ad6bd-3219-4093-9689-2f7cbe8ac8fc}" id="{3cf1514d-d956-4da8-99b4-71606e8e63ef}" partId="{5e45c98d-9283-4386-b0ae-e6a8f85f2dad}" to="{e90118b2-e7ef-4ebc-ba06-784613255d46}"/>
+        <edge from="{15d886b0-181e-4e8d-84c4-21da599037c1}" id="{3eb0a7d3-a446-44b5-aab5-aaefb5d1c4ab}" partId="{c4ac9d40-ad41-4b17-8098-04fc2dec48a2}" to="{78b55011-5b1b-4c44-9240-71968c7ad7f8}"/>
+        <edge from="{8471ffad-53be-4a68-ab72-97d32d7308fc}" id="{3f4c2320-2fa7-4e68-877c-14b3f2e654d4}" partId="{9279a14a-691a-436c-ae9e-efd74fa28300}" to="{1ad678c9-b640-43d5-af1c-92ddfc540416}"/>
+        <edge from="{3cce2c34-9aab-46dc-bbd3-3a73327a8875}" id="{3ffc3ed2-4a9b-4b83-ab9f-52d4e3ba1384}" partId="{da7592eb-3353-4084-bff2-f31d92be4236}" to="{7a7cf872-03e0-4655-92e7-0af10466cc83}"/>
+        <edge from="{8f367bd2-114c-4d04-96c5-bbb53a16d8ba}" id="{4180a4e0-22b4-474e-8fcf-cb78f8798906}" partId="{9b4be491-12d5-4eea-8ee9-87dff887b292}" to="{0c131c2e-c763-4239-aae8-c71e219bb2ff}"/>
+        <edge from="{869cd102-81cd-4c15-b377-955b61d44d30}" id="{41fa76f3-3cbc-4858-a1c2-a2f037f4be88}" partId="{8f49f8aa-cb67-4955-9063-92e33042cb02}" to="{0c3ed74f-ee80-41a9-8568-1487fe0cfd7c}"/>
+        <edge from="{b256069f-8463-4f7d-b6e0-30af0bbf2898}" id="{438257ce-1dbc-45c7-bf9f-360907a4b00e}" partId="{c4ac9d40-ad41-4b17-8098-04fc2dec48a2}" to="{15d886b0-181e-4e8d-84c4-21da599037c1}"/>
+        <edge from="{f5692d54-1eb7-4c3c-8e99-5323bd0046d4}" id="{45ba05df-2fcc-4a3b-86dd-13711499cf8d}" partId="{d8f9b36d-cec1-4026-a344-16edbbc0fc13}" to="{c9174f26-59b1-4382-8214-bc4a91f1759e}"/>
+        <edge from="{651c39df-7b14-4fd3-beb3-592efcb25842}" id="{46be5837-af25-4f49-b837-c7b3fc309c37}" partId="{ae6741e2-ad53-4265-8b9b-310b65badd1e}" to="{b71171d7-1d32-46f7-8fca-fcc3a7a5a46e}"/>
+        <edge from="{e3592e6e-2c54-4f3c-8745-e35f79c472d2}" id="{47fa200b-6705-4cb5-bc1b-cb45fcc18270}" partId="{78887fc7-dcfb-4d38-9eac-f8beaa99dce3}" to="{b31ca9d5-5b56-4c42-bebf-4d2d6aef739f}"/>
+        <edge from="{e3a311f1-ab14-4e80-80dc-9f882721d9a8}" id="{48a71f2a-4ad8-482d-b933-906b736c0cc6}" partId="{c4c54ceb-2b1e-476c-8785-6fa69f041925}" to="{adda25df-58c1-4e63-ba09-c05ec91ac643}"/>
+        <edge from="{14a9c743-142c-43a6-8962-5dbf6514c38a}" id="{49d839bf-7531-4776-b435-bc2a21782b46}" partId="{700ce49d-5978-4ae1-847e-404fdc912625}" to="{f06b2588-283a-4bcc-a9e5-00f5cb6c9c57}"/>
+        <edge from="{e90118b2-e7ef-4ebc-ba06-784613255d46}" id="{4c297f88-7c9a-4e36-a0ff-d295a505eb02}" partId="{5e45c98d-9283-4386-b0ae-e6a8f85f2dad}" to="{66c32673-0a5b-4c93-8dd8-26ea2e206aa9}"/>
+        <edge from="{fda59363-53f2-4d4d-a6ad-dce8aee17257}" id="{4ec12ae8-59aa-4aea-8ae5-9adcc1c67b3f}" partId="{3a4bc54a-f2cc-40d9-82c3-4c1acd434048}" to="{5399b1af-6473-4df5-96cc-13e6e28784c1}"/>
+        <edge from="{e5cbc93e-98eb-45b3-9046-1d60f009b382}" id="{4ef7427a-44a6-4fbe-8a22-83b42145a363}" partId="{524194d6-bde6-4708-b189-16535335dc5a}" to="{53f27881-5a75-4c22-b2cf-7b2d05ee1d8e}"/>
+        <edge from="{73951d38-c2aa-4577-927b-7e9429d1f0db}" id="{539667f3-9c26-4d41-9730-4059d5a6c8fc}" partId="{1cb0fafb-2cee-4fba-b0c6-ffbe586ba374}" to="{5e465c5c-fdc5-4c81-95dc-4729f981df5c}"/>
+        <edge from="{ccd8ef94-281b-4dfb-ab29-b50dfe17a770}" id="{5705b308-086e-4ea6-81cf-f78578bff77e}" partId="{389a356e-22e6-4172-8c0d-1b835462d7b5}" to="{c42a3e99-b6aa-4c26-8579-44228dd34b4b}"/>
+        <edge from="{2cc27239-bf74-49d5-b82d-0998c0103d6d}" id="{576f4162-98f4-47f5-98a5-eba433e68ffa}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" to="{55b5bb5d-d614-4cd3-b331-8819186ed572}"/>
+        <edge from="{7293a322-fbad-4c7b-a059-606020ff09bf}" id="{588e7c89-c53e-48e5-953e-4bd17eafe928}" partId="{504953c2-aef4-4f37-be54-8f23c1f3f0fc}" to="{0402a0e9-9712-4d9c-b022-ea25f2ed64d0}"/>
+        <edge from="{bd244a0f-1d5e-4307-85b7-f764e6c1304b}" id="{58a164c5-d67e-4597-92aa-31bf56c6b16b}" partId="{4c083326-6b05-4a2d-85ce-576dc7dd5c34}" to="{ba04e35f-5b85-46bf-84f6-f4b253125471}"/>
+        <edge from="{878d0098-c6f5-4a98-8e1e-d469396b6b4d}" id="{599287d2-a889-4443-a149-304f130c7e9e}" partId="{80845e66-2299-48ca-8cbf-77b55a536c0c}" to="{fb5b878a-9ef0-4869-9dc9-4e8d6f623440}"/>
+        <edge from="{b71171d7-1d32-46f7-8fca-fcc3a7a5a46e}" id="{5b8dcc57-24a0-4e1d-92fb-630579900ff7}" partId="{ae6741e2-ad53-4265-8b9b-310b65badd1e}" to="{7dfc521a-3f80-4e32-93c9-85fe7b84dd93}"/>
+        <edge from="{71b98c98-8654-42d8-b58a-22688b722630}" id="{5bc071b7-b164-480a-82ca-729c0a445d3a}" partId="{c3e8e9c2-eb6f-4d7f-8f72-6d4cd3003c26}" to="{2b2d6ee4-f105-491c-b098-4de0613fd37c}"/>
+        <edge from="{70da7060-9223-4ac9-b6ca-ea16eeb20d45}" id="{5e30a9e5-db47-4b49-8c3f-601afaab621a}" partId="{ae6741e2-ad53-4265-8b9b-310b65badd1e}" to="{eb4fb92f-f8ea-49ef-b132-ae6b72fa6ea4}"/>
+        <edge from="{7c5da7e3-9eab-47f1-9736-c53bcf1e8efa}" id="{5faa9c7b-f509-4106-aeee-cbb81c2aa3a3}" partId="{01f7a857-f594-42fc-8b5d-b3bdae4dacda}" to="{d866de28-dae4-40ce-b547-81e4cf5c1bfc}"/>
+        <edge from="{29686a15-7ddb-4717-a196-0412164025ef}" id="{60dcc41c-64d1-4c2b-ae3f-467026314d1e}" partId="{80845e66-2299-48ca-8cbf-77b55a536c0c}" to="{567bcfd4-255f-478d-a9fe-362f2f832ff6}"/>
+        <edge from="{096379fc-4ca1-4c6d-b242-e353a20ffc88}" id="{61540c56-b89f-4001-b8a2-6dcc7315b687}" partId="{87fbd826-5677-48f5-83d3-8091d48ef8d7}" to="{84e6a0cf-c4e1-478c-8fed-a5cc25d9be5f}"/>
+        <edge from="{1ad678c9-b640-43d5-af1c-92ddfc540416}" id="{64323832-f151-4a98-9a2e-24041c1a43c3}" partId="{9279a14a-691a-436c-ae9e-efd74fa28300}" to="{78daab6a-4bd3-44b5-b9a8-785d8e08bb78}"/>
+        <edge from="{644464d2-775c-42ec-8544-206fe7d11fe7}" id="{69c93b35-b766-4ee8-a0ad-7eab683e6695}" partId="{3c4883ad-20db-4f7c-a728-e11bc72de231}" to="{cede8a6a-4e51-4c07-8581-0999b4705616}"/>
+        <edge from="{308ce17b-2a9a-4e10-b3f6-aaed5190c957}" id="{6a9b4c34-ad0a-4deb-a02e-d72827a5da23}" partId="{57dbdd98-cd36-4a18-a1b9-a22884c6b343}" to="{c78986e6-a263-42cf-b5f1-8b9fdc6f74a8}"/>
+        <edge from="{59fe931d-cbf2-47e6-b35e-0edcf8ad6830}" id="{6b38b65e-ab44-4303-a8c7-968005637564}" partId="{f0f8818f-5795-4520-b544-ca04abca2521}" to="{516a356a-f5a0-4c65-9f17-8d186eeccaa2}"/>
+        <edge from="{a7137baa-7fe5-4d1c-b9f2-11b8bf6be38a}" id="{6b4abfec-cf01-42b3-8a19-f8761917760d}" partId="{b5812967-d429-4214-a11c-f04918089461}" to="{9db4d842-ce14-4854-a532-d10650139dfc}"/>
+        <edge from="{36e6565b-5c7c-4203-9757-b7afa6731c57}" id="{6da3668f-63de-4950-a7b4-5682d201c02f}" partId="{87fbd826-5677-48f5-83d3-8091d48ef8d7}" to="{096379fc-4ca1-4c6d-b242-e353a20ffc88}"/>
+        <edge from="{221a1797-ed67-4cfd-9cd8-34823e651ed3}" id="{6e701462-7cf7-4666-90e8-f4b2ed413d33}" partId="{78887fc7-dcfb-4d38-9eac-f8beaa99dce3}" to="{172dd203-fbf9-4d7f-aafe-b751b7f943de}"/>
+        <edge from="{5df7e38f-b9da-4c41-800c-56b5d25952b6}" id="{70368d24-9515-4d8f-9bb6-b143f4d3d8c8}" partId="{1b950787-9a25-4f55-9d21-9d6d12eaff28}" to="{17722f68-bf1b-49d6-a22a-44a5fd7cd1f4}"/>
+        <edge from="{fb5b878a-9ef0-4869-9dc9-4e8d6f623440}" id="{70970648-a7b5-4260-9623-61db470328df}" partId="{80845e66-2299-48ca-8cbf-77b55a536c0c}" to="{29686a15-7ddb-4717-a196-0412164025ef}"/>
+        <edge from="{d36ed08a-2202-41de-9601-76d275344502}" id="{724ad440-1f0d-404c-b441-558e58fd6c93}" partId="{1aaacb49-c100-4361-b227-422bc9c3a3b9}" to="{6e591cdf-09bd-478c-a604-ac7d19acf528}"/>
+        <edge from="{8626c044-fef3-47d2-a38f-944010bdef05}" id="{74862140-774e-4429-838c-223ccff72d7e}" partId="{57dbdd98-cd36-4a18-a1b9-a22884c6b343}" to="{308ce17b-2a9a-4e10-b3f6-aaed5190c957}"/>
+        <edge from="{7e6244ae-8921-4012-9dfd-badac7408adb}" id="{74c25298-da73-43bc-a7fe-40c75eed6b34}" partId="{50b2e680-31ba-4d62-9c93-10c51edea1bf}" to="{a9746f2b-b2ba-40a7-a405-d34b982c683f}"/>
+        <edge from="{7e3c29a3-b4f3-466d-a888-a05b5e1704e6}" id="{777c6a01-f0be-4cb6-a74f-cb950c3e8b5f}" partId="{524194d6-bde6-4708-b189-16535335dc5a}" to="{a88191b2-a7cd-4b7a-be30-d5d97c3a0b48}"/>
+        <edge from="{593f1c87-b152-41e0-98b6-07acf061f646}" id="{7799b90a-9c5e-4b32-a610-ec181002a01f}" partId="{534e034a-1fef-4d7d-82e4-12f7b8e82728}" to="{85fceff6-5c5b-4882-9f92-e45d6c5613fe}"/>
+        <edge from="{02b8c92c-3aad-43b4-b2d6-eb0659a8a206}" id="{7c86ab40-166d-4f83-af3f-63d90d17e638}" partId="{36c17734-cbeb-4637-822c-71f680aa5a49}" to="{052c2ec6-ad61-40af-b659-14a23612734d}"/>
+        <edge from="{1957320f-7dec-4069-a2b2-502d9a18442e}" id="{7dbfa944-373a-4c17-8ea1-f548966712ee}" partId="{b78ff84d-5acd-4b46-a58b-564abba2c7e2}" to="{3b94ce3c-27ef-41af-87d1-4227ca2045f1}"/>
+        <edge from="{f8e96450-96e9-4f56-b89c-3c74d76de271}" id="{7e253ecf-5b0a-45b2-892c-71af785070c8}" partId="{1716cb6d-01ed-4522-9ea3-7470418c6b51}" to="{a6209995-831e-4084-afeb-32704ca086bf}"/>
+        <edge from="{4d0f2620-8a2a-496f-ad0a-4d8002493035}" id="{81331cbb-946a-4bfc-b4b6-37a13584570c}" partId="{9b4be491-12d5-4eea-8ee9-87dff887b292}" to="{8f367bd2-114c-4d04-96c5-bbb53a16d8ba}"/>
+        <edge from="{ebe51975-e81f-45a6-aa7d-ca216cc56c8b}" id="{81430c8e-0e44-4045-8f2d-67c76fc7b496}" partId="{5b7db920-6126-4e3a-a16d-2fa6c227a696}" to="{0434ac30-312c-4b70-984e-5a0971e9eb75}"/>
+        <edge from="{17408e0e-5237-45ce-8f5c-de1034fcf23c}" id="{84411218-19f4-449c-815c-48c6c9eac63f}" partId="{13988a54-a274-49e0-aaf3-e5de769e18c1}" to="{a242b2bf-afe5-4672-aa61-e97e99e68a4c}"/>
+        <edge from="{e785bb5a-3352-4545-a008-17d16d82c906}" id="{84ecd97a-3e83-4722-bdcd-ed3777f960fc}" partId="{c3e8e9c2-eb6f-4d7f-8f72-6d4cd3003c26}" to="{71b98c98-8654-42d8-b58a-22688b722630}"/>
+        <edge from="{c62e9181-4388-4e00-a10a-8a61eb93c4ae}" id="{87e83f14-914d-47a6-848a-7faac287e6ec}" partId="{80845e66-2299-48ca-8cbf-77b55a536c0c}" to="{878d0098-c6f5-4a98-8e1e-d469396b6b4d}"/>
+        <edge from="{a3e169ff-fc5f-4dcd-b7c5-0a14fa29b73e}" id="{87f83f97-ef97-4fad-a5ac-8dc0e87ec74a}" partId="{499562a3-978a-46b8-82ac-ad5a45c3288b}" to="{6d108c14-4e3d-4273-8cee-084390309386}"/>
+        <edge from="{fcba37c4-7372-43df-9d2e-5404cc9a1b91}" id="{87fb7488-2d6c-44ab-ab6f-849defa74481}" partId="{6986bf40-3089-4db5-bcc4-533d7ed960e3}" to="{528a1707-5b77-4963-a34e-db9dba558205}"/>
+        <edge from="{0e5d29f3-fb8f-4d5c-b156-e4a3e028d97d}" id="{88268c31-32ea-4652-b405-6a18ed797fcc}" partId="{389a356e-22e6-4172-8c0d-1b835462d7b5}" to="{ccd8ef94-281b-4dfb-ab29-b50dfe17a770}"/>
+        <edge from="{567a286a-bf1d-4291-b979-ba69733646f5}" id="{88ea2f4a-6869-4854-b25c-0b7e9068214e}" partId="{4c083326-6b05-4a2d-85ce-576dc7dd5c34}" to="{bd244a0f-1d5e-4307-85b7-f764e6c1304b}"/>
+        <edge from="{a6209995-831e-4084-afeb-32704ca086bf}" id="{892c5570-841f-4c08-b2e2-dca141c94647}" partId="{1716cb6d-01ed-4522-9ea3-7470418c6b51}" to="{09f3f5fa-46f1-476c-aa35-3df95debd16f}"/>
+        <edge from="{0390d0a1-814a-4705-999e-5932354f0244}" id="{8b156381-67cb-4b5f-834b-cd3164b438c0}" partId="{e47c18bd-1154-48f4-96d5-954787c54562}" to="{7153e3f6-ba74-4b9a-9a48-1f6b454b3678}"/>
+        <edge from="{06f82254-ab2d-44f4-bc96-3814316535a9}" id="{8f0ae77f-31d4-45aa-b9b2-67e4a2424a6c}" partId="{6be248ef-32e3-43b0-b4bc-9e9cc8fae38e}" to="{6ef80ba2-4d3c-4a6e-a901-e5ddc913a272}"/>
+        <edge from="{ba05b4f6-6652-449b-ad37-d4b09bda988b}" id="{8facd603-513f-4464-baa8-9fbddf383931}" partId="{c4ac9d40-ad41-4b17-8098-04fc2dec48a2}" to="{b256069f-8463-4f7d-b6e0-30af0bbf2898}"/>
+        <edge from="{9bf0c1e8-8582-442c-90a4-5037d7219b21}" id="{8fd42582-c37b-4ad6-b305-c53c448357d8}" partId="{52d54b31-5e73-444b-8bae-2ebc51ff209e}" to="{fd8dd98f-7c73-48e4-bdf0-904f2e2271e5}"/>
+        <edge from="{bbab93bd-50a6-47f4-b608-00091b262e97}" id="{92be512b-2aab-4800-909a-372e1ea994bf}" partId="{46304293-800c-4e01-8fc2-5135561ecc2d}" to="{e2f0521a-2b2d-4c9b-b806-d6f4c2d078f4}"/>
+        <edge from="{1d21ff2c-ba5f-4997-98db-a1ed63d01db3}" id="{94f01483-83a8-499a-9204-e6d996cb7920}" partId="{092b0f10-67c1-4032-9c49-168067836057}" to="{199423e1-60c0-4b3c-b65a-3ab127cadf99}"/>
+        <edge from="{117ef567-17a0-425e-9fcb-ae1610e91539}" id="{94fcf07d-3754-4aff-b22f-ac4f25db5310}" partId="{9538c8a9-1e82-4d5a-8e0e-b7a0d701c5f9}" to="{ce3ca970-0d64-4ee1-92ef-8720f608f05f}"/>
+        <edge from="{edb9977c-0dd1-4472-8534-dbeb127c9d16}" id="{951d69e2-6b90-4309-8ebb-625c64bf41ca}" partId="{1716cb6d-01ed-4522-9ea3-7470418c6b51}" to="{f8e96450-96e9-4f56-b89c-3c74d76de271}"/>
+        <edge from="{0582fcb5-78cf-4f27-bd85-0ccd279e8713}" id="{955971a0-2720-4c00-b3f7-f4a41ab9a1b7}" partId="{504953c2-aef4-4f37-be54-8f23c1f3f0fc}" to="{2ebd2648-14b0-4a21-b97b-7b34f021991b}"/>
+        <edge from="{c1a57de4-5129-46f3-ace2-c662a6c079b8}" id="{95a75753-93fa-448d-b09e-aaaada89a7ab}" partId="{709b8a08-78b0-4a8d-9978-27eb2eda8b93}" to="{bbdd82a9-286b-4c1c-b007-745c306e4f14}"/>
+        <edge from="{32cc74f0-3f2c-450d-845d-9baabb852655}" id="{987d4d6f-4043-47e3-a976-c629cc2062f1}" partId="{9b4be491-12d5-4eea-8ee9-87dff887b292}" to="{73b1a616-30a5-44a9-a246-76ff142d228b}"/>
+        <edge from="{adbd9948-2566-46d3-8603-0d4ecf4c9fa4}" id="{9895d412-df9a-4104-8fce-f3d53239004b}" partId="{2e4d7f86-270e-44c8-8e6c-27c9d1badd8d}" to="{796b1ebe-9414-4ec1-b58b-f3cdf6006d6e}"/>
+        <edge from="{44dfeb44-b697-4c87-b313-325d3826cc63}" id="{98d6c9f1-6c28-4435-a265-9a54df595469}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" to="{979a9d6c-f734-4f25-a0fc-04310bd4646b}"/>
+        <edge from="{442d48bd-1797-45dc-8e4f-d121fb89237c}" id="{9989d0ed-422a-44f4-94f1-91f57780b3f8}" partId="{0564a8bf-85c6-4bd7-bad1-8cb70a2bacd9}" to="{3547bb94-25b4-4740-a5e9-15046267f0f9}"/>
+        <edge from="{0c3ed74f-ee80-41a9-8568-1487fe0cfd7c}" id="{9a9a11fe-79e1-4d05-9856-abb5b9d19da1}" partId="{8f49f8aa-cb67-4955-9063-92e33042cb02}" to="{021bd224-eaac-49a1-a91f-0f2406f26f8a}"/>
+        <edge from="{58321009-70bf-48ba-bbe7-f5afcd9e56f3}" id="{9bdbe3b2-ed09-40a3-b026-2d073bdcadf0}" partId="{57dbdd98-cd36-4a18-a1b9-a22884c6b343}" to="{516d36d9-b1db-4de8-8503-7ea829120487}"/>
+        <edge from="{0bd7865d-7f8d-46cb-a1ba-4ed601bf62fe}" id="{9c70d61b-38d4-482b-9f5f-5876a612c8b8}" partId="{01f7a857-f594-42fc-8b5d-b3bdae4dacda}" to="{7c5da7e3-9eab-47f1-9736-c53bcf1e8efa}"/>
+        <edge from="{3b94ce3c-27ef-41af-87d1-4227ca2045f1}" id="{9cd7f215-eedb-4a42-a5b1-eb4322f39973}" partId="{b78ff84d-5acd-4b46-a58b-564abba2c7e2}" to="{2acf141a-f327-4469-bde3-ea54de99f8d6}"/>
+        <edge from="{c5cfd17f-ec0b-433b-b36b-f126b540b6a6}" id="{9d29af4f-1e74-4358-a054-f9bc0c4ce8aa}" partId="{092b0f10-67c1-4032-9c49-168067836057}" to="{dfd92d67-a666-4f9e-a606-217795b284cc}"/>
+        <edge from="{6dea3dfc-6305-4221-81f8-d59379db1f8c}" id="{9d54a330-6f53-4548-9363-090295d98651}" partId="{50b2e680-31ba-4d62-9c93-10c51edea1bf}" to="{6fd6b2c1-ab1f-4904-ac30-2f800bbfc95a}"/>
+        <edge from="{fd311c21-d781-4437-bfd3-414ae999f244}" id="{9e035778-7556-47f9-b600-198c358f2c7d}" partId="{3c4883ad-20db-4f7c-a728-e11bc72de231}" to="{e2bae992-d1d2-4fdd-9a30-dba9c62f5322}"/>
+        <edge from="{f06b2588-283a-4bcc-a9e5-00f5cb6c9c57}" id="{9e64da63-f984-4c9b-a5f9-fbcf357c6b5c}" partId="{700ce49d-5978-4ae1-847e-404fdc912625}" to="{0f798576-2812-4db6-b605-9ef70f713c8b}"/>
+        <edge from="{0f798576-2812-4db6-b605-9ef70f713c8b}" id="{9ffe0695-a3f4-4b6c-951f-7af1d703912e}" partId="{700ce49d-5978-4ae1-847e-404fdc912625}" to="{35bf1780-fe7c-46dd-a93e-99896e097cf2}"/>
+        <edge from="{f1d52a81-d771-49f4-96f7-079e891415be}" id="{a0515545-e378-4413-b6b3-a69f27ff7964}" partId="{62493532-0802-4e69-af81-89a1e382185d}" to="{e7bc4edf-781b-4916-8abe-a304cda6ae75}"/>
+        <edge from="{c42a3e99-b6aa-4c26-8579-44228dd34b4b}" id="{a1d5fbbf-f1f8-4d5a-be27-51a976c01f7b}" partId="{389a356e-22e6-4172-8c0d-1b835462d7b5}" to="{f17183a2-5ecc-4b81-9399-5d3cfbb2eea2}"/>
+        <edge from="{2b2d6ee4-f105-491c-b098-4de0613fd37c}" id="{a3ff149d-7d58-4018-aaf5-7549d6268a01}" partId="{c3e8e9c2-eb6f-4d7f-8f72-6d4cd3003c26}" to="{427a3b1a-021e-4685-b78b-6080d8585450}"/>
+        <edge from="{e2bae992-d1d2-4fdd-9a30-dba9c62f5322}" id="{a413f056-94b7-452f-bfca-3efb1edfba32}" partId="{3c4883ad-20db-4f7c-a728-e11bc72de231}" to="{105d5ada-f06b-474f-82a7-34fbfa628526}"/>
+        <edge from="{3424cf20-48a1-4e64-be63-5890321cdbcd}" id="{a511fc12-06db-4e7f-813b-27c18254de84}" partId="{0564a8bf-85c6-4bd7-bad1-8cb70a2bacd9}" to="{d5be35fe-16ec-40bd-b41b-d92171f18a01}"/>
+        <edge from="{dfd92d67-a666-4f9e-a606-217795b284cc}" id="{a720b5ce-2b71-4922-81eb-9a9048241fce}" partId="{092b0f10-67c1-4032-9c49-168067836057}" to="{1d21ff2c-ba5f-4997-98db-a1ed63d01db3}"/>
+        <edge from="{0c131c2e-c763-4239-aae8-c71e219bb2ff}" id="{a99420af-71a5-47da-a1f1-280601594b96}" partId="{9b4be491-12d5-4eea-8ee9-87dff887b292}" to="{32cc74f0-3f2c-450d-845d-9baabb852655}"/>
+        <edge from="{95ad6172-babb-45c4-a96d-4d734ba6a25e}" id="{aa45882b-7149-41e8-9c8c-b2064f9dc5bd}" partId="{46304293-800c-4e01-8fc2-5135561ecc2d}" to="{21a051be-53a6-442c-8c87-e5572e6ff05e}"/>
+        <edge from="{9362b987-f419-4f31-bfaf-9539700ad242}" id="{aeff3443-032d-491f-b102-d07fedf66cd8}" partId="{e47c18bd-1154-48f4-96d5-954787c54562}" to="{a370ab3d-5136-42d7-9aa9-ac3bed89d137}"/>
+        <edge from="{40b1d9b4-f4ee-4c7d-8172-a9e0fc4d5654}" id="{afc12d1a-ee5b-4598-939b-7209da2b2ab4}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" to="{44dfeb44-b697-4c87-b313-325d3826cc63}"/>
+        <edge from="{68be0242-2557-4881-b306-25936e0ac472}" id="{afc5f18e-ff1d-43db-9df1-70059bab38c5}" partId="{c4c54ceb-2b1e-476c-8785-6fa69f041925}" to="{c8d861a6-491b-42d4-8e07-73e5df7c019b}"/>
+        <edge from="{84db1f93-1858-4a96-be7f-7a383a1430df}" id="{b02e4534-0081-493e-824b-ad04492ce590}" partId="{deb52d1d-f439-4144-9284-6b990b239ae5}" to="{818b69e5-7a8b-41dd-970a-90348c5b766c}"/>
+        <edge from="{404cdbf7-ef7b-4529-b04b-d775162d0edb}" id="{b0716ba4-19bc-476c-813b-8f536601ceeb}" partId="{1b950787-9a25-4f55-9d21-9d6d12eaff28}" to="{5df7e38f-b9da-4c41-800c-56b5d25952b6}"/>
+        <edge from="{c9174f26-59b1-4382-8214-bc4a91f1759e}" id="{b160c3bc-fe1d-4040-a7c4-4a540ae64e82}" partId="{d8f9b36d-cec1-4026-a344-16edbbc0fc13}" to="{6a16e994-9730-49a8-81f7-d9bcaf0d3614}"/>
+        <edge from="{e79795d5-e758-4acb-8559-7f1033c9b02f}" id="{b16bd2b9-e95e-4f0c-b35d-32cc673ce53e}" partId="{da7592eb-3353-4084-bff2-f31d92be4236}" to="{cf75b27e-3656-4130-8543-d07cbc98b9c9}"/>
+        <edge from="{818b69e5-7a8b-41dd-970a-90348c5b766c}" id="{b188cd7d-7287-4846-8a1b-868f8594860c}" partId="{deb52d1d-f439-4144-9284-6b990b239ae5}" to="{55340a9c-d66d-4d5d-a189-6d658d599e53}"/>
+        <edge from="{2ebd2648-14b0-4a21-b97b-7b34f021991b}" id="{b19db57a-f8c1-4e2f-84da-1c1163ef3e66}" partId="{504953c2-aef4-4f37-be54-8f23c1f3f0fc}" to="{7293a322-fbad-4c7b-a059-606020ff09bf}"/>
+        <edge from="{66c32673-0a5b-4c93-8dd8-26ea2e206aa9}" id="{b1b253d9-ff12-4246-ae53-2a3bbe6159f2}" partId="{5e45c98d-9283-4386-b0ae-e6a8f85f2dad}" to="{df693fdf-c112-4501-afcc-243afa0c4611}"/>
+        <edge from="{f419bd71-f788-4382-9479-6cc8b7e240c4}" id="{b29f1338-5b75-40a5-aa9d-e980e1a0d4be}" partId="{d8f9b36d-cec1-4026-a344-16edbbc0fc13}" to="{2015db8c-2d22-40d9-8605-073117da143a}"/>
+        <edge from="{b4b3a668-fd69-4887-ba98-abe5dae57101}" id="{b60e7df4-9557-452f-a82b-0bf1b7e10b65}" partId="{deb52d1d-f439-4144-9284-6b990b239ae5}" to="{7351a5f6-983d-4fdf-83c9-be734363f2ca}"/>
+        <edge from="{d69b0b89-1efb-4918-baf5-d0cc0d5b972c}" id="{b7637511-7819-4817-a2aa-684d31751971}" partId="{389a356e-22e6-4172-8c0d-1b835462d7b5}" to="{0e5d29f3-fb8f-4d5c-b156-e4a3e028d97d}"/>
+        <edge from="{6e591cdf-09bd-478c-a604-ac7d19acf528}" id="{b7b19a9f-5357-481b-8bde-6c132b0ef1ec}" partId="{1aaacb49-c100-4361-b227-422bc9c3a3b9}" to="{d7bf67d3-f4df-45b3-8a40-2dabc5e41d32}"/>
+        <edge from="{75d10124-3ee1-47f1-8e95-b397c0f35fe9}" id="{b7deba2c-d4f7-4ab7-a493-4167c2b47e82}" partId="{c3e8e9c2-eb6f-4d7f-8f72-6d4cd3003c26}" to="{e785bb5a-3352-4545-a008-17d16d82c906}"/>
+        <edge from="{86a40600-8eac-4094-81a0-a1d698c94d2d}" id="{b7e1cf5e-679a-4a57-b03b-f4cf89e385d6}" partId="{4c083326-6b05-4a2d-85ce-576dc7dd5c34}" to="{353010d5-28a2-4ce3-a465-12289cbadb21}"/>
+        <edge from="{daa6e549-8d8c-4219-b312-84b523aa4f51}" id="{b8d4df7a-100d-46d5-a0b9-bdf28af8dee4}" partId="{1cb0fafb-2cee-4fba-b0c6-ffbe586ba374}" to="{743d083e-3e96-4eb7-9c5f-0f0cee310915}"/>
+        <edge from="{d043181f-393b-4e20-8ad5-bc2c04e61bfd}" id="{b9358ec5-b955-46f8-9ebf-7eb1b6ec89e8}" partId="{2e4d7f86-270e-44c8-8e6c-27c9d1badd8d}" to="{c319f392-3b4d-4f01-a0f8-50ef45168844}"/>
+        <edge from="{5eb9bd01-2f33-4a6d-bb01-4a8a6cc7469c}" id="{b9a9fa2a-52d2-42d8-8da8-0a2921ed6330}" partId="{6be248ef-32e3-43b0-b4bc-9e9cc8fae38e}" to="{3932e31f-34f7-47da-8a0d-032bec47e53c}"/>
+        <edge from="{516a356a-f5a0-4c65-9f17-8d186eeccaa2}" id="{ba8cc3fe-9fc3-48f5-be71-01f99c6b5adb}" partId="{f0f8818f-5795-4520-b544-ca04abca2521}" to="{173d8166-2d8d-4792-9187-d1f0dccb3713}"/>
+        <edge from="{f6050cf2-105d-43b6-ade2-625e690e55f8}" id="{bb2739cf-bc85-45d7-85b8-b3bb86816606}" partId="{5b7db920-6126-4e3a-a16d-2fa6c227a696}" to="{ebe51975-e81f-45a6-aa7d-ca216cc56c8b}"/>
+        <edge from="{881104c8-1859-4bd6-8bc1-fe2f5e807e98}" id="{bd3f7038-40f5-47e0-9d2c-fb8c5796fbe4}" partId="{acdc210c-e671-486e-9611-b9244c016807}" to="{9c857bb2-10b3-45e0-8271-3272e88a8bd7}"/>
+        <edge from="{164fc21c-131b-42a2-a47b-3b2d930222c6}" id="{bec2f05e-13b4-4fb2-b32e-cccfb9df0da8}" partId="{b78ff84d-5acd-4b46-a58b-564abba2c7e2}" to="{e94df7f8-d0ca-478e-aed1-25fa8d60b9fd}"/>
+        <edge from="{05c483ea-2649-48b1-80f9-f23a57335a5f}" id="{c0e943e1-7110-48a5-b6ea-58197091125f}" partId="{52d54b31-5e73-444b-8bae-2ebc51ff209e}" to="{9bf0c1e8-8582-442c-90a4-5037d7219b21}"/>
+        <edge from="{33cae706-74fd-423d-a240-a32c23657dcf}" id="{c4e74e61-c23d-4c76-b405-8575a3416335}" partId="{6986bf40-3089-4db5-bcc4-533d7ed960e3}" to="{1f0d5b25-4f21-4fd6-9142-0d56a594dd2c}"/>
+        <edge from="{6b586d8c-e5a3-4405-b346-0d07c1fc587b}" id="{c4fa0184-c3c9-4636-9796-f867e7501b66}" partId="{499562a3-978a-46b8-82ac-ad5a45c3288b}" to="{baa52d8a-ed0e-4138-bc8b-6a72054cfe95}"/>
+        <edge from="{f650f5b5-094c-41d1-b3b2-ece8be532cc1}" id="{c5351932-3680-4e36-aad4-77223c267265}" partId="{d049e679-f4f6-412e-963c-1019667439e8}" to="{e04cf7e6-1351-49fc-acd7-67ea3641d678}"/>
+        <edge from="{0f14d7ef-6d9e-42aa-afea-17e850abd25d}" id="{c536a2b7-d8b1-4f86-8502-d26360c07d9c}" partId="{f1b78adc-6fdc-4414-bab8-8e98890a21ca}" to="{0b58ba98-f204-40ee-be03-f62292b2d250}"/>
+        <edge from="{9a7851b9-a7e8-4666-a13e-5cb7a8cc09c4}" id="{c591e524-3459-48ae-8f64-10a3813d8bd5}" partId="{36c17734-cbeb-4637-822c-71f680aa5a49}" to="{2501c90c-247d-42a1-b2fb-411d88b95e3a}"/>
+        <edge from="{2015db8c-2d22-40d9-8605-073117da143a}" id="{c7db3e9f-8600-4de1-a430-250d66b6ca60}" partId="{d8f9b36d-cec1-4026-a344-16edbbc0fc13}" to="{f5692d54-1eb7-4c3c-8e99-5323bd0046d4}"/>
+        <edge from="{31a4515c-5fd8-4e34-923e-750b726395f2}" id="{c852e5dd-7db7-413e-bb86-4ccccda5a010}" partId="{d049e679-f4f6-412e-963c-1019667439e8}" to="{94362d37-639a-40ff-b191-5c0a6e19f664}"/>
+        <edge from="{c8d861a6-491b-42d4-8e07-73e5df7c019b}" id="{c95cad57-e7b1-46b6-9c21-c3e8371533ff}" partId="{c4c54ceb-2b1e-476c-8785-6fa69f041925}" to="{a3e0771b-c680-4c0c-8fcf-acd03fab6785}"/>
+        <edge from="{173d8166-2d8d-4792-9187-d1f0dccb3713}" id="{c97dcd04-4d73-4291-9367-d50068436ad4}" partId="{f0f8818f-5795-4520-b544-ca04abca2521}" to="{511c7a39-b0e7-4502-8bd3-730ae05506f0}"/>
+        <edge from="{f7c408de-4dc2-4201-8ab9-f02c04a19893}" id="{ca44b0a4-bccb-4b2b-b820-83568713cf31}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" to="{7285fcb8-4779-4e60-a474-4641c0943463}"/>
+        <edge from="{cea888e7-491c-40e5-be50-e60137d4c8a4}" id="{ca857902-cc9f-46f4-bcc1-25f734a05a30}" partId="{8fa5ba18-7e7f-4713-bd40-6ac223f08d12}" to="{80faa256-324d-4c76-b4e6-491956155230}"/>
+        <edge from="{5e465c5c-fdc5-4c81-95dc-4729f981df5c}" id="{cf988d83-2aa7-4557-836f-950120aefdf6}" partId="{1cb0fafb-2cee-4fba-b0c6-ffbe586ba374}" to="{eddf44c5-0c61-446b-a724-4456c024978a}"/>
+        <edge from="{75239010-9a3d-434c-a036-a8a59a0fe3d6}" id="{d294ab9c-f03e-4418-9b63-b38667d1547c}" partId="{3a4bc54a-f2cc-40d9-82c3-4c1acd434048}" to="{f2778fa6-19d7-47dd-afc8-1e4f355c6475}"/>
+        <edge from="{fe831613-5b6a-43f2-a789-b7c0ce027d0a}" id="{d2ff2167-9388-48dd-acf6-9a39d5365b0e}" partId="{1aca42d2-f80a-4516-a8bf-0a066935d31c}" to="{14a0dfc1-38c0-4544-b5d4-65bdbe60b622}"/>
+        <edge from="{c7bd203d-7b04-47a9-a394-d7d1f18555c4}" id="{d3533c27-bbec-46ec-b1be-e6d2b3f99483}" partId="{8fa5ba18-7e7f-4713-bd40-6ac223f08d12}" to="{491add8b-4be8-4171-b647-24334b050892}"/>
+        <edge from="{27430d2c-0651-4361-a581-d304fcd67e22}" id="{d3bdcb26-c20f-41c2-8f83-e671878868d3}" partId="{709b8a08-78b0-4a8d-9978-27eb2eda8b93}" to="{c1a57de4-5129-46f3-ace2-c662a6c079b8}"/>
+        <edge from="{6ef80ba2-4d3c-4a6e-a901-e5ddc913a272}" id="{d3dd8af5-0d64-4e0c-909f-1835e73869f2}" partId="{6be248ef-32e3-43b0-b4bc-9e9cc8fae38e}" to="{5eb9bd01-2f33-4a6d-bb01-4a8a6cc7469c}"/>
+        <edge from="{9e8b06ca-12a6-4927-bd46-4d3f479230ae}" id="{d71f8ba8-215b-4db7-a072-0aa70a39e0c6}" partId="{46304293-800c-4e01-8fc2-5135561ecc2d}" to="{bbab93bd-50a6-47f4-b608-00091b262e97}"/>
+        <edge from="{d2de90d6-ac0c-4bdd-b5e3-573960fad70c}" id="{d77a63b7-3f8d-41dd-8c7a-7d3457c15ac0}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" to="{f5c1ef85-7999-4224-845f-cfc4e07e2ef3}"/>
+        <edge from="{48417392-2b8f-49a5-a628-ab7fc4c944d4}" id="{d8424bca-429b-4191-af90-d70007c0a43f}" partId="{504953c2-aef4-4f37-be54-8f23c1f3f0fc}" to="{0582fcb5-78cf-4f27-bd85-0ccd279e8713}"/>
+        <edge from="{f7984a7e-fd12-4428-8e71-9b9e913492fb}" id="{d889afdc-6b4e-4c4b-b6ac-948322eeee04}" partId="{f1b78adc-6fdc-4414-bab8-8e98890a21ca}" to="{0f14d7ef-6d9e-42aa-afea-17e850abd25d}"/>
+        <edge from="{85cd375b-8df3-4653-855e-2a7bb3f623fe}" id="{d96f650c-54d9-4dbe-8480-9d6a2575136f}" partId="{709b8a08-78b0-4a8d-9978-27eb2eda8b93}" to="{927f0b23-db5a-49e7-8d0f-bcc811f7752e}"/>
+        <edge from="{c1052900-009d-4ab3-9734-684f91bdab25}" id="{dae048e5-f932-41ab-96b4-f1076f841b11}" partId="{01f7a857-f594-42fc-8b5d-b3bdae4dacda}" to="{6b2ab6a9-c11c-4c88-b4f9-b66df3f09e4f}"/>
+        <edge from="{eb4fb92f-f8ea-49ef-b132-ae6b72fa6ea4}" id="{dca95f1a-8dd4-4853-afd0-584b1dff30b7}" partId="{ae6741e2-ad53-4265-8b9b-310b65badd1e}" to="{651c39df-7b14-4fd3-beb3-592efcb25842}"/>
+        <edge from="{7e852b72-9d70-4dfd-9bfc-f857d3dbbb16}" id="{dde69321-743f-4891-be2f-ee41ff885d65}" partId="{acdc210c-e671-486e-9611-b9244c016807}" to="{7b4bad9a-3192-479a-bc39-3d486444fe72}"/>
+        <edge from="{14a0dfc1-38c0-4544-b5d4-65bdbe60b622}" id="{de3ae066-8d73-4237-8160-0bc1467455dc}" partId="{1aca42d2-f80a-4516-a8bf-0a066935d31c}" to="{90999c8b-a2c9-459f-847e-0fde4493fbff}"/>
+        <edge from="{511c7a39-b0e7-4502-8bd3-730ae05506f0}" id="{de62fbdf-534e-47d8-aa7b-3bcf18bb5be5}" partId="{f0f8818f-5795-4520-b544-ca04abca2521}" to="{f738f338-39e1-495e-a94e-5e914d4d5317}"/>
+        <edge from="{0434ac30-312c-4b70-984e-5a0971e9eb75}" id="{deec6450-02ce-4334-bcb4-85d645bf8123}" partId="{5b7db920-6126-4e3a-a16d-2fa6c227a696}" to="{10582ab2-cd50-47a0-bb86-9272f251af03}"/>
+        <edge from="{4029708e-b1f7-4f53-832e-d0983bfcd651}" id="{df189878-271e-4d33-b894-42a6030c9669}" partId="{1aaacb49-c100-4361-b227-422bc9c3a3b9}" to="{d36ed08a-2202-41de-9601-76d275344502}"/>
+        <edge from="{a88191b2-a7cd-4b7a-be30-d5d97c3a0b48}" id="{dfeddf9e-4dd6-4c5a-8532-d6853a397e34}" partId="{524194d6-bde6-4708-b189-16535335dc5a}" to="{74620eab-e43b-44e3-be3a-68f3838cda88}"/>
+        <edge from="{f2778fa6-19d7-47dd-afc8-1e4f355c6475}" id="{e04fbabf-c764-45e0-8cab-67773b7c486d}" partId="{3a4bc54a-f2cc-40d9-82c3-4c1acd434048}" to="{6cbb96e6-231d-4ac1-b9ec-75b258b16a1e}"/>
+        <edge from="{408119ac-6fc0-40f5-b60c-99b7cc9517ae}" id="{e0796b97-0c3a-4b61-95cf-16bb0d8a626c}" partId="{13988a54-a274-49e0-aaf3-e5de769e18c1}" to="{17408e0e-5237-45ce-8f5c-de1034fcf23c}"/>
+        <edge from="{528a1707-5b77-4963-a34e-db9dba558205}" id="{e0d729c0-947d-4023-b868-b867cc109a77}" partId="{6986bf40-3089-4db5-bcc4-533d7ed960e3}" to="{33cae706-74fd-423d-a240-a32c23657dcf}"/>
+        <edge from="{61ba80ab-f761-4889-a07e-7b2b7ff91e5c}" id="{e0dfaeef-2435-49e2-a668-778a65525748}" partId="{36c17734-cbeb-4637-822c-71f680aa5a49}" to="{9a7851b9-a7e8-4666-a13e-5cb7a8cc09c4}"/>
+        <edge from="{d2f4e68c-bc10-46d3-b82c-aadf00fa23e2}" id="{e17b8625-9949-45ed-a25b-6856ea9c2aa4}" partId="{499562a3-978a-46b8-82ac-ad5a45c3288b}" to="{6b586d8c-e5a3-4405-b346-0d07c1fc587b}"/>
+        <edge from="{e5a7a6e8-c4de-4ea6-a175-93b87b709bee}" id="{e1eaa489-de41-4b48-86cc-2b8fd2c4b854}" partId="{a96bc03c-93f9-4cfd-abd4-e8d135fc8b49}" to="{6c9d6544-ff34-4259-8d31-72393a4d7629}"/>
+        <edge from="{0b4f4946-8ff1-4efe-bdfe-0b611af6a655}" id="{e22500cd-ea80-475c-a2ca-f371cf78694c}" partId="{b5812967-d429-4214-a11c-f04918089461}" to="{8b37e76a-099c-4b5d-af5c-26c1fe4f55ab}"/>
+        <edge from="{8dc941af-cffe-4f7b-aa0a-b0db5a0e5e1d}" id="{e24483fd-0908-43e6-81ba-745940875182}" partId="{da7592eb-3353-4084-bff2-f31d92be4236}" to="{e79795d5-e758-4acb-8559-7f1033c9b02f}"/>
+        <edge from="{a9746f2b-b2ba-40a7-a405-d34b982c683f}" id="{e2f7b457-07f5-4cd3-a337-2e0443ef289d}" partId="{50b2e680-31ba-4d62-9c93-10c51edea1bf}" to="{18a7f970-0d2e-4d47-a307-32c94a9105a3}"/>
+        <edge from="{7b04a282-03d9-4a06-bec2-b48417956ce9}" id="{e3b99e51-e9f3-4813-99a3-bce3b61180c2}" partId="{acdc210c-e671-486e-9611-b9244c016807}" to="{881104c8-1859-4bd6-8bc1-fe2f5e807e98}"/>
+        <edge from="{021bd224-eaac-49a1-a91f-0f2406f26f8a}" id="{e4d0eaf5-34e2-40d1-80d1-45206f32af10}" partId="{8f49f8aa-cb67-4955-9063-92e33042cb02}" to="{e5afd1fe-e4a7-4e2a-90cf-1cb2a55fe07e}"/>
+        <edge from="{09f3f5fa-46f1-476c-aa35-3df95debd16f}" id="{e6181a81-6104-43cc-8385-b5d071f5a8d0}" partId="{1716cb6d-01ed-4522-9ea3-7470418c6b51}" to="{1207414b-6386-42f4-b3b4-e774497e4fa9}"/>
+        <edge from="{1f0d5b25-4f21-4fd6-9142-0d56a594dd2c}" id="{e76b9c52-1b59-443d-9387-c4b288bcb5e3}" partId="{6986bf40-3089-4db5-bcc4-533d7ed960e3}" to="{ee43d10c-d4f1-4315-a3c2-618c2ce40d6a}"/>
+        <edge from="{76a160cd-60d5-4010-bd9a-6032c97f67b8}" id="{e8fc682c-43b3-48f3-bec6-36ea99b084ed}" partId="{bb6e0337-94a1-4b8b-8894-9f40dc5577b5}" to="{aefc096e-5901-425f-a831-6a0ddbd50399}"/>
+        <edge from="{7351a5f6-983d-4fdf-83c9-be734363f2ca}" id="{e93802a7-1cc5-4dcd-a866-8d4466c8bfe6}" partId="{deb52d1d-f439-4144-9284-6b990b239ae5}" to="{84db1f93-1858-4a96-be7f-7a383a1430df}"/>
+        <edge from="{ebe6c9ed-8cd5-4d44-acda-3846acf13ec1}" id="{ed7ce0f7-2dd3-454c-80a5-c363d70babd9}" partId="{5b7db920-6126-4e3a-a16d-2fa6c227a696}" to="{f6050cf2-105d-43b6-ade2-625e690e55f8}"/>
+        <edge from="{8e43cbd3-2aa9-4265-95b8-92056c4c4737}" id="{effc5af7-3b9e-422f-9fa3-d9036143dfb9}" partId="{534e034a-1fef-4d7d-82e4-12f7b8e82728}" to="{b1d0b918-225b-4399-a8d8-e90b84b5f5be}"/>
+        <edge from="{7057282d-6ae5-4d7e-b10e-85ae69c7f72a}" id="{f09ef052-777c-4e4d-9726-623e7b5630f8}" partId="{62493532-0802-4e69-af81-89a1e382185d}" to="{f1d52a81-d771-49f4-96f7-079e891415be}"/>
+        <edge from="{dc0aaf45-eb00-49b6-8e81-fa979245ac09}" id="{f2843cac-a688-4cf4-a8bf-cac168d7f9f3}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" to="{40b1d9b4-f4ee-4c7d-8172-a9e0fc4d5654}"/>
+        <edge from="{0711915a-a413-42b5-8022-35668c45d39b}" id="{f2c70830-462e-4577-87a0-53f44a9bec08}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" to="{9d65e303-67cf-4bbb-ab6a-09120b410c7b}"/>
+        <edge from="{743d083e-3e96-4eb7-9c5f-0f0cee310915}" id="{f3678ad5-32fd-4ff2-a2cf-2d04e4633cca}" partId="{1cb0fafb-2cee-4fba-b0c6-ffbe586ba374}" to="{73951d38-c2aa-4577-927b-7e9429d1f0db}"/>
+        <edge from="{5399b1af-6473-4df5-96cc-13e6e28784c1}" id="{f389bf5a-f49b-42a8-91c3-691ef9b55456}" partId="{3a4bc54a-f2cc-40d9-82c3-4c1acd434048}" to="{75239010-9a3d-434c-a036-a8a59a0fe3d6}"/>
+        <edge from="{baa52d8a-ed0e-4138-bc8b-6a72054cfe95}" id="{f3fefe97-5b55-4f5b-a3f8-8cc92361df88}" partId="{499562a3-978a-46b8-82ac-ad5a45c3288b}" to="{a3e169ff-fc5f-4dcd-b7c5-0a14fa29b73e}"/>
+        <edge from="{fd8dd98f-7c73-48e4-bdf0-904f2e2271e5}" id="{f4ef9157-7082-46aa-816b-3ab6932c871b}" partId="{52d54b31-5e73-444b-8bae-2ebc51ff209e}" to="{9530cb12-6d41-4bd3-8175-1ba24943e21b}"/>
+        <edge from="{90999c8b-a2c9-459f-847e-0fde4493fbff}" id="{f6b257cd-db2e-4bb4-8c4e-35d87ab7f8f6}" partId="{1aca42d2-f80a-4516-a8bf-0a066935d31c}" to="{39e3219e-a74d-4dd0-bedd-eb4fa010f34a}"/>
+        <edge from="{5064c6c5-783a-44e5-8e70-49c8c9cc2416}" id="{f7e36eab-500f-4a28-902b-5a245aef422b}" partId="{534e034a-1fef-4d7d-82e4-12f7b8e82728}" to="{593f1c87-b152-41e0-98b6-07acf061f646}"/>
+        <edge from="{35bf1780-fe7c-46dd-a93e-99896e097cf2}" id="{fa61de23-5291-4464-81cb-802682d6a1c5}" partId="{700ce49d-5978-4ae1-847e-404fdc912625}" to="{24b1db2c-8e14-4670-a523-bd31ab7758aa}"/>
+        <edge from="{6394e5cc-a367-4664-a9af-753d41b82ba6}" id="{faf0fae4-1daa-49e5-985f-24940e3324e9}" partId="{bb6e0337-94a1-4b8b-8894-9f40dc5577b5}" to="{f7c9ef1b-11cc-4f1e-b217-322279b063b3}"/>
+        <edge from="{0a8e8fb2-9858-49d2-8686-6ed728dccbc2}" id="{fbb032f0-d170-42cb-a5fc-0a57fd06a90f}" partId="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" to="{d2de90d6-ac0c-4bdd-b5e3-573960fad70c}"/>
+        <edge from="{6b2ab6a9-c11c-4c88-b4f9-b66df3f09e4f}" id="{fbd20729-2f29-49fa-beac-66b2a0f7a406}" partId="{01f7a857-f594-42fc-8b5d-b3bdae4dacda}" to="{0bd7865d-7f8d-46cb-a1ba-4ed601bf62fe}"/>
+        <edge from="{a3e0771b-c680-4c0c-8fcf-acd03fab6785}" id="{fc556933-a669-4975-9b1f-ebebc0b4b3de}" partId="{c4c54ceb-2b1e-476c-8785-6fa69f041925}" to="{e3a311f1-ab14-4e80-80dc-9f882721d9a8}"/>
+        <edge from="{a370ab3d-5136-42d7-9aa9-ac3bed89d137}" id="{fe75bbf6-fe0e-455c-9af5-2af84da68e3b}" partId="{e47c18bd-1154-48f4-96d5-954787c54562}" to="{ce8a93e4-e574-4e93-82b1-fbd2ca77ef0f}"/>
+    </edges>
+    <parts>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{01f7a857-f594-42fc-8b5d-b3bdae4dacda}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{0564a8bf-85c6-4bd7-bad1-8cb70a2bacd9}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#939297" disabled="false" id="{092b0f10-67c1-4032-9c49-168067836057}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#939297" disabled="false" id="{13988a54-a274-49e0-aaf3-e5de769e18c1}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{1716cb6d-01ed-4522-9ea3-7470418c6b51}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{1aaacb49-c100-4361-b227-422bc9c3a3b9}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{1aca42d2-f80a-4516-a8bf-0a066935d31c}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{1b950787-9a25-4f55-9d21-9d6d12eaff28}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{1cb0fafb-2cee-4fba-b0c6-ffbe586ba374}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{2e4d7f86-270e-44c8-8e6c-27c9d1badd8d}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{36c17734-cbeb-4637-822c-71f680aa5a49}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{389a356e-22e6-4172-8c0d-1b835462d7b5}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{3a4bc54a-f2cc-40d9-82c3-4c1acd434048}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{3c4883ad-20db-4f7c-a728-e11bc72de231}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{46304293-800c-4e01-8fc2-5135561ecc2d}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{499562a3-978a-46b8-82ac-ad5a45c3288b}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{4c083326-6b05-4a2d-85ce-576dc7dd5c34}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{504953c2-aef4-4f37-be54-8f23c1f3f0fc}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#939297" disabled="false" id="{50b2e680-31ba-4d62-9c93-10c51edea1bf}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{524194d6-bde6-4708-b189-16535335dc5a}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#939297" disabled="false" id="{52d54b31-5e73-444b-8bae-2ebc51ff209e}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{534e034a-1fef-4d7d-82e4-12f7b8e82728}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{57dbdd98-cd36-4a18-a1b9-a22884c6b343}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{5b7db920-6126-4e3a-a16d-2fa6c227a696}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{5e45c98d-9283-4386-b0ae-e6a8f85f2dad}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{62493532-0802-4e69-af81-89a1e382185d}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{6986bf40-3089-4db5-bcc4-533d7ed960e3}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{6be248ef-32e3-43b0-b4bc-9e9cc8fae38e}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#939297" disabled="false" id="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{700ce49d-5978-4ae1-847e-404fdc912625}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{709b8a08-78b0-4a8d-9978-27eb2eda8b93}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#939297" disabled="false" id="{78887fc7-dcfb-4d38-9eac-f8beaa99dce3}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{80845e66-2299-48ca-8cbf-77b55a536c0c}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{87fbd826-5677-48f5-83d3-8091d48ef8d7}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{8f49f8aa-cb67-4955-9063-92e33042cb02}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{8fa5ba18-7e7f-4713-bd40-6ac223f08d12}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{9279a14a-691a-436c-ae9e-efd74fa28300}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{9538c8a9-1e82-4d5a-8e0e-b7a0d701c5f9}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{9b4be491-12d5-4eea-8ee9-87dff887b292}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{a96bc03c-93f9-4cfd-abd4-e8d135fc8b49}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{acdc210c-e671-486e-9611-b9244c016807}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{ae6741e2-ad53-4265-8b9b-310b65badd1e}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{b5812967-d429-4214-a11c-f04918089461}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{b78ff84d-5acd-4b46-a58b-564abba2c7e2}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{bb6e0337-94a1-4b8b-8894-9f40dc5577b5}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{c3e8e9c2-eb6f-4d7f-8f72-6d4cd3003c26}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{c4ac9d40-ad41-4b17-8098-04fc2dec48a2}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#939297" disabled="false" id="{c4c54ceb-2b1e-476c-8785-6fa69f041925}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{d049e679-f4f6-412e-963c-1019667439e8}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{d8f9b36d-cec1-4026-a344-16edbbc0fc13}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" disabled="false" id="{da7592eb-3353-4084-bff2-f31d92be4236}" locked="false" rounded="false" subdived="false" target="CutFace" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{deb52d1d-f439-4144-9284-6b990b239ae5}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{e47c18bd-1154-48f4-96d5-954787c54562}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{f0f8818f-5795-4520-b544-ca04abca2521}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+        <part chamfered="false" color="#a4f98d" cutFace="{da7592eb-3353-4084-bff2-f31d92be4236}" disabled="false" id="{f1b78adc-6fdc-4414-bab8-8e98890a21ca}" locked="false" rounded="false" subdived="false" visible="true" xMirrored="false"/>
+    </parts>
+    <components>
+        <component combineMode="Normal" expanded="false" id="{501e951b-cea7-4dc1-9f7e-89c464c11bb3}" linkData="{da7592eb-3353-4084-bff2-f31d92be4236}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{c8ac259f-5de6-454e-90be-4bbd8269808c}" linkData="{6f0945eb-96e8-4a0b-8eea-55fa96a2561f}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{49e68887-892b-4525-8763-a574313a87f3}" linkData="{50b2e680-31ba-4d62-9c93-10c51edea1bf}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{46a52d46-1320-4d54-8716-656192fcce32}" linkData="{acdc210c-e671-486e-9611-b9244c016807}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{f3b5c2f0-7190-496e-a3b1-45221cd9cddd}" linkData="{6986bf40-3089-4db5-bcc4-533d7ed960e3}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{87e47914-242e-47e1-aa23-d8fc87401a1e}" linkData="{78887fc7-dcfb-4d38-9eac-f8beaa99dce3}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{44c5c761-8483-40cb-9b15-8d904e233115}" linkData="{deb52d1d-f439-4144-9284-6b990b239ae5}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{37232b01-fdc1-4f59-a1d9-4921f4dd82e7}" linkData="{8f49f8aa-cb67-4955-9063-92e33042cb02}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{3c2fcff5-1412-41d8-9615-f8bb0c97d5dd}" linkData="{504953c2-aef4-4f37-be54-8f23c1f3f0fc}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{6de4b520-3bb4-4391-a997-0d9b9a6bc446}" linkData="{2e4d7f86-270e-44c8-8e6c-27c9d1badd8d}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{ec80b776-20d0-4508-93d7-ba911d250fdf}" linkData="{1aaacb49-c100-4361-b227-422bc9c3a3b9}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{4d72e4e9-6432-4d1f-8b82-01a8949809e4}" linkData="{52d54b31-5e73-444b-8bae-2ebc51ff209e}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{3e67b71b-5e85-4401-8f46-c241c6381d8b}" linkData="{6be248ef-32e3-43b0-b4bc-9e9cc8fae38e}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{51764c7c-7118-47ca-a70e-08607cd54765}" linkData="{709b8a08-78b0-4a8d-9978-27eb2eda8b93}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{40708ab9-7391-4735-83af-dad392e26f04}" linkData="{57dbdd98-cd36-4a18-a1b9-a22884c6b343}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{e2866f4f-a2c5-45a4-a8f7-8d5dbf575700}" linkData="{36c17734-cbeb-4637-822c-71f680aa5a49}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{8aff815a-3592-4ea1-bee5-79b110a00686}" linkData="{c3e8e9c2-eb6f-4d7f-8f72-6d4cd3003c26}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{ddb43b75-a690-475c-acf9-7c6d7794e3e7}" linkData="{4c083326-6b05-4a2d-85ce-576dc7dd5c34}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{32815245-bcca-4d29-81b9-be222920f67b}" linkData="{499562a3-978a-46b8-82ac-ad5a45c3288b}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{ec533680-f287-4914-8b85-536312088cb8}" linkData="{c4c54ceb-2b1e-476c-8785-6fa69f041925}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{f043c3d8-4ede-4ecf-9a21-0afb9efcd520}" linkData="{3c4883ad-20db-4f7c-a728-e11bc72de231}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{658043b1-0b8f-4c9a-aca8-d1fd44997995}" linkData="{d8f9b36d-cec1-4026-a344-16edbbc0fc13}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{bcccd4d5-ae07-4ea2-9f33-8b8e8d8fdfd3}" linkData="{3a4bc54a-f2cc-40d9-82c3-4c1acd434048}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{ad417335-eeb9-45e8-acf1-10c89da5e4a0}" linkData="{5b7db920-6126-4e3a-a16d-2fa6c227a696}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{a3376bed-fd56-4d11-b0e6-e280bda88094}" linkData="{f1b78adc-6fdc-4414-bab8-8e98890a21ca}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{2e0fe333-6638-4e95-89d5-862055009502}" linkData="{d049e679-f4f6-412e-963c-1019667439e8}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{792df41a-a26a-4555-bebb-d8ff32d4804f}" linkData="{1cb0fafb-2cee-4fba-b0c6-ffbe586ba374}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{c4b28529-4d95-44dc-be3b-0ec6a67dfe9a}" linkData="{092b0f10-67c1-4032-9c49-168067836057}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{792a323a-8a14-4ee8-80e7-171cb263a6dd}" linkData="{534e034a-1fef-4d7d-82e4-12f7b8e82728}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{506c7834-d834-4af2-84cc-3566d0131327}" linkData="{e47c18bd-1154-48f4-96d5-954787c54562}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{eb8defd0-5d93-4676-95ec-5cda66da741e}" linkData="{46304293-800c-4e01-8fc2-5135561ecc2d}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{e8bd263c-3272-4e1a-9bbf-799ba60d1d1c}" linkData="{0564a8bf-85c6-4bd7-bad1-8cb70a2bacd9}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{a853e0f4-c525-40e3-b336-86570ad6af6d}" linkData="{9279a14a-691a-436c-ae9e-efd74fa28300}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{04bc8afe-1bb7-431d-a1c6-a9c255b67ae8}" linkData="{9b4be491-12d5-4eea-8ee9-87dff887b292}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{58545e99-3d7f-443f-8e60-0e96a69f5586}" linkData="{1aca42d2-f80a-4516-a8bf-0a066935d31c}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{6801e8c9-4494-48da-91cc-cf33b81811e4}" linkData="{a96bc03c-93f9-4cfd-abd4-e8d135fc8b49}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{d38da8c4-2f06-4c8c-8ec9-51aaa244697b}" linkData="{b78ff84d-5acd-4b46-a58b-564abba2c7e2}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{ad223702-121e-4855-9dc8-614d879292a1}" linkData="{f0f8818f-5795-4520-b544-ca04abca2521}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{0cf27234-4529-49b8-8729-4a515c190534}" linkData="{700ce49d-5978-4ae1-847e-404fdc912625}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{fa27ae40-b168-4860-bd1e-1dc356fade5d}" linkData="{8fa5ba18-7e7f-4713-bd40-6ac223f08d12}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{63785235-da1a-4da7-a896-1a91359ae978}" linkData="{ae6741e2-ad53-4265-8b9b-310b65badd1e}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{5b2932ca-f7ef-430f-9731-ffc91c0f3b75}" linkData="{389a356e-22e6-4172-8c0d-1b835462d7b5}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{240f4df6-3b56-4867-bc12-178171b1990f}" linkData="{9538c8a9-1e82-4d5a-8e0e-b7a0d701c5f9}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{1ab51bc8-5e0d-4f6c-b90e-1179f0dc8068}" linkData="{13988a54-a274-49e0-aaf3-e5de769e18c1}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{5c618c7f-32eb-4e6f-9dfb-59b9458597ca}" linkData="{5e45c98d-9283-4386-b0ae-e6a8f85f2dad}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{f9dbb17f-89e8-4fb4-bbe8-e336da9fd57d}" linkData="{524194d6-bde6-4708-b189-16535335dc5a}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{7f5cd199-2903-48c7-823c-8f5824fc6ead}" linkData="{1b950787-9a25-4f55-9d21-9d6d12eaff28}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{95f7cee9-c33c-48f1-9386-c16e6bcb78f9}" linkData="{87fbd826-5677-48f5-83d3-8091d48ef8d7}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{e52ce4f8-7c3f-4741-8310-a2e5b5afde0e}" linkData="{80845e66-2299-48ca-8cbf-77b55a536c0c}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{b4ba271a-3e7f-44fe-86d4-dcabf6bd95da}" linkData="{c4ac9d40-ad41-4b17-8098-04fc2dec48a2}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{279a974e-5bea-4bfe-a3a4-462aa30d9c65}" linkData="{1716cb6d-01ed-4522-9ea3-7470418c6b51}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{e7c16696-24ee-43bc-9258-88bada7af5d6}" linkData="{bb6e0337-94a1-4b8b-8894-9f40dc5577b5}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{79d7a2f5-bcb3-4fe2-86b0-c4145b0b40e9}" linkData="{62493532-0802-4e69-af81-89a1e382185d}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{40c08780-2e4b-4711-9912-7e2b88e3afd3}" linkData="{b5812967-d429-4214-a11c-f04918089461}" linkDataType="partId"/>
+        <component combineMode="Normal" expanded="false" id="{1c05b9c2-d958-42b1-ac29-a3c38de9e959}" linkData="{01f7a857-f594-42fc-8b5d-b3bdae4dacda}" linkDataType="partId"/>
+    </components>
+    <materials/>
+    <poses/>
+    <motions/>
+</canvas>
+var SUBDIVED = document.createCheckInput("Subdived", false);
+var MAX_RADIUS_OFFSET = document.createFloatInput("Max Radius Offset", 0.10, -1.0, 1.0);
+var MAX_ORIGIN_OFFSET = document.createFloatInput("Max Origin Offset", 0.47, -1.0, 1.0);
+var TREE_HEIGHT = document.createFloatInput("Height", 0.85, 0.1, 1.0);
+var TRUNK_RADIUS = document.createFloatInput("Trunk Radius", 0.02, 0.01, 0.2);
+var TRUNK_SEGMENTS = document.createIntInput("Trunk Segments", 15, 2, 30);
+var TRUNK_COLOR = document.createColorInput("Trunk Color", "#939297");
+var BRANCH_MIN_ANGLE = document.createFloatInput("Branch Min Angle", 10.72, 8, 30);
+var BRANCH_MAX_ANGLE = document.createFloatInput("Branch Max Angle", 58.81, 50, 75);
+var MAX_BRANCHES_PER_GROWTH = document.createIntInput("Max Branches", 7, 1, 7);
+var BRANCH_LENGTH_MIN_RATIO = document.createFloatInput("Branch Length Min Ratio", 0.24, 0.2, 0.9);
+var BRANCH_LENGTH_MAX_RATIO = document.createFloatInput("Branch Length Max Ratio", 0.78, 0.2, 0.9);
+var LEAF_MIN_LENGTH = document.createFloatInput("Leaf Min Length", 0.05, 0.005, 0.1);
+var LEAF_MAX_LENGTH = document.createFloatInput("Leaf Max Length", 0.08, 0.005, 0.2);
+var LEAF_SEGMENTS = document.createIntInput("Leaf Segments", 5, 3, 6);
+var LEAF_COLOR = document.createColorInput("Leaf Color", "#58834b");
+
+var X = new THREE.Vector3( 1, 0, 0 );
+var Y = new THREE.Vector3( 0, 1, 0 );
+
+function createNode(part, origin, radius)
+{
+    var node = document.createNode(part);
+    document.setAttribute(node, "x", origin.getComponent(0));
+    document.setAttribute(node, "y", origin.getComponent(1));
+    document.setAttribute(node, "z", origin.getComponent(2));
+    document.setAttribute(node, "radius", radius);
+    return node;
+}
+
+THREE.Vector3.prototype.random = function (maxOffset)
+{
+    for (var i = 0; i < 3; ++i)
+        this.setComponent(i, this.getComponent(i) + maxOffset * Math.random());
+    return this;
+};
+
+function randInRange(min, max)
+{
+    if (min > max) {
+        var tmp = min;
+        min = max;
+        max = tmp;
+    }
+    return (min + (max - min) * Math.random());
+}
+
+function createLeafCutFace()
+{
+    var component = document.createComponent();
+    var part = document.createPart(component);
+    document.setAttribute(part, "target", "CutFace");
+    var predefinesCutFace = [
+        {radius:"0.005", x:"0.314637", y:"0.336525", z:"0.713406"},
+        {radius:"0.005", x:"0.343365", y:"0.340629", z:"0.713406"},
+        {radius:"0.005", x:"0.377565", y:"0.340629", z:"0.713406"},
+        {radius:"0.0159439", x:"0.402189", y:"0.341997", z:"0.713406"},
+        {radius:"0.005", x:"0.440492", y:"0.329685", z:"0.713406"},
+        {radius:"0.005", x:"0.473324", y:"0.317373", z:"0.713406"},
+    ];
+    var previousNode = undefined;
+    for (var i = 0; i < predefinesCutFace.length; ++i) {
+        var node = createNode(part,
+            new THREE.Vector3(parseFloat(predefinesCutFace[i]["x"]),
+                parseFloat(predefinesCutFace[i]["y"]),
+                parseFloat(predefinesCutFace[i]["z"])),
+            parseFloat(predefinesCutFace[i]["radius"]));
+        if (undefined != previousNode)
+            document.connect(previousNode, node);
+        previousNode = node;
+    }
+    return part;
+}
+
+function getRandChildDirection(parentDirection)
+{
+    var rotationAxis = parentDirection.clone().cross(X);
+    var degree = randInRange(BRANCH_MIN_ANGLE, BRANCH_MAX_ANGLE);
+    var branchRotateQuaternion = new THREE.Quaternion();
+    branchRotateQuaternion.setFromAxisAngle(rotationAxis, degree * (Math.PI / 180));
+    var rotatedDirection = parentDirection.clone().applyQuaternion(branchRotateQuaternion);
+
+    var distributeQuaternion = new THREE.Quaternion();
+    distributeQuaternion.setFromAxisAngle(Y, 360 * Math.random() * (Math.PI / 180));
+    rotatedDirection = rotatedDirection.applyQuaternion(distributeQuaternion);
+
+    return rotatedDirection;
+}
+
+var CUTFACE_PART_ID = document.attribute(createLeafCutFace(), "id");
+
+function createLeaf(leafRootPosition, parentDirection)
+{
+    var direction = getRandChildDirection(parentDirection);
+    var component = document.createComponent();
+    var part = document.createPart(component);
+    document.setAttribute(part, "color", LEAF_COLOR);
+    document.setAttribute(part, "cutFace", CUTFACE_PART_ID);
+    var length = randInRange(LEAF_MIN_LENGTH, LEAF_MAX_LENGTH);
+    var segments = LEAF_SEGMENTS;
+    var maxRadius = length / 3;
+    var toPosition = leafRootPosition.clone().add(direction.clone().multiplyScalar(length));
+    var previousNode = undefined;
+    for (var i = 0; i < segments; ++i) {
+        var alpha = (i + 0.0) / segments;
+        var origin = leafRootPosition.clone().lerp(toPosition, alpha);
+        var radiusFactor = 1.0 - 2 * Math.abs(alpha - 0.3);
+        var radius = maxRadius * radiusFactor;
+        var node = createNode(part, origin, radius);
+        if (undefined != previousNode)
+            document.connect(previousNode, node);
+        previousNode = node;
+    }
+}
+
+function createBranch(branchRootPosition, radius, length, segments, parentDirection, maxRadius)
+{
+    var rotatedDirection = getRandChildDirection(parentDirection);
+    var branchEndPosition = branchRootPosition.clone().add(rotatedDirection.multiplyScalar(length));
+    createTrunk(branchRootPosition, radius, branchEndPosition, segments, maxRadius);
+}
+
+function shouldGrowBranch(alpha, alreadyGrowedNum)
+{
+    var factor = alpha * Math.random();
+    if (factor > 0.5 && factor < 0.8) {
+        if (alreadyGrowedNum > 0)
+            return true;
+        if (Math.random() > 0.5)
+            return true;
+    }
+    return false;
+}
+
+function shouldGrowLeaf(alreadyGrowedNum)
+{
+    var factor = Math.random();
+    if (factor > 0.5) {
+        if (alreadyGrowedNum > 0)
+            return true;
+        if (Math.random() > 0.5)
+            return true;
+    }
+    return false;
+}
+
+function createTrunk(fromPosition, fromRadius, toPosition, segments, maxRadius)
+{
+    var component = document.createComponent();
+    var part = document.createPart(component);
+    if (SUBDIVED)
+        document.setAttribute(part, "subdived", "true");
+    document.setAttribute(part, "color", TRUNK_COLOR);
+    var previousNode = undefined;
+    var toRadius = fromRadius * 0.2;
+    var direction = toPosition.clone().sub(fromPosition).normalize();
+    var length = fromPosition.distanceTo(toPosition);
+    for (var i = 0; i < segments; ++i) {
+        var alpha = (i + 0.0) / segments;
+        var origin = fromPosition.clone().lerp(toPosition, alpha);
+        var radius = fromRadius * (1.0 - alpha) + toRadius * alpha;
+        radius += radius * MAX_RADIUS_OFFSET * Math.random();
+        if (undefined != maxRadius && radius > maxRadius)
+            radius = maxRadius;
+        var oldY = origin.y;
+        origin.random(length * 0.1 * MAX_ORIGIN_OFFSET);
+        origin.setY(oldY + radius * 0.5 * Math.random());
+        if (undefined != maxRadius && i == 0)
+            origin = fromPosition;
+        var node = createNode(part, origin, radius);
+        if (undefined != previousNode)
+            document.connect(previousNode, node);
+
+        var maxBranches = MAX_BRANCHES_PER_GROWTH * Math.random();
+        var alreadyGrowedBranchNum = 0;
+        var alreadyGrowedLeafNum = 0;
+        for (var j = 0; j < maxBranches; ++j) {
+            if (shouldGrowBranch(alpha, alreadyGrowedBranchNum)) {
+                var branchLength = length * randInRange(BRANCH_LENGTH_MIN_RATIO, BRANCH_LENGTH_MAX_RATIO);
+                var branchRadius = radius * 0.5;
+                var branchSegments = segments * (branchLength / length);
+                if (branchSegments >= 3 && branchRadius > TRUNK_RADIUS / 20) {
+                    createBranch(origin, branchRadius, branchLength, branchSegments, direction, radius);
+                    ++alreadyGrowedBranchNum;
+                }
+            }
+            if (undefined != maxRadius && shouldGrowLeaf(alreadyGrowedLeafNum)) {
+                createLeaf(origin, direction);
+                ++alreadyGrowedLeafNum;
+            }
+        }
+        previousNode = node;
+    }
+}
+
+var treeRootPosition = new THREE.Vector3(0.5, 1.0, 1.0);
+var treeTopPosition = treeRootPosition.clone();
+treeTopPosition.add((new THREE.Vector3(0, -1, 0)).multiplyScalar(TREE_HEIGHT));
+
+document.setAttribute(document.canvas, "originX", 0.506767);
+document.setAttribute(document.canvas, "originY", 0.615943);
+document.setAttribute(document.canvas, "originZ", 1.08543);
+
+createTrunk(treeRootPosition, TRUNK_RADIUS, treeTopPosition, TRUNK_SEGMENTS);
+<?xml version="1.0" encoding="UTF-8"?>
+<variables>
+    <variable name="Branch Length Max Ratio" defaultValue="0.78" input="Float" maxValue="0.9" minValue="0.2" value="0.78"/>
+    <variable name="Branch Length Min Ratio" defaultValue="0.24" input="Float" maxValue="0.9" minValue="0.2" value="0.24"/>
+    <variable name="Branch Max Angle" defaultValue="58.81" input="Float" maxValue="75" minValue="50" value="58.81"/>
+    <variable name="Branch Min Angle" defaultValue="10.72" input="Float" maxValue="30" minValue="8" value="10.72"/>
+    <variable name="Height" defaultValue="0.85" input="Float" maxValue="1" minValue="0.1" value="0.85"/>
+    <variable name="Leaf Color" defaultValue="#58834b" input="Color" value="#a4f98d"/>
+    <variable name="Leaf Max Length" defaultValue="0.08" input="Float" maxValue="0.2" minValue="0.005" value="0.08"/>
+    <variable name="Leaf Min Length" defaultValue="0.05" input="Float" maxValue="0.1" minValue="0.005" value="0.04"/>
+    <variable name="Leaf Segments" defaultValue="5" input="Int" maxValue="6" minValue="3" value="5"/>
+    <variable name="Max Branches" defaultValue="7" input="Int" maxValue="7" minValue="1" value="7"/>
+    <variable name="Max Origin Offset" defaultValue="0.47" input="Float" maxValue="1" minValue="-1" value="0.47"/>
+    <variable name="Max Radius Offset" defaultValue="0.1" input="Float" maxValue="1" minValue="-1" value="0.1"/>
+    <variable name="Subdived" defaultValue="false" input="Check" value="false"/>
+    <variable name="Trunk Color" defaultValue="#939297" input="Color" value="#939297"/>
+    <variable name="Trunk Radius" defaultValue="0.02" input="Float" maxValue="0.2" minValue="0.01" value="0.02"/>
+    <variable name="Trunk Segments" defaultValue="15" input="Int" maxValue="30" minValue="2" value="15"/>
+</variables>
diff --git a/src/document.cpp b/src/document.cpp
index 27466535..de3830b3 100644
--- a/src/document.cpp
+++ b/src/document.cpp
@@ -16,6 +16,7 @@
 #include "materialpreviewsgenerator.h"
 #include "motionsgenerator.h"
 #include "skeletonside.h"
+#include "scriptrunner.h"
 #include "mousepicker.h"
 #include "imageforever.h"
 #include "contourtopartconverter.h"
@@ -69,6 +70,8 @@ Document::Document() :
     m_motionsGenerator(nullptr),
     m_meshGenerationId(0),
     m_nextMeshGenerationId(1),
+    m_scriptRunner(nullptr),
+    m_isScriptResultObsolete(false),
     m_mousePicker(nullptr),
     m_isMouseTargetResultObsolete(false),
     m_paintMode(PaintMode::None),
@@ -1866,6 +1869,15 @@ void Document::silentReset()
     removeRigResults();
 }
 
+void Document::silentResetScript()
+{
+    m_script.clear();
+    m_mergedVariables.clear();
+    m_cachedVariables.clear();
+    m_scriptError.clear();
+    m_scriptConsoleLog.clear();
+}
+
 void Document::reset()
 {
     silentReset();
@@ -1873,6 +1885,16 @@ void Document::reset()
     emit skeletonChanged();
 }
 
+void Document::resetScript()
+{
+    silentResetScript();
+    emit cleanupScript();
+    emit scriptChanged();
+    emit scriptErrorChanged();
+    emit scriptConsoleLogChanged();
+    emit mergedVaraiblesChanged();
+}
+
 void Document::fromSnapshot(const Snapshot &snapshot)
 {
     reset();
@@ -3857,6 +3879,194 @@ void Document::copyNodes(std::set<QUuid> nodeIdSet) const
     clipboard->setText(snapshotXml);
 }
 
+void Document::initScript(const QString &script)
+{
+    m_script = script;
+    emit scriptModifiedFromExternal();
+}
+
+void Document::updateScript(const QString &script)
+{
+    if (m_script == script)
+        return;
+    
+    m_script = script;
+    emit scriptChanged();
+}
+
+void Document::updateVariable(const QString &name, const std::map<QString, QString> &value)
+{
+    bool needRunScript = false;
+    auto variable = m_cachedVariables.find(name);
+    if (variable == m_cachedVariables.end()) {
+        m_cachedVariables[name] = value;
+        needRunScript = true;
+    } else if (variable->second != value) {
+        variable->second = value;
+    } else {
+        return;
+    }
+    m_mergedVariables[name] = value;
+    emit mergedVaraiblesChanged();
+    if (needRunScript)
+        runScript();
+}
+
+void Document::updateVariableValue(const QString &name, const QString &value)
+{
+    auto variable = m_cachedVariables.find(name);
+    if (variable == m_cachedVariables.end()) {
+        qDebug() << "Update a nonexist variable:" << name << "value:" << value;
+        return;
+    }
+    auto &variableValue = variable->second["value"];
+    if (variableValue == value)
+        return;
+    variableValue = value;
+    m_mergedVariables[name] = variable->second;
+    runScript();
+}
+
+bool Document::updateDefaultVariables(const std::map<QString, std::map<QString, QString>> &defaultVariables)
+{
+    bool updated = false;
+    for (const auto &it: defaultVariables) {
+        auto findMergedVariable = m_mergedVariables.find(it.first);
+        if (findMergedVariable != m_mergedVariables.end()) {
+            bool hasChangedAttribute = false;
+            for (const auto &attribute: it.second) {
+                if (attribute.first == "value")
+                    continue;
+                const auto &findMatch = findMergedVariable->second.find(attribute.first);
+                if (findMatch != findMergedVariable->second.end()) {
+                    if (findMatch->second == attribute.second)
+                        continue;
+                }
+                hasChangedAttribute = true;
+            }
+            if (!hasChangedAttribute)
+                continue;
+        }
+        updated = true;
+        auto findCached = m_cachedVariables.find(it.first);
+        if (findCached != m_cachedVariables.end()) {
+            m_mergedVariables[it.first] = it.second;
+            m_mergedVariables[it.first]["value"] = valueOfKeyInMapOrEmpty(findCached->second, "value");
+        } else {
+            m_mergedVariables[it.first] = it.second;
+            m_cachedVariables[it.first] = it.second;
+        }
+    }
+    std::vector<QString> eraseList;
+    for (const auto &it: m_mergedVariables) {
+        if (defaultVariables.end() == defaultVariables.find(it.first)) {
+            eraseList.push_back(it.first);
+            updated = true;
+        }
+    }
+    for (const auto &it: eraseList) {
+        m_mergedVariables.erase(it);
+    }
+    if (updated) {
+        emit mergedVaraiblesChanged();
+    }
+    return updated;
+}
+
+void Document::runScript()
+{
+    if (nullptr != m_scriptRunner) {
+        m_isScriptResultObsolete = true;
+        return;
+    }
+    
+    m_isScriptResultObsolete = false;
+    
+    qDebug() << "Script running..";
+    
+    QThread *thread = new QThread;
+
+    m_scriptRunner = new ScriptRunner();
+    m_scriptRunner->moveToThread(thread);
+    m_scriptRunner->setScript(new QString(m_script));
+    m_scriptRunner->setVariables(new std::map<QString, std::map<QString, QString>>(
+        m_mergedVariables.empty() ? m_cachedVariables : m_mergedVariables
+        ));
+    connect(thread, &QThread::started, m_scriptRunner, &ScriptRunner::process);
+    connect(m_scriptRunner, &ScriptRunner::finished, this, &Document::scriptResultReady);
+    connect(m_scriptRunner, &ScriptRunner::finished, thread, &QThread::quit);
+    connect(thread, &QThread::finished, thread, &QThread::deleteLater);
+    emit scriptRunning();
+    thread->start();
+}
+
+void Document::scriptResultReady()
+{
+    Snapshot *snapshot = m_scriptRunner->takeResultSnapshot();
+    std::map<QString, std::map<QString, QString>> *defaultVariables = m_scriptRunner->takeDefaultVariables();
+    bool errorChanged = false;
+    bool consoleLogChanged = false;
+    bool mergedVariablesChanged = false;
+    
+    const QString &scriptError = m_scriptRunner->scriptError();
+    if (m_scriptError != scriptError) {
+        m_scriptError = scriptError;
+        errorChanged = true;
+    }
+    
+    const QString &consoleLog = m_scriptRunner->consoleLog();
+    if (m_scriptConsoleLog != consoleLog) {
+        m_scriptConsoleLog = consoleLog;
+        consoleLogChanged = true;
+    }
+    
+    if (nullptr != snapshot) {
+        fromSnapshot(*snapshot);
+        delete snapshot;
+        saveSnapshot();
+    }
+    
+    if (nullptr != defaultVariables) {
+        mergedVariablesChanged = updateDefaultVariables(*defaultVariables);
+        delete defaultVariables;
+    }
+
+    delete m_scriptRunner;
+    m_scriptRunner = nullptr;
+    
+    if (errorChanged)
+        emit scriptErrorChanged();
+    
+    if (consoleLogChanged)
+        emit scriptConsoleLogChanged();
+    
+    qDebug() << "Script run done";
+
+    if (m_isScriptResultObsolete || mergedVariablesChanged) {
+        runScript();
+    }
+}
+
+const QString &Document::script() const
+{
+    return m_script;
+}
+
+const std::map<QString, std::map<QString, QString>> &Document::variables() const
+{
+    return m_mergedVariables;
+}
+
+const QString &Document::scriptError() const
+{
+    return m_scriptError;
+}
+
+const QString &Document::scriptConsoleLog() const
+{
+    return m_scriptConsoleLog;
+}
+
 void Document::startPaint(void)
 {
 }
diff --git a/src/document.h b/src/document.h
index 7cd655b6..f05f41e3 100644
--- a/src/document.h
+++ b/src/document.h
@@ -35,6 +35,7 @@
 
 class MaterialPreviewsGenerator;
 class MotionsGenerator;
+class ScriptRunner;
 class MousePicker;
 
 class HistoryItem
@@ -464,6 +465,7 @@ signals:
     void partGridStateChanged(QUuid partId);
     void componentCombineModeChanged(QUuid componentId);
     void cleanup();
+    void cleanupScript();
     void originChanged();
     void xlockStateChanged();
     void ylockStateChanged();
@@ -507,6 +509,12 @@ signals:
     void postProcessing();
     void textureGenerating();
     void textureChanged();
+    void scriptChanged();
+    void scriptModifiedFromExternal();
+    void mergedVaraiblesChanged();
+    void scriptRunning();
+    void scriptErrorChanged();
+    void scriptConsoleLogChanged();
     void mouseTargetChanged();
     void mousePickRadiusChanged();
 public: // need initialize
@@ -576,6 +584,10 @@ public:
     bool isMeshGenerating() const;
     bool isPostProcessing() const;
     bool isTextureGenerating() const;
+    const QString &script() const;
+    const std::map<QString, std::map<QString, QString>> &variables() const;
+    const QString &scriptError() const;
+    const QString &scriptConsoleLog() const;
     const QVector3D &mouseTargetPosition() const;
     float mousePickRadius() const;
 public slots:
@@ -686,8 +698,10 @@ public slots:
     void batchChangeBegin();
     void batchChangeEnd();
     void reset();
+    void resetScript();
     void clearHistories();
     void silentReset();
+    void silentResetScript();
     void breakEdge(QUuid edgeId);
     void setXlockState(bool locked);
     void setYlockState(bool locked);
@@ -716,6 +730,12 @@ public slots:
     void renameMaterial(QUuid materialId, QString name);
     void applyPreferencePartColorChange();
     void applyPreferenceFlatShadingChange();
+    void initScript(const QString &script);
+    void updateScript(const QString &script);
+    void runScript();
+    void scriptResultReady();
+    void updateVariable(const QString &name, const std::map<QString, QString> &value);
+    void updateVariableValue(const QString &name, const QString &value);
     void startPaint(void);
     void stopPaint(void);
     void setMousePickMaskNodeIds(const std::set<QUuid> &nodeIds);
@@ -772,6 +792,8 @@ private: // need initialize
     quint64 m_nextMeshGenerationId;
     std::map<QString, std::map<QString, QString>> m_cachedVariables;
     std::map<QString, std::map<QString, QString>> m_mergedVariables;
+    ScriptRunner *m_scriptRunner;
+    bool m_isScriptResultObsolete;
     MousePicker *m_mousePicker;
     bool m_isMouseTargetResultObsolete;
     PaintMode m_paintMode;
@@ -786,6 +808,9 @@ private:
     QVector3D m_mouseRayNear;
     QVector3D m_mouseRayFar;
     QVector3D m_mouseTargetPosition;
+    QString m_scriptError;
+    QString m_scriptConsoleLog;
+    QString m_script;
     std::set<QUuid> m_mousePickMaskNodeIds;
     std::set<QUuid> m_intermediatePaintImageIds;
 };
diff --git a/src/documentwindow.cpp b/src/documentwindow.cpp
index 9e242d1b..7c1c570c 100644
--- a/src/documentwindow.cpp
+++ b/src/documentwindow.cpp
@@ -39,6 +39,8 @@
 #include "shortcuts.h"
 #include "floatnumberwidget.h"
 #include "cutfacelistwidget.h"
+#include "scriptwidget.h"
+#include "variablesxml.h"
 #include "updatescheckwidget.h"
 
 int DocumentWindow::m_modelRenderWidgetInitialX = 16;
@@ -400,10 +402,17 @@ DocumentWindow::DocumentWindow() :
     connect(motionManageWidget, &MotionManageWidget::unregisterDialog, this, &DocumentWindow::unregisterDialog);
     addDockWidget(Qt::RightDockWidgetArea, motionDocker);
     
+    QDockWidget *scriptDocker = new QDockWidget(tr("Script"), this);
+    scriptDocker->setAllowedAreas(Qt::RightDockWidgetArea);
+    ScriptWidget *scriptWidget = new ScriptWidget(m_document, scriptDocker);
+    scriptDocker->setWidget(scriptWidget);
+    addDockWidget(Qt::RightDockWidgetArea, scriptDocker);
+    
     tabifyDockWidget(partTreeDocker, materialDocker);
     tabifyDockWidget(materialDocker, rigDocker);
     tabifyDockWidget(rigDocker, poseDocker);
     tabifyDockWidget(poseDocker, motionDocker);
+    tabifyDockWidget(motionDocker, scriptDocker);
     
     partTreeDocker->raise();
 
@@ -442,7 +451,8 @@ DocumentWindow::DocumentWindow() :
         "Giraffe",
         "Meerkat",
         "Mosquito",
-        "Seagull"
+        "Seagull",
+        "Procedural Tree"
     };
     for (const auto &model: exampleModels) {
         QAction *openModelAction = new QAction(model, this);
@@ -794,6 +804,13 @@ DocumentWindow::DocumentWindow() :
     });
     m_windowMenu->addAction(m_showMotionsAction);
     
+    m_showScriptAction = new QAction(tr("Script"), this);
+    connect(m_showScriptAction, &QAction::triggered, [=]() {
+        scriptDocker->show();
+        scriptDocker->raise();
+    });
+    m_windowMenu->addAction(m_showScriptAction);
+    
     QMenu *dialogsMenu = m_windowMenu->addMenu(tr("Dialogs"));
     connect(dialogsMenu, &QMenu::aboutToShow, [=]() {
         dialogsMenu->clear();
@@ -1125,6 +1142,7 @@ DocumentWindow::DocumentWindow() :
     connect(m_document, &Document::turnaroundChanged, this, &DocumentWindow::documentChanged);
     connect(m_document, &Document::optionsChanged, this, &DocumentWindow::documentChanged);
     connect(m_document, &Document::rigChanged, this, &DocumentWindow::documentChanged);
+    connect(m_document, &Document::scriptChanged, this, &DocumentWindow::documentChanged);
 
     connect(m_modelRenderWidget, &ModelWidget::customContextMenuRequested, [=](const QPoint &pos) {
         graphicsWidget->showContextMenu(graphicsWidget->mapFromGlobal(m_modelRenderWidget->mapToGlobal(pos)));
@@ -1164,6 +1182,9 @@ DocumentWindow::DocumentWindow() :
         m_document->generateMaterialPreviews();
     });
     
+    connect(m_document, &Document::scriptChanged, m_document, &Document::runScript);
+    connect(m_document, &Document::scriptModifiedFromExternal, m_document, &Document::runScript);
+    
     initShortCuts(this, m_graphicsWidget);
 
     connect(this, &DocumentWindow::initialized, m_document, &Document::uiReady);
@@ -1264,6 +1285,7 @@ void DocumentWindow::newDocument()
             return;
     }
     m_document->clearHistories();
+    m_document->resetScript();
     m_document->reset();
     m_document->saveSnapshot();
 }
@@ -1410,6 +1432,20 @@ void DocumentWindow::saveTo(const QString &saveAsFilename)
         ds3Writer.add("canvas.png", "asset", &m_document->turnaroundPngByteArray);
     }
     
+    if (!m_document->script().isEmpty()) {
+        auto script = m_document->script().toUtf8();
+        ds3Writer.add("model.js", "script", &script);
+    }
+    
+    const auto &variables = m_document->variables();
+    if (!variables.empty()) {
+        QByteArray variablesXml;
+        QXmlStreamWriter variablesXmlStream(&variablesXml);
+        saveVariablesToXmlStream(variables, &variablesXmlStream);
+        if (variablesXml.size() > 0)
+            ds3Writer.add("variables.xml", "variable", &variablesXml);
+    }
+    
     std::set<QUuid> imageIds;
     
     for (const auto &material: snapshot.materials) {
@@ -1460,6 +1496,7 @@ void DocumentWindow::openPathAs(const QString &path, const QString &asName)
     Ds3FileReader ds3Reader(path);
     
     m_document->clearHistories();
+    m_document->resetScript();
     m_document->reset();
     m_document->saveSnapshot();
     
@@ -1497,6 +1534,22 @@ void DocumentWindow::openPathAs(const QString &path, const QString &asName)
                 QImage image = QImage::fromData(data, "PNG");
                 m_document->updateTurnaround(image);
             }
+        } else if (item.type == "script") {
+            if (item.name == "model.js") {
+                QByteArray script;
+                ds3Reader.loadItem(item.name, &script);
+                m_document->initScript(QString::fromUtf8(script.constData()));
+            }
+        } else if (item.type == "variable") {
+            if (item.name == "variables.xml") {
+                QByteArray data;
+                ds3Reader.loadItem(item.name, &data);
+                QXmlStreamReader stream(data);
+                std::map<QString, std::map<QString, QString>> variables;
+                loadVariablesFromXmlStream(&variables, stream);
+                for (const auto &it: variables)
+                    m_document->updateVariable(it.first, it.second);
+            }
         }
     }
     QApplication::restoreOverrideCursor();
diff --git a/src/documentwindow.h b/src/documentwindow.h
index 9a6926ad..581325e3 100644
--- a/src/documentwindow.h
+++ b/src/documentwindow.h
@@ -179,6 +179,7 @@ private:
     QAction *m_showRigAction;
     QAction *m_showPosesAction;
     QAction *m_showMotionsAction;
+    QAction *m_showScriptAction;
     
     QMenu *m_helpMenu;
     QAction *m_gotoHomepageAction;
diff --git a/src/scripteditwidget.cpp b/src/scripteditwidget.cpp
new file mode 100755
index 00000000..42376731
--- /dev/null
+++ b/src/scripteditwidget.cpp
@@ -0,0 +1,153 @@
+/****************************************************************************
+**
+** Copyright (C) 2015 The Qt Company Ltd.
+** Contact: http://www.qt.io/licensing/
+**
+** This file is part of the examples of the Qt Toolkit.
+**
+** $QT_BEGIN_LICENSE:BSD$
+** You may use this file under the terms of the BSD license as follows:
+**
+** "Redistribution and use in source and binary forms, with or without
+** modification, are permitted provided that the following conditions are
+** met:
+**   * Redistributions of source code must retain the above copyright
+**     notice, this list of conditions and the following disclaimer.
+**   * Redistributions in binary form must reproduce the above copyright
+**     notice, this list of conditions and the following disclaimer in
+**     the documentation and/or other materials provided with the
+**     distribution.
+**   * Neither the name of The Qt Company Ltd nor the names of its
+**     contributors may be used to endorse or promote products derived
+**     from this software without specific prior written permission.
+**
+**
+** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE."
+**
+** $QT_END_LICENSE$
+**
+****************************************************************************/
+
+#include <QtWidgets>
+#include "theme.h"
+#include "scripteditwidget.h"
+
+
+ScriptEditWidget::ScriptEditWidget(QWidget *parent) : QPlainTextEdit(parent)
+{
+    connect(this, &QPlainTextEdit::textChanged, this, [&]() {
+        emit scriptChanged(toPlainText());
+    });
+    
+    m_lineNumberArea = new LineNumberArea(this);
+
+    connect(this, SIGNAL(blockCountChanged(int)), this, SLOT(updateLineNumberAreaWidth(int)));
+    connect(this, SIGNAL(updateRequest(QRect,int)), this, SLOT(updateLineNumberArea(QRect,int)));
+    connect(this, SIGNAL(cursorPositionChanged()), this, SLOT(highlightCurrentLine()));
+
+    updateLineNumberAreaWidth(0);
+    highlightCurrentLine();
+}
+
+
+
+int ScriptEditWidget::lineNumberAreaWidth()
+{
+    int digits = 1;
+    int max = qMax(1, blockCount());
+    while (max >= 10) {
+        max /= 10;
+        ++digits;
+    }
+
+    int space = 3 + fontMetrics().width(QLatin1Char('9')) * digits;
+
+    return space;
+}
+
+
+
+void ScriptEditWidget::updateLineNumberAreaWidth(int /* newBlockCount */)
+{
+    setViewportMargins(lineNumberAreaWidth(), 0, 0, 0);
+}
+
+
+
+void ScriptEditWidget::updateLineNumberArea(const QRect &rect, int dy)
+{
+    if (dy)
+        m_lineNumberArea->scroll(0, dy);
+    else
+        m_lineNumberArea->update(0, rect.y(), m_lineNumberArea->width(), rect.height());
+
+    if (rect.contains(viewport()->rect()))
+        updateLineNumberAreaWidth(0);
+}
+
+
+
+void ScriptEditWidget::resizeEvent(QResizeEvent *e)
+{
+    QPlainTextEdit::resizeEvent(e);
+
+    QRect cr = contentsRect();
+    m_lineNumberArea->setGeometry(QRect(cr.left(), cr.top(), lineNumberAreaWidth(), cr.height()));
+}
+
+
+
+void ScriptEditWidget::highlightCurrentLine()
+{
+    QList<QTextEdit::ExtraSelection> extraSelections;
+
+    if (!isReadOnly()) {
+        QTextEdit::ExtraSelection selection;
+
+        QColor lineColor = QColor(0x24, 0x24, 0x24).lighter(160);
+
+        selection.format.setBackground(lineColor);
+        selection.format.setProperty(QTextFormat::FullWidthSelection, true);
+        selection.cursor = textCursor();
+        selection.cursor.clearSelection();
+        extraSelections.append(selection);
+    }
+
+    setExtraSelections(extraSelections);
+}
+
+void ScriptEditWidget::lineNumberAreaPaintEvent(QPaintEvent *event)
+{
+    QPainter painter(m_lineNumberArea);
+    painter.fillRect(event->rect(), QColor(0x24, 0x24, 0x24));
+
+
+    QTextBlock block = firstVisibleBlock();
+    int blockNumber = block.blockNumber();
+    int top = (int) blockBoundingGeometry(block).translated(contentOffset()).top();
+    int bottom = top + (int) blockBoundingRect(block).height();
+
+    while (block.isValid() && top <= event->rect().bottom()) {
+        if (block.isVisible() && bottom >= event->rect().top()) {
+            QString number = QString::number(blockNumber + 1);
+            painter.setPen(Theme::white);
+            painter.drawText(0, top, m_lineNumberArea->width(), fontMetrics().height(),
+                             Qt::AlignRight, number);
+        }
+
+        block = block.next();
+        top = bottom;
+        bottom = top + (int) blockBoundingRect(block).height();
+        ++blockNumber;
+    }
+}
diff --git a/src/scripteditwidget.h b/src/scripteditwidget.h
new file mode 100755
index 00000000..1cdee0d6
--- /dev/null
+++ b/src/scripteditwidget.h
@@ -0,0 +1,99 @@
+/****************************************************************************
+**
+** Copyright (C) 2015 The Qt Company Ltd.
+** Contact: http://www.qt.io/licensing/
+**
+** This file is part of the examples of the Qt Toolkit.
+**
+** $QT_BEGIN_LICENSE:BSD$
+** You may use this file under the terms of the BSD license as follows:
+**
+** "Redistribution and use in source and binary forms, with or without
+** modification, are permitted provided that the following conditions are
+** met:
+**   * Redistributions of source code must retain the above copyright
+**     notice, this list of conditions and the following disclaimer.
+**   * Redistributions in binary form must reproduce the above copyright
+**     notice, this list of conditions and the following disclaimer in
+**     the documentation and/or other materials provided with the
+**     distribution.
+**   * Neither the name of The Qt Company Ltd nor the names of its
+**     contributors may be used to endorse or promote products derived
+**     from this software without specific prior written permission.
+**
+**
+** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE."
+**
+** $QT_END_LICENSE$
+**
+****************************************************************************/
+
+#ifndef CODEEDITOR_H
+#define CODEEDITOR_H
+
+#include <QPlainTextEdit>
+#include <QObject>
+
+class QPaintEvent;
+class QResizeEvent;
+class QSize;
+class QWidget;
+
+class LineNumberArea;
+
+class ScriptEditWidget : public QPlainTextEdit
+{
+    Q_OBJECT
+signals:
+    void scriptChanged(const QString &script);
+public:
+    ScriptEditWidget(QWidget *parent=0);
+
+    void lineNumberAreaPaintEvent(QPaintEvent *event);
+    int lineNumberAreaWidth();
+
+protected:
+    void resizeEvent(QResizeEvent *event);
+
+private slots:
+    void updateLineNumberAreaWidth(int newBlockCount);
+    void highlightCurrentLine();
+    void updateLineNumberArea(const QRect &, int);
+
+private:
+    QWidget *m_lineNumberArea;
+};
+
+
+class LineNumberArea : public QWidget
+{
+public:
+    LineNumberArea(ScriptEditWidget *editor) : QWidget(editor) {
+        m_codeEditor = editor;
+    }
+
+    QSize sizeHint() const {
+        return QSize(m_codeEditor->lineNumberAreaWidth(), 0);
+    }
+
+protected:
+    void paintEvent(QPaintEvent *event) {
+        m_codeEditor->lineNumberAreaPaintEvent(event);
+    }
+
+private:
+    ScriptEditWidget *m_codeEditor;
+};
+
+
+#endif
diff --git a/src/scriptrunner.cpp b/src/scriptrunner.cpp
new file mode 100755
index 00000000..485bd473
--- /dev/null
+++ b/src/scriptrunner.cpp
@@ -0,0 +1,884 @@
+#include <QDebug>
+#include <QElapsedTimer>
+#include <QUuid>
+#include <QFile>
+#include "scriptrunner.h"
+#include "util.h"
+
+JSClassID ScriptRunner::js_canvasClassId = 0;
+JSClassID ScriptRunner::js_partClassId = 0;
+JSClassID ScriptRunner::js_componentClassId = 0;
+JSClassID ScriptRunner::js_nodeClassId = 0;
+
+static JSValue js_print(JSContext *context, JSValueConst thisValue,
+    int argc, JSValueConst *argv)
+{
+    ScriptRunner *runner = (ScriptRunner *)JS_GetContextOpaque(context);
+    
+    int i;
+    const char *str;
+
+    for (i = 0; i < argc; i++) {
+        if (i != 0)
+            runner->consoleLog() += ' ';
+        str = JS_ToCString(context, argv[i]);
+        if (!str)
+            return JS_EXCEPTION;
+        runner->consoleLog() += str;
+        JS_FreeCString(context, str);
+    }
+    runner->consoleLog() += '\n';
+    return JS_UNDEFINED;
+}
+
+static ScriptRunner::DocumentElement *GetElementFromArg(JSValueConst arg)
+{
+    ScriptRunner::DocumentElement *element = nullptr;
+    if (nullptr == element) {
+        ScriptRunner::DocumentNode *node = (ScriptRunner::DocumentNode *)JS_GetOpaque(arg,
+            ScriptRunner::js_nodeClassId);
+        if (nullptr != node) {
+            element = (ScriptRunner::DocumentElement *)node;
+        }
+    }
+    if (nullptr == element) {
+        ScriptRunner::DocumentPart *part = (ScriptRunner::DocumentPart *)JS_GetOpaque(arg,
+            ScriptRunner::js_partClassId);
+        if (nullptr != part) {
+            element = (ScriptRunner::DocumentElement *)part;
+        }
+    }
+    if (nullptr == element) {
+        ScriptRunner::DocumentComponent *component = (ScriptRunner::DocumentComponent *)JS_GetOpaque(arg,
+            ScriptRunner::js_componentClassId);
+        if (nullptr != component) {
+            element = (ScriptRunner::DocumentElement *)component;
+        }
+    }
+    if (nullptr == element) {
+        ScriptRunner::DocumentCanvas *canvas = (ScriptRunner::DocumentCanvas *)JS_GetOpaque(arg,
+            ScriptRunner::js_canvasClassId);
+        if (nullptr != canvas) {
+            element = (ScriptRunner::DocumentElement *)canvas;
+        }
+    }
+    return element;
+}
+
+static JSValue js_setAttribute(JSContext *context, JSValueConst thisValue,
+    int argc, JSValueConst *argv)
+{
+    ScriptRunner *runner = (ScriptRunner *)JS_GetContextOpaque(context);
+    if (argc < 3) {
+        runner->consoleLog() += "Incomplete parameters, expect: element, attributeName, attributeValue\r\n";
+        return JS_EXCEPTION;
+    }
+    ScriptRunner::DocumentElement *element = GetElementFromArg(argv[0]);
+    if (nullptr == element) {
+        runner->consoleLog() += "Parameters error\r\n";
+        return JS_EXCEPTION;
+    }
+    const char *attributeName = nullptr;
+    const char *attributeValue = nullptr;
+    attributeName = JS_ToCString(context, argv[1]);
+    if (!attributeName)
+        goto fail;
+    attributeValue = JS_ToCString(context, argv[2]);
+    if (!attributeValue)
+        goto fail;
+    runner->setAttribute(element, attributeName, attributeValue);
+    JS_FreeCString(context, attributeName);
+    JS_FreeCString(context, attributeValue);
+    return JS_UNDEFINED;
+fail:
+    JS_FreeCString(context, attributeName);
+    JS_FreeCString(context, attributeValue);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_attribute(JSContext *context, JSValueConst thisValue,
+    int argc, JSValueConst *argv)
+{
+    ScriptRunner *runner = (ScriptRunner *)JS_GetContextOpaque(context);
+    if (argc < 2) {
+        runner->consoleLog() += "Incomplete parameters, expect: element, attributeName\r\n";
+        return JS_EXCEPTION;
+    }
+    ScriptRunner::DocumentElement *element = GetElementFromArg(argv[0]);
+    if (nullptr == element) {
+        runner->consoleLog() += "Parameters error\r\n";
+        return JS_EXCEPTION;
+    }
+    QString attributeValue;
+    const char *attributeName = nullptr;
+    attributeName = JS_ToCString(context, argv[1]);
+    if (!attributeName)
+        goto fail;
+    attributeValue = runner->attribute(element, attributeName);
+    JS_FreeCString(context, attributeName);
+    return JS_NewString(context, attributeValue.toUtf8().constData());
+fail:
+    JS_FreeCString(context, attributeName);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_connect(JSContext *context, JSValueConst thisValue,
+    int argc, JSValueConst *argv)
+{
+    ScriptRunner *runner = (ScriptRunner *)JS_GetContextOpaque(context);
+    if (argc < 2) {
+        runner->consoleLog() += "Incomplete parameters, expect: firstNode, secondNode\r\n";
+        return JS_EXCEPTION;
+    }
+    ScriptRunner::DocumentElement *firstElement = (ScriptRunner::DocumentElement *)JS_GetOpaque(argv[0],
+        ScriptRunner::js_nodeClassId);
+    if (nullptr == firstElement ||
+            ScriptRunner::DocumentElementType::Node != firstElement->type) {
+        runner->consoleLog() += "First parameter must be node\r\n";
+        return JS_EXCEPTION;
+    }
+    ScriptRunner::DocumentElement *secondElement = (ScriptRunner::DocumentElement *)JS_GetOpaque(argv[1],
+        ScriptRunner::js_nodeClassId);
+    if (nullptr == secondElement ||
+            ScriptRunner::DocumentElementType::Node != secondElement->type) {
+        runner->consoleLog() += "Second parameter must be node\r\n";
+        return JS_EXCEPTION;
+    }
+    ScriptRunner::DocumentNode *firstNode = (ScriptRunner::DocumentNode *)firstElement;
+    ScriptRunner::DocumentNode *secondNode = (ScriptRunner::DocumentNode *)secondElement;
+    if (firstNode->part != secondNode->part) {
+        runner->consoleLog() += "Cannot connect nodes come from different parts\r\n";
+        return JS_EXCEPTION;
+    }
+    runner->connect(firstNode, secondNode);
+    return JS_UNDEFINED;
+}
+
+static JSValue js_createComponent(JSContext *context, JSValueConst thisValue,
+    int argc, JSValueConst *argv)
+{
+    ScriptRunner *runner = (ScriptRunner *)JS_GetContextOpaque(context);
+    ScriptRunner::DocumentComponent *parentComponent = nullptr;
+    if (argc >= 1) {
+        ScriptRunner::DocumentElement *element = (ScriptRunner::DocumentElement *)JS_GetOpaque(argv[0],
+            ScriptRunner::js_componentClassId);
+        if (nullptr == element ||
+                ScriptRunner::DocumentElementType::Component != element->type) {
+            runner->consoleLog() += "First parameter must be null or component\r\n";
+            return JS_EXCEPTION;
+        }
+        parentComponent = (ScriptRunner::DocumentComponent *)element;
+    }
+    JSValue component = JS_NewObjectClass(context, ScriptRunner::js_componentClassId);
+    JS_SetOpaque(component, runner->createComponent(parentComponent));
+    return component;
+}
+
+static JSValue js_createPart(JSContext *context, JSValueConst thisValue,
+    int argc, JSValueConst *argv)
+{
+    ScriptRunner *runner = (ScriptRunner *)JS_GetContextOpaque(context);
+    if (argc < 1) {
+        runner->consoleLog() += "Incomplete parameters, expect: component\r\n";
+        return JS_EXCEPTION;
+    }
+    ScriptRunner::DocumentElement *element = (ScriptRunner::DocumentElement *)JS_GetOpaque(argv[0],
+        ScriptRunner::js_componentClassId);
+    if (nullptr == element ||
+            ScriptRunner::DocumentElementType::Component != element->type) {
+        runner->consoleLog() += "First parameter must be component\r\n";
+        return JS_EXCEPTION;
+    }
+    ScriptRunner::DocumentComponent *component = (ScriptRunner::DocumentComponent *)element;
+    JSValue part = JS_NewObjectClass(context, ScriptRunner::js_partClassId);
+    JS_SetOpaque(part, runner->createPart(component));
+    return part;
+}
+
+static JSValue js_createNode(JSContext *context, JSValueConst thisValue,
+    int argc, JSValueConst *argv)
+{
+    ScriptRunner *runner = (ScriptRunner *)JS_GetContextOpaque(context);
+    if (argc < 1) {
+        runner->consoleLog() += "Incomplete parameters, expect: part\r\n";
+        return JS_EXCEPTION;
+    }
+    ScriptRunner::DocumentElement *element = (ScriptRunner::DocumentElement *)JS_GetOpaque(argv[0],
+        ScriptRunner::js_partClassId);
+    if (nullptr == element ||
+            ScriptRunner::DocumentElementType::Part != element->type) {
+        runner->consoleLog() += "First parameter must be part\r\n";
+        return JS_EXCEPTION;
+    }
+    ScriptRunner::DocumentPart *part = (ScriptRunner::DocumentPart *)element;
+    JSValue node = JS_NewObjectClass(context, ScriptRunner::js_nodeClassId);
+    JS_SetOpaque(node, runner->createNode(part));
+    return node;
+}
+
+static JSValue js_createFloatInput(JSContext *context, JSValueConst thisValue,
+    int argc, JSValueConst *argv)
+{
+    ScriptRunner *runner = (ScriptRunner *)JS_GetContextOpaque(context);
+    if (argc < 4) {
+        runner->consoleLog() += "Incomplete parameters, expect: name, defaultValue, minValue, maxValue\r\n";
+        return JS_EXCEPTION;
+    }
+    
+    double mergedValue = 0.0;
+    
+    const char *name = nullptr;
+    double defaultValue = 0.0;
+    double minValue = 0.0;
+    double maxValue = 0.0;
+    
+    name = JS_ToCString(context, argv[0]);
+    if (!name)
+        goto fail;
+    JS_ToFloat64(context, &defaultValue, argv[1]);
+    JS_ToFloat64(context, &minValue, argv[2]);
+    JS_ToFloat64(context, &maxValue, argv[3]);
+    
+    mergedValue = runner->createFloatInput(name, defaultValue, minValue, maxValue);
+    JS_FreeCString(context, name);
+    
+    return JS_NewFloat64(context, mergedValue);
+    
+fail:
+    JS_FreeCString(context, name);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_createIntInput(JSContext *context, JSValueConst thisValue,
+    int argc, JSValueConst *argv)
+{
+    ScriptRunner *runner = (ScriptRunner *)JS_GetContextOpaque(context);
+    if (argc < 4) {
+        runner->consoleLog() += "Incomplete parameters, expect: name, defaultValue, minValue, maxValue\r\n";
+        return JS_EXCEPTION;
+    }
+    
+    int64_t mergedValue = 0.0;
+    
+    const char *name = nullptr;
+    int64_t defaultValue = 0;
+    int64_t minValue = 0;
+    int64_t maxValue = 0;
+    
+    name = JS_ToCString(context, argv[0]);
+    if (!name)
+        goto fail;
+    JS_ToInt64(context, &defaultValue, argv[1]);
+    JS_ToInt64(context, &minValue, argv[2]);
+    JS_ToInt64(context, &maxValue, argv[3]);
+    
+    mergedValue = runner->createIntInput(name, defaultValue, minValue, maxValue);
+    JS_FreeCString(context, name);
+    
+    return JS_NewInt64(context, mergedValue);
+    
+fail:
+    JS_FreeCString(context, name);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_createColorInput(JSContext *context, JSValueConst thisValue,
+    int argc, JSValueConst *argv)
+{
+    ScriptRunner *runner = (ScriptRunner *)JS_GetContextOpaque(context);
+    if (argc < 2) {
+        runner->consoleLog() += "Incomplete parameters, expect: name, defaultValue\r\n";
+        return JS_EXCEPTION;
+    }
+    
+    QColor mergeValue;
+    
+    const char *name = nullptr;
+    const char *defaultValue = nullptr;
+    
+    name = JS_ToCString(context, argv[0]);
+    if (!name)
+        goto fail;
+    defaultValue = JS_ToCString(context, argv[1]);
+    if (!defaultValue)
+        goto fail;
+    
+    mergeValue = runner->createColorInput(name, defaultValue);
+    
+    JS_FreeCString(context, name);
+    JS_FreeCString(context, defaultValue);
+    
+    return JS_NewString(context, mergeValue.name().toUtf8().constData());
+    
+fail:
+    JS_FreeCString(context, name);
+    JS_FreeCString(context, defaultValue);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_createCheckInput(JSContext *context, JSValueConst thisValue,
+    int argc, JSValueConst *argv)
+{
+    ScriptRunner *runner = (ScriptRunner *)JS_GetContextOpaque(context);
+    if (argc < 2) {
+        runner->consoleLog() += "Incomplete parameters, expect: name, defaultValue\r\n";
+        return JS_EXCEPTION;
+    }
+    
+    bool mergedValue = false;
+    
+    const char *name = nullptr;
+    const char *value = nullptr;
+    bool defaultValue = false;
+    
+    name = JS_ToCString(context, argv[0]);
+    if (!name)
+        goto fail;
+    value = JS_ToCString(context, argv[1]);
+    if (!value)
+        goto fail;
+    
+    defaultValue = isTrueValueString(value);
+    mergedValue = runner->createCheckInput(name, defaultValue);
+    JS_FreeCString(context, name);
+    JS_FreeCString(context, value);
+    
+    return JS_NewBool(context, mergedValue);
+    
+fail:
+    JS_FreeCString(context, name);
+    JS_FreeCString(context, value);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_createSelectInput(JSContext *context, JSValueConst thisValue,
+    int argc, JSValueConst *argv)
+{
+    ScriptRunner *runner = (ScriptRunner *)JS_GetContextOpaque(context);
+    if (argc < 3) {
+        runner->consoleLog() += "Incomplete parameters, expect: name, defaultValue, options\r\n";
+        return JS_EXCEPTION;
+    }
+    
+    const char *name = nullptr;
+    int32_t defaultValue = 0;
+    int32_t mergedValue = 0;
+    JSValue *arrayItems = nullptr;
+    uint32_t arrayLength = 0;
+    QStringList options;
+    
+    name = JS_ToCString(context, argv[0]);
+    if (!name)
+        goto fail;
+    
+    JS_ToInt32(context, &defaultValue, argv[1]);
+    
+    if (true != JS_IsArray(context, argv[2])) {
+        runner->consoleLog() += "Expect array as the third parameter\r\n";
+        goto fail;
+    }
+    
+    if (!js_get_fast_array(context, argv[2], &arrayItems, &arrayLength)) {
+        runner->consoleLog() += "Read third parameter as array failed\r\n";
+        goto fail;
+    }
+    
+    for (uint32_t i = 0; i < arrayLength; ++i) {
+        const char *optionValue = JS_ToCString(context, arrayItems[i]);
+        if (nullptr != optionValue) {
+            options.append(optionValue);
+            JS_FreeCString(context, optionValue);
+        } else {
+            options.append("");
+        }
+    }
+    
+    mergedValue = runner->createSelectInput(name, defaultValue, options);
+    if (mergedValue < 0)
+        mergedValue = 0;
+    else if (mergedValue >= options.size())
+        mergedValue = options.size() - 1;
+    
+    JS_FreeCString(context, name);
+
+    return JS_NewInt32(context, mergedValue);
+    
+fail:
+    JS_FreeCString(context, name);
+    return JS_EXCEPTION;
+}
+
+ScriptRunner::ScriptRunner()
+{
+}
+
+ScriptRunner::~ScriptRunner()
+{
+    delete m_resultSnapshot;
+    delete m_defaultVariables;
+    for (auto &it: m_parts)
+        delete it;
+    for (auto &it: m_components)
+        delete it;
+    for (auto &it: m_nodes)
+        delete it;
+}
+
+QString &ScriptRunner::consoleLog()
+{
+    return m_consoleLog;
+}
+
+const QString &ScriptRunner::scriptError()
+{
+    return m_scriptError;
+}
+
+ScriptRunner::DocumentPart *ScriptRunner::createPart(DocumentComponent *component)
+{
+    ScriptRunner::DocumentPart *part = new ScriptRunner::DocumentPart;
+    part->component = component;
+    m_parts.push_back(part);
+    return part;
+}
+
+ScriptRunner::DocumentComponent *ScriptRunner::createComponent(DocumentComponent *parentComponent)
+{
+    ScriptRunner::DocumentComponent *component = new ScriptRunner::DocumentComponent;
+    component->parentComponent = parentComponent;
+    m_components.push_back(component);
+    return component;
+}
+
+ScriptRunner::DocumentNode *ScriptRunner::createNode(DocumentPart *part)
+{
+    ScriptRunner::DocumentNode *node = new ScriptRunner::DocumentNode;
+    node->part = part;
+    m_nodes.push_back(node);
+    return node;
+}
+
+bool ScriptRunner::setAttribute(DocumentElement *element, const QString &name, const QString &value)
+{
+    element->attributes[name] = value;
+    
+    // TODO: Validate attribute name and value
+    
+    return true;
+}
+
+QString ScriptRunner::attribute(DocumentElement *element, const QString &name)
+{
+    auto findAttribute = element->attributes.find(name);
+    if (findAttribute == element->attributes.end())
+        return QString();
+    return findAttribute->second;
+}
+
+void ScriptRunner::connect(DocumentNode *firstNode, DocumentNode *secondNode)
+{
+    m_edges.push_back(std::make_pair(firstNode, secondNode));
+}
+
+static void js_componentFinalizer(JSRuntime *runtime, JSValue value)
+{
+    ScriptRunner::DocumentComponent *component = (ScriptRunner::DocumentComponent *)JS_GetOpaque(value,
+        ScriptRunner::js_componentClassId);
+    if (component) {
+        component->deleted = true;
+    }
+}
+
+static JSClassDef js_componentClass = {
+    "Component",
+    js_componentFinalizer,
+};
+
+static void js_nodeFinalizer(JSRuntime *runtime, JSValue value)
+{
+    ScriptRunner::DocumentNode *node = (ScriptRunner::DocumentNode *)JS_GetOpaque(value,
+        ScriptRunner::js_nodeClassId);
+    if (node) {
+        node->deleted = true;
+    }
+}
+
+static JSClassDef js_nodeClass = {
+    "Node",
+    js_nodeFinalizer,
+};
+
+static void js_partFinalizer(JSRuntime *runtime, JSValue value)
+{
+    ScriptRunner::DocumentPart *part = (ScriptRunner::DocumentPart *)JS_GetOpaque(value,
+        ScriptRunner::js_partClassId);
+    if (part) {
+        part->deleted = true;
+    }
+}
+
+static JSClassDef js_partClass = {
+    "Part",
+    js_partFinalizer,
+};
+
+void ScriptRunner::run()
+{
+    QElapsedTimer countTimeConsumed;
+    countTimeConsumed.start();
+    
+    // Warning: Not thread safe, but we have only one script instance running, so it doesn't matter
+    js_canvasClassId = JS_NewClassID(&js_canvasClassId);
+    js_partClassId = JS_NewClassID(&js_partClassId);
+    js_componentClassId = JS_NewClassID(&js_componentClassId);
+    js_nodeClassId = JS_NewClassID(&js_nodeClassId);
+    
+    m_defaultVariables = new std::map<QString, std::map<QString, QString>>;
+
+    JSRuntime *runtime = JS_NewRuntime();
+    JSContext *context = JS_NewContext(runtime);
+    
+    JS_NewClass(runtime, js_partClassId, &js_partClass);
+    JS_NewClass(runtime, js_componentClassId, &js_componentClass);
+    JS_NewClass(runtime, js_nodeClassId, &js_nodeClass);
+    
+    JS_SetContextOpaque(context, this);
+    
+    if (nullptr != m_script &&
+            !m_script->trimmed().isEmpty()) {
+        auto buffer = m_script->toUtf8();
+        
+        JSValue globalObject = JS_GetGlobalObject(context);
+        
+        JSValue document = JS_NewObject(context);
+        
+            JS_SetPropertyStr(context,
+                document, "createComponent",
+                JS_NewCFunction(context, js_createComponent, "createComponent", 1));
+            JS_SetPropertyStr(context,
+                document, "createPart",
+                JS_NewCFunction(context, js_createPart, "createPart", 1));
+            JS_SetPropertyStr(context,
+                document, "createNode",
+                JS_NewCFunction(context, js_createNode, "createNode", 1));
+            JS_SetPropertyStr(context,
+                document, "createFloatInput",
+                JS_NewCFunction(context, js_createFloatInput, "createFloatInput", 4));
+            JS_SetPropertyStr(context,
+                document, "createIntInput",
+                JS_NewCFunction(context, js_createIntInput, "createIntInput", 4));
+            JS_SetPropertyStr(context,
+                document, "createColorInput",
+                JS_NewCFunction(context, js_createColorInput, "createColorInput", 2));
+            JS_SetPropertyStr(context,
+                document, "createCheckInput",
+                JS_NewCFunction(context, js_createCheckInput, "createCheckInput", 2));
+            JS_SetPropertyStr(context,
+                document, "createSelectInput",
+                JS_NewCFunction(context, js_createSelectInput, "createSelectInput", 3));
+            JS_SetPropertyStr(context,
+                document, "connect",
+                JS_NewCFunction(context, js_connect, "connect", 2));
+            JS_SetPropertyStr(context,
+                document, "setAttribute",
+                JS_NewCFunction(context, js_setAttribute, "setAttribute", 3));
+            JS_SetPropertyStr(context,
+                document, "attribute",
+                JS_NewCFunction(context, js_attribute, "attribute", 2));
+        
+            JSValue canvas = JS_NewObjectClass(context, ScriptRunner::js_canvasClassId);
+            JS_SetOpaque(canvas, &m_canvas);
+            JS_SetPropertyStr(context,
+                document, "canvas",
+                canvas);
+        
+        JS_SetPropertyStr(context, globalObject, "document", document);
+        
+        JSValue console = JS_NewObject(context);
+        JS_SetPropertyStr(context,
+            console, "log",
+            JS_NewCFunction(context, js_print, "log", 1));
+        JS_SetPropertyStr(context,
+            console, "warn",
+            JS_NewCFunction(context, js_print, "warn", 1));
+        JS_SetPropertyStr(context,
+            console, "error",
+            JS_NewCFunction(context, js_print, "error", 1));
+        JS_SetPropertyStr(context, globalObject, "console", console);
+        
+        QFile file(":/thirdparty/three.js/dust3d.three.js");
+        if (file.open(QIODevice::ReadOnly)) {
+            QByteArray fileContent = file.readAll();
+            JSValue three = JS_NewObject(context);
+            JS_SetPropertyStr(context, globalObject, "THREE", three);
+            JSValue object = JS_Eval(context, (char *)fileContent.constData(), fileContent.size(), "<thirdparty/three.js/dust3d.three.js>",
+                  JS_EVAL_TYPE_GLOBAL);
+            JS_FreeValue(context, object);
+            file.close();
+        }
+        
+        JS_FreeValue(context, globalObject);
+        
+        JSValue object = JS_Eval(context, buffer.constData(), buffer.size(), "<input>",
+            JS_EVAL_TYPE_GLOBAL);
+        if (JS_IsException(object)) {
+            JSValue exceptionValue = JS_GetException(context);
+            bool isError = JS_IsError(context, exceptionValue);
+            if (isError) {
+                m_scriptError += "Throw: ";
+                const char *exceptionError = JS_ToCString(context, exceptionValue);
+                m_scriptError += exceptionError;
+                m_scriptError += "\r\n";
+                JS_FreeCString(context, exceptionError);
+                JSValue value = JS_GetPropertyStr(context, exceptionValue, "stack");
+                if (!JS_IsUndefined(value)) {
+                    const char *stack = JS_ToCString(context, value);
+                    m_scriptError += stack;
+                    m_scriptError += "\r\n";
+                    JS_FreeCString(context, stack);
+                }
+                JS_FreeValue(context, value);
+                
+                qDebug() << "QuickJS" << m_scriptError;
+            }
+        } else {
+            generateSnapshot();
+            const char *objectString = JS_ToCString(context, object);
+            qDebug() << "Result:" << objectString;
+            JS_FreeCString(context, objectString);
+        }
+        
+        JS_FreeValue(context, object);
+    }
+    
+    JS_FreeContext(context);
+    JS_FreeRuntime(runtime);
+    
+    qDebug() << "The script run" << countTimeConsumed.elapsed() << "milliseconds";
+}
+
+void ScriptRunner::generateSnapshot()
+{
+    m_resultSnapshot = new Snapshot;
+    std::map<void *, QString> pointerToIdMap;
+    
+    std::map<void *, QStringList> componentChildrensMap;
+    
+    QStringList rootChildren;
+    
+    m_resultSnapshot->canvas = m_canvas.attributes;
+    
+    for (const auto &it: m_components) {
+        QString idString = it->id;
+        pointerToIdMap[it] = idString;
+        auto &component = m_resultSnapshot->components[idString];
+        component = it->attributes;
+        component["id"] = idString;
+        componentChildrensMap[it->parentComponent].append(idString);
+        if (nullptr == it->parentComponent)
+            rootChildren.append(idString);
+    }
+    m_resultSnapshot->rootComponent["children"] = rootChildren.join(",");
+    
+    for (const auto &it: m_components) {
+        const auto &idString = pointerToIdMap[it];
+        auto &component = m_resultSnapshot->components[idString];
+        auto &childrens = componentChildrensMap[it];
+        if (!childrens.empty())
+            component["children"] = childrens.join(",");
+    }
+    
+    for (const auto &it: m_parts) {
+        auto findComponent = pointerToIdMap.find(it->component);
+        if (findComponent == pointerToIdMap.end()) {
+            m_scriptError += "Find component pointer failed, component maybe deleted\r\n";
+            continue;
+        }
+        
+        QString idString = it->id;
+        pointerToIdMap[it] = idString;
+        auto &part = m_resultSnapshot->parts[idString];
+        part = it->attributes;
+        part.insert({"visible", "true"});
+        part["id"] = idString;
+        
+        auto &component = m_resultSnapshot->components[findComponent->second];
+        component["linkData"] = idString;
+        component["linkDataType"] = "partId";
+    }
+    for (const auto &it: m_nodes) {
+        auto findPart = pointerToIdMap.find(it->part);
+        if (findPart == pointerToIdMap.end()) {
+            m_scriptError += "Find part pointer failed, part maybe deleted\r\n";
+            continue;
+        }
+        QString idString = it->id;
+        pointerToIdMap[it] = idString;
+        auto &node = m_resultSnapshot->nodes[idString];
+        node = it->attributes;
+        node["id"] = idString;
+        node["partId"] = findPart->second;
+    }
+    for (const auto &it: m_edges) {
+        if (it.first->part != it.second->part) {
+            m_scriptError += "Cannot connect nodes come from different parts\r\n";
+            continue;
+        }
+        auto findFirstNode = pointerToIdMap.find(it.first);
+        if (findFirstNode == pointerToIdMap.end()) {
+            m_scriptError += "Find first node pointer failed, node maybe deleted\r\n";
+            continue;
+        }
+        auto findSecondNode = pointerToIdMap.find(it.second);
+        if (findSecondNode == pointerToIdMap.end()) {
+            m_scriptError += "Find second node pointer failed, node maybe deleted\r\n";
+            continue;
+        }
+        auto findPart = pointerToIdMap.find(it.first->part);
+        if (findPart == pointerToIdMap.end()) {
+            m_scriptError += "Find part pointer failed, part maybe deleted\r\n";
+            continue;
+        }
+        QString idString = QUuid::createUuid().toString();
+        auto &edge = m_resultSnapshot->edges[idString];
+        edge["id"] = idString;
+        edge["from"] = findFirstNode->second;
+        edge["to"] = findSecondNode->second;
+        edge["partId"] = findPart->second;
+    }
+    
+    for (const auto &it: m_resultSnapshot->nodes) {
+        qDebug() << "Generated node:" << it.second;
+    }
+    for (const auto &it: m_resultSnapshot->edges) {
+        qDebug() << "Generated edge:" << it.second;
+    }
+    for (const auto &it: m_resultSnapshot->parts) {
+        qDebug() << "Generated part:" << it.second;
+    }
+    for (const auto &it: m_resultSnapshot->components) {
+        qDebug() << "Generated component:" << it.second;
+    }
+}
+
+QString ScriptRunner::createInput(const QString &name, const std::map<QString, QString> &attributes)
+{
+    if (nullptr != m_defaultVariables) {
+        if (m_defaultVariables->find(name) != m_defaultVariables->end()) {
+            m_scriptError += "Repeated variable name found: \"" + name + "\"\r\n";
+        }
+        (*m_defaultVariables)[name] = attributes;
+    }
+    if (nullptr != m_variables) {
+        auto findVariable = m_variables->find(name);
+        if (findVariable != m_variables->end()) {
+            auto findValue = findVariable->second.find("value");
+            if (findValue != findVariable->second.end())
+                return findValue->second;
+        }
+    }
+    auto findValue = attributes.find("value");
+    if (findValue != attributes.end())
+        return findValue->second;
+    return QString();
+}
+
+float ScriptRunner::createFloatInput(const QString &name, float defaultValue, float minValue, float maxValue)
+{
+    std::map<QString, QString> attributes;
+    attributes["input"] = "Float";
+    attributes["value"] = QString::number(defaultValue);
+    attributes["defaultValue"] = attributes["value"];
+    attributes["minValue"] = QString::number(minValue);
+    attributes["maxValue"] = QString::number(maxValue);
+    auto inputValue = createInput(name, attributes);
+    return inputValue.toFloat();
+}
+
+int ScriptRunner::createIntInput(const QString &name, int defaultValue, int minValue, int maxValue)
+{
+    std::map<QString, QString> attributes;
+    attributes["input"] = "Int";
+    attributes["value"] = QString::number(defaultValue);
+    attributes["defaultValue"] = attributes["value"];
+    attributes["minValue"] = QString::number(minValue);
+    attributes["maxValue"] = QString::number(maxValue);
+    auto inputValue = createInput(name, attributes);
+    return inputValue.toInt();
+}
+
+QColor ScriptRunner::createColorInput(const QString &name, const QColor &defaultValue)
+{
+    std::map<QString, QString> attributes;
+    attributes["input"] = "Color";
+    attributes["value"] = defaultValue.name();
+    attributes["defaultValue"] = attributes["value"];
+    auto inputValue = createInput(name, attributes);
+    return QColor(inputValue);
+}
+
+bool ScriptRunner::createCheckInput(const QString &name, bool checked)
+{
+    std::map<QString, QString> attributes;
+    attributes["input"] = "Check";
+    attributes["value"] = checked ? "true" : "false";
+    attributes["defaultValue"] = attributes["value"];
+    auto inputValue = createInput(name, attributes);
+    return isTrueValueString(inputValue);
+}
+
+int ScriptRunner::createSelectInput(const QString &name, int defaultSelectedIndex, const QStringList &options)
+{
+    std::map<QString, QString> attributes;
+    attributes["input"] = "Select";
+    attributes["value"] = QString::number(defaultSelectedIndex);
+    attributes["defaultValue"] = attributes["value"];
+    attributes["length"] = QString::number(options.size());
+    for (int i = 0; i < options.size(); ++i) {
+        attributes["option" + QString::number(i)] = options[i];
+    }
+    auto inputValue = createInput(name, attributes);
+    int selectedIndex = inputValue.toInt();
+    if (selectedIndex >= options.size()) {
+        m_scriptError += QString("Selected index of select input \"%1\" is been reset to 0 because of out of range\r\n").arg(name);
+        selectedIndex = 0;
+    }
+    return selectedIndex;
+}
+
+void ScriptRunner::process()
+{
+    run();
+    emit finished();
+}
+
+void ScriptRunner::setScript(QString *script)
+{
+    m_script = script;
+}
+
+void ScriptRunner::setVariables(std::map<QString, std::map<QString, QString>> *variables)
+{
+    m_variables = variables;
+}
+
+Snapshot *ScriptRunner::takeResultSnapshot()
+{
+    Snapshot *snapshot = m_resultSnapshot;
+    m_resultSnapshot = nullptr;
+    return snapshot;
+}
+
+std::map<QString, std::map<QString, QString>> *ScriptRunner::takeDefaultVariables()
+{
+    std::map<QString, std::map<QString, QString>> *defaultVariables = m_defaultVariables;
+    m_defaultVariables = nullptr;
+    return defaultVariables;
+}
+
+void ScriptRunner::mergeVaraibles(std::map<QString, std::map<QString, QString>> *target, const std::map<QString, std::map<QString, QString>> &source)
+{
+    for (const auto &it: source) {
+        (*target)[it.first] = it.second;
+    }
+}
diff --git a/src/scriptrunner.h b/src/scriptrunner.h
new file mode 100755
index 00000000..9f1d8cbf
--- /dev/null
+++ b/src/scriptrunner.h
@@ -0,0 +1,114 @@
+#ifndef DUST3D_SCRIPT_RUNNER_H
+#define DUST3D_SCRIPT_RUNNER_H
+#include <QObject>
+#include <QUuid>
+#include <QColor>
+#include <QStringList>
+#include "snapshot.h"
+extern "C" {
+#include "quickjs.h"
+}
+
+class ScriptRunner : public QObject
+{
+    Q_OBJECT
+public:
+    enum class DocumentElementType
+    {
+        Unknown = 0,
+        Canvas,
+        Component,
+        Part,
+        Node
+    };
+
+    struct DocumentElement
+    {
+        QString id = QUuid::createUuid().toString();
+        DocumentElementType type = DocumentElementType::Unknown;
+        bool deleted = false;
+        std::map<QString, QString> attributes = {std::make_pair("id", id)};
+    };
+    
+    struct DocumentComponent : DocumentElement
+    {
+        DocumentComponent()
+        {
+            type = DocumentElementType::Component;
+        }
+        DocumentComponent *parentComponent = nullptr;
+    };
+
+    struct DocumentPart : DocumentElement
+    {
+        DocumentPart()
+        {
+            type = DocumentElementType::Part;
+        }
+        DocumentComponent *component = nullptr;
+    };
+    
+    struct DocumentNode : DocumentElement
+    {
+        DocumentNode()
+        {
+            type = DocumentElementType::Node;
+        }
+        DocumentPart *part = nullptr;
+    };
+    
+    struct DocumentCanvas : DocumentElement
+    {
+        DocumentCanvas()
+        {
+            type = DocumentElementType::Canvas;
+        }
+    };
+    
+    ScriptRunner();
+    ~ScriptRunner();
+    void run();
+    void setScript(QString *script);
+    void setVariables(std::map<QString, std::map<QString, QString>> *variables);
+    Snapshot *takeResultSnapshot();
+    std::map<QString, std::map<QString, QString>> *takeDefaultVariables();
+    const QString &scriptError();
+    static void mergeVaraibles(std::map<QString, std::map<QString, QString>> *target, const std::map<QString, std::map<QString, QString>> &source);
+    DocumentPart *createPart(DocumentComponent *component);
+    DocumentComponent *createComponent(DocumentComponent *parentComponent);
+    DocumentNode *createNode(DocumentPart *part);
+    bool setAttribute(DocumentElement *element, const QString &name, const QString &value);
+    QString attribute(DocumentElement *element, const QString &name);
+    void connect(DocumentNode *firstNode, DocumentNode *secondNode);
+    QString &consoleLog();
+    QString createInput(const QString &name, const std::map<QString, QString> &attributes);
+    float createFloatInput(const QString &name, float defaultValue, float minValue, float maxValue);
+    int createIntInput(const QString &name, int defaultValue, int minValue, int maxValue);
+    QColor createColorInput(const QString &name, const QColor &defaultValue);
+    bool createCheckInput(const QString &name, bool checked);
+    int createSelectInput(const QString &name, int defaultSelectedIndex, const QStringList &options);
+signals:
+    void finished();
+public slots:
+    void process();
+private:
+    QString *m_script = nullptr;
+    Snapshot *m_resultSnapshot = nullptr;
+    std::map<QString, std::map<QString, QString>> *m_defaultVariables = nullptr;
+    std::map<QString, std::map<QString, QString>> *m_variables = nullptr;
+    std::vector<DocumentPart *> m_parts;
+    std::vector<DocumentComponent *> m_components;
+    std::vector<DocumentNode *> m_nodes;
+    std::vector<std::pair<DocumentNode *, DocumentNode *>> m_edges;
+    QString m_scriptError;
+    QString m_consoleLog;
+    DocumentCanvas m_canvas;
+    void generateSnapshot();
+public:
+    static JSClassID js_canvasClassId;
+    static JSClassID js_partClassId;
+    static JSClassID js_componentClassId;
+    static JSClassID js_nodeClassId;
+};
+
+#endif
diff --git a/src/scriptvariableswidget.cpp b/src/scriptvariableswidget.cpp
new file mode 100755
index 00000000..17206de3
--- /dev/null
+++ b/src/scriptvariableswidget.cpp
@@ -0,0 +1,194 @@
+#include <QDoubleSpinBox>
+#include <QFormLayout>
+#include <QDebug>
+#include <QCheckBox>
+#include <QComboBox>
+#include <QLabel>
+#include <QColorDialog>
+#include "scriptvariableswidget.h"
+#include "util.h"
+#include "theme.h"
+#include "floatnumberwidget.h"
+#include "intnumberwidget.h"
+
+ScriptVariablesWidget::ScriptVariablesWidget(const Document *document,
+        QWidget *parent) :
+    QScrollArea(parent),
+    m_document(document)
+{
+    connect(this, &ScriptVariablesWidget::updateVariableValue, m_document, &Document::updateVariableValue);
+
+    setWidgetResizable(true);
+    
+    reload();
+}
+
+void ScriptVariablesWidget::reload()
+{
+    QWidget *widget = new QWidget;
+    QFormLayout *formLayout = new QFormLayout;
+    for (const auto &variable: m_document->variables()) {
+        auto name = variable.first;
+        auto input = valueOfKeyInMapOrEmpty(variable.second, "input");
+        if ("Float" == input) {
+            auto minValue = valueOfKeyInMapOrEmpty(variable.second, "minValue").toFloat();
+            auto maxValue = valueOfKeyInMapOrEmpty(variable.second, "maxValue").toFloat();
+            auto value = valueOfKeyInMapOrEmpty(variable.second, "value").toFloat();
+            auto defaultValue = valueOfKeyInMapOrEmpty(variable.second, "defaultValue").toFloat();
+            FloatNumberWidget *floatWidget = new FloatNumberWidget;
+            floatWidget->setItemName(name);
+            floatWidget->setRange(minValue, maxValue);
+            floatWidget->setValue(value);
+            
+            connect(floatWidget, &FloatNumberWidget::valueChanged, [=](float toValue) {
+                emit updateVariableValue(name, QString::number(toValue));
+            });
+            
+            QPushButton *floatEraser = new QPushButton(QChar(fa::eraser));
+            Theme::initAwesomeToolButton(floatEraser);
+            
+            connect(floatEraser, &QPushButton::clicked, [=]() {
+                floatWidget->setValue(defaultValue);
+            });
+            
+            QHBoxLayout *floatLayout = new QHBoxLayout;
+            floatLayout->addWidget(floatEraser);
+            floatLayout->addWidget(floatWidget);
+            
+            formLayout->addRow(floatLayout);
+        } else if ("Int" == input) {
+            auto minValue = valueOfKeyInMapOrEmpty(variable.second, "minValue").toInt();
+            auto maxValue = valueOfKeyInMapOrEmpty(variable.second, "maxValue").toInt();
+            auto value = valueOfKeyInMapOrEmpty(variable.second, "value").toInt();
+            auto defaultValue = valueOfKeyInMapOrEmpty(variable.second, "defaultValue").toInt();
+            IntNumberWidget *intWidget = new IntNumberWidget;
+            intWidget->setItemName(name);
+            intWidget->setRange(minValue, maxValue);
+            intWidget->setValue(value);
+            
+            connect(intWidget, &IntNumberWidget::valueChanged, [=](int toValue) {
+                emit updateVariableValue(name, QString::number(toValue));
+            });
+            
+            QPushButton *intEraser = new QPushButton(QChar(fa::eraser));
+            Theme::initAwesomeToolButton(intEraser);
+            
+            connect(intEraser, &QPushButton::clicked, [=]() {
+                intWidget->setValue(defaultValue);
+            });
+            
+            QHBoxLayout *intLayout = new QHBoxLayout;
+            intLayout->addWidget(intEraser);
+            intLayout->addWidget(intWidget);
+            
+            formLayout->addRow(intLayout);
+        } else if ("Check" == input) {
+            auto value = isTrueValueString(valueOfKeyInMapOrEmpty(variable.second, "value"));
+            auto defaultValue = isTrueValueString(valueOfKeyInMapOrEmpty(variable.second, "defaultValue"));
+            
+            QCheckBox *checkBox = new QCheckBox;
+            Theme::initCheckbox(checkBox);
+            checkBox->setText(name);
+            checkBox->setChecked(value);
+            
+            connect(checkBox, &QCheckBox::stateChanged, [=](int) {
+                emit updateVariableValue(name, checkBox->isChecked() ? "true" : "false");
+            });
+            
+            QPushButton *checkEraser = new QPushButton(QChar(fa::eraser));
+            Theme::initAwesomeToolButton(checkEraser);
+            
+            connect(checkEraser, &QPushButton::clicked, [=]() {
+                checkBox->setChecked(defaultValue);
+            });
+            
+            QHBoxLayout *checkLayout = new QHBoxLayout;
+            checkLayout->addWidget(checkEraser);
+            checkLayout->addWidget(checkBox);
+            
+            formLayout->addRow(checkLayout);
+        } else if ("Select" == input) {
+            auto value = valueOfKeyInMapOrEmpty(variable.second, "value").toInt();
+            auto defaultValue = valueOfKeyInMapOrEmpty(variable.second, "defaultValue").toInt();
+            auto length = valueOfKeyInMapOrEmpty(variable.second, "length").toInt();
+            
+            QComboBox *selectBox = new QComboBox;
+            selectBox->setEditable(false);
+            selectBox->setSizeAdjustPolicy(QComboBox::AdjustToContents);
+            for (auto i = 0; i < length; ++i) {
+                selectBox->addItem(valueOfKeyInMapOrEmpty(variable.second, "option" + QString::number(i)));
+            }
+            selectBox->setCurrentIndex(value);
+            
+            connect(selectBox, static_cast<void (QComboBox::*)(int)>(&QComboBox::currentIndexChanged), [=](int index) {
+                emit updateVariableValue(name, QString::number(index));
+            });
+            
+            QPushButton *selectEraser = new QPushButton(QChar(fa::eraser));
+            Theme::initAwesomeToolButton(selectEraser);
+            
+            connect(selectEraser, &QPushButton::clicked, [=]() {
+                selectBox->setCurrentIndex(defaultValue);
+            });
+            
+            QLabel *selectLabel = new QLabel;
+            selectLabel->setText(name);
+            
+            QHBoxLayout *selectLayout = new QHBoxLayout;
+            selectLayout->addWidget(selectEraser);
+            selectLayout->addWidget(selectBox);
+            selectLayout->addWidget(selectLabel);
+            
+            formLayout->addRow(selectLayout);
+        } else if ("Color" == input) {
+            auto value = valueOfKeyInMapOrEmpty(variable.second, "value");
+            auto defaultValue = valueOfKeyInMapOrEmpty(variable.second, "defaultValue");
+            
+            QPushButton *colorEraser = new QPushButton(QChar(fa::eraser));
+            Theme::initAwesomeToolButton(colorEraser);
+            
+            QPushButton *pickButton = new QPushButton();
+            Theme::initAwesomeToolButtonWithoutFont(pickButton);
+            
+            auto updatePickButtonColor = [=](const QColor &color) {
+                QPalette palette = pickButton->palette();
+                palette.setColor(QPalette::Window, color);
+                palette.setColor(QPalette::Button, color);
+                pickButton->setPalette(palette);
+            };
+            updatePickButtonColor(QColor(value));
+
+            connect(colorEraser, &QPushButton::clicked, [=]() {
+                updatePickButtonColor(defaultValue);
+                emit updateVariableValue(name, defaultValue);
+            });
+            
+            connect(pickButton, &QPushButton::clicked, [=]() {
+                QColor color = QColorDialog::getColor(value, this);
+                if (color.isValid()) {
+                    updatePickButtonColor(color.name());
+                    emit updateVariableValue(name, color.name());
+                }
+            });
+            
+            QLabel *selectLabel = new QLabel;
+            selectLabel->setText(name);
+            
+            QHBoxLayout *colorLayout = new QHBoxLayout;
+            colorLayout->addWidget(colorEraser);
+            colorLayout->addWidget(pickButton);
+            colorLayout->addWidget(selectLabel);
+            colorLayout->addStretch();
+            
+            formLayout->addRow(colorLayout);
+        }
+    }
+    widget->setLayout(formLayout);
+    
+    setWidget(widget);
+}
+
+QSize ScriptVariablesWidget::sizeHint() const
+{
+    return QSize(Theme::sidebarPreferredWidth, 0);
+}
diff --git a/src/scriptvariableswidget.h b/src/scriptvariableswidget.h
new file mode 100755
index 00000000..a8084d87
--- /dev/null
+++ b/src/scriptvariableswidget.h
@@ -0,0 +1,25 @@
+#ifndef DUST3D_SCRIPT_VARIABLES_WIDGET_H
+#define DUST3D_SCRIPT_VARIABLES_WIDGET_H
+#include <QWidget>
+#include <QString>
+#include <map>
+#include <QScrollArea>
+#include "document.h"
+
+class ScriptVariablesWidget : public QScrollArea
+{
+    Q_OBJECT
+signals:
+    void updateVariableValue(const QString &name, const QString &value);
+public:
+    ScriptVariablesWidget(const Document *document,
+        QWidget *parent=nullptr);
+public slots:
+    void reload();
+protected:
+    QSize sizeHint() const override;
+private:
+    const Document *m_document = nullptr;
+};
+
+#endif
diff --git a/src/scriptwidget.cpp b/src/scriptwidget.cpp
new file mode 100755
index 00000000..adbeddde
--- /dev/null
+++ b/src/scriptwidget.cpp
@@ -0,0 +1,68 @@
+#include <QVBoxLayout>
+#include <QSplitter>
+#include "scriptwidget.h"
+#include "scripteditwidget.h"
+#include "theme.h"
+
+ScriptWidget::ScriptWidget(const Document *document, QWidget *parent) :
+    QWidget(parent),
+    m_document(document)
+{
+    m_consoleEdit = new QPlainTextEdit;
+    m_consoleEdit->setReadOnly(true);
+    m_consoleEdit->hide();
+    
+    ScriptVariablesWidget *scriptVariablesWidget = new ScriptVariablesWidget(m_document);
+    scriptVariablesWidget->hide();
+    connect(m_document, &Document::mergedVaraiblesChanged, this, [=]() {
+        if (m_document->variables().empty())
+            scriptVariablesWidget->hide();
+        else
+            scriptVariablesWidget->show();
+    });
+    
+    ScriptEditWidget *scriptEditWidget = new ScriptEditWidget;
+
+    connect(m_document, &Document::cleanupScript, scriptEditWidget, &ScriptEditWidget::clear);
+    connect(m_document, &Document::scriptModifiedFromExternal, this, [=]() {
+        scriptEditWidget->setPlainText(document->script());
+    });
+    connect(m_document, &Document::scriptErrorChanged, this, &ScriptWidget::updateScriptConsole);
+    connect(m_document, &Document::scriptConsoleLogChanged, this, &ScriptWidget::updateScriptConsole);
+
+    connect(scriptEditWidget, &ScriptEditWidget::scriptChanged, m_document, &Document::updateScript);
+    
+    connect(m_document, &Document::mergedVaraiblesChanged, scriptVariablesWidget, &ScriptVariablesWidget::reload);
+    
+    scriptEditWidget->setStyleSheet("color: white;");
+    m_consoleEdit->setStyleSheet("color: white;");
+    
+    QSplitter *splitter = new QSplitter;
+    splitter->setOrientation(Qt::Vertical);
+    splitter->addWidget(scriptEditWidget);
+    splitter->addWidget(m_consoleEdit);
+    splitter->addWidget(scriptVariablesWidget);
+    splitter->setStretchFactor(2, 1);
+    
+    QVBoxLayout *mainLayout = new QVBoxLayout;
+    mainLayout->addWidget(splitter);
+    setLayout(mainLayout);
+}
+
+QSize ScriptWidget::sizeHint() const
+{
+    return QSize(Theme::sidebarPreferredWidth, 0);
+}
+
+void ScriptWidget::updateScriptConsole()
+{
+    const auto &scriptError = m_document->scriptError();
+    const auto &scriptConsoleLog = m_document->scriptConsoleLog();
+    if (scriptError.isEmpty() && scriptConsoleLog.isEmpty()) {
+        m_consoleEdit->hide();
+    } else {
+        m_consoleEdit->setPlainText(scriptError + scriptConsoleLog);
+        m_consoleEdit->show();
+    }
+}
+
diff --git a/src/scriptwidget.h b/src/scriptwidget.h
new file mode 100755
index 00000000..b8e77738
--- /dev/null
+++ b/src/scriptwidget.h
@@ -0,0 +1,22 @@
+#ifndef SCRIPT_WIDGET_H
+#define SCRIPT_WIDGET_H
+#include <QWidget>
+#include <QPlainTextEdit>
+#include "document.h"
+#include "scriptvariableswidget.h"
+
+class ScriptWidget : public QWidget
+{
+    Q_OBJECT
+public:
+    ScriptWidget(const Document *document, QWidget *parent=nullptr);
+public slots:
+    void updateScriptConsole();
+protected:
+    QSize sizeHint() const override;
+private:
+    const Document *m_document = nullptr;
+    QPlainTextEdit *m_consoleEdit = nullptr;
+};
+
+#endif
diff --git a/src/variablesxml.cpp b/src/variablesxml.cpp
new file mode 100755
index 00000000..c8e7ae72
--- /dev/null
+++ b/src/variablesxml.cpp
@@ -0,0 +1,64 @@
+#include <QDebug>
+#include "variablesxml.h"
+
+void saveVariablesToXmlStream(const std::map<QString, std::map<QString, QString>> &variables, QXmlStreamWriter *writer)
+{
+    writer->setAutoFormatting(true);
+    writer->writeStartDocument();
+    
+    writer->writeStartElement("variables");
+        for (const auto &it: variables) {
+            writer->writeStartElement("variable");
+                writer->writeAttribute("name", it.first);
+                for (const auto &subIt: it.second) {
+                    if (subIt.first == "name")
+                        continue;
+                    writer->writeAttribute(subIt.first, subIt.second);
+                }
+            writer->writeEndElement();
+        }
+    writer->writeEndElement();
+    
+    writer->writeEndDocument();
+}
+
+void loadVariablesFromXmlStream(std::map<QString, std::map<QString, QString>> *variables, QXmlStreamReader &reader)
+{
+    std::vector<QString> elementNameStack;
+    while (!reader.atEnd()) {
+        reader.readNext();
+        if (!reader.isStartElement() && !reader.isEndElement()) {
+            if (!reader.name().toString().isEmpty())
+                qDebug() << "Skip xml element:" << reader.name().toString() << " tokenType:" << reader.tokenType();
+            continue;
+        }
+        QString baseName = reader.name().toString();
+        if (reader.isStartElement())
+            elementNameStack.push_back(baseName);
+        QStringList nameItems;
+        for (const auto &nameItem: elementNameStack) {
+            nameItems.append(nameItem);
+        }
+        QString fullName = nameItems.join(".");
+        if (reader.isEndElement())
+            elementNameStack.pop_back();
+        if (reader.isStartElement()) {
+            if (fullName == "variables.variable") {
+                QString variableName;
+                std::map<QString, QString> map;
+                foreach(const QXmlStreamAttribute &attr, reader.attributes()) {
+                    auto attrNameString = attr.name().toString();
+                    auto attrValueString = attr.value().toString();
+                    if ("name" == attrNameString) {
+                        variableName = attrValueString;
+                    } else {
+                        map[attrNameString] = attrValueString;
+                    }
+                }
+                if (!variableName.isEmpty()) {
+                    (*variables)[variableName] = map;
+                }
+            }
+        }
+    }
+}
diff --git a/src/variablesxml.h b/src/variablesxml.h
new file mode 100755
index 00000000..114fb8cc
--- /dev/null
+++ b/src/variablesxml.h
@@ -0,0 +1,9 @@
+#ifndef DUST3D_VARIABLES_XML_H
+#define DUST3D_VARIABLES_XML_H
+#include <QXmlStreamWriter>
+#include <map>
+
+void saveVariablesToXmlStream(const std::map<QString, std::map<QString, QString>> &variables, QXmlStreamWriter *writer);
+void loadVariablesFromXmlStream(std::map<QString, std::map<QString, QString>> *variables, QXmlStreamReader &reader);
+
+#endif
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/Makefile b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/Makefile
new file mode 100755
index 00000000..7ca93f08
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/Makefile
@@ -0,0 +1,463 @@
+#
+# QuickJS Javascript Engine
+# 
+# Copyright (c) 2017-2019 Fabrice Bellard
+# Copyright (c) 2017-2019 Charlie Gordon
+#
+# Permission is hereby granted, free of charge, to any person obtaining a copy
+# of this software and associated documentation files (the "Software"), to deal
+# in the Software without restriction, including without limitation the rights
+# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+# copies of the Software, and to permit persons to whom the Software is
+# furnished to do so, subject to the following conditions:
+#
+# The above copyright notice and this permission notice shall be included in
+# all copies or substantial portions of the Software.
+#
+# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+# THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+# THE SOFTWARE.
+
+ifeq ($(shell uname -s),Darwin)
+CONFIG_DARWIN=y
+endif
+# Windows cross compilation from Linux
+#CONFIG_WIN32=y
+# use link time optimization (smaller and faster executables but slower build)
+CONFIG_LTO=y
+# consider warnings as errors (for development)
+#CONFIG_WERROR=y
+
+ifndef CONFIG_WIN32
+# force 32 bit build for some utilities
+CONFIG_M32=y
+endif
+ifdef CONFIG_DARWIN
+# use clang instead of gcc
+CONFIG_CLANG=y
+CONFIG_DEFAULT_AR=y
+endif
+
+# installation directory
+prefix=/usr/local
+
+# use the gprof profiler
+#CONFIG_PROFILE=y
+# use address sanitizer
+#CONFIG_ASAN=y
+
+OBJDIR=.obj
+
+ifdef CONFIG_WIN32
+  CROSS_PREFIX=i686-w64-mingw32-
+  EXE=.exe
+else
+  CROSS_PREFIX=
+  EXE=
+endif
+ifdef CONFIG_CLANG
+  CC=$(CROSS_PREFIX)clang
+  CFLAGS=-g -Wall -MMD -MF $(OBJDIR)/$(@F).d
+  CFLAGS += -Wextra
+  CFLAGS += -Wno-sign-compare
+  CFLAGS += -Wno-missing-field-initializers
+  CFLAGS += -Wundef -Wuninitialized
+  CFLAGS += -Wunused -Wno-unused-parameter
+  CFLAGS += -Wwrite-strings
+  CFLAGS += -Wchar-subscripts -funsigned-char
+  CFLAGS += -MMD -MF $(OBJDIR)/$(@F).d
+  ifdef CONFIG_DEFAULT_AR
+    AR=$(CROSS_PREFIX)ar
+  else
+    ifdef CONFIG_LTO
+      AR=$(CROSS_PREFIX)llvm-ar
+    else
+      AR=$(CROSS_PREFIX)ar
+    endif
+  endif
+else
+  CC=$(CROSS_PREFIX)gcc
+  CFLAGS=-g -Wall -MMD -MF $(OBJDIR)/$(@F).d
+  CFLAGS += -Wno-array-bounds
+  ifdef CONFIG_LTO
+    AR=$(CROSS_PREFIX)gcc-ar
+  else
+    AR=$(CROSS_PREFIX)ar
+  endif
+endif
+ifdef CONFIG_WERROR
+CFLAGS+=-Werror
+endif
+DEFINES:=-D_GNU_SOURCE -DCONFIG_VERSION=\"$(shell cat VERSION)\"
+CFLAGS+=$(DEFINES)
+CFLAGS_DEBUG=$(CFLAGS) -O0
+CFLAGS_SMALL=$(CFLAGS) -Os
+CFLAGS_OPT=$(CFLAGS) -O2
+CFLAGS_NOLTO:=$(CFLAGS_OPT)
+LDFLAGS=-g
+ifdef CONFIG_LTO
+CFLAGS_SMALL+=-flto
+CFLAGS_OPT+=-flto
+LDFLAGS+=-flto
+endif
+ifdef CONFIG_PROFILE
+CFLAGS+=-p
+LDFLAGS+=-p
+endif
+ifdef CONFIG_ASAN
+CFLAGS+=-fsanitize=address
+LDFLAGS+=-fsanitize=address
+endif
+ifdef CONFIG_WIN32
+LDEXPORT=
+else
+LDEXPORT=-rdynamic
+endif
+
+PROGS=qjs$(EXE) qjsbn$(EXE) qjsc qjsbnc run-test262 run-test262-bn
+ifndef CONFIG_WIN32
+PROGS+=qjscalc
+endif
+ifdef CONFIG_M32
+PROGS+=qjs32 qjs32_s qjsbn32
+endif
+PROGS+=libquickjs.a libquickjs.bn.a
+ifdef CONFIG_LTO
+PROGS+=libquickjs.lto.a libquickjs.bn.lto.a
+endif
+# examples
+ifdef CONFIG_ASAN
+PROGS+=
+else ifdef CONFIG_WIN32
+PROGS+=
+else
+PROGS+=examples/hello examples/hello_module examples/c_module
+endif
+
+all: $(OBJDIR) $(OBJDIR)/quickjs.check.o $(OBJDIR)/qjs.check.o $(PROGS)
+
+QJS_LIB_OBJS=$(OBJDIR)/quickjs.o $(OBJDIR)/libregexp.o $(OBJDIR)/libunicode.o $(OBJDIR)/cutils.o $(OBJDIR)/quickjs-libc.o
+
+QJSBN_LIB_OBJS=$(patsubst %.o, %.bn.o, $(QJS_LIB_OBJS)) $(OBJDIR)/libbf.bn.o
+
+QJS_OBJS=$(OBJDIR)/qjs.o $(OBJDIR)/repl.o $(QJS_LIB_OBJS)
+
+QJSBN_OBJS=$(OBJDIR)/qjs.bn.o $(OBJDIR)/repl-bn.bn.o $(OBJDIR)/qjscalc.bn.o $(QJSBN_LIB_OBJS)
+
+LIBS=-lm
+ifndef CONFIG_WIN32
+LIBS+=-ldl
+endif
+
+$(OBJDIR):
+	mkdir -p $(OBJDIR)
+
+qjs$(EXE): $(QJS_OBJS)
+	$(CC) $(LDFLAGS) $(LDEXPORT) -o $@ $^ $(LIBS)
+
+qjs-debug$(EXE): $(patsubst %.o, %.debug.o, $(QJS_OBJS))
+	$(CC) $(LDFLAGS) -o $@ $^ $(LIBS)
+
+qjsc: $(OBJDIR)/qjsc.o $(QJS_LIB_OBJS)
+	$(CC) $(LDFLAGS) -o $@ $^ $(LIBS)
+
+qjsbnc: $(OBJDIR)/qjsc.bn.o $(QJSBN_LIB_OBJS)
+	$(CC) $(LDFLAGS) -o $@ $^ $(LIBS)
+
+
+QJSC_DEFINES:=-DCONFIG_CC=\"$(CC)\"
+ifdef CONFIG_LTO
+QJSC_DEFINES+=-DCONFIG_LTO
+endif
+QJSC_DEFINES+=-DCONFIG_PREFIX=\"$(prefix)\"
+
+$(OBJDIR)/qjsc.o $(OBJDIR)/qjsc.bn.o: CFLAGS+=$(QJSC_DEFINES)
+
+qjs32: $(patsubst %.o, %.m32.o, $(QJS_OBJS))
+	$(CC) -m32 $(LDFLAGS) $(LDEXPORT) -o $@ $^ $(LIBS)
+
+qjs32_s: $(patsubst %.o, %.m32s.o, $(QJS_OBJS))
+	$(CC) -m32 $(LDFLAGS) -o $@ $^ $(LIBS)
+	@size $@
+
+qjsbn$(EXE): $(QJSBN_OBJS)
+	$(CC) $(LDFLAGS) $(LDEXPORT) -o $@ $^ $(LIBS)
+
+qjsbn32: $(patsubst %.o, %.m32.o, $(QJSBN_OBJS))
+	$(CC) -m32 $(LDFLAGS) $(LDEXPORT) -o $@ $^ $(LIBS)
+
+qjscalc: qjsbn
+	ln -sf $< $@
+
+qjsbn-debug$(EXE): $(patsubst %.o, %.debug.o, $(QJSBN_OBJS))
+	$(CC) $(LDFLAGS) -o $@ $^ $(LIBS)
+
+ifdef CONFIG_LTO
+LTOEXT=.lto
+else
+LTOEXT=
+endif
+
+libquickjs$(LTOEXT).a: $(QJS_LIB_OBJS)
+	$(AR) rcs $@ $^
+
+libquickjs.bn$(LTOEXT).a: $(QJSBN_LIB_OBJS)
+	$(AR) rcs $@ $^
+
+ifdef CONFIG_LTO
+libquickjs.a: $(patsubst %.o, %.nolto.o, $(QJS_LIB_OBJS))
+	$(AR) rcs $@ $^
+
+libquickjs.bn.a: $(patsubst %.o, %.nolto.o, $(QJSBN_LIB_OBJS))
+	$(AR) rcs $@ $^
+endif # CONFIG_LTO
+
+repl.c: qjsc repl.js 
+	./qjsc -c -o $@ -m repl.js
+
+repl-bn.c: qjsbnc repl.js 
+	./qjsbnc -c -o $@ -m repl.js
+
+qjscalc.c: qjsbnc qjscalc.js
+	./qjsbnc -c -o $@ qjscalc.js
+
+ifneq ($(wildcard unicode/UnicodeData.txt),)
+$(OBJDIR)/libunicode.o $(OBJDIR)/libunicode.m32.o $(OBJDIR)/libunicode.m32s.o $(OBJDIR)/libunicode.bn.o \
+    $(OBJDIR)/libunicode.nolto.o $(OBJDIR)/libunicode.bn.nolto.o: libunicode-table.h
+
+libunicode-table.h: unicode_gen
+	./unicode_gen unicode $@
+endif
+
+run-test262: $(OBJDIR)/run-test262.o $(QJS_LIB_OBJS)
+	$(CC) $(LDFLAGS) -o $@ $^ $(LIBS) -lpthread
+
+run-test262-bn: $(OBJDIR)/run-test262.bn.o $(QJSBN_LIB_OBJS)
+	$(CC) $(LDFLAGS) -o $@ $^ $(LIBS) -lpthread
+
+run-test262-debug: $(patsubst %.o, %.debug.o, $(OBJDIR)/run-test262.o $(QJS_LIB_OBJS))
+	$(CC) $(LDFLAGS) -o $@ $^ $(LIBS) -lpthread
+
+run-test262-32: $(patsubst %.o, %.m32.o, $(OBJDIR)/run-test262.o $(QJS_LIB_OBJS))
+	$(CC) -m32 $(LDFLAGS) -o $@ $^ $(LIBS) -lpthread
+
+run-test262-bn32: $(patsubst %.o, %.m32.o, $(OBJDIR)/run-test262.bn.o $(QJSBN_LIB_OBJS))
+	$(CC) -m32 $(LDFLAGS) -o $@ $^ $(LIBS) -lpthread
+
+# object suffix order: bn, nolto, [m32|m32s]
+
+$(OBJDIR)/%.o: %.c | $(OBJDIR)
+	$(CC) $(CFLAGS_OPT) -c -o $@ $<
+
+$(OBJDIR)/%.pic.o: %.c | $(OBJDIR)
+	$(CC) $(CFLAGS_OPT) -fPIC -DJS_SHARED_LIBRARY -c -o $@ $<
+
+$(OBJDIR)/%.bn.o: %.c | $(OBJDIR)
+	$(CC) $(CFLAGS_OPT) -DCONFIG_BIGNUM -c -o $@ $<
+
+$(OBJDIR)/%.nolto.o: %.c | $(OBJDIR)
+	$(CC) $(CFLAGS_NOLTO) -c -o $@ $<
+
+$(OBJDIR)/%.bn.nolto.o: %.c | $(OBJDIR)
+	$(CC) $(CFLAGS_NOLTO) -DCONFIG_BIGNUM -c -o $@ $<
+
+$(OBJDIR)/%.m32.o: %.c | $(OBJDIR)
+	$(CC) -m32 $(CFLAGS_OPT) -c -o $@ $<
+
+$(OBJDIR)/%.m32s.o: %.c | $(OBJDIR)
+	$(CC) -m32 $(CFLAGS_SMALL) -c -o $@ $<
+
+$(OBJDIR)/%.bn.m32.o: %.c | $(OBJDIR)
+	$(CC) -m32 $(CFLAGS_OPT) -DCONFIG_BIGNUM -c -o $@ $<
+
+$(OBJDIR)/%.debug.o: %.c | $(OBJDIR)
+	$(CC) $(CFLAGS_DEBUG) -c -o $@ $<
+
+$(OBJDIR)/%.bn.debug.o: %.c | $(OBJDIR)
+	$(CC) $(CFLAGS_DEBUG) -DCONFIG_BIGNUM -c -o $@ $<
+
+$(OBJDIR)/%.check.o: %.c | $(OBJDIR)
+	$(CC) $(CFLAGS) -DCONFIG_CHECK_JSVALUE -c -o $@ $<
+
+regexp_test: libregexp.c libunicode.c cutils.c
+	$(CC) $(LDFLAGS) $(CFLAGS) -DTEST -o $@ libregexp.c libunicode.c cutils.c $(LIBS)
+
+jscompress: jscompress.c
+	$(CC) $(LDFLAGS) $(CFLAGS) -o $@ jscompress.c
+
+unicode_gen: unicode_gen.c cutils.c libunicode.c
+	$(CC) $(LDFLAGS) $(CFLAGS) -o $@ unicode_gen.c cutils.c
+
+clean:
+	rm -f repl.c repl-bn.c qjscalc.c out.c
+	rm -f *.a *.so *.o *.d *~ jscompress unicode_gen regexp_test $(PROGS)
+	rm -f hello.c hello_module.c c_module.c 
+	rm -rf $(OBJDIR)/ *.dSYM/ qjs-debug qjsbn-debug
+	rm -rf run-test262-debug run-test262-32 run-test262-bn32
+
+install: all
+	mkdir -p "$(prefix)/bin"
+	install -m755 -s qjs qjsc qjsbn qjsbnc "$(prefix)/bin"
+	ln -sf qjsbn "$(prefix)/bin/qjscalc"
+	mkdir -p "$(prefix)/lib/quickjs"
+	install -m755 libquickjs.a libquickjs.bn.a "$(prefix)/lib/quickjs"
+ifdef CONFIG_LTO
+	install -m755 libquickjs.lto.a libquickjs.bn.lto.a "$(prefix)/lib/quickjs"
+endif
+	mkdir -p "$(prefix)/include/quickjs"
+	install -m755 quickjs.h quickjs-libc.h "$(prefix)/include/quickjs"
+
+
+###############################################################################
+# examples
+
+# example of static JS compilation
+HELLO_SRCS=examples/hello.js
+HELLO_OPTS=-fno-string-normalize -fno-map -fno-promise -fno-typedarray \
+           -fno-typedarray -fno-regexp -fno-json -fno-eval -fno-proxy
+
+hello.c: qjsc $(HELLO_SRCS)
+	./qjsc -e $(HELLO_OPTS) -o $@ $(HELLO_SRCS)
+
+ifdef CONFIG_M32
+examples/hello: $(OBJDIR)/hello.m32s.o $(patsubst %.o, %.m32s.o, $(QJS_LIB_OBJS))
+	$(CC) -m32 $(LDFLAGS) -o $@ $^ $(LIBS)
+else
+examples/hello: $(OBJDIR)/hello.o $(QJS_LIB_OBJS)
+	$(CC) $(LDFLAGS) -o $@ $^ $(LIBS)
+endif
+
+# example of static JS compilation with modules
+HELLO_MODULE_SRCS=examples/hello_module.js
+HELLO_MODULE_OPTS=-fno-string-normalize -fno-map -fno-promise -fno-typedarray \
+           -fno-typedarray -fno-regexp -fno-json -fno-eval -fno-proxy -m
+examples/hello_module: qjsc libquickjs$(LTOEXT).a $(HELLO_MODULE_SRCS)
+	./qjsc $(HELLO_MODULE_OPTS) -o $@ $(HELLO_MODULE_SRCS)
+
+# use of an external C module (static compilation)
+
+c_module.c: qjsc examples/c_module.js
+	./qjsc -e -M examples/fib.so,fib -m -o $@ examples/c_module.js
+
+examples/c_module: $(OBJDIR)/c_module.o $(OBJDIR)/fib.o libquickjs$(LTOEXT).a
+	$(CC) $(LDFLAGS) -o $@ $^ $(LIBS)
+
+$(OBJDIR)/fib.o: examples/fib.c
+	$(CC) $(CFLAGS_OPT) -c -o $@ $<
+
+###############################################################################
+# documentation
+
+DOCS=doc/quickjs.pdf doc/quickjs.html doc/jsbignum.pdf doc/jsbignum.html 
+
+build_doc: $(DOCS)
+
+clean_doc: 
+	rm -f $(DOCS)
+
+doc/%.pdf: doc/%.texi
+	texi2pdf --clean -o $@ -q $<
+
+doc/%.html: doc/%.texi
+	makeinfo --html --no-headers --no-split --number-sections -o $@ $<
+
+###############################################################################
+# tests
+
+ifndef CONFIG_DARWIN
+test: bjson.so
+endif
+
+test: qjs qjsbn
+	./qjs tests/test_closure.js
+	./qjs tests/test_op.js
+	./qjs tests/test_builtin.js
+	./qjs tests/test_loop.js
+	./qjs -m tests/test_std.js
+ifndef CONFIG_DARWIN
+	./qjs -m tests/test_bjson.js
+endif
+	./qjsbn tests/test_closure.js
+	./qjsbn tests/test_op.js
+	./qjsbn tests/test_builtin.js
+	./qjsbn tests/test_loop.js
+	./qjsbn -m tests/test_std.js
+	./qjsbn --qjscalc tests/test_bignum.js
+
+test-32: qjs32 qjsbn32
+	./qjs32 tests/test_closure.js
+	./qjs32 tests/test_op.js
+	./qjs32 tests/test_builtin.js
+	./qjs32 tests/test_loop.js
+	./qjs32 -m tests/test_std.js
+	./qjsbn32 tests/test_closure.js
+	./qjsbn32 tests/test_op.js
+	./qjsbn32 tests/test_builtin.js
+	./qjsbn32 tests/test_loop.js
+	./qjsbn32 -m tests/test_std.js
+	./qjsbn32 --qjscalc tests/test_bignum.js
+
+stats: qjs qjs32
+	./qjs -qd
+	./qjs32 -qd
+
+microbench: qjs
+	./qjs tests/microbench.js
+
+microbench-32: qjs32
+	./qjs32 tests/microbench.js
+
+# ES5 tests (obsolete)
+test2o: run-test262
+	time ./run-test262 -m -c test262o.conf
+
+test2o-32: run-test262-32
+	time ./run-test262-32 -m -c test262o.conf
+
+test2o-update: run-test262
+	./run-test262 -u -c test262o.conf
+
+# Test262 tests
+test2-default: run-test262
+	time ./run-test262 -m -c test262.conf
+
+test2: run-test262
+	time ./run-test262 -m -c test262.conf -a
+
+test2-32: run-test262-32
+	time ./run-test262-32 -m -c test262.conf -a
+
+test2-update: run-test262
+	./run-test262 -u -c test262.conf -a
+
+test2-check: run-test262
+	time ./run-test262 -m -c test262.conf -E -a
+
+# Test262 + BigInt tests
+test2bn-default: run-test262-bn
+	time ./run-test262-bn -m -c test262bn.conf
+
+test2bn: run-test262-bn
+	time ./run-test262-bn -m -c test262bn.conf -a
+
+test2bn-32: run-test262-bn32
+	time ./run-test262-bn32 -m -c test262bn.conf -a
+
+testall: all test microbench test2o test2 test2bn
+
+testall-32: all test-32 microbench-32 test2o-32 test2-32 test2bn-32
+
+testall-complete: testall testall-32
+
+bench-v8: qjs qjs32
+	make -C tests/bench-v8
+	./qjs -d tests/bench-v8/combined.js
+
+bjson.so: $(OBJDIR)/bjson.pic.o
+	$(CC) $(LDFLAGS) -shared -o $@ $^ $(LIBS)
+
+-include $(wildcard $(OBJDIR)/*.d)
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/TODO b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/TODO
new file mode 100755
index 00000000..e9985ba5
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/TODO
@@ -0,0 +1,83 @@
+- 64-bit atoms in 64-bit mode?
+- rename CONFIG_ALL_UNICODE, CONFIG_BIGNUM, CONFIG_ATOMICS, CONFIG_CHECK_JSVALUE ?
+- unify coding style and naming conventions
+- use names from the ECMA spec in library implementation
+- modules: if no ".", use a well known module loading path ?
+- use JSHoistedDef only for global variables (JSHoistedDef.var_name != JS_ATOM_NULL)
+- add index in JSVarDef and is_arg flag to merge args and vars in JSFunctionDef
+- replace most JSVarDef flags with var_type enumeration
+- use byte code emitters with typed arguments (for clarity)
+- use 2 bytecode DynBufs in JSFunctionDef, one for reading, one for writing
+  and use the same wrappers in all phases
+- use more generic method for line numbers in resolve_variables and resolve_labels
+- bignum:
+  - fix div/pow div by zero exception in doc & code in bigint mode
+  - fix Atomics support
+
+Memory:
+- test border cases for max number of atoms, object properties, string length
+- add emergency malloc mode for out of memory exceptions.
+- test all DynBuf memory errors
+- test all js_realloc memory errors
+- bignum: handle memory errors
+- use memory pools for objects, etc?
+- improve JS_ComputeMemoryUsage() with more info
+
+Optimizations:
+- use auto-init properties for more global objects
+- reuse stack slots for disjoint scopes, if strip
+- optimize `for of` iterator for built-in array objects
+- add heuristic to avoid some cycles in closures
+- small String (0-2 charcodes) with immediate storage
+- perform static string concatenation at compile time
+- optimize string concatenation with ropes or miniropes?
+- add implicit numeric strings for Uint32 numbers?
+- optimize `s += a + b`, `s += a.b` and similar simple expressions
+- ensure string canonical representation and optimise comparisons and hashes?
+- remove JSObject.first_weak_ref, use bit+context based hashed array for weak references
+- optimize function storage with length and name accessors?
+- property access optimization on the global object, functions,
+  prototypes and special non extensible objects.
+- create object literals with the correct length by backpatching length argument
+- remove redundant set_loc_uninitialized/check_uninitialized opcodes
+- peephole optim: push_atom_value, to_propkey -> push_atom_value
+- peephole optim: put_loc x, get_loc_check x -> set_loc x
+- comparative performance benchmark
+- use variable name when throwing uninitialized exception if available
+- convert slow array to fast array when all properties != length are numeric
+- optimize destructuring assignments for global and local variables
+- implement some form of tail-call-optimization
+- debugger keyword support
+- optmize OP_apply
+- optimize f(...b)
+
+Extensions:
+- support more features in [features] section
+- add TC39 stage 3 proposals: String.prototype.matchAll, Symbol.matchAll
+- fix preprocessor bug if nested #ifdef in jscompress.c
+- add built-in preprocessor in compiler, get rid of jscompress
+  handle #if, #ifdef, #line, limited support for #define
+- limited support for web assembly 
+- get rid of __loadScript, use more common name
+- BSD sockets
+- Process or thread control
+- use custom printf to avoid C library compatibility issues
+- use custom timezone support to avoid C library compatibility issues
+
+REPL:
+- strip internal functions from stack trace
+- readline: support MS Windows terminal
+- readline: handle dynamic terminal resizing
+- multiline editing
+- debugger
+- runtime object and function inspectors
+- interactive object browser
+- use more generic approach to display evaluation results
+- improve directive handling: dispatch, colorize, completion...
+- save history
+- close all predefined methods in repl.js and jscalc.js
+
+Test262o:  0/11266 errors, 459 excluded
+Test262:   0/55855 errors, 504 excluded, 1559 skipped
+Test262bn: 0/57176 errors, 724 excluded, 675 skipped
+test262 commit: 94b1e80ab3440413df916cd56d29c5a2fa2ac451
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/VERSION b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/VERSION
new file mode 100755
index 00000000..0a01e3ef
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/VERSION
@@ -0,0 +1 @@
+2019-07-09
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/bjson.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/bjson.c
new file mode 100755
index 00000000..ed08cbd8
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/bjson.c
@@ -0,0 +1,88 @@
+/*
+ * QuickJS: binary JSON module (test only)
+ * 
+ * Copyright (c) 2017-2019 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include "quickjs-libc.h"
+#include "cutils.h"
+
+static JSValue js_bjson_read(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv)
+{
+    uint8_t *buf;
+    uint64_t pos, len;
+    JSValue obj;
+    size_t size;
+    
+    if (JS_ToIndex(ctx, &pos, argv[1]))
+        return JS_EXCEPTION;
+    if (JS_ToIndex(ctx, &len, argv[2]))
+        return JS_EXCEPTION;
+    buf = JS_GetArrayBuffer(ctx, &size, argv[0]);
+    if (!buf)
+        return JS_EXCEPTION;
+    if (pos + len > size)
+        return JS_ThrowRangeError(ctx, "array buffer overflow");
+    obj = JS_ReadObject(ctx, buf + pos, len, 0);
+    return obj;
+}
+
+static JSValue js_bjson_write(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv)
+{
+    size_t len;
+    uint8_t *buf;
+    JSValue array;
+    
+    buf = JS_WriteObject(ctx, &len, argv[0], 0);
+    if (!buf)
+        return JS_EXCEPTION;
+    array = JS_NewArrayBufferCopy(ctx, buf, len);
+    js_free(ctx, buf);
+    return array;
+}
+
+static const JSCFunctionListEntry js_bjson_funcs[] = {
+    JS_CFUNC_DEF("read", 3, js_bjson_read ),
+    JS_CFUNC_DEF("write", 1, js_bjson_write ),
+};
+
+static int js_bjson_init(JSContext *ctx, JSModuleDef *m)
+{
+    return JS_SetModuleExportList(ctx, m, js_bjson_funcs,
+                                  countof(js_bjson_funcs));
+}
+
+#ifdef JS_SHARED_LIBRARY
+#define JS_INIT_MODULE js_init_module
+#else
+#define JS_INIT_MODULE js_init_module_bjson
+#endif
+
+JSModuleDef *JS_INIT_MODULE(JSContext *ctx, const char *module_name)
+{
+    JSModuleDef *m;
+    m = JS_NewCModule(ctx, module_name, js_bjson_init);
+    if (!m)
+        return NULL;
+    JS_AddModuleExportList(ctx, m, js_bjson_funcs, countof(js_bjson_funcs));
+    return m;
+}
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/cutils.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/cutils.c
new file mode 100755
index 00000000..92d1bd40
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/cutils.c
@@ -0,0 +1,642 @@
+/*
+ * C utilities
+ * 
+ * Copyright (c) 2017 Fabrice Bellard
+ * Copyright (c) 2018 Charlie Gordon
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include <stdlib.h>
+#include <stdio.h>
+#include <stdarg.h>
+#include <string.h>
+
+#include "cutils.h"
+
+void pstrcpy(char *buf, int buf_size, const char *str)
+{
+    int c;
+    char *q = buf;
+
+    if (buf_size <= 0)
+        return;
+
+    for(;;) {
+        c = *str++;
+        if (c == 0 || q >= buf + buf_size - 1)
+            break;
+        *q++ = c;
+    }
+    *q = '\0';
+}
+
+/* strcat and truncate. */
+char *pstrcat(char *buf, int buf_size, const char *s)
+{
+    int len;
+    len = strlen(buf);
+    if (len < buf_size)
+        pstrcpy(buf + len, buf_size - len, s);
+    return buf;
+}
+
+int strstart(const char *str, const char *val, const char **ptr)
+{
+    const char *p, *q;
+    p = str;
+    q = val;
+    while (*q != '\0') {
+        if (*p != *q)
+            return 0;
+        p++;
+        q++;
+    }
+    if (ptr)
+        *ptr = p;
+    return 1;
+}
+
+int has_suffix(const char *str, const char *suffix)
+{
+    size_t len = strlen(str);
+    size_t slen = strlen(suffix);
+    return (len >= slen && !memcmp(str + len - slen, suffix, slen));
+}
+
+/* Dynamic buffer package */
+
+static void *dbuf_default_realloc(void *opaque, void *ptr, size_t size)
+{
+    return realloc(ptr, size);
+}
+
+void dbuf_init2(DynBuf *s, void *opaque, DynBufReallocFunc *realloc_func)
+{
+    memset(s, 0, sizeof(*s));
+    if (!realloc_func)
+        realloc_func = dbuf_default_realloc;
+    s->opaque = opaque;
+    s->realloc_func = realloc_func;
+}
+
+void dbuf_init(DynBuf *s)
+{
+    dbuf_init2(s, NULL, NULL);
+}
+
+/* return < 0 if error */
+int dbuf_realloc(DynBuf *s, size_t new_size)
+{
+    size_t size;
+    uint8_t *new_buf;
+    if (new_size > s->allocated_size) {
+        if (s->error)
+            return -1;
+        size = s->allocated_size * 3 / 2;
+        if (size > new_size)
+            new_size = size;
+        new_buf = s->realloc_func(s->opaque, s->buf, new_size);
+        if (!new_buf) {
+            s->error = TRUE;
+            return -1;
+        }
+        s->buf = new_buf;
+        s->allocated_size = new_size;
+    }
+    return 0;
+}
+
+int dbuf_write(DynBuf *s, size_t offset, const uint8_t *data, size_t len)
+{
+    size_t end;
+    end = offset + len;
+    if (dbuf_realloc(s, end))
+        return -1;
+    memcpy(s->buf + offset, data, len);
+    if (end > s->size)
+        s->size = end;
+    return 0;
+}
+
+int dbuf_put(DynBuf *s, const uint8_t *data, size_t len)
+{
+    if (unlikely((s->size + len) > s->allocated_size)) {
+        if (dbuf_realloc(s, s->size + len))
+            return -1;
+    }
+    memcpy(s->buf + s->size, data, len);
+    s->size += len;
+    return 0;
+}
+
+int dbuf_put_self(DynBuf *s, size_t offset, size_t len)
+{
+    if (unlikely((s->size + len) > s->allocated_size)) {
+        if (dbuf_realloc(s, s->size + len))
+            return -1;
+    }
+    memcpy(s->buf + s->size, s->buf + offset, len);
+    s->size += len;
+    return 0;
+}
+
+int dbuf_putc(DynBuf *s, uint8_t c)
+{
+    return dbuf_put(s, &c, 1);
+}
+
+int dbuf_putstr(DynBuf *s, const char *str)
+{
+    return dbuf_put(s, (const uint8_t *)str, strlen(str));
+}
+
+#if defined(_MSC_VER)
+int dbuf_printf(DynBuf *s,
+                                                      const char *fmt, ...)
+#else
+int __attribute__((format(printf, 2, 3))) dbuf_printf(DynBuf *s,
+                                                      const char *fmt, ...)
+#endif
+{
+    va_list ap;
+    char buf[128];
+    int len;
+    
+    va_start(ap, fmt);
+    len = vsnprintf(buf, sizeof(buf), fmt, ap);
+    va_end(ap);
+    if (len < sizeof(buf)) {
+        /* fast case */
+        return dbuf_put(s, (uint8_t *)buf, len);
+    } else {
+        if (dbuf_realloc(s, s->size + len + 1))
+            return -1;
+        va_start(ap, fmt);
+        vsnprintf((char *)(s->buf + s->size), s->allocated_size - s->size,
+                  fmt, ap);
+        va_end(ap);
+        s->size += len;
+    }
+    return 0;
+}
+
+void dbuf_free(DynBuf *s)
+{
+    /* we test s->buf as a fail safe to avoid crashing if dbuf_free()
+       is called twice */
+    if (s->buf) {
+        s->realloc_func(s->opaque, s->buf, 0);
+    }
+    memset(s, 0, sizeof(*s));
+}
+
+/* Note: at most 31 bits are encoded. At most UTF8_CHAR_LEN_MAX bytes
+   are output. */
+int unicode_to_utf8(uint8_t *buf, unsigned int c)
+{
+    uint8_t *q = buf;
+
+    if (c < 0x80) {
+        *q++ = c;
+    } else {
+        if (c < 0x800) {
+            *q++ = (c >> 6) | 0xc0;
+        } else {
+            if (c < 0x10000) {
+                *q++ = (c >> 12) | 0xe0;
+            } else {
+                if (c < 0x00200000) {
+                    *q++ = (c >> 18) | 0xf0;
+                } else {
+                    if (c < 0x04000000) {
+                        *q++ = (c >> 24) | 0xf8;
+                    } else if (c < 0x80000000) {
+                        *q++ = (c >> 30) | 0xfc;
+                        *q++ = ((c >> 24) & 0x3f) | 0x80;
+                    } else {
+                        return 0;
+                    }
+                    *q++ = ((c >> 18) & 0x3f) | 0x80;
+                }
+                *q++ = ((c >> 12) & 0x3f) | 0x80;
+            }
+            *q++ = ((c >> 6) & 0x3f) | 0x80;
+        }
+        *q++ = (c & 0x3f) | 0x80;
+    }
+    return q - buf;
+}
+
+static const unsigned int utf8_min_code[5] = {
+    0x80, 0x800, 0x10000, 0x00200000, 0x04000000,
+};
+
+static const unsigned char utf8_first_code_mask[5] = {
+    0x1f, 0xf, 0x7, 0x3, 0x1,
+};
+
+/* return -1 if error. *pp is not updated in this case. max_len must
+   be >= 1. The maximum length for a UTF8 byte sequence is 6 bytes. */
+int unicode_from_utf8(const uint8_t *p, int max_len, const uint8_t **pp)
+{
+    int l, c, b, i;
+
+    c = *p++;
+    if (c < 0x80) {
+        *pp = p;
+        return c;
+    }
+#if defined(_MSC_VER)
+	if (c >= 0xc0 && c <= 0xdf) {
+		l = 1;
+	} else if (c >= 0xe0 && c <= 0xef) {
+		l = 2;
+	} else if (c >= 0xf0 && c <= 0xf7) {
+		l = 3;
+	} else if (c >= 0xf8 && c <= 0xfb) {
+		l = 4;
+	} else if (c >= 0xfc && c <= 0xfd) {
+		l = 5;
+	} else  {
+		return -1;
+	}
+#else
+    switch(c) {
+    case 0xc0 ... 0xdf:
+        l = 1;
+        break;
+    case 0xe0 ... 0xef:
+        l = 2;
+        break;
+    case 0xf0 ... 0xf7:
+        l = 3;
+        break;
+    case 0xf8 ... 0xfb:
+        l = 4;
+        break;
+    case 0xfc ... 0xfd:
+        l = 5;
+        break;
+    default:
+        return -1;
+    }
+#endif
+    /* check that we have enough characters */
+    if (l > (max_len - 1))
+        return -1;
+    c &= utf8_first_code_mask[l - 1];
+    for(i = 0; i < l; i++) {
+        b = *p++;
+        if (b < 0x80 || b >= 0xc0)
+            return -1;
+        c = (c << 6) | (b & 0x3f);
+    }
+    if (c < utf8_min_code[l - 1])
+        return -1;
+    *pp = p;
+    return c;
+}
+
+#if 0
+
+#if defined(EMSCRIPTEN) || defined(__ANDROID__)
+
+static void *rqsort_arg;
+static int (*rqsort_cmp)(const void *, const void *, void *);
+
+static int rqsort_cmp2(const void *p1, const void *p2)
+{
+    return rqsort_cmp(p1, p2, rqsort_arg);
+}
+
+/* not reentrant, but not needed with emscripten */
+void rqsort(void *base, size_t nmemb, size_t size,
+            int (*cmp)(const void *, const void *, void *),
+            void *arg)
+{
+    rqsort_arg = arg;
+    rqsort_cmp = cmp;
+    qsort(base, nmemb, size, rqsort_cmp2);
+}
+
+#endif
+
+#else
+
+typedef void (*exchange_f)(void *a, void *b, size_t size);
+typedef int (*cmp_f)(const void *, const void *, void *opaque);
+
+static void exchange_bytes(void *a, void *b, size_t size) {
+    uint8_t *ap = (uint8_t *)a;
+    uint8_t *bp = (uint8_t *)b;
+
+    while (size-- != 0) {
+        uint8_t t = *ap;
+        *ap++ = *bp;
+        *bp++ = t;
+    }
+}
+
+static void exchange_one_byte(void *a, void *b, size_t size) {
+    uint8_t *ap = (uint8_t *)a;
+    uint8_t *bp = (uint8_t *)b;
+    uint8_t t = *ap;
+    *ap = *bp;
+    *bp = t;
+}
+
+static void exchange_int16s(void *a, void *b, size_t size) {
+    uint16_t *ap = (uint16_t *)a;
+    uint16_t *bp = (uint16_t *)b;
+
+    for (size /= sizeof(uint16_t); size-- != 0;) {
+        uint16_t t = *ap;
+        *ap++ = *bp;
+        *bp++ = t;
+    }
+}
+
+static void exchange_one_int16(void *a, void *b, size_t size) {
+    uint16_t *ap = (uint16_t *)a;
+    uint16_t *bp = (uint16_t *)b;
+    uint16_t t = *ap;
+    *ap = *bp;
+    *bp = t;
+}
+
+static void exchange_int32s(void *a, void *b, size_t size) {
+    uint32_t *ap = (uint32_t *)a;
+    uint32_t *bp = (uint32_t *)b;
+
+    for (size /= sizeof(uint32_t); size-- != 0;) {
+        uint32_t t = *ap;
+        *ap++ = *bp;
+        *bp++ = t;
+    }
+}
+
+static void exchange_one_int32(void *a, void *b, size_t size) {
+    uint32_t *ap = (uint32_t *)a;
+    uint32_t *bp = (uint32_t *)b;
+    uint32_t t = *ap;
+    *ap = *bp;
+    *bp = t;
+}
+
+static void exchange_int64s(void *a, void *b, size_t size) {
+    uint64_t *ap = (uint64_t *)a;
+    uint64_t *bp = (uint64_t *)b;
+
+    for (size /= sizeof(uint64_t); size-- != 0;) {
+        uint64_t t = *ap;
+        *ap++ = *bp;
+        *bp++ = t;
+    }
+}
+
+static void exchange_one_int64(void *a, void *b, size_t size) {
+    uint64_t *ap = (uint64_t *)a;
+    uint64_t *bp = (uint64_t *)b;
+    uint64_t t = *ap;
+    *ap = *bp;
+    *bp = t;
+}
+
+static void exchange_int128s(void *a, void *b, size_t size) {
+    uint64_t *ap = (uint64_t *)a;
+    uint64_t *bp = (uint64_t *)b;
+
+    for (size /= sizeof(uint64_t) * 2; size-- != 0; ap += 2, bp += 2) {
+        uint64_t t = ap[0];
+        uint64_t u = ap[1];
+        ap[0] = bp[0];
+        ap[1] = bp[1];
+        bp[0] = t;
+        bp[1] = u;
+    }
+}
+
+static void exchange_one_int128(void *a, void *b, size_t size) {
+    uint64_t *ap = (uint64_t *)a;
+    uint64_t *bp = (uint64_t *)b;
+    uint64_t t = ap[0];
+    uint64_t u = ap[1];
+    ap[0] = bp[0];
+    ap[1] = bp[1];
+    bp[0] = t;
+    bp[1] = u;
+}
+
+static inline exchange_f exchange_func(const void *base, size_t size) {
+    switch (((uintptr_t)base | (uintptr_t)size) & 15) {
+    case 0:
+        if (size == sizeof(uint64_t) * 2)
+            return exchange_one_int128;
+        else
+            return exchange_int128s;
+    case 8:
+        if (size == sizeof(uint64_t))
+            return exchange_one_int64;
+        else
+            return exchange_int64s;
+    case 4:
+    case 12:
+        if (size == sizeof(uint32_t))
+            return exchange_one_int32;
+        else
+            return exchange_int32s;
+    case 2:
+    case 6:
+    case 10:
+    case 14:
+        if (size == sizeof(uint16_t))
+            return exchange_one_int16;
+        else
+            return exchange_int16s;
+    default:
+        if (size == 1)
+            return exchange_one_byte;
+        else
+            return exchange_bytes;
+    }
+}
+
+static void heapsortx(void *base, size_t nmemb, size_t size, cmp_f cmp, void *opaque)
+{
+    uint8_t *basep = (uint8_t *)base;
+    size_t i, n, c, r;
+    exchange_f swap = exchange_func(base, size);
+
+    if (nmemb > 1) {
+        i = (nmemb / 2) * size;
+        n = nmemb * size;
+
+        while (i > 0) {
+            i -= size;
+            for (r = i; (c = r * 2 + size) < n; r = c) {
+                if (c < n - size && cmp(basep + c, basep + c + size, opaque) <= 0)
+                    c += size;
+                if (cmp(basep + r, basep + c, opaque) > 0)
+                    break;
+                swap(basep + r, basep + c, size);
+            }
+        }
+        for (i = n - size; i > 0; i -= size) {
+            swap(basep, basep + i, size);
+
+            for (r = 0; (c = r * 2 + size) < i; r = c) {
+                if (c < i - size && cmp(basep + c, basep + c + size, opaque) <= 0)
+                    c += size;
+                if (cmp(basep + r, basep + c, opaque) > 0)
+                    break;
+                swap(basep + r, basep + c, size);
+            }
+        }
+    }
+}
+
+static inline void *med3(void *a, void *b, void *c, cmp_f cmp, void *opaque)
+{
+    return cmp(a, b, opaque) < 0 ?
+        (cmp(b, c, opaque) < 0 ? b : (cmp(a, c, opaque) < 0 ? c : a )) :
+        (cmp(b, c, opaque) > 0 ? b : (cmp(a, c, opaque) < 0 ? a : c ));
+}
+
+/* pointer based version with local stack and insertion sort threshhold */
+void rqsort(void *base, size_t nmemb, size_t size, cmp_f cmp, void *opaque)
+{
+    struct { uint8_t *base; size_t count; int depth; } stack[50], *sp = stack;
+    uint8_t *ptr, *pi, *pj, *plt, *pgt, *top, *m;
+    size_t m4, i, lt, gt, span, span2;
+    int c, depth;
+    exchange_f swap = exchange_func(base, size);
+    exchange_f swap_block = exchange_func(base, size | 128);
+
+    if (nmemb < 2 || size <= 0)
+        return;
+
+    sp->base = (uint8_t *)base;
+    sp->count = nmemb;
+    sp->depth = 0;
+    sp++;
+
+    while (sp > stack) {
+        sp--;
+        ptr = sp->base;
+        nmemb = sp->count;
+        depth = sp->depth;
+
+        while (nmemb > 6) {
+            if (++depth > 50) {
+                /* depth check to ensure worst case logarithmic time */
+                heapsortx(ptr, nmemb, size, cmp, opaque);
+                nmemb = 0;
+                break;
+            }
+            /* select median of 3 from 1/4, 1/2, 3/4 positions */
+            /* should use median of 5 or 9? */
+            m4 = (nmemb >> 2) * size;
+            m = med3(ptr + m4, ptr + 2 * m4, ptr + 3 * m4, cmp, opaque);
+            swap(ptr, m, size);  /* move the pivot to the start or the array */
+            i = lt = 1;
+            pi = plt = ptr + size;
+            gt = nmemb;
+            pj = pgt = top = ptr + nmemb * size;
+            for (;;) {
+                while (pi < pj && (c = cmp(ptr, pi, opaque)) >= 0) {
+                    if (c == 0) {
+                        swap(plt, pi, size);
+                        lt++;
+                        plt += size;
+                    }
+                    i++;
+                    pi += size;
+                }
+                while (pi < (pj -= size) && (c = cmp(ptr, pj, opaque)) <= 0) {
+                    if (c == 0) {
+                        gt--;
+                        pgt -= size;
+                        swap(pgt, pj, size);
+                    }
+                }
+                if (pi >= pj)
+                    break;
+                swap(pi, pj, size);
+                i++;
+                pi += size;
+            }
+            /* array has 4 parts:
+             * from 0 to lt excluded: elements identical to pivot
+             * from lt to pi excluded: elements smaller than pivot
+             * from pi to gt excluded: elements greater than pivot
+             * from gt to n excluded: elements identical to pivot
+             */
+            /* move elements identical to pivot in the middle of the array: */
+            /* swap values in ranges [0..lt[ and [i-lt..i[
+               swapping the smallest span between lt and i-lt is sufficient
+             */
+            span = plt - ptr;
+            span2 = pi - plt;
+            plt = pi - span;
+            lt = i - lt;
+            if (span > span2)
+                span = span2;
+            swap_block(ptr, pi - span, span);
+            /* swap values in ranges [gt..top[ and [i..top-(top-gt)[
+               swapping the smallest span between top-gt and gt-i is sufficient
+             */
+            span = top - pgt;
+            span2 = pgt - pi;
+            pgt = top - span2;
+            gt = nmemb - (gt - i);
+            if (span > span2)
+                span = span2;
+            swap_block(pi, top - span, span);
+
+            /* now array has 3 parts:
+             * from 0 to lt excluded: elements smaller than pivot
+             * from lt to gt excluded: elements identical to pivot
+             * from gt to n excluded: elements greater than pivot
+             */
+            /* stack the larger segment and keep processing the smaller one
+               to minimize stack use for pathological distributions */
+            if (lt > nmemb - gt) {
+                sp->base = ptr;
+                sp->count = lt;
+                sp->depth = depth;
+                sp++;
+                ptr = pgt;
+                nmemb -= gt;
+            } else {
+                sp->base = pgt;
+                sp->count = nmemb - gt;
+                sp->depth = depth;
+                sp++;
+                nmemb = lt;
+            }
+        }
+        /* Use insertion sort for small fragments */
+        for (pi = ptr + size, top = ptr + nmemb * size; pi < top; pi += size) {
+            for (pj = pi; pj > ptr && cmp(pj - size, pj, opaque) > 0; pj -= size)
+                swap(pj, pj - size, size);
+        }
+    }
+}
+
+#endif
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/cutils.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/cutils.h
new file mode 100755
index 00000000..ea910522
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/cutils.h
@@ -0,0 +1,383 @@
+/*
+ * C utilities
+ * 
+ * Copyright (c) 2017 Fabrice Bellard
+ * Copyright (c) 2018 Charlie Gordon
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#ifndef CUTILS_H
+#define CUTILS_H
+
+#include <stdlib.h>
+#include <inttypes.h>
+
+/* set if CPU is big endian */
+#undef WORDS_BIGENDIAN
+
+#if defined(_MSC_VER)
+#define likely(x)       (x)
+#define unlikely(x)     (x)
+#else
+#define likely(x)       __builtin_expect(!!(x), 1)
+#define unlikely(x)     __builtin_expect(!!(x), 0)
+#endif
+#if defined(_MSC_VER)
+#define force_inline inline
+#else
+#define force_inline inline __attribute__((always_inline))
+#endif
+#if defined(_MSC_VER)
+#define no_inline
+#else
+#define no_inline __attribute__((noinline))
+#endif
+//#if defined(_MSC_VER)
+//#define _Atomic(type) type
+//#endif
+
+#if defined(_MSC_VER)
+#include <BaseTsd.h>
+typedef SSIZE_T ssize_t;
+#endif
+
+#define xglue(x, y) x ## y
+#define glue(x, y) xglue(x, y)
+#define stringify(s)    tostring(s)
+#define tostring(s)     #s
+
+#ifndef offsetof
+#define offsetof(type, field) ((size_t) &((type *)0)->field)
+#endif
+#ifndef countof
+#define countof(x) (sizeof(x) / sizeof((x)[0]))
+#endif
+
+typedef int BOOL;
+
+#ifndef FALSE
+enum {
+    FALSE = 0,
+    TRUE = 1,
+};
+#endif
+
+void pstrcpy(char *buf, int buf_size, const char *str);
+char *pstrcat(char *buf, int buf_size, const char *s);
+int strstart(const char *str, const char *val, const char **ptr);
+int has_suffix(const char *str, const char *suffix);
+
+static inline int max_int(int a, int b)
+{
+    if (a > b)
+        return a;
+    else
+        return b;
+}
+
+static inline int min_int(int a, int b)
+{
+    if (a < b)
+        return a;
+    else
+        return b;
+}
+
+static inline uint32_t max_uint32(uint32_t a, uint32_t b)
+{
+    if (a > b)
+        return a;
+    else
+        return b;
+}
+
+static inline uint32_t min_uint32(uint32_t a, uint32_t b)
+{
+    if (a < b)
+        return a;
+    else
+        return b;
+}
+
+static inline int64_t max_int64(int64_t a, int64_t b)
+{
+    if (a > b)
+        return a;
+    else
+        return b;
+}
+
+static inline int64_t min_int64(int64_t a, int64_t b)
+{
+    if (a < b)
+        return a;
+    else
+        return b;
+}
+
+/* WARNING: undefined if a = 0 */
+static inline int clz32(unsigned int a)
+{
+    return __builtin_clz(a);
+}
+
+/* WARNING: undefined if a = 0 */
+static inline int clz64(uint64_t a)
+{
+    return __builtin_clzll(a);
+}
+
+/* WARNING: undefined if a = 0 */
+static inline int ctz32(unsigned int a)
+{
+    return __builtin_ctz(a);
+}
+
+/* WARNING: undefined if a = 0 */
+static inline int ctz64(uint64_t a)
+{
+    return __builtin_ctzll(a);
+}
+
+#if defined(_MSC_VER)
+#pragma pack(push,1)
+struct packed_u64 {
+    uint64_t v;
+};
+#pragma pack(pop)
+#else
+struct __attribute__((packed)) packed_u64 {
+    uint64_t v;
+};
+#endif
+
+#if defined(_MSC_VER)
+#pragma pack(push,1)
+struct packed_u32 {
+    uint32_t v;
+};
+#pragma pack(pop)
+#else
+struct __attribute__((packed)) packed_u32 {
+    uint32_t v;
+};
+#endif
+
+#if defined(_MSC_VER)
+#pragma pack(push,1)
+struct packed_u16 {
+    uint16_t v;
+};
+#pragma pack(pop)
+#else
+struct __attribute__((packed)) packed_u16 {
+    uint16_t v;
+};
+#endif
+
+static inline uint64_t get_u64(const uint8_t *tab)
+{
+    return ((const struct packed_u64 *)tab)->v;
+}
+
+static inline int64_t get_i64(const uint8_t *tab)
+{
+    return (int64_t)((const struct packed_u64 *)tab)->v;
+}
+
+static inline void put_u64(uint8_t *tab, uint64_t val)
+{
+    ((struct packed_u64 *)tab)->v = val;
+}
+
+static inline uint32_t get_u32(const uint8_t *tab)
+{
+    return ((const struct packed_u32 *)tab)->v;
+}
+
+static inline int32_t get_i32(const uint8_t *tab)
+{
+    return (int32_t)((const struct packed_u32 *)tab)->v;
+}
+
+static inline void put_u32(uint8_t *tab, uint32_t val)
+{
+    ((struct packed_u32 *)tab)->v = val;
+}
+
+static inline uint32_t get_u16(const uint8_t *tab)
+{
+    return ((const struct packed_u16 *)tab)->v;
+}
+
+static inline int32_t get_i16(const uint8_t *tab)
+{
+    return (int16_t)((const struct packed_u16 *)tab)->v;
+}
+
+static inline void put_u16(uint8_t *tab, uint16_t val)
+{
+    ((struct packed_u16 *)tab)->v = val;
+}
+
+static inline uint32_t get_u8(const uint8_t *tab)
+{
+    return *tab;
+}
+
+static inline int32_t get_i8(const uint8_t *tab)
+{
+    return (int8_t)*tab;
+}
+
+static inline void put_u8(uint8_t *tab, uint8_t val)
+{
+    *tab = val;
+}
+
+static inline uint16_t bswap16(uint16_t x)
+{
+    return (x >> 8) | (x << 8);
+}
+
+static inline uint32_t bswap32(uint32_t v)
+{
+    return ((v & 0xff000000) >> 24) | ((v & 0x00ff0000) >>  8) |
+        ((v & 0x0000ff00) <<  8) | ((v & 0x000000ff) << 24);
+}
+
+static inline uint64_t bswap64(uint64_t v)
+{
+    return ((v & ((uint64_t)0xff << (7 * 8))) >> (7 * 8)) | 
+        ((v & ((uint64_t)0xff << (6 * 8))) >> (5 * 8)) | 
+        ((v & ((uint64_t)0xff << (5 * 8))) >> (3 * 8)) | 
+        ((v & ((uint64_t)0xff << (4 * 8))) >> (1 * 8)) | 
+        ((v & ((uint64_t)0xff << (3 * 8))) << (1 * 8)) | 
+        ((v & ((uint64_t)0xff << (2 * 8))) << (3 * 8)) | 
+        ((v & ((uint64_t)0xff << (1 * 8))) << (5 * 8)) | 
+        ((v & ((uint64_t)0xff << (0 * 8))) << (7 * 8));
+}
+
+/* XXX: should take an extra argument to pass slack information to the caller */
+typedef void *DynBufReallocFunc(void *opaque, void *ptr, size_t size);
+
+typedef struct DynBuf {
+    uint8_t *buf;
+    size_t size;
+    size_t allocated_size;
+    BOOL error; /* true if a memory allocation error occurred */
+    DynBufReallocFunc *realloc_func;
+    void *opaque; /* for realloc_func */
+} DynBuf;
+
+void dbuf_init(DynBuf *s);
+void dbuf_init2(DynBuf *s, void *opaque, DynBufReallocFunc *realloc_func);
+int dbuf_realloc(DynBuf *s, size_t new_size);
+int dbuf_write(DynBuf *s, size_t offset, const uint8_t *data, size_t len);
+int dbuf_put(DynBuf *s, const uint8_t *data, size_t len);
+int dbuf_put_self(DynBuf *s, size_t offset, size_t len);
+int dbuf_putc(DynBuf *s, uint8_t c);
+int dbuf_putstr(DynBuf *s, const char *str);
+static inline int dbuf_put_u16(DynBuf *s, uint16_t val)
+{
+    return dbuf_put(s, (uint8_t *)&val, 2);
+}
+static inline int dbuf_put_u32(DynBuf *s, uint32_t val)
+{
+    return dbuf_put(s, (uint8_t *)&val, 4);
+}
+static inline int dbuf_put_u64(DynBuf *s, uint64_t val)
+{
+    return dbuf_put(s, (uint8_t *)&val, 8);
+}
+
+#if defined(_MSC_VER)
+int dbuf_printf(DynBuf *s, const char *fmt, ...);
+#else
+int __attribute__((format(printf, 2, 3))) dbuf_printf(DynBuf *s,
+                                                      const char *fmt, ...);
+#endif
+
+void dbuf_free(DynBuf *s);
+static inline BOOL dbuf_error(DynBuf *s) {
+    return s->error;
+}
+
+#define UTF8_CHAR_LEN_MAX 6
+
+int unicode_to_utf8(uint8_t *buf, unsigned int c);
+int unicode_from_utf8(const uint8_t *p, int max_len, const uint8_t **pp);
+
+static inline int from_hex(int c)
+{
+    if (c >= '0' && c <= '9')
+        return c - '0';
+    else if (c >= 'A' && c <= 'F')
+        return c - 'A' + 10;
+    else if (c >= 'a' && c <= 'f')
+        return c - 'a' + 10;
+    else
+        return -1;
+}
+
+void rqsort(void *base, size_t nmemb, size_t size,
+            int (*cmp)(const void *, const void *, void *),
+            void *arg);
+			
+/* Definitions for builtins unavailable on MSVC */
+#if defined(_MSC_VER) && !defined(__clang__)
+#include <intrin.h>
+
+uint32_t __inline __builtin_ctz(uint32_t value) {
+  unsigned long trailing_zero = 0;
+  if (_BitScanForward(&trailing_zero, value))
+    return trailing_zero;
+  return 32;
+}
+
+uint32_t __inline __builtin_clz(uint32_t value) {
+  unsigned long leading_zero = 0;
+  if (_BitScanReverse(&leading_zero, value))
+    return 31 - leading_zero;
+  return 32;
+}
+
+#if defined(_M_ARM) || defined(_M_X64)
+uint32_t __inline __builtin_clzll(uint64_t value) {
+  unsigned long leading_zero = 0;
+  if (_BitScanReverse64(&leading_zero, value))
+    return 63 - leading_zero;
+  return 64;
+}
+#else
+uint32_t __inline __builtin_clzll(uint64_t value) {
+  if (value == 0)
+    return 64;
+  uint32_t msh = (uint32_t)(value >> 32);
+  uint32_t lsh = (uint32_t)(value & 0xFFFFFFFF);
+  if (msh != 0)
+    return __builtin_clz(msh);
+  return 32 + __builtin_clz(lsh);
+}
+#endif
+
+#define __builtin_clzl __builtin_clzll
+#endif /* defined(_MSC_VER) && !defined(__clang__) */
+
+#endif  /* CUTILS_H */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.html b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.html
new file mode 100755
index 00000000..51f2d6af
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.html
@@ -0,0 +1,1054 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
+<html>
+<!-- Created by GNU Texinfo 5.2, http://www.gnu.org/software/texinfo/ -->
+<head>
+<title>Javascript Bignum Extensions</title>
+
+<meta name="description" content="Javascript Bignum Extensions">
+<meta name="keywords" content="Javascript Bignum Extensions">
+<meta name="resource-type" content="document">
+<meta name="distribution" content="global">
+<meta name="Generator" content="makeinfo">
+<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
+<link href="#SEC_Contents" rel="contents" title="Table of Contents">
+<style type="text/css">
+<!--
+a.summary-letter {text-decoration: none}
+blockquote.smallquotation {font-size: smaller}
+div.display {margin-left: 3.2em}
+div.example {margin-left: 3.2em}
+div.indentedblock {margin-left: 3.2em}
+div.lisp {margin-left: 3.2em}
+div.smalldisplay {margin-left: 3.2em}
+div.smallexample {margin-left: 3.2em}
+div.smallindentedblock {margin-left: 3.2em; font-size: smaller}
+div.smalllisp {margin-left: 3.2em}
+kbd {font-style:oblique}
+pre.display {font-family: inherit}
+pre.format {font-family: inherit}
+pre.menu-comment {font-family: serif}
+pre.menu-preformatted {font-family: serif}
+pre.smalldisplay {font-family: inherit; font-size: smaller}
+pre.smallexample {font-size: smaller}
+pre.smallformat {font-family: inherit; font-size: smaller}
+pre.smalllisp {font-size: smaller}
+span.nocodebreak {white-space:nowrap}
+span.nolinebreak {white-space:nowrap}
+span.roman {font-family:serif; font-weight:normal}
+span.sansserif {font-family:sans-serif; font-weight:normal}
+ul.no-bullet {list-style: none}
+-->
+</style>
+
+
+</head>
+
+<body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000">
+<h1 class="settitle" align="center">Javascript Bignum Extensions</h1>
+
+<a name="SEC_Contents"></a>
+<h2 class="contents-heading">Table of Contents</h2>
+
+<div class="contents">
+<ul class="no-bullet">
+<li><a name="toc-Introduction" href="#Introduction">1 Introduction</a></li>
+<li><a name="toc-Operator-overloading" href="#Operator-overloading">2 Operator overloading</a>
+<ul class="no-bullet">
+  <li><a name="toc-Introduction-1" href="#Introduction-1">2.1 Introduction</a></li>
+  <li><a name="toc-Builtin-Object-changes" href="#Builtin-Object-changes">2.2 Builtin Object changes</a>
+  <ul class="no-bullet">
+    <li><a name="toc-Symbol-constructor" href="#Symbol-constructor">2.2.1 <code>Symbol</code> constructor</a></li>
+  </ul></li>
+</ul></li>
+<li><a name="toc-The-BigInt-Mode" href="#The-BigInt-Mode">3 The BigInt Mode</a>
+<ul class="no-bullet">
+  <li><a name="toc-Introduction-2" href="#Introduction-2">3.1 Introduction</a></li>
+  <li><a name="toc-Changes-that-introduce-incompatibilities-with-Javascript" href="#Changes-that-introduce-incompatibilities-with-Javascript">3.2 Changes that introduce incompatibilities with Javascript</a>
+  <ul class="no-bullet">
+    <li><a name="toc-Standard-mode" href="#Standard-mode">3.2.1 Standard mode</a></li>
+    <li><a name="toc-Bigint-mode" href="#Bigint-mode">3.2.2 Bigint mode</a></li>
+  </ul></li>
+  <li><a name="toc-Operators" href="#Operators">3.3 Operators</a>
+  <ul class="no-bullet">
+    <li><a name="toc-Arithmetic-operators" href="#Arithmetic-operators">3.3.1 Arithmetic operators</a></li>
+    <li><a name="toc-Logical-operators" href="#Logical-operators">3.3.2 Logical operators</a></li>
+    <li><a name="toc-Relational-operators" href="#Relational-operators">3.3.3 Relational operators</a></li>
+  </ul></li>
+  <li><a name="toc-Number-literals" href="#Number-literals">3.4 Number literals</a></li>
+  <li><a name="toc-Builtin-Object-changes-1" href="#Builtin-Object-changes-1">3.5 Builtin Object changes</a>
+  <ul class="no-bullet">
+    <li><a name="toc-BigInt-function" href="#BigInt-function">3.5.1 <code>BigInt</code> function</a></li>
+    <li><a name="toc-BigInt_002eprototype" href="#BigInt_002eprototype">3.5.2 <code>BigInt.prototype</code></a></li>
+    <li><a name="toc-Number-constructor" href="#Number-constructor">3.5.3 <code>Number</code> constructor</a></li>
+    <li><a name="toc-Number_002eprototype" href="#Number_002eprototype">3.5.4 <code>Number.prototype</code></a></li>
+    <li><a name="toc-Math-object" href="#Math-object">3.5.5 <code>Math</code> object</a></li>
+  </ul></li>
+</ul></li>
+<li><a name="toc-Arbitrarily-large-floating-point-numbers" href="#Arbitrarily-large-floating-point-numbers">4 Arbitrarily large floating point numbers</a>
+<ul class="no-bullet">
+  <li><a name="toc-Introduction-3" href="#Introduction-3">4.1 Introduction</a></li>
+  <li><a name="toc-Floating-point-rounding" href="#Floating-point-rounding">4.2 Floating point rounding</a></li>
+  <li><a name="toc-Operators-1" href="#Operators-1">4.3 Operators</a></li>
+  <li><a name="toc-BigFloat-literals" href="#BigFloat-literals">4.4 BigFloat literals</a></li>
+  <li><a name="toc-Builtin-Object-changes-2" href="#Builtin-Object-changes-2">4.5 Builtin Object changes</a>
+  <ul class="no-bullet">
+    <li><a name="toc-BigFloat-function" href="#BigFloat-function">4.5.1 <code>BigFloat</code> function</a></li>
+    <li><a name="toc-BigFloat_002eprototype" href="#BigFloat_002eprototype">4.5.2 <code>BigFloat.prototype</code></a></li>
+    <li><a name="toc-BigFloatEnv-constructor" href="#BigFloatEnv-constructor">4.5.3 <code>BigFloatEnv</code> constructor</a></li>
+    <li><a name="toc-Math-object-1" href="#Math-object-1">4.5.4 <code>Math</code> object</a></li>
+  </ul></li>
+</ul></li>
+<li><a name="toc-Math-mode" href="#Math-mode">5 Math mode</a>
+<ul class="no-bullet">
+  <li><a name="toc-Introduction-4" href="#Introduction-4">5.1 Introduction</a></li>
+  <li><a name="toc-Builtin-Object-changes-3" href="#Builtin-Object-changes-3">5.2 Builtin Object changes</a>
+  <ul class="no-bullet">
+    <li><a name="toc-Symbol-constructor-1" href="#Symbol-constructor-1">5.2.1 <code>Symbol</code> constructor</a></li>
+  </ul></li>
+  <li><a name="toc-Remaining-issues" href="#Remaining-issues">5.3 Remaining issues</a></li>
+</ul></li>
+
+</ul>
+</div>
+
+
+<a name="Introduction"></a>
+<h2 class="chapter">1 Introduction</h2>
+
+<p>The Bignum extensions add the following features to the Javascript
+language while being 100% backward compatible:
+</p>
+<ul>
+<li> Overloading of the standard operators
+to support new types such as complex numbers, fractions or matrixes.
+
+</li><li> Bigint mode where arbitrarily large integers are available by default (no <code>n</code> suffix is necessary as in the TC39 BigInt proposal<a name="DOCF1" href="#FOOT1"><sup>1</sup></a>).
+
+</li><li> Arbitrarily large floating point numbers (<code>BigFloat</code>) in base 2 using the IEEE 754 semantics.
+
+</li><li> Optional <code>math</code> mode which modifies the semantics of the division, modulo and power operator. The division and power operator return a fraction with integer operands and the modulo operator is defined as the Euclidian remainder.
+
+</li></ul>
+
+<p>The extensions are independent from each other except the <code>math</code>
+mode which relies on the bigint mode and the operator overloading.
+</p>
+<a name="Operator-overloading"></a>
+<h2 class="chapter">2 Operator overloading</h2>
+
+<a name="Introduction-1"></a>
+<h3 class="section">2.1 Introduction</h3>
+
+<p>If the operands of an operator have at least one object type, a custom
+operator method is searched before doing the legacy Javascript
+<code>ToNumber</code> conversion.
+</p>
+<p>For unary operators, the custom function is looked up in the object
+and has the following name:
+</p>
+<dl compact="compact">
+<dt><code>unary +</code></dt>
+<dd><p><code>Symbol.operatorPlus</code>
+</p>
+</dd>
+<dt><code>unary -</code></dt>
+<dd><p><code>Symbol.operatorNeg</code>
+</p>
+</dd>
+<dt><code>++</code></dt>
+<dd><p><code>Symbol.operatorInc</code>
+</p>
+</dd>
+<dt><code>--</code></dt>
+<dd><p><code>Symbol.operatorDec</code>
+</p>
+</dd>
+<dt><code>~</code></dt>
+<dd><p><code>Symbol.operatorNot</code>
+</p>
+</dd>
+</dl>
+
+<p>For binary operators:
+</p>
+<ul>
+<li> If both operands have the same constructor function, then the operator
+is looked up in the constructor.
+
+</li><li> Otherwise, the property <code>Symbol.operatorOrder</code> is looked up in both
+constructors and converted to <code>Int32</code>. The operator is then
+looked in the constructor with the larger <code>Symbol.operatorOrder</code>
+value. A <code>TypeError</code> is raised if both constructors have the same
+<code>Symbol.operatorOrder</code> value.
+
+</li></ul>
+
+<p>The operator is looked up with the following name:
+</p>
+<dl compact="compact">
+<dt><code>+</code></dt>
+<dd><p><code>Symbol.operatorAdd</code>
+</p>
+</dd>
+<dt><code>-</code></dt>
+<dd><p><code>Symbol.operatorSub</code>
+</p>
+</dd>
+<dt><code>*</code></dt>
+<dd><p><code>Symbol.operatorMul</code>
+</p>
+</dd>
+<dt><code>/</code></dt>
+<dd><p><code>Symbol.operatorDiv</code>
+</p>
+</dd>
+<dt><code>/ (math mode)</code></dt>
+<dd><p><code>Symbol.operatorMathDiv</code>
+</p>
+</dd>
+<dt><code>%</code></dt>
+<dd><p><code>Symbol.operatorMod</code>
+</p>
+</dd>
+<dt><code>% (math mode)</code></dt>
+<dd><p><code>Symbol.operatorMathMod</code>
+</p>
+</dd>
+<dt><code>^ (math mode)</code></dt>
+<dd><p><code>Symbol.operatorMathPow</code>
+</p>
+</dd>
+<dt><code>**</code></dt>
+<dd><p><code>Symbol.operatorPow</code>
+</p>
+</dd>
+<dt><code>|</code></dt>
+<dd><p><code>Symbol.operatorOr</code>
+</p>
+</dd>
+<dt><code>^</code></dt>
+<dd><p><code>Symbol.operatorXor</code>
+</p>
+</dd>
+<dt><code>&amp;</code></dt>
+<dd><p><code>Symbol.operatorAnd</code>
+</p>
+</dd>
+<dt><code>&lt;&lt;</code></dt>
+<dd><p><code>Symbol.operatorShl</code>
+</p>
+</dd>
+<dt><code>&gt;&gt;</code></dt>
+<dd><p><code>Symbol.operatorShr</code>
+</p>
+</dd>
+<dt><code>&lt;</code></dt>
+<dd><p><code>Symbol.operatorCmpLT</code>
+</p>
+</dd>
+<dt><code>&gt;</code></dt>
+<dd><p><code>Symbol.operatorCmpLT</code>, operands swapped
+</p>
+</dd>
+<dt><code>&lt;=</code></dt>
+<dd><p><code>Symbol.operatorCmpLE</code>
+</p>
+</dd>
+<dt><code>&gt;=</code></dt>
+<dd><p><code>Symbol.operatorCmpLE</code>, operands swapped
+</p>
+</dd>
+<dt><code>==, !=</code></dt>
+<dd><p><code>Symbol.operatorCmpEQ</code>
+</p>
+</dd>
+</dl>
+
+<p>The return value of <code>Symbol.operatorCmpLT</code>, <code>Symbol.operatorCmpLE</code> and
+<code>Symbol.operatorCmpEQ</code> is converted to <code>Boolean</code>.
+</p>
+<a name="Builtin-Object-changes"></a>
+<h3 class="section">2.2 Builtin Object changes</h3>
+
+<a name="Symbol-constructor"></a>
+<h4 class="subsection">2.2.1 <code>Symbol</code> constructor</h4>
+
+<p>The following global symbols are added for the operator overloading:
+</p><dl compact="compact">
+<dt><code>operatorOrder</code></dt>
+<dt><code>operatorAdd</code></dt>
+<dt><code>operatorSub</code></dt>
+<dt><code>operatorMul</code></dt>
+<dt><code>operatorDiv</code></dt>
+<dt><code>operatorMod</code></dt>
+<dt><code>operatorPow</code></dt>
+<dt><code>operatorShl</code></dt>
+<dt><code>operatorShr</code></dt>
+<dt><code>operatorAnd</code></dt>
+<dt><code>operatorOr</code></dt>
+<dt><code>operatorXor</code></dt>
+<dt><code>operatorCmpLT</code></dt>
+<dt><code>operatorCmpLE</code></dt>
+<dt><code>operatorCmpEQ</code></dt>
+<dt><code>operatorPlus</code></dt>
+<dt><code>operatorNeg</code></dt>
+<dt><code>operatorNot</code></dt>
+<dt><code>operatorInc</code></dt>
+<dt><code>operatorDec</code></dt>
+</dl>
+
+
+<a name="The-BigInt-Mode"></a>
+<h2 class="chapter">3 The BigInt Mode</h2>
+
+<a name="Introduction-2"></a>
+<h3 class="section">3.1 Introduction</h3>
+
+<p>The bigint mode is enabled with the <code>&quot;use bigint&quot;</code> directive. It
+propagates the same way as the strict mode. In bigint mode, all
+integers are considered as <code>bigint</code> (arbitrarily large integer,
+similar to the TC39 BigInt
+proposal<a name="DOCF2" href="#FOOT2"><sup>2</sup></a>)
+instead of <code>number</code> (floating point number). In order to be able
+to exchange data between standard and bigint modes, numbers are
+internally represented as 3 different types:
+</p>
+<ul>
+<li> Small integer (SmallInt): 32 bit integer<a name="DOCF3" href="#FOOT3"><sup>3</sup></a>.
+
+</li><li> Big integer (BigInt): arbitrarily large integer.
+
+</li><li> Floating point number (Float).
+
+</li></ul>
+
+<p>In standard mode, the semantics of each operation is modified so that
+when it returns a <code>number</code>, it is either of SmallInt or
+Float. But the difference between SmallInt and Float is not observable
+in standard mode.
+</p>
+<p>In bigint mode, each operation behaves differently whether its
+operands are integer or float. The difference between SmallInt and
+BigInt is not observable (i.e. they are both integers).
+</p>
+<p>The following table summarizes the observable types:
+</p>
+<table>
+<thead><tr><th width="30%">Internal type</th><th width="30%">Observable type<br> (standard mode)</th><th width="30%">Observable type<br> (bigint mode)</th></tr></thead>
+<tr><td width="30%">SmallInt</td><td width="30%">number</td><td width="30%">bigint</td></tr>
+<tr><td width="30%">BigInt</td><td width="30%">bigint</td><td width="30%">bigint</td></tr>
+<tr><td width="30%">Float</td><td width="30%">number</td><td width="30%">number</td></tr>
+</table>
+
+<a name="Changes-that-introduce-incompatibilities-with-Javascript"></a>
+<h3 class="section">3.2 Changes that introduce incompatibilities with Javascript</h3>
+
+<a name="Standard-mode"></a>
+<h4 class="subsection">3.2.1 Standard mode</h4>
+
+<p>There is no incompatibility with Javascript.
+</p>
+<a name="Bigint-mode"></a>
+<h4 class="subsection">3.2.2 Bigint mode</h4>
+
+<p>The following changes are visible:
+</p>
+<ul>
+<li> Integer and Float are different types. Constants are typed. For example: <code>typeof 1.0 === &quot;number&quot;</code> and <code>typeof 1 === &quot;bigint&quot;</code>. Another consequence is that <code>1.0 === 1</code> is false.
+
+</li><li> The range of integers is unlimited. In standard mode: <code>2**53 + 1 === 2**53</code>. This is no longer true with the bignum extensions.
+
+</li><li> Binary bitwise operators do not truncate to 32 bits i.e. <code>0x800000000 | 1 === 0x800000001</code> while it gives <code>1</code> in standard mode.
+
+</li><li> Bitwise shift operators do not truncate to 32 bits and do not mask the shift count with <code>0x1f</code> i.e. <code>1 &lt;&lt; 32 === 4294967296</code> while it gives <code>1</code> in standard mode. However, the <code>&gt;&gt;&gt;</code> operator (unsigned right shift) which is useless with bignums keeps its standard mode behavior<a name="DOCF4" href="#FOOT4"><sup>4</sup></a>.
+
+</li><li> Operators with integer operands never return the minus zero floating point value as result. Hence <code>Object.is(0, -0) === true</code>. Use <code>-0.0</code> to create a minus zero floating point value.
+
+</li><li> Division or modulo with a zero integer dividend raises an exception i.e. <code>1/0</code> throws a <code>RangeError</code> exception. However, division by the floating point zero returns Infinity or NaN as in standard mode: <code>1/0.0 === Infinity</code>. The same holds for zero elevated to a negative integer power i.e. <code>0**-1</code> throws a <code>RangeError</code> exception.
+
+</li><li> The <code>ToPrimitive</code> abstract operation is called with the <code>&quot;integer&quot;</code> preferred type when an integer is required (e.g. for bitwise binary or shift operations).
+
+</li><li> The prototype of integers is no longer <code>Number.prototype</code>. Instead<br> <code>Object.getPrototypeOf(1) === BigInt.prototype</code>. The prototype of floats remains Number.prototype.
+
+</li><li> If the TC39 BigInt proposal is supported, there is no observable difference between integers and <code>bigint</code>s.
+
+</li></ul>
+
+<a name="Operators"></a>
+<h3 class="section">3.3 Operators</h3>
+
+<a name="Arithmetic-operators"></a>
+<h4 class="subsection">3.3.1 Arithmetic operators</h4>
+
+<p>The operands are converted to number values as in normal
+Javascript. Then the general case is that an Integer is returned if
+both operands are Integer. Otherwise, a float is returned.
+</p>
+<p>The <code>+</code> operator also accepts strings as input and behaves like
+standard Javascript in this case.
+</p>
+<p>The binary operator <code>%</code> returns the truncated remainder of the
+division.
+</p>
+<p>The binary operator <code>%</code> in math mode returns the Euclidian
+remainder of the division i.e. it is always positive. 
+</p>
+<p>The binary operator <code>/</code> returns a float.
+</p>
+<p>The binary operator <code>/</code> in math mode returns a float if one of
+the operands is float. Otherwise, <code>BigInt[Symbol.operatorMathDiv]</code> is
+invoked (and returns a fraction for example).
+</p>
+<p>When the result is an Integer type, a dividend of zero yields a
+RangeError exception.
+</p>
+<p>The returned type of <code>a ** b</code> or <code>a ^ b</code> (math mode) is
+Float if <em>a</em> or <em>b</em> are Float. If <em>a</em> and <em>b</em> are
+integers:
+</p><ul>
+<li> <em>a = 0</em> and <em>b &lt; 0</em> generates a RangeError exception
+
+</li><li> <em>|a| \geq 2</em> and <em>b &lt; 0</em> returns a Float in bigint mode. In math mode, <code>BigInt[Symbol.operatorMathPow]</code> is invoked (and returns a fraction for example)
+
+</li><li> otherwise an integer is returned.
+</li></ul>
+
+<p>The unary <code>-</code> and unary <code>+</code> return the same type as their
+operand. They performs no floating point rounding when the result is a
+float.
+</p>
+<p>The unary operators <code>++</code> and <code>--</code> return the same type as
+their operand.
+</p>
+<p>In standard mode:
+</p>
+<p>If the operator returns an Integer and that the result fits a
+SmallInt, it is converted to SmallInt. Otherwise, the Integer is
+converted to a Float.
+</p>
+<p>In bigint mode:
+</p>
+<p>If the operator returns an Integer and that the result fits a
+SmallInt, it is converted to SmallInt. Otherwise it is a BigInt.
+</p>
+<a name="Logical-operators"></a>
+<h4 class="subsection">3.3.2 Logical operators</h4>
+
+<p>In standard mode:
+</p>
+<p>The operands have their standard behavior. If the result fits a
+SmallInt it is converted to a SmallInt. Otherwise it is a Float.
+</p>
+<p>In bigint mode:
+</p>
+<p>The operands are converted to integer values. The floating point
+values are converted to integer by rounding them to zero.
+</p>
+<p>The logical operators are defined assuming the integers are
+represented in two complement notation.
+</p>
+<p>For <code>&lt;&lt;</code> and <code>&lt;&lt;</code>, the shift can be positive or negative. So
+<code>a &lt;&lt; b</code> is defined as <em>\lfloor a/2^{-b} \rfloor</em> and
+<code>a &gt;&gt; b</code> is defined as <em>\lfloor a/2^{b} \rfloor</em>.
+</p>
+<p>The operator <code>&gt;&gt;&gt;</code> is supported for backward compatibility and
+behaves the same way as Javascript i.e. implicit conversion to <code>Uint32</code>.
+</p>
+<p>If the result fits a SmallInt it is converted to a SmallInt. Otherwise
+it is a BigInt.
+</p>
+<a name="Relational-operators"></a>
+<h4 class="subsection">3.3.3 Relational operators</h4>
+
+<p>The relational operators &lt;, &lt;=, &gt;, &gt;=, ==, != work as expected with
+integers and floating point numbers (e.g. <code>1.0 == 1</code> is true).
+</p>
+<p>The strict equality operators === and !== have the usual Javascript
+semantics. In particular, different types never equal, so <code>1.0
+=== 1</code> is false.
+</p>
+<a name="Number-literals"></a>
+<h3 class="section">3.4 Number literals</h3>
+
+<p>Number literals in bigint mode have a slightly different behavior than
+in standard Javascript:
+</p>
+<ol>
+<li> A number literal without a decimal point or an exponent is considered
+as an Integer. Otherwise it is a Float.
+
+</li><li> Hexadecimal, octal or binary floating point literals are accepted with
+a decimal point or an exponent. The exponent is specified with the
+<code>p</code> letter assuming a base 2. The same convention is used by
+C99. Example: <code>0x1p3</code> is the same as <code>8.0</code>.
+
+</li></ol>
+
+<a name="Builtin-Object-changes-1"></a>
+<h3 class="section">3.5 Builtin Object changes</h3>
+
+<a name="BigInt-function"></a>
+<h4 class="subsection">3.5.1 <code>BigInt</code> function</h4>
+
+<p>The <code>BigInt</code> function cannot be invoked as a constructor. When
+invoked as a function, it converts its first parameter to an
+integer. When a floating point number is given as parameter, it is
+truncated to an integer with infinite precision.
+</p>
+<p><code>BigInt</code> properties:
+</p>
+<dl compact="compact">
+<dt><code>asIntN(bits, a)</code></dt>
+<dd><p>Set <em>b=a \pmod{2^{bits}}</em>. Return <em>b</em> if <em>b &lt; 2^{bits-1}</em>
+otherwise <em>b-2^{bits}</em>.
+</p>
+</dd>
+<dt><code>asUintN(bits, a)</code></dt>
+<dd><p>Return <em>a \pmod{2^{bits}}</em>.
+</p>
+</dd>
+<dt><code>tdiv(a, b)</code></dt>
+<dd><p>Return <em>trunc(a/b)</em>. <code>b = 0</code> raises a RangeError
+exception.
+</p>
+</dd>
+<dt><code>fdiv(a, b)</code></dt>
+<dd><p>Return <em>\lfloor a/b \rfloor</em>. <code>b = 0</code> raises a RangeError
+exception.
+</p>
+</dd>
+<dt><code>cdiv(a, b)</code></dt>
+<dd><p>Return <em>\lceil a/b \rceil</em>. <code>b = 0</code> raises a RangeError
+exception.
+</p>
+</dd>
+<dt><code>ediv(a, b)</code></dt>
+<dd><p>Return <em>sgn(b) \lfloor a/{|b|} \rfloor</em> (Euclidian
+division). <code>b = 0</code> raises a RangeError exception.
+</p>
+</dd>
+<dt><code>tdivrem(a, b)</code></dt>
+<dt><code>fdivrem(a, b)</code></dt>
+<dt><code>cdivrem(a, b)</code></dt>
+<dt><code>edivrem(a, b)</code></dt>
+<dd><p>Return an array of two elements. The first element is the quotient,
+the second is the remainder. The same rounding is done as the
+corresponding division operation.
+</p>
+</dd>
+<dt><code>sqrt(a)</code></dt>
+<dd><p>Return <em>\lfloor \sqrt(a) \rfloor</em>. A RangeError exception is
+raised if <em>a &lt; 0</em>.
+</p>
+</dd>
+<dt><code>sqrtrem(a)</code></dt>
+<dd><p>Return an array of two elements. The first element is <em>\lfloor
+\sqrt{a} \rfloor</em>. The second element is <em>a-\lfloor \sqrt{a}
+\rfloor^2</em>. A RangeError exception is raised if <em>a &lt; 0</em>.
+</p>
+</dd>
+<dt><code>floorLog2(a)</code></dt>
+<dd><p>Return -1 if <em>a \leq 0</em> otherwise return <em>\lfloor \log2(a) \rfloor</em>.
+</p>
+</dd>
+<dt><code>ctz(a)</code></dt>
+<dd><p>Return the number of trailing zeros in the two&rsquo;s complement binary representation of a. Return -1 if <em>a=0</em>.
+</p>
+</dd>
+</dl>
+
+<a name="BigInt_002eprototype"></a>
+<h4 class="subsection">3.5.2 <code>BigInt.prototype</code></h4>
+
+<p>It is a normal object.
+</p>
+<a name="Number-constructor"></a>
+<h4 class="subsection">3.5.3 <code>Number</code> constructor</h4>
+
+<p>The number constructor returns its argument rounded to a Float using
+the global floating point environement. In bigint mode, the Number
+constructor returns a Float. In standard mode, it returns a SmallInt
+if the value fits it, otherwise a Float.
+</p>
+<a name="Number_002eprototype"></a>
+<h4 class="subsection">3.5.4 <code>Number.prototype</code></h4>
+
+<p>The following properties are modified:
+</p>
+<dl compact="compact">
+<dt><code>toString(radix)</code></dt>
+<dd>
+<p>In bigint mode, integers are converted to the specified radix with
+infinite precision.
+</p>
+</dd>
+<dt><code>toPrecision(p)</code></dt>
+<dt><code>toFixed(p)</code></dt>
+<dt><code>toExponential(p)</code></dt>
+<dd>
+<p>In bigint mode, integers are accepted and converted to string with
+infinite precision.
+</p>
+</dd>
+<dt><code>parseInt(string, radix)</code></dt>
+<dd>
+<p>In bigint mode, an integer is returned and the conversion is done with
+infinite precision.
+</p>
+</dd>
+</dl>
+
+<a name="Math-object"></a>
+<h4 class="subsection">3.5.5 <code>Math</code> object</h4>
+
+<p>The following properties are modified:
+</p>
+<dl compact="compact">
+<dt><code>abs(x)</code></dt>
+<dd><p>Absolute value. Return an integer if <code>x</code> is an Integer. Otherwise
+return a Float. No rounding is performed.
+</p>
+</dd>
+<dt><code>min(a, b)</code></dt>
+<dt><code>max(a, b)</code></dt>
+<dd><p>No rounding is performed. The returned type is the same one as the
+minimum (resp. maximum) value.
+</p>
+</dd>
+</dl>
+
+<a name="Arbitrarily-large-floating-point-numbers"></a>
+<h2 class="chapter">4 Arbitrarily large floating point numbers</h2>
+
+<a name="Introduction-3"></a>
+<h3 class="section">4.1 Introduction</h3>
+
+<p>This extension adds the <code>BigFloat</code> primitive type. The
+<code>BigFloat</code> type represents floating point numbers are in base 2
+with the IEEE 754 semantics. A floating
+point number is represented as a sign, mantissa and exponent. The
+special values <code>NaN</code>, <code>+/-Infinity</code>, <code>+0</code> and <code>-0</code>
+are supported. The mantissa and exponent can have any bit length with
+an implementation specific minimum and maximum.
+</p>
+<a name="Floating-point-rounding"></a>
+<h3 class="section">4.2 Floating point rounding</h3>
+
+<p>Each floating point operation operates with infinite precision and
+then rounds the result according to the specified floating point
+environment (<code>BigFloatEnv</code> object). The status flags of the
+environment are also set according to the result of the operation.
+</p>
+<p>If no floating point environment is provided, the global floating
+point environment is used.
+</p>
+<p>The rounding mode of the global floating point environment is always
+<code>RNDN</code> (&ldquo;round to nearest with ties to even&rdquo;)<a name="DOCF5" href="#FOOT5"><sup>5</sup></a>. The status flags of the global environment cannot be
+read<a name="DOCF6" href="#FOOT6"><sup>6</sup></a>. The precision of the global environment is
+<code>BigFloatEnv.prec</code>. The number of exponent bits of the global
+environment is <code>BigFloatEnv.expBits</code>.  If <code>BigFloatEnv.expBits</code> is
+strictly smaller than the maximum allowed number of exponent bits
+(<code>BigFloatEnv.expBitsMax</code>), then the global environment subnormal
+flag is set to <code>true</code>. Otherwise it is set to <code>false</code>;
+</p>
+<p>For example, <code>prec = 53</code> and <code> expBits = 11</code> give exactly
+the same precision as the IEEE 754 64 bit floating point type. It is
+the default floating point precision.
+</p>
+<p>The global floating point environment can only be modified temporarily
+when calling a function (see <code>BigFloatEnv.setPrec</code>). Hence a
+function can change the global floating point environment for its
+callees but not for its caller.
+</p>
+<a name="Operators-1"></a>
+<h3 class="section">4.3 Operators</h3>
+
+<p>The builtin operators are extended so that a BigFloat is returned if
+at least one operand is a BigFloat. The computations are always done
+with infinite precision and rounded according to the global floating
+point environment.
+</p>
+<p><code>typeof</code> applied on a <code>BigFloat</code> returns <code>bigfloat</code>.
+</p>
+<p>BigFloat can be compared with all the other numeric types and the
+result follows the expected mathematical relations.
+</p>
+<p>However, since BigFloat and Number are different types they are never
+equal when using the strict comparison operators (e.g. <code>0.0 ===
+0.0l</code> is false).
+</p>
+<a name="BigFloat-literals"></a>
+<h3 class="section">4.4 BigFloat literals</h3>
+
+<p>BigFloat literals are floating point numbers with a trailing <code>l</code>
+suffix. BigFloat literals have an infinite precision. They are rounded
+according to the global floating point environment when they are
+evaluated.<a name="DOCF7" href="#FOOT7"><sup>7</sup></a>
+</p>
+<a name="Builtin-Object-changes-2"></a>
+<h3 class="section">4.5 Builtin Object changes</h3>
+
+<a name="BigFloat-function"></a>
+<h4 class="subsection">4.5.1 <code>BigFloat</code> function</h4>
+
+<p>The <code>BigFloat</code> function cannot be invoked as a constructor. When
+invoked as a function: the parameter is converted to a primitive
+type. If the result is a numeric type, it is converted to BigFloat
+without rounding. If the result is a string, it is converted to
+BigFloat using the precision of the global floating point environment.
+</p>
+<p><code>BigFloat</code> properties:
+</p>
+<dl compact="compact">
+<dt><code>LN2</code></dt>
+<dt><code>PI</code></dt>
+<dd><p>Getter. Return the value of the corresponding mathematical constant
+rounded to nearest, ties to even with the current global
+precision. The constant values are cached for small precisions.
+</p>
+</dd>
+<dt><code>MIN_VALUE</code></dt>
+<dt><code>MAX_VALUE</code></dt>
+<dt><code>EPSILON</code></dt>
+<dd><p>Getter. Return the minimum, maximum and epsilon <code>BigFloat</code> values
+(same definition as the corresponding <code>Number</code> constants).
+</p>
+</dd>
+<dt><code>fpRound(a[, e])</code></dt>
+<dd><p>Round the floating point number <code>a</code> according to the floating
+point environment <code>e</code> or the global environment if <code>e</code> is
+undefined.
+</p>
+</dd>
+<dt><code>parseFloat(a[, radix[, e]])</code></dt>
+<dd><p>Parse the string <code>a</code> as a floating point number in radix
+<code>radix</code>. The radix is 0 (default) or from 2 to 36. The radix 0
+means radix 10 unless there is a hexadecimal or binary prefix. The
+result is rounded according to the floating point environment <code>e</code>
+or the global environment if <code>e</code> is undefined.
+</p>
+</dd>
+<dt><code>add(a, b[, e])</code></dt>
+<dt><code>sub(a, b[, e])</code></dt>
+<dt><code>mul(a, b[, e])</code></dt>
+<dt><code>div(a, b[, e])</code></dt>
+<dd><p>Perform the specified floating point operation and round the floating
+point number <code>a</code> according to the floating point environment
+<code>e</code> or the global environment if <code>e</code> is undefined. If
+<code>e</code> is specified, the floating point status flags are updated.
+</p>
+</dd>
+<dt><code>floor(x[, e])</code></dt>
+<dt><code>ceil(x[, e])</code></dt>
+<dt><code>round(x[, e])</code></dt>
+<dt><code>trunc(x[, e])</code></dt>
+<dd><p>Round to integer. A rounded <code>BigFloat</code> is returned. <code>e</code> is an
+optional floating point environment.
+</p>
+</dd>
+<dt><code>fmod(x, y[, e])</code></dt>
+<dt><code>remainder(x, y[, e])</code></dt>
+<dd><p>Floating point remainder. The quotient is truncated to zero (fmod) or
+to the nearest integer with ties to even (remainder). <code>e</code> is an
+optional floating point environment.
+</p>
+</dd>
+<dt><code>sqrt(x[, e])</code></dt>
+<dd><p>Square root. Return a rounded floating point number. <code>e</code> is an
+optional floating point environment.
+</p>
+</dd>
+<dt><code>sin(x[, e])</code></dt>
+<dt><code>cos(x[, e])</code></dt>
+<dt><code>tan(x[, e])</code></dt>
+<dt><code>asin(x[, e])</code></dt>
+<dt><code>acos(x[, e])</code></dt>
+<dt><code>atan(x[, e])</code></dt>
+<dt><code>atan2(x, y[, e])</code></dt>
+<dt><code>exp(x[, e])</code></dt>
+<dt><code>log(x[, e])</code></dt>
+<dt><code>pow(x, y[, e])</code></dt>
+<dd><p>Transcendental operations. Return a rounded floating point
+number. <code>e</code> is an optional floating point environment.
+</p>
+</dd>
+</dl>
+
+<a name="BigFloat_002eprototype"></a>
+<h4 class="subsection">4.5.2 <code>BigFloat.prototype</code></h4>
+
+<p>The following properties are modified:
+</p>
+<dl compact="compact">
+<dt><code>toString(radix)</code></dt>
+<dd>
+<p>For floating point numbers:
+</p>
+<ul>
+<li> If the radix is a power of two, the conversion is done with infinite
+precision.
+</li><li> Otherwise, the number is rounded to nearest with ties to even using
+the global precision. It is then converted to string using the minimum
+number of digits so that its conversion back to a floating point using
+the global precision and round to nearest gives the same number. 
+
+</li></ul>
+
+</dd>
+<dt><code>toPrecision(p[, rnd_mode])</code></dt>
+<dt><code>toFixed(p[, rnd_mode])</code></dt>
+<dt><code>toExponential(p[, rnd_mode])</code></dt>
+<dd><p>Same semantics as the corresponding <code>Number</code> functions with
+BigFloats. There is no limit on the accepted precision <code>p</code>. The
+rounding mode can be optionally specified. It is set by default to
+<code>BigFloatEnv.RNDNA</code>.
+</p>
+</dd>
+</dl>
+
+<a name="BigFloatEnv-constructor"></a>
+<h4 class="subsection">4.5.3 <code>BigFloatEnv</code> constructor</h4>
+
+<p>The <code>BigFloatEnv([p, [,rndMode]]</code> constructor cannot be invoked as a
+function. The floating point environment contains:
+</p>
+<ul>
+<li> the mantissa precision in bits
+
+</li><li> the exponent size in bits assuming an IEEE 754 representation;
+
+</li><li> the subnormal flag (if true, subnormal floating point numbers can
+be generated by the floating point operations).
+
+</li><li> the rounding mode
+
+</li><li> the floating point status. The status flags can only be set by the floating point operations. They can be reset with <code>BigFloatEnv.prototype.clearStatus()</code> or with the various status flag setters.
+
+</li></ul>
+
+<p><code>new BigFloatEnv([p, [,rndMode]]</code> creates a new floating point
+environment. The status flags are reset. If no parameter is given the
+precision, exponent bits and subnormal flags are copied from the
+global floating point environment. Otherwise, the precision is set to
+<code>p</code>, the number of exponent bits is set to <code>expBitsMax</code> and the
+subnormal flags is set to <code>false</code>. If <code>rndMode</code> is
+<code>undefined</code>, the rounding mode is set to <code>RNDN</code>.
+</p>
+<p><code>BigFloatEnv</code> properties:
+</p>
+<dl compact="compact">
+<dt><code>prec</code></dt>
+<dd><p>Getter. Return the precision in bits of the global floating point
+environment. The initial value is <code>53</code>.
+</p>
+</dd>
+<dt><code>expBits</code></dt>
+<dd><p>Getter. Return the exponent size in bits of the global floating point
+environment assuming an IEEE 754 representation. If <code>expBits &lt;
+expBitsMax</code>, then subnormal numbers are supported. The initial value
+is <code>11</code>.
+</p>
+</dd>
+<dt><code>setPrec(f, p[, e])</code></dt>
+<dd><p>Set the precision of the global floating point environment to <code>p</code>
+and the exponent size to <code>e</code> then call the function
+<code>f</code>. Then the Float precision and exponent size are reset to
+their precious value and the return value of <code>f</code> is returned (or
+an exception is raised if <code>f</code> raised an exception). If <code>e</code>
+is <code>undefined</code> it is set to <code>BigFloatEnv.expBitsMax</code>. <code>p</code>
+must be &gt;= 53 and <code>e</code> must be &gt;= 11 so that the global precision
+is at least equivalent to the IEEE 754 64 bit doubles.
+</p>
+</dd>
+<dt><code>precMin</code></dt>
+<dd><p>Read-only integer. Return the minimum allowed precision. Must be at least 2.
+</p>
+</dd>
+<dt><code>precMax</code></dt>
+<dd><p>Read-only integer. Return the maximum allowed precision. Must be at least 53.
+</p>
+</dd>
+<dt><code>expBitsMin</code></dt>
+<dd><p>Read-only integer. Return the minimum allowed exponent size in
+bits. Must be at least 3.
+</p>
+</dd>
+<dt><code>expBitsMax</code></dt>
+<dd><p>Read-only integer. Return the maximum allowed exponent size in
+bits. Must be at least 11.
+</p>
+</dd>
+<dt><code>RNDN</code></dt>
+<dd><p>Read-only integer. Round to nearest, with ties to even rounding mode.
+</p>
+</dd>
+<dt><code>RNDZ</code></dt>
+<dd><p>Read-only integer. Round to zero rounding mode.
+</p>
+</dd>
+<dt><code>RNDD</code></dt>
+<dd><p>Read-only integer. Round to -Infinity rounding mode.
+</p>
+</dd>
+<dt><code>RNDU</code></dt>
+<dd><p>Read-only integer. Round to +Infinity rounding mode.
+</p>
+</dd>
+<dt><code>RNDNA</code></dt>
+<dd><p>Read-only integer. Round to nearest, with ties away from zero rounding mode.
+</p>
+</dd>
+<dt><code>RNDNU</code></dt>
+<dd><p>Read-only integer. Round to nearest, with ties to +Infinity rounding mode.
+</p>
+</dd>
+<dt><code>RNDF<a name="DOCF8" href="#FOOT8"><sup>8</sup></a></code></dt>
+<dd><p>Read-only integer. Faithful rounding mode. The result is
+non-deterministicly rounded to -Infinity or +Infinity. This rounding
+mode usually gives a faster and deterministic running time for the
+floating point operations.
+</p>
+</dd>
+</dl>
+
+<p><code>BigFloatEnv.prototype</code> properties:
+</p>
+<dl compact="compact">
+<dt><code>prec</code></dt>
+<dd><p>Getter and setter (Integer). Return or set the precision in bits.
+</p>
+</dd>
+<dt><code>expBits</code></dt>
+<dd><p>Getter and setter (Integer). Return or set the exponent size in bits
+assuming an IEEE 754 representation.
+</p>
+</dd>
+<dt><code>rndMode</code></dt>
+<dd><p>Getter and setter (Integer). Return or set the rounding mode.
+</p>
+</dd>
+<dt><code>subnormal</code></dt>
+<dd><p>Getter and setter (Boolean). subnormal flag. It is false when
+<code>expBits = expBitsMax</code>.
+</p>
+</dd>
+<dt><code>clearStatus()</code></dt>
+<dd><p>Clear the status flags.
+</p>
+</dd>
+<dt><code>invalidOperation</code></dt>
+<dt><code>divideByZero</code></dt>
+<dt><code>overflow</code></dt>
+<dt><code>underflow</code></dt>
+<dt><code>inexact</code></dt>
+<dd><p>Getter and setter (Boolean). Status flags.
+</p>
+</dd>
+</dl>
+
+<a name="Math-object-1"></a>
+<h4 class="subsection">4.5.4 <code>Math</code> object</h4>
+
+<p>The following properties are modified:
+</p>
+<dl compact="compact">
+<dt><code>abs(x)</code></dt>
+<dd><p>Absolute value. If <code>x</code> is a BigFloat, its absolute value is
+returned as a BigFloat. No rounding is performed.
+</p>
+</dd>
+<dt><code>min(a, b)</code></dt>
+<dt><code>max(a, b)</code></dt>
+<dd><p>The returned type is the same one as the minimum (resp. maximum)
+value, so <code>BigFloat</code> values are accepted. When a <code>BigFloat</code>
+is returned, no rounding is performed.
+</p>
+</dd>
+</dl>
+
+<a name="Math-mode"></a>
+<h2 class="chapter">5 Math mode</h2>
+
+<a name="Introduction-4"></a>
+<h3 class="section">5.1 Introduction</h3>
+
+<p>A new <em>math mode</em> is enabled with the <code>&quot;use math&quot;</code>
+directive. <code>&quot;use bigint&quot;</code> is implied in math mode. With this
+mode, writing mathematical expressions is more intuitive, exact
+results (fractions) can be computed for all operators and floating
+point literals have the <code>BigFloat</code> type by default.
+</p>
+<p>It propagates the same way as the <em>strict mode</em>. In
+this mode:
+</p>
+<ul>
+<li> The <code>^</code> operator is a similar to the power operator (<code>**</code>), except that <code>a ^ b</code> invokes <code>BigInt[Symbol.operatorMathPow]</code> if <em>a</em> and <em>b</em> are integers and <em>|a| \geq 2</em> and <em>b &lt; 0</em>.
+
+</li><li> The power operator (both <code>^</code> and <code>**</code>) grammar is modified so that <code>-2^2</code> is allowed and yields <code>-4</code>.
+
+</li><li> The logical xor operator is still available with the <code>^^</code> operator.
+
+</li><li> The division operator invokes <code>BigInt[Symbol.operatorMathDiv]</code> in case both operands are integers.
+
+</li><li> The modulo operator returns the Euclidian remainder (always positive) instead of the truncated remainder.
+
+</li><li> Floating point literals are <code>BigFloat</code> by default (i.e. a <code>l</code> suffix is implied).
+
+</li></ul>
+
+<a name="Builtin-Object-changes-3"></a>
+<h3 class="section">5.2 Builtin Object changes</h3>
+
+<a name="Symbol-constructor-1"></a>
+<h4 class="subsection">5.2.1 <code>Symbol</code> constructor</h4>
+
+<p>The following global symbols are added for the operator overloading:
+</p><dl compact="compact">
+<dt><code>operatorMathDiv</code></dt>
+<dt><code>operatorMathMod</code></dt>
+<dt><code>operatorMathPow</code></dt>
+</dl>
+
+<a name="Remaining-issues"></a>
+<h3 class="section">5.3 Remaining issues</h3>
+
+<ol>
+<li> New functions (e.g. <code>Math.div</code> and <code>Math.mod</code>) could be added to be able to call the normal division and modulo operators when in math mode.
+
+</li><li> A new floating point literal suffix could be added for <code>Number</code> literals.
+
+</li></ol>
+
+<div class="footnote">
+<hr>
+<h4 class="footnotes-heading">Footnotes</h4>
+
+<h3><a name="FOOT1" href="#DOCF1">(1)</a></h3>
+<p><a href="https://tc39.github.io/proposal-bigint/">https://tc39.github.io/proposal-bigint/</a></p>
+<h3><a name="FOOT2" href="#DOCF2">(2)</a></h3>
+<p><a href="https://tc39.github.io/proposal-bigint/">https://tc39.github.io/proposal-bigint/</a></p>
+<h3><a name="FOOT3" href="#DOCF3">(3)</a></h3>
+<p>Could be extended to 53 bits without changing the principle.</p>
+<h3><a name="FOOT4" href="#DOCF4">(4)</a></h3>
+<p>The unsigned right right operator could be removed in bigint mode.</p>
+<h3><a name="FOOT5" href="#DOCF5">(5)</a></h3>
+<p>The
+rationale is that the rounding mode changes must always be
+explicit.</p>
+<h3><a name="FOOT6" href="#DOCF6">(6)</a></h3>
+<p>The rationale is to avoid side effects for the built-in
+operators.</p>
+<h3><a name="FOOT7" href="#DOCF7">(7)</a></h3>
+<p>Base 10 floating point literals cannot usually be
+exactly represented as base 2 floating point number. In order to
+ensure that the literal is represented accurately with the current
+precision, it must be evaluated at runtime.</p>
+<h3><a name="FOOT8" href="#DOCF8">(8)</a></h3>
+<p>Could be removed in case a deterministic behvior for floating point operations is required.</p>
+</div>
+<hr>
+
+
+
+</body>
+</html>
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.pdf b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.pdf
new file mode 100755
index 0000000000000000000000000000000000000000..036238b5b94c261497446834aa76afb6dd1b4e68
GIT binary patch
literal 200966
zcmbTdQ;=xO7N%RaZQHhO+gxSaT4md|ZQJH5+qSFMiSD@f_B}hIcl3N3Pcvs`e)-RT
zjLale5D}wgq+^95om(1SgJL9LAh0vCgyP|WqL(qXHFGv6VC7&Z_@56Hy_kiyv#BEi
zy_mJ3v#E%wv7L!26dxayle43#p$(M#x{Zo#Y=Hnm_XD*jJlRZtJwJ-GkPHIJUEP5R
zOJ+A!6J0nEAkXVftA6t7)Gzo1^;&(m<;rWv+XG|ni2HK`@nh8p`3<#Ivc|&Klb&a=
zprVNybZyt0m1DLW^$qsBd6hpau0|NOi7uMX^m1KvjSsA?-RD0A#k{CT%7HvaZH>L+
znb}y96t1FfuGI2M93(hMO`nr&Hj2r1Lful7xb;*IZ5??NE7&{C;SRYU8c7~b^5k$5
z*OavPL>JeHK8=x$k<%O68-FG{c+~VTBJN7Htvip!mb=^!WD_?^DCCV!&mHcbwN}j{
zH-$VSgU7DsaSwR9Z|K#ca?$XhJGE_sOEernHIp}5w#{1pq>^6*E76Hy6hY6XyzyHx
zZ#!`KCQAj!re_8dANL_5&QBq(b5!{tC<*7A!DW&nE2J&$Q6j^6?XdvX6Ac*BKgJW}
z2^SCQVF=(3acEKr2S1a_n&=xno9(m(vY>~`EHLN+$z#;|m+I7lJYy!N``Z@;m`#23
z=~UeugmU<fI1P<6#~{}BoO;Q=X9vkSu*1?&Syr$C*8QSAS3VS^BkwyD94#V*=L(P?
zzKWTXL1n-PoOP$SI4v*{!m_=B(nIl3R(@5#q$cI{ijZtHf_*Po13y}hutR;anr;pH
zSOheFW%K?861~R^%M#+%R0M9{tNCb>;rO+7A$=TAEs-|5?f(MSHtB!Szfq_zSPKA;
z3H*!^b-B)B`^y~4f{FoN)B-<9OP$qqK9;QOXH=j`vbz_tjSUFO)YjyGQS~?a50Om&
zKqe>0|2>%?f5}8)_}|H#>fP~GEtvVAWV&=$T)X~<Os&J^{+Ovsl-!o;8rfgsce6fM
zuwatOy7VoV+tt%H+qErr`-SBV)mK9ddgK=kr+QiLy1!1WY`vC$M5Vo`CPG16hV0G!
zV%fNxx1&i|It#cvo6WR1Xds{yJ{x4URgN+hYL%qKi%jv<(cNvj@2Yb!Uf^Ox)7e`K
z_5q-C7KrE@uF>Y%JKIX)yS^;By);utCnAX$znvp(R=wj3(e1h{95+yoBw@zmjaybb
z__S5f7cyr>ZDVbTS2sSsjfP*_<3ARzD_ew=tJXx-j#{c;(ruoP#y#VcoDhR6+s!6F
zbDJs6aAIba%5NE&ncaq9+y#e>&LOV2tAG&}48>(|*`&$x7^p*i$Z(#C_yOaQ_Uh0<
zDG(M)77Xd3^5KjxX_5&GyNkoGX@B`WM>7}w!J(2Ibcf_I%mVtjR0jf&Do>C5i)QH*
zc%L;J#H}z6|32paA>wG*BDqhkrq4;9GLLK!8Y--6CW1yI+BeD*K`OGr`Cl~i@tgzs
zP-DFU3@hT^KyQ<rB!$6Akr!^wl^+Yr*pCYRhJC6fW_gE;BsGKDDXxRgEr&~?ezYFW
zc0XCXR@Ri|*Rc2ESkprHw4e{MYE0v-++C$RFj|pEt3FX*f;R=2;NcAicpQaiU>!yX
zKZdf4HiTM%(Q#sLzD*je7TZ=u=#%uIw<Q(VKZt88u{0kGS9g9&3D&E+dM|i++y5I<
z=6`^ciS^$@s@!k8&w$W<Lfr*U;+eMwhfqdT6z4x=D6LwstS8JfC$TFc$8r1eG=&hM
z<|Xm?c^rKb&5QT>z7~t5jBkL_BXtL9<KsdawXh?K3<IXAt4D9p=>`B?68jg?!Q~@7
zE=HNwKPzfmk?3|d9z9s6sz2z}yDES1Ay*IwalT_*+b164MP&6{%<#QRf=2`E2*&a4
zZB#ed^Yx08ax}CPSI{5V!4AB58Lx41sI4};%Q*6a1uP6J8aiuF_4T|L)4F<_adldr
zHNYKcMsoSqT(8Aq^aAf@Fzu6h!wEU>r@q%&%=*rSz$S|s>>sh;wzngp!|t4jV-<X@
z1kAOlT@_cr)=Mb*QJ+BsX^xbJ=6_-Ov;GW~WI1r~Nf!_3w?U-lXb{MSNgU_QVJtC|
z6piMjdGTy91Vms`6|f@W887?(D7-vP)DFCDv8oTSU^3|u<}m0H=QuiqyN{%0iT-Ae
zcAxo#xr2hO0QF3yG+r>XW)zybMp~$QO6JeiaQGm+kB}1#EmP0v6ojWT`2t~lTcWfW
zE1juBA3jN(%RzjA+~+(=2$56!Rg@2$V)a<7c4!!pqbl_o@_5NlI-S9~)@k&kqF(67
zJD*lrUz5@k)r&Na!HRfs$8`4Vl+2#V-V(o2O)vYwSfWtYI0RTt(_O|-nLSMupEvWH
zao@5PvIo#?40Y_k*<$-|wwPG|JzLRnjCO+r2*GYYP+}N)IHQKAYSNO$QOV22=et~T
zmXr=umnvUx!E50aa){8I-5=My{%6kq$sx&j$)gF)qeA)>4ztITlTLt<a%B0Rg;nSK
zhO$Efm3hE*o}**t#XfC!=d@l21lt#~^%ZsmOhse++1j*wqO^djb#5Ncf~3gmk)-t|
zlkuh2h}K$oG{pWYgMao*5FtLbIS!}SM!v0(kfirjd+{Alyt8&HbIY+uzFDF;7k?h}
zx|z0_B*i$p^Ynwow}*L>Fv2#?Z<V+q>6n#h3d@`)<I+QOW)@E<`JgPSk1k})`HXg4
zne)%#Ldk4vciy2PyiFhfdo)=%|6w?p7?}R8)49r)cG_S=7`=Hz;gSN+cTc>mK5NQ$
zeNVISw(`m|9sVVb#LJW|*W)9I6k9Aqz_4GE5<MPeGe2;x_4$<wZ7?1Os`fKhkQZ5C
zQf4x2)aVx!S~z+!{5p8U-$nTDWA!w`>VC2j$*%81KNM)7vKK)^w@nXHEP?RrN>_*W
zTZ65#m(JJoVJn!Gq)Z^NQKI&E3tk6(!X<zLvCD1i2UUe=v-iAPuZpUtir#HwIRn+`
zPY-^t-v*vq6iw&V>s3vx4a+d%LBey%t<f~(fKE)xn58TP>LmUs;i#G>(PZU^>?(!v
zpnD)Ai@<xER6YzWSdSW*38QafqWT@U@~BUJ(2p@qse8G6F1k0NbN~Y#cvqZ4uW*}^
zJ_IgDCSE!~>1b^LAaoY@c&RN5HQtIL17cOEF7--ro<zeu<+A^`D|cKw?~1P1(%Q?I
zuLi8Rn~l#hPR&U;Z4pt6x0F#X@5m3R<AJ6m`AiHvAUo$1-?k13W1H-kT%sqX;&8Gy
z8RA(ijIUxYD&vTcTG3G&>hg=EnhIJzW_|;^EXn26{i?J?tGwAIV1X2<scC>`lh)%a
zD+7aeq|BDL5IsQ}Mn8xy_OL=p1q3lh1?a<b&mWg*!6UPglwRGM6(PExZQG8!z7q9C
zS)aD;?dk9^hGbwBSZB3lQLrD7&-h5^>#J9UX8^wA;%!kRV4pGievssfz_>P{iS7Wr
zctm5uy-ZADC|BXT&e)Gh*U}w!#tCcD1`Bw%Ek#{j6;tLyXu|ls`#%#z`tTt^e7sR(
zMHl@s@MnPbXRASxBx3N&z3`UKibg6bD<>L7`kSYiXB)>_vlOGNy{8^Wt~~<i7>bhj
zN%#DH3aiV<&ZO!$eFAyjxeEP0Bm)LS3Op{n+OZJj1@Rq7M(u&Km><m0n7}HI$6#PU
z<z55T`iy`3Km4EmLj;zgMwRdOE<e2~)VZ-gDRexT0z0cba;;|^WV-rkyG@%mT6K)T
ze3qWsj^z4Qs9W}hCTBn_xn&wVZA_QPsvR}zsmSPXGM>197A;CP90(HxES{Z=i6R9l
zj@6cjgHj`+B_EBIY`f|Dv{l5a6N7tY2edXa^Xm{%TI9TC+etm=*Pcn3?O;Om!xKI(
z!Uu-;^PjHY%X|1u-Px@QWmsji5~C<Mh(s`@;?qwB$)jeZJF9X46RHZZd{qGS50w#}
zt}mhe&J#)!Ly?g#*cnnp!eDp!wF&@js?&pnYeLKK$vSMGOowAeK!OuidkX~)f=ry1
zXXV7XSAmq$RyR?9w8Sp1s(jO`+lWa|ens9alBNQusmI}Mi^pT1shkVL&Vb<WC6tD4
ziy;HDX}F4Ztwcaq6tuA<#oxL*U9v5jC_AA;mz@cY|CAB#e4ZVE@Pxq2|MYi&&x2}c
zpFl-nfX`()A3t2xUoPTf0df^p6jCk<&9G`>9b^T#4rT<x93V0tncxD$4S7zrRzGx9
z!pe5chuXnDS3i9C0ehA-Vv}w%<Pdu@Pq2-LEc75e|6o0piwGyxAej*qA&ph&lm2Zh
z`R`;V+lSX(X$ugsPak%dAWFiDalQS0yZ2abt~Y`V%$wk93z$-{G$qbEV>PodvLL!`
zwuhhJt?ij3>rRSl4oOx%c&;3a=oyy-m=IS$-Mb4=VEDY`T=Ozyxk5ntB4qS3WCw4H
z?uJj-(-l3#KqK0W<MN_Fd`vep!T?@_x_do%|BwN`vrYXd5~LvR^X1}N<@oT?a~e0b
zzLi<AA(<}fjDQ3xf^09900UzML<d`iL2`zaaUK+2WrR1Qdp$ZZuqe}Wp8&uIq?g|1
zU%glh)z!X~jw&O7^SZOR^egYoY?lU9<vL&+Z2daadQ7x>BBVFtp2zr(k`|I%o8{5T
zEn#su%Wwn}$_O<0U<LjA`Agv!;Mwmo2qHxmK$zH1y_|Y%TlIWwow3G2-!*)C7u#R_
zjEFW{Pi~8FwWHW}8(_~5@ccVB>QT>;o#z)Tm+Dzf&&)a%47q3BtvPxgUjd}86P<Sf
zavtt#QuI)C2^dHvzGkTem<MHfT-6VoWVwxRW^}q(c?-&=%m`B1aoW9le>)op*})c(
z4-!7WqP7teeB;I@&eVd#Zo47bds5%c-)4rCRkiLEVJ_&H?vO*;CPtL)VMZ{-Loz$d
z13?z@mS;8C)nV!66+gC>smU&1n2A{F{AcZsa2de$tH2?C$eip@T{=Wf$kdq_^ZFVP
zgARo;8{Q{c<8b0!RhEa9bv(lU064<m+!Ga$C|p5gu2xY*5|QxuI%xAMt`sIj{4Xa@
zGXfA^WBNx&cp%8YzH`l*{Y4EpP=rCgCar_+<!PG3hp793;!ixg-{r6#!WUUb`FoP7
zq09&g;3iA-@CY(dJb^XUJii4<0q^tf?jdfhpH!159%8N^XuToC6C5J@4$w76@2m_A
z;O>#x4<4xNQymdxVU7fMQXJ*tlY$GghLyj!_69dy1f-tS$6t@Z=p2h5MF*eeYZN6)
zw=f~*;liQk;0nU?c~3VM<fut5*_3r^2NrGCD<JeIH{V!wioBT?qKYTSFd@bv3S_$E
zmw(R>jhzm?1o>!jZGI3<;aVPuT@l0^PP*Xx{?__wYbo$lo#pt(2j&qK@_EN`@`A#L
zEyL>t13P|>k>8B+_r!k%FAN8K9D2DdfTP5$kaBvkU-+)iYbXC<ZM8e6v67IIJMI%8
zNSF72vH}%D&QGqhD@+C|Oi0&`$-TxL|9z*kl1u)O5$1gSR}dZ$x&R&sGBA#VdZu~&
z!+^#Y1b>cl;$<Fu?oJ-`rOXvrY0f<D!Gt{hWxyT*3c}}w=UUsr>{-!&m6U<Y`>w4{
z_qV{ay1BjNc<;Q(N9ZtgKbBYTk?2DHT~Lq+qy9(&EbvLU^lUdFnE&l`{=Y^?#lzl|
zfL`9nQrX!Cie8R@k%8eqMIA>cX95l;=KrVU!^p<U{BMm=v&M$)CL4m!s`~A`$KE~D
zAhZEU7;>9=Jd5CEXiE+LVY5-C?q57J+5C2d9c(zqCma${>og)3ZnN4QSWuuzB}C{c
zAg-F`wCV`+qwU$CY=X_GS;BX3vqWLiIP+1}%s->pf=7_87y@|W5yb=(x)}tV@SK3>
z{W(*_f;k02B4LGxjIIfU(#R1@p^*vp9hikkEDcfdD9NkP$N*Sq!&8Er-G`(!28csB
zeMiI%2`!0jJvWu=>i}B?puDO^@eL&n&_K#goBbz>^6)ivs6G+t3}FO+14zN8!u0kj
z&$I(oB&d_%T!Rk-<>Uh#;iiE2laB35^f^N*Lc(`Jgn9~yj(JqYq6Ck2V5lIX<n5)#
zQS8FBrJ)WWLJ$iC4nlb45e?oEiA33h<^A#J$BOEUW(%G{jb{`p4|5?aN`q{Hnysh%
zQ;Zr$Q?*K9dV#>HG00XVt|2|ADx3qEvkX-^UM^%c*Dq%Rk;4306puR<Rv_lfz`Oud
z9xz6XkD&Jp!Sc3VI^Dm@0DRS|2$&lj=McDa7YY{Qd3T;6$7h112*9gNf*5>laDH45
z06v|JgFppq!a-n-RcHuMZV7^;6l5`sLtHu-41cr;qv|M434=O6RVtk-Yk{&Am(D*Q
zQN0uiJuF*FC#+5S*mA^G;x|@iKVf_1;GmJi`&kQ8q}!3IDve%?tUl|P7RP1j%kaKW
zvn~5pgO;%qEc>=fs*A_cH}y;sMp6P8C7#42!Yp*2vj&_U{K9N5Jjf^jYG|mDLzMN?
z86;i2sA1dhxqaPLI{6B{EWudyQ6mSfuZ_ru&L?iv-wyhgr@g|%!;vKxfNm*NVoKnW
z%rI>5N#HX<lfo^6W?xTv5*28Jaf&ixjF`hFD2e}XU@caUIs6MHQ}KTbf|;O9Q6?yo
z6e$W7#PXx=gDb&vQ6dwkMfs=nSEqM|_sg#6D(Spbv&m=a5gAwXkfeg3X;jxuLP%Y4
zDj+0PNXNP{jQohu_?t_sHM)?%-!&uNW0jSX%G)*>xrjM4vZIc{F{2ZpT!uBtU6zPR
zHP5nhlaY*NmQP|9sLq-;BrRS<%6Iio#H6kcf9qfQ5``y(9b!g{yanmIDKGd&i6ExB
zOUEYZO`302C5^2bb`>5H_@t#S4Ag)6Cund@HY#BeD`z^(TSSZSGg22v)SUws#~|Tu
z$w_U)lZt{@j_?jZB@?b`QU)cnu|jG~MW|76*Cy-rSAZwsp|W3=IC~WwQp~4ECCy0M
zJyj)@?Gw6Gx+PhYhH7Fe4vj}`B$%hoN`)(B%Avj_k-fRN4ZQOz8p-F?<59ZYUsNTb
z(Z`&QN(n&4WUmo_6byAr$Br8ZrE-W)548DcYe6l%-z^8PrVUY=kejY0#-|jq8&l9?
zS{S7zBZ+2>a2dd!1HEZt#@CX?Xb)MY^gm=JfwA&rFJ4n73rcg-lUlk*85i0D>E$@E
zn{FbLT5>F|l^^h=95*Uh3Q-GiSnZi&j@nr0I9^`=Ubd9aD%%givsb#W%1vE#U*ohz
zHttqIp6>XbCx%?7Q97$s_tfUyU6NX7*wgOB=bqOdf6c2LqLgW9d~oD?Jn?K&E?ig?
z(Qap#`(=TLBh3;+>AT<7$}WfEv~cje6ji9;4Rl29AoeymxZk?-BY_XqEgXa)+NfDQ
zll%N;=1`R^G}@Eh*5uQ&8uh%+cZNM*GYbvQ&+fCTXPe@)#WowUHTn?L+N!GlZ1Yk|
zwCr2ep{lL7GQC{%d64&q8(ciob9q&Ez}xE%-8;J`W!2P4wVE6~+q<LPTs_ESqv`_=
z$L6KknU4uKOHW<$v8*Rh?Cf0DOH)>gzvfBp)KrZj;A!;;K+A4b)uX}M&UUh=r%c^N
z-)!9P{F^JfHwl08siD&DL-I4R$C_^PnkjsTr-U}DqEWGP`1N6~nw(V6dG5O8{Ne~<
z+is%Qw)Wh#{XN9qb_{-7y^`teq5Qtr)|Re<aCVm$qP9fzNB_IctJX$&Z?GgitjUjp
z%C57;PB}dd1;@pgg`7Xp7w9sRiCmT&<E2@n4SGj(%gt21mJimJy0elHk>4P3fLHzO
zy=ALJiaD;9ydQ4|NIU;PcTBg_!gclc?X(EY3mkqPeys0j&gp0^X30VC71wn!e&n*+
zGe3Yt)!!xi|1S<RvUB`*I?u?&!1izdV%ci4v47L~?wi`VVt*JB9YqpR2Rqq1O19L3
zXgf)`CfN-k)A8cNuh*CCJ%xr#4s&IUx{yPAj)z~b96aNDqsY1>9Y|G3T$=dT_Y4<q
zkdS`guA_x|U=e?09=`6czYCQhXVb@F<x@7=%a6$35`5P-4t76@kcEmq4dW%t7fM|f
zRnB%hMZtEaEqIr7p{d%dR3^}OQgW~HQWwiB6l5gt@O5#Tdmog8ax+kM#^+}XOgLla
z<a@?cC>KgW<u`(N4{^N3Px?wP6dpjj%-X}zQoO*qBY1rDZ-l%{fupxBcGvNu9$8v4
zVIhUr`ei$=GD@^jxO~btbh8{?IXuu?VYa-%A#!PQZo3qyn!napM*~_|Teh+<=`6c1
zFUTS)0h)<F7>+%@p}~R`?fcvIQHCdK=I{0CU+s83sZ2Vq;l#O@{^|_^QgIfsA|o;C
z8YO0|f%kNKPcSCE1|&15#n*RKDaVepD>6^wM9~&nk7*Pt`Fnp$=B|_mpAyM7T=tCx
z+#X~`DRH%{Z(jOJw}_Sdg7)S{>^b2IZ?v_128Pvv-oba8#A__X`}Y>8Ez0=Hh5|V+
zs^<x0YY?vY*SV)FbTduh-9wvT@UnAoA9;3ZsCzsP9A^=31%^qECzAcbyDG2y#l>+n
z8|%sqPWXJ<2B%0;)4@X3j3vX$nkq7E4NyT*vxBymWdXasQ*x_rR6&+Fp~;N9;Ru86
zc11+8CsY$ZAi<H<Bh&jzNArc(#f}gj6Ct(Q(LE6^+i|`vCA_npfzg{FMgo9v5n(jO
z{_Cl+sY|!b7-M?Ul(}Lsh{Pa>j!S=3h1f*fUXO`Vkh~eKK+q4tm+3eP`w#I?uil}O
znlhar2y{hIXT)lG9NBQ5^ZK%JRhd&|#po7QZ!)JXNMc{|3D74*s%u-gzY%J!m@G`L
zj4|C@e)3geC8&?w*Wo1sHTqHM=%~2ToK(VGXHYT6`4jxL3ZQwW5OUeTCki(19a!vm
zZxntYlTcKKef3N0C2Gdeu;zs~b?}PB2=Uggy-syMC#E|dS-IR3iUlfBG3()QdQ3?5
zEGr-Nje&-0V!!g@JXakVWPQ!NPTrFQtjSZ_JnI7JlC{Sh2EurQsG1|*PV0os$wHW1
zd5IA8EXF+7v_1k``#Elx&4KTG6o^z|s^?lFOJRwX(^Uz%QzA6PbTs=F5@yi}b!r?X
zk+C(-aiPoI9(K41QQYWaM>%_Q^w2(`JSz_Wfwq`?ih>qIDd0%uF>at*DsDi^P)i#?
z3C`ZBK*lMgN=py-(Dbv87}HfBGryK@=Nz~{PJA2P!GOO`(vQ|?pO@HHl`-apMl78B
z>XJ$i73|rf;{>pPN?nDDI_=2ilaR#8Gva;RH0Lq<!t#9MZ-L=!z_^|IdY4bHbMX9G
zYF7J(A->zmR-Qk7EGiIj9?4xG#lUggOxlUwJs&}y!<-LRu!N@~f<#YQZzr^tpyvj{
zlw?xKSSlq3pc#W8`dxG7dNWhnD{b7|cJOi#G101;A-+%dzjudyF=D<3zrO0wLaug4
zvec@sukQ#4*=e9T;9pjI29zgIk`AZ-+;p7z0i-&C=KO;Ua<KfP46^)N8LU>{i1{mn
zK0CFy(oi1kMnjo&{X_y8*lgwvf~)YL8DMd=9@T1Su#z!`d8e&zAw?#VB^w~LXc~%x
zgL_lygZVOMfS>c4L%$TKB&Q1hSbCwFTYYgb2j%YQDn>p4p2ElR)79j3Cp(G(CxAd^
z)2;}sM_NBuzE~z+uXp8qWI4t1=6(oC-1xG;XdWK9tW)ul^01oKzo7mcxs)$dmEi#*
zhr~aweYOsNRI*3%!Hko{2l^RL;l9({LIA}=6e>9fG{%9vh6FUW(+k%KA3dT_4HX_|
z36`y|2SXuZg$CLqGC5;Rc_ShSwm*qec$#eM21{>fS&aViT}G>5f*Vl@1kOO1Fgn<^
zg*^<;U$u3_5x^NEx=&WqG(KKhmnly6!AFiRk@YlM*H~ELndGt2y69+dvJ4mW>Yb%5
zC~s}>M_a|W0g&%cA<?reQ48A`3<LwOUY9Fu&X=%@^zYiDz%}{hN`rMML_Q0dyhO5d
zXwf~u%kJ?Dq>&}PS~VM6xTNWqf>{O;PSTrk2Uo`13!8%kxs94jy%p`*UYs-70fETf
zsSo=3fo~_s7uPv45|IEcT6-W-4#}o~Y`ENznGgbI0D^@?725WU@wEjf>C}e0MKmFq
z_mpB#6Ii`0m_MA+eAl+Rn9w@tTxo9cLd_CBSI!j13paGdl+s1Ui|I^#k2!!O<``Ks
zoY$pRaxq^uIJNhfOq@uV!*GRjCchh_waN70&~C?Lz7~6&dXmWYphKq$sUo-VP^qKe
zf{2iYch7=b?PnT)2ikU@Sm2!jRBxpkUE59PUab@PC%u5UQqFLJR%)2%IapHGAz(Re
zq;iI_kA|x-<Ku~R0?D|7buKU#r`s<Q5NZ2!x-7D1jdE9GJ$YD>7YvqYYzVC=7V}G1
z1t;Uc#knTdN49J*j1>wUVwE{oGcE6A&0nkJi+BM}!CTENvOrHbn7o5UE6g%zz~V8-
zj1VCloQ*037EwO%RxfqNJ``Bi0STZj?7~m3F0(q3i1@nX0Zein(A;Lo{hO=loi_?|
zQk!lRBoJ;q#1ca?$iEXM5ct5ChgSg^SD<seHk$nf@U)0@X={dMi%{mmb;g4c<C(6H
zRGYKf6AT$4J>&rcoMeE{XxWYj1YeL9B`h*<_@aL!IHz=nsPazbiB$}x3kRq~F_>!c
zKX=74-6zJ)nJgUlbeqSSFR4%K2p{o<Mw#Nc)9YeG#TnaoM8tG{%IZ>=dQtXsV_OD_
z*Q=KjOix8Y^X$&Q`iqZ?06}DB+4VIkL`CCX5ML98)&uZ0egku}xYiqAqmw<RZj?#W
zbx8ZJv$l1EwhN<ily`#NM8wv8dl`DSS}YEGO}RB+W4k^0rJK%V4oCa0(d(XCvA+-Y
zIOpfK&(}uQqR*vWo(O<#G!>dwHsH{x(8nP{{?xbO8|a>FwVw9F$<v9{W=-+D`R$)|
zaqqv~^K$EK?j~~Stna?BfBl)GO*i>0&CLB+2mRg$`zgpe#it8va8&a1x`_EOJXrb@
ziJrPUqhY&M-?e`2tHrVP1N~i<C~_+-{iuH=UrIaRJ>p-^X&^7*_M9=(fuHUNOq%$x
z_D>?n{@)_V#`f<Iu|%tG*e)^rM+714Vnk%TCyNUtnovLrtn)ntgm_F6FF`#HRM{++
zd(CjjEtI=Tv@DvRvN)ZNqj*X6An^Bxmm-lvkkPz`eG#8ar$?CieZ95f0MP*$+ylGD
z(Cql2_Tmvr4W+uQzmlk^yY){UGx66e?tn)y3e0@_+65+q@aHg8Ww$H%hT`un0<Ry{
zmnD)@J3WEZC?Y_OzHcrk_o*^XAgJngFM~70AA1K1PX;W03-?Fgww~lAHy~{BU8+kN
zxiC1=zl7GRYa!NwlMMeRBiq~hLCVn<HHv^d>03PMWy7PqigqQeoh;<!+Wy#8^Tp7i
z25(6JG%(4u;Nr*E&=264plA;3e78j%b>ONm4x!yp^A!*oP*85xRfhN5d?ONSzZ}Wa
z+5kZU>=os4wPK`fJO>~Qj1*6#SxVaDkinU9{lM&pOuq#0tnP6nv&SOc1sN2{qH-7z
zNiax=s~@sWGt0N+o!e_^WtjVJQ)L5WWDzIdpi4?n)!T@;LkK+!8w5jy=KX6&)?bA3
zk642B%%c)nm=q$)@x#LMp>y+W$v1FeQu;f!Yd!&DepE!Q;Gl95o2D;hUA&9T6j0BB
zc)P&e1tc@%y3#OkAk75O4#GqqJpMqm_g&Vz*k7%&>E^446n_!qGmw|y1Jyl{v#WV^
zswq8FALG$ct_zlW_MQ$m##<&&?&b4dvi@4`6(9|DIFdEZ^U#cG)T%TrZr&g)(`#Cs
zu_pFykr=URww|a+XN&IfF@bZ}Pieg6@!Y7^8DGtI4(7kS#@Sr0a3<X;^HP6xrPl3e
zy)LmbJ1b^>E49Q)E+uuQ^6B}w0%(MkQ)!Fenos_zUgsFBaEbG)fj$wbH2M^OM<<>{
ze)$L1Isf5U3=<pYzs`HAHKk)W#t?fx)FJpB*wiw=2r^k#z>J79n*;hJcsQ@F0}{-`
zH6@o4l13ZHV&%If*jSTB*^GdR8#K3cb)S|SpNK+!Jolyt%+yR*=vP9?8Kc=YK>0r}
zZseQhXanpq6?%Gn?mtUOG*2~-9BR;8@dt}-*(3D}*gN-^lBcH^w6Oo6vrC^OoVu#t
z_gz?iJi8k=lnuI}e--v<V&U8DHjZ1L6S+NXTy>KBb>eDB$P^%%^(O4(yaO)cr9Dra
z4n4_astmt|$ZTYqCTJNhavLsM8ZD9!k#zxP_TkbWC%KgO5AP2zU?!i*tSDirGsjoW
zjcq=3RGt&lGoTXE<T({b(+KFat%+1xY6sNuI0oE+qo|1u46IfR>tiR68a30i^SG<K
zaQmLS4%j4wWS&ix>0qxVv3Ysgin2Cozc|MT)~Z@B_)e5qN^wk*s~DHtrdR-(p`yvl
z`cSoqszcf7`lYmRB=I<hK0tjs%>s)?deNnj)l;=%LI8`TnQup-)p13x*Oaf6!Ci?9
z_Fc~$Q&<!r1~7K)`s8_m-H^pZeC6;%sJ7E)rie#~J!`IxwyY<?LZQ4EUDFktJJvQm
zcS~rvIu$hPnUdX{`9>$UnX9R;qR2M)p5Q)<HqzqXK1Brsi4{1eMku%^w{WR2K+dED
z{l1Ihtjq+n-C4^D6*3;AFT-JK#e%CA#G0zpE~0uNa2E-UO$PK8L=Nv$oW-4_Og-+~
zk^mE5?1IG+5^oY#N5lSA{LMi=OrmOW>A8n98;Z&i<3UKqfCO>3szL5DuR2Ow>qjKI
zs_L%e$%lV?6Tz1X%OsgL{~L3^>Q54S0g9!dX+}BCow7<nf4~Tmypwf;*wG2A)_Dy_
z0-d3WvNP!7m?y5I&?)^Sv7bffej8;5?5w|8I>J5&Vpm}*NjXtkfA<tlt*PS(6VIc)
zWsLu)*LD%5yzHNpOLc%l_p#S~=W2Jm=lM*iBAb39u~FCtBH&;3saMb|TIWL5rU08D
zYGBT$J?h!dPEadi#f5?VIBN>kurNUKbc&#W0xW^HOH`m(=$eB(LE*Y|b5nV|4^U;0
zSDZICc!HgA<?X=qvM@=KVrC)k_q1kU+PIj{1Go0;^9ezXa=4H<9d0Cx#<Pu7oy?`z
z+8kdNJJ@)(&KB+*V&rK=PCQVuX51tnK<EH+fFh;8p;=^3_WRhf77HN(-gPr14FntR
z6>g80J506g*&fSjR$dLs3ok!FBzC_ka2ClUiWu@^(IMQ$5mDL8(#tkbabq{Hr1t91
zU$vE8PmU=nQJiXQ%jaV|!|{It2ZJtwZi$h^gXEdkr^r&;n!_WdAf8AxF$Reb?99<*
zRG~q~alQ4Cggu>7ia9z4g4W#Wu{{OYdq%+X+mA;Ab$v*nBdHT@gnIz-T*&LA<vH(o
zpDJiG<=IbR|BM3FR1y!8-=^H6kpQ->6YTVDb@76g%g*X@JYn`CEARk;?pWSgMicy2
z+s(&4qRo11YTT}G73~W%2d}P2-p31q#SsZv(~J$-k@l<eQzAex8Viao5=GhpQREuK
zbyyi&(JE@g+Vd+H`Va_iQQwo9(UWu+;AILeXf&C_%=9d#5Cm2SEokfIpp$O8c7?}L
z<Ms^YEQS;R)VO(J%>|iJ39w$H>~|%`zk0I=Kz}o<t*Oc71#kM32UhPl6Jt}=G!2#o
z>);9zo1;z?@0D9J|1s*CL~IskE#Dk5&;{fx)oGp+><O0b&2V$!8ijAmCMj^-(&?;m
zyIjuUM1l|ec8)OyetDQKP0Hq91NT}7rF+k`S`O`$i+L<WbIuW&C|Q#vJa9J#v>)5V
zMwcs{|2tBXEt7gVH(;Ok$>+(e?cGbb++gyFcofdNf-Z8P0bhSL6xlsXwYj#VB6sWv
zhp(I3e!nym1-isVIlChsyV6KOWLCDKfd{|sta2Wn*w=tnrHoZr@S_gziK^L_p{-v$
z92NIs+fuluxMUE1fIY4UIW?TXq-U9RB>P^HjfpPMTlO8t>Ta+J%`fU{)El%EqPu49
zhSi8Nx1t58@$Kih#V*J@Y5zf|C<$a+E^rb-yHrm~=pCCvyEAZnJyMknnT>@o+_z(V
z<j|kymYGZx+?%U^F=s??>WGO=atwSTzT-n#@(mn9zA`QN<^D(-@?MCiexNk#eTofR
z2afZxjw8aX=6hu#N;V1-{NVfX`w`j)7MADeO(9#l?wuNh4RR}H9q<VMgfD8H@I78~
z_DLOQEf;SEC15RwkX>J%++j?jcXZTfC*|R-a~e5<e@D^M-cNEA(S(pa&HNVIblL$A
zji5TJNydTix>9%<@wbv4r*i0xU<sU^a8=rH%pKUkQXc2SAbj}I;CC^)JOv#!ic@IB
z0RqLq;#Ez@E|xbcFrurRGZ*N74<B5(+G^JDz1NNDs579#k~lOGCBNHIeeh@9SH$}{
zHg&)8{H8HEQ3(@Tl7o6PDLhEKMf7=pJ!~^A%ZV`u061q&WX+-BwdIfs*1<<agCb7;
zr?s4TxuP!(|Ng8d&5s7!Pxk7Pgd3@7oGCd}+lH!7g_@*qd-XerS4b<1>iTJa$1&SP
zeg%esL$RyC&Wd`{1Jo2#@z%>(?4s35dMJ>ix{t_o(VOs7KSnvcucpr}LK*xoxBK)Z
z@ZJKxSD}^8y%X?AoQP*PO@FK)29(?Snpxpe7zv0Q<^eEfrFs`)gvU|M>1Su;X+7c8
znWR|ppE0PnJMk6X7ds#Y&csfhCo=gHQuyy>xPqJhBG@3w3-P`riWiKOraNSs{`KFa
zFexD9HgxaveDCde&@>`gjdKRg<%^ZkZzQU|)|9=TPnI!+$dx46?m4@Xn>sbB`wyX<
zUznTA&l(Y+EX%IwOU}PxZTFPkTPojIB-5U=Hyrg_u1q6Z2fQt*b@AWcxz$t2(<xDJ
zm$7_nCTh;pQ?eJitXKa~Uvd4QZgH9Q4NbefoxY&EM%j4BhvIG27-PZ*6;`x8hUObn
z_U)?M65WaV>v+AM_C;nNW$e!;P=n(K<Jx=s&4mRq){MWLIJQm1MXx{TbwHpW&Ce#C
zP91rRaWcCHzEu7sUC60wRE*X;E2cQW=Mj7r<Z+S9Q>Z_1bV_u8Z_U`kMNDi8bVd=D
zW-!Al6k^+!b5Sa;$V&DkWxxk^2$V2TF%_4H5-d_rPYae*^p<}bxA{K)iWlBODs{hl
zowU0%0v;qVHhr*m5ElWLKv0bO7!D=>IjkH<*xs&$ks62Ts|0RE(F^-Ud9<im<y>{f
zr9yfunlBH^v)Fy=OwvV={AbdE>&}2Rg~dXuwQvzPEK+whdmVi?*Uc)kl9u4BOG)($
z$1dr-WsRP5+}C%U8U#H#jmG5pealAPdwe6xo9C6|gbddU83&*so*X`Icpq?k>4f(k
zhn)k{H=o5;SZ*G31SU#J>O5*l3rFyvrrZi@P<VVyz`^k?#JLnqYX7|HMp%FBLuqY7
zCE+#v<DKcI^=sd(L*pX5?IPP<ZqECa3l@&0sfQ?}1VkQ&nSU?W*9FSW_B03XLJqsO
z?D_|=>J(7xpN#E4Bymh^jQ{Jr<Nx_4!WPzs?ZL>CPwxPPg8#NiV-_Y{C`$*tY=Z?Z
zOJ`(N03QjZfMnB9wMYd?bIr#Suh|TyUQv9uY!Dxc@0`wT)<<-TI^*X!b!ClpiD=2y
zvgHqvYvt8(1Q`GKTkxS1G)G%n*5~{6aOF)@dqVx#fsWqRmb~Crb**ni&mXkV9_w0k
ztqX}A9r}bJ5x0#5w4NHa)~Du)0=yH+M`5RK1vah0mI>z!k>mH&&Kv!%c5DTP35di~
z{qS0TpAhE^nfMulG>kr8)OtyXyIf<7yE|o|VkF9{A?NdrbLC}KSy*RHWLDbml6k!G
zv4SUu)wvPjWjl+?ykNgn8)0bFd3{@{o-VMsRU~(XT8n(zikiz;u3nXID^)yCUkv{+
zC5DDG6wPccMCz;h<l21%Nh!$e<8Ost&?SIk@E;S1TOqUdInJ`6B_S+Hbw8SO*|!p#
z0Qdm21r3tBzV-khz}YgMcW7Qu*nN8by*le&AiCorg#G#n>!zV@aU9^)7E;>4IvM3h
z)$aVa{=44tF55k<dK__^KlmFRh2u7`sfiuucSqt{!kqgz8~e0Kj?D&3;Ti+I{vTRe
zN%)^7imT{P9p<Y|=d5{MkPh-A;S!71L}-YKf?d8}88mw>J+%PkqX@(gFd>6Bhq*I<
zN_Nj`)>3~jwEU^Yob)1r1Rnz33>Icu4=8ExFSP<LxRxI2JrM?#y>JBHB&|mfSE&lF
zKhybU))k|Io5{j9xdI+f8tW>m)ugIw$Z2>znhb_v6rj$pf}^D2!%|rT;iyseJJJ*l
zHWX0Y`qO@)L16=$AxPCU#Xstj*9R09$VjFH8=CQA(_HKSVv4Y+QbctZ8fm)PIy~{F
zgvx3HVyYdN+t*xCxT9LX!Kpa-3OEdZPG3k1Sqe`~Mhh_tcj~9OEH|hB`<6*;Y`zd@
z{l3Rq`^VshCavBWr-jrQ0&eCkRSkgFORPH#2NvvW)_C}qwQgsqcnu<gwdk#`t7>x)
zeplv8NVh2#WE}szW!Xo5kn@MjpK1`R&*&?fYImEfNp>ge4s@==%nOs!EP-0>xg-Cr
zraYdOu-z20&VH_}b@Z#j8npY>9il>&u3uwnsh{LDzN3d`rQbZS3X!eR$)Q`@mqxvN
zE$PeaXRXr<B}POq=aoAZ@=?C9ILdY2dq}#1gP0Br0z4EgDGkFSJf3Zz)`aBSG4IrT
zCFP?aP(T1LI)Bz2z?SeNwF+uqN1?Y>ZgbmsDU!3LfA<<Y`#@r*fpinlgk#QSI3`7b
z_O_K9&%F{f_Zp}iI@Lxp?~_vn|I;Q#_m2{c#`Wu-3n+$Fn^NuTN`l6E>^IKzN;kKv
zf{7W=3GvWKUSpzA^o*^hO<y?(t}hVg#O?{#F((HxB(`J)&TKU*5^=(WNC9W$qEJwo
zGHSOly<4C8F-->{3uFiy<GYtXpoTD98oXO@(T3l^1}%xhM?<X|z%bbizyDx{V5V_2
zPo06Jr{&c`oLRklW67&^L4k{xWD}4&tXCGG1CJaBUglW6M@^zLfC;#Q>u5uvN54NM
zuOR>YwW6f`)d$c`ViR|f^|Bf`L$<FB>8sj};&u{iUZ*imWK3#hUfqXHKVMUs4;%Bt
zrssY;BP#JM?041{Zv4vQhO)fOr%)fQ*NpZk9eDcJ61R%e<Guc!V&HTNzV9|A3YBsW
z$&7g-j~|zmwBZ4v;u{mmmrT*P!E&O(e!}EZU>z4r4@+bO>MsmjS%Tj|QzlJ&9{s(l
zJ{-^9$kf0(#$KBZJPw=l@w!j&QY#oGv$78G!*<=TijUoX0nZ;c!*&IEprZ#G=7lpJ
zPI!{wN7tG5JQ2q6$G|t=2rvT5PWTHhxmj&)@6QlA73x`y15h3h&FYN!+@aV#F$NJN
zUFfAuA_?hnCQISBfh3ZE<CDxJ>5LwZYLK;;(4_~rBMJ<2BNB~wD1G_tqsui~>Y`Wh
z(ID7l7;;ZJA@%kH>67i~WNK-bh~Rl#Gf_N}4PC)kI<&_s7xAm!P37LSw@q80s~vae
z56;H6XR{HS#gIneT89WjXN?IV3)J!BiLU`$qn1?WAToh!<vCDTrN*=wMo0U;aR5^$
z5jn@FXt=Jds#dmBR!L+<W^zcW6}G=mFo1$vvff7(sL1=9kH}qcNzM3u+&Aenv(4d#
za`F93>?-AZL7cE8Ads1hEcMDMWbJb*2*Fv$|72@pci$^aw>NvyShvN@^OeizaZo>p
z>T;5tP#kMugdH<`{6t?whO?VbUbk^Wf};;E(;Q@uqOvfZFUw@ZrT(e=(MaxO9kY>}
zDFSeDqG6&G4q)JUE#ojzUXUv+nVLDL<Nz=SsfK3C)_^-A;{CcOHEe+))59uQ%ez63
zLSrGFl+XMAg3OzU(18<+DKO*bu*tHI26$AR;>GZ7Ekua%K__EeX4WA&-7@zTT??Q{
z&P{Lz0+Yasp&3-86YsHq{sqZDQ(zkeQKDp07}OcIGq;6_bi#?ju%KZ!Yh+%6!Sx{F
z40i0(UUzLP^dxiqUdU{UQ<;vuGF_2Q6qSyvd5a}1gf_el6m&?|$I3~#s{3X<cSrCt
z0*546eA!H&+bVco9zxY219-)zFi*R{62k|kX(*DB-CzWVHgW9S_e_k|q>%TCLygQb
zB4f^NFQ`j@zov7T78tlG!*NUiu9+g>zl0n^xYQ4NQf~#ckA;n2W1ules$TCP8u8HY
z*$<W^L+YutZVwit{?aq-NBMb3H0x*c>aoM~dr+QCwBXks`Q#ynZ-eA(e>CBzi6+lN
z3^(Z4W)M6UQJl6wbw8k39%v|@uS*Dzc<D~N^xP`}AH0rg+l*8i+0Ny#`_LW}Xc@+p
z(`sDKZ_FxY-D9*kBv&ah9W?ZYCiml^oPe^tm{s`|W#%xMSm1Rp@Ail4`^LDkvY7ov
zRp~*CiNgr-=qCP!k{w~eN%L51V~Cogl7=&JaHQTD!jth|`jB$`B5jW)oGVr@<v?aV
zPiK)fsXtjIWI?kTM=kQlTcgkxZf@oNn7a3=g5N>xgNmP+u-U`=M0w1Da!$->hZg(8
z9ow*%73&XR0rJ3t;w}{@Q|(8gWIL7y$0iru3)3WbOvd7L^(k|M^hV^vJlC*%#-9>q
zCl(}hD36k}j-ep4ObXl(xTCM46*pw~FgA~d`j@US2uKRVtSJtUceRDYH7<uA083ns
z^ej_|wX}t<asiH=I2FJ*qzX4@2LPl7juJlLvfbTF@$kF*bZm{A>5IkE9hbwb(M;~s
z;+V0gvJ{%%en}ah(MHDVNUoH|>Y6&1;bcO8>d7n0$luk?*fK3ubq?Hyf?JN6JqyN7
zBV|T#_Kq?6Q_~uc321C0>w~4Jx7GXX@0AkdxXtYgEp?C)9RZf`dL+QXb73O&<~Zog
zKZ0Tr3DT|3Iuo3W?t5{waY^}F-0#XmS|Wdvcf~IT{pw!flWSs2{@aH#G5o`gSSA)u
z#(%q`x}~KZyU~H@J6n6}kr<GMYS)321v`gBVgtkinn3$L_b8as+=8U(NXq%=an&tE
zSTRBNip(MqNYuYsBs%2prYbwW_+BN#_nj(@ngfw0(SfS3H&VvDYi~hhtDomU^(Ghy
zJM#ERtNiz^(giBKCRT~Jix<19OQ-f1@#|My_IrV@T~SiNr%Sh@6nJZBAXrZ7hx(Hi
ziD2vt)vI*lb{NN6zj6GS1nB&GZfk9BSDOo&d49UuJ@plC5k4bVxJCua8eY8uH51My
z6PfL#4=3wg7#Uf=?KE&*!ru%tm|-JiRK`h?J`<D*6Kr~10^LUKh6`&#>x0HFYFpll
zcn+N#>l*vLxe?9l5f9E=%L><I*(0sp_(B#2t$lnuREJ$tf5oeVAJdGjj6&=oSt2`O
z|DwA8$)=5oZry&o?YL<oJ@_<}cH57zw|TmK8&mnVh95=TYdP++H?qZ0tX0|POaL=f
zaQSkQr*fA}ihTPrvxOM25x~2R+Tg1~Y;f9rH9MAtpXU<X2RYLWYPWz^uKK~o@W}Pi
zS2Iy2wlMcjUKrTJiAQyKK7#(E!q#&wy+lv%e$s^~sATvAA$OjI&tpQVoNz2^*REGH
zT@%J>Ite+z{NW5S>nx4GAT$V%b&O|NmFl900<J^YBQzXAR4`}RxxQF7AA3E&g!&^v
zC_E%HWxF=ghm9xTHh2?en^jL)c-sBcdYZz$&ji~XZ?f2kCnl7ABIZ|42<YZ7+-|J$
zv&wiALbqD2tN5%4ij=aUbf?B$F2bzwKoR#QAm?z?K%_QtPg2baWh77hko;t5az{jp
z2)b!SC#L~~KKBBum-Hn6<@3w}qCyNcs$Y<6e9-%5vovJyB}kT793x)@TrT|9n}Hvk
zMT4_<zOQjF=)9BoFEm<7aE*+auY_jdw}R;ljxl;Y(P2txLiJGKX8aEwnhbOa<(Z0Z
zZhU{H8s}h*-O`-vNc-6)8Ta_GHvi5zMjUkfHAoydWjk$U!zkBXaE?(`8g%AXsC5+_
zZuwPcu*;wNJi?5AHNe6WY#wCBnJ1nsJ?(6b_>L}GdEQ}}aRlrnB|*qtt>a?a?gyl0
zz>JQBec)+C=x?=^ZWQP=LSm2hXp12f`IC*;^BGm9h7#HiCsW!Hj2oLFv&Yvh#>xuF
z_5f4Z-fTNg6-zSE1)*&fc;fd*^}75o9oJxeJJ<1QjB1{cWZ;?p1&5;=DL_%Aa8llc
zet!QW2@pF*j))1AY8a!xyUtaz2-15}b)&^1!9?X`d-Mq?pQg#G&N~Ra=~fvx1gGK1
z=oj0L#hNtx^;&NY5#g^6xN`d=l^|KDu@3i_AGDIadf*xjh!#kjbD}t(j>0(~Q6B3A
z>TeRjai+(uZLJ82ndVFlrha*qoDYn(%WCFQIHCzKqFq_>85E4Hjx&}DyWT^+XyjVh
zzi)(b(X40D?Bz&fD(%sf`nEUcDmS595sK|w+REsByh7d!+GRIcf-^{cWR!qh&Ni6X
z%YlA<Uu0o+H9E8Ql%z1Y3Zs!8QsBG=i|zOI8{%j@eKE|ob7S{F-EjIxmH?yzbn^T<
z++Y$%t97=X#dfft(8AcFVIFr%ZkD%kpfx-(nMYd$hN_;R8+|XQqnU^c)9hKEr}Zb#
z4cRw|#akztre{B;tL!ie<OgV_LIU#xQDMpg62g|UVF8FEdi4mp1&#;RXlxD>RzYcj
zWh>YEowJlAUU)gp!!%Cx(xWMM#(N~`HqnR>xq%BFGZ#a#qk8mhuwB{1Q%9~H$c4>n
zYW$MVZ{qshA5#;m!Ay#Eqqku(`kKF3@~gbOIFTU~Wlcm8;}bEvcw{IlwB11}KlCUO
zB~aMu`i!hFS2sR&RB#svA_~lyXJYk{+h0yORyxEG8SpmqKuoAOh#6Hc`Fi(qMvJ?$
zHuJ)Vbw9b>3+Mvx2sF#3;4n}|M_uHoU`}l)71e)J;Q$;Jk%0}{d*J<ccG&0F*6kAB
zK{WgW-d6z!JD&p2@4E8FXK3A7xgDOad)%1l{!p#cOV~lp9CY%18+-9M8xZq8oACs#
zf<(R6JoaR})H;to<4HL~ZSep@{Y@BG_PbVWC>XJJCbSI>BHFOP9^w!s0jACH<HMsH
z!o>A(6;Zo&u?dk8`=n7yCale0x`OIP8c<k11Q&{Pb4rbWgs9Od8DFNNd=(>y7$*qr
zXSVF^(_7elL%D=yE{Ay=%ti|<>xrE~%OG<d({FQfi&EpD%AD>iW?+jF%UZ%M=uIOA
zEi8f~uAZEy`m!+3x`oUr{UP-V8_Aq~ed#K5Jc$Iv0S$>Ty(wf|f&;v14T&2(^_}^S
zAt`7HE*6$3O}#m)r$I;;B+wB<W}o?j`(O_>Dz9f;Y+V-`?`4TJu*R)I&Z9MN6WpF7
zais&WA}ar|Q!TF%muKeG(84XsYI1+id9xt46@rHaQn8v_qp+~vrZ~YBfe6u|THL+}
zE9#$0M8&vEjv62tq^Dr@&y$FPkn3<L)1Qb~$+6h0E{IykaN4Xc!XltTh@D>%DX_4}
z+~Ufgl}Msl(6TehWedxwIQ*#<!Gs@ddari)a2zvG+S1i{S$Z;a$Y!gilatxq<C>+D
zGe}4YG&Qm5W5CnSUJ$}dwq4u<Fd?@932b37tz|J&!K(`<9$o`hi4{u^ic!93v(!h+
zMz>+pS{uX-C1`P`xDa^3COOt#Q<VN;Dw@@!1IJ{7k8u;dv6{X$fwJCSLBKg^n~cM*
zMS_!?Ys6bZwG^d^(B<1_(xKk28d|*zIOqo0%x&>zNb^|-3|Y`z4V^(PfxT-vowd2T
z`X7wFV{oQX8>Jg39UC3nwr$(CZN0JCv2CYg+qP}n$>}*WQ#Ezwt2*DmXa9ey_S)-S
z_qC*pm0P#pwH*@UzB0IP&Ic4hiv;%hOF){?h$nq@gC?romP1)qDaF*`c_m!u0&(7Y
z{0+lblv7!2826l2`&~XAlu^!=Fm*Fshfok-dS>9_Y}?tD*_nir<Kc-+xKM?;47JaC
zMoW*%0{cgrJb17l<)<L7B_VU&TSI$09prkb`STUiT_>JLI*RS5ynx%fY?U76nV#Z$
zs-xi@ZI7<{!;)E&P-Oks9WE#CCGj#3n3BQlabOJ0%f0ib2yBmW2U|w-^#0l!OUpUN
zl?Lx&&p)wYhGNaU>|Jv|_cg*<d17~$=-$Xax9MYeUygyxckOo2U};<Zz?5D<wUXy@
z^Zp3-{Qy?n`G+rteiBxqauGPQ-!gC(VZx~L3++L&s&_sViApREe#A(VKA#cHF!C8b
z44(Tse9*_m`Gn=FzT)Y9QZp5}T_&TP^^!ZBPJR2ju?jk2s|j=6PW}CQ_xw5D5SAuF
zQvZ_{{0}SGj2tWs|E(5W(pdYKu0!?Bt)102B`_Njg$a5lq)ar5B(weFDSe+;ZxRQs
z?Lxtoet6+ck6~Mw?x>X~YS^1NN_>BRyBSiT2*UsSh-Mr{4mw9Xb3oKc`-#qp-QKS|
z53dDc*DKh^&-LzWf+fa6$b`t!r3n|oRaNw6Ki6)&u>8qtiZkwQVM!~TrMtacci_Ry
zeXT|V3EKz#j=D*!k*6jv6O9MOvHRWOX<{g<ayvMwm;~)p#vAm#W^QfMA|-(YZQ4Sa
zHP^-0BezKMZBWw-4gobLAYdg4B||A}D<{Zxc8VQVn;($voO4W)+5J_*M!wZ=tu$EN
zRpMCg8lmFvIAwK_0oUw1%zwmn?(17-sC>WbV$w9dJA8!!*dbRrot6o(d&z4#(+P8Q
zK=S9ITzIWFKq5-Wr;q9IDqJ7m+a2n#;UqC-oK;}6Rkf}YyETAwaXBIsSS+v3a68GV
z!c7`Zw(|8~YqRD*7PHiK7f;fx6023C{>`47QKMLGtpKllF)x69_b9*E`1~m?l<v~(
zj^9+T{j!@v`e&-4OeR{92a-*rSC<<qIe~=97>fvuQUnQ&M4s1rWS0Ton?4Vm)N;6x
zMz*&f)^~R+jHDtDg@arNea;+)x7R^t*XQH(Y6xHYdMl2UB7c|7O-`qrJvXk;kOhVc
z!;-)=1#+-=DJf)(A+y*p9vlm?44H7>oUWjgazpn^$ofcF!MCG4ZrGNdN2?r2CRJ8l
zz1z0qFQyjB!jV88)jod8q@e)SRl-<<1;?M@xy_3bOc#{SZ&>?WPVUpcu<93=ZLV%f
zugkin)6<8mVcgO<FW2C-L5+o=u!?=G9J$#yXwoo5t11nC-cC@xpLz+A!3AZ7(Pko%
z+(c+R7ow2`V<kk{XLQlYs73Kc1wG|$hGq5%%i;Nap}Z2agKSV_(W5-M!xy3l&_blR
zS;Ue8PSKunlxaD~DJqUVC+5*6Iv_|{hfH7MMWOXdzZClL30ZR!sEAgVvoM4w_eDzh
zv>HtJ!Q)wkzVtu2#-O4Zo-VHRD8DM#>z#SMb4L0;SzV>I^u(wn6DBn4vM(r83k@a)
z6X8(zxxrHE#MqkxJInb&|Ku!sqofp(jGfXLZn>5b5j;cR(;X(IZKVq50VWbJcch4h
zcF&}}C!7Q+R@v7!V&2}X%eND)gph0oZq5KdE8VNNe~lN96`BB%FEt_o%e75v+3Jrz
zWr{vO)5dJ)4q2#H8j@_b<vp$5y7>9X_gl@QnpEQ1lst41mAg044}3pV2B4nbyATBo
z-jRMT@R*&{kR;^41g_u(I7N^ph^-+K`Zk6orF@|B$H3s9l!reOt_%m_3)RHZ=|{ZA
zlA8QYW$(_3FN)J4lIL$S=fj+CTA<zNruO+SVl-KJ?$G08j?L3P-(6ZESZQD>41m}~
zG?(1Oa@oYrhExrw>)VIsd@q|dqsM$S{Z|?Bme@E(ZZ?IDKV{3^O9l1O!;UyYb$uAd
z2R4t6^pf%1&a293DKHy1Dy>P-Zt{U7fj5JE+O}WIQ{-fuFO&=O?-9rXj22V|Q_GfR
z0-xPwb4&K#@-E9%V@j)da1`<mSd|jBrJPO@J(-HZu)U;iljob(NY^dfGSSz$l$%w{
zsre~Ix;V02zXqrFBSY`zKC-^I123Objl=Ak{|FH5%Tp^DxADKV0*bTl&TS|Egp_R~
zT*vqe3<L!ats#G7>#g{ctX6#Kwe><&u{sDj=PL{{oX*)JWHAT1Tm9&*u0g2ltIMYf
zc`?NtiFL95ehdZHO;vUF_N!>dp8AtV-@__t51yu5_$9B?II`HG<z6$iVasZ!+SyQJ
zq4Sog!QZfg9rrM@;&p&=O66tU4C-SyDVqjIXlwjgiFnWc9RG0|&`f^(atrO`+<DU&
zqDY^)(e4HIu>TANzn)RDDIXt)=NfOKcKd7W)d%wp`H#;q9T82(vsq9`0i4|H;yN}2
zDX`Ze?mm(+D5d}xHQdT^*-!^#Q#e<ymi`K!^wv^*TKq5eke3-}a1I4x6UKaq+>txl
zqxl@fkR;<s9K=R!J>9{+p@To9Q1(@qw`TF=@7W(pOny7Qu6^9%iC5SXT8M*L4Vu&L
z(%B(7kI}Oa6~S*9Vuwkn<xmtdTUagS-i&OfiM_vW`4MD~T*IK-cuOaJ+_uWU#<)82
zgz0+MX{kfk;ohbEv&;I}Y*K9sJmoy*@e%A&VS(F4^wU-oEm>xc7~)!v*;k42e+x5#
zWL?|J*cb(t#H-#FuZ*8V#lmCZ1g+7S!sCN}6vT||ac`qnG`DlHU*l#xf6p`#lk+9D
zocLG3r6Y;PqZ4~;QdNg@xpT97(w04%YI8j+53Y~@MEMT@XH4tr+Ja-gbfIQeMHwk`
z4xzU09`C{kMb(wpUB{a2q0m-w0j>f|iy?pElYE01Wh0pUhYOgI;r~u{GI28e*So64
zTAF`0o00rhYSYG1S_<+dL3nnP@T*MFCR7tpymx5$9n4xAWgJIY$L6lTKOVtvF{A%h
zBvrTphL^T1e0&w|$O8TE$mH2P^ZSL4GQZAbMHatX_l9eKd{8DjX=OI2&AL0hAGSVN
zwgwd~h*0dWuTQkMaM^kw{rxHMM=E;OsER?pzNXYJSYGRQmW=hEU7b-N={ZV*N-pEj
z<Ude{EY)LOy$`<+rr0P0YwYZI%@5BO`EqY>VnZwaTGxg}Gl~QqA4axj?CoxFb_8IR
ztMw?0vV93H;S-MykxSR5GE5AEd6QIjY!+lV*902c1=sEu#~`LcY-S<XRD>G(W=2^o
zMkug9!Pj=_$03LqA-Pnzq~n7u8kc$z5Yqz~#LyFWL2VhHacTLoUW~VzI{WS$41!jJ
z9hGh&+!3AtmnMQwJZe{f$}(*{cqRrul?Fw&9SVr9L8-pbzjGb$uie0uzUEda6*?Q~
zalXD4Bk#=H#-!o~A0aoL&~paJyOZ8kV*@;rdcGA0_Ksk=>*{g7tSUA}M3?(Dc|8rn
z9A==<YKG{2jes4F7*GEmN2=DnhT2xemd_4q$b6E|2bDO4O(9+7gMq6n+Ln72XHblx
zzH$?_^DlwO`Mx-wP9MRD1Dt4NwZqSFWc=Lz?7EIwDOW_SQOq$91vB(E5pB@!bK?*6
z%(cNyhEapHeR#&zhen3Q@#WDjs@;r$J}I}vi?tQgfutFB$}}VA8i-t45-xb+>^16d
z4Zp`V;C0JAn&WEwLYhTSL-Wt4j;pZeZo7-Sp%&eg;Ndj;Rl0ko;sFo}Cdj74KL{C~
zcI3ADjf(cFo_->x$AT*Zq@hNw;4;&xZr&s4>Qy)J6h7{=yB!lp*Mmv-2KvoB-wONV
zGaM>+3X%_ct)RQ34;dA_4aFGK$9I@HYPoos=OpAw#KcIm<dr}uE8ctP*C!+;JS~$R
zN)&Gi%5OF&A?mj(0Z2z}Lkq!oNeV|%;alz}&j99b_=c7vJWUS)&J@I;uck_2tr6&2
zueqQ?G?Aba0TMN$=5zGqg?(#$>a`ZgWH>v{axiQFqYx1ig!mA|s3-$-)|@;H`;p(y
zQ&_e9Tvb6o7_nDQ0U{V^|NT0Ygn>tZ62nFR3}_7SzVnv*Re1)2PvrdQhg=f0tI4w5
zUh~(bZ|^RDHuJfg$4;L=R`9+7e?K9kfik-IJ(~i0-N*xjqyio!-s!cdmz$b_j3TPp
zI!*E+1{Be6M>uE#yVF)y6}RZ5YmfrP;UQs*R`S-ugowdm9|ueR&(FT|nB`tgBr+`K
zXTjwrTzcmg&~px^GbTjkl_NuZkU8u@LY4ys-0d0-Znmx1-7i%|eEbxBypl~rbGK;7
zT}~IWNTz8dxlALk`bBP6msLRs#gJF-^|cgvo0+%4?%w<Z6wAS2c}9-#&VBne9>V0?
z`=N^km5eY;WbKd7rvv^@Ia*4f{w(Ezusce%3=&jME;b1`2u%^{S$pcbPT;3B%c#NG
z-_~I0R<57gj!Dbk;QHVX`F&mKI%tPJ0Ju$+5Hi+I*GsseUc&y3G_yWXX;m@=*l9-u
znuSJ42;2r6lhM#$Ym<TTeaXXXoPsj&)8$tp{n=6POg`*KdrFB#6#Y0p2hk&kktFGD
zWYE+&N)bde7zy*Rk;$=#ZNEKH1k$#H9iQRv6BVYb#PDjn%us~4k%vMcL4<iW$s;2M
zWZFi72N)GLvQ5YE$*0qLpiVt7v%Y#!EQl0v*vQ)88&zm!9g%svozfW`M2{&#xRv?R
z1KQk2!|4qoBkRH++BOkIK#{$gejk^=ErafpERJ^>gi_v?8SCGOOCd0(@h8g;<g>S~
zg*BkP<O>!hzZi%po$;gyf<O$z?a>%Qdue1H(b1JgO`PpJuo2?O-0I*YzU|k!E=^h4
zkn1aq^o*O=itS2H8kr3ywpiHJ4-$El{ZWDqTuSJJiP<00Za?=4eW<y5U)XF(8fmMX
zU2dZi9ErM^2A(Fn#QktS8rlZSqy~Kl2RqF@7wpvOa#GSLgX(tj!V$K*$hqYm1Y1Ho
zok^1R`X<YeA~=&sjlKDj1<nUv$JFX`j<{>$*OweH@j?p57(79sk*@HuDVoh%ZB6O3
z@W`iIZHP1L_Plh(#L^iYoO4v8>9r|Jat{U)^Z<uba_~&t#&O8khVNXQN_qS(k*3GY
zMGACYqS4(Y!`ztI-^nG^PGbQySQSVT5sn&6@KPM?^sY*n@Mjujbt))lu=PabO7z%p
zeqs{TV*4ZnH0jE)&|2|r)yWTyn=Qv_j}Lj|oFvTP48g@Lm2c0LceO0jZMiS!x~^|>
z;7(&-9(@z^YV(>Ca*Zp3TqE9xaRp3Y_=pw{xP4gk7?eRE)L;MZ4|N#fn_z}%pS)^E
z?dxo!fACZU)^tL>AeO-zo+<E-A77N&y(&+Zw+wYI(LYLyN|@qbrwWYKa33UOM3xBP
z>p5^$keCkU6K@rZtHIf8?(+Td-&5A_E5-AX%4hnwYWT%vnz6e4ofUMF<rtkjixyka
zDm=nGnGL(KR5l^ib$tX&3<z1)fpJ%9(ATa>5i$;{!bJ1lU{?Au=KoS2op{0Bsj9>;
znH4xDaIe#>+*gKex@Xd<S7WFw=*piRH*#_2bY2R(nUOLKEXA;#C9opgw{Hx#(A&1)
z21%~YP=jCL{L%i5;$=n5@=S(_Byb7jK!Vh1Moqs;6%2P$s6zEl+|#pS>El%0ZyM2#
zvP|AyR~M5Py;==OGJ0+u5tC#sf7H*1xm=mYsI>emQo_<5Tk9(0UesHHlMJAzi+_iy
z!k8{1w~#N$^zvaktMUnJ6$RD<JaJmdSqW&`S>gV)rhvx42O;AXIlTK+5I~vsOF)pi
z1_qos$5?a=+Y@F)!L{CYHyWPQW!Ml;SjB}LNEe}F$&*$A_@B0it$dg2uJqk4_@{_;
z55tH9ziHdUh%l{$_KO&t;W9?mx@2x0vnL1=@UY~FYl|!V?maXXHLXV#m>wFmHlz}1
zyw&`3)^^1D{-~_WIN%j+vQwjZW?`N{1x~w6JoTz|QJgW{Qo6aSdOY@&(KJ9{gd_~=
z@JlR$Cmm~Ts#Yms4CPaN@FH9b9}ZTk-PU4#n;S&s4guwQtzJvh^;YEuGTr?}^g_Q2
z=)6rMOIJ7J@Mfu}Cr-2l<295U3$CZXFrzxBGhQozntCMctK=6ZESkie?$v#k84`IA
zb<_dQ4$?tYKo(-So&_&%KI8)RY7B>H(G;TmoDh<>3VoYRH||d8FR0(6sB)sPR|Af?
z6Dd5_Vnu`){rvhq6pe3Bbt!Ma_mcW(GSbXp%roMppQiZedXaxYVwc|~OJtZhy|}vZ
z7s&*j-E$FGGkOqdlrw0Bx|%v}VgK2q?|d-6=b<rZ13s8O5ap#_>*X~`Kb97w-l?by
zpXAY+%d=?Jhtlh4wh0!pm*^l6*|7J~nmSLAD0y8|;6?6G?&KKd(7Yqalu-=WD-)>H
zOqVvM0LyXIkHa&y69o{-Echs1y#Ewm2J_aNgEl+u=I1vTs0KHEC@wq1bE;3mgLc!3
z`UsHiGNZrhk;i$(@Z7v|+n5Am-Z93e9OK=s{2Dm68?7*$zC7xORW}PxcmNuekD!FT
zOtZX}p`?~6M5xN^8DdvU6Op8fzQNHRyJ#z5Gs@y_EB(tn@Pj2#xjPjU)iA>d-SkvN
zjD@Eo&7HMYs%b4s#qDkpzR9D9Ad|(1j*U)Y2;h7n^^MqfkzXS)?Z%%>Z_^I8i!y#4
zB2ZEh66E?N8XCtv<s`>&j|~epzeyC9MGy1A{Ggg!G21`%1LPC<eDR-j`hVbH{+p!!
z*G5^krtQCNeB|#O{k=FQ#0!xG)M7vB$iET^C4%iQAb<M;s27^Gq}LUc?45hQ%{Y>1
zJkOe5>HtHjbCV9o=@?dPQ~~_WN@r3>JkxDj$xoGo)$3o85V`(7Lp)m$Q0&a(E$+47
z&p}DlDTAU)bxT`z)8}>_@3imVdH7z&E7;SXB;DHf!SQq0-uh2!8|STNbL^WabBY^X
zgbh0=WZGNmQ#r>77qS`Rwo6reb0}@t2&~`R9k#|DPoYOl$%^&gPA?0U?(ToK>oBGJ
z?0F6)z7C6^<*1D48eDiRGln8iU6ha}p2W;7AKl7g^LS3nO&(z^QtwU?l%M}9)Nn?@
zx36WwFOk&n$n^q7Sv73|mU^ft3u#EW(&)iDLs&C_?YXY%XMUVMGr|<6xQ7Hgb{13p
zCb&6T-4@CQ4WJ1);pJ}?cgO?FMo!y|VNs3e#8Qg=Kz=0nPzA;E%#th1XgZaI{9o^y
zqW<~T8~k@GHkQKf-)C5VWmh)xFSW6Qj{2H^c+!psiTUpo%y}9TM#_+Zl<!&2&;CNW
z-12Ayj>s_0e+z2sVuzU~jFp|=QYu7AqT&EVo5eL-ms&(BEZ+?(+s`W#klnp-{E2<A
zIYg!(PQRvmd~ZdTT?Xn)MH9K|9~BL3R3R|CLz_Ts<{(*~A=u=!d7Sp;rNdk+8ZQsE
z*+1l$@Ynm~ZMa#q!xa^{sg;zlQzUIS@s~pDQKqt%?ttxrFcf)n61<o*{s<<k$GvjJ
zm^`A}!fFW~b5OFm&}l~BpPXQInagUrg7HaEUd7IbFQ8*Qk38$)+t2WaCRN#NEV5i5
zDC7zBQv?I@<n~#V*}<a$(TUMoE!(NhwK6Zd68&UBSt^GFLc>{aop*c2Tv~)jj?nh4
zNAfqqOr(P!6nEkapo4Rz5#fB9esvc0n;*$1;n=@odEoudX*hT2wP9-f9gw!Tf@i&|
z1Hk+$=GQo9C;&~M#`4tg%5*BuCwHa2Hqj8*T|sQE2+@Ig$9&84qli`58H5I3-@rh|
z7CP{Gd#5ra*x7LhzbNQ%(xm}*#^tm%GAXxQ78fR9v+C!_L%5rBK)fBx>Vq}Q;&JVg
z4j5qb!=9FVQ@K0-pD+B|KCd4g@uRsrpVW1d-Zy+-@81LT`1Zpfp=ZG%MYr8@_hmI1
z6=G4atRBJ4@Opk#R{EK^)ppGy)_Cpb9I82{tO+<&c3#GUhHt3&&IoyRJ1FTc@x_+S
ztcYU;<!ng{o{7T>^{Hm(rAfO~13aWzfUGzHcyJFYz=etdKl~GKQaIpPp)SgZDgz}0
zC>XbFs$Wi?(Ee71_N&|bHQF&SY^kS<%ybIF#A&Y3`KBY4aZpVBc!=q!Z!_$M@~Cfp
z(Mk4c9Re;fU$7+TJYH@Vtt=uBOxT`$40Cj*EQNn+Sim_ahEYVA!+3VBUb5krn_wqE
zWop`hX}A(HOk*)hfR>=Z3WEiafN<|plQuHVTzN;ul?2kcQ26hfo`7^eu(44D`l&Y8
z!M-IhW@XC~v20$3ZyWBvXE$IJ<&(g<0SdmXEbLK9Q)l!9I6?SR9=%UOBsK%j8EE$t
z2dEXj6@C`tdGFO_1a3fexIAOuU9M%8Vd~_IjZ9Qc!I7h$JVNioWKoYyyK!L_CWZ{+
zhl1ikhG$4a%Vci4nKeeq%RplHk2xJisUA&Lw2@)>e%@MTj9oi<CQbgyERO6+OP}L%
zWBF%d$w(j1IW218Z{S#%BCKFvaPXSB=Zz3}n7+60E)Mk~;xM-bBPX*tfIDwA%uYmm
zb@}FiNe-mXL-gOTQS$`Ix@^7~(DYVT1P372q8MtVvcz8rbf3QRa!n*bm~`llcRFHu
z5RhziCcz?uZB#X8V0Zh`y{J*nofFf{f!j(~x9PjzN#JC`Id9F_*Y>_adSzh;Frqe<
zJvE(oGG<1NizYNK>Z?9Q#<cRLhaZaWg4EP3SWQ7R>&QnSx|Tq?b!<=j>+W!MVpp=~
z^*&^-CXtGbrNx?ts>C}A_s|^9mU{-jLkPLITFjA16Z?1ako|?FQ<Bk6PRxf{g>D*}
z!Ktm$Px2<5q1?ucAL5aX=_9OUWj&OFsi}~4!}0r!N)}zu9ulP-vxK$GrBP`Et%!qr
zJ8T809y!}6^z?>(r7fYt%s$?$np*w7!0@`R!>&bYUvk=-yS;Hwo2swrk0IdO0*cMM
zj_Pe`A@&azrte_`ipyhHD7qxCR%^EfHa7Ap>1Ve$HzJdup?JEsCUa_-s3Nv!A*jF;
z+MX;4!m062$Y*uhQYG@yYs8SQ=Uw`M8^RxSbo=7s*Ep58W*dEbSq`OQ4Wt))ud%Gk
zu10quT)uTLmg%tqU`}i7#wxcJcWRcwt*vwgeb%UJb!VQYQM$=h0&*0xO=vS&(R^{&
zyP2Go&eu>4<vZ-<?AGTWdWPSTD&R^>W}U{{O;-q}^iIVUznw*)PMCG(&(4fPq`|Kn
zL$RB-nHJ39-UUeiw2=;^il;ni9Nr)4hJa#XI0LpGRcTgVbXv<tNzmhYFdWXi*S~+@
zKJ|Ox>7IUB@MbsmQWAI<7G?42?wZ5$CcaLitf0Hb^Mj+zvpgmn>lFr(OD9LFrsz|P
z78p2J7OGsa@@V3!o3|@M3HM2vIxc(l^rF4`C;R|E4F992{9oW6CdU6TQ)6QM?=8Ki
z|FOWzf!uwf{-_8+RP%~lytZJ{!aNG{N0-ER0t{v?1=q+%G5*lS-0w@Ro<g%>ZNbg}
z64)q#Ch_U@eCXI6>+`@}Y%^V`K`5hR>Q469yyFYk*XR8R4#9;Iv4nZt9l`$lS?_{7
zr=E%WZEL{JZ*k!HTKYcDUX^=siz-=(?7UR9B1z8gdfDx?Vj544=PkgRic@8)o2+4n
zsYaJ|)lB}tEjg0Nv01ZkM&R)K!)5Si#jox9U3EN4<}}#6vKHaT%lU_au_nY!YYe*>
zr@U5lie40rbK)<NqW8vU%Gu@Fgtk$~H?(kURc}3IYP7Xn681`uh-9#^>qWxSRf{^i
zzJAxf9|2kpTl{w(@45W*qWqPu56<Sd7@OA1D+o#|U@7!yf*DUOM5evsjNP@d`j^WR
zaC~O@U=y$nkbG~AwO6y0vu&dMlf(IMl0-?-zuDY<-?VVYX~TD<C607~mgpLKK=M?5
z<MV*aqTw`++p*%`k~Z?}DpM3<=S`_naDmd@VA-y4<KC6jiILqK)2t(THNDNiDI^mB
zauZ5YRhTg;-FekWOS143a~Pvvf0^*#{LNo(5PBi4x!GIy#Ich(;WCwCdzdsHw8Q^N
zR1S{AYovXVz-8k6Ui57CN?>1v=4;D_^ZxF_2PS*kQ=z4eTqATr)D#)8ueKRs$lt;Q
zZcEF2Tku^kP`oQ!72Xl?jH!kU4r!Hdy5Q8wp%YHS4|!M|J0khS8t}}5Pxx*w3j$tX
z8if)p=HBnsfp}fWxDAi3_nos1*l}rUn;S#<Olx_vIKUCj&w&0nTB@~nG6nwiJ#7u^
zS*jS^eyNQm>?mzbnO~NOF^hS6g`xhSm0N{Z)`vQ`y`1z$a?&t4wy)X!K=2S4ZcBh#
zzdS)i$kbnc%>5aQbF-(5D8J(kObq-TtQ}S~7<j0Or`ja>c7097vXb>eL%Z2vmJo8Z
zNgN(Gym=Om6GEI8fqignjpGCn{D^8$HEtCE%FS-}VSLEv-eE}4LzO-%G$=(6%I0KK
z!3bIU>eyL7*`r|&0;2pAt=h4eP1}wT1;2>qnpo$+tKY{Y<Ms~Cuos$JoB>VPQK;~9
zSn;~92kQ7Z?)H*vz#Bk7@_>KShbr<LGS=U<Vh=h(|I93WSi#LhW5oBFQP$ynH<@hR
z#;=<>+uWJFAaDEJ^Q)N5Vcr*cS`TyP)$`jEZvEJRTuC4J_KG+(aPE#fy9B{>VQJv6
z@XhP04TDXysORX@h@hN%pZl}8(u3astUYMth&i94jqD6KvZ3CA(;6QsX$>$6ONN!#
zs=lB&V95iDIp|TzNd0iHI`JrvQPce(-I_oH21Q#oSLvLznSCu48d?o9al4JOjC3UB
zKA=sjUM$mL9#ksyzV^}x#v^bwHdSH#zEsc=S~Tb|e3s#R?pBOjsj<X_Tb)9_DG+A-
zP*azi3x;~JsIU?P?VE}P!?aE+GM|#wHuT@LPCGv4xqROb2Q!SONuj_4=C*@YX!+7=
zLU4|%HKXcD)V-pY4g!V{`fIDOEQtE@nSG-9X-*PqZ8KXKs<I+jLJZ~OP}rwQ`s=$%
z`rCop-;sK6tQoH?CL=U)caY`u;v6jSw#fa+gdpgboDr=%zDe8jfiGH^>MS^4zq-UC
z0KytMLso$?lxg>8UO9_Is<WoxR>L9jOrhg!^eLhtp0d0Qs&srJeId;^l~KP<XcVC)
ztZ!@MAHL&U#|9x;l#9|!axhN1z6x_5fWMDWD(D?QzFo4$C#b6YTYGv+=?hgU-mK!w
z@wEwAws!Q<g}b$2lcS3GtFc#bea}M(g$nvNvmU@0ZQNN90E1F8$yCk8Qm+i%Qm>qG
zYEvRt!nlbty~At1TLvR1-kg}RNaM^xu^#E7_T^hAT_mrVW)jcpWlJZ9(03oE(#k)i
z20C6$(NS$k5<ahIz>=kYSfIme50p!MuoS;M0UyzguzX~P2=;UF{IlD&h8C6xw`#d_
z8b#Z{c6%WC%==Ph_meR2vzib@w?jfKw#kSaks8|>UOLU30-3jK)?j@<I&h>+22(Oq
ze8ZN9f#;|u{guF_-L-#1jTX6780ElR7qo$XD@R%rr~|VRECS^q(+d(xp80G;us;#o
zMwJpi8U1EbV3CRNU0B)$959P{(Dz}hl<@v}{ms1e_CDUrf#F+rTg#51@?06h=Ruja
zM^%C_BQ9nSMs;A~z$0zB!*F19U{PJoRc7&pO(C~Y=WYY^y8t>y+-({Ub35;!8SF};
z9o8KF;Wj8g1xg58%h5G_H{7%g$!g%e(njoe6o8hN;YE;^g%e&OlGX0juf&xSAxK*?
ziVpXe>D*_cvm;Qs%g<olJKmgJ>zOh?ZG2)QO3%MKYoB%T0_)&NR1oh<+Y$S@`W3q|
z6w8?^@@S2nsm?y9S}Vo?&~o<crrZ}&{8Ni}=x{VZP40<mjXPY(eG1n8aPn3R!f$cn
z(?o$&&i%4N7~j_jWvFu+d;xuy4rt#P3E0DI$aDflhtI7!(b;>A506dLvzd#p>e5Ep
zzHs?OhMJf8=N@f>d~l6;xAP>O*EXbCgtwHPG>zfkGx#XHLU#8=bi^^A4%oDX>8Js-
z>zsrxK4E4GX`3<XHWtgbTn0u#nlWzS)PKh9c<)f(=WwK3arCTQ``pP!y-{=y=AnCa
za)cp-`TK|*p$&?B_%v`Q>M^=hH$_?i1%Xy8ydJB)s?WywjyLd9BK^jJE0etd$03j>
z7qQHgh1PL&!^%+VQ+nYCNO<QF^*`y5{}Yq@znYJj7+L;na@LgQmi<2+;y<ImCyu55
zAQHJavi}U2vTGj&zS?S9OTBs)tUn6|(6qfvWPCrd59FJSm0TUt4dH=^JUWO>+jHpS
z+-XAj`=o?xCW_I-B(6C*BWYRrvKRJ+>C?9!XagM>4SISy->tMrO?iwqFdQ^yK6#X9
zE?p|$KKORqy7KCaD58$yAHz_p-YWZAuXEMPGM@CIOpoP_UU19W_y_B#dRmWjzjtNR
zi~J*zWepUPx^Z8#z5XoAU9_jud;Eq*bKv{&d5DXu%oKDWMO9|<A{)>7K(y*aP#vUE
zNz6O1-H={jYklcfQ|UL-*l75w&{lxTq&FfALTJA_M<y^;oZYtm-76H_x(I4Qz<!)*
z8Xw?jzq#+`rc(W~+)7=s(V2HAlAA7`+e-c^5eTWQepIr91^~>$;4#*4{K{pQZOIQ&
zLOP@n9}l{ytfVd=kwPwC-q2$IYX#%2PKv_{P}9WJsm+chJ4ZDf?3a18I&ZS1-L-c)
zjeVy3Iag*1b3_&Y0<o7+&qE?NUD!%d?E<bQs1pTiC8-j4J;m)&-COpAySM($zO`Il
zXZIADFFUb&yscSFDQjJI9`IyXvrj<Z?pJe16y}&=(zR>S9d=svH#Y2TSu>o(Sd#=;
zX<X$zwrcLG$Exd-SY_`$#<@)1K1+xnG#$Tbb!^Umkv0(B#FztsqL%>?xBM-Foi+Kw
z7Jg6<2h9=fi!GAV2O+p*5xP6m=h0o=xh_pA4SvJg_>?cH`5QhoA+?fMkQYA8<icTD
zO$43MVI`vawRkVE+y+tXBP0Tnn*0K_9y-NSaW;G~^1xs#S^9#r+qYM{*Z#wGd7IfJ
zLc$HbF<vMyJ>`$B%55_sD1Yx&L=b2mbyiX^LRkTs!!1&RW89kkUnzs}LTpe{uovh~
z^y^}Q0LTFos9p387SDUl9Y-9AWqf)dj>0*g7YI_?(&$3PlcGG#!5^&&f^b-z609q*
zhGZ{MFqhKtU-koeaPrb!O^{~(L@D1-n=H3vYl%=;BO+XCA$O6Pg1@EYp)(tz5rz-l
zfUS#Xqh|!kTwMMJoN9a?VImNEWU+0{xqTZz2oFK#cQ_TVl#pCPK2vHkY1COt8Z2_~
zVP8S{@hcNTaR(1bJDXR(R`?j0CxRV5(@e+>&w+iC@nXpnGzQDuc0pM_h^^#pQeB{g
z+k^h1M`-x@s=D}=fT@7WEq?;tDX^+aARZ|_1o{%4zt-cX`uD7+D`KR!Q=Yqd=Cl7u
zC@Cit1aidjG8oSQj{k6n&i+$IK>`*@kL!`@D92ByfsTWkAbRFkl_LhPUJn#Og^oFx
zSYqdBsBT(Qaos!{!@tpv$|=<pzL!loqYA)x>DE#)y<5b9RrB&S4_K<nd1Z*S4O&(3
z%6Gwz?o%jHc%+Pk#_-63Da~A>E76K+N84E&7*7ALqpad8SYUu3iURt;y-Ef;(VrSd
zGySmmBakadMLT~8ri8|eVTG?IhjT-M8O<oo*l%+;yar$Ek_-jE3lR4Rh(AF4MM!=P
zP#1YIIh45njupUOC*MZejFqF6z*!8`mZA1V_Ae^Ls5}i8#8E{O*ic52U@L<<Qxj!K
z%K+;o_=9-?S?_tRaO?1%zeQtQi;wm6F1Wu-a68(?o}Uny$HHGq2>JR&f1^L5USUTO
zs$)UzdTmv^tojyL(&f%0)*)0h^ggaiji9DKePE?Cx7FHrMP*Gu{k2&LY0~3QZ?a<}
zsHq+nC`MxO&LrsnrWZ)(@co;ZWz&sB2Xu}qS5NwKr#oo1`yFoHmrW(WpHn+aClz${
z5lUn8=dWOd0uvHBWZKTp<4L<TAIY*0fIJ^Lthf^H>-9M@<?XxWC+u{$gI#p3Rrsz)
zduR<2rSD5EIE>0mdeaHLktTo&Aq3@hoyI7AJY4?$Fp4C~@Gs_F%-?bXPdOAsgaZ-}
zZuvfF0o98df)ZS4(t$h51(;?ylQ)+Iv})}%yFd<_N~iky>Keuc_G-=k<D5$)_dXr6
z!a=-(=y`+sTGgyz>9QB5QjPH$d=0O|-gzi&hzKD8jmQHz?!#B>{Us9p6_@y^Y#sN|
zdud^3PTu8smU`@HoNGMLUhuFeNv3jsGA^g*h2*1Mz3R2r3cD@+feml_9}S2aB_`qg
z;IDw{i<`CW!vtu3X!J^6Y#e>o7S|=Us|B?W`wRoiy=y#81nq)>uidS9aZ2fA4w{DC
z6_x7^q#E(L=<wCr*6lU-9k_TaCHI$#zp3`vNM6~oHRg1;3cj|Lr5MR!Ga*E6K}2ux
z(8ym3`!4Pw0yPzQ+a!S@fuQo1;fEzR{EA(IA_r=Pavf-vr+|ZV&$EZ^ppD|cUk>L4
z!W0f4S_|Ga&*x50HCku<TZrEqG$$Ez2Y8=v*g|n+aza8uL3pyT>c2&tC7Dzd5?*xa
z=#p`+O!WuKfXL%_o*q_cWet1=PPpiQ%MOTNCVByhGMO<=b?#93x#XhZOn{B7WhO`r
zo-Om8AT!<SnP`9<z7wx1uH+Hr%uTrCAKi9!Wx5%su7S^fUa!U4j)!$JRQlWLvOKj7
zj`O4?cl*5KPLR&{Jmp=uD)PcR7d|nf$&tG&$dvaSPduw`_8UuR$ob;15W9<+6oOy$
zF#BQg;q@a8{rVFz7#Et$7uJXtFKB^odUiR-WSciU4APP2+xg1wtAUfsEZMI_5u!Tm
zktlbL74Wsfk+S$3{tsAGI*ZHD<czBN>Tz#t4=BGCoE%ldF7S`#h~QQLg~qY$4md%-
z-?r-%h{wY=oso?RkeF15)4M4oIea%ANSv(iTD+}pSiu?i=Y0Ba{vuA>Z^&_#9=rb_
zSeX6;>XVI$^M7WM3I6{92{9@Yv6&30TPM^SzbQQ!ni(hUN~|i>tT0rI=(uz_`XtMM
z#6$lw`|n&pLX|w`OAN*xc+YUYtdmIXi4!G=7UZ?&5pgwVE>>qaA42Bt*h=)00?C+-
zj(i>4jd+SE>6DO0JePWw`J(xX+SA>0QJ|0~DGgp91T)6sP3Gf8v$&$5JQ}@VS`~3p
zBX~>wT5&4tXw20=Afb-0>A?JkKyW|Mw(fy!sg}VfFOp!6l|c93@L%oRk{|ROW;B1~
zSB*X0DT0oda)j0rFV~D!p6*l$<uqe^*orNJAwlCP<pgtYjdN=CSY^T^Z3Som7YnM%
z&AGec@OYd#C#I$)D+<}13K;nRg2-`Mu&|zzuLD~$XlO~yubf+!1$KjLI{zwQ+0&`a
zPF96OGpJ}sh<NbaM|Da`GYOfYMEFu3Uod}-XU)NRjY-6V@3ONCk{xDxBtFI&J1${h
z2^pRJSkP)O800*KMao%G0w8&^5m{A6D3bUlj=XnT=cP8gjVtm#`svmv-z_kPDh^D!
zR6vU_6GJ}d{w+o)CG`-_3(KnsMwuBq)mE3?x-5{_t)7(3R8#ek_1WLle%)Hme$uw{
zjUPDuxM=@-?}_%(^4|JwC^H$nv1Y)1MmpOh-L|mXJdDz1Ga%t^NT6>F@Y)KszCfoD
zEPSWdpn$fcjQfbK9uTl}QqQP<N-xy=DW^0Kjcd|GnUvBoTcFMC-zb1WstE)%9Vo6%
zIEPFyw<>}Y8;pYs>(f=hyt1+dE9#&tFMR)j(`TV4!T)L*qK5XkfSTvqsY({Xy9J3+
z=epxfWBjl|la@ELHPau~SN-<D{ZD`Kf53eFi`4)3{5p;QF)4)o_Uj=!B`-~5y_ljO
z>i(<E?IO^T&uxIej<-7~w?ADEx?y?!{UxE;aFErY9kmCDqE#jl<@J$>peK4gh!UYm
zRB2Eli+cJdV=CNo6GXuG>)KPJ1M9n$xnH`PinIT#cN=c1IE>Mf>8#o^v~PU-K*tYj
z+5%gg6yR46n>_z-y<l~2v|Bfn2rd#?j~ML?FmZIUv16yV6D!s<D?|N;&+9TDw<*&*
z75u9v*;#pzrk~wKnO+!I`b483+E^*ico%+3O{PL)_tFAsJi2&&+7!n;YS*?gi3gJ_
zYdmPb6|bT>|LuXG&nJhGj!Eej`LGEp<K84>!P&4}qskx>X-gZDm8*>W=lI=qvLU#G
zQ&s+bf=qwOG=QFmLsbk37J<8zm~SP)vV>^Qg@^mOc#H9NH+{uom?)?9m*`S*-FL0@
z>Q>?#EJZlb3#NwZMg>+USz>tk$VJ6-Si93j#qZxN0U&5~%JpW9kRt!qGPfF#++cyQ
zM*8$o;lMjuw4LT*=?hm8Ug-jr)!|edoACRDe*ILq>K#a+CcT8!TpH3@0MXhSFUg#@
zCzA9@Cx8tg*`^ba1~e*epIihS3a-`Td1c&F&d-%htmJE|nxqa`@<RQ^BjEry%w~VA
zWBM*s#09r@soKJyJy+P57Q|<>72o&NT@d!pi_qo!t835C#x|HsRHLoo4(ip+BC=0Q
zM-2z@yOMhJqqDiuozstqV|Em6bBqJH)4FA>w&E)Dch%c25LBe<B?;u>mqVIb^u!2Z
zU_k$6m}g@v+7Ve8BDRlFpt)3lz+~&+@;5gE1-$m>c>9O^!6OONEOz{NANyRn)+kO*
z7SOl!D)L%R8kOP$p^yB^$>EE|L$;ojja|Q_HqCJT;&{(0%Ah7^BVR!&fY5YOFvzI9
zc_O+sC*m{fo#tWSkk{kGa*r*@pUJUJT}5WgbYL5-VWCW#z8xI@{k+;|)$9#>VQYWJ
z%hx3k_(ET%w1&XA$6+$ZPCRKKEf(bEhZDV0PUSx<X@>D7ju7bA|6*?hFavgjCzC=T
zu%%+56PCu;7Nu%@)``ps(SQ;gCd!3xTZ)1g%>bofEan6D(TtX<+q;>tuZn6-?>r9!
z*N;M8-)A}&;O-Ttzg_ip3C#HxTG8U-5NO7W0GB;QLW2mD3-7{srm+P@S@VSnB{GND
z{2JRe%_8~GMbX;@$tjFn`b5!0{VIzZkw%hOa@>3gC7^)WZzv{S+niPxJ3CGzC+MX}
z)Sttp3`Rn+c(KXMDJGQNve#)Fh=U}BUt}swq^PkikA0-5@P<N)hL+{SdPIq!SR`B@
z>TD94L{G$3Iwlr_E>u0Nf@5R0sW&fecWGtdkhqj;h&Um*pzzPMzjP;zYDoSN#|t@<
z`}p-HHkN-lLgeS=I3}@LKvVMZ7`(At)a;eFCT=M;qH+yAJi;$6<lhpDQdqQiV~|6g
zwr{P6LP}hAH^qE`UuF0-ovk6L+78*m<Pm}iT+K$!*V&2+K1)dxsDKqQg6vJ}>#<~x
z?@#7ZCjjm<1x0g`KkT7G_o0evRpWU1+%QrF1p;88<s&-0_$QT0$jmyYcY9RyYZ*Ky
zcMqM^{tfFcI$O4DD25nUU%A>g5Fdf8f#OJFPI%`@K~w*6rqb3KeA(eljYEy%v|3o)
zkkoO`$M;rQdGC&Q$$I!|E-K3E-bnL(^#p6yBIh{YmlgFggC`w%5!9ltDBj0$wQy2R
z>Tdlg9{Rl++v>PnM$ER87BZG+Y0*(RFC^E#W(=9L8F3}*#Jg<z8Ffp^a8T-~zkG0W
z)%(e{?24CET1)I!n&(ZRf^_QV-AdbLC~#(&Imv9UZpaT^?yuqy|Ga)@=_GN#@2N5F
z2=bz0sjQ<m=#bD%4TE;%fqqmPt0Ei^LVf;lABxii(HEcf8yduvzUgk;=<bBH=bHn)
zToU5#r<kpkB{?P@%*h~r$Z)bjB+c=KNHKFJzq4kY0%=(fc9OFhQfZ(YgT}2dflJ%3
z*Wa!VPy~p8Z?x+o`GT_YUn&kS->*L@XCEDPQs4mCW0$Vl#C4y+%`CX~TmiWtfVcjZ
zhwEozR~_C1ww=3YokLx19#RnA>tt>0-4>e2tx!p!KFH{VF$Jk&Fo&g=k@}4s{GPnY
zi?=5@0s80z3J?99+kJ8vwvl0-ugAy8F@=We7vx}JA!*(~&@OXu@V-A@_vN7xjS{8I
zrXS6>R0}6t^<A7m`YTuUbf=E(+yIO)a1WfxDGieeNlE(VjE<SI2s#u86LWr6+m;z?
zDpm(5gK{aeXwGEi6|M!v<xOo&>mj75e&SC}Hjb-tGaA(c(<Nh47ku!Ny~&JePxaL<
zAIZkwjm4p}m)Ro=I@ZqC1=Or!X!b3`W&6k{SjQW4Buu)ITV*dJUlot{eT(^A<L1{y
zPx!&RR#N}r8vf^V{eOGE843QiKym!<N+>1*P6qaWT~Ytj8T%LS`QM-aDy05Z2LHdR
z^S{uX&EN`IYv{B%o4g#s!-3KV*LYCZ>nw0A^R2@1d4ho*+>#Cmh%~Lz4lu}@LBbv;
zX4jLOA3v%$s_MSJ%g?^k>!t9#O&MgFMIk|)BGbUf;}9k%s2~!R62P3mSy`KxSy?)#
zkB?dk>fEFHMlN2s;f*khz+{i~pqA!Pqfe4#piaIG%8mfwq|Hkp0Xv|0d8kqP!LeVv
z`-iBXarr@whyoCY@J&Evb)ZQ&28b9gUY3yJ^yX#BO&7`;KQzG624p}A3h}v52=0I)
z-a#yAh&~`H0(I-~FJ&=?QTV(wpim*5u5W6v!tkcb%0fiQu&^*l?$Pa#t-dv>=m@l3
zVAm!H3jrO1>1#xo-kVV1TEXXder{v&Qb-F;VcqW}Yc7p;FF+O{fII*f6*i!a$FsGM
zhF}`-&%uxtH3d`<gFTnl-{(S90eYSx{=tR5aj)rbb^`M1__G8J>Vmq6p^m{rG=XXI
z-4Fp4Sxg<3rPS0wV2!V~Pz}zG9`}%KL3wTj59C4oRFJ@jBul_~r4T<>GvJr7t}d>I
z?g8sxb_oaWY5z>s5KRg0)eT{T8oJY-i$4Ke!oBhv*F$$FW9$7mJO+IJz|s_x{rB!D
z=ytI<>kMUoutgM)>Hm-;z4J3shf@Pm|NQxrivR`S04B&Wu#Vl?YwE-y^r!ei<agaY
zIXK;gs`Ie|*@tWj=K0G1Xa#H%0;!v`hv&}pp#8+m1_%JaQ7@qx!ZZX8Pk%)Gk%eh~
z2Ia$UV4uJ+o%kFPpmsmMKD<poMd)E5)3R6ikNvag!#W!RQmP;(a&dpE|0Fuyg1y$=
zIRdY?dT;^@OqV`>%ER>hz!yRUeya}m_@Ei4zytO1SNg7({HR=hV*q3R{Dvp%^&j!N
zx*gPl0^H#zVmsbD1?KYg{+L(%?A`y2-0moT+mrn41Ric)UVbYuf9L=FlnFj7aM$+0
z=15!|zq0^Q!OI&1edsIej^+we9~qe6^>B%*&n{p}^jBSeZ;O;g;VhyU<wLlFYyXTT
z^B=AEm`}n(2bFQQ3i#_&0kIK~pZuKWK)~31xHz`*Al)ON9a`Fba~IRVUK-qa_qKYx
z0TGy+$78%NAn_CG0T6C2k!cBX{1q^J`{11&e4T)KSWh79TpYxHd~-fGf#8RB3iuNU
z0K!l9B%=tsKwm*%Ksd+#g*#178lNyAz&P>#eWi73KY^V<@TWby$`l>{&Q;Gpz2xUk
zz2D%uMBJY+PQV;EKcPJG&9U+;7?bcuXYX;Suc?pn=U)dCpt}y=7(Nx_NBZ#yy?6Ep
zr9@jl0Xp)GUEhG8rXK_LlTw}<|H+Ysy-&y=#|=S(97Klq&uCB$j@1&f)~9x<#LXaE
zYZaGBKWX;lh$-{!wy7(0Y|@BwCT5GJHzg*^JQ#ON;gmZeqk!{1^PV<%(o5$+uZirN
zF3YUpK{c57O%BByjeiv?wg{xZ!820^5q2QS^|J-EgUwpqNZ)nH*@11Ed;+cGYVUKJ
zc=6H0gw2~5{Z;O}`dfb(#?Y&AO;I(NWOL1Po??O_){<k8ld*mVQOw`>ouK*6FB7CF
zW5Ks>2r@cGM+{=9kB>87?#XHCQsI@jlt7WCf?+=QB2xL3xW}Xh8~KWd6e|lF*FKSM
zJ}?4%hW)*Zg{2<EVg@-|qh(o$1=_L!HN+#JS$j66pm^SJ9%BNkQRgT^`c(Gm3WD4U
zRvDtePd%P_#f#A^L5&8M7d~^24n<qj{Q=Iz<eW90v1_-;?3U{S)OpG!7Lp{~8~1MM
zmvXy?c(H;Wn2!Cb6k!6Y!^6=PEeSBL)m7*9YcjKq9`6~3t?%EqB@G*MeAnc3JF_w}
z@syj*Tjnt3W_A!#gS5dngl2=f;y1ABQF>Xwd-gEWvjHJ&d%w16GLz0&a7jVm{!&#G
za7JF<-oPziHGK^D!TVV{k$Xmcp>RFVHK#kwDk}@)*s_AIq{l$QJn%6{xz>B^%RZK5
z)&zar8^Ro-SBere8H|0OX84+U4d_)aj+#7|+LyS#O5e9Ih3qIEs?{Bk>XBciVr@By
zvsFdB5|+3utPa=d^LLP%$E;4^X*Q<8`79zl7M8qiH{H)gAch$tBkPd?<vL#;FGT@U
z&J;EsFW|)^5Oa57t0dC;c9`~Rm6w_^C}Yo*0#Z+=HA}n_0~>{F;V9QkakPhZ^3r%U
zD}zZy`t)Mx8w}=jyf^y77g)HTBechEbpLvSVTz~K$}x^G4pqMHzV7oNxxpDhT*avr
zkOLRTyr<!TuFN0+G9la<SVIwX@Lo#FMosKP0*Fl-wWa=!QqiLuJ3TWi>?hp&U01TP
z7yL}p3rKV33@`1ecP~HNA~ldrhX2}<up0e!m2(&C<YeLp0p<Gp50hhclxz~ABGr8l
zpK(1^({k;5KDTah8DbXk*b|x2OY!?6LOc+%OjhIHCe#BMA~=lc`ZhA(rD)Wda;<Gy
zT{C{YqAeyW8QrjNYyI6c#>}nyNuN>+jb**SpK@}do$fG3ppRmqv9<~+`X2tM4Wyse
zBHo#YdXX90DyHHF@Rm6J4~#FHOIBIZ;N3wG@!uB2^GSHdrv6T-^Czt_Gc2nm!A<g8
z$vM<mO9bZb%suiG_QY}f;@&VUZoK*8yAqUHZ7KPur7`Wwm8VKmCvU2Q+0U#CvOpLk
zq(|cEKXiEHo$h1;H)In2*{`t#M*KWHyNy=~Hrj@{&H?FjOPd$J+%YO}-@fdPMCQt6
z6qQ|48a%blziredyNR`ea)0f(k^#NE?(UBm6bX%&!T()pVg7UdH{5einVxQmqL6bn
z9!kD^zdq_^K1AsxUJSlknjr)3by!j;XRWbDMkCYgRWC>RS7`U3A5;*z_X_3ot@28P
zntQoXB4QuyzOT+ddYkND*R@j!OB(O`nLt*yk*W1Fc<n-~v>EkP4N9M#n(Dhk7M~Q-
z*Lb6aH5%F{p!C%W%+<Jc%SyV1>~`Z+LPzk42JwEVXCgeeT|5#CU<u{-Wa=i8Ya-i&
zi@m|{Kif~QaHbtkocJSIW0FNBc~$4#-1V;7F9{e`0yfe3=8<s($y#z~7m1+n%Xvnu
zUI}hKF$&HsrtyND#}4KF73?JA2ul5~m@F5o+Gsy{I`0}Yk11m(n9pY>*1eL4rL4eE
z^e`(Tdb?L_8RnuPbUE;AQ-SAFfo~uRLT3_K%DlXHsHyV9rC_pl&ZQMzyWC$f3m~tH
z^U(Kwh>}?}4WVayn%T;CMm)fliXvTX{2=;}y25d_h!*>cWJsGL@B0c;lgD=VN&IN#
z6Z4QzQfS5eUxqA=t;dzsYws7xl!3W73|wJvpppeoYSi-adz{Te<1Sc%SlPpF2^i+#
zTp_+^HDdn{W9JYgO3<azwr%6JZQHhOzqW1Lwr$(CZQJgi_b+B5CT26W%8IC{++^h9
z-gCbrayY3FPm^1f4}f%HG?_sZCVr}@)tviY$%qb55>%1|X)Hk8vOYW__*rQ@BIo>$
z!@7l`hK}@_z$_I@i>+=jzVZU^DYF{GZOYJ98`ly5ZXV*)n02X2RLblu!rmX^m*5t!
zDZBF&wBw~1QAX7{N_s<!6rEC?nPuN1>jjWIT{IoxG9F9#mpw2({Ti@|oZ>w9-f5~4
z`f{-8&qx~*SjX3ykBuy+i_&4$$KbN<=Bk`%*=dRN!zm^6O3~%}kh-tWsHw}#@%C{q
zO?{`Km`IxO424QuSfvzWsb>>O?L7qxY+IV>aQ2Dw>(RkyyY;Ys&)zO-#s`b)WrByW
zJw-Xhpq8Wtq%AWXIIkB@-(OS<aHt!u3ig~Z3+*xVe)Ls^H2iH8S1mB9q+VZc>2C4J
ztdH?~sPpSnR^zF;+VT$rrk@Jjd!WHlVYrjpaP79Dj$*9qONg&v{Q)ow+teGw@V?TJ
ztW11Lo{RHqS2)^7_mLg9IF}Og1fv_>0rTtOj*F#)X(R=_G3GEqRGQ@H0y<c}S7&B@
z!^)~ZCB)5jA~8)lDJYW!73=9|b@%VC%~#C(3He~7EOMA0+^%2o+F9%Qp$;)O<CB2s
zA^L(e%U*=a$v@u;hC=TFmdVDmbm;R5Ud(oD_8Mln>bw4Ro!BVW#x_%v*Z{&QrRDNt
zFFY?WYoQT_!4N*;(0WAAt*|{tuf~z56HJ+BR^sodn;!lLA}RtgqDR*(V+hjEFI8kW
z`m^2XSBoweHigpu%B|b4)K6}CjYcii_g>tJ&qNnf9i*-)_cGh$Y|hU=+zsgladeZ`
zbJ&<rG}kNOhhfm!U6n`2;8bN%YgmleQ3jOb6J)7ZOHM7|z3+90bQk4gE9#<`Ixg*T
z`m+`BQCv<moa49tX0_-boN>#+ht!@`a6TCyNu6Jm0Cjm6&uyxqqH#@!nnJY?a?3!}
zX1IbS|B|X}iR}oFMBxY=+sa7WPd8I$?``N~Ts<K_bTF3p5Lj!o?1Fl@E2*d?#S9jw
z;8+!$IUkh8HFxvd>oubUxJeVn<gE1MVNX!zate_ap7GApDCj85&7|5^6Za#5yM(da
z#s0AWSTrDL^Nzg~-&XiKA&9G%A;uWb9IspBBJz+y)jHo{u}S#4E0Z2x-=^+;zg=<1
z`@^p*lI4y^0u#T#y3gnv-F{%&Nc=0Q9;FWsW_f%_KzZ(NucC)%h2TAulJ7F{@frfl
z9E}-rmT3UB@{F{HBUw01&%;!(<0k3!*s_sJCxs4k8PAT+ux?VcjE<Yp?I_1DY|x{i
zTUI(Fqv<}oXJ`W!R~uY4sd;VS#e8};m^Pr4=;}QIM91$@Wk&2I)JCL<0PFf`Lz%<j
zWKqRR2yP50UVV}a(9laAw1k!QVfykj?hGFIRbO%_#YLkF&ar>^ziShvd^aLnzQ+o$
zrhQIEj2Plk2w)mRKiuaef>PRxIOh;cm3R>`w$G*VudUsm%G_heuK>M;>{R|Zi;8YA
z-<;9K3Yt6w2Z4|45aJdUM8sARyBd2Ma4s<+nmr6m(E)91{UsSYL`<)zbn%!U8Ghmh
z`QS~3IQe&?1IqTY!^`!wM1KuA;!mVLqM%ee0tkb7#Y%tLH0y4$!$Y14D(f?quh0WI
z@pb&{80CJp?z^MF2Yb3I-%L-)Le)gU8N@~ex9*=<1lOA|2!#XOTu89+smZOJhSBCp
zo7!P_z7!WXWzf-er6vmb_Et(iRn}$%j)RdyG-z!+*Cl0lQ4uk^n;n|j^t?AIef>1k
zK4B*KqcHj#s(f_6pkRUDQj-1T?W<3T*tE*;*C|64vFcb>Z?xhxy6e(STD<0$l8Bg0
z2^G(o$W1P!43Sj&(ay->R6F{UQy?@X!h4lEuxPtXg!!eqxi+Ze4de#yWsX0mb98-b
z;dHymMfNF{^VCH_yWAo~jjP*egR~ZCXn6Yt`W3N3wwQ5bnbk(_%vwRrFtzJz^>FS!
zM#40vW5L{sGs<yvNh~-l553sf_3G-3)_?~vAuWV`vTR&F-R+v}rGp6F2~vXoO73~h
zv|c12DH3n#Va#4$797_x1{wCMZ!e|7x}=PkTIK>y6u>ed->hy0)DrR1fl(enQ;Xv%
z70iz;w9GOu;3q2RM((`sPCWTagD`jwS*7w2hn`^?#=o<%*aRnZ^eDgfgPX?|Tjk;C
zkowv}eG%5Gv`1LHuwGrqvJP8}f)mR`R#k}QmicsAQ5R8)4ft6f(rXOVev=6N>2&Jc
zJT3)}AsjAr5?k0Dr?3+nF)SfR55G4taX6h#+1=SfWsUwDx%cW9e^^5AG|P;hJ3L0J
zQa8TXaXVzUpdm>p&kNLUlSP^(;mi7@+ezTH^`Xlq+7irOud!=`(lMhV7Kss+qwu+L
z>}UxX4y#S1bphZP31Velu_O^Kz6sf^5hoFac7eY3U74&GJG|Q|-T+<qH><ArTf)j^
zp>WHGN7j~^(U51c0^r;q%FlpN7N7SE$dP@&#MdbRU|seAbb0P_xns(WGs^_znfP0D
z3$9%y2D3^JNg7^4JfC*yk&v7W%Mg<G+}~u=DN9LRoRGptsi~0pFA_uTI@;If>A0>}
zFXPfs6II8T`dos6YvI(>iWZ|2oxo5jhBw{g(?!DN0gy8L5lb1xRB+ZaZALW>!2$L8
z4J_lo@~`?~i&*EVf8Ip=zNiqV5DTm;<zjo!8h7Xt5wJ5o&Z|QM^~jgurHoy*-(7`<
zcWt_Q&TebKeM-R&x-s6DmYVE(Rq}_J%nT%rcNK;fx=D}O?Ww3lxc8fDhk3KZfwi@w
z!yitZ7vEqcF|hG3<BOY{F6Bn9BrO4Zo}pZ8Ij2T+@@hB&vF6PZ%fr||v}jYy5c~+W
zbQTZ%a!CC+9=h0^!>b%`-gm3>ci<5qaltKP)vt;zXaS~`VzIB!(c5p?wMVU~mTup0
zOf4i92brSrhhx*%X|Ih-#Skm*dZ`?-5V6cxxJwkh%M6_+mH~~?rl7{Rjzs0qF~Gug
zC8_)$3fqjVd^^5M<~?iTf5`)~XIf}*!1R<NS!kboLrkYaaYitB8aT}cQs-w`MgnLy
zjRBL7IERs6LgtMz&)q{42X_@W5{HZVlc2Z~oz=FW$+lMNFF^K>Uyb+e5<eI_Lu5Xr
zZjNTAJI^ybD5o2!WF++dT$gZwoH`eXI{x7f&ynH^xuiJ93#AIYzb$DQOe(h78LGoo
zaP;XK$`C+@Em7!b`zyk$GY_AN=jVtaY)u>2vx-RGp?c*jf=<GXi)LUcYQ*z=cyP8o
z$W%a=d|7|gv1a1{mXGiD4H3H^3qrP&Y~WrYjQ~HYFwq+GmZtPO<xHa2VRO1g7ebti
zNP%r)tXzu-vsGu%OMPv&{bR3;8ls@Yont@4HucrKvWAM7kAa+45uwJ?{YlGcaXvCq
zI+%JPiQCzRNb~!G<a;zRSMIoYz6S$@PDjS$%cuBlm&ci}=6{A4oN~VDE(MAT?;Bm#
zFPoJP`x54oL`bui_=lDyZF8iq8v#CXM70#bmWx0Hdm+rI7rl`lwq+z<&C%?9LVG=H
zVTWDIuP0S)o+-W#Z<zdYA!^MfE(W49TAu&4dipO@p|sgbJUfy&b=<Ot+yi4|zn$jR
zG_bFhjVB$b+GmbGeX?=9j%<wm;1_u=wUSUZw~FokJH??!X<kI%FbM9w;{;WZU@4uy
z_FOy`!@Vo2Kw2D9$|+ZhAu?+w4KIa6L+g%VFbH3f3_Wi;5-wULmKO_33d}F}MGnDp
zx9$KxbCteXgl}o<aPwgeki=WfuB5EFyco#fJ-VxPQaNJEVdYx;R$t^7I#Dk@F#YI?
zkq}=zPuMZU{cFz>;l7*RL_?AR{#y@Af1rQC&nXG3V-8AWf~Y^*ESnA_AdaZpr>Ejn
zR!Jk~Q{8rY4cC}x;nj~p)^6Q=)vSU&nw5j4jZfs8qE9RT^HZQ#^56-V1N3};gx+Qi
zi9R@ANvLS<nP)Z^d>L5yP3g3>X?xcd?)|?uP^FUqV6wFI*}IrahGqHY`y?=Uau#aO
zEp=lGz}moHZK>StzT=-L6Jy+3EQXD_SB4E6RiYDmd>zch4bs~2PXy}Om62QF?4S?-
z)#YgB5@!jkdtOB<m{L}f%8#!T)#2kOjIVsvO}lcHT7>;JN=uzx;jOG=WUmPiv;wwa
z=}v%(-!riWtW9k96h{hx5k~)zdZ^Fg3UKcbb;T_4>)A^djV`tzf(17J_Zhmb)TH1&
zaK8MTx8+;C8sUCoQCBQTp!k8H?L!%9h1W&K<g=dKTl`s51i5(ED!DpJEA}3-wZev#
z+HOL4Hs@daBt{iUJFpdi9hfl9x>jvXJR24s+hi05nDxBBGdB~NkR<+>RI_BiB1e=O
zz@GgL#-AiQoQe%Tg-7Wmy+#CXFkI)rC0?cXg6cu?t#omYOn1a@D;F%v+ro%U^y}SL
zk24FR2|cqDzI+jp6q}OWK%NgyV<&aM*kqh1b*-_j=H&8O4(#PJWPXpKb5}@ntAI;c
zv};yr^mr(;S)mC;h?#JyzLH?BQns@dp2_&{7|h-E9Fl>9enV>1Bu3eK#zlwT#gI2v
z>k3~{#C)h1vr0jf>H$&sBm8Fe3rysE0OO%m<0$HI8HJ>&iFhRIAmnKJ4a8dqqzlPH
zwVnB2=^-!K-4c<)nE`KE^Vry@#OU{AIvW-jY|EjPm??*;_Il<eECP*^OD>f5(No)y
zQSbf!GG9Ko0GCoU2EDu}zRw^s^s9DWdJOm>ZX%c5tCfE><{OrW>1GJ0i(v4;=oRPY
z*SD`%sIyXOXwYnAyx_1LU^d$57xk5rYDb|HNNs~l#Z=R>|2lbWmD}?M^5)Xko6r~i
zg*kVbHltU=jnjyM90MJ&>4fpl+!mMlutG6jZ<y<_M7(8>BC*B>@zSWPoU)iyV9MAm
z$ChU-GgqD6HCPlWv5PI1cHp7&YrHT82fsr?3O*xf<k+vee6~q43x^99D<e7R3hyk-
zWfm-(Wy3hVNkyC{@y?0W@pv)%XTW;kN{PAp^I4zUF83`s26TMXIQ5b_ZZeRCO=Jnw
z=y7o9b+`6LtcT(cP;BR!W~<?JTPmP!&{S3PxH)n#qaDFh!$eHB**a*Hn8tv-Q-Bxm
zm2IZ59~~t8<(T^*YKWSKpuA!=7}^^of-;#&F-LadWn6F**)WiiT(t%(7sHYIN!tJ@
zClT^opP_dnKKw{hdguv>SGP07dTcJ>_Ax-n^0D`*ZlZEzR3T5J8t9?{%MOixjd&}g
z&D66vLNx2;os(@JOR<4152@0BHzx9<cG+RRL<ggfM^5*Fby#4}=6QEae4^M2<O`~Q
zVk6ay{4bh>{>8F@(I`uXNPi?dwupdVd&h{J^Wb8Hbsqr!O7S#P(==;*nlg`(Zz+_!
zPyOvH#S+7i3=15-D0I;;)l0TPUBUlM8*zip1DEg)?jPTPgx@0z_(PWSIKa`^&R#Ej
zMv~c9m9V^U1a9jQa*^Y1yKv4BL3c<+LgUx!ranZyQqY`Kk*ndJg9mR(lycX*_C@%L
z`39wU{0D6-tU5Cz(n}%kcrZ<H*`5VI68>SAQB_f`mh*+m66&2!ZC1x&-2{9LMP!L^
zYj8if+ud0a9Zsn=8If{iAOe5rV{2~<9b`;m!B|$tD14yF1+ZI&LvqnGMX&@NZ6>4m
zctOWI$m%BsKYO&j*^zHxD|)lT8-A85wXhI&1-+2_xG4sU>*UdoeDWpMP9okrL`l{x
zQvphrub{e93hWJl$Viy=^wk9<abVHr_9e!~PDjs@joYQP@6$IN?E{KBDhFxPK?0~M
z-L?xdZEt7lU{=j)M4Ci^^GTR$SsOvY+n|UtSVfDe!<;k)?C{(_zK&YzY`7B2R$dca
zqL;V@@hDZ-^24wt+qYgg$sVh-KHD!K%h@>pn3gfm(*96~S?JNvjwPu}G>(`#`=Pod
zNq>lb-_OZZ+`^br)#wkPh<MHuxetU*hmE^CdOc4%X2RFV%UZdIP&2#Y#H#74R396_
zQv_A(z9H}(J4%^(64p6RN~BLWaRbEOrn1FuB{lrP=sXXT(~De*c8X8;UHZSUgKv~<
zgy14Q=Yo$+{UeNFN)eQy5wk5jo#cE^LA((L5W(UiwllCiQVVAkWY>Xr?Vs{sG1Ks;
zZg__pj$}Q%(b>TAYQ5SZ@zHk)7m4zZVcp(cSfLE5ZJdgSxbuViHv{SEd}c_O&H9lH
zU}iH}oJ&r(I#I3>GmGyF-+sD4K~LY~#EFnr1<Kt9+Za(ynvFC=_m}EnD7UACY0a2^
z1;9ARbUnu!Z50*>-EPV-R(W9${Ih^Bk9>ANwEza>{7=V32JTZ$*hpI6i0pM}P7&be
zWChUye)ZuD^#LNJV$RD`jpw2V(Kn$`pG`l*H0KuDM?%}bav(AHLqm8*>Vu9FC|yM-
z8kW)$HT#a!FD!C+YD9JYg-h;GzQN}0l8$4z2i=cM4buPO835-zp}1nyYpQxSIcyg?
znu{83086ZAK3LQnTI>rXD$2r(Kwk^FeKZ@3HK9D_SV<*kW13FAuNZh*<QI?(%;i!V
zpyf}fjEZl-WCu&|P8DEZ$_$kCkDUTk>1YEUG7M|el=C6&5Nl+aV#Dn8?`EnOqcm}n
zp1$suCtA#5tkgPa(8iq_nXh9yx=K7yYNU>ok3yXDZMb@R8H$@IIl!)lu{b4F>~LCt
zOZ$d~`Gf!Q?Gb^t!V6xemk04gtJIDXuffF0{nXeog9pby7&SvT=(q`&mgx9fx%nB-
zm<nYLKUr26ZUmaI(x_#p#&r6LImd{fJ5&9PTGo`)exwp{*1m|0Ivl$dJ%^e-qA!fX
zEga$e$J^OxAu5*2yDzxFW?Zvl7L<f?ZL?So&#bvP-h{40-l>_G6Phuaw(WRd4ZZ!M
zHtF7k6$la}RX52JblZ)X?rML2%A<2YZ(MJ)eY1#nHl-q;f!?MW88#k{arT2{59?}x
z_w#PK#t>gUkRLTSPX-YsG+MXpMwDoG)W*kidKbBt)ue@AIgON<12^A_@dHu@19qt<
zAD>yg172vM<cfhryHvYqq8xUXoT!(o$*m)YA{Q==ZI~-o_NsvQGcGJu$+2lTFcFp4
zsC)0HO!(idBBt5Cx4BNKd^13ku}DRw#XyJTF48O0v@0fJcRs~`q`A{sswLrXi7s-&
zDd$<S0PQ;{>R{7O*V$0P+fsBy5cEiDSk&KGoM5eT9tb4;SGUg>-MM8DKq_4qcI)I-
z8USNbDa^7hjiO&}eeFU!KMp5!7wd^W9<YjxZgDM<HK$G9YP*!z3#o%wwLeGjTiCe}
z`=43LCRpNVX^=#|4AX<_TD~*n;w?u0@_nr9d%JzcYKoa0vprNg3YXNn@55LJY~=m5
zP_5nE>8<AquaJjOEzNNWQu`dQ%_ynX-mF#6cBlKwcvvLmymQ~gQSvqMG=AR;C1rTk
zmz&Weu1=SOw|8aCFzRYc)Z(lOl&!6x`&v$S+t5Uo1RQT$o>q<xE2%ji4feQ=<Ez#p
zde;Aqb06KNPiLH6bQJ_FFg%sTC9^?gVwsU*^qh2*#t)E$0+YjNSHW+X(F75ri;@T9
z?dqw84JKPN==xgnhUi@l;jF69XCcUBT=JK-QBPjX?~VxFxG-ugNc)KdhS{yH?^^8#
z@5o5X9<;6{Qo7|n8?*ex96zC+?AM#&LA7e(<oa<_MUQt#^y~@B<zp*JXr>S}QeaxD
znUPt5go=z589}VZ;R&=CL2LA}8RA8^DJ~z4ese%p{ZO1|Bba?<F>1&r?6lj5Csi)K
z8sqR0>+h1o9#L%4<FnWH4N5?39yI5mE7co%(^6N<W}Y6s3%TqUQ7>wc8LWzZ2E(|l
zZE)o2<}KUT@eY4om5tFSZOaKTp76G!j>w<1W&~;<;SYH4eBuKgcbn)ne_tV7o6Wx|
zVY&#I^O5#lqnQ|?m`IG+NsGhihBh8juumJ|T*!$<N^5kBBRE&*<b!>&vnS_+WDTDr
zPw}y6$>KjocO14BN?=j(dz?eS?cWbPRj_uJ1<jE8o;!(nbmptoW1yO*?t8=X(E=UP
zN{2FWX^3M>{sy==n1ei|!A2zAt`B1@FR2c(Eg<4ASSb?9ciYp`oR#hM+~k03_Nq>2
z*f0KL>#dD!0BH^@G%!LH=uFfmt__%;&EC6<@+Je~wHyO;WtFFqOinkfEG*N=M(1(D
z<*5SISK4vj&M{u&nGE3K;3F=*?z4^sH|$w_bF`hWLC!SyC@L$mlcON)c+$ai#-j?x
zFQ3C@t<`DRXVg?K_yg39mSOj4V!O`1kF;b?Nf?FTeux+<VOjDjnI&QjQHvMQdxsd2
zr%**?ms*zVa;va;%brkgU#^RaqZ5A*g?L_YIi2!pr~9^%nbCTZO<E!uKPK_^nM9?e
zF@a@4Y&|B82*f}+te)}mX}Scjl-|*%s{Ci02ZN$?{uWa0$+Nh+86(wi<C(9LC2xrj
zabT+3GhTn_nqne`tJMA)IuNTgN}vKqq12&0m+3Q?uS`N{2ZfewBrC+x?0sL<D*G|~
zdy3tIWSS_Ptgd(n8@n?7=MeC!gIc<ZE~}l?+!}VeE1H=5q^>XI;-MqH1ckF}OZ$Q^
z(i(X3*j%{xZ3?YseeylpwF6e`=<iIfD?-@_^3LE7n$oopjWaiSJCrc)l48S0mMOxw
zvH?y2=IZHi$|e*2N!h5i&lL1iy%6v0x?udefN+?qT5f>+_;^$~T~dyl${Iqa!f?}r
zpJT##>-KOmUoXMJkl|#YH2d|DaA92@SY&(keTHl*Qs+)F$%1^CS@`F;0)RRT1Y>yY
zdD^8}Itcw^ev|7kBHlk6U8@J9`TFjLE!h<|T1g}t{??3>8t-ZyZS(;)kwt9F2|aG_
ziYaxGI+dY^t1f_r5aiu_ldQ8`;wCwcd9ySDJ5=eQ@`d|YudmoZ{r#X7@G<+TE*o1C
z?P7uu?p1A^8>f{RtG!DMJN-=X4wJ_yJ>QnV=xp<c*H?&Vy;&9GxCD2$<O9Z70K%z=
zpZ)4_LR#cDJ2h+egtIA6RD|Wn)t6ZZ%0(r~^(W|~$We<&7Q;}+gP6c)wKE6pb;9is
zV<6T;zJ7OWG~GimpR35-owD-#L~c-Ix)-vat9zcdD~iCicGoJp?~xk@MT{L)yN($N
zf%zLG!Qjy=317S<M;djN>()rvdwJvS8tfRFaYXFAp|1@QlX^|1R*)U`hWQQCsZ0;P
zMz5(b^PNKQZ$xSXz*7D9S9W3WU$GxM6PuF9*w)C#<_C?@^=e~@Ap2IV7@w_r84P%g
z{+zIgo}4m>tC61Bp3&4UcI+nLJBKRS#pHP9FeuMwj*)CfH<;WB41)XPqTb$;-+&$a
zY6PD0xjUw91t(*lp9CzD-}x{@4>o=aagkNKvtn9Yoq!hfCia>4x5j-a94SO}$jG}%
zt6cIVJm5g~Kd=>!H$g$@gafobilB7lKt^agoUTQ;bG=-bcN3&Wl1Tg0%d5cqSlCJ}
zSy6UirjU^-8iLB-eLLGcWjU7(=4|vA4U#d2U_Mz=ruQgA#z22Fm{O(H^8$A*cl^sz
z0rX6G<&b6jB6M=574*S<B3~i(EC=&n!DMez6`*1fYK+OJ52U*cMfIQ89|(TOH&W%^
zm9cYsFTH(a4PQ>8SD+8Ko%T&j&ln#>5k5A&#T}xGXgEfe##a;4D`LpS9vCkyo}6qd
z)w@1r4-utiSFoRv8Ru;&+RPcsG?LK&*yad@1QDeoLNrJ(31TZBXo`3LEtGu3)EmB9
zusKe!X62D2T7`aN)i7voe~fh(W`iX!Z#MNfJqNCj>oNF@eXzZqV?;6O3SS?CZ@+l0
zByGlwzKSVVD5iHNKLjH7+Rh*1bzIt;lnu;`f@;;2(VO;+?B*<w`+B=jF2>G1!Ss8B
zWgTXaB^ei@`Ke)B5<meMzLjX>?Q7J))rQtbn#@1nd+sY_FVF03YSsMZQ<SX#cT?LK
zJ32X-7+C*jWou{&#rTiD|GzLGBRwO>e=~oK1Pn~<Z2$B6zi2=f271Q-FAdlXDzCkX
zR0i9>y$$C2pU2D&V@oFx1Of!UpGDlx71E}EJ9`i9%Kj)P%k#JQqC2A^{aw|w_NJRc
zLS+e4gofXgpCYahn}`Y-8lPWVK{_-Uwr^lyW@umlOirTQ;LsHQYnFq%7;SEN8SH56
zl@8V(J+FLoGd-w$^Pd`L43Xf}243F;yw2gi-r=#n4q#1P-R-v!!eJj+Jk4WG9RMXA
zz=1$4kBYmPeQbPlcw}PZnr6oL2grQN0<fy9YYWCV16UZ>kCyeMBnCi4iOni+P)pcR
z$<vQ>Yzyq{<Xex{9HeS{E9)&Sori}fT^d(Aou5`!un7i04x7!&4{Hwf>;SL{;7fs#
ze|!n>&DBEsE(rkE>R-AC$OVBEo179l!QOS>&Ir!g*@x-DjX9tbV3!DZ*(4=EQnp`=
zF9p?CaUZ~2CkKEk>5A{xxAk`@5%wrww9G%>ESzjf%noaeDu5KWCjq~Pr2qKzWHg}u
zh53DGL3uaT+4RoR;L^y>(v{5q?2-(iVnGGKVk^{d&Fu2l@W}Xd^7!(|Pb^mYuifK{
zse~A`eOw^$-261^PwW@*Uv0k=TkluXpHGKt9D$seo?k*KY%%CbzKJ?JSHl&jCVLm~
z3CXYOM;DOa&nc)gusve~gZ+~OP=IVeemY016FwkwH!i?ml!hPsFV(=_TI4ZE{dZNc
zx!n<@w-?~sOUnyDkhb<V;BW6=nm5}3GZRqtwX{yaDL+-#n7iKYUR+?B--Fgq*ZO;)
zv&ODyd@8@=*jc_`m|fB-pd<6!Z>{fHD$|sdmHFg^;@{3A-ylOn0y;lBA~G(&_~=B`
zzKMw$=)DtTz_;I4d{m{(-bej+YpP3gNT9o)<QuKrpTvgIT_*m=*MK>opUqUHGiwKb
zfQ;Qho4$c@!=IPok6-Q^-;A$cnRk5MpW48mUQCJh&COqm(s!x-Um`Z=y8722twU>v
z?d_cwe#EC1=$PNi3fM0z=VAUAv|p-3XD07WPz5onPu~smLrRlF&?fnMd#2VOEA1c7
z)i0y@D{CD8e^hBEA07>Ws47~@Z+y3PYWw!);o!41=`RZ4Zpvw|kR)eDAob50BdaW}
zUwLF?IUD!nCV9QR1CW=-?#evS+4Ct1a9TQ!fQ>DwU+cjaU<v{H8=p;5Byu11$LPG?
z5U4)dr_2_B>HY2yw0_E0XqyJWlwxl<ZXfk$COg2CL+|-?>42@rWBFUA8^Dxg?>SAt
z1K-dfn7-<#j4k4l@1hn+v~Sq!bm{rOk1Sp?cf2xwg?ydT)(`Z?p!C6h0&QW9e=Z$-
zsk%rE-nI5=Af>QlchRbRan^oQe)C}+T;Ef_GXs`;?`Ui<efPB<t$%`T@2!7>ZG+c-
zp?4|m-=eE*li7d%Edjp+acnzmYqNdBcNrZ&XndfLo?1Nfe47KFX_|dWW<F9fE_?5$
z4_vi&R?^m|H$dNNSGr9OPar>1`!}=O{{7AJ{tdn7`1BoneW$AX-#$0pzeB%R&W^6=
zsjc8Yx$uRpJa6#7?=FBq-F_!`k&Xn8KlGa!buFK^1t2+5oreK@<gU$&=9u2-Ivd-*
zgoDJ3s@`xKuI;EYcozaX>nTO;h#G&~UwCY40>l4GC|Y|zc{2W#u{Li)_0os)&@0$c
zYi`Pch>evIHk`g*U6rE#1)qo6p%6<yyqXEDN(i;TT_?L%+5DIPjK$De*`YQ}5__l2
zI{hZVv_jD47Q(nnZH1N!vk@H+kplO<1#NP2@&fMhGDH==CFbGwn+Sgu+~a}$*B-u+
zxAGY4Z;g%{iknB9Faq0Ip^|csAvlEt`(qD@$h`w1gGh?7sAII?HF?Pl&T>(9B#;Ra
zawbt*=t%#83HiUF;QNybtt3OC(3gvK+_p20=B?qy*{YHEyP68z&)GFz22`e89l>Dm
zt1VfTwLgoV$k*Y6Hs(S3TyTHj6;ImH?jFEC+<{BVFOl?sMR;lJ(vLgNT|YBC2(w+f
z4tsj<a?|2mg1!rUtMff6ix?n9*@bO5rz~YMrs1s}K14k2@{qolWg)Wio(7k=+&AYh
zoZDsbk5+Yy=|)fT2c$%SJmLR@-Ljr!v$$*zqESyg`77CDws<*g$HWmm#Lgf6y>Q=s
z;=_G43s297j!mHo2=yDVY^#)%mVs6*cqqHi{8L>Md8-`uHgZ`aS-MMvqp2LOLHr>z
zo+9%DlgjYmRU4-G?hGVOOK3lm@tmx~MbS$YVd3;pp%ep|Y1QKpB2FL!EN6cfRHaKk
z1)2(0t4(plwUUZ5R4xA?oiEC>d82jNmGAMvJdHkEu^MUpR>~O>l)W=f6DVU%LV7QV
zRc#T-RNT!okoA&7>cVVXhN-YG<!Pk6dZRcDkv!7L7!<>9E9HEfFx@WO2-{Szi>&MV
zr?kyqE4jKq$X4=(*0BjH;AW-RzL9V-5a}?ooo1Voi9vMur!88BSYAhm>5eOk<d8SR
z$!K!u>i83|b(1kThdrOSv%>4vG*n+xBJPxRG>uorAl<V$$>7v;uOwxE(Ksj%`V3Oo
zk;d3=f^OD$Dd0En)m<>rX4V9-^cu=(o<=U>B(rt^hjA8o6itY7`Z#4d1J)-bV{>}m
z$9hJYNx0&7Y7@M;G*#kg&nyNQDzZuz0uL&l#V$-9C=$X>`q!z+Gr}!1aMaN6^>4Xf
z+Br}=J$U*STGiGo7C>hcrwdl9#(XdkTt7UXD3f$|lNeIghP4K6#M6+rc}+GJW&F!G
zW^E8Sx6@nd20%2Rq=fn;yC|OV?tzop2y*ZuhbYoHG3NXPs;zYu7Jr=9?LzO<qhtW#
zcRf5kjvBNmpEm{^{ziUIeV~nZr&VAfM55t+VoDI6k&2|N$w$;nf>(r+H|oJ`S4qeg
z0PJh$z$3@;p{8n8>~Rr%e-L0vy7CqdX#S^seJIsp_BTCD0L>GTiKZg^iRab#)voAW
z&*R!Nk$NtMP`2P^tKoGd=KyI{rs>s6DDw`bv$t5r`4QJF&5B$p#$?N0W)s6`hE%IJ
zny<3)CIjZNQ@L_j@4@8gb~z2kSF^%A16tj^VNM`#tvQfd17fg%<@i55!9n>Lo=QdD
zLyHikxh^#%ek%^F5qdIyNp$EC*sBy$iZ0X>>e<gMG$fRqV2A)&-r~s_L0hSe5&+hl
z#t$t4olJx?6LFC}%Eyoti8J}Sho+x!(Dc@TI}&xOn6v%qs6$Wu_HuTfWk0-)A%_N)
z$1XGw#M}WqFKFUfS#;d91}z{q7tbw{8>E_~Gs@W<tPA;1(#@j2x!Zl@t35UQDagZ$
z6Z=G-CI^G~;Vh!_5L14y1k&X8i1)R*FpGK`!_xThkhKJ1P34rAW>cwE1}4egB1x4Q
z${#1JgB}?hMRWJ6&z`*3<4!mJYuC@r(98$(C)G%&l>i3blRZ5EDn+oV+q-M3AAE;+
zmC^HA1Gn{NFF@S!3jC|nm}06+?3TE;e(`sS9e+=*McW(iZvKpvN+~!Lo{)f$&BwMz
z6PNTXoe!J}v7!LU$@}SlPQ!JH(YJ0b06!)XK3$nu!9GqguW6?0?4yHtArX|r#L{LB
zv%D$b&gddvb@6Uq$^60aS)B%~6&}#}STYFjaU3|ks5@RVd=}H|P$6T{wv|03B_oZp
z?hj({%Ob|SV-jaArMaFSM^hsPYNeGd_DHUL(;eJ-2`-iO8^*vhlq@nLOdc_sVa@zG
zCr5z{0(TO5;T+jdolIlpWbC4QghK7l(pv~q;lua%ceQ`v%BRIE@f46O4ENrGx{{^E
z?pCs!_caJ28q*6<0+AEJD}rk4eEj$|zBs2z#`~`RG~@TVlk?c@eX)rM6Z<?4`*5#o
z`vybP93YPg0#t-R(!?d5&zrM=;49iWJq6?^Kmk_Cct7cd<dpgc!IyQ5PV+uB1&`%q
zDG$I;tEg2){iyg6iA%WnP#>+pV|*Z3h4Ug9NZ#dabsS{F9&y->@7!113I9yIakZf8
zEvH?tB}%>kVlTbX4e=`n56ss82KbBY%EIpu_@C#MNaz*Qw#^hc6&+{VNOVdL@f_6T
zZLraqp>d$!-i^B`!C$HI{!mf(xhp^f=lP!<YHGV)+}7wP6tw+oehG|xi}W0V0}ah~
zey>bshpFJ%n(#;69-9dI>&1jZ(%8c%3WE?5dfpu9HgJnD;+g&cYI|V&`Sa9~5}9}`
zH?v6rl{z1WZdfTR8pMJr3eA<dvrMVAB*x|^^~>!bfkil*Uvx1-pH|>+m^Nxt*A_=c
z=fJRY5G9VcqVv=}4LXxunAgA5AG<C=M?+i!;bbmSq1-#;VY-z)w9CYUQIqQ`swE;u
zZKXBO2cmb8aRPIF+C>`FPH<!>AA4J%gO2tMG?Q#l2Wbkt^%atIOP3BCdu7s#5=4Ya
z77SEsbm_g*v?HTns+E3$8-pUDX2(0@GaVKD?S^<f=lWgUQ__^g2?lkSGGR?xp4h8~
z1&Cgd&NdZ9HNw4X-X@{vdRf3#xVCC^tqRHhSO1587LA@dhaY0uDMuKQYl6>?y;;7~
zxp_)^aYkd~!g&sr;VnLas)?6ad&P2?`|y%K#yfnI+xM&=*ievsWr$FBq7mOs`q$6)
zp;Xt^kesGRhbB4-jP?P_kBP;~jEO&~BCrm}ZO7bs3&LnRG!{&*^;R^Jb=@at=Vc#J
z{ZdH?;DJuzpgYE7cLO^riec)4sam{L#3XXT0*TGcwIz2bN5WH<pohg4#8eY6FbyI&
z3(ch;6{L#PXg5lIp<4nN-7K9^pNMw7`h(Am<bnQA9wC-Jn6?gr*@V{g$9Z?ZysRo-
zo@Adgm9;=}PVu#pYY83fhM`TzsJiezqgoOA)~Gn)^22HCkVH}+yjcA#!TIW#5p<t>
z@FZFOMVI&o^-P}EIb535ssPFzj0Ak{DcM>ZrdilADpRv2qh!A-`ONcV$t0MgGUCc|
z-~>0(JLUqW?K%#n*xDsr5|{gORu!MAC4a*5I*&!f1N?oY?!^B#1;&_a>I(4PTjeXZ
zm14_%YHJ%cfQVqkn`I*JtQ&R|MUbN&Ob~ID=T41QA!QKnl2)39V#jtJ%Q376lG$C^
z;uPg_AJX58Xmus~&9#>8KBBfo=aZgfJq#LzED2Ka)~;zlH+4tK7S@9~gdaMy?9m$M
zaU3vv2}~3_ME(Z2)s3k)VE81e3hHd<oC~gmRax6t&lBAhCi2~=(8!TC=``#>jf?{m
z!9@|ldnE?K|7^fvnvt4~gqPJ5Bp<1pxd={SIFY|0r}fP=K(L(UuLQwu`_VH`dNrJK
zWen9&V*&KfK)kWaw!})+0P;HEIb=2otv4w}TZ#G7X!yQs7|g)cna-x}76rQY5lD7z
zNs-!oz-{X|I0IfTVn{;h7PP(L)I&yE;z}`>mD(5}Bc&@?F&L?7=4K;GD{TO7lhFX=
zl*pTFmpxEA0Str8QsJS<jbsVV%!0LceTX%S2ET_jVJ!t_4I0G=D{4GCR^_tpy?wi5
zhE9XN<d6h45r1qm&4JLr;q|B=4U>_WBnsikj?giuo@s-?)1M}`_ePPC%g&tmMhIoe
z)%|BbX<&#wp`~wlp^Uah61SdhDW#SapnZy{WYpcetZnP_t9H7&KP+Cr?Jvi@A38Fx
zZg6N^MOr1z1vFZ<$8#GFYMe39VkZ5d(iy%Z3{bya3`b^NoFgGAFKVR(tj|JSn;?WU
zY-{aGx$dR~ylTZB;DHjj#lh7a&nxwaMyzDd?~@DF%ll#BauDv&X5`rL{zA?6MFo8K
z)+B0~5;v#jm?8D7(pK4gX$(OLA`^i{>eN$6()U`jce-MYtJEAt(V~;rNETkNo}+K7
zdj^Y_dMhxP{tnU5rf=g!C;g2B>dWhLg)2g?HBV=U?*8+=U{RMkOuaB=t9!<{2n=Z*
z$!?o|YI@Sq9bL>yD>{<(hddhjXr|~j!}7-zA9U2IFb!r>Yp|M`Ui4!w_N@q-y?ecl
z7HA~&H*c81pzsNdIg)IxoeC3K;q7Gh%;TTO46!UylPU3CSvhS&0zMH#&-BNi4q%^8
z&c2lm{rnS$qL0Fv5cy1FKV;m+=t(^)+b|avZ8U29gdOYyFe^|Rh6VB2-EPzAY?6~u
zB>T{i*Tls}fiG1{W+tZe(jrSvw-J4WQ|aG+R6M6Iiwh)3*y~+)`Vj?x?-8S=Icw({
zd<I7wzEL);kTU<;*|EWOPodD%VG4zAm+4pI>*J>;;U@+JQrd2qSNHwZ&Df`-z}y|T
zfIB+V@>!hQ&oM9^fM<&xih&GS4)U6{Gn@7vDNGw>uos3nb?lpL<<ac4_&nG<uum*^
zz!i%jPD%r|LOXI^@38h-)nqQ1+gwVG-uq@Lpr&}*d<G$#NXmd{tUa!;cnkhji`=JO
z>wn+$3${+(5L%#wh*>$kDi6wBQI|^gl0USNFFk<wAhHZ$KFZY|nVQ__S%EeZG839o
zP{I@|Z24@y_*tYYb%^JMP^v+kZ-nKV&va~Iw<ED?2INhL>X|73)3;n)L1|*};+4E`
zfcocdY!TJ_;PsXxt^k+AARsQuUP*&VOIi&?82%_807AtFqA3l)<tIYv>l9hmYCD<l
zHhGc+!-iTG*u*OzY?mW2hs|fkHLM8gkXMp?_eZs~ngPym9-a_#;|mL{OyN>Lc_DgX
zIG<GMUU+tFwcbf#1XqyYIx!4gzqqs!cm%g=)h?I1o$TJ&&V;UD+NF|H@%HF8Zy(}5
zC3X8akwFY<v<4Roan=$MlaSI71`k4Fu_&OF8H?c5Iik$TiSjJA%S!lKrFLI3=LH(<
z0b*Ea@WCP3C*Y_$YxKTwS18fyq}2mV?$1%)*MTx^?6Q`0Z0^_#lNn`I6z`b3o{ZAg
zm6pyiPe3I>aW#srDuh`96Gp1Yb&~G`A|a|Ubk*q145j~A<w#lZU<Ba>xdVa5aZY=T
zsO8a4&d6b#Fiv=k^%qV&O&twTyzd4ACgvbl`Y_(trB2f~-<*XwXY=UkA;kBnT@_Co
zutSt{7wu7EJL_L|j>XJW)YKpVZ2}`rv&J8@n)TvYnYs^e1L>WP#8jP#80$2N1C<8y
z-RQgSZA7<p+o)Y*-kpg(3n(yaL7z;A>I=Gq>^0h&6gZO)_^65w&bQvVK;jFx$G{6l
zrove(9M(q!vElF6Q@#-`%U=-*FCSZ^u}4~CE|0sexWpz=5S#J0!>8Q0(zMi{+!fzf
z53^**lHp+`r3+6JyiRJ0H2(;Ea~W30fd$WUo&myqw|E;@Rzz|S4y<Yv=l?Y?+rp3F
z3d?lJC-LSRi%FMh>8Fk8C|E-tkk(hG#{6En<?6jz5eu4-{iLPX4Q2$Z+MM+a?z+QR
zf)UJr84Y^(n3?&rD_vJ;$1rTv^KHz3GNAR)xirL8HgEQ+d*Qju+|haJX{{}V@y)vR
zqGA1^!^~zum2kYd51CtjaU_whz6ED735_gIGiz&VR@0W4e|S}j!-T@)`Y*Yk=na<8
zdFPZhyVm`nA-)yv@jY6)#lHG@#&L|>iz=($u^l1~7C14A%Bd}<eeA9*tb)<#Y<~8R
z5*l&`M|c?)-9mcPj!?PJ;;P_BWPo?TOp$zo1`j_^$hIqWC0~@bo2X*>)D(lJ-qe3d
zK@5s*6sbuB{i+A9`O49{CGe4k_!_(aUJZS_e6awl_{?@4Hc3s%O|?!xHSjHiQ+dVc
zwjBvAiR-1-$9l><wowI}W`BpwkLXieEt?ncZ<0gFXfH3Hr&bGgWp4rv6c3|D`qn|D
zy~OPxA3R<p2{Iq7=Gm8Y*=Sd|)k^#mc;$~57G4kdlBg{U?^sK#8qM&YM@S1`au6t)
zB;*q5UgK;L-?>0nl?{c0VQsk}wtLKBO~}a8hpD23>d?dSIwX*M0URVPBgC*|1-8jI
zRN{UkuxTn|CH1kC^;H)X;60yr2ku2C00iHfFU<-Vd)7vO<uMZ)7^_WZ(}Xg9X9=|k
z4bM61ZAvPG09KC^_Q4Tk9IL*@VhoVSHzUonN!`Si+Ml)5z|iMaB5$y`&vd}KVYB>>
z+2Lvm7;rSDcrdkW?L2skQWYj>9q{S51Rievg~pGvMU1f&=i!|{0$ZFP9ARY)d-S1b
zXB$h})eZ$Du?uVtQ)Un-fCs|%Mb2739O9b-aS;#A5Czd5UacH%xZC3Rd;wn!VpPS-
zj;n8mOGfpHSSnS^26dyaDcl*kOw5ngmi_KM2ejGC_Lx}P-khnp*Va^WP|jkIrIYf=
zXS%&xmIPdfMgi<_7;?R##T9N*>Q$?LpCBdtc|%%MxCG+1oI5rdlV4W61<56FKd3#(
zhHs;l(6;H$i$i;O^Qt{YpUflyUVeQOVQL#Govr0a@4*!uaI-~+z#<Vn_6p*1B9oD3
z!bv4Qtp&qB=k=CiACnm-Iw(`d-DJBLl<yFX$@~6>(7vQPM608jr8GptITp8K7Lg~|
zpaX`q3s{nd?<}R!u`rmMF|ylhLr{PlNKZaBgJ>HI+Q}?CRrIEM3<gf@c}K<2R%4$&
z4szFxvy2`3g#|uG1dhU3=rZx0n!;p$vOC262WC(Jv8i#np!gbq!Dpy452v0P?mEr5
zMxhD3!O!MQT*R+1u5buNk~U5C9oYs(5r=LV1C68PGdYXc_S^pqh8n)-w*=Kn@JZY9
zbLNx-knh7MxC7>}k$_69O2f*~?>lo<3xmPE-ib^X9Uhg#WW4@)$MWu{j^2&HmYYWm
zo-ItU-HeFXg5%DA)jz&iuI)<*PmGeN6eVHIu!z~Assqx!?LrFTdw5ip=F|<{YR}<Z
zz=<K9d~*37cN*Z}rs7Tmzgd~m)s>6+P=KaO!JOe+yN@P)h-ef-8-N#eCMK8$D@;X2
zg^KS4rrH}rK!~k%$trb)z=LrrP9Hjy>ITa5h!VXD|Jul0P~Vf6il6WKb%I~=yQ~z(
zPvf5|Tl$O{BYbVwdip34qYvK@d(Wg9(0ibw6iD_DFY>z4BB?`;Cap%+dT9O|jW&c5
za*!Z*av)biF`_1dNn^4@raH4+J^&ho+@{eAs5h~%E(9KQlAAsFX6cDTt7Dy;n60EI
zgoUIq<iwFHZg&%C+1LH6vdiNX`mUIh+lGB8lE=9`C3u0HKd{<rV1ELhR)^mR#ZjG`
zfv2{{tLeu)(u-fLM1x`DG%#@v-{YmV%m;z=z9S(*J8aYlYc`a*P7sFzjd#KU3S2a6
zLfvBf7k#q%E$iIhp0tTb6)Lgsq)DPmE+o)9*ov#MJ&K^YIENjKG8~6#I>RUCWcpiV
zWP`mkA=~0lCLNx@2-Tg0^1JHHq|EUs`UBUJFv=(5tskLK3H7inE!|h}Rj!B#PLD$}
z0`9(&*6VtXIWhf$U^D^`i|)c77*N=KLYp1-JM7i#O-w8A`_~(_yic<%Xw~$PBy$5O
zonho3thtiud!rVMmOTfgf1pmK+d)2mu1wRn<1K^zSNv+|#jRLC{1z=$Fr=m-Kg>7w
zT1Pyi!QIzb-gXJ8WJdH7M+qxcc-Oi?ppiqoBW3v_D$G&BySh)%wj}!r5IxxB&i26P
zht<OX&2Efv^2-y&D02OSY6P{@vKbk)@&(o7JZ*(RMGos1&+6dWmSTsPuP#%Jp^#J!
zHbX&2L16>^ya9^NZYbH~c7$nN@_+}2**Z(XK7?OmO)Ii!{XuBME$3bt`TK%dp|Nhw
zswz)d_ZmgJ*v04FuzZ1vzP~UWcukUW`zLnb<rT3$5p)MCD_R-7H%gb2$g;i(^8sn7
zTg4qG{=K7xW?zUq8X%IB&2X+T9gx}1Cv=yT-%8HlslP~?-?#7(1}~|NupkZIJ_)Uu
z5z*a-sjTftP+0Ii2ZTmgL8%n1@>p^iQlHH@10Qehu&#6;OBl`g5%0vKcHf+h+N;2J
z0o%4J5~B2@BJf-o<DrVfsIbUTz8-&uv;ajWlj&3hOi6B+%TSIbn$%{=uLOWM|7kmh
z^vTK#k9Wtn>>3%4yl@v%jK28vb4HBQ_}Hn+H)lHCd%9b~6%8Eyxkb)U&8WFFgrxR0
zm%3ke%lx|sc5!6iYDpL3z-tRpK$)>CX0eL88sFcdx|D=Fn>-Ux4U~b5dQTV8nEKPd
zan)x`8p~8`R9!5q+y{Ck;34wb2|~e^I+(r$*u3z*R3158OIWlavP4=nc7`x(zX21n
z{o$}L`)YT9DBYn2wiB$H!E<L*vO?mVA{s_3L0ZbFmuj}iOh7bUP@MRfGV|*5&ZiAD
zmqLK3k_!kafG_d{TlR8n_<xkuEhE-fy{zdAWuPI;G<z-a=Yl{lCV_rf7{_1FD#C{t
zY3mt6^Bn~+#gy*UFa3i*Em$?7x@aL8L{y=mD<d|wbV(Z@kS;iheP$)M84uDTwy~-x
znlp*s`<A!?BlN8~b`vIT)3C;&G?;>Hl4x$^aper^BYFiXqtlG%H+5df7?Q3fdM@uY
zli*bk&I^f%Z<dPrn$B3u-ReQei>kdrersCD9!cP8Be$&Hrml~TsfX33=~oYr0GU~p
zB<)Q0PxUpR9HD-cd;^=57Zl8y&t=Q1cCk%W{px|fIiAkw?+J^w`(T{-a*XCdY%{2O
zY#?F?=7;;bZb~a31z>$q5+KlXSU4v>w|rBk4QMnqG`4>FNo6=5-!A;d*Fj$%6EhHo
z;7@P|t5{-g`;SW#t5{hMw$dN*I<{x|t~?!|K6KpbtXvR-z!}hZUR>nl7SNm!S6?lc
zu0>@jc3?Yhl^|uix-r<3%9&AzID`xt7MfiMZ~w^gwc<mdoIJ=woL9U!ec`N7`s!t&
zdl5S+hm$RN(r+(+ekp7hg(iIx!fZs?=)en{*q?POG5dY9&IKc>E9D<)>uVkYy5{29
zjl_e%(Jw5p8&_L~2-&KCZ&1so0<=%mcC=0P53u<?F~2Gdw<?i?YDMcSo#({?z#d}9
zyr-X=m|4_x{7?_p#9cY&gW=bq->Y@Ahm*$eH-(lqo`d!;h~hkv#<nZlR91I;dj&)O
zBKMdvq)rRw3i#|n;nU~+mIq7AeUz5oM+<?cur^*RxrDqmHA}k*JU6;Diw!QBDd%EM
z$SC6OXoOfYkAHcEFf!X%Lg47lpH;N|$+-yM??-<5Vm<2zMtdd1Q-cW^ki8Yzn=rba
zFGE8aI6mE}Jr`BX*#<f^-sU3+qcLl8`B2mGs)GXTDjhmXa-SaF%okMf2c6A(l?Z!F
zHt~!#1ZO30PGKAIId|KPUR1?U>A#WjbEjw_LwToDKL%VG;m^zmW7kMksbX)m<@&os
zMVtHmM{=Ye10p8E2M!xfGdXkOVKB*ov>B8V!&lek4l)_nEeVi(djed;IW6k6Ex0Jf
z3<3*2ETBs@iIR6%0QD;06KDU)%C4|^2kUF-Uyjs?c{lQ+4%rTgW8z=Ez>MqSD^^N^
z%n=6c&yu`_aKE4>%Sh-|^6->^F70_Kq`iHJeLKd)T*BIg;KzP_;(sO~E4)%ePU}(L
z{(wLcLP==oobq#>E3uT5ST!Y@n4T+y*_9}}iq@$q;=do=I4o_U)|UiLTe)7FMdU%d
ztEvWZ^Xt9ZK^J^ZLztjlLQ|)inX>&}tBB68jCeROWK_)$5J6$Db~;enE*NU}-Ib9;
zOG=HTzaRyry-0k84%x&-N_9JMh?oQ~0e1q8Xir`jBf6rl%L0Gc-yeAGuO(`~pl^!a
z#c+4+Mwb4Iv2*GU1=!YXY}>YN+qTUe+vbjK+qP}nPIheLW{mDL`aYb8eym?mwdz~n
zoY5c>Mz(dTwMHx*@Sx8{<<Mt?z%Wl*?@-M4>)06e&@A$bD-C&y1dyU2WFl&nZJBjT
zo84a-6AX^-)zWl7YU2gC!&!yp<qJe(d~c-X-1cOZ{W+KKCE_Sw5kgncJV0-SkkLF3
zHUjDR2YU5~MeHr<U8Ax?G~LC+%C@GtYi^iMZsoY@W=B^*8AbC60;e_dJ@$AYV>7$_
zaF8&}BJhT6YKb-w#=-0nOxj1JWL4`W<GiRwR3+3QIK?DoDQWl@v6KNEGH<?Z^?n_U
z=P-Vl>do5^#vUbc>P!5zCP4&#`pm6LzRa!JCDoVxg$?cyBh3?3>~{SG+bs{gKb@H3
zYA+br5>R7KRqlM9dyC<zekgL>5>rY|H)h82niMN9ZG%(bF`^P~8T3FIw)CO{myP!g
zNI7;TY6u5b-ed}qw!nk_lidJ0M{Tr6^VKqvrO=4P-eSTL8QHGl)M9HVKVr9@As(Rj
zqmBfzMZR-M2{@q|0_67KAa1asMCh+%D-Pg*5K0=&*Y8v<z6|7bu3O{^1Q}@_ef_PK
zaK#3l9T30Rn-5-;6y-1-AF&~IW)m&7wbb{V<K@KlNJ`-rqK_I4km5j-8-ogCvPs`6
z&waXtd(~`+)P8U(!g^sr5R(H_U7tRq1a~TpC-)t4<kmL!A3RIiUgv{!E$P~KA*GXT
z<9{>B<sI-J$6|(ZJ8~vCLc_t1wF${v)#3HCA7W1liCc;u_b&21CWz<`qb|s-awplF
zlI)*3;HEPe7V^e8Rwm$-giPC8%jZzcG6nMF%>DD1#JXb|Jh-E(HB;T4^9l9kSbdr*
zL9-IN@%zHQooj1H$Zt*0;_5C|qg0~XX(GG<JZuWC2`xRr;|iQTJ+r=-5c}0?dsX~-
zxO<J>a`e?!Y7(~KOw^u5_zGQ(@kQQUFK$v!3<a~(S{|n;2#!&Ytn3-&!$5_V%eY7E
z4z_JB+>$C%2s_abQ<@Y51lq&!=Vsa*WfgjKXZQE(qcwnTz``0~<fYvu1SFBkqeqoD
z9=!Z@foqC$6F1X*b{4m#Xn3tc#EvJpA%|+Gr(pE)5rT#ZJS3H(?o4WH@A^MFLL!wu
zeIIKaun#`pDk%`UA}Q1AmPPbNzEcg2;2#CJ;<jG@E<HDa`AXz^7%6!ZVP$bnCUbHs
zCYvJcLj4{Tn+O1fCZB6Y6xKw4Nn@l)t^RzO+xLQM?hV_LfbDzt0+`PliuQQ0AotK{
z7Ya0Su`EU3F=+AXr$L57fS~<z6IiyyEFWZrI&$CX>TRzPnMWA_$(_};x!X<q-8=U4
z<vF+u?_NAEg%^U1NzAg4u!vw#{uw+j@i?2Us4~^1G;|cBA}GQ<#YxWu)%&R=x$<KF
zV!<<}w0edsBAZ2j*YEUU9t&APDfsuX7)6^>TL;jq9rS9@MwEu4Pp!ba)0`&3eGi9#
z_S;4L2#RHo+4pB%55mgW6i*n5D^vH#mG8J$-<w@2`7W(OmbcTQrcQ;r5MK#Ehv|P=
zaK9~<E8usgQ4Oh~x?{9h6P)LH9V-ZY^@JdwX#(E_<7iZzViZ33lPx&!*2vl(5Zkfp
z*fs(1dLa@(Kch}=mtOT{J?ca;!x#tXmiHw7*m?rvO@2K`@GMqap0UNzHimL^5$_~7
zjD$3pl<s$7c;F5lX%S7wRA;-dMWU+K?5G)%<#gB?3=PA?8E97dHF+pPm;kr((J^94
zt#Ho|uDa0MCx%FPu%t_)LmS|DwfH}Ddl|F*VPrLPy$w$K^YJyHo}vyFQlv{6A8=9e
z6dJD8ph%3@m}nnO2ZmBEi3&(Ds|~2&2I{OSFUNZ_W`|)NDZ+_k^O5Euk>tiz;`B(w
z#-)YYcur346X?#I**68Y(*RBBJ#@1xZ7N2NGXCf(Fh=GLEfl53pkjC+1pkVeTP!?H
zo`%APqs$z<TXydHq5?%qubj)b7o66NA0c?oLLAHebBv2Tao;=GRA9hK7f=bBT2LcY
zdV@q6Ti?6-$rLhNIUj&r<GC0p?m}7%0n-x+moDDAN2x0q4I$Y%+_at&ZMev2I$A|Z
zePxMvg=kSr7qrq^YDl!8vtKUG*mFANf7j~`;`e{e4htp8G7!_7rH1Zo-5x2JW#l)e
z!xXRM3w$F>v?Hq0ITpIEFm&yPB%Zj@U4QxP;WVG={YgGULp>E+A@I6RDrr&?IlVh|
z(T$bT>eLWB2N$eO`f2#dVty7CX3Y-LyHN0|{ytvD?~|zmZaoamD7^4ugtD0Iuz-B;
zw?;2YBHdF?Td1j+(5KVDWNOg<;4U1fDR)884~5y}YV-rx`J{X(9(^EqgGHWGvr@Io
zA(zB_q+M2Ku})b$$B>v0&rv4F_nq3o7<4@vCE9F^j8hox06Oz*yjhxgHdkUV4}1L4
zhcQV2m69Z6u%QV0+K-=8?q8-d8N?<@8%#<+ov)-wsyeGvrTl=c*c5&)Hu90s_M)u8
z(zn;_vA$*P1zHehr8nR@3<-~VthqQvPc^v38wbXR1P<d*c))=q5_7la(u#ibN=>r!
zEQ-TIvpJM)kn?%1v!B}6)s4A9e1j$)yDjLN`ty3|a$-$|-lc^-oU+@}C9Ad}5dK7<
z`-+f5ii95(Fcj<$UMzP2{;jW}dPQDAVohaBGnkRG!Z;s&oIVF^Z4(z{m|C=6hX{f&
zej&!AaEO+^tfh&Qg5$=mHfGi_;6>_!LnG_6GTnRya)Z@>*NYLWnn8Ajlm9hTI_Bj&
zmcYfO`%K7wCeD<>S-B-?&wE%WnEG-Rp{0acDAHR`*?To5xgl7DxP&`;KC-%!&-lHZ
zK91Yp#8QR@iXAsEIEE<Rsw*_p_B(=uH(KN{A34k=;xqObcz&iC@XYT_UV2%q%D$8{
zgt48-KwouG%2L%+gpanPz!1fN6L*M2w%*i3!O4*DNi<K4S{`p%miCOA&df7j-=dQ#
zYL<(g2z@PNTe_JVZG94H8@>-qw7_wrEpifGb#Rn7lf0Vs*7qa#_4}SjnV`akP<!m{
znPCvR{L4Tq3EIzK4(9rkSdg`7DP2McoNS$!%m-iURD>JC5G*vjjO=)Rn2&c7QrMZo
zi!rEvKOxA5%YG5q;Xko2U=#Fkq&&PdO3~0nm>Y{BG^p*t!uxe*V*zRP9;=oNri2=B
zr+BF&N5WGN6|!5YZgfnwH%SVY(?glxn$}P1PQM#Oj0bMC4vE8KJcG$!?CT!kTK~ey
z`z#uArUSRqC2LUv#}PoNwys6l4&E;VR8{tflFspNNc1jKSGxLlPe?3O!D7}+^#bZ+
z6@7s95y7~ZhF1HXTSiwbnAQ!a=OVa@Uy|4OZ5&5E=8*!J)Iwt-ec8Eqs9mamc_XbX
zc+>Ty8TT2Zsgn3sRl{2a-3+dUB`ZRFJmt&#{x*1ttwXS#*&s@pq3B%Xc%ixLd2mW+
zok`cSbJ<{8Q!&bhCgn&rfE+0nq$jG|F00K|D}`xFu$M7<wJ82<X0LI)p+JmR(t)-0
zx-+CUF$sq`DVA>~a@d;tYdrb{nI*98V3G*iU<<>(bQPl(Dj#s*udZ!#yo7~^VS9N(
z31OMff$|K=O2}FWebS}8`Ec$NG`n3YPJPe7!MRsKvO>U$9YHJdZyj*2h8}5h1xJ0$
zu&2fTvPyM=(Jm*Ofh$4EGJ$$L%NozK^;%9Fe>1ELT>8=(EfWN@AR$SFol((5{Vc7*
z;4frYZSL}tGMpqQ<RPk`nJBtl6)mRuABw>xKIQh~s5_eXe^co=1{)InPU4JFH&A<y
zE5A)seOX-10q1OTF$(6xwi6HcnwxA75;X{3Q`2vy1^gPACAUIbfC_ND)Y+CN{#O?H
zgD_{byC!`1A$aD_T@mSC><AiXvo6QXF6ao0z|WI3O3bW9)~Al?dEUl-WDYliL%cr#
zrpYA@d5!odRm!pL{anQ#B!f?cb63aiHT#5h*u$6-U+ve4b%RXXRUXxFb*Y$#;9bu8
z-I!=i_d0)=E~sBXxrcy<d0iEh*9yD4pT6jGK8f*3y^zP_GxFH{Fauw`?TWdq>TN&^
z;VFAAmFPF?B+Y7(XPePXY1^c;QTNi+69u7kFev12>@_y6if76W=U3l*4QZhEiHg>;
zXkHF}F9U;kKGYAAVBXVxiFHxN@okAKsrzC8nzlPRQ1{(j(Y`++w{J1gkD2SB+D)K5
z`vMzoYSzomkkhG*^x}bg1>({ku8vj9B34kunStfm<@JFpJC>0T51G-fG`>|ohV|hZ
z@j7;^GO~xXn9Lv@QS#HECiUv+kxqj3Rh#jfrSMN6!b0&t+s<Vka)}7qK?5%7V#)4~
zAwz-g94n~k(Z#(-@GS#|f}FIAukLFZZ|cR50Xgpst|6v6AjbgRDT=k4#1+5~$U|Tm
z3#uk#$mID>QER?2m4&DQ2b(^d)v&g5g>YpgjpWQ|h&`xr@)9<xiW9T4D_;1>u;789
zX*6s+P71Wu3o{+)SXgZ&gh(&lP%?GmzoNnfyf^_6ZaB7_{EeUyGFThcMDUmK6R{Hh
zBi6Gh4sj5;%8@~qJrRmJKEdZC>d^he;vv@i8o4cq`9-I_Dv1fMOEZm*NE<o6>DzIt
zSl^zIe?{+RHwGqqVf)ze{^Qt@Nm9n2&8W=De_K*Bhh<}Qy4rzF^Xbb7JFfwd?*y~p
ze=R53u?tkutvuG_GeLDz?NoOhCTkyMX-)O9o6m97i!(FSH~mDgPyZzOwnK^1TER?{
z@*hC)&}`9!_!wA|Y!sLzQ;k17h?7vmu2n3+a&g^H&SxR@h8G;2%ClRG+s%6`M|o4B
z`MKQr!Py>MDEjFR5)pRNia^W<YWLDFM`kEMq@|XaWpKIua6GiZNW@eEGO)@e5LfAk
z*2^Z$y!O5mmYv;Q0jeti<lbo+*xu3F!N*x&*LD`myGGfd;d>Dn*Rw$>Qjadk*oD{E
zCf9uju~V?z$<AQt&^`3f7A+`xA1i8d6dDkE+6hHjCwib9Y86Wag0__luUc#%{nri#
z+Kc_x2CnXwH0(s*n;c>2;>3AI?Xy1TuzDnzMMt3{D$8Tr$d=bBIYMLyuD^xD8CX=s
z_=+2<`m^^a^rmq6=}UHAI5_QcthbbwUhBNCrJzH;!4Gejtt=8d4pEPoUL^s$S7sw}
z{7uGS*>iQLADamWat9NS9iJ@2cjI%p0cQV7UhCKP6&;@ttTGLF?~&^^BD-;Q=!Cqa
zFP$g)cz@Y#xPB&96PvO*Q}S0@28cf+&1a^_1}l%<c6iz?rB&f*Q@JFJULYleXNa}p
z<X`>aBEuW}+h!fxu!-MT(iqcqH7kU4ZsY&OH}A}4bCNjaBaJnYf&R}n*J0;l+H;`D
zon3S4j^e!L1>n-zjL5oA$_;Q7;W13x@2KxOpll|q2Bn0vVW2wWQ`P{^M8l(@dmGQ)
z?&w38W-h<-LxM6IRW4vx!v*mV<~j*^HVnGppMNlw+K(RTCK6)uDA*r)0iy**Ct&y7
zlTN=w@3F>WJ-NAy@Yr~qIdZpC$}`#BwZb@V)aBJvi>Rg~!`rNtoMqDy&`II|&YGDD
zY@Ec6ky%ty<X~BW-!@~p{iKg~D!#HdFBL^4NyIX^+E!$omC!cFjM-I@BnD4@CE0fG
zsZ2G&N=b%$-8&<12)?g3VvBO(ODS_QLQ$sygqB8dnGa901spe@AT2S<Kpex-uvb9F
z)f~`cU<k7r$+4h@I$!dZP2R^5PbQBxF_@InPQl<OW`<xLcK3EjDeI2W{q_D^7m@JC
z``luke-evsov;J~xm*P%TGk#oPbxiBd<8fN{TP2OmA?>U1j2xpD^UeqyD*#;FJM1r
z3q6|}VIjpn(5iKXJgUCvZf`;GAs)+t<{6mrLTon8GJ9W9-uojCnv<O|G`TKGqp5?w
zGabkLzL>;f+}Z#Nt|b4EJjIo)@Touc4IbZlN)t7j^z@N8-CtL8P-Awzytw}LRAJc`
z1JDr3>)uZJ11Qn#_&GrQe}?yl%?IhzZd7p0{4Soy!8vU^f*9gz46mq>En1}*9kJ|z
za}qIK`G|PcOx~Aw0!nN=Bb}!l2p~};Qa#V1TIL{3Oy1LCug4X9!3FQ#iBEZ{`u2si
z1^Ta%Iq1O&siB9v%Xjf{qpXcHarxu9MFnbqq6b%0Cr7w62NnKl6Qa&Bx70(_w|b7r
zygDR|N1)~wDoCX2Lm<~^8CyLawUf0>9BJI?v9evff{Wc0(Xzt<I4+tv!IDKBU9fw$
zi<8qM&W1ZI=wT?#v1zxBT`>E@q8oDs9+?Goa&L#34JmPN;W9dp=TNjfx%Vullnep>
zVZJlX1_l?Gr>R6pEqgdW1$>um`kaYJtKo%kNPuBKsJp~;+&Tcxj?TU?0!_HeP(pf7
z6`^4R@n+1xZgAdToI7A`Fv?lGo}@+1vW751j3W&E);sOs75iBU1a!O2fTs*hFF1L?
z%LeH;O(9vB?H9ay%0wBM0MPxs@?tks@PdZ;-aM-*nmMVt1C1jq>l-*cj7TdsPkT9k
zDA>4oD8xS56u3^H@Z$EPN=nYKy;#=>w-W;SI+CBD!knVI(59TVsbwK~#>GcmFAaAS
zFF*k}T(0|9%u0wOsz#X|bX{tf6PVXnQ1_)(g~`%hORT7-88748SepJESP$qyi-7hZ
z=M&I&Ocm2hGs;t?H)rD4lxL=RoIZ^fV0o|tOv!TB6XRn5m&2#F1<gku4M&^fU6pU8
zes%c;A5A!`>$WACG3gP24jO&9L@=r#wRq03qc&Yt{A9OE#O*jpJvZ@9j|oy=VBt$o
zePsO59Hml<r~BxlMx!t!Enl{{2P9=7_Z0)|ia@fSP9eb_x=%I|!ZdbhMjPZ-aVfDt
zGVJ-L&dRT(da0!&a|!i;L7jcowgZ1;DN>sSHn_6~)a-W!@w*(euynO{z((Xn4q_UW
zv&#&7CvtcAYt{=s!I?sV7{*h}MBVik8NMF6O+<11E-dc%lFBQ0fZoygbEv06-pOlg
zLKqbnarp!+OQ!+YR;5w|UNe2ZC3|y-%&JP|o{R_lozj?d)xw5KKl@4ka`D0<gqvWt
zvuEGsnD3zP(}*&|>jL5!36p`jJV<npvhBnT7KL^P>f`2~5-b2?LiI<~7p2Qyc+T~*
z6k>*Q_xN@68R31ZmiR+~f$Em-_o8+rf;N}LuHrMgQDv-%%$7qsNY#0)p9?K{(Bm4;
z){)m1o6AHT$Zsk$ARo_39`cO--b3U!jUsDkLdP=rcFC()n1=3Sw&>P1udWL`bIWrR
zvP)@c#Pz^xp+UaHoKwbX$8dBzTPv^IlGO6)1F{%9iJU2CJnp-5YD)vn^QCdIWF&tz
zo6Z37LP1yNjjlgCIQ}g|OLhE9aQ3UnEAZmmzMnp_G_v*y^_H47LCIl+xd;ieh8)%K
z{e+gS96p`xj;4C=O))}9QX?h8){aGscY{Y_u=2999H)${Dhmh=GdM7jy7wB&S0&Z^
ziY7~bKmKlB;n$sY4{;&vr#08lI<9Owr|KzEv+~Y4<V-;a`vjPBb-YzM$A>8X@GIB1
zwe-IQ!DFg?5K7BC2QWEwR^2zho3j;%>0K$pz*^e2&hY8JGVEM6FZDj6+@p35k=uI(
zd#Frb$}uhYEGBSqkvX`x<u%VH8mubdI}GJm^;LUq(FAW$lMbe*RA4<Hute**Ul(w0
zQ|Zi)mLnu$NWMcLc{!F@Yb@uB_y3aSl=}0<rFK^cZ>+G539)$wt-5~Cx{T4Ju!Hl5
z3~8Y~twu4gW%j9pL|Qm0n_l~V4X#UQPi7y1Fu}>vLv>g{OtE0B0i6Wa$A=skJI7I!
z16Kh}5sS&10YVTLq1`)F?Mud>!C0urGs4PDdiHIi9WC5z+7aC?9yA-kQCD~s;$K_g
zn#29JJe4qa4C3t;@r1$H`fdldoAlB(KTKy2@*}Z#5-QybO~Gr7rU>hVCi!E}2~(Mr
z>vi7x=SsJ#rchifj`FGT*gyIO!bUiBlNK<E=efDEW`PW-qr};)`AWyZo^OdUuKB64
z$fjHP$Tk$Nw~8{<w`XtP2?&diy_1MwZy=?Uq5UUg*Bj49WJ|OIyzR3Bibd+_s<63k
zYy%uA$gcjn3-B*q_!mKrLnKioJzSgedLY~)ie!i4&<)um1l$)6kseUByZ0uc47v&=
zZko_8UZTG3IcZ@U53ALTH}u<ONG<;Gu4BQRdRR~jqn1yS@l|AS6MiDegeWGcA2WAC
z%?_~4=z)|U;PN0=g#T8%<@hhP+ux!s)Bmg8vT|@T|L63-TeoZ+%pCtm{02oYX8Fh2
z)RBN*?2n<dsfekuorx(FA0O2J?fANHL_343BwcK<Z4=Oz^#KsUGCR9Txj_#y^dT@a
zz;HUVhbJwNO0+JJ<`F<hP*D=nQV=TPcWj?#`F#6T-)J|kaNjuXu4d1=bpM&^0PDJU
zh0rd80*W~Ry#pi#h}4=WAs_&NKsf>i0u5hVgE6E)KihRBVl$>#01ow+{sb37gaj?L
z{Uc?t1giiI2+s594CoI6NPq|#R|bLrfdBwB`~yZ5hXg=c_bVL88wPg|_ZQ|3UqeB(
z?U6_eB0evf*{ubDgCGYWp`)94;Km`iff5}cFyIh?j&cm{*ii}g*98EBfPjg-{}P9S
zqZCJ(kPXb;-Q3KCzdY{`6W|)NzX#|tq!9P#TLO-J4BP<pjfR;6>lFHl8WA4?V{i`k
z_&jD1SS#%6m!Q}i*#im^*vDfh%(3UDK(bfHHOQ-hoO1{o_yMy12HgYv)Pw^V0)JQU
z;GgeB>fh@P>PLVWScZjp3F*fLcxFJS5D*tlgg*{C0QBE??e#Z6haZyVS%Zdg0^HmI
z@NI<yD;v82>|;m%PM-x13~tZodF3&n>oq(2Nj@=~p0MW@4X&g{iMc0uU(Q8>fehKY
z+)n+OJ?0uj+_8V$CHKPEn)zPEaLuv(6thq3Bv;Y>2Y)gm@@SU{i~@=P76~0584i$l
z4NwL@6#t_RD6G$ZW=DRO`eqgi(1bkzYv9KW#sXjl-~C1`<mKO;2Y|AGjOG6=KgusJ
zLV(Z*2PO#kCm)W1W4^a>H!c6!FWc@KAMycE1HkSK90<Vg>-)*fWsrdzWNY|k_jXr(
z%8tmcqPS}0%lycX6BPx44}hiCAHiQ;KnDZ@01^@!P(&0I0Pshq2s-r3@`yihdH)&0
z|5g8Mhvxhyr~5n3|1egF1Mp|6IJzyL4&~P<QKAhL5)hXOe)co<vP<~GpYbzs-^=vX
z%dK?h?C^GV`U-vf^V(m-fWFHgj(zS~U~7^W(uN59*_%%`*V|MH+8pH3@!hJ93)&MO
z#Ix0Ztp7LIqpZ(6&$WXAW$2E6<kOV>y_gjp1E=Eet^e112Y|bvz@FcmEeM!H&s(7T
z*4%w7v}a+iUy4eoFoJ7uFc|?25CCz!fqubn6_67WcrFiHbVJa`7a6l}7F;~fRtSLo
z5ES4NQKCTK4GIVn;5FW$Q-88Gg!9u8>8lW62sxrlal;O2OXcU|Q+q|B3?4;@g+1C|
zB9wbMto5fXx%XnalaJ~vz-F5yF%g|N?DF<gGBkHYGZD8Vm?vJ|Yg3x9w_?hH<|Y0g
zQupFQIR5gxNbS|u&%k^A_p2xN{3XU!-^T&&Tc|JCfLB+jBldUd_4f$j%o=T)F8uoa
zHt+D5GjzGHd#~D)<r)3YBb}qCu3e#+NYHD6cOZK|#ST-Eb3%0=n|WjmDE#oGK%c0`
zo|E<c>k+W&&WCkLSZsR)kSj8X^xVlLP=vX%FLZJ!5Z?CV%fIP=7<I9fyV3jt)PG9&
zyLf}>s5NOaOyru}I@OY!IT&FCIlaspp%>5N&VU4V#b{nDP<N<`uBZt7%ZZC_q7XsA
zD-sArce@^3ukqBWtkx~}b_Zj;4J^&V&3-Q>7awSgQDrnV8&y~xDuR7D)TT4~2zN3p
z`n6xn%3YswXP=Z|^etghV4M5n#6?$X(7h8&%9${X3ll1?ua3EsoM_eQ459odRgPms
zN}8vq2fvprmOdBy+u(k`vrh5+Fdu8HQgVd1<j?(r3GgA_;Kp8(ZA`2QVkRn6m{5&7
zCh`v#V{Cx{Du1;nr@I~R-1n(){w;3(I&+hHMdXU&erz6ou6~0FsG4uT?E16siRzn&
zJ=1w4*iw_zlczW?aL~|Ge)$8gka?EKd3m+3Awsm0t<WRUw*PP)<iND)6XNKOx?~3A
z%^WIaqBQQJhvNW~R;xjyxxamveA5nS5Hq!-d>tVs{o1nS$cvJnt0LNa4@~*RsZP_K
z3VlJGJoc!Yz-7Ze{@~(jqQ*Mi83(J2bp@zJq5gV`*3E*ZX<xJlnO~05HuQykLt2qy
zW$qt_m^mqj22^UydB_Y{5!_7bD*nUQdPr@``q>j3c*}-4QWe^hOUQ4+Xk*z&R>O69
zzb>aBpYU->z0fHoP`h^vjqMv1+5^$*o3E&W4+))wkxnP?PZvHpVxvIKqu0^gXLXZ-
zPm}9E&Ra<Q%XqWT2Vbw#l@{p_19No}5r6Y#b(slj*T3|xP8;M~_?VeW$zgI#ek*;;
z@GZYE&LZ8a5)8N87-AB=o<C6=bZWjx>YyJg9p>>QKNMeI$B>qfd7@xH)h?!Ah~w;G
z@7j<F<t8-1L^xmcSS;5QR7|mB5?maPu5$5Zf!aMtk%Lcq47ASDArsp>9N|;@c}5BE
z;h5QRE~~lR3CspkZU!8YT6_I}xwuE1-PFg1kuEB@(v5u{%yv5_AXUDy*f;V3!wB7C
zNU|V%o{zKnJ3t0dY;G=+2|%j&Zno?17a|gPb;6lTz44igrYm~%r(-NB`EI_RyXb{l
zu{LS{eW2P_PP>9vS)qp+%Nl54r{XQn_7vS}%XWEx%o#(kj|!R#uL5EU;)^u%J3K!W
z#Blz_SEZ<Q;>nPoZ)j@<Njr0IHnz|=n{Quqaa*%9gwE!dk0MdeLMyvw`ha_@TGQtV
z*Iv*c*9dVj>-F{cn6k#uGi|#uDBELr8S7!y3F}xZO5h0WQdThT-<JlSdN6Q$hEzGZ
z9#40b7P*(%fS;H+l_|Y8&C>+#+5abWUF5o#nMP2ayr@)p;-=TWyjb&kQu;yqW+&NT
zl{Qn%Efa-1ZOc2?E2Pc{4dRnww`;OHFBZwrRW02hJLX2$0$2F)YUG`4Q289mcH{c;
zmz$WH`*PcH{xJ_Q1GS%wWj!EeM98u3X}tYu%Ubm|&@h#!h4w_@5@N1P2C!RAN5G1`
zdnbVW_LijEQ}zUhpyDThz)Yo3iNzO`+=+}b-N5_VHI}gbD05?ao5~hC-z4Nl2jgX-
z17a%#h*b0eI|*Q54Uw!t1FX~r-V9`MVgwzYmSy#2hDr_&ufFh*-kCFcmlX_+;?^X<
z|3nQY^b}G#5@<<5(y|@C;O}iNE0M_eqsORn)C1213gMe9zi@ll#+p@+b|Ph5OiQGr
zJ(75i`0JcSIFD?%{ms>4Cr_TEW?Y-D?CWQB^v6!ojk?B;n{{@99L_xL`K%V!l<q(?
z4&J8ovy$+HKp-3Ijpzd|X4uHWDzTM2X_F@b*%gPwiHjtoQG2YkJZa#rI^Wuf?12Il
zFpxf867Cu|HPfE5cJPsE>FmecD1DvuhsbjpNV$)fAPh9gJppxeaZ!8KV+@zH1clWc
z<uwG`PEAaVzo{%=)RIog$891lX*3@1ac5jaaiE}IKarpcFLXm%@A*fD(_|nD-xVU@
zv~K-@s@AFWPf9whAa9+V`eko!XGWoIF-s<=g5r!`8p^l(<3&V*RTAKib@vByzipb^
zWa&WXt!PnA?`Ik85Wj)q#<^qK1gIkYA`zLxYx{7IdRW!iROYdBu+cW-^hu2`e~YfR
z3lriz=HfcBp<m}fl2E0&Z)z1mQcwd6LJ0a9@{i{OgwlwvZ6TOP*NNzK!ZdH_bk}}e
zM)>rekR18=Nf+ma&;%CN&y;m)2*V@lCV4e_H^)6C(PI3@Szb8%pK41rNN1_jC$<D^
zrgQEqSZq<?3%Kd2b<jw#y6N>Enc%Oryum9CbS`<wV1phzuAupTq5Y`<QV#gk7I7rE
z)UR>JD4&omsTJkg_1WZl^^;UqxuFfHCpAOTC2;SaT7yxtK%dj#fwQw$_7_ctGLjqH
z=`>vpRg#S(=0Sn5v%l|L54T#cv_Cf($@?Q<JbJ7|4_~=&VEr{OU+U|>Xu}b5z8eQD
zFiKY+$y{eMN>7?Gk?zQ{)WZe#jD5*0v<SV#j!CK|Y7qnEn?e@*TP$S4e4gm{q3{(b
zbi?HEiSR04v*RyQ#upB0#U38^=<V?ef%i`xVG695a6^5~9{G+oTNNV>X>%kVhJKqr
z?<+=6?X<H%LDcRsm82<jrXnIdgFG!OR%LC~yj)YgBcTpw-88H=I1?8Nrj2u6t|*j!
zoD3s<D1#i+y(68G)rYF&QQPwK#HZMgM06@R2Fnv%uF;&#-zS&cCGrL&SclZi`}Xm>
z+LTUF#v(-c6RryVJx?<MdJm2U*9vxqw3{NuzD>QP5kN9Q(wSET_F(~4KsLO0eXew?
zc$6-7uo0-9KXhw){BPrX7r9UP5k_}Vj-5k*B12U&5w%(|amI9H-2F{g)no#mThilu
z8xLDxn#~|roAmROL0;HvF>ViFOUx&lx(3nu>^|5zTRFsSe$ho*305NW=EDOrjQu`u
zUN_};AooRd*bB;eLAg00V6j6a<+Y+wi9H%Q`4O@Dtpmod66%|SLDlzPDg|oQ25hDq
z!%-@vy3+&}xnQn0(}&#k+mA?=6-&Qd_|*OCT@`GGuV)6MIkFQBFoM6$tJA?HG^Qx~
zq4;4I8NO0$F5MNzp)D52p);4uFw5?i2N+2FrKK_#4MiHzawRXvqiY#IJvNto(F}LY
zVcu{ka0WZxRuY>V3whfj5_wrlIUJ&YE}vOE%$J^i*RZknC+vN-R0g)2HzyRM6Yo?H
z#+92~Jo}bK#3lgnzJ*ejxDwwO(KlTa4tS)zd_3#32pK&O-8Hd<X{9BJFLGR_qw>CW
zjmW8obb^6}_pM2GzCR#qjDGNSujGPfag-#5NFEHfaC)96RX$=)q%cS@z+DMx|5f(^
zr*ucNA<Y)xaOaHTb>L54a^gN87YNm>xUhW2EQSZJvUO-fz(V2U7U9Vk-7@@>Unjp|
z)2DpVGE>z@?_;pm?9#(9g^`x3@@t;sUizt{<MW!u9IRo!pX%hc89Rrb%CyS(Zam|S
zvmG_Xt<)`P*&Z#~w_TT-pDWM;{fYW}^;nx|C)~Yx%*(qwmIwQhTqUAi>$ZcpR()BJ
zo27~<Ggq6DXVDX4*{&#hGRPNduYj86sC~ah=EB^H<h8!6zNT~x>rk)O)5z^L|7FFZ
zf%^C9dVT6BtRrW~Y~rfId_m2uAW3IEVsVV2n;M`oV&^l=-sH#OEduzYAv=Y`_yznG
zw}x%oQ^5GNTcqmpSYwm4|2C2~L=8VnTfs2_nKQ1ZFb4TL7D6j9oOyC_3K3L4oL#d7
z-v(~IFAmusXJhGcKWHQBkK+%TDY0ROB9<UQ^X3Zo@tjvH+iK3@ttuBdYz2S0UMK{o
zgsffjw%$ik-L|J$kMVj)vB01PBH<-QM$n&_F40<@Bz!sJm+*?+&MtN|Yq*ui1ylu!
z2tOJDp;4mEURe`UV_or&0UUua`jW|T%XU`JqwMr)Oh<Z|ELoo1gXb5TPJ7_^JW0<*
zkahnt_v>Yy=~gpS_+9?{WZ-OAn*>HcR}P$cu_rgWk-VqJ8dNVHs!vzzbeQ@?7#gdB
zUsFo9L_;*Nko*E@IGawmGnVcjPL-)4F%?Q*y5%d#<@={ZA=ohphV$x)qVsd*GMnSM
zn;o=CX2W|-k;I<n)Ch6sTnjW<lyH+<dhdTyR~MxVij|=gwJ75IFnG}o3DO)_waBcI
zNU6?$S++aOTUL0VC3gP;uD6l?-E`Of7;U->et*rvFZ<U%TZp6kRy|*SQQS8Xjo*&N
zDbtoyh7xo!%64KnS@F&m6>13=*lEQpM9s;3d8h#Eqm+67hH#2=or?PRk^1iuirhCf
zZNWqMF&nFmE|1$pnn`3BoUywQvY?mtr05xQ$}7Fb21wZJZ`$UYb-c;-8S~etiD#rJ
zvX0}f_`bqxsx-%VZYG<DLQd|G#cHX{auj#_acGCR*{AKuC9hIXFq_vnH|#urrR)mh
zw52D#Z^Am=N*}Nj!!k?Vu<+4FtaSm-0V>anyAgd?i(!c9xUHzoBy)u=EjBUX&DH0j
z${82g&RRZJH7clVrycyoXImgck@IqO)ryqu9NzaNmbh^1nvko3&4-)2V`Zg1=+Puq
z-|-<>$pL=1o^deMAr>Ufn_1Ncz5WBsXTwr1M`*)ELR%1wbXu=8vV#mlmY44{-Dd5+
z@b+p){h};fuT<Qj3;XaA?bfJ`K03xDK6qwhxu{Cf$jU>((y=rzw+ITUOGz$987pqe
zPBvq>lcywUG^WhFr?jzT6pvk{l+%+aRr1~_C3bzx{8D?5wyY<yDgMzSBH=?Ud*q=w
z3A{b$K>L(~_*%12N(o8Yza)br5><8+j<5fD@FLHCYy*{UQyjlCG95!Q>%1aob&UkP
zm3yV%YdZbCC*GqdcZy$1hV-$WNA8lx1H}<6_l}s{81F<}4`Y~rG{dv!H#)s3dtefU
z)}Oq7g7BCWlbTy*8HbZNYm47~<T)w+1>(YuHN+C@*DJ5HxWoK<E-d97B!|@IdQdZC
zr;sNx^~+d4kis8PW1XTdQny1nW{yjke_+f55fn4`y(41hBFJxEACZ-0Jb3W;d@GeP
z*y)M48{W*h#4B%5m~9r0AH;J{UF$emq%$J~2Lhes^b~!?W9pG#N?L|m^-9!6ZB4dN
zvrCxx)mXUu2X*8vAZ$HK7aMix`UgLmju*nYgzorO#l@kQ<Mh~M@`Giw#|q`tu8nrd
z{}Is`Grhlep&(V+$+E6@OgUOYCGJuUuc@lsY0w<#s;H@pm!n|Wo}!0|aKmH@35}k2
zaFIm*Lp%slv`jhsx~&Mha202xzcY44q5Td-ECh0qG>*{o+X$-5rCPQ9N+iuC^B9sj
zSosC*%Dbv)?NlCxnDG5OS*BKFv&2_cs(Haie;zYEW*$-oioXCJL^q<oAep(L2eA($
zY;UQMQ3`Twl(P>)uZ;fF*+5&JG}*;-`}JYMnvM809Kp3boTy$Wm>is@k=uj_SC7Fz
zH-Q<gtFbH3Xy+}|lf@0*(oeJA{O6bdU@(B_bHE$<U8)8H-&<w4jYefJ%=t9>%&R6d
z?Tws_g~TrO*l|8nM1}0kY?hr1+82&I@E)CEFByX=Q#g!b`61g5=dQ7w7{VH0N1|;E
zsZq~L{XJKY>{5ZJcFC3GFeT1uaVY!~?Uh3H7~$X94id9ywf#Vw6oIBIUM<#s<gYQ^
z=k)dmDRvwD8a)N#rC~+Hm|TY!0J}<Sj*|rRkni*LgAte8CD*x&iCP^$KBAscQoQHA
zp(bYyPWN{HoU~=?$PppRL@In{CAluOU=7t3uj%_wnNybhYRL`=2h$AQEiY0VBX2C@
zxy$v{fH`QilLr?XR@10`OW)kAj!jDZek$uUlQ(8b!%-FgeUpckb9U)@dh`R7woXY$
zDeWtetw-?><3!?2j4xuUvj`9?{YQiA>Sep&!R!N&FS0VaR(3T>gH<J-bGkB<qFc6)
zm{yZZRHongdrMQh+zP>{`t`kZCN8T`ftuk$pZWS>lwyHv42WG_M+tRR6n_9#DcPV~
zBPbN*ND_ybEY16CxnhL~nZHU5*@ABGCr>m!2kRnaCNIiy;K`H&43l_7MzMo58M6UX
zveNju!i~`00aj6^VWJ>kH=7Hevzv)tA`sF-2~3JkHEF!i3>MD-p;zQXpoK5il<{I*
z6zW3;5wlX)nqzBwYnB!9#SDp>uXI+E`W(d#`!g*msw23zCHg!2Dc1`dM0eOHNn#Pp
zb51575f(Jb$0xzK%vF@%EuJyxgX-n7f9b@>_WiQn)J^Mo5KWrcJ7>f)@(wl0ozXad
zovaA8yYqw1{tSJF$kS87vLl)gDA4$3>9cg@&dbz;Y;HTL8=JmyPS>g5eFwX;KcLw(
zv=WcX<@%MfV$1^;42BIB061^Vt{>(7N}8kdM{t~LqasTmh-$sBY6ii%r!&*3T@gy>
zE6dTF2m#Gp;ekajCAApLpJprMSEYfsZ$UYgOgl$zcB%=cB(y5nQ27Q#sS~RAzw$O^
znpRYvK8m|C&M{l?hY$a@qD3|4x5*bnPbuX(-y5wP{N|6GV~s~OMz3ER+(GikvU`cE
zR@uV-I%L+2L+V~vPW28_vE#MHi3j9G@vP<z2TtsQ(w_R2T6<tEW2B--F979sz#to^
z3DtPKn0gUB&Lo*ocM!>M1`Yj5tJ#GXd}3I0-0k9`)@V$}wZ^_=PdR3u+vMf3FpDf0
zpxBhCRt?}ubPV6}<#=kJNP~MLw)7sDxO+UDK(ZPaR=-6tRQB|cF0xQ$fJ}7j?h1Mo
z2S%<lcBQaVR4LPakh-uQVd4#!4y6{6Y?kEEh~9EO==UG39ChBYYlHJMK`DBKtCif@
z)_d41lQLLVO}hZ$AaYjtQxBiG@ec8E#xu$&H-`2`LI)SSP{<z=60gVaUsL17;JHMB
z4qpWwxLfSN+r6+ob1!vF<<LTez}K(9g}yEkSN*t-pd;pI<i)90_}N_rY39A1?RUj;
zn_pE@%%a*#5v8~}daw?8w_1;WTSx%4ogPa7riT2<SeroOQ9n!<55(O|UhBy60;gE<
z(K671&bh<m&50{n1!v=qig>4POoimM{jmlvl!}z20yR?VxaY-nVF^U)JG(c<JH%#d
z0~h)mqAq*PS1y5CDs9sC+Qg36AH*CuGq*<up8)(ZpwapiGSol%Rv0lUM{)Xdp!aZo
zpXXe0<cN_iNI+t)BJOL`?_7Saqgwi5Pr}@XQQD-M0W`QSZAK$kVib->M<P3Uu7Bc=
z>E4n?_9%-#tJPs<^o2{<J^Wlu!(>joXXzsM&-o(K81>(2q`&Xr4#5FNnF6Y3xaz@u
zM=xMuo><az#IN}nv?mnLtN0>_<yL+L*}JjwMOy#Hg4F76G2GAA-CU&oJ+y!LqwRr9
zi4{AQEIGDLou@<>!TnJqqu%mo81Z6ghP&fiO|Q3q;v>)#T(W{TMxaWCHCv`c9;3F+
zbwXlgN_^NFGL(G<DQ5sDM=2*KR$ZUZ5kc*OzP7FK*q7h8L5EJx_Am0(%I5y$y))1c
z-z3vYog*+qiSL_(wd0;SJ>a{k1<DnW=`GKZw(^FdfDSA(a2@n#p<VGB@;{a*ey(F?
zr2mqZu`>L(w2YOF^*{L-69GFrC(D0M|2r+?;9zF||4z$Vf73EQWVWcJ;G%FAX{noq
z?d^rUB_L>;=DJR2X-T(Ipuh#(1zG}$FlWhd76^#0*V@w`o?W+@j~w2x?%H(g6L#ia
z>+42_dEV9iq?SNU0Tcr{2{~K3I0ykXUEOqS5P$&pb^!uB95OOpiUq*?R@^X2d?0ZF
zLph=!qp<-(gQIR)xTr4jioq-Zsv0-|TRnhQe~8vR2ndipz<}T%vVlD!0M0t>C8)d^
zP=x?aK?Dw&1_pC^j-?Sa55Jk+SO7F>HGtN-I)YLBeE>^w2plU&SD><>_!flG4`kYY
zH~`!<Qk1~Q&sr23qZWyxMhJwn>+2a%R}uUEJvO8&8~`_p1++Za-*m(lfx7P|1rW<X
zd`!REVV?oe*(N`nAD4^4x`-PC4sZ(_Coctoe8?xfG7%L7u8kizudoVi&N-ChOH%D4
zu@CUonghU=?%HqR3-yZ|ap_;IL0vKF)I8?p5u{54poTCm0e~zhD_s$I0x*DU!@Dd9
zH-W*+odG+;65t;P`PV{c1_41WXn>xZ+uCo06#Ft}r2Y_puFq@4SMKSrwBzh56T_Go
z1acCfQ#T(+1&*O#8*@%yFWu@6<jM8X7kfh}m!{^A?cl^RX4xr-i$e&-<kxUJ`~K&s
z8L%MGtDsO|m(V9bI5fb4p(XUEkAF=m^ASAxi`|0{e9z7dgSr2c4>rQ@>+$FtdK4Sb
zH3%TiUOl|_r5E=n+P<wFP)$Laqz}jl*k#~N{@IIp=w061@5jCje2?@@&vy%8?q-%>
zp6msxF_4qf{X6V?6cspGAA`cGtl?+*o?i|VGYz~iGcgssZ+s9Q$Uf*b7$EQkzUL?V
zloR7!9rq_v)wLlM(3ku}_vS0_yJr209<lDTnXt<LN3I00GnEdc?;gJxJLpv~<;Ab<
zC->=FeC#K8%Fq0*m+H%pTFKtU{&jHno_zo35S&{Gm*>Z5OL`U6qZjPF?!(mnUB3eG
zXm(pQOhZr?_h+>-3S_r7s3~!}yNI*>txdq&ZzCT9v<!UcoD;>;@}u<6chkj}9tU_C
z@)0Kt;MZ4Vdn{1E_o!R1Y0C3UE#go&+mCYq;tO@y=OK}w@z|HrmmBWATna<w?&jzq
zJpjPqzJYw!$7HYgCxG4c2WxYn`)9r_K-?r`Xcs)-*2^VyU1-09uYObAZ<PFP^NtJ&
z=#TazH~^4${2TQRK?7`j0)q+w<PF|P{oL(dfS*0WAN9%~d;486RQfT#0tmeJ67U1O
z=DGu3dmRCYt$qI`001ER0ll$y`2zl4g`m;hzx}}c%HRHY`;7i^#}*{OLy*pDw@fRx
zsMB?^pPZGllyaMyMr4c%YRV1e$sz_V(HPTvb7))!$-b=eScZpk;@yHOalOJ~qT_c;
zF_Y_Jx3aM2eVgI5L~XILpgkzLnZcJK^VC<Emq%tP=wg(J&qt&Td@0~5jUl=0OKEEO
zw`@ps>!G&In|U@Pqf|vuhO|&HzoMv_RV*e&TJ_^2i@k2bnAbV(C-qF@HqFRp!8^gh
zqe>j4r&@J|MBd*WXkYASZxB!x*1^oAFnqOqLTF5pAfe~%FBNlR81g-!{i)wBYU_nL
zw1XBITl`$*DV?IJ?5k#tvuTTSlRj5Z;sUXeL9Qw8;P=u|MCPbR5HA^YdTb}E;WG_c
zC~AF{D$yly=2j}4+>tWzJJ+fX2&wR%l6Q`(`L<V-Q1#+mL7VL>$RqU9Zogh@k1k<d
znc+rmd{!}qSP182v;1{gUFABn!7mhk9^jN7D*~LA&S%*~(~WS09_XJ23>E3>a<`pp
za^&?k*lzs}3lTfr(erM#li%1dNjuf0BFZj^DC|<RLi1*V+R?$a2j*YaDp405_iX2`
z$@x%mugWNU;vRtVne5WSd3#Ye3pXk-AOhIPdg;7E?4LK$ncjai)nE0}%biau7}3l}
zu|7)H$p%aCy$)*5yFF+_1sBu3^4Px2Hv?d?&$8}j;N$Tls^H(TC7%0fK}T0LiaETN
zDBx6O76_SD#A5L-oYv;w9ui~P+aCE&Y4QltNV8xCIq%@C$Z5)_6g9Y*e0!yqhS{M;
zst(A@4qhum`<J{}vL&$+K{YY{^~-rY2++_Oxal>$%D&%FP|7liI9%-c6%BSbwgsj0
zawg?3&};OZd$B&&eXsfFxaQ)x6!LL5T7!Cb0ej{9&qbNT%263`)g5r!I>s)%YOv*#
zIFOxsxrRTna`&uKVD_5!wnT1Ti+aS#GV+;mw~A^jr%Zs?#d>7gILC+ZTbFh!&IKGx
zo5kra7&a3|=AFu8XN_969C5)C+NCpo`b1>gagMrGm&yX}U05<_=}Cd}(SKzp+K^u*
zCc9cST7;{J!eUpX%1e1S047xmx~H+0@bfB@sgRpt_H$!lTj!1%VwuLrIh?UB1%r;@
zLhUmr_Ur8WL<x4;Z?iiN`}Fa#$+O(~?{y05vd-o)(@0-)Rg&OTPYWB(d5V>voRd~Z
z)O>oB>V`fG1mnkjVYwLxIittLi?y8*H0_(V#qH_%WMrmSi<J7+BUq@)tK$<`4ZpDI
zx5gR7=m#5rO+*LxE3u~77-}VLTR)Bq50*h0(errqEdo_Xn7-&i)=B4v^pUwW-K#E!
zQxQ6alN?PhiFUnS=w6g~)(dkl>oX!pJx9ZxO3Rp)#zc_?{~Nf-;uZABl)vh?68=Vk
zPPObPoNe#!1>q|paF~FOO`lLqduf@o!L_X)fzjQZrG9`@$KEye-JTC%wn(Gx;(N6{
zK0grOZU{EnJA8}Q+U{BhT!XiHiHcA~%woupkyr$TyT#z{^2p4nNQ_!~@a#q0W#^!W
zX=k;2Wh+b9W7t~*#q2WjIo=fPVoe#+!lVkWDdaUwyL?O1pn+DLG)}Fu+-SgBk{MgN
zqfn#o<TM%9He$j`Q`frFTS08;g2XbUdh$8^d@5gNx6@YQi-0%?4=cHLyn!nw&?;4X
z<+bQEC`+DC`xmL=l}(cJKul3fq3V(+W0%Ondi0)A^7D9!xPjr5UU58=f(bWMK2$5;
z>uhLz0QyHI7MmYd*8>e?ijjkV#6)HlJ0GYQx(sgYWc9$KpIRtoTY!_mtcc?mGx9K_
zq@Uh}B<nv6QzQ4ojDu-}ih$7cDriifG&+O?rN?{9-Hyzk_YEWeb9VC9Jg|~ftt{zM
zGco$=yh5?{<$xRVuE$3YuB|H{jNMDW8YZ;wCQt43544ZAS>zR=FdJr<gC*dFr>8<N
z58v!Pxri9Q5YHDE3=Pux6*eR&=E@XF?`50oGtORKgJ}y@TbU`c=2G~@p4iss61y(H
zZ#+#h*HTbuRO!@|zO>jT0Hylh=x#l=#pQU*==K}||0#85-%+Owziy3YTVtZxBugtM
z{NlTUYV`E|b>^9ZK`~kmo=sg<<M6XN<$UgT1I0ibu31PbO+1I4Ux?0#Zcic(;os0g
zk;~F%mdxywFdh=D)|DY9jrYI~y)5lZPe`q<@Yoh`vLt5p+g#pv7CmoGcGkbR8pG{X
zW<@^-LBno*gITGA1gnPJN|0}oALss7T!TAs&2263xpwb|PfFCY%&UOshH&Z~QYyf5
zhpjp3ya?SrJ)QdD2$qi_RS+5w^jG1rkhFONBtFJ}7b+?36$`UC(}^S<q++!z=#ro*
zqNq0bOFj+URQjnS?sT>NcW4w)QKt<@wE6~3Nn^1#kxMtWThEgdkm^FC|D9KgHux9~
z(-%_7r;Vn1cHZNc<Gn3&Ra;t&<hWGH$&+R}J+|tXFC{MO7&R=yDQpA@-|HoK(!yw$
zs)8c?VmzrEX?vQ;(8X2B$&RxPOszOQ_2tse?(@6!5<v^M(;h%|Q8;C1erbX+NYto0
z7d$mFT7Q3^(E6!ULeuCJj01M^pV^l}I+I`3C)EU$KeekcNkrq!ICf7{63aQ#BdbsF
ze9LjPy9<i^xq)~x`_s}ShsaOSdR;r-O&&v&Y{sJobJ?`5)J?eK?mYWWS;DJ%2=zR_
zpWp7%^~|*?6jmp(#>L461ydTkSqnBSeN56~=Vez7U#~>^$E2Epxlb&F84Ti55dza2
z%FNf5pOE}+0N114FDhI(7ztbT34$7J<ckZ5-IF<RG_@<scr4LG{3r7TxM#zNKd(K}
z+k$!r6s$91p17sbL^v<1J&?_F0*j$ee5M`Dk$Fm%qaJ@@@T-C)g=0-GRqYo=A#if@
zAX8cwM{j3N;Q06P;1;T-R@6H&PhVIRp6;M9_%-EuAJc2a`Dp4A>o*|h(dl0@4zq9O
zveoXa*F812)!ev;t$hzu+%7Ib;1|4#YV2+aAF?hsjfv%sTs=4BOf^|!)t{FXz3mC5
zFk;eT01`T9^3CTz3q?oNK%{J$Bk%G4VKie}KmUD9lw^j;=jnk%s{J3v-XTh}CSbEo
z+qP|IrES}`tx6kj+O}P3+qP}n?5_v+b`SnR4`Y1Rib3rC?4vlF`1@(Gu2wOoQLpbe
z;D^ZGK6|}jh5Y=(*^P5s-fL+ByhQTaSpCV{;(4U0tPjs~tTwA);Ty^z>W_u*O&HpD
znQIe?pxt>8#Au{eIG;V%>oXgv{&(^28_u7n{Lfq!yBRBneymV^C(Dc`)g!P5JUSNg
zt6Z^C*b^L6H`^dyzGMa~|G+g35Q|Vc<N;YW#iuD7WrJ$M!!ZNqzbm{6)m=xF^;RF-
ziF28MjJkZ?KjqRYH(2dd&8F%^-?lcThhmSS|D{YIi#WhGos@6LwY6L&ni_ZKjNXm@
zFqG~K7e2+r7d5SJt+&#-R&l^9eZ;s5uuT06Ip8=wPJLXWj5%tEy1fHMVedIoA9<qt
zi~vz3{6QkRir4Q+zvATFwQNKMJ}BfD^HM^^b@Zrujg7pP4p{JfDb_c)VRz!!w{`S*
z^g=6Q&D7Hpl-P~+=41)M*X{zNXH<M=%2>R!L7A)6SmSYxSmUssX@R}>1(<AwswQsx
zdNO%RB_RwY=xl@e;0?Wm3IAOoEGbHf>aNJQ-Nf&{KR<YoZ?1-Od4rA`_n%f4<-TPE
zq>TI=vZ|3TZvjShEX08xk%`+P@>7+5M1q2pn@C|U9~MhM^rMxJ8eS;a76Xxoj*JvM
zNV6DFh`Ju9Z9^W5>bmnb(wADl7Z|#T#qJ3fQ8w50)IX!9D5zTEhef{>s6);d^9Z6m
zbngo^!Msf~F$=I6N&MH;s%hiT7@B<g4-LTx!IUihYr2FrDVI+$r*L>6G&fuZE7w}T
z{tbk+rp|+MAA1baA&_vHPU^{bWQaJx5#CatTD-`W77Xgd^sabxf4H`~*T4s6bdpzd
z4A$gw%lHxI(AAAK<R;>K1!+C|b&LZYZgIIj3=urq&5Z@P63`P*W=DQNyu%>_a}bZe
z3ujvyuCFDVJEsgDoM9?BRW2H<F#5fh3pz87Y-)(4e#+z%d*?u%uBo4ksBV({0pTou
zZsrP`I33dY97`=V67$-WI<Xt46e14z8l^o>J{e!XR31ohwPG@%ZWgV#uZ-kCdF2Vz
z@E&G`X_<lLn^%;7XO5bV7hRLk12hl2|HMRvy%^N+O4*^1@2c_XdUnEU@MjPM$|qSo
z4tn0Av8R~2A&wCN4&$RTYHXBF_;=~GeKs&+&RXRuWYWZ&kF(*JHWXsC4CbE}J7AyO
zIHuQ*1j`k5(s7=|Q^*)SPFzYZoZAuN)F_RjqOeHp>=t_aZr)6R=0QFhQk8>oW8^v}
zVlDv4Q$w7BplAs3)RIGB6~3KObO!9^Bn!w($_A__au56Kgcu9=R#B??M5}fUSdoP#
zRCt{)-C?K%jwC;6CGy;d_!VoZ@Rtp18I*$<o#fL{%raM`>aV)aY{{GS|9Y480z1NV
zY+O$JBR@E8=iSlmtf^p=c;nu9c%SWvcHiCw@g%59ZI6<ZW!*gx&!h>FN3>;G4B|35
z0esSa9f;6e)A>gc&0ZBq9m#)t;kmA$A&BQCejH+LZsn2AmfA}@Qw}&9!W|B6KrzV~
zTVKt)2%^NZGRRu`zHff%)ugMTAW8i9-Scc=$9gbTn<A~GJHJG!g&nC$8Kyj6?#lh+
zqM4Iwgou8wtotzJ9mO$2<Y1}Mw+RLiu{h6;X<8mS6}!O4%W7f`i_qw#oE(-g#k~b-
zNuLDTc%umItEr@DNVDC4%vJL5`?eQNy*B>X0QVmrydA2ugxj<zHve4cE`46fwnpBf
z8(B)&YuF}?Yz9jWpigmpcBc?jp~uOa>3H4$<QJ}nQb1EU2G|RSGwMGg9&4<AX7B=z
zj^R8*jn2+nJG&YG(W*F=qR{C%@Mb+VfnICO9o+aQEWwAVr1~J(BEr8|{g-#mDBInb
zY&dLYYq>nTUcp(c2{fI==bxx26HSn*!zq>QV@DO+P+)K}H@|&QVns(^Hlac@ASg}}
z_-Jo4kh=$x(`HR8;YGV2?}&;t+u!gKy{SUsLu3`lDRTj<y$CcgYa9NcX3S};`ifkU
zSEj+3%*{@>jL|cjH5^=i$bL8>M+^%2u={>!cCC>sH$Jd{&-sCx<j);9m}Ye}uALip
z>!)7FQqjujS{}QWM!6UB+)DSFV3tY^mcfRN8#ngufCypHapQqj75Ua{u-wYvIX-||
zW#hia$~%Hicy|%V;n8+l9_EpHpQKltn36rgc}cqSX=5fu<T#wnpvoU@Vs*fs*vU-T
z$x==uist4}edPVK_Z`Y+uT_|<XyDIC7dwr8A8~=A&~vxd-!mpWAqDt0)l}u-pP;5B
z&K`APYYJlXtlddFIc&L@sjlp?M-qud8n#xIZ)oh2%=$ERpTVl=B4@TYw)e1VZF^Xk
z_e_xPecvx56H&K|3oZ%C`O`#zX#2xl>$PbNQEkpe{;<8pH3w8_mSbRnS|Pn(^gK5b
z+$W5T>AKJZtfR0zyrBcG#9Y+5#Yo)y)!`c}gOmD?GLj(g0%ZT1^VX6Uq1c<wUFYM`
zrj8R&Is>muUI^PzV5n8J{j>qcr*h;OFshUI04K2_e~3B$)LHcc2WT&YR_6B7;HPP;
z_9&AcIZI9_>%o&cwEvsvY+Ma2LJdg)p1}z&kSIVvkz7lEP33n^c_BL_Xf-xxwxzBv
zVDKC*I*vqg3|gu3smjsBdK8rftN3J;Z#+bLPY?&Sj<_JWYi|;zrAuLP%)!^EHB0V2
zEl)}ln-*F7w!FJ56QQUGc{7ElJ&k4W-*T^IjbC-6r%k5Gx96rYp@I_DZyhn~woxHA
zj3dW=Lt3nzKBtLJ<#yLRdp2aBMFD@=FqtMN9BNAD9%as8-P0!FX5_*se#E<T#nV`$
zf8QxOfcvr(<s`R1t!TAt)WA8?R+U={hIc?<u9QRm7mLt@Cv_Lf(l~T|e5wvsDohf>
ze=~XT4J!sk;hE)RNrl0x_Pd~{pNBOJ3?O-@7Zt}to6ztMBc#QN2KNH|O03P*uG-+1
zbM6IMT$0|(TcZ6cwMwB6%*-sJ$fIo7_o#V<1zrnj|1ggI$wZxH_#L=VzOF$3Pld&v
zGsIj_CH^Kjv+hOZt3o|2q6)1fy^@I58`Pp-4pZUU>7QSw8lvvK$_!oW>RB(Egp?0$
zOs1cwR;fa+dbD$cuu>e}b6J{}^fHU`3cM}Ju0UI8Tm)zp)J8@-x~uQ8T&%X|E*<7M
zlM-_k=U?$t+;I#tBOTpZ&K`jIXsWw^VP>4mJWM_fV0K_84RbBuohcwZ(&%CPN0pGR
zh-uz8=jN4ex+dsDTX_<7)SmoEM!w%V(Vx;j6Vali1c&(VomCA3x6%zFV=piX$x=0s
zbTe&~V*mI6i`WY$zDPTZlG-Hlb>~5hrtQ>VU`G(Su-}i76P(o{t?xC$xSnv6!i80p
zw+^nIS}pF5+lf-Q**`!}<C-Zc`m2z*lCx$kWl)5-5CS}8N^>5v@yGNHRmu0(p%kWr
z<+`N_`dDzR3KyWWcSRTF-MjxS7y<@U+PYeL9_siTwGJ|)Q%Zl@_yryP>q*1rAQ5bt
z!CAg$_A-5vU)YQM3}k+qiijSik!r}zU0j`$E=GgI4W4aUq+$f|y^W0ziw}jj2N{3(
zi_Mm7mKMJOSy_#Y`4hOZ05&@;=WjPF6gM70P}GwNPE$Q$QCa0mQ`2weikQdm3&B20
zsm_M^r!)|MuXlCo7@e^p+WcZ70itH>yP{&5IXN;qL0IJn6RN^RrpLrvcx+h2T$ay*
z1;-iBZR)=#vNTOjie~!sk=j!uC3s+~O%!Ah&r7~<ziO+sOz1!4x1aFa?*gFb;p)Cu
zivTU6qiDef@{~jlv8|C5(f{<P89bW!5A5jv6)#zj@QPE<N8mDd0)Qy-<{0{m=lv@%
z!Ov<7{U+oz|Ag*WZO)1I>?32T!M{wxZiVHAi@IH-_vgDH#)Le&_K_wkOX@fD$PZ`m
zD|U8_UXrZ#BMUq5XXCDvn}E#<qpat2y;FqCcQaMWCY@xCAAWm~s)eA^H{a!4zJoOD
zKe;gsYt1b9&(Yh;vttH`FjsTfS2cUlLwe%^6}Kw(+(>WZPBqn=<5(EJJO>$Em@lOF
zfyz;=O;(rky9*qnAya|xmk+q1H)08;48qev_~K!KP;}f}3C78iB*{n=>Pz8dh7HfM
zZgE3dfqs8ko0n*%Dj8^vTWAyNt>%E^BJ&|9U(NX~wjNG}>1|bY&+NaJxFU#Q|23xL
zpt9E}&H-=E{$2h)!hV6EhK9mC<-Hmdy?Uvk^Wx$H{yUM?0~9Va5ZuFTBH(QILK$tp
zU60m2@Z^;>XI8B<+c&x0WygfxOjOtrm$LM5H;U?Q@AL8nQah7Hni;tAnjuhxE%{j@
zN&mPkO&~;l%`M7K6WpR<YUZQ4<L*<bX`^VLt$0XV1@dh0+|0zNIC8R^sA-!s=GL-=
zge>tvcy@BvvdXUfmAE}FfsE=;reU*q<4v|qqgD84oxu4u*2t#N{pqRkC?4fR0#)rw
z^PhfJ&b#Y%<K(Hd8`giX11DU4S7b4D<)?Dulhft5BIsoQPCYHG{od`+B`mGGsQ^QS
z9ZwgV{v$ii%^Qie?NW>*@xt1A^e9-`J{z}t_9AnY+;-+2b#{|zp(l;OKJrO5=DJGN
ztYV&_)=>&kTgDFD{!q51H$iDISP9}Zn#icvw}V&`JTiK*)6?y?&l7NPDhAi};O-%^
zdS@P{cBy%lrc&lUfQOId^kWw<rZ1T~FalQWh%y(kHQE^wMU)fTW4mzJngTDXpQ}*C
zu0zZZz44t4!_XX!f=$1}B3AqHqwl~YxNrJYHOd2B1IceQ!Wy4c#W7VrNc?q$){pK{
z_3>R;lZyQ;Zgpv*h&u_)*L!Y2=AQ+N5<5a<1QjmN`+!^&N*RJQ^1tq;64XS;X$BhK
zMQoyRS-g;Gm#7w}0~Ft-3PyW<`mIM=O9wE(oHRQq)V!4PrBTT^W5XugPnwdE*OT%+
z#l@Iasf`+X2hkqru0W!yxGe~Fad<TzlEunYKW26W>sNjXGZr%gfewnHr<PJCXnI06
zQ}uBAR_sO3w@DOEtO`oxf9$0x(;I{Iptk6@(YB(P#+)$@VtcBid<<aH-&ydSw1o|X
zx<F31$Gml|1I^t+^5h+o1QWunhyo^+x$t}j>TFtnk8H+HC!4SK<o6xL)mMQ8Vou;Z
zH#Yjk$3h4+pWNl}A7@7PCbC1Xtm2WI`2~Iox2xojYw;|1$>^jo7hSsB6#@?2HlFEF
zEA=F<1Az8dCGuH6>Uo9e@Ky``;#~TV07o0HRnBE6%iA|`>sE1xkeDNLjExJ<ABwrd
zo+73(bOJPgXQj?00k5tST0T>C*pA=#O}d^-XCmd^>Pc(BNw_6DUCI;n3~^#cKE7vx
ze{)=(-N&W8He&o*<q@r3ywSxn+DG}YG^qE|*Le}sb37<ylqR-U6*o{vQI%Cq_)6b5
z89)Wps46}MU8ap_T+inB!Xo<s*c+hhZ|kl$9dYody`CzYmD-@Ed48OVpG-Dw(tR4n
zHB<N0dqVa2KLN8`c3@&ydMbj|XB$JU4O%sED##9%xsJ5oyv|fonuW9OUHqsyek0Rj
zr55WeQWJFFEmIKL(?xpaAdZKDR*JGp(lMyIVXXP5tiG3i#43wC-z=D<Mgq>Fgoh0G
z->{(s9s@lw*vgRwMgnfIuwDRnrHe$euGH7|g&F()OlHu+ejw>$Wy85*a}d7nuN#}Z
zKgi_6112{pwWpXs>*Y)-md{Bpo0qp}!G&kmJG&<1D{=c?1sjRW09JGE73M5=RIS5X
zLjCv#(|n;TOC-r({F$^+usU<{O{``612eBpa}m4`asO@;8pLX|kBd6%ox60iiI%6x
z9$bH18TB_yx>JrFR+T+o|4UMg?I-l*J5j><uDUerAh*~F>dnLnS*MlE8rb^gAAHjO
zNp%M4$l|5u`F%oeyu=?ur4xObylxCDVg|2(g09ol?{9IH_sWmK`=ycWZ4fqZ2vBzv
zeHSa)zN6U<IW4utcJh0bY32}{Tybd^`|BX{-}3F{iirDZ>Q_zC`$vA>#6W9fyv&?g
zSgW5>aC>V)%|vp{r6%*tkP?$|X#|u74JsEjTq+0gG<*!QS`XI0w)!~ho?wba#XFko
z*Y8B@gjk}sxe-&Q+2*;qoCUjZq!~}wrJ0ILD3(-2E54ZKahAsVczn`*2o#KP=T&Q-
zvcXAwWHOI5-6U@ahc!_dA{%C+9XU!~BJ$=xb|dq--s5((&G)a!90`h2(dpVD_{|ws
zgh?8PHs!i)744C+su1P%EfZptf|;5f!SEUq#F-mu{+5A7$x*biZWWAdJyVB9f|=F#
zX=pi7VD~2k{=Q1*iQ=>FggQ~2F6#dbKxDEO`V_+R5Es7jI*gcAwW%pr7h<m_u+f&0
zuj-||-5b&_`QMr<)55~G%s#m7cZ-am#9Ya=3xW+ytN<_6CBv<0xC(PxoR`X(@VL8N
z;5PplzwaV-y@I&Gdd`FE=pK*CEsL>U<$%~bqhs&m`fO3)ivCc(yxnF+4p8uJ$IK&m
z!RedEG67J-=Dq4g<y`@2{O5a8!(@_cCVe!@weAmvV*)9NfAtnzRV~tJ75MG0J1kwb
zt$$5gI>x^+%gKrG#gBS!^_V{82wW;10V%(4!o%}HAx}nEK>O)oMqc|kq?y&87r;^v
z9~+ve`m6O-l^J6{C&ChK%p*FbQYL?Yu-x=XXW|$%q_$J>$4mcIY~;Gb6w#atKk<yI
z#Q^0Amy0>RM0yw`!(<<s-NXeu273sJ>q+C<u~<X9iY8E>`9Kb@T$Z#S?gA)1N&|3<
zFbZ<mz9|I1bZea`l+xOAgoJqct$++(nY%ZgLpjI`u*`P$Dfq(nPfEK<<X)3HlLABp
z`!1UC>;>RzTyxj4$x$ki2cPa#<fIb0U+pm!sHKc3b#Yi{ho;&b=4ydkg$`#b^IR6W
zaXy<w@)yk?RJW584hvQa6@_3xPvjhXgE(7{GGs<O=Aw=1RW<5lrBY5h!j1$pe})Ij
z?hjh#(a^9_i`d~VBSs9cE%7CF^xU&rPcM^c#Cf<8>8Ny4ZsZ*whwT{_d>pD9Wk^b&
z?o%O=>W(%@6+xCem?6is6^(#76mva0;D3y4powFr4#!T{hnm}k%VOx-jHZ3ju7WZY
z?pU%ID7aR=W)Yk9HDzJ)Q;To6!QZTFUV^1bBh;UKVXRX!ElL4cTgjZ*vQ%5go@1x(
z?vv=$GuJ6#UyK=XPq=)x2*mFS@e99@$$C7%|C9W}@;}KhtXzNoKi!3ei2cu>|Nr!V
z%P$;%*jWFc<rg<_)y3~m4k{8^A>k6E<OQaVVzOeL_{4uPc2KysMM52-f*m~M#UYUK
zC}g5S!rY=AxCux<thu|7{(iUK|0yszjlKf^8O_h_b(cKy>U<)8VpJOtrBUMhZ$co#
z3w@s(8y7@I`SI})0rBxn0ZEHck&WTsc94$zAx8C*Y|<b8#5X2}hIl)ra3lMH8<uE_
zgX;uPD8NBOB|<0*!oq?^#KaZ7ftJy1ir7~{At24*0XUXuaIkw_aqh08MEg*9J^u+X
zf(%fcNMz*X{jaom<!3;HM8t+@in!4teRy~1#D?Da#5h4A`&+*$K{6PDgIv<EFdZEo
zFah}WAeL~tu~~>`QA5N55KMG%hakZq{;_aNz&w3F(G);?U^v9_Yr6;{P4qM9(SgAC
z5Z+{9VFL#u*-DC75D|3<Y^tju7u*Aiz5Uv~z&?EfX`o=x0Y6DM3Qx15l1p`lOkhFo
zj$lPw2~>aPFsu+kFDk8}_qH5;1estyP@!5z3-9j@F_{(!Y=a@ctnuMg)s`TG?*AK$
zBf|C*;X7#p(=Gg*Mh6Kj?$v35gLlWdI|dXuYWB_kBqv~Df%)Iw1o@|af`z(^dHwh{
zh!y6y2#f}B^T6N~#mmnyxg85&bwS_7!6OU;4~LMEi;@ioGEovu!3QCIY4we5Bfm^S
ze^`yo?p>cpxPxsRj0Sj-+8MnO22f&Lfq)(`%`iF4{$9VmLIZ&S7f3=OSb_$VDh2pA
z98NQB?pl2PFiUdgw<G2H5#`U#&id!l-NOYJD!ttN_W9RnD#|G+jgBS1&W`;$(NGs`
z2jqT{5E1p(rz0Vek<lR}_X&9Z^28Bfy_X>t_!}=PwOINL-TK{QK6}hE_)GRZOAv4M
z`BN?m9ag}CI)4wk!V)tRL;b)${Z79c5dU&!{!Tsontu3u6kpgn{7%k3<KFqd^&?1n
zzY0L{y5%@|Vp|s78w-AOE`h!1bZ#(FEv)bNc3=Eq(npA*`jflxMWh5wJiqHsrjC9N
z5qv@Hgf!%^@zsL+i<ZrY0=_6>k|1Ef{6<Aw@cXc@2H_RtA7gmG^>qzma-TT(t$j4h
z3ddOK|5^|flwTmQOi4$90A|8u=mF&S{+5I_hZ>Sbjdt<^*cKE5M#Bk51U|5Mf!HWy
z4#)#wB!R(jAG8LC{WO98q~IPz_wNCINx*yVc25mh!uz)jk^0`Ca7a)sHPF}Ix`h+^
zQ~duayiB++c&Hft^zhQ6=!Q@19o8|2om-)14p$!D3RbGS({oG9@3NYUzw%*LYUy_Z
z{0=RY^a2~#y0F^c#NW799wQR$j>PeWTBL$d8eNG?g9YQLvkOyH31DuSj=J{US}T3&
zR-R|3Nz|ZY^2KvbR-y{oYBr;l5jjub9G^M1#R0~UO&+YLc!eM*c{(BF7sd5f6C8w~
z#=4W#=AC~#%BXgkyWw9K9q$dc_Mt|UD#u(|X#o24{(n+L{8F{f8ghk?t%}5be_ION
zIjVr^^FRIMb-y`khOs}@R63iOMClB3Uc^=8C!F~~uCqMpNLDb2GSc5O=)r!bP-%E-
ztoJr`1#lKvC0*G3%vvn^f3$6WackM!8AYw;b7vP3qr&#xrRs>xzd$Io>X9$5JXCpW
zkqT@io~`pmwOXTNySj@{h^$PG_B^ZMBrXlmui<E614c?O?7o@rQb#QS7uKMAuuLi6
zNwuOtTb@e&=NYaBkwduEs$0u#Z+|k|Yp587s<hwNsKBhmH`o(_>GaNCOPcwhDKYVe
z-N;{$8DS?W*kOaeO<NjaTWi79yq*qG@;F{wU&S-){1sAd^I5o6;n17u4IYYWXU8t_
zi!TeNx3ZStID1EtNh*aamlYi?u3fQmdAqQ%JSBv`R`A=qA2U(SYSEN$v7|~R=2Gl?
zY?B&2$!%v0Y*AxCAIhC7V3xxTKrXf79G<gQ{xba2?(d$^MKBl4{fV(BVNO22H72Cx
z`EPkCm1ccHOuDEC%~0ZMMghCQTOV5=8nDiiDKG>OuGT%5Dps|w?;}mY9l87_JLE?`
zPRoSjM1f^f1Jmi<(%mjqR!FuA#+i;LA3M>`CHx!NtF6if;TC&ZNqeSWE9_i_$wnQe
z5XP5c@N_SbSDb<;Yra%?f}N%JRA~a%ORAPG4wJsUZXS_w=9>#J4ZwO7IJ|nrPJKeT
zH*fZ-L}GMdj3bD3sa{sY!}k`9Q(iM6beW_z8o^QHZcjn8{Nw?yP3)?T)J>tY(u9qM
zm{Udvx>8QGC9ibz3}i+({fs#xxh8i?kh@3>`}WySlF>3>GoK*CK`%19PU6JJ=>St2
zw_z}%<@q~_IstbNjDMjj`yTnt6Ed=Rn7CW3^zTl+^)GMi-W4*6=o1}FOOE_HwoltQ
zhCDLjBgit=Sro1dUl+G+Jll(*qNfABMn=V#@c=^_PqyXTiPbA@CkX!soWOYKaLe+H
ziX%f>kcWMW$by-n(XL|SS)VlUxIQ6qoE#Z)6Jo4N(X@|uNADUlXn2`S0v;?PB2;(+
zWabyT#bN&TsD~CyOrtK*9N&BC?NoqI=qOX8FfgQ9R`vOJdUHhpA5oE?FoF1Ju@-zb
zlZ1F{agXrSeBLPf&dP8qfvlQpzpuQ%J{xkTu91+c&+^#SvES6!1h2@6)uWcrVGcA~
zllqKVn`pri!FGDA>nFu$>{MD~R)NN7Y5t+oxc2Vp2FrL!1UvrMUn#xilXH$}{v<ZE
z5~k~N+X`gXr@6Fy`3keE1ej_2>s!!LJw~Jd8W||V$NG%4Nq-G>=x%u`Y9ms23=BoR
z&KpAYT;84>ODLPA-#<bQ5Iduja@A1G8@9Iwmx8D(M*d;+Mt)ItIuKkdrrhgO5Z9&-
z8j|ift;;LOsd-5y0MjBX639CZkAI9B)mX~ku&_1@WiG8-pud{z)@<rs7EwO)Q}-{F
zaaYTI+~*>=Oc$9Lu8ER20?WEZNBEP=;O%W7aR+P1lG)?^L}L7i-a$voH?D#5J%ShL
zqmGi{nVhTbiUk9&!s<I^bzF0d#761m?Yv@lpOk#va@o+|5`VyE@mn>hqcsTv1~wDn
zdefiO^0@S<AT*vMLxz+WsT>l01ThduW|DgoZqMGYqqtDOWG1J&5N&QaS9@@;WP>OF
zEc36%-5K#FDH?NO>wE7ksW!UQo}TLu6XmOGxaeFnPs<fy5(4C2wzt;0eZtGRuQErE
z3}=W0?e#AHCQ}v9{HY^xBP`e+55D0}m*teS*_>n6h@ZjGS1%}e%`kdQ)P(L5Ug<Jh
z4_sp%jyUU`OH}EgI#A_S!w4@^$l&)%YKR&;wPF&!2-}E(R}i!4mRSuPSDi*znJ0Tk
z;=QSYVTjGy_e<z-b2&e&AXhWFz7NjsL*LE`WmcPSMw$8O206Gjh^Wm+b3K5Sj-|5(
zz-=PyO(WeM9Rw#fw?3jc{t|ZP#07JvTI-byB4Sj=yci=_II6CQO^eGLfTEtd?xEt7
z?HbOZ!o<JrSX>&R2c>*VwKqMiK))VxI)kppFr_&}Y_*x?^c&3!Wf8J3ENXcv7X1?<
zIP#^=hx8k?x~Uu(^x!ymnO&OS@-d)YI%VZmkR+srn*5jiLERZfR;1tPQ_dU1AHtjH
z<HM-^%`p1}$7_DL=~}4OE#_-@D6w_nExs(j5}W%DW=w+9G4A99KTeVtcmc}2y6*|e
z?cOT|pWQWD?|obBgFxrvaP3p99%XmadH9U<a!ccK13^FsQDlc=U}=nv0N5gZI}mkX
zY)OD{&5W>rRgm25UII9=%EX}<exbQkv%PAFRf)i!`&J7<7QA9MF2|EX$r-t0kq<^Y
znJnC#M+{tpR34=bRlXR2BjTad?k<s_W|37`?c3hcMs$;VGj-aRr8*XrRH(UKIWxVF
z@f?^mJ7io`!06qM6-f*hf8G*2coBcjV1|8lMpFoC^*kAxM95H&9>>`OZ_3LsgJiAH
zp<f_hk4Tlt2%*6b=`xoBpP0+P>pyBQfa@_oo1MFP@WFz_3>+@8_quG)xdDh_Ljk)o
zZWPC)`ZIjkuiK7uoJh)N*(&wS3#R4u3ig^XA50G{Khgc)NP6&;$vf04>*7!`s#BHu
z4!oO3I%%G>nV)TepDA-~-yyJB{~V8+*(29ovVdR$Mb67Ux4t&!IHtxQVEc4D_xE;6
zkgIs|H->r5tUYjQ7KwK@XBEBQc}0ygFbpJ})^(~g|AjA+2A)rPW%$fzPY?5qt#*J$
zZz&1Pyf>hu8Ogy+gw3FAo99L4A-Xo~Gz^6@J8(9|ozbdtggt0zYi^>RNHc;@yR4!4
zc*Cz5y^t)i`d2aX3H2_L{b7_eFO*zWqsCA}Tgz2qpsy^lUaozxjQ(JCN1_(8Xh!0)
z%^tPIR;oY#eCOhshTPA@5h<IY>PexLQ_2}Mvr~t?44+uyu*mc>&S1q0mcouFDOf`1
zZWj?<DLJ9D6@<ms@#XmNLcLsnc<*#Vp^#Q7u5pgD|4Py35O6BueRlvCOOvg;pvCHH
z_GlqqBJ0>;6mqKD|5lsrmzinB7^8TSLinVsAQ8FUd<9t(@0xTbXA56d4yfqY9sh6e
z97&AFIx^nhf#Vu(N;+lAH-js%<tRg-s;PNM-`jE}!Coob!RbEXSV7~gc)nhdk$xth
zTh#)gb>DykcaU5;TvuuBt{^W?o%_0AaO(I@Ohe(Lw)i=XaciWzSE!?;4(~7<asVav
zp-TXKzt-<5l#QP-gDBzbujU^7@)4IQ%;!oQ4`MuA6C4WJ+K);gx#eC+FeLhI{%vVu
zKu0WGaSK{lHT{ded=0tF*J*aaKWAEHE$|q6-=1r)kv`s;qg$A&eg1u)BV$vZNRk_Y
zQtgjfZ!tlR^bf-W_SqashiUU!A7VJ7)~8v;%|L*NYJi>j_pgl@Xz=Wl#_H?)g^`ar
zY?B>5;18bi83DZXMw5R@$n=OZ>tMmx;NF$!+DpL0_?vNw4#UOb+C*xRSd4%r5FpCN
zK`21eL>H^!!CZa#0jzLR|Bi0t<VM@oPTvU^q(n}uDZ#t?^k2CTY1#wE)(!$Z*(Jj0
z8#Yn!0Zl~qZcVp}GV7U9`!)+xrow0Dh-DGlp|?F}z3<xn`F#0l*t#fLe-xw>86fXz
zoBCiWsHou{g+~H{@!=Mk3l1iF<O)qWZlhCw;_>W?sQZ`Z1!F(Nm$#Q|=TZm4yw^px
zYCzwR-pZrQ&OB|Mj*?e!XK&s+Y6<rK36b^+J)v_~{oNh>_+d$WoGy-Pm_`KGv>MW4
zo0_g1p+vpdBuZoRr3Lm6|I35Q3pL!W#E7GzdW!<hDL(}{y27;`u7m3}0+EG5j<XRr
zX$wp9EXhdP!vzf231aRp=i7rxR~wp4P_t@p(pFJ_r<2k7Yrg&-Z;j0vd0d3QTaw*w
zG5g@(%V-o4_cPdKIr%*33!{LKv;DZ<z8oTZFTsSU(}9aMxPRCDX?%^|ZFhlT&Ih@J
zS^dxjHPBXVimlye(p4PdI>?t_1KKYg%T>k{n;L3-^GnD{5Qtc1Xu{LJHuUrcoqR{o
zPz)cEE8<P#7+=wJhT4BM<ah(LdOcpYn%&k!J<r0{`2^XgSkV(XRFYNBoZL<GRgz>v
z>wC@>&W4d#Nqw%*64fR3?*mh-7(i=mZ1fZ_JS39(rvxvpFZLn?rQpEVQE#hOzPN`W
zUz{zv_ut_dYw30g6g&gdBUX?mR?ipZs;=HVGvXhag#_n1AOD~%XP2=`xSPxa)Opaj
z*}MULDCV1}t6oEr*^VFR2ugfo>cbTso4Ppnc0*br5Qs32W^(g$ECk4FY=1}}+6qlM
zYU)ksIh3cK(`kNsMn4mj^T@3*%3PKs10||>@#tp#W&0Vgtb-qvGSM&K?r~Eomg^ZZ
z2d9Ju+{ITA*(1Ab|H1aW@Iysv$n+mkZW^oWRKJHTzQ#aaO34r!SeXEfum-tcJ2vQ~
zEld1z{(X{-9Ijq&u<8${To#ON;qF?llqLGk?XLir_ICDFceN^)fooA!zOp)f9q7p#
zEf=maaUXd!Bqb>830e@PiFQN|*RXO5X@^^S(p=hZ3-qc^%)(xgDCz1Y`w$me&ZGjh
z0&Ild7Gef><;YH^UkN*o14PJ_j`)*t-xq}rP{?2Wfa{FiYf%VY?n%LW`Ab8Lfs_q8
zI!@m)hdJ@URHu49-^E6I$~fR$Z3LGhx|z96&g{snin%c5aFf3)G1YvpSLj1<FW&{%
zSzF5<1lFFG>@P}D%RSq@yXLMmCjQ6~E$kjiMzi5%J=3kNUB<)oh-mTRs#8(c>ZiF4
z`Tnc4@L<XK*CS_(RH{0AT{px(@@M`x6^{?)@9f1WX6ch2Q-tlOc;H5&zqT@U=+8F&
z!?^`c@|ZA{dN)TTp8aFgk6Bz6{ULM77J_{IPga}knzspQP`xdr$<Muh?Ih?6CQP2g
zBBVtKgjv^et>4gG2G1HgB9v(d?^eZ+`MDz_=|Fw97vIcQxQz49cup~dSr6%fNwJ)E
zfC10~HnoItPNclEcFut(_ORB1vmi3^UwLG?5h#PC5ZSfofCZXP6ha4G>>fs|1Vtk_
zRa#lPI;+P@B>6Nox4#@<s0n_sL08ChD63hT7zV90n_6nG^tu#u8*iFiZr=XOfTMKa
z=x#07X`?&pmKs@~q)0(b;*Aw|)<M5saJEt{J)TAS2EJ8Q*_Dl6=&>3<>QxGF@*z9l
ztq^}U)0~{fLRFXM{OH=QkfuADhuX=O1fkZ%vQwQPVZPBivZ4(bA%%@``RFVUGY?(o
z9y<eff%O5txT&=}EH5v$Jp=((hXu0Jm|5!s$(!nFsh4~_5RQ7%4byry(^Ng$6|(e@
zb$<b6UxoUv$GK)hp5tl!%Y5kjr6hTr+c`&SU%KF{w$RLp{zs%mwZmA6v=^M+VEH1e
zqT*e7*5?b=RPeMKjc5Y0Gd=cnEo-P#6O59UL90jWH6J5O?X<JJP{gVME;vlv>m1aS
zx+l!u9b`!gLVF5H>_>RtN4Nty&!oO*$-lo3$~Gw*`d0j>j;I2S(d9pxPQPx@3nN}M
zetdwUN5<=KwYB5<&cO*5gYXyS`2Lic;mLHPAi^(+E8xJZ>K3`rAvEMhuw8Kg2QH(6
zJ*EuElz=Y@v{F97Q)`)z{HU3g1lx78!g`O8f8c{kftn|wtCapg3%j}HI!UDqXKvzN
zP*NHVUzN{`xip;6SerD}6{E0%vqiooOk+hL`+e@-1p9b&t@TdG{(j{8z{X9p6#pX5
zb?Bwp^E6%0(=q4{Zx;vCF||QKosrsA7DJv4<Jqt~->%{~PIQ*$Gcz3<a@ha@3O-sJ
z3+mrp0#*oqhpNz$s0uQ{a2mh*6`6NVUzP$DPn2xM^FJ4Z-3d)Y?61k=Id+!J{?Yt)
zqgAMzTd7$FQx*>$Uj1Y@QCdR=m5&Zo$S-&(mePy^8!uyBec*gm6NLeH&?>O{C7oJS
ztMVKU;97pWPTIwYyV~~$v?Q&2t5MKABzlVW!_>`NE4E`Jib=04iBbTLUsJ${b(BSW
z$-!us;p$X2u-0zk5EuHG*~EQRBQa9RaSaG_LONI#poB9Yu5ukVDaP{={aHxhMRE8`
zt%UY%Jtng3olrF09rub+0`0xJD*_By0Cl%sAlRVTI@lodD!aUS)s2>xw~V!&Xf}nO
z@+6C8zaUSHv3Vl8QdRUhGJ)03ga$f~!bi1%Uee2z3fb+ukr@}KI{`kK<7M>{udRFD
zPqxBdi&){Btlwz}W3|0s8{PkY{N)qb*Z%Oy!avY!Kiw4Mefi0HaavSX#_yoY^gt%=
ziEKBWusVBtJ4105VG5Qu-9@u!N@@|MRd)QO*5_yK<&mrIlV<Uf*P_(BS?iQ`F%99C
zJ?n28o>iz&-gK-dg;xvrxZ8^V0;3j=;c3$otHG&DeIJ9_A4tzXUa%c85wDbvt|tpD
zD)IH4Hvfi$TQYLnH&d;)>+g^vjRhBK%;){s@pGN9c#-B2qbkv)nvAYF1aMiq*QTa6
zA|4$~HVVHDWs$C>Y#%4)WAXrHkHD9MMbrY8^fonhaH?!Fy@mtPi>;?-Tit|6-cg0;
zQqVck9XICy+%~Pe)+dVwj*wRQqIM(P3bRp0t?|Z)AXGH#gxA$v-v1J2*px}z7gHya
zrL`g^4&L26^mcw^Yca46J4jnq-d}%S38qErFuCyH)wmZ#R4;k_&%;s}^Frf0+3@}O
zIIl7a9!<CMjwE87CD>L^hZxCR|2C7!UTH~uTuv!r-iePk4s&*NrFdC$sCi1nvDK(%
zEXOkwv1n;n-i<)YLjFUfPUf`O=!^?=Hyyd1)@)KqE$(%_=kG9hYfdO|O>Dz(RcAlp
zy^tC#%dmxa->AU{oWh3avyS@m2D0ByHr%2Ql+MEB+Yv+4(rjS+Sdn_MO*L)#WhpBn
zu6j|<M^2L6U9B?{1qUS4E4=o_0fhism(Urw*>^WP$Zh37_Y*0HN>E})xx^@;5z=Nq
zgrzme&8&NlcrvD;MHqvq3=D!2JeRL-^2S`n<{WBDtE^C)p6wE?d;e0QM@3F3w|3V%
zM+Rd1vaCKNonO57QDEDdW(A26oG~JGn-2aCDiQIn3|2Do9Z?|rL=5!U+!A>@UfZc&
zerq-;D4WbbER!tx)Sr<hy=|4*9B%|(VtE6a7~8oIrrlOnqO#&T?e+A%OJlMIpiB4$
zRZaZ_w~5G@Co}x5m4~Sjk#*g&7+OL8v?yKLAi$>Cj6aUdY)w*@(1@vQZj+AbBGzie
zWI^{Q`_FpcJQ-tTT(rT4hcm>o(Lz)F%ev+8c!acmyhP-6owg=#s6bJ(J;!a(*X2tu
z{S`;^+4`}C95huQv3OLybRmjcLwnx7)^Vbqa9GVP{YWT@_iPc^g{wSo`6eQ<cqeAv
zuvc<DrwC=8t_`SHNSl=0ma#C<>U8igarM5yv_9*VA?jdT7o|m#Dl&IvdnfhXvt#lt
zU%8y+69BRz$Cd9ny7LyWW*7elM$UpLGtRiYy#iBLY5T+RC~%8y{q{d0Gq(Q;nX$2O
z{U2n;!NK`I?!`Gd*qQ&Ik=cKB<)!Tve(Hh%$uziaCXqBY$^UY&gHu2vQ%E9!kpC9q
z(jMWiq{QU#QEXJi#N<Q~Y`f*R-M7BCzr8E3HCmUPr(W*a-LqaVMkWjFdr9FWc7`;P
zU{Q!eh{<47)>ajfzyX59eng7#@iEg#vCcu?VyF$+gIinsk|9U_f2cb8`>5E;z{Cr_
zo8qAYI>J$b$iRRirGtjZ0tEwzkf`n%C5p4i1fj2>!$F$ffG;G$rgGxtkk1beAzB+H
z3R>S+QTm|wK?2CghCKblL635b>>Z)7fagGpu8d~R@QDp61AtLL!V7$U5`t7V2tu6`
z(2(vP9u6RRIv+{5uT0xKf%P4e`2-115L_NZgn)Z-AS{D(jQqI|DNRAKHU_tU?;s>~
zk}=odAp}w79iia%V`J|G1&!>1o=$*3+2sOaVd3sawI1U@8TaZMfdk%ze&t^^p6Wy$
zhi?BjF>`eXCiU5a;t8PNf`*t=nm>~8D)Iz21ba#&T^q-bjD_?L+Lt%PZ5q6t=m$dg
z;se6k-ZQvv7unilpz`qZXj`nq0QV~q%4=W&sf=)S4<lB*3F*C13F_=8Ix~4iesgJz
zg(}7zxMehil@PS^X9s?EL}n81)8jL=miBMYryl6#;=zI;0ztz>MZpB?(*<U7i0JOC
zdkW)csNWTzW5n4G?9GE+05=5KgPb6?h8FxneQ)*WG679YgPz>J=7sr_2qQrOg^DNw
z;ilu`3B7r^v%xoh2hXS7LcBtxgU)Y&0tfW^{p$0HPr^ot{(1kp{`vF+cSUbbhDY=K
zas6`03IbWc-5Z4jxr2@Z0w#*bf+7mjfBR(xFkt;?p!fBPEF-l@0zti%X+JT4R~gUt
zg7v+xIywUXWXR%1s?)>uy|<3h2apIteSm%l$b5T@{VMGDHhejd{N4ts@@8lIWpVj$
z{t~jTVc#4*rh#fV5l}q=SrX5i1iU$DpswW=EC&hg6U_YDsfh&62NT8BivThZ$)*s|
zeg+4()%JFn${Fy$|NW9?2z1TYDY*oZ8g@u}yw$aW<Aa0!q`~tUAW1xZ?#Hei6QZu+
z^Vyc~uD-zz&K*9@awj7rkv*+$K}SV^^x4}R5(+;p7bQUTA%+krQcZofHUNWsL6O1W
zg9yG}A=Zm^ApdljLpucoOfz0^f&hyFf!y^HL&0zVf<}RWDfaFQSO<8vwHE-s=<!_x
ze+POAL9nK9A&9fH#D$B6@vKEQ<g1R)yWUnti=AFo<mJHMM_}mgm3${q)oGz2GO!<U
z%xGM?iO^-j<?X;%7prGkCH!pMqM!K(D1D-746d>44$2(lnJ7`e{T5gilGsd+GRdg7
z(&*eT2j|QpdOlMHF|1cD`oteXidrl<<^effqGGaqO>&)wc5YH(6y)6@_cxXNmBZ$J
zj(SJwnWWy!TsP}!Sb#CpYc_NE^H|mau)505$!`%*Kyf#m-n`I7ZvQ1@wGoxFSq1Q4
za-%Mq!(rZo$t&a8oF;ES4#aUZ)%GdMHWZnI)x}R)cSn$cs<3R%TnEo188=Aot7JX%
zF@Kl}3nX%<@%j~9uhyTM+7l{ErSJ56^9UTCGj$!^lDR<LmGAAK+e$mZ51O(aXXAi*
zns3lx7cj|(KQV@3^Q)3fsprpAis<_vlCUBI=KBm4X9xVBxzwmnC0^@`X9S%?3d^V#
zp-SWKJaM(~1*#3tKU+%)Fln)bG7xK~AOchfBEk}HBu9@;P3AhVLk?Peln%)8@pHq|
zOAf|e*RGaX27?}OzId{-cOTXj!t3R6H<hawpvx+o3eg!nTc-#D<FqsSNXMf5&GyHx
zKKl%>DX0SUJF?C9HdZ2{;k)V;Q#!BX>xn_OksY%Fqe;(y^c&nTHAl7x80{jC%G+9F
zuQSagg_tVdMfSmUEZOzJzUGD^jeGT?UiAV?UF&Mm1Dqd#rIx-c>*pKk^1*n&qzuki
z8C00X^}a!*V&l3^JJA+owiBQc6S*VRY!M<g^kFRy%WPghEA$KnfksY}MRuR)Z=h5%
zhE*%+#UGdA1&Fml9D~pbpP$wf>as*Y^6Mt)l=Il>-l^F;KS7utA0zlh9-wZ%=34Al
zXFhjEw2-m|=mL8KeaFpA{`<Io?`M*Q)`E1o-(>{)q~P>CE6*csl;7ti0cwRrsk`9a
zb3TUWJ9lNJV@%3^u>_Z3#h!0e^NrmzxUdZ8gDKuh3KJncwEL1UbvOp9ub%%H+RQJ^
zJ4G@(T3c8K0gda)G85NlZn-{>=&qkb`JCM^N(GS4_Gv8lM6~;1;x~ZdZcQGUzG<xP
zhCAdD5$Fr}{wA*}a*Fr3N6KfWW->TtQdvf1?++saQk!e?4Zy;n=lN%?U!%?K3`j5L
zD8w~1nb_QJQC}n?v44q^Q#0w#C2JGkB=7GG)oW$|W%uuLm#LVyq+l*rJKYGm)ku<%
z1@$>Oec-zl&mCafm!#Mi!l<%1@>KGBkK}RsQX7RKJb4ScyQStdtt3ew-l|=;K6T8p
zg1bu#UC&u*S)0D=bOw<yV@LAL%UDRSj&m4oS|${dr9qZ}^>m#qsE~zdBTdO#1H{&6
zx8W>}iNQ4DQhQ-NTmffOn{`S8m9d^3pz!Z<S{!nh#VyhD!2^l5uCMw5tr232NWyyR
zk&c8x-l%%W&PH#ajv|dOd7npPl+`!IYh=r`2|Lv%PW75_G*3^=@>y_ny{g+bVRi+F
zU|GwnjN{^n-G|pVf=yo6D0nvFQ`;gz<~6)IGy$7V<(cr!i97ny<}7RY>#VET@E+>(
zrLyF6a<b4g<Y#T^X);1zPP6D${&dOwh22l`Mh{iI!(Hh5W)m<ylgtU!yKG?|WWPzu
zKm*}WWed19{GQ4>B4enfLH>t~kb+|SY{6GtR(L}}KBQjkSW;a7Wf{X9YNLB=H{6O9
z-T2?{T<19rJRf;qc%QxlYtH(TO;{1eC5|&sDQF*gG>2>QnQymEhOkMVkv5wIc8L>J
zTW|{N@BWfg9!p&Eb36yuw`kD0ZAM{9r_X+t#Ezi)ZP>dlo3_lWD*1)y6;wKAH&g}d
zV*khWu2x<2m&HDj3z8HDMA78V+8&G(gJFYbdL^P~B1->$5GG+l!_tV3A(=d<$VTI}
z_n7nee28@v4tT4s{gotGXHC6SU4EDLSN~j*r9huv4I@~lC758~=qVhkKjNeu$w0Lq
znlEXm*iyt3rKT~dG&T!P)gC8CYnlqk+37iSm+Mx101{GFNr>{CRnV?n-Uy5Qt&Cz<
z-zI8i)8FKGIBtkK!*{I}fTw*o?Nd$QR1Qd?i%q!iOX&EXX$y%O(`3ZW`TE#A-kaUe
z0sh|);FC#m><mMf&h50v`{h}iyh;Ct|0NtN@We&*YQms)@0Unpn;;lT2{ExZ{Zip^
zxT;+$njY68Q(|;F^O)h;7uXe|l_0P)#M`{AcDO=F-!j==0<jrh;tk)y{GR!0yFn1^
z<&fpjffJL7opjov;;!NnARFH*X!46EyWFrm9LaEhX>!C&C&0)m(nsaG!^dD>>6ZTe
zK4%4Vb^1`E@Fbrr!xfaIfBy|3)2Hu8&a_2PTcB-OL!F`0-bu!${s0X%+=dhpLzJKh
zJr2y1A`M+4D8WfEQplOO;nxjO_A;Jz=_zT=aD_#z=BsP<k;fo++JJ*y**K0eY}b#i
zYFq8*c=ydJ+gkS(X|N>)gH1O#6%F0qA(WooO+<P&720V)7s8IB4l4I%-nt|xgwbd5
z##A_i-%1?8UZqNhy52Nf?GucL*I|d(Q%jo}t!-8UXLaS|Tf1~KU&>`I?@O}f=uf%H
zNRB2+5Y43wu#c3Gvne^!?c+l8gK7p8?i`8xH|g7VxE`f8v(<aeMW+a6v}(VlB-h?e
zH<L1^dG7Fy#C?mPdT?BJSEFS)S~VS#QF2V>iZ=)WW8uM2l2LjLo~*Kt3A)XSzQ)lg
zkc&T62~3z@$$NGD-J<X(*=1Wi*xab=E>M+Y5EinK(sy=Zsa!#cerBSyb0Of6jM-J`
z{hH#gu%<A}=6=NgqM*@ih~IDX?bkr#kuH8b7MG>|v0VS8I47l(D7?b<O$-Db@8*m&
z=)XWf%oHAFu|Su~5ttKNlu&iMr^L-6o{ft3*FX2=f=dlDN$tP(^4`8FWZA$-EruU%
zZxK(LV6KwiGIJh5>6Dkw6+SCkbq|Phx6s;ID;Ce|Txy$NgAV<(wJP5;i!92pO`T$z
z&egk-CHYDRxDB>KzMwJG4yC4O0yW81Of~#7s~dlxBY>E9V>bdI)alHGMWMlc-8HJ)
z!10gz)|w;!vcKzO>SN1i?a8dV`6fop#V4G(!+XBdh4(0aj1sU2LU#J9iFIn+!4ywL
z4Q2`9b%0&ItrA477+vSSD4f6+=O8D9`w!r(MClKf-?z=nI5Hy?x*B1!ra9^nEsIq8
zc6Qh@$qz&>qWHkw#PEQ+IvF#m>(+wl^Hu!ILDf`?bfM)L^p`4hxbk`*czA<4%})e+
zG(D1Xpx%{9)4C1!*7#gICYxow2QlTk<0!i3_O+nS`EQ>(sDRkw<+5@<a-o?CSkOMg
zMOULyPMXSY6sC8$ofy7LLZ9wXXdStooLgt%E6vMMqMXinEBAceS8IlJyIe^oFuMwg
zGuG89iTuPn#w^UeP<t8MAYvEcR!*50eC|eAyF(sdJ-za2W>P=Qc9P(z)DGGao9HG}
zpiD(Ym>+!FoOe4Yi<}p&l)-=KZ!|uCkE_~eMJ^U*V*T>E-A`zKh5{zU*&Kxo*<>k8
zuT8yNf!+<CvFZHJl*@HqGW#&mA%xaDbhY!%JKE9&O;KQE;=kT`$XW7;f8~BI2Lm+b
zH-%T~xx6|FAYnpc*6$2|eO+L`!-D2SzjC8_Z8|g3a2Mh3%+<Wdv%CeqsD4aH+$H|a
zbrRF6v;+hHsCvxnNi)Ghc_G)zgmmlrDkK|<I+h&71>>bEJd<`%1XTbW9;Ggd=BUjt
z_CmSLe;1#w<gdZ|=WsJ!zOAY4Q<Hk{vpz&jR8^;8$aREKVEo|KkPO|n+=6_ZqBr`o
z9vUuuX4B_U?Hnw0@|>Xih!Gqt%P@sz&rBqGhx<tCtJ!<5JGKsVp*C8u6JHi<>4o`b
za48eN#RqHvC32v;$-4ND2?&Z(TW)KOQ&mj+Im?g&6%QZ3-56rz$-IK)#VGVeK0#YU
zwsIZgEcgkb$F~`Kj!yhsC;Gyl?7NKKj_>E#0T{7x1|iXLt+RnfCk_7~bdo~W`wEm0
zd%enU`8Ahmfh{Nn`C6)<6~}fdi#o0}8EjoU|99p7JEMru$$+7S<`LLhVm_Jyg!-M)
z+wglNF+MX^w>r{M6msq8Il$jGv;Hr_&LKz_CTO#5+vaWCHg4OtZQI6e+qP}nwrv~l
zd@+kZX7NYNvUU}<$%@Q8&#9?gmiLutsX<n^$ZgGmz0svTJsvEtk}_TO?wvM!68hIU
zmqIb1)F!F&`;!T2tXT(OmW!x87Lmi#2{(VL+`jxZFth&okgU3fKzlIIzY>Wt{){2{
z#uum|a}+1L)$-k4Vq@=pypmG-xtLo5Ry*?S?Dh2`{dXnJS=&b5(jKFD7=SP(J9(2Q
z+JYg6<G3-`KpmuLL>sr}_BeU#Y2BB|p|<EM7<$Dvu0EE4GaD%%gh;YDdLKE7R-RI(
zExcAkl+ym$;JyUT*K*h6tn`s>H$1-3efnf#EP+i52(giixJ@h=l>yH%-uYP{$zhD5
zd_>pYdf4y03qny0r!?~z7+VXb>Y8F8H0)`)ud>}yJak^bPX6~ZkAw3$A@I@z@iP-Z
z(6x{g)Dj3hsSV<;Ra)!=qj#eJ;uo;+S!q%FUf;vJ8?&%2&{VaYJLjV;;TqUqQrb^t
zwU*CsxN%D<z?0j0nfxc3$j?G^D74E;&`aJY-}W3?+OnscPkpA9)wX1WRh4xnOpM=q
z&?hm_{Az*?H%Gj2*KL^^(tuPTAL1@bP2-Tu`fJ%4M%AZ8C_f{P5A$rkbh)5IMM+Xh
z`Xziya#5C0@8o2t>4fSiy7vwA5;$SFNZ{+={p^~{JBH`}wOpIR+d(<!>c(cnl>!L&
zrOu?}E)*bkNbBOn`RRd8jWF!@`a>z#f_@fE$6h^uG_EDTX18htk>#d5Y8+3+%g9F&
z_emF6B_cpg!D!^U$FPp$NnjSrFc{8=R{_rpb+pV=z=l(7?2FXoj7ZHG!SgI64s$cM
z?3(cY1l(Cq>qR?tgi%WCD|QlNhw{JV?fsekhO<_qT`hfH{)}$&^dyBFS2mPyztOf(
zV5u-P@KzzjWE^|UdCJ<p6#?{z<#h%Aa9n>gZu?zc>x#MrCttBdhdeNUP;~!_A#$_B
zERW>wv-{>!@4fNa=@vQ@Uwan%)%<Aw3crhflVqJuH!IZICH6)NWs6GWst$(nZ3<Gw
z5uA((qK}Jw;Y;cM8kGRoZqkBAs01ljOme=KpkQV03)GVQ4Cf2xxKD&w&raV=-BZZ4
z^ut5mZ($X6do4P1$q)CCJwS2eZ2pEv#d+5Kv&iu!-Ddg3(i*Jr&bnW9u!(q$JcE?d
z!Ikp&AZ?N1*N<`RHKIk%5%eg$wLks+p&h}nj|bzXu2Qa>JX6vlv;9ioxskD^=}PTu
z{l=Wl`E&&^`wi88%kd)S>D!Tk&6wAJ(QaAKXodw4;wiP81jMtFczWZCBsn-w8XY!n
zzo7Sl+eR9E&pYwVJ^r80I}&_$zILk_lH*rXwI5t0i*_yd8$3P_Jr{xAe>(}q(;XG3
zbr)GS>Xx;A^lW>N+Lon=d7JdgxpR}FzotRksLG36eNk<%&Vv`Lw_6-JYKSMm!?e)L
zmGBVmhj-)3dXuykMHlD93$TAaCO&-CDe4BV>v5?j?+ARlZHn%i9I0~7(_i9sgt}iS
z>@)QG=)Y6r5*h>rz0RcA=-k>*B;=X>8KVQgXVv$g+sI4i@>f*hC-`}DA=9$Qnvl1M
zO9k#wQr6a>d^1j(0-_mt&{f}p%wdf8@p`p(E*ibx&Hwpg2)fsJ%VQzwEjSM)O*S@`
z!5{iLUTo(Hdl$+?TCqfrC+XYG2L*YiEqC>$iJxa*t@ZJH?W(N5;%JC|>OJ!CF}=7;
z9{$4%a2;5sgOo8YVCaZ7n+>NWprupHT#c6HP9J$RWgcUc6b@7L9K*dKHmvL!Rk~4}
z1ie)I8}aYT63$tro>P~JCvEfFElB6TpsjRaVe?r?veUuAT3O)QxLa?y8c^37FuiH?
zyYX2T??0{Aq3o@g5)&iKpp~PgW*m)0i6j}eqFgP;_TL4g*Y~KM=vwS{><LbfK6<||
zGXdv`hDTt<H<FYg`jz=tKW(SwThIF}f#=kit${N@Wr^8Y;2?I0W>z)GUn~n~yDd{B
zof1w9y>p>n%m}SxpT#2r7VurYmUg!<=yRxRNwS{@U8pRthUh%Qh7NAF$*B}dY%q<s
zH=tiZAC`I=q*vd~!H(^676y<6ZYHt%R7WW2oN5)bw&}v{#Yw`08OIRqWI$)&&fOCs
ze|$*J7Clt`h<okq^=-8j!yOtC*Nq{(V*d;BQ@=jO?0Zp%qmSroV8)R4k>vtA+BM_i
z|E}=fS27$b%d|j8J^t}+?>)-Y;pIFGNF&=h{2H1}(2R#NeE&QI#o#}jncOF!ALt10
zY1f_+#ej-mZ2HbCT2zDWZAOkKe_Lt4SGQc#na&`LvMMg7T$LY3$%E2Oy9m4I0b8~I
z2K(^sQkepY&mHcppQlI^G}-Tj<>oZYlq^oAZ>gUQT5DrR@20ps@$vX?`BbC5W6Na*
z40=+HMVST?WK7OS?Zyn=bTUp}Q+|df@iv3}lPa)P0S&SdCnZ-sAk(n#syky9I(!bh
zVoe+EU^;lv#xIJ;PvftfuW9Ep-MwXncUXtkwA!M^cjcxyHC0pOLHH4JPY-e(M&M>e
zCNGE_-COTD{GD36TYBOg(&}xQH@-hs3+u+iWe+dqlCqaf&hC?n+&9&k^y$@KRCVzT
zG!k7)oauB_5~;AYzajU>Xoy-IrHmBldf}iKl|af?eA@OS47PPLWcGxn^}a4JK5Xx!
zuI-+;pF{K{Z+0ZaJ8plSDc-wSo1500eAZIX<HCwtHgZS18Q96hu2)dMo#7@=HQ1ZF
z>zo5=LV5Vz|GChAfyPeMkM=@t$s`BAp4Jmezn|&<Cq0JPMnL5)$fk|sNT#S7XRyJ=
z<?eD8z=b@Zsmcf`qd;{#TWE@CgV55h%GtLsGe7iw_MQG$;TDyd<QPI|&X6uWit2oL
z8^@E-WMXr6AgMr34Q9pFoCVPXzmAbvo?b`5xgkWk)C{44d)uCt&cT`(J8RxoHdeP%
ztCcAg##Q}D<BQ*WrYPg0t?-w@1WqQ&_Zo;vBCs)eIgfaT@Q%qH|N5PR73`(EKV=(w
z=WMs=kNrI`%8kpXzx2jNm#c2&b2=ve#;YmUhLWa}{M5#>U`#I|=ukvYVy+EeJtw}m
zdh>waP4m{Prq8h^PffP7eh%bxcV{>!3R=ItmT4OSv3q>eN6WCHysL25bi1wkT{jDa
z4W|j|zmD1!or2rD!F`l@|F;<gL_}X=be}1Mnx*~&9XTWJmBS?bkA!vMMz7(I-f33V
zOgMbCb<)CU!+Is3$zL1UA(QItJ6gHUtK$8yji$`>;@JrkXn~`=f4V`dJ`^Ic3oaz?
zGH4n6H?niI&?u2;RKrRh7y7CC%B~IiDi3N6kv2^?%>F5`tKX&kYN&VJVkU`~Z&KgY
z(KJ0#D-x;GZw8}&qs_77cgFam(PN!H-v8)oG8&6Du{9y~UV}z;(?LaeLR9PzcG&01
ztrnJ^#%p_F+B$0Pq7Ht)djw%A_EoIwlflm*OvH_@=kmWzrHRyiPek9(A-KLrr@fs{
z#i)6iVtxKJGzq)!Tt1T7;mOO)a?aeGo(|X6I&RDsg~U?11&JIo%lAhZdjwlsDX3nH
z8@dt4OS?=?Jx6UXvNUzQ^fFF;>0*?wBXf>z_*Gq67~d5Lg|stQzXZ2T>{r`bRvv@l
zCu!?l<6uUJ?yLEh++ob6#XC^_W+ssvT<YAtDX^&d+=XH^9@|oHRcHm|XiAo@824??
zc)$0a@sxZt#kF#Dr*Lca?fIth-_*SBR;OMaty}-sfoU+11GHF0fq@rr<j%L6F%=EB
z(Nyy#DUCX_!mj7p@sDjVzgCBtY#4>WCr|qO+7s+PCgm1-EY3Ba-&4opT@PHk9P*(3
z+&okp4YlYbBAw=ZoZiHWRVQo~3dRnYLkcW^O!S<~Ubro?V@Wl`W_j9h4i|twb#yCS
z&ZcG9o^rcR#ZeD`T1h*(QJ<@?k=XK^hPOO9>T+g|a2`=@{-@%~`0~1@GO(gqdntRA
zh^PKQiqNM<n1|TiELODxrrvfdnYHW7WP*Vk3_qLeWAE;=C?~0cjQzF3Q+0;y{zXsF
zt>Thu7;z6PyTDo83!YDmpXgp!pZlQoJXUr&tED=@A(W5yfGT()!i}ifQ;0HwUpy^W
zpwaxney*sYVq88&X41_?J1&VJYg5iy{l`d{%iVWaXe(E=A)DXl9#Ed!CB|&DDFL2D
z?+vj1wQ<VUA_&7KZ{1Uy%ckAEmLkorM89kg#k}qzxrh5WG4!u3V)a?C-HkzmAVv4&
z5B;f(Q)s1fV!8P~OR&KAn1^|d7c2^Z%FG~KX5hp49W0!q1L<-ZGRZ2ycdJ##S(M9n
z-!1ExTuh$3nE=S*tlm=@KK!>X$2>X~L{y9?RU<7xd|y-j?j*2njP*GD*zAflw%=-!
z_VK&~{PpCRS*SZHoxR*r_zH6}ctIiHraNI-{cu*z{XpjhoUMxuMhnt=^+D-flTtR&
zlk|=g`K`(P=7Gu^f->3?n{lnz$S=hz0%4|}gtkIye*$GD(O#Q(al%<f1BCzsgqi8g
z^09J#>{`u@I7lV%Ud>=GV|_G{xQ<WQ+SB8cE5U8_kuF+9`NL)D9wnXlvP6=bo9m%{
z8QWqm)e2v*$Cy~DnWVnr+%<iG8fMKcU;w*J`}n!#2=;tmj)`IZboCbc8of+{<Fg&m
z@$s9?5`(lQC{F2)oFlvH^gOzP$e`%YG!Vq>CG%6?93}pU=4-(GQ}RavjDVH<A+Uv4
zX%cwbB3~nR3!5W3*R7oPUBH!Z{_1}lEwleGqh)3`mj6-pG7~W~Gcx|q@&Cm!nORs_
z+5hiw8Rq|M?u~f^b;ya`gn$`?$E{k3vfXOEsa|Kt>1wdmhQ}#l!YOOO;gAb%>fGyb
z@9G2OahWqGRbQ>TK6$E*N2aJ;gwEi}1fU?i);>?e$?yUxdZL?=1EHeQfTE(p@^W=#
zrc}}0?-_YG!RI$crv&rO=|dFG3L2}&%S^AMn^4>tAjUg3fipINq;q+sb9ttx1JTOJ
zYy+5F98Q5Fu)DM~fRC|(m=RtDF+H3VA^$R%)4)orBhC2pgOtlu08ejkXS)ELAfdK^
zb82K_Z-5_1Yf}YzkcuiA=mb{=mSN5>Uj&HD-)VJq@jbDy`FMG;Vs3P>@UrQ^$}fNj
z)M`_K(DPyEH}EYW-gOxT2i6hZ<xS!4kAc{vY0~_UD-lj>2}WlHfg}v9O<|hdfj!$d
zvVe1diJSr|oACq}kSzdl4ch_`E&={;5dG8r-+K;#*I)ec$zT21(b7@`w|}FrdTOs2
zK+ZJUM1qRK{{~i;QV<Mm>|eL$*H=e?kL|DRY)q|fK$zdvPe*~E4NU`>%KQD(&WtW?
zPR=g}_l-=yx<p6!3<Y&D+Bi^M>zhC~yE^*;v+~oE*cLEWU6@A#Ni7ZT_w{cd9E@#^
z94r9ckc=$SqRyU_BwPip>pgNJ<Zr?Z@Okw9+2P^gi5VCmZs362($tu~p(;-<5I~8^
zFCB#H{@Ky_J`^J)I`DH7Gi1<j|5rO!7btM;tev1hULQIjdOsrr*i5ao76>&zG==Xw
z@0^Hf{+kdEr?)AELNE=w*?StObWZ^AQ;ev^zyj&5T_<n~$Ydx=jz|pp$9N-v4p65c
zIoyZ7FEBR-nQy9R0Z#X4z@|74-UEawGPi!Z<M@9_ZDsKQwF4$FmP-L9*S~k*`JZo&
z3ZTCnsX?F?)`38k0@Af(!?PwZpCjJ@&lSMQBfx&h|L=#t_9GxGJ|wH=rf*pVum}K@
z$KF)i^!(ZaX=!n&&jXM11kCpT0y3>Y09;z0`57r$JAf6bE}UQlq4nLt*FM{3r-b@P
zuuLk=j!doJCOW|QiobqFO$wjF#K6eqn=!Z`BF+q8Ay95=8RGfe0l4P4PepM4<eQ<S
zy{960;||r>@C*oxhX>btAUF(8_!@}NY@RL?m=Dl03?vTW4XGXv3#5`u*uOo1{re`$
zwGJFJ*e3=cLI5fnCme=0K>G=92Z}NBN8$)j{O*fLg6^k$fMf#2A_EX%%$xlRRRf7%
z2t>g5Q$9fkuAlr8A$5Hdf*Gm52Mb<D0mO8O+)4zXhRYry1K(8uL`Zp?gkY7rKZqa=
z*55)zZZiN9J0#}cV8M>`Z=rl089?;95Vta<_B<zm)X?~guA%Ac2;e;%W9BcU&==rO
z67cwLKJmMCwdX~_F>m|*cMzr$hE+w|xT~));F28xD#U;4FVwm>e~I{O`wiLH^c!~T
zpJ?z)_dYcCyR|(q^TEI#A2_0qgtqr6KaoGG<;A51asy}tn)p352T`^B!31MlKV^Wr
zEWFW2T0ZQf2It$s0*IPHc5DXQoiOl~yM+r(1Z3m?{)ML=eTc(Bn?`<yX>J401Xyz6
zKJ}H%0$8BckkUx!v7alyrjn2JnQ6lN$UnROqtV#GM9+^;_hDFB8h!{d)LI3i03yRb
z_A`K}4F9=@Ix5EC%*)3zR3Zw@{G1iQE#a3vZvK~klK~{SBXE!IZwPS8eK^>2yqQaj
z3&d|rVm?8K7w7j0&}HzJJ`yYaTOSc6VqBjZ{P7PaHY{cL+JD!_yAzlJ6MKZ<28g@}
zAaW~nn9p<S0A8p;_`m_dfR_;vsAsUu!8%&*^v5s_jxZO#W!NLn`8)ZCxuiSmQst$u
zYEJhqz8?QHVcoPJ$E6QBPSa{aQ(yJ$OErs>^O3XSq7U8ovp*-Z`n_{u(9}&|Irmd6
z8beDX6oaxNU=HukR>F|I4063VLhSMQ`}!v1PdVG|yEN#90v>QuUhMFywXz{}w={&y
zj^iY}>az=Dm1F1NDRl9e>Bl}p#DR__6aghdUC*L=?LAq4r?UJ=6D9LQ-*{q8=^hp~
zj3T|iPkR(=Mh_RGrNgR%MSwh`*_osdNS%_YgL{sZ|Es{=*Bb-s!pY&HX{~Z`gAT)q
zs^%pqwtMXJ`}_@yL)~e4AW#LvxZ-=#R^=8$j4tGg!_`-;G2-sF1}(rScrWSEHZD7s
z&l%cf2X#(!Y(2mj@y&GdAX{HPer!CpF~0bveTdRu-;ArTu5EMjO)?G=NPC098RFYY
z99F)u6wyTRor|t0h3cr3v4O&Em$`#4aQ~Sn&z>HnjxRu;<d{&C5HO#C-obvkynF9d
zv-M@CN`&WDK`s+(AT#~$wHd<)vnJA-r>2Z_q}3dYt{E$XXdimVgYF)ZC%a?&Q$zQq
zMyG0UXdxP47)UyX|I-y#AvdD1TTTT2lx#Lo_QdI}#%+tio#C)u=H#tMCr7@?6<tuo
zX$6Uk1&Kg*+)e*;yREDgg=37vXC+{;<|PpwJ#1a!6oDb}RsnhP(nVwW6Iw(pb?4p(
z-=7hmTM^lgy45m5YF+sta3lAc%I`g|DixieoLW7OI6?3f`c-@WU;ZlG{wgGlq1bLK
zcq6MD4ZlJlv00JLaDq8uwNN6CTU?8!PLChbfU>GL<)4>b5L}JStZg!aydAQqhMEN$
zV_X}^`^GU7!A)`nB!(LZGd=r9<q^@I%)c%E>TgJPdL#DZT38Tvx&Pz@BjbCo%uEN7
z(z#PW(9{*o{L^R(Mm)4-CR=tNW|6%}qU_J=To<gr|2a-!YK_#bRl&=(Qjud7{DRt@
z?q`sa+0QCB3U2rn!!WSGxX)Go^I_sj^RWCch!-5LONfI5^~J31Pe3N;D6h&DY4ruN
z6)WvJ{T_!@%);pVG7Y*5nc4%$A(B@vgo@O1%^LQ>8}qm;+&oQiY$3C<0dsAN0U9WO
zHe((q&c0+Ys~LoumwYdsl<$yq=RdRR_fI{eiNRpeAU>|$BPq6^>9$+CaiI+RO9yIr
zV8hk%z7&S=_>77{O!lMLx~KKq!j2n9uCK53lasga_?gTj!S&SC&rjL`CLPiN>)B;g
zTCkx=AB&yjTx)uHGJf_`d$6_d+9gCKgQ{_fZai%K8^75`yXmp&KIRp%f&3cghRhNj
zYaH{lpWAK+C`|nyS?Gxu_8fYU7k+<!17#Cuiq#qB?zCSW4gUp|w-_!T1Du~g%cT6v
zvhL|3pImn37t!u6#4&QY$HLtqAfQ36IZN845cD(v0W;TMTRH7iLtTusF)UX?{MKW2
zO~NB6MSSFmZ95NPkUF-?H^s(eLr~f%nI{~}7Q96%6O-1ye|eQ#7fJPPF5ZrE7y(Jf
z3y7qI29Bl_sgxSybcwQ;-9vY#<PI$7+j!q6Rhkfv-F;nTX2;<S4)Z2%i^(MLFQlq7
zy^j7F)O%=nw288#%q64PdA)n9UCrapH3dl3>#<n`-5;iiMQ(=+IWF^JsrIG$6q~uK
zye*X;ZJcx}g%gL8F2g6HwC3#UUD0O_hkaw!16VB7gAB_KPcGuq$?Ijh`};o<Zm*oq
z0w@yv8c(Kfa7)HtU+mGnA}9Ui`K$M03Y$)N8#m>G!?!vh5LsoRAAHwNmDn~T<(OkX
zW4kMNKp@b?k4Si2-fk;-1Ze2b6i+X%9f`Y$C))xJ?|-RK-^$7LI*aq@&~q~}eP7WQ
zfbNzuh)=d<`!)=PwOf*3m0}Xd^M31b(X5ufG1P*Ub&T8WglC%*5oDiCl06^o>WM5_
zA{V~hh{js8bR@G&0>TwU(zR4Y|2+iMp<HF-_b9Qdw_7~%kEOP)ns;LcMm;|@Vl?-F
z$&f(XuxfB?K&8b^Hj0o~?d9XJujCe-l7&RxTL)Cv1@i_Ge;)c|l3$+E_z80)uH}9&
z;QlpG^$Qky>uIp2N3M=1d6EP+Mo1q<S9GGO!X&mFt)*)0{$7kZj-Q<hqc7Hd*)qSo
zz={OI;$+>L9HUP3!w%FUT5b%J=q`oo-7A22p(uA<Szx2l=?sd_zca<8w$QlIAlu17
zX&{YH*^%Oc`@7?$&=i=9s8GTg)~T$8gIvB&y2dg2;VNMzW#4u?@DX?4U*{6}uda$P
zC<l}_DR(nzyS|n`bQo)4^V27w2a<Y^!H*e@dF<5Shp45(<eL8~wu(Q}QX`KelBrsG
zL`Fing99a64U<8h$LJ6XYxJr~kqa18rD!_JwYXrQOJ|-9n+ZSwU89yD#N<8|RT~{$
zWtG7A?m|SnOcJLb=Pw;0YIG&3b|_TSf2{5$94D@jO_x$5W~)D2IiVwa4dM8uc+$3P
zf8@2r5I1TwIlcaZ`Wrxfi%$`o_}UnWB3Kw5IHOq*t*Mjx<9!#xzwXW^7Cyoo{qEGU
z+y3cTo|ZBTrAQW<GH?rH#JBL6n7wVX=%iMMCOJ5T;qe~@ho`rH!0hmV5=AHQVRG;)
zpG+Q&eiRbw*xMOS2JVyBL|4pd<2k>pZ&j+30kWi%vw>K8PG<s>2;O~YWX7yDpjk8B
zF_3ZWca9l)hJ*c#kxKoMItGJqH*&AcvDaj5K9r)lUQ@~pxuEEgDU?<t;hHfrOq#KZ
zwy&k=Qw#JRU>wQ7zR(`XD4HlFbKa*uB0Y6cu6}(G8C}{#3T<CMK(EKs;g=i|8J1_>
zzMDY3;ne5ri6<dO8Dp^(#_v6A(>!}J>To0O-P<Mn=t9@;Es43$x5_Jxa5t~nmT?Eo
zHJN<-i0tZ!hAEq*Iq3Z9b3kc}YVcr{hO~89ap1bu7{#3>QYe3U6PKiRdj8vlNEJ>*
zOMGPKS)M(h8N!nYx74ev-7KE`VL9KjC=>DAn+<C-Do*S}tkp`u>z~_J{x&9@Xd6F_
ziVipE6f@|mLdAKv>K3_S?Fy)4xgW+!K9kL?rR+Ue3`*W1enxthl1STCvg^f|@c5(X
zSfmhpBs^7f+aTm5b5cwdi2_-2JCLKfybshkDZlflsk&PCO=??uyNtVme*0iQS-gua
zM51iADl?83W`eA&i2kXKbi!6tnDKNVVgmv!6Sn}3)`q|Wy>%A~(gc<^6Z1Tl0JmVM
zENYwFUhL~nREg)gJ_Q@3#h>|S4lL=|ZffIX+<lVK#Fu2{&xb!2)N3`%^|eNEaA-j8
zW?^EF;sYawmB&`HFnOk2M^^@xs>~Sjt~t_;xqn;i!{_Ika{~Ny;iujs$QItFHV>ra
zIqsEF_Ad`Z%hu|c(w-UzdiLT=j3{xn!TMd3LrddJ)LV5XqF;BFn!H`7D!3r2ymFuD
z%C4P}a2?`Ws4!P!zO+{$YAIW?K{41_ux{XQl!;7_Vd{|#DwIO^aS@-!%$X0Ywa}n^
zOvtp@*XZGG8fALlwgC5I+$@PzG>hT7Ec9v&KzCS=p8o`$_d4RYbO1gI<Ebt~+5Z)W
zTN{dRx7);^1p%L*B|UT0MDn7fzQf<DshbiJjIhXf`Jgot5ZZ=vO2uZxRw~+HvjDlP
z3-AMA)K<R1)JWs<&}gMjZ0w)vUEQ5!VT@3`ydzA?W;YXU7tuWgK($$I5k*+Tz_Oaw
zQw6epozt5^q3w`3^4(_Lfu|t{ZO|>OZapKCKy8;@+8|_ee{6I_heIFw)<9Wp=#hp;
zHBw)2xbOaUTEG&<qteP-AIwbfc)90)Jta-vTDc%nsToHKGcR7N=tPO%i1vmL7d_%$
z%WB+*g>RvWBsv9ZR>GyXF`k(-vt2gHK`}TqTNf0y1l-q@tFz#6TPnW94{F_X$kXMD
z7#3x>P{>=UzrYxB8FC3}R~VS$<4@&ku$5Ub@-n8KZ?zzuEj&6&l8N*pH$uFk)F#`X
zcvxu2@@{%9%W8D(inqpNt3U3UCksx&)FcpK)Fh*=`f|Kka8GH?&K@`$CsUXC?1-~#
zjP!-O1!JzOL~Z-v$pE8fdW0PuEh?hdFS}$PKN9hRNJ37nj<)jZ6(I=H7EQMZ-UDh~
zoh5Kg#?M$oF<gL@#RfssBp3R~{pqqFUpXO0#oq_dHB}AZOg)4Nel~7dq|JMt)Ih`Y
zOmK0dXn*=u2VVPXWW%3n&5mk`_cv*TeFN(~Zbe;To^HX%gd0rLv5<O1)llH4<sQQt
zt~fd}0c>N>y^2F65*(N9$LkK^304i*pZ@!5D;SJ2qr~q?o)>Iq*$rrtTBAQ3;<1fK
z%$T7ZX?IDexj&D&+VNF2*_6(St3(05k0LnT%7csfOFEMA`+CnY98KlawhVp=C{F<b
z#13%6DW)iaEmGvFelOM%QFJRSKCsxd2j=_fkNibBMIc?Y6z!+5jFV|z2Dbk(@5w4w
zGpTZ8KKNPM)t!531p`BYSx#7RuKlzR9+hsB7l`$L55XNQ*THXo9zS?>G#^QqP#!v8
zl?U}Tze#9N7e74$D;cNXfEKSl=E_s=C|pv8j%jIHF5Uz_tGN5Tu$w@SQ<}+WdS~uY
zoJ2+ruS8U*jjV$W#lm44Aj$1)W|e#c{Kw^x1jn(V>~K+&8W9*oH(Uo?M!(NHa$)@Y
z=Nam`n>5tb8Euo)x~zD{r4zLNPP(^eY64K-BR75A<Og}C%595f>mAfL(PSi4qexQj
z;5%s^@L<mE5Jy7^l1U$s_3hP*3KCt<H`~S2*Qcti)6T4NF-X^v+sB_!xL=AUn!m4%
zj@gSk2(QenRwq0z#_1zX#Hg)ih)X)Ur>?ueN$6x>F#FEBQd`|_22wRZL;6F>oUSI2
zjVf}ZEyOA~)*B``NruK&Eq06UM=SDxp?R2ZZo%(xgP+$V4<^)hRY~d;qqJZk8qDuQ
z%MZJeTykUA-gKeKR`!qkO>xvYAQz2Ipdi!5L-Dt`ErK|vlz(Ev9U-h~NOf7XG8@)j
z8}wL=URpvOD9YJBWvFbk04Vh<g57)HIu1N_%Yc_<iVh_4Zu*}f|H*~-aUf!gjYrW1
zh(*e>8(!<RhXd$_u&EjAoaqnq%Td=T-0qINiX|XA@4PgDhpDjNwrq;-@ZF`iOBc3%
zzS@svNHtz1fhTV?5y-W2EBL@Dp)oKN9KJd^7Df$_6}!LM!Ow}j$Xn{cy8|5sno8VW
z#}Ak0w^Ka^ArdURT@akwM<fk;$AK_bJU2Df-<&O46xu<$ZdlBbh#JpN)x>XLYF*Mw
z!dH1g(`CW>Hk+zga*cNS+f<-`ud(JSDOBCRMz|@|Y<hAd9XONfVUSzwF~zd1!mj^m
z!)aap*;$7tYue>&u4YX86?QX?(G>L9iON~;2-!1=wlSz}h-3UFBi}!R67e?BvmCIM
z6u(#D2diapAqH49+c2&XQ+ba~>47U>GdV3nw@}<%yAbQlTG4+yD&ww9)^OMR8{6-j
zzg>@9;AOV5Ofm(o-{8ypTvuWr@T8!O!wV+X(@-Bm`<_s6!(Hagji!tk=h3;BcDQ0r
zZtohXB09F4qB@EwK(3h3#I%gR^3skbYM}?ax)bphJ!FdqMR(^HS19duRx7TbOj4J4
z%W8l7&_R1opmdM8&99Vw33$3#jV-$Msa)O5=;9&BVIrEc_<w8|;nss(kKh7xIC&!l
zz3;=S`bvd#v=cZkXLH%qPX@ZrreCprO^v@d0@b*nQAxGgQNxT_)S3(Pww3Q4i4Z<l
zFcA|N1-=EY$a5Vb*{}*+)xCrp3-?78zW#)P@FpPAvuYRYnO<*&cMX@YY%F!ZdFq?f
zlq(<j;^#b~(`n`Z#9zgXC+OLw8a1C|9*0&Z0QHx5WOwgTw%q$1O{Ghh{P$uHvxcBO
zXA+sB(<7KCbz3Je<fjGA*1CLqB2M@c`$p=M%Lkp^=5=&_8ZtO{Bfd`7spEMw`?!K@
zUXPm=b=A3n9)%Y{SS{_|#;D6i3wMBFHTo1T&GeRMmZg0AQAvdJ`ShGxKewAW5B<b+
z&LJuXDLx&a9AZ-d73QI{XDlPdL_?fLIt(Fc^i}lt{P;}Kl%M531FoHAO_u0WVbrze
zcuw0zntt;+O^McFnP~-O5u8A4q_;VQgoVkf3fJCStrhC(z#*ZKzD6A}vchx?6yXHX
zq8h%a&&7F&n6}tapR6k7I>nKLy~<C1X)KOpXP7cg+UqF0s+%8WIyk$mr@NQHJr+@*
zZ7DHTo5Wx5h?5{qx(}^x)Bbh6gJoVIHaAE+Y?ct6pZ9VRjT?LtwFByqaW6#Csp(0c
zM12gD`qI;-X4cK5yC@_NZE8I4r#%R}9LtCapC{R`Z%x<@`&OA{E-N%|4O<nDXQ%<Z
zGjNg~N+!*TI85#+lV0gpyIdD)A-cYsp5dRQ-GlHn@8Hls5<!UZP~F%LJ-q@dKt^7{
zgbBsl7@WJw;d*9^RL;qoe`P)RB)5(tH0mN%C_JcZWEJLC$G3D%QFfVNeCQN>c;?6*
zR^JJh<E|?7_kfqk1bdtl*47FMEwY}VCT{103%xZMNe7~Z%LEnWBJEU>OV;x9w<&&<
ztqdQ{!phYZV$WnOG!H?(6b|4Iaw^sKAe2G%*<8y`Qcp=_6gaXx!$UN(Ouuo4oRV<B
zS^}w`Y55Gxd&2i%@r6VF33qXx#!$Y??(hY%3s=Li){k`gAKWIkSj!>yx^BE&zo>d=
z?NAbE5AHEeH8HSbDe<jwWGc}#nEv4vRf5v=MGh6g5sITEJ$Cq!+s`nU8M?<DPVaA1
zvcs_?7pVTg;6uqXm05>Xdr`eRsA6j4i?nh6Z{l(|uU#_pShswbN75cIz+aVSBH*d8
zrl*zvH`bV&?%pOtGbz<&xyD#rqt_Wnh;riA$x*QI4oNB`Ej0N!W{<4mK{XdToU`0#
z6Y~7~+3f-T=UknY@;^inov$*4V!rz^OIKa9kMT<E`>=!>WQs_@Zm`fUNps6-u}P+N
z*9#TH5dK%5c4<j9yZ`L3iGI4{8iDoc#sTet$k`g@^ycoyrusHC_M0EKCW*d7d)`dJ
z5*5y#fbV3Oy#K5cg5|0%V76?xY$O=*#nDxEKKb>ZPZjX3Oo6kmXi5&xHF0|#G;b?&
znu&oUW7ou?#7(=k@mzngurm~fS!`uO7#z}nzL_5f(O7Ksq-I>JfC9m59hUqX-9dE}
z@xYtxQ5qX^x+wEuEaYQId3$)Ev-?%twx3Ae2b2`Lsn<X=W{Fe+cT15bQCEE`uST_Y
zr9@^ABx{Es=q^h$JK^sjQ%`ZJ$R@<DfA=!p^3E~6ibim<I{b!`0?sOboG9Yp;AH?&
zq1o~sM+Rd6pv6UlEQdFb!)E?`ix3yr;j!xF1!MLQpy|trOUMLJ+BWCK;?B69w|2tt
z%3rp=#DiOGH3gGsoP24`8O07!A+a{vOTC4HcQNIJqQn6kkFL{Tq=y5g&4l`aaII?*
z&5%vk1$I5BwU@||c{%ZOP}NPh8U8;zZqFb<i_nEL$;nU^6TGOr34O<;L7etFWCs=y
z$-<l2qL^lPGr1W<Lq#X?>y4Q07FlRjjX$&e-=g~jJHy`6y0nTgf7(|Icp0mB_tw^|
z_Z^$A%pCqu;rg;#+77cD>JH1D6iQSdc(%%zE5)B93t7Qo_a?uH9h`VhwMB059Dl3;
zr>k^ZwCECFy&8FuYM)?{(a$h|F%FX6GTB}ram%uz?(EQ&&|1Enowp2y7j6pLm2VJw
zaB=6<ahT9#(xDNQs}ODlg&3i9uJ-RvHSc)6Kuut5HZA#1Oq6N7=>d()`OJ!R_IbzD
zq;GE_Av<=vM51$EFz%C!#fVBNX3c&uCu{~)oTc{uhfpwCch4|KlvU2cE<oIJ93m%j
zYlj6TXXMMH0*10eYX+Zx?L_~@UPqbA76O-E4hP$BSd{rhCw=<5rX2LckSOzqJx{-k
zG|D-Y)p-8(+JW$%8%f<=$hhk0gAiC;qmOd!elJvy$q`qJt>%~(vyC{{b$<Z0TQZiL
zo6*m=Z^aDPi=@nom;v$Y2)6CNO}`z;6p0#f{hBJnFyOF`qahgy4`pdAy2W&hi0t}B
z+#f7(H(xty&o(>K#7Ai=LHG}SH+WX*w5>Dm8i^Zl_-E+`bbOcWUYMhLL^v<ft4PTS
zm$ZoPE?E<u3}fQR-FfLX9&XOM?1%LhSBAj87eDH3agV2G<4;+a)4MZBgx92L-Ssz1
zs&Y4S>%&Q-&VR2U=3dRhgr8Yb@^-U6tYRlSp6q%bj>cn*&c-P?BCiQ(+nmL}qdpBe
z#O{w$<aEDqVyS?6Iuc0dLHhW<yR)e}a}DexJBNPt84_~+=esd2hW3N-uEY(l+=4&7
zQKaeatn6Yn6Z4_iq+5tMZWL_qz}(3pX`x%_N657dYOXKG$we);C=6T2d53#S(mzj|
zh7Kx$;vdPmd$O08iF;UA92GrNO&^-Ucc%qq6wfQ`6IKV$WaCa|NywVSZFcatQz3oc
zG>cX`j5q#}vYkhb*)%|t8X})OueDwJQW;e5zp51sy<6YJ!COnZK>aOy9USn2UvEDX
z=FmI^9QYl3&K=1SwZ2Io|32)*pX1`WMSyOmk{;9bW18%}JFTLgb4G@~tgm@`Nm?*s
z9r68BK5Q&IW*fjpQa(Q1attwt*cIu&U)Exgn;0@}fg0$0O6?3})`#3nnyXG0Nglk6
zXaT&9$yMV*>0W0r(9U`3_Vbu=!lHG8V6!^`>!?*KCHojjqCkqd;^iGahz>^JL!{hL
z<yXhLI#*>XPzvh~e2>_AZcEd&<(n+j$>97OyUtVEFSrx}Cr9(G0*J$NIjXPjZAKND
zyq$D;EAv5nm5ZI&%b)e`*5}P6xiFlK6@5Id$?p$)x@7%1ZI*oD&=J$*GIlA$8DO>F
zx4bLWnO$pIR8HL^D`*lXzJE1I&^;ly;AdxV<I%8L>dd;7*oj<7YxOl$tNKX)QuHf?
zy6@vP_DGqsUS;XJWZcO#Lj=b6$7lk$eA8VN*HYpC3}ca9m~2F(@9t8x3rfa#zil+C
z%>oseyomi)m7oOo<|X---!(`{DQj)A7pVt!zMx<Emd@%dcXR`(reS{oUBiixUJ-Z|
z;c`O$Ub6g^oU0os9@MhC9m{Nqk<QKZOGrkoZf_ZnmmCH=w*5>WSv)B00XgB^oS2GX
z!@&mGetrBJjAJ|XYf5=cKJDaKV&^oV#>=y@DW-A5AmIe^goQC}UH4&)16~}E%bVNW
z9GVIzW0CK&=2Z0;Lql|(kg<MBA%(RlIpm=5ZfBrs&3WcDt@mpqMk?}bZo|=;H2@Oz
zB62bm&Ot$;P?xWLXNvg1S$I$aPT*h9={#rd)JM2&ym+$c`Pv5~v~hkfKrU&``R7q|
zuE<UzK7vx`re3!BjOkUL5)iwUruRF0)&mo~SyvQd*x4kFl{}o~>Pi4#nbg`?oo2@L
z)EN>_sEe-^*(BVH_vjkZhgcjO4K~)VaV~NJLwTL*k>}h)J^0pe7&NKWn5#PK2SeLB
z83Rkpz>>fliG;x=$4D1~nPn&NJ@ve0B*LRt%gvBg<eLCGIm&xqK@t3EH(di<<}iL2
z(IdrEZ}9-_J$!V;kUqU=lh#xJi`UYIO4cxVhU6i)DGcoyjW-3073#W*je{u_)}R?)
zl}li^IL$T@0BmO{W?wwIBgRI>?%Eo0Uq_%LJ&G>i(5u>G3^={Xzv!W#nVEy9v2+?*
z(U5utQ(2*URw9+K6lo;1T_C6bJ7gr%AluugMU}gPAd9c3y}zFB0jQ`;(yyxP4~qi_
z<cO-cClWTVEg=W*pVOB>oF4f`?wJ8!ZlBURq3^&{mJYF|q`#JWgR)GE7IZgUzUY!7
z_=ebnbQ7RT_qQZ#u)ilTQ%shLe;5@#cWIwvgQk~fMcEwyow?b8T^9sV>x7gF!HCbu
zSu63C8qeM0_RvCaWP@0p$B(*De6!oUwXigm{fV^s+n3)D?w^8#n3lZ6Z&5QB6I>NI
za?D^b^b9rZR<tq~jxOh>FN!Q}97pu!Ag%Z_4Zi+5wd}o#$P_%-mH$zKn?HOG{RDn8
zp0Ms>xTve-QFw5vX1x&=y5&Bwp}z~)6pNJ!sx<lJ#f0_cye?^cT7(3X?x{TStinu4
zYs|gU&RLkf=Io7F0ls38j>!<|s(}y|lJ7IC+CIaPugwad*I-n^KquwOT0OaSF$PMb
zyNe#<3852xQSZ-*l04h<2!Ec)-n|hPzf1GYYtM)&K$OIZ+7TX-?6#fJx4%&H2ED-Z
zX$z}FM^z^o662}o*>7RltOu?pbZ?@qQK%gq(u(@sTpC*GjTzLFgRYuh)_rtb&BkRq
zwBJ)=<q31<I-gVCGB8Z+8gDzb_6w~tu~Z4_YvG2#aroJpz@_(TNyq2C>M@k;Wasn8
zmBhYJI}Jg&B|k;cxnr_+c2lrb97hYZF(d&6=E62z+L3&09efXms6gntNOrdYfMA_k
z?<a%6VHAo2hgVGGq-S-XZ-1fV@`I*|R@LchM|A8J1jhY=pJ^b4P~`LWju%TQ=lgD$
z_c~~DXJ;%6w=3<9lQ6@KXx)bzFX_gwl-39uGw;<xEi)P&^Oga{P3r3ykEG-=o_xWB
z`(36pM{>Y0NJd3*I|MpG2Bdw9meDahG_Cuk*8s=p0EzG)f5mi|x!}uU+@&G3c5E{q
z^aI(iGo%sh#tIq-&+t>4gXMeZb?QVTWzTZjNox4Ld)10U6SfDp+x17HkV)ylBr2I5
z(B;PrY6vo$-s&9lCQz^?X5N-6eq98sLL&dH>cZ}<)H^dVv8ezOPSOO5tv8+4Hx5I!
z=k77RDhybcnZ0lKg{Id>_znTVXvtx<Bs$C$0UPo?MW)AWa+NVVY}nGGPxh-1iz;nf
zvfmt{Zp<ye-3e}^lyeT(%$g9D6M=o#G=OP-E&ix~qZ2V4$IPx$8#&4<ThJKCIZk$2
z#a=UYegILSf&VL2dDFAbD?+oSViZ(z4hv)W%Z~V1eBQ-|(13TG;_IP<+Wn~8F)*jI
zBy^(1(R%I6;A-0QPxEqe#_6fZiPea6Ra=r>o3LWBpxV?nb$fpCYBAV1%3L%FA=(rE
zmJ&j8N^;8hTQ_2w#G+MB6x+GEo{#<#e8&^}F>bF=>Ol+EtQjiij>MI@8F!aq;KF`k
zF8_sCdtXLD`>f~9y9;T2Rc+aygl+W6Fm0n`KOc&{fai^IyeH)kgSsD*(Unrt`vVTU
zIn-FcE})hWQXiLQF!eHs%OpsTJyop3>(CcFlHoU<!ZFom+rcua9Kre9<a$bFF`4kX
zwG2Q}AE`7~4(kL{AzUN$-F3`~^OfRhFT#cyYW%oh#mb@cNAR5!9@Z<O#j$U}-7Ofi
zhY*vQ0#pXUqOruDTTJ;ufWlv8o|8_F$!=B!g*V=XoYF$T`@_N4$hjzL<wv8u^=9>*
zm|Dh@YPJ~0Uxt$JSjp5)wz&Cn%X?UN#umOz_2nTV_^e)LtcCT&PGIii0wl*L(m=_=
ztC<s+AtqWn)RAdhinq|nEnpJ;(We~wCEniOY9L(pW*~%jDdC+~e>CcOE7$uDZ2}&W
zGxmLB7<3zj_$lk7r`ce?Fw4eIqn7V|yZ+}m)#H2H*}f+eu!`LxHQKi5Tb%rm?|QhE
ztz$HvpU)*yK#R}P392?W<`jic(&(MjR002pn`Jp=8vPJ3G3$_Tpi2<z{U1Woyh8Vj
zD=SxsBPcCO-NDO2lV`#|Ce&8y^LM1%0n0Oegt<7uL-_iU{b1C2CeHqZkDXI?fP=3#
zOM8ODN!^!mv=et!|Es?3)L9*^(@1w;u1(||in36q$3NS?=kgq>{kJ%YVRS#Coh-`y
z$^h-&Vqr^iUfVUUwPKWn3^pX;_xI}0xZ?bnBy(TKB7uPK0jk&wxnC(mO6tF>pG-1W
zp>ZJy__Ri^)r^)aGt4_S5eknsDsgYTeF6cQ@Ht3%8eAa`f3y@_uClR22lbd-p-GMm
zp9sK^8Ire-4D>O5fvR?jwV<IC>dk-7Zl*iQn?g&{6WQOkx-<s+`u$tb;qHl>NE<h@
zS&cc&ZQ-#ja4HDc2l!j%kjv@x>e<qAGS)|}*UBqRJwKgM`JOwL%6OuEQVOWQZT()w
zO@3x9&gEh0QX%O#0)6?T9(>hGoT7Slagh^Mrh9fxESRS-?UU5}G{5nv5`F^DWd0^2
z-4A%<ZD`u~4bL~I{^u>bm~WihA@2|qL|h_+ZP5z~>dKALfgvfrFA+{XZ7IS8AyxE{
zyRFy|)X9t&iPo2$KU!d$kUI5+f#mYRdI$9<g=VA7JvN{HyI%+gg$uR?qk7QSoT}Gv
zxE8J<23Ikk<_gMez`jXB*u7D7SNZ<CUv;XxrkmxtQ6JRn^hfy3wcN;Qc@<Qio@^yj
z9j$vP{>3OmbTuE$tNEE;;Ave`Bb{o$k5zX$38bAAvFd8h4yN;U_wD>Z_%8aVo<W#l
z5N_23v{E#wr>AGarrZV32z&AFk6qbQ@xbv(a7ySCo3T5NG?h)<B*h<71=TJ_PKCmy
z_RT7Azn#uY(i>C|IRaI6;fp32d^gV>;?}C`G{j2JIo4^ls>d)~59-jgEtiyeUtz$K
z4+sZp<o9u1;ZShI&*7>%R?1F$$W!8xgNi!rt-1yy%z2li+BgKB;7N`%n@IlE{Uuil
zSW~D?6QDF_*B$~&;E%6lRdObPO_Tf@19<YCdrS-hb2WV{wa?D@8abfYARFkcLKAJe
z!e<aY^K$PZUK)(yc%_x4nmyAfa=y+>@kcX0C9~#)b*agEfMWrlzWE8{>goya<_@~{
zrwf(L8>(>rv*1)LRdEwn7Of+_&{$Q;9b#u>VB+RC!)#U&%&g$KFbGF7%ZO7U4lPS)
zG`HwRx~c~ABKViveK=+mjm9%OU_VF<_l*n#0zre?iw!zm%z`>2+OLF{CE;x&>fv#>
zJ`J@dJ6IqVj)~xrJF>e3;a_y`^mAR;z7MADQ%$M%cclx!XNmkiG*~p}Xdho$$5mmp
zx=qQT?qBZ3-?7FFY$<g!IRU&Xf|H}JpvUHVOChWGu0^@f=p;}&wG^(Hn^t1_A+oCt
z_=Mt5J;i4yx-%Q!wJp$aF3yTM!W~xA_t%Q}z{nRMBcEfsWfs%f_NHg+(sIaNl{w5h
zS4C0&l^9tm(F09vK00)Fm29e5X_zA37fPDVr2^uCYq2LQ*g{{^6hWx8`FDD-Q&*7d
zlGm8n-@GX52l=5@-Bz~nSem#*Ga6vHf*toc595!JP5uo+$IlWOwmY9$+Wj2v0xZU>
zFuRseuttVQ)EI9Sqv}6zRoNsL=)<IMr1r#<L-3%KeT}(#11+t>?`67>6dW7PT09u2
zdH7YyTPn_niMBOtEintxxgnePluO0PcX@6(+@yoUV%DT2dOw_XtwOcq*47$3WK9+K
zADtlG3LoG!h`ZnK52_k@e6fXI_*M~z6k?%IEO56P$pzE2W^2P-Yd2KvD0QQu5Q_*s
zWnD3kwfOi4lw;yMgBCcfT(!5vZWardQeJ;akR|`@4{G%B*c8qPcJkth)O%c4p(wp|
zzZm_wvDCN!m4XqwXce1}O=c&FJWTr28)IB@5z3JLak_uf>m8x-E=v^#R^z`U>7_FE
zsM|eeQhRT=zCq;uP(<^=;ZyNUJ*Lfqii;@8w|Dk-Z-2n*LRA(#GnSYu096dx=yEPu
zMNo)GZW4ix?eu5&zQ1^*eZ+;0-MS1(I_^7)WVmpZ@^C$|yH1|(;G>jT;s8cl*18*W
z5UH+C6V7r@>lRp_VyTE4OYCwQT7NQBF3soOCXwXCn;^rv{jlxnfOzET$WwnK2$wl6
z@IRM<<XC^suygp3OYeDul^;bw?O)V16GQ}eZf6u29LkGBJFNjKy94=g<VRx0KzWeA
z(QQ1V&L-Ks0oJQ>d<IuAhl8q!_T2VU8~p?))}lnUD6r6~OYAxQS8OXc9f9xFTgm6q
z8WEVdjfvKAxLO_yXybeNQv7G_Cn|p!fvz4FPi7i2^Mq5YEkCOWu3DBm{wOm+mYuVP
zHA68YGL#sN)3c@ar|f%KbIVxCO@q@CO}ob)?8_z6(1lEG`z*ez=F+vH8;Px5Gu0+k
z$^^M>NF)w_2x8ll@06*W!c~TF0GsxZDU7uZCkp(aFvpo48=vFf!fH>uCnP?*$7q&K
zGe+Qa&_Q}6@Y?`u;cys}&f+W8TeU-DnGq7Uzd4oTt5!9CXE~Y=s1&E~fLJ}!>O!|T
zQar$?*F>$&MPd&7<F8CQZ*dnxqaw^*q^kS{NxQzne(ceL#&fJ-<(f9;g;(z6GT9>E
zDF0_rY#-;`38JL~#|ka_Prk*IL?fOcvt+B!P&_%>KI)Zz<)(3z3ipA3c3#3LtRT94
z)yJXQ!sZIP@3UTCUpR4q#(L3XX-DR<S*^DI#69%fV4hGXX5{qFiu}~3lromI%B8T_
zr`>fi$V&JMiOZ}5g)3(Qj_S0K&5jX4z$t=d>ekqz^WFtYqN+{N6G?(W`S6xF^zd|x
zmbxLQxv0hy&}%s&-RXi#L&r=dz{dZtCei|*_ar4v4`=GSk}=~ctR36AHm(Q{^fViu
zNc6*|>ncEW%%~UKyv`3d0mK1el3mpHauD{2<EOUtQ)A4<D-bQL6hMZVS|Qa7<n22A
zr%CQr)C+w~US3DAQ7?A#kcu8DsEwD4QkvO}i3F3*CExkox2rH+H?d^^V{@yR#qlbw
z74G&0=U7H3ZS-JO$`+-YV43;wVXZpf00>R;2{U~x=;Z+SOfgZAVyUZB6(Q^=Lo+RT
zpG8Pi;$RKFK-ObHr7t<97&Y(t!_8EVn-~5Ja<SV3oQ^GYhquS_-J16=*;mOJW|JjI
zF>=;OXNJD;9V%8tJ$_gLkrm#yKZf}$iTp@>BnkxN*L3PXtR9H2PB>1&K_`hUnyVz{
zSf0u=((3=5jJ=S{mO}l1_2G{ilZzip$bne?KJ8<aQ}^%}64q&d6a5TN6y8=(@M185
z{~-0rCOC2NW=v}^!HWnv70)IBLn|-SG*hfknaS>v7vX*>lHbM-x1+4K&_pk!@uQ`2
zdVZ?}{2#{7VM`P)Skh&lvTfV8ZQHhO+qP}nwr$(4>c0oQ)*akI5BCe~%#4iuVvSK8
zDH9LURvr$0uWMvH{gR<IFfLS*t{71x_g<$X%V?94G@<LhaJQ;2^24h9PYZfb_XRdr
zycR(uxn677%LiBH`*oUT;i$~1h54H<!kafK<!ukQt-&KxCe7CQ`eWXFc=w<NFg?*y
zWC2H^h~lS>k(4F(xxTbY2uxS+Oip^_y>;=t?a`v|Riqx-<is~KOQWRy@g93J?~$>i
zzX*EycB>!ydEpqK$*OG}QT3;jrl6ZE|8B5NNRbh}khB<2uyC1?joIm;2D}_NxK?3=
zJ@k^*y>W4o;kp&aZJ6q6X?smg3LRt*<Y`#<dt?c}XF1Dc0~LVP(}&opl9WfacFpB_
z2|>4QAbdrx-DG}A(f5k;4C(MWn6U5rM$p@Gm*56j8XEk{U8XzXPb!zdBx5$PXYl6%
zn$HY^BD-j$=MfQ``YUuh{>Q%%0BS?3UQIjuk(rGQyePR#u?5TWilcuqZDT=+FPp$1
zFmW#l-(G;@nnJl{-cdtc$;btAj6`Iz;YJ6vQVPvtiMk#SYqAKVblu%we^)??u&P3-
z^b@|LBJaC_iO%at)mvHZORc`*0!#ZL^W$LyP*E@G$O!Ak#H4qW`B}V(B46tldaq**
z_^A#-Y_AAvnD&-~FhxHHUW@g*i(W%0uo~_^O~%uzAl3gXYem5)w<&BX6Yo_1Kfweo
zop$oom2*{IOr}JU!MFNYP3`K(8c`253Hlw<SE-N^qGRHE|Au3BP#)GV0D)5O{8Xkl
zUwErHS4;?;xn(+l9mQKZ71kyT&*Ib5LsRz&Q<6j{^ukMX+?$>DjX_f)u}*)8fIDl?
zQD9bTt<_J^FQ0x-+cBk8?6*v4(O$pX%nsjJ84N{i4>2h0?kA{2e($3NtNo_m8Zgy}
zuK8L{J><?I_C3&1ESKA+N1{Q2yUy_fAyF+I#m&UCs?s4LHsh%xfZnUu8XB>UBBEIe
zyAtA9REI5gcU?DX&l9>I-?<8oo47Iz7=;V`40V_K#lId4_{?N>7+R39#dMwGD41er
zdjmR%zACVbDmM5g&0TA>i!5Hfj3S)^(J|1-5pBK*uF4$u)LR3`(;yoJrYRajt8{rU
zc5$!*!KdNL$0u)b02azE^2o+U-v|JNab-iqiBHm@9=vo6O4{Pl5ml}o2c~P7U=-|e
zDPdiI$alLm>q*4eNT0-{jPx1R0v{U9!4HKYZ>PRe3oY)5mn?1Ihl2JMe)wBlQZ81~
ziR$O3hMVs}%CZ?ufB5LbApSo}DvODew$>aOV;AuPy9=T&#H&tjc%o^%cde<+y7m=O
zVxE<8j^?Aw_i3sTQR8p^s(%Sh!C7%-SCe)A?Q^$g#DYCztR;N)N{x#rr!8(rgJvge
zT8E+FAp8q33UFj5&@GoARQ6;zUPvd_Nl3Gr0-%V@<EP3nu@olTrb->r>{*E5c&7M^
z4JzAMU!j^gduw{3OItL6#P!Dvu;b=MVdfl0L+m?}QRgJKs7aL*V&Tq{w6QN2=qSlO
z$RJlvdkw{N)bEtPBS#yr7>X=oYKo;R=!{|Z$Z1)fJ)oxQ@l=<JyD^N3+XYF_1_zb!
zK4UP}AxP6#-I|V&;n>Vkgx=G@6Y|=?%=}9|nQVD96W?j1mi(8*p$k#&Mcct){u>k4
z{0l#IBDjV36Il(GZ-xRM-?i7D@$w5aX~D)PD(ASYjndkKaiO2db5=czgb=T2P`y2o
zrO+fY%}!H9mN7uE4rJw6D`csfC^%Rmnw!G)Z%OmDb=X$z&SM$lg(#Bx$-e%Q$$M*_
zr#la<o=x%7{j&aYDmmXW8L)=D_7#R1^HA?>=Ptvt(XAOGbL=ILfrpjZU4Qel8EKOT
z-DA{X?n*t>6F91^m$6BA*)!SV;cg*O{U1Mdx8nwj<Jp&ZNp^>p9>Usw+39O|jNkDG
zH0k@`k7Z+x6A@&gxu!mbMbgDc4R_Az<9u7-Q}?(uv!sf2|ICy~>LwNUE!vX5(%k6i
zya0N?xwExVfr~<9_779whnp_Wm4CP`gc3U0?W4QVa1>pY+|Ux!Pkr>&yo68dmQk!^
zwQ5g+!($Bipq+AC`>y~b&*l2Q6Ahc!I=F1&4-VtaP_4I7dc7J;z;B*J3b679>s}F+
z?*b{V;hOQ?rnMlhEexkd6sgkY*w(B##MF5Z>X1-w4%({$PC~F>?DEbaimcB0j4j&w
z0x>}qo6=@^6ri*y>-l2F_h9_3u^ysE(?(Wa54-_=O`LC1=m$u#%h_ot9-iB{?Cczr
z9fjY&0I888Tb0TIScC(Gd<x^j``mnRF3IHk%eQv)Og1S=j9b?(ZXT3Fw2fJq@e}Ff
z8UYDjp-k{3tR*PR^-A9{!wC`R$RlpNzzVMV2a<)|%`e7|{e@TOa=8d`%r{^KSa4YH
zboOaU59ikpR`BAX#vRRlG&~|;HDB^mml$195J8U7(giXXC-Tl!#DC58{trf1_cGg<
zqwUn&=EI$gvMNA5blvgUdO)B*Y8iJ#b2Plg<ct1e7s3Y<(0<-&-h)8g;~{y~JgrHk
z3Akw<VHs^f&THEv<-A&VB2|wZq!|~y2H#Mpg(RDHA`NG*TjQeg)8SnlE@myRaKN$C
zF-wCJg8`bMi#}9VpJE9ZgzDLq37P}f(W@1rlK1T<Jojf+_w_dl0@Ey*9j0n2C5Car
z5P&-1W^<ZCY~TxW-OQo3WbP0f=UEyFM~UMA-vEx7Q0(mep84>Ut?=GLQjGsxd4-2z
zuF^y8CA?CihbsAvY{EfDS)8Z<Q4+>eb!3|cv40LF{F+T*@6#ZSin$Z#=v_(=+tsI_
z*gO`?>!&6%e6ptAn2&H1p&=TLBsZQ8UNz0_P(&0kkX;)Q_ekf&>cM~2yNYzinn3GN
zp@sk_(iS)cYqdc)@q+8f;3khr3K1|?6o#zCQ+pCh<-`uE8{v<~;qB`ydBUOyX!xYv
zn~7WsYf&>i`?aHQIoDO3hRLl(I5lt*)a%PwY?dL3!#1*V$M27adDrGvcf9#m{&KaK
zP-iyBO7!kwfKx)&BQ*H(E$}i<;VCg4n_zwj&cPo!LN?Y==2qcBY3@{l;=U*j1)1-y
z=47mu?hhB~GHMX)<f&6!mk|>_KlKKv^*juak|2_1wg@l!v`ge^C+N$yA<j83>&53U
z_ACmrT*p1rw`|Md=JwH|lY5$g_2!&ddu4N6_8|5a#4$V5YQ9JPKXC^?p+28re+U8t
z_rZabdtK?OKIKTkZRT4~h}DEsC9hY)XH?=^f~k9_ZhalsFej?#XQy*Yjh&9nl`*%G
zpuG)jBT?lnPYTWOkTx=ezfxS5+K<6Dmq(`U6xo5G<dQOg!oou$bX*X<QTsI9JCH+?
z*Ro_=(T(8!RyuYvofrb~;mdP8<e?>)LBBXYt&}@hbjFIytna-b+yt!y)c{UZVK36=
zD@DZxq2&rKSGLYDb#p>0NT7x*3+A>eTXBvV<o3GsOlu{fNu}Oz2bCC89A<3X@!9#}
z<{Kni92y<S*{Y`vbPnk!bkgrg;N5t{v77fyd5tJu%ZT`py}h#s1&xbIk$r4Sf}gwz
zH;b#C9B%H2bkaMB@Qzowz1<dbfV2c238wkKywo&uRmpOmJtkT(slyVEMn$C_c%9_(
zuY~t>u@ZCM-yTOD5D52p-E$&Kcp_bNgVE#Gj9tPNj?(j+>LQs>w|m>{Z;fyi!nTYg
zmS2kwpY6F2^&PtoJn|BWwMAS!(9RgV&^ZgX_sHS15T2qb?_X;y%NDf7i%%AdPHN{L
z_J<Dxo?v^BTJCfxzO|i8@DFN_Z@fSE@wLusHwD*Kw)eEqAUGW59Vn2JaeFzj=IT^5
z4YQ8ND|Dd^UVD>UqPQ6>ip@%Q&NKrZnqNy@)p~NT)xY9d*7K9c|J5q|RiEjmvh9}j
zMO<3Y3BKfS&t1M4*Ngn+0yssZVWrOO)V4E&M^)(1IiyA+ekm9{bw5Ki9V7gyG`(-U
z{$8M6k3*3NE;J^FdM}>Y7l3<1JSf9dBm&FU$NI7grKh@~-eWD$uMon<m0|`Z!_v#;
zivOCmI_g!_3PFLb%dbms<W2KVk5y87%3^)WA=i^S`F(^kL#zs9peR_1mT~AAWZwrr
z_WbLS`y=8zCR=>YO;ho&P*W|pHZij-P;^cx)<rilDu#+KkI&nd9F>sop$Wb>T!(81
zu}^lap2l_x`a19bh%DToUtZP;Xe7@O$1(PbSeq1lIbq(qG=2++EG1FP1gM#>-LE!r
zc4u<??*=mD6qw~QsK$=wiJSNv>;3os^9r=M+dRqb_1hq?ja@zQK>s4@h?=2UJua5^
znD#klu|Y-8A=mPvfZm6j=eg|^0FP>ZyQ_3Q(~mvXb1R?56_9zkIC=Vp702J|nytrX
z+XnlJo>5whloqHdg|&y$)8-$Xn`5Ufb1ba*x88?VwbNaTN&&F$yxT1V`nTRrzaQZb
zKIAI16j81DwA*NywXF0Lld3=Gh23`9lotTVI&I2=k=$KMar=0<r<yIfa~?HqR}WF!
zqQL&yF#oN-b<Le&v7j0De+CdT9fpYxSCB$dzp+I9k+7opXT1*9X5>)~x{}s#KPH}V
zX*N7{i_rY?jAJKRN|i*h2!6X{&lS(6lWqme;wDwG1I6QQLsF%V#`=vPO)LOc{}0Ic
zu0pk#waKd;RM!|~mAshAsN`av*J1cTQ!2xV$?Jq@JwNzB$N!pEAa!Xxa^gJso_<RV
z<QQM9bh(7%Ms!+)n$|6<S_-V6YytVq(#kLivy0r=!h!gk1@E)*&sBH#XUfl@?<RlE
zjWAtgbN6GBIk#abjjN>dXI>+9;vM0C5iPz&N9jcNQSHMO;cB6Y2)e)HKT6{((rXk$
z{C{4HW&1aBD3P6zhV$+KVfHzv)O(A_GL88x?J0n0ia*USS@1g!4Nn3MUx7vSn%@=N
zeIk*Mj}MvbS4ul{uAtnC5(LfiA+rr2UTy@3^5$0wkywsgTx94*vpbF(y#~jgdDBsT
z8WUC^(u$AkB0w$%cFPw8CHejaFF4&r*jNV{3X_T(O>=lnPWxcBEMPBG^u6PFjySk5
z797_%`*1!d13uet%??_}Zz)kYbU)}sXvl}TsPC#P1Mwf?KUP_izc1O9Ii@%ha%omm
z^nj8Yp`F@;D|G94mmJ2PWNu2=LiZY*fIFhNWlh0D>IJd#6J6JW?jN`Iv82lMvW^XC
zN(ld9r*prmEzPtcd!~^<lleE4xVuv%IfuP&A8!80Rxv0}W9k0PMHdXeiktb=H7i+m
zK+=lzo*5fRU<r`5T&){<olwtrq&4ruQ_!}H7esrZrEI&|vyXinj~|b_tBh`zbtXIu
z06P<d7m4`kkcTzM6n<p4x2OQ^*SuX3=GgVx3hTB6+b$&f7owd1oamY@cCkxf_<*LD
zwPbUZZ_Ha4I;`u*pdG;+2XrCSjs;jGTLR3#004C>;a%zX1+}S!yyuCcZ><n&8FQPY
ze9C``IzilGlDt=LJEC>_9}Q)vH~CfVtr%T5sv#|vdpMkN-!eM&jO%iUeVpX*nzkr3
zLaMs`)yjFkXC$<X>p<OqP)i0>hA#t+48}#MXb+W+eb<rXM=%jqg6MLv#PJO;!<5cQ
zIBCImPPyYDkcuC(;C4#eggmr<+h)aG+zRD*{5>19boq}sJ5e-fOir0iR<1k8r=o+A
zU%1<}u^S(Mb#XMW!a==RW!s%S1?2Ac+X<N{pUZpV50Pcx-%|xO{3b3>c%asgdyYyd
z+yH~~T|reHSWDc_bC~!!kIHfiec2`>#c`tsAyum{u@(1FB4Coo^>5zmXU=uBKW-f{
z`HQ#N%NzE=o+t~t5(919L8KGqXxHQ)4&G;gnm^rVti+La;;JE|2H6Fu&7CIF4X>B&
z>`&4Wb`-yn-iS6K5)qFu{I<;qs*RhbrFX^;s7xs^BfOWJ7XpKWaZQg|<mi1aTsHdu
z)m@xZLh>^hrTO+CHTk!(rcgkZUOsL20{*vcvekERCa>}wV6bAVAC!@GQZisekK{d+
zaecU`dQ#92-Q5{sXO;PWp<p=3gPom@VS^n|m1XC06&1uo9wA}qidsmNhmu)g%zlrR
zo7iD_;jQ=T2{K?oqe7M<vG|~esJ=(rmFm<u1XC{J1a<q~p62MT;LM`ZC1{Y;e~ok!
zGzu3-mKUS7xZp?s<ne<3uh_r<zG^Q<nuu{geJ;nf02?i=54%WWb;8nos4C6ubOjd;
zxt2Ad=P#zu#9uAz2#E-9i+!=$>K8EHyF=C~mR4Y$I#y^8ZMHWUcdM(h*7ZEE6o4b;
zTrfL)ia2l~iZw6^VG>d#F^W@F;E}LNml&0K*+7kDMN!c#(1<3iCkKi4X#8H`Bg*zh
zf~WDO9iZR(Gd(r=bMwf8)+sunrX0gUXA!e!%`S2YNz>>8u8XQ#wa6M2VFGxX9D!CD
zxjc+d2uL`z?tQ$=k?KGi=A60ndwXhUlqS*%NX(-Nyd6O_knB=Ac;F6UT%6PodH@wy
z4&_rpT`bgzcohfLI)4|OHqH@5of=er$A;s|?)V}G`i{Enr3!WZ3y82g+sS4fs0jfI
z30|+AL+Zx5Ks+*niJlRmltAtk_iZ=_k~n1;b29gP=FoS&p5ECFPzAzJoh?&+fZlBZ
zskwaF?&PHbvdq^3E6+_|qCA@rWJc06Ady%N`>y32jy`l2{dh>)*w5AUBrK}8z6fM`
zPqw1k)^lr>o8@Uc#QzNrOal&J(1Iw2>Sy705LQ>9o<(QnFc73zR|2?oTaF97z~UNr
zp>qi<OZA_7t8~Scze!&(q7vt;%g3s5S+xc}F~S7tJ*J*o-Fbvr`?F|p>c*4hX{a|R
z)-ovqv_9fZ1AH1K4Mow;CzBTi9X_zSRP8uZ8eS>Y_TEdS_c>P%axtWeSOl3M*Tc&m
zRRQnmP)}|d2~nim>6WX+q8_eO_I&ire8g%_hBLZt2aKJ>wLC!m)xl(YQF6Vy+^!?A
z%{Cz%QeyGiep_xrs}ISo{|cg6fX{hds2Rlr@$cP8kIpPIc5X8@im|T2NV$3iIe)~q
z2WG4g+R4C0y*{}QL7(`wvX0rsewKP1!`;C2a2PvAu}<{P8sAq;(UtO6g!=Wv5HF89
zj<Vbvw1{;Hc`qc{`S8nccM7-7L}0Q;&m5<_MUP?@i7~9@>xL?g!;TKC5C^~YABtNd
zw|t7##x&U!h)Eg&k^=CfUi2HyHSB`*ajjMeEdb%>6QJpO#muMKE%x=GVXn?Z`rape
z146J>qnE+49C*M)3yurEO?yqDZ5%v$(J5sHLbbENhTM2{Gv=;n2lid9Mjz#Sxp&q>
zew}nXz8c%jJiHD2VUG`{wwQ+QN5F^d2VjCno_1oT*`*RWFFIQm@=;iDOV|w#im#MM
zK2o`&wW6!!iJG!U3_6QE4kiKsTkJxIQf~Ni#(9L1qXmz}PbC^gbHw_`?!q+*Hf+%9
zMLY(HVnuEWnDKaYiwX6qnu~@&or!I_M8&Mel;o#^)E((|R#QHP$e))}jcL#>-X=b)
zjWQ^sS4lE3{cFeaFgLxzXO)}HtSCrQVo{2-s1ef5hl@kkW|(LT7*(FEg-`8$B&#nK
z*%PSu{tQ82q%#Nqr90&qSVzXY0;N`~R|Vo_rO>0k5}E5E&803~w0OONzMfh8AX;Jh
z8gLZt4yxUE?xW=*K>v?sO~Z3KHcfQk2$4QO#`&*a8}8+PogbJkg$|1F=8%TjRrq6L
zd(kjOVhek%P%DrSkuA@Pu>_+2$XIIPKxJA8R<+B{jvaebZdNy3TBx&^%UhpjUxHSB
z%(Uq3ZJ)MhdMTGb{@XCqXC7KZ95LE%WA-i38t5ss>?PX@3-?;V2NWr4KlN~n6BU|*
zO1QAh?D0iHl=t7@aBj=Yj}pijGehtRUTSi$wp_U2*ZoPIjL3IMjH4a~&IQx5sWQqC
z+1P>7WP#2>i?&Y2D)jZVj+0pNE;!sCAuqpL^B{_r`FR!b&}ucxeE>*2m%{+$&zD8H
zpUz<4Ulaui)rR^$%(4DN?VJ=X4{#H@PmFPd8k_5}*>lJoNmvPM)Ra@Zx*jk5YpNUY
zmo@UXey3&rQn7%o;l&=l-mt_@7>?H5@B;{$aP{`<J=AYSdHkJzX3(Qrr=Ui4O|@~p
zgraIM15-L=e;;BF=sPH;XQv3RHr2jZ32+v<x1fRtU56*knj71@9Ah~VjhS&fl$TcA
zu{jhvcnvSHZ}Mg1m4)rBdwO^Ep8hu`oue}Deu>0u%>H{bqrL>50)&_E6<JrwF^PqG
zVOv%A;fS*4idC>f3O4F820WJ5l6u!^&g?vCS}Z~HSor=G1-x!ok8E8VGv|b4jJi~r
zXw2`l5;qwJzudx_e2)Gr{3$2_xG~+-y3V5ZR}y;UpqhNS)vrRm`fvI_{^RtTZ?tq<
zg%(vWaEbfWLq>sc^Z!iIfneP(UF;>T0zJVXAtyv$Ihel<beCWE#){nyYHI^N&ilX=
zzt5ch{~8>$U~Z&O)~yS%;;QS~vtUh$X*L_0Jh|W@L&k4hH7}ZD*$rMQ!@Qq`XeU6D
zZq?TiL;{rf+ySjJ<QBal`#+%-8scg}#AGmOeoshvLPa3SaW(z02CA)V3OJiUwEwG5
z_av_6@ssGDE|pY|@~caZL>TScK44}`R8#~EF0FY^al5uftE&yQ{MYyi9uzOu6wL^a
z0j@<-o_M@)*)iQ%T%eN0!8!2*4_E?WUqSnv^3vFBjJUZ#fZt@lWPyAz;HbL4)Z~Bs
z7!cvy5@ncB!%oQvp}mQVyv!F1TuSw=gHN7D6$;_VponAVIC>XcsZQv^hL;(qq1(GC
z0IRVtGk4wx4oVTsvHFE66a8~tHnp0stf06(vXA**Z+P0*dC~mX5_mT^0D9wg-s3?T
ziLL3Z(^a3+fs%DVxGNNBgO{GDe_%0EOo)pxOQb^CA!QyXLVeNJ?tu!NZxT86s~#ws
zJ8_w}Iy-Z&@A>7M+U;w%&tMeiL4M@YQc7UO`wV{&ORXfbX9+?3tP%I2Z4$HH86gNL
zJjL&s2<H<ANaCn8e=RM`sEbQ2bBu>NGlEn?<2fNrpzhi6fZT90&fHM*{*ckK18mLo
zowc(m%qMd$BQUt?bsu_h)d<0QhY)U`K98M3YO2{&=k=1MM(>Kh6Rv~8<v{q#ghJMB
zSLrS>|1gyMUb^3xqTz50HCDrova2Zt>zh|KwGf;svjwK)8W$&qRFL-ouZ?gt*$bHf
zq(YqA!z9i~3~L09)BG2H<J_C2YIR=X%@&na+}u2JY8Fa+Z6r8Kls}h@WnFf86ic`N
zB$_)+B&o=n38O}tdAK>=)KTacJ%n3yXVW|W3U2l6CK4Yy<Rkw2H%h&5;IQJ|F-RDN
ze{T|UMPGl}uEs_*Ui)|!7F#VT6<mBhI7Z+{gtHU%D(?F3yBI2eNcDAGQNj2dB94Kl
zikmyEz<1%d9Pkr|+F`@s-P(drbp%)k9Wse2l_8y-69f>NF+$y%E4Cf(j?j^IfCpcV
zG%K-J=bxo?Q0#0e@LHMMnD`FQc^Qu4@!K7c!HCQ9g4L_oO!D8%&C*nJ5@OkKrzp1n
zVNE%v?W!-zxVdiRnAg0%5wme%56PgTcifp=qFD_uhTTzA=1$PP9lEM%m9J#{vnLeJ
za`l{Qa}@tOIz21`+_F)vekP^-^8{mpqZwo20!Zc7vtFG~0sQS88WuALf@|(-s7(Za
zT96a;lS{zKgx2<p6hU3KqpjZY8^_cp*4c0Q4}skCd^#<XUc_pU-On3Jxo(6{vxuOL
zdHW)1)Sh9r<3gyF#3_A(L7)i^gKx}0TO~Ynn{4vQis~$&pDm7_R(4ge!TtmdLDzDz
zLkC@mK0)Fbp~A@F+`BH5Z~VUVlYfk~gFu&%(ODjDxG+wfED+cV3xGcag?tBonVUTa
znBe12L|`Myc)J3IJUS5emHgdL=tG1qedlzT7CGT-__2R`x|rYyTm2%}ZI@YLP7{Y#
zxLfBC@F1E&AcaUGz5v=1j#|xUu<pi96z=cg@YN>cWgz-*<)3DdR`c=8AClJ?R39^A
z?{#ttR6VjALREYYOH$;XE!tRv7*Z~20^z2VW+v8PFVh`_b031TO6n``x(=4c5V+<9
zy_cRM9Bv<Ez11It`>=t$?f7ictqA&ff0~3M(wWLm?x+dy%@ztP#baMp8P37J6y3GT
z^GZG!K@vy^rpbOaAdzl>QXe(?L(x>3k|+$)Z(QJG?LVJ)-DphHBuo?`kqfNTVYzYL
zkoelHXF$VriiF!9;^?(JL(%#GB_=vna|AX>vNj5F$;VG4TT~{UlYW$(caJFM8TlYm
zd$$mlf!j`c@uwgSKVg(m<%bS)lZQ)z0Z($Q+#>O1{N?`1FIe4ca+@0876C_;-y4jt
z&||nO7b;VsxGP#lC3mlvIFWr-R2<gZSS^HBeE_LC9{Mq=H4*rnr`4Em$8m@D9xt(#
zG1DaqU)5JY>_AEx*`P0vY~rs5-JQ`|<qzX});4v}3|z$Nx;>i*C!aGMOxC;r@w_7L
zNoJt-HBE0Vrho(7(B+Lnjy;W>YDgIo{wh|v2@qEq&}nYIcB_>}6ElU9azN#VC=SVv
zE{wAC+*ui(@Nb;oyX5pj8W6LlXU4?<TT3O6|3ZOLw7X)I|GR0r5&cUg>{7oA!+H+g
zU9lR6QG|b8AvmX#nUi|-n}L(KK~wP{fHEajJzh-gmH3tT-M5{(tPw)EfyrnB(Hn2R
ziVMbbFSXqxdUS6a8lS|`>mh&HO5GppYtpqu&_|O@JWaK>9}Q+N!xANsLGzo?rEFb)
z{HNWLQ>fQBmJbVz-Qw|rC$R9|bu6-vPU<($`FjP1rQ#U`cL0ein=q;8sl1||-VHu%
z%RtK2K`O>a8*|OhOW$?__i?Z3v)ViYqvk$N4=ZR!gn0C?N^mz18!`<lPn^N{T(sCE
zk<=ULI4)M(g>|smR7GLD%I0)ya)ItEtu$>%Bvw&YA!B6(&yp}Ud2*_Jd8t?bg3(iq
zBNScmds1)IMCfxJ+G33!tW5FUMl*^|kvoG$bwH&QPUk$`&DYZIcV-W3fePSSUPx?G
zrVw>@LxT$O?58HRk!cAtA>i}<mD|ng0P*>o8t2p-nuF*Q7P%h6L%dfy2dx;7*fkyT
zVTgJBP@Gi&e}bC>4W4p0r>#K<sti&6Y-%XO2Gz|c@%`gQe}$l;(i-ks$59DVwoo}D
z;9Db`W2VeMxX<lHZPF$jH&gnEO$K)=!7G67YbZDeDEc6=Zj&jICbou>oo;>sBxc+v
zFRCwl&QBZlkC=Gg^O2FubWd4;_ChpMFJgFL&Vf4+=YyTy7~s$3`A(goj%$`2xe2`c
zW`Noq+~s_DKmN{cD0+5W8<pzr?4F|evF$0<R5!K(Gx>`hU>py2WkEf2(TdaW)sG3*
zPf3RBGf5JLIRL<lDsw3>5Hs?wh^Z#H-(R3$`--alsqdg^K>9rrg&GIu)Ar%F<5@Y=
zZY5&{eYc)*B#t4A!0|f(CRATKJZ-uQy)2N};`TKfrJ1&~Ck)o#P6ut=_~`Iaf~H%)
zK{y39U9)Qq)9u1BT%}QGmoxY02-2qIG2QxWB1Z4#3DDI91vW_-0*spa9q@Ckw)CUC
zcO0%LjkmGysbv#6Ut#jKZhJq%_@lX0z9wG$yu&qVsq-x&ONk$nBE4S{7Sx=T9zcyo
zX9{kO^+*?O@Nl)hkwbMdb8*o6i`1blvY<Q}*W;>Ct?j|Hs)Hr=-4Wi??3dz5slnA1
zKe!68;a!kcZbyxo6T(iYy^NRbwyZLF!(X$&vy;6+O`EBqZJ0+>y4RZP3Kl~63^y9S
zs+#q2Xju7G5bBdbud%SzSnQ<3>%#2wj7OWpBPoau21L7HPGqrmL~*7yE<88)>HrEE
z{_3rVOR}%1H^D&*5S-1C{$1FMwI*5l-G4+e8ElFN_t_o9I$)_RsNEc;kE`v0QW5fe
zvv1cKIcE(W-Ji_66}Evo??`ZK(RsQmP&6Cm2t&V@nK#05`^*@=-gT1oD*;9pG*}%C
z2QLL*Bd?H9{2~7G1d*3^01EBR-t$k0U7DGdaUV3-I<!&OeUfqswufP2uqrS29rnVd
zmqQKcv8!F8GvcvUeeLwx0NTku(JEcW21EtXk~i6P#m5s23OY|cGAupYCysKjJaoGU
z`~-2MIfCx)&Ev<H4#;Qq&Ladl<T3i^d4shcP%%~AF#a#a7y>Ong*w5^_aIDhvu*nx
z{d*}d6XW5=Eg9)%aK3sqYIq?BQ}f4Bf|(2US`Ah#Y>mSSbEN-DQOS6Q@~JskkwJh5
zVorMElQVJY^b!C8wE2Yr`@P?{3`f&siUOv(s&>p{Op3<s+?_moK~2Ak#;5HQ62^aq
zo9~xdmPD5Kj0dv1ujL&{yVV=R+8$5UPGaw}Px9En-}L$yvk-%2LPB7HJfsB69K>fP
zlo?HeS^<ZDLC_I638E$9ODIiUOP9H5;ar515g-i*G3Hd}7P_2CVP49X@F}xaF^art
zd2nP%-O!^jz-dV*KZEQ~-W&R<zX*Hamqr?a&Lx}j)yfwd1{I~l?zLpkK<t+4Hd|D-
ze}>Cas;bO2C||Ebeb;bktr~B|MIt63093@*S&hqDF9Xt#aav$g&lKmpxo8E^t~0&f
z^7;aWM@Yvf!vMl{MXaC{UQ3Jtc!U(Jr&7f)P2}1Rhh6Ng0X$jE<MG&){(Dp5yaxjI
zSfV_gk8m^Oq&ems*s4h~V+2YZt_zer0ZN{F+A?o^$5+-P6|`}r^|T%bpl1e+x|8Fe
zVqKsxf{Rj|s3Egr#9F55+=1aVbP`t!C1Yb|^qhe%{p~isE|(KOnj@Gq*2N6WZs~*3
zE8Ti}XZ~$^1yKEh$hi`Di)n{W>HKy;4iTS&>adAr4GeyB#$9O$2IlWIgZ|{%lekIv
zm{0e_oR{;6y3?8)bkXShr0C9fsmWFSwr(~wb!|pfZEhX9{tv5i4-Jt8Fqh^bHo!8R
z^(NORsxEKtE~!uVH-iPlD!^{snLl~Ovyv#%;m#fgm3O5T{boqbNp_$k%5$Bw4Ufm$
z0i&fv8Lc-f{ggvZ3+_+&bd4RuheN;)*{n7p+BJFHpg7%CS!Lgsv(>9QtnerZg<jQ+
zLZRRB5-iA5#?crCopW4+7U3_xAR|2fSIvkxC;%bDsQm+$J8CF?LcCKp$Tq){RF@rG
zrX+c6q$G)RzGAM{5g<jRrOP+;@^(R%lYWZBlJsd}hxt+umFb-k2A6V22t5OU-Qht)
z>K?X<XqAe(Q7uL^qmGMdQRrIDP#_R-#{nrtN^WLdI(ZFYqca>8H=Ek0DSMD{@Q5$=
zGm{dI(eK{GNX+74R3B<4Gj<^D&gaRu)d{b)<N-LyVIeH<y^f!_RG1F17?Y70fXgu0
zU<8%|o>sczZ3h0vRs`-!0lYs9L22&1JL5lJ`*OB7lF3Wlr0QrY8NkW;Pi}D)ZuE3_
zZ+Fn>IDEkmz^lFFo!Ws{YO?W>t%SAy{0zdZLzVGn;(li|iI$;PY_~`iuauUJDC0+9
zB9?d*c*pFXlu2=~1wGZidX`f6)a|pex>}gz<5+|5tnEIF**K?u9^#oBy{mw4L|^zW
zHRh)S$<dHk0}(kt7D<$dZeQ)RKNu%QKTD!TJg;;n1Z<#gfZOvKhZxT8^5)+a2vvv=
z<*UIbrjkRkU^BtI$CEP_#pr+5hsvM$nt*1f;ACF}ED!(o`nAcRO`(q@NKy!lcylrQ
zTD&oBCN7>v`QQdd2$$-pJg4D#ZOgm=VhLchGi$2N6r`2VgI3<C!GILQwm-$e(Rers
zkYsX*!S1-xGRs22?%DCbLKj9k+B*E2c`j1qV0DQF35BTEd2vAv#qTb;oQxCY7yIMN
zQThJ6{_ygTu&B8aWr+|9T^r4p$~8>~!!Q^*A%sHDnC)3a212m~t>9eA1cO-fBJQ<1
z;Qrrm;Ozek4xE9Rp8bC$O*1pG{lC}$q=B<B)6@TdCr!J8DkE8cv5_!v7AHuM_r!o*
z*h)ZFFtDQ6!;GH83s6W%fJz7mB8X^Wf(T0r3Ua0-Cno<rd+fgb@ZG)TJo%WNS--t>
z9rhl&?U;S9#moq+<S@wE)BM9EgF*nF0$zcUG4a>04@O6)hTT776FcPI_bUMS<+874
zLkvp&)AMwp#*Q2^!j#9}orVtryZmqmAVA~~Z{`*j#r+2s88qPd$2hEi5`ZbMSIjgo
z|F1kuV5kT1`x1Q)fO>HRC9Lm6Pb?om8Xh7cDGA}@2v%8Spg|lR8HPFdQ2T)VJBGd-
zeEuJ>(4Yh09|S@Ee&mqHWDvivudkteavM6>RUt7s(6i8?c0j4U9s4TU?Z0mw+Ifh`
zz&{G<fBkUGZX%w4pjig+?0n>?u*1N(;^^2nF>dz)Ttf}~-#h$FI>7rja_paUMnQf5
zg#G>6z#tHUzPYydcKd({7W}dc=+VJWAVt9O7ijrG7J*^AYfSJ%pT;5p3e3;;LgnG?
z{_WyjLW_9v=iGz&A%+39D9iZEd;9pQoxuzd@;K}o?uy6lp#=Jd4X|k--Bia46zrR4
zv+cY2Vv18^hu(PtoX@H6ETHo_&+D0iAl^j3>jXB%k&OezJU<3pS$^9DgaP~wXz#P<
zBcuOIO#lWy(B*IEn?`x&YWMIb`;J3=#2P)rLp+Xn03p05=@*KJVE+Y&KZbb;0d`Qw
za~GfgQ~g!~;>YJVBmM{O9N2}w;QuE)He^4n$LRa0Ud(q-i!R3v0ssB=beDvat2K+>
zEY|Ng{r3;e*f`(L)RgqQY~QbHd71vVA78-%Bfq>I866@ZJPO$4J}ll(lp&PxZx-kq
zPfv##2srtRO2a$tH>Lh=Zwc+)ivc9yFWMw{fC&{A`5kV+W<XIN{TKT2Pv(h__K(f=
zFZS^d|K0Db=;Y|&L5%8N>&MT$fV^0&f6tR!&&S^V7R&G+%m3F-N$Oqi$`Zm&^fUig
zt12q!(2XDE=J4T;l(45I{@32jh#2<t6HVoJkj9rT9UKvcZPcB}kB^*R;s37mIlom0
zwjbg`*>dCjl<mJ4zn>&!nExGpd;P~GDh`mRM#Ti^k3*-E01U!^XK@bw`ZJ)1Ck`Fm
zzo+H*_8{N~0fT<$k)v?HhX{BW_!a#FNOa_f|IPVqi^fBTIExJVqXUT+`=<9h_B#f8
z8ZdmwdJm&|7ycvp)9_;7#)Acxjy2M6!)@>Jx&LifOc|1MHsN;&_8VbTl4mwY+&XrW
z6iOw1=j8H+^(xL>-I9HCkx<%~H;McrG%xza(NGqOlsMA3?+|LdxR)f-Hw^z6+JAys
zsidWal2vd@S=ooK+vj@QiMWE)dVYWE_BOVNhDMM3;cWS->YOa)6N#-$ukKA<E#s#9
zqQ<mCF!TBwA@}QDYGP2uRm>(w>wq7s<-0jQSbz|^-6v_&ZKTIHX3{MrA2-$IJ}{=X
zKP~BKcca3>%YvaodmtDpJHQgKyt?qD)(e!3G=&zk@rg7d?rlX}w+M@+QyeD;!A~;T
zBY%U}({s^y@7NI3SPMg4h^<YR^y~E`Q1q=EOcJ+rxxw~M-*Sqx<ucE%iY_>%k(>H(
z!gx7yldGkb91Fg9&^1$2=I+jz?1}PWKAEav9;xx^Pt|qcK@^^`5v&n0dZ%rM1{Bme
zf}a%QMI1lqh^4lf0zD6tVE9i2L&;TQFAG24NK@lG)+a*Pz-fkVqXPh`ZK$vJLp{u2
zuR@J=b)&%{aO}Ei+kIZKN(whz`w11FtPFBoPm=5NEHYSgSDc>|8v!;-U7!f$ptvxK
zYsb*q0B;YEqBz{)T2wPy!frdX(OoHZ^@l~AK`*CR3i(V~s+71J2%Jb&QlswDrk|PE
znm{wU#-rNhY#}hwIoKVWNg-_>UjpxeNetBdm>`Spb-|0v4aHE}+0dmh$Q8GI5$+^g
z<LJDJzM<u6HC1V|NY#Qc9B=DW)4EmctiT|^ZINkP6+wT?9FvJ>MfMBjyua}-@)Fs(
zDms`(<{(JW7xYao7&SEtg}6^B)|{hwu*;*fRZqua<y3f2!2-|NfA3DWYuV2w9bzoZ
zQmGrBbLhoobcCaKaPl1ao+#0`I9K7-`3;b&`xqPT>{clZ{YMdW<@UV;Zoc``#j0Yu
z7bk1Rv^jkt(G_~rt(mRptddiijrA@}DYrJ573_fdW|M9LG?ZmS*A8d?)CRHj)YaZk
z(Q~B+YcN{30u<D_4h;_y=`_YN8^3<Xv?*r?=EC3GT*(e+9t@^#khR22X}d+7V*VNl
zL+YclEsn6?MrQ#Ov1d_Zgivi|>i7ENr1sX>zkQ2pSr!1Z&@bv560pQ9fIWT5j-_N}
z>(2>*fJ>7_Pm0d{JB}fXQ_g2F9^yH)qxW1&?)By!D7gNswbNc_x#9&N+H{xJ%IB6r
zcXpbpQd8SUsc_eO()Hie#ZzV^`Kxq!V?u+aI7Ez40nWAd^C))RS0bN7FXN0V^Ii%C
zkM~b1G8{E@Xv?n~&w`p*4J>1n+QyWe%v{-Hpl5S&>mqL?%_&hW;`A&f{>#eN2KWQE
z&vcZD3<W|$f0s_#I8-YRDkvy8W>}W4a;P&Itf<J2@^q)}W_5+@=o$e3npdRa$=$1P
zi0Wy0hyYmtu`Dw4Ovx4nOE@vCh*cDC1Q4VS?nNl%`<9LTkC0p6x3_mD>z9@;QMfkx
zXBBWCC*l%ipllS7Ihk>RK<}nXffrkIYXfQLu&m*uf{yA(NMZ4&7|QMXg(tiN9O#Z1
z?7P~1wn&3ms!GN!yKl2)TVrdZ8ueyXxapO*b%=V2VPZ8m_2=;-!#+U=7O#2gvb3R7
z>oS=&gHjtE-)v^=)LB*a$wZ%=#wje6^=%5QY_@U=ZJ5I*tlkjAr+@auXIpZw%(@FX
z!mf`zPd)gb!R({TA^GdwqWRqV2imLnM30XqQsA>UAP+v*6c_Bt$2w59q4RBFzFYki
zMrau*N_rWGupAK>`vwk}Yf@B+U9)CH<DGt*;qJd;94eZ$B}b`U{Iy%fQPd4EDYKM$
z?h6L^;I9_6CQ`qfab={@*#EYZtEEnl#JH^=K#h#2b$wnGaIlXCOaR(f<mie$qO3Ql
zh{q%b7ImWXo=+Rm{h&luE(ii~RG8eh8y20p=B@eC`$P7E^eYlB0?io)OCvfONvJvD
z(xQD@m|x}W8_H}cYdI9{35d!!Kbj6WCRo0F+%+R%yF<ELE9GHcfyyV=M!Nn?L=#z?
zdBqRPpO%xvXIO}3N<-yeY#714No(80v{bi=x(d3w8~knMrz_wlXUe<>s21Kp5wMes
z+>yJ;SZpt17!r*v?Q=Cy^a$?^rYm0J{xEXqli^y9Wol^FERcp9mG%BpE`@GR$8xYd
zbgiHN2@*`m*G}m)nk7g82J=yR@?p_yEv8~MHYWaEm~xXNi){`=ozEH7nM5*M!9K|h
zu5U*OI%QUFy=u`V$#b0(+X0;XURrN(9>PKHZKAE}s(SX}yL>%R?1_3u&Yd|7K5t?8
zKdrM>Z^lKHs=`W{STPkjX>`7t?Z=euYF<6~^!iujid1?yf8@unj>Q4HDW=+Nx1=b0
zDW)kD9?9wI#N$*!ebY<8<)~nX`K=<}S`Q0BI#cF_3v)UfK9`x8cUN{{gpw(Ro0>?6
z1Gac&YpugOjVU_`kB~dM9aM8P)it=Je)p<U>0{xr^vr|4c0`k;NF%8QkxC3$|8}`C
zr$uC-sZ>*UE{vB6TBezBGt<_gd5I>Ugn0m;m{D1@*r%#jye&+xI=sdx&B$b`(bt|e
zuZ)}^T&qd*cR88s?s2FLD?2UBqyH@Bh8^(V4uoumJd)-WMnH~wabg7E0#AT}J)P!k
zui$b$rNor27hvl(lFS~roIq?T_EIHJkH=&KfKNC)7@V(sS`{B1RZ)ld+tdk{syWbf
zyKo4l>MpNwvN{uwOGfL<Y<$iW61ZIs&91lrxj7h)vFvu-L%PtqysY!0!AqXYcA>?!
zsHB>(EDL*lw5NG*${_u&C4A4U|ESU5Ip4L{W=B6xG+Em_F_*e8y~X0>N(kN07FtTh
zQ`sd8?ntg@Gyr|OrqP_Al|MV0gVx@lM$P+CuCNfthIM<1F$^_PV6{~%FFrI0#Nvvn
zSAeb~&IJ#tQ$)pvf$hpXY7)EM9p<VS3+ZEn$iUz4(Nx>mn%}6{_Ml1bR2nyGh6ER>
z_9d-S5|cu65i6D!T{<`McS?gH2}wrf0M%9p_Y6aq_hzg`?W-cGS}SwN?a+Gdju>J}
z>p+@2*q<YVSF?Yf5tsgf6*A<3F-@1)5v0@@=I~00PGbk}`wlv3`XMwS#>ncdV*V2p
zWV0<sXWx1b!wwhIyfs^hvJvkU4~O5fZ9cn0qr^O{G`w9(|F_$qP`l}g|Aaq)*eLZL
zDH*OQG~f=ocxLK`$RvkRzBcWioysQk`O|>721g3>s%>HvHifedPul0F$Hz)Df&WTc
zP5oM*8nthqdPsGqt-MQwOqGODfvA*q-qa4cyMGK)sr3eidY35}u2u?#Tf%`0P^qF!
z&jNgIq&B<rW>}=-Hfq)!{Pj(YZsy383Mx}$?$L1>DF<~N*$qtMr#^Dued3~7{6fSE
zF&Tg$Y#D;lLx`_#Pt=$3LO?r5?8=Ox<~Qs?IQuZ-4TaN5)2f0C=smwUmVl~#I`0zW
zkmf>Lahvv)-%nK|g$&R`OqJ|3YaxU0Fi3PN2>&TFC~b3i^70$q<9nyE@rFDIEX9<t
zd|@#@-8o^0$@tPUjd>PBhVs=-RR>q5#gJ+CUxSNKZ${C1z4YHd@RgH<Vm64R&3J)_
zLyjfmn+PtN?m8+D*GR}hZyDEw67=*q?>&4dt9IvX%%bIpcdg8nar=4A+p<^P=0!#{
zi}g`SV);hWuNP`jvMQa_p-|aKf8#nkJRdtE=3z2TMOR75DW$ckhgbKjelYtINkVCA
zz>rJy9<IdReJR<lytBL0r%!qKrFn`_Q;H<uzGfK|gPcV8RiG%gDgm~Uv{U<FU3w(A
zTNP7l`meN7B}?)!r>Pj>xNR(%$K0da6x2M7rFSnjn)BI#k2uvC;vn~S_JF2@klc~k
zGJ+QrD<vspiG{Pgt~*;<NnM%RZDYPq1{g3$Fss&1Ck|5v!G8J5>m@`+mb!AQxxS7V
zK=4#l^?L|7$3XsN=>ge+aU5F}b@tPeySZ<=j6wA-CM$0gpGw%aO>A#hadbaXKL67x
zs%y5By7dZos+5yFwj*mf;M?G%?V#i;T3H5;kboA4Hnx9rPL{8B`Mp?aIh$tJVKjY>
zE7|H%q&FM{mI-~m+-}?LQ<h1NEk1pi@;z|v46WPV$28YkN4&rvR%8=pP{7lJhWIpL
zkSEKn1wJzke9Xd?kp)BQ{3Q&{qKbw&(s_|V46A<Lsynt$oIW(xrSoYju4Tn&Ltp2q
z^P%(x2*PvFO&MPEWTe?na?p77(-`}bRT}PNO0g#cgoh9AH~VFer*pYurqJMX<RxGL
zLqS@5nfb@iqJoiM>i8>R(%EKl=@u4lLB!V&bJTLmBd-MxOt|J0!{cIsalYG^qJNTJ
zYpxERY(!-G!5+v-2a=kX3+xlRK9Z&NwX)*G&|1u1dnPBo-XHBOUA&8j^r>JgwnJAY
zM?1Q!&Cmvau<GL{%}#jlT_mU45xr(Ievs``D%tTub}XnY>c$0)h-P&QgSv*%=oNLp
z{1z`Xb|y)cFsVljy|DkV3|V<e)HQ*muQxYgu{`Sr)txiuEvETdd-L@lm`I*;Lu3^H
zDb$SJdB$z|*LHq8fW`2W>R=YQV&K=TVC_W?&wDF7VWh`sCW^aP|0cK2jx7quCJg7#
z{m;MhIa56yY!gAK8->2mX}CzD9+CF@?&N^$fTO7L8ZCenN~xEO-n?6e!&S~F=L(5U
zZ!FKGoUkGajJB$j=a4%kCnzhKyC{XnE59Ae_HRQD5h<n@o7KfrD3wgO=%wJ=ed}rF
zfC_etnQso_vQG|sQ48=cT!-Y8UKA`hDXa6$*Y_wqHoDA?<2~0DR8GAe<JL$_VeqS7
zzUC`Bisv_=ng+q~qFJo&gb`71+1v|*JRU0)>TKA7?w*MfPED*XG8MM2K19tX;@(>f
zM303uz4eK2hVGs2_fl)4I<rkDy?nP#X!rr24p|Y!6=+0`$Azq;OIcQY#*RZhhI1_M
zTb&d5QH{HU_m<>wP``l)tLI#4midOOR;`+Cq1u_?7w{hpQ+3kAj4E_XC@8!viy>1)
zy_Ysv&_4dtgmeN^1*wR9@U#o)5|&6En<HN_Lm`J<otskV!VB#M!1&dI$qkHP!Myz9
zJLogS+v1H>R+`23iRl0Qqgq`vu}S_O5e$2)N9|e&0vB1>)dk#gtno#BWCl%GKh>PK
zw9pxRr6>YE(3s2UW%xk7Si7%+u#jX|D*0lyORY@PT;9~>Sgf_8Zxgl&Dl7NBN-L?V
zO0@^KmtYLqgEw_dJLIIieDJXj<U82Y`5DSKgw{(Gwp*-yVqM_HSId=-+t7C6RresW
z9*m3HQE62p5&TjHOLRcvq_|~qJ=E!rPg+3PdPqflS=VWrCEvkX<oqvkHlEKlAL_~d
z_R<YFh55C-EEIN<vXBYS0c@M~5i1I?(_gUIOj^ew$(QtiW`_7x_9gc~%1@Lka!|!#
z?!V?@8agg(6`zzLeJe5$-$~Dg3hUw75d)gPC~)NssYRlJI?Nj4vnwK5c@uV^dZd${
zp=f(Cg%4k<Yjni&vrF!8q8)Mp-gWQ~OxH?zHVeLy>Lb&MmblfOn44QB(MRV4wyu3s
z;}7_sHWnGC`^kYzTLF&bC%*jq#><3Z^g~+Te%Vv~17<}__%svA#V<GFBc2!krOA@e
zX}rqj#w{q@6NrA{C?;03ZT72jmV76s42CXo4zu^ssP4;aZxt~(2E-%9)&I;^yv@tE
z3_^SPsW*afinkM!FIm|0!E7r$HUnX1lutouxKimhnv@#hyVjJ|qq`Q7FA`i|QOiiL
zut2b3@Wsu!p=kG+G1JR4&U7o6)(Jz_j-qf;D?oGX`U=p}z2q{E+B2P9D2hAYKSahT
z6p6ge1;<=<J1vvuWtp!~Ejc-B0lXAcp~vPW_wQpTu8Z*cKoE6ut?SWt5qMfj-+lmX
z=)y0vS8QHDMe#yI2*hEMnxFuZQRWdHb4$rLN)#>zIHLmdRMQIYT`-QUHs?UETHuB_
zG*w;J=$xb#%ctW)(LA7Im^s7WZArFNyHZ&>vv%(+4E9LFcNwzA1g1GQKRGkcD8N#p
z=0i*!D;gSnh3l5>hbc@tDN|Xn09er?DW<GK5O!4$xmk}M){5lQrD7cfs`7c4X(?6%
z_M8oSB@Nb4w9S8RI61n2y=|c%Q3j_^;$R6M5hxoB+J$euGB&!ZQ*C#K^2%IY-)J3L
zANkt)p>HnPu0-*>*W1)G+m-Wf2w~$V=PP1fI(wHazC_{DO3a{Hum~n{<$Dv1O3#w;
z4tc~r9_p2gnDI7NCL{8K*<(X`yKD=ALH&5@BFND6H{6gR*nHhY)TqoRTFObS@=Q>V
z$+_0GEe0uh6QvQB4inG>MkI5f!8zq*6-x{oH)C$Es0loQ#6$8>oK>r+y0^NHWu+^<
zLe$+yK7Z2Rf&%T?JH>Xac3>CX4!r22Y?1o@AI8ohMiijS!fo5O-LGxiwr$(C?bo(#
z+qP|6^JeiUv-lUYtmG~#siZ3Ro>S*LfHzLCcL|dzh7;wj6w*lF(A}01Mo>|p<6J%3
z(84Z+SBF}x5O%h82)9r|GESAIjrV-sL`DnCziOkGTisX{wh$X*frj7SRt0D4DVV$A
zj^pSN@3!XxiWm*)(RTDqb}!Som$&81Y?YzLHQ~|eK*O>w+JC1S%wE*q2>l&hkB0+|
zzUhKKRc%41NXX(b@j|6YmQ(`;VzWmZ&v4wH{*Wh_X9UX(^GV9aq2H7wo6F<zv(a;j
za}*e`2-Azv38|f$Yd1}jQ`H~jI!?G3lTxpLKCbC<->939;i30T{HaaM2$S%B_fO<n
z=~21HceWJ2)R^+$x86{fG&ml5P(0r;DHgf?yN%t9T1>U18t|k%X=dk<_KoT69L(}|
z=xrlNYd1>0OPF?+NWfaK<jL;Hr)3)+PXlkC78d!B@fqa_IU75(Hg*M_iSbQp&^Jw&
z)OM2iUDZi-_#H|aQ5ey4g>AcexP4vT!~nAP%y0|KAf11pm`eFe=)ylV1n#fxoOkVY
z*q$U4Gv@iJwv7;^F;)uR0{;$iMzx&PobCF;10w?gd^p^O{ekxA=2EJMtUR$o=v_V`
zLJocs@mA^>X}gQBz|{Mg9xPJoypbu=wyZ=y1jDfUiFUkRHA;r4v0(Lm2c)?t!;-Wq
zt4M2XYG^a}*YwJsO?xy^I3|B_2(%u`dCTSm=J+qY#9G(ouSF(1qOc&!UOR~R%e0W<
z3Z)5X!@Hkx`kC%M=EY;vt+lGhz~v!Z5kdQrFu5ZrDT?CBd&PIYf}=d~0f8J7jV7o;
zGTW`-zf7{@v#CWD-2Ohz2PCQXHbK7rn;4t;WWy*X<m)>9i((^(J3mQgzw<YVs5DdC
zVp2+Te*%Sm!<M0fF>GJCa4(2Q(Ox6>4)wn6`af4sGPG35ZHhnclt5c9!$x!zgf97d
zf||^c^M&5Z8OJ|2#=$z=h|3rTtDWE2_4D!HAHF(_OoQYttx5ZKuIlp1=}S~E$JH)7
z-Ls1&9_6pHQar;qbaq-@`!3MO#VTML&|}D(F>%up_c^{X``4ScK@Sr6gX&t)-6Bk3
zY_puPvYRPEz>%<(yWz2LZ>*^n%PQVIf0VX97W6+Zut#HuTh(+O0fg8Qy;=-+N}8Bf
zCnLlM*mA?PPEFJVpQkC)Oo?e}t{GnNxxos*_(n~#lVf$TkGg9|GqB=k4o%jT{?KpQ
zyb<(9E7v{k@84WHlXf5)42ZKp8$Qk+eRxOIKGv9rxp0H>l0gvj4M{LR>h5glnpn7#
zN$p;H#|?CiDdi8x6PwyP9pR1WXvk;9_oe6Bo3W`yyT@gTCApsqA<-6Gi(M99x9~Pz
zaQFHSHprjiY=354avsqf!y^yKrgiRmDAw!(oZ80uks}$L@c70SrnUp*hD`8Y6DyC&
za~v3X&>^Xk+d?@)hrCL*Z8z6hx0G+6(y}kpU)Fs*%sG!)T?<46O#?+m&w*P&<dYA)
z)n6M#QM^gsP1Ck?L}WPcmo-nl!z9?X3aVP-xAvfqNzyQAzoPCb5i#jc?U+2+$z+8%
zbhl9L+7<m?b#3oCY^zl+(iflpgG$8B?A$Ge&##<7C=ZG)clzpYim~PDsj$tw)*h#H
zI9i+OJw@yiQ5*6fcsb}xu9VNQq+JwfmP?FSL5^JCZ+vA2mg6#$IW%u@)1>M5FMst>
zsHCckOpXjR$UyO=PIU~8HNy^Axss_FMXYKbx|mSaqdu%>Z|>-orr>FQtjsE%BCn6(
zP2rG(^zpfKAlA#SHToB~*;Bc4Ia<HZVjiVRh1;aQk|&ylj4{}0NHch?_=?yyE>vby
z{+UFf=@mm`igTaY-i<}>1(IO@E-22dG{vFp3&LW?<o{u3p*io(f0?s5NKiQ~NU1^)
ziC{3(ZcwvG9{icuD%+F|qmyf-x&0H>*nlQh8%WYtXnD(`uuL!tCFA2^Zfk4ov?%H<
zo4lD;i!!vUrETcmOxub$(FNaO`+LA>Gae~J&ZFivJmmCx>;<$97wKrEDw%gNB{z=*
zbgws8s;ox~)s?(#R(UR&w5~!QK1+b_*k+y>Ms)?cz>EX5vPAC7<NLu!9?PWhU-VU0
zhX1CoaxifGM^XJlz{teL_~$>%|0}REGP85A{XcQbG0&j#IqNN;P={DsK{i|4q-~v@
zgJ7%;4y}7P{XFa-<ZV{=ZtzIlZNUI>&Us!Px8J`NuaQ)5BTXzPnnto^W6Dbz!n8P3
z{)%w=YGkaYs=oeh1z7n0DJel2DJi%Sk&?himf&BTk;28G&aQwQ{_nrX=x$({9X;zL
z(mJ~XD7bw99Bf<w*x>&E`p=lKyp(@z;E9P>z5uwHF91j-w|G$g1WbZc0I&`Mg$OQo
zPmZ8}oUL8i_dGd(Y7Sign7FvG`&wuJGM+h1V_PUNip&m8;OkvkX0~SFGOqL>{~F!j
zN|5Tm&6SnJe9%#0Vc?DB-O!CejVTDY#C`wv1}hKT0g$sDfacG44U{Z>9pJ|@5-kim
zR|nSqWuxj==lsmz0tU1L<4WK}uy#z_4{HtR4AzwcE1#wUK*0sn?*~r(h1&=5HoFY4
zmcIU@b;Gyr2NlrgN1BzH#kIzj8Q9IQPwh`S1_vRZs;KY!>}&#(9!UEGlDW~&-gTVS
zkrj9)J-q|;Lu3mTkE8;c-t+vLccVR(BM@6dH$_L#$%otUMfvDDo~RG)0Pf{Qu(k|(
z4$lV}&ouXSz0$4z<Eg4u7X-d`dTS?zur}}@2aRSMOOvS|{|~sVdccQhM^@x#t;(+k
zfKE+K4Uf+Sa0UY4nW@$IMOm|d4DmHN{xbSCvO7CE-;b#Oz5+A{Zw%@E8FX}LcmW5}
z#@Pw@?frB8whIvv1FH}C#|<<cu$o`L$giR|BOul9ur<vM%me62V>fsdO#l1wahHCO
z%|?UW|GMi3^7qm~V`<nWCD{e@$MUV0j*$^u&L18b9N#}8CknN1WTGE-&*Ss%b5})K
zTHx29|3j{ZW^Dnm@0D%6RqF$P;O5uEXX6(J40q3ORngI1i3WlHGp-L-y<L5J*SG%L
zFZErI^7nV?yL93=s_&N`pOTHMv$w0sZ|j#&SIH|rXVve^&eO%oXR)VXa1+G;*RG89
z?$$vCMALuk>bF*HW%<blOt@dw^|xC%J_=<F**qV}k)`!Vi^^}4<rgL$7Xn7v!5;8i
zg93nzRdwa}&?}3|X|uI>|Dj~GSG%t@|9w|XGH@D~=0_Tx3!SZRX?=YO`usX#7XiI5
z?Aiu~)<4&e5~FVb#?{_O3b3pB6ui#aUi9NJcWVm(t)8!>7ZKiH<R4)<47iWzQ*USz
zQh)x9{=h4W`5XKmNPX%@z#9PV@t0_(wX2m>|5xrQk5_}{2Xq~Prq55n6(H)E?{3=S
z9sbDk&=}J3SM3cyXuG#zw{E$2Z}WWR*M8qqNH=!HZu2THoDKU-@2)z<FU{+6_(#up
zC;gZD6`mvP-w_V?RKNMP?{YePjeff>$J%+iy{TRLt#N%r_td-mpnDgdJkY<X_C4oi
zxpQqUZ(zR7de~tZI6T|GsSRurxBn|^KKY@46J0&TANxtYe*agzbBTXrSH8o4+H3Vo
z5184>!PQ&6+lw}o#rX^V+k6?oFZY*YVWJ?Yoj+X0M|@PMnj#;3@#iRvqr&IfnUgFJ
z^;EW1uk4P}nPpu-YsRgBlGx|$vNN%%m8i04mY2Lb=5F6+yy9A}r#A+9+4N;IA+^*Y
ztRzxa7#l1CF(RE=7|uH{$GaKGCSQxN^SJCGXUkndh1ZD39Y)-X6-KoxCXDu`5^u?V
zlK8hK-6V23nh}B~r<96eQlpPN%*ljE^zUfbop4rfch=xkmM3Y7lrjGUSIjZR%lxKk
zoR{|9&RaqM&4LiW#NRME7@sH(UZHDZ*L13|)*~g=F5afAbt-k~%&>v<mYLug@3CAJ
zV8tjfw%676xLW7>>*G=YL34<(x|hVuiLCmVobeO~%Z-@AdhJVg>wuv!om4|?TsO_`
zR8|Y&O7BM4T7OWyh9l18E%CSrSlpjnHylt85l1{e^2iyaMU!I(8`oSK$R@u-p2;3Q
zlNJ|reC$=$oxO@E+Gfqgl}?$(9;Kh_UR!Z8xtsTDKX(qtk@ah3+a7jNbxXsP&m#po
z@L5VEL5Pks#i=s;5u_B+_-^WX8VC9a@ouOYY&LMw@Zx3H%f6<^Pw_NK)b?o;J^cmF
zp39az-V-WN+033pfrB2#OvXQ7>&Ip^3B)>Yji^^#4GAmcX%^8Eifq5nq!_6Xx*`PS
z>|8-|2L<H3SfoCO<#zXrp6RqYvQE`QwTt@+Za4>x3V8+0N?i5fdnDW=c=WM}8b}{X
zrUi*TC=dLdK8j|3-41rU=`h?rr}z$g$DV9tb^^Q|b`m9NOsG^--doJv+TOgrl?K1h
zjcbkD0aG%rKj}p!zTvsb@;>bm7cuBL<0mjXA3-Ug@%)mk)oU6_7UDC%DGVErD;LpB
z(z>TzP^3GhZlrrsgFcR?P?BSSvxvu1hd(AA4dDk$BKdU!D;PMm`9Q8DQ?Czg(jayf
z-02~&50Z|(NitwmQKsK$&Fxye@JEMHL_-w_1y0ns!^R0>_vuY;Rpgzt6ojZ1d6(hZ
z^Fb$I7<$|$s}1KV8e{*ir>q3+br6c{z@C_1#e5i`11PjS97?Dm4Bk)LYF}$V&%S)j
zib{F~CAJCrksKw=&rAa>Iu|cxXt~YfJf*l@_b|zTjSVF{q=tZRlWMLaLyc%x(bRA(
z-6DA6TYWdfxFz~T3-X*@vt22az=q-6UqCX7MAM~O;~JF7k+Houm%lRRtH<x)49{81
zd$DXZn1>&$u&Hvk=+nZ|@!m4Fz7oTIL$wXMbxN^LGIYs94rqMgy|k3&4brpsK8Pd}
zLOCq&>rsZ*NQnmYbra{Q`j)Zqhv(WNE8PKq30`EoN{Rbpa9D7F^>h!|WkI(IT}lSO
z=C$Tj2Wz-g(+Rvr<F71;jVxr!+FhJpP0~qR+bM^rj+FMb%cj8ziCQ}R<r-eRd&i`6
zpUR+_p&9I#TpCqIar`kpcP|jrI^cKfCDR}Pb1xf$-{mss;h_M<B+-OGL(AE>;WH()
zSyE8(XQJNB4A9aiAlXj3CB)n3k(}-fs#X}wRotwejh}m=EKAcN*c4v;T<=C3$TyWR
zgR{9glHL%!c`&0gPktJBrG4w%K7IbWp|&>LcG1Kmi=EHO$kj^xvr!66D?DFS6wZC*
zbH>{*iR%9jeT^W9cmB8#CF}QM-9ticTL%#=HQ@#b7<LKXdkl;Fd!k;M7B}m(D7*oD
z_mjr;l!R~o<=uN^G`5$aL)>aUUQ`ve6!We99%IeT3<%5SI!Mku)VV(9t@c}!^QYx=
z6cDZ=+o;F<+uriS^?NcTt0<6}aoBPMHHgVdEs9!H)*dngZ7ge&3Y1!0{}toCxc>g&
zl#Rnwq+?yR>yd~4Ug6^cpTRh6Szfw+)lHn1_ygUYnI^SCK7s7Zl-dY}=x-Z(R`x}Y
zL4!ZpkV5<GoO{8s;58%`jGJ%WvE#U5GIsCwwpI}op1>ozHB`M|s3hZj@RqtR<eI>v
zN{e3t9Y<i8iwy?UgVIU}%cZC<aT1n0#L_%m$|)bfPfwYH)g=t!a}%w+#Je?l)Nn*)
zE12neYbw>J;mhX~_s|1>tBQg*NZ*c2jI+^)R^@eEFphx<dTdGx;YSj8j9PsO9~2#R
zzLD(L-^6NLwVbQx#+iPmRk}>a2WBGJ(seo&<PyQQb2U*;@;l(jZ8*}#)flS<*y?qb
zli}6iH&=|hWTs;N`W&Div)YEL+A%d^I-#U3c{s_R&*}l5#ian}qS=6!8=i-8OMbnu
zFl$3x^Iqqj3ZbgnyMM#xwy%?lz;+aI9dVfO&HZc_HlF@GRLv^<h_~7kAG<5K3-Qn{
zmmoejqptoa!<Z<{H8yK6>xXi)0*GZW3qEw12qXS;g&6s@1Y!oSm@|lvJfY%FJ2^x2
z?h}f_;iv<4DCGr`GeXxSBQA=MjUg`n$QyaVP{B`mhl_VX1dq7%WhO=llT2-6R%Ofj
zHiHOZOo|_Z>Km$=|8sg^1$Oomv9z>_<~!Y1&*k2Md|AoZzW}?sY~ojDh~45=(Y`E=
z<BLfdQgn$WzII_N9s0)bgq}{u8?6Uy-ke#o>35W5o5E1j!RGoJ7N5vCMSp?$FEKwi
z;nIIlz(<*-KTpyntTu&L+`ZW`ono)OU&NtH&l2~ud&3v|xp2fgBahl#7#QKrXFof$
z1>PfDH7x`5R<%}Zl8rMnK+KtJEUpo#=bU(9aYf;>^IEeuR<){GBUa3^<5;K0#L+}%
zRC*WjGZd)(gYAR-q#|!<l?LQJx&#5X_kg>WywC2y=7H{QIv2lpKzRq<g%h>8tz7hY
zdZdcIag9P+$90GyV#QV!GAdZwlv8GBh1c8#ZUHZ2M^Ik*!PCa78~rFbf05)S?K@>?
z(|D5|jgKM!#rcxjp6MKRlpu)(Prgd7EDxFhc)Kww=JD->Nf6tt2>G8?fvlc)hJlfK
z#9wU-85IN3kpZ2ur&u<olKLaVV3&R`m4b&#b!#Rj%lF({Gx7Hx7nbS{(X{eNQ^gp(
z<6PwpaZx8^nV-zQ5jgr%&wj=;>r`)6!ik}Co_Kq~C;~(wdiEXWpz^E0=vsa~<J~t>
z$)sk-OE=EOQ{>d!?Ewg3;-lVosL-`dk5aWQF$mMrdZ$XQ#4;W*QsKN0<C!FR8oiO8
zYN@z~&O9bX!^qglJq$d!aKXa~6+gl9bMU>G0h`%1o+a%iu$2Trr`?dqHkbqO!_>iQ
zGiYF_=nB<nC_yH^6vg<6V0|m<MY$%@w&`NrX%caX(s~S!h;ut(7~YOm^GKPtF7eYE
z-F12Qnpe646%nr){dY^fB`7fI%jkeSjpbzvN1C^o?&D%S<HPmu6OuARpUC(4Z#Rgl
z1B(<xi1wpr^ub><)<J@2IE9dq5wVj%;mhoN_D!PO*IQO@Fip&d1Tv*~`S(4Z9VZj^
z7C-a{SVcv<;uR`CA2e%H#4v6XI?7M!M31jxVkU;YCJE{vi^8If9itXy&UDn$G;B2)
zw$JSZ7?wO0V~8)a{87{v2ZZr(R~gOTsylhjG5x_-B-equo@8hpz}j{KYVfVml!ca#
zQdf#BaqGD_w7~<aYx3m_Uiw2@TcCIE7D6LL987%V**^TU``p!L@e$Q$Rj{Cj>6(Po
zA`KUZc|`3OU}X>f0x!LlMm!>nQ~)^G_|{QM>AM}ws-#_W%ld`uexvhA*Fk7wx`ZkU
z`47BfV43V#c9bia3lckxsR*Iy{JVi$|459z9x+X@YM$=+pS~dGT?3<Qk6MmK%s7%O
zNs44W6*bhB57cVo`GMf<-zH&zicF0%@`4CV_C4xv5n&riV8ce{5lDy3APgNJJXa7Z
zcsPwj&%1l?@uSJqh(Rs`_ny&<F-5C9e8u_}Z$k`mDC^}{aur>;ri!<Ph~z3vspe1|
z6_io==m|&CuAU#R(<4T{(ituE(9e`h+$wYM4IcR3C_9ZDAIq@ACnZ8aqCy3(HJ80c
zvY4I4r@zcfpl49unM;;xj_j~Fy0LKW_1GKyB6Z{61bgpHCnkR{$gG;;fNk>NY(u0!
zHkx~U))i;s36jzFU6Z%Xa^Q}p&?YAnEfcD_-el5bmL%mL9nKfqo)b=@cBgBcq>!5s
zlL}~smX5%J*KLCed$%<Uz|om3-Ei|LJ4DF^yT*ug6ioOaO?frYJL*AU@ec%f;Cm<|
z1psELhrxZv$MU-Nja6J~1qWrT|Mc6^ElUCZo3Qu{nn6ZL7`0o1OV%{)fe?}~KR_+H
z6^h@c%<FDSGl(n};4*Mei~33yY)zS(QZ7ym+ca%0b;kBdl?KCT{cGPD18U?5c(9h=
zOEO`YEJ7$VxeVke$a=K7`R}BwLJTBm)S3P$8ux}t+pNF;X>hK1G`NP+BN^f52yNnY
zM&ig&T9YuR&%AQZBaaf*wz<&Z@k=L;0K9H)Y*NjknL1OmijCM?z+!GeIow123Is2@
z3%O~J&$6pXpfkO>7Ox3LWctPhP8QTX#g|R*`TPn0Aexuypd(g&UtpD8;2s%RXl<>>
z2eD!?>V1PCuHyA4e=d^_r(1_U$-v&?Ufzm~T9D>#(O!S+S|W^yWW9dZHqqPK*+p&P
zw97^W)1p!+GW8T}da45@JIg83d%FVweeNFdp*D&7<~VnLv;S-{9)C`EKLAJgA;8Kv
zk{V^(nI>a^>to4~-Mvc6c0IpX|AL){F{^i5fuqXMw5rG8XD!ooL~%OT@r$7r7ERkP
z&(mr9_il7=J_=g%69!spTBZPeXCWn7B`#p`x=ZROEd3Ogm~rITjqLSkMii0~b=NGZ
zN5Y_~#z9|rmFSZwe*DGP3Bt$VQ*a#c%)2Vw2u=SdaJ55=jai6$Hrk$JXq6|~Sz0?w
zxlWVIsoTbX*-Ed<2$3m{^04hsippu(P&ftz#)&$3`!Jy6;LvKJrKUq>_cB&_bWLuF
zZQYJcd!u5fqK#CalG>5LQ#j=uCwa?{mVSnEa8b0Jj^FBcIN?}&gv%q-3gnndQ@jaA
z4LE&f7AIHmFN(65O}#8t19mG-PlI0{Q=l$8vJf=I_!`uS5Z^#v*Zy6SW#f8Nx&&bL
zeO$B|ltVIEfqf|52%O3q;{a0d7nsn02i5Fr1&o_Yiy*GmvLkhjJ=z-r0#n+~YdAUz
z|42B_)WOSM@R8atZ%X3gYKNU<d27v<M+@A@VfZU5M!d#Qv&(N)O0F!&U7{N2rZ-}>
zB4bBq8@!jTHmF-qr8+4t(^zvxEMLD|he-qHg~6lv5Y}szvT@2b^691>HPbb<_|G0N
zapPfv4$f?b6uC#}BkPV@964<ax(R?dkOgwcP67ctPbCjo$cHegH>Gy=J|7YALfLgQ
zZE#d3XYICy7N-NGTb0^uz_ufGkyL?r=)rFUHMNMk|Gf~uunm<Bb7SISBs`)N?!PL&
zi4(;Y(@B0q-gxL5oLk@{E}v9*5}i%Eod@%p`nUTO)N+>$r&zp&0$6c>M$=;2IQeZR
zHj2T7kj&0-Jx3Jf&}sZ1l@#|DvK5Pgi~sQ62TCf}o7}o-jFpf#SConfqE(9T)Xaso
zYUw;;#@Jc$cKXAAN#PiSVR&`Lb7aEgQ$(`@rG3;92v`q-N|b<OE~hQ+*ab+1c2aB<
z(Jzj&APsWmTk_W@xMabQkw@RhpAKDg2@?e#;JR>s+(!#_-X)$GhF%B^;i|Upcv}6X
z7A(qBrrjcdqNFA+++B~O+=}Eai#EBO(5nbUWjz{q&;}ek6l8cHtgLld4H;FYPM0bp
zP~-L0>Hx9|L>kZVx|axe6xrJ?WC%n35LF?ffDYEsNWXoG<m!p7S!-^y(Iz(d=w+ME
z;&6FovZZtpZ158`Z>AA6kfqqNbhf1@mA=&}s}pWc_cc1<iMg+Q1OI(~U5mKIhy~A}
z*(ES@ExVPCpkG41$a%e@oe!9ZF%`Sh3yZ8%mRp_o9j8?fo%Cm?W-ucD7$N;2x^bi3
z!JsOOcP(yc_WWNo7+0gbi-+5s0k(iQmSxop!WAlPhO!otC*@J2w7US6LNx6xAkUca
zQH%&NUZy=-f4aG-sB$coQF$c+=i%=a%9jyh+_QDe`X8oPTyLwJJ`5e3=6;n!Zb8Hq
z$5Ss9L%qR?W=OskzDokPLv{jWC(50*tG$yTZ_#Ltr-Ff#u+DIZfzlQJ`s;6LSA$CM
zD-3+lpaOM#KHbOA%ndHkzjT`>Er}w9^>%E!T_i}bsTZaOriP%+oqeCh%aS7pRN_nG
za^;JQ5ft~Lj`I=l)r_Y5UR%80Inzg9a~!iWHD}jYX;y7yRAOdj@!7DaI0!=Y(6ZIz
z$ZQ|^l4P3^8j)d@6)DL&UI~cJ_=Re}*o)keJ}!g;$UIf%0{Tb-G-TD-Dic?Vmic6)
z39n=T@L*L*uPidD?2w|$fchv-S>n6s$*2c?-pQ7CQs3UEH{U-{(p@!Go8{;|u~I1v
zXn)4pwdfq=UZ0)0{Suh1n?<JK$;TS7NhLWdq1N>DLDP8f8OgU5gs=mXYg6ev3@c~I
z9Tdz6Th;#3ebrmlc#1t^v`y&VhkkgI`xX(H^YZ>1sb%MHWXH9-<2t)%)ulOReGokY
z4z_@WjN5U1j1YV@Sel$hkop?4mVCfjC^<V);x@v$zdQ+;P=X2c(bY?K5x>-d<<Nmt
zTg0zaaw9<sJLq)kE=c#gUnPkP4~eGz@ss_|b;?oL0_-(}%##}KOq=V%Bu_x_j40CU
zI3GC!bP7ahFcmyV<NtnaQ%yKm6sjONNVLO;q&)H{kZ?MQ^TYL3YLu92F+rb3+9)N1
zVy)O^Cy{^5eb<jb^hlO`)i)vTNRU3nv?VJsBvfzIvS!8}Wfu!w(c9~(v+Iqf5ldAU
zqgU4%EzpI3u7<w|I$+PsgRB3^#2THUS8xR@){jDdxV=G8+zL-@mH6Pxn1>=eeM(La
zB!P%<`}B?1JUkpi`A9U>9s5N%$c!;PDM;CU4`Cu70>DR`>RZ2QCQuA*gv>%_qiwOT
zsg>GTxIag`hh|I~w~J0s9+QhmLyj;WE|%^&Zne~moY@LTOU7WWe@($#?tAsHQK>g;
zQl284a#N$I;TabvdrR8|B65Vk#X9V_{#*fIu6v!rlBYHMBnEw(_l5UTYDc>;A%)p3
zoE2J+(Y1I3Tt*vM<fbA&RH?M@NxO}b&O^4N{S==^0UJF&9j~k`_7ADbn(dzoxX7@F
z*}W4ko98S<f(0{$@p7DMYK0o(rM5xis@Y3_$!jFj7;#%0w)5XSjVB>B+-2b$z>nm5
z)LYR-HoBV4t0)-srq~J+=N|gu%`N;+LBL8|4I`P?)plyv_^Yw}9AeKV*2^hrR|$kX
zXiCvIuZFIflJvA0&_)o8XK(qAGizY?n<o5M{>nmqsyP)xn&Y3{AIt5{M*^_x3T*H%
zEJcZWJ@V(LB8^kFKmJZC){vn-+$HilBzO=8b?F0rX*E&p2eNg9&uF(^%Us#dj3z^U
zW>lH0kD6ixJ$}iD+r#&9{Ve9{VM3{pDE8lMczS>1d6Rq`JhK@9y~*>EB6Ph0fKJUV
zJXeS%QrQQuPM?2_bkRk`>HMk%7~)l(=7F~A0uo5t-6EHI&5$RTGNPCl+5?pwFSxaB
z$_#M5>c`kp^zSAZ>)Wy*Jgu}V?}y4J+C;b1jwQ52cDum_IRPEf8>#(dxU$uLSecKT
z#h+WMUi9Y6`C3ip8)>L*YBdwiyZ!MQg3OB!N*VgjRV|@l>tSn^%c;{8H%2}ga{-_1
zbCYOlv)G{}FpN5!df(P=_Z#3g3~6Q|F^RZctT{!_S4TendtcgOUcjj<GZzb?{yrJ6
zF6z@V5kuo^1DVNdjK^&Ve7U*qs&=8igMVI4Na}qCRZp{WuF%5Bdr3UijAjILOAXPl
zzZM;&jhqZ^C1QGtQf;=4IeQBT=&SH7f{gxdmxv?~A#_v#W}Fs|>yh}2?!3II2eqbu
z{H(vk%b9rUe%ZHB3R8)zDPVcTIcEeHtM}zsQ?8{m+C}+W_>grDJd_OLJ^%g5EpF3%
z18VQLL>*=VF+kv*kFv8!+|vV@6S_fPm6nMkZ9uBeI7G~oap@p$;B{`KOJbiDtA;}l
zb!{@ZtSkDZOzq`DN}T$#8j0o#Ua@DfP9CX~!;P@V&lBJXNs^xdQZkNa{SCh@*Bl=W
zN1pJoydJ(zh3w-U{(u@C$C3Xb@=FZm)W51e#=`E*THKuLLP2e6Xd{^HA*kG^3&^&;
z7rKy~<bu4yGK6cLo!S{(nRZ!eDc@={?8|v_hw#a|hHM{m*W6^lQG+vXfLdY6=-ZOf
zmxQgMdT{)7w|P*iB%v!&LN2`?;es@9l1(&Aq*PIj_fteW&#jYyYF|(YD};)~iU?ae
zs;q^XP^5iIWD-O4cF{@KW{(}~%C|?u53UDweX5S7<4=>Q?tMWg3)ml&iEjHVaNi?R
zc;85+!PuP3jZFa+r1ybbFF|jTor44)Ilkt&OT?<Tjb7odLsEpBRW?$3qf)=RYkY3@
z$819Ym@^lP5TmWaBF`G)C5%hbSS=5dLSy<_M~pa8!{Qlnbf*^HbxjR+hqI;#Z+Pz+
zd@FRXVT^<y(ui6ZuFLT|SUa}POs~JJ52B)_Z0zqi0ta5Y6B_5_8mKLvm0C@>?Y;ZQ
zyi326?^b%MNASm9l~gnDW|1)A@GPRVv@PY>m!RiRIHOmrx-}I??G$scBzPZh`hrQt
zo9J~e-}u10K#%-R9TmBO<>x-KRTyFFgI!N8RZ#2X@ri7>g|B5!e)#ew2QVw^aK*72
zuu`BrOn2TaIIr<UX`}a|z*xmfO!^s$dc?lpnYY^gb1~=F_;c$_P$(;2wssmMFlA8y
z_0V40{gl1IJU`<ZKtDBBh)-l?sYqrCh~1Z-G&2Y|M?)t(X#4moejT9mn$)sk*xoJ3
zF$>5C)p_&7FgGU;;-6-U^cbPmYePw-Z0~$163kZYjR*@YGajYUWR~3-Uf&DDY+rG#
zBtlxjhLGsh>t!RvWAm4@X1Z<{-a&r_n|~QaDoU-_!{!ZbE0?9#pWNB$*LiP2#lga=
zGIT1)<|k}}oqenH|1x34h-jB7@A@$v4-c&=5^5BvP^vd7e`=WE94nV!o`jx?VQi*o
z&!UVA;Id?fhNfRyJqmc*;pyi0gJL+OHqS7zk}SCC*a?D)?A-RMWejR{J<6ablAM5%
zYKejqWDhK0G;~@3d$_jauF(UOUc<g-Fh;(wNVj}r@({|`lOQZGZo1r@KJ(FZ-Uv>j
zae;^WxA+cM8NMteWpYzD@%T*Z=tS&OXWV=d@@iYRfCrz$A;LnzQY@?7#KL<(W=Jn<
zRBw{NlTVvXybaY`Hm#i7a3?Bop50P6lnfc~#9dFaHL5UKev2r&;viLjmfwC_NP8|B
zWnd~HF~)4%(^0r6*nM%ry8<H4n;9(?=mB_AcW-w~B@OYn_AW16K|Jib`fkXSy96TH
zG#dmhiO2pRnOTJ~Ec{SQz?3TIdK^tE+VtW{6iRi1RyyvE_)k71;acsF>9*|h^yPtX
zjK69H9d#}^@#LHB03P|as6pV3V<JttL!2C$zob%r5?rV7Q;uPsOJTERySKV&zy{=%
z#_MHETM+MRd5~4<Uu-6-oh4NI)*_an+IU31jgJ)T)eG$_hgo#g#~Z8P_qZyZsRY#<
zlgIbC4c;BgmbFfw?VF<jl7b3CIuOZP0vP+8%$sUbmf3u627}8;w5hBoF;Qk7qvI*f
zh0TF$=eCH-MtGRpIE~7%q;gd59lVyLRUt`J8!BakHEw@8Xe}#gEVV+JF5)UFNzgdn
zdfAJftJ$B;dN3;2uFSoM+JBPQ4fK1z$}?A@gM*Yz)C%a`bba$Ny@9_WiXcGH#xoLA
z!mKXZ^_)qVos}vEz+A4#T5?skO)FwP!0;A7+0BZei)2Zf|G~a>fkdTDj&AFx0^n<m
zVfEVdvAn|+`u@psDH(4(oWD>{(ktMD=pm!`*UJ>MJ44V<-gZ(z)0D*tSt;?I!C7ns
zR=W3xj)V*B20D`Qpkbh7cJ$~uGC0x^Rg2ovRcV?j@qtj+eij?%Jw0MbJ!~{039I;y
zU5!~N^5e-t$=>M}H>txa<TMKup}+mEpI?Q=K8M%_mhu~Wj><CeE7%#mS>(x*#A!+<
z0$zYv%1lw|U;gyACHc_C)xItKX(|FftT4AgkB9h08#!^xGqgd*U_uJ=p)&lOZ=dQp
zQXVD$Llo6O5HU21Zo<fliKq0kQQ4j$gFRum-hW3o3-cK1qjV^%_EV-wjX^5Z!ys9{
zlw4dN@N`G?H<As%0eZ-Q$6b3>6I44Q(*;i6g45C>SlRy&ChxpDas@6!U%PiDU5eRu
z@ed``f{be659XiC005_yX1WCi39TI)CeFD;d*YQQ#6Q`GDB-kfmMVXfV+HSgx)gh9
z+HV&Vyk1sbgXF8B=({>=hq(nr-^zcY{zQ(}^yLdFU}(G6X+Z(^h6L}0&sjEGPPW57
zH^YIfMk`$7sB$7|kb&DdQ|n0HJPaGrxCzApuDqfp&7H9Z7D;nVqb~-O`TD=Yi0y>9
z1fx+UuF(mH30~C^&A%dp`F6`52Rc}*i1YMfUCCY5l;FA9lOr{Aq=UW5(6&HCjRsJb
z6Y@l5Mt&3C7x0J8xKtp<Glj)+ba}IF`p({bY4d9^(ga9yaSKA}^n*&dkCRb%D6O0T
ztzFa6TBDvDjXikLmrita4_HMQV!A0nhlAUmBMhSn%*z_zs4#t}gNXxEaqB){m4zw@
zs1Nh{-Z1mMaCHtAaD^`N%czee?OAFHtPqZ-IK60sT$o_Mwwjhj_erpr`4M|QiDO^&
zx2;Hl?2nE#gMxs<=7)ue%iyEeq$H3U9BG_z*hL%`?8%Pj8!>}Kwn$sn$2{v3PgcI`
z0e#twCV0_atIrzmRAq~e(F|I1EO^_Ldp7{1y0&wdJ{U&SaO_URaG7Out)$i$*}j9o
zb91re^{j#io1~siuR_m$+ObS*3GwjwkB01PMH}BN9OP!pacg&er`J<#^Lm<=!<>bE
zpGmhr(;$-|G~!4(b%K6pR`+bKipMp6Hf`4eUlXET9l9DhZ+kMR*of^XndQtGY)akP
z{)BdCb}=A@*7IKmMFobX@qpcRcJFYtur_-wM<VFYp!i@u-E3qOPn`8ACnLO6!JuU>
zdS(jSWvk2k*>!*!Cm(cmqmq!%eA>Ag{9H$1R5hr5^p>yp%8ueJf)a|N#M|rz@Zs?p
z6nEUXSbafsDLC(mD+t}e6ow_Fx{Ev#D7iLD@td{lOBdFp(mr9{e^+GZ)u&H-lA31J
ztnRB{j&_rW^N!2W!jz{a=~og^3f%O8Tm2{{=(&%=CE9lc)sNS6Z}XEY^ou~@#Lqx9
zbVZ;ZWcbAbk>|A9D1j7eMqB>4bLQ^E+Uf)Q=Xy5+d+oHQ8b=jbdYM3}Fl5v|xLmVp
zGOUMS*%Y$_N)MPiT28)Jn|%a=e)XVbbKqAB0W(JGu8VLeN)PW<C*?;JlDI*;9yy%?
zS=3=2^))wf##vEJ^uPVg`mP19c&bxyv34lRuF9&cgFGiIP3OqUb_mPPQSSj{ZJe&I
z-2Q`R;9-r9z0_H*W$V$xa=*CT5gj?1a|B}$hYVeN!hA{^*-2Dz!F4|XnVmwf=lOP@
z-lj?@=M|lM^k8gSBiDjkh^3>0q{tH91<~X?&+|tNbA7K8=4E&?H=`a~%M2naWY-<`
zy9ORNJWk7wfCMH~2`xn4I=Snu;g1RbjV=7Me)7EZ>7&<MCR<oqLap_>A*f(J556_i
zj9oavk4h-wpaHVoW&Ky5x^&w&^?fJ%Tsi=KVc*0J#-A<%(V3hiu6z8_0Qw&ddg+vA
zb98ZHE9i6B8(kHNL8d7kQ=fJD-9(ayl;WED=7+w6JVaR|SKPh;3i%8|CHL@P05!HK
z`tDVF)Fu5UvT?Z0jHxHl2kdncVMu21w2oJBonM!Z>KegFqBs3ShBCf5!py`v#Ry5v
zA&G}}>LE$7ym3T3Gv2=rI1I)lFcj*#dn*}q9eI2ijqv+Oc&o7Pw}#?+Oz`PbDKOAL
z1Y`85nsL}BEyYG%X<6Yx33E*S%FZZVwRav5k&KbDSe(e<<BHiJ*cO-~Dh^2hOxC=A
zlQI0_E>q+}SQ+QhjFuPlC0G{2=<ug47qzR}Lp^LXw^B1Y?f?d!sJ%W+KA@06u2+Z1
zSKE>gq4as8k@a(;J+dnN;o#ChpfO)0M@pnl9{ETB>3rBod`b}C-qgd!uR=a!=@!I~
z0Rnc$e2+rawgu(euz)NE@t8MO&HiW_v6E^^mTAsWN`ol}E8|SB`-fAKQ~ypfiuwf4
zwPLje0CTsn^allqviZ<RYTcC4A^`2Hj4G2ooILUV?~ibfKYBGOKqRf<KbqCABg^Qo
z%dv@hkJYwkR?QKCrS}6zcR|r*+IAz5y5R4ZD!Qz=I#O7i^};V`%CsgWjerV7t)oA9
zab71{Qi_0Wq@;NKpXV%tO>U<a(+`uYG<@&WeUQ9;d^!9~5D?eO)Qh&#Zabd6S(%{4
z9U&66Mw8@y2Q3@jdNh6^CV70&0`jT*>_;zts#_^vq?TcT2;0sw$%>}K7VT!Id*iN=
zoRtcb3Kkka!id{{Nwpe^%qn0FsM1L)Z}^!P({iaIyPoFdr+8H!2z?d>9<4dpMr(JK
zpU7>{ROw;vgVk<4^5jJ`c3`Q&wy#o-6Q?*Q4&v+ywmU(KR#S`va)@X_bzmB!QVoCT
zlwJ0`)Ev!+A>Vl><4irI2onvcE$x_&ENC7b=g#%Y2f(c|kpm7A!vY^61|vTrKyUyc
zu^p+953YaMkz|s7Dv~;froTqW<4+kc%+#H^bHQigBj_J~o|WqYl)IXC%3V|D^74+%
zsoNl?!Et%B_3i}VS18c6b%O0M$_=V~@i=NMMmIawcx4bkL&oBGqBb7+%SM$c%Gq=O
z3c^HMZy)6UDfMFDk2)pI&M*mmwMW6W50pI}<a0aPF%wK!(D=h7*A$p?RV=|{uUw~*
zx2u%S=RzoTjF(DB+WB#=__>}`h?4lzap7My+HkNnc3=lyZKB|4OZToMbC_Koyegl1
zFFjTZfgF_un*ixvV#e|>5l*2gQ_CfhN%;soMN`bhuhOA<%VFI4C2nl1B+2!p=~JdM
z?lUoH+8GiTr{a9<sceb^es}%vNZ_>GDdqf;Y1>MlUF@H3S3l}RgFTfeW~#$PVYm&E
zE7wYHhpy4CHwYbz7A6}Mf0sWg$pppC1x^==r>}G?p`VRC-5LgYnO1U`dVvb|TRNWA
zKK#;*%o~iLH+Eu`k|k0bS4nX@p<@4n_4v0OxUXg!$&o)}z0P;d8OdH$<Q$TF={h0_
zb?-!>hZJ=<V(P%u-Lf{VL-!CaW9XZS`WEvzJj{z2_Pi9CNd|1ynaC%L;d+S~%q{(-
z%dGp6d&J<NHgBdlYPr^-R|#mFz8IfpDAgRcaV|)n)`7Gs?U@H1^V7slj>6p@l3307
zG(t$TjNp14sMe46_owcg<j@`+Vmsw&DDRMT3Gm9kcvb}z@__7yzB4#?-lJ>0Nh0q>
z7<u<XZ{~Zj4Eh}%+o(D|#zPuNac5R#nY#S`0w$J8sVd8{hK|(??J)+zbQ;BVNH5}c
z_ZRXmF<Ku4>x?f@@s1jzc(ki32kO(9ALK`f!`-(EV)x}rawX9Sd>S}@6h^6xxLLu|
zgA9`UXwQP-L1&+U_`sMj3#U}ql<Tz@0Pv93pWv4E!N0QQNmo(2Xh&^n|LyxYPE%ve
zN6*I*wZInm^jd3BaVU7e;FFfF^P@j*-a61FJl^C59DWb0Xa}}*>k&uB*ysud9W~{(
zZNF{)<YFX#v-i5=chlSl$4%2T1<_B7HHMSPh!bY;eqagmwsBF((F!@AGCzRx<|UR>
zOp!Q0#%<>?4-X<kH!y*VpJae~PnJ^3;2)l}?vPD0CKyL)_TbivmVyL?(|5zxl{;!o
z+!iY@aInW7HXhA8g~_A%L}T7;>{|#2puN%S95f~9qr+59k$+O59H^Q}zopcfsT=9f
zSXjRnWCzuR^q3;%+_rfjEgNdFML8)YoTYvBST`qo71i<|K=?sr`m-6AHih<u#i_q1
zRraT77urcDm#81DvIpjUv{Xuva=43b<>eXxCr5V)hF3F>XFrfIqU~~So_iS0q$f;H
z;|04zn}mz(p^0w_QO+qIxIXK_r*ln)=rzRD9a6EBDH&NUEyk=yB;9Xe-hZaRKJ|#_
z(^(h1h_cGjIcSE@t0X$X*xOQ~o>V6w3d*g6SKc`9_i6J5=f-G9ET?dd<f<7suD!1)
zeTBIMrGosK8xeJDY3=jDNf$%lrLGu`>yknP?2s`q&|F&Z9$L=XD@Jgi`5ShMIa<%U
z@|H-i8^xN2N68=D_)zsLP)SeWwHCPc4T<CHG!=-$>n$^Yb;3y`ger;n?&B=BSD4)!
z9G?DgrZ#Mhukqk~LX}xpj4fkLOi7&EwYaTRxqBtMg}Q(%XL$SBSrP6Y?3E@h*7|9<
z9brgff3f?5zs}b%J5i@~6STXns&JG|>2VzLKEcScU<eu23gIsQDuT%M>p?65pvwrr
zN?n9({N<?CI4;2DoibQ)KnxpO+iHWn+6a#LJVo}^ZfCQB+DgCyZT<<HZT6`*Oc3z;
zN0bdV3a-D22j5gn5<J>7ZPc-guRI+;^dS6khfJfYh1L5XBv(*apSKoQJ8&C~l<uL1
zQ-CmTv<>5ksLSRuH93ZLIJc@m^QLGrfHmt;BV%!3{uTm;j3sf#QQMDCglg8B6p}^9
zv3oM=y;>WDjvcr8XC3y$A9z_{@6(z%Q=`2Odc5LhD;B9sFa%lXSPb+;n|wVQaG0s%
zY9;7dbkwAFD5l_1GCOZ^Z5PWHI<2%2$DKqhlv_glFcsKIL`UMTxWpRI6Bali>=+^%
zVO=OdDkYO|Ng?o3Sy_Zegs8Pk6g(_Yu(yJ=%aU$vz_io$G92<}1bNg|VB0Fmd9{_T
zn-O#Xskb+{4U}aW-8EqjPI!~{LKM84m~A(@iztP+#=-|4o+gk$=r@Hou4IvI1P3KA
zL8silQ)9h2rmB8AB#r)^=te#~FzYCs;%6wqSbql+ae=i;bSnVp_ZvHj#Fpr_`jQ6y
z%sj*C(ODs5grU>ZjLXeNu)e5aZcR<(U*oe40l6@&J`EoL*Jb{^-5}iGsd1hBwEwn3
zB)cWJ3`fOdahfcd4_^Fy)?Vn2x$@4Q>IKRNi={qsV%^<0ot@JBqnsGZm7q39-RFwy
ztH_`=3J#ur4~apn_9#))BR?TrwCb9W9lG%@O5)ljRDhe#D&RR-X6atk5azs>I2NDg
zTb-k3RdcfY)dFG%zf4lmQ$&A9Oe8lOAXFTsX_IKP#@-3sE$Qf8YjWqS&8JlTn824|
zifhjnb53`+ytnLvW(uaH%n<za63Gug{4wG8>+??YgIbQEF!F_oZG`;#h&I9IRFUKg
z&zbI<sd1KYAu<+Qtk+HsZ4sQ%S+oM=VE-%**<Oh)P4-=)3as=&ulsS=FkHMR_WGW8
z%p#}b2=BgO2`H6>3yS{6;3F<LeRF-y{F3#TwD07FNoK2AHfiQ3N0cq2;yWg)A~11G
zhkPa(`y3|0xXVUKA^Zn^2jTFU*6Z;*8#i&5k~EYUQ4kQX4}nCihi61H>1}wELB0I>
zYx*PhU_S6miLf9*d-@{89!Kaw4X%<K^EfF`(KhM9M?qY#9&m!4T9fUHESCS*V-ZHu
zf_z)&dLg1fabn6@uv~`-E-!BQst}gkfU?FLLN_RoWFTZO0S_@vpg`|u$wd!Oxa>fB
z`fV~@M`myKu_I=H0QR#?A+y?Ka~<AtNDHrNEU2SKVhqQX#sxL{E-OTQ?UW=)>u+l}
z+}$~d%*&D()b3|><guevt-94QjA-0BDJxtJ(+y0)o+ZL3k3kBTB;Js!**1bN@n0JL
zSLZ7az>A^?Q@7i-31hlbk6<!6Kp|CG-z*_~q!e%(N_%yyo~kr22EBQ7K&RWTr?o@{
zq+wSco3Y~M<*q^Y=5&#a_z*Yi87(_`22@?u{A}e)9?_;65%CwULtqY1+x{-Trg;$G
z7;lGEDKm{fj`E_X5^PgR@_5=+Qw7Y^Zso}w{&D#s@aUcQqj)Kh@?Blny?l;M<Ft(~
z)0KE13ehYY;HI4h%@wA-Ww3$lpB&MKl}0=D1Sca}qX9z7nkE5~qw44H45{H)`Z%#W
z1BzpLJxa{6=6v-iR`5ri*h}xZJ+(vRhdI4H6mi@>-uhCXLV9r3zjG8nk&qv_v4nh5
zF(OF*?J+EJS}oaCy$FzO2E~=d)KKL{8(d)5wh?h|iKAbu#+!dhH8#vhiXk7R(vfd4
zB*<&Rpov0bF;hzC=3b){hp^+Pi{0+T+k0`z-VfYt+mtT;x~c6NZ19xgNe$(^YL(mI
z03-mHqJFyzLZ6AG6$zF-o>Od)8M^vLaSu7X3hKo$k3yjMG$R$^+0f+V$uK2IFo_SK
zzdTDXkchAczqkJ((1FL5zu_*ynQy%**RNJ_GWhytE`EL2F-tZP-T+ol?k%D2t@8?!
zShg%Tcjtd+9)>5304E#e{+Ofx{YK{I5jl&+87vUCyfvIVC39D>Y`cfUKi|y8cQlq4
zVIKPy4fbXgC{MkIQ&?k&i0bAkP@jPUIww)5K;R`i#GU@zKrg2U<Q&7_xxXXw(Q%_W
zs1s)5CimRK8yfv)9%^OunsLVhlE_m7gzDCx*jf>Z%vAvL7$Vrl1%```w`pVDb1Dlr
zb~z+>6LbtE7rXL8D0$amGa6`+?j0ji!KRY?G98{wN;js8kwN?!+s&Ny10emr{KQj@
ztysBGWY6tvwZfwXy&`y*Y&wg`;VqqX?knoZ4r!?E<y7MGI~_v*9^zbYUSvpCvw*d1
z5x7Y~;A+rV8k20t+}lmMqPc>QbWz%C&yNVIjX_%T(CPem#9`iPqA9$#MkoqI3BNbr
zj(ZR!QPDZP$`Qa_1MNZ$x(o?+h@a+Y_d9sSv2MR3ARauPp3t?|Txg~!KbCmojY67w
zy#X1qH)DHqxz1_^Pl=4tSE=qF0uv7fO{y0``*NvzvV1X@S#MCH%yXg1!%xMyh)*Gb
z5~_V|Wy!uR2`Alk>X1uOck5+mS7Q$&M_Aj;oGc_Uk*cA516x@ubgo0zEZ({U>0sFZ
zt1N3@TR055Udb`Uks>#1#7+OdGYez`<sdYAxDrFArV?+Gnar%DlTuMzrJa%pyvn?P
zw!YI^%#?zR9z*Z2yWK%2#Z|~d;g6yA^gP1WhL1~QMQo7xTMS{F)!@gmI~6)W_ile^
z2~Eyc<6Nv?^F>!m81=K`rKZokzkT1cqvSQHm^%%k1^u`A8XX$a^AqEil9zTuiIqnQ
z9Z$^#@9+`=R+3VNtd?>6yHlGMT8knz@Y>#^50zuWZhC#he5h7$p|s)IR}!M^j?z6I
z0Q^X}rP%20`k|1QOVR4%j|%l<;x9-o7m<`6^IJ;_-3X<zDHtf}vZZ88B?kjVU_-K3
z<!zm1#@h$o3pEmra%$G5P$X~eWu|oT-`C}%)!1AW4QC(?QOImimzwJbFlnhmReCZ`
zf{UA_d#+hFO^+SC$^>BAcfn1mWK=VkSvoWxjaP#`lTy1g=(}$?{hbKq4HS1ybKO*W
z3D;5DUGL0vd2l17nwHPu%|Y||;W2oz^@*|;p8=RtbFgta?kSj`oS+dV>7aE~ry1on
z`mxf0ER6-s8&9p_B<)l~JovTe^P;0ST`9eV@KtKWL}Z(4>3Sw(VL*?iF%B(hTn2a7
z62Z)XED<<Dg-I!>&LX&g+W54j6hL5Hr1IDdOD;Xw^%?n<puQ<}nUwzYO>4PG5sT84
zU26wv>oa%a<oaIYrluO&Opg;x&^w$rmr_Z8T>4p*H4x>>>#v#pMTWzN9+}c%x<fA!
zoLG{kIFGjvX#~|9ccSzDd<Z<p8|{O74a?Xt#3H$w@H&0)kUx>XRAdy#EzKXB0qu#?
z;1?^L&thd81vDxNvr#O0CQ4Fk+YU3?fKQ4mm#$qyOMga&)RM!XraWurd9J(}bq~~s
zw#r<-{&iJyzK8@DN))X<tp0Wk(nRlN`ya;6DMplNZPRV{ZriqP+qP}n#%|lTZTD{5
zwry*AGC7m~;#~Z7QOUYnNmV85s~1mN&Bs%@y(nQxXh?s(o+!GxK@Zl2B5=x(mI!P=
z0MQSg%jIR_e@m(|{<owm3)}xls<Lu0{{Pkg463qmu>HTBDn1mQsD-t&i6cIpsI`H!
ziLi;0ov{fNFE5mnv!jWD4V3$Ov^zNSrq)Uis_-MGPq?mG__o(gHhxq;z3IQGZLf%J
zEr<wNXMv<({9gl59KPpGAjG}Qc=t>9%}?+0OSOj8v0Kj9rO)&B$(ordEZ5&2gx)~l
z0o;N}|H4-RAbtt|gqV0x2nYb65Kw=90w7mcBXTIPH)t|_wh(vxe2BI~Kl&tYd{=Vj
z66-KQBo}yl{}M7707Ni<VG;qugx?Zc2#BQDzu~uWAmke!0yqGiKmalz*n!0QYJzPa
zzYV%s3a38bo*?!C?SS}@kPJO~*8rew;o!*D;NYjL`B?<Er#Stt^!^AyFd=!~KPZ7x
z>lh)9smREW&(ElJPC`)l+*!u$Zvfl!Nlbn4fx+(X0@wh2Qeda+?E>FPr2Kt<=v_kz
z{jj3oW615e;2;2C`||W5up?aWg1Pv)0Zz97MKRX_c-$a9*)%@b0^n{-IRN4SPH*h}
zy8OTb2mClT0{S7?+_>84kgq}Pg9q>dcvNfvli(uZ^ugU;C7OZ=5X}9!=(xxyr*UOo
zlRI$uRr&$+!)k8je8lU(7jZ(6`2`L5tdKu3z_v_L+JX=VreJ}@2q1lrOJSb;{pWmM
zP(Gd7YV3pAHh*f9iIA^%UmIb-<=h02*dGJPgoWPVz+n+SgE$1_0TA+n%gTPAga?5C
ztA94ApRNAo#h*8mPtZauh(|ZEHel>I6Mmrl82Cr<0KWNYXdr$McR`@9pM~2S6hH_N
zd;dTM0IzT)WZ7FeXJ#0O&u-D&UhqY5eNf>EI1qqu@2@Z8Xw@`epg#{^Vc)-i&19Cz
zDH&MzpQO)L1qFmX;M)_l1b|zqa3DZ@cyVNWQc@s@Pd98IuG3uZ??E-->u><^Pg%6B
z(q6^q_d>uLKHve^S2t=M5Y2XYfE7N$UT|c<z&X3TpT<qU_Rk;XZ>I4d%EzB+@g*d%
z50jI3nODC{S6lhC8$2-0_8js@<Wv0FMt~o?3XH>-({q08yd2vfn<f6W{89nH>tI!8
zzSA0j+iN@QNac`se(cA5^127RrO#m*-)SrusIXI_xY=Abn007~PdY5m(Y~5fEs%(m
zV>%=d9-*IYHPAnz?4Q`I1PBWL*<oSXbb#+wb5scad=Nazf8cZV48b6v`Vh#QpaFD@
z@cR(<1a2Sn1^5;G^SZM~<R01Z19b~CLsdU_;5q38=s_Z<A#}12{4n|buzc}e^iUxk
z{PT!l0&ZW?^aS_e-t8LTIU^TlE|B&CJ$55h2X??7d+42?enjW;u#m4KKFMI?;Q40<
zr}t7LeFJ~a;a3+1fqis76Bs*u{Hp!7WZ=W$K&0s(00C1X?JdGj*=v>ZUXJyA!aD0#
zQ8KOP(1-%}Utd>uG_dH@Z1w~8eZn#}1~uLnP!taEfKEN0r^URlyT{?OXO!uL4ay#A
zsBmx5V12oKk3b9@`DZzzBTa^A6R%3q=@T|v2kQ5wnLg|>D3*!3zOAp$RL~r^6b-R<
z!N_??OvZ}DNXU_$ZH#!D^bNFxVKp|1WQbqt#-Ev&=`p$oJRxMbl`g|ezm7Ytlhc@(
z*<MI{d+DTJ%hW4dRhvj715@VZ5{vcOUHnrhN%S5#5QBsi4wcIZiPDo>{?SAl;ePb2
ze!h(Df1^<V59CbAc1Y&8J_c^LxU&)p^Nu1vPU11F)*NE^ArW_MWnf-Rs-+H<jOt$a
zJ8&j->ruf_T@K}&0`0Q8`n=~eMUYeRHO>xa*hGv#L!q^3V0HTV@)59s5*ud|03+eO
z-U}-z;|(A3UYfIdQDg(=<r$UEuJkRNIA}a#_Y9KVK1tv;jc0Md`ZmnHml&0iy#w^O
zjEJ)!WLR&fcYb+N9kqv!o_R4U;i4$~{@oB0Zl!Tk6qq-zGcW**`Tk4GLLuc5amKJr
ztYnZtXw(opyncbc*1<+YOoSpxDiJ}U{X&VJJEi)!$A=nenKF?87YOE^+10<?x-L;z
zv)6kf?_>iu)7UE(Sb)GAt9pP|>g2<uBP*k<b8I%{>Tm*9<Zr|*a6Q~ZNaPA>e+%-F
zzzY-(QV*H04xhy~9kZHwRDJMJiJKe<-3G76#Hz(w?r7YXqjhO(B9qaUSohmL@`?X|
zuegk(KT83K>QVynd=2x89Ez3Ul3nSR!>_b6_pn@lbcjVTdM<r_Em_t%CE9r1^YJnc
z9yt!+h&X*F4!L)PnGOF3(hqw8eL>%(pmzUI*wtvtKoD;i2z@$+284>9qgvy9--fCs
ztlGgi8qM+=ytEs}3Hj;?CNKlocbDlhfnMeAM)!Rnw-+MgBBJL`h2MGQ2GpijE0ZTr
z?azY6V03+3r@SlnlBBA2Jo8h_s<z${|A(acnrhjVs*Dz>AkSbffbap6fD}jD(Aw6X
z1lBE(fU~csLCM6Vd0J(HuX0D`LJD()%Y8PH4+qw8)qBvpZXGK|N<PymMxtfFmx0BU
zIldipl=#^uro85Tc^EWbVE=>z6vFfcyC;{PnOAB%!z~Qy2*7cAtie`gJtS+DZexw}
zUrhoZIGVq+6^mF|;>L4rC_D6Pw?1FbYC;WGT8l;L%CavTgO`AE9yMIa<T<S-$ce4e
zxF;Xr)P7%<@aAM)6`Fqrr%yRiU;4{SM!Yx!Bvsgy$ZyIu5-g3=S+emuNfj;e3Siho
zm`#1|E$LPzk}oWz%~B+1YEv=3sVC6pdbL%TTw<HgwWLI8r`q<eVd;d5qt1SfJ-{Yr
zK$`m!9$GztfaiPO39@RA=OA8Us~v&E?LDxnCPpzY(zGJwLBn|+xm0Mc((Icjzi;rS
z{%OoyTtts(VPWsG_z)Md4)NYL*WdM+0-b)GS~ZD6RS}z=(sa${wWr9#R;R_m!uiqS
zlP3-&mRuM=sAtLa{R=ZILl;(xg?KKD%@i$Zr;|5$f@6`-c+ulTUI>h~D$xYeA7wU`
zf5-gnM9c2Y3Y+yjQ2ZxW@|ZZ=B_lX<!pgA7ncA89WHDVB`J%6ngiEtGkVAL%2PJ-w
zX|U-H4<|@x$%a2!StLVId)06OXmlTDP;r7WS&}0?4^l2Iz%!(|V_HG!{}#^ooDJdF
z2Y(q-&4#o$9p_`Sm%3_We)NDvDSn}MQ)fiVxYG+&?S|bmdjzP1e*QKr6M>yhu6N$X
zo<{e$`yy#mVl5}wca<Yz%f|b4QANooqpUIE;c9_nQc|p&?bO4+GtFgqOg(Dli|H^X
zTDcHcwEEwo1Xe~`9vk{7Lr7%d7)N0glTlt2uYSHGbh?9;L*k`a*E-RdTorkB=>47p
zxId4v7&mxHbXk*!KBIBaB*R@502|S5gW!BLY%;#-_qD|H)ewWLZl+?sm7Cn;0QyZn
z+KWDtI4upDHk_S|jPTnwYVlS+4FqgMV&TnR#<7%v#U@;dktLtAfA7xgX$Dy~y*J3?
ztwHMgmv>AU?D;z1DAT{Iri31=4w9863Qdkh-F_lhm=lAk^64}PT^c<rYCDm$?{`N`
z_%oodXvzJg@B8QnIy`A-w&i3bVv>2N0T|Wxry3M;-(;B$+WyJ=1=(DAWFE#&zib9&
zM^L(zut{RGS9+;+p1o~oLhL{oK+L}YuEHS!7n*gP9hCAdz<0okEo<t|chfGDqT=~@
zFeU=v^4j8x$WQC5j2u~1rgqt_yn8!tD)wc6q1*@n-i*lUL+?cOxY0>MJ<vmvTf1xz
z>usH++WiAg$lTYRbILi4U5?FG&5Ifb&rM(-om$FN+LN~r(Fzvp;dNSKv1)N|ujHiZ
z&PQKOYd>3mEl0EKw@<ZlwOkZ6&&Wm&FShq+K0v(#BJvG3Mnc_1jY;!vRB}jN)^E<P
zAT1buK@j2BoUcM-dgHZ|zh4k6SvjMe+Wq$e%d}d~`L%%uY9)(N-m0(=znXd;w^@ea
zQ(PiLx7F>U$}-14FppEf(=`BeVJaUFBy&IU>b&j$#95Qfx==nC!rpvunWmnWLez~>
zywfF?e^oQ-#-i#sJ>EH}aLnniSaZG6jq#-L(c~MLi=}1yN!sK^Lj<&Ln9Pv=esiDb
ztp!qX+0puMP6Jb?36~0nT2$>|gt<qfDBD&=UBb?5DI(BiDYi@xMZ*9+>>XdsITC~D
z$;cxER|p?PqBy2l2YtJyajrFedP!i@@bySSemS^)`-`3x|KQQZTuG(29J?tqi+lOT
zU8k#;F0WH~c`xj5t%I$gxm{!VMxW*~;Z;yWtE{9@6U7L{#{%7k69dVoZI?Prj6wz+
zs&_P$rQF#>Oou|K{^8nGLio)KdiK1#da!*t%i0oW@vQ@eC0g59*vEC&3a;`?{$5<2
z8WCJcRkxjf1P!+5a={FoSe7%ki=$+$hBNK1;Hw*d;K{$c5X1aCZc0M82J8a3TtY;q
zuj*t<leL<96}xwi`lz8>Zh<Bv>23Q6ubJ8p9_JUGu};i?@$QPbDXjqu+JRoYaHFAt
z?9#hJ+LMLxIai*7HVdnHiEMndGh5;02ChWH%a=)9Kvl&riF(SbyiD$YOdv|M9Q-`i
zQ%9MD!@{J85bsdv;p7HP)7)R8KJ26OSKG|d3Lh5%i&WGvHC3Kir%h<vD$sLr|2!6!
zD|-#Mjeg=kd(5}!grxVAcIy2*w3!NRv3MwT9^x4wht=D?s38MlPjoZ<sG7g#Hi1#=
zDZJ;UUfSwbO)jnYwEFUHS?LMeE*gZ;hVi|iSOaM(6lRyB`HE>jT&Zzc3y9H{$Z>mE
zkBU*hK`iqmQRKK()G2bu_$t>0D715oouVw_d|I}+vku9ydeZk{wAp*itmpQv>|>ws
zLF#ei^sICkZzIaCVk3J?d>#d=KYsq6D~V=o`W&x#<VU3VI(4d)hnpZc>XLXA;l~v{
z#@VzZEJ4_aIUse=f_oGKo}ncJGWPv<Qs6i97=8+R`m%3}??m!vA`KB(O?AN?0^K8f
z6Gia#{8e`hq)izzB8~z!G~&o7n^1adrpjhI!xSGDbro5ernD5#8Vd~7tN`W#ZR4O0
zL>;4xAb8rjY3tuRK`a3k-sWcPGjkz=%)QH#RC+$2HCziaX<*1i3QQSmCrY}sT;S>-
zV&%w<@<bhD2wcqxzzSB}H?N(tW)cJhUMhtxr;JP6t`BhrGb0i^vHY$`@A?OU!P9<v
z$cKT6x4X_McL(V?xx|rY{+UM{yWU<6pUId0vRe5^<MsovL8I7G6IBYQ+OBIqf=lz7
zpB#Rtd7Mk9lHupVINkzdD`ot;GMmHYjmMKC=3KE(<(;FVpo?=Sr2%8xl`co){C?wO
zjO!}oJ{0YjVILeT^6hC7KBfoyl~{<)b&8$JiTu4375W$9<*cJ<EwDp-abFNo8SCdD
zmjPu7pM%f%S1+}U@+7SJo|CtZ9AVcpcP)~mY#*TFuMc(dt&)Tl2Ks!kc~vz~*b8%8
z%xtHGUDU$;W<1n%rd!jFIuPy6tRjjSN8C)|;Q-`msXA`3vH2^hn3EvDd1xXZxyI>^
zwBa+?i%~!8Ddqc;pa?5L&7!}7-W*%5aq}FcnfZv<)Ga#dCSW*?dTQ)aE)R<t&uDhW
z6NpAn$-Q1@hFija_)u9>m#FU(GZnUB<L7u{|6MkPAu*7?^5xaH?k1RIBb=<cud=*O
zH*c!FV%H<P#oS@QJ7QP%Yzie6U3M?J+I}$y*Cq0%TW;*t_exSO$xGY_-OOUF4`DL`
zvQjP#xtMV(f0yS{WmZyUK5boTQf2|y8ClJV(40Y&U^hy?7499}48+PdZl)W6HODT%
zEIS%HT%t{sgKYic3}f+_&`Wtv6>)y4sNFe=_)=G)c1q}7BOeNvCCR5Vdt@X$OFI5o
z=dMlGpeSBkl3PvLKZkLNVejVw9^nk6pAaN6d?+`b#Nl*m1c#y%I`rJ<?(?dhne}bT
z-q&7XR_)KcA60%NJQf&IVSq|K_;JAPy9=)SZ8hpcT0BR0_If4;J5VgV7e%E*ar(Ex
zSAo?6p$XSgt0Ug+G~gZv^latL_9Qx_cgx6w$Y5NtvU!|BbUM?f5&=mGgNZ|zSV6eg
z*-b9^lBtz~DvX@-*XZ`d2?)vcmBSt_Mb31MTiIBpp&!UEoI5ETsa0v6zLAwzgtbL)
zDKWBK0!~ICb3wjzF)8c$OvNE820BrwHd4lgt@S;neo!n8g+5K!+P%93bU%d|k%Wn1
z8c!8^GSg2Qdgjr>B6q4T((29v|Hu#hRkSfmU**9)-?gtuDah2gBh(JHQ87Qq?&>~f
zdafn5atk!|l+Xv&Qms9o-RA_e=WvsjyB-C7`g)hRy!&Q{4Y^ZO(qeZRGA-Xeq+O2E
ziIg}wUWmAN?y6WNzdT%3($NfffWIQ=+De&9MJzQJ-lwAlI%HI<*)fG$v=|5^U%`hL
zeIJlw*jDT$<xERP^g<1{d;fl`ssj4V9$vO-W*K$jnY$yU62sWBzUq2FtR>XMRT|ZA
zF$^dvNxv%4pQ$dyuk5S7NYpKpG5vUFk9ioh$4Wq=aEdMO5KoyGlaF<!B@#(A+NIG+
zY=z4k%XVXEnaai!=k=Bmkf@CselmmM+h1@bc!GZ{{_{N2aIctb^Voc<u2haMNp&E=
zCEz62&`Vz@&pDF!BDt)=$10Fj#_J9g^FfGeJnE`tKDbAJ*dAMR-op=aC0}-RkN3q4
zLx&OxbU80SCM!O2c6)Z`4v;u+Cu6%XEnFNjD~y`Nt)1Qrny8f&h<4n{*rNkcQqd5R
z0Xg??xM))+>&k70Atmx}suD_6Ibht#4;!6&+p@<CE_vD?kxXgbPA%|s0t$eG7L?x@
z>?bq^A1aX=M2YTNGA5a+w9?gOj2vRgz#nwX^(i}j(b2>4%nmivMz1AyEI;0BG7kL6
zP(Gy5Qgl}37US1ZbaKP?l^@R1JQ{Cu7g$DBP@t)aSvdzvg@&!5_VxhecV^dw;oF>Q
z#I3((>hrX6<x;fc451y4R>%LAFr4a_5vruksJ9NTX`0Ap`Lvp@ds@NC!;G}pPgM+<
zBnFRvaSp@_;Io&I6-qcik|iokp`doUX0#Y$7dcRVwBf!gS0~Gli=APskp-7_SkG=~
zc(DTAWSfQhRQxo38&%?<<fBPpzfB`LJa29b?pq3LK)ZN$){WHP)=#$8<rol%pGW_b
z_AkOCv*!|h^X#xB^t_`;8;;V46Jupm*bZb<?vk+R&{XBVSW-@!b#du(pt-260Lf~#
zD}|}cAhte<GdH+GY`v&zukf18!6rCpg6vSt&|uzNV<3y`(K#&rfL!(g2AmR77p49k
zcnd}Q6Fbb^;fMF4(7m-qEO4%=^&L(ETGv~;h|(eNp}@yH042mK-otb1GTOeBeQnZU
zOu?i2M_gLvkAv4^^IzVGfAb2kR@+pi%tLKrcSJr+?_LpPijk~f5}qg)13Mia$aauy
zp<V-e`i(q#v!`U+?+WIXVbJY8KRNy!nO8>xUv>Pxkd(mvD<qYi(Q$D=?PqGhL0U*I
zQ)$vgT+>vm%MQiQ;9G39ta{ceYqpRQvAMkymnTC6TLKJ^%F7zj$15YVmZ&;vr(=93
zD-v@MnLEUS$*gi-d!b@7TZL9gO?tRDJo5}H#h5^mpXhroOX?_$iE%EIFjek<@Nu~O
zwj2qgB5ljx=X4JhF;v#Eeh-LEt_`W50eSZNvyqmHT+{9FRC9q@74cq}1cb+u&Gy-@
zVLa$^JWse_dd)N9eUJ^PXN_6~y7<)<A}w8rJU$0oHBM{QtWtCJ8}aD2-VX=UqMxQI
zhZ6r*i85L_a#ylp$C7HjpO<xf7R|vclcG$xR**Di^&)Psn{ocC01nriPeG5wz&5T|
z#rQdS+S345xhbEWBsiKSx8pj3_#uxvsR&)mQo!1U(T;2_ez>;z<a$H&PV%s9^t$A0
z3nhtCC|yWGYRz_D$77M`E}ak*zF5z|^e{zJS>z()l{P7U7<=t}&Z~^0m#=f?x&;N1
zhqD-pkjOmiDD(ea^ubQx6|B9vJeh249#-w#g=<^>Fo3UOS8b+7;!F(=q1=SnX#-A5
zok=Px4HAHAE-kL5F$t;%w$eO8^4fk<^Hf+~sME})%PQCwn<zMjl`PsC*Oc~jZ>lZ8
zd1%Wz?5@U<l5q<4s%i-gYB><7*kMh#7Do>5uCV(<eRkv_v&h&4Vc>~?_^MNd**dKU
z18jCoesz;|Y@m7c_7+njTffK8zm%(8D%^k#gW`Ja^dvI=K{l~@%aVA-8?F)GEncqk
zlB{>}F=yJ~9`JKP7ozJ@4p`@R9Pqn=ZgtS8kU_HYuia2@k;jiO7;oP&!YsM$oL{3a
zz2~+;b-gKgu7l?_EU0|_s4wF8A8X0HvnzK)rYGtz))(bJy+2OfMJ=4&aA<->p+`J2
z#JqN_EqCcgFz>f=T`1YZiYc5mQ8l{AhxNWy!AEO&S??0fOJ-KDvRg`T?gvY^s#Tq0
z?UjG_oIJGOa3Mw}Mg}m}>bCRMljhdetz3s^b*^Cr+y(<4-qKT(t6D=ccpw{8@XHBL
zx@yhN<4jV12aDIFCmR#J#@?!p5p?F+Z0tph{!wV1cUi!(CTCxF-6r&+2LdU9OCV%T
z-xp_!zx#yCbg46CDlNCKDFh{gNXCqu%n(qvlHc+&xBh3Tr3pyRq)dVb)eS*;X|Z<m
z>JlBWlk0e47dk#Ta_tj^CokPP0GpndK(e(ByKUO9+&nyz@lA~+jWnV;whmmSXOEv#
z{iwNt5Z>ZO0xYyb^m^C#HrmsK@y$4jc@k>3nil7vs0@+E56PZI84$B%@B`*_0l6l^
z6L&Pdn0`#iZRc}O#gdIt5<J95qNk84wo~1<9GRV2UT;{>C_!|h>3WWmmNJ_!uHdnl
zO2(x1-rvR_LAT00nLXFsH8cjaw3J7$8FPG%v7W5An%x^yh#}%X3EaITtjbHxaf;^h
z^tWAB!?=_m96O3P78nZ$;cd)euHZ}Mw)AQK(an?}s(pYVOo=4{Xg!2vTis%-(KqC4
zJCV;-%n){qmW~G$!5nkUx0o;3L#jQSR9qvc;h2)Q{&c%etKO$?n*sX^g7>(t_tnkd
zCs#8hbK!-=DhcH(OAHl;#8BJ97Z|AKIZ$f!sEfDEn51B0jMUXgA$8L72vC>zUcPs2
zWCWCSU6%v(oxwKDsx@p3GbG?kqxKMm6|H3(Dme0#>eCbs7qz>FaB+2bx6EBIeUBfq
zrREqVs*R7^=XC=l=9WPKjhx>aJ_0Dy*(fP&q~{MON+paTWc&Wz<i4C#_k&&{lUm11
zXV6bDp^OuzF+4J`bLDEjHvcM1VvY9Hi~~tV0#d&=t7ESSBR_ez2n1__V4bkg4bJQ6
zz-c*$kn&)<TNd17C@$1qd(wb)dD$G&O2gR5*h|U0xqe%{C{MWNdJ$b-h1o#;n_Hv%
zJJHObcRkdAN3yfqJT=IM>KmIqtK+e2_n}!YPcFfQJ~i*1uH?Y07(292I_B>}cZm>F
z^k`%$B&O8#j-fYbIPd7Rz=z;3_4oHoQcSL;yS950IbJIw5;Q{QtI`~nqr6R%nf>>~
zVa0uU8&jIc@JMeQz@Cwo7--=<(qHh$QvaMuI)zK+7;#FDs<r!I8%FJ|z1!c$(7yGs
zzJ&E%$uStn0Z_y}A#8*p)h@81pI*3^9cpe+dil$7D{n+tQs6yeG)VK0b@~famZW+T
zbfwU@HWxC6!`>IP<}3=t>F!&5*~jJn=CD4rMg(ZeL4)R0=%glG`Z1#72+!t7p>-dw
zVYy3aKdDAQ=00%xo992ILP{(^TdrK+ge4&D9@ZOt(a9V&?a5{wYpJgleCT-8JC|FZ
zob9qqF^7YoN&W7!CU%dHsA$l6i2lJ;VMW4Z@<5HLl(p=Y<`$LuIEvs@mpO?eR@l4H
z74z16RefoNA?nG94?av%9h3QL#Pi4f#JNa9JeYk=d7BlQA(S+liDVD|lS#vd5-nNZ
zw<^^jXtuiJPLoK!GYx$0<59Gsk-N9_wbUF78*xK(s@`Fu!etq6Gk~{*<K{$0b?Fg*
z#2Mb6ZqMjVch)@sa~`LxP^e3>Rcu}amUz|Dpk~F5x*l<5fT((x>+bj_pj8*u<(5(w
zpZh|#quCx-c)#<K({GOKr4did?2`E>BN{b?<x;BZdA#lOfs&jY&@{md>#pGnFRpCT
zX%I1-8SJDB9=7cINM$hm&&|-P*-W5|o`xH8U?7`}xxU!=$~z#RbV`>`UJQx{0I#Dy
zOf`y)It+3!jHU?kAU3P?0u`+=$(DXEDm_9*{o>I!tvPm^g!#Pv%kYogmGQ*iq7pZJ
zvgPkXNiTEdosfsidT-BgH^ZRq<?-f{<3<uy;bNfynrpH5Z6F?1V%lsQoiUdkhFd0W
z&Q`?XJI-tmJ-4y*M1Ly`yvJNsIKLm5yOp^@LL6les@{gu(xBVO7wUf19+!ZPSs&b*
zXAW^CGU73J!2k;4vOUQ+nP+`<CBm<`&A}7Sq}uRP6GU<1$aG<c_6C)IA1gCE^V==a
z#N!rTs8M?TkLBj_v7-7n)SOTAvn$;NEclznXZ`2T<PDUqY5RTvfw19!|C>P1{NDun
z-}31HbVoDdvvANe|7Z0-1$tI?X7>Lzs@EA*IqBw^c8ff^C<q8~fWApw+>Hq5&me%%
zWFNgVn<C;oi6R&*;`|mqfw&u6AOzIs2>Z#W-^q6KwNB$Q+s?<O*^S%Hi%(8$w1`xy
z*gBK}qzZqZ0yn-cFN1$oM@>A0f2^E;YHVz7c(e>$sH6XPNW|)6zBn2>5bbj>M1wdv
zddTo$A33ue4j_108z%ri5I|fVy0~yuEL`8r$jhmoFo+@yKDcX;2H>IxASDF*Vo10Q
z>fT{Q@Y-s@?8fH>N*~}Jh(9h5qQ@&24*nH{$N;`RJ3mfTLkMSqTd+S4KnDZ_OyvEi
z7~~%ZE#z?t7zk%Kw-ZpVj$6Vw)`ToLz-#&>8h-F|AdwD%YJgraFmr#Ld_U3y5<}qA
zwE^w#-3|z=BrbGF&^$nJbPy;v0kgJ&>O64(PbdGH22B11NT?qn)ej+eh*vLG0C>97
zouhBlA4-s*A6YOVd<Zcz`b{LTRzUSZ>^uM&P!`=J@N)tHnAUd@5Uw`-**ASQ`bj|R
z2-44MY#8~tWibCa;BTB6(7<4hd~J6f{Xe~;Am5Zhye1xP$<zaL2vB0}@L%V0e?o%=
zXGg9fKb;z%?Sr{CKW+vv!CD)>S%Q-*k!~rlk1wHAQa+>vgoJ<kt@FtJ;dh7(3<MMa
z7BK*x{8xeel2;y_1Hb<S`u3kfdUt2T%K}(E!prNWu^@km9bN&s1_8;7tCiKh{QUWJ
z5&;1MtkQ=^?nAT$4nq1W<-`ot{Lv_+!-ISPNW0B%1_!$RdjI;Ef}x?K0@>_;;CtM8
zfnH=xQczYr_-4B6HDY9hfb(aA6Nl(~5QhK(xGTgXEcgW2@k^Nl8vJhQf63K0X=4Gp
zJ(X)cHF{SYvGoJ(yIaA|^7mVw=g(7t2DSebJ1p@Q^oD-~e*B?%+M)Pi3;C(I|3Q57
zV=LM{-@WCUyyN=z3+|7h2cPK$X)@PQFb6Ipnq~F>VOs)tA89(5r%J0l@Doc`&~HL0
z+G90mc<=}Dcmw&_rAGrz17DPc4h>xWj-SN)Jfo}R=-ZX235LF0X$8$58hO!UXzIm(
zKD`Np)=cdcl5g_)Zm;FW4y=1WV)7+006>ob@j|@IKl(>U3~~#W4{HJX^jd8U5Qi4S
zpRWXPis1ve3_(0sYjp$+fMZ~<ma0cS$44oo9WUNA=nD<debu|%dj%8X$xk4>kO(n)
z0N*(tH+*w64|C0ZA>{sdVru3fs)I0C{!*#7%Vz0z0c9l1Bu6886GMFN{hrm@c|I)Q
zV)vsi%tFg_SFl0x50p@kmCA8AS?kTdRVHlG8kB$?6Jf%=ck(B_ZsyrD6B2eJcm!A?
zpODBpD616PeQkygYc$>!5H?`Q&Zv3<hCIXk+Ek~yf+%&>M42y<QiD2Fkwish&iz6>
zRTa7VWxKQy^H#`7g@m={&!@MYshe74-<Z`>4C7t`y(A|k9ZJe&Krk-n`KxrYCK`+@
zM!sExUE==r9144AJ)J(6s;oachK3Q>*()}nNR%t^d>zCjNYSxPa{PJd@SK3}v#vu*
zu5ONd?J9AoEeqjO0&~Cmt}cQ)B)IWLV;NtMN8#IRyW!LOzH-8beIM;=I180x>&fYK
zpD$OK^>m;?(nI__4eZp!Xz^4_6MHEb<Z9iT&XpoTyTSp+mPWHABA(5jhq?2&*+wl^
zNrN*TIr;VIwi7$+W}2iL_x9F5n5?8bfVkd&W}7UdeKcPF1icmwRkjZ0MZSm(vjm?h
zSc2`=90y6==GGcSKM`F+e9$lUeb@|SZK~Zon?I4nn)TXl5q8s$>)7lsPYV%1z+YC)
z(tIHBe3uM-z=ws#!4NmYJy9l&vdpR>F9YwL03MT)hB_6p+vj3U?BB>=4}Iv~FC9ps
z5JL(M?;k81Yy63K%>8t*BCfhJy3<mHlW-PEcL`9IV1cIh=3TDi+$pt?3^Ym}zUJiJ
zd3iELXM9BfXcF-gjwr(MQy)g3zryQaMb7W6_N8CC$?`;eAX*V_#5R){$k<b3>F^0O
zdftSVaWu~oh8@vXN#zxwUt5TKgG-spfUAEUGxS$m(L&o~mX5u1s(exH>1z@r>t7t@
zQsmaRd*rRHwRXM^j_T0`BI?|U#o<*m9D7$>f;Tze`z@I|BcYMn+7d~0!qFG`=8IS{
zaHuU}BCJLbd5toJfDIYbo5RdFqpr)tlhsDpUy^(aqMW-e>sA^)y~R#CzaL{r$lYIf
zgeVU5QFSc`*Y*msQvG12+$hvda2AFi=5uX2hY5<Z<)Y&R(Jse4+g{!V(BDUD2o0gc
zB~n9ED$G|JZfjNogJZiz-VbVZ_{dTI=L{f$_P^P1*mQ<B(jYEAq|_#i_~X@r06^3#
z&6?ZOnlDUJR?|a#iO>3ddoP%H_V^Z=NWLs+`+JoPYIBL*T)%EV2c|V<xL-CbPkWe)
z18l!T&|*F9rd;P(8n<`WA5t@vHtXLbdPF|F^qo4VmNj8JMxVQwGP2-zN+CVz6Ui&2
zv7VVdD($852gz32^!mhwFr{L1Za|u4#&rVAz-fUfC}5N`?-?Gkm4^p<C{j0ru)Sm7
z2a2)JrsFq5Ff)}vh-9eu=2w9JRv3Rd6{B7|l0If9pM-dAeXy^jqvGE9Y^O@RriY(H
zS!?W=7<|(K;%p~k9!EuYgZyj%qmD4TuA#1FazdQ`Nz^VX8wvh!r?(^L5M&7$`R##;
zB-hl}wR~2MP!$vfHJ{`H^5H1K)tc}790FU-H`59Y0+5-C{z+%r$UiamwL|PXZe@c4
zAj7nQ{r$eU=_c30&NVbO8N=izc9l-YTPDz?RiDl8x*D-3jmv6|N5(=!pKD@aPmiZ~
zu=<b3tu{Nl+oKTS#gt3cd72U3^pC26qAIc0HQk0J|KXJ$I!qq+go)C2EIBfkddEu9
z(;#iWf)6G1?^rCfKj45@;y*0jv6@0w2(Oa~hO?tv1Y{Ki#t;z9m2#>SoH%D`&8y>`
z`ukMAJ(P|joD1+oVI##Y`1_@~HwlRg_>g7pD%)sCI>*0s!d!`utG}C9CqBQ^B&&nM
z2@IQ60MCu98Kht<mloKIIw>q3<OCo5j;ZXrg&VQ{33s@P1u53NODTde0(#B%2AwYM
z`{=7LMW-dYnSBu@Gqp&suNaBP)|-L-<pSbCOq@p|O!AD(dWCcF+?uu}MS%%bzRH1z
zv)rrUc%oOipZ3h;`tHYL3Y9YVf|hP8pLBtD{A6whOUfKQ$^wqBvLoO9HNKPTPD_}{
zN~3;ZA6f9tN5dY(&1Hl`#x=`r`v#nly0%CekCiH&2nP(F8qiO`<-`#lyXO4|ZENEy
zB=L=1Q6(HERO%>PL)-{eHWY$&;{<<O?*n6p{~r!s(pfd(Q*OdJM&H8DGHf179D%5X
zJYk<vjO(j6d*^D#uj$R|s|>O7Vpzy1j03yv7@KY=$t}(S^jO&0%+h>nhp~PS<G=Q%
zlah<zJ9=+`C4uoWPj$mOWOIg%2m;w!H%<&P4YztT&^;rwGFrWA(r5XVzKUh+`a^MU
zn2W<W3`_18CfO)Fb})F1LOMS&lTp<zE2XAYBZOvHALyZj&R(l{)F`<xApD>Rskmlh
zHC3k2>~nCEd5LmD!Qz|SCw<~M143^LMABSk6I#T<u`og47O4lw&ugD%RoAvA$|zKI
zQQR8bMI$dyK1gTOa!y|11m&v>jC?TGb^m}m9~~`Jzm{o$sSg$lx_|A8uz6#L{?BDS
zxD;4jk~oHvtipG%=Z&_IixnQnGpoqHxNMW1eYTjTs9Cw#0+hCC!c*8azE4c-*SYxl
zBgl1#H~3VrsS`nS1=2JF<IuLBfm;4{PJ{>G&_-~!N5~}~4?!G`w{TByW|%Ax!Nf<h
zOFde1f7(i{!h`q2-|C;bZV|dt@Mi&ib(ytyjfXZBzq1+!grf3TWb0lg3=_$s(LNZ6
zWkl~lD(!88qeFb?%$le<m?io&na$?+95*OmOFLx2W}bz5TA|SFsY%bJqrgRXkhjF#
zbl^B|soM-~saMh}VH~8kq=<{6vq);C@g@#s++Y(_M&cc#&D*Ubvv1&ANLE;TUz%b!
zyiH!KAWFGN=Htri8FLr7hSuhn&Vk|`g6xQ-ap*-GH&Mndn5ii~BTQD}oTnzmdUx)y
zcxz1R$wrg(_FXqs?><~hcVFcmZ*sF_x7XqXf+a@Twq53XshCGdwG866f6LmI8Pd14
z+=ZXiXw49P`@vYAL3Tcw3BCmSP^eJLGU<$T5YQ6S-xs}C+zH?IG+pA&vMxM~2BsJ6
zK#>}t96>MkS~2ner12tP>ISb_CVEXOxK47b;3QttBxGjHT=Sepww*W=#0y~ywRfoA
zoDJPua-$^*Hv~CA8~jY^!cp=Vk2~4FCK0Bf&h*B<$56Fb*;kk-nta`F35E49bL~1w
zZ`zl}I-3;HNKyQgrcO4EH!DZ!%dPYLz&Uv?rC|HC0wrqyaG}YbcIie&Fj0uK3!F#J
z3>mc_D!!O;Elt|7VyAt@P_6;%W`*quT5KO7&ernmHV~CmvVKS6-RXlPF*D#h+bRfO
zt@fCH9z!Nwu}8UOId|XH3VmTua3MNAbRDx+E|J#{UhF$W?T%D{(&og|irfWljU(go
zb$MirNuWO^qQWg)xhRv$OHK3PnQ7%hDPkT-SOx<)V)50<zm(r29nQ2?{22CsWohpu
z8_?4&m72vr5>PDbdCsQjVS;AqI%x%Mq;DT>t4(hjEN+H#eMNt*_c2X0!b0C(N~2gn
zrv;zt+4;m4X^0yWd2N^g5;ME=$U(qTZ4Q;+k!-u&ZX42d%6CC@bzq+lo|aI9WNw|{
z;bxaCyHR}R&133)>N5T-inV$K=>nA#zKaWvJ~IS4bc?Y<3z{8C-M)H&qG;q9L>WR#
zWQr(Gy`N3rQR&nr3vpp?;}(Ol<7^q1WK5<=8=K&|DmPj(&4gCDNv~>+lxSVPMo()2
zW1(AqlXkDhVmgOVvq}$V|Cj95RkC{h4H=PJcWm*oV`5d)=6k-S(yN$-vKrr4d{+v%
z(!RpHC@?oV3AFjNRqAGeNo|7;*V-uXj*1tM=5><s0c)?+ePX_jwX?&4)kYz)W@0om
zg8(5RLp)Q5=Y}EQoU9k^nOvko<0S&(w}^l01t^%z8B}Z84H4#y*IS-XOZ)TJ0#=(I
ztAWjr`%x0f?oFU+h01p4BcFs=a&!PLD4iQSJ<c1WbS)PL(JWP|w{xTZ8LaXwfu^+5
z;={pG%b1V8i@LNsNd%5(z&!2MrOTp(RQK+4nEh^see6H17K*B7oIGBb44NT(1}a$H
zzROl*z}RWMrH9-77H`&KG}*xaWpd2WcQyW_!pb4*k!P8NpPfR~bA-N3hS{<<Kx@Y>
zODdRpo`iDZS)58@wyMw`8+4`H5xsr(z{|d)^_a7@57~O6I#0~?k4CSH5uLItf_n}d
zS?REp<1s3Q+J*MGFI$h@Q<yG1jBEIx!A=y_!xQ6t7ivD!vyGp@EXb)^Kl#NBpPZsc
zLrC|Gsa%;ZQr97l)&cS-=)oT&@jJ60nS3(&mvwW|a_ExbhbRk~+>Y@PtAMGoY90fr
z9H>SwuDn9GA~DQ9icq8tL7~n(9dNA|VNaf?jO2A!C(DwmCf|pgTCx~<>SDF(a&@h=
z-B~(0?3`^Z1BUN;s~rTwF(IOU{~yWrSVfZ{F|iD(3kjOPRud0}89vkBYcUdR*i7bz
z+hLVds<n8i`Q<bY#j&uysQ7=GY6mO-^(w)QCc?W$luNYDV~--(lGEkfv5={Nd~c?7
zZ)CS0vn(t$JozdbAO7R>ED4&iQ3=~V)bL?(dYpMkr=3Q>24l#bK(pJ63K$~~lmtsv
zpFyyekI$uwkG1`kH41fsRvWJ@=!yixTC)qf+5;39x#Ia_ys>uJpX$#bF@18z8EbCP
zRHu~(QAoMsagK?K5R?#%t)kKUEaWuTr`_k*z&#;R>Kq*k+3fS)U<MoWF-6<sT01wp
zufoQ0_fqv#k&trO#GK4=X&VejB*QQ&AkJ+tO}aWqrYF!RjSs)3FfdG4lvydcobblB
z1$!MU$sY?b4b|Gy@)cxx9+1ULuWiSb#Dd%H!IW+zm29*a!Gj1&clt?9r^#8Sc2Cnr
zl<`Favzrtl8FU#-oLrxT*ikJDNDkkSxnHBjjisFy<+dL-LMF4&nRQVy^4)x!Bzi0=
z5I@e+^F;q_1W@|r<*K#a+0XMzd8z{|t++dNdBA!k%epZ3=^M#6OO|KgPkYO_Za%)7
zo>-VgkS17IWs@bGeC$~vE3g)2UWw!Zw!|cbr?86HA9U=htb^lhk_$dT@8x}#SR6yr
zMa^>cs~{b-V=LNF;W3{o>nB|sgz-%nj`-s_vrVI}R5>(4$d-(5Cm~+Nf7txX<r&St
z*Qk)0hwl*cI2D_R-YqSZeYGz@Mi-r8@rm!m?34u{z60J?ca>@a{zXLb|9W=a9a#&p
zfoE=DU^39SgK*p1<LDRa3SvkOM;df<r*ip1Lnmc#T{FKA&qm7Ru{lZW?M(ItP#uXj
z-ZNzQpBy?u6p8rsDks_$m%dBext`e|XzhJ9j`LEE?hP|M0TUudi8CZyQ+<f5wsr5z
zIh(E^kmb)sMmDy6F`h1^pBYa&bhfrNKM-&<x{GTuJB@weYwR8k^2F*mOpR3XOgPwE
zZlIsdF?Vu$N)ptSt38^sC2h5cCH{tgm3etPruoj&CTIOS6q(aeoP2OS3UK4q86?Oy
zZuU_kV9e%48`;D2b2dQjB9<b)VyB^&3b-ztv{`mqF#S!}{sZCohjCI7>qC=Pju?+>
zy&$zX?o2r|sfy?Op<LR`-Hyc9=Sc_Tm(oc<(Zhk+l(RTLxU|dr$!p&CupIZ1^yHIO
zFuq4WZGx!B<8EoeTA8tD8Jogq+NeP2+H$(3&nwm_#~n{^EvsqXM(f91Kwh{#y5|yF
z88Jh{i_Nug%yE|xjHiLHPnz6@Zs8>-z9q-bCBg+13!hHobO;#CM1!66A(_RBsAaSL
zcSnrxa4}P2?Bnch1=%S}2Tu-5RGzym#=FFAt)XEv_n!1d7u=xs5s9<T+@H4c`j~O%
zeBpEW4{O2J34KcQ@&tFazRwJ@5hdlX@Rcet4x;9meY7mTQ#tt8;*TV$@}^ivwqW@o
zMB30Yc3MrvBpG8-@N1(Dtj%fFi?q*K`gnD1GPhpEa}J58^6A7EwdshY*Riws<mea5
z?USn65L9<IX>6$c9Vl&yZ%ClwgQcpH;>5O#f+BHh@A+lybeH`C?gz{E{TI``32B)3
zAf?V|1>F66NCd{3{CPi|&GYR(c?!nuh3=rDvc$2*LOmp-PO<`7-L_zzX@`_q)G8NU
z{LwWTD`2DtrtZ4_jz|FoZo2PvTz^bRQ|3}CUxxvcTEOHtj&E+z#n6%nFNk#56K9w8
zPA+;pioM35Jp$I_)U(YwGWy|T@Im*i7a8R$e}qogG1+V}ne=l>*=fsQ>*Sr*XLyEZ
z3idT)fi3ijx$Aw5rVL|dRDMm%oK5wu<$#qa7*GPXDaP0SWQ&-T>+iXM7719N@X_ui
zBuxakj4_VUDqCW>aX)8i33g*o0y#lqr9}wf2Y4w_rY3C1zePnw(-muK+iK=CC_?Md
zSZ<4k+{Qxg!v9DXNS-9mvE;FnS9VpQ^Xm)GMJ{5hE;qT3=o;JMH&DYYu^&K&jalfR
zl>X8aE6EL~IAlSn34#m3T^|2^s1#B>+MP#+)SO-1=)jC3O_|5xLETNMbTZ3(-o3YP
zAM5yv?o11$j?;33SJ)aJRug?MzxmH1%mSIp+ziCKWN;GS(<9Csc@Wg<I%&0L2r5Sj
ze(RuOvRKnFQJ&7g{vVVT3kBvl%OGO83KSHWZS2c_w^?uxH6ZDd;6BokTD*EmAi2jF
zg{8?i*xVZ>kKzSgqTb+A_>2kCP3(FJQu~BAN!!-bHYF^_{m_Y5vm2^t?RJNJ4Xa^J
zuSc&3o0Mdw`2qsw9R;yhN~)QDk^9zUenV&RO_4D3izq!#P{z5Yw>qd*s#v{w(?bNB
zz=XrWE&ttIx(5JI!j~}#1cI=wx1x>?4|wlM#HQ^=14gJU-AOZ=R!rlw1FFKU85){7
zTg0>}!^NyvHJ<NPa$^Du_5^-~>gl?|J*KBrvR|DreNt;A-nE}8jzWJ)ae<63H`Zj@
zYhdw+JL<z5C<PCmPwGlm6X+Kte){Ye)$kRsCn2!o*+;u7QYK1?)p5cbe0|KY`_=+v
zpdk)*%+-Za*4Nc3Fx0Yo(oH=(Q#|4|34Vb+`b^`p_<RQ2TUi+O-fOk&jHEfk(nzPP
z9i-2Wf>Yv<MKbQj*uya>vMP#<H(OPqmkPH&QALHgi9?^-5F&d7`x7NI#P=A9`SILz
z)5@DIQe$<by_;s=U7N(~69+)MNvalKQpef(v+TUURA0Bhg47^~m5u|!aPm*m?fX%G
z^uoa#d#x<u5#>gpcLdLoYBHrEX~A19Cm)j*6B~?!MY|QcIemlVn&Bu4Cz%U>sqT=l
zJBX2Ex1o9y73=TExP2r_)&nHKhMbTJJ`nbhN&IiCf<kP)#q1BUh+c;+B6NDAbR;I{
z;AxKC(QQVikaszThfd@+8a++AoGGQ`ws^LhHXaOm8B9$MhM-)8SmKC%L3g{X>)sab
zqLD7R-KJ)u1yv}UF7&hKbdQ(?aH^~=cMeX|Ds<24zl`Z?Cnwcr^)btC_!AAv^yb=!
zKkE>qUf6w&8xcCM%buh*oV{Ac9FJVdIh!0$Cr=`Z#KotT<*~Zr(q~2d^J;eXTqW4|
zP-Sc0s9OYgR4DE>kBY1-aJCPN?;r*dY)zKrw#pPw<Qp<a-47n2NoMXxBD17AvfU+*
z9K0rRJ^@-TnST2s*%|h>xr~y7ud?w9Rc?nJ6_SZnBp9<K$w-1Spv+8G9q$C?Y2cS6
zQ+i$%_`Zn*R-!zX8ftARJpEHHx-#_hNc@b<^eDzVU25x_Urc&!+W0NFyLp4A+GtG7
z770^U4}6h~5{LgyH)H*8x)}>2%YT$IMtpV-diMXU{-<un!NKsq*Uef$m9f?lX`_(c
zRs`+celN+tAP{jtka4@3P5k*o&_g<rUiocF``0wc<f@xrb3`vWPCtItFRIIu&ukA<
zm+9TTYgE$C9bnpyE%H`zjL1MI`v=D;;N<2Q6?b<)?jE3R9v*KD>1i<i_GGg=uF|AN
zaab@gA>ltk`MY3119&!({I5g`&`^M7om_ygAOPM2``(26U0nday1Mnf5%O#f{)Dr@
z*3h&2U}ZuC_~@jGK#M~gu+}#Kew!yZB>qdGuzh5tqyuka?EKRhhhQy$f&iNQZNQ^%
z4q{k&NPPg7z+nB|KgoeA^MHTc5Ki{)9v=_EI0xJEZJ+0@vjF7iHv#kD0s}U=`CI&V
zXn>mnrt^9=4~C6_&^i4L{5WCqT<zuZupn;D?SVG@@#{w5-NI=`VQ<^G`uJs#@(zFk
zKP8qw6Z;@vFYE!lH@$x(Ueq3Mg!M=9`uVZ2${L~J_hCa<fiL@H@%>{ONZB@_ry&6Z
zt^JS!Wa&?hxMzVOT!A$C5WmTBei^L`zyNq$pOt)R(O9dXe-1(evVC7hAGoFt7^noS
zQSzpz@gcB7-#U3k>aa$S?>4(VzB{zVAQqAKKiC?8g{-f9TMaI*2aG@fJ3E3Fk$?8N
zGw6S;8o~Pk1-rVs3O)+};-~-)O%D1Vynu!5&}Q*udv=aTa6f%?@@N4%M_Bp4^|@vb
z;7aIVP62`Xwl)R6dw!fhu?+6-0ImC3?fqFsabfyD?ViP$Mz7^Q-G6NL>H3_u#oq1!
z-TnN&8yWqS(`b<Q55M%@@zf@bDyZy=s;BPMCVm{oCxp5IdbEKA0cd>*bOG@2dhz)W
z9rk{1xI6f7^;|xQRACLlLBqc^t`9iAbQ(tVF!jHz_*Vgbri)>HlxZRQ-u3c(cTx76
zJwEq8{8B#f2!8x1f3lDMZ@9Hud~Iv&mr8q)8~hWCcM9Wr|NZx_Oxx}C0NGps&kXRs
zR~czGx3Chl0ko6r7rqMn$2$v*BmAqdp#2r3-2?QeDac@4pDwPN7TxyXw$$>w3F|9|
zjf@_o2s$Ldua`bnp{whcz>3X?H8P?G@=QL(r=2%~@&3{y36E8Fbz^XVh6o0*wduc|
z7VGvE9t_aq9jjykeg7^r34m)0f&7gQ<bFAarw{Hj_~}z`NC<$tYqyXq4%27!fcMym
zi@V{+&kF!|iYE`>cW?_w4zdgQ1I%0E_)X`%$P4#~cgwJR^?O5oh9igB4fp~4S*ncg
z%-lHG{UI1133|o)xf}QA*Tu)0e8VV<7CxQGm|dQr<e-$RiAL}h$m%&LQ*uspA%TjO
z>DC7wt3(RuI^}4ODbJl#qYCc)9D<9EDJklTLEZUMEF6+JxzJR&tXg6J8ipvYaWlxc
z{^Vm>-<YZb!Ebpk0+)H$<CZfaTN`E9iDfNWXjLIj&!nUs$N4j>j_K=QL=^o`xG?^2
zB$Pf;h;NG2k2ZlG4I9T&$uI<03eK98dqtN|@;cWj-D9C$ei9NwSB7MBW6(i?Lq-qL
zmv5z1n&O}(4E<QscCoPULk!Dn6U!q?C5!baf2aVVkd4o!`jb14sLW1}M6(}gI~%Bm
z!4b~a9#p7yN-E0)95m#!>(IWO!h=L8C@+v8b+L|#38k>&IJ!EI6Z-f;ub@?1BLwp&
zb0zrj0S%0S1V&;xXjTwjIHohKthd?Qunj#}q0pvbf7X3&ZVl*p7{2jvUU!yDgZ3ZX
z5H+l$R@Z}aLx#CM5uB~rOGXf^6QvKx*lW1*@Bk-q#ZX&!O%3;qUijgMOG4!vrAN07
zT{9uGSJ`(@X|O^X72TIfeOD1vRp5Fa<})4tQLvRU?IDrF_UBAkgzwvf6cr6UsN<r9
zdb30`4ApqcGy>nh?eu{Tbz6rz513E-!EZw5)x`5wj=3A>db?q8W3m`wq!e%la?urG
zm-_{E<DX(q+D6pY?1RR9q;EYnILOyf?60&)#kRA$O6y7&4#R2cUQji~X51BX9zp4u
zqM0V#wP<9Gf9twJ{tsd25TpweZP{D4ZQC|)xo+9EZQHhO+qP}nwyVDCKRV(?^x#GG
zAO|_k(TS6LuQeNIul=eZ*uKn1(BN)AJegNN%12mNigo}Y^P#ERxUTUf=EgQupQ_B1
ziPy$<@Nk^g$Tr!Jj*FHlc|E$5sCQN8SbEN8{!|W$QQIV?1SHt9jIr5rZKD<Dxe?`c
zJwA-gM;(}4{yrRx+HG1LO|rFAil2N<Zl}-G)hTy-Mudh5U-~A7oD8<zBdCeA1b`wU
z-TT8@qnszR!e8w=q|#m7lole%EM&~bA*Z$^PsdoshBrwAZMVE%40x9lIx@E!p0>%#
zcI<>pbN@68>uc^I0}?XStg<r7(t>t<SMbz*W>2(3M(>3%=Sdc4dcaqw6QNACtF{*z
z?z|<S6RamYbdQ~txoV19YC+^D()Y^TPz?Zs?~E=|@>_IbY=o9M`gEYU)Vm(joT=bt
zAbG&fDOyDiV&Zs?itl1BXp){`&t@juHaRHx8a}Ilp`2p6ne26%j?Kx};mW8#ffA->
znQIof@IaduaNpIV{5T{}yzl}xUJhmpRv*`idFFW<=Gfw8i}vP8s#JB)@R&^DlG=*>
zBXEP2`10T?Ngl~WulUn0Bp5%dAt}l?i|$moveP;gN%c=Ow%0Yr0)?U0jx)q}+n`VM
zv4DS7T_m`EFo1|BB7hog#@?Bg8Y1>bL<uNil;7wwsTYtVcw5+)8q=q;=HRFe*r`%Z
zNu0#sg+D^%c*3gFWC9<CW!#YdZEw&Wt*U;(r_BbuI&CE~9jQD;h9-8KjVy*;i`pH6
ziSrY}ajQpcDP3%oo!9{{>~GRc=nbD|VL>CJZNy=INoy@Z`MG=bjRT=ZT@W7A9DI2$
z^-awuJ@KA!VKac5DLKv-drM9IHAh58M~+Kjf*f=++PCBVD+oJ87=FUZv}bkob1C%6
z)O|Yhw$qV2>t#gcWKE*Yyx?Du@Untw*njv?q7TX^6+d4(yo9p&Y8sK|WOYgOhMVRz
zGY{K&KC?*7e&=orBT4-HkW(E-1><EyVf0XxBd=0jVzughXtnu}7QKB}dl-(2J^@}#
zL2t9O3dNm!^6m^p3Qwb`Ilt7nOPl67mNuTOO0PRKi8yEwS#W$0Erd;E$qIKlHC3Ud
zmKC^7d=&T=(*@Z3^m4|4SW&-yNx@C!e<9hMmu~|l5<b^{efl1tyRpmGR?&DoDk+M8
zubZ<^+FGzeKXw+&K^Fd)`jhej3$<3hKBrX<zNC-WJg;pH8!X2Wd4H5;v)?(ol%LR#
z>hSCFJ!i<P`E=^)MOR+>B<ninp}jUq;_KvpYxakhtJmn!zNeS8n;IYBrQi=V;kqd%
zJpmslI$2!Pz{~#WwEst_w^Pn0$&&a^>n++PG5?Y&XjJqZC)Z5Xoc7gPcvw%mZA4EQ
zjA!43Puf}O<6qkHH5_79uIrVnVDrR!CCKX5SF);im|}FVS+b7}ePqfPleAxx(1r3_
z^X>R>K`n%V?R!&P2Qz=frnYR?oZ-!?+zgU{Cs+x!oZm;@MNb|~D~&r1Xu6Ip?;z;Q
z@Xmkx054zu6MxEoVD8O%bNvO787%{cRQ>-!;qUY}G0ait#zo%*tbp}#*mA;(ic*S!
zj9Y{7M2Kn}bm&7A<Lj8qBdf*N9j+7?@dCDvW)p<MpZK{ph1=?wAgP`j94KTtA+SC?
z&fgI4!{x4lqZ)&q%rn-XGkP@{qGtPOC*YC9qRL$O2|wiTBKgaU$4UgFSYV}B&9gn_
zy;Xd*e-Dl7lY9Sc{F!K}VclsONm$ouK(ATzWGg3;<Q-jVZK*;FKcCXUeS6H3mLN@0
zBS)PkvJ{6HkY2VlqsMYI6BU8Ko+0zMl|@Oeyrl!KJaUrm{-y>d88buyV4<DHV740(
zg#|T`8by>8_#~X(Y6pGoBq`w#FlB&5bxPiCS*k|Faec2yd-0V0)pkk)B0e$hIej;)
z3w7I`j7on=H1)`9^TAA8VxDWxV*jC9+BcC!fwS%X_u~P{l-SGfp3*h^+;S1?(mf<k
z9!pH>lAeVLF<$l&+%?-|00|3=@Kvg*>)PitkdHWIV!|LQ8LDc~HXUk_E?-oPjPH&j
z1pb+SS}TGJoT5<LIF^YjbrT$sGTKu!R06||r{r<EiZ{)f^n_v`?^4*YyWl1Ht-(4V
z<o$M{#3<Hz7z*bSTu#FFcGA0~Yl4xRmqY+0gzG9vC%18;m<cLPP19G~K{`r(Y}n{|
ziM(_n8aH^OJs;_=yLg%9j4n_ssb24fIT4LWY;GgpK$(CpVqb*H#jQ<JA0MbCpDvx_
zyfKtTlMGt$qm2BYJNzd#XBOQ*DAN6Ev40?r6}8@xar2hFpS*y6A)6iGDVo#gYc{x*
zoplH80~Y|6{1qDF=7e$}`T$?BYSzyAvZeNlxA*ngn#`3Q<hG3rW-4JNwH|R`uLMW!
z=3^|gX`PJqy|X`X7^wR}B{UpE(eSr(_8p54K7p|8<?HqAWYthFt5?V3Dy==FHJ|0d
zQoa`V*{QB&6wru%!!#|UavyWJOy;nMGUPcZ61TDX77%COZgz_@P$60$iWIO}DCgv`
z`rWy+VhLxRgj$eOLaKswT`@TQyVB_|tg!e@x4V&kIWEf6IJRtj&y?D15vl*q#HDhF
z`b5pQy<IdTvG3l`R@QNaH|{V(yPFyMOMPFzq48oun%8%wBb`w~FHo_^EdQ)FAlQF3
zKs1KEv*ILlu2OJvYYGZrxFk^gkLX3pgh^2WhEGs>NGxl3FE<I^%K#sxiw(tR*P1=N
zGjNG(w#5%tAjRdU(*wY!1=z0*bD#y;?SuyxsZ+X&p9+*)qXqCT>CSo?G;OrQPps%c
zU&!<L-6)>HvBzUQA~}MQEn}~D;tTl84k#dSdSYFU4mMPMR4mHB*C4X|E-cv6TUZrk
zOi&*AbfxCD-<n^^k462&BFzmxq35C?Y^2F3k|5BeW=b|5fMJy6?rfsSlotRdrCUpp
z&u1L;ieCAOzWnf`8GV2)(YBn;AZ{OzZ<Po%w3a|E?c=@Q`|mz$re|XX893Qd`<9?j
zp!mp*qtsFC&?iyQW)HENB0>NQfjhyJ97yU)+VKEx<V|~Ll$K9a4l1NMi@dzRnpi9m
zXBp%{CN&J#1yjGgw*$7-oxkU@I65&tc(RC5I&INbHD=PJ-t0OgYu2COz7C_&%(2Nc
zR1^O8W3NXWUb1;_YCZf5MmJ29<^nJ@8Sm$bk4T?QIF*(|GUqzm;&wn0vt@!l9KDBk
zR<><zDk6>0NY(1-STUUUp(_wRFuQ~I=LT?`2LX4^Jh?sIH*i1CZ-r4HqFvIRDR+v#
z3lC(TP3hxShi&3e)i;=PMV%m#Dv*Zy_^b>dN`2&<sTYPDN_7voiEB~?v->&OeNC(!
z!ub=n=l>oz3S|1(dH0Q3>9H_K+_}2@%wKx|&o>}|r7%I_0s@;ooT&YRr6AARzi3`h
z6)4oP>?CJZU%ek#n7*Q)dA0GktVj<Ht>d555qzk}xUHC9_v#^z-6O@KZYLt51w8KF
zL1`cDDkXZvBu=osm)--ZPw@#6vXaw)UFMkPRa~=c$Rx+ddH{Q7SU4&7zS>jC*NB-k
z`QA{(p{9kYDS;&$YvOYgwRV!#(H!`iK1oM9$PsU>N$`aGC_^ORVZFwT+N@0ri;#*(
zMxdMj&lvs|G^zmiknqH1cSEy-m*fmdu6>TB-Z9~LtYA?~D#&VL(RtDg0?(x=Rj=JT
z(((B=ytP%-Hey<85NM}1&g1kn2U8aRuq+%Z?HMihsN*DdXt1Pvs=<z4@;?RR8?}^A
zZ;KpSO(MLV2Ot@}d=dtp(JhIOXM$XywL0aR(i+T(#5pi8$l3=+@gg-yl`|FEMGy7;
zb8-Z7w<A3}4)N`Zko6j`goW`D+ZI1q!m(v0Ih9WaR%YY+A_jxmaP2T@8?pO$oi!TN
z^v5y?8Mw@N*Ljc0lJ7#tZ{~i(axy9_MtodsrH2g#wdL5tY7Na&>#Jg3Ysh+o@P2~g
z0j0jqjoJkOu=wZK66R=f#YaH-Mn{jO42TVG0li6uoppkbGi*~~IALEv$3ZaF*Cna4
z^i3odUom-M6Pd$g_F*(}@^kPAhL~g9O#@|XVq>bY-c>3MJd;|?U$W-Lz8J`l{=0<c
zY=p$C0iU<L6}`Dxm8?6@z#N{oPBw@r$5}NS=oaj;CcKg(m6b`LaZyIgsY%PJtQ@m2
zNZyZO>B_Kwl||>S2~ej2sln^d236rK!grj*$)n_uA8=mtp_#qk%H=%KD;B=^x;!$<
zOdb(VyaD=tWN1VllwFEbbyVwS3$femI-o+0;Yd0}=#W>Ov|hhQ-SUfF3s!5cN2~Qr
z#9=E}@TcJOz8lRpUD#d|jn+ZjR~Sq&W|>@DncUqVix=5&vbITy3c6YaUyKxi6@GgD
z`bhPTK5?yko*;`$OQ;)sgqe0+sSxe7#K-AzX!|20bIm%HuD_j7$wr%i6;en)67#?F
zR7RDk-I^yrKPj6x!~7Y1ix^E+2s@F*NIj7i-6}&6dJk(ZbhtisP+8Ha@bciJIJS!?
zg_ACwl?c2Q+UjS)+VUf<rzh76$)7g0Z$E@wEElRIY$JK7SZvVm+P<b65ruyJk0Y0u
z7Lpf5U6y*amjR}G<u@Rc!2S15yr|1?Kh6JfyO7@}B8_k?!EcDgMdcqb?hUT-b;6@+
zWtEt_0i`!jg1MGV-=g3r8&+Oo7i1i)-})Up(jSZjL1H5Jvx-vbZyJ!13GksBa;=g7
zLRlW)#b*FNVKW;f$`m?hlWL%F<q%ON^o@wJcm4F116Yd&>PUxb54sFD2rpR1TSVBU
zg1(_v|DM&2-P$RvhHh{PRY(id%1do+%Jr>YA!?na_k=kY$jTl$#v|G~aw<=9LW0?A
z+bR`!q34)E_;6;PLAs${{JV@9%Zr0-pF!4H7HL=#4lC^T;al4VFPK{cTlAjQaXh%t
zeT}3mMP4)$Arp+ugbe|nqd}v!Kzk2oZ&#Os4W4->N$~2s`iJE;hG@{86_;!VpD<e^
z(eG(C0oK5}(*NRl&?){1<4ER*$}YH+H1R(~nXnOIFh<Dw$3Lg{TsMgpypY0AKF~LG
z5y&*fKy`z-w8-I#nmE{z&_L7=%~o+b=p>zhcOs|8qq>n~wSl#qNbfAf@vL?qxEt}G
z(i3F$p^`0P43j%eIm3;_smVUja?$a*X`0IJk(QE1FC(~H9a71qxncV`fH2*moXDd*
zdYjf>3N<S~X$*$<{_@>ej8Ed&KtIlsp$?w@9XLWbD4M#SD(5p(>@~&eiw@os=3>nV
zO)I&rqzB5Frfb0mAp*SxnAFx+?#CL+_7JE{rZ9inP|x-|C%;aS-9w*<l}2;4zTMQi
zgs-LNAZ46(wUL8*Vth2ZABah752EFd+<ctM;aV2A_(<OW<woIwp6mS)Gvm4`SS6fU
zS!yvo=4rYxJIajW77zKr*u5lpL0&KCaYjn`K*A)G`O?BuM`d(2ugr~B*e|_X;$Kdj
z6v{1%4U2Lc?m+{>J?0_bKoRm4*0yj}lGjZ$;2wt|Sk~;e-qp>2^<<&4p+nIwdS%k3
z_=gzzbMqV)>-lgX3h=o3F^$%mTrMVdEOvMAql__n;_Led+F@{+<TGp4Gia8DX*t8O
zRnYP%wMBVpGi_UAx{6t>SLF=*Nm>f5oibwG%czZ>y0Km?@0}@W)3kCu*LHd%jc-j6
zF8g&lZ^iDVUPK^Vt-Fj6Z<?n_HKORtBiC?BQ_v6WsMy5h0*+{3IwuNwHe1a6JFem=
z%M~Ec8*#9zrs0K|3Inl{97_EBc53%jmdX1vv>Y!{Ax47*p}a3a;?+~tRnSE|5py#(
zI<SbH$|IeVSl*p}756yS;;W9*Z!vXppy&OCJvwSCq}=^{jO(qN_)W*16DQK=b_?6j
zEw!7qt+pWd!(M9<wW=HM+ATI8QP#AkOpswTEjKgEz05IY0IEfG=2G7wKkfv11|gu}
zlqnTrE!(L2VIgt^<mq~|58PBS3J5^`8lJSfR&`-+i@KX<hISq*Laj#?)?$v6TW2jx
zLB+W5N+pM<go71B%ulw*yOM}r#IP_ARpfo*DB}>SXE^FH>%nVYID@-q#tIqK)ZsB{
zEPQGfiYBw&*JZ8(-r05&5xtsaalR}-D3>DBO@3m?c+DKmyLoZNGf&?hdBXDx|48l5
z_^;oEM8B0fLx)c3?0rJDQ3D~^f7r+*2>;wA2lsk5CRXmu(df-%thBwPBRkMP99p{R
zLHwZLeI_`d!In~3pexvLVnnZ!<}?U$OL+x1nOtZ$C(JfN;~3=-{4y;FY@xj}fp@~5
zl?!GgiX1Xz$0DJ>X`?>)exPao7ujRRs(3+)MOcCBU|0l>g$|<9*sKHw4P$A#;`*t@
zS~>!K(&eqpnAcwV)U|pwGZMpUfNBG4@dCl-m;m|qMvAYZdZy&38sD~JDHJ@}Ad4CU
zE)qrwtM`iEXrs6$k>0MXVi*A=WPG%M9X*-ej(>?>H1D^Z!lNR_$JFF!=;UH3sW(l5
zNF114faiH4cUvNFm&W8sGi>7kzFYsP#j=8<nMCMX2cFk&<noymg^t#V6&ascu8~2h
zYl&fxpD07g-}P$U(dQ>NK%J%~+*AP>JU*Z#_S^rdFM-icO7Vz=pzRyEUMez8d>}+w
zjfwWj@EGq%ELQ)Y-;#J-0Gm<eU7EvSp%YPsI3XLon~8>u0CMHz>T<%{;>T)~4i?8q
zdm+`q2E@yjWu5EM%-u&LRKgz0wR3wqE6VV;R19vjckrhOmmGEsqxQS*!E{L1jY6%9
z##y1|4{T<<#0j*s+A}`7Y=Qn0VT$zDl&axYsaUP_lDIZex+?FTXyFv_*CE~+L)pxv
zZ4733QN1hTNsIUe7O1w<h+$5@3a9S-su2-!=LRooNF_$J@AkO1M7Fg-;g8^G=cJ?^
zcqKV}(zHbxd$k7*>Y9cLJ9SC+aKS6PUi8H2P{1h4qy~rSBKKT@7v4+nRh`)ZD2iJ#
ztTm&G1^;Y_Y?*Zzb4$0~UbTE<^AU4k`==}yTNj*aGH|P)2xg`9L!F4slTCy@%#dUy
zj)l+&-R_IJF832`Mi*`2KypC>G((>e4|tPhk8@c#(tvuh6?C8GNYHwhWWMXXsfoCD
z53A|{a5dMU@wPY%toUu-1ZEkoU;?uc)1uSZg96*FZ@0nc%QYXctk81BVnTRQvzUzf
zNdZ}BNMQ8#{&{4}Zk^6l3oxy_Mc2c~oi%O{5mlSRMn~$8<Q$svRNt4+nBDn$6}^9(
zJIhS!IFaRk)_I(-l4oE!le_4=BMXg;R9h|1KjwM;k~cAk^7MS3>u#A~;sYbQ*f3#*
zJ$F^&W=MEhKWezbIJxk@#tET=#rAb)qGT2A8yUl68JXz^DR(BFn9#Ia0q1P!tv+)!
zUVTc;(|QcL>Qy7xmCL?qp`nRIr+D6&6|<7Pi6z6TOn#rBp_NF43m3aNYr;qri#^X5
z#LnzF5O*!htOlB8+%|Rn16TxWEPM!se3BzeYl(I-kA^66VA&=x4kox@vK|#>=U?*s
z=?QE})N@V{>O&$eyiZcRj>~q#mRUW|D)R5fh?crB96Dsf&O0NkB()StPVvrQb6U>9
zj4j>H>1as1W+8X7Om!cP^fBilG`!1fm#=X8BhW_r$8m~dD3qdei32k=)n&8$CDON=
zz{Q7}SvsT<da!UQV^fOk>sxP$D8b`kIDLV`^N2FJ8@e1Fy2+Uuv5-ER+vH;MkK0Uh
zc-bxU=9oz*=%1B;&19Y?r@5FgA-3L*xWx|X1OBwY=-Kh1Q`+uvmUFGfXw9o}Ozayp
za4s&G*5c-P6V84F5?UDpRGn61V>ZR-uQ^MFCi3nd(MEb-HVC7nJ$5gVjR*3N_N8Eh
zU3+Tk&*(9NrcZe8TBQR}rUj{lM`{Bnd?l_3btjdV3MIC)c8YS5$sVVy9N3f2vC_R6
z8G;t;e0NfJ6B9nw=2Y{H2R`ECuQ-X(c30+RwK{1WH<Kcq60TQ$Goue9Xa~teakF1r
z7QBW|Ik=?5kR#}{&kDx(>Bd$A<w$A%g_c9BAj3m6ydmvXrk!xe;36wMU<J<k&SNrA
zG0sNMi6OsYr;gl4^cDC?onW(zLn#^h4*WVW(&hq`45yStr3*NiI50eZc7Y-nN!)V-
z*JnD7wv-=R<cImys)=;BHYFgfz-S!@Em2QuB(^iM^Dqyxu^v?dL^QkDPXhR^*!epT
z%g;)K85H>qmx(2>PPfttY)zT(2=C=_mf>uDZGt6(3(wy!rwsI{y5KJ{8H&qsUUq@E
zk%IaCb1OAt^Fo923#H#B)tKq}rRRleb*D!DEF71IcfZxK;~m!IZ3~i`E2m}GZ3Tcn
zQQ((2nMn8Czjj6_{{Y;#x`hIn*ClhTwd0vGU99g+>J&N^ya&h*pTL<^B6@7GyY@+$
z!L-2}dyCS?gH|;_<7~EAz<r=^%^``B5qC|=*b^W+>z{iG%O>2I&ewIcGq*nOlci?`
zfp4eyf~hc>Q+GW1ByCg>xUG5==Ii4V!gTnZP@<R0+K})Dqn6Q*?4`8)(1m2fscG;b
zCRhpQW`}btMb;djZ?x+{Z!F$gb)Wm@zeB{m9F<J`_XNnRq!bQ->7EJGUdd0tHgwm&
zodl1`OcsC_v$OsI52?C;H-w1F_3Lz0<QdDG^Bd^+Nk|TnZk>>|abtASxZ>Z(%Vyq6
z>rF6R1S+u|Z9cPO*KIjE{hM3PPp=yh&<w-lQQtysej>W0r{65S)9KCb`PWe)TJ@Cp
z{Q$n*&Sk%SM6VI1r!e-19wt9!pO9QhQ-yQ_QErVfS)m_5S!q4;jKw#V*!IB{Meui$
zl*K+3Al&)*qw`Hn`;~UvrJ80Ya3MN;G^)}2Wu2Rg^KQG-`L~9PK(&F=$J7SeMa4r0
zw3Ei$Ft$w;_nPxjndCcpbA<1m8Qng%b~CKoUvqq4%?byES|FJR9zD7Rh0(sgI*BPt
z+)V@P_I~RgC2?wVGk7-eDm%@hmKX`Ms4e$IwCk(@3KlnZF0x>w&Tyvp3u#LE35$)z
z)i5rLX0pvxK<Bsd)AkMg=0b84#=5KNE!D@aCKN#;nyzn>9|?bru=rj~z=6f`5+}~x
zwiUQx(u&4J!%+<?d%|UgaEJEZT8M|&hE{gNO`OWC>A2kd-zDEJVEe93cv3xJHMS3Z
zF<%8J#7B~BW8igBa*7l~?=UEZZG1t03e`cZgVtmDDt~V*=_RNCRv=QR0DLm48yf3~
z3R;EVaEd&u4TTU+PIiT%Amwj*tt=Y<*J^=GklOiVgIz_M^Xyb(=n<&oT(fjlhU^gi
z&#UpPSGlaXhNGQRj?!u><MY#37DowD8d)xaN{WaPKx0j{n&W3vGya7kLd<Qg33K{L
zB2+8Tc(Mbk1GqGg-Tjrcwjy<%kFNg?IC$p<uc9%E#YyHIO1#Jkh2VGXh?>GJU6&in
z?p`#eAdCy6JM868ei-UTBu4P55pyvaD<;Ww70^Ri5)tIq0uk3}+16e*OruDp<ghux
zyRpoUtwSEAdoPvVVx>jlEs+g!4W^s35<)91FT<FdO@=!?8bC%_9ym#)ST9Z<JbT@i
zT;O`ELavQNe3q8~*t_WdMTbIy+`KFC@#u`L75oA&v@_4Wr*7CU<<(1BH}<Y1X6BgP
zG<K}>#D{s;%Z*VR6>pA+6XVH>qJBaOP0RT<!VfJK=IMAXMs*odZ>LA^<4=`b1tt&b
zbuZF2!EUtsWS`n18{@_q{KAB>+h%s8NSasJEuUaxu1}%4^=FLC9Q@s;Ea!!(mT#GD
z4)Ea}dt_zsP-?>NNI<^nwk43MI%Es7vO#84c0QzaVkT11I;Vr%W`VAd1O#ua+TYi;
zrlPb3y<bvY#r3L>4wWu)W`-*}1Bba4O|I_MR8Id`y6|_!R#{M8w49MDDDw~NUJ)1F
zr;VPT4ZCmE>@HH1GKBQr8ghTW2wR*eENRl0o%b{3%$aF}S|))Laa)$I8Qg<hSM5@{
zJC0M-9~Njy<}xa41`og8lvXuwEI6yWUMHAz_O>dOrlIYA`b@r?7oO~d+b63{bHl7P
z+|8;UK5?X2JgyfrRWC)6g#FqF#S(`?$yl!r3`j%dGyNfU-?k4%#t)j*`K<*fR|XHj
z&3{l4!txuTrd{i!i?tJ+*MwnQpvbRkTDz_j*jMj8(Jr-l45#cxyi2JQq73fgVTp!o
zNR|kc(vdZ^kqo}@_oOilU`&`gA`Z|+J1ctS(JX-&)^Sm|j|W(L&`ya*aSE$&C0?Ij
zYIrxP-eVflsO|iBo%9d3Ju4>-&0V>Vp+QI0Kgo}HcurMCEf^Vj<kS#oq~LR4%Xu^U
z5qQZMJSPlgluc2vJ}8WPgFe+Jh9>Sm$X#&jt2!)gv*uEC{VJHE+gvBe+gUHI+xXOW
z+2SHOs6=#sNl#roKZ(1WcpV8`*zg|`BLoG-*1JXLK1d!$F**Y4L<9_giX8pfy{E9;
zYPNZZiQ85+23n^_3fFYF0!GziVQYDvbC!Wp7+>Dl&iLK!;51^%hj$yC&Z~NyPFjVz
z2C!q;1{BA~S-(+X?K_v4TkpQdT>(!Qfq%qvwK!8Y;1!Q4DP~Zn&mZ(uSe&QZ#3^Wa
za7TRe-posx;jG`}R^>0w<xbrEU%qr0$5oB$O5|Y_riQ${)~`gu=r`W@$Iza`ks-VU
z@CAh&|0_t}iAZ=KeJ^g1Q2$he<Z+9T^r^J2VD!5(tIoO!YV_4|E0{dF*YO~6FwQ|0
zh+3tZT%nEAcrIaFEbw0_?mH@nsI`3=R5l@Ec?RibAa(dIAjyXZy$0V))~zKr1aSiu
zpBYn3^OM4jSC%t#Xt4xQ@!c3F|1DR^&dI1UETI(;)|DtP4CxE>Gu?77cnV=q04JIj
zQG&nw>iPXFE^Jgto>y9!w865WenotNdpWTcqLmk^tQ^Z6?-0toM1<0QkkKA8SRK31
zWWQx)3*(Z3)1<n3yQ<rc!l<Xh_-H$G(j~&Fay~j{f_H~(J{ihtNUPreS$IJsmP7;-
zAgZo1u1vEhF??KITU$rRu>FNtW0Yt8-%@j&|4V9)nVpg2e{yongiM?)oQ(f-{eNR~
zOkA8?tpArc@&EThM8AT`=WMKkMgBKG?sqoq-y(1C>==OHxV`OTlX3zfZ?n1EzwM)M
z??8FFy<IF#eC$<qwv_{qCNr7LbgYVtmR65a8s6$dCp*`>nHZZG9)N^Xl~*-2{!v$7
z&-m}emzOUK)wcHkP9~JI2F%hELU{EG&<<w@kk{&Gv`5ga%MT3T6JD9Z=$k;)J3cfx
zJ~h<;Syxwg|Ft^bpN2r>aDd1FK~4YD2>&XGK}yX8A<keHUy?$@IqUZeHlMx#tnT5_
zfdz1d2ww-v5i%uz{R4)gMw5@nS(p()Cpa?z3+nvxNdS!vM5CrA&TndpfPg@b!h=B$
zVJ0o43GNRuz5<;O?F_`-1u_HVmjWx#+5iGj!bU+x6WoD5ek2IV3<{|Vi(o<ggT5X(
z?f*)zkHO*Pl+W@97cZZj1VP>rbn|yi9UuS>>+hEdqHkjOlXgpR*B37M>c^9np24-w
zmAUQ}a7_n<PN+pFD5;n`v9go`q;F^kNGph_i2_;Q8{Ppmwlaiff9G*Q@h=XC?g!OA
z5P0cG=L*8r(Mi`9Z1r0i|Hgo8pFw^-HH3F{74%ZWDDHbif#3p}>Gydv1f1F1T;uUx
z`v9V71z%6m{Zb5WPsghb5F8yrCc}S?K>kzHrfLA|0A<tC((+zg|H()Bb8cZe@~!sA
zg+Y9OPinPqcpv-Q8y6232z{T~-<J@E@EsvBE-HctasTof{Q2oa>7frYA_Yw!p4ka3
z9hgq&RibZWz%YNrkMaFGM=19XANu`!1F$;a^W#kb<UTlqXMM}_hyC{}JVT|J3{Ax4
z;+N_}ucW*@h@w9%0i=I?bQXT!_zc|s!4c>ikS4kT`Yea;=RUcv#renmH;J}g`d4QC
zCl4zB!;H@y=y$5*{7<eHq5tVy`c;#CV|svJ1HcdewND4|JM*qb`&(xO@MB4IZfg0_
zl6xWu`X%Uzz#Ct^B7nKy?(7J36C42QhI;*7Q-*oZ8&Ua_8MJ*3s8bzX0quq%eobxt
zWk)_HhI$0eqzTfVsRrc6{D!juHd(ad`Q$eSz@FD;fc1?{3_b+7?;SHX{Ou4h?j-;<
zz=3XOek4-sSzPJAEymW_+J8{Y%upCe(eFtc92|kY)d#lB;h(>~!hxp$y~5Y(WBh67
z7Vr-VVp-G^pB#bGNB@w1CKv|ONB@aw2bwnQLqhP^_~tkSW0d}mYS;KPo!E!O<F9eb
z0qivSE2b|SvIjX`@s1O~l>!ju)t5cl3rFMK>qElv*LdLo9#i^?;rugw*@x85AF~IU
z9d&948e99ra0oWG^b^zXk@+39K9EZ88oS@|d-eFa297&1JOT^K48oPwvGGG=W^(i?
zegNIb1_7Ws)Blo&#ixspnz2J>Y`Gw))t6O5Ioq?e-zl9XH)R*RhcP+$)S3m<eGAaM
z)&XyeH0==$IPXWT-?~xx!C^Ih5Fq02yG8C}8G-{42-fsGDLC#;0b8*4=Jz5SncoUb
zFzu{Sd$js6F!5gm&3+Yl+u6VNf3nm8@W88DfERn<Usj+q+m|lndm&8^F3o_wqCIqd
ztaAiN+1*bB$lL3?>W+SsEkKK8-^;%2j{@-fq%mM-28!R$>mD3X0KqYM;Kr?Q7WS(U
zByIm)1D?bcn5X*n%f$-6>R0^hWxS7*fyJw}Pw|YPRNH4l7`7)q0%V&}RI^2Z<}V<S
zp5wdZ|8;VFx)06D(eg6{PWw|-QN5q~W4iwh1GMvdPDQc44fg%`jf0w<6;%@vwL*Zp
zzwAo^-Mf^bQ<ELwhs)mXs)i6IfZLC2`=7l8_vtPU7J~)iOaKRxpZ-mNuzdjE?;0$9
z`3V6s_VNV+^gmLM+pIphUH+3F^LyUb;`9vGw$EB00qecWr{4G58x-O>6zgBjY$wJe
zgoau;i>^9!qG$bWEI$F6mZB7~sq?1u?b}y>@ZX45Y8v;M57px(`M0bTI;c#X1F}W4
zyrNUj_xn`RlvVLPiXzaJiX7GA5Xo#n#5YMoC%>Txv6#z&&Yl^C-V7nmx#>8(Mx{0d
z2R`cwgWVmUX9@4sr&OBw(5b7kYgPMke4dma<EZ8EIRx5_{7HuC++o5{2QxCsyg{y4
z;oSDNtkLPe?!-y*d6Eyju||yd^V+77pUf9sIyEz=i{Y~2wGoog-T~Yk&oh$FJmM&x
zJ0)$*rdMA83k)5~@TNII#hnDi22@^dH!L}QRLv7{-7;l~o)w-`yek5<;c9GV1Bp(}
z5z;0veoshPSn)DON$H^O(9VGUa2KSRrxVzlySpeu-cF2YI!;azPDfGFCKTVD0bi7i
zNU_Xyir9k6!<jvW04*42;gwFV?4I}4H1Z^N9{yE?(U`@Yj$F$tfH^{mgO&9CTkhiA
zZuiv8`=}IKs=dNvsvu5%WXlpdpnOlXiX*s>w4!19*ty|r&>@kdGHaCN?fm9IXnEfx
zi&uei$Rct>!qO(yzA#D$J|q=?Bz`z2Nq|F{T5ZTpj)=C)T9=A<h1vs_s}!-<ZOueE
z^UXX~$Usu>%l^67LGPXt+Ek2#XPY#?f=MNcQtAPmMk-S&%)>%ju&q_VPe6d7n*j<r
zOy00s(9ZZ<$F>^Qkz)*Sy+da?&8`j2otsh=BWe^}s4I$&7JI%le{Ygv+!kMA*{Lm=
zBXqnj4%A|CvR^u@_Wb@B_{LF^<yj=cCm994f(o!G>Ri(4gwY+!4N_rhIbZ`3(!3jf
zK`uogWZpAizi$3ddj5pm5=#B`^Z1opzq-I;;>cn)WBkmEpVh@mEVEf}*@t80?!I@2
zB*0oT&na_evBnzJRHc*=$wuwo9XNU1{nYwhR1|^`<zB{+X1}33E5zP6K;*RIMza?o
zS^7n+f|Q>3cg2xq-c_TuEtKZ2Sryo!NDabU0=q9;U`z59xjHum$!x966_I|X6rsT{
zIr%AV0E%WGeN^ELT|>cLSy3#?@Gws62a|;F9|H7J?Z@<;T9*4SmepFPocNcR;ciWI
z^9{|JVAav1xI#wjU`#h9+n-q_N&2=TDKA=xD6C@V&uQARj;vj#$}m|kIjPaJ9P3tg
zzO@O0ze7~gdPbK`!PT`(MVbGa*mcj*BMK-%5~jakqKhbjCJQJFG7`Ln?8bwf7^KXP
zq`cWmXFsK54QcHUd{cVR?8e=C{8)@~H+7P~dU;u*oUSYB{B!TM02OR*7%NB;?`&vh
zPd9|%bo|H4!{OX4!^KLV0i%<}$3inZW2URdY7r6p1Tj^5!3t%)pofizZ{9U2tjcIo
z2Gf9KpADV!U=(1xbkSE#5YaKq3x~F`)r_$L?ewgr;awu_)(X9un;z>!AI=deXF;5e
z@#b7#Uo=#@1FY)5JIv~yZsS-)7U=i8yPrH;reCz%*;uOpaRk-m^|G%8pI5;pT&$q`
z>T>$JQqA7>1smn4j_$;iq4VOLp{T(zLzpR}O8BvEaiDpy3S=m_7CFgp>l?^S@r|g>
zT5QIoO!4m*L*q#MrdS)pZl|@lW7$SxdFR%31MXI`gX0>a>9E>mrJX@s&f}sHwM#hy
zn!$O(6z@{fC1S6C?946TLHKtR?_6q4k101Irr;M&Y-eFTYGHlkrkMxvp+{K%1yG8J
zPAI!bdPvG^cQ3hV<rv$QRAy+=Xb^*#st>(SOWM)7Hu5pB5%~(YwXpK}P-Ux6XbKk!
zcTN1^!`zW>lBh)o%$#L$Rpwy6Sfh$Spo4`FkWA_)Lg{zC-pKX4{{`|c-4wbgnEezC
zzyCutnw(DuEzCVt8ewJ2*7*csYQ$yh+&*QcZqbJqOC9cPBnHVF?3GK#?n2F?&SXsU
zo$W+C`lu#~{ZCrD{|J!rCxuT+Qqe@X&Ve_WJt?xOm$YaYJ1;aW2|ZFza1b4NF%1Q_
zgWGOJO07OYP(o;&QBGc9PutBmcp;cTL_5rxFCF;ntto2^4wMhzjawx>TKoA%#(c-T
z%&|Rkq50cxi|X>?p26&OA(4Oc+Qxu+V-%6*;KtW6nqJlBq$Ok#(DqdI=h6^)ES!xs
z^NrDjyLzUp%_N}%8&BzEWO_^rq5e`rdGsze!duw<{`m7feK=Og$gx|Go44c(bFb4*
zig(7|9or#M<a+pwzLi(h<e6F9kDht2`J|W~k4eYHP$Hq%1elUc<?iX(hLD<ibMN9+
zN@sA8rz0kT6@Gb|iuA8f-)*BeZ#t7%XsBVJ8|OpWm5toMw)saa|2ELDV>f|?pdnw)
zi<2Niau8>!B-axXQM$9jIx#ysuztR`E#||J-%*rDMhH}ZhV{EqMfj;hM9UDLIFRC(
zh0yRPNe21!3IxvVTiDMXv&&<w5NQ;?ngK~~`-uC7!L6an!ld9Gon(4uUIWBvA_2R}
zLCQGyly3Le6S!xu6yw69H`;_FTd5qL8>cq!Ke6&^LAdYz7?W=4(=TLs17S5T)84Xx
zZzS;C)CrZ)@kuHJ09jygEExCN1#5i?dA*c9g9wtBAV@=8Po6WQZw^imN4(m^OBQ~Y
z-8EMk3(T`hlhN<s)DbYk_kZSTR$>Z=kKWf-&b$<qBhBh!A*VQF;k^$;WvUG|yVKEX
zAB)So&Sav5D8vgG=%WwbhL0<Uho4S6F_J^VCnV7JHSfw}JU_$dZHq<4o{{bKHY{C(
zUqr|3+S~YFQq#LJqV@8xOJ4PxrOW88l7g>E8ih<24ic4)gVg?kF4A_}YyZ1vpJ*;l
zzoFkhGfpgIx^&ANQ-NvDz1rnUUx5=g^2<xYlgft?6Mv(AnOJuM3Q&;R1eJG3#cBs2
za@T+d79S&k7GL|@u61w>_7QklLxfN|>sXT85{B_^QEB!-<2u-4XW)THJ$nbzgycDd
z4MMg!s0!su<C;c|uhA@jt{J=n7<9c?w1uc7m7If$&U|!)&-O>dUlWDPGA?~JwEoh;
z3*X#E6W872?}|9dU$RTR(s3;L5Iv&L?EMgKm*Y?hcYgk?b=FU)<(o~y7gWrT@d-UT
zT+7AR{k`YTDKIP3aB5G0xC}`xd}(F0!!Yt-%OyiFsR|xvdclS3Oi0rY!yBtHMDKJQ
z<3WjH7-Y?N2c|Gh>VA6l^-V)Ssf6+Nmm2grBuR)mt?Tv}U-B%$UXg|G2q@5oJR4%e
zJ9OEuOk-u8L&T%VNKz>YI9@bTF5@{MoQlkOTnu0=RW)}n4G^mpEa%2jb=NAT6<)AQ
zKrENF6+-<BPXgL4?Xy7dnO6SUqh`1dxsjhP!++0MjS&a~ej+>`nR>QE$=*~xffI$$
zMkQ(7PDhIbcUEhMjRyKzSkR(D*t4avM%h8xfb)YN)C{_+UgIX1wXN+nm%PVi=^wxH
z;^N<f{DBAl_Q31Hk>V3(+PgCKhT%I5hx|e^!m4FCL}EnyPZCeXp<2KqVTQn=P(WTA
zZmK`#p$(iGXWy_DflZtBs9e~!+uL*VcbOPuCjK8kWpYLis&khKbtVfF|2ym4QCA}^
z+r!7%Wd^@r6f1P1&o6j3me#Ol3Pr^$C$1_zO$Oo~_ba%V)8s4;t{QY=t_v<v<!MEi
zTq==*C7vMPT{P}Krbsz~zWYoh`-{*wCfH`?0}(1w@tZnT@YK)f7Ts@A{RPDEIloA}
zS&znVWy2HmDbLv~AF(oP#?fESY4`8<5>pZ(*kD3s)t0|(PU}{X-FSGDOY%mW-?x!j
z6}sIX{Ogq2OR;j8;Nx$V>EKC;%qf@bxn~)xsik=(Nz+K_=I`;H>~oWi;pv9t1&S4q
zcsblsbzly_lVETN-F#T7-moZR)3Dhr938mSI78T(c8}oy73rlYD(b@d<fcLRsUGCG
zZNRbazYB*SEiF-F?Bm_U;GR9~7CvgS6R`<B_RhrJo&qj0bXc)Z|6T-DbxdJo|6`I6
zwQI7g!4i!d$W{ax0m1CZ<OTTuZ8bl{dSWL2H(pK$qJ&|087tJA1BF7D@VV$L1kdYP
zY*sET+t%{dNP3xufF`+!v>wkp!i^Kd`6^>aLE)Wii5WD%bxVNA-_;AaSMueSb-ft@
zD3V_N$3rpmwbx8B_XvVg+cR5Vw|P-P;0cUxE;!G;%+KhdAqG$-cWL>pZt!#dQ%G$-
zxF_>GWd7k&YaA@?M(==see6nf5x3+KI@w&L_u=bCkJooyED<qKWns%~edeb-skFlD
zRelu~e=;OZDg(49wOnD%W(%w4qKTi^2>;~IYd!Y<TPjpYp=T{@x|=~ajY(SKnti!Z
z83#^n1vHpdKxK2QIHKGIExXdg#!e>$lRSdN>~oow=&S}2*s0ckA!IOcXcdavutuov
zxYD(OB<4L8p2_aLD>$wDX8zkn0;sGQ6q7csPRHbN4O~AhAdYTDEo^(h&Y`RXGS>Md
zKLaIcx!PFX9`YOec0SeW(sda}afkWOZ$b2Zj5inPZ%&JCpbqp2KpFx?kkyrTo%PyJ
zXW2`eb_UXds{H&_YPO_0Vf_mvY5&0FblXcQ0(dZ;=ZRqD%&qPGPqYapf)LYHZ4|p4
zQlcAL?ILf`9{Zrlf@eP<7{<SPp-DuPSIe~37gE3ERU*1yrWQY1yIyRsUOBtQIEd>I
zl$yZC({^3&P%AD_0^$ut?y>}~6TM;j3kyr~Unh^@rR=@K{v{Z<65{w_nDe702`=mm
z$K1S}4Bnuz!a-B#j=Mg~r^VUAHw0H!YKjCN>Mk_SDU0UCdj}8xKOG-Di)8z7on}S<
z&-7WKG}xW2uy`#YBeZzpsS9JD#Y`1t5kl7L9F`SZSLAGY9_ovgR_?Gfcvn=xq~b(w
zCWP0yMSXK&B5azVA$fFW-aA<`8U$i5S}Gf^V2qzh;TA&u4heNGecuT{G?&8`yBzSB
zGekRtabw6~`@cw*#i~@+OKoi4XQ?}K>u&u#l#YJj={5C!L6lM@3K!`3)9888L^}~P
zQ3X<=2X&8426qPnRCv|q_>P8>1=g7~Ch)O1OnY)q_P$~jf>rADMQ)A9N~99S&l0w^
za9XNinL4$Qi8^YmgfBPqy`$$q-zPC<uiRclaZUwwT;d?jmOtoi^D>cJ;-f%eEdiEz
zdn}D8DfOG#dhF<4<=6a0Q#naof;?O#{mn7;Y2h;TKqF}x_hDad_jukKh1J?xKK;)(
zS*~><WE+V&a`46WC{rFQP4w^7x0i*b+GDO48igv}vVk-@1!9-lws1=C!gUWb<mF0<
zwFXZ>*gKh#>EbLsH=|L8USXjWpni=|db3TKuA-}xyc<c-fn^<NPr=z&Kv-L^xk+tj
zV>3?IvMbD0N&20}2Zqu8zh9BU(U8z58p}7_bid6Np;36OaKg$W+YfR$a9gO_Q3P>5
zxgAm)USdw-GHc*TU>>JY=CXR1(-ZBk`S4w~47Ru!Rb%)Wvzm8+_0;u{w~MW?MnfBO
z&ZLB7<!1L~EEnE?&v^)SE8KmdbyaYWOiLN(%2CuyY|cxZ%EtQ&Tm;{h`!+xQWd%fy
zvF2inzLupIPhW0=h-T2+Yzqz7<I+gqBT*)b9m_MBUR(0}O(zHHq#x<N_%UT_1+~U=
zF=5QK%f(}+zK3snra4Vhp{MM9kk&ZMum|e9n5-d%<@&a|_MzrMP0)`8K4}BU9vHjP
zT=STRLL-nQ?z59B9Y$_6KPH#dnN)uoGM8P(-*8=zTQ~BXEZi+tLje19+<QNB-+hwu
zmCFvokp=c1bo`6WCoK(bL!>T5_(0uhxQ{{+`Uu|E88GdtGumnb!WTd7?9=CBFrXL-
zcPW$LUw9gDMiB28zbC}ITI+XrMxp<PCV8K_J%7-?5~wFnl87&xv_tvnEqL`CDVm~U
zT)7rdK)UR-Fcz0nbcxiv%1fv)@Szg^-Lx8ONBC=90=s5GtK7(r+S2Q>+`C<8g(1+2
z=}mx!q=^8$@mJ0L=7rN5u}dqOnw%%uvlPWFu!14tcj0egKhTyD1xIg1xSqMZEVocV
z_iHrr+AhfxjwPiL|6)W&lxz8C>}RlHBD%yi4E_`*mc%3uRj6ED5%j38uVPq;M*EO(
zvuOlPy+EBJvu+2+ar}h4NZ8hqHBnf)s(e1KtpvF}w&@P>cEU0C-{s&@b!RZCh%I_F
zSOFdhL7V9uvLa}6@${@eC-QJV5UV&K7f2KHy>&3_l5AaLo*Iq!(C8~kN%i=sx#wzs
z#->bq3(7n6VIwBXIYy^v+w~0Tf!}Z*C6H9KY_@Hvd}svS#%N_@&u%2Ba}kwh;k6bK
zsF7SQZg(-fGJFVT1CXLHa34lTK#Ka2m%5tK3z%gtsZr*ftdWy#J7bt|hXZ)WRe#Mx
z@R%B|7!pz@IA{gNb66mCn8#Lzsoe^8-G1+}#XOd?JhGWk35{rtOR7(k<p34_0YpQT
z?}02?v`)|i*tW6>AyiXdpY%H9_}s~b;EW4qSZ%K}(X}e5Ac?*0z+R&N@mzTS4cG~*
zjM42VV|6mM5Aqq!{Tm-w90*lfD_Ao?v&t&xEV~^-h}vc}_uFnksjwZ$C<_TKYJd#Q
z=IA)F&`M?h3oeh$Yljn(zvPG>Eklf&5rcOSIsZ1wfv~<VI6s0=OA^jH?b$P^)%$H2
zVuc7!KC7+Ow8>FUq$vX{Z)3QifQTr?*_J>(mcTta;x+o8TwdjhR8^Ek76Zc0Lw@`{
zES;VL9FphUljj)ib`oOtm05--5eDt}UP;FLAKo#uiR(=nt1xaRB%di=1j7bOm#L8t
zigF(h5{yB1nu0)b{+)0o-!#|ww8iDyAOnv7=`tNek<m-^sxwY>Y|T(Obzd*3)2SMo
z63wG~K8=X{z>@TR#~7g~TvC`IhfG>-3aB+{2CC=bz1(^JFxJ{e!S+h@8;B9Z+^p2N
zjLxc%Y#?k8Xy@zDFyBbVb=MA4|AazjAodghENo2pn!Vp^(r865rj84af#w9EUWIFU
zKC98&bhYF<WB}b-A~FKb``XZu;3H)hwkrt+bRTv#0`j5vE**+PGJ6!~dBD?M9@8S`
z)Aegs&UbB>u8Z+coxc&6xRRZ7PVPmNLivROQ^}RhhWP5=Qaj(jP9RG<rb==u{97i#
zz!|q=ZZtAhoJG4%YX`sx<3@-WR6$94YDDhhIS0OnY@i8d8Q@*M(gd<a&)n&>Ia5o#
z;F#tm`z~`o=}6z5og=_MSV!dk%3OM^4GK}Q>T1^I0xVJ&PX(ItgojAdJ3{-_lDxLk
z_wU+fFx#=35^!hlWjta6x8wT38NS(~qqYCIx5=>@Cfx~E2TmCi%A47CdOL02rM%5b
zK(VPnje);d|JBkdR=2)0bm!B}vMIqnn2mI4Dk57VeAp^0kK=()Yg#?ZK_F`0y68e5
zm7?Ef%zX5P?=nq?N)D-o`na>a)W}FNtP?*MV|?i-MmUz4DgE$Z{p*f?UMu=`pZCIk
zPFUXdvFp|66A%PHISAUvolX|=+0Biv@hVAsd^t?=m~O_0a;~Qli+W2QWB*M?3)TR#
zlUfO2kHns1DwT5u-n4F&?Vt^VYn6WDVk=?sDYY7PdZ*{GfxOAw=`#1IQAojBrt`QZ
z-Hha(+Ug(8um7kDZV0wJ{)d!fQ-|&!&VigU=bR;RzS0go)HdL~EuzA)3hJ6+F;7`y
z47VJ@h^Kx%ldIkn4D31UzjVW#zBI1=P4X326?#EW_t%>%v;vx+uNzs?Cq`XKM81eu
zsj5(`7Fb#nRoq3Bek%Mr!gt3m(Det7991;8jCTTBL6$agu0q$h_ziwr&C8hqxd0qr
z9QP%9nTgi<KStKbveiqnc$#qRalbDu${2Bl$Pk(Hf9p}6tAI+J7}S`lYTHCKj?JIQ
zNvp_k-hbah@kEnF!##zT#yKX}l1hGK#Rdr^;&@qf5|O>{mnx21e?C2<4Va9^2=j+|
z*7it4*_=3(tS#-WGDTF23@1Xc5<DxaQ3x7KzuFll$h$$r?F0jaL(OXLnG;&o{j064
zz+{B-kn{+)++ifij`&jbe^QiU#9W_|PNJVW(-ZaeT)s@BX$l6nn+T_ard2GGO-IhV
z0<%JmZCheyw=}4$pi8bD4I1(&7c1U*O(dsQ77#^)2Gz(}3K_F19ovI%it~PYl{Kjh
zpKiyC(b1lHM6WxxK`R@=$~WEO+zd6KigWE6BY9fCvIx9<jF_MF;EAtNJ=DFnK_MG<
zR22slabraz4$a9OigRo@qB8wR&yJD35!KhcG~aTnz6gPqsM!bwgp;114s3soHf`u0
z5Sx90nMB~337<Nyez3)e>x2jUnG^$3>THuPy!|S4YF01H=81oh$KP<s(Y5C1P;aNW
zZz3nvI!p@<B%3RSyAMP&aMUB_mCrAa3enHGwvwBr<yg`h)XF@-?0rQ4JY%<=J5IqZ
zz&j+snx74*dGI$(oBhLEUWs33d)2t-!F#0QX*=6e!2dV(z^->APUpU_QAv1<1iw`R
z-0WP7+a=oYpP7B2`aHLfJ>c119h3K>Wx>T*>()gYa7`?~^jbmna5g?VAo547JG9Vr
zn6?COLrku?kQ7Zi5at3h^!?M3mREk0-muYbZdn)<UIv6`p<!2=3P$0uBzyG_#p`k}
z25>7qOy5knkJG=ErMb6TN2;h!(XBr8DPXPXf)1ez?2T&|0ndDzPi(0M;r~O}IrZqm
zMQgU~+QnVAZQHhO+qP}n+GX43TefXm{iTzW^u<Z~a{Yrj=ku&F`h>?5hGIZIx$KT|
zd-n-OQ6WdZu*gEvfkKYbw1{fmx9Pcx!jtF0W_#b>{+;9bNH^|fS^@k5SEYO?AU3cS
zQ~xDM0VF11;2Q(>Q0&Yt(7W3fXA`JogLu2dMap%)ve7aSI3&QGsF4Io=$%G~R>KDc
z*<$edB4=?1F-M&_NAK=@qo<6HmY?v2Yv8kJVAwsXT4qEr_M%RpW~N`5&1{H^2LKy2
zP#Lebduz%I&>tiYm-&ESh$PV24pz^V)7+`0at?(`eHvSx_aac6{llf<xx^G`rt;I8
zY}7*Lb4pT?8JW+ZE|2Cl`fGW#^1_B3ZC{Kk=RXly_sWr7Z~RFcVtxjz2<Xo_G$W;U
zFv;<zYJ6ER$LP&~x!a2UOoT$=Kz=k@SdbPnm3tN5sy9=%M!k8!emLEBsMM;DIFq>J
zXnuwH5!hpozX%lr1&l&++d|JaSt<2z$Mb-QpmJfB6qDoo;)$eM-Z3r!BWexig|P(V
zf@~(2=C})5d2VwpF$N$s<4n17bt1J@+(1VOorH^r#0)(F?ws!D`>K&uzCEhqoVj^z
zyi8meZ;eh_{E-Lkv;c}6gM|u_*yLVlyGDlMMrp1#2)yMxe<i)LKk{EoEHV2w?y{+)
zl{l?F1nu6y){3u=3sjd10A_ysf>>=|c3Gwvxw!$}ce@?!#+VkE20>em#SF3IJ7H?}
zDF>%vB|os|bP&hoZ8#uU-3+EF2Y2Ub0r}<|eI!MlD*z|p_^$_<Y~k`J>Pd1d;1hMH
zBi~ZH1>4B*hUcBPwN01XS-}+hrTBf8UP;h*)#(~Wr0qgX-;Ye`&$)wuz1j2=hNk6{
zT%7jtScFl!7(DAI{Mo+oI2-K|dNVARC7m}^TOGIC6p0lxL~`I1Ru=mNV~l4s_aZ|~
z#-pppK41x-2L<9!3p5T9f*mxL)nN!O+Psr($qY<ylL<D7)~$o;WV^`N<`TSaMm!Gu
zs;lSZB*)ZK)bH7uzpv6nqpo&M;Kq++HuF*Mg6r{YSMT%=sz(#K1+F&r&qG2hABgac
zOq1u##0-knOCydEtIWQW7~UM~nl5sI-JflR@P7I~<56Tp`KT((AOH^Dek!r5GH<Ny
zGV^T2cXHdJlacDAHa>~rY5MmEJ2wJToB|;!S6UeZ>KUnGQ5>JPeUTY%!7ox>cQu#Y
zIc*J3iYk!IT-~;PnIQ4+p>*Bdt#MyuzveWgK<X5He%h)5XZjhce|y|+bHbAx6CA}e
z$HKLd5S#mPw*4B<ZX}sY;A|9QKPSZ{ONL!m5)*re6`GsDvyaqx198f>@sG|hb9`nZ
zLmb8VZ9kHS1gt7QI(XgStrixyr|e0%r{0<~vyLqh@tx!93!q+Sn~5a&2g(7WWJhAt
z#R;NpQ+)~o(xwpl*qjWn)2K|!5~D|=x*q5B+osjyRK{?4V7kdry&gOJDGp*I|HWMR
zS6FhPe9~na+&q93C?mw5iceVac<Br4wijAA5*or+_J~e_j%T9IDqbX=K1+~K^5mXe
zQM=pdPs-OiTE5Zdeh){N!xnp~=HUh<-1&k{c`?0Q+9KC+p@Dq`vs_qgq<S)CG++Mq
zE{sWo=gTb@39s_+X)%3NFt~;?KE$R>`<i}rBt;ikKDg<HnToOGBVyKX9N6LxM3)c(
z9Rx=cC0Ss{FN$0QdBOgDYrTa^sspPHJaUy|4pMR(&j|c-&e^~s{09Pa@z6s_DQj?5
zv)ynB1p_@dl15mgXfVq>Jj%Jy_sv*9Db-+%Y(53DO+epouG?XW`Sy*<3fT=`i%6zj
z$^97*O5Vj1lTMF+=sLU!Rr>UC3?7OK0YNx+O^mDYOfB@jpulbmh!;uQL%8H7a$XKP
z91z$u>C9HqtOsQ1JbhUHhp+wkI1=iPP7hT!5$lYY>xr%xtbHTHk$m_-UXQkZAII&&
zE#`H7)k-@A#rxEG1i{=LBSsi{c5*W9R=S{YgW|l8XFENr7ilwZBc|5js|*2u6Z4hf
z5lZaD?ikF6R7La5in5>NId3mHmMA0UuOIfR9TegDgq}%<y~qPEJ$A_gN?lyw&6*JD
zs5S@KZ3lYs@|i5NdY#RS8tSv!NbqoV_2OQw6`7hEu16<Y_v~q$((grN6QQDDKxEvb
zYq3#hj??2sjt^O0MBzzE6ohBpG|}TI2~g}!@kFq$C-Jn~K1Y)JUAgo=oNqW(=?~i9
zKIU=T6El2#!F7W6LdH<yp@J6OSDK58dHM7|(fU}dcR1WVUT_Sbje<lUKJO76n^!T$
z663(i3i|N3`8&|+!$!yEjRcMW`eaJge_E*^<CF0f-(0Ahtj#+}<@p5$=j{It>ptLj
zxBp<)N`-J;!VW~|Z(q(k!PmU*ye-+um~0jVTPPE@*#84KZjA4bV#{q#W*B;zh_$f+
zENWaRHI4XK%<)<Y0;d0xTiL0rM$1cMRq-JLEUuxkn#bbv+$oMV5kYM$y@#~y$r1DR
z@hRka`anklGdk?~`PKy?c)8He!@I`8+Jt;Y#-Ki2ZfA?JiJ|8148-e(k;O4}1z@r@
z>Y8asNvUw(10PC@-xyn8B~b1S{P_n<KMb_eIfUdk)<n@@${nVGdiGk{bQ!3ljw1Ry
znvq&RjFnCM4=PDEHmeDW;8*kSkN(-EXnaCc@ZSRxVR!LmrVI#hD?+!dbEU|kub=w;
zUI-33B+X)L@>0v&v}68VW1Ti?*8)KUo-%Nrlot?&I8V@|2A}2{o+G4|4#pCm3#pln
z6L(O{6V^W5nd`jg?NgW$!qGb)m%H-(=r^|J)*lvSq4V8(+6vAsW6_=QqKLK_mxti<
z@JLYn|5=>g88uCOirLLJ1DT3TI6KB4yo(<CvQl0)-4gIw_rDsnrhfznVKukTIbIrh
zFN!(xiog3A?j$g{4r)Ne3U8d2UF_$z<m~4BZJjP57s{`FX$7z?NzX=KO@n4Mc#El|
zFjfZ&E)RlXDCoNL$?I(4z~c4*oO>P|C^WXORZHw0A|T~YQMvi74`!4jb60dOAMg5a
z9Za!?JH4O8CvNhyCdqt{fOxN1Lrbil-;U<77prZ&B9R&V=P{%N(H|Kpsvu-gju2)Z
zn_pb{rD(zY#2L7DbXS~iv|`<xvR`#q%P*v_4t!scclCr^RL4@azY9pEqd2~%4u#Jw
zct`gsbjRgmHhC3;QBaCh!=T6H%Q{_GMgUc+8pdDf>4vTO!`D=ELbUG7bu@IZ;~Kq@
zy<Z!DUhM;mBYs7l+g>KdRxo!6=Dx?*3$CLPnh0JcqRamLOcH&3#<+qy8FUoKqq%_M
zeG+muhJs@~bafv;*!-S|9;h|kaSUKzs4w_MOFk)F344+Qoi~WY1bXZX@5`g)F^}vp
z4que~0keHUP`m6G3Erb`Yj{@L8IO@JVpp=vqhmETooJ6<%N7si;*E_gyj3HAo?}S!
zVdWFne76~jqgdx|DOkR7&N+mTSq107+<mtVI0_jma3<^>kYhdNPi-cY5ft98g3&p0
zZ1p0!`g@I8{?|6lL9`K@Qr$&ygjCmT;%q5w>IL!9X@m=mGZ*{q3Fnt4He_I{HnJMZ
z^{#!PoMHQGvOD0>(|TiS$`Ur*#F#don6^k&8XaJd*mmSX5w&DoG^W8}*Tum#j9Pp*
zWZx>&^OpgiQT#>E8G)|Yp!mvZHFlALQ=#eJNE79D6EX1IQfSpsPLg1wwgtAI?uXzo
z7<gg@5f-8w5?na(JF3)=f^1=>mfQ;-qAx{5^J`n-0Eq4v98)m$UnvM25$N%yvIw@|
zbg4%@jN^5urFS2i>DQ(M?-o52`}OFDw$A0)el_U4j0^Q}y<JISx4d%hmWX{VJ&^{l
zO=x3W*Y{!T90*0K{ZJ9*M-tzbI^;pSGGErXZN*Dn8sszy%->KbNa(a`<%4fjq>BS&
ztg+GHOSD-h7pGQiY<3R@vVc2NmedoHNtLDc24<%eXf>$~Pk+_KBnIIhxR6>YkCLND
z1&AukN+Y$CS9`jWzm=ztEJh9G0XF9utbKc}-o;Zi2=uLZUZpS@!$MOZHlIyfT4qe}
zH0F!xtAA|RUa80l8hYSoCO1vK42Qe>5k}B^aCl8>1xsT=Fn9aHfDi5=d~N{Pa63%V
zCq97+T2onmFrMT8LMSY1vJ_Q%U~G=!71E~@p;A;>N-j`CvS}E4E^H_H)PA?3`#3mc
zTC#C~tz_;RTPtv{Oyq;F?H07&%En9BNL^(f8)ziS$Dh%$P)znkT)kaH>ku@ZDHPoJ
z``~+4wjb2@m@!?NXnz=N8tisDjcZ(K5tYClfp_!9`tgJs&039<z8`zM8tp#spkkj?
z_LVZVpT2^3x7MY&R8H=mgtD&(c+*YRTqY0Wr}hQpIVDX!_rnruj%kmxfX6{HQfmbN
z=I96lx2pAWk%)0=@IV>2c>ktCyll!JuuvguHzw9&aiFyL-d3wqvrEh?E%>WGgH`U`
z{s3T+c~tJ-Nj?F2eDIbg=*(3PgQ=t7u<qcXi-sHPh7ZfPyi|>Pq0fS#izR*w%}t#1
zX;Z6Vq9Tw;7B{qwP5Sp}c?2KN?f>x2O3unFh#D(pG-y|*i_HbRilIvj)@m!`1`MM+
zJQw)*U2?_I92FRjrZ1ACS6f4tq<uJ+r=K#3=&I*TxFU1sPaT_Cq4FJ46Z~+X!9lLw
z_<)5fhuX|7iM=PC+w`H%8jL9^CTWGq@YnStG|^uZSoEWC$@?bYW7CjtYZKP)q*7RL
zCbsx2RX#25{krx%vs02Mve8L;Y=L3N`Qqz({00|^n~sg(>StPlvs|$CP@~tpP$cVf
zylLI|waGDp+fDi8J(327Hg0Lj{jp@_s7h*1Ay4~JM8K%T4~!NSy!^SV%ZBJ4)(;c3
zE}8aJYp<^uIB$n!BhMZ>A5FP0zy#`C0+q%LePCy5F&DyflZd`Uhd&2Si`}<OLNp$*
zfRAF~9Zj4SnL8LtI+m_4l)iQnyxJGUtPsPEYb3{n%u&J8UyYNR3+$gH%LSBc{$P>k
zLK=Qus;O0t`ka-w?bgJ*@qVXmVPJ$KeRjC;%=6ekXE{JV#<z|U@v%?x^RzF15Ju&z
zh%eV0tbPo{rJ+3NN%VaJG;b}@SOmjmwH=a?GtlDlA>6gtI#U<E_Iqs01*-FvLBgb@
z8(jmWB6t-ZiVb;FB*cla#B8n@+ORi?R|&ui+PMfz=d(7GXm6P=%f0G?;N5Stx|F<A
zD6F-Z_3u4E2%TF-00_a{10u+}RbZQWS|6J2eqN*yC$&A8WlZ@!dal~hsmhqkgG|+y
znJb54dL55?>*!@%Ny-l&OkAH~#{Q_SwhPeX;-Hihg|mdC<pyt~S|W?v%|d)l7q6E|
z1>BSq&!U8fV913BYt}Ge2=^82?hxe}`ty5tzA9^I6vFCXy*c*YibWC<T^@!}<T4c&
zYj~k7(f{=|{IOjx{5kFt-|GE3eAA_b9+VL13$&bT)DeczC`yPPwm?mq&A+Yenm8!d
zAx#vgCzn&0RzD1>-fM+v0wcLV)W}iAA*%?HvIgW7>@_fu>2XN#DDX5y(F6MpOi@9l
zA6k~O6<?)~De833QasqBd<SAKN3i@|5X^*Dz<|e0=i(%yc1Op-mssn){*6iddGr*A
zwz9cW?3%!T`>O3^ht{*m(}R-w!UeNKrijewZLZKf|D%^i?4`D}6w|kJ#3+Q9VS+h<
z_7YdIY(QjM<Da-YZ%n+lJmCYNk@1?8UGbDr(G7`nXkOv^w@maM`W8P1(Y$fYQd7Gf
z6LAVuUOc8MBLo`TAHh@a%!i()VJugi#3YRsi36l5s-5tQ=@}9@TEL8p7gW6A?zUB-
zma17{CZZ*$)=Qt^M}n;L08*YQp)R|>#UIC74{X^8N?O+4V<{8Y1KIK3;AS>xz(nX?
zaAu$z{BVm0!_)f~1rdik7=LV_xSkWEKGS==w+m@sZYx@fB-Q}YIag8KTPzpwbb~Ek
zMwz^BylC_kQL*VzTDS4gCZI{1f(ztLYJelUl>H$)ElC}KzQs!AR%F|N1jnpuQ-L~f
zQ)#6(8woTxt9n8e<ouxIskZ?AIms4J8EprKbH2pf_3c^(?SJh46s^)nXmWk)&!(qW
zDpc8?Mu9A|Y+d~0vm;YDoZIW1Lli0Bc>6zc<b<1lq{(=u=g};dRh!|e)nbiOF;t~9
z-v;6`7PihI=j$)8n)P^95L*GP^xu>oxzU&5>KNRCYbnN7<8c?dV&y@eF#p6!(B`9|
z?b@SN3QTlol6CyO6_}zCxSfnSv!>8Z{h!o-Xt!2^{RW!LeM;N`0QrYhS#L^u>gtVt
z&qF5e)Nh04+mLdY+pH9>*7#z0{nuWILvy8duyk9IgP=Rs8W`tGI(S|hiko)ldm?uY
z=>tYU=i$!e^rf{pXSPzeFjgwF+ngSdD%#ML3Br*75^x4+<^?&qMyqWMwoB&UdsmgR
z({(-6cRb#-GSbaHytE|d*Js$RO`_a2z(~%qsiYo@uGY&9cOivV!`}%}NLr?BNt9S?
zt+7)gzQz)1I{)VqvV*|6D<5y#4S66y^3(MbE5ZmxpOpiT=N1F)>1A~<`oBG-5Ec~w
z2c4dR#-%S89tTPL)lG_Zl+V`Tz|>eTlHuhWbj@QA9u#wgAP#>7IR#W7%+E}>ANro^
z;;La2*pz<3H}K)%79{P$I8G!ixfZs=MxL0E!57)>q|+PUb9f73m36+-N#>{MP}1Fa
z`P%rcM#L&Ou((d9Wqh|NqeWQeyeIxTNYv?FIlg>8oj0XHVAGT(H}wQBaudS4j6^tK
zH2sNh1;Dsle6EsVC+lFmddW4$2)=6EZm=HzFmg@`u4(fGS<;PuANiy0uD^E>unc`l
zbnTN|1tZ@0O13GPNv}*j$=#xL>2K&kf&H1W;xtXVz=y*S?*yP=+TuO7<bnEf6CtMo
zq{J~F6H?iyh269voo_V6?5HVP#z&x?`v{*sTjr~M{)(~>$VgK}sNQmYb}Z^l&4#2M
z9Io}#0*|cyZ6u9uml#7$!&C5i7EvmawEYuWN-r_%0i3PT3Yq0N1&xQbkQK~dO=sra
zua;uS(LZ-MYOgXLyrK84eclX}yCRuw`@4p20W!}g?~;VmLO|d{YuzJyx%S_{JzPa3
zs)1O^X0Bi^qn=9CAz`c=5|d9Xir~|@Qs*e}n^gfvVun^bGZs1T5lL8~$Mr>XEWsC2
z6}O?K;tCmRsJv%Wndcs*mUIgxs$y5I4g3UL(x`LM^pW3v&%M)-#el;LCBxo7@d849
zMV78{RCyep%@FJb$$>|QHLM3*(S0!;?|A)&ZdQ;K&*@xHp<2zwzaoSQkZ2x|8OzE^
zY15(_C}{Ab`486;F*@Z!T<-AYyL76sl7kuV`*OERGPi&j0`80Z;k<|1<$ITFEnB@4
zPFMLvxY-!4M4m=5$fV~qj-3X%34ICHv>X?*V?lVe<ar?SW<N97?H9x`Dxo9OX}&G(
zJKdiATrn_ZSMsHdtt;DTJiZBoaiGePfWWe3Hs#8u7=3@<zkN^!Wl#?jW8^W%DrO@R
z9sW@$$e00RonNfQq=sc*%opY6v}k4D`5x9bUxF!8@rW&FlVDqoAo>KHNjgare-5b;
zuwO_xEM(KIX<QB>?T#aFSKC0lM?EjhaUB^hbEgD7E_GKtx3fe^Xh4KU2_8-jvd}gs
z+#i%A)SpFEE8C~9aJclx!R+rP%<&G0Zh{@l^IllE$1JPoWcils;L3!s60%c5hD64S
zrm+uDT4mxT2&jcbuC3g=E|$Cr`11;#@7DY}L^RvZQnscdyBZMSI*3jKk1yA~lknh8
z&&6+SnuE|>?I*E5D{sxFBPu<-ke%etfQudEpRICMd)qj>UuuraiHt$C#)}s!VWm^2
z>K_3}!U8+$&t_3!_;2rL$1r7Y^>vud1Cr0@qva+4=(TSRsTO(sC6AsM>YrP3VP8?H
z;)suUF8(wrJP1FJ`gXwBwU)nt4kpJoXs(Dv6jq-!b5#v3pN9a5L#<nVtqy~n1_Jd#
zpS2{9V*&Kjrb{IeeS%CKGOk~uo^@1z;6p=DJW%knS5DSGW7fq|K*hmBczm)6N)*yS
zN!P*`vDVT0$nn%C6J)}Wv-JdYf`cW@9DkT9&U1O22?m>wolaL?rk46yMau}=7q8ZD
zn)LimTjsEMkyCaaM26dIvV1DbdpX_L8D80I*Wsp{aHwjPsoA+WH$xYdlg@;y0(xFg
ze3Uk6i#~OJw51kj06M!d=LXG9Er$CG*SbXR&0tQmXrTqL)_(2A-R6cZ`f2W)OaCF%
zlAuXLk@%HaEM<^!S4aP)G(MVNCGM@pdUKz+25iTTuo!n|+elhebw4>Y9qDfP(pnyZ
zk;ZLF+A0(l#2r6n46#I1jHHg*Yu`Vfqt0oD2I?jgNwFcSBJ*Vra$!<s(zEqa?0jbz
z0RHX-W1H_aZVU@0hu*-#-FNOFyByxX=Ecmp3jL{8uV}>UA#vsyHg*P%uPrz!IU~ED
zTdcLLB{VO;JPysJ6`$*gYX3yays{QAsRN^0%c}z$v<eMjP(D%RB9J+IJ&;0Jm<A!D
zrmO#x^lE4qJj2hJwXc#pmYge|Hmib}iw1vLGO8SpetbMx$3t7f+f0uox>o{OBIPS4
z_PCsz<|s&?I2uC6MkG!vn}j<>^5jnR%@nG*i)~?NIT6sM2Db@3614O*0tlydJvEHm
zp|KZszu^-oh~0G`nu96v7?GuDE*y$$0-D~7v$tO%5m)_FCiD5yLb7^;TFjZ}Xyh*8
zC;OkrArT&<jpg@^A_aVI;Z$`jPAvrVQpa^*G{@o8Q6mB|nQ>=2z=kEwd8hY=bYAnk
zx3O2!tP^8Y=>c{p_WhI3)kJi+>MvJ#Te4t~@iN#HrCPSXtC<Th95UGjNUi2aB<<PX
zxuoT86`H^!3t>?L3eF^di}Rv^{hPsc30X`2yCXg7obLk-2BnZPA2Y2tlLB#!hwV0I
z{N;EwBnACJW*6K@1hg>?O-3@ioD4$(<m{8P^hPxu3J~H>hK8I3pKOvY`BdbP@wsw@
z@Vi_7x4BTW!K}aGu{W|gjQec0;KXPEK*(I~5+j?W_xF`(Sa^xo%LoNvIh6fOeUaFQ
z8Vrs-6$7237C~-FwB7^Hds7wKWa29>S_mV=NNVXFXhOhP+utOc`=51KvJ>Wi!m%1c
zp^I!9-bBB<r?i=G4~<DamjN%Z&lFaHz-KZMGig;+c&WL>%)?RNQ^sBLDs7{S4WaOV
zinllY43Oc_GeQ-+D`zVk<As+pxJuZnXPgZ_(WJ5e{VVj-+F1yJ9DGoB@zf8CD|Dyj
z(dLt*Oysk)zv||QLN@gBn2I8hU-PU-cRuJv;(#~cw8A!f)P_f291=v+bqNj4&k*Ws
zOQYoAlCzk}2+0st*;j<+il;wc*sYDBe_qH*!>=3<i4|8lIl+2M>G37ac>2dH`6=kZ
z$?}+z@9dg}$O*hz_t4o=8ji%~7G0K)H?_FL%NP$^q*#3fhR~u+VPmpiau#l5`c@zj
zTcl&$<g$5}W6=)X+a0&wCARjO=;yvMW>KsGx4l%yF7og=rc)^8+#}?c$1^}xcZsV&
z@}Eu^)t2@eTjW6D)nTT^yj@wj9QrawBff)$;#%3B@aB%Oefgus>D!;l_4?+b;bkcd
zj+2QJ`5GUO#K2qOby;qobi31JoE5@E9rEL}j*6YNPy%nlRISXb|2<|~4$n>M(@TAl
z_F1JhCRQbuV62zOF76;-!61&7r<QjGBlcAGN}9hoo_0*hXQ&(BjoSX5QleUzN55c$
zL}P78oiTpROdnyMqw~>PyUkUymUwhcJgn?TkF_%|Kq%L3AZFCcO-E+}J?y5plS~Ku
z`TR)3Ok&Uve0^giFugcXbwS>O+#hUCghG?yFRn1h0nFWfQ)1h(ZbX1-Dz(#rg(ZM%
z_6YgEZjxDgfSp)vrsmw1^g(gam9L(j$9P@*?xb*{2+Xpi>>v$9A54|qzmV4&Xxd#~
zzFaEf#7o+rs7=>Ip^w^g-Hf1Fd;6v2qly;PCR$cuLj=%?%Sb9xS)GhGSFvMnB-WC~
z`wB_dgec0vQ)1Gk()Yh96zaH}gt3^g#WT&^rNMAvnXOzYm4(E>CY)d>{=lxocH*u+
zv7;C%>-olI7MPTe?Wh9<wR1<ok~KNj+#C|tOlAjv;P`s1X_)<r)D3l1FPwF5eU<j?
zr9DTRu5|_8dJ)Zuku~$p0h{3J_6+5rge}eflvPd+@naopsU#>CJ~B{TOaG4Lpq^o@
z3(L7>yil}k*%cWp4;8*q!vSQ^suIwNc2%P*dbRN|-hgs2BjU2yI)x0AJU4wlx26v$
z+uX#&?q^FYZf6$U`Ei8*++NUfD#YIJ=N9-d$yB!T-}kiJ>kJ^r6oi`Cy{|*58+dHG
zpX~|XL#fb<h-nN_#@^{x#!{=qI~6)o)x`~xW_wOtnA5>8)jUl98lnC{r~=w=V4DN}
z^K-92E}<xHw<pDAqGq_ave!pX(7C@J=O*M7#$|xnBvoa@(PFu0=(-l`i)9WDQi>&P
zZbt)`)gW8%qWDWO53^UiX9!$7wh_%JH+g74Wee2PqMF~Db2#s#)|q0^bl0rivw20A
zP4@&cGiL+`qKlO#|M7jy_*BDeDr$_F^_G-9Gata)3ZHvNPe3NqN70UPasVyos4?k`
zMv`U}<MTr5sVrMEO~`sT;HTo%;+*U6uzwk?Eal(oWpo?oC*-&)t%Ij41Lo9<yb2BC
z;<Fu?7|}=>4ke)j?rP=uMSA2GMF~qT(@lu^myG+Xe%vB5q^N1VJ=TJauo8{K?%wFP
zpI(3-kqC@IH19#>$`S%$^ub|4A=HF1g~!4=uiP{hmx|WrDyAZS>6Obo!9FQA;<hc%
zoky+g@MCB?Iq#Bf2qx+<p9xYGIDKYwsrD~6Jcm$}M$6idD3J1VpZB!eH;oF7GeB_;
zz8Alz6O?&rplEn3y}z87i4c2yLFOetNr*^!M&EXELb`gMj)>`9U%CdWC2Xfj##U>2
zrc5PU5R+}&H=<w!@!>Jlj5}U1h*+E>KDJ1RF<w8Mgt;@g?L3;Vwl)|Q$`>u-z6bmE
z@SCE&c5TDO*Oj(yPHTN`w3^MN-rzk=f3jACzpY_&=K>d4Z}Dk@xQpUYp^2Q!(9%92
zIJ=d1;irv!XG+E5n+C`1UG~#Z8pIrH;5@58Aa%&7y}Gk4CJaQjHv!qc;DaNlD9!ST
zl7T+Q%a-yGBz#V7kz{UYH-`DHHx%akPS4}P)4RK8j73BZJ)FlggZO9k5!P|Jh>UG=
zRv>mFL*hmX>MU7hfvz+CV!C6!booQ|9(wl-vz4*ZiM7sow_QxTm{3Q#HSfwW=}&c0
zs2_!QSSn?A_>8sgT)ll^kFKZ)+AYm5vfV2UQX84?;XKo;a#+d%NYrdPex>vfW`2)3
ztf<7haj#&8o!k-M;uYkP6$~Zy@3j0XszTLfdz@fiykg=jtDLpdcq%tDT&-|<$C(jF
ze<&0+TE@;aj4wIyS4LhI?^Aac23hrCWUG)%awfRZ5&n3q;kctJJ?Ci5(n)^+t#$-B
zS;gA6j^<)ZzOT}UKgbR&;Zr}B6zQrqahDDH%Wbzf3qDJ30I5!yUs_!$q%M8T>PJ1i
zGFnIoIHzD>z%Q|?OSI~cSC3h4tioSHmcUik5B<|(R`&VKV>%chw0gV`HRpXoo!af}
z==q`K@v<SrrC+#1iM5xHZT9gRl^|8Qb7I;W{VV$YymXz$mJ@yM{(kfh5CM6Pjpz!Q
z3_HeN=#{DO%=`J2_Zf&wOx<wv>Q;qsgzU(e^1dq$69UWqkn`rR)czNjDF1}9#N96}
zb}Q!{se=EA(*7t!ll#d^148Q2J<W5=1#>pMUd~^Xa(@!~j}KdFOnIt#+Kk)|Z#2Jw
zBu<%#nqJ*P0V~Z)S_9^Myyi8Mp6DrXplwvX`u5Zq#N2z(HSb=}!c+q109r5D{yqZR
zk%AqroM!|Xn^1Y$v?u#ZUtpR^;srUc=4oAq<^u=8D%1(hF~0gV<ntmhu{>y{`_fOp
zufGwCpW8{?Yw5K#N&mUa5`u6Ov4LuMuN<1??dS3CsL>@CfDAGJQmk0J!e*=4<cFi~
zZvt~BWRYAJrjG?Twu)K!dQkAvZv@j@l+6!9vLjMllrpmrt;zE}aMF@$C*FdUFZ&n;
z^;aqz(32lzds9{VKFj~K7NvfQWW$gsK2;BJO}s&OxDgLpK@vIzqNlDga3`~dj#Y2#
zDF`V_I}LU(mBwqN3qK7_bEq&m2$$~H65k`gC}`Gob}dv`Zy*%Bq`ZLJ+`sqlRJ)18
zjL6hZ_JyI<q|zgme=abwJuPpm9?IemPXHW{l>esA^S~*_65i^W#p`0#mi`Iers_mB
zZ;^TftX6O$1VU9yH5{=LXDh3C;3Rr&*Y@&m^53UKvEBL8ne44zwqb_KvC|-{pGr*3
zLaj_;<F^~n5o&&}5(>lxwn^7~s_e-Cd(ukHV0np{6+5z+!6osPo)ylA@c?@R<)ufI
z!~p}Lnh%Ec;n86pHFEng?lO6x7XV!w84{hx1}lU}ew(M&j@xvv3*dp8>aabfez2cv
z-Y0J5cyvy}EEWTOJQqY%ptonP&Y%{lZJ?}UFtubrG=}}A;LnmC>>Dji@=ZpBaQ_@J
zh(>nkVc@D6t^l{40Q=hM>NX?+7l9h8gmaK~W2(G-_xCUEKU({+!Rvg24R}Rdz<3A4
z190NyCL{7t8AF)?OffSii&m(*p@?l^Y)tv0dEawZ-}65EwJH_WPd*Sr0x28)7BJdf
zj2~>`|9Omwo@Dj04a=+B!M4DWkbh|CzkG(bcaZ)Qy#-8fVCL(&9Wt4-PxeEO*+P<~
zW`6QjUrK25jBm`3KrfBuD;$(lf(gRjgWPa6#8rH%ehe{piBX+^P=mzf+0w9g_9t5A
z=^*7D)ewys)Ych~^JiUatLS{RF&u9?&SXDxrdEPa_NDCoTYNE$1m0N|WQiaCqgzoM
ziu94RBA%)?4>Y*u&?)E(wyIR1ekfc9@WcF8l{2T=5q9706f=UKb;=&Y&FR7QWUeoA
z^_Er+`M{tBEtzJ2Y8buu1}BUsIb9Fm7zIrWB1rcJlJ^~$p0L_UG>w^2?0Du2BK#Y~
zbwo#D5fV6fA?Dz*$4^Rc_Yv~It1^qR(k3hG%lTgvz-XgU5&i`y>G7*Zf_bgoggv>T
zVH?w-$((48txkVs5`Q#Q!TQrlI&4DtolyzYreQm0>9@{JS)f20&_FHkebSJ)a3^Vn
zxSH~wNLcMI37)^ej$HSKAR4gcAYllFa*vlcx#M8U89=(O&E+6W@%wrft0wyw=rx5`
zKM7rQ=;vGgl2m5q5oU6;YtA<VD)KuAMV$TLnycM}0nt^}a-DYqF<}bZ_e#8(l-6ZM
zXtsQOLg!rbVJd$05q|A*1zgRRBx^;@f8t}@l4Vq1eKWrFoWeYs?`z0*P)9ezBZW~t
zl-bzRU;~m%x~&9Df#PP+w|$+?<u;m{fAN7ubRDUSw=fDdb~Ud-CC0bbIvvQ%!nM35
zO9OUR9R?2-{%gR>wTXyh`i)VwEEX|6T{->-Ks1dL1YO%!=*5%*<D1Yacy$uZO#E5E
z!ef;IbtG^4AqSr7GDU!uP<&xhr{d#B;yLu;rG+WwPfN({nnBz+zQ(U(a+NjAPu7J{
zhpCH)B9hnc%e^IGCNeE1cypZMO%obqW`;tT=72wBX1u1ds1loEd6kn)so87I6#>su
zj>}FDv4V=Ha9p2u-8M_~M_iKI+$AG81ag`DIi(q}%;~3sP~O3fNIBoq7{cA}zYPa1
ztXt+JyVP>@v8`2Seq9}OIB9Z?+%{rx!{9^=K1iX~ZY(N2`lCuPW+i*m<VRkePTS1y
z@%%-ubRB1Z($jQV=%+r7fgOZu&$1_G+nmgS5B29gVQ3;kGt^(1#(ow)*qV4BHBOHX
zI{}eR(g^{z7@_rs{Ws6n9esHd9WpTxB#~s4_I^OShZWW+Y1z^3u9w`%E39I^O??Aa
z;5b$(g7fZ6`eg5j72}%Q<B1g$p@B%+r=R!sv5*!EZT(%%wSb+Av9z@qn3Au{$VcXa
zlW7(L($p2YEQn`|kdJ;Vq%}}kFjX|w`Z0zn{-Wy?;R|&=T0p`V8<(ZWtEJ4@RBff3
zr;8CpX5Z)sI5+z!H!D5y6@upT-&@JmH+uZ}fP|GBH|&RGy>_sBaeH?OP2|=XLolaX
z%c&$(Gq(a}Zksk2r2ULxJTS)6#BY5x(-&k%r_z75Ugkkx6q}k;dyWl+(M5V`kYaTe
zbr5-4DZk1YS<sXD?yQpXeosk@dJ}TJTKYK&(dew-5YCfXV?Dm?B_TVQgF!siqKe#9
znSn|l#uJ*R>yiGl9)9<h=a>~cV;8k=8{oA;G(Z}lVg>^lO;nT@x`OM;L~)y(@z_PT
zA!<vJe*aw>rE*riNAx=bdUgC-Uq{a;Bco(t4$X65{baFM{*pnS6;Y4b5|m+s9odOJ
z0ad!Vb*qIEd{f%7&=U##GD}BeBNShcd5GzQcj7f2v-W$Ot6x7XA;5Ma4Mqrj5_ZQy
zaQY~y@Nzf~KTbb3RDd`Qnal9WadwUqdwuP*E}qUpa=p7S;|eX!ATl7#o|}v`g<ur<
z-VSFSb?=H;^bXi#q-J7GLiffYQ(R2BdOWZke*UG@2$@!59t>J{6fr@o=_gwkmi`+u
z;RKPXKJ9iE1sou}!!_n}YoIDcb6U@w6894G6k^IvX#^znSY371c<@%i@`50>Pvt&Q
zTqf+`=vo-Ff2<-vTsRH1Gw!cn@3uZ*Gbe4`4f=A@^r2K3CsS>Io%Nxs!z75Br#w>E
zvzYE?f_K&ezkE&+`RUR*`wq|ODAy~4FAb<#_-(@rC~``=&O=wr&{3hmZVoew%JeMi
zh}>Hf3x%I((gb0ueaN_0h~9ZpT8qapKxQzA{~b{NZ-1~%?om~QN9WwAk*^Z(|5F*8
z>OV>}k$!3fMwp1&#jF$*sM>@+X|6iyB=ZczH3ZlZhft@^vg`ql`Oo*oJW)_RDt)+C
zW$oo|W4y6F<J{6@So7oQKpGST3Om^%YFai<*=6;Hq$Rd@I5}|B5^6K0?OKg;Y7D&g
zc9V}g+Q9lal|UeA_^2l>nwKDTBPG>{1&fI;pg}#dz)?~6q@wdVl(&i)1{AH$%vP0M
zUsw$BV^Z7C(<<=QWAajUF#RDf?H6)!(DfKWafvik<P?#;I;|({jFN2`l|AgaNfmZu
z)whiJNXHA|cn<3cd~Mb4v<jnMW<|F&b;aVv>zm$5C+l0ST4g7anv#8b&R6A_pVvt<
z<V;IInLr9u9WlgM4_*uZvkwxXn6p2{wOMyzn-6|hck|!!zfqGoxR5Adu$hV>Sdr~|
zkO}eg15TPa#A18z!3^R~Nxwb|@`uh?Kj0Wa>GE}{j8)WFNvqbGO5oTM`@w=lag+nk
zWb1S7Sip+_WC%oeCGKX2&pw>dlp_)1I&gxk%5&@vK4W&y)k4jgU8FO$dq5$N9uCMW
zUeXebZUQ6*Y<t&{A+Qv!AiLr)>Ao|>`0}7lA0faU-7CBCq5Na#)WV9BLF0eH#j!K|
zFSs~Hb_UM>;lnWzu&{A5|Ih3HrNyzbv#|ePSRBFspB5ME3dytN|HUuaE}_)wbA@Dw
z!O84xb{jRjy&uDU6UU4)AvZZYNuii&dYh1DLo~4yWmCCZ*}MGu`OA;jw|j_(;6Ar{
z`L1>Q`uI#XZf!$W7&XXQ(Bhy`1g3&agiw*s&K^Dp1SKMc3=$X!20p_m!v4hXmQX;7
zCEveS|KQKKbZ-HcXtOAQI5GUlK~r#g3?WboR8h_IRLuhh(ocZ+#xH`ShX)YwFjnaI
zloUV+7ex^Wy5K<2=NX;Il&F22lNSJ^gb~=kYdYW`1Xgut!3!2K2z-PpV&2HrL5g$$
zopz9b%R2k4LnVru6)6hm!H^+JBtg0Xlf>DP)KtMCFpQWDpv(#w^)6QI9~ciH9K`*$
zW|2%FFt~{!{Bp_I$B85X!-G$Nx5FU8k|qfEFjTbQ5vcu>agGHfhG%gl-#8#2#BukZ
zV721E`*NrLJY*!p8vXzj3G(SpVE>0vy<7nCC_FrdC8h+jZ^Qu*NHiA#(H0bk6VD)a
zprbHH0yMvtIFMEq8Bh?<e%(8i1kY%&L;{Jy)*mx4{1QU^CNi|rIA?cp<47=opg$G{
z50)gKyZ&9>l<UZWgvPIb0x?9i6AuRH@iA~~zY$LlpcAW)!vy6leg;|=%!B|jA}0kk
z-~|l8Ct-dk2<)tn@Pt7A)Gw1q2-pQZ1?ET^6M!_rnLnaW;0NB1g^2K=cPaSYjq@i)
zM1?6}kRaL%a2qrb^lwa_u^7wG@cH$KL2v*TO2bDD!13|>?G#bNfC+bf{1*Oo95HZK
z)rHkQWbPCDxmHmgdI$PJRuBLoBZVLDF9FtUheLe3r5S~quA?LHCvt6w;{f_;(tM!&
zUaWtm2aovDLQve>?SOMM*)9T3<Y(%GN(>~J@Gtl^Z}^3J|F!%gnEIu9{B<iiK0bLF
zqJK!f`+Y;Y!C>FjhikO!i8#XLh$prOdFfN3ewrKMjTbZQ-uk^<CM6p0Du{A*`t(h}
z2tpf$jAa@{Oq}I!zF)L)tT(sApxM9>@5kw;2>?R{d5@3p){#(uxD+Iieh7z^-O2S=
zUm7NItOzCzo)`y#;=$X84N6D_OHKs-Dm=0kDfIP=zyOjqaujib63C-NbQs<jgjA=Z
zh7DN$Bg2n`17!UpW=;sCafy%w(%<P1&;;`NK}Z7a59>?B$+UdI9+;3B#uqW;`Vv!U
zEEzcKBj8*(r>B4q$o&ms0>XGiCn<OOgiZ2x{{<~PI%)71bRyi+M}!FA^%J&yAoNHW
zi4guCAy^&#1)o4Y&`;n=S=CS2ih9L|B1V7w2L5$bm!Rj#`!e{}Ab$}33HI-fvuH-Z
zg7#t$5T*+0ObK1FO|NiDA}QlGT!6c_R=jLhQ_i~DX(A)Mh~m~SaVid1$^I}aa_7s_
z2;qIxJGYtvacsecm55C<_k1mh+n6_0;wiWcS-2q@=!a!1-d(fs)`W?6GJ01r-4N8`
zU!|U;y6NEB&gZMEp-@q6eqMV=iFFuBBKa<y#hz!eadJ|63KzOmUA&B5l2Y~l#Bu?L
zvOeWXKkR5ZaaY>Z8!#c;2!|b^WIU|QfrW*``?x%ZouqW8ZN&LV?+VZxs6>-(?cqpF
zc<uxkAVCgVAGUih;KZF+r$)ba$Giyz->XiUDs$Q6^99MiR8(hY)8)edb?$Vq)=F|*
z6NqiCFatsOR}jmLR;k>a2#7iBEILtnGJDK}>4V?j($)39997+4%mocb(<LfW3IrIK
zVXm4k`jN<kk-ffLd`QVbyNXP|ZQLmI+qI5$!0}!`L`|f}=#L|eZj562FHYTedE<+C
z`H)rM+9(mk<$Ks^*&iQu&p~WPrP6G-`8hSXpLP-{ryyjjk*_8pQZX763@d}qk*67n
zC`C1>$565HLfi6IJ!URFDAF>Hh!k8*RjlFNNYe+q5jvYJ=E5aC)g&(e^oL)*slODf
z8oI@Mf&ar}R{89a*D0qWXX}Z{D;^rP%hEwox3c;#-?L9C!9Ss>S<%+u-$A^Oj9Lw-
zG-5X{BAMyTVE&@rgvvGdNNUP2ubJXKsg6Fr&=U=h>2xMDKFyVH)&Cj~2@c?PTltHF
zIZT&!$C)FIl&2|)_qI}_GgwDefWTTtvNPu2fp_6SzVvvuENCJUw+{J+Q`~)B=Ah;3
zciUihv?kfP9`<O>EdRRtNPCZcTi#;<$pP26haS`e!igUVfF3!ZuEW}b)AK*5sprpA
z{~N)95<?1}ogGNw)Tu5qkV(v?9}2;mZ_(fno4+c=$zUE?eiVaB{pQh1Zhv)g%!C;P
zggD_^$+jO8@`9=#dQe%E3sr1#C)XvuIlR3W%`;c7x``ajN9w%gx16AONx?#9Pmrv>
z!PcZxmsX@&`D0T^s?D&T;^4$zQYj{BgPqC;j|U#l6h`p?!*14$?uV77sYbKxqndMx
z#AA__TCll?>*QRk$NGEU!nDth-AiAC{PZ>ng&(y`OtscDJJA~RfWlISf*DA-qdG9p
z@?64d{{2jndSW33Pl~&FaXC<y+(quOAcmk$C!(0LZB54`KT-mOr)9#nEt1MA7bqBc
zyr19Dkb<A1&kBn(J6-1G{HR;&@HF#>uJ5h1+Pnol%yj(}K^qr_nlIge|LB2<z|_!c
zqn@_4kx70OX>uUfZ?fo$@Kco?R@0*&uhjBZ;=(ktOk&^z>${~|<d-3m6A4F0SFYkM
zP86czs4*I?%Rp?~=>qTV{lvY`k|*4Jpz^;a`4H;X#p@q_pPQQVC`?~UdZeb0L}~lS
zpsX&xSn@K@0#8@u;{iMd?^4Ej>_3^#7^OGfjD*>o(R@z(-;a|c2hz(<qV$<)J?c|#
zW@S&*cKL@tEA-ktUQqcrqs$Z<(%LN@u0;gxX9}5BVv)YqgGL8S*2cP5UDj4NG*tTE
zb1u%~+leo7p40_sCw!$3V0P_oC2|y_&qsqkwG!POGurh}+tyFYr9HZN6y&?>%KKe2
z>b`nDS!N?Emz*k$+AAkZ;vdyJSYZL6Cy;+h)5WSd><o%F#m~g|5(+*(#!uW)@7##^
zr+-Tm<X(}MRDezez*x>*IrN7|y|>?K6igmrOOj;%g03!(4GK0K<ViB}x~hGVU5p{C
zJeurBTN@h3BRaJx?g{f*-oQ3l(lL#Z)FDzy2!uNgmJY0q9dE|hL_viIYhXR=It`%6
zuwk~~`|`&A8)F_77WQ?fEt>1Dz6!HwAF7lUd*x)M>x`Q>%k7ZLf(CeWZEADq=>BC;
zXy>Loc3Ev>s4h}gO8FVBfhKL$0J*8ok}W!b)&}mPa`k=IWn^ZNl;Q7_8KvR&7LPST
z{;(B2I6`#wjCX{=(Kj5`eV&p24T`XT*xFf|R3F=aZ6Zr$4%R|t|C*T|3a-G_DwW$*
ztEb7q9*PyIDSd~ly0O1uFK&OSW|Aw2YcfS%Z?5QPA%+N&-9FqcUK>e9GcI2q<l<M?
z>`hUk$2#7**E`5LsCni@zG*ZD{QcLC*+T0Jwt_Sw{QLAS+}ZVbfoz^OQxl(y$V$ai
z>eS;^V9Ql>5oS?8gsv{katYK~aQz4oqSm>+CS|sNM2ildI(Ty{%2@Hht3iT4MCj~L
zkoSR+zh0cRVsSqmbZ!H}D(`*IC=#N&IbJ$~CvTY0>YKb=vD>|&Ty_yJS3S}GJc?y`
zU*8@#YqB^#Z9YH^!l=hhq_cl7Ut)3oWyDpFyT5~^L#7c>XWM^pAlI0?a{W@!lb5<L
z!Tc7Ygj>Fj!Mpi5bn-Fmu3mUJ_~3|&JN@*?wpQ8O5;Y{YC)^owgrM9kXeR4E*+)@%
z!h3&e4G_Mc16V&gb^1|qrgJWLNYYxDR;a%sBgO=5Srqv%P_LZq?&U4f?~o*{Rd2f=
zHT(A3J~tw*sktrJ-3!Ie)-b0ij3r3Sl*l*zn_JAsYhmGd)$oWKl2a^cem|EMGcO%)
z3i9lnfF4|-E|~kI&W<i^@3q~5sd=e0|CE;%Z(2cL*?5g*W1C0`{a0g!N59zLL=vU^
z*hXez2IkPzmr8ezsySN@OSQl$)lf*yYU?<9B`8jS*c4QuG-|6%vAPSN4Q0yS5jLaD
zG+a%F>T;y7`+M+3I3D16GwtP{H~Ak#wm5GcU6e;;1Jd$#>FMl&8SG2Ws=3=`-vX+R
zq_Tx%EUSGjmj6y2B+;v{^^`08_}JF9noelrPeV_BUq;vHV+oF-N6PtHfd4|1W>#<b
z#AZ-5V521Z17=j3{L!EnKlIZyM9%6$XJ3j+wBvvjB|hJqYm{ODQx|;!fV<?jWw`7P
zpX?iDr*tQYGnY6FjTP4({mtjP#HETQJpc0LN=uW+y1NET&rh<pN?|S5UmYfOCVYWL
zw;B=5Q@)-OIlygmQQ|J;p;!p>f)}kk77V>U+DT`L;2Ua?tbKPzWcGy#q^Em(gKMw4
zEr&XT!-)i*<=5qGq}OO}A<)$bM`xY7Ev@7?cS)JbNI9^f?uPe3Q!!6-tR&IXGRnmP
zJ)`I1te`|vHAz)+D|LUi^-YaLj%Q=RQC)elli=AWjnDt2*;^}L!g{fTY;-xF-MfDb
zR0rAPT)+)>HMS+)1Rl@Yz73f#l)AIC;XlzlPd5kM$s5&f=b%QF$D#0-U-?V5i;*;u
zL<x7)qRMIOeW+FcR5NdAbtl@Dw2Svpp9hV1^xE$}$t&%@5U{msC`cXbJ1CiR75N_}
z7nhvBi&)s(AZ<;bBFVy*;7lX4N|<>yGy*>cX4c{C-ESBzw_}M8VbAV#l5T2>RI>Gi
zd6K-70d6S{hl%$mi~ObmR-(bXrqe`#QU4OZxNYDMwgrLg8Q~RFUqx+it`rLsTTfq*
z<?4n)f*9eZa8EX$9t~w-?Okx-w>W$+qv1tjSGdiF3sx(BVw_2V4oyz8-Wqz#DIwW`
z13=A~63H&C-nW&yt_I4C>Q8wAGhA!MDAVL*DFa!sZzB3<b9b8)N_Nd5MH`-LOV7f^
z(fr978uvuOeafTb{mfNKFT@azM$|FyP4{y<+LOfD$mV_hK-{K-E$RK{sMcaUgA(@1
zPP(>6Eseff0Yeni*8S9D?M3v<`F8mPK}}Fo)?wCVnz&eAU#E+Ew?uh#;ZnV3^mc;@
zeY@9DCq3@veP=W%;|n8m&dh3C3dJ62TBE0qCb!je9rfhM+Fj_nsbeII)i!v9X6jE8
zWHU|c7*;ZceDz9i6<t)paxZKe?Q{Cm{)0J3<$cT6Ao7`sv1(EZ;Y1k5lTM;KOQGDp
z(ckZj+cv*+QKh;v$&p*SM)C}MXQEBtdp>ui?X1;Q`=6*wUFwU<=B64<yl67fMjKrv
z{T96Y{&jj~UD5qAGU*cUTUza~KJ0PhTA>{tF0b6c1G(m$N3Jc>4q4fNuDT#<sg&cR
z7hiSC$0hA9>l{u}D;9aazW@e)y|_fv$Df<UfqxS8IEp^oe~5=}kBGnsbMX(&-FtM+
zi@cxTmXgbuI;c0TyKvVLG}?%~?`6lP7sI5BCnaw8S6@PH4tJW_)o)$3Jp83pBRTew
zg!<#CVbbjHOX58L^(6cC)&Qq5ap0zQGrorK`tf$@OE^qpRV}*2n~^+UHs!9W-?+ZT
znf(`$ed`^9#b-eCc4tsqi$7-3eGX<oR74M5Z-i&_!4P)aFoN$0vB4(UcoUlTuFI7w
zWTS_DBUEafIx22y$Ev`liJ$HRo|3f{nhqb&m+p5nzJti9LK6fWNwq7z0kW1OJY6LS
zS@}X<gGexZ<!stU=fO>8i#$zB$GulnQd7sY9c}HVJ`;d`?2Wa%0ed>l5foviJNEno
zit6jEU0X;NxG>DW-0_12YGSI`wko#hVzwJ7((1CdX;vI-(}HPVEPP2xr)OT<Qgv2M
zp`9-pRZl+jU&GXMJf7jjuA&^7%xTs;Q4P8t#8PQ!ynYhe>(O&8*M_|N_eLiChX0M$
zg={QpP8A<NVD>qVd$d0kn{FOr;66$y|CNU9E4jTc2Q7VTr^Ig=eO)@p_HdY)d^qI1
z(1ut*@YpH}d3|5fG<@Z@IbS){>#p%)9qcZ-W&RIi?;I;i^mK_H+qP}nKKJ<CW81cE
z+qP}nwr$&(`+M`gm&uz+=1V%A)b8Ecwf7&DuGO__ZD)pR7%le1|4#o?hCMRRqfCZ3
zw|+{_>PU=aB{4WHOw3C7@Ji(42?z>W=(-0MZ@qUjZ-6Oo+7B=_s5wSYiTyCJ$&aWk
ze6}`+NLjUqOA0lnIZ&l_UA5jmLAp__eh6_Vo`>6e`K-|(9wt6VJ(a;8P$wWtI0czV
z;xBLENmgTIWIFa%ZU;?Hbhvr8eXf2Sxg%-{@zUk-{IV~hWYr}m&bFY@tMuup$wn%Z
zb$}W{WqwqK?f?ZYpP?n?VQWq<a)IQIG?@7Vb)pg;uU@PyA|+4aF(5(Gq+W}yfd6*m
zZ>r<J?x8C3Og35ReaLq^TTk&1XP3P`{?~B%RjG2gHvOD~8?%Z`)G?=-)eKh2w@@U_
z6NxEMGd387KNVM_+F@wdf}eSpKMW<t(wIyo%7OvW3G9sIEb|r6pSGIPM0iOOyhE0h
zS+@5{T$dU4va=Z*n;;+<{;%V|4F0gGin&OObOIHvWY^#ewL(WEwKW7AgWyEMRN9Qr
z-a?kyMpvFnq71TeoYKj+iS!`3o9So8XGZ)=IirnIDmI&gxKRF<OtrvC9ynCj*~dFH
zI>`I7BjaJ?#Hj*;7gCIMo!pknhd2Xi%I(TWw){A{@@W)IuZZxPzF`n|<;51a|CSWx
zLy?YIXg;i1ufl&aU}V+Vg$MV>6+9TCi9t2i^_=Gf3&S_X)@_9VCVm#X4;2x`e7mVq
zHKX(gv0~Q48(cy+U)ZF=^Iq3Tp$Vhc(n8>Sg1rPY-#guURXThfGx2@fhW@K(g4xU6
z%U4b*aQ@yrXM}rJZCU4#9cqOd_!T)@AaY<gGYh?AhNl}+Qu=O|&g`oI*GxuvZ>o}2
zO}nnBY%BAX#=c4Aq~ykO(imSN+h?Q<L}pf|P;;hJFaWVbWw6w+uoKUI8KM<sl{`0f
zoWFLY`;kb3crL9zPpVPtCeXaR+bU412>Ur)>g7cIOl!BxqFT64mZzMqc-;qDQU*e@
z%+0zY*-usew=CO>vi_6e)XCspV%m9^YH<SVJ7p49x22RDk1BJgh22g3spm@BQSA<{
znG6wq95!+^no%bG_z%dcIde*18IZ{`lRKQ@0DdlQHu|Ia3L1iny!g4TgjBeBCUk_6
zfe@t$xE^Q7?!qo_=^T))o0a6_ySVNjD4~}4v<UvurJMZnM%c$MJ=3zv+oY3Tr`8wP
zLZEX%Wazw}Ne7vc#N6Qoqtm=ksBW$#ecIzi_<@8r3*gBZ$B8yS%&sAPqvP$ydalQQ
z4-@ivq_-Kw&!rYKeQQ=U*1=19zUvubmJ@RIEz@BN%Wb!vKcqS4ssio2`o)h=)yj{9
z@NR`qe5e6{OvXO1m^CeTMKX^!-%DSG=w?n8!cMD07Uu6V=es0SOx{aMq`3H`l;Viy
zXVNVtoS*T}5uMVZviPf4U7ocig+arU-*4)H=(;(j1s(9>$IhZ-=4@)UIQ79&H*ODC
ztc=AioW|0v;22KP5_b7z%G!zzcr*yRC5|w140g!5tc@u+={Gfj;qU14MRYNcylG~=
z<Xe+^2rY5H{08h2v;QZko9X`qb+fTC{TH~+M8Ltu#`<5@{|a?;vNLo1x1sJPP$ld&
zG`c9X*A_MZJlY%is<uwFPy`?l$dtVs`K$w!)&q@yS}EOX`2v(GP2Nr>H&a`mzn0yt
z4Jrw?x3-&{yL?Ye78z9sCod*?n4T0-$%)az2n6L-#iRgxdwV8_dwT;#rK<sbR{g%|
zjOWgMvNH&tWqZ9439@<wSMy|`LA(!1*ZBaTZM1%g*nQ*VW8?H={eXK1dkAmv^E;9V
z1fWj-X~0SA08lUTb<AYlMcsj&$U_TIFKQ?JzJRp?Q2?@lfIcbzaP9*aJ#q*L2v7=O
zeHFdV(FlS(T7gA85WvB$U+Q6MeQJy;!MN=0<>h2pv(qV)Tch`oc+fp4e|12Xz8O7o
z^g7PH*FFH$Jlwb0@im5XKn)dyQ~v9W7c>UdJY<YJv$|lvKKav82#zJ3D-bstxVa=%
zpfWDMeBXrRACfwNA1-VFa_rOH^Ph;HYzUxlVhjkN^-WHI{2PQa(mo&qXt1&giu(R7
zJsJRlr7w0wvrDUA40tC%AuE5A*dTr`a3G_hWx&2sz+bFc%p(wcKh8!@VJqL*u^;Z~
zLrN*(Y0~TKt3LTO=9Al>A_7^xxx@O-#$WeFHhE9gvQynYARyM(H{Kx5Eq`rnDEpwm
z<KmwJo(zWHdi4N(03A5EnANQ;fI4D;E3gKG-)x=9ZNRV4NBGA>kewX37dU{(QNq3*
z1n9d%_>xlQIZzls&i?+LoL`qO_JN}#kThWd20zR-B%t9h^3Os{t9x>vE-&&h>^{Fk
z1<x#inBCmoUrgSK$t^sK%OCjf*iYkCCB@~0d6OT<gI;eWq!$|iITbztYIJsXztm9Z
zKJq)Pz3*MgCBL}djJ-E<MLY|Ac!amc)luOOxn4S7?cd5?l|aP1-FBrbeAa)2>JRaQ
z5S%WYyixj@U(@_w#E0L~+g<e^TcqFJ5Tm`87T-4A@BQE3Hh&ic&DUOt*o5FgyyIG{
z-!_oB-{Kz7-}Z(HJx7SG8{h5+hP^|qFkxEjUp}$0MwlU3s~RwW|EeE^kzAAOU1}3(
z|A6JIY{K4M6aZ>+@X_BlyjLir$2S`e{)>Bf^f!C!pUwgn6eHUo&)zn-cK`u$@;q*`
z(ZZ-UH+R6Ctk_61IG0c1egGG?GTtjjkUNfS_P&7~$j8@Us5{^_|6Up2f>i*QM&CF9
zKintw1MesQD{Fl0@7UnPK<qx7clt44z19!xhdVwZS8(dPUSK@yIN$!!q?TU+SvY`C
zexseynY>ujJ9>U{zwIC0IOx8cJ2}oC@h1v$&qrTIJZy&#bg!zLFS$NLA5+b|#^rx!
z!KwGla;FAoat!k03LeXN$G_*R4Fqv>^z;VtT~8Xz{)GQE8VL^8=`WZj_4q=NPjH!$
zw{l5k@1VM}Z6A;MvE51;Rh1(pYkjAw)g&@95#<M4N_{_+Z}YWmeXg2nFsTHeqnmj#
zCzOf2q<PbIBXht~;-blbPM-TJcjSv&dtKP))?Y!|a{9b?R(xn1xD~XPFOYi;;Tv6<
zBIR_wL4B#RsoKDV#nfBbqdHz1=B&#!ja7_mex}PJm23E-9}{!}8I=r_9e%e2Yy0wG
z5yD`3fSxRb!(8&Jfa2<3`a`DrG@Ui7k&c$?NKT1c&IbwlK)Qd15?DHvN&<QSI(slM
z1{)tN4JXDHBx<I5Qy$cQkLn4?ie7mI)Hti2zm5XrODk}k(a&~Q${E1CU_61=&1*YI
z+4|>jdyOPQgH>WrB=fj?XY~Rg#<c7YE3WG2^59g(f%eIOj0HXoZY(@-8DU7e3bxI=
z5Yp7^bB7E}rFvA)3u}2$n(Ohk!24}U7-;ap?wVLwN5Hkr2f!j=@d>_SbV>|g1SdH$
zxBP1r4GFaKmJ`FSZ4Q9I@Wgpf)CK@qXTVg=d7BoViK1tR775jLhk*H<r+LYPC$f?H
zRNJKKpxKF)G3|ysGZ6Bs>Lh3rrI=@JxqSj__qzYMDDC^K6ucQ&ZCQ!Cj?^W@VV9&b
z;sn7bOJGWShv%{h0fSJEfVM!Qt>J?WSrD9{p~Xm)8=dh)!z~W3Cj{QL3Qu97l`~7F
z$Y^y)QiH>nlgD^BXexW*6{S=t?=;EpWZkz(3Hj*4yWjxD@<&*&30#B#?XJ|wl#V#(
zeENjbO<pZ}y{d1Ub4Le<4XjS*4cmhhLQ)%#_)ao=(W4|<dh}#9_fsYWwAEO&ta}g3
z!;=StVO^ldDMNWlrABw7Y$D{ai20Vcxa(R%d31(~ki^JW`DZmiOeBnEqbB>{rZWFQ
z__w)yTS5Pmpyzw_vnZ#@-i2#c25dEq3iahkl6umNn^XUL#-IYT{H}Bj_Ivbf5os|j
zBvhzvhJB7t!n~V3t}qFEtMQTRO}DTrcMU#8_B<R?Jmy28Pg&c303TzFF;iP6IN-kB
zKC2;8&|i1+c*qjUV96E-@6|Z-IY_8h{{An^2jcDvcQ#osOHun%iu{s*#hsKh{E|bg
zk;WUPgbSXt8(RJO%fPnIwOlX^9?5;i(u)+Pw8SD%x)xRo&Rr~imE#x}X9KvvS5Hx+
zZEJ1D?I^8>Oh}@fBgQQkgf(b278>CtP27u)&y~`x`Ku+<Y=X1dYD00OI8~TYuI70N
zQiMHHjDQ*NPn7)QazWsmFI`uMc@0B8v#zaW3t?zm$Q+T3Cy;k;<GS1oTv0c*KJjgO
z?A6bC2{joM{HhdhCcv55+JlD)EYpcy09{f~60+{bySx%_3K$pl#n4t8g0tKCvnMkt
zc;oGk6kYy09fBSK1j~Ex23QUOj~{bLptW}33FcBgbDV=%7o|$lZz?PF1?yyxJO9ld
z#UfXxT(!_Z^bpt!?)P3~-Fhs|QQ{LHwzn6jbd<y?CZ3Kzd$>LvuADCha(4XnOQUoR
zZ<%#=FbKRZ&W8pU5uU{XMPuUdOM|bYLm-P_41Q7;7oYpFwm?oVA8nD>ioVJa2(F-6
zJ_zoY@)#ps*4+4upxO|{2Q5={CC9huI4ZB?=SY>RkLf170g=;6Qr?S<B(5u881zqz
zG7!x2`2|)$r3b~r(o6@KCXJnEXR{cF<M~npjo9v4a!&OQ4Ib-tn17kF2%Nfr2T=`*
zVJttuBO9XZjavN!iKofW%_iez#VsqZhvhhZpu&wdpp>tl-i)c`#(V3*CGeIO^$gaY
zYgb2_w35civ7q7j|2|*%HDdbaC=#xP<|Z1qWu)WDK(ajcl#lo7h_kE8LyXj1@E&vY
zaI8kt^57QOwM_^yVuWVbS|ceG!1edaV=mI8<)kZibqyWOJxuqD#lH^aL7g<BjT3f@
zVmU{v4PjVNpQ*u#+hU#{!V`AmNxPf*GSxeXEV(w)oVjbhJrVC1t2maGRcmQmQXQ&4
z{9IxzLq&dRacfgZiO?EPjEOPDXkaN~gFHCek4dBgvfry6%uFZJ1g9G0O&tU~d9Hbg
zcA{`vIqn+j0B{}T5F<*juR=@ghA<jl-HC+cf8qFqj3!*y38Ye=jNI*szE`)ViO+<F
z-jOK!_o@-;G0SkUdpC4Gl^Z?BZS0U3g!rbiZyidtu7={L@PdTNR?RL#fQ&cv_PHX=
zI!e&9!Fm++U_b!|In%4kXpft47*Gs`9#uz~#8oIoZMB{Q=x9-E!oK$6<XAJt{p+jM
z!aesUhElaKGfw3Phsa>Wr=@UVydmyh=o(gv5`(-wZH1a2&EOO5UYCT|MFwJ?My^T3
za+|wrRG&7sS9-eciP-N7Gr`B-ouQm+3d&pPSR=h5GXI9={EEo0ZxnUicYLXy7=IVq
zMEwq_J00uBRYh5qfT*GYY{S%+7EZ6{qznA;7*5ucMbfjvp)f<DDR8)Vup{-V+ZtWL
zG}Blv-+@X)J36RX;L*$@Rk*|)`5nn5Kyn~nQj++L>vP~*1ukbK*r}VN9wvo7^kU(m
zxq|5ixDOyP)o41>wc>+6Nv3)5*BsyIav5ty1t{7bCMgjn7W;b?G6I2qa`50~d-@IN
zq0<n&g&cZIzWPM5jtp=GD3^x@d|eT|b9OD0|8WfA?{(3!_|XY^mDOGk`f0CcNWnSo
zXM~adZe{0ubF^Q-OePS4%B6v-Zs?h9$O_7CT)<e_RBaF)W*B6R*V;`b)L~H?Vs2UX
zy~phuhm?PU-~+*!)N^;O3|RfnJIzIg#QfV+<n7+D#|1^Z6~l9why_SZpgj;GQT(0v
zpWYCq7S$VQu+R+dqUOAOBSi3ozm8q>)<l+w6kEV6ik-b$aA1iOv#OkopS?h}xn^NP
z;KdO$MdRN(iTWURvQFO@S*HUu(ei7lc>$R3Eb9o-V^sr|n+TqcLSa=XM|)v>?cISC
z!_%XX!MBAjC63FD%(1O=6*>meZ*->86DE!YDNK3x@~!nb0ok!UpvP*vAD`EbD!OdD
z$bqZI*cq)mgtG-HXY}sQp-g|EA?EH;@zGJXE5d*Rp14t;;U6EgYx){1sZWUu>iX$r
zsd0POwR}|nz{;@~qxBZ2a}lw%1toV~7v_krOgRaBDg2OB#)A_CI_|gHkFl{Wpr&XC
z{PmpXY#q{8+&PZ7)BOu0x$QwQ)b!Ss3}X2tbiuJu>wY}!)N)#jEhkP+8?DwUcJtx^
zUZ4_0x7OkuSsy)Yqih~D$`&58YNWoBG<@)6FGBBg%`;H*okEdlgSy8tzhpUBpo46>
zEF=4Vl*LX_a|YZT6mRc55DG{gUpZ*0*iO#NM8qMSZGE337y(bsXfo)8+DCFFhaE`@
zbbSV<BQo$K2b<}AwTpFK6lLTY$pKM5UjATMppSUA1P(*gbl!3^Id6^@ws0eix57eS
zMfI6kKamxOcFCd$$&cKf?B$-IA5NXWqQMFT7pTY2>_)_kRL>6?+Sb_=-p=XNP8ust
z5Il{6&I37Y$cS_D*6h<L>|0?#`{8XUh$BwS@E|a?TB%n5_Zlo$Jc}3Rcd9ny`FiCo
zbO?Ube33k8WZY8j+4V>r^x@>QpkbNHJ4|9%H~{J3Snj!npIagMpn^*EF=n6po2nR&
zReYuaXEWo;(eNJ5;JyCgi-TQ84327BY(1_-ic-{(InXi*H|kAKYSd4-t$lA{q~vvE
zGnb)rL;6!TM`V%NIV{pw{fPTv^qiQ*3Nzd(Gw(SyE%?*NPu_?PKVwI5HxgHErJgDr
zoVs-cS7&HPG4Ll%(7{0qXz=MJE_rDdUq|`i0=pr>0YGpt6*0P`udKY!x~7C$4)ODf
zz0592GQ=z<v?My^RcJ2`3Qm?d+y04<PX6B6N6e|(T*E~oz^E3el%LRZB}wskGna$X
zgCH|M<Lm2A(n$#_Y7);@e*V%}gjBNj;DT>b;6tTbkqWS7tgX>w{>d?cWeCmAZJMM}
z_n$;x>_*e?GP^q-n(c;_E6Dlq+!8ghNA)~=A-sR-WY7+cb_T}#Qjc_xw$<tT8U`dK
z9cA6N<WC&_DasI7Q3b5~w$d^d#cHufu28s8NDhuRnYoGCOv>Gi@di_GKW?OrXqipZ
z@L}cFa?PCO&&$2B`+c-z4KOd%277#kC$XU*Hk|-|xH>r1t5Y;I&iI|Fp0soWth0v1
zFyGVQHR<YErvRh#F9#Wj0Z}UDt-21pP3QD*6Z6Z@<iW&71I+>#a@U<>ZcL!0dgNaa
zgZ09MHjtcGKpN2FTR2fD_uHCt$CS({mm>Z#Q8j^3m9MRxXUncK?#^jNgHn%mkUeqJ
zNwc*dII(ZWc@-2CO-!sma9JtOJFsN$3(==aiGk;jfry<;5@~dZ&rJ!?I=OOmUwcGe
zEqMiEN6FNDZuC+niTn}6AtfcMJN&G|<y1;r3uO86_W|`^h2HD_Gy2N2<tMYe`#XLp
zgnGGLq^2ZWfyC1FsX0Q1W1xr@lqjd_`wr%RH^hCI+7BBs;BXn?#Gr4zXj^s^3tX2O
zR^Ke*s|K!}DDP3N{2~NZZ=;%vvvSLmzM>8@HGvMxo*<<g29?K<BnHPfEsgXPEGI+i
z-$nT?=zW!TXf__)ud*61OH@#V&qsy6=SRTB%JteE77)}RF+LY5bZv-Z<k)XxgXIb^
zjUrLkosogdTs5_~&9K?@xl#J*v(_;9NjFxsk4fM<(w7kaMue27_GTZPK#56t8f$ia
zqlOY0*iKC9I`>B@lbQQYgwdXh29JQVmYd!Nn^v|K-zc#c%VRG_7j;l~B+HkJ$gjEn
z1$X4Or|(3Oy91}2tbC9;We+t1qFt5=IcDVN7Y^RxtWa)YVNc5F`cto!M5=03cWE8M
z>fwaHm6}PAvSvt|_JHDkcho3$U+B2u#XRaL8|6&P<}^4z8{r$R73#QWla^6(4;jwm
zYWQ*HG=QeBWR<dDOUnD^<y_m@69ZS=_TUutvW?)*erFtbY9&BZlrknhzv5w`Dt>VE
zDH#yzl1<-9N8VyG6H_R0C`S$E^X5(&aTP3kkM3ljxK4MYbNrb(tI4-L(tlpZOA<4O
zMM9zuw(sBHxgIQXYo4%ZS^4~t<I3HNBPjfySA1Sk%NTBZ7l6R0J+%H9+{|d>Rw30z
zzsQ=WoqCmg+5-0l$rlT6sCq9vW3jSAsyFldCxXEi>w`3g3<y<sy6?^gnXt}XT&opR
z;skVDT+$<!7M!-U!Q6n*vM&R1IO1;@ll>_h*_jw<w6>=wFZe*1{U*arVGcC0FWP}q
zIQpdeD@j}q9W^da|6sqYXU67m4w?7REKP)zjRybZ)NZvXV`K&s%1BP;apEXyE;aB@
zbd*_~9RI2DQWe3Rc7cOJco{Ib2?+?ifrPZG(^|W0=xc`E%wylpXAi#VZ(6g=iJi<x
z@ObrESo!n2i8E0|ombOn9gKa+@}Z_v*L7rqJh4Y35K1WcBz&dPSHsy+ly%*#GFT?p
z{$DE2>qvfYFr{c{;lD4$ruGzZTGGUSZndRLg|6=yJ_no{tFa>S6LvXxYi|%>PyiAg
zEp*Bx@T?d7U(jmL>j&?}a&;CIoY5Q1jw$%}BhuoOv^!VF0Zqe6bl}a1?rr-YzmR1N
z0_=FVne32K&tpK$pJxfKvj+1?TQJpbICyiTx|eR594nH@1_W?niV_{>+(wk0qQVdM
zGX?3X86@Gyv1ChMUALUxFHMfap`W(=hguy=rQN2gK8$tQ)uvXZwrCw9uC+`SqxCTO
zgXJm4WKto&t}oFfqj$u+lBtQSxOSF=bsoul%1aD3svuMA++;@|_BXW-q865~X50hE
zs;P6dX+v?_;kbUT=)@ALeW_H^Qm9bGGDchTqzk!`+P)7acI%y0sWt)(*JjiOk_y<F
zr%7l{X5pwzJ81D}dIa>?vsa`eID0j60HS_VGK20&ABHx7xGK8a60p{Z)6;iArUF^(
z#A|L|Z<-0S+N-MQtY|7Zd*Vv|DloIDL%}ihz8@%VyD5tVmL>-im;=16?<;SGXr6Ih
z&z=v<xy926@;_cKqDKN$@Eo)rE3lkoYkHksm_78h;4k6}*?ktRw*+mn@(VE8bR>kI
zC}M`6q+K%Ci=C5y%0Ed5GZ-WgQ@NE3qh2SoXeKD1P#o4)EmgS`$)@s~4;3fWwSX(L
z{G(~%UUfrn*dh+!@l$VQPp*1-hYFzzYA5{5{qAw7%a)9Vg5N}=0UfCOoWjI_VB64l
zr@7^pWw2!|ZZ@J^?oxDS*}Aq*IqL~Lwfi!mz6}WPs-#m(p{!d@pXy)hD0)AeNy!u<
zP|Hn(?dV=gD5ZPjz%s+1-qD>U!9-8V?Kbz-gF{&8y?Q`N#<;Torag5<)f6AQeS!r}
z-sNS5dzlj&UiW1rfQ_U5bz*e~uJC9*j<X>J;*kk8X38lE+97!%7Oh%vljnntowWEX
z__`pD-kXE=?Js4aG_~D6pV$e@TW?t$c2}CyQ%HwBZ9ny6b~~b+_LM^&#lS5TRWmQQ
z7M+aIN=bY{L~$^Fy~WNkE;2JHgbIHdUSO|C?af2@%rI+y)^Ii%Ctri*$dvMt-ST7~
zAX!?6thOa~Js10`T2;+d*?$}yg!nEuU}Pm(pTw{=7*G50Y9x}}`<8wLR>cU|36VfV
zIi86Y@6kEtcADX8vVqh|T&_7W@HiD|*JihC9b0-RWD}{qZcY}2L%WkRFG7x8sA}an
zhp4sz?p+De!#iuw*<{#>Kbfp{ZUi1~>;dJHw)hsl%NExrt%Y6gE>)1t#F)3<1`Dly
zwDxvi9U^_$0Sihr&px}4ap@pKDXM{WJfxeL3m$v1rp%T^j7Fu|{=GJ?X!!PGvA`VZ
zbxYItK<B#P#uw{$2Uy7N%jPq5+1ByC9N#{@N2flD=sELd;h2=Qd*x~L@6$cC#u$m*
zy)J_7fvDHWcUM|!nf34T#Z>_8+?D8GAeUhM5TZp+&k2lvZCoEwVh@W-W2<PtpJay6
z$rur>LC|AO(Ria>+-DBrJb<1%k<u6j%XX%<sWr=O`q_A%+QgDoHv=dC{uGMMOM;R2
zIiv^6KiWsg%H)Lo{l$wg6Lftu0R90^8VK`}=gZQE?sf?Bt=z=b;yW!pC^+`Kk9(&Z
zyDwf)>Po#r!*l|Qo9sn5E{LamHhg3XV=J}DK}1G0ib@ZK$+-Gz8@Vr+CUwNwC4)Ge
zVC^d88<dOync33{3R)g8kq)u+lwh}>?)zi<vFB+WDD`h5<0QkA?q-DeP#G5Yfmcs#
z+h`q2YG0tq{vMM*mZtislsza?{eO~&3~tj_84a!PKyG;mxISWZ3U5^B<Sw#EtSXq(
z`eeZSnYyBL#Hvd%V=zzrJ~RwMMe-vk6hE0fT9@c(bGZ*;sB*YQ?fMLAJI8?A$_#W6
zW}($Exzo~Yj@Q?&)MfojR#UOOZ`RG-=FBG5tvw4~7YmCwWok48MjaIog9X0enH&&r
zpkno#K2*IvI-3Fxn<3M`X#@&V!sCLo@NkVR_^=xAC?T>)IGhQ+vUuhh=aXg-_o+_C
zK%wECMM#6tqIpTr*19DEJ-B9*xgOXYO#ku55{I~;^4H5FyhkDIj*l9)+1}xN;#F7q
zbi1`BWyz1~`)rIu7bh{eyY<TT$Q(;RaJCb%>a(jZ>WvL3R|fd`nRz+dco{3CofGTQ
z@JZWq3KJ!#amNVX^0Bt7GgyG?3oa9~71Yy`TEZ*7FUSS3T$){x#hfGp`ib#~cz}px
zZZl(9Edso|E>Kr5y~h*H-SgG0ex&`TSf;^MYJ<A=v@sATdFYwtXx9jNekT4gJ&YMr
zo@zv~>>Us<oA8}8<|e3*{UNu3iVc#xx#XUnSZ;p|C|5)NCW1n7ZL?r>cQ@j|=142W
z-HZr$l~5u@bcmK-32O4hPK5y=(nDK#O+PW8pr_4jOeLH9RuiRhKTl;Kit4x(s))<w
zA?yNJY-1xVMdDz}a8*$7KI*ifu|xi4iu~8YKC697`^NI}UPYvv5VqS-)Iypp<HGbw
zssnFJ-k%t<NH<Cwa$5NBtAA?~p5eT#7#q;n^}>bRdAPt_oaJNyCv23W;`$$LvyGNe
z98Fv<Oi;0B^cIbUaqNUZBx$3vG7t9iYU$}UtQWh`G?bX0w$ybrvT)NF>E4v_x}&mw
z`E3iv-u#h`abR6H#R=9&?@zJykbnQf#+upyL{jYt6Q2H7r-7qX#bhjd{}kUd1rtag
zh^ALk`d>t24_31PcGg)~6h5q<fW-_YxL$caCm{fe#1pXYy7!A2PB<d>c^+!atkm>_
z?hFJ7IB&+Qi#3oT9&T34@iV>vQ61?JNu;;fInk8(BICJAytY|QD-MBEBe06`Xjk^_
z-fXKJ+Ty0wJCqpf-J&$1DVF`dd$1ad!x_`ECFO1<h}mzmWGXe!o3Ttlq8nPsY1W-|
z$<VQT{N`0Sre?-(-+imu?#a`6og<NbPztjZy;{UaA#G%P;M$kfNNFz(4b{yv{+cXi
zCWa=ISOnZS66L;Yrjiq#PNWYzjvfoIspZN&r@-%K$<l>xtNB7u8p`8W3vFL8>JO+I
z$NL07zm;_l0DH2ZN7m<)knD<prZudWix~B~ky%gelK<v6y8vniHSbPHTJ#E;GL7EF
zkO|R9Raga$gy{8-m!|#7Fwxw+!y1SD8L$SD_2j~~<c|IetllPvFHoXx$dzTG;tb<U
z;vm*z9m>EAdQ!;$6*1t-jJ~~04y_m?gj?~MEfo6U46r`-byKuD(A?15b_d-KJgIiF
zM%L-K()~b6f@Xjk!|_bO3gWDwB=S@@>;S_jJ_s&$@1t=coH3wmbmEz%Z=RV(eW^6B
zN(DA^IovJ~A+q6@;JMA~g(f`=WKlUX(?wnYxjO&3r4s3yu}W-^EWix6NmUR8GZDOk
z&*d$Lol^3tTQFNRc2jyrVq?kOI|pM|Y{nvBDuQMr^2>2b{%sN*30SSS?B*nIRW4SH
zO$b@j9*3T{O_@xcRfc4xOyS@W*t1Xw3;f!`F7c11vpl{pc$5-~HWvgI2!CD2qBe6L
zqIZD0z|k*lKEKw;M}BoY=klDNs%cFFN=j<&;L7dXfI85bdD%1z$1lTU9TmA`NGX0K
z2!&&hNk=BA&~w@dP94SZBXDNrs1R+6)rkeAVyV6C;T}<5HOcg6M6N-;Q#vMHRPxXe
zqxjqEO>$bOIVff<5IxIni>YBpFp{|(WaL8Z7w#{A<~1p70)YNNen9(jM*w+jzkM>^
z$q}#ahNeuE-=KU4ha61J#;aYl#>*JsNWuMGikhz0(?~VJ6KeE#aQ;+2Co@?EX1s#9
z_3^<gyagA2Hl0OMnx3wsYNz{pMEsCq@guc@Dh`;}q1K@^x0-pMv??cw)d*}&(0&aq
ziWA#k?uK^?`+25QNMeAl+4#rp)_HVXW;MH%{N@`!YRd&T>rQg%gB@5iv@Y9uM{Jp!
z^Wlc>)Zw&X@=8AQNNP8*p5k35nmVBmX<<~9a&QQp+$sEf6bmwU`k{{08q{B6tVp&}
z@@SP?r7Ho@M9dmm`NqM<Fe=KGA-OQFdc1FU5XhD~PZYX+34fMvu^+toFR?@anL2EN
zla#cLr|shTl>2Q0xXNm=d3xJ!(p{-H@vQ5fWdBaDj?lC1ADeniYgKfj=A#&j!V~p)
zOBj2!eE=2QZm|N@cbnDdAj$5==nty2Q6GgTYO-AB?I|z*iJ!9&V^JNC$(HKklSPqH
zIQiTe6lccdlLiQ`0}GtoLLM9ylKb&YOQG(RT=}r@8a<M$xNQ@R24qlT`(_Mr`B@VI
z(4fN{kx>)8@gvgE5Di6OfF{jX(R@886HYioEN2EiKMmmJ+jg-UZaM{R|L0Wzjc@bE
zs?r+KuM<O2!UNE4bqcEP^NuR<A<u>yzsc{U%4s|d<Ox8De%K(@=|joFUSpe$x^#Fg
zFH#L2NNB;}$CELx0+z_fxa;z?AXxKNH1Lz)mV%yr%l3Y(5rb7ly3K&?;+DsW73G-m
z(vlarSL=_%WVg7MuthwkS!dWI+*QQV6U3;ht99>u1+L4znXTRdp<Y)*Ov?4fJQKlp
zXD+vPOi;BQM&^8CK}*$5^P~Cm6iUd3oNQbvalOSgb7d5GCrlZ`^V6bB_Q8+)%e{(J
zbtUS^-l;X8#xT0YEaS~j;I#KB52YW+bwyeiR@No!9#2mutA;ZQ4yd#OE3u0bO$Hm?
zb!xjcz5N5ezs%oDK$U`%Loas@ba8&LpIf+ACYY{9+2G9@IUweUuhiW>r{Gu_aWVcQ
zIXE9`BX1PG4c}@|!oFyg%7eAY8#rils0lT@bFsH`*nw#|#QE|DN+g@P^GHcV(MJbw
zEV&oJWPAa%=X0el`f13Dp;a8jEDRRivw=xXK+mQ0{k8t&LijfZ&3O(n?FCIMyd+wk
z--IdImY{YiwN8_Fpiki4u1o6jFa1?nsRRN!4+*>pzj%=agmw!dv%BT{!#EayT1++5
zY#gZbzc&BDO6sQV#ot4r;9l*oK)J8Ajl$TwX<_NdiC<T^FWU?K5fBC<kDbp+V7f8S
z2)`Hv*`>l(+P%=Lc?po=w*pYoxd`DUwws=AF1bhqwaaqtgy(>sdl|oMK_5M>78*j~
z+60?=kLB+lFMRr%$3_hkX3zA1Aw>@hML^G?D=!3qs53xSEk|vJBK{I_wuuMPAzs*G
z6E@v>_d#8%o0qm#_7Fllk8s2iPM;p-w4G&Pvbw>1R$l2uq7^E>a5Zrtd-=(`+%MXt
zPX(V7DPrcDF)6MAJ*ElcJtlmB?AwNRV=^$;!M%_=qjanIgno-yft@}NLDc$NMH#5j
zXIw;YSJ^bM)G6M93rVWh&L`h6;00nXmQjWn9+NY0y6!j^_qeec+T||%-*}N%RV~!o
zp;t50F7oBWKGSg)J{991m_{vD!Gxaic?QSNQysMlwc^qx2{L3YWU^KZmRigXaBqn#
zc1|Dn>GZEp#Ds8#6o_46ko#%$!TinUi%IYnQn3NgW&6c+Oe9h>DU&tSE{07N-3DqN
zVT@nSZ0&!xg%#Y;Y5?Lj9o<qA135mtPC9jHg?F(G#8e`i_;lB#G$U`TG3rOfKhVp*
ziVo?KZJ-+0u1Z)5DI43B>}d3kSGQph8#hEwzv3r}q8WzDKphgMHVg}(6JtRMzZmXP
zi>_?v+1i;MaRIWj(Vu*l4h|Bhl8rVT09C2vD(ZZ)Aid_B5sp+Nk}6v4aQHw=D3v!g
z^bw{^nEo8(7CkpU&|{P&>GTz&e4|J=s}<Z2gbt#x?0Iwa=Ddb+_s(MhpQ=2SqE_1$
zuUj=psc*sNkFitBT{rhEFU?Xu?#3D)C<uRAyj4pjHKV%K<r^U5@vJ0KBp`91P-Uqe
z(Z04vkDOUZ)LT77<_n4gJlrFK%Xv>yecQDdQR9@xYkJz0zg0t5Q)(KM@K&)mf<yu*
zH5D}d(Yf;l;A*;I{NF3k7+Kl=mkKl`cROPOdN~7&zfRUr^s)qu3=IF_Q9C#~5pb|`
z{8tqk0W&+pf171}t!eFuED85>qsxfD-ZAj~<I>!$42dvC8$<&sMKB6JikYB}BUd*{
zb5+YP$=l*NlJ2Kl)>*khweaLrNy=*>S)C&t#E3Z?WS<Umr#luk6?B{)OitbCCr5?6
z)&EO|3}se59Td{@{0tu#GKVZ{qzKfVn7$-%=tO2eLud>5n<)*Qj+u>VbZ%wB8RwbI
zsn0w&2pxA|d=h;PY1;^(2*YqNHXSGu1KS{^GXQLhsYhD1Ab}*nDMNym49<zy+>aUf
zAT8%Wa1YRzH&f;Xfe8~3vSpOu=O_R;MhgCn3NDQ!(S(*B+%pda#^WR)2WeLH+z@&+
z1KbUOMDH(xF;v9_0L2s691<glluOCfdX%1!7YefU2W$@#I{AUFQJ~WMET1(wp2LvY
zSfA9&-vNnr2#zj9`!C*#Uqw0;AUDxsR#K{-Eg;LE{C)dBrW@+ZiBK@mX8It~`u2rM
zz?pu6MGte397s%-f-y@xj#<DIb^d?B2rR;J^&nR4`u9<;a_sXOT+&~mN`=sZ{3+EC
zl7?d@fNt7?s^RdgL%B!WMLNN@Oi-Xzz-);p0}>&a@H}$lg<gt+Q3vus=NkKl_0Ya#
zCA7!|kpUm_VAmY?4Dh@`qW$oyIPOHiRnJ88(&VA4r~tF%H7@ZMFhco&_$Ls_VR=PJ
za3qxa3F-CnK|NrsV&>L>IP&#v^(f&m{pp~Anm|L5j?%QA@vhKS!3!Pac`<!|*jK&O
zVoH~d*s3PR<+^iyXVxS~a#Bi-NAOJHgT5#~k5hL7(E~5A!Y3p7AM~BUvn>|3lTzK;
zm-pK;l2Qp8C`PxHJ{t{`Pz{Y<6NVC6R{ybK`L1=GAD&MNaJ;eAWPYf6F;NZ;yn?AC
z&YjTQU)Ro8H+c+411q~m@sbaz@KyiT^@d76SB&Z$FFLScp8TC4WO*X$r2+f5^i|fN
zA7lx={cZEv=UoqY7Fi!qtAE++$RQF&&fh-)@mJpPOX^T1?|7T^<f-o@4M(>MH+2&;
z-Pho-<)Sa+&N#P*K^ohwI>7VeR|Q05vyu1WddbUsy1iUc(}9;29oavL^%iA9zZGRQ
zrs&@VMy-htEm?44@bnRt23m|v3e_uzS2&Fn6%#W%J(GRYS+IVz*t24V!7t!?R0*yC
zh$@Nr03y1sgtd9dqu>%%dyVzA<NJpA3*cOId;pp*Jd~m2oO>bPZeDTqi(gX9EvlY{
z1jsGyPz}c)*vWaX7M4$xdqYUrflieK(<ubkCIo+tAoZl>)1q4hF^`}o`dTA7@!6s|
zPe0NeFXJBbYlFYz3DJjSv+1H6Oenax>QoM5aV5BXTQ>TX*<ml+&F`%FVX;5VO@AaE
zQE=xp2~xDGh~PE}M;h!e$E@;n2ZA`7l@z7|Qzqg)138_GqpOWJRR#iFrKr<!HOp%@
zRb)~^7HpVvvdF8J7<@DbgYZ)%T4oRw%TW7-tRU6KssY(?eIR`e(<<TUTb$kWeb)TD
zBe6sy>LS*w1J(c32dvx1y0^m7s7}aqaoC0`R{U~;r`VvDtfQ4|^D(-2fYv(hc)O<X
zu?szkmh3}C^G}kujlF6!q2;C)E~NDgze;+yrE9LIvT6^=K@}bM;4>Bb9eCer*}<`%
zw(mE<qw@e7ldUNNr_cBGaTozqPgFhksX4+%H75$_bH-3pf4ntFQ(!pcMGvWJ6ZE?!
z85Ug>`g1gd{y{;bo)1NO*#cjOr{DrXxd8cgGyE*EDQ2Ie@{d3qjad<NhH2A_&W$x|
zt1yA%m|X=6cR|F_J)E;M!rPQU3NHChQWV@>wx%V?2K8_0x6Wi+rfpG33F)cW<Uq>j
z251F<WoMFdL_67==!1lur(|h(sw-{N7=Xo71!<BzLS7Y}sgGv!cV>N+5T|`(xpCn#
z3U{{%S@s!}=xf_yzu??Uy=p}+hc|0yXw@xiE{b}@s`xVv`*cyQF(m>}FGu^9Lxdk)
z?H{np`Gh1{tq65yh=1DiDqh0FF=BKSAxM157Q+#tCVqcT60I3!B6XO;v(nFtV8VM*
z5Kveqmcd~lsKe0Z<1p74nZq2!{}2$jl62ujt89k~DH$vw5+T7+9JOL}p)8QG6fVuG
zu<VVUi1;#&z><O0KSqi!*FZd-z@=zrfl65gq`M&M7?*C4t07GwbojM<{p%XZO?i*|
zz03dlm6uF|n|6(6vhZ|_7GAminS(YNAS(9xW4zm+l+h`E`jA2ldH=w9Qogn$Np;U|
zEP}a6*_@N$WmRqvrA}(XS3pq42s=q4`4_vmeXoCm4Nr|JrxM6fZ%Sr>7=28O0NkN4
zp9ktGJ~sGq#qbYWf+I<M7MzQ88QaiCG|Dm@`fyP>Yc@!TQrsLEzG!&|NgxW{Gmw#K
zW*SY&^|Fi2_mi|$j*tEKgG3(7kL%hG`d|Mqu|C6X+zSf;?N!JpRQyTN<8lxsC0#wz
zQ`D3PtO_R>7$@yo;E(iE2Bf@!z>h5IBg1)gTGYiXD2M{!+MvPpLU#37l#q&efuCbi
z3%xM(nT?RrVHeEt3<JPOWePf@E_MX*2rTRJv%9i#7q#R3pNIjOz*I3V3IPH=!G=dQ
zN<w%!RqPrHIGT@t9fEBbo$jduTM^b{TZTUof7m!EqQ=&!!h~pE?^^;}X%^QDuBEp?
zOXnS$7CPT~w9@AYgv^v<XWa{}qtKg&Byc~asAOij@+CNEJYFr|c&(=y=c5qfN{7&L
ziB-Co-Z*8YRzZVbTyZW{;9JBkHkc71@?YIV>u2V6G`p<DfTnWy3RV&cDGLKMp`?TN
zs?-KNzn%?g)%HxW>#;R2Q$2$n6fKLwVBQ1>N|JVsx>CzVeh$nGSAkpXNp7I3HRnd$
zt>xiislB?TCfm*O*GkbG%jEtXxFwbnt&_LL6?NHs>jlv_x_Nl*JMJaG&3!a<Nn=hv
z>8Kt>>Kqb11=35Je{@_X1mzkG1=8unBZx{%u1Itc>B|#q<Mu(yLhZWgGdWHlZe(<7
z?3h~okY)U}Ye%p>G2KNn>r744dv*}{*4BzqLU=+7cpHXozjZ(%?UmE1+s~{XeRtxZ
zw5fDJ+I7N(wb45{e{?OC)A>G}kM!=>_hM<wFyTVFTC{8lMKFXXRTqP38vn%G%!IqA
z#nz(tyqe#8QP<JZ9xQC-4N<ha$?qE<v|ykL@jR?l$N~IJr0RXg?X|wBZ}dR)i5S4s
zh9`T|xB}!hqF?vZu9He>q*kdz?9?|@Y0z|uw0#kK52bn`Ys-*XOH#gK{`~l>^qvPG
zsCfBwyvt5|_jGmLPpGjcJ=Q6shmrxnKcc8FP6m-pwr2Qwh3Gi|*N5?IFuM-z0wU%<
zEW1XTZXz*~Uwj4pDepD2{!cMSeuhl1-m-2TAG$L65QjEZF5;n~McJ8m+)?FQy#aIW
zTJELTn!7XRdgm&;+wB3y>h-8<(z^(36ZDHo0^7@;G<9T=rx{m{27J^d^tee1rc}hD
zZG5i*15ONmSQ$B97kqxdlU**>2ULU}t`nhLRKV;P)>i)2eNZ_6v@GjN1hw@mBKqMR
zg^hK6>fDT>JA^iybq}j2<q`iDH#<kP4R@w?2&blrJHS$gd@HOrT%soM3?u8_C>No<
z6L9)|Pc^Hv|4@`X2O2^mtdlIS`C+l~`>@c}6W~laRoH@Wmk_T-unB?*o9lk)>M8AE
z@$XAjd|}Kb&2z^0%+68_H;wo)#ztnQU_$GITw{OOv2I9VKP(yJmny@@>L1fpUEA76
zM&ssKXB}+xxD~YV>l#DAEC|Axz+>c37V65c2Lq9y$506=xyePNj9nCkQ}Z885V=Tt
zS5ui6^iS&Cr0HmFYIi)|-{*g&`|K@)3dNb86-nIds;k|#Ms_UcKo-dB8j?>(^P7dK
zwutIyW0d+g^%FN>={F)FKOSuy+^IPj+cht(A(h+iUOpFm0;;(EHOWEv_&M3%KiFxP
zN7kp5P+*0^C^tNIVHw5!eIA*lv^?IO2`hR7bS4P2sMsgNWqrl?Xx|t#_+rMK`T7^b
z{gsk@er6H-(c~&u+bD<YPCk6>u+2I){F}ZXSDcs?)UDWc$SM|UHT}`{=q?v<SOd#L
zjVc!W+&jMBP9ScwosqDOV}Ks2rM11KYhlZzDe>$GfQiYClQqc)KAtXj2EVvKJl8y3
z0J#IHP;dzAAUO!IZf|XV<i%SzXI#>7)w>CXmr>oo#4!J=T1x}(NwK9vMHy+x2G?b-
zREN))Lg{ia7h~fTDOAV;_eZ-5%*s9)@j`Za-YI^E25aDQPV&(Q%^DqVT|g9CdA=?l
zt$iw{Cr4TGr$<r&ywqeLK4UmLSM=>VT;D#n?VkYGwc{zha$|af*)~7@+D{q6I%7S3
zg~Ww)b~6$(Pr8O`D2CZ@#cismd>+1z&-*P0cI=ThHolud&U`G-Ub6ztc~`h@(0ZIb
zSHFq4Bpy@txgJ~|!kOR#fIb7wW${;<bXi%V#C%nR@!xPz63v4(76G5V<oO{WyLM1g
zm!Fe<+Ct6bCRYv1R_Gq3t@30qcXn4so1YOYr0{87^W;A1wpYlj&H^pyQ3pzc{og(w
zHraPmyofg*qHV)m!+F^dc6-8GhATaX4+n)lz(#Dhu{H-(y_i|*H;10EC2Y0tHx^WR
z6<Bx}*WIdJ_QIzlB{efq`G<ha+Y!srJD!c%YvE|uRlEj~%wyJqNjH++HFHr*kFpWZ
z+3hAw+BeZ`Zjfh?=dq72T#PqTx(^ciok4?OuA|oka$N}5S4@W~m6_E`0Xqs}HFR@b
z6c!got2ruKvSTb<^5iP#%qklXN;jO2ZH#+`aliCjBXqB3>Xg)dTrMvH-&YSDGO|bI
zMh-t$t$tL!AA4;xe<9VrOU0iMuY3UngRues_gt5W;~#&Dz}CP5iiZb^Uf#jh$l1`?
zfq=r!$VACljh2y)g@KNdl@f|x*uhxe$@brqf5ZP}n%mll=sOt`P>66bF)(s4GW@$U
zv$C<UQZq1-Gcb_<n<ryy^naV8<e+b7XKX}3FQ#whX#CF!B~djxF=s0)1AQBt|M;S0
zX6{Jv@A{uU(GaK@J2?JZnt+*(k%f_!lZlO$mWht-zkL0FJS31dcQGdT=MD=cfu)_k
zlbNHjK7q^s`yLw|6CDF36d&Jzj^jUDXJTjlUk>5_pYXG={a3!v%)$Qu<@^6O%ktl)
zngy%ML~d~)bbqRztvNzeQ+W$R1ktpUWWr9Kpg5R?VPcsuO*)ybe|_?(>!uXC=y{N=
zd(`SAR~Ur{per&Y5`?dq3(gb_%c(yl@9E9`$&W%d%AP|qtPIu<PYJrG8FSO`&KNV>
zXW79<;&ZT|_X2>M4S+ObRMh}L1w)}7!birV4vu*}8(IbX<p8SwCnY;^$Am~mN|qR_
zaTi;_p;j!h59vsfHn`AF4{|5LK`8SQ*9R;ry(23)=m-PUuW1NU)ksF#g=odm;kN?n
z&)=e_K~xwOrf?q@UM9e(1+EKWV{jUjKsNIr6hF)&fU0@tCL)hW<{<=bZ&F8%I`#B$
z?DTay+S|zC!?Qh`dj58D{@GethdeUN>|w85^ybOc!|mH0Hj83~GeDlMnYbCJ5k%BH
z`AEN5soH8)rpbnoGt^Jj`r@i(RMA%yDYTyl_)>ej8v57@;p^$sqh$z#{&_2hG1R3Y
z7QUf$_Wr?O*x$IadggFp!cKK}`1rM(P-EXD_*ZnZPB8XFbN6IZ+fscc^!@izk!zBo
z9i7_jSQnG@S7&ae$ee6>&4`H!Z3>o_+o|d@S&x)ET+}zEj4Ry2a45)Ps7<GU&5~FQ
zo+RTWPoeW{M*C1)Yg(K5wXNy4O{~M|@z3rZRiSxM3v9Kg6Qr}sfc9Qw9m?C4(ZA?~
zr7#U~jj5nd%Q3lYH$GAPMVETr=GIrNb;#7IWig$sY}2OUPmSkj+=QF2>F>BU?mMeZ
zsnAL$YOImi@a8Vlf{oNl8^Ep!a=+n<M~d5Opw}FE6X7r3JX?*Sc4M!g3L~t&6yd)`
zr>cs@Lj`M5Ea)+nJjX(1Z^0?&J@Y9W2D6QYrfm-E*kw~q*sKxv(-OVM)m-=|t{TZm
z7ZNmUxdO4RxaWx1P8Hli3A|xN5JI>l3U>^GH9xQ$7kc-2j_j@BbI;hHy@xDcMc@oN
zPfa2ppG2kX9q$OC-3&VL>4mkkd(+-NdxO+we2|8mGmRGI*Uhlfq<2+V6S^C}sHZml
z*4&iZ@w;Ztd(~SNw0L7gdCwBDtp{w2pkHg+akaEv^Y-<db1XPHjR_++V1v@uaqKb+
z7pgMc_VvZLlMZ;-J7L@7)z!t;dh_1Sk*jJXLAHJ6egBE$u*l0z(3J>RV~Ehj`DTJU
z9?s|Nkkc`J&`p7i^63%r_wDD)tp{!7?P78TCGLEQ6b>N6DU`#^N&5oJX)*j;Z(b%f
zJTMTkofU|#>uoq_RO?TjADykfTP!+iN-Y*;bPD%hi@~{4)VtXCfYYnaxDw0Z%*E%Y
zJ173)PRY)dq{|TtWwiONi3^{f$8%~5KJ60^PQX_=S}kX||5MOq`QPG=nxe4@6uqR4
zk+B<rCIbNz2dg#|{a<sBe^HF%AJ<itK$DSxnSk-%prWm<)4#$0uw)hg^M;A-KkGkH
z{6CfmfhG^Dm?)>Hun?OdJCg{5s3;>7Cj*-hBLg!B12dD5C>tjq!T){AzjdUIZA_ia
z2-w&e|7V>0Z?uoZP2!YG)<+OC?V;AH37aU$gMbLQ%JlOK8|$eJ@C)-p5krPXmMV;n
z?(IvHHZQDa%rG-BFgG=L114j8VWVSIm|4u4YQH_!Ho>b&U*~7%Hn16w^fsDSH%PIs
zt36LO(*mZpdEYJStSadPj00^D#5(eW;ec@H|0m)F7f8HEF$NBrhk)X5xW_>OM!E;W
z0r{t&QXXtV5R?O!N)VL;xIz$?1NuVXAmvf2w(6MCQV-P%xCTv&qD{=s#!kadtj@7c
zw@#TQz-4aS=Q-S+Fw+D}fVjdjQ-Hamv&m0I>D3bWy6naa&MD6$)a6F#x#ckrd)f1!
z24DrA7JzrzhXdkM;l(m3gI|SjYCl0m4xGQfk~bb;VVMU%*oeZkA&_)I#ym=z7;7sg
zL!?EDqaNO}7kVF2MLNAdb(upQjEcPRA(fhFGI~j}x_B~SK>E5sa^<BSvhs?JAFa|q
z!GUyKrSvXH7X=5blkr=t;m!9b0C6BiihQ^QJaq~|cp`jrrR1Ij!S_%I>x{^Y*)~DD
z@jcx5Q<VqFQtJTNzTkiqksi%;)9Qs83Wv&##2WxGgei)MZ3{jN{~FL)crx5#oBy#~
z|K7t}y+Rh<S-alJD?Uk9V8@CQ>D((!XZeJrujU!A{}O4tqBJ^sn$XjXg4=Z}xvXdN
zwqL#^*7xMNvPa>Top-C(x9VMZSoVKm3Ae!07i>!`su&sj>>SD#%M09=U{En*V@&K#
zG<ft)!FzV!E?fNo(`VnlcCISiZvQ^ScgOU-p{6hIeU804<@c)zt1`cvcdtsjvwu&R
z>1)q-ZL2K(rT(p&^*v=x@YN>u^7kvEzC1Z>9O^yqjcwRc8})goey-Hia4vP&FUad)
w&+oh7X7Ee-XDjzaf0OT-KFI(x9~PG+7L`;K0W+SFfq{XsC6}tItG^o;0NL>jB>(^b

literal 0
HcmV?d00001

diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.texi b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.texi
new file mode 100755
index 00000000..410ec5f0
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/jsbignum.texi
@@ -0,0 +1,844 @@
+\input texinfo
+
+@iftex
+@afourpaper
+@headings double
+@end iftex
+
+@titlepage
+@afourpaper
+@sp 7
+@center @titlefont{Javascript Bignum Extensions}
+@sp 3
+@center Version 2018-06-16
+@sp 3
+@center Author: Fabrice Bellard
+@end titlepage
+
+@setfilename spec.info
+@settitle Javascript Bignum Extensions
+
+@contents
+
+@chapter Introduction
+
+The Bignum extensions add the following features to the Javascript
+language while being 100% backward compatible:
+
+@itemize
+
+@item Overloading of the standard operators
+to support new types such as complex numbers, fractions or matrixes.
+
+@item Bigint mode where arbitrarily large integers are available by default (no @code{n} suffix is necessary as in the TC39 BigInt proposal@footnote{@url{https://tc39.github.io/proposal-bigint/}}).
+
+@item Arbitrarily large floating point numbers (@code{BigFloat}) in base 2 using the IEEE 754 semantics.
+
+@item Optional @code{math} mode which modifies the semantics of the division, modulo and power operator. The division and power operator return a fraction with integer operands and the modulo operator is defined as the Euclidian remainder.
+
+@end itemize
+
+The extensions are independent from each other except the @code{math}
+mode which relies on the bigint mode and the operator overloading.
+
+@chapter Operator overloading
+
+@section Introduction
+
+If the operands of an operator have at least one object type, a custom
+operator method is searched before doing the legacy Javascript
+@code{ToNumber} conversion.
+
+For unary operators, the custom function is looked up in the object
+and has the following name:
+
+@table @code
+@item unary + 
+@code{Symbol.operatorPlus}
+
+@item unary -
+@code{Symbol.operatorNeg}
+
+@item ++
+@code{Symbol.operatorInc}
+
+@item --
+@code{Symbol.operatorDec}
+
+@item ~
+@code{Symbol.operatorNot}
+
+@end table
+
+For binary operators:
+
+@itemize
+
+@item
+If both operands have the same constructor function, then the operator
+is looked up in the constructor.
+
+@item
+Otherwise, the property @code{Symbol.operatorOrder} is looked up in both
+constructors and converted to @code{Int32}. The operator is then
+looked in the constructor with the larger @code{Symbol.operatorOrder}
+value. A @code{TypeError} is raised if both constructors have the same
+@code{Symbol.operatorOrder} value.
+
+@end itemize
+
+The operator is looked up with the following name:
+
+@table @code
+@item + 
+@code{Symbol.operatorAdd}
+
+@item -
+@code{Symbol.operatorSub}
+
+@item *
+@code{Symbol.operatorMul}
+
+@item /
+@code{Symbol.operatorDiv}
+
+@item / (math mode)
+@code{Symbol.operatorMathDiv}
+
+@item %
+@code{Symbol.operatorMod}
+
+@item % (math mode)
+@code{Symbol.operatorMathMod}
+
+@item ^ (math mode)
+@code{Symbol.operatorMathPow}
+
+@item **
+@code{Symbol.operatorPow}
+
+@item |
+@code{Symbol.operatorOr}
+
+@item ^
+@code{Symbol.operatorXor}
+
+@item &
+@code{Symbol.operatorAnd}
+
+@item <<
+@code{Symbol.operatorShl}
+
+@item >>
+@code{Symbol.operatorShr}
+
+@item <
+@code{Symbol.operatorCmpLT}
+
+@item >
+@code{Symbol.operatorCmpLT}, operands swapped
+
+@item <=
+@code{Symbol.operatorCmpLE}
+
+@item >=
+@code{Symbol.operatorCmpLE}, operands swapped
+
+@item ==, !=
+@code{Symbol.operatorCmpEQ}
+
+@end table
+
+The return value of @code{Symbol.operatorCmpLT}, @code{Symbol.operatorCmpLE} and
+@code{Symbol.operatorCmpEQ} is converted to @code{Boolean}.
+
+@section Builtin Object changes
+
+@subsection @code{Symbol} constructor
+
+The following global symbols are added for the operator overloading:
+@table @code
+@item operatorOrder
+@item operatorAdd
+@item operatorSub
+@item operatorMul
+@item operatorDiv
+@item operatorMod
+@item operatorPow
+@item operatorShl
+@item operatorShr
+@item operatorAnd
+@item operatorOr
+@item operatorXor
+@item operatorCmpLT
+@item operatorCmpLE
+@item operatorCmpEQ
+@item operatorPlus
+@item operatorNeg
+@item operatorNot
+@item operatorInc
+@item operatorDec
+@end table
+
+
+@chapter The BigInt Mode
+
+@section Introduction
+
+The bigint mode is enabled with the @code{"use bigint"} directive. It
+propagates the same way as the strict mode. In bigint mode, all
+integers are considered as @code{bigint} (arbitrarily large integer,
+similar to the TC39 BigInt
+proposal@footnote{@url{https://tc39.github.io/proposal-bigint/}})
+instead of @code{number} (floating point number). In order to be able
+to exchange data between standard and bigint modes, numbers are
+internally represented as 3 different types:
+
+@itemize
+
+@item Small integer (SmallInt): 32 bit integer@footnote{Could be extended to 53 bits without changing the principle.}.
+
+@item Big integer (BigInt): arbitrarily large integer.
+
+@item Floating point number (Float).
+
+@end itemize
+
+In standard mode, the semantics of each operation is modified so that
+when it returns a @code{number}, it is either of SmallInt or
+Float. But the difference between SmallInt and Float is not observable
+in standard mode.
+
+In bigint mode, each operation behaves differently whether its
+operands are integer or float. The difference between SmallInt and
+BigInt is not observable (i.e. they are both integers).
+
+The following table summarizes the observable types:
+
+@multitable @columnfractions .3 .3 .3
+@headitem Internal type @tab Observable type@* (standard mode) @tab Observable type@* (bigint mode)
+@item SmallInt @tab number @tab bigint
+@item BigInt @tab bigint @tab bigint
+@item Float @tab number @tab number
+@end multitable
+
+@section Changes that introduce incompatibilities with Javascript
+
+@subsection Standard mode
+
+There is no incompatibility with Javascript.
+
+@subsection Bigint mode
+
+The following changes are visible:
+
+@itemize
+
+@item Integer and Float are different types. Constants are typed. For example: @code{typeof 1.0 === "number"} and @code{typeof 1 === "bigint"}. Another consequence is that @code{1.0 === 1} is false.
+
+@item The range of integers is unlimited. In standard mode: @code{2**53 + 1 === 2**53}. This is no longer true with the bignum extensions.
+
+@item Binary bitwise operators do not truncate to 32 bits i.e. @code{0x800000000 | 1 === 0x800000001} while it gives @code{1} in standard mode.
+
+@item Bitwise shift operators do not truncate to 32 bits and do not mask the shift count with @code{0x1f} i.e. @code{1 << 32 === 4294967296} while it gives @code{1} in standard mode. However, the @code{>>>} operator (unsigned right shift) which is useless with bignums keeps its standard mode behavior@footnote{The unsigned right right operator could be removed in bigint mode.}.
+
+@item Operators with integer operands never return the minus zero floating point value as result. Hence @code{Object.is(0, -0) === true}. Use @code{-0.0} to create a minus zero floating point value.
+
+@item Division or modulo with a zero integer dividend raises an exception i.e. @code{1/0} throws a @code{RangeError} exception. However, division by the floating point zero returns Infinity or NaN as in standard mode: @code{1/0.0 === Infinity}. The same holds for zero elevated to a negative integer power i.e. @code{0**-1} throws a @code{RangeError} exception.
+
+@item The @code{ToPrimitive} abstract operation is called with the @code{"integer"} preferred type when an integer is required (e.g. for bitwise binary or shift operations).
+
+@item The prototype of integers is no longer @code{Number.prototype}. Instead@* @code{Object.getPrototypeOf(1) === BigInt.prototype}. The prototype of floats remains Number.prototype.
+
+@item If the TC39 BigInt proposal is supported, there is no observable difference between integers and @code{bigint}s.
+
+@end itemize
+
+@section Operators
+
+@subsection Arithmetic operators
+
+The operands are converted to number values as in normal
+Javascript. Then the general case is that an Integer is returned if
+both operands are Integer. Otherwise, a float is returned.
+
+The @code{+} operator also accepts strings as input and behaves like
+standard Javascript in this case.
+
+The binary operator @code{%} returns the truncated remainder of the
+division.
+
+The binary operator @code{%} in math mode returns the Euclidian
+remainder of the division i.e. it is always positive. 
+
+The binary operator @code{/} returns a float.
+
+The binary operator @code{/} in math mode returns a float if one of
+the operands is float. Otherwise, @code{BigInt[Symbol.operatorMathDiv]} is
+invoked (and returns a fraction for example).
+
+When the result is an Integer type, a dividend of zero yields a
+RangeError exception.
+
+The returned type of @code{a ** b} or @code{a ^ b} (math mode) is
+Float if @math{a} or @math{b} are Float. If @math{a} and @math{b} are
+integers:
+@itemize
+@item @math{a = 0} and @math{b < 0} generates a RangeError exception
+
+@item @math{|a| \geq 2} and @math{b < 0} returns a Float in bigint mode. In math mode, @code{BigInt[Symbol.operatorMathPow]} is invoked (and returns a fraction for example)
+
+@item otherwise an integer is returned.
+@end itemize
+
+The unary @code{-} and unary @code{+} return the same type as their
+operand. They performs no floating point rounding when the result is a
+float.
+
+The unary operators @code{++} and @code{--} return the same type as
+their operand.
+
+In standard mode:
+
+If the operator returns an Integer and that the result fits a
+SmallInt, it is converted to SmallInt. Otherwise, the Integer is
+converted to a Float.
+
+In bigint mode:
+
+If the operator returns an Integer and that the result fits a
+SmallInt, it is converted to SmallInt. Otherwise it is a BigInt.
+
+@subsection Logical operators
+
+In standard mode:
+
+The operands have their standard behavior. If the result fits a
+SmallInt it is converted to a SmallInt. Otherwise it is a Float.
+
+In bigint mode:
+
+The operands are converted to integer values. The floating point
+values are converted to integer by rounding them to zero.
+
+The logical operators are defined assuming the integers are
+represented in two complement notation.
+
+For @code{<<} and @code{<<}, the shift can be positive or negative. So
+@code{a << b} is defined as @math{\lfloor a/2^{-b} \rfloor} and
+@code{a >> b} is defined as @math{\lfloor a/2^{b} \rfloor}.
+
+The operator @code{>>>} is supported for backward compatibility and
+behaves the same way as Javascript i.e. implicit conversion to @code{Uint32}.
+
+If the result fits a SmallInt it is converted to a SmallInt. Otherwise
+it is a BigInt.
+
+@subsection Relational operators
+
+The relational operators <, <=, >, >=, ==, != work as expected with
+integers and floating point numbers (e.g. @code{1.0 == 1} is true).
+
+The strict equality operators === and !== have the usual Javascript
+semantics. In particular, different types never equal, so @code{1.0
+=== 1} is false.
+
+@section Number literals
+
+Number literals in bigint mode have a slightly different behavior than
+in standard Javascript:
+
+@enumerate
+
+@item
+A number literal without a decimal point or an exponent is considered
+as an Integer. Otherwise it is a Float.
+
+@item
+Hexadecimal, octal or binary floating point literals are accepted with
+a decimal point or an exponent. The exponent is specified with the
+@code{p} letter assuming a base 2. The same convention is used by
+C99. Example: @code{0x1p3} is the same as @code{8.0}.
+
+@end enumerate
+
+@section Builtin Object changes
+
+@subsection @code{BigInt} function
+
+The @code{BigInt} function cannot be invoked as a constructor. When
+invoked as a function, it converts its first parameter to an
+integer. When a floating point number is given as parameter, it is
+truncated to an integer with infinite precision.
+
+@code{BigInt} properties:
+
+@table @code
+
+@item asIntN(bits, a)
+Set @math{b=a \pmod{2^{bits}}}. Return @math{b} if @math{b < 2^{bits-1}}
+otherwise @math{b-2^{bits}}.
+
+@item asUintN(bits, a)
+Return @math{a \pmod{2^{bits}}}.
+
+@item tdiv(a, b)
+Return @math{trunc(a/b)}. @code{b = 0} raises a RangeError
+exception.
+
+@item fdiv(a, b)
+Return @math{\lfloor a/b \rfloor}. @code{b = 0} raises a RangeError
+exception.
+
+@item cdiv(a, b)
+Return @math{\lceil a/b \rceil}. @code{b = 0} raises a RangeError
+exception.
+
+@item ediv(a, b)
+Return @math{sgn(b) \lfloor a/{|b|} \rfloor} (Euclidian
+division). @code{b = 0} raises a RangeError exception.
+
+@item tdivrem(a, b)
+@item fdivrem(a, b)
+@item cdivrem(a, b)
+@item edivrem(a, b)
+Return an array of two elements. The first element is the quotient,
+the second is the remainder. The same rounding is done as the
+corresponding division operation.
+
+@item sqrt(a)
+Return @math{\lfloor \sqrt(a) \rfloor}. A RangeError exception is
+raised if @math{a < 0}.
+
+@item sqrtrem(a)
+Return an array of two elements. The first element is @math{\lfloor
+\sqrt{a} \rfloor}. The second element is @math{a-\lfloor \sqrt{a}
+\rfloor^2}. A RangeError exception is raised if @math{a < 0}.
+
+@item floorLog2(a)
+Return -1 if @math{a \leq 0} otherwise return @math{\lfloor \log2(a) \rfloor}.
+
+@item ctz(a)
+Return the number of trailing zeros in the two's complement binary representation of a. Return -1 if @math{a=0}.
+
+@end table
+
+@subsection @code{BigInt.prototype}
+
+It is a normal object.
+
+@subsection @code{Number} constructor
+
+The number constructor returns its argument rounded to a Float using
+the global floating point environement. In bigint mode, the Number
+constructor returns a Float. In standard mode, it returns a SmallInt
+if the value fits it, otherwise a Float.
+
+@subsection @code{Number.prototype}
+
+The following properties are modified:
+
+@table @code
+@item toString(radix)
+
+In bigint mode, integers are converted to the specified radix with
+infinite precision.
+
+@item toPrecision(p)
+@item toFixed(p)
+@item toExponential(p)
+
+In bigint mode, integers are accepted and converted to string with
+infinite precision.
+
+@item parseInt(string, radix)
+
+In bigint mode, an integer is returned and the conversion is done with
+infinite precision.
+
+@end table
+
+@subsection @code{Math} object
+
+The following properties are modified:
+
+@table @code
+@item abs(x)
+Absolute value. Return an integer if @code{x} is an Integer. Otherwise
+return a Float. No rounding is performed.
+
+@item min(a, b)
+@item max(a, b)
+No rounding is performed. The returned type is the same one as the
+minimum (resp. maximum) value.
+
+@end table
+
+@chapter Arbitrarily large floating point numbers
+
+@section Introduction
+
+This extension adds the @code{BigFloat} primitive type. The
+@code{BigFloat} type represents floating point numbers are in base 2
+with the IEEE 754 semantics. A floating
+point number is represented as a sign, mantissa and exponent. The
+special values @code{NaN}, @code{+/-Infinity}, @code{+0} and @code{-0}
+are supported. The mantissa and exponent can have any bit length with
+an implementation specific minimum and maximum.
+
+@section Floating point rounding
+
+Each floating point operation operates with infinite precision and
+then rounds the result according to the specified floating point
+environment (@code{BigFloatEnv} object). The status flags of the
+environment are also set according to the result of the operation.
+
+If no floating point environment is provided, the global floating
+point environment is used.
+
+The rounding mode of the global floating point environment is always
+@code{RNDN} (``round to nearest with ties to even'')@footnote{The
+rationale is that the rounding mode changes must always be
+explicit.}. The status flags of the global environment cannot be
+read@footnote{The rationale is to avoid side effects for the built-in
+operators.}. The precision of the global environment is
+@code{BigFloatEnv.prec}. The number of exponent bits of the global
+environment is @code{BigFloatEnv.expBits}.  If @code{BigFloatEnv.expBits} is
+strictly smaller than the maximum allowed number of exponent bits
+(@code{BigFloatEnv.expBitsMax}), then the global environment subnormal
+flag is set to @code{true}. Otherwise it is set to @code{false};
+
+For example, @code{prec = 53} and @code{ expBits = 11} give exactly
+the same precision as the IEEE 754 64 bit floating point type. It is
+the default floating point precision.
+
+The global floating point environment can only be modified temporarily
+when calling a function (see @code{BigFloatEnv.setPrec}). Hence a
+function can change the global floating point environment for its
+callees but not for its caller.
+
+@section Operators
+
+The builtin operators are extended so that a BigFloat is returned if
+at least one operand is a BigFloat. The computations are always done
+with infinite precision and rounded according to the global floating
+point environment.
+
+@code{typeof} applied on a @code{BigFloat} returns @code{bigfloat}.
+
+BigFloat can be compared with all the other numeric types and the
+result follows the expected mathematical relations.
+
+However, since BigFloat and Number are different types they are never
+equal when using the strict comparison operators (e.g. @code{0.0 ===
+0.0l} is false).
+
+@section BigFloat literals
+
+BigFloat literals are floating point numbers with a trailing @code{l}
+suffix. BigFloat literals have an infinite precision. They are rounded
+according to the global floating point environment when they are
+evaluated.@footnote{Base 10 floating point literals cannot usually be
+exactly represented as base 2 floating point number. In order to
+ensure that the literal is represented accurately with the current
+precision, it must be evaluated at runtime.}
+
+@section Builtin Object changes
+
+@subsection @code{BigFloat} function
+
+The @code{BigFloat} function cannot be invoked as a constructor. When
+invoked as a function: the parameter is converted to a primitive
+type. If the result is a numeric type, it is converted to BigFloat
+without rounding. If the result is a string, it is converted to
+BigFloat using the precision of the global floating point environment.
+
+@code{BigFloat} properties:
+
+@table @code
+
+@item LN2
+@item PI
+Getter. Return the value of the corresponding mathematical constant
+rounded to nearest, ties to even with the current global
+precision. The constant values are cached for small precisions.
+
+@item MIN_VALUE
+@item MAX_VALUE
+@item EPSILON
+Getter. Return the minimum, maximum and epsilon @code{BigFloat} values
+(same definition as the corresponding @code{Number} constants).
+
+@item fpRound(a[, e])
+Round the floating point number @code{a} according to the floating
+point environment @code{e} or the global environment if @code{e} is
+undefined.
+
+@item parseFloat(a[, radix[, e]])
+Parse the string @code{a} as a floating point number in radix
+@code{radix}. The radix is 0 (default) or from 2 to 36. The radix 0
+means radix 10 unless there is a hexadecimal or binary prefix. The
+result is rounded according to the floating point environment @code{e}
+or the global environment if @code{e} is undefined.
+
+@item add(a, b[, e])
+@item sub(a, b[, e])
+@item mul(a, b[, e])
+@item div(a, b[, e])
+Perform the specified floating point operation and round the floating
+point number @code{a} according to the floating point environment
+@code{e} or the global environment if @code{e} is undefined. If
+@code{e} is specified, the floating point status flags are updated.
+
+@item floor(x[, e])
+@item ceil(x[, e])
+@item round(x[, e])
+@item trunc(x[, e])
+Round to integer. A rounded @code{BigFloat} is returned. @code{e} is an
+optional floating point environment.
+
+@item fmod(x, y[, e])
+@item remainder(x, y[, e])
+Floating point remainder. The quotient is truncated to zero (fmod) or
+to the nearest integer with ties to even (remainder). @code{e} is an
+optional floating point environment.
+
+@item sqrt(x[, e])
+Square root. Return a rounded floating point number. @code{e} is an
+optional floating point environment.
+
+@item sin(x[, e])
+@item cos(x[, e])
+@item tan(x[, e])
+@item asin(x[, e])
+@item acos(x[, e])
+@item atan(x[, e])
+@item atan2(x, y[, e])
+@item exp(x[, e])
+@item log(x[, e])
+@item pow(x, y[, e])
+Transcendental operations. Return a rounded floating point
+number. @code{e} is an optional floating point environment.
+
+@end table
+
+@subsection @code{BigFloat.prototype}
+
+The following properties are modified:
+
+@table @code
+@item toString(radix)
+
+For floating point numbers:
+
+@itemize
+@item
+If the radix is a power of two, the conversion is done with infinite
+precision.
+@item
+Otherwise, the number is rounded to nearest with ties to even using
+the global precision. It is then converted to string using the minimum
+number of digits so that its conversion back to a floating point using
+the global precision and round to nearest gives the same number. 
+
+@end itemize
+
+@item toPrecision(p[, rnd_mode])
+@item toFixed(p[, rnd_mode])
+@item toExponential(p[, rnd_mode])
+Same semantics as the corresponding @code{Number} functions with
+BigFloats. There is no limit on the accepted precision @code{p}. The
+rounding mode can be optionally specified. It is set by default to
+@code{BigFloatEnv.RNDNA}.
+
+@end table
+
+@subsection @code{BigFloatEnv} constructor
+
+The @code{BigFloatEnv([p, [,rndMode]]} constructor cannot be invoked as a
+function. The floating point environment contains:
+
+@itemize
+@item the mantissa precision in bits
+
+@item the exponent size in bits assuming an IEEE 754 representation;
+
+@item the subnormal flag (if true, subnormal floating point numbers can
+be generated by the floating point operations).
+
+@item the rounding mode
+
+@item the floating point status. The status flags can only be set by the floating point operations. They can be reset with @code{BigFloatEnv.prototype.clearStatus()} or with the various status flag setters.
+
+@end itemize
+
+@code{new BigFloatEnv([p, [,rndMode]]} creates a new floating point
+environment. The status flags are reset. If no parameter is given the
+precision, exponent bits and subnormal flags are copied from the
+global floating point environment. Otherwise, the precision is set to
+@code{p}, the number of exponent bits is set to @code{expBitsMax} and the
+subnormal flags is set to @code{false}. If @code{rndMode} is
+@code{undefined}, the rounding mode is set to @code{RNDN}.
+
+@code{BigFloatEnv} properties:
+
+@table @code
+
+@item prec
+Getter. Return the precision in bits of the global floating point
+environment. The initial value is @code{53}.
+
+@item expBits
+Getter. Return the exponent size in bits of the global floating point
+environment assuming an IEEE 754 representation. If @code{expBits <
+expBitsMax}, then subnormal numbers are supported. The initial value
+is @code{11}.
+
+@item setPrec(f, p[, e])
+Set the precision of the global floating point environment to @code{p}
+and the exponent size to @code{e} then call the function
+@code{f}. Then the Float precision and exponent size are reset to
+their precious value and the return value of @code{f} is returned (or
+an exception is raised if @code{f} raised an exception). If @code{e}
+is @code{undefined} it is set to @code{BigFloatEnv.expBitsMax}. @code{p}
+must be >= 53 and @code{e} must be >= 11 so that the global precision
+is at least equivalent to the IEEE 754 64 bit doubles.
+
+@item precMin
+Read-only integer. Return the minimum allowed precision. Must be at least 2.
+
+@item precMax
+Read-only integer. Return the maximum allowed precision. Must be at least 53.
+
+@item expBitsMin
+Read-only integer. Return the minimum allowed exponent size in
+bits. Must be at least 3.
+
+@item expBitsMax
+Read-only integer. Return the maximum allowed exponent size in
+bits. Must be at least 11.
+
+@item RNDN
+Read-only integer. Round to nearest, with ties to even rounding mode.
+
+@item RNDZ
+Read-only integer. Round to zero rounding mode.
+
+@item RNDD
+Read-only integer. Round to -Infinity rounding mode.
+
+@item RNDU
+Read-only integer. Round to +Infinity rounding mode.
+
+@item RNDNA
+Read-only integer. Round to nearest, with ties away from zero rounding mode.
+
+@item RNDNU
+Read-only integer. Round to nearest, with ties to +Infinity rounding mode.
+
+@item RNDF@footnote{Could be removed in case a deterministic behvior for floating point operations is required.}
+Read-only integer. Faithful rounding mode. The result is
+non-deterministicly rounded to -Infinity or +Infinity. This rounding
+mode usually gives a faster and deterministic running time for the
+floating point operations.
+
+@end table
+
+@code{BigFloatEnv.prototype} properties:
+
+@table @code
+
+@item prec
+Getter and setter (Integer). Return or set the precision in bits.
+
+@item expBits
+Getter and setter (Integer). Return or set the exponent size in bits
+assuming an IEEE 754 representation.
+
+@item rndMode
+Getter and setter (Integer). Return or set the rounding mode.
+
+@item subnormal
+Getter and setter (Boolean). subnormal flag. It is false when
+@code{expBits = expBitsMax}.
+
+@item clearStatus()
+Clear the status flags.
+
+@item invalidOperation
+@item divideByZero
+@item overflow
+@item underflow
+@item inexact
+Getter and setter (Boolean). Status flags.
+
+@end table
+
+@subsection @code{Math} object
+
+The following properties are modified:
+
+@table @code
+@item abs(x)
+Absolute value. If @code{x} is a BigFloat, its absolute value is
+returned as a BigFloat. No rounding is performed.
+
+@item min(a, b)
+@item max(a, b)
+The returned type is the same one as the minimum (resp. maximum)
+value, so @code{BigFloat} values are accepted. When a @code{BigFloat}
+is returned, no rounding is performed.
+
+@end table
+
+@chapter Math mode
+
+@section Introduction
+
+A new @emph{math mode} is enabled with the @code{"use math"}
+directive. @code{"use bigint"} is implied in math mode. With this
+mode, writing mathematical expressions is more intuitive, exact
+results (fractions) can be computed for all operators and floating
+point literals have the @code{BigFloat} type by default.
+
+It propagates the same way as the @emph{strict mode}. In
+this mode:
+
+@itemize
+
+@item The @code{^} operator is a similar to the power operator (@code{**}), except that @code{a ^ b} invokes @code{BigInt[Symbol.operatorMathPow]} if @math{a} and @math{b} are integers and @math{|a| \geq 2} and @math{b < 0}.
+
+@item The power operator (both @code{^} and @code{**}) grammar is modified so that @code{-2^2} is allowed and yields @code{-4}.
+
+@item The logical xor operator is still available with the @code{^^} operator.
+
+@item The division operator invokes @code{BigInt[Symbol.operatorMathDiv]} in case both operands are integers.
+
+@item The modulo operator returns the Euclidian remainder (always positive) instead of the truncated remainder.
+
+@item Floating point literals are @code{BigFloat} by default (i.e. a @code{l} suffix is implied).
+
+@end itemize
+
+@section Builtin Object changes
+
+@subsection @code{Symbol} constructor
+
+The following global symbols are added for the operator overloading:
+@table @code
+@item operatorMathDiv
+@item operatorMathMod
+@item operatorMathPow
+@end table
+
+@section Remaining issues
+
+@enumerate
+
+@item New functions (e.g. @code{Math.div} and @code{Math.mod}) could be added to be able to call the normal division and modulo operators when in math mode.
+
+@item A new floating point literal suffix could be added for @code{Number} literals.
+
+@end enumerate
+
+@bye
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.html b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.html
new file mode 100755
index 00000000..eaa99563
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.html
@@ -0,0 +1,1050 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
+<html>
+<!-- Created by GNU Texinfo 5.2, http://www.gnu.org/software/texinfo/ -->
+<head>
+<title>QuickJS Javascript Engine</title>
+
+<meta name="description" content="QuickJS Javascript Engine">
+<meta name="keywords" content="QuickJS Javascript Engine">
+<meta name="resource-type" content="document">
+<meta name="distribution" content="global">
+<meta name="Generator" content="makeinfo">
+<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
+<link href="#SEC_Contents" rel="contents" title="Table of Contents">
+<style type="text/css">
+<!--
+a.summary-letter {text-decoration: none}
+blockquote.smallquotation {font-size: smaller}
+div.display {margin-left: 3.2em}
+div.example {margin-left: 3.2em}
+div.indentedblock {margin-left: 3.2em}
+div.lisp {margin-left: 3.2em}
+div.smalldisplay {margin-left: 3.2em}
+div.smallexample {margin-left: 3.2em}
+div.smallindentedblock {margin-left: 3.2em; font-size: smaller}
+div.smalllisp {margin-left: 3.2em}
+kbd {font-style:oblique}
+pre.display {font-family: inherit}
+pre.format {font-family: inherit}
+pre.menu-comment {font-family: serif}
+pre.menu-preformatted {font-family: serif}
+pre.smalldisplay {font-family: inherit; font-size: smaller}
+pre.smallexample {font-size: smaller}
+pre.smallformat {font-family: inherit; font-size: smaller}
+pre.smalllisp {font-size: smaller}
+span.nocodebreak {white-space:nowrap}
+span.nolinebreak {white-space:nowrap}
+span.roman {font-family:serif; font-weight:normal}
+span.sansserif {font-family:sans-serif; font-weight:normal}
+ul.no-bullet {list-style: none}
+-->
+</style>
+
+
+</head>
+
+<body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000">
+<h1 class="settitle" align="center">QuickJS Javascript Engine</h1>
+
+<a name="SEC_Contents"></a>
+<h2 class="contents-heading">Table of Contents</h2>
+
+<div class="contents">
+<ul class="no-bullet">
+<li><a name="toc-Introduction" href="#Introduction">1 Introduction</a>
+<ul class="no-bullet">
+  <li><a name="toc-Main-Features" href="#Main-Features">1.1 Main Features</a></li>
+</ul></li>
+<li><a name="toc-Usage" href="#Usage">2 Usage</a>
+<ul class="no-bullet">
+  <li><a name="toc-Installation" href="#Installation">2.1 Installation</a></li>
+  <li><a name="toc-Quick-start" href="#Quick-start">2.2 Quick start</a></li>
+  <li><a name="toc-Command-line-options" href="#Command-line-options">2.3 Command line options</a>
+  <ul class="no-bullet">
+    <li><a name="toc-qjs-interpreter" href="#qjs-interpreter">2.3.1 <code>qjs</code> interpreter</a></li>
+    <li><a name="toc-qjsc-compiler" href="#qjsc-compiler">2.3.2 <code>qjsc</code> compiler</a></li>
+  </ul></li>
+  <li><a name="toc-qjscalc-application" href="#qjscalc-application">2.4 <code>qjscalc</code> application</a></li>
+  <li><a name="toc-Built_002din-tests" href="#Built_002din-tests">2.5 Built-in tests</a></li>
+  <li><a name="toc-Test262-_0028ECMAScript-Test-Suite_0029" href="#Test262-_0028ECMAScript-Test-Suite_0029">2.6 Test262 (ECMAScript Test Suite)</a></li>
+</ul></li>
+<li><a name="toc-Specifications" href="#Specifications">3 Specifications</a>
+<ul class="no-bullet">
+  <li><a name="toc-Language-support" href="#Language-support">3.1 Language support</a>
+  <ul class="no-bullet">
+    <li><a name="toc-ES2019-support" href="#ES2019-support">3.1.1 ES2019 support</a></li>
+    <li><a name="toc-JSON" href="#JSON">3.1.2 JSON</a></li>
+    <li><a name="toc-ECMA402" href="#ECMA402">3.1.3 ECMA402</a></li>
+    <li><a name="toc-Extensions" href="#Extensions">3.1.4 Extensions</a></li>
+    <li><a name="toc-Mathematical-extensions" href="#Mathematical-extensions">3.1.5 Mathematical extensions</a></li>
+  </ul></li>
+  <li><a name="toc-Modules" href="#Modules">3.2 Modules</a></li>
+  <li><a name="toc-Standard-library" href="#Standard-library">3.3 Standard library</a>
+  <ul class="no-bullet">
+    <li><a name="toc-Global-objects" href="#Global-objects">3.3.1 Global objects</a></li>
+    <li><a name="toc-std-module" href="#std-module">3.3.2 <code>std</code> module</a></li>
+    <li><a name="toc-os-module" href="#os-module">3.3.3 <code>os</code> module</a></li>
+  </ul></li>
+  <li><a name="toc-QuickJS-C-API" href="#QuickJS-C-API">3.4 QuickJS C API</a>
+  <ul class="no-bullet">
+    <li><a name="toc-Runtime-and-contexts" href="#Runtime-and-contexts">3.4.1 Runtime and contexts</a></li>
+    <li><a name="toc-JSValue" href="#JSValue">3.4.2 JSValue</a></li>
+    <li><a name="toc-C-functions" href="#C-functions">3.4.3 C functions</a></li>
+    <li><a name="toc-Exceptions" href="#Exceptions">3.4.4 Exceptions</a></li>
+    <li><a name="toc-Script-evaluation" href="#Script-evaluation">3.4.5 Script evaluation</a></li>
+    <li><a name="toc-JS-Classes" href="#JS-Classes">3.4.6 JS Classes</a></li>
+    <li><a name="toc-C-Modules" href="#C-Modules">3.4.7 C Modules</a></li>
+    <li><a name="toc-Memory-handling" href="#Memory-handling">3.4.8 Memory handling</a></li>
+    <li><a name="toc-Execution-timeout-and-interrupts" href="#Execution-timeout-and-interrupts">3.4.9 Execution timeout and interrupts</a></li>
+  </ul></li>
+</ul></li>
+<li><a name="toc-Internals" href="#Internals">4 Internals</a>
+<ul class="no-bullet">
+  <li><a name="toc-Bytecode" href="#Bytecode">4.1 Bytecode</a></li>
+  <li><a name="toc-Executable-generation" href="#Executable-generation">4.2 Executable generation</a>
+  <ul class="no-bullet">
+    <li><a name="toc-qjsc-compiler-1" href="#qjsc-compiler-1">4.2.1 <code>qjsc</code> compiler</a></li>
+    <li><a name="toc-Binary-JSON" href="#Binary-JSON">4.2.2 Binary JSON</a></li>
+  </ul></li>
+  <li><a name="toc-Runtime" href="#Runtime">4.3 Runtime</a>
+  <ul class="no-bullet">
+    <li><a name="toc-Strings" href="#Strings">4.3.1 Strings</a></li>
+    <li><a name="toc-Objects" href="#Objects">4.3.2 Objects</a></li>
+    <li><a name="toc-Atoms" href="#Atoms">4.3.3 Atoms</a></li>
+    <li><a name="toc-Numbers" href="#Numbers">4.3.4 Numbers</a></li>
+    <li><a name="toc-Garbage-collection" href="#Garbage-collection">4.3.5 Garbage collection</a></li>
+    <li><a name="toc-JSValue-1" href="#JSValue-1">4.3.6 JSValue</a></li>
+    <li><a name="toc-Function-call" href="#Function-call">4.3.7 Function call</a></li>
+  </ul></li>
+  <li><a name="toc-RegExp" href="#RegExp">4.4 RegExp</a></li>
+  <li><a name="toc-Unicode" href="#Unicode">4.5 Unicode</a></li>
+  <li><a name="toc-BigInt-and-BigFloat" href="#BigInt-and-BigFloat">4.6 BigInt and BigFloat</a></li>
+</ul></li>
+<li><a name="toc-License" href="#License">5 License</a></li>
+
+</ul>
+</div>
+
+
+<a name="Introduction"></a>
+<h2 class="chapter">1 Introduction</h2>
+
+<p>QuickJS is a small and embeddable Javascript engine. It supports the
+ES2019 specification including modules, asynchronous
+generators and proxies.
+</p>
+<p>It optionally supports mathematical extensions such as big integers
+(BigInt), big floating point numbers (BigFloat) and operator
+overloading.
+</p>
+<a name="Main-Features"></a>
+<h3 class="section">1.1 Main Features</h3>
+
+<ul>
+<li> Small and easily embeddable: just a few C files, no external dependency, 180 KiB of x86 code for a simple &ldquo;hello world&rdquo; program.
+
+</li><li> Fast interpreter with very low startup time: runs the 56000 tests of the ECMAScript Test Suite<a name="DOCF1" href="#FOOT1"><sup>1</sup></a> in about 100 seconds on a single core of a desktop PC. The complete life cycle of a runtime instance completes in less than 300 microseconds.
+
+</li><li> Almost complete ES2019 support including modules, asynchronous
+generators and full Annex B support (legacy web compatibility).
+
+</li><li> Passes 100% of the ECMAScript Test Suite tests.
+
+</li><li> Can compile Javascript sources to executables with no external dependency.
+
+</li><li> Garbage collection using reference counting (to reduce memory usage and have deterministic behavior) with cycle removal.
+
+</li><li> Mathematical extensions: BigInt, BigFloat, operator overloading, bigint mode, math mode.
+
+</li><li> Command line interpreter with contextual colorization and completion implemented in Javascript.
+
+</li><li> Small built-in standard library with C library wrappers.
+
+</li></ul>
+
+<a name="Usage"></a>
+<h2 class="chapter">2 Usage</h2>
+
+<a name="Installation"></a>
+<h3 class="section">2.1 Installation</h3>
+
+<p>A Makefile is provided to compile the engine on Linux or MacOS/X.  A
+preliminary Windows support is available thru cross compilation on a
+Linux host with the MingGW tools.
+</p>
+<p>Edit the top of the <code>Makefile</code> if you wish to select specific
+options then run <code>make</code>.
+</p>
+<p>You can type <code>make install</code> as root if you wish to install the binaries and support files to
+<code>/usr/local</code> (this is not necessary to use QuickJS).
+</p>
+<a name="Quick-start"></a>
+<h3 class="section">2.2 Quick start</h3>
+
+<p><code>qjs</code> is the command line interpreter (Read-Eval-Print Loop). You can pass
+Javascript files and/or expressions as arguments to execute them:
+</p>
+<div class="example">
+<pre class="example">./qjs examples/hello.js
+</pre></div>
+
+<p><code>qjsc</code> is the command line compiler:
+</p>
+<div class="example">
+<pre class="example">./qjsc -o hello examples/hello.js
+./hello
+</pre></div>
+
+<p>generates a <code>hello</code> executable with no external dependency.
+</p>
+<p><code>qjsbn</code> and <code>qjscbn</code> are the corresponding interpreter and
+compiler with the mathematical extensions:
+</p>
+<div class="example">
+<pre class="example">./qjsbn examples/pi.js 1000
+</pre></div>
+
+<p>displays 1000 digits of PI.
+</p>
+<div class="example">
+<pre class="example">./qjsbnc -o pi examples/pi.js
+./pi 1000
+</pre></div>
+
+<p>compiles and executes the PI program.
+</p>
+<a name="Command-line-options"></a>
+<h3 class="section">2.3 Command line options</h3>
+
+<a name="qjs-interpreter"></a>
+<h4 class="subsection">2.3.1 <code>qjs</code> interpreter</h4>
+
+<pre class="verbatim">usage: qjs [options] [files]
+</pre>
+<p>Options are:
+</p><dl compact="compact">
+<dt><code>-h</code></dt>
+<dt><code>--help</code></dt>
+<dd><p>List options.
+</p>
+</dd>
+<dt><code>-e <code>EXPR</code></code></dt>
+<dt><code>--eval <code>EXPR</code></code></dt>
+<dd><p>Evaluate EXPR.
+</p>
+</dd>
+<dt><code>-i</code></dt>
+<dt><code>--interactive</code></dt>
+<dd><p>Go to interactive mode (it is not the default when files are provided on the command line).
+</p>
+</dd>
+<dt><code>-m</code></dt>
+<dt><code>--module</code></dt>
+<dd><p>Load as ES6 module (default if .mjs file extension).
+</p>
+</dd>
+</dl>
+
+<p>Advanced options are:
+</p>
+<dl compact="compact">
+<dt><code>-d</code></dt>
+<dt><code>--dump</code></dt>
+<dd><p>Dump the memory usage stats.
+</p>
+</dd>
+<dt><code>-q</code></dt>
+<dt><code>--quit</code></dt>
+<dd><p>just instantiate the interpreter and quit.
+</p>
+</dd>
+</dl>
+
+<a name="qjsc-compiler"></a>
+<h4 class="subsection">2.3.2 <code>qjsc</code> compiler</h4>
+
+<pre class="verbatim">usage: qjsc [options] [files]
+</pre>
+<p>Options are:
+</p><dl compact="compact">
+<dt><code>-c</code></dt>
+<dd><p>Only output bytecode in a C file. The default is to output an executable file.
+</p></dd>
+<dt><code>-e</code></dt>
+<dd><p>Output <code>main()</code> and bytecode in a C file. The default is to output an
+executable file.
+</p></dd>
+<dt><code>-o output</code></dt>
+<dd><p>Set the output filename (default = <samp>out.c</samp> or <samp>a.out</samp>).
+</p>
+</dd>
+<dt><code>-N cname</code></dt>
+<dd><p>Set the C name of the generated data.
+</p>
+</dd>
+<dt><code>-m</code></dt>
+<dd><p>Compile as Javascript module (default if <samp>.mjs</samp> extension).
+</p>
+</dd>
+<dt><code>-M module_name[,cname]</code></dt>
+<dd><p>Add initialization code for an external C module. See the
+<code>c_module</code> example.
+</p>
+</dd>
+<dt><code>-x</code></dt>
+<dd><p>Byte swapped output (only used for cross compilation).
+</p>
+</dd>
+<dt><code>-flto</code></dt>
+<dd><p>Use link time optimization. The compilation is slower but the
+executable is smaller and faster. This option is automatically set
+when the <code>-fno-x</code> options are used.
+</p>
+</dd>
+<dt><code>-fno-[eval|string-normalize|regexp|json|proxy|map|typedarray|promise]</code></dt>
+<dd><p>Disable selected language features to produce a smaller executable file.
+</p>
+</dd>
+</dl>
+
+<a name="qjscalc-application"></a>
+<h3 class="section">2.4 <code>qjscalc</code> application</h3>
+
+<p>The <code>qjscalc</code> application is a superset of the <code>qjsbn</code>
+command line interpreter implementing a Javascript calculator with
+arbitrarily large integer and floating point numbers, fractions,
+complex numbers, polynomials and matrices. The source code is in
+<samp>qjscalc.js</samp>. More documentation and a web version are available at
+<a href="http://numcalc.com">http://numcalc.com</a>.
+</p>
+<a name="Built_002din-tests"></a>
+<h3 class="section">2.5 Built-in tests</h3>
+
+<p>Run <code>make test</code> to run the few built-in tests included in the
+QuickJS archive.
+</p>
+<a name="Test262-_0028ECMAScript-Test-Suite_0029"></a>
+<h3 class="section">2.6 Test262 (ECMAScript Test Suite)</h3>
+
+<p>A test262 runner is included in the QuickJS archive.
+</p>
+<p>For reference, the full test262 tests are provided in the archive
+<samp>qjs-tests-yyyy-mm-dd.tar.xz</samp>. You just need to untar it into the
+QuickJS source code directory.
+</p>
+<p>Alternatively, the test262 tests can be installed with:
+</p>
+<div class="example">
+<pre class="example">git clone https://github.com/tc39/test262.git test262
+cd test262
+git checkout 94b1e80ab3440413df916cd56d29c5a2fa2ac451
+patch -p1 &lt; ../tests/test262.patch
+cd ..
+</pre></div>
+
+<p>The patch adds the implementation specific <code>harness</code> functions
+and optimizes the inefficient RegExp character classes and Unicode
+property escapes tests (the tests themselves are not modified, only a
+slow string initialization function is optimized).
+</p>
+<p>The tests can be run with
+</p><div class="example">
+<pre class="example">make test2
+</pre></div>
+
+<p>For more information, run <code>./run-test262</code> to see the options of
+the test262 runner. The configuration files <code>test262.conf</code> and
+<code>test262bn.conf</code> contain the options to run the various tests.
+</p>
+<a name="Specifications"></a>
+<h2 class="chapter">3 Specifications</h2>
+
+<a name="Language-support"></a>
+<h3 class="section">3.1 Language support</h3>
+
+<a name="ES2019-support"></a>
+<h4 class="subsection">3.1.1 ES2019 support</h4>
+
+<p>The ES2019 specification
+<a name="DOCF2" href="#FOOT2"><sup>2</sup></a> is almost fully
+supported including the Annex B (legacy web compatibility) and the
+Unicode related features. The following features are not supported
+yet:
+</p>
+<ul>
+<li> Realms (althougth the C API supports different runtimes and contexts)
+
+</li><li> Tail calls<a name="DOCF3" href="#FOOT3"><sup>3</sup></a>
+
+</li></ul>
+
+<a name="JSON"></a>
+<h4 class="subsection">3.1.2 JSON</h4>
+
+<p>The JSON parser is currently more tolerant than the specification.
+</p>
+<a name="ECMA402"></a>
+<h4 class="subsection">3.1.3 ECMA402</h4>
+
+<p>ECMA402 (Internationalization API) is not supported.
+</p>
+<a name="Extensions"></a>
+<h4 class="subsection">3.1.4 Extensions</h4>
+
+<ul>
+<li> The directive <code>&quot;use strip&quot;</code> indicates that the debug information (including the source code of the functions) should not be retained to save memory. As <code>&quot;use strict&quot;</code>, the directive can be global to a script or local to a function.
+
+</li><li> The first line of a script beginning with <code>#!</code> is ignored.
+
+</li></ul>
+
+<a name="Mathematical-extensions"></a>
+<h4 class="subsection">3.1.5 Mathematical extensions</h4>
+
+<p>The mathematical extensions are available in the <code>qjsbn</code> version and are fully
+backward compatible with standard Javascript. See <code>jsbignum.pdf</code>
+for more information.
+</p>
+<ul>
+<li> The <code>BigInt</code> (big integers) TC39 proposal is supported.
+
+</li><li> <code>BigFloat</code> support: arbitrary large floating point numbers in base 2.
+
+</li><li> Operator overloading.
+
+</li><li> The directive <code>&quot;use bigint&quot;</code> enables the bigint mode where integers are <code>BigInt</code> by default.
+
+</li><li> The directive <code>&quot;use math&quot;</code> enables the math mode where the division and power operators on integers produce fractions. Floating point literals are <code>BigFloat</code> by default and integers are <code>BigInt</code> by default.
+
+</li></ul>
+
+<a name="Modules"></a>
+<h3 class="section">3.2 Modules</h3>
+
+<p>ES6 modules are fully supported. The default name resolution is the
+following:
+</p>
+<ul>
+<li> Module names with a leading <code>.</code> or <code>..</code> are relative
+to the current module path.
+
+</li><li> Module names without a leading <code>.</code> or <code>..</code> are system
+modules, such as <code>std</code> or <code>os</code>.
+
+</li><li> Module names ending with <code>.so</code> are native modules using the
+QuickJS C API.
+
+</li></ul>
+
+<a name="Standard-library"></a>
+<h3 class="section">3.3 Standard library</h3>
+
+<p>The standard library is included by default in the command line
+interpreter. It contains the two modules <code>std</code> and <code>os</code> and
+a few global objects.
+</p>
+<a name="Global-objects"></a>
+<h4 class="subsection">3.3.1 Global objects</h4>
+
+<dl compact="compact">
+<dt><code>scriptArgs</code></dt>
+<dd><p>Provides the command line arguments. The first argument is the script name.
+</p></dd>
+<dt><code>print(...args)</code></dt>
+<dd><p>Print the arguments separated by spaces and a trailing newline.
+</p></dd>
+<dt><code>console.log(...args)</code></dt>
+<dd><p>Same as print().
+</p>
+</dd>
+</dl>
+
+<a name="std-module"></a>
+<h4 class="subsection">3.3.2 <code>std</code> module</h4>
+
+<p>The <code>std</code> module provides wrappers to the libc <samp>stdlib.h</samp>
+and <samp>stdio.h</samp> and a few other utilities.
+</p>
+<p>Available exports:
+</p>
+<dl compact="compact">
+<dt><code>exit(n)</code></dt>
+<dd><p>Exit the process.
+</p>
+</dd>
+<dt><code>evalScript(str)</code></dt>
+<dd><p>Evaluate the string <code>str</code> as a script (global eval).
+</p>
+</dd>
+<dt><code>loadScript(filename)</code></dt>
+<dd><p>Evaluate the file <code>filename</code> as a script (global eval).
+</p>
+</dd>
+<dt><code>Error(errno)</code></dt>
+<dd>
+<p><code>std.Error</code> constructor. Error instances contain the field
+<code>errno</code> (error code) and <code>message</code> (result of
+<code>std.Error.strerror(errno)</code>).
+</p>
+<p>The constructor contains the following fields:
+</p>
+<dl compact="compact">
+<dt><code>EINVAL</code></dt>
+<dt><code>EIO</code></dt>
+<dt><code>EACCES</code></dt>
+<dt><code>EEXIST</code></dt>
+<dt><code>ENOSPC</code></dt>
+<dt><code>ENOSYS</code></dt>
+<dt><code>EBUSY</code></dt>
+<dt><code>ENOENT</code></dt>
+<dt><code>EPERM</code></dt>
+<dt><code>EPIPE</code></dt>
+<dd><p>Integer value of common errors (additional error codes may be defined).
+  </p></dd>
+<dt><code>strerror(errno)</code></dt>
+<dd><p>Return a string that describes the error <code>errno</code>.
+  </p></dd>
+</dl>
+
+</dd>
+<dt><code>open(filename, flags)</code></dt>
+<dd><p>Open a file (wrapper to the libc <code>fopen()</code>). Throws 
+<code>std.Error</code> in case of I/O error.
+</p>
+</dd>
+<dt><code>tmpfile()</code></dt>
+<dd><p>Open a temporary file. Throws <code>std.Error</code> in case of I/O error.
+</p>
+</dd>
+<dt><code>puts(str)</code></dt>
+<dd><p>Equivalent to <code>std.out.puts(str)</code>.
+</p>
+</dd>
+<dt><code>printf(fmt, ...args)</code></dt>
+<dd><p>Equivalent to <code>std.out.printf(fmt, ...args)</code>
+</p>
+</dd>
+<dt><code>sprintf(fmt, ...args)</code></dt>
+<dd><p>Equivalent to the libc sprintf().
+</p>
+</dd>
+<dt><code>in</code></dt>
+<dt><code>out</code></dt>
+<dt><code>err</code></dt>
+<dd><p>Wrappers to the libc file <code>stdin</code>, <code>stdout</code>, <code>stderr</code>.
+</p>
+</dd>
+<dt><code>SEEK_SET</code></dt>
+<dt><code>SEEK_CUR</code></dt>
+<dt><code>SEEK_END</code></dt>
+<dd><p>Constants for seek().
+</p>
+</dd>
+<dt><code>global</code></dt>
+<dd><p>Reference to the global object.
+</p>
+</dd>
+<dt><code>gc()</code></dt>
+<dd><p>Manually invoke the cycle removal algorithm. The cycle removal
+algorithm is automatically started when needed, so this function is
+useful in case of specific memory constraints or for testing.
+</p>
+</dd>
+<dt><code>getenv(name)</code></dt>
+<dd><p>Return the value of the environment variable <code>name</code> or
+<code>undefined</code> if it is not defined.
+</p>
+</dd>
+</dl>
+
+<p>FILE prototype:
+</p>
+<dl compact="compact">
+<dt><code>close()</code></dt>
+<dd><p>Close the file.
+</p></dd>
+<dt><code>puts(str)</code></dt>
+<dd><p>Outputs the string with the UTF-8 encoding.
+</p></dd>
+<dt><code>printf(fmt, ...args)</code></dt>
+<dd><p>Formatted printf, same formats as the libc printf.
+</p></dd>
+<dt><code>flush()</code></dt>
+<dd><p>Flush the buffered file.
+</p></dd>
+<dt><code>seek(offset, whence)</code></dt>
+<dd><p>Seek to a give file position (whence is <code>std.SEEK_*</code>). Throws a
+<code>std.Error</code> in case of I/O error.
+</p></dd>
+<dt><code>tell()</code></dt>
+<dd><p>Return the current file position.
+</p></dd>
+<dt><code>eof()</code></dt>
+<dd><p>Return true if end of file.
+</p></dd>
+<dt><code>fileno()</code></dt>
+<dd><p>Return the associated OS handle.
+</p>
+</dd>
+<dt><code>read(buffer, position, length)</code></dt>
+<dd><p>Read <code>length</code> bytes from the file to the ArrayBuffer <code>buffer</code> at byte
+position <code>position</code> (wrapper to the libc <code>fread</code>).
+</p>
+</dd>
+<dt><code>write(buffer, position, length)</code></dt>
+<dd><p>Write <code>length</code> bytes to the file from the ArrayBuffer <code>buffer</code> at byte
+position <code>position</code> (wrapper to the libc <code>fread</code>).
+</p>
+</dd>
+<dt><code>getline()</code></dt>
+<dd><p>Return the next line from the file, assuming UTF-8 encoding, excluding
+the trailing line feed.
+</p>
+</dd>
+<dt><code>getByte()</code></dt>
+<dd><p>Return the next byte from the file.
+</p>
+</dd>
+<dt><code>putByte(c)</code></dt>
+<dd><p>Write one byte to the file.
+</p></dd>
+</dl>
+
+<a name="os-module"></a>
+<h4 class="subsection">3.3.3 <code>os</code> module</h4>
+
+<p>The <code>os</code> module provides Operating System specific functions:
+</p>
+<ul>
+<li> low level file access
+</li><li> signals
+</li><li> timers
+</li><li> asynchronous I/O
+</li></ul>
+
+<p>The OS functions usually return 0 if OK or an OS specific negative
+error code.
+</p>
+<p>Available exports:
+</p>
+<dl compact="compact">
+<dt><code>open(filename, flags, mode = 0o666)</code></dt>
+<dd><p>Open a file. Return a handle or &lt; 0 if error.
+</p>
+</dd>
+<dt><code>O_RDONLY</code></dt>
+<dt><code>O_WRONLY</code></dt>
+<dt><code>O_RDWR</code></dt>
+<dt><code>O_APPEND</code></dt>
+<dt><code>O_CREAT</code></dt>
+<dt><code>O_EXCL</code></dt>
+<dt><code>O_TRUNC</code></dt>
+<dd><p>POSIX open flags.
+</p>
+</dd>
+<dt><code>O_TEXT</code></dt>
+<dd><p>(Windows specific). Open the file in text mode. The default is binary mode.
+</p>
+</dd>
+<dt><code>close(fd)</code></dt>
+<dd><p>Close the file handle <code>fd</code>.
+</p>
+</dd>
+<dt><code>seek(fd, offset, whence)</code></dt>
+<dd><p>Seek in the file. Use <code>std.SEEK_*</code> for <code>whence</code>.
+</p>
+</dd>
+<dt><code>read(fd, buffer, offset, length)</code></dt>
+<dd><p>Read <code>length</code> bytes from the file handle <code>fd</code> to the
+ArrayBuffer <code>buffer</code> at byte position <code>offset</code>.
+Return the number of read bytes or &lt; 0 if error.
+</p>
+</dd>
+<dt><code>write(fd, buffer, offset, length)</code></dt>
+<dd><p>Write <code>length</code> bytes to the file handle <code>fd</code> from the
+ArrayBuffer <code>buffer</code> at byte position <code>offset</code>.
+Return the number of written bytes or &lt; 0 if error.
+</p>
+</dd>
+<dt><code>isatty(fd)</code></dt>
+<dd><p>Return <code>true</code> is <code>fd</code> is a TTY (terminal) handle.
+</p>
+</dd>
+<dt><code>ttyGetWinSize(fd)</code></dt>
+<dd><p>Return the TTY size as <code>[width, height]</code> or <code>null</code> if not available.
+</p>
+</dd>
+<dt><code>ttySetRaw(fd)</code></dt>
+<dd><p>Set the TTY in raw mode.
+</p>
+</dd>
+<dt><code>remove(filename)</code></dt>
+<dd><p>Remove a file. Return 0 if OK or &lt; 0 if error.
+</p>
+</dd>
+<dt><code>rename(oldname, newname)</code></dt>
+<dd><p>Rename a file. Return 0 if OK or &lt; 0 if error.
+</p>
+</dd>
+<dt><code>setReadHandler(fd, func)</code></dt>
+<dd><p>Add a read handler to the file handle <code>fd</code>. <code>func</code> is called
+each time there is data pending for <code>fd</code>. A single read handler
+per file handle is supported. Use <code>func = null</code> to remove the
+hander.
+</p>
+</dd>
+<dt><code>setWriteHandler(fd, func)</code></dt>
+<dd><p>Add a write handler to the file handle <code>fd</code>. <code>func</code> is
+called each time data can be written to <code>fd</code>. A single write
+handler per file handle is supported. Use <code>func = null</code> to remove
+the hander.
+</p>
+</dd>
+<dt><code>signal(signal, func)</code></dt>
+<dd><p>Call the function <code>func</code> when the signal <code>signal</code>
+happens. Only a single handler per signal number is supported. Use
+<code>null</code> to set the default handler or <code>undefined</code> to ignore
+the signal.
+</p>
+</dd>
+<dt><code>SIGINT</code></dt>
+<dt><code>SIGABRT</code></dt>
+<dt><code>SIGFPE</code></dt>
+<dt><code>SIGILL</code></dt>
+<dt><code>SIGSEGV</code></dt>
+<dt><code>SIGTERM</code></dt>
+<dd><p>POSIX signal numbers.
+</p>
+</dd>
+<dt><code>setTimeout(delay, func)</code></dt>
+<dd><p>Call the function <code>func</code> after <code>delay</code> ms. Return a handle
+to the timer.
+</p>
+</dd>
+<dt><code>clearTimer(handle)</code></dt>
+<dd><p>Cancel a timer.
+</p>
+</dd>
+<dt><code>platform</code></dt>
+<dd><p>Return a string representing the platform: <code>&quot;linux&quot;</code>, <code>&quot;darwin&quot;</code>,
+<code>&quot;win32&quot;</code> or <code>&quot;js&quot;</code>.
+</p>
+</dd>
+</dl>
+
+<a name="QuickJS-C-API"></a>
+<h3 class="section">3.4 QuickJS C API</h3>
+
+<p>The C API was designed to be simple and efficient. The C API is
+defined in the header <code>quickjs.h</code>.
+</p>
+<a name="Runtime-and-contexts"></a>
+<h4 class="subsection">3.4.1 Runtime and contexts</h4>
+
+<p><code>JSRuntime</code> represents a Javascript runtime corresponding to an
+object heap. Several runtimes can exist at the same time but they
+cannot exchange objects. Inside a given runtime, no multi-threading is
+supported.
+</p>
+<p><code>JSContext</code> represents a Javascript context (or Realm). Each
+JSContext has its own global objects and system objects. There can be
+several JSContexts per JSRuntime and they can share objects, similary
+to frames of the same origin sharing Javascript objects in a
+web browser.
+</p>
+<a name="JSValue"></a>
+<h4 class="subsection">3.4.2 JSValue</h4>
+
+<p><code>JSValue</code> represents a Javascript value which can be a primitive
+type or an object. Reference counting is used, so it is important to
+explicitely duplicate (<code>JS_DupValue()</code>, increment the reference
+count) or free (<code>JS_FreeValue()</code>, decrement the reference count)
+JSValues.
+</p>
+<a name="C-functions"></a>
+<h4 class="subsection">3.4.3 C functions</h4>
+
+<p>C functions can be created with
+<code>JS_NewCFunction()</code>. <code>JS_SetPropertyFunctionList()</code> is a
+shortcut to easily add functions, setters and getters properties to a
+given object.
+</p>
+<p>Unlike other embedded Javascript engines, there is no implicit stack,
+so C functions get their parameters as normal C parameters. As a
+general rule, C functions take constant <code>JSValue</code>s as parameters
+(so they don&rsquo;t need to free them) and return a newly allocated (=live)
+<code>JSValue</code>.
+</p>
+<a name="Exceptions"></a>
+<h4 class="subsection">3.4.4 Exceptions</h4>
+
+<p>Exceptions: most C functions can return a Javascript exception. It
+must be explicitely tested and handled by the C code. The specific
+<code>JSValue</code> <code>JS_EXCEPTION</code> indicates that an exception
+occured. The actual exception object is stored in the
+<code>JSContext</code> and can be retrieved with <code>JS_GetException()</code>.
+</p>
+<a name="Script-evaluation"></a>
+<h4 class="subsection">3.4.5 Script evaluation</h4>
+
+<p>Use <code>JS_Eval()</code> to evaluate a script or module source.
+</p>
+<p>If the script or module was compiled to bytecode with <code>qjsc</code>,
+<code>JS_EvalBinary()</code> achieves the same result. The advantage is that
+no compilation is needed so it is faster and smaller because the compiler
+can be removed from the executable if no <code>eval</code> is required.
+</p>
+<p>Note: the bytecode format is linked to a given QuickJS
+version. Moreover, no security check is done before its
+execution. Hence the bytecode should not be loaded from untrusted
+sources. That&rsquo;s why there is no option to output the bytecode to a
+binary file in <code>qjsc</code>.
+</p>
+<a name="JS-Classes"></a>
+<h4 class="subsection">3.4.6 JS Classes</h4>
+
+<p>C opaque data can be attached to a Javascript object. The type of the
+C opaque data is determined with the class ID (<code>JSClassID</code>) of
+the object. Hence the first step is to register a new class ID and JS
+class (<code>JS_NewClassID()</code>, <code>JS_NewClass()</code>). Then you can
+create objects of this class with <code>JS_NewObjectClass()</code> and get or
+set the C opaque point with
+<code>JS_GetOpaque()</code>/<code>JS_SetOpaque()</code>.
+</p>
+<p>When defining a new JS class, it is possible to declare a finalizer
+which is called when the object is destroyed. A <code>gc_mark</code> method
+can be provided so that the cycle removal algorithm can find the other
+objects referenced by this object. Other methods are available to
+define exotic object behaviors.
+</p>
+<p>The Class ID are globally allocated (i.e. for all runtimes). The
+JSClass are allocated per <code>JSRuntime</code>. <code>JS_SetClassProto()</code>
+is used to define a prototype for a given class in a given
+JSContext. <code>JS_NewObjectClass()</code> sets this prototype in the
+created object.
+</p>
+<p>Examples are available in <samp>js_libc.c</samp>.
+</p>
+<a name="C-Modules"></a>
+<h4 class="subsection">3.4.7 C Modules</h4>
+
+<p>Native ES6 modules are supported and can be dynamically or statically
+linked. Look at the <samp>test_bjson</samp> and <samp>bjson.so</samp>
+examples. The standard library <samp>js_libc.c</samp> is also a good example
+of a native module.
+</p>
+<a name="Memory-handling"></a>
+<h4 class="subsection">3.4.8 Memory handling</h4>
+
+<p>Use <code>JS_SetMemoryLimit()</code> to set a global memory allocation limit
+to a given JSRuntime.
+</p>
+<p>Custom memory allocation functions can be provided with
+<code>JS_NewRuntime2()</code>.
+</p>
+<p>The maximum system stack size can be set with <code>JS_SetMaxStackSize()</code>.
+</p>
+<a name="Execution-timeout-and-interrupts"></a>
+<h4 class="subsection">3.4.9 Execution timeout and interrupts</h4>
+
+<p>Use <code>JS_SetInterruptHandler()</code> to set a callback which is
+regularly called by the engine when it is executing code. This
+callback can be used to implement an execution timeout.
+</p>
+<p>It is used by the command line interpreter to implement a
+<code>Ctrl-C</code> handler.
+</p>
+<a name="Internals"></a>
+<h2 class="chapter">4 Internals</h2>
+
+<a name="Bytecode"></a>
+<h3 class="section">4.1 Bytecode</h3>
+
+<p>The compiler generates bytecode directly with no intermediate
+representation such as a parse tree, hence it is very fast. Several
+optimizations passes are done over the generated bytecode.
+</p>
+<p>A stack-based bytecode was chosen because it is simple and generates 
+compact code.
+</p>
+<p>For each function, the maximum stack size is computed at compile time so that
+no runtime stack overflow tests are needed.
+</p>
+<p>A separate compressed line number table is maintained for the debug
+information.
+</p>
+<p>Access to closure variables is optimized and is almost as fast as local
+variables.
+</p>
+<p>Direct <code>eval</code> in strict mode is optimized.
+</p>
+<a name="Executable-generation"></a>
+<h3 class="section">4.2 Executable generation</h3>
+
+<a name="qjsc-compiler-1"></a>
+<h4 class="subsection">4.2.1 <code>qjsc</code> compiler</h4>
+
+<p>The <code>qjsc</code> compiler generates C sources from Javascript files. By
+default the C sources are compiled with the system compiler
+(<code>gcc</code> or <code>clang</code>).
+</p>
+<p>The generated C source contains the bytecode of the compiled functions
+or modules. If a full complete executable is needed, it also
+contains a <code>main()</code> function with the necessary C code to initialize the
+Javascript engine and to load and execute the compiled functions and
+modules.
+</p>
+<p>Javascript code can be mixed with C modules.
+</p>
+<p>In order to have smaller executables, specific Javascript features can
+be disabled, in particular <code>eval</code> or the regular expressions. The
+code removal relies on the Link Time Optimization of the system
+compiler.
+</p>
+<a name="Binary-JSON"></a>
+<h4 class="subsection">4.2.2 Binary JSON</h4>
+
+<p><code>qjsc</code> works by compiling scripts or modules and then serializing
+them to a binary format. A subset of this format (without functions or
+modules) can be used as binary JSON. The example <samp>test_bjson.js</samp>
+shows how to use it.
+</p>
+<p>Warning: the binary JSON format may change without notice, so it
+should not be used to store persistent data. The <samp>test_bjson.js</samp>
+example is only used to test the binary object format functions.
+</p>
+<a name="Runtime"></a>
+<h3 class="section">4.3 Runtime</h3>
+
+<a name="Strings"></a>
+<h4 class="subsection">4.3.1 Strings</h4>
+
+<p>Strings are stored either as an 8 bit or a 16 bit array of
+characters. Hence random access to characters is always fast.
+</p>
+<p>The C API provides functions to convert Javascript Strings to C UTF-8 encoded
+strings. The most common case where the Javascript string contains
+only ASCII characters involves no copying.
+</p>
+<a name="Objects"></a>
+<h4 class="subsection">4.3.2 Objects</h4>
+
+<p>The object shapes (object prototype, property names and flags) are shared
+between objects to save memory.
+</p>
+<p>Arrays with no holes (except at the end of the array) are optimized.
+</p>
+<p>TypedArray accesses are optimized.
+</p>
+<a name="Atoms"></a>
+<h4 class="subsection">4.3.3 Atoms</h4>
+
+<p>Object property names and some strings are stored as Atoms (unique
+strings) to save memory and allow fast comparison. Atoms are
+represented as a 32 bit integer. Half of the atom range is reserved for
+immediate integer literals from <em>0</em> to <em>2^{31}-1</em>.
+</p>
+<a name="Numbers"></a>
+<h4 class="subsection">4.3.4 Numbers</h4>
+
+<p>Numbers are represented either as 32-bit signed integers or 64-bit IEEE-754
+floating point values. Most operations have fast paths for the 32-bit
+integer case.
+</p>
+<a name="Garbage-collection"></a>
+<h4 class="subsection">4.3.5 Garbage collection</h4>
+
+<p>Reference counting is used to free objects automatically and
+deterministically. A separate cycle removal pass is done when the allocated
+memory becomes too large. The cycle removal algorithm only uses the
+reference counts and the object content, so no explicit garbage
+collection roots need to be manipulated in the C code.
+</p>
+<a name="JSValue-1"></a>
+<h4 class="subsection">4.3.6 JSValue</h4>
+
+<p>It is a Javascript value which can be a primitive type (such as
+Number, String, ...) or an Object. NaN boxing is used in the 32-bit version
+to store 64-bit floating point numbers. The representation is
+optimized so that 32-bit integers and reference counted values can be
+efficiently tested.
+</p>
+<p>In 64-bit code, JSValue are 128-bit large and no NaN boxing is used. The
+rationale is that in 64-bit code memory usage is less critical.
+</p>
+<p>In both cases (32 or 64 bits), JSValue exactly fits two CPU registers,
+so it can be efficiently returned by C functions.
+</p>
+<a name="Function-call"></a>
+<h4 class="subsection">4.3.7 Function call</h4>
+
+<p>The engine is optimized so that function calls are fast. The system
+stack holds the Javascript parameters and local variables.
+</p>
+<a name="RegExp"></a>
+<h3 class="section">4.4 RegExp</h3>
+
+<p>A specific regular expression engine was developped. It is both small
+and efficient and supports all the ES2019 features including the
+Unicode properties. As the Javascript compiler, it directly generates
+bytecode without a parse tree.
+</p>
+<p>Backtracking with an explicit stack is used so that there is no
+recursion on the system stack. Simple quantizers are specifically
+optimized to avoid recursions.
+</p>
+<p>Infinite recursions coming from quantizers with empty terms are
+avoided.
+</p>
+<p>The full regexp library weights about 15 KiB (x86 code), excluding the
+Unicode library.
+</p>
+<a name="Unicode"></a>
+<h3 class="section">4.5 Unicode</h3>
+
+<p>A specific Unicode library was developped so that there is no
+dependency on an external large Unicode library such as ICU. All the
+Unicode tables are compressed while keeping a reasonnable access
+speed.
+</p>
+<p>The library supports case conversion, Unicode normalization, Unicode
+script queries, Unicode general category queries and all Unicode
+binary properties.
+</p>
+<p>The full Unicode library weights about 45 KiB (x86 code).
+</p>
+<a name="BigInt-and-BigFloat"></a>
+<h3 class="section">4.6 BigInt and BigFloat</h3>
+
+<p>BigInt and BigFloat are implemented with the <code>libbf</code>
+library<a name="DOCF4" href="#FOOT4"><sup>4</sup></a>. It weights about 60
+KiB (x86 code) and provides arbitrary precision IEEE 754 floating
+point operations and transcendental functions with exact rounding.
+</p>
+<a name="License"></a>
+<h2 class="chapter">5 License</h2>
+
+<p>QuickJS is released under the MIT license.
+</p>
+<p>Unless otherwise specified, the QuickJS sources are copyright Fabrice
+Bellard and Charlie Gordon.
+</p>
+<div class="footnote">
+<hr>
+<h4 class="footnotes-heading">Footnotes</h4>
+
+<h3><a name="FOOT1" href="#DOCF1">(1)</a></h3>
+<p><a href="https://github.com/tc39/test262">https://github.com/tc39/test262</a></p>
+<h3><a name="FOOT2" href="#DOCF2">(2)</a></h3>
+<p><a href="https://tc39.github.io/ecma262/">https://tc39.github.io/ecma262/</a></p>
+<h3><a name="FOOT3" href="#DOCF3">(3)</a></h3>
+<p>We believe the current specification of tails calls is too complicated and presents limited practical interests.</p>
+<h3><a name="FOOT4" href="#DOCF4">(4)</a></h3>
+<p><a href="https://bellard.org/libbf">https://bellard.org/libbf</a></p>
+</div>
+<hr>
+
+
+
+</body>
+</html>
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.pdf b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.pdf
new file mode 100755
index 0000000000000000000000000000000000000000..8643ab6ad8b2a6872628d416789607691e0c4ee6
GIT binary patch
literal 154471
zcmbTdV~{9av!>m)ZSA&g+qP}nw(Z^4ZriqP+qQf5`R2sLnRuRvdE={Jt16<_ipspI
z^3GgYB=W+dGz_#XP$aX9L#t2>1oQ-UhL%v=+)#AVCbnkI<^(M4Yy|)NfT9z%uy!_a
zB%l+uHgGl(HZig@Hi6>hg>rIsG%>J&a$mPmmWeCiN9cN>@`NXy?yKWNaTb(DAik?T
zFlNr`qHLs%00QKGy=l=)Ih{0xPgJYXb6cvocDy|>;)=XK*B3ihiIm$=T_J5Kd_C!Y
z1`8@0uSVB$y;(kHy;0j>yPH#9TXr?Xs7Z3saHf;(q-}U$Y3VxuDJbSaJyHtfHf(L^
z5zG3GB|+{g;^s;vr^rr>gVgvr!D^$BVkg)oNr78O`Ow;)H@=L$!xZ6=`=Orf;Uq@}
zCw@&qb5C?}jp)-5)etqcp|!C#(ax=^ixGKOs%71AEV|U`ejt;yQ9>?fczW(|_pG^M
z7PTqp85J^mHHUk^-E~8!8l8)V2i>7%6H=n?0IHF)(Y$Teyp~3G5u!*dj8OzVllsPI
z#kB3f?wcYR5|@z`^6R)45pix3ah<)=2SHIN-wZB`1X(_PagPES&TEeuu#TwTfbKDY
zAWx`xKo^4_caU9!QYhq^M8;Up@Y!sqHINxSOnRPP7f24H#=lg%2ILttDZ}5sAi!+$
zqgT7~<{*sSci3rgj42keru)=O=KXh&tOFY?HKk=aD`2fD&AHN{04-VXp}<HHAv|Y*
z+|X6*tTZY;KH!WyoyBQ^u^^W16_hTDhmz8(+9eeUk5{BbgCXpD!7BLCQluT~lhss9
z(8mIx(JQOBDM-v76D)J6S7Q;leUHYYai-(f>V?#C0+o3B$hQ9rSnGuUMc+oDnm`Qz
zJSOlnM)c)6v#qH)lm#U{yod#Ukfs`o>s%aZ=g$a#qeNE^Vk;{Ul!>kJe^d2$^j}0W
z{tKBL?EnAC1o=xQ3jP00=48)~uS&u6|0dI=tNhyazsS@)T<VLRtU$?auBw(X6}y}9
zxq=0gNYSBdzTB>wve~X_w%afKQ(tv8NUuwFQGcqN?XF{bVrA>K^dlnWML8Y@;xcG&
z<`>7x)wCT$%-m7H)zM_8$xaOco%mTVqosV5C10Z`DOO~Hr-trs({)#sgYg0vE0V$1
zQm_vIoik5FSAUH*$JWtWlF<2O$>pVyHZmSX#PIDLWwYX)P>62VY2mnmawGvWmSEJp
z($1@;j6R<=BVrq8`)g(6<J)lPwJqUe{<@-BP^ofNMD?h->LtVG`Dn~DA=wErq@vAi
z;xo62!VD*NM)A)r0~3?mAdI`fpy4^h6;~xN!n}c)G%l+YX&yaQm=7t=GZ7zP0@7YB
zIw(29e96249aKJ?(Is^XVPRKs#5Ikn-*XI8(Hah=#DF^_w?Q`0$E6w&c=Vr)_`hhD
zPJ;JZvqIbo;qdKa?jItKgfEc!)M)se<SB8>1fikAs$?OkH=uo^JQ1WJ>!1HcGat`6
zkQX)1E5M*U{tfgt*-1hOoCJCP)?Deapp5OP&~M16N_>WAs7OL1sEzzO=-hIs6zWIw
z;cWMl*=u=KNp2N;FP<emY)=#V5UbiG-pbuosvV;Rd8G0a^(ADJpAjD3pr6}OXd2dG
znDArpchQDm3otrP+|9Rfz12eNiZETWF7&p9!urRr>Iy84$HJAJpHhPL%Fdn(9-g*;
zLdx_nkTSCT=a4G(+3wRLbe&Ljf)jh@t->Lc5f#Pz4;o0R6fEfqanFkH3d^$JzC2AL
zM5=m;KYkv^oW$_peZH^8At~YOqjXE&LE8AZkVMb#h#<p&Y3S(E>36sR0GGu5MRZ{4
z2#=FNx@B!ybt?+p&c>q~>r~|jy=qr^4IgqDaRBE#*0pW?AwgJ1*ToFqt0ZJ3u$Ev9
z-`+-LgDqdTI5|gMD`^@1aUJZyi-+MF7l+Dfv#X3fFNEL1puE1L=2TDDdm+8ErwLcP
z`B@#@fqFQXch&V;G*&n8ZW_}*g(rfL<9_mco!PASTo7!cnBM*o`)zwW3OfAG=~tY*
zuNA+!CY7tgGT3?vc^~RChyeAG;^3Sqra#NiU`e(EJFir6zg{auT8=t_Y`FMw&Md|v
z6LHZ<PP!NO7JWb@CS?H&BA(Hb?~nY;(|Aq)+ZKyjKQktyE@2M6?ynq2hY0uK^lXt}
zrWp6>PnbI>*m6+MBnqQ>GiwIH$!nzf+NTu0Ty=*J!uv>Bfv_^Q%nku~O5-mOhPOou
zi_y~QTJ)ilq}d$A2grSnlf+P2Rnww;;8d%}8r4IC$Q%{P&(Oz9K9Z?Smemf!A7!;d
zKc2btin{95?&uz*F$@;Oi#x_M(^FD=Mte*A236hP4@TmJGDe}msv7RneoAcVBKSO6
z-wgYfEs))SW}~R1|745xpKLL(as0<@#l-Qz2lB&&y7`KTVX)V%P`R~a=0Rq8W;qa)
z1!F|?#qHbx3gSqlJx?V)Qv||<=%Zjr^(O|L<BbtsSz=^;vG(Jqfzf~cTH)2SNe3*p
zpC^2!s!bHsWV?AVWB+SfZ^R>C-N8suD@}J5CRpc4;%wc+bPhyfQjr0KM#kn%Dnn7A
zCLmE5%$UdyHzktbyDD~K3e4E3dVD?!QHQt6_TxLOht8_3XGWe!(9kAfntxh=h2x(l
zU}U4G|4-G))o(4Q4OTS&od>E%ay|$t1au%DDMky@44DosuaEjIa7|Nf7neK9McIcN
z=*U(aia~~G)6CI*=ix||`|PCC4}O0Da!!g#KWD|1BuRz>b(V}8U6e4lmY1Y&c)l(l
zfhz|lr(GDFxAWtnoo;kPLFfW#88S9}vI6ReyvdP{wyaOD_SW~AsSk8JTW<mdC?a;L
z$@AE6Y8MklwW6Xxw?7>{A`}vHU&|(4ZS&rmJG5C9m=%N04|RS%T^f1}oHkkCCM!$J
zVf(=j8m{?~W6?^A_G@AVYD|(+3_dHl^;_xU&Ymr~Ezro9_PjJu82+v<6b3-JK;C9R
zqvd`HVm-w@8D86Z&&O(&M<{d;H8WJa36k*z^5C7}^gnSZ>z{c?0SyOkvHlGwGyDMX
z+OP3)3+k#wl>>%I>U=Ujl^Kb`PDvV+M3u(L&gp0(3}5ne%c1haB|CZ)tTyMaJvP)Q
ziGB3zhvY7##b%<5P6)eFoQhb_DXtJa8i-!+)Y*LQEbNl^;RN}KD15OGcv%*-potd0
zO0S(#n*o1Ts=MvLu&t4+###5cvG15V^9I*FJ~U2R9tZ)Jr}2NG4q%`p_1{UH@40px
zm#`Tkf4F{cd9Ex^nBaO6j#PC}hA-~e;vddqAJ(iKzAzuLy?uLEj)jei>OiIxl?5KT
zl%Qmimy%OdQT%Mu9jg^*ez)A9T}^H*G;ix><RUr*x5nGfoxULtp6!jJkL1Qh07J$`
zB2!8rf=^ftA!;T@dN`%CoIIH}m9MyUu}uuMV@osfZgJz#ayoOeSLQ_{my7yM|Jj7N
zhl{d4761TwH+nZ*{A;?}5v7Gdq~b+ka?xN#Ja0j-qL5%QCedg>xU-)x(>6Xhi*H6s
zdpoeb<HQBljW8P{U$_XO)%;$EPoHK?!*%tt`zA<0dYjnQ7)#(ti8(NttEN9t{g|^Q
z((|Ugr!mYK#ax!%8a&jg1O4`*?i}xq&;R2tf)46(SaMPkZ04p5lL%YgJjdl*LNiHO
z6t&q5PmZ#fgnUXWH~p{MTJ6a~HsD|a&?BSV%QqcMYQ?wdV1RU{_{~<PymS<^*~Mv0
zTTx_bPP1U#jLvns)T_xU=f<gOT%0I!8(LG(PDob)(;?wHoTDftApHV<?Sle;Lq%Z$
zB`$?@4=E3YBGjW}ddOBQDUIjqPsQ;4sS9|znv;zop^cssxO2abZMyYg98qwwmv#ch
z`-jX8Ub14t&-FOA+#Ljf19U}{6ZF5nzmYhfDY+14tDNmOxhlP=#)pHZ$$Z;KUvNA7
zVC~p@LMuLlKC{g3`G}fpWHP#5n8@)528@Sn{Ut7pA|o#il}YvoJWI72WUpUh&usTw
zx8~+$E7_5+s@9LbH`TIz4NjIyejLuKaJYMvX$--l43~NhmIcC}c~MMS)W&~^c-6nu
zmCesx1xXbIw-dpxdLr;#7#GT>8q&El>)|rA2rkYWP!K>GK-@qZKwdf$z}%9~e>NBj
z5yYNp>ZZo;(*VMC46+AhSu86jFA|hOF9iWW3G^OI4HPA*04j66qMw9fQ!-u_m91$L
zR=`66Zo6?$xWVCQ{$Uz{ssBFFP8h-;6R<8C8!%FW0Z8U5MxR6h2&3;eVo%GICpuUg
znIeQDB<r?on>YnE<D24N_o2j3wxaxXAI0pVE>yXMN-aUiZ3pJMUY5!h?eSARzB+Rm
zsd9QlltbdHm1($wHQ#}Eq!2)~VYp(p;a__VnOnMLmBkB(&kJ0Ff#S1<Ioxjfa&*Fq
zNirSg8BOrImLZkY;TXLkg#e@rBOJ8~|6M9#c2Sk61e4(ah%5n{R=efty?Xn-xU6Nv
z^TXn`JCUF`{y_c1BNcnDUm>Xq6vE%!0mMuhT3tF2&E0ZE$grGVTj?gG=j`3Jt<A-!
zaO!GFdi2b0%G;d-goZtT>2!E)1AU=aFtJ7e!ruZwBUu5KpMe4^?@t$4JrRFkut{mh
z^Yz`*dc~|5_I;>?pvB+Jg4UA5GETEw^4eLth~G*3m!4>(u()DPJSNdc6I#)QA<y}&
zsr>*jYSD*My`Z4-LF*@y*mr8Hcgp8mx)gvFY6^vNq9JnXN{pJj0A<y0*-z)0vyY2z
ztLOF|&X;@qn@}!OP=k6LFH`hCVIt%^aR>m&Ac^ILp?~>D5m5S&lGQ*QOGz7q*Y#b0
z**HX_>WCb_W<6SX8@A2+;9*SOOID7ILr=Ez*=zc^d^m#xq;DrQbZ8e~pl~ky!?Tr)
zTn)Hoz%e?r)qn2UhJT5ql3nY#nQbqDX&9>>c#r${(;!Ar<{<Xh46%RB@as6`j*@*J
zpJBG;1OMg11N-*}FL$s0CALm75?Z=9$zMDnM@_UL|Kf>cZdoe)2PIz<jHF*M-s1rw
ztuK3M#7kkuhoQ<sh2#J)vGk_ubS5_dKnN?l=qz_mZIIi4iP+u$<QY$yh}*j9p||SG
zpKCGmM-OuDsi;6JyCbaHcfv3loyeIg;b^u#KF$lme-AD}$R2#DXgBuwxmBulWono9
z%e-%!LUXxe>sAqQi0&8=Bh9Til7i65ZH0q`xOwP`dCEv~l+31Pz{!iGl?e4jAmZHJ
z{&p3LQU#I6@@}&+{7v6r?1d1d*V|v3h}Yjz(VO4N3qPGh8yG)XOLDc6bwjQTrDyq~
z<H*p5ZxdZnIA+F+V*&RkmS0MM_mmI-j58P(5LY<~h%<8|NH;au35|cn7h-erB`nAH
z$2)DPeC=|>*EH`shugvo@>A)#`6FzUI{-~McEYM>QH@I7^ztM%&J@BwAM%cW7G$X?
z&m-}pp;SSB3c@K$@9nO|k9otT3&$5q<V8Q3uA|5AlQf<$!YUt<uJwmMH@bqy4-5!~
zCvTrvCeG?H3r?Q}vNh)zPdkL4>Os=x7hZ{)o{wc#+Z8vwoWPS@6*idy9k)=?Z#Q+5
zmInfW`Dy&QsBqx&zfo!GYA_*MIg!I*yzo2h>z#Z7u+46Hiq-d`ZsR~T=AwM2z2i!J
z)QktDS3RtkurkO}QC-Zb<C+y!2fg^QmW=oEeTJ_oZQkMN<RL4|k^Kl88AyMa-xAS?
zpM_#LudR!rk|<0!hiO=cK$m8@sRJ3=>pW^X4ftE+s@Xwbll}e;9+3W<FbLu&FB9c^
zZnN4=Ia2|y7|xHi*3!vbsDY^6*eJ;F3~8vbPX5U1@7(MBu81~&=U&fi`!Weq6f9mD
zjvJ}jxccj)PZR(i+KaZ^p**-vyc}<yzi%F{zr1j)yksP{x?yRkY7x1!{D4cD?`1P>
z)a&xmIF4qloLtwT26&WgGsd2`FwCf#HjKPvAcnaiS?InnBthtfbr-jD6Klm@MJR!G
z9DD}``YeYxjmTPT@B^Y4K{@mLkWyYUh}i7lbV6j}xX+U3Nw^ln*MRSmhND;dnR)X7
zI)X@%X(1(g)4)8CRohrIQFfd<;9j&Aprk}CkPJ@uz-?{Qw$|RVTu)U?%lF;m!<6IN
zWFZqqaog^x!`)+sO<m)m20;BC+{rI@p>gtio1pIGncHt*X0zJre`;HH`hRL$7MA}!
zb-YT`v&*7K8QOWE_=JGpT<`uK!J}eXDCcpprc=TvN)!>t%xG3#AIXITlLn(T`rWQd
zt|%CN!=X0zww8`)sTXZ7+bBR^Ch_eeGE=zoQq<k*)nRC>Ye+`AJ$Yg6(v+G=4@Dt^
zIo6FZricKh)nzTkD<*=tW7blURjHDw9f-m{*PQVc&Q=H$%^*C1qIlg2N>IjbkUW3-
zJW#r--^jszSsq%w4E5zn<L_ufGZSKGoiP6tcJ7nK%ieOm6V(M4)`QqF`3pHuzH#o)
zJ;eMraOOJO@J!!j+#}NYIkKF7d~Ej=hk10|{GJO_NNk>)RG55T)A{LaY^=-Buuw*B
zq!A`rIL1-dfB{6ZvQYV<AM|+OzH%4?l(z7((kx^!`E3$LUhjn|6sUk*Apz<#)>U<{
z7DTYnu5C-t+nWvfy`+Dt(@Utyk*^KkC<Z&N>O<cdh~Vz)8La<-3lnH|o*OV+DM6!k
zZvtF)oJj)yL2#Bi*Q<Fkao#>OFEp=!w|49C!2)FP?Hv<N@5tYEcm;02@XG<)%x^8=
zNLPlwbuhI&WtW1|!dXow3v7IBZmQr%rYs<+h7sdw#8T5v>4*KLM!mr}0}z0H5inyJ
zcmF<T0JL3H(36ls+V{ElRKz?OyP=Ji4PNxbsZYYqIKJ&pE%&1(OnNEoE7Q=a$@Bf|
zyo?fpa--iR{>btYSxzs%Gp)_}YGmE&`_?Dgh8|da_pg7V_dl~LWe<B30y;TEOC@I;
zC^}gJ273Dcs`@%QITNrmaQvT|@ZZFf@juPFnlv_SvDpxOR@83iJjjRk;&G7Zfew!e
zMCMBppc`dA2_`m_BdGt(Ly3QPhe@q<)HcN=m;(w;Ox$K;I<g<m>S7)#BOMhM@JB+B
z6poh1cM_@25sSpv$|7RHm~n)As1nCRI|!TahkK?<D`+I;t84T|h-^_t!aY#~;qhzy
zD)R~#R$$GWh_5H-gev47WIBh`p(STM4YX~eh*YzlLrpRiO{$B;&CEk7j3OK)Z|9bs
zMKK3S;ea^DAR41IlV?`o5JVhjXGY}AFKF1N3L`~xJ|=nuPKE~iO%7F@Ffa?j7)CgT
zz4RH9$9)`Ipu+oeL}7BIlOtc+8CD1A2*{16BOok6D~S^@Pj-3*EX+?N3kp@KZ&{0k
zsysqpN>A*5iYpNU&^3oDFOPT+bPvISh$nDFfaoX@A}&f2L`RBT5(d#W_!h-^`>Pje
zSmaaxOt9aOG+HVfJ*ysllw8hH+@B0s6&Q8Y9mQV)>>bM=NplDy6))PbSA<@NoD0%h
z;2s1SM`H9uke_g#+%2kUEguOgT_f-%99BPUqt~lG&Vb#FZ4gINSKl2MDg&jO2u6*l
zj3^ryeJfA}7qL?q=QDj5Z~s<^UIOPhjeW*Je9cP1e+?uJA@>W7moUePaE4DcaTj*K
zju?auA-DhZ(V3a|r@ead_3F`x1&dFM=E73LPNi4ZlMSn<qPb$rRMn=gE;E#EY03ND
z`AMXU&HQ%Es+CDK##tKuSDrOJ4)UrvpYJ9@HlXtFobo%&P9aD5Nc-?r6hda-4vi^N
zm8xx_xDzu=Z(W~1OG8tyK~RRrH|D2DT*^3n8nkNuUb%%Ls^ATq-mTu+Z?E@|M@rUt
z1$-=#hx~KiP?0p`&3UVVhS2|K0ELc1ORg>7nrAPt7uXLP0{#D8sLpE*+=q&!BLBY!
z(2;cH-FdHp`_SXRNi2^YnR6~_FG{{WyFa<H_;hTl%VjiRof6cnLsOoK*N;vSx~4l2
z1Vp?}F%lOfAROheax=>ACYIhLV{$8yJ(IhRJ}9c@NWl{kTw=A@qLG*dPY9yfL>*@#
zq-ctzGOKvRE#i!eOkyD1CPqbnA;6ED3rn41WW>M+DSEO?<;6Z=lxBS9B_}Y4xElH}
zaz<h&BYj(z2~o&=5s=_V%yZ#7Snnu?mhh4nJ7pp)*;4RW5OR?h$E?3E`*4$0+Ta8`
z;zMc!fzsl%BnKOfO$bQ(;ZQmBEKL4gT$QXqfMUoz5?4|J0yc=zbF$)w9!z-Cz{Z)K
zl@oE<V|mt4Ub5Lf6|R^mQwAqFvDUE!7GxT#T4_MjBJf#eyRMWN1dOXJC0l%h6^`A=
z9vstIiP4a~X<=N!xiJiLAOR!D+!7L$%xor=8;y`v*wT#{e4ZTNI9kl`5TbD1#TcDs
z!eHE)Sn@J#moquqx$uP1gZl4D_UV?QW<|_xUUDdN$Mbk}USSe$DAF=$5hp8Ar{o1M
znuqo+k4FFpQt7U7qm6gd+_^sZF$@RY)hZ?uEflbmp<ejK>KX8Sf&m3)X<?(l7U!@E
z73>7$&CszqM*=V=R``Pcnmu-2@Pz8gZGEU06H>v!szmtF8_jKK5)qKF^nhc(P0)os
z6cGsgBxFnRDj4s*jE}nPpp&f|6rqF!kHzC0xs9yhMqwsKggnM-$ZmJ&#^!Gbva?>>
zD1W?;3X9vA0YyWj!;yV#Nn%0iFgb?$5re_z_~{F@djjmOyy)<w>Lk%$@I=1hF*AS)
z+dsp8pKob`m1sC3?4M~JL;L#%c5MetjH00HYCxw~-Pu2cy?pn(*i&2JdJ%k&yB8D4
zWpr|Rin`3j%;Vh(zMmORH{hdkNj7%!fg7!Cz#n*w$_dM;gB{+iuoDsbM_f19fhwnC
z@^PXOM%ym7k%on=K5Roq4n*o}vYOQ9Hyod@?C8*kELdq}u6klPzJE@L9o<-)i*7bn
zw_v^9ll-ih@I7VuJen%mDk`=rb81rK-h;QLPbT1pGa4*4Z&;U}yY)3Dl6G1kP`bKm
zQa3!?)urK`u0nh_rp$7gFpb$<YE~PTo}QdNQb5rkOj3F(T)?i?u6N`%s9D7jHY(Xr
zeQ%=ft4^sWrd3xi-uAHr7esz>>C~V<Xv8^q-IaE{6@34ZHr27Yu&FuZ@U*GbxE&aa
zGPBE(HqCl#pMKg*=}Fq^tmfrzhgaAZktMybWc~4~nQvCRd~$ws2s5!d_HNOwftz~Q
zeI6RzU;aiI%O&gio`(na%C7tR(zBno{!zPNTX@es$0{*+Z{S@54(**mSMmEP3Kf!J
z^U7`ClxEYrnMeiCNJ@)ZG9lE}@fEZOIQQGwJKO$exMgHw|EJVrU}5_2QttnIleG$6
z$8LlDva5%PeHQ>+U3sGZv#zDdJnV{IzvI|uBglv<!uES~?0J2&hEK6bsRh=aEe`@g
zidf_>D_J}EHYti(vnT^8LlWJ@3DL7`gU0;s<O6!lnTkMrio9kSJ*`EP&Y1k3J}v6W
zb=p#grW<VKW1k+QMVq1+=*_h)(g@evJWT-&rdq3dS1aa7zXMIYpM4=f+gH!8vsEM4
zb}0dkQ}st_FycKVn_@I0QvBRKkx5cGoGV$0R*h4kFRU15y*QB=$D3@AzvQGm6gplv
zn8WFnaUE&t{q7E~anV5E>mBX!EUTazb6&NP9yVvyohiMXlC_C&a0CdEFHI9%M32)8
z<CVXofxG~5LM1bZ1amtsEa+suEuaSXdGZ1bZc`+GG9wv6#-b;Lkv2+#XHkrju!-2m
zT5H+JWCQoDIwM;p>l-#8@_W@Y<)zxHqfX2m=Th2Ao58u-j8Yj59h{y5flqw_+Alv^
z1aHLNiij9{?gBXo3!E+$rq@&qh)0b<HmC%EWN#)_L`L}7fZhgP?BfgpQv4BAh|N_D
zS}MTYb(mqoE+4Mu67Cl>EZC}qJgaQd8H}R%R^M-Z3}r)?c_14x&D!kA-;FO9bpp+&
zH_Y_0u)}KG%e|;{-lom5Uq?3M1c&!dXZiL}zlq5O8Agrr_lYx!m{B!y?4zOaj}&e#
z+JGiBrQ4X{Y}4AHq#2^89|uVyP8@Oqe6b!ULZTV>L0H9Sii4wtf#T!KuF3aRNHwt4
z(+gTo6;c!)b1Mbr;6VjP3~pCe;l1O<TaI&{S04LjkN83MHexe^UUak;ol6+4+nO0|
zJhV+IZyyy18sgzT4QkBiY|cL7NlqN|4|my&f36P01G!f>j^&xIvy|_)7hS|Qyp-#l
zT%I;4AYH4?2RVdlR=s%%mA|P<x<#&_?3n3yP?oQEVbFJQhyhDC039vmlu`I0TmZO{
zYM<*|<iy_d?FZZmCiStM<tiI`W70Eu2I{7F1<4FB7$+Zr3%g8CjM-Llx3~K49NX8>
z*#;{WAlW^pf!zvmVb%zBiHYP?LRG^J5e4ehh*sW|M`tjokQLxue<!@{t{~{4_-?V!
z>UyH;&t=tHRphXCb16`~u#2<b*r})eW(t1HwB$fkDfwa0zbCqWXd*cE^y3U;V7jet
z);d<in}~S&C8TGrOw4TlHAsC5>CEyPDmdo`eygR$sNWt|QMZEK8_x}c`79zub>sqW
zY$UZ(2dK-XxU(d4a=<Ko%<8`d%SNH?R5!9{u<pSXc=g~)eAMO&5-hilc=-pZ&yeeV
zALV>kr-KvSvC4y>L)#&hFC~J?&Bj&4gPVlQc=34dc9xX2IkX7)718R$O6!5ik@kJt
zo-W|_>$lgSt0NtF;0zZY34+5oYfs^40djih4~_XJm7}g4L#S#UOO$h_W8w(Kh*mqc
z4u{BPZ^|M!h90A6_${CpXoa_37*ES8^3fkyfSh%HPCMY5tB{wF4HPbUN<|8D^_5Vv
zb#Z~28=qOC@r){m;Zjls*)=JU40v+on!+k3dS6Bdqs(bs3!Z0hEz!N`TAqzWOU?qy
z%C8t38+hRPHh`11B)Roz9$EY(g##rXpgdqiypj3$rmEMoF=q5)OV%lag9L}(B+T?n
z*zxKh3)}sx1`P_yLZ^mAvRH?L2IgbLBV|Pxrh&7>!*u#xtQ|T%E{^t+JKx3pK-pO=
z&92jZ2;z}bgbU~c{7^*LQ1$Sx=`}y|l9za7z3L{iV0;a%0q*jJlm~XgJKb&(U5y_L
z*<gf?=w>|C)F{yBx^jEe7U~X%5H4O=`6DvH;$!tP$m(59Sf%E4ykx&z-H6+FDMiFm
zhHkhXUwCv>e*wGvduxZA2rP^uqu1rAjwrgvz-)LtipeF3_E~zA(lzV*bUy8d!5)}K
zG|I8B1{L$(-Xz3t<HMaAIl_l9>ReqOyca?82w;!Iza16}*qtaJ2JDY^baZa|c@DpN
zuhNA6+)GuSD<JWtF$Df0k~(4RcGvuYE}O;c`Inf&%=~XLg^}SuP0~`-rJNSo5xP&*
zCg+@LhwnGq>XcIh1BsyX^`Y4zv@#Igt!qrk4tMNYG#!Tp)@oV6#}q4`o;p~(k^AE8
zBHfjeA*qrKmGEbX8aS`nm_1(hqqW)*AO?`f`KqT~{Y=+F#VR8yyW84%O<b0&dBJDk
z4bu->VUvg<_aAK1OEhi;qPjMHyF8mD77|5FKsRAsqNB{v)h1#zvg@d2e35eszd?-v
zF`&^Ns9i7)vPE7+T0%8)K=7Nn?R!tf#}k?3?!+4*7s690TF5X)m>h2F7n01i82)q@
zI$62&a_BPPsX1R`p5{vjvF(qr(gMGc>|0P-$XMVc>0@|pb|}PHo12|mRDK-f;k-G=
z3)6LUonI2^(;rwZ5yridB|H{(H2Z$|zC_HeFuCPgFDbYfb{0Oxm0Q6CYuQK#6A?$7
z5eMXi8DRI@^2r)21LKI+#YF9zW*r5{SG}70_uo5Xm}M?)#Do7LZ(Ct+7!jvb%+s(h
z>@}c)uEg`?nH#Rkgu90FTESkr((`VN;_0(yVKVe*s9*-wa7-PBgmjuKvls$O;Zes}
zdEqi%{amb7>5r^;_JsyZSuw|sgDygq>RX^LuD8CCFY|RRI33`z#Ay;nZOWr&`a>fv
z)1KBOxblZ)9x$a8y%m=M_hcHJ8_aL=p?{A9$PxdXefUoy5o(~9apmEWW`v*J+>m@C
zC7k8loU!2BHMKT=Y^U)O6bJ|MP!hZXpi)l9FTn+#LY4>NT+yzjKb{72<>(4ejaSwA
zB1T^6-UH<FipVjiSem}O_qBo!73ev5cY>oVm7{8P4OvgERv((~M-vY1?u%*UQ6)i9
zG*}CH7gfKU>r*wACTVSxz#5u8Kdn?*%6CU9UV0;#^kkv0VhFIL4AWMv8JS@c*<S%a
zBdGyg0&ej*@QGXfx-Y~!DRe7i`indyJVzoVV7~6mnPZ`=#?09Zcf){yEXI=&wS~7j
zlL{c|2)2v^%m*gskdXSUE>M8S@KP;YZc2_tot3g-1htrJf+ada^Q*;Jq^}w4n;-!a
z4;D-OJytgEN&SE%t90l~4vW&qhrhg&gXKH852i;wb5gY_;!d{nXx4(tjJT9pRJrvD
zV}bcMag8^gFFS^y2qviYas!!~R(LrUr!E)yD~i;)4t6OqPk3D>?l$oO7$zphxAAlH
zsv%uh7tG~<(uk`897cj<-3M>SJJWvS3=yX>9sy>dQjfPK{V04xrsHRVONo|r)HqiY
z7^HI^1kSh?6xWEZJFl|TSKQ3vXQ(-u4Eg(3am;S8*@Yz#^LM7hRUJOygLEV0!{QmJ
z2H+)ztc5G2+hhNcF#d&V^-3;-C>8-lz6PtTTkyqVXplgJjrl0X2^L(nK{E7PdoZ6!
zpPFAyKZ%6=S77^4R1;lZAQ!Uz51BRpb5jRwWSjoJ0t(NS<}!KAypYxX@b4#Dr_ERX
z!e`6*3*G(u;+0+AnkIhy!STG#Q9ql7)#-%q9R6oj>^WLx@<XMxqQ@ZDi+d6qp^0|<
zp*cNc?VTn{Mo83*lXSIS)JYzB6Kl(Wj0+32Sjeba{QOAZv+~OF5KQKS&{#35{vv&k
z#9a2SIP6XgcD-_1b~?|!{m$;wNh4L`RdFJ(kHGZ1Eqhrgz59DJszJ4n2v{O-?t4l0
zy8exYP`JR`&%6FClV@pn^-h3y8QX(jFobEa-Bg4JH02&ukBycjUlwCHgwM<I`7Xgx
za%nf8D-+mhUpO)7qm*TIr-*aYhV@V2GrSRFTYpr=apvV+^yL-g&P90vgJe5<@rbBS
zaRCn!S76{DybEJ~v0%r%P0Bb0)<8LlE|{;g4qWR0!SbLvUasEG%)vF2GK#<_{UWOK
zKtg*ZcD@M+Wqr3DYF3A8Dz!GW{@oZTcX4;Ra!_Y?tjc?)*j0NKSPMHd^pTC0-EFGI
zreGAsE8SwXK*H3t|FPVSx}fhtx3O-i_(O!kJ(qtpdhepoZ8iG4U31-f`J*5D$N3dK
zcT)lI-y+EWECc>`>n9^4$A8>hk)oj$x6zE`J5zI82qUZ=vB<)HLbz4}3REQ0kQElh
zOl}_0oN~G^uI$>fiob)YYb=p}kpog!gvi2_eZeN(3b||7Dse_Sg)yeyPLYWoQ1BcU
z)BSck5j9)+V35zJ^>+L{G&SSU2??AC?$O$|Go!JUmL<1+m5^I>+QMrzSy<ETi!!u5
z5`aJW{P5KwgJMEF>bP62%0%4l?!_k&Z6UoM{w4Kvd5-TQz05fu4B}8!{9ZgyvifQu
ziX`<oQOB_t^@MhiOsu+>Yag?o#SPUN(J9KT^HUU2xL($dOPmJG@QHT*8kwJpi?z3d
zhNV&dV^ev^lF}U=v`AEe7Tm0r=~2HwUuO0=*m53oD%VAi7s<Vy`c5OsxL!gKnE+rs
z)mR)YoNO79OfUGfPOnaFTAM19>GQ#eLYqoWjQQGMN!fm^yp$I|p)4U=fKwUh9aESb
zLs;AUrWx4&vH06~scFFMp%py!cDEK6i-S}n$K18&?4}Xb9X=b^vl3TH+iBd+#zwFJ
z`^bVBZr#S>oJT^zSquMK@_^_zI<=avCG%YjL9~e=T_C~Du1h_V2j9wqm)UZ{mIj)q
z!s73{TzJ^APG4(X15&b9*4nN>Gv60u5?oKQfUVo)2jT$mBZw{+o=x5yrJ_79jY*va
zlS&aphzT32_IK)cM^=ngRZN&aNqvi9LEYoBdR2WWOasogwH#V$eS%;a@kbS>>YfLY
zfH%R~sL39K=6f`Dq&Gu-)FA0EdTF|ZMX(d4Fu<XMn03)ene`SKOrV5z8jMwYMNW1R
zrVo>1bR9Iqf$_7(s3tw<T_~2hKP_FhPY-M2TfQpqa0RG5%EC$)lC*C<)ss^!A+|1G
zj1=7Fb2sdw*Dp5N0Dn#^lE%h|LGD=}hc#D)_1+rSxo{IoiDk*^iryI6aTEBZvKb|~
zCFkJecWJ$XO$j9|TGyYwsw5Xu@=kKiH{|G2{CM>m!Ht0-jlRAv>Kk=R15K6H{2Zto
zhG$N!hre#PfYGN(px>1yE<`vQQ?dJ;&D&;~itl8@o%q>V#TRfE3zRzEly1hFVj$Y5
z+883lwzFwXcqfnqgIsF4b)i$)<mUH-z^%bPofWJ2!;U#$4)U_zN7+|zS)L<13vNRD
zGEsu$*Iw&Oap$^f@=<i>-VXdJ!|K%3uGBh%Cd;ve2AVf8ZVH6dO+8UNvnYxo%k}zP
z%DANCz&{nlLCm?Du4YYX<k5axeY*@;1)(b&@rrE)n?8H{BM@QvY~$PHE@Je7l#D6!
zj#mTXLhD;f^Q<C0*rQyvCAS(<O%oWFSU<ejoWugA%BZ-8urd2RUWf2U{o=2_Tel-P
zO?sWaI1zYO@w(lpwxgdKbfSaXzkB>NIbA<d+Tr2lVf%cf&Xp}V^qI+xUsWDh5@s#%
zEe~aK$N1ajHOT|1QI<H1(RqAjkX?JDYtQj)7$8doe`vYNgl4(|cB>vnxz4wbI+%cH
zpdffMi;^c4uW61o<$vZu(OjB69Y9e7jV`B;IjD3h<hhK1Nok3*eBY2>qyPpMge2tj
zHT4xDpHB=gR0>u>go21AN(<|qYRYN5H~wUTAy-ZtsVhbkulx~o5t0sT<bQwS4kF`v
z1!^BZ{039Z#@Xf1gaTyH_-0VXPn0?(nl4eqqaMOw-~+XfDUI~d`Mcf3`#Ke+0xR7-
z7$^`lj`5sF`MzxD)>myT=LPkcS_N>`=y7f>&k3PRqjI+>wz%~`lf-+u<YE#$v*daN
z%+GDPp01^=x#h+qKXHZI$fsiHpa3DGvaL7dC?8dmuPHvXQ}udM<}5G^tRZp&52;e|
z52=3S<3V(0dnV}iY)qFVp*rtP@oiZFaH?_@6IcUE?+PbG1hzOo>8!IPW-;)?wp&+%
zvSr_pIWCV0<RW$WUV2@zM9Kc7OToo?&qCu(J1R^Gw^%dd{y7D6UYfK?z{JxWU<e|S
zlv6sbQ(|cXCno_zXHXlmuVDE!LTd7xLEzVRE`vP|Y2{E^7j7|kS9_bqh$toskWm$G
zl)p&*;`M!BsLod*?F5Pr151u$ie#p7=0UyY@a}T3r`>RQYImm40*0bl{6O)Xhw2$`
z^fkE=@l^f8?#t3Xll}z^bIE6Z+J-_i{swCJP82wkNNx&?HaM3U`jdJjq(}8}@Q#=`
zIYdd#&9(K5%FKwQSnhB#?LjeQE4S7L?Ob!m&M|-nxCC<fR9NfP)z!y}8`=vnESgBG
zINw%G3Q8L3UP^*qZp$B%UfEvuDjuVT)#0YMj3?Es5s)A#B?7Rf4>hk5pA!Y+X>n<v
zZ;z-3MhNNt*^43F#{wFV#Rd?`7^DEYXCs}94hfA9`dykO#*l6?X8#Nwir)@|=asy*
zFe~2<xQw;wgAaknR1V+BpLbcqY)|BHD7AWvh4sXVFNb$@X40V#6ywrZKT4(;O#)YS
zT8B;jnp<Eu=9C2i%qiO0y)Mfv>lo9s*^=D-pGOu78czlB?uY3joVo@<kP?CR9<@*H
zs!GYs%R!=$>pj|sgOrse%Kg(;K<1?*$XWV9!eyq-QCF`^AxuHkvZ)Nt{8YPh+6r#r
zc(-U1#{e$K+qfgRsZ-b*wV%W0A|-Z}nX$53$!clYBKRVAsPOcQN_ba-383EKSCrv`
zs@D(n6yxj^7P^Dk*BnP8MM=&q=Gm>(v6)eRP)}2Sk0A)f-}E+uHDBOUkPe0uA&5y#
z&B4d~DL|BLw}_0z)Zkx&>!{EOrgy)naba|+DTS9q8vGA5Y*N=x`R=<>gBl2h^NiS2
z-oIASTw4W-l?T98CZowyDGmFD5J8gE%1q8BfDsnrjn8LatZ(4=Z=VrS;_4?Csbke)
ztn!GKyfNZ^k}-)x7UOJKgv7)HGL7cymC2$qsR6(++xH9@0rd=7)Uaw!`K|PE=EqD#
zUPR?LB+^E%Fhd!;$YmIF%)Eo5OYT-b#RO{@8XuTR1S={eW0lq{+f9<rCeD=gHFnV*
znl4L1cw!j<T<6kU?zQ3{*j{}41OG)rvHZ(F3QQdTor4qnzYDuDi4(E|^avs^Ur=;5
zknnhXNLeJ|M0LUjpwxm{ydW_Z#77@>2gHrV;^a}QNf%x-(Lut&;1aYFwy5eUNkg`z
z@0Jau7I%;I0|FyK@%R*WQEN||7=b|9_TrICbt-klbdR=5*B#{s+7u#3um_sh@0+O?
zkzJ^9!dB4z?Yr9*F4WW4Q519Hz@im?`!VM`(Q6F9pa5CpO$nl9`#SCm4ez+G%A1oA
z4?3A*`<O5sCIM2UPL3xj&xO1+3Af%#BB>-=p2pca>NnosDV3!~vxIoka|*~oF=f97
zTxRd^2s<DWxO$~y?x#yzo6C^|S}*}Vc}-geOkJK`U{2Wx>rBN5$ckX;bEw3kWZLm)
zP2ddVeICr|hiJXODCKM5Wp)f&waCmXy;ZM@NvnV<9zlNh6Sh{;Hk0?QDQGWGNW~)c
zNxB`s>i(Qru$Z$Tf}kd)x*oae-+&{dFRZ?o%iXxUXluOu`Y;@xtzUZ=;)<qd$aC@K
zED2xge--ls{s3H}`ZvG+OTnIziS<7&t~6;#B^@*)cF)wvXG5!)7>EOSU)i`>{a*iL
zjpLO(-uE0(Kn{x&nf!KpdAL%Fy+uF~F+Q3lBeMhng3aIaA;hHqdW%kN*cOgVf`m$U
zKk(bmEbA)}jPLu1R=*t;p_(-LX4&m!CuEQ4R^+_2&#)`YwrQKz_kNqtWTe_Wm8v+o
zbemdDGi>|7p)Ija?eN%)Z`NZuqunxK@I~c3WI}Hl-VJ|w;7>k`NZC>hHRm}ruhA|O
z8Y4v0fs$zd2-%?$jhaCbwHYP*2@FQTlO{Q?g!bQGo-`xq;oRFG?19g|T-u;Ituft~
zx@Vq2FVVtuH}D<w&X#1@Y)gXSH4moz(}-olrZ!#i?K{NIz$vba%v?ED_%1;NMI(zf
z`3S)+PJQgXiV{`|o|BX?E$F(!g|R9?+@OpJjEm4DiwGZ3Cx53y$Uhpg5HivH&PWMs
zzdD`N(MzRcmLUQFCJ?ME=1@8^>0w#Q!Q(RIy5Ck+xyv}-o|~ERJxv?pozM&4_lPL4
zJ|(Pyr#eJT&hy^8fB+|gSQ8gRa50ix*vmv;r66dTq%;<?;6*q6R><gVmbUdMp%{-|
z4GGgpaPd)U4BYg%O1(O-uXK1YLjrBy44^_;CTqtFtqnhJ2whQj5eq{56Mrntb9-(Q
zF*n~u_$BtP{PPE{YN@zJT$bL7+pPR=_kyW+!FwG5aFa8DB@0zYY5R_woLRfO9G~6K
zcY<#1m!WZd$XWr}p8^U>l$;|APfx}$f#b-dF)L3M?`ut~P|P;f$-iG@;lut**0JRY
zkZ4OuUTUg|=lPx{kP(@ZYnl^5Csct+U|e<KBFR`lN(z2_Yk%LLmaHH|c29oKiUgzO
zMp_Q6W|3_+*#uT&|4Vr;yR-9p^Lm9Tb29fLH`|{!0Q8mnSkahh!#@(+9zSPQ&quI{
zKKkQ*X}tA5S>t#)DaSj>rqmO=l18^2bsTV&eg+8947Yk3E59y0``=Hh%hnm(^q?~Y
z0<m!?ELYQZZ)FnPj@_`+I%zYjqw*TXTQ0M@T~g1moIXvj3GA89Mr=d=G=p850)xi_
zV;4Gl*D{oarpw1?vVP@2NH<kv1t~E|=OLCzEZO#7thd`aq8U#*3auwI9ydyKE^<-x
zAlAe&q^Y%4MOh1{TM{}YYhfi38r0?!$-&FanUqkbmsEJ@g!=YdHZp|)Wq+Aun8PPp
zVF+zooIFx32!q^p20qy84#bNs>W|w6@J5K`i$;;+Q3(aeAn|cm5w=A&!wzBaTuyi<
zrQpP~sG%N{gC{jut>B!KSn$k9qAw+pc*@tlu6xXpKuAN&Oh~8bqh&Uy;;mtD;1_LW
zl{2Eg5~#J90UsF-a|=*{wq|m@&iG}T(4w&4la&EJ^mPYXv*ABdMQE@urCCrFt^OR&
zrZrjZ;$E)C7XXH%ntAL!dDAF?cJ#Vp=(yr%XIui$XiwdNemG$me2uY^$OTPP<C;^Y
z%V8)62+zec`hGNRDLZkO1MpY58Xs26SRHKV#E~q+h5rH~0O`K90G88;y?dsM%B~MR
z1LOqcHhd%|RNa4s;lZSW%^cPItz8rZ+yKUE0`f$!0PqHHR5W6!dI=z_ct!v(4*UE!
z^0sbGN#F-*i3Dj~X>+%|mr)=Bae)VFgN3f_i;pW42Ye!(2InxC2~jlS7<-sK<5y_J
z!vPGsjfC)uPv*>sIKhL7Jda?t`PL|6;bvu08C@iXS<pGGA@G?ojvz=mc(S+&uZVzI
zbW>eetK$8J!i95`yX)$@F>tq*UNN46F72sYYv|g&ttI8+7@Ul{LgAz|BdEy!_W$9)
zWVy;?>#$F1qa-*fjw^!re3W85d5JE|taRd4b2{qRkcU}b`;qI0OPtte24+L)U5#>t
z=r$>TbHw<_i|#WQ2^lLdKHzk#*14`F<;J(X(AV<)`c!7-=6=%2?gL>)|HWI@7iSBR
zh=H^vkIVWzKD<uus-frlu&zq6IsSw05_SiBKFk}~uFQrOsbLaEF{tDI=W>=10b|z?
zPo_HO_H>b(WIJ;Q*2KrVAPV(RI~Laqv?;HgFfbFFcG*vB*pm?n$&OX2(oE>AKbsyn
zA}sx!#yL1cCkYW|5C)$#M+V;eMuuBf#1v)^BOYuMqCU~B^Ozw1K!~rE;U>5c8lJWQ
z41F)?blrm#Re)Q3?VDq;qhCGVf9?o>?E073`J{!MmqZ17i6jWB1UwG`M*wrvm86Z=
zV<uHE32K1!E9WytTl*;MFFU32Cfvu_c!6Ng`FO<Sdhkkih2m#~ca!F3IGcoKS}(UI
z>?lNFTu#e%)VFq?Xt_dvZIb#RWEWwI=)sA8(=&|?OP-+$!|OwoypdgNdC=o#1toW)
z!HY6CbKte_L`+-3Bq>0>izXYGR@?c;IY)LiAb_?~swVO!qS!*ZvDlhF?bjVyO}KCU
zae-=0RkpLu-$XVobT(=@+D;}giFP`|hh;ltu^F!4k4fIMt{ZI+#qbHgKM^_3*C5~n
zDF)kB-)mJ!dYT=gEV-PSYPMfcTo!QrY`)qVhvCdw7uTVK5JYwu!IR8i^TmS2)iT0H
z9#oIKb71!o7^R(4&D)Ni#N9Gzwos%R>inOctff{4i5=1iJLO64Y6E;iEatw~Q>FWe
zv5mh&hJ`Xo7~iipm+iT@W|yX~wNZg_o7Q4w0Dl-<CKf+d+e98YnN+-*^+q57>wwS%
ze;R>u)b)oq-v`&(+ISuL)UJXo5OnUo7BF08j8~{Ba%Q~f0jAl^m2TAh9jfeil6<jw
zk@iOLTR$y6SsxeZz73%p@<3W6NTbZ8oO%-hdXDz*uEF1ZnQicl`eOG*aKhy;#zqp(
z%ql=e_ek`I)I**NQS(sQL2L;Cx{AL%T{xM(qK7Kf4jd;y2n@+n6^wffe&^`7xu3Ti
zeH?#xPpD8nBUF8froVTO!e>MuesRPh?XyOda_j!o4mY0QOqGGo+9HsV$+&PBVAt74
z>qR5w8r|kj5ZBMugvlydL=uvjuXHXNxp6lw$<45JoW<Cf?X6F$PyX3z0pMyB2i+;C
zDMd4|u-G6dw&}8sh~9+V<_~Y$Og%{{=132?HlL$s$!x?SO5%N!&c5Y)&`=@x7bV8}
zFAAH1nc+WHVpZx=b_cBgwaxWP4vd-xuMpQ|0_>JhAQQMs(|-EgJK9(!*sLA7ZT;;N
zMnodTn!<ic1U|PP&h#)f$u<xV8Op~faY`(KDXGCY)}q$xQL&8N;r{6@lC2F9XdrjL
zuzx-<lPw1!ia9-MTz8J&q%QjnWy@+<Q=AzZUFYwU9jY)G^yZ5-PaN-Yhnhr=-d^U)
z60Sd4PmuH7^?GF4eA?(Zju^KZLfSlU=1QthCWHZFb5+F9&t31zIEauD%3acTQtydG
zlAd&%=b0JG0R5fNRvn|WYrE-&E+-g?IIx+ccv8N4Vbx?C0={|+GL(c6O^~hr2CgDw
zf#pq=I{!LTz%M6Jo8bCeZKG<HhQ`&TF3FW-@x3;sgMy&U$`~OgaA?>Di(jSc3h=iv
zmU)Lxqot;YRh`bwpej*rT7Cn!h{EyhdWB(Wk6|pLU|vZmN!#K{fn9=a*A=!F*TJDK
zdH&J7BzHy^dP@_!N0dfbg1s1}0)V#FNs2e?s?NDO+#mH6q?Dz1pX;@m6aRdsVT~5M
zFP4!Er)-h|Z|79`P;(@Fr9@4QK=6JTV-1)wvm{wMA2LB)gv4gS4X8@OzI%DeTzms*
z1)wGbB&Wupe&Q5xW=TYnN9m7S{<27n5uYmnfkNC#`aBpU{B3TkI=9BWO)8zXlVKkf
zG`T5`wi)U~LzDn$u?~J58}DHe%mRgz015outRgpMg_!I?1Tux6qG5Rhe5yBVbktUT
z_W0V}JVG`X!V6MZQbJ&M2g~>q^5R82=P#S_1AuyU?v!foL$@f|V&|{9tO;U44HVc0
z4PUy<&W*0j-sw+Fh+LH7h@?5FCRII6f%`1-6WA(@sV3Dlr-8|L9lX3#xd=%rrFlGL
z#@NYn=v1t+kw<mdf@?%kW&#1DhxRLgTdhC|9O-kFYl>?~V!*{sfZ%$hiC+*E1<9d0
zbR`LD{`4?<p3qDr<grQ1BdRCjfRB<#BLxX1<N@oLc??SBj28aIiXG)5eMtcFmSu>~
z1t`CeTvV|Ome1oaBn6PA?M<8b`HG0i_2n)z;Sd!pjj^H7_=l#Vz+`@z&n6e=0_gLy
z_phm6H$(zTF>Ob3kZEz<TZjW`2})sqiGD#G0SNSpBbf+EH_Lk&(ukds<xA+bBtGRk
z_f@F!k|+e)Z=SG1vjfo=vq_gqLYniWDyBh}crYXnoyCv0j}@WUxOSceD(22kLzU!}
zQ&TY=aJ&8992%GNdnG=wz4>naZmPSmKH2_we?K;5eYu|e?)**H$>sL)5SCT<o9=so
z_lx(3aaDhdtbwa1Gi>d^?mK29Y)z}u*GeJPY9YW}GALEE=nGO~o_neh647E=hG@}L
zCbJT0!o(odSqON`_anpR3W32Qam%L(mDH8)IqYg(Hun!O($%43w$QZK_|TY#EJd6m
z{-W)ueREoCHgdJLJ__KmQ*(}K(PhHC{pBcm;})AnV98g))D5c<gJdG|Ohwn`lh&x*
za;*x*HbctxO_drLSpSuK|Ay@TGR})AJ+g#}+a(IvObjf8eKPi7VuC=lSg#~5am8{F
zgVisXFE4R2gF!`oI1|WTuLmH8$wVfshkn2yh4mP(5MV;|riU$Me~)e7)|M#J)n5$z
z2-w4+4D%aZkTX`YIVUE3q+K0Ro9izrNaw{ncL`lwTFUc?$`GaGGW8Ss0nmbyV6_;T
z&9(gFY_+}E&`}oO2eq^51D6htBHX9%U&y;XVf~279sB=_v3CsaEc)6+W81d*i*2W4
z+qOEkZ95&?w(X>2+qS0PTQm1g)%@$udp_*i=kq?b);`aAz^y}*x6OI>B5+{)d+rou
zSTj&#N{>+jCdnh)qo%vEgrIdjW#6kdTwrLp^$IA*0o>&FDqiX*57s`cd^W4f&9rd}
zc0EA+lCrWtX7zLOM1XOxG~_?kbhiIMU0`MXZ`bs#|E;EDGN~8kZfhrT4?m+5-Teu(
zQ>0=xt)z{D5VK|f=@CIFmyE@;Ud)Z`W0HyqB{c8xm~%NEB+MbVNi71F3NlH(Vf1dK
zX=TCN{Bjqn-UI=|<QuPi8t%-Z%2dpw`y$V&j_Rp+GJ6hl>z+i2oO~mJ0%3F)&<{2|
z+#)=NO?BsG6nJBuVo{Ck07l+HOx0ulasFByw%WSFsSg)51R(!O@{M5O9~n2=mmuD!
zv+kxZ(*Q_=VC+^{EUz-BDKQe}@kvX<{SiNW@xXCs=2=aW_UR&eOcwlAhCeE#%I`0F
ze#E)_T-K(_4<wTzPh~9USI7?ah6VOZ3eN?=Fsd?47JHCO;x%C`D<m1n$yrH#X31@s
zUO>TI0&NqY7*8Q0vQw)j@bkM@D~_w5xAWWG?SAdNm2k%649C5+!4m;N;jc(Yorx{y
z&*ylY_v@VFm^kXSwPsWGkce8&##1b&&OLW4nxI_pY<8X2lm-yrpVg17lXE&KuUFe^
zgFMiCT7vHBigW0e!UzOVjaO#KnaEksF-QFRej>jKS{50;@fVO{;QW5rD9vW{1{LS?
zt7lP(&YNoeuB^wMn9I%xFSpiK4V=zRntBJl65s;lKRY7ZWArY4u(8RJ_73-L2W+uc
z{vcTcz3@9a=gmvjVEoEF?iMWpQuBY?<wQB1D{Tj(S{kg6HLHwMJT(U$DPTH(`oS80
zS+%u=IZu=VyGNcn%kpKUfZlUm|0YxEQZ(((x%8}Y{}Su$oq7ILg@NnabX=C^#Mf4G
zVbf+lSxG(U;6K^rlBh{mTJpl9O%^PjVD`e2H;oo2GhM1z5W$}|iO*e(trU(m7sC>l
zE2-w_qOvCHUo96&tYd&qd1fsh7)<U9h6rn}J6UzOl2S0A63_-iCPho8$08*b;o~6m
z)hwt)P@-~2ow_y2xb<DKW+j^hG)d!O)6CzND|%IjK$?;@{WhkNMX0uVv=i(*!)v!q
z@x8GyR!}@g+Sq?Y9(XAm@X^_!Q}Tx4lE+%K=?PebTopvev8z{4D@#I39Jgh`|BPW6
z6&9Z8Lo@s|HLk6b#+?>X2Nhf(VB_IuPQ3*C^^bqR@+2y@%-&hP-7`NR0Y#v7>juPT
zvUr12Vs`_RMHLy!6LlV(AwQ1Q(ie!ZRVSv=?JbGMxs_Vt?vTCaIugx9C91qm276<H
z*2WYmxPTvZhsI5~e&ZcpezTJ!IFTraVf{h^M^Yxdpprd0vWLG$qm{@B|G`sTgmy2=
zEtS;ti;^vuXtZHBtHB@%BE((b&%r-oy@hMdvi$GteO0y;c7{Sk_oP-O*Nl!8J0sr5
zFBWtZ%;7Ag@xQ_g9;;Y?T68dmwK;W@(QAi$ndSbTwg4SuW_rd`FLG)aw7$G{Po7VM
z8MKfl^KMvZAld@U=E1iFHQyJ@Qgv-tY#pw4f~FXELh=Xj#PN{Q;45PV>MV`(rALDM
zKs;txUZN{qI+|pX#u|^JHZth(|L9Fjowhe*ST<dLz|~Obx)g}Xfm|AKDz}A!MzVCN
zx7#ouM+stTwE^HkZUElKZC8oGimSiyzYDwjgy_@0^n9AIqD>igD1A5CxI?_3H)-8k
z7BLYpL=CXHi@r&lralD<v99#>h3=^4v82-W$o`1UmfoP!%O!}vYilbZa>ow;szY;_
zL_(&>84^uZ97s)){0nL>38DQc3DIacjzg&_O0<Ev|L`+ZU)QOwGN+z5T|3Bnbd46#
z$<k*V?WfAQ@cu~k&-8^TRA+AUN!G~jWe)JC$(FKtDL<!a;L}>K8JBizv8+}rMUS98
zk{HeTX1`@E&vm84Q%TuYSihXt0<HT|Mj&Ve%j|ZskK^SH!RR}6bu{oYdJ&T2{+AkJ
z=J(Sz;rBY)-hZn2|AA`2#LoUd&3yjvIC-;%t^J}T()Ud5*yy1s#!b}D+*X(p%xD0W
zbRY~!@TU8s#>r|*x8>Q_d)AgF&-UMvYh7fNt<{6I4D(!%wPIAn?|G>)3d13(p}}#_
zmmwDU$|z_CjM_W}S`Ns54~hHX^YKRY9)SXai0*VbwXB*7Rqi)tzHN#$X|+bK6Yq(<
z*<<0?#iJvenSpX0bA3LVzY!A?e;|-&5AIkqeYC%x4o#M?&sp+b1LIih6MBrzp<JEz
z0}5ht=!kL|=j7ye^S0mCXwSJ4dC7ng1=|y7t<jvC=fiKq*_b;~ybBgx@_wPY5@&wY
zF~(3hSFmk-sc(q0pH47~gQ2!^xIHQ6ovNBUW9%J6JWf_*_XkzdrQjGdl$2t8!}v2Y
z+^*f5iI?8y%B5`Xg*_F|FNs1E+C2}i2VZbyqCkzZVIT{D&3dDR;lT&S4eB*wL+?hg
z@o<Ri6*9GVE%chidYxb4+9x)*IMQEqxcOD0!6P9u<<Brgk`Wd>3E7p~P*#qrWiD|H
zYk@XZPyE?j37^U`FMVGe=LK2=dK4#%9t7=-o;yQ94h0Bz!Kcy$p&t`=t*(5K&Dtw;
zBwFdCw>{tbwA4p#@9!*>xGHJb(fbMK3hMzK0a~aSDl6veT82`F+V<MV@N}m?4KhtU
zoN_sKz6A-=Qmj@_DQ2@_P+$!UpllFyC-y5(yt3%h#2S+1>1!Vj|M*5mx|v$-y$`<Y
zK?ng6&iAao#t+wlQ!bUZ4VOP{k)*k3%G7}{aF6|yVHZi_t^g$w_?01M5Hw|cd*!h)
z?E%}9@h(L(H5w%86=9*_#BBwhKYr{Voqf3FZMbvZ%wP=OU@*>N%w*MhI6v+Uj(?<m
z>EkoX#j1VP%JJj(UidX?d3*cuVqwA#g)JUs$*0!YIS|qCi}nzr<7&C}CdpTRv@Cvd
zPe!6yXHLs2>uimbQkz20FPYGr$STV&xL)X+J;;m`!sJ~dcz|Y#CS8E!+9dke6*F58
z{}Z__Pv<b++--;2=cF~Wjwi*ALGS>b+T(=<AH)~?5N`3sfeEepcSw2Bl9CVD<C^r6
zvW82ImEn$SP4v#AYXeVAm!wXl`d?Jj{dMx5U=-S@25O&g?0?gE>A)G?9WFpGPo|TX
z+xGpbwto<0EW}6&Py&`EvMUg=e@}Ltuf_yz2Ht(Za@(skN#wrGx#7Uo)O_XEa5_C6
z4q1;Kbpo#NGB1c1Rm8PgTE9RYd%FU-);QmaXRL*JEXt~0JA?oSicN}Z`~=4U)Rkzi
z4N2LvOWx92UAZeNhSDF55VM@ta68hGN7j`B>kvBDLKzg>#10s~2ej1xuHi|5&iJ5&
zYz}M3Ig^^nqb>*`{8pMn`kLG2E?2NPc;@-~;ZobH80Sk~s%mgK54LS17N2T!)E7ZR
zv=845+8gW?d%vJjzQ?Tpw!!G{1AqUR+MCPa!Wa5#%X-F#6GOx0&g|vJ^PET0uk{o6
zhVgJiya7dVHIa$s(vC6W4`D0x27AKiV0(HZpnpm@SD<V^dH%zWA4<hYg{L2wkbDv+
z>@iKfEJJ#rK?u18x>MMYD?t`(9}}RNL-m`b<EmA4Gk;#<7^!Iey{f{;-aK%yopC)i
zefbL&BqHdQz>2%{zzj|rDRTMTd9lbxe%uOjQPIx(a*6^}Bm@eY!+Z-t#edPd+~85$
z>}TvJJe`N88RKvM{Q7nrIDF^kms3u$m9_P}ni;0{Q}t{#)#Z#lXz+n<3+4weAu_;A
zj!rrxHvRF2U_bPnfs{Y)y00VIDnUm8P3hGNYIcew=J#0#*IP_Z_y&`Oy59J;$35}g
z_TKaq9OMs^xfo?imh!7X0aQL8K}|71qXGZ}mFC*t5cqb2_bR&@*5gaTq^T>Zd<Lx>
z>o?<k6x5Guagt-4`!WA0mkAZ$^ta`?<dF=*JBckXi3IhO7zjm&=ud&G!b0U$w45T}
zH@j{RHuqCd%cNV#M=5o<<>Sw+b{(9DHbYZh_YnxpY(dyXM-{vdr3XWGC3F8Th70wU
zMmegh5H2e9wmC#xaLYd^ctBW>4OB&Zp#F49&Nt%*7Fe7DLSX6cL}<?ahC>p~Y&Q8q
zE7sBI)?rmJemX4&Ko?U+kW4z(z0m_-rd}K5%AIR{mWkksZcZG?oI2(a{V)iO1#B!o
zfA8{b7(o9Gwo1b;I%m*B*fovJPAfnBfN!MkO#VYt<M<EI6f+AG%YT=FU94$qzsZjB
zovU9zmSz<|Cy!R%3i7r4o}C@j^t;>c+W%sY=$B3{N_A68+3NR8&Ypt3b-AlHR-LF5
zXYDMUgiepsUR<rPJ-T?H7>Q1C7)MP;^^N+Y)59Kos|zmCW;9iAug^o=OHc1UL)2D!
zt(}{(TI<?*@5~!Nmz8QQhcJ|ccjva`8PCRn=RruU^n<=G!=mVk>KahQMdWJ4%1>vv
zr?cb6uP45|H>ED6;n?@~-2U=hy*?fN#N3#LpBm@t@04WCf^&V{oh{QF$tzv$5<tIV
zy|UL=Ja{EMX7ookXO1bh#+ip)AmSb`k+$a+<xwWjSl&oS!z`bSHqN6Y)0}x7h)5!D
zz5ggd)B#o%yOG;kwr4gAG=&xp`{bzUUO4<J_vjdG#%y6MjlE<)D>aPiw5n9cGl{vq
z>;&T9aJqSD#Ug{AjE=(F!tCXdBm!8G3lXC@hDDfga1Oc5`Sp|NAFf3XCD9q|`$s&5
zJRUBH0|K8IBb)Tw-||@bz`|@!9g3LvA`lz!<nZ&9uQuzXSLIgK%%mJHzDy|Q2d5#4
zZ$P7tKya5mgJCWcEmX&sLBsKmH()+c)SEh$BFzw#e#7ZhnTuXxbk)Zdx!^;gfUAHX
z;jCd<UwsO23h?f);vr7Rx?TQW<sl9@z}v}EcprWJ4+#V4F=Y1x!7~J#F>=vuwm-l~
zZ!^e3m;;%Z<oG_nFv!!4Sdkq|2b)JAWf+x<{mdjanAV-J4=jj4CfHk&273(pu^I;#
z*|BtJwHfl$k0T%81Z^dF3uonv2DEfMDb`0k%R`$g2#(V(bb|^?kzB|MO;I}_Q{pP6
zy}H&fs!@Kfd6w8{P{vH}Z=aTC#qQ`sC>fN1FrrBUlTIm51U^%7uI!Qos}Fm1brd#9
zXdeUjvNo~y!tv|ZO)Vpa8iRnZj>ejv_iIy~i<jfWpb?Iyy3S8i_a`Fu#vmB%kaId~
zt(;A<eSwmC^~m9jN&@d!^(H~cUh!sXzqOP0zkl^LOSUL_&fCE<fy`+5M$1bkd#XlA
zX}z6x#g6KgbQ=)}HwpjdvOnb3*g3Ya#fzXhA`TNn<CX=9I9oRBFh*bII@%=@+#L0p
zbhNj;L!%_~ofZ6D!3+oCP9&xCY$^@cf?R(q6d`On@~#TEq~2WFh3)!GmL%?N6Vk2@
zHn>8HCN~Qxdb5l%>WEHLe6z@(MD%7J?loDP=%Ts?axnoY|B%Ff;aW-^D#ySG!N)0n
zj>c?WM16Uj1|&%`R1^f}=mIcD5JXpCLoislas!leuU#$yW6JsCGcEU-v`YFmfyW$Y
z&um@&8R!tFLE}?&BctC@LJzu_ZsVNnol~#CL0PP<V`v!Im)8y^TB`ZY=%Ex@pAK}F
zJS`QWAo<fltP(}Rv7vNP#p&TgqibwM*(sSXAoZQhC<%y7=49;~9qLl-`oNpx$nUtE
zCzB_kSLVpGqim*!e!zV}ed%~4nec}VC!^gT*rh<5=|IV+e&<f}4<p{*QU&|a*A`D@
zS>(FJ7r|fGZR^`j#fB_?C=<lE6xiYTf(AWIw~i^hhbzs5g0BnQ0#=!|+F7;YvgwkQ
zIPR+@1yfXUpmJ;oZz+#eL^C}%-fHDXU^4<nLBu-dm1X5s)4;4L3v-6H=y^*_i(jw^
zxP%W7?f0uvtg?#O0cjLms~nXqNL$UI%c$MJwG9jSooERVrcc{;_|*36c8fuyGp1{Y
z8RSx@j(L8=-4j;q%wY0Dh;kv3E`U;6R^GP~o?c4XmmUb4XR-Mva}E9t(tPiQg6S4<
zy3|!LaRt&s1oRWt2qZ1R5JJX4lEV>BcNxI|UqJ(Z;mlOzvNox`g#$pGxr*xIM~rkN
zD1j=Lr+^E?yFD){P%{}poa+OBJ@;Wz^hJ7Yd{`pHi`Z`oS$6Nd&M8c%b4k?pzBie?
z!F*DuJ7Kvq@X^*qUN$ZKQy)C@=z7Zf83TdvN(lS5Rz^*;AFM7;CZ<0HTwZ*NZfG0_
ztOL}Q2(9sW{|v@Hique(>DHfXtd9{q5|-o_U5z1wo24MHS({X@<g|6AF?A{)J~nf=
z%Y+ccMTOk8a2$eE!xD%3T-QM|1_ig~cWX*G*?o4Hsxz)1tj-jhyM(`5^Zqgc7_^=$
z5??Jvx%k4!lZ@JlMv_-=PwQ{us$x5B1h36r>t?+KM-%839a#m<hESACLnSS>SuE5J
zo+)9mGMUGNKIj?~N`Z?5!ilO~fs`#Ss8Fj^7p*j#3)Oyw0&lhV0WY${FqU{D)RkQ(
zmXMPK+!Zi#Lpv7ywmn-us2^L@q5ZTQ4yhWB7}`|s=T7x+7lg)SP5#Q6SbqNbv5BM5
zXfrM^hCg~G8L7xkv#dt2nqvTzmHgvO2g6{>;w!!Iv-p$!2nHDzt^Xs=F*G-v)tf+u
zY2mi@kHx;!orsB$q}^F8W#d?8oWnum^GV4wEo&k$;k!Uo)sh+_txa)|^2Y8yP<ZF+
z2i{M*`tn#wD|JZgo&rlqg;o=mHC(jz0j}*%#i0$%_FNWSrXi`5F1|j$0!ITaE*A-x
z2j9FVf8sWA!sa-=7`GHh26d5cw`qKI)g@FfO67(mPHDa+;Sjx#BON?Lpy|V>g^&Rp
znR>&Q#C{8E@{<kHnO$|o-2Ii?*T!pY^_8d6i|vv6sV%tq2*?;Wj`b~#B^4@L-SIOi
zIXBmLHcad>(xNdiRk3pX2eoSy`)Lhhy{i`jjK^}|ZB=KgG4`+xaK=%K&Z>*?X$~z^
ztTRC)IvXq)7;_P?L+s<xh$<QuOBPm`JzXqrA0;|_pIm(6tAl&p4IBP`cJ^bQjp8A@
z>AU3?d{oAZ8@r9cwepJz10P&`{%H2xh{xBeS=Pv}O}jIit>}bv;F$_3Tm3fA8sfjT
z)79oM@n;kMaxO`o7~u)YFF%sI)%cIhb;cx_ycK16Lm`%E)xFc5-b|f*k_1!xPCNWI
zB+gPj;=q_MR$4=|(LG`%znoJoM|Qbb<N-OnpWE@p5Hm#>K--ceFI+tA93XK|&ZVq@
z&Y&E&)@7l_e6^mxLAw|${7*Nl{{Rp(bN=@M;%ZGz`@=S5-#q=j*0KQGYAPl5?S|OK
zi~gA@vnxD7c7O%j)!#Pl^8_lwj|=5tnsbXuiNHR9XnmB4YJF_2^gdajfMen?r6$9m
zjv3|Ax5%N{#s(_R=lcO<zl$}Ijy#oL+vn|<e&V61s39`?{^7k@$MVtfp??3F8ex^C
zx;3>a(NCKeZ3-A>*fRGFh_YI*m~hIvn(S7;O2QZk(){^O8lgb8F2X2<BMOCdPm+ZE
zSM)p_R*E55wx{?3Ycz^j^n^l)RkPdzC#QC`*sVq;=pFbb-Y@K&Dlv?b#Fbq5AtD2m
zD1#lBwlMH|7Ub-GQUtsA4il-n<|Q_GE#r^W(M&b(CEB^!FB&P(trXkeb&rjAkRfB1
zXxR^+zW)ricJ4OV%9s(O^_^C$MHN!U6u?QX9h$uUBvqYNt>s6{QDH|0n=Cv*P({+M
zg5;5`Uc&Y2A85+6wrGohqSZ?VH8@Jx!`(uzLo<BcYz4UQ<C^D`DCdkM1bY4Qhj;rP
zjq1J7ot+fW)5-aIc)U!Td|=E=yB6uQEt7d|R_!kDtB^TqUrK#-rU}asij%u-jy?dO
zP){;iprRDhef+f%%%+o-!YdZd|Fv;}A6q!CcU=n6lt<RDuB??=#_j3aVyPI`R$^qd
zw3A4)Kr*%Ot}<+?to>k-CMv(6Kml6b$+o$siAlhQ1v(R0-fRIn19p8!!Y6^4vc*sj
z(g934zNEw9Kq!F2lm2C|h|=Gyv0pnToFP4{FG=RCuER3TooYxd?j|#a&j<l23F6!v
zhz)?dvcG{}`P6Q$GQ=_~^sSw_e!6C(P9#HnGth4-aEI9JQ{}OPo3`+Dnc2{K<Qe5^
z6CPx8m}OYFahF<ow6zp&7*Yv#Ob&puq%sjI&DjAWrXw~F>PJF0xNHg0VA{bDM|AJ(
zC`@ZuBc!=E*eolc^k`rUTDhOVlp&ToP>9^4>GipqAXg1w-0NmucKgLsY)BJHdiA5Q
z+~MPSg>X-z@`gm{60vDdD`K`8!%dRLumG4jR@*r1E||2CUAeIdFUbp1Pm+*?c55%l
z*FGpw+qq|b2h<!$f)sWXP+F!|&C4QLqAZQrWDgkD81GNaSlYRawktYziS2i9UwzVf
z*_V4Y91u%3N}8Y=h<OioMLWUD#FYc-X@RPN)V`$agmYkTHcjV>ccle}n@wz=TiX{b
z!}AFpi#00j+6A#-w@r#QN|w&&u=>;aT+m_~Y*i0qZ)Q%NJpZ)ULj(-={XvQ<fnDT~
z?R4WHqq^RAR$q4GU)bwx^hM@U4_VoWgoDCwDbfF47ij@Q-wM$6?jmYPfa+d1b?b6M
z&PN`ndj;$7E+~o#zH)1$BW4LW!nbG&xj0#ZW-;jrMRZz#MaMX&THvNuLAJ?Up9`-=
z6FrKUV20nqEdW&=>X$EJ$OuI{QES{+2ps9Jga28w&GKz6aNNqrK$Rxc>_h7mPm&!>
zzk-l_N4G*Kv)SMQ2z9pC{SEo0<^^r{2-)HvM$h1bBUASzKFScrZT4b`uswZ<6qvP5
z;Ca!#$kU+38gH0!@A$qBj*mkMz^3cbYj7#=<6ic|21;Ye4TfVRvL!6-LQ~EqtDIDE
z=vdS>-v$)|_AiH9=m%EG?<KYyScz%L6c2`MunB}TP}81tT-x)Gb^=YjV+Q;41|*vE
zM(W#lc@Qg7m&9EM%APjJ9VpqB(CI(uu7$zM@wu2v2~k3cNBWa{R-xUH8xxS<UTbB-
zHG?{#Zg<EY>m2TfupfAR`t&*b$YYjP9EC0&y2eV%)je22PDWJXICVtR$^pZ%N1Op7
z^eCYK`f(5qQ(Ysr8_T%M2Z^JKzsUAzGi@u@4stZls+k3efG36`jFr3hk~ow`;<kT~
zq!c~IS$3qHiK&WOY?vUI^kn|fckaQaNeP(R5d@AvgT?J_v4s%RA}L*WyK5EftdvTm
zWbG<3hi02ittO7AxIde&dvy1BZPI4vg7Q@0Eitn52<q9#6iTESAjyDzI>M3nRAwdK
z2ZWNCL>}q}GN;D6C?MwM?7@w$0bG|cySxMjsGYh>NQgvwdxsjw9sp95GN3I#`_G<F
zp@r0B-@cXyU<}q3a7xvQ3JpbfI?b3jTqr;mic_StHfbWrc~iuL0%JJ$Xo29KSQH5r
zJ;l_rh>rwVWQXv8Jv+<?S4AWxV}YR^jT~KdWE!KDB2<HdNiARd`*W?EiXD8Sptmqv
zF~?Lr%MGw8XNj`S1ovD>q)sp>@3ALUoin4b-Ed@3o*Y|T5FCW#_T40KKdt9$x@aPY
zI&u5S%5J-xR24*IrRZQU<JN4AGnEtbv5|N^hiAd)O?BKs7hMtgw2I~@Mj3tn6dr<D
zjb&AhruOYEcK<&uA9o51$|xa@*|X?J*L_cPBs-<yfe^?Lh$o6bW?Igmx1dI>wKzQZ
z$YP;|ziWnrau5mv84pJExcsZ!p)(*6#1rx@h?EDWaXlOAxwUCdJqdxs+pnh|5T+B!
zWdJ{^2$h+sLaPR{yHpdPOfsE{LV`h|>GUeesEeGAoz^w|a(Sol;$+#V`aE4>ho`No
zr#J!`p!=X)U)#^Y$cmYK3~cyeH>^?O;+!w{MzaI%Wdd~uX<)^Szv<0#4-RH)eQYbc
zJ$Nd^qIyUMyw{W31LKd}zlv>b9;{5_h(yaR&k9k{1;ttm5(af5vULPztUU1?UW@_Y
z4@HLZl;yF&ezj*Q%IGL<W{YhFjP6}GCL}6~uA4htwp7mP5}jo+WU!5#A9<+wfc+I=
z?hD@cmwZ1di;<%TrIZEkv<8-;;Q(O&gefz2zvr@-u$(=XaW-8s0MJ%HTd`*W3X&tr
zgb~u7wOey#&19W-t0jI4=pUeii9EMHW*SJja-7%0clMgmhup;7#ugFV%3!z|1|^*6
zZW2Q7IVB+0_+DVK6++H~=0kgcM73Bx$!P7FDIKN1$%D#;kE&ChKeTxvlx7)j>|G$v
zJWkxRig8HnJW*Qz?2v);D5bV%&m4V@gqV$mzOLU@YG=@@KI$8qG5v4W-4StlH?I)g
z#&q;30B%-RC_QY}L!xn}O#K5a<QYaaYmCtP1xC~id82e4OKR6_6_5^kqidvfbcY&h
zcDdz#D%+Ve+xL)-Q=W{_JT`vu%(2<RbTEpyk)#Cul$djD?wX^V>nC(#2W@L3m;kMf
zYxwxLJ)chas7v4Ma!-T31d+$)47mZHD<suj{Z#JnPmjcy(4HLx#GDrj4Iksa-;E52
z?W-{DW24jwVKlU6j^|A`Rrb^L*}3v^X^r;3R^fFnf4DePJvfgu85x^Boy!{c3%NrV
z%|ESL_4}I1C7^W8sPm_|gnJ)jCcAyXc!6x5=&WDBLTU&*pTXG2PSJtbU{8(bScu<H
z^b=$Q`6~9u93BtAvwyn*Q+C;Ly(UO^FK;Rq3{@R;8SF!VxA$k<EGAIqD`n*hI9S+}
z*jm7~OYCEIv|J%RFNZVkI3@GuOnT`(v<MX7W<INCphrJsG!E&_GI9N))1`Knoi5_Z
zEXbsEW|N<S@5a*ZY2`zcxdtVxEks1M0^6*YzXJfCY>$YTklJt}cp*qUd^c&EAN~@*
zi0E#eXdNDmN)_K86jAc-e}O~Z$J?Ioql+(eV^`R$jGe@ZBx#SJyG$|)-#w5Xk2XS7
z<27?mn)RO4LNJ8IVnI8$SRz(q_jC!IaKKi@DMbMjL7);`elE3iKAj~xj@f7>+K*=n
z|A7Ap?Ar6U{HL4te;CaD(*XZZ7s~(pU@k`Um-A*Da?gkQ=~(%?AynXO_xJ>N0xf#!
zU+F7Dj+8)2t59}A)WD{quctFi&cpD7tp!7W@xuAj(G_^<EwI~CyM<ed>88B1#}bPj
za8Y~&4&K){`<vw3s{qH|UGJaUYevHTS8;G(g2VIUJxl8Ig08paPM*v~4fxLPzw1%H
zn^%QY&)1#0=^ldDGRB5d<TNkI>t82(2c3BY#|Qg>=L5+fsV%%0TySLtz>^5Ngj_%1
z4m7(UaNdrPa=mkhx^}~o%^JMp_V3t=BFg^XU9(yieOh`RpAavRo39JIINT_LoBb4Y
zdp%qT_R39l!<j6?Sag7Sg8JiCx!sts<|Teb4bGH?rk=MbPj`a}R!T!@Raga9mU=GV
z%0YsJ?yQoP`A!Rsb^J)B$Zs4P?Ym6uiymV;9&||*Z1Gt3E_aa5^!|mEQ-pPOCVfM^
zigQTU%ldN|UNH$hKIZb4&ktM75<RxA`^)jw`B9?quGtj2jL?<$MUB>{o1zRGer)S;
z45C#ybkxb7B*i$-D72Dj2~DR^I*$ijk#`qj2Ri~WhsxDiX6SHj3<C+}{KMK031iLZ
z?MKM?yoCAi8Jj5rczTH&#r^@A=g0_~ty~;U7Txw9|D^R+ER)07z=7#`bxfE;29!U9
zuGkvTwx}U`re*?zmzL)+O{|_sN{R50kAJ(C=<j9eQO!ign!a^8rF>q8p>kIj04!x1
zMY=jH$au7*8?Z;GSUd%As1g(n`>M~4&VWNS{qU4=N$k2*SbsQ>-B!V2R=;C5z!ud=
zmPl!3MFS0ockN0~t(@6z*L-$CJf|}fYjadD!WDBuGr>5#Ggjtki552(NT;;gKyA|F
zQtcoHbEjuELPLGfQEG$XVr#1yu=KdDS43z@Yf|TBt1jN)vh~t%4XK>cwCO0Gi`^Eh
zt-XY1)5%hbDp&IvbrUt7F3MoRxc6zvwjcQ|O1MlaQaM|`3)JV3x({dut{}`VzC`^&
z1y5Ryh;H}@{e^0WOJ`S8FZlHb>-{3oxn%k~cNQ_fN%#-+&8rf6(t{1RG28wro%{#z
zDYZLdCdIsFVr{xSIIVcjdxYGk&-cqPhW38bJqwlQ02^iu{KsX|W}H(U*F?<Bvf1D+
zG1>%~r`Kahzp}vWHbHk>qH1?!;!vk?#Z_s6fz~A-Jd`fyy9Gd>Q`m-SsWjm%z8zU?
zl0OPfRk<j2IVl6jumG&TAD^&^8+b7bi4=lVYz>D=R3F-*JSCmEMrl=@N9`)Qp#}?d
z(q0J9CPP-J?9{tutYDR0d)J)CS>~&bTI%Ed(*F<BmZ7pr3mme-FGsVhLBQi6nKmU>
zGln4nqcxG-&1;x!*a6rzk8$GB^1SUf)o;n`Jcieq=i!V>8WQ+Bct34q=K3sBe9sq>
zv9=glXZ+{8_!1+*P~jFCQTh-lU+gVEr2Vm8Ad-p3^q$~^$eZki9FLH;mPOM0f3!eX
z39!+4!4G>6DdSv=(JQ+Cd)-ZHOt&)n{nou1D$$$W*@{Le<khu#%hOTKwifBFWn)_$
zhOtSSz=%{`GMt6VYr(XhOE#T13r}ZF<ki1vkX1=mdoDDHcJ{Pt5_Gx8PIano<{<~g
z1M8iqjWCPt{LvNFeLi1K8QYoD9t_}%%~oLY2|ie1Naf@uK3KF35Q(wJo4SDEmJ-W!
zTkH@FVT6XcMoP8HGURy}vyFT3g*+M-;qn&V!mPc$hv|5&zZgepB)u2}7IGsU={SuM
z)LGDvIYuzuuOLOw+%BtF`$>C(qjN=`1?*7xvh-bv5;9oTpQ0P<-<NYE$XS{1NLb2R
zbcpW~TRungpskUB_a=A5v6j*Yb~#uzzbz7myKE99BlJLmd0`LG=uhh>oH@?fnI|o)
zpO20Mx{%DDyN6OgJ8V9Um5rNZrIZ=AJ#5=0ME!Xx532AeV{&LUH^^M4T_{2i=<r_(
zrZDDuazu+vjnxo=;hJc4&CKT+!?%y~x~L<Y9)W47DMHG0NTMB#`u?t-P3R?7`Kuhj
z6O^0?*+>MWc1lhl|5S?PHu?SmerYQtW#lxazWJNZk(8($M*wCL(;o2Xc};#qE+s>S
zZY)n5-Mc-K*xRq$ol!=N^&3Xl$qY+~{sV8zxX<VKzpw7T5!rjc?|_oubNW0K8^nwB
zZ>P;d5qO_T!SbcaekFc-b73iyEm*X$L~9=eQo$dR!|;XJNI=#-87@5e6F>UOv-qX}
zCqz<Q25-p7a<NRDv78Qw(jk(n|7ppy=Iaq3pt}Xbh13@DbXw_$Eyjl5hjxFG&Z;1q
zRxQac|5;@!|HsNZ;FSwAwAr`c*;_%yyAyK|ZHwzoL0@hg4+vo4wFTz^s`BZVfI}Yo
z&L#_ZPV%-5=9>AUB~1Cth%jCD!14#3H{v&^K*Y~&M8Otj`RpyuIl}Y08<i-{+94<L
zm9q!sp#MAhE&dD41Z{?n5RjsCbeA3Cp(z@e-pHZ^3^CSYY+RbEQ@vei|1eDrsyC3P
zkt<*rsy+}3&GP2v-UIqCWM5kk`akd3kuQ`GOs=lf7GH$S(A%_>c(!le-_^f}ks^eB
zkAv&oK5D&k^B@@9eoM(GIxItyf`(#zOZU?2(}`2q{f3gv(+vX20poh#K_q;}R_<f3
zc~9*c+ZH+5^ZofJN259KOIq<w?~Gh?8V_l&A9#SPNh?Uc@_rBtgG*Jxgtq^%P4naI
z`0{p>Ki}a2_kWYr$KMKLfEIQla#-5>T&uNTO(tpHKnVO6<%fv*);U_Kx%V3|Cf+g(
zKl|SDj!dP90jEF-fF@fl<Z53Zb_F8&JB*%BggjsgHYb(?&W2oa0ELMc9gA=h(91%v
zNi>3BFuI0gJgv&KekXWGRE)ODHK|z`pnx|5a!r~>kEaA#-xE&dlVA<<RB4ytX@3d=
z%vzA?b7EX60xZ?%47wvV&-?taLd&Z5q!j<P3ELlyN$6|2tSR(sw#~#~SE^gRe(e5Z
z_Z@ZqNPExlEb;ys&VZ~i-=caG@}g4dP5|!*avUt*?LXY3IR8Tq)IY)Ke|r`jqp6v+
z@ei?lshuNLZ8mZz{4nb@<8Y<fPUf4L<VM7TNkn?k^4FTZtd-Z#r-HwdkzK9>X7v{*
z)aS@|NA1_|qE3?4EH+F@%_{LiSFGi;OMiX6sML6M?Q7F^=xO(RYSq8@MwKwcU%os3
zuG2a9?S12O_fk42x^hh`v5f!f+A`H7=(=c?LKk$a)q)gpL|zffw)t`X`Ci`o>e9_U
zG|Vk#OrCZYK&=A<UIc(Zcl%2ri+hZKm>J@fZ0PEd^<UWHKrYU4p&dRO%$s4R8753L
z?GPBq5qzq1Y~afTikO%J)(tnW6Pf2+*9T4_I=z-HM~lv1WZDWAB~=5ms?J&+9b7im
z)L<uBHRvy;k9$W<r9`cKBkoT(vjk=y&@?Vi^LdVAE#rYhP=7?5VXaF$`}y~z&MYjk
zPP~~hnB+i~TR`PrN2Y_EP?e|WVkU4n9*I|3$jfOM(dCLzfefE4niq|1d#g_N<uh+z
z`p3>8T;>;<o)op$_HHWpZf}Wp&P20@0s>=9d6o%H%@1niFdpU=uqLGi4HxJ*;r262
zE*`hbq<$%z@HbqT30e2)u4x;-8d%EblMqnwiLe;1jI)brq*;c<CKah-sgF~@Uv!yq
zEu^nS+MF2*s)_Zi(PQ<BDmEQQ%M9Fw(;{S?tk1hi=?zMQBN55u=xp*CyZ!j*dR@0r
zQxO))_gU-jzY!Y1oI;f36Bte~jFYr*q0HLE=B)d-S2;{Xv#upfC%7K3dTocChd9S)
zh`DCmU0+|@sUKsv_J}(2mqB|Iu3O?qlWh|HVw%m<4p(2!ZH86v`pyIO;7E7CIx?x-
zo{Q?2U%3ln$o~vhl%;e#kh{zgd{y2*jZrQZD$Lev)_vTx;KIF9Hzh>#@W>D$YN@tU
zn8IAWD&)7Q{0JohdnTB{Gexp1YGs`P*jU_Na%w5NUSjd-Ss!DY9cBe<=MaMlX~PqZ
zpt4YlHt{Wb!51uMY;(>knF0_01|Jim<%IVi=nwnD$5yRZp8!543?E58Uj=QklaN(J
z#`}C3rsq7{iuy|Yl)zUPB?wR4p}3z@9wuyr)(R26*g$6mloK(kZ5oFY5*D=eA*N}7
zV~#zqdT*4f*gV=V4CP{-&-z%#s)N{colfG&q7c%J1^;1Q$VEU=r6;4IC2_AL-hv@$
z3i%2BJ5LB^pW1?k_~~FZb3|s7+f)Cb+FZY|#gq+Uk!ImJ6Il%p%GGOkXe>tV$&9zv
z2Bd$(bkn3?I|51V`+L+7MSq}Z7vK?B`tx{Wo1-|^OT@dqS1=jg1=SlVaFgPWr?HqI
zM^90v*k-P<cifs}8UHghE&e1k6{cUstF@Rh?k>~Mz<@JC&SK{7X6GP?A@(^Hnd#W}
z_)8mLMPS-bSpigp97>!9f-V^`7yO{oYgU)#3Bk)-8@U@4NS2^he<_^%HD;ms&(Kg|
z?oZ@eG+@9iI2QZc|2RoYf<aUV6j7mIuqe#Eh_B3;&*88}TW6I2kG)f3cpPwt76hGA
zvQe7cL@+Q|&md=j<u{4De+j8PWO4S=5TEn;fYizvj3*V9BM1Qv0s@f$@?TUeha$6S
zZ)X+j40kEjE|NE7gfZZD^`OAWkuk3IW-Yq~1dJnZOmo8=Q-DsG6iKFgSnAkC)OtX!
z2tqa$edI1*up+skD4fnVI<m^;vMCO5AwU5fT2$aRZ3`+KGC=8-(he-=P`nPW0~v=w
zs?VW{_VSpwN~?P}lu;9OwmA#21yDbl^k!f=0!h1P5GWM*KIZD0t*kslqH=3V+1?9$
zIx_U+w?u^nIhrNcK)kMjTxN_al2M_X-!3;M#GheFQL*l~e{G#366UKiEjpfp5y>*q
z4FEWX%s|8NY=2*{IBWU@N5kq-TXO^NYvPk_r5ygrP#x`1YeXzMv+;`CLmc~d0pAI8
zmZu)<ZknLR?(tjuYmltB0H4Ag-=^=spPaY|61zYs%gD;3(Hw1UlPJ79=@_%L*FfIn
z@GFCwL0=I-3Ir=U@Y{BKo-d$<r+`w-W0#ggUZm5_m&Gs-^;c}faHgYH5Di@vcU9gH
zCRfuOpAY(?Qx;1y+j+tAFWVrcMiOM%VyX1e;*}O1P<|8?{2PMNo3mB~;sp<kWoxnB
zB5^yocca0aU5EGudXD@=plI}}(Uw-oxx*T7cse3HF2<%os;KL7_9|*p(lF#1Q<nlb
z{0^{$e?bj)yf0>RIi_L23GUr?1>{LuFvw)r{x8ZX!)zRgS^=}DfEA4v)+>+MmDtH5
zve(TlY;h0CTnGS<ECfB6M0C(f?AytfT36uv-Gr^y#JwfjBEF{h^T_!z#@7+6#MS|u
zcqf-&L09@CJd$tFgbU}SsrVaD%x`91p`%_9pRPgNyN7X_3dNq8)(EQ7kPMRah<h=g
z2>RH>#6Mt}Cg!iXhVU><FiVp0ustYclEAP!REh&-M7Eq1#i?Qhlf`f~$JPj^Px`SU
zI-6ni3uvoOMYkVoM@eTRYWKs0=EK_%eMaDC*bD}@6mo~YqG?mGX!N;=L+>gFmweG2
z=7~FBR6o1--FLN^X<YmdzipB$OQYDvhfM$#osL>S+<JSw5O0gR*F!|rj4Xew=dZuS
zULEW<xR?S69qg?Ms_r$@9fYzDB8u)ilIva&a85qI!aSU%D&tfgo%Pd`sIw0p5f&<G
zN6cL?MC6?Ck*Lu2dB;?X`)Sf=>>T0Coutxk<xzF+P4gq|U1kN*xoZ=^yclSLM!=;T
zo#3Uvj0?LUoPdyvzgP+r*1mSt6UM&?7;+mBL*Tph@6`qFFRH_f6!b@zjXoe?CTT1b
zubd!k7N0_|Wmf;35Wn_#eQ=qavl%*R!bl6xKCn?vcukGSE6zpaM@WTFp2OIiSHt;`
zi=8DD;I<ycEl<GvAj)AvUY&cWEJ~WD*AEL~SCT&u{M^MDu;a30lv^a4LwLiYSe=4H
zNVhWtkWz|u@v^6lN<p-~^b3=)`YEP(4~{X!=r}Ws1FoAx&>p=NzkG%cWES4dY1^(P
zud?5cYR;3AQK=;|+Q&H%OY%g%?~UX*$T}{O-$0wR1JG87cFJ?Z?qP3>A72x}*VuZB
zetBzd5+msg{{#*H04-7{a{i~g*nh}PWaIqr2dl)W$U0~J%jEorX;C4Jy{C@N<Ch*h
zFa2#LgM?%L3kQMeko5V%Ajw%YUT}cjsMWpolDZW_3?mQ<CouwJ6e2Y2Ax3GhUSRO~
z*<pm71_IC};`ms8*P|Yy8n+mk`)-qIW}FB8cA8)ex=2)k3OLeDlrF!mk!l;>wY%>K
zqb<=4&5+D}-cj55iji{^OGf)Cw-xt8vJlKC6Sm@qJ<L=f4-%AeNu-&+8&S{y1>p53
zDRkIQ?)Q)S=$H;u-0nS6N^Xb-*oid68&|;#vk*9&T+)xaOz>b{f4wPnHb&Kw8s&XC
zz^n|8iz#)J9f8=uZlaoBA%-28uY*A<GaBe_cSGchW}1kvLKT8QCzjI@t(lLLC2)(J
zfrux%*laNTedPVS>-{^^>dg2nj4Z_1D~3pR@S$@DtdCUnaris|IZ;_USoKyK+%OV6
z^G}XaGD1FF;N>QE<z2D0M2kR=i_h)hRzISG`M~W(v}4GP&qnZpUFTLPo%r~!XOWDM
zwKu4cDjZD1S9RL1wM1!u4XDM&l($gifZ+OLi1kE$1_Yu9-?FGNQ$gxMGxf27M%b!F
zodF(}?|2k3Ugz_Aa!>hK7jmz?F~UJ5e1drF!Pl**BDCEuF$l%J2S|?LCONP5qxBPM
zRbRu-2vQ}y5};*-fxBmu7uI2{01bKW$?+yU5LcMx)!19B?<Mz$V&wFZ-W!FOh;h6r
zwJ`DpE-7*mp!44O^uBw}eIvc#y8O<*`RjM~z=BhE^2=W1EhY~f72yB;GMQNacUu{i
z|DWI$7N-9%c!h<H^}ov~omSsSTonJW;FU+xE)D12BC3kEjKF_*eo>;0dwlZ%l!+zj
z<kI~M7k$Ris&!JcWC)~}_(Dc5S7}_QsU<ITqFTHX7TKA<P|`tGXxH#Al_%WmSU55v
zsTA|T!9g8Eg($bIw81r<Fm`mT%0CZUJbeiz0w&&Pq%O4tHJn0XTRib!na03{L9#`N
zCRmtY*dyRlBSdm@CV2Z`B5EYQ4km0nFD6`a;U@KI(SdY-_icy@QL%-jADYP_1DUy<
za%Ty~_Hv^Wx>R<F#;rG;??NTY`tX9uZ#*8+f@PAS(CT^<13{kE(;<VNl#~tNiwbr<
zT+r&m5_A9TpCpisss{c!QWV;br*ep%)1=N8qnZgjfL2kKjHuIygr&|;SlFcp!LUY(
zUsbFJQ4(>Qw*1$0@Q%C()^P&>?ldv|QgEx<CU~WyErR_H>-lK|%BM4^qagq2ATTz6
z3{U}(sdozj0<1&Gcf;HB3cvb^SHbjUCW#Pv&8N}nitupz44Y5jcCiB12E=IY+Z|=V
z9HAYGij5X6WZsbiaspY!7cz@SWUKjF%owq6p!k<klLk>Ci_tqLh>xQCLL)$QUOYf#
zB*@^~IRa4;2C@5_K(6bWf!Y44mnZLZ!OLUJo^8Z~>fpc|4`=YD&6D}<^f;3Fi?pxV
zx4N@7wSHszL6N3T4|mYm-4qP?Td9o-Is$!lF+9Y{n@4;1>A&dlafS0~ujsbZVWlpA
zLEo2LM^@VXb{Jn=W7KTs@ABzA>HMAJW~!`@Djo^^a!SL<&>N6(Wb3i!*td_$K8@vz
z)xD=<TB+(tX5rU&(j6+HFdJpM=xcWBMWvkbw2zfSqW`dlHRH*CVfSkRC9>t}{hnK~
z7*CkjP$oxJg6KuSO>A2SEev^(tHEQL(nWDe%uBLiI#NKO>Yn&wa<YMDowPIUH~Z<G
z%k%xP;pT{97;s}vNV<f3PqrV`y>+t^=&s%hT^z4(z1~dJGt{o*-<d`+rrVkd5`p}L
z_t3pwpc3517vRPU?r2_GjJO&GL;*kLG)U&EUK2y$QX3CgjuO?R-z#)XgNf#*dP|l3
zW{ExD-kJ*UFqcV>z&{HYb|ENubMv!_k5w9M7wn8`K4&-fe2feem%h$oCm<X)O{gK~
z*wNX+uk1oa7{qg05Rcs*c1X8fH{@+1_NaJ!c`+X+Ql7n*jFGNT)Z6zx9ug=0vLx%x
zs;Km!92L+wO)RLGaDc|At_x#c+KaewQQRK;nOr#i)@`?~qw`W$-Q=y0CvT8nrMfl7
z>*$qo?LvFgmIMo2t$h53?-%yH&ZaL6fhfxt74IK&%2Z1?EMk7^eWj;!hAd)`O5An~
z01hLTl?K10J=kDr{bpHyT0!Imfo!FB9B^0l%&ly}h^_4Wvu$2V?dbXZ5oU31*DNaK
zF2h|JSG>u#*@ZagTt^O9f-a!iJzb%9Xm@K;iUfUpH2rVun|{wH&j^tC#uwKsvjNL}
zd)l6q@EhVDRj++*N7TC%woZaZC%WmRwM$H<3pvBaBXTb%blmg5X*9=QqN}**Of@=5
zvgEW`O=D@;RvH}_G(0`wwky@OFzYQ3EihW#N0=|1H0pLc9(Gj^*`IqAS&bj8Pa2uW
zKkotUUs_k68tjHH3oWQmzhPQ8y=lyQ?NtQ+mg)J9$~iFC`&hqcX)bp186ER{gUC~~
z+$i0QqQDC1SVDWonZ=V@LOkiSB_(Ng_@o}ArE2r>h1dVcfO&R0m432iV5+7xV<wg8
z7O8UO^=@39^b^ST>x(u~|0lckf3~;)qW?;z=jHu>OEU}0|BS@??>N0B2+03)dK-T6
zhKXwlj+ym453UbaQvm=Of`rDWvy+geEW+Gf)mxX+)aApqcXf4s@Zlo8AQF+rkCRUp
z3q47UAXaD>YHTvHNb;Y@JPvU&Ha>*>h2o@j2QKsG!B=HJh1R#LxSHV>E>70aN2*93
z;jp#+nD<nKDrBO%SE^~Kyl<0)oo-6}DazdRn~RoUk?~hU%}i$^=mE*3P?<FeB=)z>
zf6WOarEwaGT5@i+w<dA=?C}gwSZC@&cWr50w#X{G{xF;9+E_hp>t-li7=EOy63N#n
zK>GtQj(6pK&cXlE0Ea;A+45=Gt3o?;-$bE-Yx(^#CA4-tHQ5l(6Zi$Ghcse%W0e)E
z$`Df?X6xY7?%EAK%<!!rud{!??9oFtWxJwUBems2^O@37!<U_UlKV;y3eVK%<S;$g
zc&5|~9O06Z`hWIS768-#aX3sw%>T3)|LdrjiI~_pnOOeU>p!sWe{G4FIG9*C{+|Z>
zf1h?nzkn-bYyX9SA?;^tTWst6_wc~8{zF}a0>R+_p)c1cyn+t!NW8B{QyCfAZ{NM=
z+vgS6zNrG%waq(rFes*M5XjDu%K1e>-L#;vq%4erGD0d@A?STmQzK(jQ!w&E1qe>f
z;NKDm@&(W?uE1QY58s2rQ`i>!?+mCMjy@bJ4t0=Y9cv&Ot3Y(wU35BKQ&T`{W@foR
zSlpZsAVad7LdQVh;{H`Zd~@Kr!c+b8lh`JfNAI~O0{Xy9W~@LM1OyE4e(j*5m;N(E
zET~@off1GHbJu)@84>h?)BSK@E>G`yNK2n;H8rtaGBN}N1kn_(4ABTPse!DIK#1{`
z=z{2{ATF+unV{c);1pQvLBF$bNO{2pw_pzMTZO0l2bKqiu%X;BR|BW~pBZi#?4FMW
z&HKDu{WGI^1;>#sep>54cOV}9{Wu`|2FC7p9Dbg^X_3ah^=Bx|%n)2-DW3I+{xJx_
z$1tE25|hnco?MC{(^s>8Of8Hq_HVE4_w7I$*qD4cUe(VifTWPo{l|F*{T`f|oFTY6
zIshI1Hb47gkLu|!?7vpCqPSMqfUk6QcYiA6@ebiwy>2=&7kd#`Mz;G0w@(DdKuqlI
z?l9q<IV33Hz2cK_6~sSx*l$Q)1(<*3)A|QxWMo7oK?1pe0P#&%rGHE3UmrnzrX?OR
z-tj;R5K2Hw_z&~I=M#>BynX}U92o5*fVFXV0)Kgbm%r+R%?^M7AT!!QWCBu&yj}(7
zcZLO{dhb5oc!GF=J*RFCMnMd|FP?VnA#PC3t_|!jo<=|QC8mmMs7fkHWnb(kepDkP
zx!pm$u{c+O;HvQGfG{xF34kymS^94L4ydyHzjYxW2=%eOU?G8KcaC~q&IHIif4m^d
ze!7WR{eNPLPjC6#1%aOOgjURt4cNW>jNg8EuYa80emIW&#NPbyAAhtHin6M&dLNhk
za6f-eWiJI=^nP00^K>{?Ug#AZ+;_k~eyl6NKfQj7;oD6A)XI%4ANpX5UeeqCY>3B4
zk&U5R)WA8hHNJc4e5YD}He0k1dF3|*!JgJug7@_eOnv&f+-#VdJ^1>xb<H03s`R}a
zz3n8UJewgL``KdCLQ?h(t*s5g=DztPYjAM_@zdR0SRg!puAqUYV_o6v?C1jB9DV{}
zAk5tQ<xo*V`b!-$&hLby_L03qIs&H;eG?G?B@Ou@W3u>5-6I+S1Eju$Y=9^-1j6zA
z$UY#u&EtQ9wppk?g*JgGh6PUf@)rD%U%dE_{%boyI0R#$^cA$-SotM%v$p(`@799j
zH|Is4`6I@A)13Y(^l$n8ujLE#>$jZD@sIz_GSCm~PF%p*4f31utzP~x;VUM{SH1ZM
zY{w62pS~v~$BEx-Z<fY4XpeKlJEMu;iOJEC#gnh{PrZ9uz&G&DuZC|(Z*!{$#8<iH
zXTsZ@$}PgN`<W+slUO(PkC*<>u<xAz!Pq$ji^9N+_1gBkwr$(CZQHhO+qP}nwr$`4
z+qBb}cF|>aS!I$;a!&V9p5bl|&ac>y?C3+>Cr|p(7tz=*n)yQ+-!=7LD(9cv*7{zR
zt9Ks(_V0pas@vtCIm{H7TpHiVPl*5RpE<~Xy7{Ruk<YOMp3^*-yEVk5suZSsydFQg
z`IVsqJh;2yo&OT?I{A%D@@D%Jb6$OO*Y&&fYkL9X{KL8SOI@9w`N*lc>Z@IOi}{8B
zU2{T$cm~NFsH5dbe+bcB3v>OgMICt4U(Z8(7j39Z5gpoZy4*f_4Tnh*R7yhq9{P|a
zHmSyQ@lgx>RCSMeA31BTK_o5YktjKuc-tUXaIx(J_BBDXaxcACE;a~9i1ioHdGCK4
znNVXI2Wy1w7E2{un~1^E;K2K78_Q2N8<PKco47CWNeRM~<p@4|^az#1Z1@x)fkyEt
z-H2i@p09-ou5UK)<5obkz3VMFneIlMB3&H#`uQGKJud1R!F;Pf?@_3jy<Civimi$g
zg7Ao9<q*3d@=T_T>bX|Z#HPc-Rk9W^Z(k-{4>3F())iZ9n$+WEXyOTQvPL0Rjcw#Y
z$F(bM6e8eswXRBCiU~^H>Q`a>8#Gh~xGP-rc@I3nQEG`l!6sz3KJqM`#!TS7-$*5Y
zPSu3y{31Ujcgb)9{m&d8KIZqI&+tjh-~JG)$|AQ)_dm-#*`fv;$l9G$U&cQQuk|`l
zwo6X4z{@6m5F=yKBWhJ*4)6I<Grbnku&RY!YmkA5Dc%`@aSgfEpZJ>xQC}?iZ%<1!
z!e-NPzkB>>h=!Ky;@&&7PD9;V@a(9m`qPw~rayXuHx!xw(93#NY2KX4G?tO1%o-H{
zxYr1pb1F)fhKlK!DRLoem<Aq7j&;)GTs!P)tauUj*1ANNzZ-6{rQWaH(wp-{ihw1Z
zhG62Pw7vt0Is>IC%JWzw>>OS@L{s4-9ojwo<9VgARrIe(%@Xv>|H3fa6dBw>o~$Sj
zWg#?5^`mNC_HtBy)sb~FN2|nUwoYijorpXJcl)nne_K-ti_{TYPP>0Y4hH}QY}Ndz
zw#1CfK@kh6w1||`dKp9PPg1`egKydCpjqk`Z%S~NYT}fDN4af-V;zRvCb^0rTOw^|
zrI;UqY*kGhq6VId4wtGtZhR)88A3^X*=cHq<$HRd@4aA3mUc0lmG&amDdB(aTuY+3
z>xH`CRNM*B#`HPE6Vh7CFp|#bXSlbf8lbivdXtY7%s`4Bt{%mlYK`s3ee}l70schK
ze!dkdsp9@+m$LP1lrd6dx^;jVO;h7xOQBRy$4QAgF`R>1TJWh|)zB!d08~&!nITB3
zu_evVuEA^(Fc;Dim{Y5Z?$K%^Qg83^@_ZQo!938Sr)l85jR@j0EPV`3E`}w~;+G7t
z`K`CaR5Z0uSL&kJi}T*gUpiE_03YVl`JlNFh|fujm}=??4ljx7+Dml|2#w;YgjKvK
zND6J0Ej;nT)Xu&cb0=~A3d#{?kdSEiomzyefI`?`=zgS_)R1A!=Xe4S*)tnFFOD7D
z=ig*vbXxdbzuGpS8^za=T18$lE*HP5l+l^jOq6i4uHfgMwXvRkRCVp3|7a?5+UO5R
zR}*_c5Z<#*6dxPX!Egje^62K>{R=EWH!sT~UrQcl<<iG8tjg)fIcWVSSpR7O;sR!~
z72rYs-=FvW5V27oMf-_tgByrNLD-v`ZiFu9hjJ{(9rZYj6UEM_$hAa(%ba`SP=_Y(
zZ)O{SSzUqsvqM#-*QDRo3N^Zo#sEgGGZj?MaNwA@{73O9ylP|pb*&_V<q1A4PYDOC
zDPAg1MN<407DNG{6j_uL*o(i_6C!$oUcByR-)6lbindVw=pWH$Dc=k@?zM6SHW*Bi
zd}l@o#5rAc9~bg9BR@F&(gwButP6z+pIs=33)L(cTZrjlX}epp%fL-6QvSrX|KTK?
z)4!60?3?$933%?2TOd`W9?{L^AzjFW$i5~0a*umSxP}>y)b}U0mW`<bPWE|;Lq7t`
zC=<aoNrZ{r5f$gQ{L4CO4D&OC{pK<x7F9Fey3NH_TIs{5O9W;H2qgAchn<q<$u>Tg
z*y?j%9K<I(jD{Yc_L^wXD|$IIitIxZC{Gae#CfCWez%%0pGhIrjM6XAp`p?X;B#4p
z592OpN|l}E?x0~%(Lpg7z}pkyHXnJ12xhvibR>L7C{S3peP6qoWA3i@RMbML@@UB+
zU8@G+vg2|al#5IFeesnjwH1=Hwn@~jXYnh-UT;G+Gy%ESdd3^bcwc>BiT4mNwu=Ik
zji2XUIfapL8QJ%ne~NO1X*=LN*7FNmDH2x)7#V=IMCHrF;$WBg6ce+Q71-tuA}br1
z?&W968;U?v={>}w*P{6eesb?kQH|bzTs`C1+2FtwI9|XXrV0DrS_YW_8Z7eav8vF8
zN`#f8FF^|!LDp)I5P=j2&H};%Ewvusb&OTv%fX-N?*amHBTbFpGGjaL=;MditP~&p
zDkX$e16SF0aCx@9Ij5<nM=yaj6OTWMB};8Vd8DNABR+@2|L)obMB=m>p$`c{RE0q>
zqUPQ%Tz-JCH5@$O!}HT0psiKAzD#5b$%7(LfBbXGVqRSkHGUtL1Z~rAOCv*w%P*BA
z5;K2<4(4n5Hp&2s;+hY@g7vbV1^UG4@r=v(HI8JFEnFJ`I>7uz)NG5<Yc_$|8~1cj
z#3hrKhKfP4y|T7zdAD=$R<zVW_vC#a;x!(GS168RkGW{p(zCi1&zk)$`jh`YnifK-
zx1-eSqY?PVOb}55ISbpQB#tujvbr5A2PO4A*eKT2I&SSC;?Lf~aMZjGu(ow2{W0>Y
zs)7agwB3v_3w=c&?16w<yH|oxI37{7qXUWBpJf4fwD^5QFTX>l_*>as$5z=^+RBRy
zeO-!A`z4w<)1g-LA_!0f=5!A~p<?h>+>6zGE4(kYr(Ijy6DS$HSI_pt#R;}_T*j86
zmohAh2e^k5x0I+DiOrwe?4;@x`<HwR&q}HH83iy|$^3pA69V<mCyPVSnh#l)kms4g
zm4Li-CUz?c&xD#N=|Ry-Np>x0*AM)`xiyw%oV8^JfI}Do6oOOurus5Qzf^Y<I0O?M
zU&nm}Q^{0UbKehaBDJ%NuxwfV?%vRxMTG)r`UuSmh9eslaGIMy^HsIYm&MBs%t3lx
zIKYpGbvp<uRhvCVD!0}RAzPJfR;2QLgtm_}piRX~J<dHGtAg%aiiYZKnEQ5&>^N;-
zXql4SBE$zjYiOZs#-LR$cw^qMT@k2?QA^&rL;;gpaVk_1p`0CP?Hp_fI{K9fgXIBO
zGp_wPc`S?>MH0JWn~6LRE$y#xs`o;2AXPdtswb0gr*+*uog+*Bd)|s{fk^G3zCfh+
z1U$}<WNL>pU%pYvC3M6FjnmS#rFE@E#8i=`hr|)eNR=xz^dH6x%wrh(R>y7fog+O_
zD~5~p5>IJJMYr3NVznfPK;+Bo5>A<l-}of3XR_CMbZZL>O!O3tX^*nr42JUcIx^A=
zhlkl#l27|Ib(?~<Y9X~XY$=?I`)DttO7^#fT8L+<TCci02AO)^S_|X=M|59<8*|iK
z6)$Nrvy4ZVcLc0KtzIfDFTqsOR&I1zo<YY6CdzP9Q!%BUWW<8pdW&xDpoHFEHA+NT
z<tUkqxu-tE*)6R$T5-_~$bxcqb)+e<86rY^F20hs{sj$U@s@L|(EgCt_E7;shJy*K
zL<v{`*Ltl0X)K%p8GHrbx63A+9{W-4!Kh5+ZsE9;3g?Af{z$gy8}|z)0lAmmR)5*w
z>Dw8l>ehI}9ZWvOuigJE7LO0^Uxo3}ib~%6=VAvLipHpVw8MFl0?JtlC&wCB@C~<q
zFi{N<HIuWxzt*wVg!i+k?ZVUuiRcCu^<Y!w<wX(v75v>07L5YIMdjaWE)>r1ZqZ<Y
zn3;x&m&FtyAES!49bSGNK({cg<j5sdyN=j7n)j#pi6&uL1G`di1N2e2AKm6isIc_T
z<fZVN@f?0kRs#yBLkig*Dz1Du%??7?gMg)ZS4*aLNkaC|cP<NZ!ljx2n0ABwa|wD-
zeKK7O(KXt__dgIMd_``k3!{JYV~=k}Z^OmwE#XH_6F=KbvOJIy!!C~;wqGf5XF1sA
z#08}qixI8Z25qeQQ*9*-eosO8STKrM5{OS);`|d))QP}^MTt_TOeDYM`<yzMKdqG6
zds*fztVK`MWi*cj^0+ID+rbCWyhGF2K{xtFl*cHR@ZYcqJ7vh!JN%!tkNCdO@|_*n
zvIDx+efO6dY4uHrpws!)6|X_ZSC=A(l%7Gzl}Ff<H5Fc%wlrLOoN8Ce<{3*74X3R!
zpX+IjTOOLsr2i9ETh15*M9v=OJ%e_hp@7s!MFMihJK?S!7d|c9R=a|ZyK!OfviAcN
zP!hKU^o}#OxiQJ0xfJGeQo)Y(FdAwW;xp2uJR>G>*roAb;Olf(lA;-<Lwc13!sH@%
z-N)5HGH)=m;H*I6#y0Z+NZk+F?UwOuDQH*nfpN)<nPuKk0L8A0`}%X~nhY>lzV%cj
zh3;gq#(W`ysm|<E@ydD+G|r~8FaPsVy+V@I>6$@{=k+y_peOR0A{~PJ&dGN1lNFZ8
zQ3^5EZ4-&5g6x7Rj7e|c-sIb&LMygImIBq0+$YDZ?P(w%?Z>Tv4dJ`!&Y42`JzS!w
z(}gK(TVw__Ltn&A%oE;D8Uwn8I+J2=ncprE8JEzZclwh@kH1eX`*wxxYMOK3%6o-K
z_&l<?7o6MyWQo~EyT2!z>CA;*FllJLe~0YnM^iyejrvary5tup=l~VN40VW4(`un{
zDiShAD3E2Rno2*$=wQKLORdtH#(&4X;-q}k;oa<F)`C1qt4zh-<NFog^eLyI7|FnJ
zx0AJ58I_Q&`uc5nsKp<!)DAKi6cpt3pRGxwNHEWvV16P400dPG*;Qr=RkbrM{lnqt
zrf31E$RJe@1c|@9kyn9Q1bIHE!2q*g;bCrWjRsqvE3+FvtV$oGu`m+%PPEk)`DZF)
zwF^FC55eF3SNd>)Y9j6)isCmjFyNEfmGnt*BNdVBC3+zr?sV7Zk2!ynwN66}60pQx
zV^Xu)gEnH-A&vn;QyThlgKV5al%LGUPO?O$cbdGaR7ytZM$!sS|HzV7!(c6apX$sS
z5qBY+Xb%>mX1o@*q*mAMOR`{pcQYP&WeGp^E1y)4nHjowBP|;rv2;OJL-oLu#CVZe
z1IS>I5f-Ma=04{pF9aj?c`2EMM!<!pD2+appg*6k<>63lI^S+EdJ_gi`CXQrMa-SB
z524isC}+X5$O~(i(-gc712#1r!%Q{WoY6U9jL)q1p%QzghB-+*dTbTDJuaGN_Y@4t
zsBZ?<Z&-KSx9F_DKyEY1JWgC(=Ii~uBs>nBZVC#;%CKm@IQA+~b8Bt1Fb)jYW^;eT
zS^|55LtqMV1S=|03}QyZDn)UQF>imP_aY6}OF->59LpEF-@$@H3W-mI)*}T28q*ih
z!<458qup40c)ur$e)NK0Co-g;+$g4%v4RHMZnz|P=R>b`O^zS*_3g!w>!=Fb|5cdf
z8P_utAt~i92?9c+!cs_W8++T~30~}`rcY&xBf2B@BTqN1==-XuJUgjcxo=Y@NK*5G
zBFz4Fa-zmZ<L%>-&WdC#5y3tgj{<zPe+9<-R$Uz-e_QOECZ#i=fImcg83tEspw~9o
zO^yc-E@Dsg5#bLwzlqCQ6&xxPt#N%rebe%pYBO+g|HbNp(L-~C58w!{L$UJVsoG@S
zpas7PE--9Fp3Z(4@q32tFkv4PI#UUnSQr#qWw@}9%@yK>i5QGQfj(O;W`PG@B|V|4
zbt08ly(;RH+rLHp!I<Zy%sDJPL?GD_8;QN+5Z)RomfFp%3EJufTk_@#v9OSk1*A)!
zq&LTzKgOKf?ucI#v9eDkaxgwVy*EV!gFJF_S;#T;?M|qd;GwADqmM{>eH!G$B3DT_
z$)KpHM1U7l{1ux+ZRXrT<ju+w3cAGE)D_Q3a`2q$tO_8)b918h=!f4>2n5t7CE3?7
zsG`7ys!QK+@Gz3yX5OWM-756pUWsSS-K|di0Ow&9fd!tw9kkBeE?<@O%4nsPZ^KHB
z7g{G185q0rlvYqn^0&OZbhX>hqyXWVahc^6>^IcS<b~{Wg)TpF)xE5hg2Pd1jIr0<
z4O^3)neH-nJqy_^1jam-^huMa3u`Cr%nX`@dZ{SKQ26xehMIZU&%csa%BI^(ZKg5>
zaJx#;tq?J6fz&x9K%}X6_p#<I2xzuZW-RB1pXOHyG{2W}D7q0rZX-GE!`Z}d!I$6d
zvXy$Rw+vXcyqBTQayprfyhJXvaLk~rIkl(O>#G&HV{Rs^DkWq?Qc3QFt;K0UYc5s0
zgj%upA@?WrlvvK@0^*Nse_TYSq0>dt61A``stk~cN*!@=E67#|y{9cGEua*hDLCCc
z1(QZ^wX@nl^3``%H`Uhz=c8$cEhxm+)JXp0JcDK)FJNXqZzA>+0>a%A{A{8<z8Z}s
z1YIqKYAzUKo)s0J_Ln0q5muqL>x}^bAi2c&V+`VNZmty>Z6gQe9rJUbX&M!*g)u(T
z014-NyKS<v1jY9@^3t}sZ{unTP@~Z&hce%Axs9*oa*@!9()3!T*{Gv7`_{kTH1p4y
zlUt0o5MhGExSwgBPa36e(}6ep!ey>~BO3I=@Cb(l&~Zd8d{SIYkn}U=MKAE%8M?Tq
zxT!WZD0wS~l`G7{lD1TUcfrNkC~O#(Vvm>7qC-by0mD9B$CinTY!Xr}ewMgYO}zjL
z*w%}tk1ci>qeHh~yAKM~1`ZUDqP^3hwROW&G%O6l8#QhzmfR(^i`Jx8Rg7v(!Gu|T
z9?10Ck_r_CEC<Z)0y4WPOjzo_=lw{VKIS(wQ4GhD#IOma^xKQ8$}wGp))gIB`n!1E
zt4~&uJE)Smw4cy_e2?UYRs02VCSB4Y^^lI6I>1?uxwpILi9g!g&GwkA(KHi<hj4?s
z?mDGFIR5@vBja9j-R_n~nV?mfuJ16r!5de4iH;2Vs@l}!87yLc{zRFEpOaPTT+(Bs
z!7S1@&Ej@vV;v`rr+|$`+5BL%&|*in%X5Q4{XFZ*EuP-8J%N;Dm$;+|KW4>gL%Lvc
zy}|ja4?q5C8NTq=8J%e<X0N*HQP-EIqStTUC^#;Tyqo}=>o|qmK>L^7Ag_SDA#syX
zDxzpor?zlkpwt?{@PY9&a5Qp)HbAzD6X+6U_5sB$%~QuE*B~gKEA-Wpey#X9<`w$T
zCvNT1*siN@5N^<g)!#HiPW@ZRblk0%(b4wFxh%6-j)vbvQn#xajq^Qzi8`$h8U?4+
zD?hY;Pq5hEyt$K6XO%^CS!!Fh!^I2O_oHq>S5+|s*W&b=OfwddDH{=wTJTKD%IxzI
zddj>6a6~Z)O2HCJbOX!|71Lc|BOe-AkV|7~wZD8;517PLeG5N44;thv4ZhdXU@*#!
zYweaHE>cwalaElIl(n+01Fu*c3d16DJsBtcN>ND%W4Vce0fRCm%8*K%i5%bTj!gp&
zbA9YYp+|`|*B^NbBo_@0<J8Vv-Z)Z-O;jBCeTP>Kw5~2o+S>P1sQe;A8ghK)#dV)U
z)JyF^gzG#A5wcK2h^_!bnejI2f;J}2Ued1Nv$PUSuO3GMHA_UgHd`XD65ar@W;WUX
zp)InNkBN>Tx^KFG8%z>pgo=Yu>Ew!dSN5Ay9AA<lYO9ffXdx{RICSewJG1d5L^gXO
zyYnNYR}Mc?muD;5eo!9!5{35+p>UAJ$-n{i9kU^;0fOU~osq4o!I!~RE*F<wtW=9(
z{n9^q8PmIJdyWGN756NkDB&37dI00WnDvolI3UDxs_*aY0YlPCqf_W{s*!PfjvnY$
zXhIKJ9lIs$S-h^k#=Z)@wTDRTw#+NXkt`~mVLaC-{B+Ed*w{>6duEI|g%Tc;^mtDe
zMZPoP*-7d5CFvUX`ESH^aLRAmpFyi2Yzf(p<gB|reMhVnvysc%_RKAIOw162VgPOY
z*Hezd;B)ZwzxqdK{a%w*yAwS#@V;le2G^%oPp46wrBoC$?t<d`xWZ)}B%9|b?FiCK
z2B<{dC}oNZ^`b7)*$5^ZaVW>lw-S>LA#Bf4hfZQ13AFHHYk);I8PX3;2=u0<MR7hR
zn5yuvjqaZHZv4i@KMxJJ<@!`t;!&BOVL+o0+M;%XtAF1hU{K_P>i~4p>Plg=^7wh?
zoV7)s)snfU8v`#ZLvt-}!*;*q;TXl3*eS3w{R4<~z%$Txn*nBHYz3scRGvF-WY)lb
z7eZ5l;4=C@=bsRJfo4G4JQ}g#^H#bX>2X5GTBot`^5_c{NtzuQ;Vz~LjszM`7_)7F
z-5ykuP5Svw-#~HiZVBDh9j}_9-@5UhFBIg!HKy^@3J_lOz&;CrEXX>}$S%XM@D)5v
zz&(*UCV`S|U9JSA&4tCRLE_DtISexbucC%rwC8%4kFcJ*XM~xxDNEP+qBLV@?%z7C
zIB;6@12Tt=4>Sk3jE7LTe>z(JOU=%oE4Xe&w+xx<(;7x@VUQ#2kVy@vHAdLkrUM$q
zV;cBetNh!@gL`W`+*6BFPXhdz$L)AcXl3L?57U!wJW-Q7p0!+4kg6}Sal_P-7$)pi
zwocGr@H6n#@W`=)gtl@uvxyFjAH+yG<)eX_L^QQykiNeNh)t2+U8~iLfj1~@TZ^d3
z4&4^!m;`o;!G6Ur!flRiY`(H-6T~~qj!3ssXwSj}dGE#QY&byxU4CXpy6m70Daul(
z(N2sWOL7EYLVENgW$CdcF@&%H_oWiF7cgkPQavG~@i3Nc5bG#<y86sz3XL64iD%<~
zrW#*#`;G{CxP0nlX7<j#8V8Y=fSg<2CyEN!n_qs^$SzD6L8KoGR;O#t3Ftx*`H%v?
zdw68DRjk%IDD#HBmG=f-99K7Sd%i?Hcv+Q4OnBlt2Gp?Ek}<_!57Uo;;O^vw76O@$
z7tXShK`wiW@KS^ovBd2KeV+#_;?oYC*A!Yn)_<#)ZcCK4(L2U|%wM`6$vJpAPOya=
zyyjW-1O)x}Hu<P?X%_zi9S<C<lD;npSScJ{G9GoN)+H9GD(WoLjVj^rR?u9O2Jp#4
z1m^yutwx0!=%z2%hj!#(@gYnfN7I^UUkH==!c!Zbzc)~o99Tt=v~~(^6c~5D!z$X#
z-2*m|(lFh0RJsO4W)9FI^14{9v}QIkn4|xwY8%L_4dAUyAV+6)g;-pa-m*#t&y6U(
ze|*suT8|haQ<)86I@El?>z2)J!|)3Q?x@1_GBa)&r~wCM3I<3w5QB+i?Q&dq<&M=1
z%x(ZF>3e81_2(EW(_7s5<YsIb@K|>YPf(Us)S11YU15pv&~qO{|Ho@1%d;bDtEgh3
z3?eB$3&CQa7OUPMg7g!S9j*OYmR}1_#DuXNRPPVGk>)4FP`vdk-a{P@jWt|QY-o0H
zg%T3Ezcv_GE@O8=->cns_oirP7&kc;Ao;^yveI@1S`U0VK1E2GUeD~`e#YVtf37n{
zuvDBYB)98gDcEl8E2dS~q+g_fezC_IsWUE`J{Dsa3D?AO^sHwi2e__Z8+4{`q6*~W
zRrFGywd=W2i%YjqB%G{&Wb@m1(JB=&A36ISg%i+cko;8;GTvidJi&JV61X{AVlI1|
zMi&s(m~Nt(v>VP9>;mgFTUP_VzF2<G|8WMJ(WLF@w#i{npn>7I(S<q=G1~($I|jJq
zh+b`EP{^~9-kf~0l!%Y5148epXFopck!Kl;T#0*ywqjG(Ksz7El@&a+DLHiMiu7vR
z|MHZ`S3tN6F_1XE7L*~!E$A~qzpp8%8?g5b3`+rINw)b16j18sH-7Dv;9kPXWT|7C
z>3b~NZwH2Ps)e7bl0K3P1Ql$&b#F1kj`K)j&xfQkV$fo^#hbua9)Z+HVj!4a=gvG)
zb4K9KwI<1luQxf-Xnvt~bkEzPqy!Hq-4Xb9{u4rdZ$X{B7?DlUhP~gjysC3>gs5{2
z<8^0%uXdoS2NrQn7^;9&5kJD%I@5FH&T(0TkE60}s?+xP^BaQzez;W!rW?}%zZ>E?
zj3VcXkS2zcNrLtKFjpdVnRYQEHN%EX=b{t%C3Dk|AZ8th_wo->M%)6)j$OZWcqb4H
zYu{VdkvFa=6UX(emCOR~FtNigA-tO768fS35Y&x4T{GL>iAe0a@H%jea#O3Q`Vp!)
z^G60WjzocZu8&tl`wxdrS^5wE%%CX$ybHke;7pTvVltzWr4n}Nh*As3NCSq)PsL&z
z!OuvFWtt=11=t*(wMR}N;_5`n*k^F3VvJ*UQRN^UKR7gDsYkl}&Y)KS!BRKYy;t0#
z@FQ{p=#3lN+u7cxoqA_kVG#zeiGetyU;h#iZTzhBr}`AiD)vwdV>PJ)k;Q;-(~W9C
z<e{whwIJp^x#$a;(SYwjktnuf3nGBQw=&5sIz{zMLs0TXD5P<F6n`GSYSL6H#LCrr
zP70ltsfZ-bnv|YLQmlJo4%YVNo-r0?>Cxf5=_<kbmxSlDm(*h|jhtw<WziR%WwdP*
zQZt;P+o&)t{h(sZ239Zl8tY-CxL(UdLP=pWxUQy9-IgclI<2#isOJ~8UZrLc2SF^B
zmuUAmYEEFxW`D%RI{<#JO(7s!?vMiKmM3l_hoM7sa_)UBGG-3Gh{@m+DO^Q&Z?n%}
zjBlSahCrl((^{QfK$u#BQOXci=2E4$YWumhu7(QJLfBLSv_8w1)~$tSB2OmeL7nqU
zJ8nNaZbNSXCGu3B<g|Lr%#%hfeEwtUvl?^^#v^*~2G!N0!V97oiB_46SCDTisUhH2
z!82q~a~JB=J0;SPq_|3}LL6tp;N@b46wbm*&|~L4z$f+G*u#d&bZ%90Zprb!n5y+$
z%<}>bGqLp3lzly$3ch7SAO810PnP@2oo;8d&Tdg9_;Z`nE)4I}_S&N%tB2CN>=m)V
zO!9ahx;flOxh`xMNx9_M`BxuS#LmfqpA1U=OC`b)B7BCC#^fsAguJ!;a4763{&ye%
z@&JHIV#?!#-&(bPWM#=zkZ3}MlX_(!i!6`V@G<ecj`c^r`gtiPE$#ukcm9p`%BnW@
z^<+Zo#k5#+b`inLmH>yS_AdAGL)vOqn9(7=h~1zC{R2UVA~R*NR}Wk{;>yq_wD>;O
z5+QjUW;{VprwV4E;N;uy9DH}Or=S6AJ|g+CyBM>vN{|Va<O$|IKG**3a_h+imK)Sc
zId51+c7YSktqh#@I)m5~n^1P?A}fZe-egzqH$>?(Xu9HZRRdp7cRPF%7)5h8!#-eX
zHBVAwiuOSvA6`rom$T;Pp34F}Q(^B1l#q`fq4!UgeT&1nLuNge&y*YZTszI(FtXDH
za#O0ruBKUTX&Gg9rK*cfnp$TsXUZK@n}yrkR4GD4vTe_0|D0N(cW!Y%ox_f!+LiA4
zSzgh7-&)NW<b^6-f-~GcmV>)vu$B2eO0>6vo1KW`B^Gr(GvM1Q#|h~9D{Q>gT}z0)
zq~etcmQ}Q<NfVogMvLlEoZV*n_*izjh|i(bDc?}51tX-@@e}6)DI3OQU1MDX1}zy6
zl#|&bEHXyEQOK003+!idd}w0m93k4tpXT!SmiKWN@2|G2uP}%PS>Wc_dntSyeu%l+
zdZs7$9J!eJ`oc**?0E#RTG+hcrJ^0!&TA;w5DxWe7C~zvS*J%*nD1vIW-HkI1(B}^
zUNx8#T>-!6<O39iP7+5|r;S7qqSZjJg7CnkF0e!mQ4fHY+i(sg1|-G-jzbTV+Iu?d
z#ZfopV|>R0`=MteYZJ?r)pApBt*^o+?P&&{mS5eRYdUiQ%`ebh?xacuU2{oV0KM7f
zEY9~Gy|Cbv)h+!i@6c!PFL^m7ip`5$W|(=FLJcakLw8M^hbd(+I8h7DBb!wI=dsGP
zS5B|2+e)iYKFZq%Lo~>*3~a7<or3H&8Fg@fWE~b8W-zTt?Nm1BFE=b_vUeA)o>wrI
zi)~o9k(dfTOm{KHQq{JlIb$O!%Q-SEQlFs}2K&6hRm;>&vNgNyvA28vqr?tU`9|1}
zL5<8>??OiM7JeJ}vbi{&cv&Bx4maFHDu7U&)!s#=L{3z&E^Mr6!rUj2(9fr`pMcW8
z^)ZFCX-PNos~*XdV>mJ7#}ivbI^`|_M1ava7D^)I5DR~{HBbWMX1Q^T&D8{C+L<{k
zY8M?}1Fdkb5_ap4ej0?DA~IqWjM2x+ts;K@wT{@e3!~E^e}hx0#>ylRS1zJ2N^>(O
zT=j~*wSKj<VxB`Tzx96|P4yJbWnbA(QeQ@(Lq651M)PXgM98#cx@OCRyJ~k&WZ1(M
zg0nc37+T-*m_gF+49m&|Q^p)s?4H;i;7Cr&rd;$TJ905xtlEUK%v{6>dftS5YIBZq
z`S_`z9O5eTC9@eN#QG!+RYqtMBJPqH+ly3Mo$BPD9z~(*syb94v@PQ<I_(>k4qSzR
zYj(tnE{gT7Y+xme2DGzsf;zt3b~NFoYX&1E>6QpIDa(EGv(bZOP-pA_i2K%Sa-k43
z)u(%!uBt|E!6WM9W*tw3j^HYi0&Fo)&*p_NwnC%2#;J6z+CiFn)!sWAPleYalCgGp
zJHklA6(MUspM8<I;gZ=1D9SG$E~rE(ws+Sr6N(@zxF0OA*?Ae9fK|%&(4eCcWgDSa
z5ln#+eZ_tEStH}!oOd*{bh!>k;xQ*#Q2*M}x}-&eCoxrC*^XXlsm}Dboe9z=7NNu}
zYPUf<?+A-PcaQFuc3o@H0Pv~Cw!*eq46K!mzUk4J_1IB-%v?^nQ7RB3<nm@`XweHY
zGXqGkf(_pidIE4J2w3B-7PhT`%)mn?b17BAi7x8fVn$o$vxB^I;P~kXFO#d>%h)}1
zh^T=;V+ak0ib1RrGNEvp2D@&c^qeR1qGYBQG$;!j5FAW^VA0)=(-QOs#m+1uy<Un|
zQO^<)3wj~D3-HF5WUl6ys>}?lb6)QtQDLbix^UHBU%Xho((jxdjiuo>5U>~I7Tdjh
z%Ty{PQfSmV2s^X*3-BW?2ajyrh^zDeq5BvdNUO;z_CRP58gKyTD6^Ue?5x0}OTZEs
zHIb&1+PcQr*Adyu(Pri}dPn-F3S=kwA0-$_u3i!omP2IDGpDWvAO;f!Sa%AHS(-Os
zl9*$-mT{L#l}{CH$C?<^(xg{_tE?`<<0{jw0>p4r@cCVQfFzm+)d-6YxTVR7J(pf(
zCI|;)JB(0eO--_~SQNb^%LKlhqzrw}Yy5X3-Okx&buo-@n5D?Ydn7!$+7{Zl%Rk&`
z;A}1!OyEw+7~RpcDnr$Spt?e>@AD~hB}+RC4o_V$k%v7<_tcHT&_R8#I%ZaoGF>7!
z;f^3(Ud6z?c59;{jh}*<%X8wvkk~!@5L02R2hUr-n$3nIlGPj9KazWjrSZY(4KmOg
z&xq=SiY;&GOvM9FT);4gA$5O(Ft9g<qs=WB$}MOe5S(@NicqrBEUbsd{Um_GQ%kEQ
z3pZ2-uGtGnQfr-E5gin%auWs9uWo#mui0A6(K&xJ8Z2dawjQ6-sKThnxFx@tWTE>F
zY#9es5!szfRb7O>v-+Q!q1DSsubn@(+Hs@k`vKROB|<$U^U9PtTF7AFhiswVQqvQ7
zjZO!~!yp&$tED&=kb0P3aI+W8)u&FV%o=4jJ#BuCtnp|qp}`J*8rBZ_l;!0Ekau+1
zxd{xY_Q_!urF;Yl9FCDz!4CRNLiXg*f;FKH3JU1+sTYJJMQ=<(wYXPv-4PrJ`v_2-
zv?A3!ETg8i*u-VAbP!dR^FCQuG1f&-$MQ9Zv8}HFOlx0V<INM9e8|2?@tAf|J1>vz
zV*kL2I=0F73jSV=XU9`flae@p5FlQ318&?B9<ZuG6#3}2xy!g$I}~cB;DfX41p2CJ
z%X}kO;hK|jHCw6{0}_>Wu6#U2_8xQ3i&F}r4bEIVtm^^L2`_<<NvV+-om^r+=)X*U
zT5*=25e@f$ikoaBS+jB$lZHw0|GSb84ud`whlFk=dFYZY5)KJ1=RFd+P(foTWTTX>
zlh7{MeLG}Sd%zkpV0u4UM;D#9x={i174rq1vtU#TWOC1Od`cgx4*RSArE)sLKQ*!@
z_^A_(X{OSf)D06}wwvS8JfQN#Gio-OF<*-!8&EA{*EZ>jY1f0?xcEFYmlTh=rhS8S
z5Fb;-;QcFvgOhc<!+oN>?N0QUPG=7Q+o!-PNRc0oCFJ6=Cl9D+{TT`ZYT=HN!M+U(
z?kOp2+A3W|Jq9Zx!4ax6p{%o%7zdU)#c!O;T;f0LnTb0L)+Gv26tCzhz4cM6b_#Q<
za4$Y2!I-#;U#Ss%B6bWaJ7?Aa?02C_l~aUHh;3Tsh^QjBLNTf8g3-<caQQ-dIVYy<
zQ^)D&v?WD!duCEreHG0QN4*ubr|qwAPo$)S5{+(arVmc)t(K&yi(Jz!43WNJ>CE-o
zF)@dO9T%WJs7||LQHLL%)cAbc@k7kxjP3C|)Sk8XKWrwyqKfu6;#84Q?QFD?9%h`n
zs=xqL-FC5vXWx5A&7oE<F4;`Uyo55_VZ~PUy$|vWV5c%A>s(ElQj9jKOd9gw*e>w$
z$>`KAk=bU)doU_3VF}85OtD?wty&|4hw!YOjY7bEZ6pBDBP)D4Q!RgX8F`H0t8S$l
zfcJ-DD!2Q6pf?pu#EqYe?Nk?a&o#Mq`@n$un6`Rl#kw1m3fQV4^|tZZ&jqK6=8hog
z4PNf6qg<wwNfOrh8_|_hp5!c@y&znFq`1>q5VOzFqQCDlT^$SC-^$E4WY*F^;}%|F
zqF0tTX_{K=o$NJE^?;+b#Di4%h_C={wX$C}mQ-faQ@-8d4*2k|iH|cPwxoNKa1>%%
zyv6e+Y_Z4}Wgs9(iO&5h1mhy$fc+Yl%d{7{Bc2_FvfVlSZ-J8kh|8hYaVmjOCfplh
zrt5=mL8&jO>r(wkS>@?<KC}f8avfA<xabn=`%n}=F&rc-^EhfPGpZ%7Z){mdA-@-1
zo9^$wAph4DQlwcF4aO;jYpPORm*a+QODC$ryc?+Y6U^l?1yPYz1x@gX(^#e(&BT}L
zJVGp9%>Qe|Hm*q~z!?i#dxP#ujx#h-1t8@|t&*0J(YD`>@;8B7Y}NT3?Xxft9KN{Z
zT`tBEI!TIHP@-4trY3y<a?ytNw@d*JjX*@q{n0sde-qI>*D)7+Qmm19&a)S=+ySe5
z(matFfS@BWvj*%bs3IZuYIRJ@_YGccE>;XrGVMKICB!E&KN(WkvojKc)|S}Y4+bSU
zoVli}RTGVtK<_@&6h=KZsY%*V3Wj{OgnNYmyf2AgkbPaq=cXuQ%M#!NscjK4>WE>+
zYFryG83VoL*(gT#zB+MMRi0kzis-H=BhIk+`l4Y=q`yrESivhCa0@bRP+K)P*L@KA
z^CeX>(sm~2`!;G`bA;1h#-`*+i@~R<^ls$m)krl;GY$z;QMY8U$Ut4*YAOOd;TU7Z
z?!4I7UDSHl@eEi1Vtj2(KC^&r&PU+&8q=RC0$u@^%~<Nhd?kHt8;*e@%mAL#lQy7C
z&~jcg<>5+Pg@hKTq+Xy~6nV<{<5+PBG!ZKG{7LJSQkVxuA<~YAa$n@6)ysS`ZFLs|
z-`>tutWebMB7>;kDiCLEqra#&1K-4ep<F*Pe|emtau_kA$1HiGPE_2sJr4iqQ~#ig
z2Lz=Dzg&?EsnQhe#4kNTH70g;3N5u*?|c4he6*%|PKh^iN1iK4jPj6L>5Pb)yO;Nj
z(iPI(LKC*OT!S^@!=16L`m<myx4cxuF=zq+*j4o3Mx@kSSxaD7De>|A>34tsDEw5W
zHVRM2MZQzP?!xD_<Cer`fS$BymPDaBWoyFyGFBFSH&@=pWo{^|tZ|?0fi#6Q5n)1H
z?O;lmIeVe@Db1?R&hR5KD+v?F6(?(^RH5|RO5*^KYfd)QOsCvLS*MgBsK@C+etY@C
z(F=HQ1VqoyxGKu>Kloam&FVXG6V1^;M75XT`6mM(QcvUuQ)w`gRu*?SHk|(Vd2_Ki
zVg7?#N7r+O%ch&m24f)yqOBfp=nm2z)0ecux2PD4Q3-3bWU*ooyiRr!^b}_@)FR~C
zfD20_NcnsLE2s#3uEF>yuX&^S4=*nXCXWUR*WV$Yp%+^phT)y<>He;O!M_OU7R%r>
zB(qIwGRfRer;{|La(7elxY{Cbtbgj+tMipT-?v!sF&gYWTKWP1S;46tbd^q!M*<Pc
zQ9AuFdmC6OM*(RSu7D5PPDptM#gjj~^ln3GS*|s$BNC<sgj2g4G<Qt0j|1r|$qf9v
zreSAap6KEsJ-Po8V(#6Zq!S#APKt#!s+h&Wd|w(%x%jP<4*sXF`||mE7hKhklAji&
zW1+P_1rZMu(0i~aw@9M>QpS9+4_?tsUB~e3FYTGsDG#!B^|t#ywtFf5uR!8+A~Cwq
zXX2A&Tu*)VET;|>%^h7@*r~AGMxl(8eTjPb`MY!jJj|=QAE1C&0Aswe?EWh{Ai8Lg
zBZhVr$V2>Tz+P9G4^5*Z0-?5TeNdIrty-#`Ma=QyKYg3h1C*Y?DIi4J7ea!9QZ58X
z{&`v=Bg2jYE}N35q;clc;-7bR8GQVbX-ksBYxnJ%9{Wf|m-ykOU8gaF)w)d(QMz>)
zxoQMemWXNo_2qV+`IxY@|4v=CL~Olo&?(d`N$@sL`}j(|G=B8fR&=nmzg%+2$bbLm
zpJMXgD*B1{M6@i*QnZ|!;4<M2NepDkz1{YlCXE<)aLYm?A(G`aS`=~g=MV)2o@>ni
zAy!@vj4C=IF4=m@Z9dWAzg8f=>uaIZ6nFQ8ERvuX&wUj%qxS9jhq?$~Tr&UX&Syw&
zCNSIyHUu9iRjyuF?1iqJz82x5A++>mH+fIpau`hS)9r=Q0>+70<fzH?wlVtA!Huuh
zaVzp#8@09NYVc4UDlP(`8auJNPc*Sp4H_e_m|n?A!9T5QJ~8zl3D^7yp%WsO8If^)
zx@^G9Op7%<$&j)C1OHv)`s~ZSYEI9i&Q6HF$y&P6T51)S<g%&125c{qLq7Q#7g=o%
zbD$r|;veHTf;a9zQW-}tAY`&dh}&PpeqK!4fpJW3^2eHfs#ui^%OCFiyhD1_aq1gP
z{ITDh%&GH~;d3!u&nbq3mS#|9J>Xj9l+$<HfWZ&bzsaFa+4$F+{<usZL=?5)S}%xf
z$P&21fD>nFN}2WdsA6`8L<0V!D%3SKFj-M4xJ}P7SW*R`m)(-UcH~H0J~odDx}JGb
zYrSOr1<JGNxTfBc_Rd|!3JCz9J`>U@;aRNo%NjcTP#<Ar<Ps_6@_+9FHOyol^5xKD
z$i7G-G7T@#(B~h=jLtQNZ#IwD9p(OBQGz7N96s10@-dKSmyg39Hr3mkcljS?FaJ$5
zQ6u@6fQ4f_qM66pdZG*nu*P0%(Ew-a4O@FZf*pyt2kN1n|1MV$2$$aLFLY=c%jUjU
zTUKFnZ`<Ovcdt>?Ig<&Xr^B3=LpqGxG3k!4G7gFYLhUhx6Nm^e+cPfJPp7jn$hRfX
z`%HA}JpVDv3k8KjqT|7bZDR?GYDH+(JTw|6*G#0)rf_$6m}2ti+MA<BLDEE`4}7-k
zt$_~ZUn7DTuoHuXf(f6$oJTU2QSpa)%o@({C8Xt=6iCB(A`rV!a={cKDR`ME6K2Qk
zP=8J+nvE86{U`za%F8s+&Hcm9vuyQ9+dC~Wh>Nx~Z6n~MfC(H_01|)az?<&EgZCbR
zpIp&=)=B0QRbN+q_?0D~@a<Rno(;w(I~Xgoutk-opV^Nnl;ABoHG1H;s92s{0C(fv
z!bpTMewmASPp$GXGcL0y7Xv^;A?v-x_vB)g*Xa`I=!5wpgeU`QP&?oA;GD23zp&<W
z%MFd+BnaT#>b6e~Ve!0Zn=iT(6Oa<kC%@}@j}Y`bI%fam+N_}+i-F5{8d(tjmtKKA
z5mWd2f*@c{_5=L-z%giDn#Up|ZobM;C3=X^=k--z6*GDR*G?=)foEq{KmU@MYur+R
z2j<kF8ZnCsmI(Uf?S1RWaE3o^!nQ(m*Vr+c-aNGY01FTJ-wd+=tm5Mrl%Fl`t}fD3
zojLFF9E~S``nB;gZV1C!J7Tg1lKvxS0t6QTU$G38r>cR%UVxHD?Ow120Z|V_-g1s&
zt8W}Xy_Aecd^d_yYKe+v<su%%cy=k+CyKaTtlqCRc+Dc)VwSC*<>W8dt%x;Fj1PYb
zY+_y$E!$8YY(;y%eH5WQPBU0lH%HAvOq$_mYj8|5`e9(~t(PPDU~w9(9Oq$9xq0e2
z)ylJ17MUiP(wR4b^_ji;@bTTYPF0<3c$^=Ch^wa?AUWUc2(4W!2n{MvmeqRLJgd`t
zKlGtCgE3LmE&P!gK%o5wL%SfQTpV);CXT-pvgAM+)mE))ZBo?qxg04MG^ed-QC&i$
zGRXFV;laClj)r49Mfqq2zTfb)TX@8}DF<8t?N#A=-0A~ESL#ZuRvV(rENM8jA85k0
ziKLmoRMGG5DLL=(O!<51=I<Ooca5Z>&B6CBRyBYa08>=9fxF_)W0bLgPlD)82QN~R
zSieAP9v;s*_Z0B1Pu}jt>W~V#>Lhbc1;aLS2RzzwZ7+rZ)-KDJ-KVM(rq8Ab*WQXg
z3!Y>VCb<^35+{CzxLK$RXRZ1$CmQfKNRA*o0Bq(PUHn&F<Mup-4n$?n!5v!til)rb
zG7RB&x(mi=AZxuxx<ZC!#PX%^NcGa>DLyeb!Jv*5T{A&PFb?iDirDg7k%JSvt_1cy
zx95{p`##^BMHYYIP?%XgIws6>97*9LUVio`Qa4QM{*_+DUaY6D;cfJNHPUL)W6#QV
z1hnZy7(0LTO3w9j@u?z^VW}SRPMw$%8be28J30P0IhjF=UPT$f>mm<Stv4C5XjTh>
zIm4gY)y5$F@sOISJ0F=h4Z)YnS>8s``lP@)x_$-lUsv)3<yUe_T{~E!sLuBy2~_lO
zR?#1aj|m;@a(?*TkZ)dvpuIfss!~uT0MgrjOP)fyxNn`yYx?`r2BEcdxbiAH6?lJ(
zN|}oTp|Eb2L%#KozPV5xH~ZstDWB$vQX*tlEU}J}c*PnBR5uzNJ{)_qKqH)CR;_w(
zOeCFhppCCpIfJyVM04;mZ}C7kf1N#XKRzaep!9a*uNv9q0j`gTW9<vDUYghj8p&y)
zuln%s@wZFq=Bli=UtJ(u(ffxe3S+QqDoH8tE8?!l!C-e2b>0MsiUUE8FThAFNpDr9
zK1w2E==lX}hzet~+>r~>L8tM;V=Pv+`6IOl5-ov=HxUW?g01c^dLU1LMGQ3s9GnN9
zo3B-GTsK${RGIP(99X0&JDuTn*ef}V;>TdkPFc=UWmRl_nQU!Gxhce!o0*p}6eDsR
z#z?fP0r@AE)}jW~K+L*!4#~2!H<5-Zh_}BZgCDDw6c&BsFg-JeAmhS>>eSg_OMP-l
zAs0&IPoLUs?A$i#PLgUblQMl0*FwkP3xS4LyIF43EMthb5TUZnCXl7=2E9(Ar*&}h
zo4Q9yk4Dv3AI7BiA>6wu)d`>a%SAI@M(s6$j2>L`Qd$ZPFIAgf#x806KLX{&>3hm@
z_r(#)VL2Jvs^j+a$>{T~wjzkm%9_H<u3er1<Fpw&QR67BkCzgp|Iy`{{VX2JRS3_<
z^hsz<B0L^F9Vrs{x1yK5wLz?hqTX|4O2OAI(mRru91`Y?@6wNK63mTg`BI|-dbZ(^
zUnbbipoq>>IKqVy9kN%DSg~O4ZT^|=L$AyHfFyCh>B*J>;>PrNvD?3&{;2wiz$e2n
zYXWn%{e1Pb3yLi`5R|RY1{;Abzq8Fg2Ab?|NZrg|FOy!LpJ7fYcawlkw|;4nu<pLT
zQ1NReVXt*HYB%JKSArOiX6F7$A@#AE6l|C2+zm8PGcBC3oQN{P12C7gA+#^?uu{(b
zvJVJuXvD(#a<EP809N9~bT=jApp}NAx~Nc)=)Wz;iKND$74@=UbxGLb-g9u76LA_8
z`CMt1ld8d)5?^Ep6o%vnC3XUWq_NA-TO%*lT^zZp8yL{Bsb@NBw$P%aye@AI-JRo+
zki(`o=58(WrX!DU(ypiN%$&EOoeF=^qh`wvpZWFh<WUc|_ycVq^VC9X!Tf$SIPBQ?
z3K1+?mUGaox=OvrU)Bh^80)CbyNE1)l~DD6eR`BGj&|H2M_a+BRSzwyNg%g!>6`T`
zZO|6KPFo=ikp<2hPSfC$n|q`)=k@)ME`EGHdr4+f9ccCU2W=qQ8z!t;GkpBe;Wn<+
zeQwLXah00LS~52F6jj;44Don%B9N{GmSh@wLjMZ=q1Y|M1$9AzmV3$f7!1`@T)r;Z
zsecCSvGJBA1IHp$S7@j#+uV6iNnD^m?K3@<Me{GA>7a<=H(7Ql)iukg@a8`uIR7yz
zEjX4x0eMS+4H8F#%*P}kb9X8s^zhCf%qoCxC1qREy|LY7YHdyCJ?T0a1dieOXfanp
z{4J)P!bmn^C{V+ozRq1O^5VoWvb6pua&x^QXe_5Owmgmg1RX4+KGW|WZ#SS!y&E=U
z-aBh9Y6_7}#~jJ~u(n{?MgKPqVCG<qYW3IM+njrv;x@$6hnpEJbhv7K8f2g^?w_5H
z6i6h{IFoZ@MKMjV|0NlRX&xdI`1S{444C!H*SuEVsVB<lUM=%_eZ)OOU)Nw+B5gU5
z9)sW~GRW;igmHb$NgFDDdsPXLX&1>wp_JG5eqfTSlDrg5+jVU|2zifJ`axo^;%KFi
z71ZwCUz`3wwtjf+Y8<OHg*U+X<Io*Oyo14V3(BCaqx($9p)r)E_t+tVsxn;_hJeHX
z3xsgcuVMwII(0vQPWtuo5%S6_#W2LTDX}PkXZU&CX@KlI*4(t}a3-9+D~YH7={7#@
z16K(7XKCDv9g^ed=0_B1e7L7)7z&q|WbSWd&>QHGK6`&wsde1wtjIsrs3HGI$%1+y
z&&UMpwILG6`FV#t1mY3<^y;hXn&!gxLS<sZ7}#hK1jUD<PaUY*Onn(%hw*O}aO`DL
zMDZ?P$E0Jh`JH5a<*|gmpwn&|28G&djf3LbsKJ`-7$LwHb?L+ycu*RXDu0eLpcS?2
z?Ugc2QQm`ayxROg1)~?34V0eZCd~Tw|3%vPzd5%I_zX-O?Ej0W!HCbo&i=on{}Z&q
z%Fg`%kHd8XS5CTWWDRV_R}?Om6xLsoFemJJ(^cVzknopJj1NYO#P6Z#VY{I034$P3
z;ZLq~jwcimxe(b0bIEgh{rGFS)zP5xFgwk7on_kl9P}BQ7Z!&MZ49a^if1RNrx(X8
zFDxqq1p^eoXD~nzN9mujiR|y_|62uapE<yw1`0|3g%5@TgBw6}u0+5FEDsX|YT428
z*Jr?2SH$#|!UO?|4CHV711qFo<W~s?2LfA02D2=Rx2N{k0u6Z`#mB~W2<G;~3+R^T
z#eaXj(F*L_4v?(1hXH~T0D8e^7i*^?AVN6=VipiUw9kIy6TF|~JhV5rKtz<2lQRgX
zQpE^yh(ALH@g%g5<u_tSi+%7P@;{>iej%v6=c|DPZVxDpg}Am0f}F%XgB<7&011Hx
zf)X=?q`ei#zy>BZ2G2CV0D_&jKensCwe!cnpF05<7~J;@`8x8!g$VdQfe8>)s5OUJ
z#0qc**d)^4=LdGtF~~-jMSu_(oDD!gr;gl*fAGiG#&-qjuUjPGcOfCd51v2B`>mIU
z0s0@>&LKLpHtf=|ZQHh;RE&yk+r}GKY}>YN+qNpU-Sthnd+-l>(r38uwVvr2Y+TWU
zFviFXC;Smvp~O0kI4C87POc%Ojv9TQz7<e#c+zd|_VI#)uHprJ@d5yuXDG6%?=JW>
zUacXxa0lm5>+<h@Bo%+a1>PQ49+>2LN?H;a(ltb|w=n*%8Pqhd!u{T;J!kg(e-j&Q
zFz`*3O~5arYlF~&K!kKdpa?^TTl;<jKbEhhU_e0uOkik`O+mawasB`a%Ci0EUeke3
zW+=uy@-QJmCM1{dx7G2CJ|--fvx6`D*IMMrvNTKU^GcXc%Qt;-Q`02OISENwG%7M0
zV30uJ1EoIg;GkW>Lo5*_!1*hpK7A2Cj0eGGm)^jyFWtsbLX_L@btHj3!JxB3sHG54
z&!1@*+Bh&M=~s}S+_&$^;~$BK2dW?1#h*?RS9i=*eYc%m|DRC=$6sw8Kf*|57crz&
z0R$0saAQAzwE6%yH3WEn9NfR`D=`p6G$6@~Km!&;3>*#PUhVloDr0T~2jP&p$`0)}
zK36ic8M9zPpgI4M=1yX<0x_W;^*IJogtMVzk?8_5d*zVm438apAv_rdp=F+Cd6wdS
zqh0!Zh>?>8Ai+T#z!Smc5=jC1_64(t^mqH!<5H1CiS0u%2#L)433;PII0#rkQ|Cct
zFyW(J>L9*K*p%@?h)RA(q6H5DCVN-#5MBaBfl&{s%4F-5T^%Nci%}{|=kD|9&dkpH
z@fGv?13%E(7@7?;Lp&0zrlhjX&r!1to<8Jl-zV%K*Bc32d{eBrth$F^g1MH|@wqOI
zMrWTHq9|T38y#a7*--fFCDnQubfeDx<sD-SY)e)Axn0s77GJ+rx9^zy6GQXGzEa#I
zBmJzsO{Gd0NH=Z&VdSD5<=nbUCQ*200mnX0zIaVow&?K%xijUYn_f_1FI9QjH)j{w
zB^M?Dbo8>TJBK%3b*dP7xsp^l)vT@oAD)~0*({^jXcsR+-e}qg+`5_*XP<G%<#+8E
z8ExDZP7l;gd+rU24T+%MJ;e31xkb2%^0ckbWXUxZH!Mgg(O91Wft4;&`207omP^#m
zMmLSHn3p4q(Ya3r_iQx!N%!sku0XFlr_y2>{m=6@{Sl9~P!!G|)pXg`B8tAW@z!f|
z!lc#d;{^8ZQCt=)Vk_$8^ED$HeKud-Hts!y>@=)qNRsBQ%Ld8q6N3AJPHzE^yTz`n
z6*bcwsn!T86F6TszaFy<&hEYOc?yjqIeNBg8ZGdfvyQqG?fqth>dnIlnn&8f);4LM
z>>r^QDjah7qcOjZ9Sm%|L9#8peoc<%HS8Ym?j$Y@ag~DHk53EAxI0_UiV#V-Jw+5O
z-=+Y;bs~AlbI`eFj|KBT>ZVhnn|Ng2_Z?+n$CO~Req)@aSYQ^BoiqUu@=?R*qnWSR
zUcOr3_gI;!r}m5V!9-iByJzGK*i;K#@6fvG2fkuoas6eS7WChaE|CkL^2+jPyOQV^
zr>ipb<W2!-1FgA!Gh1uO&IYFIGfACOhU->?j%MzE8rt7=)2F)(uFF0Q1wFq~z$r)7
z%?^s+tD;sP;;Pw~_+6`n@$?;xfL|zNT`I>}wSIoBhn0NRRP0{6N0e8!)pSawYWJ+D
z{foyYLvknSP*{U*HglL-2?o7xwD63eZSwDVAA53IpjwTCI!S-(`G%gRyafES3o1w(
zr9>qO5YIpby&lWwZacnSeTn|9SwYMVpOeIJ>Tl}(!m*!it=}B#L#MTR4ZrIdca*|_
z+W)f&>J#g=z>*{?M=)(Tyu<HznMLa%xWORs#oN;x4kEHlNMctg+tTJ2lH~W^=6ws*
zMa{$}#px9AH}aQmvjrhea=BO58((12vP{qHcaYh1Jb7qy`Nj@ysmtMxBmg<UxT2VR
z#MQuy<|-<33FUjng|EYll9E*B;m_N*3sKd#xUWB)EFa@;Q=FNIh?c|MSkOL&$_ew&
zV_Ou^_qOUi?>zdWhn4wWGe}`P_bh{Fn09OS5et|2MVaOA&=g8B;BP-0L3swB?VfVI
z=g!2LSqV~|nP>*@#w`xs8l9CU%T~+~o*<{xT5eI755hWG!jg<0R<MsQ#IAt>|EXvX
zwv=jtGh_32r@Y}Dy2r)UEtXuU?S1&1+h;eS-R!E(NZ(%%5+A$ge~-{XYGoOgGyeKr
z{_<sgmL=4Tg9z50_2;w&5o@6$%}`%o*JEb(A_UlWU1Db8{?ShFO2k~6@}xDGgvaEw
z2OO=+_p&67sbkZ)&JTGU$tS$9d#%gbRF^3y^nay<<e6z*Kg+~UH)M$Z^*xd>7ITuJ
z&8cWB_?sdev{me<FsHm~kn4+wJ$y`hMmm1uU4h}N9*ld{$Kak&C5lwnDf)7PzIl#D
zHJ6HH#A34?Frh0aeR+F$c)`!xnJW2*YtkjpnwA5oFXnTWQ&3J()Cv64MjdDOk<b$p
zOm<65pZHLk71tyP4O|7%L<%c>2Q|@b!ph((xx1422vmS8D8rgrJwft*!{Ct%k;H+x
z&fh;T-TWOlzhLDzn2Di+&xfpC;uk%|RY>TIO30z_w|WK-s%noKFX4^2hhDky{N@-Y
z>QU`Q)MMN&s-K!i=c$${LMd5MamqEz=e1UcK3({cvZ7!%(Htl4gY-y0=KPT|D9Lcb
z)%O>29=-YT>+Q92s{MV=U8DPosi5Ufboph^>9O$7eT05rLI;vMg!v!*LHHe>uEvV^
zdVKkkl9T%kWnp9U6xQVgfrlKAb*S`L!;Kl8>Bsa$6u_VAL5H;Y#tJLxoq}1GuYhFn
zB{RH!8jH^5)(93zd>XOVeQUn+lrBa8u3X~K`p{o6L9)zP1!J}4^wS)?$HYf2gU=9X
z7>zgKm@-b%TZqD}ACAm3BzMPr=qR13J8-FZE7871a8)Q7i`~|KH|g7$cf9K<phPdg
zl;WPviYMp(=eX`28?MIM7l=8JL+QmT*QRtJPXjtJvh3?#@q?v1*x3$^*Vm1?Ye>bB
zi|O%YNX#+9`ql^rA+8$>Ftk0?4&uF8l;Pxx##3-r8kjV6PMI1d=8_i!@4T))B<hOR
z{_7IR_(mwHh|dXnb`R~BNjv^l3cVGf85tz(pIZ{jZc;PQ=z=$Do`qdItGvkonY)Qv
z4$pLHqhsCC(5{lXEZd&<-<>&c@5Jdq5{#9sWMr!e$b$R^xmxH#x%d5gk${nf9L*Sw
z*c?Th;MmUN(M6{XuvYWqCy1^hTQ!jvJ26)M*`2v-AdCBY!>DJYi?wL7=X=65mVX(7
z@G(Sbu0??1Mk?$56f0NvFx4IFCq<>p0%SiQE3UY%Xh>T}PLK6F%`q*7m$z})H1oOC
zThXM;_RaHPDkJ?5(&5jZ%VGhkjH|8{dxW+1kUQ;%c#zkT&aRNjA@$@&kzHWaG$_y%
zm8N!NWe<1zp&jFm1ckV|aqBYe$J<7V?A`bCVG~&^cw(;1icg0bsK5l_-3ypf_nOCq
z8Hr>CkY5#&m~b<H4ci9$$<@GzgW`+GBJWnD4nl%lqsF_vz8dvrdTu8T!UHS8Xa>tx
zOtz9W2}2W;15$=80RUZ2xxD?4o?!>vJXz<Alwk-Xm!}*p3!f9e#`JjB5+y8NJv;#v
zOSLr1DnEA0ZOh!<FeIG)KSuRScGYM+CKvVKipbRQ#2u<p;#JAv#y34}%5t@9sj*QD
zB|&?s1sTQIWkOE-aAOqz{;c{n%)Z*9(kjhl#jiU}W5I(!*zf_M28skOhisXXs4Ljc
z$7IQZEHjd7_z_|^+@30L%gsU#2d(Bw3a)bz*0Q10RvOp{MMOnilqP<?jtcwDBqh=d
z!Yr3F%=%u=5}<Q&-|42CXDwvaV>v%A|EcO6yxA-f*-<`k&PO&JnQi8I6x7EvNi0?w
zMJXp=?dkh+B&jp0!PM=^N@4PV*VOUJSmxs*wu^^BosfyyGMDgQB*ua=oHVT0Afx7j
zw_p}^W{8M^+vLJ48k<5wpYjRzUd|x)=!G6LI?Oj4?#Jh-#5^Y{m~!je<1-<!yrYaR
zHL0EA(^NAXXjEU#_xWFX50bq6Aw;RnSqrWz%LzqvCHxRqyFcBZ-eBnK*=JzIsMPA@
zpF`ItQ;~IQzSuLxYygUe{MQ7vN1aK%iDhv!^yq>~VCeT7XBtA+nYRfb*Rfuyg%;ZB
ztJvqY4TfeOsmR~R`lKD|4_tefOI2Z+KavT{=Z9|H_Y)!mCRsMS?+u1*m>EOmba~z0
z(~Y2*B>q(CzmhO51aYVBUb$g>EY;SQfABlKTDd2whZqqJo^VRb8{~V|-97l_!16lk
z;C$vK&Vu~i8T6z{sgr$``ZqehuZLcm>l9#`Sf-AF9;pPgTGJfw17Lnt^tHCyMBAXg
z;3&-N2;~qq#TjL2F*KXsoo6uDi1|3Ln!yf9$~ZcYOoqW>G9b04K18D?vz_^GTIbqA
zgy_9;e_S9?`+aM@XLRU`);xSWkH%j3%%Ee-K}l10#<zj~y8N<+)Wb0!aLh+z!<B{j
z$Ul22=;2nSt6)u&Z|y3@I103ZsK-)JB`~}~wSIsV&}xSe%I+_t2}p)SGX$k|#st+X
zuMS<e6^E`!>a=yg4bItWZ^%#1o#)T+LVj4Vs`!2y<TTHXiQcEuj(rU=gS*7h+Mn#4
zzmJgpU{3C@G*ML;&7_ljnaeNSoH6kf4(gU}$7||BUGb8cB0ROAvc!HaF}{IJfse)}
zQ*EE>^1h)TZBce2WX#9FAB#HS@m)jw;(<MP=Li=Q^ecbNUaQ9nDu(gIwv(y&;@Dr}
zt|+z?5}kHTGFRQV`VGbOGvUKsX{)qSaBx+ITTVs$Ya1-gGNPF|<{TEjr}}^q<6Hg1
zj3r;hN|bJr7`hCz#4XosgDiyxXTz@tP0l76@cnCaQm(4d;X4|>Cas&!nEtu@CT<w=
z+Tr)N|5k)nmeDWgg4>eQFHc#yd=~`9&JrJLAJ+v3gAy~95~CmE*-*-UzZ#5mYZ1Zo
zM~ozhI}PosY<(NI#~~@m7RC5}3gAr=k*tL7GJ+ipS!1Ny=XcMD$<{JW30ipVPFU}_
z3nlO~c%80B?e3T9p&FI8;?<aII|jSTI41$Y2a8CnEmxjm(g;P#Y3__`bt6Jcjd&!6
ze(6@Nm%0gyh?LN-Dm4eo%IZHXbBx(2*cjJ0TmH&N3e~XteX#-&bzzS~>*IeY$Ypc6
z2qWn}rsAvN$qQH@oNK`Z{Wj$qUW<QA2W2vV@UPvQ6?O{Wgg#0xAm1OcV=j>y1gRd3
zG`?P%{Z=|El^Tx29e?_ksYoK_EH+`__h?Y{Zi((5%W(#DE6oTWd+X`g?nMpkpN~ND
zwaZ3DyNbY$<lX`lSo29lz+Mt7jJ;Krj?d`fLnY+OL+v$+EfJEB?VPU?eoog74kq^O
z<DxeC&s~S+E_a{`j{H+6s-E=`uv$)07y{mItg`}_lrSNv!(q(O`(>U&nDxRYBp=M}
zQV$?-Xmco2=3@#4dC^YwZy#H7a9by`Mj|@e{diT!Fupa)lmShYhmD=q8)V;c98LTu
zPlrZdUDJvio(*az(Qoo=U8}V86720cc?Y*57arDdb8J1^u^n%jD}#r%*afUp$DHM`
zgA66vHSU^9Y9&A;2l>~OJ91_t0W%L|^}(D89X(JhC-$J5B0;{|*H|%sGkPx%bO&b<
zsyp93x_p-MV-IJsU*i#q$(7_PaSXys8{+%9V`pGYO{yasoiQ<26Dv~j>`IvRdD7mr
zrkw)B#)(2(`OrQ_dLlC2-?8}1c#6lVCqy%7f@6vn)*ox5>a@3zJBd$fT5OwA(nR_@
z^J!?64^`IJR~^_m^P7FBB1{ctD|30(DqNwKB|R$b7f_+EFz~<DKY>LV@pu|NtYweq
zebJA%Lduq<A=<HJFXL?QF+@uuwXti<o@BK%1hUv=%-NAu2ETvhdtkxK@B9e63R1XU
zunem5Xo~_8SrNFi(^<ir2hs6YqTq6H0<OY*qR>;R$WxC)Es$#+n>1+WM@l=*6r{HU
zB`;pXZJn9>N<XAkOrgz`w)u6-H2m0}Q8tO2wf1u&o$Iqn79<V4g+{m-aMJM!iO;_n
zngW?U3U+SZBUQ7TV|o6T2y^Dj)YFNXQ|2!hY4d+HG=yR;=RK-GbK@7|J85-VBM)!z
zx9skc?d-EYZ)8R5N0OgC79?Sz<hanaOU+kRjCbX*0-uxrS$XTVGFoEjYQoxR!`7g>
za*MC;T%Ff8FL_qc6@R|gocV~${l@Rnp2hu3C2>}BnHFKNAs@j-!;#E$wW95HZylSe
zBi*ih%bVvCCiwiX#F`(`(-x!pHMJ5ExG_yQGPeIkHuD62lF7==dlx~`F4420;$zO6
zp@ykBj`azK8p=O~regXA@}9_94a*`A(?j0<N}&I4=_YsRi@040rd069MY%?mzPlUz
zhN{4YTHFzt-)(o|PfI4ZQ%eHfcF|CgBiA`?kkX9rDzay#NrPLcR64gDCQu}|>^{h<
z=}{RggOx15hkt58w`rj8L$I3jFRmMgZdIM4GFs{Az*F$xUiqF8hsIi*YwxTMWA(c;
zFPvraEW5O&-{@4uj9V|;V_ud0u07nXFOyB@Qd|=zL3jr~+_mQee;F3aq|Rf1anR~I
znL{^Gf>5ImLbRreCVxVt<!C6<d+e4XCp|QT`#o(%Jq{l}w^JrSpc%?fBt|O15X1E6
zrm9Nm4<QZLYYJ@q%iCmGkh(WhHMC>fV}f(bJU<;3E;eMBQeOxO5%t8`UCIy}UePJD
zm1@)`kjzH39!%Co<%$zT#KngowNe&}Jrf-M(J1RGOK5QihroKXU$(dEY2;=~*fs?5
zHh>4o2$W@9lI4z-D(bs7h)rN8R0Z$PqMvI`+3t!CHTAAx^iUkXf-?0A*8eQOi|Mbu
zw_D`oW3zQBJ;+8P415i(e0#;SFSql$F9;D`T7)f46XuSm$>1QU>nP97c#6fSr*s~s
z*s|gCir!&<b615yp}s=E#Emopqe|whJwF0{)(2UiIAEcESSCwd)1_lFY%n<}h4k{}
zpj#=~xBLbad#ThB(qegnX8jf2F~_7M6Y%(zd`_zZy<FUl)un9h70+;jyVIK*6T|fo
zrTP*^{<vacnEt1)`}rI1__U&Zti`om9L6svKxk2Ww)m4Ucz8z^Kj+5IS;~uk*s(dM
zu;aqCu<+SYbiPujg-@?EjkVL%Pn=s{hpm#xg$r107u?Bmt*Xj5GMU}}nT+NN7?JW?
zaDVT_qiP1PDVaoNfmzjA@&zb10qUGS%TEuKmONk8JI-Nibg}>TmQ>T-vA-X5o5B$M
z_f^!~+Cfox^#plAXzSKq$r*UmaD!WjiUnIuhoM^=in*1c0qz9Hr>@RgU*sh1&IRjs
ztOTSxPP((q2Y!(Y8<tH^fR!CsOrhKDFAU*b$amxgeiICO5N%9l7b~p|znDzD$Inl+
z3k)-@jq}&vD6H*0#hHDiwvL<)jpXzQZKt<YdGeSPg!stfRiZh<)gE*lW>3>%`da5w
z0*Cqtn5z+gsix4(-crP)ui8RmC>7`7fy*oJ;}e!5v-!V$%K!bO{ZACUuRWx@(DyI(
zZ(ZeS_d{5n!<nY71nrmetg;l^b{aouGU1C_BRkH*2v~FvueY>%h)l93Y4yhhJ;b<m
z?u*q`NVe)tT^rZcWi$r9lB?qlzrSBa1vUv4l%t}&&R0DE2{)0Hl1${wTZ{-9@P1=?
zoazBE=B06Sd#$P-)>Sp?BK*6^4m=!tb*~oq+jfH75>aH_<W|Y25Q}}%uo(wE=Pq`0
z+UFo$xZ70L$(tALJZL{g2sep3ord+yh*(klN}XD})yqxPo<ts1rtcB7bbnpuc#TOe
zwFkhbP1p)7kEig?(`=`Y23Xl&#JY{eJI>gvh5K<<r*|YHa4Qzb#S~q{h_`%(j^L0=
zhT-^YgA;cM<Z-u?NWoiHnY_OLwLu)`O3I$-8Fv_`4=gI2M9VS!IQAn6P%hWk{CL;5
zCD>Ow#PjpyzJt87Yo!RmaL|tT2SgIf%t>R_6;#vyfi)Q@1kVs0&I-3L2^#LrIWXEL
zj^_iU)#zn2U7)fHxt<XCbY^u!9D?=Vt14oLs_yL(E|U+PC-D&jDG=yDJtI0i1~z8Z
z!~q@9sS;24b*<A~jBuSR+!}53hY1$f<So`2PnQb>tu^>LAyYG8f=aZJ2{HJrp5c#(
zJ%4T=+0j;Td1E>%20*AM_dFxZKA3dy{|eXK95(jzQ=4FSr_m?T#4U<3Mk$$O%C7pV
zFrU`q%y0yLM;t0oNbQig*Vays<EfEh5DH&4q`0M2u|6^$DJlX*hG3O;MILm(`uy#N
zPlhc$&dAj%{NP%Mh%FGteD0_9eX+o4EE>kIdHjuSx7>cB-QdIG>l&+POl2{QyeE(^
z`K5y}Bt`FviH=Zfc4MY((8irII#B3Q`F^M>I#cgHjLPA~?&8ISLn^a_HEg-k(4I2?
zLg+y-Rr|!$wknyBc*NQY8TTIYmtdYtuE@hy*0=GEupUCf?SHb&*#C!d`u`7>nJc);
z;@1ZU6^X2{NU>qk0#ip3S&?>JLVdI?6s}F7aEF*s2QPV1Fk~DGnV7H$k5~t8JkmF7
z&h7)i@5X!PBPYAjSMbGm`>DP5f>&ORU)1jx)doaKg!uleFo?)P-^a$rIgw#rTwIuc
zTpW{s;v!UdW9XMHq=P`PVVxwK^gDp~+StGVZ>I!qWItfT0`2$UIsp_4aNtm}Fv^06
zh>#&Mad~fmMHJg_?90GlkY;dy91Ao!*uAb;H<wYOeJH%1ncY|+1}IJ>GIH|%7h1fs
zQ=ma2Vgt0_xKW~gc(>@p2HttZIDx_YTR+KxG8h4a+|sZx9UUDo{`hqu7H~Q-nTV$m
zL&W|NOmuLEAVDC27`P>1-oEcB3ZOkO9OAgOT?El4`Wf`70N^_a?|(76fdkPj#ot&E
zVYLWsDytypJOjUb`?Y$3efk7bLBXK?zZ0(&9%scQmud}|zyjSIzzVnGskr7aED=G^
zE3BaRwj6wfm|)&fp;|@@?(PgQnHC6af*?Pw@ZnTcmmmZ0P`}d=Vf%^j9W{XI7QRoS
z0tFZMYBj;ZyJOuP{PP_&`ewhA;<2#605{ixfRqog5Vv2R-@XmM3i4V6NBwztVQ>oL
z<Y$;%j|H*1pl@U05e9*WgUQIn$c6)$D2b-v1Cc&8`^L7BpC_T;Ek|beuFk^Tz%~v>
z{XI!-4POcUDKRcVKo6K^nCxeNu3lfDfk1%sC7}>3K!ZpX{Q(V!(@dMY=AYlplAL+%
zNI8B)d2_R~fE>CzxS#^X=j)$7K()qiIR(Yhv80#Tu^&eo>ilj0oKF%WqTaeRBqTC2
zI)tP?L60BaSOToKQp9|K(XwKTh0oB9-yP<Y`z!-MvhPWPc&iUUxhQ;C4h!n^HRu9M
z%uEdR4g2^r{i09&!<q3jb^l}X4sb6zx3T}3oPEN*1-$knNP52rLh-p~J9=PS6y6yL
zeQ_><J!^MvFi|b6@Ar0}b1~^5L{M?%EPN6v0u#^gx{;}&pFsqj6FVXe{qxLPaDULU
z_))+YMUCSH^_gF(i1UB$_f;W00|C(ncUzxVAjWqIgI`)lv#fB86@Zugz`(qG!DUK1
z3Is4?CIfdMzqi*!tU1)+RBE)p&ym|g!oX-ap@_f-=Fbot1<d}rkr;_!FgypXL4UrR
zK);i55B^P@ME;O~_uTHD=(B|OZy6x<y+YxTpjxP-uf2AQ#P=ry>J^?R+!oxG4ZnN%
zXi;=RC-x3&ng5(wqGk+N9Nq|3sJYSeNXzfCnu)*gV^(PDbw>Ifnk(uCG_G}FwZDqL
za<4pu#oHc<;|sS)1)?;%5SIiA#ZqS#B&!g>+%O$=?Yp*C_|mOB%}kT1LPzI`Xa8M^
zC}6AJj8a16{0rys#IY?NX$0Bi&U%7Z0P;6iJDB{usLpbNgAmk6XOh~i)2pNOUz(&F
z{$<hOPJe43YDBSO%!QREQjZ?Ml`QI)qIueoBXVq6DDL~ylJCY*2~3~&;U};2#Zf(s
z{h_Md*~BD9XOR6Yt}H*{Bmi=i=|M-bf<cs?_Lfc$_C1A4!&_~&x2YqDv%o6p%;sm>
zV&4C)W&ML&!{){)W;vfTyNDR^XWvb#mdNZAghI0p`TWvdg|7xF-&*3yDo;$aH7cg7
zyXY^GrSZ|8M-`mJg+BTf94)N>NXfbF7xQh(sCneM73dx;Q}S10jTq3DhhqO(x{H4J
z5N?&q)^gh`S4Mj^6{B#a*4r8tn5Fmzdjc?>?&(W$Ge0yXCf=|s`O7gQ>?8#{Y|xiU
zOCxM+4Y;c3;~`2e$4l#rct$NiA;l(-g+~Pry_sJBzOZI?>;k{&B7b@-a|w>KcNCeV
zLZo8(w}bhW3sw$a7Z#R>gvjR#etY*r2C8Wdn$iuHREfk~vR#i&VxtGS&5XVcYBcD5
znPWN3a;QGYg=Vb%Q|5{nL%mji_k<3DnNZGmv>gd^((#QEAuVqM8<JG2)n8)LMO|oy
zVi!{i*bTnAn7R=Eb(Rdlp-7P`oinK-6|1^F(q!C`i!ZW60p#P<3^+~{ST<EK?cOb&
z?Gh!0B+DS2=_vBCzgjtjUg5o3D%=pRF((zYr+PIaPL-H!)Da4Q_>=V??*wy;lJR8C
zmJ0r2XX-vy7=!has-}s<q;0R8g{7bR=0uwKV?78SUcO+bJfhs0HTzT`F*-BG62v%H
zEvw?;dke)Xtr-(KPtqEW;HdJnC!<+>@B-H)bk&6GB-2@Hz(zsLDWL;hDka#ESGalv
zFr%A%L?4k{kvqoAohSVH^4U+6(KK5#n;^qMFEqVM<iyA608<>dW-z4X^_oPTfV%_6
zKUa}`3;*H`9$7q0*sW2lzg27X;)~h4L`D&Nq+@BxmS4yAX&c9oM@D=AS;jhzz;)*D
z;<1Tidp7v(VNb7~UjAt`z>vzDW%2sg@`bh&MBp7xa6DwVWqC%~fgv@}-7Z;l!PLNT
z_jluIpEU5e9wBk892s&GVvKU(w2ya3?;0~`XsJv*9xNgvRA@Y8#wWV@VczzryCzF?
zqYlv=|69q;l)q2NC{v>dFr?`}w((b5bGbi1QK6p*f%s^VCVUo?gm`OFkI2+~?kM`s
z%5VyStg1@CuRK7H4LL){P*}xhdF=AoZ|ZY`PxP<lgQm}6HZ)t4+Kg$NSpE^gc3O<f
z2gOIsRBB^pzWQiM-l5{S*6zs$%Xo1ZJN~Dal<xB1Gma>ML^iZyrmHfWa%9%Wxzs!P
za?{Irm}$GK8_*J6MneiBI+WpKJx1C@F9U758{YDou#_Er12NCDh7eun*GGq9%4X@e
z_uvD>&Zxv3RTQ&^?XAJ3K<e_5dW_!iPs&bvf~()jcX|}WH7SDzq&tr5@(OaQo>K9^
zw8*~+<Q<2{-$xCrE#$9RSeu12me$SDUyOIFH+3%xDW3$W`xi=is^s49auA%S3ylrd
z#K;?gWnH7f0OT@wdmBhRL0U0nc6i_67~f*I(BblpYoPoO;Q4x}qhxr-XR5ouf`C_H
z^&B%ht~f?wB6M?iUa-6W7JuGwThreVzr$t<ST?AkH3>xyY$m|<rah|Wa_dq-s6T}V
z4=F8D*(dl2VIYvqB=yGMoW5N}aHD|9OipznT3>Un_TXO122FA;3#`W88uBInHsZ$C
z^WIrfX>_hRInx^^%2QK!*1lq%mMg?0jFfxc-dgMS2`%Hf%osf~m?09f(>?b}qAHr<
zswHtH%-<dly5>of<&?DEoMTpxo59di%P)ROH+)FYfbJ4m=`vjpSYsUyJMEoIQ0|~Q
zP~lO<2rX4e7w}AMh!{JuWD+_5vk?ui@XNegW;I}3Wg1<1p6m^Y@46C(Atrm@FTTUo
z`RufuT-EsME-0%HeLFjZS#`b{W#+vb<lsg>tR@f5<p5SXhR!MyZWCE|8tL}vASj`^
z^#R4<hp;m{Hi$FDO1Df15u+md*$BDZL1pFFw79%JDC&vJ9x6WBuE88COx){^`Gp~R
zVDgt#d(-_2^vfZq6X<F*Q>uN~R-0*dzu~-aCL#O6qNeBX!g^tXBVXz~NWVeL>xzLv
zcaAgX*`@g{AAQ=T6IMP2NkVF<$@-*s>drr8g?f!XWqi>B!F&lmK8#vl46~1Ld}fE6
zE(Mz1zkCf2CAQAJ#h2w*VshTVj7V@g#vL8u$4PPn&Ov!r_dOta+<K+pv${s>yl;wp
z5a^ukuY8KsB5bca51){pZ)lvaAqeOo3T;vJEsU@cBDY9i55(*lTjC*HGQ#X$6eKsh
zmm(cmWnxhbKGB@3*k06sRf@u%`Bn)-=D%PzF2|8V$r-v~kq<^W8ZTU*g$-PRR2-!a
zRXpp1BjTad>@Ja@W|Ea#?%UkZhINyBGj-aPra0smm#ey7Ix)SC@g5jA+ozwG!|2|O
z6-o>iecTY-dlG-lVE*~+jG_?I?0GaW4wIoCJ&v^l-jtVN2FYBZLqA8p8j&iM5k`X_
z(qS$E{%a=xruU$=0ItjYWP0Z6&JPO`J#e_h-s`+Q=Nd^28xpxI<4SQ%syD-r{j%*a
z$BCqLnx$OFykJsRr(mZ6^Uie7@*UOxg`^8lnY2T#ye<wEtuj@SXV15Jq@C(9oAJ>W
z@R2;%_7x19S?_Sv%pSh(oCyRIAbM8%vGutz$1yd258J2hvA?%dj9kf^w=v9TYUPeo
zy-2*XIs4oDjZe%d9YbHzab3GAqds(rG~jH~Gu>xCYkHV>Y_$V4YD-aY=B)u8%}@?z
z;?E4qwpngOE}~1rPQy?Lvpr{1>?y4Z$Dez3EsagoztW80)6Q#XKHl(ahR-BRtbj^J
ze&OClGA>3*vjWLgRcZ`Xw6z>X2KtIZtL2(|i>P;2HzaCd^JXM&o2*eAY{k0ck2h}K
zX~_Ky9MRGls-9#@ImPTjQ(HCIi_nQB4)Y98qjXlhASvuPlKdrfo_0~Om48`!8zES1
zZC{RePt=R``?pR<6bfnOqH3pDyU%1T4nfC4zBhaDU#YUS=d@T|&F(G4OJp58jKYq!
z`(LWF{W3GH7-JNVQV1V(<s_mvn=c@1;$4$Y<ZPj<O8({jI^%x_1;UB(SVzYDJ8)b=
zO-QFq_-Akhw;W^$R5UaW>3dr)CD<!uJ2>4Y9Li~&exI$Er>C9D=Tx>pXx=s8z#Sx2
z4A)jzxhcqtQ|G)a=$|;e5z|oks4jj?W84_(>=kG$s=?dO1|LBEde<QUzFX_}5YEDn
zpFxyx0;swLJ-^3hi17alsDT&_R|kbaw)UeENN%|m5DbZZnSEIp>(dd7l;40BR8Ie(
zFJD3K@^_k^3(T2RS_wXc+_mS}si%#1X6qEBXq|oCWy@HXC6MHVp;Q4d>&z#}k?Jwr
zVV}&9w3#-a^dN@AYJ8fNUG)Wts0P@Xf4r=Jfd<V!s;|Dhog4a?!8X~_M{?mQof5!H
zZ!`glgQrK7SO@bz2lp<;)}H<E$6t+#wHeMA*CtX5e?<#g07XVv+Y9?^80%m)+?%Nl
z--8uQ>fO?f{Jqw4vDI_L1u2%(Y>M};I;k)7Ax*u<*xEsWC%ZrxeZ?jUI-m*5+O6(Z
zR$@IhY~N;K%24>o7_lfsJM^~Wtn*#FJDV>%`LixY)*k`sNEVs<xJ`Yq6j<1Bhr%lX
z!FYdz%nb(<HFAlj6uZ%>H}P<KN!0yA^Ng_{?9127y>p=rVb<#`TREU-KyT?@YHOCd
zPDjZnw6izw9kB#^_lQV)i5}m%tM=vwetf?qK28@)HB2LlYf=SizD-S6hES|lWE`Qs
z`P>4_CGdQ&{7emZBQfG&pw^;5b0R=Nj;?TJi)-(4g+OGkpY3GGL)ya9JWDc?dVdbX
z{TDH3m-F@BxT_6KCa_thH*u@5zthq1>?KcckFVPLlsq;J;F@T=Tf{!-brFRk>UIjd
zEGM4}eQxOge!3sq+m}sb=P48)aWZhe23LP2kjmfa-F6%B$LSzvFtZ;zzZ%-I?RRVU
zsdOcWxHj^|=YZC8$8x0+#iqI{|NIhiA_O8<DVoT%uQffrekcDCG!(<T<cfIHIL2ob
zoq?8@x*VUsX0QA6R<rAxn8)d#b$%iCDOU6Z4&@}}Q%5(GJmo~0kh-2Th0|dqR#Km<
z(*!k1y}N*vN(RtsYir%#=k5}T{Zm30R_A+RLQ-(x>!>%CE1x{Wkk3x$-TQBFj5Tz-
z1PUGjX<;i!6RT&7a+Q~_9_eup%)&x*oex|n%UPwY5^l!xk!rkXJZ#>PeJEy|sH>hs
zl35P#=m?7ZV`{_Y9h*8hceX>C!4QZr4yJPRb1VeNYiwMk_iY6x9MyHk^c+f4PiZvY
zJ)<A-O1b2g7^Tk3;Q<nre0X%T0NH-VORJ!J#SHXwxI5ewisd?njKL`pK{xRgME3A5
zn|j!uX91{ib(#Jn%1t9R?W(un#g}Nv3n>{weM{p=L##n=*p3Z4X^UdN?D`L~k;B!C
z4OYFu<cs{VE!<s;mC^*?x&0O3lHSg~s;*Y0QgBVGiWgSL&jVdq!{vfCCY~erhQxR!
zT_JO#RI!fm;c8Y+VXaUL51I>`ZNXlZiCNf75=9-|Bp>1ei<uOl)<|pN*M;c8T{*J9
z(=UV_$Nr*Zibn!TxNnQX2Povve!#UxZZ#-`&Ud8Xy#gh{MnFpX9UUicn8TcSU@B9+
z9&f)!drCRrT&#tb!n&Dxj8ARJEQ`1?<#3a}Dlk=juU6=TaWCG4)>&Ii?*-Q$m+a0<
zP|G~py}RZv)hD>*h!%E_B%|2yGN0(y)-K{;dPFt(aMh?NYxGiGhkWZR%-vbi>wDyE
zkV;f$uWE+`M!4pGQt<duyk^fwF-snGnZj&7!~-@G09s1aA>Z5d_h;rfNn;{ZYTX>+
zcy<pF-=?vd^oPvFTL|)T-<fT)Yu?7Bfps>J#@}~(HItyvm@v8ai;(8Q5T;$rHGV^L
z>AY*`h)^aSd|Tz;W@iqJqyu$Xp8PXgp)yY2<Jm<Jrahzw#zk^k{`x=**whk6+2Qg|
zTG<C4*u$C&PD04YUh>FtBT)K@!Ln;l{tGmnD1`Pp*gcGv@xKk>RA^=CYAqiskmOTU
zUA;KKP~-hz122*3P*yWFF!Wn#HZ@gW=yfRQHeNNjUA+Ozkw<C3QQev@(}uUyE!DC<
ziQz(+#2YJatb=~N;A|zDy1a|@4g9MrvMU?C&|}qp)T<QU<U_W;TfqP}lkDuq0u|@x
zyr`P4;HF!e`<ls?c;VKB(i81K5&qFyvce4*VTFxx`KU~HQ+FMw9$S4k!Sw<D*r~N!
zEKg6>Jp@5k`vtO-=vk`+$?K|VspmXA5RN+1jenc)CMmkKD`aWG>i|I|Uxm7^hq-10
z-s5Tfi#+JNr9^q0n>hz+U%H^nwvdd8{s*K*)x#Kx)MuRCAo)Ve!lGSy)~9oo6!6q)
z^(X?eQ(g8nO)IDqV~paKLCXiLH6KF@t<=-p5X8y>Za7Svt8CQd+DFXZ9b`!gLOTjc
z><4(?2e<<{kHo$wNw1%KCF|r3JxhTT2UNkvsIu=2#~)Ydg%M90KmN$V2ga)})wSdK
z&cO*5{m^Hnxc=ms;mI_^K*CRnOW=UZsusDAAvEMhuwC&;4qQeBJ4_jnDM4QnXvI8&
z$JSCG`B76#3AU>wh4mg`K)}6nzN!bIi<I6#3%i-cI!T2yXHLRiU}7o_f2Gf}nKYd6
zSerD}C8LOflX;#6Ok;Tf`(4i71p9bYjnz)@{(kuSz{Yj6l)xg+Rmg?u(==Vr<1y$C
zUl#|{F|~evt)c2=CPS_a<LR&)|L*T`oTyBVCuTY}<kA5G6nwNc7F4fY0#*nC`^u2w
zh;lNaP#V9w6`40qUzU7j50tFmXI$rl-SJIB>@P{<*|rwUfG7dm(Mr_Kt&~jtDf9ad
z&wjG&2+bk=iU)ft<Yzn-3u(rIjpwnhK5+iZi30yyXk}Qv;!aJfRe273a818mN39~n
zU9GzVT9Vei)d*-_65Zc+!_>`ND>h>zzY||p5~LzIeoP`qtRl?Yiw{P-3|6PIfHij$
zhPctkOegLl8i|pLkE=nL<I}(@Ba1on;40Q(6QeyI(4T|_pMMX3sut6}u1ANLz7dM0
zx#3<iN}#<}b%lWe3!?7U2?psGSq155TxOLuue#FG@|Ci-6U`>mQ~u3l+0W1Y#n?O%
zRiPsG6duoNYfJ;3OW~u^KriX(LWS)5)yRyC(;W|=#PPg(f!EeO?<ZSsr%9}EMb_^)
zgt6M*uZ0e{8-M;l_O&~FGzSED?x&f6ye&UkEl!Kc%J>~rnjFZ)K9cRG5msewZ>RrW
zMVNx6O>@@hnUY#WX_X!STjTS+_WZzI`$4mK!Dn9L-K=>+yO@e_!=CAtif0)joI4%k
zLE+iLGw!+qSYXt|F*s>@WYs@$uIpnk<%0C!@`UY(4tt?=aQVByq8wMpX<a`Y)RLal
zzL{dVU3ZHVZX~o&Z8q=6j-TU*#fLPH7*T;H)ns_ZA&AS`y*4$q5%yqjyixFFAd7S*
zW%DpGADtUn`T%?}SV%2sL2q4M3#Y;+(`zsgwb*)My46jH<Q-9PCIy`x)p30miQA@`
z+xlqUz!BUkU)XMlTW&has5#yk7Kn;w75}oD!^eK}>mN2_`+VxJWJ!&vvAuWq4!x}(
z*;+KL{SMMrrS~V-3&FH#EhaY}yeiLvsLBN|;OtK_V{S-XCmTM1pYt+3|G{J{_edhz
zNrG+lWQdW>#jBZ2_EJ;g{bEWH^HzMcahS8CE7{YEL)AkfmaSSPeL3zQdRJ53;&ud5
z7P20ZI*HSKqcb+Z&1B?eTBAuhrKs2CPM|~owK+cDC7}(&MUDM0-?`LaX}S%(+eS5h
z<OyuB9_y$tUjX~fWWx>mK*=mjo-HvnEzJhDk0q%m+f>t*U#8M;#8pqq`S3}y+sk!k
zq9FeydWDz1SfJp@)+KZX9`@bM4sshg(ES9;p<<MnQSM)q&<Lrs?;_Ib<fc|VN4)9N
z(4vfiRQmdX@gB>U*STXZzvk?#ODZi<o1SbFta`nu&?CYplv=y%oWcXJeOXrT6VJ}y
z`Y5n%O)>+25u7q2b(;+S3@Q@wtqfK$@*hzk`-BbjSl<wNI9%DPTzqLXC@2}v-!GFa
z`P7|~CBANzS|4u&Twr-eHZivI989~etVCqScG~Icd6z_I4nP<452~2>32hURF;Aug
ztdxeS5s`IVGZ|VzxLOo1tPx;St;ZimX0|3Ni)nr-Z*G&0=^)mqM`uF!Cjn-?uOE#t
z($CvqLqi#2*l3|C>N9UR+#evV9xf37O<-7&H<Y8O+MMAw=;`pMmHddK`D}gLKn|Ly
zjhH{ETsRZOuAx0`Uuip1PuQ>Kl)T3m$9c2}?!r}^wR{ngn7<LTZrCZhoKb|ZPS^O?
zDWpzHZp)bKYj)ZLie0?VF|AH}Wr#Z1*2QR%qzcVk*xpEe_iUMb%T_LC`2~S2$#La-
zj&8jLt=Pru!N^$<WyTqow^v|lD{Q_w9t3Z&tzQ2p%Z&4Xu*_K4IXM1L%Z!DUiR*tu
zod55d84DXbE8G7o&$$&`B`JD?K~_fE9e(@2Z~8ZgsJnDfSW^+vwr-$*5u2pDyZa#a
zOJ{HO$H!0ejAj+M^S0;q6CWsgdIdyc8u=I=6}*#+v5~RaF{C6_d1F0@h9-BKrsg_w
zc^RAS_GQ2i2C0%IsIHE!aLgwFTe1ykdaI8`ij}i28)Xcc=*AAw;1H<J@uBhVwy^<Z
zO;hvjdlczt05Oj3p{^N>iW&4sI7Ucaj0QR`u{E-~IU1L1`o{-sPHPT$?e*0I>*p8&
z$r-3)O)HHXBx!2P#vfrX3d8If2tF=^es21sS7Z)mqph9$uCdO;%ZnwGyNxACrz+$O
z3pl66jswUwk9KYt)B^fdmq}=S3iwsQbSg{*NDfzf6>x+@M9Znbib(`SSJ&DM#M2ST
zzlBd9zyRdn<o_p&L}(cL^fk8rKoBCzAMgUvH!}5{`yb00e{AJWf5r?0g9wt6Rl;6d
z!rDK%nja~Tq<ZY~@9_u}lXKIjt%cbQ49G{OXWIHkW_l3(_wW`R5q${+6Da2E&Akr2
zj!pKKPP(q`6(Du&o)@ldQYj_{g$NQduP~GLz}_#Rg+U0`VY6HFJN=SZBCfRXrZ*tD
zy0CcphJ<cATcZijHhVk3DdC3$I1=e+tSZ0`h(S$FjX(eaXbv0bv7yfJ4PS3@6Z(~r
zeAAw}4FsT18Hd^jqXRa#y8;9C9dvqO^%oedt-THO%lAj^lT*aR7*u0Js||Q6V5KD{
z3{Vg>EK~_#@_1!v(E|ciyS=Ul)&Tr`o+KiBbkhmPJnsOee%SRf<iItVJ*EBtXuf0R
zb?}bBZ%q$Oz?tfu>p|B17_kvwgMI*^itLSFoYB2L$9UC3Ks|u9z|BX&DE{wmpr#)I
z1fD*?s1ig#D+W~FSL4y2DxE5fJ$;*>*~)Lm)Sq7XAN=E=mZP7{xTenTuimAmpM@X5
zk{LqF^Ue<k5My;G?kiA|&>pM9=WfZrmtxeQEi5mtZ+n}a?9BE=k(`@aeiU$Rb&GAg
z{ZlGh>@YZfY$gSrs(01R>@T2Hz}q*z{i=Y{`U>Cld2TH=yFdkbboy!E7}1e@xPP*h
zCgwp*-adxb+S`E57#PfU!uE)RkTLsG;e8@gglYlw%>E(k$VU)v!2XjDkQxCxNC1VT
zOxQk>XYEJC1Bkk?A7MTqjBvp)%s!Gg$U9(-qVFJ&|144f60ZNRzlcVVbz|Scct9BK
zg8zumBtMV=?f*#51`H7Zq_oHdLa@IDpZ}z?PsqE#_OkDP2dn=M@Bba{{v9m-leGSm
zp8t~`{z<3*NnSs~J_a(4f>1V=-;e?H^xr{keLS#n{2uV%5(DFJ+6Q~LqdzZxbsFE`
z{msBXVnEKH=G;H5g}Ywn?zeJZj=-FK=ZIjq8eibt0MSjs*Va42vEe&hug~$ZXYE@`
zu2p;IxXwxa^*)FdfUtv4rr=Wmug&3=38>5GBnaIHtsre1S!XX%TjtGo;9km?E>2r6
z0^lDPXgPOG$3R`;R`{zJauwlS6yg%@osqo_t5nd+fr;|gdtsiy;;FPZ%jPGg<5PW;
zyRSXVpJDH1U%zDQCt*GC8)x_Cnfpf*(m}-BJq~wnVe7lM!NK8M@v~OU=V#@!HSOvJ
z?<WHUx2?Pez;lNS%>RAPgSoba{@L(`sLljX_hwbk>=p4p`;h|ji)d_HZv*<-;CBFQ
z@d*RC{f*mx!21jDUtt5oy}z5y4D4%riMYC6^pUo(as`k2;(h!Xeu~~}Df2@*VLj07
ze!SEJ2oryTex9a5p&miBh-PN}>A*y;tVB1jD~6%?(_17$D9T%01s0j#W;%V`0UjR|
z=`}PDUlo(l8uvn&8w(|9SIws&XN@<8GGCct_Tg65v3?2^cju^^)nU$uT)xI{p+>IV
zLr`L}83nw4von4h{Wp2qM7&4kPFdTYyA^)JT@RP>cNG`(x_Ah=>uQ_j2WmoIG+)DL
zl~4UlZ59zUt9;ftv3N7l;aE8Yhf}bw=kI1Hhm&ix<vx6%1wV>(5&^Z}I3J@Qmbu4H
za&D{gKGHtEd`73%QTxzV`gh%Eo?Du`2Z6;s+_f0}APbCCQROnS7E|7r*s3k(%rSD?
z>;!`kS2o(*<Nm*K1_Y+6hcXf<=uk18&@U_060u}kabnzs4!YfF?~Yq=uL#xL%Ee%P
zde8O#aY4K|LWQRVeF!hIQz0Qf((DG6d$-});O)L|SE*6X(1{zKO$t*Rn8Wn`IoCw;
zA@r`e0q0A=6NdTB3?5_;0{s~w(C<Bhm;fS!%`tP+<&%)BKX?>8`xAG(Kd1Wh4kcSX
z93cYMH{ph8_c#O9pH@5ZUT!I|_JhQx8QAifnZ!?|H16av;&OQyYfR`$6HYB^0fTg!
z2XYl@b^Yw_I|`b8)Rc?e{My_|wy!&z*Ex)_Z(^Myl~1VZIXLSpig1f#dZM=qcX4$D
zJ-CzI(U}b_j>eb1anE0xA?8J|eWR{&IdfZOZcllP*)=qlEJn<~Ls~Nzx1s)`jb<DW
zm>|eGmhohWAZC(ghbZJk6+0!Uuz^2Fcf))HBKtjvJ12l|zb*?Ga4D|J312qvs$N?V
z$Fa_*2r8Lg(}^gj`4Czx2mpwYD3|8CKBV^>A?Eo%tW6SaEQ}HtR(l5O!Wv7liTa+1
z;Wq?wGHl#fslJ?4!=6PSBUN1<B2r2<zCaY^MpOtLo=#7gqPT`LZ}6%#1_~t_{6A4L
zrqG8$AgWf=hip3GbLr+G7uwA7rPT*F(5tNb>sW{f<@qHiRHfo2t3iYBvMH~R7<;=+
zoR;xECZQG!?^<mt%ghoQ#?2^^(AS9_tl=6K=W97&LC(emG(ygLLR;5FV*^6h(6UPU
z-!*YlooZsrCy0|}FeZldgXDvHo>>^4)d-p+u-$q})kOTzM0Tpt0y{QSA+J&0;Yohg
zJ$t-(oa{eFU9uS-n8L}7?`fZDS}QnN))aBgI!8-N_g1VL#AWQAUR%(hECgE$6&heb
z<64Ik`fOAhT=WcD`YwLy{GIThUYC|XwHo$A@(~qvb^S92)Kfl2t}sE2kTC9mP$lg2
zL0+3$K}5O9c2^v?xt2{g1VR%5<gO*t*c%zhyD2bg+>rtXR%Od0-(98s>uRXzCz_LB
zd`iY296EWw;=wX*ztx^MizbV}1Ol6))oHg!Eq6tg-|*#1V+g6P1|?OOYJ8X0cixzu
zFy`U*SZ`P+gSqPhLa5!xkwB92qz|(rM1Er7v$(XctH|G-N$4dAS>5b+|0<o5h`tWR
z2QLY9{R_#}rUiJ$t(_bCiqzGTv>msqwDia5SLnT2iP#o<kbKu5_1>7!l&&B!U(diT
z9XoHbYl3I8!cg@mlOIkYFO^VvRyX9V`7l2*J*81Zra*Uc4^nX}Y_ZKja;<TbhiVa}
z0x|SxAcDQcrQ7!H)O(~hc(dgA-_iP<N(l+BY0=r6a9-Oa?v#l?DAU+)g|IZ7ti}c4
zJePV!-d!^$5h=YioY2Cdz}hw&bcB8pu;D8@{CJ7=6rXdG;BQ;X1iP`j&yb2wDlW2c
z2HrKbRgJg-(w*wS$rQ6BP8_0T*WT?12$TyBZJ+Qq_WLJFbo(-XUe3EcH#!=?NHT?J
zp$F7FPL?_zN~uiv@@nd)ldoIo5BPh~Uqw=D1^9k;iQWy0er36L+e-aFU0+iW)u)Ec
zSN`zUo4?njz7loLPW$pDnxxEmx<D9v2MouvB3!>&>Ar$2-}f_fwuY9)Fe)#u={{~$
zDwHnUKgl+XTyPE|=y(H*xhQqgic!{$JS$r@pFxs)M6)HE(02bV=inFbqm1nv6A6e0
z-@jMP2B6FV9xV<Q?9xxOgwrFt!DwCslHz2U%qf&z=hXGX4tfhc?5VH1ogkBsm#_f6
z?9P)EA(*O$yi=y*fpG$qa#lyT6#0^yO+u<l8ThGZ%K$wNe>W<?*I(9WVICv|;K829
zo~SMvy*3mm)>3+cQd0S&-b%R_Xfvt9lLC4H<7>-X>G^UV2zgfd{ui~gHNVq^n+nY-
z?_G35iomXG1DHEmIC0lz(s{=Z#@Z#Pir;Li`nCKbPS?l*K~d21jIdzD3;`VBh|}TM
zTqn6Af@v&kA1HmhAj@{<0_kB|`%cbCV>J~Sp0cld*3kx;Dgf;M^F>Bu(tO74^Vs3C
z2xX&FPInj>%>M;mK%u|zT`nC)2(D1$z}eH*7MROz8;P8Ji-J+9!mN_LX3N;d%Ud=>
z5^~fX9%lVT$WUlalw5l4K|%UXGuQm_b9}pY@JD-Ed+W*{SqtXBDq@$(n)gblQ>KRu
z*PrjrIMvv2tA_&sWqcdX+6B!;!v%l@SL1ibUtKLfW;nj}iT?rrrXp`QpMQo(G1~{<
z=p*`BsS8qc!Pn9d4`s>r7$q4VK1w-7+ZXCYu{mqPbw_({Z^#IFgg9xHh6_OjgzZDs
zk$jbpVq$oM9^r|BE5Gc&Qtvk0>21%})69=T=q!wHhfsHZWervUyx?P}v)Cfo&i`^p
zFwZ9Fl0f9`@9`0nEtvko0g33%d|{B|)v~ed#wO-oQJRJ9BsRuuz?r8p$8PSK#9#q%
zE6G1m1`^=e5J?W#E+h4lr;(8aY?TQx@HiRfdwStx=xxX#8ZUE6RgNs}C1PU`eKA>T
zNs(!|T|e6oq9qYSwr|3mIAJqg;&o@fbZ0o(oF{*{6c#vR4D=bOpP)hnwN|a>ctQVU
z{p|W4edZ@Vh7Oyw*VxI_Ug|2q`o$qWw!ur=`?_HPeIkq8h{7iTFSW?Y<KhQO7IAod
z+Ra>VF|&&}Ulb*_W3!$_g#_C}k6WpwD8+3tFU0se<%p>mg=)y0NrAl1gQ-OOVCe^1
zIHb7`%9qiFkOFJ#1(q-6U603*2^DBhtMqNrf_;U#$(y~Hp_rx6uAPN^f(<fpC=ybp
zVcPp&ZPvaI^iW}|C5}oLfK<QtY)qhs1X7lM`c6K<!O?cB$~Vh*q#x_b7Xe9Qx>-Sj
za^$k0bI-4wRB-gub@IADsfkn+&ME{s)0kLiIgFZ}(-Wh_-Un%ia*AE&6tmWIIjrwU
zh0pvoZ<}1D@C)YPh)y@XG=|YKOQETE=?AqMgvfy;L$%~CLTUQaC0k9L^VmIOWx$Q4
zNuH8vNPf5mm1dptHwB)!DtHF<w3#CVmx7F^pL*B5n8$j~K>xOyIU?kOnA<tM2-Sxx
z#8GKTEvc_ZmoFdACKW<Dr%`1;(9|{vL+Y!Ej-txVuenj>ZM~*sb{Z7Z@$^u)Kjqkr
zI%Xl);P30vOf8yqHEMRB)9AVcPOYY~IGQ*nL(41X;vm7(ridce?&b`Qrz2K0C=>fC
zNH?r5o*BQ(Fkk6%JP5!!HdU<3GlE|<%h$?<Z0YrVip22PI8|I-`nL0xGx3V;Gi4yA
zi-XwfiEA=eSKsA@qy8#1eOjwf$?c%)^%*Dw%Uskq-g^cKo=if5G{zU#0-jkXP`~l$
zlw^k$*AZ#W+$qf3RrRwaCDVlAP1WdB2DPG~QwI!2Gpao%vR_L;Mm_J|1M@&nN+W~S
zXupqlu}28$x=F3LPvv05m+&ig5s#@hcsQto%eL#;h;Cg-vph0h{ONoL#FWJdJZsN+
zvNwqEcRbtD2zsL48b$%<VPBxqD(>w;;xqf@i3p@ASsrAp_j^sz(n;@;mscN7N~BiJ
z3?koK-KlzU2FZryVEY}s(Rr#DSd<}|!9vr+B<B#n;+nsF+PPboH6))bGl08eOBqc&
zw%}5}<12L%X6KP_6@R{LaAko$iEgx}y(;m-R%3kYCTvi-!8?*D<J#LC%ulLL$!Elk
zMIHIz;9W^)+khYKF|cpfb)!=pqu8S^ZcMB$Zf4(c=v8NuGpm=yU(2ObR0XrTbFzqa
z8vO?IV`~L!17TqCBa2;r*jn#=E}8#|Y0}A|B()Av(9hDX88zJ&N;uioqFvNsH@W<Z
zHiW>R)6DaFMCYP&j@V@`DQG5FM~+LuUGOOFDo>kkV#=^giYSgLF{vW3CM!6`CSi-#
zSP2aQ**JZ10<oqf)#Jy-3gQtfXWYP^#ve<hRq@S;!byAf9coVT;RI!011IS^!yB{i
z8wxI1Vg=r4;L{)*w_NjYxxvWS*ohusd6m_LNYS#&3<`{X!(LQ#hWc32pY%?XrsXUf
zO(0wFlQW^?+?IQ=o4uk0TcU0cfNO*x7123<w#WHbL9obH%(xGmga$(=QJyMWcK``+
z07`>>1c{?eK1FF^Ff`eo_I$E|5}xE6a6oOF#lcCLOMwSc=NTC7N7ubLw_+A8n^Li+
z-!fUn=^m@)-_hH%+kI6GhouFWAR9{2OFlY)xF?%}l!Kqr+b*8`g0DceXHg(k)qF(q
zm?0!SKP+cN7^DHmb_<}mocxAv^LE%kEnLy2RF7%<eSn6`i?<mUKuJ|kreu0tfP@bw
zmdFUEWCB+Y0w*R+lq)D<d3A!80P!v}UKlB>JEUnqQr0fwE83<jwhQ)qucZ{k9p*0K
zh4GoHs@$=6sg(=%Jp$AzRTP4|3+dGtz)y5m6I;?g8KzDBO(I`6<t!jXHDsw%1Ycp>
z5>8-%9*z*an88`n?}-dIwQEW_dN0i?#K^q8+cx>nCmFD^Ey(h`&R|pCn~y2I%tWoT
zSow3Trequr74~nE%ao*`SM1VQDY;I(nIhHI(R%iOx@l-?*6V4AHAV`Wnx(QE=_iwI
zKaEk5eT5$w`ABMV-xwpX7g0NU5g5NA-|Uh5wl>&ki2{*w{!J<BB8`NNNHABLV5kP(
zGjZ$jQ1y><(ZmY8EQEBk^7<eqtTeGei|Fuudyo!fy%Oz39GnY8QxV0Y>Fl_pp0C}a
zDTkjulm~I8={FiV`<&;%wHmVR`lsCMN!6~wBj2R2a8gyDPlZOE%=V0tg6C`wRo+3H
zW;LB;Y&zXNAXo6ZdoNMCT%;^tCc7hA`CB-5GjRRz4j_A8Hk!_QAiV25daK1)0om@B
zL$_ngFME;Gt`gR>NLy(FR0-ZEmey{6aUO@m5iWP%TkBzx;g4KD@9_!A4$F|$H>8Tw
zI`)|Bgdjl~_t`YYTN@IO^`;6^*4$`r<PgHE)ID4iX>-7mPq@Qjn&b$*CAQt1l@(q3
z6l^sX^8Bt@o%t~1`q_gfsNaDZgJwiyvrDpdc;4Roi4>0~5$7wi-t~+`T}7|MeuHsi
zm5e)=iA=_uyM}qT!bem$mJd@%FKe;G8)t}XoKZDw6^@Z6kCMXvPH+r6R;AW_Hk8B<
z#l4V5qNhstrgO%>T4WS%1h~rJ@;&<xTVb~3T%1qEiaD&r-mmJR+q#zrbuDjoUwof9
zJ^F>A=YqCREO~vy9~Zk|N%BU$0D2jaDCUNae8^P#i4lu#<C|G&{=hezjWIrhsUr7R
zc#T~=K7|DQQ1l*6g%UGe$}Lapfy73Y5Q7aUuNXq-{*XLx7&+RM*ETyeF2$l!xlW4)
ze?J?NPRe*6$qh`cv93>^t$MKx-=E9%`A1K8d&cs6Gub*W8ten-ft`f?kf!c;qEG~W
zFy%+2*fUF!d-dsk#tYnpCoI|C6OX25XSo=KKT)C$sz#&HOn<cxOJ(PEc@q49Ju)L9
zM9%fuvAs|<3&q9ow;Qb99T0uYi{AF{4fI0YIn`-|eUrBB7~%TyGpi&0Ti>@;_9FTv
zK9@1cgBUTw&AYtEq)tqV6VyNR9-&VaOoaia^~F?OrYT=fmOBPqOGUnU47K(d8$LzR
zCt%M!s|~IfE1O$|F)X&VuY_iU$Pr@ai?k5hd?qff53EPbwmyDxub0l5NE7VF)P3+?
zZZ0h!hkBrIgZgQG^U5ir%Wl;5iL+QXedKG#>_xiqk8x*3AgDI;v)1ut0P<}?Lc%zY
z@DW{K{$-l1<ELz>Z^ad2JmmYnlHuxtEbMO2O1=G8_paN8L67hF<aDnRtnx}SC!jZ8
z$DSV<Fy{+(rH+bH(0(!>tdn()cazi0FKY0-?Of0!se&ikgFUrdL?NdBH7~X&kIYcE
z6WP(y3XidXA#|OhoV!iQ?NO^ips9x*MX`uishIl8Ia+kGE0O^*Msss?+kGD>jcchb
zqd3FJu#4l0T`u#Izh=zRT;g2c4Kr{9Y4f2Mwfz2GpQPL;RI<cP6q(}|h>@Q0Wlw2N
zRM?JAP{+n}OQ|hV_;vQ{z-z!daP3%IQhwSm_1iaHRR4)0376=fxP6*G#eVJ~S>ZiH
zea=frQuP;rjV7OLQ@EL=7>(D=X?iPt`(U_B@O*1Ll?Y8t0F5M&hS2GEpbn5U?0JtO
z>psQ(s@D5F{+T9AjpL`efEPvcM^cVUQjKB$Qaf|><3*}wH~IKCEW(4iDz7J*#4g$^
z!Cm-XM%68FZNhXLr(b?F7zNp9-9vMM+R+SlbH}9x&={4ei)k=zOQH>Hl+}L7UC2(2
zT#b`<ifHm5i_S@(;_fQHBE8Yj{jtniBUnz?YO|&@0~h?A)2c;UvdJcHk$J986N=7Q
z19pOmB+Sv%|CtdfQeU}Q3VU1v@~Y|<Ne?Mj9TwQ&(=~N-#?ki65V3L2?fB(IZ=K6D
z4p%zBB*W`RYzVYgwqFd5ZbCzUM5v4?s@4n|w;YloX<F#+(v9#F|A4m1Bh-NKbRi$T
z9IHRhWP>5O?;JM#DTmgAPv7}~`<8U374-0Ye%Q6@YVjbQ)Tc;Z)b~$X1(^??bd_h;
zn9)Pn&QttrmUa{cEmcd{kv4Cf`;iJV+gw2?Of8}bhzig$JaL=k6@F^t5l}m&58D9!
z3m;d%u=oCXJ&M!y8ko@q{6SWw(++J#U1A)kaWiKcNbEgA`0+Cab(T$YiBIyGhD&ug
zBo#y#I2K0>ctKD1sD5xmZtZq#6MY$CyDl%$*p;0Vl`r_i@*Z7`3Z#CJ2p9EXW69bp
zpFU+GetybO3#~U;S`pOxq03JM^L}Ab#Dd|5YOMz0Sh;mcT!V`*{4V529b{~2HhK3<
zPiCF<p5}hr@|LlAiB2y(+#+o)Jtg3SCtUg69vyb{hs4b=V=QGdmx^vZp8~;xaB5ta
zQ~@zdISE2jmdId#L?$}`B)5;@ko^Vf@N;yg0w)3eNU#DE{_L_&fyTCK%t)nJsSHg>
z4^Ge018&{;uVJZE_PKFcRh}QXRV2rHTRH<wwbBC^QcCf&M(IDrqc*-!Vn7(3vr`GG
zwd`yJ>_FQXuaj)<4<A(r=Jiu7^!r*CI(bfn5<}QN*dCCA;Q3q<N3?t$eTMwGHH<EW
zR82OIae|{7Gy!dDnoep3%IXG1(YGp~{AV2%?owvUzV!+MQL^3H)IBj{f=b+71*FO)
zi6#Lmx255kuvQk>9Sw$NogXL$&6v3Wltbiqqq5=@=98?5qyaMbNKyhHOG$pF!6>Kx
zl5WH9yxOt^-QC;tO3ryhN;JuGs5x$IBMt{`F%G}AF~E_aMnP!o{Q_b8#qZ_i61ZRQ
zwi*&e!O0XuQ5m^TQWd#TIwKxya*`?EniwpxN1XD3l1SF>^y}G4!}RdP4eI1VH(Ux~
zjOM1OU2{H@slD0<RbHJAVmPsWj}J|sq4ewMhrfSsC}dBqKEbT)+m+A*^1)0T5N7GO
zzFbkx>oib%qSL-_3Ksnk-?j+xR=(-lyIoY_t0Na<M^+B?lFt-CVffn@l-ry8*piX0
zWpQz*GuK$*!xm#c3gjr1WX-Xxj^UIBY(w|YGqdPe6K3n|J%k!s0#Hqm{{5bzDHBC#
zDCzM=^l=A1?3^VQw>SNYoRsJ6i_$f4Wrv=EbEX@`Ydmys%gao<=aE@+u;j)sPv`VQ
zTJ5b`K36SswV$pT?j5_G1ZWGP47O1(5ys`cU~SZLXlJ})&*(wLY<fuT@LBBhc&$Ey
zzuBJddMBW*BG(K1XZJJ#zkm4NQ?W}uv*dX8&;b0->HBT>_&zL;KyP9)2mJu%@OG{!
z=DTekH~mbmwM2*Zs~s<!*)(dGOvQjfbv)jx8oCxBME7BKLx+YippHj`XGuY&6_5k)
z3>m57j@)*)bhR(^)WDf%2o_Ij8<ZV$H=mx#Y|X#GF<mRs4<*izi5tOB1SXMss(h${
zz6jSvfqtMaEVmE%#Bq>%ON=!+)f{V8NFY;F5S8?91FJl;18YdK3#~&Ei^zqJq!kCp
ze>c7HknF+10A;W=(#aU=V4XY!h?!0=HC9|-V`QkO(`NV%KfyIpyqob@P7S4YRR4%g
zZf!Y9jfOA{q?ujM8ES^nW{NPr9($zy{ze)>(Ejo^&|0=p0NFu<D~+7$LDpng!d@?=
zo_w-ojNDs2p&?wnWH!sOAmW)m39Hzy8+kT<NB9F>`JtK9kfI;9H_CAD3AgZ?yCFGc
z6|IhV+w#SQSQ)k7yjc;F(k}+yM&_?9znWd%U0arK(jDuU`O!a`h`d@E2<U8~#9m_N
z`9>Ji>qFRc@N0Old-}pGcWl4LTpRHE%O7g=jeEYd72jH>UzELKh&=vOi&-v#@4=XG
z%Fe_NW8ehfOmqjYlabx3rdDsq)k%ns_;x+=OTmjKC{G;+mfVq|T{^MHt%tq@`qqA=
z7GH{IrMgP7f<Vf4A&>_|E9&6ZjgUH+018omoY0}Ud!%%qbFkOm$aZw(>Qx6!4@hWi
z!zX%;O?)t7*IVJa-8TB6+`svuvpJH3-ug3_b%vrGbkWP;4}6jn4Q(R*5uIV4J+?0g
zX?qG2Vsr1r^2m+i!j-*A3LP>B5hhsgUswbZah^o1UwR;QBxJuq#~cuzQ`N(7a|$-@
zwg|W?5*3P=YbcOGb|%5X{344`V5PLFIpu_yxD|?m&3scsTOO2vEZv%02zT3&qFu>Z
zvLCi9CdPC{sz{^iK|PeS6xxYIC$sW~mihpNr0N6g3*Wrfi&$}@xJQ}1(cA!aa&SyO
zmt%?*0#RjoERnau7Xbd3PpbwTVUVKSSo?2Q1|dUmJJq9b_t*oQ8*8B4KKXr2r%f_+
z&lecp=uu!4GdS=yE*Bd{V8Y%Q9H$msP~tq4?N#O9!7t%5;+9iO|D;GI(|#}QZHP&P
z?Gi@IIH;l=N>^y=;jo%IeR@su2>}a(859`SMd~Dqo))DF-C|m=Oj){$_{D4i<&|DN
za=o=gp8tn<3%tHWWY)x+oA>ieS`nWjXEa_>T>^Fs83%di8qrJ<+iA?VYHt}Y!VW*9
zgxkzf1uh&QNQB}pDqW^w9+0=KS&#!r^x5OtuAs;`v>6eNoCPmV$xx842g3AFAdV{3
z3qXX=QhSZ<;>{CGL#7z2mGlp)$~dBL@<L^NT6joe>Y18KEUfUEXntbNGGSK)Q`((B
zq~}ouSoTh;!Y-4YCt$b5IV4uoDe%}qszqt@V)7}KAIMC}$PU~?vRIWQdJ;!sO9C1v
z!u%ea5hD2AJxJ(KvT@yVlB?{d(4)@>y8CM-guG~yZVh#zWwI-o=PoQKnTg@!BZU=c
ztT(vZse@yR1n+{sO}<ANR5}}gnr4C;`}|I=_q#KHnGxE+p;skE)O&VViijTsO%P{^
zUfbSDGS8mI3z&k0IcMACu)4gSaKrmLDWq8nt<TRF9cGb?gyCL0pprr+j=&L&XcC#(
zaijZg!&TeU44&_I&AL=6cYN*BsY{tN%TN025X=-8va~jBSzZ%VlG(Q~E?cR}7onI<
z@>caK<`R>{)sqU>PgEhi0^X}`1m?s#p;ko80-bqz-<G8?f1Kx=2$rY|yQ}YqGbg#Z
z>gEhZ*3{GpMUOw~bh2SNssgGnMrg77^4W?_&Upmw;)dPkzWDRG&A%~gi88f)=PBND
z*h+q{+qrigAl7A6e*H-r+GX9T^>b5XDq|cEO<*r~c(2X(PaXC{43{f$!$**xEZJhF
zM2TDMg0U|re712h7F^olu5NyWrtSS`CM_uXxJw`3<_E&RlTxynnQca(R}sQ$0J5<a
zslQZTBBFAA&ZK?q7}a}N6(i2tAQw?=TYke<^s{R&!FDh5F?VB%BboSi;mJll8+&Aq
z3V1emy2MkQy%kWEk@)N(md4P}RZ~aliLW_@s5zS@%kUDve88+H_A$95YCpJf`K7=X
z>WlzAS?F3*bYJnk8CyWq491Edh_&gwKgT+bbgQFS5PkF!wD**|)L->6F*5%LQP3Dd
z4Cst|8X0!i%Ebyz7b6zHOo$@EFCLNdnAKW5a-Ke9xq`N{vsi_}Q0D_|gN5<Wy4t(C
z(>79LZ>>{epq%0NLm*flVRcQ{_exxOM+D~=X#JdoLPz-Hkt8^;AGrMJcD_bj7imu<
zB{DngnAFLOD2T1_-SXXWP|(x>+Fj6EV9PlPS4sUN4+pL?H<jF)oi?ffA8dD`#&Xqn
zLBH~#4f1MSok?_q;@H_`74Sa`b7^`?<i&kUL%t?HZQlqbTkF=d0BLvT&UmNf4Wk;J
z8@JGz4t~QsPNMl2k-5T@L5+EF1#=V}Q)^^K>W~`?IBnVqUP#&~K9*Pdrz;`I63vxS
zYa0Se_$o~?9Bk)EeL9WPEciN*@1gcU8F9hn-aYBEeXJy3@rnkx$pXlh6-+Ro+7<Xd
z77olY_kN8AmV2Pz%}KV(;A>{*iV!YpevHF0EW+>I4Ug$5@l<6+4S=&0VXT0jRK3-a
zOGf?$k^AUis7IscDNHi#^FG|rw;_@Hdg~pgT^)mKxxf%_6i1+$ogrW01`DAYE+@(C
zWFrnwzBly*DkU=GITEyOHq6ptsXye@2p4_qmATklQ^DD;-38{{s&7ZC=-1c@y!NnX
z{)m1^FWis|^{q@TH_xV?0zf?sCdig>T{GRZUZlqAJMu~47@lqe`#@0{&i+nR*!oKr
zYj-$)Smki=g_R}542d<cyX!SBm#h{o#FI@NB{$ew(38tK5w|q6g-lIw2I5RTB;B<o
z{57|xaAfs5`a8dOvs#P&Y)9mM-eSE+!l_dl>rtU}Ere;RtUr2ucvOPiE&k`enP=Mg
z6V;VKT0gpHd9fYEx0LVD+1u;}vZ1AIST#Wsmg;`77$_NNbxek~J3P#Cvp86-qJZiW
zfzQ{&J~ip>K^3(PIr&+G_?f-1A?^eEL73_!4t0JZy-bTCIzL-8TE-BzImUo>+PXjD
z!2hY-*(y69q(^-<Ajq{B78y4WB0N4MEcoH_vs_c-q!+eOSzfMlHQ?KjIuvJZhs|(R
z8!R?T27lK3c8|FaCRaI2(87t;qJ;@3v~;^1ypB}6>r9(<6QW^<Fj`z&^6&1*o=7V9
z&qaK3W6O#!j^sqTi4Qj2L^)J43}{Ev3A9<Tg7=s|vs>v~ow7bA8^d(y`5*NhhxcYD
zS5LObXM5nf$Q<sCNIo8Gu!g@%x)M4xLwI(zk>gttLNV42f{@{6%N&AY?AhtcQZdme
z$5E&rHluQ@YrEEmtjFKTGF-tuvgS}r!P`1m;bbgXM(05gb15QTQ$)5WUEbGKuA7!e
ze9>Wy)3<;%LqxhMTK>*(0s;I?C;<9=FT>f)yoosxjtc=Qgl|BW;AifyB$MB;4PXvi
z!`K8~A!X@U!?$VTz0FIPa2gu66EMYd0}RrC7c}rA7R1fy%%T`lDqDJsFB{%QAv;1#
z@wgw1(W9(ldcMZq%@d*Yj*7Q7%mOwT1qo!LfAEvc$h8#tBb<)vBvdJ!2WQc8FssL&
zA=N(4TWfWx*sXO{SMJzw$6jqJOvR_;z~zsYkF5&`saNu`Q*%Om4QNbG{a-#FF5fYI
zsYg0nTnu(FO0SlKDuVO-oYT=^jvepV`@WM%w)#dcae)k5Ny8K-D=z$Uc7!7cA)qUR
z=H)vm;wI=|)BeaE0-efhS?KL>MimjunZ^&EFS3oAS=!y3F6Y!==_AMiG;HxWj^m%C
zzU;jB{@FpBCd1xl71S;yTKilmeJXV3Ux<*easNet2zGW<7vFqfg?l?=n>Lw{6!U$y
z*Z?^ux{3Fv%FI2Rf%MH%<I~|y2lMmABgq;;>e{iCF^3OE@B%YI*dsR!Zx!)b7o+mX
z`k?AeK0?2ak7n7+({{sm^6>kW<Ae$=#O*1rcf^HUX91V6h$47mvvM#m(x&oZS5Zf0
z(;@5jB~x91o}*YHu=J3y5umYS<biO4Web)S#GZ-g11*zhYb8XF*<2i_pQYv#Ex`H8
z_Y)wL)wc(u*5|gFRaqc=Wr7W;yT?zv)hdD6wOE&H4x9nC1E!ZUI)rUEBDS&Gs9sBj
z9!~=1^=O1$&WsyOhSXi+Pd_)O-{%$Znvr!{njmvjc*23G-^?*N=}GecIQx8==so#C
zxVGm-NgEn>+$16KLCb?)tgy^hXua?LzFH6EOr=bA?UPj`-xjP?WJ&A2nnh4ZtIfRu
z>^{+j9$ug^w(qZgyV`VQKPD$wf9<sDm9p^D@F2)KlygV2_Ezj4Kty`qh{I1GexZR@
z;q}#hNIC%&@#Y}z6-phO_xcQVW6h7fgt9bJt@NW(ZXX>ZT!+ubY(iw@%a6G~?1#wm
z;E2#d&QBaLPj0RTqH)BLH9_4KU(3N0(K66i)x)?(W}R2C3C$IdsJKFra=pF@F*}iW
z-I2**hqb!H-R8mF?-}t}zftdbJ5fs)^IliQay$8ooV(z43>3Z>nYi<4W8<cN9YU+u
z$U@K6(5nUFq)~VyKTTM{eoGN!e5ySYgp3<)$klT<;vLM+7BAS+RGMi+QK~6rK5YBy
z@eF+zH8gbd4Jy8Ud09a>v#i_H<X!iO+^!&nLD@%N-5Qb)q)P603&~G1n6fMopdCT1
z`wpKxDZ^Z9cuE)2+V2%`K2bui&z6gY@=;5NNro+{VRRCvZRD&<hKKg`&Gm+7IJ-lb
z=eWCwJz`?YyqBc@YPRWc^`ANK9|{AX;S$5fC;i$Tv~dre@Ifr2)0h4hHQ_2mFj561
zuV33O6thuNIA+7N8YihgcDv;uUZR-=*|uBNk=sM1=7?|0duk|ijUZ$4#7{MljAzMG
z=w+X8`v9n}*l`Zh#Zt-NjK{vrBiJKW%ARx&FnT_(B*HuTHGUzWhpBx4TD+;0Qt<S*
z(2nw(AK?1JEivFCOSMf&KD*K9;%9Oom}ZU)L!?hl+1NenokABVMfGHMX54^W|C6o2
zqp#XMR_?M{S=kOsxA)n5BDtDG@Fdn3eGMrn9oa4abvZ%Zjm<lz*WSY>Z3~dOJJA^k
zwWdtIO?nE~(~x_5AwDsGo4uGzLskA0V7Y=ad-~{~TSodh;zi0mA!HeiqbtE6lF76V
z2bodexYxb6kK^hb7fKE8Ert_+Gz4|YX0hziTSE<b{ndNLIonHBZjxF}?-DG$UNfQ<
ziZhy#mIYUTO>q(Bav4jfH9D7WFV9dI0&+5#=Br{YONz`7y?Sw2ijZHhaIU()IoeN`
zV#c%*21Ag2{uNf_K4HF&W<zjmeR1p!<&>9S&&()mcfrJ(EMz>h3BiT!zirsXi{e{m
zzDz~JqugZSBsMxz5`^Em7Q92CCU3$=S6h((frlM6LipUKri--4SS<5%qJ9sLR#fGk
z7dkeARBMAm#wgw4XH;aWCXYiAuE-;lqI4dU)+@-Q#m)DA)B~q|nVSA}RwoT@K0S%1
zI=5tU+C%zJRFG~x>0foO9lB{iuexs|+bgCiu;?b6-Z7Pi7`sHf;Uk3x)#uCkeo@wl
z4~`(<>!?jn%fSwTXy4C6-8l}cZ%cM<raT^!s(^6}&L_<N(bCGzTBN=76q?m+roBBd
zf0!Ny`?Y3#34*}hu$O;Q7X##qpSZD0DKp`C^21G21ZHW#Qe*3+Y+Y(9Chn0yr^^rO
z`C(D}D*X!y_hC|&(u5}ZBbkWNeI<*Zh5;9b3lm8VCp#O=&Zf!>f>QPmeF0dlRFps#
z48H?k(}x`OEwL1?EytFuN7vas8djlCLtJYnqf$qJ4$oDAfrbFsg7y+gb=AhkC)!ib
ztSB`y)lfz!wM(7Q76e%Tk8c{M`hQ?^cR_XI;kuZg;~R)4Y_=@~`Z_T+#s!fV#OV&r
zf8)ZgYc{k>R?KL0V^_Hob8t+-$%q?$mQX!(J7=t~A|dirQ?4I60Aa2Th#^om-tg|A
z+V`X4vk=qcCxe7KO6OpGWS1j_&hCf~=dY$AqN<HP`d$|F&i;5IxM7@A5Qye1uQ8m$
zH#sgjvHa0umGj)1d?~S1(rR24EjV<bV6|koKDGeuJSge$to-Y#P!GOaz=aT!-P&`N
zr!*dIx!2T`*GZR$ViNj-0u@_CKhc!zp5&1KU69)3@nDJdkn4;i&i2Gz2#U)D6<YvS
zGY=N$5}{{Udf7CtP|q}K)FC>CG$4emNXXB?)7tx~VVf#Z-mNXtpA~1}JtnN2@|@5c
z?ZY`9)2wf~(hbhD61$`JtA`rRE=W7ov0}5Dwi6IM{3M|a^BuEm`IQ3D-FNqil6>!J
zNHzDl80Dl<4yiC91PSCQ-s~bt&#?1KysopKyu+V6QwzUg9`qq_m?wgTrj>*`i1W8j
zb6eK+Rj#u85(k5{oe&!s{%V*BN2KnTGS=j{w_Nq}-JmkP`i|Dek~rJ%L8kpyvX8+s
zJ;hXww<6i2YCY~v@}X<k)+Fe%YtJ7%A5?1wJxcoZZ_MusyK@iWGYsf0m*NRdMW?(R
ziQy5PF=)l7pk?g)BLl8j7>8w*Zn(Zao2X2)Hm|pP;5W<WFL%?uWX{f*kC5`z4tGww
zEQN8}%CG9wOI2JB1Rxrc*ysq14o#sNqIkV|5?6Z%3OqV1IFKc_qKIhmK%)sC?R9Nn
zMAjUbZ9I$94=8#h)+q@PgS}3jKfdO)m3TXSpfZh*V6h>*oM=?~jfR(i<0D-X{3D+j
znv}Z7G3tnlXq{B|r#Bs4ADu$R!ZULe2L<Bp=mDd~vM72qABNB0nwZ$z4<%t<!GKb;
zTR!nF-wejJVQ72iTxc!0!ntl+Gei6&(XwT`%9jeN>dYSr0S*&v<D(LQP*8gUJx^@r
z`og3<*V7lX$Z<|Adm{)n;~U2lUs)_Ud3x)fy5Y<V;8&KMwjvD)UA%x>9qwW8zg}k0
zC`e%7C8Jn*nZoRoTA<$g_&I)oy|$tc8kIf%)g0N%YTreJ0~5vx4{_D$Ewu=P$}=1X
zBe#wipq*b<O{sfpqpd+h%{csBsJ?2*=t!4R=WFgO46<yGiO|;UQ#O6dO$dV?W7}th
zK7bd=At3jwYi^gO8uzY=&^e70{1GGJxc9p_)F<~7bfx06&Vr86E@H3w^yqD})Dn5e
zajG)p9^4|cLhN%fY)FxW+8zf&0i&y0{zJ`X&*qpm+uahR>l(cj8@x$n<7p4Pa4+R5
zh|PLpM`Lr{0}Mt4y>m4h>irKDMT3K?;?@ihx!$-~ovX7T*=k!{{wy|sVODx&1h31Y
zeLm6m&KkH(oG^CKD+cEH-=g})zACN;#WzUiK_lYJ!ZT)Dd31I(1&*@nT`eq1COCf6
zAR&F|OolnGg8P^tl)F@K<+Vd*)^#o1FrB%K+?qsup@H$K-sZHOx|K?cc-+t;{vF{1
zhJRTeZ~D^H1wuUSgg^P109_5vG}_3NI&IfR<Iv_@;T^@bvQOE$pIKh5g^Q88;t^gd
z`}<W}7RG%UM;Sm<xt?wD(g&l?;uOKAVe!_Se8<k%>&;xN5B6x~n25Sxym-E&$KkoF
zis;(E&?{n^^4iIe8Zf*m783`lx4TInmYk$WC6!MV8x00KYF+AO&KFCLNw6uz<_a<E
zK5>ykib>J3)`t;B$(<_glABP|*M?R3Lrv=qy&rvB{1H~tS8<zeo~cEY+cl|e>nX09
z#u-*9(8kd3-h~V~m}y%gy8UU6yOMLh0zn(r=q4j+{%psBQm`sF?ZbhiG3<n~l9@#D
zuXZHq9;g={!TmIKq}K{U^}c71r3jWdF>P^rQ+R<>>XcN4<0ZXsU(XzrhHMqc6%Y#-
z&2`9~Ee?i0_V>5Oj&Z$S0(UR?OLF{XlGW+7=ziWtY>*z{iVmNBtW)SruYcbY?zCLN
zVK=ED5(W2xHWHPzuj%cp1kdv#Me#vpkyBcfTd@hLwcAHzMr<oOOX*!q&!#}Ji=R{o
zvN3%c(M;E`OXlW9kdtb9QLuc<t;Gexa~iMl_umc`X$TiCUrQ6L){}>$;5x%Htty`H
zcU88+!hD$y(>z}r$dyXtG9~BuS)l0d5X0>Px7KC?56Wv9gPOl70Qi6P(?jm`qFPBN
z$kkOAP%CPB;5{O^*?Jn95@TPHqY0-he$mHR^cO^2Dj$e%i>s9*={+AQU|CZ}FZ_fO
z!&}KgR4s#cL8EG<c#v@g4|@NrN5qSH60d6A#)6FR38goviYfXL=Jm_!TgQCT11)hg
z?&BIX%K%nf7L{&9CxRN5ga<nl;EHRPr-uz$u?Q#KqoQ1})si&HlZJj?(cZDPU9ff3
zg@hTX0?mqVlcC3K<s!Cv6EeMMWkhFvCVDSyTLzS`);dq>=6{*VY2rdVDQnJZR&n+D
z9`@^blss@B0e(xO-!EK~h|8iqB%fSB;_^vVH#HNc2Lng2L&oJ6gTcYVj1Fz%Y!O7r
zeV!OTQDXNfrt(6Ib25pTcg0;4q`g`p{ObUS7#pLU5RoS1k~!RGt7#znYoIaHBqz8n
zk>=XkGxx&Uoa!qbRR)vXLyuNfBCI~U(csnEPD*6r{8gmGn>5+*oyvOST;7cHo=gsO
zp<q;ki;roU;ZkEW9ON*A@r2p$A(fYppxWGvBi1e8K7+<r73Q@azE-9UMXl<wwLuf}
zP};9{Q}Y{qZF;NqDoWbAt>0H>@Lf>p8&3NT-iZQzbKxE#ddwn1-aLL39hdHpd{jW9
z$XwlU+F?0&947~q;2IrD;|GVzX08j{uJShK<kP4FUK|+Z5Jf}rPsmX2^`F-mT(9n*
zzU8NcqaA(N7I>#iBx4t`X2Ow{HtiQcy1pXdg5M4A>#wldJF^b87Q&aJO!{`7XlGq|
zd<RNSaqOqxdA{?|2bSZTn0wM-`$Uq>^YxM<#~G|1@zpy_57AG_GB|Gb@8LQ<{0%|Z
zXOxJ^R4vJLFTA~YczIm2cp1W_api7yGezil!B$4_6pZ>WY+;8kMkdWar0u5nXT)7e
ztzt`CfC9lT2wAHbC8k7d5dOHV$8`wGA8WBZiWo|U0`v>brg#+1%X?<FbRe%ycpyQR
z3(-C}1%9Et(rM1(x`I{2=W43b(!V0UEhd`PhsKsx{~QZ3fAi(tFP@RglvR@TMHUK%
zZ>Q%BO$)7~?(#gpgo-7|w;o=aP*+ANgRli!grglIKIi6lh>x}<#rpm<`9>L(C*%!R
z(8w2KS0o#OT2$|vYGE(EfXVeMR-9ajQ19ou>6<b>D_t2v50to?v#hLOpzmmsa{Zli
zSffrMd<{Dt3W@pI{D)<UI}n4LL}m5Yt&7uzJ+rkW>AB#j?pDDU2|hXm>}H~8Q*wfe
ztDxiLWE<>sS0EEY$0P|>#RL!T1`9=Mcm3nUm0@O|&67{mH_s*`2qOrKJncf5GkYyq
zXvWu1+eDhD?Whp-iM9D-wAeIcrUTi>xXOtE7v`mRxDj|&1i0_ID@YG_DiNvdjck)?
zsH)5QG`L8%%ru@-+h8PC1;ia39oSDTJtQLLvCS_^tp!PE7pp1F5r_O(h_mKDmr~&I
zxbmFFf8x~=v5)2xiV#edoP^|K4OD_REr`gOzzTQf!5=<Fi#JLcoH#`Kbn}pI2jgFq
ztHOt&<NG<Hy*BfbhvW$;2sQB;#`Hs<{@Dtt5TP^lj;B}dJudA0R?s};b>prQ?V&K)
zPNbkx=bBxi9*wF4OOnvn88yn@Z`--hB@bzKP+aH>#WBOr=Ndx3t2KcSqzY0owp4ds
zPp%Fm44dZD_lXZ19W)RF6f4G`F8jK%l8j>|@f!=Ig{yey@ToCJ@^8a7nl;|4q$*Cd
z_>Bh(=N6Y{+Nw14!$X!5Ll4k!)g1sWk*TIP((|8U6;T#7Pnh92%iav~xBbFfT{KRD
zVjg+A0iI$KW%w3pnq<O0lc*X;fw(;A^T-Hc28XH{Ydsv${21V3_wBC9WfvswzE0X2
zuWdJe{#BESg@|=Vx)8-MzxcTHmK3uBuK+TO;!+IhneQyKV45Oq#ddtUnk$Hx^<y$$
zU<^$$o>c&|qPv~({)nM>=8ydpL+bZs48YYj*-#T>9Rtf9aW>j$+Af|Y<S)D~Q7sYW
zg3hRYVP~IT`R_4utiN#p=iS_@C+$bm^Q6R~`A3GM*KftPe%zLzg{B*+A#so0#1I#h
zl*4IhVst6F)5u(IeOp&lWjr>EdsF*7y8|2LTo=|gA1aKRQ)QRhht{=F5ga|b*=$y^
zqv#+Jhnv@?NiGF!T{%J@>LX>n0Dtw|!hY>d_^u+>gT@~`Mt<;>$pUFZq_i{FJ(Y|k
zGiM9cHLLD={}ps)owGu#3(V+!bYidxY8Iz1-!-^(W)x2xvJI1EJCf)RClICP#XL`N
z#Ld;)Vaw@!ha5UMR2Q&~?6|4UJLk#Xj&8mZBUd)Oq&9JXTRZ2dYkE1tl+L=jDZo#n
z;x7*+zIxzgT3+W@zVy~PRu-xvLZY6fn8YplrfTHl9VquQsgKg0KWlX-4fg4P(LO+o
zzSMi>g5hoU(qQ3-YNi30{BO#ExZH?`HbQn0NxA)`r`jlx=yUD<rM$ejyo_=f+V8R^
zw_D!(Vg5>l&;spky=iukde<pD0*CjskC9ec)^*n>5$A-gzz=GIN_9DC`xY1P_NHb1
zrYITKSNG>TxMCfbutp6w_CstVX@mXVj@h_iXQ;){FGU5LdZbd_eA653>SxJQjp=>D
z8)fWY1=q?@!-rc4*Hii_ODa}WmHo78dF0hUIrg|!ZR~;6Lv|ckDxQOK5^LwN{2?~u
zJO<uT6dLW|3#R0)7M1hIqSG<BU&FC6Juu|<WI8ExK)D{opr$W$dY~nwxSp$1sII0Q
zH#qv`BLxUeZJx>8G&sEYhkgoE>j)0$=h+6aACfToX7AX-@zKMx?L>3m;oq8KMxR2-
zdVVs%`D|*^Rxvi{V??iUpgK2eAuy~N`Q$?oAHio0U)1SgBl;wyv-SP5$Q245`Av=D
zjeAHIi<qizI!#hboSwtHj1Y`BXh&oG;PGUPu9V~2%96xL*2*3&md?=|mC>32%0VAe
z<%Rc%+j}f&4URqiaycV0Tr|k)81C6IcOEj<HFX41bxm!z7}c84tkY`3`P2aByCX7{
z(l4r8Ra&%r&J2WfUe&tLu<+4oZx0a)&HK>077UuHb8g{)cRBqPPz^hxw~-3^E)%Qh
zqf{rBQnMJ2D71E8n&e6rC_kMMh^;Q}N4+oyMCmuUf=JoYR62|<-xf<I-;kzrK(59f
zTWQfaKmN>1Pn*;)qEdIAzH3_H*Gt?fwcrT}YI#mNuV}m{K5p5`lacHTdY=)pa&QED
z+Wr2+Ktdvl^q_e_MA#iVquxM|RWez=pg(MxXa$#_AMr=bhKS`IghDKG?;?F!?p655
zgzkMeatdnAuVTrS>h@%6hBc9eWnEfzsvR4G36M8OgREva^=Frb&rcWI_(ht(!dzHx
zVNkjb$PM7Xq!8|ABjd6QSRJsi_lwf&gabpuE98%aPR>Jdk{y!cdiB#;dK8e3utI{k
zb!{I*JWXQZ@1(Ggh5`_w_m&d58zS9YliMSWWfi)sqa@$V%>>}VU~o>x<Y!Ks^5N_H
z;hPrC8N=^fg;5LdsdJ<Gcc#=q-jBI;NQ-|tr@e9YYhOPQSm41aGg|vK<*=u;3B`(5
zw*EF~jtQ_TBZe&W*}@YrzzRrTc#{zOcB}@yV)t&)XZNY{WFsQa<l|aP28P^Td4b=A
zU1o9sYIL`DodC2-6KfCo$J+9cJsO$TWukA*1eJKk**FF1E|QQua4Vlx?xRWjSLLSg
z!auLP(Z)DkG1ty3D>%$IX#_q6f8uT%O>1^R&WX8?VZOIw@Mnf`>WkzfibrMq7@icR
z+%NQeni?JtxyO$OrS0>64S-P~V|3I-MOB@t@+&C@w`P;wRY9$_w}c(8au0`=E4p?6
z?eiiVb@oQ&vUh^sP;TWD0dHxO0Ym3I1GG<p;V!o@ZJTp;Jt2Ix&I}CXM8ZIjRt=wB
zt?(0!%w3WioCE7H4z2?mSy^~$0H?<r_M4MD_d<8Q;untWh;#nx2QxfV!E&g2tk-r9
zjr~d>)~dn<2MSdhzRl_~{hM*#k53T0t|w9+|0fR~@Zo9BQ0w~M^20d}jX;$g^kV-h
zrohw0ENqUPD-GnRJ9SD%vU=k#0NiTI?hE>dz<<^qZmt`t#MPXwbZN(8m2~oh8LDmi
zdsv6etCCCj6yWgK3t(%3)SS@<qv#I_Ld+F~y8o1hVHw-rF<Op6)Q>~1GW_>L+Tl5v
z))?EhgD5>C(oWK0pV`X^x8O*;M!Tz=W|yq*S@{sKXc&h+g!kiHFx)+Lx#7qIYhv+!
zA1R|-TrNkX!jmBqjB*51XNH+P66deOcR048pU&;thWWc*j)<n;GI@d^;R?l%u!t+5
z;ldaXSqfcn10^ju5NtCW8O=DpC~)r)50gJvi4fZuUSy#e8Zs!(XpzR*SJyNkTQ7=e
zm7_Llc9y{~{NU3);2v{c6_r+D+)TdbYroazVp4{=`UrPVPnNTcP}K_4_`0*{&7DEu
z7#!6W$QB8$Te!?`Mg-ixr(qc#=LZjYY#mO_Nt^Y8(q?1n=VNGC#Hi>Th0at`*X90x
zI~`M#jOtw?7F9mkVJYM;OBFr_PrdIdUbo@0a*c;^Dy#&CgD?tv@u52%ZIJdwii&g{
zhd6-}fU2n6k|oIf({#i-Jn?N6)&8BLjViAv6Q7cRyjmP<*Z->jo@O~RjzV|tzd?5x
zTx#dd+sBRA5-1<y4)P%586}h`b+J^xYA2mVVG=+sA$kUpQljl(CYA56yh2aK2W@0S
zJ8RPA-YRytwb|Lt+vy9R!Y}1?n_%vNc0M17Vy+>#jTm7K7fO<cVOy+rLl#>4quhJu
zp-KhAfZ92SUH#o1+kaD^w}2<d{LorR3WT#;bU^jCRCZ!vXDV#lhO%<_WRd39r|D$Y
z1rGr-w*CP8FNE#|SLU}dY86J>K!HSU*IVB)q*D5;*tcPzK7`>-jk5f>e=^cU-R)mY
zk|e@!c##~uv8dR;dUa$ytz0B&@A}+ls$SwjNr!4jH*}{>0qaS^ZJ9SRaV0APV~vD!
z2Ve>JGI9Z1_QxPtV_9B+bifv#`xm01aIzXFW0-Jz25q9|EmMJeX1AMX%J)13ov!Np
zPeyl|IX|{pd#3ry`IRdj512o$XnEcIijW#Yt@61UMAUQ|*FMY?_M|ATcLp-<IPs#1
zD?;dNp<y?`uoV8~n5_4_UhT8%BYz1tD}QqLYyFU$4VbZBt@mdudJ9D7_tvg^)Y9GJ
z?ry2<8CQtEpr1I>J?JJS#FZgfSn5SPlf17D6$zS@v8p<zK#&MZsHV9H5d+U9br8eB
z;THtzw~LMKHry!|Ox+^C?Yyt(L~4i*P7-6~fTM(6wG}cD+BsNe^&w`i(}0I<?$2A#
za($`GcygpU&zW}<Opdi&Kr{Sfdu?^!KYq-qo0fCO?-uuMx^rf))h3`&4P`#bsFVe$
zq9#lsz3KG!m>{}})SyTf*wb2;TBPl9SBXLg-{5Y?FJXkLTflTG-y)MywutPhMKtQ+
zyA$k=ZD76H15zI~xin<8AUyzxf5|C$x0ctc-xg-(68B{d&ho8;r<<E>Vp+Mrbin5s
z7)e6u5tG|TVi~`3bvuTIJAgnIME+kaO3=2Ds7y#>@e{3UwgNyPiAVN_N;vC5*pWz>
zKqvciH%93F5)Tuy(|HQH8M^|R{()M#=gYeagn*5Gh~PNX<|0^H)Bzq)1rWd^p1l}8
zcC<k}xDngN?S4_)^w-sJ#iY`(W^!xyxK^dMdOP9O8|7)6w7{N>`F`fdH$GE3JG;JI
z{+g<MB%oJNbTV4tWBS?<Z6uX=QT^_{zZv#6q&9th`ntM4y_*_Y4QMxDcXZj)k*MT4
z)@_lUOKWxY7z5{&4}RY1P`|FSK`HF4>@6w$r&v$2Xg?vc@XN0Ti$|cZ_W`uKe_IQc
zPH=d79_g&%D9N3_iZP0-^&<~S*JWVTR+DK{O>fCGbn4dHg4stK$7fk87Jb<RDU>uk
z9IT0d<=RD#O*!=t$!dh?b%pbO`}foCTdVo+yMG;KMJgzt&lN-Tq9$-R)+ao#@3AYW
z4Y7}PN<veGrye-4ZkzSVCRIGx$Vj{Q?NKWo&L{3EFMecxs&ea!BOP*O3gv}NMfm>%
zA5-Ow&l=l<pl$_YsWaIHg}|#XTF!ZhdR*6wd9+#EZ&|(w11sSQC_B4cng>Zq=yBLh
zoB-(H#SQH>N9puJF-ffjZej5bS@x6`K+I#v@*sF4T{ZkYU=?CNBqD0LS9aU#<?T5r
zqu)+?RStKQ$FsUKv1hU5k`z4F6r?qq8xLEyTFGHZ{3!6&(!r|g_O$s;6H{Rfa>H=B
zj6T}BO_h>J7yfH$Ra$ex4W6aPptF?_$H3yw=ud?oet9jAQ?}4Gtoz+iH}<W7DG$KP
zENqZ8P?WVfn(69`cV^aOn3F$BEV(p(B2mg^*J!BnW2M~M+}eJArBp(-UuCHY`*1B8
z)Tadz+d>k^c#--;1yM=+;3jR-{K2PEJ~y-00tM0}muFmkuXYPsQ)a!3eyw-Zaw67*
z$Y9NPt>s!&v*L*_s5hTsRu2DgFwETVpt4>$mx^!>w21+>0vK2x$6LT%f7XyN_M9K}
z6p|3qq8Isl;K9FE9Ix=O7~;bz|GDeS^Z}98zR;_YRQxfBUcSi86C(uS=iB{&dLCI+
z<v2!d%&oFq0?@`FEx66NPC;Ja*LQ1%xyW&U2sUi-`79c@?3^SA<%O(^1G_SQX_UqM
z?j#4DJY0*<C=B|};%W${UA|p>e}2dH7{pji?diiRc9o^m$_d%jz4;eAY|YE<zH3@1
za2#}=TLse7ftt#Qg43er$c1kocD0kU*buhC7EWFMF>dyJIsbxog!F`j5-H6TYnH&%
z=C7Q3nE~%X!9#PfXy#_d!b8ay0t1M!2`FqnoG-BuVD0z~H;V{ml?38Iq`fT=&$Mse
zR;O1TB;Vv@fB6&^N@F7@<(?7koS(py{Gj*Qjk9|O-k)VKP-x*`R<mzBw)B>|dN<Mn
zzKTZAT~AX={2WCY-)LnUCpMK<sa~qDHOB^IEU%Ts*J4JEz1IT^uj~<N$UIp1r-A0b
z68RD|Z__6Jf&eYxZi|Y9dI~V47#PSO4<+q5pPpM+gRvhm1d9NBcgVt)k@yK9THG*B
zC(oWg$1X+}2aOmL=S$vs9mEf)+>$Zu&->&~=h__y?bK-p2AFEqa_YcdO{~ZkM8~)a
zxJHPDL1E@EBr;wif*1^K;Es1rtq#k)+qSJZR#AE_460G-WQ_8*nj>AGF9bV2RxBh4
z15aSaSP#j|7;qM}){mKzp6wRte1@0sOY=9XHaE5&maU6m^_<VvCo&oHc#mOv);iRS
zg>yAwuxg{szRcLZq7qsM(3#Vn%-?PJ#F>=+wh=%?60jWZ?t(w?As9l4xgiZA^vkp7
zzCBsfKIKK;4qw&PBq~SyYG;(TxW~SQArq~n;Y}$uTvA9uJrMn2kk0otT;aXX%6-;@
zVn>W@)Wvxis7kU9qy($=whVewA9&AKDVMQPFh;AC?r8n3QnEmwxpb7o(SN5t|C*v1
z!s2P%%aIZVG%n0$=8Kp<3xa9!VOl}&*Y!9c=j78*kA%uI7$tc{8yKGGMkz)w!}HM)
zKMxNEqPO&}5>I1s!$S>P2gIsyJW0&D)(b|cFrcZ>oa7rF^*g{E4n|VgQ#gV6Y2C0v
zwl9!PZ#?&oT&Q+(8Pd10!OhdXQ~N1v5WV=G94QB;FL%=lH>uVVOr?Vvm69$!Jmv)$
z#ZFsT+^#c$l#Ja&lPF5GCE&7c+qP}nwr$(C%~Q5rr)=A{&3B?BI{FRnpeGrTKOuAN
zwZEjMQR$<>g@}@cTj4@S^l7r*`dw_K(oic>T?`cjE6IYnql(Qq^CkuH7hT%9<f}EZ
znGZ*>a8OD9oF20f&n^-LX}OXo(Y{VSUuv09_TPh90pHS57SqW;#OH9U47d!T*Gt1C
zU5}rmSNI>I82oGuD*5|W$I&B{;hIZk#7Dtoqqq*$;aHGsETMw{z~&Lq`Ub$Em(*&v
zClC?LRIJF79<k>b2;XQ1qSi`h2+H{#XdM%2djzw)O^o@VJjqt?1kbXw<5$dKQ)XL3
zugoACGBvI9t0EtgY9ZNF{Fa=2*oPEJfz28%s9S>|m>PTy=rV?oKX|0tC#!*dq)qC9
znt#?r{E|NSict%fHuTa3eIj|>g41xPc73oKkFfG&%U*%RgIE$tL5mQ_6Qlg+bLrP@
zShr-NO%83=(=1j&k6*YPowAS@`SMQcPt9`d1i#xsi7&ID;=VKTdv4&Nfg3Z#DrHsw
zx{+7$DSMn%A1T-D>iz8lOLi`l$|V_#^3~`cU=jh=mo<<`OtI)|$0$A;hB6HbH;Y-(
zg6;0H)t^|Ac!=b3f6JHE{b;~>5XS~}G0cJ%=2~l7e0u=juOu<%K*Mw+<`(5qZ9Oh&
zVwCi0^S(PaKX4fKmTHF!P3ijrF;qSVe<vej3W7#SjiPJbQ#S<zN0c2@ZV8bAVM7X5
z5Uz_zxqBVW)AS{Jwv?Qn2-*%81n=N={MpB;H=#-|R_VH<X-zlL-=YweYUgg!z}}3{
z29ug>$V6x0EMj`2`{Cw*U4v27kBKu;s?g<uL?2Mj(yh#LHBK1u#=8lX7j?}aKAXKP
zBcV*9gLZYfD+p5`JAZByump7%4}?W&g9io6SADWUF`yK{ml|47g{zwi3PrGO6xC9A
zB}T#y1rk6#;tKDTv4Wn)<F1o&puluF>V72qCDzR4azM=_^1>lMeu^9EDM7zQhxpRz
zh}%)vymcr|MjWzCy#R-b3+g>+)9`fkK--|D38G^ffSsHw)-YutJT$AdrF0SpnH+9`
zYO%(rM)3^ls%BRCSWw5Y^>S^-p}M_pt=50(wT}SOH>JP^h^F7c%6$0UJ!7F;B{vYL
z3pXUkxt_$NL|Ow)RI`}m-A#m{%z?7#T!;1a2(VOjQ<o}mP9t|HIgX}o2<P^|^7-(}
zX=eWLaftP=jl7A^3yRd=#fpS--|Pvq_9(H$JbkT}%{z3f-LC`!sg}?9a%mc;!i1Z`
zdn2~+W(64~T;d!$%0TRp-LMSwmoB|NRgAIhNrZ#LePoaQl$;Chu=IOrp?v(Fh=Eqn
zH#J;n7OP*s_GMumo`q4vI@lAi=USB*yR#-lf(m9mLw>sQ=l7F3$|1}=6}QKg$B{aW
zkB!FOGy_U{aSXoQ6^71su7l9=?=eO(M+-XDxTO71)~hBIXXs)y^;bL}1mArLfV*d?
zfeT(@V5CDU|7Ts>3**qlqrlcg<w(mi_!!YCNRqpjm^zC{kvT^SxWQ*%6?Nt&urIfP
zvgWDNxP(N;NJqqYm~upO4hT86A>5cS6PTIq{K7Ee%e;~?Hwa4&zQgvoKiL^q*T2fb
zHf2f=DS;6Gi)}FY;?%V@IPIUgNI69$BZ?^8t^bG~Tp;ut)VdV_XNj(dcL%q0CTSu;
zbN?+Qy6O8<PdZ;N7cy$6G-n_V`J~5c7L=l_x9cH7pO?Bza(8l;r{)hd)7VnJPxYP0
z#5xD-k>8aO)lwUCIUt6qzKV4O9n#^{LvJRE2k}kL?H?d;WFO=}$2B6|U8Z>(xIab?
zs%Wu+43xx76YVoHy-hLaP}P*2ZfrVdufX^A=);mYKP8g>fQv6FX!^qIRG-rY;Qm@$
z?Tos4r4gW<S1P;DT1KVh7gPR}M(B6<R<CqfTW0n?(gCr0Ru+JHkVFZT26tPwml6L7
znjl!%$=zg)ehq}MX+ZxxJ2`hi_LfmlD?xyD!Xg*ju@PLfM$5R<?H$z5y=0Y}vI|fE
zNq`f<%AEagJ`?6mo40WVG>Fr4x@&seT7QR0LnPQpad8=@x5BmB_?w1uF(ksbHi{M@
z$~+9}{_>zU89!u*H4jdJ8+Qwv|8V(1+BXvE?`D8;7}!U}mT20$mSj)p@sd^XT%Wb3
z`97E8?&sm(L5a_|)WZ&phj9iH9FRq#1TKD27j~B_xM{Mt`0f__j>AE_=z$1gLthkJ
z@bu8IoO0pM@&_|e42S6&17D=bLb#bq^pa7n4&EH)5_vhqB+6`HlM!`xKp<7;#e!!v
z63YTd8IzkN>_*jxBX;``_;;l}l$aboC?;7t>C;MOljqE*kf<Y*Kc&&QE(|uXYYtbG
zH@I(u=Fz)8$fUW(-!GUt9LY@YU347$03O@>Nq7V}ZQH2(&bU?_i?K+ZVu+Htf(H>y
zwDJjF{`fx-8zu;r<JJB6q`=kSerCQ_G>1<Q<x!A6F@KRrPRkB|ZZi{xI|fuH^h#WE
z)}lGUHSqXmkBF%xOo;D-cu{6g(=hCq!TKa_ztLg*4fk*yLJkYiIu*)sTm``XZmYDd
zsx)+EcJ9>FTcehVQ-redk_xMiIa}Av1_hg9ZGS#Dtu6n(e08cR86%LN^MN%xTMx0p
z?2227M4M~88oAsErHLoHMkznLQn>`<Ohu}!3sAnb7lYT#wyO{tK)s(oQk{tTVo_^R
zt)Fb+T2^2E0O38HTac9>Jng{MU8Ip5CHr;G`I`r1oTkc;UCq=Fy@qkc9>#BCdZ)r$
zspdkzxg$7z+r4F+@hjps8k7D62(IQzQj&E~tQmJ@v%v{tN!qYYx=io;42_x$^XP9~
z-%-h?sOy5@gLcq8+5#-s&yb5ms{8H#MfX;`^AkT1G?fXcpifTyoS+Bv2hSleVOiP^
zOdovLcM5aE*Q7w-W~63hDE0>L)8_72Rk0yx@=rSlrXrR;TcDgj(Q^iwZ3}?dV{0Xx
zv;68r1rcocF0Ge{%s*@_*|&oH-@@b+9$9!B&ac;BD+g>Cw@WL_Qbf}2B*CZ_$dmQ4
zeyIU{MjN<v1`qpC5DO0cf)F?h^+D*~LTp#U52sJG^pftTJwd%rL4c7WX;r*Vn3_^(
zD9y>%y4hER__C}<WR4jFf=jdyRd-(BJ{vy44YRaRHC|%z$!~_o^zJ9mL|+A)E3z7I
zYgAY2#u2EDD#av`WK9etp5H0BYBf;9FW{4#MX|!ViyRG}4pj%GTfVeFAkHcX%H!x$
z{y%>T%1s#O5qgFrPLfLdkPRoC0Zgs$)0Th|1F@>L{d<t&(nNJ+_?H_=_R@D3KM@in
z5K2Zm?>QjAqj;3jr4M)Jqb3~J=LGBa1nmz6@+cQdOgF7AD+y)#%XM(tq;|A_AX$%k
z>>Ssj3r88`L!4i6MQQDf;CFQ-9ct$rfc8ZVm<tj5_8H>m<+Qkzr5xJQg7yb&p*Sod
z1FmyaU7H7FNKT9n243ETIsIJh%J%ybt^<2z`i*Qo)bt{}T>z#YZyUo5YrogZ@6d>F
znxsm^kvWrZ58|>?uV?mx(}C<IfJr?W?pEu<w3#G)koWybn@-L81&y^m2<84wEOTIp
zt(=SB>g8%g)7$oHX)U6wNB4)Ivb5?ojIS{cV6LiHZJrJ`2h4goNh{)BuXzn-S}FzE
z^GfZ!frF}i)9h-}rQN>$XreX_=LE}YF{^pem~A)-bbx7(F*Q6GGrXJ#^mUewGE|H9
zqCsLk33Hc`3lcLlq#cGyV*aXBVJ3dNtusnq)QqAh#*1cJ6Q^gDz0s=NG|osom%PH}
zHS!RkF2m9ydyhXMP1Oti5lgx?PJHt+pg9I&iaEnhhl{io$Li+Uu;3F#lbItX?n|(2
zl>lXsE!Q61v+WRD&EDApE*z{~ec7$Qt%AcqwsC)%8JbI_8Gx|Q=-|Cyr7@L(hQy<t
z^cf0QT}(FLfLa3kuo^(5+wfo4V;E`d&K~~<lQT?$6InxX45pH_G7JK@I+Wnk)nhR{
z08!f!tZHcF?)#*Yi^p!~D;-!?%XK&15sZFwtsz#|T>U`-r;X~q5r?B1BLqm<T3J@9
zi(HdLI{qPbf6ng|fzZc<)Xpx|>$(}AF#B9;BNRf}rCXu{!)OY9hQp|aMjNMmb(FXW
zt`+3oX;TqegWIE#Ai9!QHoTt8WZS`M?CpqKP=fE*D0(TpzQs7dd$8EO{nF+ZcD6)!
zDkSI?U={6<WhH%8v@-nYNCPE|Md1ywhl(c#&6;qlPADK+rqgu4de=qGfPkZnO{)zB
zy)(?4{ynf2Zkbd$IG*rBFE@&BsyC3>A3thuPbm;dSxAT)Li3dW9@I3HsVLC}!~E`H
z4`kt%h2Uv!#l%{F-6Z~r=>J8<vU6{OX+V7t<7BIg(M=5l<q!JXRJC}1Q4>%p0;sva
z90zWJQ>;*XIvLU8@*2QzIy7utaYN2e)kHt?p&km+wNzLOY(zS9bM3Z*N%{a$h9P^f
z(4aTB_|DkBUTSdogJ2<&n<^s`aF*G>Nmr^6vJ^9Wnpe%OM8Sk2f)_mtyclu#E9&?J
zs`)t`)(YMzge#3Pd6IMtXy_g9u@&^5uuAM=uJS=QX_WMVI7Em6BkQ<Flo3H6U)0&v
z9NW<XAB8MQ4iIjsz`Lof)j0*c;lVPxfQe5n(n8mTEzPq2bDB89K=jSKo?ajN1g*p8
zl|$){U6D_(i^QPIWA}3tG)~GK0zLFX$gAN69(ffFHaM@YX|v7qY#g77UV;!vD{FW<
zlP|ukNoblT3LfHhKu|h*7Z4n!U_N?~za%tPgncVh!Dp`r3_rVoD0jtbU+pb`c5qjW
z5OYLWRA8k+Ya@rwbDPpb4qj38cTL}fc)SrWW~sbHT%DRR-T}7dWUycrJP$*4o3Nrg
zQn@UZs(ZAU96Wx%GWqfpOS<M9A2p1}1V=qeIFc*>I1gMN!DXg<|DiKyg9ZQv1&Zw<
z_w7Z|I7Fcaxv4>gSfP&L@mO-iEV)1WfDfLD!x&ODUKFRmFw>yF470r~N6`%}@O}Bd
zmXbCa6nL3rGo4u1y-1ud?y3@GFKkOR)T}+u1!l^bx{2IGlhlX8i#3$y;r3}bu4T<z
zQ`#7Q9POcjh)c3k^i>G6^&zVe5`WFqCgTMLJ30liWVvOYb4pdME$t(702ckGkfHJo
z6BMB<-e=9m0Y$m7zqW)lZR7N)FO-<cy~bj@bQPQ--JeF)c^+FnY7r(o%wXPg3VgQ1
zVlWDho6bscf7T<w^R2t?fgM{dAUP&(nwO4SFV*FKA;3tsklmLqyyKw|)O`Dv$5Y=W
zNk_aT;bUVeEvzZH4kPeO1<c&fB1(X-Iy=%+K2@4(4+G|e?MAHu`M@5;0QGq^>eHqC
zu*;%+;v6T?MUt=l@DHM^li&g{hpZu!s-3`v#82w}1=f{|O_6!p#h3Ww5nkWA0{MGL
z_{9{QUgz!=e0q@rmH@9E)%7}qI7$}l^^s4b`VZSA*Hk#>hIULv1#DHNYoE}Ju6v+X
zmar;+Bs~`WBWG33WUW3T%EUq<2HS07M4qzH?2mP7-k(l5`v}{Kv5+$Jz8uf-d39jv
z&sI84*O&Y-2Q{{_aR2k4yov*yOW!(6Hk0A!_xS{W<WjNx^vhy5DQ~iba+~!I>{V+_
zOx=6=<+F43Qk%VNMt`xK$YmfqZ#(`_Ldp~7i*V=zjHh%zK-M@YsW(q~{C$l2UVoT(
zOVr_}K2i364Djh?#ou*J7BY7_P0%AFFx0|8@rxbeVsU8c(rW8(gKBq5UDcSQ*3LgN
z_pyn#_2&1fY>srq^c5#tPT2WQ=9%m%982BE3`*Xw0Vc)ccaw5J*Y4KYMfWx69&zL|
zz=E|OuvIXkbZy>wt<bvDta~FCW3P7;rV&}m8=YD_UK}DrNXO9dH;Ijd3~{%;4>+hB
zQXB1&J8~|v*=%Ia0w`f%Ut7`HU~7@h=ad>(;%ODR>aN<h?s&ry&4_55$2;cifz!w<
zj7+mAd-LYiG#^#Mgl$F<K|x-3)<!Bzo-PlbcFRaToMWU1AFe1&Zz2CQF0)B94DI|9
z3_yukHWRRmDb?Z&OIXD3ph}=BW`jCs2@gmDi?KoBg?^u=?BnlC^`&a=I<%3{is!Ld
zGR-Sc&eR1J<DkrQo6hp#j;!R~w+QkSvhf&Wl&5qXo^efE&?cw}9q4ZOJX9J6P#(*$
z@+sB^H$f)N)_hVOT}T=n^V&tiGZP$;9O?2{E92!2TEkBIl}o7ad4bgxF8cjo;}$hM
z@OqXwPzCb7p~YPv)+-L4z%p4nBj*|sxN%Jxeqb;<9}VC4df|ZkKPq-=u75c4@qVZ+
z1;B;|Yd>s+5Rlanv5XiML!JjFF$iw*V9K<vQc^RAWyW;m>e`R@{d)m0$tga0ZN9SJ
z_1T2L*CAy8y~SgOtop39A!i<7{oQ#*(WO7^#^}S3=l+Wm;QS9x;Ge+F`2RQoHYN_{
z|9ku2ngBZ!Gvoik1PGw$#Vl=HOq~em#cT{+OhrtM?M+Of`1qilU7Sn}ZJ|6iV%<Ph
zkZm^kNg26P(j+OS#ex^MbCrx?FzR7P#sHC|B11}oN}7qHLI|coM5Kg-Bq=3HOWw=)
zZa=$cKY#Ndea%m8UZ1-@di_>?N8G2^WJHERk6{)?2pNeC6ccz9ru$XEAb=zzf&>l#
z`1qVTMxbB7LGLsN=XxDblz#Z1tSm4<f=8DKF}gDWp&*x@AAy2M0}L!Z>tlEzKv2K~
zkA6%egeHNP34a{W3j!$=&_hGsf!>xBb_6Zjv$?_YkM+d~_*DQP(vp)Af3D$F1pDV4
zC_o@t0t~hcA$-IrhM+CNf(8vU3j9O%`i|oUJSL+fK|w$wgb;d*D4Mg20vH$o;vB)V
z2LFja{u$7B>RkfD5I`?ojEVsGb6dDKpWtl59Y#O|78nTd9s`98CG<N3@aI6n!1o=2
zW?UZv#P%2u@eM!tz=nJJ>cAk;LBF^+^tbwfdt<vZ2oxxxcVPs<d;h3v>Mdw6mW3ts
zVGyH`K!lP>df|w4dZ=6Y`|$oAf*FtC-B96xEGjYqh~B=w&d1QA{T&Q_Mg8{GI=ErK
z&;k8Mumw@rP=Wpg4E_GPkEMMJ3>5!ML8HFWi%1brf(HMYT8EP8%Q`fjukK-*1P6Tn
zjJOYdG!KY7_7kwb0Hp#12{AYj5RZU^K!rC(eL>mao`3zQ2l@<rz6&+%Q`qNFcY$b7
zZlM1D0@U{+_+uahzXXRG{VLzfLjr&S>+UJQ%we8@i39z_#f2Nz`kQ<m&EE;^*&^h5
z7!aJTp6-%+^R($GNYoYdP5Z;E%M5Gnt_Vq=x&QrDtEemj3e-S!#4LztM}dF<i;f01
zy$hf77h??T|E&aiYO8}=Km|?tRHpe!`%$g`)n7dQwPpkf_>D1*7-U8R`=<r$xe-tz
zp!|aV@GpL~P5#Dj_Z5B7gZ$olv3z%T`&qyHSN!7Bf&jikeMrZjR^fxq`U0c)0Vn+0
zT7iBx)q*jgx8oo5wQylT_<{c`Md|(ainP~}@gSTS!Hf!Q|0*2A+ud6abni)IFixQV
zTnYk41qc@WF6_5KT}1k`_}u$^)dcOQpX5`rCMcv#)?Fi|CxHpgSx6uN@EdiLfDQ%S
zTb}_ze@z<{WKbZ54s-$BUxxzeDq8f{c}h(H4&Ti#(BHMi<i}%-;KF{wgM^3!DfAut
zmxO&3&c6+R%EJ2S{wDd`bHboO1Ot(cD$ZrQ^XhH;dTZ1S;t@2m6fg|7nWT~u1m%jb
zf8s7CltOopMdpa&|0#KOoAcFM+S^snJK*|T+vh2ZwwPhH;DY3IkzvHuy#$hh(fMF^
zcit%l8<!j;Jf!2vc{D{n#59=v25VSFr{5c&PZR4%cxWh)u4VvRYxE)f^p^C`&$Q&7
zSd5A%f~P^cB9an+hsw#1X>dq365$vJ#dHI*6n}*m!*~FrZ+B4+0Vu?VCy8okbv}p`
zHy+T>%Z&bPZFp$hXmmijW%j}7jZ@W~o-_Rkp{35F#A<n@j{IlJh#AzOvh@lOI#WaB
z5q&CEguiVxZhp<is!fFPmDH=*EUSzx9y9MxaI5Z!C{0qA7kqc;al2@*InF?Zb*gXG
zl*^kg!RhmNb`#*D*G@Xe$_g6(iedc|2!2xd(+^P6SMaRGmRl?st>}=gWU+!*4LQ^q
zhg97LfZlw6bZ)Hg9$t6?^x9F1iBN0LQU*y?HC787U+}o8BkyJkd`pB02|PkGGp~yY
zxQFAl3N_?k9}tP)ivyNVX8Ev1P`L9}LzUBUQwQ;VIc{S^^^WC4sc=(ZVl;=#ppMGS
zVzy6>Y>ct@NazYZ_SQ2SaPn`O-}_%YeYMKh^pY@vSxv(X`jotA&v7jv)>oTJsdKO^
zNlmGbZDOu{m#I(P+N-&zUh7LYLeTtt+S(MA1eyqrBj)?|zXuK-jHxDTN*k$>$8C2U
zW>dh(<F6ZX>*Q?LTduKE(SRr(YV2FoxKr>d!)jkQ%Qvx#V!Wr3$t19)`Gjyh+g8u=
zlwUt8x)?;|B}lRo@J%WkH?lgw-X)c4PSQZ#rczmEX5p~$wz+1d0p#obbtvldUS-k^
z@#e?<ipNI%I<dH%z!@Bky~e-hLj^q7O!aVk1EKRf!biAxSc$-3DuS!h0`q`ba0A<6
zk2Bkf7dc~En>rV6_BUtI%TTsd%PP&m`4T1;TOLS?b4I_h%`*h*(Ylyxc{hS&2jhTn
z$SGRfpBMO+-a@Sy&_>nHqzV|kHBN!zeqTf{?_q7o-;}c(Cj-1R5?DJ)b$cep*g9m2
z)m<3gn+Cn8`16G|n=;x>wSk)igrPT+?eQJA_213i*$_8lt7~JcP0}$qWRQmiY2=t4
zpHDs_co_$S>&RjvKj3$rMU=oVWicFx^qij2`)Fp?IdcmToHVR4Uezl+p#?0Ta;-s~
zRNtI!Y_wJ{K`IfRZ?t-5yrov0dCD+2N>>!;JLy<ukWyRQd}#{|h74&_FCr|9syqhy
zWAi=iHIy_;D3Dg}zpo{f5j&DHEVmBC%9M({V&SLCd5eR8#)GBc9<UOFzL*{aVy9^d
zZhuaz!PS$XK}i+tPpcY<Y{fzaGzf*~51Td|at;h^u3$sIB0lVJw~^!I0;;~lF<9;N
z?M+Nvdp$@pfT$g-3mmzQ6<g#;I{2-u-}G<<?u_*5Wf%yG6wh-UZYLI(Y4c)M-{(o3
zP;J;>0qP`G=pcF6;ED=UB4NL;6r%5pSGOiI&(Qee=q0?>a52IXZU}lz&kIgPr&tke
zGEttIE-2f?8fa?JwhafEZmiXP)uXMd#hIrkHs9o$Xv$5v!L?eWN6CeTUpl%Ga-Lz0
zS>u~2X_-(n5Cmqz(wE;$if$JB6}(p1U~PBGUE!`x+vID@n{$PrP@e=h(GfFBd*L}>
zD*nyKro__-g)5MQPC%k`wOKazu7RUHON{q;>7YZs(uH0n<{sgPIriCu$}x8CQJmpk
zJBJ&duL(W6jILR(0>ZJ42Ii(9onP9n5ZP>=4Y#KQpNB{3Q(JbB)FoT*r_2qz5iYEo
zvc!8mff@kflG0G-b2q7k&J|aV&!wJk`9ykO{{&o3by(Nsj|bQLReuCj<%SAVsgIZO
z3N`Q{slio(9JA;7?DHF&G*FVAIf@63)O5<ICr_QELVRJwL6mj=nTcRyvUSv1c0F&9
zyhAy<9Bz1pN}h&Qe&5yvx~y2!+C_(|g6JBH7<*FV_o4@<b^nW33#oLR{LJYWH)W!K
zA&^vNd_Gx`j6*M(6Ax=dWXAyEM_kt>sG}H^tf%zR*&Ju1I_@7lJznECM7s3^ffGHw
z!V$5JfXfamf+5w&<~2k2$czZWVAgk^1b~S%uZqxiB1=EJX^Ak@v{C?wUL{gzK8}Cw
zop1YM%og0MP(NM7W{LU_AzNE;jxaun_G$`leSzw?eHKqG!qm<%#QmT_i%mSC9pszf
z_>2IrZ9hbvv{yB*NM*)jN<$Eru;0AlYlBELcQ#4(>`2iiIe25*6YvZDyH4T!@!}5n
zL3@2_KQ5+P9a+Y*lD*JLC*`lze!Trq{Y*(ZXMSC+SfhjIPk(lAQ<AuoYo<fK4~BYM
zigrxt8S=-XIYXXIKeP>9fmJ6acVouYc3d9ai?u0JjNabzw847=_*cLiL@^6x`6P;f
z-RqK}xR-UmEcdE4MSpE&!Pb+GkhaC)y+=JuXe-Pmpb)W@`;xI$6JkXMHKuXhU~FW-
z0MAHEqOfzYF<LQuiE7uwLhe9(3{tU|{QxndtD=2)P}HpSMj6_A)>is*>)K@=N#+rH
z`jxiutf8}joz3uFv`$l}+$uYK<c;oC1Q*QtdUug2gBcQARf6SaQw{%#=&iF{-u`CW
z_Hjnr{XQUybp?^j_(8<)-*g7Ct8Iggn%@-$heBpHzIfY)IXNl4xh*5iQv^BFbe`*B
z!!B9lL&fxZt1X4JrVW(;)=oGM=D0esUt=fkP%gH3@6SZA_#f}WuF;!$4z?ElYdM7v
zDbdbv1?HN0L&!~+0I;h<_KxH68%c;e(XooSo|?&~R2&6c+Dg;)VWo8S4l0w+pXC#a
z6A-BZds7?QbwNOG^_jD?il+w)@VajboMJ%Lnp$Zbq|dixlPD`SPA9D@6BLUuysh*`
zC0HkdB52uqB^+Etcs8k5O)^T_o<n6^)s+63T<C81xRrC*%kQaS?aH$*8MdYleGxB6
z729GRx1}{@GFP2mDfReeOSv2ZC6g}%7faFyR4a+==k!<#I#kC{wq@ednxeMrt+Ixv
z<p4MKQN8{8&g6W)A}m4yl8e6vWgSnl?MbfPkKp5f=)DUw^6R%+osH0n<}0GTz6BlD
zKAu&4(KmnQc<(K$wr#xTUB?%ODCTR(z<d1$4hUzmsC_Sz2{&7%SpRvWH)L9Y?hyIP
zkV;j%OnM-%o@@BS(~4l1tqgc&r~ZWBFA9l|+{s+pc}We2!)#^{s&jo+==pio`2N6J
zh<*CAlJ)$;_nF3QWWRhtq2n<si50p>l7k@f5>iCV)7-$&ZL$MH(#oN)i@7fVEfW)e
zIsuOgxkqQT=M{5~-_T_XdjTLv=sh#_L1k(zJvp$Y;-HSBe1l2*v_~EL4jlCgU<p=6
zPlO<gSpUN2BO^?CC+v>-r6<@U@n;2jI`=!0%>0b|Kw-9$c4}gRc5iNs=HV&rM|4fJ
z|7FVFa=76f`_*{_0u-Q|fI7)@T0@Y)ag6Rn45^XKsF367TFHMe-gOsyp$(nuKS;N@
zh;i{y`+JntIhDObeNiqeuG+;TP5)B9senZeHd26?;Lh22@Yff%E24J161fmkE;Hse
zE=87%e>}KYrt9DjxaQsk#d0_&6yf{3gr1S(>10~&I<1<H_hySs8MhyIJTBYLT3;IC
zX{6r{R?{O40>$5E75g&BQpw6rifsyaBa6+0o^GUz4tQ1A+*I7__s_}Q^!5jzgGi~2
z%vf{C9b>y|eK&HQ>g%(ce0J0qe?sScwZEAJNNrmd)WaqHt#xaezA2I~7U1l8e_b?&
zoIA$1V+K@8&4d-Zt;1NNwk%}EqtiCc!}8rUzOxlwrh4;F`5H=$DOO$F>Et<41sjqL
zt*;oz>XT@aYR46A&(}*XYCuD!+FW^wvFg_tOWrq5S~BKU{K&U^PxCd7MT|RTqdz8s
z`c3dmNOyY@GCx@PbK`X5!RkWPMH+eV;V<j%tfN+a&k+mw#(>f`&*z=%lji#fj_SVG
zE-HGcqDQt3cNCDN+ZSXnB>d`}Y(4I=h*clAE$X$)vytn6iXUI4UHvdoT*;x+=qMi9
z<5ID@=S%1N4Z(c1Tb?0K?OB{%fF;LifJ%A%PV0-7>77lgg4&?Y5lY$>+!ms%3LRhV
zw;OzQ;mbT*-81aymD4*Sbb8#=dbgyC1;}yT>)~L#CJvu+Kuq_R3YcG?3)8fCs8QI<
zAN!kwcT@B3SWz?7ED3#O6(gp^;$w8D)6VhqMYHIW171f5@|gp<!O=IwrY_3zw{9=;
z5r#>JWESaD(y0MiLi=zj<X6f0Z*HEDH20uO469qR9<@Eo<(JIzGV>9sfyZytfoNcx
zUUEh`sc8z}!jbD(QUvjjh6HB-CoPPz^E<udM&Q(6COwgn(CU-^ZTF53H}P}Pc3icp
zP?lnFPqTRn^<?SI{S<$W&1W5>3SFdv-_|Pb6QD@7ci-{to||`ITd-<M9p55jJ~04{
zI{&fTTVk@L<yrR*AcCUvlo4dLwZPYP`*{yZ5u3ItpWF28wl8Tp9jrA+!1fL?Mnngj
zMa$G*W!+YL?2>aNEBgs3$68@Zz*=xe@=|?0y4e_vfVhB^cB`Kci1iH1`eyQJ*1me%
zZbL4>s}i=AjDe&q5x=JD2FMohN_P0M<OE*VEnmo(&IUNfqHdx0<>x&dvTZ&+TS#j0
zSal`udJ$J<j<rI44k7x(8NyQTE=u|S#AlDD=hK)~RGO)k-O$)0l6nJv%uq<pgUKvw
zLM5rk=npkh;|ujw)E=uB%QZH$79-zY!RexE-Tm|#+k__fuHODYls<{AUTqAPNXTXX
zdi^;W1>`%VrqO@ISRUJZha{|Lej9Tazw_Kilk+Ob(?fZ@k#)%}&dT1&kG#P^-gAbD
zM0ZV1anbp}*Z8;lD9lE=&izB#zrfzB0z)uFCmpC_0y7fl{Vdjz)m)pAsUzu;<H%J{
zUWYWpam4*?K+5XLr=WjG)yuw&Yiy0RYnrW=@D**4-TOP!%!2HIK3#DM1;wv*5sa4P
z$EpqodUklKSW#GAq?)AOou27r@)E`2`VbJjNEouW9d6Mx5oTtMz+qG2c?x}1+ZQP5
zr<BfAXPmj_I;#XSITM?^jon=<hYZje$@s@M9Fo1b9uxbD#&9csWxtr8ypZ|wn`R@=
z?oo5M9Chg9WVu3dMgwT)vKKBWE>gUT)#!D*{JK|X{lrvEr_Gf;hM-GQO?mWDOH^7*
zwIU9Bm3G7d(7AoYr6=UgMV?}&!N-^(*-WW4vtGBW#CP%w?i!vzH{C3DF@9|1iOPO2
zg`IeM8Qkd^!%%|LrIRJX=D=`dt!a=lK0vhpTvhQSdEBqUbOJu(T}b42DNKDgDqj>6
z<uA%EB~jR=a_U3rQ3ApYhDQZxt_Gf|c+d5aj$tfcvJxiQo&=N`VkKHuxP?yHg(T=J
z!Yr;0bw$M$$Esc#L~}1-m~Vm}1sr}N^SnM~`w=MPii?tbb37^ZbWgXzC-ZS?e-nx3
z?O4(#BMYE4?03*t>XvL<o%#pr#48jM|33+N6Y0D>LVb*?>R7C*g2;D!WDWl2=IE&_
z76*<<KULiVM1I@Jk5vJ(a0?bHFGkY<-N+;KH{KbM=gq`LOGcTA)zg()Yd`jhd1<oI
ze2PCVFK%ANu`}+4yNqnJx-Gc6W%8Y*Dio%yC6W;^o2I`o<mJ=&=&Mj%Z@)`d*`Cm_
zQq&wSa1I5MMC}hu_AyU;Hrxe`w+?9JznTh&|1*VVbC=Mlz|~LKpwU`zkw$iXT@??d
ztT_LI$=8!$U|0VI?%%+`#&hauRIjL%0xg-yL!y>~WJSu3?j`LBj^Nm>(da@-!f@%<
zFj=&1e&p4<`zfVtADc4Os+qB6OVDmeZLx;m5|FT?q#^pdi$Ki8ZNfk&&e(=*V<-93
zaX$mXk@1$9^o-|>VV!ftza=z-1tg`)>YTSsAvTQ>E)2QD0`Sq;^X#28^Qg4xgQ{7d
z`#LsMoz&^?B$Rft@S&-mu`$eCQLnaTn#*1)EFBmauB}eKq!Ic|*<$?@>)h?!+2)ks
zs8EO@s7@94bGoZ~rwQJSQcWt-=dJ+Qa>z=@trSF`SKq7EBL_FbM)}n%#GuuEpYm;G
z8vtJNk^VAJEu}jm7spc*tY_lQ%w#H%OsZV0Q9J<3q0l`fcE5?4J=03Zf!H4mHQ&ao
zP{!$Z&X?PB@HK4P6zcRVv88FQsp9-PuR5rNN*7ix-Ny^|Xx&>$+A|B6Af#=>P#~C1
z9B7`fCu`KwGl<Z1-6pIRrrj_FAV_Nu?ddQe5AV%XX<7Nc)B;2+cGroyt~W(e^42f7
z<2L2+FZ688LQ3Do=*4A212sUBDIMmo4?0<;k|L%o*u2YW!zU2^$el`b>ytF~I5jir
zj-xh;e2J=<_JbWKkYB{p>*kwg&ahqJ>cT14S?>|MiK2g(aM)3}F+FQuO$#gevFzH7
zDxw|}JjvAc*Rgtql`~dI2p^?{WV4e8m`y4NmL{#^GjPM5kob7@&NUDVaS2x`HeR1J
z@N|A-1iYO1O@2vKFB}QT@(^BZ=HLAmdc~G`JGM3Q+@@hdrd{5pG$IN+Ums<h;hZhC
zdvD2wH&7Hhm2pOj55((5^k!1FO$!XLbYn68Bo=GTq&&L4bO}YyFg9?WWgQ)P44Xj(
z?o6FShi7r8JR;3(`c&FXbfbdNxng%WeqHufyvFWo3rgG2xg8BJhQrqV-W8Ic|I%c(
z<WFe>P&75)*PVNm>xzGbt;1l9SB93MC`nb)q~Cm3w(mu6cj)P>*2>u8%E&)IAEC~!
z3V_+#61w(+_-`^$7lTWs9U*Z*8VO5HdlMsaIthoEya#M<scgx%SPU_1$l08Dso}dB
zJ?RMLN6V5~4%41Wy33wyx+)`)BmYZrb=<<awUy8JYYASzzta2fv{lg?Wk6s51Q(I*
z03I2AUhQDb;@SQY?{oCnfnCW5^l!Izk53P%)v6I)^z>ex><?jh3#3pt-W3{%n|Xo`
zvRVgI_pg*n91r9q>aEx^Dvm%@b)F0-nc6sBWSbJQ-RUee3s~P#hqy)4Rf{}p)XVlZ
zPY}|tr1!)nX$dkTWBZ7$9EocqZmE$_!R(aT(n$}L<EF(iym~T?#BKxTmq8|vOhf?n
zqz6*^dfZQejanb54!p%A>rDR&`{>5))Jnm>e*=ZtPSSBHL+%YhfT_9j+i{#_0Np(5
zOs_-4tGcqv;6D{pCYU%s8jP)qH8P;|4lC2qD9Sf@6lIr^Y9PyqbkSmXUSQ+~<0H%J
za`-417iR8S%8J1ykmxjJR5nw*g6<+7V-4}DSmor=9lSkP!S(xU#6uL*q4jUa03FnQ
z$QmXqn|_s+h#q3_QjMcx6u*)YTjwVz!Xh5(+3CT<hu-mBtRuEEyBnLK0DW=F#uSW{
zsxtiS?3j2wJZ!e~+sHk1vY+47Z==zB@Cdn|ql#R=n?&A>kDr#h$McUnJm0hmzmvij
z(%gvh5p4`(k1NFh&yF2&9I+hHt9UtQM-6S?qF{$gU5k=g0PVn-w7x0wMmJfdsZv&5
zy(L-@T?&qgm^_G#{(By=lf%!`{w+7Zc!jx&TKay<7IJ%g%}-`_eJz!rTN8zG;h~`9
zj_*3Ea&Mb{JgNPKw4(mR;$W&wulhjg00=xA)#=p5*}aQ}74XoCX)QU_8e3K%BLV$V
z7x}^xs&zOkq@<xjI#sA1J7ZLa3wNa5jBYOKtj7@XBq?!@tjC`H6sNe$&rNHc$m;*E
z-YBuHXbHpOrx;9ZIGiYCl*;kFf`PNoiIpx4J}s8Lh#L~!fITw{J5S2*joTUYuU885
z-ql6F8EUlMC?vyRijPM`LF$aYrRo?-87^~AKX|4?i+?pb7D>juapXTwGE{w-C-Mp;
zdX5fLR;=$xGe)ALMz~qF<Cb;U93W15Ejq<Vd3<isUH2rhkTS)Lu;<st`1R2t<nNao
z52XUZ{gjXml`MY{`%Z=6!O?=}fnb5r!b&eKo$mhguF=Y39sWFnCOP*;Bp#~k^amj9
zigEy4Jx^i+?Au_^7C3u?rt2BKZd7X;&S=@=TUWazqPP;D4L!yLmG-{JTL-?4BPI&>
zJ0s)h%=J2_iat2&rG-H$Eq>3slhgyYNhte-R^@|hahKE4?9Ghpuv9mgKD-Bh7C9+D
zbKdu)%W~)zC#7TpfSdAwe4~MWM+eFgJtHrIk`LBPkZ~!UxXnd10!A~JEn-78QvrXi
zoYng(nHiPPf<g2xg=evN6P3baSz)tyr)K;ZBc<6$E94mkp}JV(@)E7Bwp!~8A6NW@
z{y$<%M#le&E!kNAmx9j7z|O$&U%4eCBRf08|EGc;+YG9Zqm4!zqYWV!08lu;cQdff
z+Aa+o%evAI;tp|hQyYk|#oBJ|Kn~)LH=dj6ZT{1D(Q{E*H@ne0tM{ppL{-5AksTBp
zh-9Em4u&RXrWf$18wx%kGcz_ZGZQs5>4A7`9P2F|B~%IbY!3ox^WjIB{sMr-$ty7u
zld~sdJlGbH3Beiw8ap5~IXyHwJrlEkVruHqUbr5ZUSMhr(*!EP9AqrOHZYDNrO1Gr
z9Xz2UbWu9ZA0Kduj0FG<50CDH{|3Miy8w7>Xbg?O{>TKd*>l{&$OKjaG&>+b&h8gA
zC~J0bd^|2aa(s9=bbf3k5%J1^PCyvm0gzJ@KqVkf0NlKQa?iaB0F)SeFMk9>kpd8(
zRv^wlQgy&gj!q0tpg+1F%LJ&|)yFYlEei-2fW8B;a={5el)K<sf5gcja}M~&l@$O@
zEbTYsGyU~efMAn<MvRQi0Gpdwn?0e1vmeF;7KB1-jFGE@YaTepM%Eu2OOrcD|0^~p
zR$xVJgdWTviXBJ-f*LqR@8eV5J&p{HfSX)gOg!QF7B15-+_S^PQCnHDJ{ERvWgPL?
z-Pec!ykLB?ri<|#vnrK#ZFuFdt_gE&W$DTtx(tDvj8!{<7leZLg+3Y`ablOrxd1sJ
zI5RUdIvf?C85}@YmL|gw{P)ZZ{HxgHoz|~nck(Zs4LF0hCEyt-6L9ZWp$7*RCorHK
z96~|*C_n0Ntb&FHKp6otc>v=aj!E=``x83j+!g&7lP7orwLtiLs0R(e$!_0o&XZod
zDO78V+vmR|${{m_WGSU|>HLS~3qLgiVhwd~pnn9|z~I;bte&CC5vW}cPVX02bR6QT
zjw<8#CAF0m7}(>7>g71?N4Ng5uT1{CZnyyO%bf=F4%#>n;Gz$*c5-UK=HbEc-M{P|
zKmC{A?KkehpYZK>g&44*^{2S>r{?F^BGyJ=#qM{Z?+*3gY0%g6ZW3(mr>+9*uFf?T
zJS&KR?YAn`jmc{r&`{g?@>hpwOcCe^ibWNOGgISBG_~)@st<h%%LG~lh&#xSp8^2v
zU*q$4zQ-mta(S|N|7~!TpK5P%;mcjhQ5(7b{Px=Dcn<`FlLMopush}r)DeJ3LvLjc
z<?JJT0Dw$PyM8emdasn1J^*tK@c5OdqXR$&t54J)VHTR{1KSZeBj#6(2Y@X3w_vx0
zDf0)o5g;SrH=r7Ttf_C`9^@lD4Y%Lq9)1ka;G_J7wC0(APg*a#k8o02Z_~d&y?gK9
zA>;NNc$Gtc7HYWXk23L)w7HLeN7{DCzZV_8$iFw~EARuTPv!gr{A&$Hh5#O(j(#>9
z*9~*F`!?$g4$=uEtAJ)UK!y)QV-2ijR~ZVai_t3nUQW@*nq-N=gNCC;=xz}K$)bAh
zXAP%52pO!4F`0d^lr9ua5|0-y`y4T_dytZS%Zm?Vq(au3t#~rJ`xJYO54HM?M2yVn
zgR*h&)BLLP+7e_NWS3qz)f(<lOnGdy+x{fcx$>Mw7Yj0NM}4c}IMM4xk!up65<T}!
zn^iW&IFm6zF6>}LAXYTY<tm!r+nqHyf#pq>7+ENM&lP1teK+?rfaS`4*sJuDxZDsN
z5F~(|kMV+JZ4xvgY(lRHW<OKhZqQ-B(-K)1Kyu0IyTAktc8F)Kg(^Y1)!NWC;%QPC
zYf8-xh;Wxz5ARJ~TULTN+8-!`*jBktfU{W<HVq}wy=q3*xZqT}V`-Kt(mckj`3jS<
zPZV3_nTvVx;47Nk2AoPuPOU$3eERxzm|<eM&YpJpY6gM@?-9RXACFO!BN{Hw0;9%Z
zMHD@i&eBYu%u<Vj-<|#}VLGn!4=FemCdVNVXIcbB3_{vP=Y+R6WxBf(E(9@n^p89{
zmCY#ZIW@M8W{g{pB2}spaPUtCB=27`X=ycH>SSCiQxP<KubO0c!`wX&PlsC};<QVO
z+m@SZ1?(K49y-+TSQGlxiWr6FP%jCVeT_TJC?-L;J?7*nL$LECh@_y-6`!i6=Hmjj
z{Z2F=_;yM_l@&8?S=(0pC7{YaGtuzL&@!TCLk!B8yt_X4!&yAN35l#<d*Gqdkm#nm
zd<=DdocME#Sm{0%m%X@LUro6_*NR!;Hlk5La40D3?>{g;b}XJv-$4|=!mWgUzW(>X
ziVJW9$*+YpYy#bmC9DeBW0L)(OaKV-yaWiGHH;7Q)_l-mRr=BRg+OyUIcjwtFBh8c
z*mc#h0<sR+t^I{E@1o70lp1P$H~j?iq70T;0eNCSWY9K6q?D*b*=%6CJ5@EoGlKbw
zax(uZYkBW0Ycn~PJ_e;iBx0bV9zRhGZNzkKs}bklN?U<(W!`xdu3}Kx=Q;ikDf-ey
zDyBqIw{9yDN27NE!)tbi2buRybc9r9Z+r1PVxja)*0#5b_aCrVUwv8I!l+6=w}EWR
z(tUbLu>qv?&*g|E+a1i7w`X;WBMVtvQb0gzj$`R-z|u#eCFBJWl?Wl-3{CFr-8PAC
zA<UIzPu|w;kV1;yjk}%x_t0Ma2dW&Z!Pcc!UXPo1vikG4c4!$KhFe|taPm_9pT<EH
zcurdqqkt330FPlb0OMYXu7UV<Sym1u1o6xpB={*x3g%e(`;<pS(?VISpDQ0*1B?Wt
zN5e$ihxIWK{F&v#pk`lCNjVVJ=Hg@K5ExnvWPP<O0x3w~9FBP-r^^}h=lM=vr33<B
z-S{UzQd2w0f(A?1$BJLwBOl=aPXV7Dl>*W}07U6n`R-=eS=@^K9yZlDEjY5;O0~`h
z28@UfUWI6$)!y(48chlSk7`NeBVMDgmSpfXb%yK7dFdhBKE>$cKUCDm{Nty&A=!o$
zggTjS{^Em?c*%kA=DjhZrQMn}v^9^R^27rQ^?^m)=vT3}!kwi{(7awAG$XhEd{~ib
zM_<ib@~us-9rKGFZ)Fu`C2Q%p>W1(|HQNLkfpq0Y<vu<uN#>5q=h7S|?}ndqM?&xt
zJzvM(1OslQ54<p8_fUcbip)s4YZ4V-he1E!m7>}a9Ut)rsomHbexo!Sl|FLYTKQYR
z7QdA;L?O;ipDigvX;*UD1Na_PopekyW5!f&>dSqt6+OXzK-C`l#~~t>h4>i2SXI{S
z9_oE{qbDSoo8Jif1>7TsBh>+DY>dl3K{FK6$$#0H6M7PCIruXDW0DL*TH|7#xXzu3
zwVNxh2v`a9X`EQ|x?2ww<~)m39i3&O$~lf$&A4ijfh<ZP;Kz3c481c@>8m}-omJ%$
zb%=L~YM@INUD6b0h2skj4k=!V!rjiCk=P}pVp!)Q4zf#MHN)L9{EzWxH^ZYmsxR*;
z>EFT@?8W0~^Kd;dmhWh}5M>~NcuAZ6j>v>AoXW~e9`<s`lgX5WApU3;%b{(Qd45lA
z&2F6S(oAy;<OJgoTx$-V(sY>?NuOVSnwI&ZeTkrr)9NhZg5aXgw^DtEm>MeR*D&_j
z^gZ@iXKEE60i-~EKht`nbsIMiSZRx4YH}_P6fl0D3_WBkg-r9lE=~Qt&Si7$qkH7J
zq-O__-U5@oOBzl~Gp;Q{!k_ehU>VcW$cbe7lXS3jAJQ$-e#jaX<<tkuW%~CqgD^9j
zpFpS1j)-f9ux<=#6G6Q1!D+eUirjPwja46Urc;-S9J3>&XYbGv&zoF~*U)N!S?re%
zhlYEA??<v;7x_;-^ELAKiEjMc?7z>kH!u+Fga?$LdV#VnXGgD%u5ja&xq(L`4*3h;
zH4?Qz{E(97#NOVJ+ubn5o6uv5x1xi>X(z-1nbQqOgI>NxhkiSAK^xo<uhKojwti`K
z+PQBH2RZP~Z(hdx2kJVlr8`uj>B8Z42L1V{#e;5knLtwLN+&Z?;B0j%A-wSiaTFX?
zh+sTEoNLOoLhx^Ne5>cM`;%>(q!ytM(bJEY8vrDw&T~!Mo<ZmfV<y>60|j)`RDYjD
zwcie)z6@>T>_Qwo5W<-2Yn{crzebOyYj&yQJoMqad*T7NBU6y5uB%muR<vSd-O|@?
zuCsRzTy*=8{PZtMLt*k1uhyTkfA}l6wX*8d$=2;EEKb-tPsUM}uatPfZ7-Zmtn?@N
zSrp^Yb(xM2=kbMCK7&5nzc3w9?Nhx+tRIf{Fl(>4`j+{AsYN(xteK1k0>_o?uGFPL
zf*qc%LJJi7Eh@jyOrK-Dtm&V7=SfjKG21rbpWA${lvu2WwinzRwqVts|IYL7s@~A^
z^6SKO63<DN#=fDPAzYXMNeHf16A|m=tv}U+QI3abw)8ekwIRdAJRr70&oDYYNnmO;
z9RWug6IVXyjc}|o+e4w+9ZS=fi^WW6-=3Pdv(Fj&*zd1E&8CK~7-Hvv+Bf8+X1JF6
zsB7EodYtAk=$m=2Humji>YOKhZ5W0DsRqpcKpap~uQmgux0Lnb8mnhjy5_H#Vd~HE
ztmE*4f-w14;<{Aa+^R*O&=?zsVCJ#iq*R`j1{bQYF$!?QnA{ItKta1y*W7CxnSF7z
zZ}iQ84ys!9a74pNHgC9kOh|*n-j>Lc^6pRj2GD9Vpe&Dmz+o};G+%g3_ZOU@70#x~
zC6w-!!=u?>iS*Gcj?C%19Cw;LTB9x*!y@3>OCE}{;7zpEebpztTj08^Y~O6j7vUk{
zw4#1%=y(5MvD>|V%ELkDR8Y3tK+(nw|21C5?@e-M_yG`K_P%X1S_4g$`8i^WokV=-
zsXce;QMnW;EyL$$JQ>n3c@ot;?&=fObv(B$niRv76%afWbn%=_G+ON@+&eEX*bphz
zd-xh#eUd}@h-j$ic-6fS^pyVh<Wmgxdis_!ERCHsNi5-Kwj)2qMy+vK@};E0dz=Fp
z(h1xIO+%dP5{#`Zv9lcLEeY7^3=~ouET|1pu7S5x_B+{QZ-W-ywYteRq!D%$=+b|N
zqGGv8rS95-+2DjUY0~_F32`XpfzkDKXDrg4tx|-UvYvMJF2&9jl9yPpDjF2#u<@d3
z3J_V%n;OLx`KNB#;0xZ+i97sgkKVoL2}goLrE|B5%JX036);DZga#(9*1hkFTSg7`
z%NN8tp^M`L5kG;L<M~Jt2W-+wQZBJI199=PC-HbcFO%nz#f<12+(8F2=%L!8a#Wfx
z9lSH|ns$#4`^>4t0P7~g#@hP!&gF%vkS`IkOBvxIkq3%eST#8a&9ys78moT8mqCl?
zufPoa35wupODz;d!|OsyRO2Dapm3r|T@6RIGq5uC8OMM+N$IfSZH0OO#_$r&6ta`Q
zeMWAK$TudJW&YldYB6xW$TM5*ft_c4JbW_)aicGF?^i!lF}OtYIaw>be8sK9ru1zF
zxe;5=M(r2x{eIjBL|^fxwvb56{KD7q7vp(W(J6s-Z78%~B%n!<%Hv*Uo6R0SLj+MG
z)`e^EqFD^U(ID!`M3P->@d9tw2$_CgvO7Hxr+Hb<>!xGF?Pcq~U>?(+4~?xAz_edk
z_td5zZg*fPYFWL*F!ZqzjY7*R9jCwa3s05Z2s1SJ$OHE*OM~7$YpI1_W#;6s^Ei{g
zF<6MoG7t3oB%}0?Fh0(i^=^gN{T|IXHVS7}bwkPdW6KX+P>`HjR0vnttt#UGV-`W0
zg910=!ix7r`SW4K#44MpMP_w;DO$5gP-G$`&=;B*$q0P*g|Jbomug-uNS~^e(A|Lg
zlknyJe*Qm<ol|gTQM;{U+a24s?WAMdw#|-h+qP}HW820TXZL@xPt~dVFZS(NwW?;-
zx_Q?e<9!A^+A5%g(5B%Rte4lrzgmR|{naVR(^%HGwAs55V%Y;?Nor6D{gDRP4Op9y
zBz#-vk{(ReUm`Wf@QvPOGQKy26?!D_98V)b*IoXK=-e_vfj=OAv+&Y)vL7n_BLPn3
zMGej@k*J2_qV6(?Apx7vKSV>Jr*;}08axw?$&%|!Z3*r%L$b2E+BBPfcPFUqO>GWA
zm3$s3ZIOSl4su#`lzXZqtgICctsEiEU}-v>=?*N;4r}Ak*}-SFZH1ziAgF}y#Ejmk
z#lu9MIjmd3a*CQ+J~<c}aa3omp{=Xq8YI5F1?XW<vk}7kZb6XU2NSebSow;GQhODF
zVi!y{#N*nF_2p_~K+i_on{tv?7#&qEn!te;^^OO>!u4-jPVK=YEtPa!7a!HsIm_93
za>HFGLgu3*rv--i6$~7sl{5(7<9yS}8s3Uew1f{c7Q1ScEX+e?tH_wL2}5GG_rqUO
z2M9v`tk}2Jq~-DF2I1{|IpEAt_pe<fk83iDo)oq7JZ6>#c2KWhjHS5Ux1P7(n$g_i
zUnI38>LFM3axooAjY(=%Pr3gQg7dcp_!tka@~H4KP_pmy_!g+UdZ%>8bZ>u?KWi52
zE8YF3<Iv>GkZ)KbjeCuu=AQvtF{v9*rD0gJ_#&LQL9C$GiKd<ih`)_^XInjX&J-@(
z`mj${hM)yp6Bw@2aCsVRUy%;><~~Dx_H!=ldNW+WT+)@z%d)J0DEmV4d$D~t-kkD?
zouD^<Tx9=^nx_IW46qZnpP=fT6O5C&SOWOA$+&|vw{rfZ<8qVK<Sm+*jB^)|S=rKG
zCF(j4MEotfyv%TYRDDgmVl4H+u5rls;_-bYjD^e(`Qpo@!52w_wR)3WZd@2S4*?1q
zGMZ;`J2zsAP~7-s3xypEgOGEs2iYSd?DiAtmGIlmx7mHF<8F9~b>=?i-@drESD?Hx
zbpaB-^v$Wc;pDiAnYIj}k^`tdS{7CTz84j?A*VpY)wxSWD`pIoMb_5!2AEvv#k>_B
zv-jTFqX~Z<aNmQPPMBy2)*Lv-<q+#{{+(?J=o+?N#UD8{s4p7c4y55Ysj4AG3B}dn
z?c$Yew|e8h9C@lH<!d4oQLPfe+au+59f8<sc>vVmK57sY<k+n8m=ZLPSj2~h;sS97
zV$EyF<06&`VUwLTUDVoT!<GQ?!mgte9Zv+!a(zt*kM;{1Xd>O&uk75vI!x*%WZbEX
zvfb=AAW9)A27~C?+7>vJ82@6KG)d<8<349p6qI;>%!cYuv(uKJRM}~MVGH?TrH)aa
zRCUPstx2fATXF9gHv|)*ivGR8ga@)MI-G!`g|Q4Yg$j<+2Zn0JL~10T?!^2G*&Zdl
zAbe<e^d-JAcdMjk+7VY4qdr4`<~PLv?J}s^>E!26*yFDxD2!ry2wjsmh5Me~+*Dlv
zJ0XCxC${bF28s1~*+N4qFpf=?Ac6TP!TAL|XGm*S(^PqnUc|NSq%UZO^AN?YW!mvN
z=AmTo(DwNy^$zLJ7IATZ*up^eIFn5-$M^RXZ|Ii$0x8+{rN_dCHa@H26421s5`?XR
z>sKwfIXW0WUrb~E{RBOdU1xt=j$_N?Vi*bFwBVnM^L$kd#vz`0F^uM$^!XZ0=r!{(
z=Rp%FVkvPxUsG8}b}bvB{_{#XFPJjBONYzd+R1pA7BI%UPZgm797~I1!vLDV^WweG
zKQ~77#57tgN@k&CrsXt<x)b;E-PPnVJth-vR-stknnrH$ekc8i9!ni2^pIbtp8EmJ
zt~!ld6+X0?WRL;dg<lb_U-%qj5I$CAY*hV8L55Ms(KJrzQyEuR!|g03U(*~&M<UXi
z&v>#af4UVY&i=x0@wig)yLkVsTHr!H&nVn0s(G<qso^UV54k6?a)e}eJVI3}wqkJ+
zipn9(X+HdgZlP?yOJ~O?L)P@vKIeoq$=yA2@~<{ZYQaKMl#GPKT||CL>+kAGl;vGj
z@)Wxf>Ot?KYWyrc-%ONNyaL^i08^CFPR>V7coItglOf7PNl_)9%s=-G5gC<#ux?-p
zcsaFasu`pfhZ`IQoq)c=r?58Y`<j6m5B&;naxNy`mp8A$+b!rU#}jaRON~PaU#i?m
zXfuZKu1^may5AD-Qc6|3Ugk$IVbGXQO77fSonp1|iC?rtyi&oS^`~>2MKSOYiUwmr
z>E{G(Ux!X{Tihy<p-giMU0c>)x+(qYd3kFEQNj39s1V&3u-EqNgX|)ARm^|6pZWQa
za`?m-)BuX;YE@ib`NuvYLke2O7NLS=g_qjF6WBV`6@y|C>!qsEY{Qm*62xI6H^$|^
zG%=3xRD^yvxm}6QN*?tnNRCTq5!;Jjr;5b*{Y9wrA&N7mx==P)`O~8SRHJc~qt*x<
zI)_G(+}sdw#*jZNrIIx7k$_)9;JDvUA?&1C>yQ|I9^BOfj6Rj_LZi0N8fZ&R?Ekfq
z!Uuv5fc9gVp8pcf#Br9{PiY6#4vZ2@m-?t?fxjmyJ}DQUZF9}CY_dPrnMfL2S-eqO
zr>j^SLUbCu9!q$1vqre4s;sTt{?R-~`}~bK!Jb_}%9$|2VC?G0TzDESXGuf(8i9;r
z?{=N2v3Dqb<e6xYGkF8!AREf!q%c*xyDtYlPXzI{)WFd-1BHHAJ7_K%6E&TEW|81y
z8__39PhrOB(;qDf6%+UN%op06A3o4@q$H-h6NtK=46?-h&^cX#^2&axEq27jMpi_0
zxV&y%7R!ky@~IEXPn6-U{=CpiyNLnhq78^3%a<OFlRs*0W7p=aid<%thZTCI*QJj{
z(hB*;VWpu|PpXejHh=Cum&<jkp!dG9S{e9cl5N%RC^9#9=4Y|Q?D&rEt*n4@0re18
zIjb>b>f}T9!uvIfZOv8O0aFF;2HP&aO)=eIwm`SCK+`&-OnG3GQ2y)|?p=t`-B&pm
z!PHh3m&~;H`q-Lp^y0uS&dl12G}ycU;(__^_lAA<wLo$GJi>uRq>NeCy9Nz*sga>&
zM;TTvBge!*A{kK~hm+ku2y$nm7xfW6oEIjNQynviX5d;>c^|Hqep)D5ui&x;Obl(j
z?Z9SQj9J|GZctk}F!OoFpqGNrqzKi}Ouf5Ff6BdzZy0&Ab+fZ6NbJ!~AuLKIORVXJ
zJ1N}rfZ$SZ?j?1Et3W^2j}4zu1@f@o9flO10l~zX%MHjQGlpZB-xK9sL%r|ZAVfIJ
zn4+t7Clq3~l=Z4_H%To$|Fpd_8K)r;(_dnS#Y!<>iP{sN@<;Cw<*j;@YiMPiKNeQM
z<T<hm^{{+xWmFE8q>+4f|E~5-n-V~(nt;ygxDu(EmR*@Fd(Qfbc^8pWTY~pZvr2#U
z;Q;jZ81fwAp5L|oODgnfkK#L)Npzzp(7B5IrVK~uXj2daq4#h3%XZ0=3a>ZlV{1_q
zT8|xHM0z368J8o%`Cj#Ej)d&;pHv7#8HZh!qd0alT<x57Qmq;;YF8%YQ`{0)GBItK
z0?cb18FxqCy}C(WW=oDY>?*<~-$8E6%w<q)BMaLZond4Lu~vNSnE0&u(uJpCoZ6++
z%{CR>>IKU8y~Rd*E3%7*K}knPM9)z=Ei!0%f{e?>KHL!vE{8nt`12mNbrfpiSNsJI
zqGy?CXr6dOc)v7qn;9~d<m2>4yyDi`JY50#;qQ`)wTcK?KMjc_TDmwRo@LA-bZ7>+
z`$7#ld!ptsB9j(3HnTQDf6D7e)1MT)pROsV5t$ZGxvIQJrtioGL%^AfDJ-wamrQLB
zOs}qX4wg{Q=LWJTpad4D8l<ESza{q_cg52Bd<V3n?^fA}?D*Yj0QLsE5YdaEQ_usK
zn59{5=?;GflQM(6Q#R2>;CWdGlKFv$z?}S;TbSSc)Z-jF)SCsN1UGaqm5+OserumW
zlbNmBAj|t(cse3rSM%w(p<c?9k=cCx3t)iwkpgOA){?hZ*%GdMt-Cq>XmT|HFZb4*
z7CQl6v)R1=#3=U|%xZu{_b#<%5P{@18_@92h(!F2Fd=dUO{lb@!?Wdb<q$dFsjB7s
zx8UfRMvuxIBnPRGE3b=XTw|yccewf{Qf=5K7_)1YC5=J6q#K|P>8B@sudyX1>hXJw
zJH4)Wn;&G7gI?;>?c@l`@`EU2A?C;dbhg|;Mg&Xdsqi+csE*w}V)NSl^eZpkQ--O)
zjE;z_8@v0dltFDsLN4XDp@NpVpqpW&Q{$Mzl-E0*71zYW(eirVUMw|2qa>3bRcz|t
zrQnF|;Ihl!<$l7_Ee@dqN&d+*A8?Xfy*qJ{M049)s?hH|VLDOhD=RL2UW8hCI_|J7
z#gDbX(qO0NmjdF_CMj8Ls}IgMp8z#|2b7yx2ySGQ<C{E*E<gv`6Bf3ES!Q5@`arN)
zJh+T}=>9sSAHy8_s@eH%7l}euRbvMZF2STfyl>fKg;nM)AtJVGCVkN_**{~t?8A@h
zu%o#1AKl_qAE{Q1Tk>#TNIdHbKWfAtcpTIq0sVR{Yn;(}csN)jA$tq`S!Y3FZSz{%
zGOrkd_^`CH0!2ua0VYkGy$FRjnT>obuPSL|MO0Y|M3NI)C^bElCAQScyUi{swfMv(
zfD6H<>v_8!36<f=WZ0>1YNn?r<Zg<S(G9gGmoH^waP2_<s}>d&KoC9eL~&`Q&{2rl
z?WNxq3E1|zaPu$mRgyCNk%zkBs5nSfvEHU^!JXkV__wU}8yJeSkZ;gF<zyS1(w!mZ
z?2l%%m#CgFy$ZY*E;#Sa9qShn&yfDGH_tWs2wYl8-N6@PO|l9}waMeG8%AZ09aiXS
zg4><xltFy{doILxQbxGs-#Mejp9ik>G1_)!816@y@Iq-}cH*Ay46<>~8hDh;2^d)Z
z06$$nx?z5y25f2{HD>)vkK~hbYB0bf-lOzG9sbG7LN+?z?$)2%#mh)m=KICTFHz15
zch|MN)`8u4i0PYD+lPZVzXsYEc?)NvwV8Nt{-gj_r+ZQLO)MYgkg0RcM@}m09gUxG
z>hy_4p(JliHB>pVZ*~oZP-%t8$XmW83Rf}~9y-9&KbYic&OKrfTZ7p!TvCRW`Fa^&
z1xxK8Niav8x*W53_QVsYqN|>IC{Pna-MCQHm`>ql0?Z;Y721qa>!6qqqg=E}niKi8
zs@x{k8938w5gAlwhCyzx^M7;I_>rO&Yp^KdlLGM;A!z6dGLK|bUN;aQqe{^Ao00OH
zFUNg44~*A@p@6Q4QtC@cM8Q40OIaSe;t8DpeR9IPSeGz^vh=^8c<yUHBM$$_Zq%TX
zqUeM!w^a1VYLoTcADtrt+4ak86BLx>0Q0zwWgLezdTz5?WRX^nM&QhjhNSw2`=d6y
zVRAW<iD!KUMw{Lw?wsPGKQQSg*$pLIA8`)ie~c%je}~Jv|F!pg;9CGw=heZ#ka#e-
zNv6o-Qb8qA&iO-0CPHtII~7%u;O8V(>&v2q%W-FBK<m%vRXynDHaqM*KHL>zz%qY6
zHSty(^XUWWE-$yJa17JJ_JPsco3|vnShvsGrD2v4en+`tuG0c4jwl9yq6{8wa?{P=
z7B_uZlJs`~h2Q41u*>fT&s(c6(rh1vR=6!qk~e~gdGb_ya1dfc-f^&^^~{p(Ae6v8
zywb=`rAFVfUHL2&8FalZH=g;-BfsdFFaK7BUNcp>utC5wz!)d+<Q04%I+Nqdl6EeU
zU(!&h=(||7=R(YEDjlZYwIyhK_OP<JCIfiU!%{)$7$OR~pfbpZ8d1xh@O;kzq0o&x
z>wz0|d{9w!PKa5E#N~*ctU{<@2;WkTudZQD+ln}Jh6`BMHuAT<9-f!elm~gGRfzh@
zYVlk=F~LP`CKeVivhMPMJWOcfE3rq5bJyB2wXgiDX_`a|lz{tLbMA6H<jlqcuUin9
zn+L8T$#^i0rnE1I<%)h9dxb<UWyowLi8SW`28Ebu>ZNM}hi?&0Ju*Y7*1!P3`61qn
z;9ub??J%&XbAfHr6v}|07o2Mz-?9Os?a31*?EE`Cn<)p1?2Zzwia&@6&FNSeW%ay<
zag^hbpJmQsqDB--7=1;-Ko7`x*N)F3tU7h25DT=sj*@f-^n#(59_rUZen4t^N+e~a
z*UiE|PJIWe@`=UXi0rkC2VdtegWTufAv6px6Y~@6bY?VVbBj5MXgpfBc5&GtHVRH-
z-{l%@^p&3{U1Nc_jQwlT%x)V`mCYKoU!Kf~-3fS^eu}pUxq)6iL)uBL_jijOm(OZ=
zfCf#zs$YP!g~3n{8@r-8X4aIhOpP`+X*DyaQV^^UEAnA@rE;89l>OG#L%uxzsD0C-
zEjO2!W&WE{*BP&nC4v-b2QuLbInEc_(@Vcwlr`s&x0AF<29Z0YmGbaJh9e2b5_v(I
zsSFQ8&)ub#*?^w0bqoEWn0=LnR`i~ZYq{)g(l=J$T1?|Nh3>xCXkmTO4UDgS{z6l;
zooe)Vp*UJqPRu|X&PiR6vij+ag0DpN{vC5mz<W{LWu;@VhcWPOtbZ3AEdq*9MW>yf
zQVq5H$53FOX3vApQ7VwTd${~I`HhfP@|%^ew<*GK5A&T7t_Y2B0YV9d-dFlaaUTF=
zQVP(kx^V{8$ST?%z+_u*gjQpL(T`!oNiIo)D$Pl#d4$trcw5WDUOzM6X!$21$x!hS
z{9i)dDh_M;f<Lt<VgPbU!nGgUYWnqRnxAR8HL*3Skx4YdZ&24^zFaIJ5*>A=`I&@@
z5}{0nR_e50Up=^EzqIr&^el|3!=ggg(Cg3w5PZ<MijVW*R}!b(+fi(f4#z^TCog7J
zchI)8VsH>zP|#?>3NpPVMcXi$Oz{j2>=A`>(SSd_wtiyHn^fb-gSU5yz7Z^6-Hx!;
z5XL(s6rNmYqFBPM0oz7|wHqS;h~7d4S5VK={`F_b&8fe)vq_1U<f@W%q-%=KT(i%M
zX9UvX0r=0xdUObiXwr~+=Kv~#&*<7rNrte-e6F5o7wpo+#|Nu7nVam36G0)n-Kf<g
z<u<9;{IQQl0&%a`ZK`?9eS=(8&?|4#arIOUarTVjGY>!P4vyrY9j=9fb<V;OA9Eel
zZwq+5(xDW}b)dF&L~TAQKk!Fn7mi9HGGr&PkQoYQ7IHEK%b7r#8m7kMbz?LLi@!0U
zkMD~XR*(-Wa#Qk}WVw~3&u(t;T=tm4$ZyM+Vo{}@sb{-}O+5o=ut-XAH;SU8?R9&u
zub(4qyjRO@ZQL|>tE4EHM&24_p@jwe<{VF;L&HH)zEuH*1*yW!d)4YBgMQzuVNW#@
zA#1>oWPdx<>Bhu8cqc`Y9IHftt717^@-~oh#+ffB8G}>j!w5z{gc=k(SiB~fy;NZ8
zOEPb1tJH(FBWCdwRjWyjCS}sR{tDFf99P(4=uqu@5o9beLJ#|Ii#9ZmHMk_VuY9=)
zl2;;%&7R(f9BB5z(p7s+XKj!_Bqf;oz(D3qJym8VcN@8N>JIsw*9|6pFik}iar@A>
z#B*2&<lK0)G@9ICr)rPCw02pVu&VU8J$;{19KD5qpj>2}4`&7va1uO7Pju}2%n0fO
zRN64^s;?lVk!jZ4y!O8mm=>TmP3L0(p-SBs+iWZQL0@m9<bYyeD|>1ID~(KDY+QGL
z<PqsGL35$C5&n&T6)_eCv6+Tk#}szpNAjRgo@xwJ(qW^&fCW->n!l3fz8=e(dvo24
zFih?Fsv2DGJdr|-(oK;peR-38a|D(PaF81gFR_cR=yvlotSa81F?K+-N5%PPMrC8J
zsjHTJWVAtZuUNPf+|a(b=<8ux;z02>9GwMYm8=MMj^EB%<QAM=_8=xUN0yVO)!^RM
zyFjAgn&e?vGPm7tXtHE-g#t5!-F|Tc*Ye2iaSaHH>t<@fgFn{wZZHSD!cG`@77WlA
z17j^)@`4|E2&eQHnz<mSO4y7kE{noX;Lxl)gEV{^+U4KM%kwOpfw*i}A0)SF>Wn)J
ztU9Z58#y99f(4J)3Pse75!CZo-O}4ln>4$I&_2a_jZy9B=2K^!&(kD9Gn#Cmok%aS
zC|8nQTJoNq%(*<iw8-?YEnzt55cQfnGF1g$c&)-Ijn7~9gnzcjTTcbJG;S?vd&Qt+
zQ+7U|%Z^$r=#8*K4e`BgnIw}3fUj1N<1CO2E1#w7_Uqdoew{<j=+adKQe((3SG%Mo
zEr%jX{0xNj>SInzg*jCFifu~&%DzQZdHn9?7lz~F7`sWcrZXGI$jfLH<TWSltQQ@2
z8LRm6^)}6E3p`pyEFGv<I3ruK-kmV-)@H&H@P_F|Y`nGQE>2&h4}xZWFbV9xy|B;N
z-{^foGmwQvu@UuC&fJdsWAx1KiXf@@YjeweR*LTepm9eNU#`)2{}n-eZb&91ZFp0l
z7;o(h+!dYPiK~WoacE+$r6SCQuo<thoZ>5eq|qVZr4nBdUpN0ehqx)!o)Doo_gN~e
zPPHhKWl|m&0-hL?h^-2mPwZdeuH7?os-AL#NIPyRJ=NGkkia^J9f;IvZ*JP!*o3Y5
zr%OZ>w*mSqDMGo16cbFiTFY72No)^S;@P_Iy-v_r8WDsNYO_LvvPW4G%}8Q!nlR4e
zFR#DyxCt1<eyE$CWf}5M#6flv)lwS7{3Ubf8Q4V_vh9H&N-zP^<bpH%fgucW&!HVe
z6`{Oh9Y-W=liVUvH6^+oOBR2OjbG`F0KC3wSTheKZK*2DG>B-?ErtE8pMxCTWz(@)
zcNo+mL+t@i*dLuw8<PANX>kp|yQ~k8#lhRk%ic3s{`|=9EwEZx|4!6MMw`uxM}08L
zj8VUomgO+DC-)d*s|f8gr2UNzA}ZK=Z){Ke!PZ$$Yc;lIBjtg036+)icTPG`=^Z1)
z<M@eh_O!tK0$M8Nxc1VNA##YybPs|GE>utVsmIAdol}{+)|7agPQg~`7U^D>8(urM
z%4gyV0oP!+P3H1_xn?Y2Lr(13&Z3}0A&Qvv&FP7_N$j1|+A`-+d&t;a)WeRpkL7$5
zjkbabfG`2F@+Y%sYAC^k68nLpOJaGI(c5LUPr5I61DUN9(zO)TaHTqL2C@c7vKAC8
z0kwq8pJ1IpzWtsfDT$-U37xmKa;Vk!E`<kN&AQ*o=w8Kc0Gd##OLh_?yoysxB>b1>
z7+!wUn7uai`O^vh#iegB8!-Hd%d%ufFH{I>LOdmaiENF@Q#dg^I2%7%w8JS(Q7k2b
z%r*od-^+fiHb+C-N`z^Ud=@W0?7lfU<sZhWnkzl3sIWn2>0Mw)ERyoFArW$rtV*m1
zkVAqH|5CU`Hskt>56SQHcV<Ejk}{Awlc4nlno<xM#ZoMQ1wYGb`PVLGQyhc{L2t>M
z7y$_|D=);WxdI8rw-WiINm(*Y9)Eb#9N`6S9rs6uR87E0yk&yheJnxP>b;y(@VNN2
zhXc!tRw*W#C73gQni=FiC+4W~uU&Pt<DS>|WvjcHmMar_47tv~ZC5PX2;KboMM6hA
zIi=CJFPxi>s_e$hze2G2S1-#Yjm{>X2?{LiZCwTaG%(k~U}Rl)kw(i#5lv&Ewu|Q;
zo(Rf!>^8k!p<98J^-kyOP%ij{D<nQ#tJ(LGg=qPiVcPP#n6m#(B((4bLNLvwNRzqh
zd5aEK+W1Lkkn_MrU5qTw{ZXxGoT)#!qu6${uuGqOlv1s&@aj=y{99lF&L%-TfVE7m
z78_7qfSk=+wwqJf1Mq2FUnRxaY>lVVk@^XQ^dL<h;Jx679GC@Tvbycnd2QcXdGTR;
zncff;+r>$<|BdR`MN#WOP}sX#kEoue0jl=QuaKw<&QPr|&ncYwB%!_M9Dj-j^oFyn
zMvDW=FIy0eg(tc-ZyOtV>@Zy($<(}TIMwn8!&P4DsQi?XQzS-S5Q@O@kcQ|W_T~rl
zwCzOizeUdfv9Ad2jjUjJdH*+6&P4c+l=c5I=FEibj9kqB`|STCWihg`{+~%%9+0d$
z*Bh;bT2I)%;d<ubJKnc^olIDxaAq!rt7knSNIhVRg;DsTaTr3$gwn)N#H72V_B+nA
z-rxQ;x7tlBxnElV*S6D+TD~TBo~T~rz95o8;KIm&qE{ghL8*Ym*aUDWC?Jp!@Bl#~
z5H~ktN*IW@O}TzMn0sMiWQU0#K}t`dD@BW}Mm`w$ze4@MnLCU?l2||}DPR#&Ab~(c
zgbD}tgo83D`8Kzpu3%?SK&;3PP>BJ$(EIzh;I3{$1(%<`uzMiRpn@nUMm~K*z%VyR
z43um52=fgR9fDg6=mRf|0mvY5A^D#_2|+R&;2{t3XlPH*&*=5;5-^0_*`^(DK)njd
zu>D9ue>~m<ae@29A<j0sM82cR1^W>g-2#b!oUn+p6?$LvkbpLTf`f=0NV$h`ZlLZ#
z@~c3jS(|~q@R45i4X*oud;$crK!KnGzEf`GpXx*vUT+P&8L{?n3=siggE_!*3RqzI
zWtDUR4<h%#SNpMj0WXZCAb9q-#)u*7Jo&(V+HH{K)L1}Q3#i{2h|n)VUitALl9X4g
z(LsHS`E8ouH|2jE+{5}6C4=<8s6=`Q4W4>GV86L^I5-C}@m~Rx&@k>U?`)w(ZDIM)
zxEJT}3ku)CLRnDXw$7pXK*WO3ii*fcKnKtPuYtN?{^*P^fPhc8Z}uW{D1;|L51{OM
zW5J*TIix2{A;QHSNDx6!Pmv(dpQZabbYLhjhd)7zK#<`qXmWSAR~9V8=XGrFpFR10
zKr)1xeuO}GtEc+zD;A+##CwcC{zLu*4f&xVk*$RYw|NOa$0{nKufQO0A*4W`D20MR
zP+%zF;Smu)K|dK1yZG;AaX;b90X#%NDE=)`J7s;^FK<J@wE`gf5T7h*^dK`jPyv^_
zqHQ3NK>udsvmaT&F42!b>d)juAIeuBkJ5AKfZs>QH^`@epSL^Z^bg{{H|){0z`3EC
zG4_7o*@8dGbn(JT{%(Ht^<YzaH)Esi&02^*2H(H}-Ts({5vvyXAxZdB!dyLIT7NfY
zeJ<j_!GxWW#Lw%?W4WOH`?UPc<NbDLWl$);XLjkKv_yWYt3V)0aQ!2GONycy+#Z|W
z$_MaUKS_fjK?zqaA|C*<rh$ZjIYB}Yfb-4aAUKJ-q5SY@CBX>K0(MAP2Nqs-$q5DL
z@n8Vr-|U}7SZkY8ur=Mg)q?I1fcLg(A|wH*bOTRd;M7PLU;K5~^?bqGsUJfSbKfEg
z`Vk{aHL#I}SJHVg91eNg73GE5hMOCY)^8=%r)gm%zPYj~DS@iqp!yctXJWL_$@$a+
zCja}hwk3XZs3el0Sx;$N9=oV3=SpCbh#az3GV{*$LDyuBzPp>IoW(5sqZ`l&&;XwN
z&+KHfDEyRig*E4ZxACA5TTnJLL$OTJ8`F$K+iF8**Wfp(OqYVS6v2-f|0!lFcN^Dd
z)qy*O);p<)6~P`0T~=^9(*SareUA+&I#sK{6IfD+u)^^UB~>#R8ruwS)-mkVoV5)=
zN8<kMUu45u40GL*dLA!C{WdQSB2f$zn2%LCESt8+m_BHfZCjZr=Y8vOGi8%H_hC+g
zsW%-4I2!E!QZtY}*5~TazZoJbDta0g#=W+``+c#9Y?@en0gLoZ4CtgLIaHvi1fD-C
ziYf%7M@%;+FE3i$sDeUcas_pPB~u5T`+R<J@_Uy{L>4hz&fK3ib=Rt^8vfHvLD#4x
z%QhO3p6)vXdwv(N@ClC`CZ)X8h2`QkVxo0)?oNgeI^l+jM6G`2ahZQXJtImiS4@-*
z6OD`;#f-0Yqj7b8U?(U;=DC!NVA|wWqvv*3B76OaQFq9bsPJKY+L?WQWY+f>GnySQ
zV}*X&Hrc5V^u~gOJ=nFx_z-ojs9m_&6amWlHIP)R-jNthhGRys)?$$Yvcfi0)C5}S
zTx5Ro@15Q&4;|w=1ynD<wDd*p>?Tt$=hmY)kV8^%TnuH1keysC?q7ekYiAqcsBlOB
zl1gZhOc}7%Oc3KqR}HB+lBW*6Z0MTXdgy)C<!H_IA_vhj6yMl~d9GcxocX=H>Rnfq
z!x2*K>qI6Z?Nly7AIC!tlSi|`E0Vuc%gLDtY@^UO17Y?%I9iddg-%%Zl+bh4n|S}l
zkY8~rIdSyi@2{6$SQsZP=RyJM?WcxSNB_AgV)(r2$?wQLqwxn9wLdHigX~%{%YB;M
z=f37_zyPe$$Q5mlOVcKv>Zhe&R^eLjLfNjvwCq+`*9n)KL!bm$e41HONdUOKySgod
zxsgTFPSwpir=vqXsee%%OLSaMIH#NMaxu3$8BA9SRMZGJPcXvk3eKggz~c2Lul@#q
z9PJNJrmq1$Hl_K}@koH<mwOC{(krXz0_TR5nEpNRuW<u{aZZc&vWz<mX=nrQ(h6{9
zyT~ygDOqFHv#?Hz5yJ!h4@2y~+w-v;e-%b&H7iTq26#@(Mz;5?^<JjTT}4N8c9+dX
z1B0;j{jx%`VfYkkK?zM+cc#7x)0K(S=8lq9=1?xbs@qJqGV-+UWd915tT2vd9z<J6
z?m1Xe^hhUP-Ax{#O;MbuWcij$WpMJSDl8p~Y&p@kHp8EZ-e36FlUXud!h8h+YKjS>
zb-?AR-8+bUaSxJc$KiA#3Q4h68#G$d3vcGCTzl(;FV;~sTJ9BqgZV1VIe6<0qx@;H
zR<MvB(JP*$oWEkS43<bAdAIaO%vb$BVXr`5{~_7b@dH3s%5Lk{WAqlR^BjKW;&jgD
zJ4-rK_HSO{uXywsvYDx-Cr9UYGXD+fgmaG13!7lXKODu%O!H1?a+iuN)#+1Vml;0O
z;9!=0A4cw27Ha{N(<kI9E82zcZo;BSr(k1eo|?l6BcK#h|3p2*xJNZ|Ua>URpKgi6
zY?|h7zPL#i*wK*{nQ{05JD|=GmIj+3ESD`^_HCU7-%2ufk~^UtoH4wFv+rV*n~mJe
z)7ETMciVM7F^~IIo}kYNT&&s~d|z`xqJm$uaMf<uJ8?{eG4wdx=ra}M?BV!q<YZ|-
z3$yUcu4()wh-820Jc2EQla|Hv1H3VZgt<|k(bRb<lqYWFb;zKcZ-MGW{JQM;ycGVT
z-i~C&sN$$++S(omu80!^JRwO(QS4V^3JSribnQKcp01tKp$ew;-)S-QkQTyOFn>u0
zgRAMga-Rhqj9ZdWUdsELEb98NVn`ns(<;xKFCPQ81UpsEQFBbUqqd8<u@Io>ml61F
zrHi|3#FkR~HVO%1uj{IZ>baMrlQ$@)I5}K}k@_cGOr?dtd0q|tU#;kzp#=IIQvX=A
zHuX<&8gRVycOOb;3>!V744v=AlbQG?*Ut#{AGAzT?a1#*WQuL&WpCb+3siCRcEF3e
zmT`jMONnEl2`epCZwSCv(oWS^`$F-{%=)Q4qt(z0!}rW0Uwo}OnAeE{UAqo(ZWI+;
z+8Z>^N7Z<*^D=Y0JJPSxP$KbuQ2pOzRGelVY5a!gc<==u9x7kK)|~?=wnq0AY35TA
zd-qGJRA9%<X0|@PtzPR{2sQ5JWi=sNT>6fDu%4Le{TSaFBB(j0VsC9wls2w<6kBWe
zQylvs6Tcnp&ba1aO0mo4suaXiib_ahovLC^RMyaRkTH-IgE8$o&FC-~;#AU#0cgQl
zjr^T#HE?^iIQWh|IeCr9T1FJ$M$|gHxSbMiMx?TdK7YVFBnVIR@YJ@;*k0#_R53NL
ze$t64`QB;}S>DWd!l+8bWP^WE)9n>=%%wFfx`ZNPfM3r3sz6kbQPfzyi0?i#^({Gx
z<L}IK(_9t}hMq!<;NQnU*J=xhM7L1VBR9E&xMp{-ZOfYV*NjuIst$<=vF2LHQiQ1X
zL|@0B@KHC0KdSB(z_+ahr98dp;fY_z`pRGzywg>_bn35u=?@;yf8jjVmK_4TN%h(S
zsmAhZ9iHQ3>9*uhN81elJs4r{*~r(mQeK<2xV;n~@WQ58wvVJ^iXQrmPvRzvR(yBl
zoslPuuRL-pd%%a&Z);<6&!Arx+A{J;nNV06J`bGRw-FpIAuya_11)u$*K>Mk4_MN@
z-!I7DVb&bWtNkAJj4%YHE4?A%S;uM4MX$?A8MRQBR~BICxf<^xLw4wT40fzu)C%7t
zyfBowP>_4Nh5;j)Q*0F-tY7`xJz8Y+$GT@CVTCIs&)P8zh@W6~n5+)8+;IO5a}YSj
zC%y5-JQz}A&=9lc{nKGsb5)9??5SA{z>V<d2Z_`}DqDdRBelPX*ok42=|qN#n2Kgz
zt3oUF8ZwpIFMwsrg?3I^6moRScJ-CxvvYSSmVA=@0*T^aLPV<<Vzw#*ADovE2j;*b
zFywV@Ea?j}=Fdi{BjTLiS9h-qMd6=yc@)hiWqg?W)XfqXwRL_L4`5TMg3T8XPyXa#
z*3hUZ*&(!hOvX6LQKR%6kI^sFu!7<CSE!=TE#zWVl>;^9NA4Y0w&GH-ID7=S{0cSi
z(e{C>UjX8_{@%&yJrZxhqb=Q;(`%WN5*M<sK}vZ4J%c%A;HwUAN0HQXfb=ht<lBmF
zX!*yxa`oeiiqDPq)WgSh8T(mB6ncn0Woh=PV^ZV+WqE%K`nMKyb+=*~`9yQ0-&qUL
z&cq2;g2XXH{4=VNX-x5zs93>sd|zrrGoJZEQRV{EI#mSDBh4u+25$rB*5IRUTd#NW
zr^@b`Cox^j;}A~DYRwd@5p0P3c|OgGp=vuCsRS~_B?Nues2ApM!X0KP&gjW;39g8z
zS>cvPflJX+pS@*%8h0blHu2MQe|VpMGW?Kx2)}@{`Al+$(_l)A_pTAodBLK)XYpYQ
zeBgb2nT2ZEgo#b0i}sD)^iQGx&6&$>CJapRp-?_(DmBGr1hxc_sU`(*u<YCiOyC;7
ze2D(gyEOL<zZb|8Zo=N+Q{=H4Bh5U($7E?53fRU0(9J~t(6Gao^S@9tXXNsk@T4kG
zo#)FrrVx3U&_R~3d*hyYckQH#ioO=gJ|{iu*e`vJMRs^^zJ<Z0upQxS=gyVIj!C7j
z>etR}*$>2+M^gRH_y+STy>$V=`(0D*1}!KgoUN;^+J;i-m7u3qRQd9|-9mS1VfRri
zW<Q6%>XtWr(H6$hZswst(c9&9KXM<6k<D~f;4epP!8wQ+>shr=Z+G%jU}S1f^B!(5
zgK!3Q^>PL~h92PQJWNf+J%EJw+ipLAcH&~+tcO&|o6czJb(jnHMo-8OmPgF^HO^*I
zSKR9IWB4D6v*dYcZ~Qb0u4aw%gSz)sH+oCv`@FJ{OSg5{Fk+BDWjD|K78>FX%@RLN
zBrRSpH#sd6TVd`Fq31=0q~P$(ElM0Ck8mVSdBmoT6KeDXWFC%K#6P_sDOkRUAuhpf
zD}uhweH~lvz%e@NT2#5*i}=d{M2cN%C&n0|5ivILr(uF?+w|MGrd%JFGX?CoW)sLp
zaVxVu&aJj(5d_fL)0Sxw;<eTIVNw=)qC1zbfhde*;hu^e>-Q2(bumuYz5lXs@2j0N
z_(ZHl_YHeMLh;2Y?_N+ytG#U7^flANlU<d{7jQfHpp++yv#GJ)jdR#!xRIpE2E<Id
z7_WvPs5;>9jh>v0n)&|Z=fZqoUHw(_QI+4Q_+y(&=FjZ+uKRlL*$T-ro&PP>IUr|;
z+d3ppmXbeqUX!{+0XKS{%U8*Au+}PYf<C_JwGW8~VejCd+HOq-?gS<&H3z^r_|uVR
zqbWS1C$GpsfX4eZI3ePDXo+v-1M3%*SehsAz=J%TRE6SHc1(|(=frJYCos9SM%(e!
zH`bzRKlaUDpPAbnR5BG%A&4{{r~|MTaNba@-ml34cs*&Fel?L<ozyhtVu%zDD7VtI
zo-!x9+zw&F9=+flhYV~Lul&oMXbyio!aZVL@p2Dbz=67S5KO_8B;)4U9c|%1Kb)1?
z0x5Rxpj9L;B)p6U6~#xFPm{3CM*SwMszyMxyW+la&L#kFo%S>#+lqPAxmJHOrE_<2
z;fB)6B#z(>^X1gK9HUQO5rDchYPJ#(WPiiH^oA@|BI)8T#ioCTCAfbOsI8)A_e|a{
ze_uXQ%4<=!X6DXpE45xJgd`Rxf~?-3<Q)s<UR*l0<dEU&+LwMxaMrZAD<kc{%Juys
zHRX_R=_+E3DWhNiyqX9N;VuHD>@jUp_9d;K;V>GWA2lM6OHGg4gU+%#&Z2caK1NmM
z=88kr`N_C)lm23JQ_YyY`%W+%!ODI-el%jMA@fZu4eOjqwOzwDZvAK|koFiG{R?c}
zB=_3&y6CL=3wqVC?dqn;KSfm#HZxn71E<QyZ6NfOlXSn`UZk2@WP;r_WGh?xN*;M9
z(`YbGL=uoC@5BD$Jty3(HVp#na<cO07$XU_%0;faPbzakS~2mBu}n1KWQ%<_xf8Eq
zJUf&?-B2!pHovcch)jLhNCz7hsr?Z|$~WBA&Zy^$miV{XDDU@JP8MszN!opZUI90y
zrhmq}MQ#lvBw2NC7`y0pIguB5-KY_k`Q@>K=gIRqT~$+5NueUdHRE(}xY3sj0ux#!
z*yENqouKs8+xO;DhA4Rj=FV0%K~{0?&M#B5=MR@S0)2l~uQk%us$UCK>7|p@R>bo_
z$=f3XyobJJri_@-#in>!RT&9fP#-~`?QUrMVe`#98r5c=*WPrMZPZAg<&0>qjQGUD
zZaPMtTzbpH+A?Y{g{?QoY(*MANzlx^x9h^o^*=XZ4FfJZhlOBd3D#^3r@v9Ng_IIj
zZ6=u3p>c)aC+K?aJrG&cmn+-ShGClk5s{aUE<XI#&K-;S)WoeTz@qx4(tG-`4>c4u
zVQ`H4S=%v-+R`Oat`r!O9+@ic(e@VWA}l$<^C@mUZNY$G79aO|SQUu|(N87n^o%3U
zNok5BCXYZFC+Ng2N_Twp9<h5u0DqENwKJUC^1Pm<|1v#vh>vifqb-C%?$UR5imwLE
z_^cq!tM5cr4XXX|S<n;b!JcyLe3p<SbYNCU<g6|vH-Q+VeYiA39qxX)q$e$;?7?)m
zuD%=gjZbJ@K_?B>YTTrT^Z*m{LKYYzY8MPuhjwaD-2!S7yfaIe6Aewp#V9UE-D$MP
zcSJ*WXTYCI{f**-x5AsqcJ{#qSMUx=T3KuonRM^C+#8t{xX2~mr3C39b+PJu4R;(!
zhE*mZUWf5_(t)0@1_QY3oPCDkkenzf71LN3{^mGZ#v(`B##w*H4`N=*S^ks8qe{37
z0Sx67k*yqTmt~5CHQoy2nOkQ$^=SWWMy}@SAF6X%>4i~3%{pq`S8ay41HAoGD0>eI
zjLj(57{i0FJh4_U&UgYhd#H5hHND!+5XeUvg<ntzslM};L4PnN>7HYvZ|2yWw~UDS
zT-HY$V;S5zZ$|pw);jc!yBJ9MoVgO%rlWp)g&UpK+0|!LTSS*E(|#+KQ0PzACRHN$
zz9c}Y?lc|+qayR!i>=b1)w8iU6dG4bvq7M}aZOy7-V2S(3a?Pnv|oS+xV$^nKg(jF
zFKInC6|J>!clr>9w-kDwUMWw42rZ14lPzbvb;}@|C4zIQq5@EaMW<t|z9ioHUXXO2
zS!v*UwfZLVSxopAZ_8zS6tq;MY^-_A&R>QTWJYpcAPbk=ix{`wR?KvwUuW>+DNv1n
zTkRbCEI2TcD|dX&ssn}&$-OmNOmH_#a>qNr-HLAmu3fTW7<0v}e{<S-WiOu$O>>yf
z5uo&oQ=}NuQz5El5E#qti3R#_upKRQFTM(`sqyyiv@t-s9T|I|<6CkC+Fqt$7qUug
zYH>(w1ogtlZBsc~@5KD-G4wXO%dr%f`lvo)ZHd`n7{mPWmFF@}w%XMCwnZomt4`RY
zK5s-_5UNpfTO$?u!@s-Ekg>ahqm3Vk=};{YCc=2Ax!m~sOb2z<+JX4%Fiw%*?=f*F
z7NX+s4&tXRRUQscW2w4;>)!VDQdFy6(DFymDcUpNItrVAt>{Ko^+<7;%qHex^4u})
zt@X8vT_(?teFwqA9U*Y>`!z`td_+*aJl*$rsb24#4WCHWJRN~>P(T&psI9g7VgIqJ
zbeQ+)TN~{o=x5pD$$C9e{swxRXM&A{NQekeZ2{$5KU&7-w^?J)Si@$cdc||s_XCfJ
zz~*oE+B?5KB`k$BY+y(;Jedy~?r_xs4bIO*o>==S^^xwk?1-^jjp&}m>z*F_kOhIj
zj-gCcr-Ab?OWN>AF*mVSo_ekXv;517na`%^uC2$8&p?K!#7&$hjDI;ec$$wasZYIY
zygjBdY`FcLH)?MAGCQ|ztZf&JlO}q#p$EL!Ind$_9B0<g(;5{FdqB+Xn5Tzo=Q&bu
z{8++mm_xS@adrkM4px-NFWoD+MwU=K$6IJGtXQ2|y1r_&9-6-gzvGKQq)<DK@O111
z)p$Agi-(GAZ0cS!AN^K|R`$5I*ByhAqr1ml&v4^~WiSISMWTc{F*@JkbpwQH`lZtv
zIr*IcUY9{yrUYsButwCZGUP=f!TEcoM~F*cap}DbDcL0~ni!duNqFER^u5yNWan&*
zmmVku?vJkI&-`(E{Qv}Dhs_Ea&Z5zvL$9yx#YHr+hyC8^KrGMDk?pOM$0_x(4<8uf
zJEj=d<yYAOkdDjM`wkq@l^4lCGu?qa6YvZnBbf@u?JBL);Cwn&U&qpF)0VJN!ESn=
zSnaZCzLKk6h;^w{cNnv+KGtbNf1a%h;!F8cHqmZdw)jq?UUe7a{$KT2!Zi<`)bU?_
zxHov(EteA@nnztZV~EYZCLd8foWnP>JwD&`A2dv<828HFfn<w*LR!?(uWjE)`x-&p
z#LvabcgK0T1zEi$xjA*Lf$hJJ^G0i;(n?QkH^88Za)%w!YCECwY$p{D0#7-bYw#0B
z_&hqa9l}C{4jni;-riVLYli9;)T;9DFq@j8Vi_~UzJYd;_RoixRWI$T7rcNIv0vQ_
z8Ss7Epik<34h-a&w$y6w(GyGO^l{SDo`{$q=!Jm*rx|%l^hqOGx#9q>a3wz(xlZI=
zHsf=iN*V-;AvXS(h|0dZ!ha2@aWE{&nc?q8iPjDG=$^-;m!C+7?9+Xf%qfc(eq%jF
zf+Z7-MGWiBn$haYZ;^j<!pLq>8M|DJAx~$4=RBd~R4h$`rA@<7gqiOUA<L0zapmn@
zdCt4gVYcH4b#?FvQk6~aW<2G*e-$UK1Us3fez@J<&9<`MppsqA16Lc)RiP|79Hyu*
z4QL;E15~P$<wogc=&s?(3W*ckEA{z{s-|~bmkr~kE-}-g{f3CMI5+sQ=xQw0)r2JC
zpchF-3rav^81~Z9N`ZYcyd5CjIOB3-J`wRY@-P0I3&{3gTtH?v4%Ywm{g?@vI9VD0
zYhex(7bh3T{}DVD4fqG1+FXQyF%I0j0fq?b>gp1401Rwz2X*lX1$B8lxCeECx9wrK
zHv!hoDNa9rD!rpB4Rcq@yj|-6c+5s(rrboRJS6$;IW;VJsC*<Gf}(O_ArZ*^<Kx0}
z<Ku7=;-yCWHt?TyxUsVEXJ;mc=2Kr`A>kzR^S?+@*<2ugO|Gwl6zf(4%hCdoyV;Q=
z*olh+v5=6g`omx2b^sTK)?$zYad`za=g`eV$I1@R?hGvqPH+86KJC*7P99YOBB!TE
z*y!5^7G@WefHfA;4#+NO;+ls@URayQ&bKkQ0d{$L%|lA=KAD|;*@A<!v$J~&WtV$$
zi#7XHX$IneHFpj`nTI|*gJA{!RAm<2nTL3lw|sIi0YZ0%E&HKNzLw3|hQkX4itpbT
z#Im>qb8>881Lg)1TnC<1Y6JrJ&cF7LHvKUcgncdJ0wVV+^&k2={8A@`-R#SOkBPbd
z*K}aZM{6?!REn`87!cG>+tbv=Lf1dPa>O7aVokvl-&aso5YkeBJicdt5enp3AP*#>
z5c2c))a1&-@b*gd*2M5jJqFG{1h_?WdPQ`2b`-+m@(K)qDWC`|k<V0qix2mMTbojo
zlU1|opHLA}6LGF@n%=&~Qof<Z*$z}9`qKa$vFA569WV>TE-o%EhhYXZ4-DkO!EXLa
z6BrrBcV|zwq;I4E&#(95_5!4=@Jo;YR+;dOAUiFofCg#r>I~%R{$2UL4=OeS+Q7*0
z3XTyZQ*&+bD;5C-^!HD&(CMwkKEk{iSPTJbz<phxf8Ti!`SkGY%En>azn$-C!gnbZ
zS*i4syu=?>7}(7Y(C#x0V3%oHS|D}|1Rx$vp8iw+B1&wn&!GcEc`9vX9-vkK@u1Ep
z{lVHFS)gNqOCj*rU5y8~{0?vsO8>YH1QMJgrnBJlpU3*2>xUov(VxhNAMTT%w1oDk
zmgils$serGpEGz{+G@V<2B4XmC>9IIqbtEIgAf1T%Yi?dI$Ze?AyG3w%hFspL2g3h
zE7R}0;#!;$+U=mf(de>cW`1&Ge!^9MHdw4-wet&el1B77U;|<!67GM_1gA`Gz&rV}
z1xeo8V4yZ~er71mtZmF6Ruh?;8bIOj@ZkCOu!NF^r$-^~j6iIQpy$7Ci69u~H#fL~
zb%63Oe1J;bVjcYPsCaM!gw7Zi{E>J9gkCugfEdF+#k2FFKVsT};EaBV5yXLlU+ss%
z4B}s7(t+U;`;cJ+gf2LYz!@cf#0lw{`;fz<uI#}Mhygf(?c@KEV19_@kT6Gfp^|ma
zIY3O+zheZ~RsBd5+?M|%UH?b=`6sdcN1E|R#vEU~(;tSJv^xXCCWob{`e#eJ7x^Qj
zvV?~u6dc;Km3xcFhK{NU&a+JXeQV1;)_?O)z0d~_54i6Ohez99o5g08|4B6Xk})!V
z%v#Y89yNG?1S<jijs>E|dlmS#_Or;-9?<&OhcYiV2$V@}Es`Zr_^&YF3lH4H&}#o(
zVy*A58-1)lXMpVVcK~7TNuOqL?9kTG4z9&V7`UX_JtP=%%O_}%mi;p%7~27dp_{_U
zia*_=Jzu%4e?8=OI$WP}L!i-m5XPPRK>puWdUkPtU0*YQ1(5AyIJZ8jV55z%{gGiX
z>W%L<?BpT*r~a0&ykJw)cZv7Du}PT9S$tM5H-B8TGvDBWeGUqRAzYoS>_Bqy75}w>
zVt>{QXwgsiWgEg0)U$yHdlZEnxs_14lYggu_%;LXZ2XlygBR$ZO;QeJ&e0`+E6Akd
zCr?7TyL*cyH|iGa?*`(6Tk9{VP`3500ivJ)5Fn(i8Y4jZD>k>AEtJ3;82e**Cy-Xq
z5JgfRGwUx<C&+Q^f4^HtAehfHk7egMFq=*>-bi15SRf9y8)IjmXrF2$&leLpYrTG-
zHHC^I%dG0EwpV(XqwpZfFu75SbzHLtv%pZ7v;vVn-#RRRJ-5T~elN}9eeEE#q!FwP
zP9gjZ3RX{WrUC}&@#pfW0@n~~4RV)CI_7S7Af`Gg5@>&xX<tQ5u89q!z4G0tGfNBf
zr}~h?tidipRp6CKHBaV?69KuFmAK2rzAoc=*t*`P)tdc_li<P&pFL;EDpQcQg5f-U
z*nR310@I|-K~GhSfdG6&xA6+sk#=Vo$@)^LE~WUFeD?rToZ72?<{p^%wt@bD#m-if
ziq%Hkdd!qQ!ci&j#VZsjh97LLn$Hx}`-1xewO9-nTbYByF~TP#wa~BUYhPjQgHZw-
zm1|W4%M-Eg>)NzjdnQRcBdMvA%63lCb_q|T9dEkDY~OW3zW{+B%W0m#?uDzX2bPva
zM#{S9owiKw+I$<Zoze%N8kN&UI52=lT1HZok7>f{7#}mdyHeP6(XZy*f)hA!@uXlG
zw^tipRlCTebJN$DdmLk3;yB6c-Pz%5@l-FDNu6lKB5Y0G$QmoKG*}%VC>@vo`)Hg>
z1B)uD;@Iz%lCsB2iHvjUe*if^#=kCp3O*qhdT`&PUzYc5g8I>nrtay4ulbPwBm!zq
zD?8NCucbLv{X>NOEk=YSn<m4`F0WSIV8LNQUg$s~I2OLxM4|TBBzbPM6nro1;r#s_
zV$=`l6l5H8dn?oCFnR6DEHW(Nmyyw{YVlqHGo^Hy(t6$Si8x;6S;fGX?l<JvibB5I
zvK{U54}FQtx-}nt)5f)Cd$g83M%{<2qv}FyhXT~eMYZE+kH9j?(Hi&K=6OiCKC}lb
z`aJq{#&34@%^2P;SkmkNnvBj}8IvSxT({ki);oR}bc-FCm1~}*cDHGn$J*DdO2ruG
zKV3tlcicm-h_g5KVifK6W*00!$T`a9(LH9U?lkwFnx=m!RuY2R7^#t&gS5%AzSCPH
zS6}nTj$9w|B5cn8`O8MUA8-AloFKa)wF`e`K7E8GPF%)U3M-_LLl8@aLugIzSwRsg
zf}SU4JuXUel*S@NqxK7rPhG;p7mR(&0Zoltu|=11qK>a@L+$pfal%p^Mca81$^fjF
z(p(PvPv4?h8I8du)92<{f4XR&BD!gQ>r2V_vX{-=q3t~VePlFc<!e+!mVo(9dPIv+
z*7hs)G64jsKb*;6p+N*GKrt90I5V6(0EHwl_p+2Krqo+?=3=n)B+3*U`mr2cw6VbX
z0cFl4wYNBzuOc&xZQ{Daj|RV~;M|g<hwQ{c@GTW<2Ynco3Kx7PY)pj#Y}z3VPjzit
z{HXRmu9YdtS!^osd-Hm}AmU8EKQ<F?-`6^EJtct@y6oiatKK39tRNV@EaK-V2x=xX
zxBCO;?mSk8qTHMomM+2a9i18u&s9Uu;~Az8M^xd>^jqmauLB~*+ygZ!+J?*SkJ-Y+
zjs5s+EjyWazRg1~7-Jm9xiKL`zdVc|viKY2Na==VMf7;I)N#j*|3EZd$SYktj!fJ;
zzASn!F*Q3S>$1;#=C!yaQXr(H@G6a+uNy;hD}PnqR|aNMaEiWNj?Lij)H6>_cJKQT
z-iufI3(uF>%|^GypP}nPeeOv;*DA_^hCf+;qezac3_$`{@R|`%3-2@B&Qu=`cz&4T
zVO!5CP_z-68>Y!sTO9RVAN`t;X^ce_ietc{r-B5Rqv#4pj#pE&+jCqIuY0eglvyTH
zC<3Kd&Gw7y<BibSHjTiL@CoU`+7Q*TU_u>tF{L`iJ}qP@*sJh>L>U4uonykdN?u6v
zJeH<~KNND1Fs)TKWXS<Jir-|p7)hqfW&5(`)>Em$1wZPHo&h0P17&jMECsYp`V#@X
z3<a{x&MYDYe-3Jv*p{L^Ew|jESA;T)1hW#7AiGY^mH^$)c|9zRXbS(;!&^UbEP4m?
zw7z%un)o?a&(?v4WhHLo%kovK_7lYhm6bO;8FE~;&_DDsq|Lq?xe@QAB8+!9^#_cq
zd`|+a6zzsI3LN29cOcgFvlz^CYfm(IJ1i)Lf{CKo>owRi*MsgwP*I7MDz}vk2U`DV
z%18Y+k#H4r-<NBEwtly;8<6IIx3~_VC?T{D+eD(|gDTf#YTdsp56@NYnyDyZI8}Ih
zrvgW2Kz{ncD~J+DW`LVs<kVt9hAY3zU2=d9-E~LoWscQdpN%kVFE)3%?Ij|kpZ4ZU
zvB{1#8->xB(Yga|isT(VKq0Z_kaJ)gR$kurUaMc?>K%-O%LHNbQ0;<T5=7@skJ<Cl
zoCyOY1U-!1nJ;z!w-mJPwoc^HE+B^e!&oC6(|Mhb9kRa+*ePYog_jWCw3FN}fq?)3
z72!+cm=7+BH`-Me8W>uM-uIPa%I6iPF4r76aE+HGA<H;oHK^;)R&0F7gXEc-d8ZbH
z%Wl^pW8T;$IN2etBGr+KK+j!qsM?L_BLnfzJJK);#NFkuo`ZQqeP6}ssW`t1WjPzr
zq)yr$FCQnpuc}1!|Llojuuts$>Q`w<T{U5Hpb8%c1w%#eEcL<MA%5{SjF6fUGS}hU
zzpd84n*Sh39&<<)c7SD&XgGF@1G(RyOToEGo5ef&Cz~T9<aMk4;L_{!5+}@NvU=JF
z2T|F9ZyhmSYi9;^7>UCsZb|swi$RDI(r=y&%~^+%6rEb6LE+0_=}U5x1)R|ZTQRYN
zS}5aTG2jL7c{w({s%7mrQ2XxHsL0UKwhygF*H}IWou;eU6}*Vp`mpjhYrQ!R*Lbx%
zV)v+Oy>W?^<t)reRBgM&vvRHQZyDI(I&@Aj1Qu-j9wE8!q{J!*duN$)5iM2-bZcDF
zy9^7vn@Sjoz0kX<^E?Nq+tGHzViyX_T3N|7dckm+zBe;_p#`@-@-8Ru!1w=-gCsX>
zNd0w=^e&vB%k|@06aOiP>Z$RO-$Y*%OgR`uGXzGcZHqkebowMyRK`J(`o>`SD@@7q
zo7x&eX_~wXG!56=3NkAPYNUq*GUZI~>*gk6NdRJRcLYhL=jaZSokFjEl6Qr%*6RmP
z;e!3og3Vg~LPYDGk6VI<UxDr^d-z5IaR>Y)lbFfiZzC|8-N6^<Sqs?VM=C{T!VT6?
z=*!Vus=vgKrK<%<(6sG!d*N5!joMF|M=kZ_PIf1hT!yGZaQaWpCwk@`Y;?+o2-N#O
zK_p_oa1+Wz@>JbE<*C1sjcX(Y-9nKrg>qvXjd0oTHi+w)WC%|ZE=Vg;g0pMWsZgJ>
z5@$uvcxZwdP{=j@qJ)I6d|!PwDu-UKDD-jAG~Qo@#PmZH36ucvKJ`_jm^?wLvtMlJ
z1YWm<S=RqJq#ukO3gJ?~oQjit9FsxV5XJQKT}mP`b{k_@<4<RlW;x!0NJtGvaL;c{
zo22Zdn9V-V0qVS)OqP2VI~?o>zeqb-Yk}Z34fTM7QrSIP*U3B;mrsXwt=#KZe3w21
zjbaUBC6v3$qhk|{^od>7F-#j&@Fve#k)J<ak4iyL@U;6Y>SCjP8)>|3#Zm(AdQE;g
zOm35cq)j3j7Rby_47l4h63&^L9DZ5k^j=$)nEJA@exbwDCW!!NJGc#P%pA5^?M|dI
z35}7<L@dC)g}IH|nzDz2<@}MbZwpI+taau-*(@kRxeKW6nUMpW01Ng3jBc7!r9O$C
zB0yTwJq5oH>OWNoVt2jubSa1vH2Mr1IRI<n-e5eqZs53zM()^s@BtA?>hu^IEfzO+
zrB$CF^?d*$lk%~$$-5gcoIOp_^I!w2g5Jv8nSPu_?spMb=UvIDy6_K5Xu8wlQdKHe
z?msgv&5XWCCYrpbr{sp~*|{js`amBw4UtM#VDHdXcEgY5SHZ7$<mpbk;-!}`VXW(z
zxx;Q()g02;dYd=AQQ<6^sIn&VYibdYtiUtvuoIxm`ACZ4(b6m&W+&^2=<mg6+TBz^
zN&ygm81SLK{Y>^q9f^eYRQBX-;*^h-DFQC<Y24JFQT!apCgD5bx76G61qe81jwF~f
zDgS^59<i%y<m5@wHO##?WvDLHP?pZmibDhU3!;e4Ws^^uQ03~WGEp)N6P&X|bGsSK
zwgr89%Il?;E&#dX;pzPs=eO@ZiZ7>0&i$DA#nSHe$()PBvq~RUx9PEUyhaUN*59--
z!|;h3i*Lw|T3LF+VqbzedUfU<Z39E(rHLAkUn8fk(tqWOS6Wrn!PmdL>Qu1oO8tgc
zwYjoS(*UCm#G9XXDwUg8OO2!|dq_*U?%9GVlfKkcyBy2pY&h*^>iGq2@=;or2}=N7
zu3=aJon#=>sCfKS57LK=&Q??7=IPlS$A)j!@VsW$zR?${@obvaGE;m3%6pf(Cnj)$
zVFmvBFl_UZPFsP`w`-V##|&3HZIR<vY9H2J_RW6yCH=~aTsTMZp<uO6o=(~me5~%$
zSCHCl<-pCHV(^O7gYxvCGjW{2aYr=8&-*q`^n}JCy*aaR`4F@?+kM}loL#z0k%Nct
z>4n>RV$@hTYiy-x^xk(c0Bi}4F|W3_@1bbI6Mt7~wvspqQRQ<>q*58_ENvlSV96;%
z?x8SP!Rbx_xmX%BXHR|l(2E?bo9cbmDQoJ|N<VGZmPJvhrom<_HE>B+lP22XMlQa9
zx;fjo4ZquSt&MlXBS3XuWLhvJRr6~IevYVa+t{X!OLoX4`?HV25v~}$iczB$>U^tj
z2C6<wgj#;XIc_d=13s(L5lJioRzcl#<MGdJBqYRAyAbKr81)|VF3eVMbuG%rpyO#t
zS=bT5{m@Ac6NSF7`=db)>X9La@mILjYn9kvxSg=cU|b2QN#uCPp$XGGjuv+;x#XpE
z-lYw)MVrsBBh%?5Mm+wIB{Z7D?4hkTQ?RAr#2k4UE~~5}#>Nwy3!&g4cnxO40)*~{
zWR3b!;9eVQ4FaqWK9tN>+;KdT<V_m+t9%zsA^C)#<Yqr<nTeS=Z?3^~U(Z8vTQdEw
zL9fUGnRklv;@a=2hfSgzJ_yK(q912CsRxfwqz`M7N@HEFLgGbe!Cs^9>Zqo$ij^Po
z9z4zzI^`fIu+04PrWr%JdwX7u{LI<ltSYm>m6^yn#;1UCjF0wkKAKW6GTMQU17WnC
zv-d)27fOobL@<h07QFZBD&TvG1#yU5CkA28lL}!8ih~)}<FR)tUer2_D)1A8WW&NM
zd%5zt2z3JQ7?V=%ao^5fWq&p#X*AR#u53JtCK<{@@9`T3pgDH1E+)<k;y#*mmZkP2
z9k^DrVbnt$w`H*bG5bYLm1vrc`4lZ6-ki!;HR3r5UNh#VZEPa_Ggf)TDywCW`*pJ<
zy(^UyduwV#n*kqhhr3|9ihn+g5i}I<9n^HU4<eUYA0XY<;XkJD0*3EPu7Z@=k+2>k
z_J0Bk&U?CuS-}0@3u~&Fp`<}UuRz!OV5#J(7^Y2z1%~C6PeGVsX3m-A6t&O2{?sVa
zr*TeV%44PyT0rvJEP1%tHU7L<lN(=N;;BgeX{<C=c~NQ4gqrBUTK)`sDb@(xawN1A
z1H$c_i~c|{B+duMO&pd&{Vtn6K1hbcO}|f<H}x*2H#_-omlRU4@=*EhI|3u<4whw?
z=~Qr|F((<bbu?d^@`TWaW(cMo^LN@y*~ulRlSH@{Y#iTt_i;GZp<PQnl5vM#Njtta
z@orF-n@Q;P_BYh~R=X=6LF@U;>}<^8V)txmK4}JvjwO;jv?P&Y2$(i=5T>qVZ2F+K
zCTNWPusaMpV0p=+*r8Dg26}Vc`sTPlaEW&&EI^MY0+KOY;Knb~k}P)Ln}fk|$vdOs
z5+nq31-83b81Fkx{E+r{gEQ9hZtB5!M=CO`Jws>_u?YP68U8!TJ=k;IR_7oO9*eh7
zyr=lKChMI#%#!j4$<Z|F?cy&-RK9N*WLd>V+Fhs$0)3YQJeWC3ZlRm4Lt>R|Uj<0M
zsPB3E^UPOCv7bjnBxyiU=$J$t$~@jU`7lS}dVLb2a>J88c81Z|iovvCafwnwV}Ve~
zbYP1&@+R~>c}n0tVt(%Cz%>%`2@c3f$19Z8m{VXscxFJMfH2@Dnwq=(2GP*f5MM&r
z299~jX%-~~PI@aroBTE|XW-!@aa@#zJt{zDoUrz8<2ohdjbmE|o|sd3^jnNI_z3+P
z0)*Wy;S^Tmyi1rXoJ@0&vcLqR7H=6r$CaGk7dtVC?S+dZL|%<B6GNa3qMq;2R<l11
zEHP5&7O#y&t827}86y{eaRUh<(^1ixP9<=%LaGTt*$H(-SW2ZiYJSf33T+v9*qBEI
ztJH4gYE9~0X>otb=wScz8{8*%uo*|YUCF0UVfE>*o|gxi1D}5a!<H{uV+~4%#(||q
z_i1ec<!ThwhVDNx2@!g!w<oY*hw{MNeIw=eL_}`#!>f{R8NZV_X5c$zPAZF3?L+YO
ze)kwfc-EeKp3~zcrYmA1tznZ*+K@v<m7?Q+#hOo&ItOD4HTjr@Ce3wDo-P#&8T_#p
zFg0Knv)N=!-7bs@PE%5exhAe|YZ4;oGo_^Il5V63*&JBunsHz(pl>E;#inJ~Z?}%|
z<3mYK{patdxgn6g*qdh(z5H`8ON}QJVYE3YxfN-<W>zD*5MrF@%>s~VIZFnHVe$+H
z_Rz)12a`KT%*+;$B~Q*{u#^ni{ervRJR(J#V7i8m?7Q<Cw}?UNEwm6FB9RebU<z1w
z;h#>!H4RD*45amitG5Wvi{~6JkI*?0h<Qfnucn6ZyQurSWaaKFhAs{=jk=PG<YaJD
z4ZV!)WHP1pZD&-2>{{^M=FJGMSQ2{XqrKymIvofEP=A(FJe4BvgDXER*hwv@>GZ>_
z>RK$Qm<>lpYwK@nHR_*QhJ2{{`kKU6P+dYH&*_FN7e)p{BgX9-1s5?&5(L>YTXs?E
zx1DHM<c`HNrHK$@P;Y~9UpqMnjJ~?KC?zp++Olxqr|rknvK=MpE6HTp?~MXZk5d-b
znhh@5Jr`ki0Qg8xl^&blavERPDxTg|=TJcINOK!oma!BCnli)5Cp2=ih=|1TD4>kG
zlJNRr4c7|^aPf7`g&HQz;tYFXJUz*cwMR7Fk^9K*+qz^I`Qa3@uI8v|k8jb?=j#U>
z9hZ<g-<8KP9n&}Yj4TYz_88B+RD1m>=jF|GJ-uIR*~A+6T(}A4eS)6=yG$9L{<;pv
zHSP$#fzud3l4TU=+>}0=M(S}iUAB;?b_&o{Pr>P3_&&$~b$yo+@(b#%ACY2#a6+>>
zHG!7M$Y5rK!k1&^0DssM#`+`wdBa%jw!q1S?l$N><)B)&$>e)FACB<A_j7|-%XB@N
z)YvUjB2}?oOv9}qLJ?`3S_AbzV5)E(72+u+-oxYBrlGO#5@B@2=5tx>vTYinivE(n
zuOlL)aFgvtL<HZXMXR$UNj?Hocdhr3n=~?Y&1@}r{6J1SA0i1;74jKnrl~_hJJ2-v
ztRIs+u~f0!y`_O%3JoVC{q3Y6)`E``c`P;e(33k*+Xs+Adi=z{05zlAkar+u?ONrb
zc(eRs5;dz$2pQ;%+U7aq_Je1}9L%_oE2a8K13{Vd6wNC;9%(*XvqGBH3e&0eCk3e^
zO{R0kuh4xCsvxRO8}dk5_3=-0h`X{JiBy&KW_SM00U?Xm@e}b)B=lk39dD+9Fch)O
zU(`Er$Tiq<qj!Pa93QH0E%9tJ(;yMbh#M)2pt>+vTHP`F@p-i!0p~x;q0Yl|aZhaH
z*7eez+D5o@^it)#`nbdr2bwWvK0u6f&a4aXI`gime>|yIcUpyIN$}}K3E215ost*&
zHRDcPgm7k>^pouMdwT!SLycSS@&`o!)3B4iv3lC2u1^cQQ4Q*S6_I7&V>$2Q%0)2<
ztB|nqouiSMFZv+r$HRqVGHY6-MfLZ;B61nQ!jBSs=BJHtD|M}`9@}D^cu~{YGi+RD
z%~8Q*4v?TJxqcJ>p$mC4LA#u>r|Vbhnd@s9#gw_9DKay>J4-07TDjuH086n_-i-@h
z+j}~YXcgLpr9C9~QHpc3=qiD#gqOHycMVBShYnW<(_k0wQwARff5Wvyt!j4U3F(~U
zmWTrXK+U(EC}(`Rg<t$oPg2)q5o(p=<b}75NgT@C-FNe3=9LQB6@nrg2$HF|oaKqD
zHIZP&!-Cg_bHY$NN;25^--y2W<X4%?V{+|Dr4|<sI)oiK-TEuD1S#3}PIhCM^QQjX
zVG_0f=4*25(L`_TyBa{;EA_PbyaNzmzN;d8_wjflLKsUeku~k&N2{<&90?mc{}b<)
z_RE&{Lj7kksCJ1V*)ht*ji>v=xU{=Ef)Placml8-ctGZ_9==V~1TMMwp;Nd*b8oE{
zqs758n>zLN<lthRQgFU)L(^TzUmsmpHNVL#UgsJMha^&^5^#kUXKrI8K$0P=ObVMK
z=lme0T6vkfioQP2D}){>1|ZkEL{^w>3wMbMWk5O(zsYioWd1_aL|hL_-DH^uJ*R_`
zvvd2JPV%7IPJeLM#i_#pFH-rjPq3J;<RB$;Wmrs0glNcg=Y<b^HSi=yLqcGPZuD=$
zJ92N@3g(xAYSu3;2^(YEM^k>Nv8wWFVe_Om#M^!0^5SHS@lHfzsG?h|(J(+so3QDD
z10z!*Xe3q41p5XLg)CUH*9t0Ktmt#wez14-S-2hgEISiQ?mpi4S1VZ*Z5qCH7^ava
zcCC#HH}J-9hmk`)kv9<Xl{#GldaTADF>hkV$aVCFQD;~`E^eZMdGLaX?<yx?d)7Zv
ze|S0@k7pZ*jlG`j!!;ugoU5@oEc9554Ms&m5&m=?RAn(%x<(1l%m0Gi9oz%s>99AV
zL>X_(;uh8|6N}OY^%)DUP-ZPGfbdnuVD#o#Fu;oLbF%Q<F|=MRyL}WVcT-Fj9haK#
z1Y%vlbaANeOPzJ*`yuv7*5J%+9|O7$VoFr?{Yt+@??%=G1<inD-aFs;K@@OSXvg-X
zc`tIOndBIYGM{Lwn2Ke)cSX-LQyXI`Q^XFxc5hPzE+l6ZVAV2h3-4o*qVvDKn4Skm
zv+WL`DlOQ-s>RME?Bjk<>=^rw*)Uq%ceWCfx+6$3ky-U@Bv4S;Mzgr5jAJr_3;}vs
zG%NI1pHjk6a;xT%+Rl1ILWUW+auq1s^d8F`$C`Yhn3Lfz@cbSwM=Q@uLDEi*{)33R
zVq^ESp`4mr4VietYVyumR-V~C&;WwK{M~a<3B+xhD{)GvA$=cu^jJo4k=joQrtH=#
z?30Ne2{FPwP9bA4@g)<dK^@m<%9s7-R1>MYAE!zu0&$y{DdRfs@iLM_Vsxq>b;IZH
zgF7${r)*L#%mw{81|nHjEJI69?>oYG$WI%x*?)wsU<fSZytAtPvhE0Uszl<Szdv|y
zc{^J_i%8J%jlc8YLAZym++t<e)Vw)kh&(@+fw_|au<|VhmED0O;^LJN3%1J4!fa}Y
z+fBpIrzxC0t!xU`55cAGTJVE*?^n2FQC*I67{@{SA4<JoOA9}f_%J<fzA*$;bznZ5
z>^&0k>o`|vRKmK{G<);V6R}E$0{SzfW+#ZtBKLA!s^Y>*oSIdYZMPvuPr*CX;a`z1
zDJ9u$!Cb!X*{l*O&*@J4ud1ruCPmTZE$_`j(V;EY<Ag#|e0Gl?I@Z9m3qQKUYpjbA
zv|C2XwURV0>}1T=O|aZ!uaa_#jJ2vCxilF&8LjVemzHvr>KFaqHTd@ODa(3uy%yrf
z235|8>srsXE7#U4ON;;Q0l#H*o#^XR+SV8pi6iCC4I2k%u<`3^koo9Grwfu;_Tk=A
zKNS<m#`^a>qJXT(4<yt4O6mYgho^V);Y#W5`giHsh97(rcM$WU)=Ao*#G)2gyt#I|
z;4+R7!6kZ@rZ5%eC6U68I<43c^Uh!&CF?JW9|pOKs*Z&}foEseZ#xp=P<;1h(J|3?
zorW2&qkGRD%!8X2(dd4VW}a2piP`s*GD$c|XLa?IYpBY6yl3q<QS&35SmF}XBFFYN
zPF&*nn^I8e@bkEF$CKu-Hype@hq^w;Un!i2Xkm?$bUvOsXU)SD5Csc)Fs7Ko!Tn!Q
z#JheTWVJfR)WJS$!Cy-bX(Rs#C;S|n0xUKp(PtP3FSc5JM6g&X*ZtbeigsWumzhF1
zAuH^}MRVmUWlmfbrTfJ1oQRk2evehk77_D(f@HX7G!^n9>Eq_{k(yWltzewiBbGM1
z#MfSpJIwHR_#91O_5Lzj#njaYLfAgDc(yNw2YbsLo|g|Zu3y`{45)yyqR0lDO$t;5
z(Gp#e7I(?|9^Gxi_3#3Lp%BL1OWR@Z3};LSzH{`@mcP@fchMy5pY<^wf0g6a!<hL@
zz-+R+22=gvV=w>H&^+~=qV9}K343>Ax{!`>ki+iJh7RU0Z`avRjn;<`Gop^-h{MoP
zc^GW=E<*UC!_VvzUMhWKvLvbLrgo9|CZEL+yUldOdVNj%XE$>3HV;m;De}*~ph(i%
zKA+@~t7|Tgr&bTI-_H-Y#<?sp29|>Z_jX-!=NFdaY!KJ&cIpO`F+abJ#v{3>Zx&*b
zQ@Lm+Rj+Jju=|VTw?CF|p$)ED3#K@Kt?FdD!j&%I!JAQ%uKPLqDp1@<qf$r__1&Ru
zXoi{RW4h=IOh`|YvwJQd0fLx~G850I^31V*x^D3}t(y;tu=a-tuB6Fx0IK(HfkIkH
z^^JL!kqDzN*=Z04%P;JY>Jjko8%eHuR^R1Y!|?6iw?{cGu^1dmody%oERFXhm{p2m
z1}qZm(#Dubq~{ne304$A?cHJ~VmtU1&aeImzB(2hI?hW49(~;vVs|HID<?ZsDWWEV
zXvWlYomPQbQgSz5g`Tv}pqTlNGpT*H8@jaw2*CGa-PB(ANCWS}P*moEX?8xl?gH$8
zQu51J^~U}b11SeB-VPUaD?=P4cq6M3l|o^maYbzjSS(0au$>+p(ndu}a_N9R+-=Jg
zG1>6uL@?EInlDtUHOf<-^>DLf92uLfE#;L4pe!V{>XOLAau~dWMm6EP<I*eY{lbPO
z^&K)@Q2|oswZ`Tf8i9!plWS>HWUlLhXeh~yB0E!1SAWaOgz?3p8&+ooidFHQ5sy4X
z_k2%o=7<R)-McTJw%s_#sKII3Fca7dgKzuDgkM`ZLe;*up{#aO_#jrATF^})Ik0Y2
zwCS=kqY8|VCWj3@hxiKjSV`J5v$Ksya0pO@k)BL@7vP_LJCvT_#%ve}tIW!BM05S@
z{$5=|PE>T<l^4tbVJkr#@D$MX<uH<Uujy)h^F)xbknO=cprLHw$FGetbotqnE%4H;
zAC<01Y@P7C)2p53@dr5{wdcJ~xrC!1c<#Y0j`Jd`zQqcT0?VqBy(3a*g;hT+wC#lY
zzSlV1KzTvuJw#mK(eRr$Q|kwHa055qak4sF4GnrSle8q$4*6q8w2MPk99dx)AG_d^
z{!%YhPECUVb=MOk*2GfOuAJiQc&&6LdN~qq*tEhf4sI_Bg|RQZeojY8W641pKY-=&
z9wm-iyQw6tTKervxclA*E3TUumSjI9+aWvot~z^-)RdE2J)|PWw<kg!Q*#qS*`vBN
z3@6&;yA)KC=K#nRnh@m2Zky`aaHqo1bwZt3eg*^ngAx`6W_}>4hJlPf_`0R|s=D9^
z5bt}NgnGi@b5F)w7^V@OfS9w2EJNY+2rUPx^;R+-`FWk`X0a^6hCCwHXAE&8`I3P{
zTp^U(0Tc*bixF>bve=jO=%%qRyQH-{4lO6yay*nVnkRI*NMon*1rNou>G6Y!dyx?h
z;?H<M`hc>~I2BVx`Z<XS#!18QU(dmHgxl%Ir?NqYVxpwy>nCT9zN6OtL?JPgHHd>4
zV+|c?#a>f{jMJN~#xdE5IMM2Q!l=l210I$G0?i{aQfZ8Vv|&+IjR`hVd84zDo9K(P
zE_1*>@t4n84&U#eRAu|f>a&9Fl4xiQ9Q_aC2Ky*287QXe2PASY+&`9&C%#9?Yu9Eo
zMXb;zV|9W$`T*zoE`{J7g|(SkFah+^H;8krmJONjdqPCGG&B{fc_KL!ZSMDT@ONN}
zGC4$iL+eD(@h#d4tRDiObg6X-GLc@#+sMIc*t~$~ni5}4!BUP}guD+!J~>Z?a=^+c
z@0Mh=Qn{&gQ2;O3#d^S3T#|)RaK(QC*&1hQWgw6b?wM7$q9do-5WgnLCl>0fhEB9o
zUA-;+THY1o==p+}w&Hp`hnSkS6C+8@l}Dm14qLhj`yfo5@@?AY(=XTiow$L=aYrx-
zZ$YUy2;XdFeTr$U(z-J$fqIYeOYi^<KszJJrS;yo6W%bCxX9c6)xt7(pRce$%(x*4
zkC}i)%$7Y`GQC4=ma$(lRj?(F1l3-Rw!x*+!RU7<SXgePd$_NK7db0lXJ?IIUBL1~
zUelt$yLgOk0=FdVc7c(8-@cT%h8+~iUzc6?4mdoF47XbpY3eb6pZe`yfgTrYd0&c?
zQ)EqJhms9TZa%vsTP46RwRmYEoGy0{B`2Se?m2eypJ9GA)8E3v5`eA!C7n8bW*6}+
zP;sD4ZOLeJViH^!bUhCReWkUuVtkT|-HgeC>AsQK6U3<eOa)8%AwWS<arNjti@>%i
z)3l(^*ItH$N(aNp=IK+nA2hqz8zyS{JdZ1oO#xO!6Ebj#U+yQ~@dsPvcBx3(nYAmk
z)7lPiyg{);>@2u-o@BwckasV~?g+4?2Iap@H>MXxEP4+bg`GF&z37}#zKOQgxnfyj
zn#UhiuX<-1eD8|=Mv2ARP`37XqOq385cu@a)$u?#G{2gZww6fuKpn4Bv>FyGhmYSw
zCBP$3sI2cH9=<C(%^5=A>moxg#FA=6>f<p!ys3&W<6J2ru!^Jaaa=aV7^%76$Tv!%
z`m_CV?tM4ugWI)CCp)oqQ?z%V>PbHsSvK+oEG|}n-@}=-T#Dzo^6G`l{-7h|=4TYf
z{l08*9t`H9C;X3AxJJu{!awdV_azvTJYR&#StQ|8to6S-x^8Q234=w%xCkLk!3D~(
zDee@t{=^QwCw_dOOf2@mcG_63v@I4=r0hk!ey{mDT}5Z?9{pJmtHMQtGFR}(LeEST
zQG~<y0xl7m8(BftyNuc!O1ity-w2~E)`6r`jtL`0X?*QdBz>`pP8OEr`*+*E@18ln
zk|(plCOLEy5f3Zl(BwN+7#V|Y;=*4lwS0AIhq^=yOTXox?yBZOTb#a#l3f*WrrVSZ
zZAKM6V<C?d;rWK0#6m|!SYNcCVtPNY9hhZl&5Lu2E^9fI$<p$fDJhN#Xq4*E({JVX
zj<IQQ0l89!u(IdVdw46vqY>^T4l_Jf<U-A`M^R$G%2||w*b!9IS!mpJ;&D@t7#aF8
zW|1XVA1{S9yqZoFb5^y;#>#=@Yt@MxN8a}RvlhRVG07sDrgC`iW>~4N#&u85r3ICG
zm*x5m3xn9~yc?<rK{$0`#o^6}jFpE9$gd<6azW)BX>$o&urJrsmGAC4^sGa~wx8dp
zA5i<20fJ(V5mFVtIN-id=_oO8=i_l3P@Su`;c!p8==a`P^=?Ng-}>&<`dpVINSk$)
zMr2K+n~D`S3a>_N1ZS`Nz>u=_jP>*8@f)OCt&)85$DmueGXIxQ(N|)h>D`{Cz_VUG
zGi_U5!RnqJk!sLS%HVhRR>X{r@&20@Vjl0gvd&7e+NCL79iXwNx{}%X#c<Y*x$)XQ
z-KE;qL+&zNwb<yhkgvD|)$sO*459)dL+sD9-i+@#@C+kH+I@Voh>S6_3I|bez;f=9
zoHQGZ(+ycA1sCeKwW)}&pT2i;`oVWCJwlR04W_-O;RTpw*Gp<Gx<Hv4)t%PtXAL;S
znqrhLxQh4t%-Q+co+)6|F;HiG9sd|qt~;Lz7fK<+QYs{xV^yq^nq@dWO#|r{!;#@q
z>Wmq_TZk$Y)*bfN=C~nZDm6NvvqI@~P46lll0yJ7<92~RXUmqA*Z7gL$N`;<#7_i0
z5&KrBFt%c_xUqH2fXQIiH2qnj^$~8t<g<Ah6v8NcGomZT^gP-_oB`uk|BbuoI`SMT
z6WlzQX9bg}eJvNffZB|;C$MAlQJ=?jz`^~RkPTpjH3p5zTl^*TWm*u{EM2u0fNTZ!
zY44T~Li5QPSq9u~Bm9Au+>%J<`=ZQt<8oaQ(lNnPDPN|)p7!MUCUsVo8_+_-IB^n3
z9zm7;f_nlRe4*}ODF#C0994EI3u;oiPk!*e9uF%9j`}%lJ@?D>p|5?a=%Lprdr)Wv
z*Uo7TsnvDLpj^0e!?nBBmO;;K6z-4ntp2>95V&Kv3z!~<o~~##jS=M^T`@cT{BvD+
zz<JZ?@{wJ!6mJXhPLe4dltPpVt(#hN$u@ed=yb}!TfyRtM(pEc$~nZLwhbX14FKH?
z>UU<#^72Gf+AX<V3*<OF#THQ^-?`iUP({R)2C|pv=1LB*G+%Lzt-x@}neaIxlmg4K
zSF3dzPV-`!LhW%OG}18OSvZbXDyoU_ex&Qc%16YBG$roFxKxp^O)6{maJ9q`!zM8?
z?%!?1IuE=ACuPjga;S>;ko!$t<yD4P-8mjQxibN|)J&aQp}F@u_L^MAQP<}(<3cr@
zu*K8f?w6y7njOP7jG;kaVRaHxT1BCh#X?06I#=etNM5-|YS$beguBOD?*_7`@OS2o
z&4Tey3{oHzoEph8<$Q#dEY1Ddi~fxS8xnV`I+%1381<EKAP9YcpR>gN&Z~ZV=c|#z
zZljn6*)3O~3xpKRPp2otp}l~g1S|7b702=k7+KR1=d8iri^OIx69Z{dhPIg4xV=33
zK>Eii_R)m*m=Rj`EN;}+Q^mA!&Ozv3EfJ;&@oak7c!UrpeNQADcCGA<)7dHJ?U^Z+
z@f$`I?Ot<yNUk^asgm6#OO?RSW9DX<>9w<y44aAz;bCUm_#ffqjLD;D0zZ?AbK+oh
ze6qcXXW+gY9vEflL(Vru+04ClfNTcj>#yyRiz-sYb@5Df!AmWqHF7mAyESC#<Lq0D
z!ulH1^wJiTrJ5Y77}se*?B!*L8s`Z_R?G~2JY6&)YZdIfOWim?N4A7rKaO-~eJ^|H
z1!UiSvlnS8aK9-=u$H|YDEo=o`cRXX+nd62xj<Pe*8!kk3Crf6(W4sTv8{7#vOmfQ
zmCOGnIgjKKTjC7^ju{<Uh}VQWhDv~!!pCW_U7m|VzY<9@rfGBVWYaQP(fp2-dHO3e
zPU00qJ%V?i%PapFoU%!*{|-Wi&%}5(UG_<{28TIr#N%ObUl>UXyBiGs?fDfs)Hm~}
zGu9E<9`D4lI4Mg*3*pY5ld@X-UriQ>!akxX#SH$KTF{1%^Gu_BcyJ90fP?E}=JVQv
z`irh#s{M4i%vQWVq&m8y^C#_jYU}mPOR2GKYHm$$;4pRSCs0?Y<$wxo9V+F4=SE&7
z$LMFx&dT^4S1hnL#lcf0w2wF{)5f}TRnKm-`$~ZWXejT~GP?#DtSo;t?RQ%mQL^|=
zP_dG`>Wl~Gb`2|#KhTkRWtLzpo#vu}^M5G1vnuJUV`57?`20{!f}4BIj;tcKB7bH)
zhmh#NTv$^;*r;iTM2+^iUo%ic2@4a~tKGZGlxV|6cl-UpC~b{W_3b5=B%Z692T3R8
z-d@O0qWR@yz#~%<<`eN32?jW`4Acs~zE~w$l1E-vsOUU!90Zyyd6}yB6nwT1p`DOC
z^GQ$F5Y(6e&wRhFHC(EwuEMEQ9(gfU5uY6?!_m+f+AZ5p_8F;9j%$(5#tl~Y0wFTx
z_S~J238kL!CRp%WT&@+RAL}yw3!JkmW;cR^dY9%0MNF7s0uLXy2CoUv3E6dYB_+##
zS#;&i+)*|e9{u>Fn}-wCDFhQ0O62yc9Y$>oh-VK7Np~4YpvHmBaoNs}Yi?NYCxWyS
zak|4tN!ynz$jf^d1=d^e;OLWB3nq2&asDw}w<%JFwV^=#%!tWVR6>D+?$f}r<SW*p
z`V-HK?~k7tMLatFQC|EPLcO_ic~`czd`eWFmH1!TA0L<dm_ojFF~4%8hvU9IcNwsT
z^e@R%e79{r$pEM+7)cCvSqU&cqV!F}am*ldyeXbAhd2j}j<itccAI>6Cx{Cr+geOK
z4<`P?TCd#*`6Ws?V_?S;zgqY>t!P(*b)3&~K)2Qi^Q@yv?Q@xT;iHt|dN3(BjihmK
ziP37f$~y{O{Ct3Xvj<cDo-3YSr!MhzSARW<+>lK8WEfA#A~xr1vi>3w2?AR^jR^6+
zBIkluzCTQenuao1|A(_>HBVLGulMf7oa0koBaA*CstG|>lwaD5ACqX$ex`mS>>14W
zAocVn1z@YBh2EXgA$Hm0aix-1^k2aMU^QlcS>%UUh^Id(Vdmf-*S|Hi#NeSt+4G>z
z=&2~O4&8uh#kOZ!vIus>s{Y`evo@6a=H;XdBZ6pZ#TjAux}~E5tM}6OvV~}CnzTOi
z9J5uOmG}P0`_mx)R~hGT{jXc5SXEcsiTjG(FUaH5G);>weH+`pH{JVw+hjn$=NdwI
zO#PAu*Pd}MN*dHY9{k|YFvOj$s%qbc7sH&H9NLKb^O)cx4_u*e1A@xCpN+?kc6}UG
z!I5eXN<hzUM_$A;`(U@CsZU6^Bty|aF05u^EGF75{|6v@cZI)_heedw7l8vXM<|-S
zExHTpN5#Raf(RVyC>o!ZRH^U-ZFF#R^}&&0AoHtI_9l~N_UTE-vS~hr-dv38;v@pm
z_rx8!EZlLGbSPdC0PQvM3=H4iY2VxXJ32^Hls*7B`Uxp7=ZkjXb#b?vLu_==6j@<m
zX!3!DkARuvX=Tb|vP=CK^l8-5ID_kc_3KDD<2RdgauP)Lv83VfbaI_kxTzsAEgxIK
zsHoy!5~kP)o)vYiSi2#;e86c2KTn4D;;l&rAHP#s+teW7_Lk53EFN&V^N8J^I2VL!
zY@#%B_I^2Z^Hn}+osV>6h9i|7EMLtO0bG1!srEBfm54mtc+Kk)rT-qt!GbQPiyQ9q
zCH2Cia?`Juz*R)B_@jzw{NNDt*~0<r2CUQ@w-709#h}FUp^BgUPG<Qp^boh7ojNY&
z4yV-Wb%KVF22M~otp(V7mwgZ^OY~`%bZ9G55B|_UWgcMYp_cIW-^zZ$);VeheA-Gh
zk!&kugp@hV<FoF4N8OV1qPh$yOjg~iA5L~p?k~y>tVvStJxH{%hhQ2%f3{|M7Y=1Z
z6>b|nty3+Uq&8!?o4cmJ`hKtcgT}TC%2v9e?-%ONv~P{eDY7XX7xkVY*Z~>Qd)iT&
z312<Ndlsy(jhBCTYNp19Y;qUXS1mI_l$(qsQ2Cl&J2)Yp=WnXJ`(gb&0^=>fWiR0Z
zh#!|75@P-g^5;bTsX3#_y7k%ktwS0Rf8s$#gGs2yEd-aS23X|H(7*#9nTwx@QUp74
zkT=X?gB$z~@j(B%42twqp|ib6A=F&}FRUKKuPU!lg!IeGxcc>&YX|uoyn2(}QPm}C
z({>cFcla}zJ_7SMI^%p={kn`qg{uUVCl~E)8(8R}m_ct}-xn|OV+uJw9@I`J-w`m_
z6frozZqKSDP&wMbaP(wgqu;mT)&-aPNPw{yMP|u|5y|)mKIZGx6igNwJeI%YIO}l9
z)OWh!+XQcOsO9JnsdTdNYjH!Q%vnuuoi{J-p~*>ni(TZR{(&w$@iM%3r$}*(rfSdU
zQA6cz{LxCBvpozy_w|&OP32;Hmdm#Ywz?vx3CyOc^Mi7Cx|=TNxnsUoX>Nm|qxEjx
zR>}muDj65Gi<{elC10&2wV$OlhO#)1Y+mQ{9`9_87FDv8xpICPf$Kin3T-%yV3-7%
z3z9ajCG+^;bht;!huV@GjE>h+;V$$C>Lede^<6L$40v_*jBh!c4jxjn>#jET&)%tq
z(0cIg+b@U_DE!3X)OBU4+5<c5W@st9b!hlp&5|jfsyKYJbFWCyudKcd4rxIj<I(c>
z<m`%czG^ycbYj+4Z+WsNASPa*F!BwPE}PJac@qrJkx-^aD0ohAf^h~GS<0%Jw=^c?
zpK$B(@;&qUVf!L0%x{FNHE3=yk;RZlB|8><ZSDU)o;DN8%5%>a%p`VX-o?sPsSD^8
zjTBkEY7TEhhj)*@UEUZb>Vk$&1*k9Aifudw#w)S=V%_#$`tP=q$nh8p%&8wAIC2CF
z5YgfAw!E-fDss?j5Z{^>?e=GE;78`m@`x06PS!vuJlXe3qC<9FAF)&NCm(IGWuD}p
z-S=`e7u~ObJ;VrkM4hN)>_Iwto^ZnIw*f+l+3r0rm+KcqDc8@`aPw>44jGoGcg4{W
zV;HQODc89IE(O2e?g^8`LVo!b=#s%-2%#*41>Ej>FA*MCc#*8Ssvp`b9zP5D14<f&
zqq6inx5W{B8?P$K=DSy68XM+0g*>UJW(IES3o7<nZR3_Kw)Jbcq0H?0)#`Fhp+1d=
z;yIiQ0s@--RCG0r6-YKOJ{})>czju~+cCwlfh9Y{%8rGy`gA#NnK#tqTdlOR{Y}Lj
zEkq~nGl;1J(s(d=psS-Cm%BOTAQ_YVf(W3@Y!$v1wl|kRdc{w-5=l=!CIbZ{=pEiU
z)6!u`yt1jN?{c{yO4{u@+C&9)pbcbm*C)b>B^@mI;W5;FHn9&#SwBvt9!mL4NmU=|
zGV>7$LnI-b)1XM@O?fKw+0?$NdI{e-@L1L5^$m-R#soF^wz0_IpEYw)Jz6EQP%L8R
zv_;!<Ry|*>haw%cvbS-blDBZOt5_LjDq<ouA@__@JJ4+^HwmOz?1XI)-mS?fd+h=s
z2(4iz4)<*{9wU(?C3~^>Gv%93ySIBu=X2H2Bd2EYejc-hkR5lPaiT5>=lk<-)?E0u
z>W-iGJ)#$X$bl$u=_P!>mVhh#Wd37wlrHhhqZNTnta>t#$}84ZE%}S^3exUJq5d$D
z8q`ljViY36F$(xNrLzPd!{aXHQh4wRCxh0B3`4Dr@CtVMi#q1J687zb0V}trsyW(w
zBrxr&KtFz-7&ceWk0!Ly_fTBe!p>&}D%s6EPyv?c*%L~S-Oty--|-+N2D03O&c!^I
z#AnUB9WUP*Q9>2W7QP@$Eyx?5ffquP`s;C}R`>K?4-Hzc9se?f+F~Eq!IRK)Be5|n
z(UNCF#c!9JuFsvP6g*GRiem{8K}U`sa&o8-NPgaE>hr<wSu783^g_G86So!(938f5
z)6@H;EZYrq-t>H*0d?OEIntxFWaB8TPFX)Nl2hR!B6*CZ#r#zo>!ZY-zx^PY%4)2l
zDv7_FPW`%^u77QC+fw?CSJq@|HC5_!VWh2eFA6DB9$BI2qQhIeG0gFINBCv4%Y;5}
z7Uo~6EjX%Fzqb2OS`q>_@6IZ4Y#@%u^H%gGTH@5)Pk5Sb(8C2c1h#H4!sAH!uNm4X
z1-9dZ4`vGqy<9VzGtJKZ#BdMDph+#ykq1Q#`GS)tv_hnmgywa1nXtbHb3qmf32_Cd
z9#j<OvLjTP!6fz%+qs4aV1Yq?zMZjWBxo!(l6zmfKps2V+Y|cM=K5^h<%2sjbjk6_
zz08%3AVIUOm9Orxue_j2E2wjJk$jpIPGE=>qm`~|Ts#pGr!Uflrt>_<5_3$mvHG$2
zCiOKhs@c~S<}k<V=g-RZl>G(iugz0s`Vt5+w5TMqDzE!gmgJZc4S4&p+-qLr?M=9D
zE#uydd!B9;13M|inID5BXZgBG+L3~L6b0^<Cch(u51kx%PgO})1nY75CTCCAKz(DS
zZo7lkqv^#e`uHC5UOX88QKGBrg^{{3t)xoQu;T`o#|Lxf-Ae8DPj33A06T5F;-{}p
z;fh8vPjU4cJP{m=`3;Y;moKZbc|m^eKi5PZS~c0aq!}GK7EZuZk!eY%tBhouBroRQ
zMG}8iBT3Uyb9mydr%4;RsbP_MbC0xZ2{hI?8Q*wmny(VP{v_b5vVFQLCQ%G6A%K2(
zb4Q<^WT8d+t*6gApH)OFGe!M0m$S>PE;^U_+}v{-{KIgD%E8UX=Tc;fG?BaouRL2e
zh!wucG?;pAT3Un@w9Ed0qrIf}Z@aZ=xd~3Wk1jG8Yt9oVmb(P1NV*LYE~>M?=ssXS
z043tkHDT*+#lv4vi3|3i-hwb=nDh9GfOco`_TKCdBT3*6KT|R5*R9N{<J1M}6$=ZL
zR+Tg&;!+6BO5ZFi+upfB@>-9o1lzZ!kF-=NIj>TjOy4kn?kLPb`J&eYTalNoPsd6`
zN4`H%!uUf2-Gs1e>L|k{d(##^<Dxw1o=zm!Js{(9YjBn7i{$6j9HC>(Dkc2~4c|MW
zlOK`}DiyL#srVh=KS4;hMVD<^b(npo9O`pR6m9XS4Z>hU#o$Z!$bEW5UZk*uKL`C_
z&HsM_<qI109VgV{*5VK>!R?|C7>QS6R(c;@Cv|=v83~f>1*#re7O71nJsB?)v~-t?
zT3hCz!ViJL6_v6h^zN0c^9#-GdnRkX7g;TS44Y0bI)cK&%@=QJn9Zx0#ANAT$O7o=
zi+XL<r+N)|$YEmqEZUzzh7^w9Jm?g>hFmaJ1HJ?V;izrnw}~h9is0~7LHW}gMZ28S
z`aYTCe-hA<Fh}P^60t+<*S8grSnxtzgZAASboA@Lq+i|zE0ZcUsJ$y#`kr;F{QYTw
zxWtqB6XQP|`074=O9!Iqd|OC$oNTr2O<LMyraXrXT|KfS>x|MvyQQX+WQi!Vdw>54
zw8;pU5E)cM6hhO0Z*_lORkImX)ExpVFA-t0M(=<=K4*>;$o$>{cHsiDJEMjkePet4
z-D`BXb}<4%)6-}c6SJo`*&7fZV&+`;j=>LV7IzBScrp8_G12Jt;2(JoDy)cgT#401
zt@|eU_3Mh+p`;euTz<ynVE9B+OWAf>3WbuypIQqWARq362jSz!DlkM8C>ov)RKzx9
zoCpOQ5;fMY^Eo7x&`rW?DwkkBeeceiqyvpCsXLv51BMln)U+ZKAP^<_rjL-DP7@0?
zWjEH3pIve;SXcdMFc!;a)9{<wAwQ@>rX;74dL!MWZb&^G(Tf!+3gO{~3VM;vug}Fj
zG~&dz{7@<PhrgWsHkx)<72!q8fG2Qj(4-n%(;AUTe^Og0^@BG~gA5{opY1T66o1-P
z4;gE=vN9V#qXegunpM#kI;d1|e1SZ9$jS7{Yg2xP7e(|*OJEF)%W=zJMxc>GY8r;=
z6%9JI;}<^UFg@Plv}usasDc)c1W3oA>Iq2`z@{C<BK3@y6;KWe1w{&^>-sV)BT0ko
z%sK0boiK8J#>>FTZ1Rq8Eus5sVLE})%7h-rKx*7fdq*wQ%749FVMqr^{`m#>AFmm8
zf@rf+=Hj(~xq=a;jh1`!m?WmlfYw31P*y)ljaw*BLDiLYWR&Upax6e;>U(@$t<{$9
z6a7K;fD({$dY&m@#>N$FGnNm~TkEmy7NS)KH1gz{*<}T$D<f?^)|lqbO&^pIo|U7{
zf#}f*gvbV8hVc>SNK2y&bc$kus=emP<I2EwP*fQr$s%B1EVYJjLtA$WNqKbkMV|b@
zb`B6`4V^`@WpHoq8NR@MUH>G${e?Zer7vL^C9qe!p#($>iP<23vRHk(0g?GHdV21>
z#AJfW2;oj=7^w*JV-&P<c6{7=zyh;9vF|!=fVP3BMhue1x@!ZCr9cy!sPs0~uD55C
z9xkkY6~QPtbUL72JS2}6O1=ecpwa1jox%J@%-IF5UHx&FXD*fI>EZ1uKVj5V2`Hjt
z2fb?;{`BH*<AbgAIe~%;I<X^guuBS5_FZtli?^E%G2Z2jTkwsQbvlfwtX7$)#C=0P
zUozanjC`d5?bc!Rix27;;Tsva#~+o<Gh+S09f1G~ijn1*q2J4`ul2VVYyh?MbJ=gD
z`CzGW?*{hxU)V@Yil(QHUGBIH99dZ8W({KR1r7l=?bjsAgv%&HjL7Qi3b}$D`f<Ku
z>OOq@&AuF;RM*h{m6E^k?RTeye|)<{qq!YE`@!ro9>obT(X|oNQGm*3GPAtjLfgH~
z5qLM3g6EAfH>JF05B`(u%(S0k=#UFYVHx7PX#FL124y-|$b^-yA4q|mnd(m>Usf@>
z8FcL=Y6A&1#*?|NCLBC!$i~)Y-HFUNXsF4}a8}`HMNYEwPYx%H`QG59+aM3e#G)=G
z2N0hl<KxZ*_Qog2$*myr(Slw?V}s_uXv;~B61z;XG_XO8X-G_*--+=u4ix&RpXLCX
z<2;JLI_^|q1}+bDgR77yy>bz*=GKbHuNZ5B4q&Qs1}3gfT7DI_#sh13^#U6}^$?6#
zAxAnWT^#qQew&rxcKf^|GCgf#qmxZ@U-LMFt9aIoonw$FL6oK2wr$(puWj45ZQHhO
z+qP|+uWf7JEN17&MC?XXR76%~Mc$uvGtc=>7jm?s+4SoNnkE4me6~6Ljp^|DCwas+
z_n-m{aSrw^H9Fzno`Mw@l~S#a6{|%}KkSHIhd5!;0E410HOLP_5u9Z6XemurZ-)tG
zyFs|9CsMl`4f~6Iz_MliNJB<X`rwQXKVl@b&xS<c?T<u`KHX>zRL-xKqi~M?H|7hR
zuk@|P7@}|%ga`mps73uUZ*b%Q_iZf|lNQv*3lDa=_L>QA;O~j4Zd!WA+IWIk*6QW8
zWoh;lMp*3uopcpX1z2GmLfzVzyr`+Yr5%`IH5Y3z&KtK!rN}NsOiGmCvPWdz4SEaM
zfXW6au^)oVYVtbC@J}uX<V%!$YJ{VZWf79esS`i7A>HqWHFS^f)6#bE(n|6nSc~%l
z-RMOS>c9Xa(vF(q<^Xl7K&tqa6xaz^@c@~g#$<L-kG{<B8}IA3v~`ez+Jhw>*_7}{
zz{k|~+TsiJIOaKue&}gfHJ!@@4G}!g8lCxc_k0)F=<to)wjsUW!M!2__(J(HWr-MV
zZ3B@|-k!VR>O((V)X8W0o^xRuj{r?LS$vEg;>P^0S`9qipB!i_cJ$n|W>rI}v%pbs
zr2|l%o|DeNYOD>!%+lZreAl1q7Y>G;B|#%qvhE9($8-8~DQ|e<)s<O6<Lv~rcx`wR
z<bR~R60QZ~uboL2m2hPhKV&BxH*goV)Jap?mE$wcLeuJ79MRCU&6w8H3%T{5HS_Sj
zsUmdC5WMFUIRU{x@jdJee)rEngz#p9h5^g9;R!?da~3mbf(y*TeqehePPE;#wo{CK
znb?@Z1>6ua(FQz2tQ4Y<UIHZ_m300iHpbT*AgB@0ktu@GSv7YsNNW9G_NnImf{Z4o
zK>~^UA)G=ebKBxOE0)^|bp|GM5N=DmNqJB~3S>Zh4wDBV<D;SnKJl$Z`|5Hc;fdSR
zWOi$b&!3@mjKtoVlkUYdqEH@C3P1D(QY2kcwfClb^)xBc6BgdKI$kRiPfMi~NCApM
zrlQAcYGj^UVEflLlB)?-RrWQNqS&=g%~~HZk%;-40iU<dTX$FZ3hLJ15ZC_8<2a<a
z7;j72e=`dSG#Wv-Bp-Hq|2esv31OI81U-1R2qG7)k~{>D@Z-1mLLSsV-@-R`Rkl>}
zQ`1(|77jALzQ0$Kve@lZ<s76THf0rQK?DoN2a`<T$Adz<uUjIs1w}fQ{tjeq&jFAu
zi3saw&9oc(^H*c1N<<$z?2d;-Mr?dxj)<GgKHOP$<;UOPrlv1oueX<w_b@)>fd!nn
z^KqADM2qtzOe_e_Y{C^%HUHaNbYwlf3jY?8bE37wxuKO|7^YBji~xM2g4(}@l`Bgv
zBwSL`Q34rrvVM~$MEy?7q#+D(9$HHpg^_n2tI<LnS$@#c(CUZnspMDrm)O@t2<AqM
z#NICsv{1NA|M>%}#X?GG4;hwf)e=A<RI`5w&pZ8IawW%fQ@V0qVM-(3`MT*TJ%Kc;
ziI(-~{=@4ektAzz9NSh+*$FH3gBpYO4?4X>1(3}Cp+SR86w!Pi2^s}OF$s(ZZI$Qe
zpv3@;yy4!-%~0(Y#B!_2ALPx3PbnO(2K}{ibxP#%3@Tv)2h*ve(VI1c?0>@Q6DJL~
zWSWp4ktCMU4y5o9K*>8jZi_tTQxCA7ib_r8%uh!ptYpMAh8Fz-E7-!bw6N<iI<5e^
zUOz`4#pic(FIf29P%LgkBjzuN^lQj216`s5CJ?$J7`m>P8#-1klpPAUG~v<Z4=&S|
zcJU&@t^!bdKDgisTaY_}b};N=BFH|E={E=}!PJ9UzQYqEu~FC2wD!c!Cgi}bM+4A>
z6tPa&=itciLyJRC(aELer3Y!G+-%6Z{DYp4SB=kIf#m&`2kc+s84R8E;3b_PC5>2H
z);OXq>-@Cgn^cNu;XuN%CiS_^yl{O-&lwIBk#E#Bq16%|TQ4fV9!9Iq(_zu#(kq@n
zK$U@PRKqaLUo%cbze3+9_eZ!WH5xH$*03&Qg=04w_3g_Yp&#bf!m8!nMMhc1w|^)V
zWNw6O5bKv3=}bNs#I5?JWjLd9Rn_#IKiOVVILqmV5<ltS7o6+ABgV1+H^ewb77q6R
zON?V;VffD!ssEZA#mvmg{QsRBr3}fTe7#jB61}WN0_#xTzzmJFF^YxQ7@TG~oqfP?
z$`I9HoS{f2QNcnbNs{8@VS}n!?gy<wZ5$&>l8Hw39anPw-Fx}bd#Szl=ge)d@6-3@
z)5G^QNWs~0fk;tbZyu|(srhb`L#TgnU<FkUz@7uw1}D~kP+yx64fe}G%wSsp3_0*T
zw2zSngCHVgokoHt_%FZ`AQu~K|0TeiOsKn$5Dpx{zC9RUIKvP^JxPclO1}Vheb6}p
za!7-J&=6*P9v`&E*%*Dkq$=<o7}!Uq(*Xb@gfYJ{60SW#!`A?Tu?SNHSbM)QgmK7k
zg5b({-Ut-iu;Cw^ST@S=3RvbZ>17r`xZwwISAXevL?}i7jnsgD1|9nXRvQ#B`{%Iq
zM>zEK$-{UI0)Gs11k7UQ1O&DmASM7~m;RAeJbM_h^GD-Pk3h2e`ab}=*uTs>f=|{&
z;k@Y5L`etv`ba!Dg`a@R;b1_qt1p|?45?)Ng-WIoBv{CzhY|%O;i3;B5KbjY09J*}
z{DPd?f8!)f`3Go9*^mooUcz%^f~=cRa|{8&K?9u8kXg0zNQVI?#(Tqz(BatQ;hg>^
z@FAcUDwQ|c$gdBmvvZ;hg4xibbA&@aPo07{0`TC#wP}cf0|)^yL|?__==8I4V`MuW
zn$3vAD<llqGw_RS0u&KYg?q~<NGno6)MHpPP(8Sf<w1mu0i%RZ19=PZg~xuR;4%g+
zdqijR0Yd@*j1oQ!0k?0Qo#nw7GC)a}h5Q!I;WDl+O)U*hsTdWU<jFcYalnKx4+3j~
z;Og+l<wILD%>x(yOdkpdqE+^PM>dxz8T9M-svD>IqTqDq1FVGH%LD&Rx8RC8LjzUz
z8Q;V#4J9O?|NPRvbj1J495reD$YuO?5m~Xtu$`&pkblARQ9=}k&@&+HG-`~)aP*Ip
z%>T;lK+eL~0*eQ%3;e!pHj0naAe{R)=V3!K))X+rAA&TD|2S=?vv<wRV!{>%$ub~k
z_Gkdma>KpS<1=X=^B=$H6D4Ll1&m*PbrhoJz$lr9Md!Cc5-?&E+oQlKAPLC9hYu4k
zi31Lu3d88PoHIZ}0><AI0#Hr!&)`)A@cNU^WS%Af`jh?&H$Cf9_6^7Yu<f(AWA^_e
zbPBJizp<AC>kIh?c><)qV+$)bobKcA#BacWF)ca;3Tb`^oZY}9zyME_o8dBeNNMv+
zY(LM52y4Wy$`cEy6&f%J5Oh9<taQ$&&3@8Em+oE~<N8WgTVeBZue5!@9z488^21wb
z@7M13l)+<5@=<s7CSP!scf8(P9-XsGd$Ad~YuVJS;o)+Q$a!`<j`76ySF706n2rz2
zdu>`_6Q4{5%Dw*_O({=`wWQHoayz<bOrOqhPN9$N5R~pvFwm2=wyvz(8p~#~#^$Ko
zeS2Owe**{Z@(Z1*$QYFWHeZd03*WH`Y=%o*RB2_+Z@qAXX)@B=YD{?lDeaWA=ZUSl
znDYMXOrwP^<C0VDo;2gC9C^e<H72QRZ8JGT4AYtprR^4dF;?;Uox@$+)3~&&-JI{~
zFF=9Lb6V`VGp;lh`O2}mUAMn5X1xTPE8PUMB_6j4iTXYoOKuydvf^BLr!CRb-++5<
z42qZR;w^Z`)?`je-{9x?alU&FJz#q7%2sj`^s3e?CTjUGbR63G`HiXPsjM{!mipmY
zdRTr0CC0;RV(O~b?^%H!qx(SdXq&^S-%Ld)J=&>YtDKRTxZ6NKoLEqtdoj)^yKR#!
z-!25@C+2<0HCw~`n5=vjlX9C^<rlEmCb_Pi!maE^mQ$3q&ANb>Laooe{@wksU)!xJ
zZPF{OBJ38a??72~^K+nP_*5J>yO25R@_Z8+sCj*o^Y@Ud3vob?wflY~@}+9BYzaJa
z))QrNlzqZEB4jx4Ar9gmYCM(uR>yLHPW^a2`%n7Qre5VhmmO;K&~6rzb%A8L7dqv8
zW=SPX--+8aOBRX^f$esv8<MGxVK*Ow7!NW!5#DF;^px{CqkGHZ{AJPPMrHOY>ddh&
zWkVV(T+-05H}Y{iGp{pzg9z9B%Ngv?X=9P`qw+{{5(a9+i&#fs<2>!&2feCj0!zCy
z+}a8#Y4XOGDy&zn)uq}AxvI(PrRkxbmXbH=oK>l*E2=Fdw8g$(dh3*C3od9rM?le<
ztfl!zw>%ZQrV_)5)3H$*R^TN#Q~NHITUhurCF7Cz(>*xr`C9p8Pw0y$demjunC<%0
zcTYg`H{W)4oM5ZT8}emdE_=__KgAAGQ3~313mM7zc?Qm^T!bHKSlfB8H$lb+D`%+h
zS?q+;>o=<{Nvdd9n>XGDEnwAqcss~+f70>4e+%`Gi*+BtsWEb%3HO}^i&;5w*4a8&
z<KfH}<6<;44+x;yi9*)ktkA_<981j-3DzgFeKJL;LId!9-<31lPHClrE5iwkXrJGE
zR*HnE4`lKtwQhls#jiOS3-fJT%hO8X^Eyy)zG(*POz<?Azc1I4TVoMdgk*Xn*0<cV
z(0ZEQvEmrzF_?uu&P)?WJygif@LXJFFfhyKxSje~%1Y|%^`S@Od`d?+iM~%BHexPz
zZV!K-6)y)@op@;Rb`wLr=-(1ENgt2!yR%=O{wzA0?nKH(t-5(t(LG4J-HzcXXK6hD
zna;s)GS;ycF2+(mEHys%y$YY_+$arNpI8cm2IBOdgriImTtmU1l)m3Gw@|A<2cKus
zw78U9yfsE-G)^11;ZSZa0X<#k+jxaSO3E~LN{-q8a)%7r+H&bT8Pt%r*`u2~M4*N|
zGt^dA`Rle8ypqc$x1zz9J<my}gFWfx_EUatzot%hvJUYgyEKvYr4+W#NVxJHbK@SD
z-5}X(heCgu<!%Yz*+67bWaF8WR_NJas)@fM)0TWl-D%RnR4MN*78ibY^akzDr6DUj
z)aX94q9<JIqh6)C-*%spmSNMpT9!Xzim^wTz*cin=k||445~`o^ylGW-TtIjni4xC
zW^NR<Xv~Pl3F4V>$NO}&HA}*1v`gAJB<fLg9h29ky3cbld(P@DO^5OAshJ|P%vbG?
z=W=gngE%SQ;d@DSeUIDLZZo~aq;&nG<cq~*ZLWtb9L_l-7J{$lt&1RcTvm$jZSlps
ze|L@%)iAmlywA$`_YX`Fno*0=*Fg_*POkj#&Y;ttaqtdUdM)n(CKRzDrLaSF$yXG7
zxBJZs23rf)@vI)>%KK2&%Y5HPL7CIr5fM>^oGa(14ygGv#YM<p<P)eUA#dKIw!ema
zr;m=tRh@a&F<%c%Z^I(@WaszF(_=`4A{K_Fck@o#r>#76j*eR*P&<OMsb<k)^j_HZ
z23EpaQfh5c8HJINeH%9|khYe9fC3!Y2)}@}qUcnpceQOi=UQ2c5{){UT4O6cGPjUg
z0<|8<KKosjJJBdxEyw!i9l^%K=9~Ly3R_j5Th!4n?{9`7?PwFf1$>f}RT9dLZ&f<o
zN}ASHp8B8Z#X5t#Qm1XQAsl<`YlrUX60leo26Uy9A{CS=p1g$}_~XPB*)nPxIy8>+
zre=ok;q?|yMbFX`nTb|Vi0C7_K8LxP_s1NOA$n;Y$;c-`ZS}~|(77<sLa^hsN02Hu
zr4BeHc-L^t)Vf}5gJe=S4*-PtFK?<!_ER$=Y>sulw`PPxLboEMQApL8l1%Uw%j;tr
zx<930GN7ZkJ0541=qYaQUAeGsqFsLUd;v?f(~kRPIDUSM#c!7H`{gk?<A8ygoehVf
zP9Kh_lZpWbJgzJMBDyUj8+$%qjHpqng7Md5S$l0-d`j`%k4!6~?%8$z!0W9a68}c7
z{>&RgzB3MWO;PLBc1?8NJwsZPT{}&k82HP}AN~}LKF82%f4aqmM;&s(i&FF_R#q*)
zszYQvq-7^+FFJk|b2CnbFb$LBx0Pt7+}*BDIFp!;$D+Jm>Ulibw^O}}Lu^4t>aYVx
ziwMWxuJiiouGz~f)#^1WNDSZBHZtdZGPQah=Bp_2q4M0xt`kZ*&oAV4x2x;X@DJEI
zeE!Ja>JFrCflq0|l*;IDU1>jc2}?EC8VF+v?HDET|4T1FeIlt`!uCY1Ykp7frn0)e
zIV?8e&F4&`%4q4D6e*gdaNMp{vlMlZsVSe{qS0Nn`QcMgo1c=}1L>wtW;vx5=wZlD
zXE7$z^H9^EPSHfVJ6wM;ZY!7VUnTTelIhL81E_X7N=Rrib?^oEbq|D5-C>r`!<?Ct
zanZGl_oJF2)ZI0e!)q#bR>{{q#J-<nF+6Wky43NMJA0smf~)H;>2RDg`i>rCJ{rOc
zgN?$#L(AyO$OO7HH4~XB-j9@nl-V-u$z=Gvr|r`A>L4cauH5RF<e^%#UqVcC0$Xvh
zj_%|YHp63ZF{**IT&lhzrdkH8hPc{H4UB5x-!Rv!+or{Z_DLB0LN8Yf9schcvOoV_
zL&na;@P8Y!Kg=xuIr^^+86yJ=%m3=gpy)*{tes693Ft+w4V+DcO^ob}O`v#rp`4r@
zO$=<H+&5!dK$Vj(vDl>D#3^8bffjcNcXn`rVHh|VhUa$(2?<Dd#39AqB&EXqorC<7
zoAEneH@2MqcZTn@*N(@|oYT(jyh4>#gQU6uEq|jtI0iL2b{GP`q==RlLjS<O<F<i;
z5CO3=*iZp}zbwYT&H}S^`sG3M_<)MD1O!(LWU#?JqZRzP0Fku_0OaicNpj&ydf`F9
z{UZZ}Z+ZOXO$hv0f5BRT%Ig793g8IPVK^zvi^`bSN6}u^Px;~iz@$V0%JK>Lrf!}6
zgL%d=ts$KO$^i^o2|mYSQ~4qIp)Dc72DpE#K!U<)VNNNAXK!w9X2F`>41zefx{Zwi
z+k*^R0c7H#$2VY&LEl&z_)*Q_KdhM8U^x9-Y1dEayU>=gPT`!v0P$cE>Pg23P8f$)
z2B3~%+^yl}73IOo{{-UvK&k#v`-9%SZUAs>aQsrfy1mp1>WA%3@JmUR_YltyAYbVN
z*MkZ11F&kCu%&}Xg913$f1pAHxAWsa2H5g5fSBK7+-3biAfPS)1mJ~xdv&Kvoz)jh
zht7h=c(4+F(KEr5(-<9)gtD}Qcl7Vj|2iaxbp_Ml#p@#f)MNjg1iZM}|7NcT<5Ji7
z#TuMkNzfSsygG(bjQ`;}UI@Ogn*jp>zH_v<hp=}7;+F-84=bVltb5qZjm_Vi-8&tF
z^zOkehy}PDBjoSZx0*kK4{d{<hXwKf(-r95^XvS@KDd7jq8>nN0012iyAF7?cM)eA
z|E%|R|By3)2S6MvcI^Pf;p_9`!Q_#ghPn)R_-^-h`)RVKmXOFUZ}MYx=;xi7C=c(?
zPL1!M5|xGBKQ#opkBkEF_Tz@=LhxpXg!5}k#i1?)80hEV!(IG)=kodaf%&5gE86e3
zrWnF&i3Xzorgk`r(~XlFr<eUZC-|H5@LP7Pr}ATm^s6V>Sc@=j$3A5D`#T2P3@*g|
z3+J9(O?{>CLp47}YX7z;&oi$_T?Nz#)V29rrv?b-tqlwbjy=vd2H~0j>g8X(Jis8e
zwKw=SRsCo+LZA;G&$$fxb(sUCe{#J4hQD{DtI_M}ZP(6yao-00)Xw(1qcA#vWch5>
z*Y5rfz;9-jPYyO#6y5Ib0l1qT7iA9m@K&P_z?B7z@{$hZo;{1M59>1e=28&&1>m|*
zzoaJ)&~JNBj|5V$^%LZd?~^J&PQ37|?t5?2_5th&v@YPsPY2NTj31BPZ~F*-3|PPQ
z1Ly&Gwa>S2#5|6Fmk{yYCyn=qi#vC=?`O=#Fzg2qpNs1U*y9avp=dtePyWRF>gEgl
z-|fNfTdZvA=;B*xzabAA<nIHx&g@uby&p2(){u3Mz%P?$H=S$xXI?U%Rr^oqKf+0B
z?d)t^UESX2vwPd`K;K>pK|J_4($N&nvLeTDEm`q%rDWiAj>~1!UzD9xT`J<LSM)Qs
zHEf(^l2Ld}0qWT_B#EFMxl}e|47y?T@|zy`OiP8KEM!(qTc4ZhLss%uO@`C4JRdA-
zj`+8Au>jfGO4{CQr`zKq>^G<e$X=lYy0Hlr05P7p{mCA+*&`#p^F#6VtJKjKa9+~s
zu0@Gej2!c${zHpS?Wk!?Lo5^wYEUfXp9t`qr;!sB-<Necsu6cnn7tv48$r7vmD=@7
z%(}XhO>Mdyl4g?7VU%$6H)7<c-NdemNMWa4QjrDfLMIKJXlwgNI2{l2MAg!?tB_^w
zYDcGO-!c(2Wcx3Cz)H2J_<eBde`3n0WmZlKyCKLn%cJYR9EqMSCHo0*Q(8em7X-0o
z<CCnoX<REp)0Rj&szfpu8Emq9FG1x4qZ+N$c%Xxc({3&wGEY()(LeK<EZ)&uk*@iJ
zZccB5L=i@<27$Hm<r?_<Oy$#5%rnPR2VM?oD8gbFxg#AY2eFrMr(G+={w5KUoqR=b
z{u8|nRaQ*AabX!Cl38K=B}&*dM(?Vj6^FAh3UI_fhvx{Ds9GLTvOmfD>nkUM2an20
zHh`8_D71R6`jQS(15J%QnE_Ij5_o`^I*3<k7L|jT#m`FR8d6$mHll$;#u3XQETDDM
zx^f{4gBG&V8VEDRvg=Pd1qQI4qn^pq=auVtveZkCRm8<~zQoyIhZ})ISqie_i-0AV
zXMTtcOVhy*GNlB<AQhVkKWEFj4JK2siwe*I7-pJI8?!RaCx$N<)7WQIk9IW$dUc&L
zKu94Z^s@+UDA5+*io#__kCv~%qeOw&4~9y4KA2?PSmPLf^LMx9YR@ZI|5mRU3Nk7E
zTy<3N84oRserqeLuSU*4iXv>uq}FT{W$D^c`kPyuEix%im^;?>9FE>}0};EQbGgn$
zx`I{J=onqFD4GFf&Rfs?gol{yDd&Q3wCuIRo=_W-!2P<FzK2eb<w;qd7j<;l6!tmU
z-F9s`ee+*LyCg@?%40zCk4B(8L^)BVjcDvZM>?avTS~&X6%r70j<OVR%&Hpv#bdMZ
z2p+}_XQ$?OHJ9g^8hsy@l^7%yZLhd1ZX<mOdpDC=vXG;qgvDc-OATK?0nDbY{_yp*
zLt1M`hQ-#1c1RRt7mxA0aX9*{>`thajV7Fztt-zaAI2RT8m`I5q=zES`zZy6r!wEE
z2Us<CslL9^%DoeASxa{XE8=PLVy1~|H|O502#TbKJkyM%J8o<fLexz_TfCj{tIr7A
z#7e7pH<apvWo;yN#xdC5Vw(RG^gVpYFgdm9GW=NR@QzHySe3EZa~-IM)_<~L;_d5k
zq&y-;AQY*l_+Vv4e{uFIQedkGtD~j157TDh?B#3>)?~L$U3;T3cQA1<to5b92H*uT
zchTn$nAOG)da5iv^G!~SyK*tX7quDktW^Two!<%^`6PQv+$BE09j~B6{_9pKrK;2g
z^49HAWHbnh1f!TWzD_l;CP&mkU4QB&$cHG=cS|JG9vd#)Ry<T`n=PmH^p#IR`mqb`
z@q5iq)Ga}b(N9ZzeLeq~CeXR%vrYP9!AA`m(HSVqB=U?CMU>7?(Bz;4=X9XF&Gv_M
z?wt=3)&c~{En=<WQ>GEGGg3}P3jY!-sl&WS4#D>hVH85Ong)NU*82b>4ahHY;fj*&
z0l|!l)jhz^v&LUX?o(8EmH?d1L^cvPFtp38Tf8{iK+MffC-)w6p~&x69-0)_g>duz
z?o!bUl5i}j-W*N1-Li?CK+Ht&fE0zGMNKRy!1mYT-AH@Nqe3vTVt!tUH4jdWZRr_O
zr5ksRc@f49`f&(yz;ri_6;y4?Ts1PXKwYJW9A|HK?r9Gt2S$-Y*OVC3Cp5=LhcsUp
z&v~bWsU(Y@leNs<Az+~3Ixi}uct1uKb<&JHQ_3-j;Si5Cj(1&ky#XO&m1%nnU(}H`
z-g7UOsnuP4-mQn=*hfkD4eynx>yI`Jk=|D3sC#B3F+!QDg-*O#-EBY8a{`l#J1MBv
zH?ANy#uo#hd7)ff(v!@?>QEL-N?KvxcBXbIk738ZW)7yc^N5xDFT+&^HKydo8npPH
zKVy;IgRmF@4-C(U$%I38(G2oye&1^W_YLhq!t2ohU!>|WeFBW84|!r5@2-w0g$hr3
zFArQE;`+(uMa$N8()&;;IQ(wL^9C0;;bOMVn#^01cH*N-5#G6uk%52s&q!hi*Exz9
zj>&O;V9f-IU`l1g85nJUn3Y4#!A;rG604`71XQ%E7}jt3V96P?V`S>5{olrnv}7=i
zc?`W~xQOM#IgmCbtC8}dXmE#DHYQ-Tx718kN;dl$F0-`_8q-F(#m53(klHNKlgr?=
zB`m1wR5=SBUXnT@3%s%IUcW>R?#b3OSNlz4qQv(bMT2R*OP*RfE2=8x<Qmt$Fd8^f
zq(9Lw1m*eu`qr-$68w+iq*2arDM3+QTs-!eNJ=J|zm<ybqUF^<=t>!p1_qg;9cEaU
z<p0pn%W*WcW?ft45_^odJ%}M!ex7DSej0><mDtrACi`F_K>ZGKd6^HJpxyNNb`s)V
zzVvEkyLT>(>&au{q#JKqM*C*nhHp`k;cvKd(7pMAH|*coM<ICQt;`kaM*v&{p7dFO
zt<3>9N-w7_cp5~NGj5;?9-tvn)EsuCZ+3Y^7Vo_V1i4%H=eEvvLq)Ii1pwiG&P{by
zA@I%oHj?JzA!f=4YNAO{qX0hbdw;7U_lwgLF+Mp?9#<<IGJz<A-gLv$F1+-zXuNZ#
zET&Nd63-`UfBWAZHz6{#DW2<%HBn-VEQkQP1IBeO$YsuP^0*y6$1=5o>j;A=3uA}L
zRolC43iXQO+dr?1+k88(VM)}oX&nr`IRSJF%p?E6h@<CC#)Cq{7lJ#)x_n<{pA1q&
zDQ+he2WGsn_7GvD>NtL{gY9Kui|SWV+(O-^t#SD)FMiQB{I!`rHO>{4U2S7su0;Q9
z^aG7~<oG9h+~lboXW6EjoFGlej?hE3r{5oU_9E((i)g-4Tj+7qYS`jfafqIG=OCIX
zFtFL1bPp=ZPI&}?Ff>Op^z$9mHZA|WWTeS}alOCx(J;&pPOZPh5%{3;>Fb`$iTn+$
zEnKmO_rgNBhDPiSAC+Pwh8sZR>d`;Nr*+|=HauJLDo!n%S+8A+y0aVU)>5+H!s=B7
zWA)N%qFxj~I96x~3k<(>>6-r=L{k$J^DRzqf*XWw;9|sF(8h}WFLwG>E55Y-#^{25
zmi1&-qek`~JT{3pPgJ8_AK`eR4iHBS>vON+LU}~nHCd7HpCi}^`q|=C7RDOc>8m!>
zp6x!O1hMl3)DgTZYpFXpg-*TbCXB)w5Hh2cy6H5i)*{Szgm4ffEcQ=<XK6O2Feh&j
z+>n)%l{ZFt#(U?>K(PJICoQ*Qix#Mn+*|+KKFgdf-?!yxjhko&y{e4RKG}To=R=Ai
zFfqlR7E25iz)?@jU?OIm7UmnM7iTNvSNp36@pqgM1V$6haHQBNL+;^wr+3e!8{rk%
ztIx@7kXBRsr`+~Fxd_Fwk7r~&$d_>PGQgE;PpdrUB&NQeEbc*enRiL^_KJS0biOV0
zq@tgJIR9f>4iZLzgJFH6os3EtF`1G~x2K55Ii?GH>S61wg_e5&c(gr)RQ#y9-jklB
z6t{SbB5U_DIZ7EPo)Du%WGFxQf|9XOy&NYiBWCw=?C?A#n*ygQ{_2w)w(*fZf)CvL
z?_)x$)N138s`wLh3=u9se|upzzRX>~-$xns7j{-ddR5yQt?lw_df3n+QA*1Dh^Hj%
zpw>lrKJQ8r7S-e8V?e=C`a-Ok07m2iY;Bpe-NO0owDDT;qo)R(R~c$ryAT0`6r60b
z&b)<>b{eT#C?-R`%)Ti|spJclW0+yHxm@|5{8#@ROZ|7t`qF#?M;zD;pzp%5wMKP)
zKwXW=vf|D;vh>=O{AkH|TF#$lS(@+YH(YOMibm7yKLqArWnw-|cMs|TVI!{|vE<p)
z-tL<vkU1~oQwg8@Nub_(sdThYK$d=FzjUolKr~Oo%5BQ)s~mpoam-Le#7HfnU$&K&
zGR0L)K_B*k^#aL5QN}eeHRp=E88i@&QrQdZs_hq|5OjNCv^kPNr$?{!RFbtb4>;%X
z@^K<nH`3A}x(<LJ;k2Cb9pqNq+KAEkfk%gmx(a>JRof2Z-5vW_9=J5Mh!}GqV#51u
z2V66kBQ|}Uzc<O>OCl3taVHxjEvD@WX1=&yM~<uH_QH-~CHE2Bc0uY;)VjA(X!pCi
z3nz3e8P=1=lVTcNFmzz<-9N<=x?Y}1HPf=sg^>Mmqp1t^_qf4dM%6VO$1`Df_DuW5
z*|(|`_qOb{PBL_%d+?&wOvs3vB*#hc+O;mA#ze2SL}gBu7a+VINWgB6#dT1k3>)$*
zuvEM<(h8N3Y0b?NmZtH{s@-9!x92x%&)McY)=^JjB~ZYhEEIo=bb2_5l0DBUSipDo
zajk=odZ>5kbW@%aaAWK~X2dvQvO)_*U7^D1+mf-g*``^Trjt}Xv%Mt@{hyT<F0r#4
zTb1vaQxb9<alA;FV#jd?iaEDKZ2VcWyL<ix58)G9|E=l@W!wTKhC*v#o7<gkZ?Cf)
zn@{VZXTq`QHcN&}sUv_4N(rpL5PN&TYWVK-@S9$VGKrs6J6(=_Cf=)caVe_pj$AK>
zAaye}s+J2});%SIbx&VGP>2*USN<zw?-WwlYviA7jiaw5Y$NvuQaPhhKS_2gonB9x
zq-JSaDaGeQ&7{*q=u_276|<dgOSGf2Q4=jq8adpX!WO?4;j~cV{8ao~SXkNb?dl@W
zwk|qkEe>e(P1!h9lk^dmdK${a9IBk<@rQ}j^K;i!y-4kKS0@D1n-axoHoI&+s?47?
z6hG#1r2(~8Y7zSt$q3$h=n4dISo4ZU?x@)<^BKa}gE}dU+z6o^@!n$6f8=StspR^m
zQ&Y1z5uUtgP7glO1z3;8T@Jhl(2wL!DR5oJ`dkvvhfnfpvEtcm?QD2)a>p6T#=E}c
z%#DXyD3NQ8c0(kIA?xPwMx~=mSMTwX4OS-1hS)xMjeuZ$A?gW!TXv50T^1=%dxLK6
zxqG+!00NVy{)<V&1tIMTi5;Z&hZ}DaePOiyu!iuxReSI6d!uq4P@B#j@Lw9jKpj>9
z#x4yp{J4&Ne-PVMZg2KnGN|{6&V>7GDsB76(qLca_+@Zy|Ku+;sojFW3l(H&3*gga
z4AXAI=nV2UN?rEGlfNl-bIb(M5M{96bf*~*hn);%T7m92jqJJ8#vU8}40LR(T!Y<o
zFK$d>U(<#h#-}bz(_cHAC`;oNL5No#8@}(_kRFZsHGj*&LY|m)MQbFvzv-22D-~Mu
z_oIjB0i7o%CgHs1ZpL+)XEpHFb@pEE{_vF&QsUf9@G-WhWHU6c)uoLZ-cgHsMo%4-
zY4*e#Arl;z9FRGqg^0(#vSmmqe>s{PN88jtQx&P~j6<$$zr2I@{o}M0-Yw_+wXlW)
z`Demz<YIq}u=moA?uGcq*&0p!Oir7ftK<p}1QjsO);z0J46ABR-Fj4WR!?Xr4n}WQ
z-VveM?4Y91Rxnbu)Vp<d64)q|Q2W+|__C^f50Ef*AmrG^!(5kuZVnTigOwY&&K5c-
ziHDJvyUO)c!jIXi-ljTffS7{wOmy%F0~sY{d1^>3xCF%4LU4e;SG$tkyX82CQk$VN
zIy3k9mhfaImu{b~4m|;<rcs?L$zAOreX(6SCu4X5Hz0vxdIas}H^1hNnAoD=d3XG(
zw5tLO*Yk<cEw9RCx9X78<SR0n;LerERP4>(<+eiTaTsg)9XF6Gje0Tmgyz9SN)N>>
zs5u27o;b@=Dp<gW+a>6Oakkt^jBPo^XmmqFDf&C(Y4$>AyR|E@>n%j2YzQ~!`=G-N
zIeMiiLd0;uL62$6{xLqgX&`Lo%ShWPMn&BNnGSEIAE&!{zGEB2<)WpXsih(BMwC{d
zqQcJliG*eB(sQZ0<E|kcRFwluZUW-|_m0wHh|)0+=J@Ggj8871IO{{B&k9#KMXp#4
zQOIbeV>GNZpc26PlQ9D`bcuYZm29y#1#-6iMv^dH!iXf@pmu5yrvUp_h=~DRG)^j_
z^0)*}Es)BprMP@no=khQa?4gSk7n6wv<$JSHB6Z;!7}H@rVnnz0#OK_n|3pkavrH&
zq%g9OPR0Ne%PSO9@szDpQdrk0cpZuXzc@h{)Rx@&aaPfVFOIaq(N1({sfgKMxb>5V
z7|E~>)>Femod_l~_4+~8C-;cwea1~Zdhc-(EQnwwRk(_f1>R}}$5dT7XhitIT1_ZY
zcLH<-m5HTh{ciRQat{Z{J!AEcpsA|r-sq{*CsfbYynlCwpa$a6*iYSL=CGA?!-_HN
zIMxnZ&<Fm$_TG78H2Hk;Vn&aL+`Z_#lQ<x3+?Jw}!E4&9Eg%nV=r{WEIEEH8u~-{5
z*rD2_LPGHF53w!v%>8sgc^zLB6DGG5j;Sk9mUaPdLlzaYt-R=pr~*m+hF7h9Vq~sJ
zF!l8s;;><v&)p-~+CVosF50keaEQ~2dP3u}O>2qYD7ITHN8m`EH_q4nOJa+PD`j&b
z1YacpsUVtQU`6x|W`y~-h1S25fA)SF`oGl3_0aTxG83yU@Cw?ZlHE!@oGNK6xH3CS
zxS94UF|we~o=4A|aqeUyxVUE0>yuh`DP^o9DK$^Pz-e<~S&rX;<!@=$Z1!@mZCT_T
z8<KVuxu>+sha$=N4@(2qZLTJTchsPsgCqXQNXO#uJZ`E0dQ1KRVdDn$K{`({t(AOg
zAy3S)leUAY8=K}4bw1%?QSU^kTJiYUnpV!^Fh_fuCR*i!tZg4hWy~HUz-|`2pi7ZM
zeR@^cnQ=6Gu-1vLIgIDNyO(i@@fp6+7A&OiL%ceU6?m%~W2!j_Nay*cM6atlG+q9A
zi%y<Al!#PI972(nFug7)c5SYcCPkZ@RkPSx14Gk@aBQ;@?_tl9JtYe%f3mRd$@mAz
ziHveOiK<bl2%wenPW-*e8^2^Tb(b0v{&+$N#LnqvPxZpSodt)Q^Qe&X?(T*>qAa5I
z??S`|8Y@EVYGfEx-qWyvl<(!-*NOous)0pzW_H5c|1Q5+11U_`E3WX0OOEkXznJ2E
z()qH{Nnjw&TSSmpQ)y~{6s6$Wij&>F4_KBX*Q6f7U~*=-l3zd~0z~D^NJt2pq9i$H
z(f@&a^%7aQ^No8i4`oRhRzK$$iP8uo;w4dTN%ZQNfZb$eIbR5Nq9Tq-#RWu1RI%t)
z#x8)blpyVO0CFg@sg3A;=Vxh_2@?GVo&vwvHm0dmO5b+@-wm|F#*OimYoZnnCT{dU
zCTlQ66=<Fnxl+ye?gF}rRsxS`#{A$xEC1n!-|vp}kR{?XcW}0|ZcH&VX)z;QAnd7~
zHtsQNI?!#Rb*q3K*&nDX*%Ip2lwb4GPSR#L0H@5La4T6uu*3z<J6Lrpn8QbI;%xwc
z)Epf=b@XyZtavvU_bMK!9WJnNO30f?%ubxP$l0emg4<zmNC;CI$}MUv3-x}aSuM_;
zb}NhRjo8h8%h)67hz_=MD1^Gk0HedxX%<qn)tP&=+A^zR=Z#;0@|tPb+BAA)>dnY*
zQfQ9nQ2~p!mVy@=t@0$0rXk&wo0Xk;eX)&|<}LOR*PM$*(3_c`EIoNXJN%Z9x>l9K
z1KV13jR+crB=NyaS75CVzDiWQ;58AIBzNl?gCap1X;uBOJIN!zC&UTW-4rqAIoU+2
zS4}e#(5P%$lUIE#me)=-{gZRXf1$FyXLLW~wr@w@2LT)E+u_@%2ErN67YP-1yWcUZ
z5lCO6qqEl6cZjoFuUnBlqni7dtKFJbz(K2o&hA^>f*9@N`W#_SqXy!g(OU}{nNC~@
z2V3ifQZK@_ImCMlN)9V^<f8XDtR@U6G^6Ws-K9>4-f*sp!e>zXo`s$oeo|7)9DZ1_
z$mX-&;UdCDAAU40{!ITu3{mS0dVkY7beTE>9;Ca|LN*imN59w^$tu7JTenijDAtd$
zj4&O293gu3lQ&_BIg)5nOogyA@9b?^_I;aESb%Yo@ZJa~Xr14!zozf8zqxATA%@Oy
zQ3OwfYZm}`EdtIg8g_tI7i{CBY=-4Gt;&GGl+)Wt!M3fs<k&KFN}!71GYcZ2J<n^l
z4N7%c!LZ(a`x8`+a&LP!jXR+9WFdwVLQ4bS3ExD@E@j;WpxE>Ti#!;moDZ)#S%u97
z#k4=#CaXy#Sck5f-eN~BkbAvh*y(vtd-@IV<Koihb?0<K@q!^Zt7o-U0KPL|LG-YK
zp@N-jY7Q>A&t39Egj1ZDsVrk9VcD9zMJ<%g?*(O2wvyf$$$rZ5%J{2ecKeA+@pDv4
zYTb8*b+2Eie`1Opc1g!Vr5zgBLd@#xoiSEiC&E?8oy%y*xv*gfZtozJ&_ebq$XMjZ
zw#D~C68^CXZ8G{5#Gqxr2R|yE^}rM1yleq<B9%*EEI_J!II|=mom#QEnitU}1lR&u
zHTUp&de{5GT}&kwJp`bU9_sGyy?F7P>SX@({A%Cb#z_jg$4*l`j5QKJ9fj37AGw0(
zlMA@jTYkCOi$nn*S?t{gUxr0%Gm#^^hA?pc=kJ}$A2YyDrfqrsG(M}gk@{EZYsZgp
z!!GgUJ8<T(AH*KGI3LR~fAl*Kz$JldbjVwUIMkH4BG#tyKJvA;1Uqws_sUO`tp(OO
zF${WbVmRYmcxLhwO?E53?63}D`TH~5nK+<fl$RFUMl`dQm6*0Zm4$V2#24R}21^@`
z$g>rL^NC8GJ`aN~%<c>2KsV>midLCwr8;WZ*;KpReS{umvb>LS+FMaw53DFk>G(bA
z`mjg@8#byLc*Q^Pl{VGW9^>ozMX!n#-tGlB38E=9wsSrQ#d)yCt`i#Lik&cEp7}#E
zCb-O+1rmJoN%fKBV$F^6hK2M#=wkxr&yo7r3N4Pcu}_T{i*^Nkn9J<~H}RjNnFB2@
z`5T#!1r5{tRn>rfANmfW8u}k=Hk|lu<{Wv?Ox}!ji_o=88erqD*I9Ys+`|vTc(0B0
z*ZLP%QDXKFtFeqQtz9Z&Q`kI`dApWJ!iM){@|~#1<O9=KG+;z;kfo_uF~<!DskyS}
z1win;I}pYkufNR`6ccwuS~zF$c-d_;gyJ+*QphiW!hWb!1L>isN}X%#PkzxZE0tSz
z>3Y(GIppuhyRn3H{nsl%7#|E4Ud@49h1Z7O_2t*MFEuW;v~oQICmuT$kwt)b_!Ale
zm;JZ{m0LmfYc4m)jY*|ez-gOY8n(%|=5QY752U@{a<w&~q;>I?3#;3^ue=oJ>bEP=
zKDHfeMe!3EjM2pG-6C3eo*&h3*CH^U93qKRR<cCQudbauz6wOVWV>WxWq1Xt>}||j
zFz|&+Ru^awJhwCXG$P|8lrrkphAL!F`BidQjM5c)NaPf(je9@hb?g$2b+EAwqXh)E
zfFJo7d>$>k4ZuuZ3|)^i0g<^^jeL~Mi|3!IWS-V6z_~j&kY<t!(5phP(@9pv$*Gtx
zX?xkTB!zV}@0gg2#V7*jmhMHVK5ZXNwj4P>OsWMM`Fzw2`o5aY9|5KY4w79Ts^9{Y
z!5aitz_K^hA00o%p!72xaWZQ^m)=5KsHsV7U(H7g(hKAb@QNS?cD}YLp3SA2UG==f
znrZc(aC&0Yyaxap93IHDE`_;F=^oes3_<S{C1Ov$+dxl!)(pMg8JyIhhq{CNWLgED
zzY7Z{Up|_LQeU&GONNUyne9I`(o>-{&}9^_PM}dHVo(Wb11TzntO>4lRgkBUAr3jK
zz=Z@D`dmC0DP3#Ums#2xo`e?dITYdR{&_Is$U2MlA3kegGEVMRp$p@MJ#QKg<lBg6
zOuM2CL**V)vk7UsxADLIa#MvgeORDXs?OLLI!6*|KB>;q#UJZ&EY#J<h<GQIm03Mb
zdf^H{OpZnY%?N$s(Y?sCQ(j5Ime6oif>R9vE~i;gveBvcG5yHnUmi6GxL`z3xvxNR
zMp|ea--Ain&>}X=FuN%Skw&<q2%0%)z<!dy7z9iE0`R=36O?(#lE?~bDHF^Z2`z`5
zv6I28)H7#JT$20WAH`6MKQ2JlD=xSB%efRAE!GdHT~enhH6#5xTsbPY+Fao&W9dr^
z#^<wDR7pwhC&>|40=yilvpEW`lDa6&XxlB+dtKz98IENw7P0j<zW}8!XlZQ?Ysf-_
z@MXINQFaAOgXB|SZd9W|%(!HAQkCPfx@#{I^1hgx{X0?kzJJj^2f0A30aw?#FR}IQ
zWS3R{I1E)be2!OqMc!LpEP7fz+O~RorPR2@G1v*?=-ZhLO3DlCAd#EJ#Kw*8Lcl#U
z75X6uvYUza=57(9FF12q#B@+-5bArg>&153I*0f)?qwa6bVZs|;q2?-@`k?|cF7W~
zc#&ua{C&P>9@Z{vJH814j%5q^xy=#qGCW<kh5sho15YUCi@<{xyh^-_s_;j=s<}t&
z#AMI1Y@1M>A9UB$ijm+t)_5#CFFv3!%W|13ON$}O`%c#^J38#Flh{jv%3tHR##3yP
zFMkrk*7-*xojEfk2_Eu5f(XM5U)+u;J10?cbM43$q*c!S!`qiSkRc5n<G^csX!}ae
zV{fgD+cJd*F_P~OcOJJ2ZjF9;Nl*E%Zi8Sl6TD#C*I_1!CwLB~ke%p~dWpi;%_3E}
zj8F4Ywd>aSw3BX42s6eG_mQukt5erOPEQPf#~8hIn79(tp%^H`Mf(AnMH4kIJ_UAD
zS(;G1*WU@W!#Q6hSXiLj21-0y{Z|t+Y3nS0waZH=4vZuBt5Le_?tMJ;rI$T>46h(G
z@qke3wTPR~>qT+wP>(vVc!<83Z*LJcV}5&Z-uROur+XTe__YELFP7wo>QnL&n-XaP
z@tLa{jdml`b!dMJw%6lCn-xZ|+=9K2uV$Vi4zhO)D{OCzYQc;8pIj=0nha%WyK7_s
zWJy)#rBE-XXRmdgDTlY%Ek|Kq1$yb>Jm1sBuyB6RyhIH!5v~Rve&n)s&lSuyRg`@>
zH()mKT}dj`Zqu__9zAu?^>EkDosQ6{qK9CODJf=s@U+F}?kdw%I0czc(>`g&zY1sP
zh3f!Y&tX9S*PXSc>yJ8O9-&y5qho_9>B1YR4v-0b=7IjCKyF*eRuWN+4Y{s<>ACMm
zGQkmRT9S#E`-LV@h3i*%Hw;xpCpTgoZK5OxdQ$M(N_N?p)Hgk+%p0Yzfgyz?(Ke0)
zMIGN(bDq{Ky*_d5v*m5Isw&4>+i-F|ejeLDcp7>+d{GjgFhv_5hD-uBB9l4#rJC83
zoB4?r7I(?LlJ<(;Lf62yDg)OPJm*@oQo{Kxg~i*Zp-=wH@#@P8`@%NkWbW`6o2KQK
zbm;6*;Y@xt7MyR2(WmSEP}j~S)>K^69PJIfy#i*JrjKb4ZtW=>U02=ovshz|``xq=
zRWCPVvr{>rvUIy~i*~%o!?47AI%<kzkR6GJ`1pb|GjhkZ(s?LrWcD<5FW0k5SI=9{
zGY6ZK)d1zbQ&WbQ;BkGFkAb%O&bfsLQsMQWIkM}jX4cQ8LUe-jI1DMhT9(cPe~0Uo
zRHjv81<=&!V%1=t{Br%-$Opoj`&033MMPblwAy_);;my(S|7n@Er4JlfLSy|<`U7f
zE>i}D4MK+PZm)(e3?yv#jO*r(+5)!t26s_m^>F{>qPBt%{g#gcmgTWkF+Ku`s19->
zc5Wx61m#+NY(tU74U0(ji1VaJYe;GI0C05^()GywNAu{unbF4~bp~Px6J4V6yoOin
zkZ#OAp_ZI|W4(HDKHaCquZ2V)Y8Gi*l&P+GkF$gbp+N)nJ#|}0#uIj4)NN!*8c*d>
zOh*4#SZZdz`$!@;r`cWaSJ|V?i;)@7R}7uk%-5C#)-Uo!wxoRpWZZHnlE(SZWTCGK
zs&n!&^v}Q*16-7U2*@_&jg(-3AxMfgBO~O3|Bi9cIy==EOsZsI8*wrZ(_J2$`lyC6
z6Cu(tO3=UK)BTc>WzBX`McAnG#dpCx=C3CeKvC@wx+G?*I#TWte#(9Dr3WS`-X*`Z
z$NHmFleHl9s{0+*n~$QOO+$uWGzI<2VwMZ?H%-NM6d0RnEC@<@UAPgWYAFR~^;;d9
zb}Y}5HJ9@0u^I(r@%Z>qQXoX9B_z^E^}secj&<1T-{ka$tb;n)Zn3bz01;W&JB!b3
zz0G{i6HTz|d;HxXmM}m<`8d?rpfB?ouTmcYpgM>X8_#%?yE3N`$~yxH`0Y8~l)3Us
z_#+k5g7jt?$P}Cm)Geoj{fMaX!2{IpjZbDHvn~cgxF40l7W98R>k2EKzu=q-ZVdm8
zgp%pMN+{(W?TlTF{z)Mz?2S#8P1I=_=~x*4#Zyy4(F^_4LOR?1d-Lz{{~21?*$V$t
zOcGECb22e7{$XHdVqs)r`NQ~!nt_p=fr0$rJQ+LV|JM{{M+19%6XSpKO9N{s6DWFl
zWf65cQ5S1#Ljzme|ENXT+`@_A-}S$0q9IT<adi5(GyyXmBMT$zA0{?dS|&QS|5NM#
ztdKz3!qtS}Ur{WS1XlJ2&gM=g1_ZAE`#Ux|COQVn|4?|E*c#gzT0${#{8wY2vWLA1
z0ll1|rIND^6um6LAJ+d+h&nns6L7Hpr?-!QnTdnr|JTrWt!d-*kKOZgqgN1TaHC(d
zTY_22j38M6DoNN35(-bIfwafT*n%s0Th}+2(7bBd#8%Ak>U%C-ZLY>S=fTI>)%ujl
zD*e$fOq{MJ&GzO#SDY#hHlS>Duh&RmPfuaJw2se$EV(eOZ)k3qF;69JY%l#rwjVnt
z%pnbMQv!tYVj+VZ5eLV@P;!)LGD(%`Udnxq2)iUXFU(|9oI_EN;Tn6RUJ5L%8b4tU
z&alB?<N&@l0Afno1Qe+rPysW|SQQQU7^)%9B;i%hlmLZn#=4sE3=qG`u*Q#20qQg;
zkP-T4Fin)XY(SH9Dtka!!n%Q^J~>@|KXCrfxj!_OnEN8*Sxi63F`ycfaxWpZkmsIy
zI4R5{&=-mFbD}iZr$^&I8fteVVdsdI4H=T?Q)z%ULvt8hy1Dee7@(U+*#X4coEHT>
zcRcVF^k>sNh5ImQI}!$vCI}V?4OVdi@&OiF@-W_|`n-LNzd_*3I!v`b3>)@bpo%_}
z6PT2NzW)^k%>LXyEJzTfkUuGiAVsh~nc&D>AZbV=%VX*wICI4STx(#HK0cvNG`;qc
zN|6M2x)e*Oa9EG95hOGiatt%S|A;W~k&Lhqw>OOOAtDXoe5~lAixBgA$e>a@qJ%3$
z@%U(P;07{0EMLE6y88nIAO=0T0(Sty0FS0iG8PDo4njCdJ47M{1c^C&hm+YLJ`Fwl
z)hzBPe!n(c#0!oRc-}E3O=Q266Ydc6OiK8@82X+M`@x**R1*4iXph0y#y5C0eoG$P
z)isFJ@bTX|cv>`5v+H2|Km)H14dQd6)nGomwW+EViLO`;Tss~Mxw9s(DY+}yYk@&&
z%Hke0CH&pMEo;zljMHWwr;fQ@`IPX79!}pGoDgpS(5`Mxn%2RqHTOOyyJ+NS-re<z
ziJ~Vk;*(xPODxyeSyrVmL4&g1uA&o^bBw{}B9RXn%20%~b5|faqs_$hm$UC2D5tcs
z>Eb@9&{o0E%m#WbEM)qaj!C1=BxSJ;N=f2C8|^0bD3j2?N4z4UslHT1tWYM!5XMQt
zNq><Xv65u?(-xL`Ifz)Vl~voUL2k1SKDwEZ{G0wqVP_r<h1bUMkQ5?h$zCF4-;HD`
zBO}WUG02uAvW^*(G|0Y=k}a}iFwEE)yRrN%*-0Xd3E8uZefR3T|GekC?>X;(_qpdj
z_de&I^PKa1o^!tUl4p9UN)|ls9Lipx0(c)4K^>heM^$X$4l+H(%VtxzIzqxeo-PP^
z0jKvDDz+YQXlu1J#MCVC&K1Tuq^9N7DjmhMIBBx!Z5(v+ozd+9?{u88V%kxM7w7Uw
z5jN64z&d)b92tWtLn~aje;Z)I?r(Fpi><IC4%~5GiR;KQQ%o%9Cx`L$dB<e*Xk9fX
zyfl3^c|*S=X6&PcOV&l4EB6v$2}Bq}z8QyxCt{Z;ja#;DI!RPqmLd6H_Dqk8<cG(u
ztIC;71_I;J^edQ~&TCInq86DJ3WDC?XNlL`B76V_!!J=3cFK|!rsTtr5BDw61F=)x
zFJ_4WOYU<!n&&szz`9iBH(aN5n~q;ND^sd|#<JWvwetgv#AfTjcyJ$WGnB57H<O)O
zW9ibiJG=1~V=t0koD)N5V;-n2<lxn1{iwhURxey8R&gpdr@r_Nx@=*y5~(aQRvgzL
zqNCl8VSQ-iP#k02r<m~^<YMuy^_J)0CvHgZ&C;in*us=3w`!g5vZ&C$l>?iczQt}<
z9fjBD8o19dyQ}|D%7U_@v;VOexX2>mhf!Ylm7XekE6xD)2`xZk`NSi}NIDI_-%q(f
z1p9`$RGU_Jetkcl@)*5?KM3!GC8kbeD;NrS)z#mkjyG(>jn*1jSs9{#{!Cq}oV9Un
z_n38_uTr2`+<p%pj3irU8s9;8O2Bt3n3*RIeyU0}p7+=C2opgZ0&Xv&54uP_6*@hs
zR|3kMrTufAvaSRqMhf1Q>36#8(#X7T?H?zwxqd)%N)yl)@H_5+?KI)6H<Mz!?|m91
zKuJC}zdyUae??<XGEVSVJwT(A+?mwWDNn00yKsD5!o095oVgXSMLr0!-O%?}ZE`(`
zmzMSaC9r7!Y=}tC`6)j0_NDpOoR}>|(Y9JZi<l8G!$VZHB}kHwYk!*`3!Sx{&73)#
z_gHm-nCAx#6tmABZ>r)2h{u%a;iJ;SkGk16ssa3t_6Yh%s~Qdn!oYGh<#Ouk+Vg=w
zpzXel>m`a1<)OuJCuAmnBZzx7Lg=2_i`bkKAh(6LP;9S(0^o3Ink3MrJAkacY}9V?
zMdWR)_C#B$Jr*D)y|&Q%n#+3@%lDJQ6VM*#js7gb*`puB$ys4TtPFVC$C048tt{PD
zv441cldt~XVepw3VX_jt&f(>N{IJ`BS18(YYfLE`C~+iZime0X21spqq^-LD$tK+<
zjt7Z@|18k%_LwoPo+x<URg^@4OpAcj{Wdm}!<*tE_PWcVQjo+GCD2kj=;Q~!zf3Aq
zC<1apQp_C`NqX;am(U)ITg1$+3y}S&3AViJAn=v;U||n>z>xu%*KFTUQCC^*NdPib
zle`gqFgH^7V+BaqK9$~U3h-xs!^gKOp}v95Hk)h-u39j>DPFV)!zU(ePH<+dI6773
zHQ1b?MPDmhQIPnbUF)kNW`XyNESj2B2$_Z)713N;e&`*YdYj~NxG#cIY+bbAlxz#{
zP2NlpA4HFPBYf!xKhEJu=faa%rsUbt&hV1B_-G_=GTc&p`&@tO`>6y;S;N3MDt5>+
z3#>|7Hb0_B`9$Iy*#5@8v#G1DWVtGw5MpzR-x)WFJiKFv13Kk$<yI8pbk(S{syfiE
zj9$f4ZZpE95Z=8PD@sH-@rQ$XM>JWry_(ECkKYN)ajIOQxcX6*lIO8$TZrQh@ilcz
zV#DW52_q{Jcd3EWBi?RI_$C+mW4Kh+Oih}%fKSwewcVcDqo(QTIy{fu-ssbt;^to^
zk%#>oE7ss@AsXk0@(I9jqS&F=7mxn>HSVwm4Yq{rbvnxVx3%|r!#AHYbmvK<m-HOm
z``^BvVfthnt(S`{9aP`-dC7?I_6_U&$2jAaJ@?Z&-ieR8{xrUqo}dKL4gA<D*3O+a
zu&p2y%CRPIov~!`>6kx7*Y=g}Oy)fH)vn0l4ceQh-b*~11>em5AoybqsiqUP{q26C
zXDKnxTZEB=fM=5F`@GB*AH#c~QVzbK&eD!G-ZG^XrZqzvBbw+QrTB#GF5vs9oydUt
zXklQNHN}aVf@7-}O2-5^d`Gv9)Thjsj^jqGOUC0U6DLFydBPZ^#~6$}VpBYkn+6cJ
zL&w*0`?c@qmUt{JFbP5P><Um&>sTY`EUYVN#1v|^93p&t8R32>0<dRMpKl->$@Nb;
zt^Rs@JgU&E*0hE7sB|;fC0ucSZ;gw_3`tyTE@w~TZRut{V(IzQ4nY;R%)&dwhbF&z
z6+U+B%&#7jXeGYnAT6b+k7{&ArHCEXjlVBnufkhI{bK0RqK7}0(??m`u{{1_Hv1j?
zkY$pKAo0ELKBArsdp^7q7gl7aM?!<K#k{546O-4bVk>&7<DS!;#5?I1?Tv_ouS~Kx
zOL$@piqQtbrF`Y4p^oVa+n5}Fea?=HQ+bh|{?Z5ygAf5dwnM}i$9a6q*shwVhMW?$
zocMy$KU`*d+&sJX7UuQ^ED~1bE#r;Qx>lEtQjj~8z=`j^u9hTL^*qXL*ZzjBee7JJ
zn3&z9idi1NK9vci`MX%@)x+D7NlymT{0EU#KWI^0a$;H@m$XXo_l6x>96^Jxs*~#=
zqcOCNQp+yt=)`<o;UOJn$=w_Jp&(Y1PlkK-1%|!-aF?&;q9w=olggt2>Uj;~H%czu
zkj7VN#m+&T|FmV5@j%Q~i#uQqmA=o$=0~9A-4t*wX!uT;0r>*Hn^Kl%l#pk{m_{5Y
zI=E$sx@B-x`tDGbUyb9vRt}()x6}o4ZI5QdgP#pv{o!PWvN-}=RC9z~PL0Cw!z5JY
z7jLYfpB3I<%hkIcEK(*?{N|zT522`ULQz_ADuK8e4^!N?TTxokqBst)f&+_rs<!M)
zdb)<rRBdo-tCkVenFZJEu^d<cXhrv+ISLd)g8fThn9l*_<9TuwdEsGCvSN2ab0vA<
zp@`-mCzd;hK_lv4WR5Hgzp*j_TFdDAzfrBZT=;02Ep0Hef#9^@8k!!)yWjH=nB=I2
z0%m`<xcNrs7RT`ox}{_LB<JfUYBDWFd&|@biXJVl{<36vVCA;YS3S`zWX>UnevydU
z1<<nf7?n@X{Rlq0U<Kds7B}VJ4?Ll@9UafS->`W73LKjDoitoGXQFO%5AziKr<Fsp
zG1j=CTP_h~ckFwZQm5W}w937gSUGBYg|A<!qJ7gfehQT^DoR?3$uPl4f!t|+7oxP+
zKkfG*>QM(&f6l1AD#afC515pf`42tbzc~sDaeP59t>^yS@wK3pjG(-{tTnx~iSrxB
zze9Ryb3rRvL3zQylMoLN_+P9#-vaX2<Auk$^_NcnS`P)S?kT7MRka?f%E>9oD9g($
z=xEF8D9h`}swe|xwY61LfcFLe|B~}_9y_`_!Cwk0D=Pk*-vs}^08ltV&(PHVI&d8o
z_?<0B>^;!*S`G_~Gdqj^!#3&<{5i=YUZ89ySD*@v3Q3C|T$GAo@T5(xp;{2JT=0g$
z2K-7+ck3Nr?2h({_emZ=HM>3wzbFU}I<JHCm6hLJs;;}`eAgpdQ&yA;t10$1@cQRV
zj#<2)so1kvP2ah^r&Y}2_<a6qFTX+{(345w-PSMan#-wL3^f-kiAtU~DubB@uhccO
z4_++};`h9|9YiH_`A~Bv>7dZNwtsiv9k97U_R?C=k=><xmwN23x(2#!B!I)3WooG0
zgRHX1Me~g!+|#oU<{u4$aR}Um9V1E`LHFBO1Y`jOpo<|S8n#7x_7(j*;H0Gc7fcpe
zM;^S_<t)f+VXV{Kx!jw*W$G%E{$L@0+m&jB;c96}Kg79;-4yfE`IV?sqKm*ve%|lG
zZw3lR1llTakq6zMY!g#Jzq)DKPdd8A+aou_p^qpN%27qd;m>u042?g`hyqpdg56&9
zeArt9AG8onApk>+s(3u#oM`p6HZ^f$;h-2@_U=SltvCq)NM{_wF*g(ZRhJJJeP?ed
zFg{lB_{;YX$yqcr_dsDmN)gebwe*hVw8G6=4<6nH<p&o>^t{wyFJj>n)nYyrsvBG}
zRnUWD;5vh1L&4v~Zf<A8jTSjk`NZK38c}Nw%bsgEEy4zmD2Z!)?lO*j@e$kwFb1w>
z7(fJ%=lT@8EumrVZshGGjljVo*pb&jk=g@!+O9}C_u#mks0OB>X4+3N4HKSez#%Wz
z<rG8@YDoI4cW=D`zrJ%s7Uo%(+k9xohZ!iss#jmRrEX%L?rQg$@q5x3%+IXYh^d)>
z454N@gnU!BzPlXmD>saB(rG54!*l6hT`@M)e|IaDI=6yRG{tFh3N<<)K1qx%z`>7v
zb8y|O183*`MUOMHL_`288`p7?qxYofXjC89|0dqr?8$=Omh_XIEI!dkJenu<wBPI0
t>_$H>^|w}KG*kvak28h-JGZ^z_AvNs*m*L`D#|M;$<PZ6>lgv){{_vl0Js1E

literal 0
HcmV?d00001

diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.texi b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.texi
new file mode 100755
index 00000000..2bf8de01
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/doc/quickjs.texi
@@ -0,0 +1,817 @@
+\input texinfo
+
+@iftex
+@afourpaper
+@headings double
+@end iftex
+
+@titlepage
+@afourpaper
+@sp 7
+@center @titlefont{QuickJS Javascript Engine}
+@sp 3
+@end titlepage
+
+@setfilename spec.info
+@settitle QuickJS Javascript Engine
+
+@contents
+
+@chapter Introduction
+
+QuickJS is a small and embeddable Javascript engine. It supports the
+ES2019 specification including modules, asynchronous
+generators and proxies.
+
+It optionally supports mathematical extensions such as big integers
+(BigInt), big floating point numbers (BigFloat) and operator
+overloading.
+
+@section Main Features
+
+@itemize
+
+@item Small and easily embeddable: just a few C files, no external dependency, 180 KiB of x86 code for a simple ``hello world'' program.
+
+@item Fast interpreter with very low startup time: runs the 56000 tests of the ECMAScript Test Suite@footnote{@url{https://github.com/tc39/test262}} in about 100 seconds on a single core of a desktop PC. The complete life cycle of a runtime instance completes in less than 300 microseconds.
+
+@item Almost complete ES2019 support including modules, asynchronous
+generators and full Annex B support (legacy web compatibility).
+
+@item Passes 100% of the ECMAScript Test Suite tests.
+
+@item Can compile Javascript sources to executables with no external dependency.
+
+@item Garbage collection using reference counting (to reduce memory usage and have deterministic behavior) with cycle removal.
+
+@item Mathematical extensions: BigInt, BigFloat, operator overloading, bigint mode, math mode.
+
+@item Command line interpreter with contextual colorization and completion implemented in Javascript.
+
+@item Small built-in standard library with C library wrappers.
+
+@end itemize
+
+@chapter Usage
+
+@section Installation
+
+A Makefile is provided to compile the engine on Linux or MacOS/X.  A
+preliminary Windows support is available thru cross compilation on a
+Linux host with the MingGW tools.
+
+Edit the top of the @code{Makefile} if you wish to select specific
+options then run @code{make}.
+
+You can type @code{make install} as root if you wish to install the binaries and support files to
+@code{/usr/local} (this is not necessary to use QuickJS).
+
+@section Quick start
+
+@code{qjs} is the command line interpreter (Read-Eval-Print Loop). You can pass
+Javascript files and/or expressions as arguments to execute them:
+
+@example
+./qjs examples/hello.js
+@end example
+
+@code{qjsc} is the command line compiler:
+
+@example
+./qjsc -o hello examples/hello.js
+./hello
+@end example
+
+generates a @code{hello} executable with no external dependency.
+
+@code{qjsbn} and @code{qjscbn} are the corresponding interpreter and
+compiler with the mathematical extensions:
+
+@example
+./qjsbn examples/pi.js 1000
+@end example
+
+displays 1000 digits of PI.
+
+@example
+./qjsbnc -o pi examples/pi.js
+./pi 1000
+@end example
+
+compiles and executes the PI program.
+
+@section Command line options
+
+@subsection @code{qjs} interpreter
+
+@verbatim
+usage: qjs [options] [files]
+@end verbatim
+
+Options are:
+@table @code
+@item -h
+@item --help
+List options.
+
+@item -e @code{EXPR}
+@item --eval @code{EXPR}
+Evaluate EXPR.
+
+@item -i
+@item --interactive
+Go to interactive mode (it is not the default when files are provided on the command line).
+
+@item -m
+@item --module
+Load as ES6 module (default if .mjs file extension).
+
+@end table
+
+Advanced options are:
+
+@table @code
+@item -d
+@item --dump
+Dump the memory usage stats.
+
+@item -q
+@item --quit
+just instantiate the interpreter and quit.
+
+@end table
+
+@subsection @code{qjsc} compiler
+
+@verbatim
+usage: qjsc [options] [files]
+@end verbatim
+
+Options are:
+@table @code
+@item -c
+Only output bytecode in a C file. The default is to output an executable file.
+@item -e 
+Output @code{main()} and bytecode in a C file. The default is to output an
+executable file.
+@item -o output
+Set the output filename (default = @file{out.c} or @file{a.out}).
+
+@item -N cname
+Set the C name of the generated data.
+
+@item -m
+Compile as Javascript module (default if @file{.mjs} extension).
+
+@item -M module_name[,cname]
+Add initialization code for an external C module. See the
+@code{c_module} example.
+
+@item -x
+Byte swapped output (only used for cross compilation).
+
+@item -flto
+Use link time optimization. The compilation is slower but the
+executable is smaller and faster. This option is automatically set
+when the @code{-fno-x} options are used.
+
+@item -fno-[eval|string-normalize|regexp|json|proxy|map|typedarray|promise]
+Disable selected language features to produce a smaller executable file.
+
+@end table
+
+@section @code{qjscalc} application
+
+The @code{qjscalc} application is a superset of the @code{qjsbn}
+command line interpreter implementing a Javascript calculator with
+arbitrarily large integer and floating point numbers, fractions,
+complex numbers, polynomials and matrices. The source code is in
+@file{qjscalc.js}. More documentation and a web version are available at
+@url{http://numcalc.com}.
+
+@section Built-in tests
+
+Run @code{make test} to run the few built-in tests included in the
+QuickJS archive.
+
+@section Test262 (ECMAScript Test Suite)
+
+A test262 runner is included in the QuickJS archive.
+
+For reference, the full test262 tests are provided in the archive
+@file{qjs-tests-yyyy-mm-dd.tar.xz}. You just need to untar it into the
+QuickJS source code directory.
+
+Alternatively, the test262 tests can be installed with:
+
+@example
+git clone https://github.com/tc39/test262.git test262
+cd test262
+git checkout 94b1e80ab3440413df916cd56d29c5a2fa2ac451
+patch -p1 < ../tests/test262.patch
+cd ..
+@end example
+
+The patch adds the implementation specific @code{harness} functions
+and optimizes the inefficient RegExp character classes and Unicode
+property escapes tests (the tests themselves are not modified, only a
+slow string initialization function is optimized).
+
+The tests can be run with
+@example
+make test2
+@end example
+
+For more information, run @code{./run-test262} to see the options of
+the test262 runner. The configuration files @code{test262.conf} and
+@code{test262bn.conf} contain the options to run the various tests.
+
+@chapter Specifications
+
+@section Language support
+
+@subsection ES2019 support
+
+The ES2019 specification
+@footnote{@url{https://tc39.github.io/ecma262/}} is almost fully
+supported including the Annex B (legacy web compatibility) and the
+Unicode related features. The following features are not supported
+yet:
+
+@itemize
+
+@item Realms (althougth the C API supports different runtimes and contexts)
+
+@item Tail calls@footnote{We believe the current specification of tails calls is too complicated and presents limited practical interests.}
+
+@end itemize
+
+@subsection JSON
+
+The JSON parser is currently more tolerant than the specification.
+
+@subsection ECMA402
+
+ECMA402 (Internationalization API) is not supported.
+
+@subsection Extensions
+
+@itemize
+
+@item The directive @code{"use strip"} indicates that the debug information (including the source code of the functions) should not be retained to save memory. As @code{"use strict"}, the directive can be global to a script or local to a function.
+
+@item The first line of a script beginning with @code{#!} is ignored.
+
+@end itemize
+
+@subsection Mathematical extensions
+
+The mathematical extensions are available in the @code{qjsbn} version and are fully
+backward compatible with standard Javascript. See @code{jsbignum.pdf}
+for more information.
+
+@itemize
+
+@item The @code{BigInt} (big integers) TC39 proposal is supported.
+
+@item @code{BigFloat} support: arbitrary large floating point numbers in base 2.
+
+@item Operator overloading.
+
+@item The directive @code{"use bigint"} enables the bigint mode where integers are @code{BigInt} by default.
+
+@item The directive @code{"use math"} enables the math mode where the division and power operators on integers produce fractions. Floating point literals are @code{BigFloat} by default and integers are @code{BigInt} by default.
+
+@end itemize
+
+@section Modules
+
+ES6 modules are fully supported. The default name resolution is the
+following:
+
+@itemize
+
+@item Module names with a leading @code{.} or @code{..} are relative
+to the current module path.
+
+@item Module names without a leading @code{.} or @code{..} are system
+modules, such as @code{std} or @code{os}.
+
+@item Module names ending with @code{.so} are native modules using the
+QuickJS C API.
+
+@end itemize
+
+@section Standard library
+
+The standard library is included by default in the command line
+interpreter. It contains the two modules @code{std} and @code{os} and
+a few global objects.
+
+@subsection Global objects
+
+@table @code
+@item scriptArgs
+Provides the command line arguments. The first argument is the script name.
+@item print(...args)
+Print the arguments separated by spaces and a trailing newline.
+@item console.log(...args)
+Same as print().
+
+@end table
+
+@subsection @code{std} module
+
+The @code{std} module provides wrappers to the libc @file{stdlib.h}
+and @file{stdio.h} and a few other utilities.
+
+Available exports:
+
+@table @code
+
+@item exit(n)
+Exit the process.
+
+@item evalScript(str)
+Evaluate the string @code{str} as a script (global eval).
+
+@item loadScript(filename)
+Evaluate the file @code{filename} as a script (global eval).
+
+@item Error(errno)
+
+@code{std.Error} constructor. Error instances contain the field
+@code{errno} (error code) and @code{message} (result of
+@code{std.Error.strerror(errno)}).
+
+The constructor contains the following fields:
+
+  @table @code
+  @item EINVAL
+  @item EIO
+  @item EACCES
+  @item EEXIST
+  @item ENOSPC
+  @item ENOSYS
+  @item EBUSY
+  @item ENOENT
+  @item EPERM
+  @item EPIPE
+    Integer value of common errors (additional error codes may be defined).
+  @item strerror(errno)
+    Return a string that describes the error @code{errno}.
+  @end table
+
+@item open(filename, flags)
+Open a file (wrapper to the libc @code{fopen()}). Throws 
+@code{std.Error} in case of I/O error.
+
+@item tmpfile()
+Open a temporary file. Throws @code{std.Error} in case of I/O error.
+
+@item puts(str)
+Equivalent to @code{std.out.puts(str)}.
+
+@item printf(fmt, ...args)
+Equivalent to @code{std.out.printf(fmt, ...args)}
+
+@item sprintf(fmt, ...args)
+Equivalent to the libc sprintf().
+
+@item in
+@item out
+@item err
+Wrappers to the libc file @code{stdin}, @code{stdout}, @code{stderr}.
+
+@item SEEK_SET
+@item SEEK_CUR
+@item SEEK_END
+Constants for seek().
+
+@item global
+Reference to the global object.
+
+@item gc()
+Manually invoke the cycle removal algorithm. The cycle removal
+algorithm is automatically started when needed, so this function is
+useful in case of specific memory constraints or for testing.
+
+@item getenv(name)
+Return the value of the environment variable @code{name} or
+@code{undefined} if it is not defined.
+
+@end table
+
+FILE prototype:
+
+@table @code
+@item close()
+Close the file.
+@item puts(str)
+Outputs the string with the UTF-8 encoding.
+@item printf(fmt, ...args)
+Formatted printf, same formats as the libc printf.
+@item flush()
+Flush the buffered file.
+@item seek(offset, whence)
+Seek to a give file position (whence is @code{std.SEEK_*}). Throws a
+@code{std.Error} in case of I/O error.
+@item tell()
+Return the current file position.
+@item eof()
+Return true if end of file.
+@item fileno()
+Return the associated OS handle.
+
+@item read(buffer, position, length)
+Read @code{length} bytes from the file to the ArrayBuffer @code{buffer} at byte
+position @code{position} (wrapper to the libc @code{fread}).
+
+@item write(buffer, position, length)
+Write @code{length} bytes to the file from the ArrayBuffer @code{buffer} at byte
+position @code{position} (wrapper to the libc @code{fread}).
+
+@item getline()
+Return the next line from the file, assuming UTF-8 encoding, excluding
+the trailing line feed.
+
+@item getByte()
+Return the next byte from the file.
+
+@item putByte(c)
+Write one byte to the file.
+@end table
+
+@subsection @code{os} module
+
+The @code{os} module provides Operating System specific functions:
+
+@itemize
+@item low level file access
+@item signals
+@item timers
+@item asynchronous I/O
+@end itemize
+
+The OS functions usually return 0 if OK or an OS specific negative
+error code.
+
+Available exports:
+
+@table @code
+@item open(filename, flags, mode = 0o666)
+Open a file. Return a handle or < 0 if error.
+
+@item O_RDONLY
+@item O_WRONLY        
+@item O_RDWR
+@item O_APPEND
+@item O_CREAT
+@item O_EXCL
+@item O_TRUNC
+POSIX open flags.
+
+@item O_TEXT
+(Windows specific). Open the file in text mode. The default is binary mode.
+
+@item close(fd)
+Close the file handle @code{fd}.
+
+@item seek(fd, offset, whence)
+Seek in the file. Use @code{std.SEEK_*} for @code{whence}.
+
+@item read(fd, buffer, offset, length)
+Read @code{length} bytes from the file handle @code{fd} to the
+ArrayBuffer @code{buffer} at byte position @code{offset}.
+Return the number of read bytes or < 0 if error.
+
+@item write(fd, buffer, offset, length)
+Write @code{length} bytes to the file handle @code{fd} from the
+ArrayBuffer @code{buffer} at byte position @code{offset}.
+Return the number of written bytes or < 0 if error.
+
+@item isatty(fd)
+Return @code{true} is @code{fd} is a TTY (terminal) handle.
+
+@item ttyGetWinSize(fd)
+Return the TTY size as @code{[width, height]} or @code{null} if not available.
+
+@item ttySetRaw(fd)
+Set the TTY in raw mode.
+
+@item remove(filename)
+Remove a file. Return 0 if OK or < 0 if error.
+
+@item rename(oldname, newname)
+Rename a file. Return 0 if OK or < 0 if error.
+
+@item setReadHandler(fd, func)
+Add a read handler to the file handle @code{fd}. @code{func} is called
+each time there is data pending for @code{fd}. A single read handler
+per file handle is supported. Use @code{func = null} to remove the
+hander.
+
+@item setWriteHandler(fd, func)
+Add a write handler to the file handle @code{fd}. @code{func} is
+called each time data can be written to @code{fd}. A single write
+handler per file handle is supported. Use @code{func = null} to remove
+the hander.
+
+@item signal(signal, func)
+Call the function @code{func} when the signal @code{signal}
+happens. Only a single handler per signal number is supported. Use
+@code{null} to set the default handler or @code{undefined} to ignore
+the signal.
+
+@item SIGINT
+@item SIGABRT
+@item SIGFPE
+@item SIGILL
+@item SIGSEGV
+@item SIGTERM
+POSIX signal numbers.
+
+@item setTimeout(delay, func)
+Call the function @code{func} after @code{delay} ms. Return a handle
+to the timer.
+
+@item clearTimer(handle)
+Cancel a timer.
+
+@item platform
+Return a string representing the platform: @code{"linux"}, @code{"darwin"},
+@code{"win32"} or @code{"js"}.
+
+@end table
+
+@section QuickJS C API
+
+The C API was designed to be simple and efficient. The C API is
+defined in the header @code{quickjs.h}.
+
+@subsection Runtime and contexts
+
+@code{JSRuntime} represents a Javascript runtime corresponding to an
+object heap. Several runtimes can exist at the same time but they
+cannot exchange objects. Inside a given runtime, no multi-threading is
+supported.
+
+@code{JSContext} represents a Javascript context (or Realm). Each
+JSContext has its own global objects and system objects. There can be
+several JSContexts per JSRuntime and they can share objects, similary
+to frames of the same origin sharing Javascript objects in a
+web browser.
+
+@subsection JSValue
+
+@code{JSValue} represents a Javascript value which can be a primitive
+type or an object. Reference counting is used, so it is important to
+explicitely duplicate (@code{JS_DupValue()}, increment the reference
+count) or free (@code{JS_FreeValue()}, decrement the reference count)
+JSValues.
+
+@subsection C functions
+
+C functions can be created with
+@code{JS_NewCFunction()}. @code{JS_SetPropertyFunctionList()} is a
+shortcut to easily add functions, setters and getters properties to a
+given object.
+
+Unlike other embedded Javascript engines, there is no implicit stack,
+so C functions get their parameters as normal C parameters. As a
+general rule, C functions take constant @code{JSValue}s as parameters
+(so they don't need to free them) and return a newly allocated (=live)
+@code{JSValue}.
+
+@subsection Exceptions
+
+Exceptions: most C functions can return a Javascript exception. It
+must be explicitely tested and handled by the C code. The specific
+@code{JSValue} @code{JS_EXCEPTION} indicates that an exception
+occured. The actual exception object is stored in the
+@code{JSContext} and can be retrieved with @code{JS_GetException()}.
+
+@subsection Script evaluation
+
+Use @code{JS_Eval()} to evaluate a script or module source.
+
+If the script or module was compiled to bytecode with @code{qjsc},
+@code{JS_EvalBinary()} achieves the same result. The advantage is that
+no compilation is needed so it is faster and smaller because the compiler
+can be removed from the executable if no @code{eval} is required.
+
+Note: the bytecode format is linked to a given QuickJS
+version. Moreover, no security check is done before its
+execution. Hence the bytecode should not be loaded from untrusted
+sources. That's why there is no option to output the bytecode to a
+binary file in @code{qjsc}.
+
+@subsection JS Classes
+
+C opaque data can be attached to a Javascript object. The type of the
+C opaque data is determined with the class ID (@code{JSClassID}) of
+the object. Hence the first step is to register a new class ID and JS
+class (@code{JS_NewClassID()}, @code{JS_NewClass()}). Then you can
+create objects of this class with @code{JS_NewObjectClass()} and get or
+set the C opaque point with
+@code{JS_GetOpaque()}/@code{JS_SetOpaque()}.
+
+When defining a new JS class, it is possible to declare a finalizer
+which is called when the object is destroyed. A @code{gc_mark} method
+can be provided so that the cycle removal algorithm can find the other
+objects referenced by this object. Other methods are available to
+define exotic object behaviors.
+
+The Class ID are globally allocated (i.e. for all runtimes). The
+JSClass are allocated per @code{JSRuntime}. @code{JS_SetClassProto()}
+is used to define a prototype for a given class in a given
+JSContext. @code{JS_NewObjectClass()} sets this prototype in the
+created object.
+
+Examples are available in @file{js_libc.c}.
+
+@subsection C Modules
+
+Native ES6 modules are supported and can be dynamically or statically
+linked. Look at the @file{test_bjson} and @file{bjson.so}
+examples. The standard library @file{js_libc.c} is also a good example
+of a native module.
+
+@subsection Memory handling
+
+Use @code{JS_SetMemoryLimit()} to set a global memory allocation limit
+to a given JSRuntime.
+
+Custom memory allocation functions can be provided with
+@code{JS_NewRuntime2()}.
+
+The maximum system stack size can be set with @code{JS_SetMaxStackSize()}.
+
+@subsection Execution timeout and interrupts
+
+Use @code{JS_SetInterruptHandler()} to set a callback which is
+regularly called by the engine when it is executing code. This
+callback can be used to implement an execution timeout.
+
+It is used by the command line interpreter to implement a
+@code{Ctrl-C} handler.
+
+@chapter Internals
+
+@section Bytecode
+
+The compiler generates bytecode directly with no intermediate
+representation such as a parse tree, hence it is very fast. Several
+optimizations passes are done over the generated bytecode.
+
+A stack-based bytecode was chosen because it is simple and generates 
+compact code.
+
+For each function, the maximum stack size is computed at compile time so that
+no runtime stack overflow tests are needed.
+
+A separate compressed line number table is maintained for the debug
+information.
+
+Access to closure variables is optimized and is almost as fast as local
+variables.
+
+Direct @code{eval} in strict mode is optimized.
+
+@section Executable generation
+
+@subsection @code{qjsc} compiler
+
+The @code{qjsc} compiler generates C sources from Javascript files. By
+default the C sources are compiled with the system compiler
+(@code{gcc} or @code{clang}).
+
+The generated C source contains the bytecode of the compiled functions
+or modules. If a full complete executable is needed, it also
+contains a @code{main()} function with the necessary C code to initialize the
+Javascript engine and to load and execute the compiled functions and
+modules.
+
+Javascript code can be mixed with C modules.
+
+In order to have smaller executables, specific Javascript features can
+be disabled, in particular @code{eval} or the regular expressions. The
+code removal relies on the Link Time Optimization of the system
+compiler.
+
+@subsection Binary JSON
+
+@code{qjsc} works by compiling scripts or modules and then serializing
+them to a binary format. A subset of this format (without functions or
+modules) can be used as binary JSON. The example @file{test_bjson.js}
+shows how to use it.
+
+Warning: the binary JSON format may change without notice, so it
+should not be used to store persistent data. The @file{test_bjson.js}
+example is only used to test the binary object format functions.
+
+@section Runtime
+
+@subsection Strings
+
+Strings are stored either as an 8 bit or a 16 bit array of
+characters. Hence random access to characters is always fast.
+
+The C API provides functions to convert Javascript Strings to C UTF-8 encoded
+strings. The most common case where the Javascript string contains
+only ASCII characters involves no copying.
+
+@subsection Objects
+
+The object shapes (object prototype, property names and flags) are shared
+between objects to save memory.
+
+Arrays with no holes (except at the end of the array) are optimized.
+
+TypedArray accesses are optimized.
+
+@subsection Atoms
+
+Object property names and some strings are stored as Atoms (unique
+strings) to save memory and allow fast comparison. Atoms are
+represented as a 32 bit integer. Half of the atom range is reserved for
+immediate integer literals from @math{0} to @math{2^{31}-1}.
+
+@subsection Numbers
+
+Numbers are represented either as 32-bit signed integers or 64-bit IEEE-754
+floating point values. Most operations have fast paths for the 32-bit
+integer case.
+
+@subsection Garbage collection
+
+Reference counting is used to free objects automatically and
+deterministically. A separate cycle removal pass is done when the allocated
+memory becomes too large. The cycle removal algorithm only uses the
+reference counts and the object content, so no explicit garbage
+collection roots need to be manipulated in the C code.
+
+@subsection JSValue
+
+It is a Javascript value which can be a primitive type (such as
+Number, String, ...) or an Object. NaN boxing is used in the 32-bit version
+to store 64-bit floating point numbers. The representation is
+optimized so that 32-bit integers and reference counted values can be
+efficiently tested.
+
+In 64-bit code, JSValue are 128-bit large and no NaN boxing is used. The
+rationale is that in 64-bit code memory usage is less critical.
+
+In both cases (32 or 64 bits), JSValue exactly fits two CPU registers,
+so it can be efficiently returned by C functions.
+
+@subsection Function call
+
+The engine is optimized so that function calls are fast. The system
+stack holds the Javascript parameters and local variables.
+
+@section RegExp
+
+A specific regular expression engine was developped. It is both small
+and efficient and supports all the ES2019 features including the
+Unicode properties. As the Javascript compiler, it directly generates
+bytecode without a parse tree.
+
+Backtracking with an explicit stack is used so that there is no
+recursion on the system stack. Simple quantizers are specifically
+optimized to avoid recursions.
+
+Infinite recursions coming from quantizers with empty terms are
+avoided.
+
+The full regexp library weights about 15 KiB (x86 code), excluding the
+Unicode library.
+
+@section Unicode
+
+A specific Unicode library was developped so that there is no
+dependency on an external large Unicode library such as ICU. All the
+Unicode tables are compressed while keeping a reasonnable access
+speed.
+
+The library supports case conversion, Unicode normalization, Unicode
+script queries, Unicode general category queries and all Unicode
+binary properties.
+
+The full Unicode library weights about 45 KiB (x86 code).
+
+@section BigInt and BigFloat
+
+BigInt and BigFloat are implemented with the @code{libbf}
+library@footnote{@url{https://bellard.org/libbf}}. It weights about 60
+KiB (x86 code) and provides arbitrary precision IEEE 754 floating
+point operations and transcendental functions with exact rounding.
+
+@chapter License
+
+QuickJS is released under the MIT license.
+
+Unless otherwise specified, the QuickJS sources are copyright Fabrice
+Bellard and Charlie Gordon.
+
+@bye
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/c_module.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/c_module.js
new file mode 100755
index 00000000..70d26bd8
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/c_module.js
@@ -0,0 +1,6 @@
+/* example of JS module importing a C module */
+
+import { fib } from "./fib.so";
+
+console.log("Hello World");
+console.log("fib(10)=", fib(10));
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/fib.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/fib.c
new file mode 100755
index 00000000..c77b7056
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/fib.c
@@ -0,0 +1,72 @@
+/*
+ * QuickJS: Example of C module
+ * 
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include "../quickjs.h"
+
+#define countof(x) (sizeof(x) / sizeof((x)[0]))
+
+static int fib(int n)
+{
+    if (n <= 0)
+        return 0;
+    else if (n == 1)
+        return 1;
+    else
+        return fib(n - 1) + fib(n - 2);
+}
+
+static JSValue js_fib(JSContext *ctx, JSValueConst this_val,
+                      int argc, JSValueConst *argv)
+{
+    int n, res;
+    if (JS_ToInt32(ctx, &n, argv[0]))
+        return JS_EXCEPTION;
+    res = fib(n);
+    return JS_NewInt32(ctx, res);
+}
+
+static const JSCFunctionListEntry js_fib_funcs[] = {
+    JS_CFUNC_DEF("fib", 1, js_fib ),
+};
+
+static int js_fib_init(JSContext *ctx, JSModuleDef *m)
+{
+    return JS_SetModuleExportList(ctx, m, js_fib_funcs,
+                                  countof(js_fib_funcs));
+}
+
+#ifdef JS_SHARED_LIBRARY
+#define JS_INIT_MODULE js_init_module
+#else
+#define JS_INIT_MODULE js_init_module_fib
+#endif
+
+JSModuleDef *JS_INIT_MODULE(JSContext *ctx, const char *module_name)
+{
+    JSModuleDef *m;
+    m = JS_NewCModule(ctx, module_name, js_fib_init);
+    if (!m)
+        return NULL;
+    JS_AddModuleExportList(ctx, m, js_fib_funcs, countof(js_fib_funcs));
+    return m;
+}
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/fib_module.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/fib_module.js
new file mode 100755
index 00000000..6a810716
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/fib_module.js
@@ -0,0 +1,10 @@
+/* fib module */
+export function fib(n)
+{
+    if (n <= 0)
+        return 0;
+    else if (n == 1)
+        return 1;
+    else
+        return fib(n - 1) + fib(n - 2);
+}
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/hello.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/hello.js
new file mode 100755
index 00000000..accefceb
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/hello.js
@@ -0,0 +1 @@
+console.log("Hello World");
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/hello_module.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/hello_module.js
new file mode 100755
index 00000000..463660f6
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/hello_module.js
@@ -0,0 +1,6 @@
+/* example of JS module */
+
+import { fib } from "./fib_module.js";
+
+console.log("Hello World");
+console.log("fib(10)=", fib(10));
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/pi.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/pi.js
new file mode 100755
index 00000000..f2ba4cde
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/examples/pi.js
@@ -0,0 +1,66 @@
+/*
+ * PI computation in Javascript using the QuickJS bignum extensions
+ */
+"use strict";
+"use bigint";
+
+/* compute PI with a precision of 'prec' bits */
+function calc_pi(prec) {
+    const CHUD_A = 13591409;
+    const CHUD_B = 545140134;
+    const CHUD_C = 640320;
+    const CHUD_C3 = 10939058860032000; /* C^3/24 */
+    const CHUD_BITS_PER_TERM = 47.11041313821584202247; /* log2(C/12)*3 */
+    
+    /* return [P, Q, G] */
+    function chud_bs(a, b, need_G) {
+        var c, P, Q, G, P1, Q1, G1, P2, Q2, G2;
+        if (a == (b - 1)) {
+            G = (2 * b - 1) * (6 * b - 1) * (6 * b - 5);
+            P = BigFloat(G * (CHUD_B * b + CHUD_A));
+            if (b & 1)
+                P = -P;
+            G = BigFloat(G);
+            Q = BigFloat(b * b * b * CHUD_C3);
+        } else {
+            c = (a + b) >> 1;
+            [P1, Q1, G1] = chud_bs(a, c, true);
+            [P2, Q2, G2] = chud_bs(c, b, need_G);
+            P = P1 * Q2 + P2 * G1;
+            Q = Q1 * Q2;
+            if (need_G)
+                G = G1 * G2;
+            else
+                G = 0;
+        }
+        return [P, Q, G];
+    }
+
+    var n, P, Q, G;
+    /* number of serie terms */
+    n = Math.ceil(BigFloatEnv.prec / CHUD_BITS_PER_TERM) + 10;
+    [P, Q, G] = chud_bs(0, n, false);
+    Q = Q / (P + Q * CHUD_A);
+    G = (CHUD_C / 12) * BigFloat.sqrt(CHUD_C);
+    return Q * G;
+}
+
+(function() {
+    var r, n_digits, n_bits;
+    if (typeof scriptArgs != "undefined") {
+        if (scriptArgs.length < 2) {
+            print("usage: pi n_digits");
+            return;
+        }
+        n_digits = scriptArgs[1];
+    } else {
+        n_digits = 1000;
+    }
+    n_bits = Math.ceil(n_digits * Math.log2(10));
+    /* we add more bits to reduce the probability of bad rounding for
+       the last digits */
+    BigFloatEnv.setPrec( () => {
+        r = calc_pi();
+        print(r.toFixed(n_digits, BigFloatEnv.RNDZ));
+    }, n_bits + 32);
+})();
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/jscompress.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/jscompress.c
new file mode 100755
index 00000000..a68c0e88
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/jscompress.c
@@ -0,0 +1,918 @@
+/*
+ * Javascript Compressor
+ * 
+ * Copyright (c) 2008-2018 Fabrice Bellard
+ * Copyright (c) 2017-2018 Charlie Gordon
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include <stdlib.h>
+#include <stdio.h>
+#include <getopt.h>
+#include <stdarg.h>
+#include <string.h>
+#include <inttypes.h>
+#include <unistd.h>
+
+#include "cutils.h"
+
+typedef struct JSToken {
+    int tok;
+    char buf[20];
+    char *str;
+    int len;
+    int size;
+    int line_num;  /* line number for start of token */
+    int lines;     /* number of embedded linefeeds in token */
+} JSToken;
+
+enum {
+    TOK_EOF = 256,
+    TOK_IDENT,
+    TOK_STR1,
+    TOK_STR2,
+    TOK_STR3,
+    TOK_NUM,
+    TOK_COM,
+    TOK_LCOM,
+};
+
+void tok_reset(JSToken *tt)
+{
+    if (tt->str != tt->buf) {
+        free(tt->str);
+        tt->str = tt->buf;
+        tt->size = sizeof(tt->buf);
+    }
+    tt->len = 0;
+}
+
+void tok_add_ch(JSToken *tt, int c)
+{
+    if (tt->len + 1 > tt->size) {
+        tt->size *= 2;
+        if (tt->str == tt->buf) {
+            tt->str = malloc(tt->size);
+            memcpy(tt->str, tt->buf, tt->len);
+        } else {
+            tt->str = realloc(tt->str, tt->size);
+        }
+    }
+    tt->str[tt->len++] = c;
+}
+
+FILE *infile;
+const char *filename;
+int output_line_num;
+int line_num;
+int ch;
+JSToken tokc;
+
+int skip_mask;
+#define DEFINE_MAX 20
+char *define_tab[DEFINE_MAX];
+int define_len;
+
+void error(const char *fmt, ...)
+{
+    va_list ap;
+    va_start(ap, fmt);
+    if (filename) {
+        fprintf(stderr, "%s:%d: ", filename, line_num);
+    } else {
+        fprintf(stderr, "jscompress: ");
+    }
+    vfprintf(stderr, fmt, ap);
+    fprintf(stderr, "\n");
+    va_end(ap);
+    exit(1);
+}
+
+void define_symbol(const char *def)
+{
+    int i;
+    for (i = 0; i < define_len; i++) {
+        if (!strcmp(tokc.str, define_tab[i]))
+            return;
+    }
+    if (define_len >= DEFINE_MAX)
+        error("too many defines");
+    define_tab[define_len++] = strdup(def);
+}
+
+void undefine_symbol(const char *def)
+{
+    int i, j;
+    for (i = j = 0; i < define_len; i++) {
+        if (!strcmp(tokc.str, define_tab[i])) {
+            free(define_tab[i]);
+        } else {
+            define_tab[j++] = define_tab[i];
+        }
+    }
+    define_len = j;
+}
+
+const char *find_symbol(const char *def)
+{
+    int i;
+    for (i = 0; i < define_len; i++) {
+        if (!strcmp(tokc.str, define_tab[i]))
+            return "1";
+    }
+    return NULL;
+}
+
+void next(void);
+
+void nextch(void)
+{
+    ch = fgetc(infile);
+    if (ch == '\n')
+        line_num++;
+}
+
+int skip_blanks(void)
+{
+    for (;;) {
+        next();
+        if (tokc.tok != ' ' && tokc.tok != '\t' &&
+            tokc.tok != TOK_COM && tokc.tok != TOK_LCOM)
+            return tokc.tok;
+    }
+}
+
+void parse_directive(void)
+{
+    int ifdef, mask = skip_mask;
+    /* simplistic preprocessor:
+       #define / #undef / #ifdef / #ifndef / #else / #endif
+       no symbol substitution.
+     */
+    skip_mask = 0;  /* disable skipping to parse preprocessor line */
+    nextch();
+    if (skip_blanks() != TOK_IDENT)
+        error("expected preprocessing directive after #");
+
+    if (!strcmp(tokc.str, "define")) {
+        if (skip_blanks() != TOK_IDENT)
+            error("expected identifier after #define");
+        define_symbol(tokc.str);
+    } else if (!strcmp(tokc.str, "undef")) {
+        if (skip_blanks() != TOK_IDENT)
+            error("expected identifier after #undef");
+        undefine_symbol(tokc.str);
+    } else if ((ifdef = 1, !strcmp(tokc.str, "ifdef")) ||
+               (ifdef = 0, !strcmp(tokc.str, "ifndef"))) {
+        if (skip_blanks() != TOK_IDENT)
+            error("expected identifier after #ifdef/#ifndef");
+        mask = (mask << 2) | 2 | ifdef;
+        if (find_symbol(tokc.str))
+            mask ^= 1;
+    } else if (!strcmp(tokc.str, "else")) {
+        if (!(mask & 2))
+            error("#else without a #if");
+        mask ^= 1;
+    } else if (!strcmp(tokc.str, "endif")) {
+        if (!(mask & 2))
+            error("#endif without a #if");
+        mask >>= 2;
+    } else {
+        error("unsupported preprocessing directive");
+    }
+    if (skip_blanks() != '\n')
+        error("extra characters on preprocessing line");
+    skip_mask = mask;
+}
+
+/* return -1 if invalid char */
+static int hex_to_num(int ch)
+{
+    if (ch >= 'a' && ch <= 'f')
+        return ch - 'a' + 10;
+    else if (ch >= 'A' && ch <= 'F')
+        return ch - 'A' + 10;
+    else if (ch >= '0' && ch <= '9')
+        return ch - '0';
+    else
+        return -1;
+}
+
+void next(void)
+{
+again:    
+    tok_reset(&tokc);
+    tokc.line_num = line_num;
+    tokc.lines = 0;
+    switch(ch) {
+    case EOF:
+        tokc.tok = TOK_EOF;
+        if (skip_mask)
+            error("missing #endif");
+        break;
+    case 'a' ... 'z':
+    case 'A' ... 'Z':
+    case '_':
+    case '$':
+        tok_add_ch(&tokc, ch);
+        nextch();
+        while ((ch >= 'a' && ch <= 'z') ||
+               (ch >= 'A' && ch <= 'Z') ||
+               (ch >= '0' && ch <= '9') ||
+               (ch == '_' || ch == '$')) {
+            tok_add_ch(&tokc, ch);
+            nextch();
+        }
+        tok_add_ch(&tokc, '\0');
+        tokc.tok = TOK_IDENT;
+        break;
+    case '.':
+        nextch();
+        if (ch >= '0' && ch <= '9') {
+            tok_add_ch(&tokc, '.');
+            goto has_dot;
+        }
+        tokc.tok = '.';
+        break;
+    case '0':
+        tok_add_ch(&tokc, ch);
+        nextch();
+        if (ch == 'x' || ch == 'X') {
+            /* hexa */
+            tok_add_ch(&tokc, ch);
+            nextch();
+            while ((ch >= 'a' && ch <= 'f') ||
+                   (ch >= 'A' && ch <= 'F') ||
+                   (ch >= '0' && ch <= '9')) {
+                tok_add_ch(&tokc, ch);
+                nextch();
+            }
+            tok_add_ch(&tokc, '\0');
+            tokc.tok = TOK_NUM;
+            break;
+        }
+        goto has_digit;
+
+    case '1' ... '9':
+        tok_add_ch(&tokc, ch);
+        nextch();
+    has_digit:
+        /* decimal */
+        while (ch >= '0' && ch <= '9') {
+            tok_add_ch(&tokc, ch);
+            nextch();
+        }
+        if (ch == '.') {
+            tok_add_ch(&tokc, ch);
+            nextch();
+        has_dot:
+            while (ch >= '0' && ch <= '9') {
+                tok_add_ch(&tokc, ch);
+                nextch();
+            }
+        }
+        if (ch == 'e' || ch == 'E') {
+            tok_add_ch(&tokc, ch);
+            nextch();
+            if (ch == '+' || ch == '-') {
+                tok_add_ch(&tokc, ch);
+                nextch();
+            }
+            while (ch >= '0' && ch <= '9') {
+                tok_add_ch(&tokc, ch);
+                nextch();
+            }
+        }
+        tok_add_ch(&tokc, '\0');
+        tokc.tok = TOK_NUM;
+        break;
+    case '`':
+        {
+            nextch();
+            while (ch != '`' && ch != EOF) {
+                if (ch == '\\') {
+                    tok_add_ch(&tokc, ch);
+                    nextch();
+                    if (ch == EOF) {
+                        error("unexpected char after '\\'");
+                    }
+                    tok_add_ch(&tokc, ch);
+                } else {
+                    tok_add_ch(&tokc, ch);
+                    nextch();
+                }
+            }
+            nextch();
+            tok_add_ch(&tokc, 0);
+            tokc.tok = TOK_STR3;
+        }
+        break;
+    case '\"':
+    case '\'':
+        {
+            int n, i, c, hex_digit_count;
+            int quote_ch;
+            quote_ch = ch;
+            nextch();
+            while (ch != quote_ch && ch != EOF) {
+                if (ch == '\\') {
+                    nextch();
+                    switch(ch) {
+                    case 'n':
+                        tok_add_ch(&tokc, '\n');
+                        nextch();
+                        break;
+                    case 'r':
+                        tok_add_ch(&tokc, '\r');
+                        nextch();
+                        break;
+                    case 't':
+                        tok_add_ch(&tokc, '\t');
+                        nextch();
+                        break;
+                    case 'v':
+                        tok_add_ch(&tokc, '\v');
+                        nextch();
+                        break;
+                    case '\"':
+                    case '\'':
+                    case '\\':
+                        tok_add_ch(&tokc, ch);
+                        nextch();
+                        break;
+                    case '0' ... '7':
+                        n = 0;
+                        while (ch >= '0' && ch <= '7') {
+                            n = n * 8 + (ch - '0');
+                            nextch();
+                        }
+                        tok_add_ch(&tokc, n);
+                        break;
+                    case 'x':
+                    case 'u':
+                        if (ch == 'x')
+                            hex_digit_count = 2;
+                        else
+                            hex_digit_count = 4;
+                        nextch();
+                        n = 0;
+                        for(i = 0; i < hex_digit_count; i++) {
+                            c = hex_to_num(ch);
+                            if (c < 0) 
+                                error("unexpected char after '\\x'");
+                            n = n * 16 + c;
+                            nextch();
+                        }
+                        if (n >= 256)
+                            error("unicode is currently unsupported");
+                        tok_add_ch(&tokc, n);
+                        break;
+
+                    default:
+                        error("unexpected char after '\\'");
+                    }
+                } else {
+                    /* XXX: should refuse embedded newlines */
+                    tok_add_ch(&tokc, ch);
+                    nextch();
+                }
+            }
+            nextch();
+            tok_add_ch(&tokc, 0);
+            if (quote_ch == '\'')
+                tokc.tok = TOK_STR1;
+            else
+                tokc.tok = TOK_STR2;
+        }
+        break;
+    case '/':
+        nextch();
+        if (ch == '/') {
+            tok_add_ch(&tokc, '/');
+            tok_add_ch(&tokc, ch);
+            nextch();
+            while (ch != '\n' && ch != EOF) {
+                tok_add_ch(&tokc, ch);
+                nextch();
+            }
+            tok_add_ch(&tokc, '\0');
+            tokc.tok = TOK_LCOM;
+        } else if (ch == '*') {
+            int last;
+            tok_add_ch(&tokc, '/');
+            tok_add_ch(&tokc, ch);
+            last = 0;
+            for(;;) {
+                nextch();
+                if (ch == EOF)
+                    error("unterminated comment");
+                if (ch == '\n')
+                    tokc.lines++;
+                tok_add_ch(&tokc, ch);
+                if (last == '*' && ch == '/')
+                    break;
+                last = ch;
+            }
+            nextch();
+            tok_add_ch(&tokc, '\0');
+            tokc.tok = TOK_COM;
+        } else {
+            tokc.tok = '/';
+        }
+        break;
+    case '#':
+        parse_directive();
+        goto again;
+    case '\n':
+        /* adjust line number */
+        tokc.line_num--;
+        tokc.lines++;
+        /* fall thru */
+    default:
+        tokc.tok = ch;
+        nextch();
+        break;
+    }
+    if (skip_mask & 1)
+        goto again;
+}
+
+void print_tok(FILE *f, JSToken *tt)
+{
+    /* keep output lines in sync with input lines */
+    while (output_line_num < tt->line_num) {
+        putc('\n', f);
+        output_line_num++;
+    }
+
+    switch(tt->tok) {
+    case TOK_IDENT:
+    case TOK_COM:
+    case TOK_LCOM:
+        fprintf(f, "%s", tt->str);
+        break;
+    case TOK_NUM:
+        {
+            unsigned long a;
+            char *p;
+            a = strtoul(tt->str, &p, 0);
+            if (*p == '\0' && a <= 0x7fffffff) {
+                /* must be an integer */
+                fprintf(f, "%d", (int)a);
+            } else {
+                fprintf(f, "%s", tt->str);
+            }
+        }
+        break;
+    case TOK_STR3:
+        fprintf(f, "`%s`", tt->str);
+        break;
+    case TOK_STR1:
+    case TOK_STR2:
+        {
+            int i, c, quote_ch;
+            if (tt->tok == TOK_STR1)
+                quote_ch = '\'';
+            else
+                quote_ch = '\"';
+            fprintf(f, "%c", quote_ch);
+            for(i = 0; i < tt->len - 1; i++) {
+                c = (uint8_t)tt->str[i];
+                switch(c) {
+                case '\r':
+                    fprintf(f, "\\r");
+                    break;
+                case '\n':
+                    fprintf(f, "\\n");
+                    break;
+                case '\t':
+                    fprintf(f, "\\t");
+                    break;
+                case '\v':
+                    fprintf(f, "\\v");
+                    break;
+                case '\"':
+                case '\'':
+                    if (c == quote_ch)
+                        fprintf(f, "\\%c", c);
+                    else
+                        fprintf(f, "%c", c);
+                    break;
+                case '\\':
+                    fprintf(f, "\\\\");
+                    break;
+                default:
+                    /* XXX: no utf-8 support! */
+                    if (c >= 32 && c <= 255) {
+                        fprintf(f, "%c", c);
+                    } else if (c <= 255) 
+                        fprintf(f, "\\x%02x", c);
+                    else
+                        fprintf(f, "\\u%04x", c);
+                    break;
+                }
+            }
+            fprintf(f, "%c", quote_ch);
+        }
+        break;
+    default:
+        if (tokc.tok >= 256)
+            error("unsupported token in print_tok: %d", tt->tok);
+        fprintf(f, "%c", tt->tok);
+        break;
+    }
+    output_line_num += tt->lines;
+}
+
+/* check if token pasting could occur */                    
+static BOOL compat_token(int c1, int c2)
+{
+    if ((c1 == TOK_IDENT || c1 == TOK_NUM) &&
+        (c2 == TOK_IDENT || c2 == TOK_NUM))
+        return FALSE;
+
+    if ((c1 == c2 && strchr("+-<>&|=*/.", c1))
+    ||  (c2 == '=' && strchr("+-<>&|!*/^%", c1))
+    ||  (c1 == '=' && c2 == '>')
+    ||  (c1 == '/' && c2 == '*')
+    ||  (c1 == '.' && c2 == TOK_NUM)
+    ||  (c1 == TOK_NUM && c2 == '.'))
+        return FALSE;
+
+    return TRUE;
+}
+
+void js_compress(const char *filename, const char *outfilename,
+                 BOOL do_strip, BOOL keep_header)
+{
+    FILE *outfile;
+    int ltok, seen_space;
+    
+    line_num = 1;
+    infile = fopen(filename, "rb");
+    if (!infile) {
+        perror(filename);
+        exit(1);
+    }
+    
+    output_line_num = 1;
+    outfile = fopen(outfilename, "wb");
+    if (!outfile) {
+        perror(outfilename);
+        exit(1);
+    }
+        
+    nextch();
+    next();
+    ltok = 0;
+    seen_space = 0;
+    if (do_strip) {
+        if (keep_header) {
+            while (tokc.tok == ' ' ||
+                   tokc.tok == '\n' ||
+                   tokc.tok == '\t' ||
+                   tokc.tok == '\v' ||
+                   tokc.tok == '\b' ||
+                   tokc.tok == '\f') {
+                seen_space = 1;
+                next();
+            }
+            if (tokc.tok == TOK_COM) {
+                print_tok(outfile, &tokc);
+                //fprintf(outfile, "\n");
+                ltok = tokc.tok;
+                seen_space = 0;
+                next();
+            }
+        }
+
+        for(;;) {
+            if (tokc.tok == TOK_EOF)
+                break;
+            if (tokc.tok == ' ' ||
+                tokc.tok == '\r' ||
+                tokc.tok == '\t' ||
+                tokc.tok == '\v' ||
+                tokc.tok == '\b' ||
+                tokc.tok == '\f' ||
+                tokc.tok == TOK_LCOM ||
+                tokc.tok == TOK_COM) {
+                /* don't print spaces or comments */
+                seen_space = 1;
+            } else if (tokc.tok == TOK_STR3) {
+                print_tok(outfile, &tokc);
+                ltok = tokc.tok;
+                seen_space = 0;
+            } else if (tokc.tok == TOK_STR1 || tokc.tok == TOK_STR2) {
+                int count, i;
+                /* find the optimal quote char */
+                count = 0;
+                for(i = 0; i < tokc.len; i++) {
+                    if (tokc.str[i] == '\'')
+                        count++;
+                    else if (tokc.str[i] == '\"')
+                        count--;
+                }
+                if (count > 0)
+                    tokc.tok = TOK_STR2;
+                else if (count < 0)
+                    tokc.tok = TOK_STR1;
+                print_tok(outfile, &tokc);
+                ltok = tokc.tok;
+                seen_space = 0;
+            } else {
+                if (seen_space && !compat_token(ltok, tokc.tok)) {
+                    fprintf(outfile, " ");
+                }
+                print_tok(outfile, &tokc);
+                ltok = tokc.tok;
+                seen_space = 0;
+            }
+            next();
+        }
+    } else {
+        /* just handle preprocessing */
+        while (tokc.tok != TOK_EOF) {
+            print_tok(outfile, &tokc);
+            next();
+        }
+    }
+
+    fclose(outfile);
+    fclose(infile);
+}
+
+#define HASH_SIZE 30011
+#define MATCH_LEN_MIN 3
+#define MATCH_LEN_MAX (4 + 63)
+#define DIST_MAX 65535
+
+static int find_longest_match(int *pdist, const uint8_t *src, int src_len,
+                              const int *hash_next, int cur_pos)
+{
+    int pos, i, match_len, match_pos, pos_min, len_max;
+
+    len_max = min_int(src_len - cur_pos, MATCH_LEN_MAX);
+    match_len = 0;
+    match_pos = 0;
+    pos_min = max_int(cur_pos - DIST_MAX - 1, 0);
+    pos = hash_next[cur_pos];
+    while (pos >= pos_min) {
+        for(i = 0; i < len_max; i++) {
+            if (src[cur_pos + i] != src[pos + i])
+                break;
+        }
+        if (i > match_len) {
+            match_len = i;
+            match_pos = pos;
+        }
+        pos = hash_next[pos];
+    }
+    *pdist = cur_pos - match_pos - 1;
+    return match_len;
+}
+
+int lz_compress(uint8_t **pdst, const uint8_t *src, int src_len)
+{
+    int *hash_table, *hash_next;
+    uint32_t h, v;
+    int i, dist, len, len1, dist1;
+    uint8_t *dst, *q;
+    
+    /* build the hash table */
+    
+    hash_table = malloc(sizeof(hash_table[0]) * HASH_SIZE);
+    for(i = 0; i < HASH_SIZE; i++)
+        hash_table[i] = -1;
+    hash_next = malloc(sizeof(hash_next[0]) * src_len);
+    for(i = 0; i < src_len; i++)
+        hash_next[i] = -1;
+
+    for(i = 0; i < src_len - MATCH_LEN_MIN + 1; i++) {
+        h = ((src[i] << 16) | (src[i + 1] << 8) | src[i + 2]) % HASH_SIZE;
+        hash_next[i] = hash_table[h];
+        hash_table[h] = i;
+    }
+    for(;i < src_len; i++) {
+        hash_next[i] = -1;
+    }
+    free(hash_table);
+
+    dst = malloc(src_len + 4); /* never larger than the source */
+    q = dst;
+    *q++ = src_len >> 24;
+    *q++ = src_len >> 16;
+    *q++ = src_len >> 8;
+    *q++ = src_len >> 0;
+    /* compress */
+    i = 0;
+    while (i < src_len) {
+        if (src[i] >= 128)
+            return -1;
+        len = find_longest_match(&dist, src, src_len, hash_next, i);
+        if (len >= MATCH_LEN_MIN) {
+            /* heuristic: see if better length just after */
+            len1 = find_longest_match(&dist1, src, src_len, hash_next, i + 1);
+            if (len1 > len)
+                goto no_match;
+        }
+        if (len < MATCH_LEN_MIN) {
+        no_match:
+            *q++ = src[i];
+            i++;
+        } else if (len <= (3 + 15) && dist < (1 << 10)) {
+            v = 0x8000 | ((len - 3) << 10) | dist;
+            *q++ = v >> 8;
+            *q++ = v;
+            i += len;
+        } else if (len >= 4 && len <= (4 + 63) && dist < (1 << 16)) {
+            v = 0xc00000 | ((len - 4) << 16) | dist;
+            *q++ = v >> 16;
+            *q++ = v >> 8;
+            *q++ = v;
+            i += len;
+        } else {
+            goto no_match;
+        }
+    }
+    free(hash_next);
+    *pdst = dst;
+    return q - dst;
+}
+
+static int load_file(uint8_t **pbuf, const char *filename)
+{
+    FILE *f;
+    uint8_t *buf;
+    int buf_len;
+
+    f = fopen(filename, "rb");
+    if (!f) {
+        perror(filename);
+        exit(1);
+    }
+    fseek(f, 0, SEEK_END);
+    buf_len = ftell(f);
+    fseek(f, 0, SEEK_SET);
+    buf = malloc(buf_len + 1);
+    fread(buf, 1, buf_len, f);
+    buf[buf_len] = '\0';
+    fclose(f);
+    *pbuf = buf;
+    return buf_len;
+}
+
+static void save_file(const char *filename, const uint8_t *buf, int buf_len)
+{
+    FILE *f;
+    
+    f = fopen(filename, "wb");
+    if (!f) {
+        perror(filename);
+        exit(1);
+    }
+    fwrite(buf, 1, buf_len, f);
+    fclose(f);
+}
+
+static void save_c_source(const char *filename, const uint8_t *buf, int buf_len,
+                          const char *var_name)
+{
+    FILE *f;
+    int i;
+    
+    f = fopen(filename, "wb");
+    if (!f) {
+        perror(filename);
+        exit(1);
+    }
+    fprintf(f, "/* This file is automatically generated - do not edit */\n\n");
+    fprintf(f, "const uint8_t %s[] = {\n", var_name);
+    for(i = 0; i < buf_len; i++) {
+        fprintf(f, " 0x%02x,", buf[i]);
+        if ((i % 8) == 7 || (i == buf_len - 1))
+            fprintf(f, "\n");
+    }
+    fprintf(f, "};\n");
+    fclose(f);
+}
+
+#define DEFAULT_OUTPUT_FILENAME "out.js"
+
+void help(void)
+{
+    printf("jscompress version 1.0 Copyright (c) 2008-2018 Fabrice Bellard\n"
+           "usage: jscompress [options] filename\n"
+           "Javascript compressor\n"
+           "\n"
+           "-h          print this help\n"
+           "-n          do not compress spaces\n"
+           "-H          keep the first comment\n"
+           "-c          compress to file\n"
+           "-C name     compress to C source ('name' is the variable name)\n"
+           "-D symbol   define preprocessor symbol\n"
+           "-U symbol   undefine preprocessor symbol\n"
+           "-o outfile  set the output filename (default=%s)\n",
+           DEFAULT_OUTPUT_FILENAME);
+    exit(1);
+}
+
+int main(int argc, char **argv)
+{
+    int c, do_strip, keep_header, compress;
+    const char *out_filename, *c_var, *fname;
+    char tmpfilename[1024];
+
+    do_strip = 1;
+    keep_header = 0;
+    out_filename = DEFAULT_OUTPUT_FILENAME;
+    compress = 0;
+    c_var = NULL;
+    for(;;) {
+        c = getopt(argc, argv, "hno:HcC:D:U:");
+        if (c == -1)
+            break;
+        switch(c) {
+        case 'h':
+            help();
+            break;
+        case 'n':
+            do_strip = 0;
+            break;
+        case 'o':
+            out_filename = optarg;
+            break;
+        case 'H':
+            keep_header = 1;
+            break;
+        case 'c':
+            compress = 1;
+            break;
+        case 'C':
+            c_var = optarg;
+            compress = 1;
+            break;
+        case 'D':
+            define_symbol(optarg);
+            break;
+        case 'U':
+            undefine_symbol(optarg);
+            break;
+        }
+    }
+    if (optind >= argc)
+        help();
+
+    filename = argv[optind++];
+
+    if (compress) {
+#if defined(__ANDROID__)
+        /* XXX: use another directory ? */
+        snprintf(tmpfilename, sizeof(tmpfilename), "out.%d", getpid());
+#else
+        snprintf(tmpfilename, sizeof(tmpfilename), "/tmp/out.%d", getpid());
+#endif
+        fname = tmpfilename;
+    } else {
+        fname = out_filename;
+    }
+    js_compress(filename, fname, do_strip, keep_header);
+    
+    if (compress) {
+        uint8_t *buf1, *buf2; 
+        int buf1_len, buf2_len;
+        
+        buf1_len = load_file(&buf1, fname);
+        unlink(fname);
+        buf2_len = lz_compress(&buf2, buf1, buf1_len);
+        if (buf2_len < 0) {
+            fprintf(stderr, "Could not compress file (UTF8 chars are forbidden)\n");
+            exit(1);
+        }
+        
+        if (c_var) {
+            save_c_source(out_filename, buf2, buf2_len, c_var);
+        } else {
+            save_file(out_filename, buf2, buf2_len);
+        }
+        free(buf1);
+        free(buf2);
+    }
+    return 0;
+}
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libbf.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libbf.c
new file mode 100755
index 00000000..e848c38d
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libbf.c
@@ -0,0 +1,5805 @@
+/*
+ * Tiny arbitrary precision floating point library
+ * 
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include <stdlib.h>
+#include <stdio.h>
+#include <inttypes.h>
+#include <math.h>
+#include <string.h>
+#include <assert.h>
+
+#ifdef __AVX2__
+#include <immintrin.h>
+#endif
+
+#include "cutils.h"
+#include "libbf.h"
+
+/* enable it to check the multiplication result */
+//#define USE_MUL_CHECK
+/* enable it to use FFT/NTT multiplication */
+#define USE_FFT_MUL
+
+//#define inline __attribute__((always_inline))
+#define unused __attribute__((unused))
+
+#ifdef __AVX2__
+#define FFT_MUL_THRESHOLD 100 /* in limbs of the smallest factor */
+#else
+#define FFT_MUL_THRESHOLD 100 /* in limbs of the smallest factor */
+#endif
+
+/* XXX: adjust */
+#define BASECASE_DIV_THRESHOLD_B 300
+#define BASECASE_DIV_THRESHOLD_Q 300
+
+#if LIMB_BITS == 64
+#define FMT_LIMB1 "%" PRIx64 
+#define FMT_LIMB "%016" PRIx64 
+#define PRId_LIMB PRId64
+#define PRIu_LIMB PRIu64
+
+#else
+
+#define FMT_LIMB1 "%x"
+#define FMT_LIMB "%08x"
+#define PRId_LIMB "d"
+#define PRIu_LIMB "u"
+
+#endif
+
+typedef int bf_op2_func_t(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+                          bf_flags_t flags);
+
+#ifdef USE_FFT_MUL
+
+#define FFT_MUL_R_OVERLAP_A (1 << 0)
+#define FFT_MUL_R_OVERLAP_B (1 << 1)
+
+static no_inline void fft_mul(bf_t *res, limb_t *a_tab, limb_t a_len,
+                              limb_t *b_tab, limb_t b_len, int mul_flags);
+static void fft_clear_cache(bf_context_t *s);
+#endif
+
+/* could leading zeros */
+static inline int clz(limb_t a)
+{
+    if (a == 0) {
+        return LIMB_BITS;
+    } else {
+#if LIMB_BITS == 64
+        return clz64(a);
+#else
+        return clz32(a);
+#endif
+    }
+}
+
+static inline int ctz(limb_t a)
+{
+    if (a == 0) {
+        return LIMB_BITS;
+    } else {
+#if LIMB_BITS == 64
+        return ctz64(a);
+#else
+        return ctz32(a);
+#endif
+    }
+}
+
+static inline int ceil_log2(limb_t a)
+{
+    if (a <= 1)
+        return 0;
+    else
+        return LIMB_BITS - clz(a - 1);
+}
+
+#if 0
+static inline slimb_t ceil_div(slimb_t a, limb_t b)
+{
+    if (a >= 0)
+        return (a + b - 1) / b;
+    else
+        return a / (slimb_t)b;
+}
+
+static inline slimb_t floor_div(slimb_t a, limb_t b)
+{
+    if (a >= 0) {
+        return a / b;
+    } else {
+        return (a - b + 1) / (slimb_t)b;
+    }
+}
+#endif
+
+#define malloc(s) malloc_is_forbidden(s)
+#define free(p) free_is_forbidden(p)
+#define realloc(p, s) realloc_is_forbidden(p, s)
+
+void bf_context_init(bf_context_t *s, bf_realloc_func_t *realloc_func,
+                     void *realloc_opaque)
+{
+    memset(s, 0, sizeof(*s));
+    s->realloc_func = realloc_func;
+    s->realloc_opaque = realloc_opaque;
+}
+
+void bf_context_end(bf_context_t *s)
+{
+    bf_clear_cache(s);
+}
+
+/* 'size' must be > 0 */
+static void *bf_malloc(bf_context_t *s, size_t size)
+{
+    return bf_realloc(s, NULL, size);
+}
+
+static void bf_free(bf_context_t *s, void *ptr)
+{
+    bf_realloc(s, ptr, 0);
+}
+
+void bf_init(bf_context_t *s, bf_t *r)
+{
+    r->ctx = s;
+    r->sign = 0;
+    r->expn = BF_EXP_ZERO;
+    r->len = 0;
+    r->tab = NULL;
+}
+
+void bf_resize(bf_t *r, limb_t len)
+{
+    if (len != r->len) {
+        r->tab = bf_realloc(r->ctx, r->tab, len * sizeof(limb_t));
+        r->len = len;
+    }
+}
+
+void bf_set_ui(bf_t *r, uint64_t a)
+{
+    r->sign = 0;
+    if (a == 0) {
+        r->expn = BF_EXP_ZERO;
+        bf_resize(r, 0);
+    } 
+#if LIMB_BITS == 32
+    else if (a <= 0xffffffff)
+#else
+    else
+#endif
+    {
+        int shift;
+        bf_resize(r, 1);
+        shift = clz(a);
+        r->tab[0] = a << shift;
+        r->expn = LIMB_BITS - shift;
+    }
+#if LIMB_BITS == 32
+    else {
+        uint32_t a1, a0;
+        int shift;
+        bf_resize(r, 2);
+        a0 = a;
+        a1 = a >> 32;
+        shift = clz(a1);
+        r->tab[0] = a0 << shift;
+        r->tab[1] = (a1 << shift) | (a0 >> (LIMB_BITS - shift));
+        r->expn = 2 * LIMB_BITS - shift;
+    }
+#endif
+}
+
+void bf_set_si(bf_t *r, int64_t a)
+{
+    if (a < 0) {
+        bf_set_ui(r, -a);
+        r->sign = 1;
+    } else {
+        bf_set_ui(r, a);
+    }
+}
+
+void bf_set_nan(bf_t *r)
+{
+    bf_resize(r, 0);
+    r->expn = BF_EXP_NAN;
+    r->sign = 0;
+}
+
+void bf_set_zero(bf_t *r, int is_neg)
+{
+    bf_resize(r, 0);
+    r->expn = BF_EXP_ZERO;
+    r->sign = is_neg;
+}
+
+void bf_set_inf(bf_t *r, int is_neg)
+{
+    bf_resize(r, 0);
+    r->expn = BF_EXP_INF;
+    r->sign = is_neg;
+}
+
+void bf_set(bf_t *r, const bf_t *a)
+{
+    if (r == a)
+        return;
+    r->sign = a->sign;
+    r->expn = a->expn;
+    bf_resize(r, a->len);
+    memcpy(r->tab, a->tab, a->len * sizeof(limb_t));
+}
+
+/* equivalent to bf_set(r, a); bf_delete(a) */ 
+void bf_move(bf_t *r, bf_t *a)
+{
+    bf_context_t *s = r->ctx;
+    if (r == a)
+        return;
+    bf_free(s, r->tab);
+    *r = *a;
+}
+
+static limb_t get_limbz(const bf_t *a, limb_t idx)
+{
+    if (idx >= a->len)
+        return 0;
+    else
+        return a->tab[idx];
+}
+
+/* get LIMB_BITS at bit position 'pos' in tab */
+static inline limb_t get_bits(const limb_t *tab, limb_t len, slimb_t pos)
+{
+    limb_t i, a0, a1;
+    int p;
+
+    i = pos >> LIMB_LOG2_BITS;
+    p = pos & (LIMB_BITS - 1);
+    if (i < len)
+        a0 = tab[i];
+    else
+        a0 = 0;
+    if (p == 0) {
+        return a0;
+    } else {
+        i++;
+        if (i < len)
+            a1 = tab[i];
+        else
+            a1 = 0;
+        return (a0 >> p) | (a1 << (LIMB_BITS - p));
+    }
+}
+
+static inline limb_t get_bit(const limb_t *tab, limb_t len, slimb_t pos)
+{
+    slimb_t i;
+    i = pos >> LIMB_LOG2_BITS;
+    if (i < 0 || i >= len)
+        return 0;
+    return (tab[i] >> (pos & (LIMB_BITS - 1))) & 1;
+}
+
+static inline limb_t limb_mask(int start, int last)
+{
+    limb_t v;
+    int n;
+    n = last - start + 1;
+    if (n == LIMB_BITS)
+        v = -1;
+    else
+        v = (((limb_t)1 << n) - 1) << start;
+    return v;
+}
+
+/* return != 0 if one bit between 0 and bit_pos inclusive is not zero. */
+static inline limb_t scan_bit_nz(const bf_t *r, slimb_t bit_pos)
+{
+    slimb_t pos;
+    limb_t v;
+    
+    pos = bit_pos >> LIMB_LOG2_BITS;
+    if (pos < 0)
+        return 0;
+    v = r->tab[pos] & limb_mask(0, bit_pos & (LIMB_BITS - 1));
+    if (v != 0)
+        return 1;
+    pos--;
+    while (pos >= 0) {
+        if (r->tab[pos] != 0)
+            return 1;
+        pos--;
+    }
+    return 0;
+}
+
+/* return the addend for rounding. Note that prec can be <= 0 for bf_rint() */
+static int bf_get_rnd_add(int *pret, const bf_t *r, limb_t l,
+                          slimb_t prec, int rnd_mode)
+{
+    int add_one, inexact;
+    limb_t bit1, bit0;
+    
+    if (rnd_mode == BF_RNDF) {
+        bit0 = 1; /* faithful rounding does not honor the INEXACT flag */
+    } else {
+        /* starting limb for bit 'prec + 1' */
+        bit0 = scan_bit_nz(r, l * LIMB_BITS - 1 - bf_max(0, prec + 1));
+    }
+
+    /* get the bit at 'prec' */
+    bit1 = get_bit(r->tab, l, l * LIMB_BITS - 1 - prec);
+    inexact = (bit1 | bit0) != 0;
+    
+    add_one = 0;
+    switch(rnd_mode) {
+    case BF_RNDZ:
+        break;
+    case BF_RNDN:
+        if (bit1) {
+            if (bit0) {
+                add_one = 1;
+            } else {
+                /* round to even */
+                add_one =
+                    get_bit(r->tab, l, l * LIMB_BITS - 1 - (prec - 1));
+            }
+        }
+        break;
+    case BF_RNDD:
+    case BF_RNDU:
+        if (r->sign == (rnd_mode == BF_RNDD))
+            add_one = inexact;
+        break;
+    case BF_RNDNA:
+    case BF_RNDF:
+        add_one = bit1;
+        break;
+    case BF_RNDNU:
+        if (bit1) {
+            if (r->sign)
+                add_one = bit0;
+            else
+                add_one = 1;
+        }
+        break;
+    default:
+        abort();
+    }
+    
+    if (inexact)
+        *pret |= BF_ST_INEXACT;
+    return add_one;
+}
+
+static int bf_set_overflow(bf_t *r, int sign, limb_t prec, bf_flags_t flags)
+{
+    slimb_t i, l, e_max;
+    int rnd_mode;
+    
+    rnd_mode = flags & BF_RND_MASK;
+    if (prec == BF_PREC_INF ||
+        rnd_mode == BF_RNDN ||
+        rnd_mode == BF_RNDNA ||
+        rnd_mode == BF_RNDNU ||
+        (rnd_mode == BF_RNDD && sign == 1) ||
+        (rnd_mode == BF_RNDU && sign == 0)) {
+        bf_set_inf(r, sign);
+    } else {
+        /* set to maximum finite number */
+        l = (prec + LIMB_BITS - 1) / LIMB_BITS;
+        bf_resize(r, l);
+        r->tab[0] = limb_mask((-prec) & (LIMB_BITS - 1),
+                              LIMB_BITS - 1);
+        for(i = 1; i < l; i++)
+            r->tab[i] = (limb_t)-1;
+        e_max = (limb_t)1 << (bf_get_exp_bits(flags) - 1);
+        r->expn = e_max;
+        r->sign = sign;
+    }
+    return BF_ST_OVERFLOW | BF_ST_INEXACT;
+}
+
+/* round to prec1 bits assuming 'r' is non zero and finite. 'r' is
+   assumed to have length 'l'. Note: 'prec1' can be negative or
+   infinite (BF_PREC_INF). */
+static int __bf_round(bf_t *r, limb_t prec1, bf_flags_t flags, limb_t l)
+{
+    limb_t v, a;
+    int shift, add_one, ret, rnd_mode;
+    slimb_t i, bit_pos, pos, e_min, e_max, e_range, prec;
+
+    /* e_min and e_max are computed to match the IEEE 754 conventions */
+    e_range = (limb_t)1 << (bf_get_exp_bits(flags) - 1);
+    e_min = -e_range + 3;
+    e_max = e_range;
+    
+    if (unlikely(r->expn < e_min) && (flags & BF_FLAG_SUBNORMAL)) {
+        /* restrict the precision in case of potentially subnormal
+           result */
+        prec = prec1 - (e_min - r->expn);
+    } else {
+        prec = prec1;
+    }
+    
+    /* round to prec bits */
+    rnd_mode = flags & BF_RND_MASK;
+    ret = 0;
+    add_one = bf_get_rnd_add(&ret, r, l, prec, rnd_mode);
+    
+    if (prec <= 0) {
+        if (add_one) {
+            bf_resize(r, 1);
+            r->tab[0] = (limb_t)1 << (LIMB_BITS - 1);
+            r->expn += 1 - prec;
+            ret |= BF_ST_UNDERFLOW | BF_ST_INEXACT;
+            return ret;
+        } else {
+            goto underflow;
+        }
+    } else if (add_one) {
+        limb_t carry;
+        
+        /* add one starting at digit 'prec - 1' */
+        bit_pos = l * LIMB_BITS - 1 - (prec - 1);
+        pos = bit_pos >> LIMB_LOG2_BITS;
+        carry = (limb_t)1 << (bit_pos & (LIMB_BITS - 1));
+        
+        for(i = pos; i < l; i++) {
+            v = r->tab[i] + carry;
+            carry = (v < carry);
+            r->tab[i] = v;
+            if (carry == 0)
+                break;
+        }
+        if (carry) {
+            /* shift right by one digit */
+            v = 1;
+            for(i = l - 1; i >= pos; i--) {
+                a = r->tab[i];
+                r->tab[i] = (a >> 1) | (v << (LIMB_BITS - 1));
+                v = a;
+            }
+            r->expn++;
+        }
+    }
+    
+    /* check underflow */
+    if (unlikely(r->expn < e_min)) {
+        if (flags & BF_FLAG_SUBNORMAL) {
+            /* if inexact, also set the underflow flag */
+            if (ret & BF_ST_INEXACT)
+                ret |= BF_ST_UNDERFLOW;
+        } else {
+        underflow:
+            ret |= BF_ST_UNDERFLOW | BF_ST_INEXACT;
+            bf_set_zero(r, r->sign);
+            return ret;
+        }
+    }
+    
+    /* check overflow */
+    if (unlikely(r->expn > e_max))
+        return bf_set_overflow(r, r->sign, prec1, flags);
+    
+    /* keep the bits starting at 'prec - 1' */
+    bit_pos = l * LIMB_BITS - 1 - (prec - 1);
+    i = bit_pos >> LIMB_LOG2_BITS;
+    if (i >= 0) {
+        shift = bit_pos & (LIMB_BITS - 1);
+        if (shift != 0)
+            r->tab[i] &= limb_mask(shift, LIMB_BITS - 1);
+    } else {
+        i = 0;
+    }
+    /* remove trailing zeros */
+    while (r->tab[i] == 0)
+        i++;
+    if (i > 0) {
+        l -= i;
+        memmove(r->tab, r->tab + i, l * sizeof(limb_t));
+    }
+    bf_resize(r, l);
+    return ret;
+}
+
+/* 'r' must be a finite number */
+int bf_normalize_and_round(bf_t *r, limb_t prec1, bf_flags_t flags)
+{
+    limb_t l, v, a;
+    int shift, ret;
+    slimb_t i;
+    
+    //    bf_print_str("bf_renorm", r);
+    l = r->len;
+    while (l > 0 && r->tab[l - 1] == 0)
+        l--;
+    if (l == 0) {
+        /* zero */
+        r->expn = BF_EXP_ZERO;
+        bf_resize(r, 0);
+        ret = 0;
+    } else {
+        r->expn -= (r->len - l) * LIMB_BITS;
+        /* shift to have the MSB set to '1' */
+        v = r->tab[l - 1];
+        shift = clz(v);
+        if (shift != 0) {
+            v = 0;
+            for(i = 0; i < l; i++) {
+                a = r->tab[i];
+                r->tab[i] = (a << shift) | (v >> (LIMB_BITS - shift));
+                v = a;
+            }
+            r->expn -= shift;
+        }
+        ret = __bf_round(r, prec1, flags, l);
+    }
+    //    bf_print_str("r_final", r);
+    return ret;
+}
+
+/* return true if rounding can be done at precision 'prec' assuming
+   the exact result r is such that |r-a| <= 2^(EXP(a)-k). */
+/* XXX: check the case where the exponent would be incremented by the
+   rounding */
+int bf_can_round(const bf_t *a, slimb_t prec, bf_rnd_t rnd_mode, slimb_t k)
+{
+    BOOL is_rndn;
+    slimb_t bit_pos, n;
+    limb_t bit;
+    
+    if (a->expn == BF_EXP_INF || a->expn == BF_EXP_NAN)
+        return FALSE;
+    if (rnd_mode == BF_RNDF) {
+        return (k >= (prec + 1));
+    }
+    if (a->expn == BF_EXP_ZERO)
+        return FALSE;
+    is_rndn = (rnd_mode == BF_RNDN || rnd_mode == BF_RNDNA ||
+               rnd_mode == BF_RNDNU);
+    if (k < (prec + 2))
+        return FALSE;
+    bit_pos = a->len * LIMB_BITS - 1 - prec;
+    n = k - prec;
+    /* bit pattern for RNDN or RNDNA: 0111.. or 1000...
+       for other rounding modes: 000... or 111... 
+    */
+    bit = get_bit(a->tab, a->len, bit_pos);
+    bit_pos--;
+    n--;
+    bit ^= is_rndn;
+    /* XXX: slow, but a few iterations on average */
+    while (n != 0) {
+        if (get_bit(a->tab, a->len, bit_pos) != bit)
+            return TRUE;
+        bit_pos--;
+        n--;
+    }
+    return FALSE;
+}
+
+int bf_round(bf_t *r, limb_t prec, bf_flags_t flags)
+{
+    if (r->len == 0)
+        return 0;
+    return __bf_round(r, prec, flags, r->len);
+}
+
+/* for debugging */
+static unused void dump_limbs(const char *str, const limb_t *tab, limb_t n)
+{
+    limb_t i;
+    printf("%s: len=%" PRId_LIMB "\n", str, n);
+    for(i = 0; i < n; i++) {
+        printf("%" PRId_LIMB ": " FMT_LIMB "\n",
+               i, tab[i]);
+    }
+}
+
+/* for debugging */
+void bf_print_str(const char *str, const bf_t *a)
+{
+    slimb_t i;
+    printf("%s=", str);
+
+    if (a->expn == BF_EXP_NAN) {
+        printf("NaN");
+    } else {
+        if (a->sign)
+            putchar('-');
+        if (a->expn == BF_EXP_ZERO) {
+            putchar('0');
+        } else if (a->expn == BF_EXP_INF) {
+            printf("Inf");
+        } else {
+            printf("0x0.");
+            for(i = a->len - 1; i >= 0; i--)
+                printf(FMT_LIMB, a->tab[i]);
+            printf("p%" PRId_LIMB, a->expn);
+        }
+    }
+    printf("\n");
+}
+
+/* compare the absolute value of 'a' and 'b'. Return < 0 if a < b, 0
+   if a = b and > 0 otherwise. */
+int bf_cmpu(const bf_t *a, const bf_t *b)
+{
+    slimb_t i;
+    limb_t len, v1, v2;
+    
+    if (a->expn != b->expn) {
+        if (a->expn < b->expn)
+            return -1;
+        else
+            return 1;
+    }
+    len = bf_max(a->len, b->len);
+    for(i = len - 1; i >= 0; i--) {
+        v1 = get_limbz(a, a->len - len + i);
+        v2 = get_limbz(b, b->len - len + i);
+        if (v1 != v2) {
+            if (v1 < v2)
+                return -1;
+            else
+                return 1;
+        }
+    }
+    return 0;
+}
+
+/* Full order: -0 < 0, NaN == NaN and NaN is larger than all other numbers */
+int bf_cmp_full(const bf_t *a, const bf_t *b)
+{
+    int res;
+    
+    if (a->expn == BF_EXP_NAN || b->expn == BF_EXP_NAN) {
+        if (a->expn == b->expn)
+            res = 0;
+        else if (a->expn == BF_EXP_NAN)
+            res = 1;
+        else
+            res = -1;
+    } else if (a->sign != b->sign) {
+        res = 1 - 2 * a->sign;
+    } else {
+        res = bf_cmpu(a, b);
+        if (a->sign)
+            res = -res;
+    }
+    return res;
+}
+
+#define BF_CMP_EQ 1
+#define BF_CMP_LT 2
+#define BF_CMP_LE 3
+
+static int bf_cmp(const bf_t *a, const bf_t *b, int op)
+{
+    BOOL is_both_zero;
+    int res;
+    
+    if (a->expn == BF_EXP_NAN || b->expn == BF_EXP_NAN)
+        return 0;
+    if (a->sign != b->sign) {
+        is_both_zero = (a->expn == BF_EXP_ZERO && b->expn == BF_EXP_ZERO);
+        if (is_both_zero) {
+            return op & BF_CMP_EQ;
+        } else if (op & BF_CMP_LT) {
+            return a->sign;
+        } else {
+            return FALSE;
+        }
+    } else {
+        res = bf_cmpu(a, b);
+        if (res == 0) {
+            return op & BF_CMP_EQ;
+        } else if (op & BF_CMP_LT) {
+            return (res < 0) ^ a->sign;
+        } else {
+            return FALSE;
+        }
+    }
+}
+
+int bf_cmp_eq(const bf_t *a, const bf_t *b)
+{
+    return bf_cmp(a, b, BF_CMP_EQ);
+}
+
+int bf_cmp_le(const bf_t *a, const bf_t *b)
+{
+    return bf_cmp(a, b, BF_CMP_LE);
+}
+
+int bf_cmp_lt(const bf_t *a, const bf_t *b)
+{
+    return bf_cmp(a, b, BF_CMP_LT);
+}
+
+/* Compute the number of bits 'n' matching the pattern:
+   a= X1000..0
+   b= X0111..1
+              
+   When computing a-b, the result will have at least n leading zero
+   bits.
+
+   Precondition: a > b and a.expn - b.expn = 0 or 1
+*/
+static limb_t count_cancelled_bits(const bf_t *a, const bf_t *b)
+{
+    slimb_t bit_offset, b_offset, n;
+    int p, p1;
+    limb_t v1, v2, mask;
+
+    bit_offset = a->len * LIMB_BITS - 1;
+    b_offset = (b->len - a->len) * LIMB_BITS - (LIMB_BITS - 1) +
+        a->expn - b->expn;
+    n = 0;
+
+    /* first search the equals bits */
+    for(;;) {
+        v1 = get_limbz(a, bit_offset >> LIMB_LOG2_BITS);
+        v2 = get_bits(b->tab, b->len, bit_offset + b_offset);
+        //        printf("v1=" FMT_LIMB " v2=" FMT_LIMB "\n", v1, v2);
+        if (v1 != v2)
+            break;
+        n += LIMB_BITS;
+        bit_offset -= LIMB_BITS;
+    }
+    /* find the position of the first different bit */
+    p = clz(v1 ^ v2) + 1;
+    n += p;
+    /* then search for '0' in a and '1' in b */
+    p = LIMB_BITS - p;
+    if (p > 0) {
+        /* search in the trailing p bits of v1 and v2 */
+        mask = limb_mask(0, p - 1);
+        p1 = bf_min(clz(v1 & mask), clz((~v2) & mask)) - (LIMB_BITS - p);
+        n += p1;
+        if (p1 != p)
+            goto done;
+    }
+    bit_offset -= LIMB_BITS;
+    for(;;) {
+        v1 = get_limbz(a, bit_offset >> LIMB_LOG2_BITS);
+        v2 = get_bits(b->tab, b->len, bit_offset + b_offset);
+        //        printf("v1=" FMT_LIMB " v2=" FMT_LIMB "\n", v1, v2);
+        if (v1 != 0 || v2 != -1) {
+            /* different: count the matching bits */
+            p1 = bf_min(clz(v1), clz(~v2));
+            n += p1;
+            break;
+        }
+        n += LIMB_BITS;
+        bit_offset -= LIMB_BITS;
+    }
+ done:
+    return n;
+}
+
+static int bf_add_internal(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+                           bf_flags_t flags, int b_neg)
+{
+    const bf_t *tmp;
+    int is_sub, ret, cmp_res, a_sign, b_sign;
+
+    a_sign = a->sign;
+    b_sign = b->sign ^ b_neg;
+    is_sub = a_sign ^ b_sign;
+    cmp_res = bf_cmpu(a, b);
+    if (cmp_res < 0) {
+        tmp = a;
+        a = b;
+        b = tmp;
+        a_sign = b_sign; /* b_sign is never used later */
+    }
+    /* abs(a) >= abs(b) */
+    if (cmp_res == 0 && is_sub && a->expn < BF_EXP_INF) {
+        /* zero result */
+        bf_set_zero(r, (flags & BF_RND_MASK) == BF_RNDD);
+        ret = 0;
+    } else if (a->len == 0 || b->len == 0) {
+        ret = 0;
+        if (a->expn >= BF_EXP_INF) {
+            if (a->expn == BF_EXP_NAN) {
+                /* at least one operand is NaN */
+                bf_set_nan(r);
+            } else if (b->expn == BF_EXP_INF && is_sub) {
+                /* infinities with different signs */
+                bf_set_nan(r);
+                ret = BF_ST_INVALID_OP;
+            } else {
+                bf_set_inf(r, a_sign);
+            }
+        } else {
+            /* at least one zero and not subtract */
+            bf_set(r, a);
+            r->sign = a_sign;
+            goto renorm;
+        }
+    } else {
+        slimb_t d, a_offset, b_bit_offset, i, cancelled_bits;
+        limb_t carry, v1, v2, u, r_len, carry1, precl, tot_len, z, sub_mask;
+
+        r->sign = a_sign;
+        r->expn = a->expn;
+        d = a->expn - b->expn;
+        /* must add more precision for the leading cancelled bits in
+           subtraction */
+        if (is_sub) {
+            if (d <= 1)
+                cancelled_bits = count_cancelled_bits(a, b);
+            else
+                cancelled_bits = 1;
+        } else {
+            cancelled_bits = 0;
+        }
+        
+        /* add two extra bits for rounding */
+        precl = (cancelled_bits + prec + 2 + LIMB_BITS - 1) / LIMB_BITS;
+        tot_len = bf_max(a->len, b->len + (d + LIMB_BITS - 1) / LIMB_BITS);
+        r_len = bf_min(precl, tot_len);
+        bf_resize(r, r_len);
+        a_offset = a->len - r_len;
+        b_bit_offset = (b->len - r_len) * LIMB_BITS + d;
+
+        /* compute the bits before for the rounding */
+        carry = is_sub;
+        z = 0;
+        sub_mask = -is_sub;
+        i = r_len - tot_len;
+        while (i < 0) {
+            slimb_t ap, bp;
+            BOOL inflag;
+            
+            ap = a_offset + i;
+            bp = b_bit_offset + i * LIMB_BITS;
+            inflag = FALSE;
+            if (ap >= 0 && ap < a->len) {
+                v1 = a->tab[ap];
+                inflag = TRUE;
+            } else {
+                v1 = 0;
+            }
+            if (bp + LIMB_BITS > 0 && bp < (slimb_t)(b->len * LIMB_BITS)) {
+                v2 = get_bits(b->tab, b->len, bp);
+                inflag = TRUE;
+            } else {
+                v2 = 0;
+            }
+            if (!inflag) {
+                /* outside 'a' and 'b': go directly to the next value
+                   inside a or b so that the running time does not
+                   depend on the exponent difference */
+                i = 0;
+                if (ap < 0)
+                    i = bf_min(i, -a_offset);
+                /* b_bit_offset + i * LIMB_BITS + LIMB_BITS >= 1
+                   equivalent to 
+                   i >= ceil(-b_bit_offset + 1 - LIMB_BITS) / LIMB_BITS)
+                */
+                if (bp + LIMB_BITS <= 0)
+                    i = bf_min(i, (-b_bit_offset) >> LIMB_LOG2_BITS);
+            } else {
+                i++;
+            }
+            v2 ^= sub_mask;
+            u = v1 + v2;
+            carry1 = u < v1;
+            u += carry;
+            carry = (u < carry) | carry1;
+            z |= u;
+        }
+        /* and the result */
+        for(i = 0; i < r_len; i++) {
+            v1 = get_limbz(a, a_offset + i);
+            v2 = get_bits(b->tab, b->len, b_bit_offset + i * LIMB_BITS);
+            v2 ^= sub_mask;
+            u = v1 + v2;
+            carry1 = u < v1;
+            u += carry;
+            carry = (u < carry) | carry1;
+            r->tab[i] = u;
+        }
+        /* set the extra bits for the rounding */
+        r->tab[0] |= (z != 0);
+
+        /* carry is only possible in add case */
+        if (!is_sub && carry) {
+            bf_resize(r, r_len + 1);
+            r->tab[r_len] = 1;
+            r->expn += LIMB_BITS;
+        }
+    renorm:
+        ret = bf_normalize_and_round(r, prec, flags);
+    }
+    return ret;
+}
+
+static int __bf_add(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+                     bf_flags_t flags)
+{
+    return bf_add_internal(r, a, b, prec, flags, 0);
+}
+
+static int __bf_sub(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+                     bf_flags_t flags)
+{
+    return bf_add_internal(r, a, b, prec, flags, 1);
+}
+
+static limb_t mp_add(limb_t *res, const limb_t *op1, const limb_t *op2, 
+                     limb_t n, limb_t carry)
+{
+    slimb_t i;
+    limb_t k, a, v, k1;
+    
+    k = carry;
+    for(i=0;i<n;i++) {
+        v = op1[i];
+        a = v + op2[i];
+        k1 = a < v;
+        a = a + k;
+        k = (a < k) | k1;
+        res[i] = a;
+    }
+    return k;
+}
+
+/* tabr[] += taba[] * b, return the high word. */
+static limb_t mp_add_mul1(limb_t *tabr, const limb_t *taba, limb_t n,
+                              limb_t b)
+{
+    limb_t i, l;
+    dlimb_t t;
+    
+    l = 0;
+    for(i = 0; i < n; i++) {
+        t = (dlimb_t)taba[i] * (dlimb_t)b + l + tabr[i];
+        tabr[i] = t;
+        l = t >> LIMB_BITS;
+    }
+    return l;
+}
+
+/* tabr[] -= taba[] * b. Return the value to substract to the high
+   word. */
+static limb_t mp_sub_mul1(limb_t *tabr, const limb_t *taba, limb_t n,
+                          limb_t b)
+{
+    limb_t i, l;
+    dlimb_t t;
+    
+    l = 0;
+    for(i = 0; i < n; i++) {
+        t = tabr[i] - (dlimb_t)taba[i] * (dlimb_t)b - l;
+        tabr[i] = t;
+        l = -(t >> LIMB_BITS);
+    }
+    return l;
+}
+
+/* WARNING: d must be >= 2^(LIMB_BITS-1) */
+static inline limb_t udiv1norm_init(limb_t d)
+{
+    limb_t a0, a1;
+    a1 = -d - 1;
+    a0 = -1;
+    return (((dlimb_t)a1 << LIMB_BITS) | a0) / d;
+}
+
+/* return the quotient and the remainder in '*pr'of 'a1*2^LIMB_BITS+a0
+   / d' with 0 <= a1 < d. */
+static inline limb_t udiv1norm(limb_t *pr, limb_t a1, limb_t a0,
+                                limb_t d, limb_t d_inv)
+{
+    limb_t n1m, n_adj, q, r, ah;
+    dlimb_t a;
+    n1m = ((slimb_t)a0 >> (LIMB_BITS - 1));
+    n_adj = a0 + (n1m & d);
+    a = (dlimb_t)d_inv * (a1 - n1m) + n_adj;
+    q = (a >> LIMB_BITS) + a1;
+    /* compute a - q * r and update q so that the remainder is\
+       between 0 and d - 1 */
+    a = ((dlimb_t)a1 << LIMB_BITS) | a0;
+    a = a - (dlimb_t)q * d - d;
+    ah = a >> LIMB_BITS;
+    q += 1 + ah;
+    r = (limb_t)a + (ah & d);
+    *pr = r;
+    return q;
+}
+
+/* b must be >= 1 << (LIMB_BITS - 1) */
+static limb_t mp_div1norm(limb_t *tabr, const limb_t *taba, limb_t n,
+                          limb_t b, limb_t r)
+{
+    slimb_t i;
+
+    if (n >= 3) {
+        limb_t b_inv;
+        b_inv = udiv1norm_init(b);
+        for(i = n - 1; i >= 0; i--) {
+            tabr[i] = udiv1norm(&r, r, taba[i], b, b_inv);
+        }
+    } else {
+        dlimb_t a1;
+        for(i = n - 1; i >= 0; i--) {
+            a1 = ((dlimb_t)r << LIMB_BITS) | taba[i];
+            tabr[i] = a1 / b;
+            r = a1 % b;
+        }
+    }
+    return r;
+}
+
+/* base case division: divides taba[0..na-1] by tabb[0..nb-1]. tabb[nb
+   - 1] must be >= 1 << (LIMB_BITS - 1). na - nb must be >= 0. 'taba'
+   is modified and contains the remainder (nb limbs). tabq[0..na-nb]
+   contains the quotient. taba[na] is modified. */
+static void mp_divnorm(limb_t *tabq, 
+                       limb_t *taba, limb_t na, 
+                       const limb_t *tabb, limb_t nb)
+{
+    limb_t r, a, c, q, v, b1, b1_inv, n, dummy_r;
+    slimb_t i;
+
+    b1 = tabb[nb - 1];
+    if (nb == 1) {
+        taba[0] = mp_div1norm(tabq, taba, na, b1, 0);
+        return;
+    }
+    taba[na] = 0;
+    n = na - nb;
+    if (n >= 3)
+        b1_inv = udiv1norm_init(b1);
+    else
+        b1_inv = 0;
+
+    /* XXX: could simplify the first iteration */
+    for(i = n; i >= 0; i--) {
+        if (unlikely(taba[i + nb] >= b1)) {
+            q = -1;
+        } else if (b1_inv) {
+            q = udiv1norm(&dummy_r, taba[i + nb], taba[i + nb - 1], b1, b1_inv);
+        } else {
+            dlimb_t al;
+            al = ((dlimb_t)taba[i + nb] << LIMB_BITS) | taba[i + nb - 1];
+            q = al / b1;
+            r = al % b1;
+        }
+        r = mp_sub_mul1(taba + i, tabb, nb, q);
+
+        v = taba[i + nb];
+        a = v - r;
+        c = (a > v);
+        taba[i + nb] = a;
+
+        if (c != 0) {
+            /* negative result */
+            for(;;) {
+                q--;
+                c = mp_add(taba + i, taba + i, tabb, nb, 0);
+                /* propagate carry and test if positive result */
+                if (c != 0) {
+                    if (++taba[i + nb] == 0) {
+                        break;
+                    }
+                }
+            }
+        }
+        tabq[i] = q;
+    }
+}
+
+int bf_mul(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+           bf_flags_t flags)
+{
+    limb_t i;
+    int ret, r_sign;
+
+    if (a->len < b->len) {
+        const bf_t *tmp = a;
+        a = b;
+        b = tmp;
+    }
+    r_sign = a->sign ^ b->sign;
+    /* here b->len <= a->len */
+    if (b->len == 0) {
+        if (a->expn == BF_EXP_NAN || b->expn == BF_EXP_NAN) {
+            bf_set_nan(r);
+            ret = 0;
+        } else if (a->expn == BF_EXP_INF || b->expn == BF_EXP_INF) {
+            if ((a->expn == BF_EXP_INF && b->expn == BF_EXP_ZERO) ||
+                (a->expn == BF_EXP_ZERO && b->expn == BF_EXP_INF)) {
+                bf_set_nan(r);
+                ret = BF_ST_INVALID_OP;
+            } else {
+                bf_set_inf(r, r_sign);
+                ret = 0;
+            }
+        } else {
+            bf_set_zero(r, r_sign);
+            ret = 0;
+        }
+    } else {
+        bf_t tmp, *r1 = NULL;
+        limb_t a_len, b_len, precl;
+        limb_t *a_tab, *b_tab;
+            
+        a_len = a->len;
+        b_len = b->len;
+        
+        if ((flags & BF_RND_MASK) == BF_RNDF) {
+            /* faithful rounding does not require using the full inputs */
+            precl = (prec + 2 + LIMB_BITS - 1) / LIMB_BITS;
+            a_len = bf_min(a_len, precl);
+            b_len = bf_min(b_len, precl);
+        }
+        a_tab = a->tab + a->len - a_len;
+        b_tab = b->tab + b->len - b_len;
+        
+#ifdef USE_FFT_MUL
+        if (b_len >= FFT_MUL_THRESHOLD) {
+            int mul_flags = 0;
+            if (r == a)
+                mul_flags |= FFT_MUL_R_OVERLAP_A;
+            if (r == b)
+                mul_flags |= FFT_MUL_R_OVERLAP_B;
+            fft_mul(r, a_tab, a_len, b_tab, b_len, mul_flags);
+        } else
+#endif
+        {
+            if (r == a || r == b) {
+                bf_init(r->ctx, &tmp);
+                r1 = r;
+                r = &tmp;
+            }
+            bf_resize(r, a_len + b_len);
+            memset(r->tab, 0, sizeof(limb_t) * a_len);
+            for(i = 0; i < b_len; i++) {
+                r->tab[i + a_len] = mp_add_mul1(r->tab + i, a_tab, a_len,
+                                                b_tab[i]);
+            }
+        }
+        r->sign = r_sign;
+        r->expn = a->expn + b->expn;
+        ret = bf_normalize_and_round(r, prec, flags);
+        if (r == &tmp)
+            bf_move(r1, &tmp);
+    }
+    return ret;
+}
+
+/* multiply 'r' by 2^e */
+int bf_mul_2exp(bf_t *r, slimb_t e, limb_t prec, bf_flags_t flags)
+{
+    slimb_t e_max;
+    if (r->len == 0)
+        return 0;
+    e_max = ((limb_t)1 << BF_EXP_BITS_MAX) - 1;
+    e = bf_max(e, -e_max);
+    e = bf_min(e, e_max);
+    r->expn += e;
+    return __bf_round(r, prec, flags, r->len);
+}
+
+static void bf_recip_rec(bf_t *a, const bf_t *x, limb_t prec1)
+{
+    bf_t t0;
+    limb_t prec;
+
+    bf_init(a->ctx, &t0);
+
+    if (prec1 <= LIMB_BITS - 3) {
+        limb_t v;
+        /* initial approximation */
+        v = x->tab[x->len - 1];
+        /* 2^(L-1) <= v <= 2^L-1 (L=LIMB_BITS) */
+        v = ((dlimb_t)1 << (2 * LIMB_BITS - 2)) / v;
+        /* 2^(L-2) <= v <= 2^(L-1) */
+        bf_resize(a, 1);
+        a->sign = x->sign;
+        a->expn = 2 - x->expn;
+        if (v == ((limb_t)1 << (LIMB_BITS - 1))) {
+            a->tab[0] = v;
+        } else {
+            a->tab[0] = v << 1;
+            a->expn--;
+        }
+        a->tab[0] &= limb_mask(LIMB_BITS - prec1, LIMB_BITS - 1);
+    } else {
+        /* XXX: prove the added precision */
+        bf_recip_rec(a, x, (prec1 / 2) + 8);
+        prec = prec1 + 8;
+
+        /* a = a + a * (1 - x * a) */
+        bf_mul(&t0, x, a, prec, BF_RNDF);
+        t0.sign ^= 1;
+        bf_add_si(&t0, &t0, 1, prec, BF_RNDF);
+        bf_mul(&t0, &t0, a, prec, BF_RNDF);
+        bf_add(a, a, &t0, prec1, BF_RNDF);
+    }
+    //    bf_print_str("r", a);
+    bf_delete(&t0);
+}
+
+/* Note: only faithful rounding is supported */
+void bf_recip(bf_t *r, const bf_t *a, limb_t prec)
+{
+    assert(r != a);
+    if (a->len == 0) {
+        if (a->expn == BF_EXP_NAN) {
+            bf_set_nan(r);
+        } else if (a->expn == BF_EXP_INF) {
+            bf_set_zero(r, a->sign);
+        } else {
+            bf_set_inf(r, a->sign);
+        }
+    } else {
+        //        bf_print_str("a", a);
+        bf_recip_rec(r, a, prec);
+    }
+}
+
+/* add zero limbs if necessary to have at least precl limbs */
+static void bf_add_zero_limbs(bf_t *r, limb_t precl)
+{
+    limb_t l = r->len;
+    if (l < precl) {
+        bf_resize(r, precl);
+        memmove(r->tab + precl - l, r->tab,
+                l * sizeof(limb_t));
+        memset(r->tab, 0, (precl - l) * sizeof(limb_t));
+    }
+}
+
+/* set a bit to 1 at bit position >= (precl * LIMB_BITS - 1) */
+static void bf_or_one(bf_t *r, limb_t precl)
+{
+    bf_add_zero_limbs(r, precl);
+    r->tab[0] |= 1;
+}
+
+/* Return e such as a=m*2^e with m odd integer. return 0 if a is zero,
+   Infinite or Nan. */
+slimb_t bf_get_exp_min(const bf_t *a)
+{
+    slimb_t i;
+    limb_t v;
+    int k;
+    
+    for(i = 0; i < a->len; i++) {
+        v = a->tab[i];
+        if (v != 0) {
+            k = ctz(v);
+            return a->expn - (a->len - i) * LIMB_BITS + k;
+        }
+    }
+    return 0;
+}
+
+/* a and b must be finite numbers with a >= 0 and b > 0. 'q' is the
+   integer defined as floor(a/b) and r = a - q * b. */
+static void bf_tdivremu(bf_t *q, bf_t *r,
+                        const bf_t *a, const bf_t *b)
+{
+    if (a->expn < b->expn) {
+        bf_set_ui(q, 0);
+        bf_set(r, a);
+    } else {
+        /* for large numbers, use the floating point division in
+           faithful mode */
+        bf_div(q, a, b, bf_max(a->expn - b->expn + 1, 2), BF_RNDF);
+        bf_rint(q, BF_PREC_INF, BF_RNDZ);
+        bf_mul(r, q, b, BF_PREC_INF, BF_RNDN);
+        bf_sub(r, a, r, BF_PREC_INF, BF_RNDN);
+        if (r->len != 0 && r->sign) {
+            bf_add_si(q, q, -1, BF_PREC_INF, BF_RNDZ);
+            bf_add(r, r, b, BF_PREC_INF, BF_RNDZ);
+        }
+    }
+}
+
+static int __bf_div(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+                    bf_flags_t flags)
+{
+    int ret, r_sign;
+    limb_t n, nb, precl;
+    
+    r_sign = a->sign ^ b->sign;
+    if (a->expn >= BF_EXP_INF || b->expn >= BF_EXP_INF) {
+        if (a->expn == BF_EXP_NAN || b->expn == BF_EXP_NAN) {
+            bf_set_nan(r);
+            return 0;
+        } else if (a->expn == BF_EXP_INF && b->expn == BF_EXP_INF) {
+            bf_set_nan(r);
+            return BF_ST_INVALID_OP;
+        } else if (a->expn == BF_EXP_INF) {
+            bf_set_inf(r, r_sign);
+            return 0;
+        } else {
+            bf_set_zero(r, r_sign);
+            return 0;
+        }
+    } else if (a->expn == BF_EXP_ZERO) {
+        if (b->expn == BF_EXP_ZERO) {
+            bf_set_nan(r);
+            return BF_ST_INVALID_OP;
+        } else {
+            bf_set_zero(r, r_sign);
+            return 0;
+        }
+    } else if (b->expn == BF_EXP_ZERO) {
+        bf_set_inf(r, r_sign);
+        return BF_ST_DIVIDE_ZERO;
+    }
+
+    /* number of limbs of the quotient (2 extra bits for rounding) */
+    precl = (prec + 2 + LIMB_BITS - 1) / LIMB_BITS;
+    nb = b->len;
+    n = bf_max(a->len, precl);
+    
+    if (nb <= BASECASE_DIV_THRESHOLD_B ||
+        (slimb_t)n <= (BASECASE_DIV_THRESHOLD_Q - 1)) {
+        limb_t *taba, na, i;
+        slimb_t d;
+        
+        na = n + nb;
+        taba = bf_malloc(r->ctx, (na + 1) * sizeof(limb_t));
+        d = na - a->len;
+        memset(taba, 0, d * sizeof(limb_t));
+        memcpy(taba + d, a->tab, a->len * sizeof(limb_t));
+        bf_resize(r, n + 1);
+        mp_divnorm(r->tab, taba, na, b->tab, nb);
+        
+        /* see if non zero remainder */
+        for(i = 0; i < nb; i++) {
+            if (taba[i] != 0) {
+                r->tab[0] |= 1;
+                break;
+            }
+        }
+        bf_free(r->ctx, taba);
+        r->expn = a->expn - b->expn + LIMB_BITS;
+        r->sign = r_sign;
+        ret = bf_normalize_and_round(r, prec, flags);
+    } else if ((flags & BF_RND_MASK) == BF_RNDF) {
+        bf_t b_inv;
+        bf_init(r->ctx, &b_inv);
+        bf_recip(&b_inv, b, prec + 3);
+        ret = bf_mul(r, a, &b_inv, prec, flags);
+        bf_delete(&b_inv);
+    } else {
+        bf_t a1_s, *a1 = &a1_s;
+        bf_t b1_s, *b1 = &b1_s;
+        bf_t rem_s, *rem = &rem_s;
+        
+        /* convert the mantissa of 'a' and 'b' to integers and generate
+           a quotient with at least prec + 2 bits */
+        a1->expn = (n + nb) * LIMB_BITS;
+        a1->tab = a->tab;
+        a1->len = a->len;
+        a1->sign = 0;
+
+        b1->expn = nb * LIMB_BITS;
+        b1->tab = b->tab;
+        b1->len = nb;
+        b1->sign = 0;
+
+        bf_init(r->ctx, rem);
+        bf_tdivremu(r, rem, a1, b1);
+        /* the remainder is not zero: put it in the rounding bits */
+        if (rem->len != 0) {
+            bf_or_one(r, precl);
+        }
+        bf_delete(rem);
+        r->expn += a->expn - b->expn - n * LIMB_BITS;
+        r->sign = r_sign;
+        ret = bf_round(r, prec, flags);
+    }
+    return ret;
+}
+
+/* division and remainder. 
+   
+   rnd_mode is the rounding mode for the quotient. The additional
+   rounding mode BF_RND_EUCLIDIAN is supported.
+
+   'q' is an integer. 'r' is rounded with prec and flags (prec can be
+   BF_PREC_INF).
+*/
+int bf_divrem(bf_t *q, bf_t *r, const bf_t *a, const bf_t *b,
+              limb_t prec, bf_flags_t flags, int rnd_mode)
+{
+    bf_t a1_s, *a1 = &a1_s;
+    bf_t b1_s, *b1 = &b1_s;
+    int q_sign;
+    BOOL is_ceil, is_rndn;
+    
+    assert(q != a && q != b);
+    assert(r != a && r != b);
+    assert(q != r);
+    
+    if (a->len == 0 || b->len == 0) {
+        bf_set_zero(q, 0);
+        if (a->expn == BF_EXP_NAN || b->expn == BF_EXP_NAN) {
+            bf_set_nan(r);
+            return 0;
+        } else if (a->expn == BF_EXP_INF || b->expn == BF_EXP_ZERO) {
+            bf_set_nan(r);
+            return BF_ST_INVALID_OP;
+        } else {
+            bf_set(r, a);
+            return bf_round(r, prec, flags);
+        }
+    }
+
+    q_sign = a->sign ^ b->sign;
+    is_rndn = (rnd_mode == BF_RNDN || rnd_mode == BF_RNDNA ||
+               rnd_mode == BF_RNDNU);
+    switch(rnd_mode) {
+    default:
+    case BF_RNDZ:
+    case BF_RNDN:
+    case BF_RNDNA:
+        is_ceil = FALSE;
+        break;
+    case BF_RNDD:
+        is_ceil = q_sign;
+        break;
+    case BF_RNDU:
+        is_ceil = q_sign ^ 1;
+        break;
+    case BF_DIVREM_EUCLIDIAN:
+        is_ceil = a->sign;
+        break;
+    case BF_RNDNU:
+        /* XXX: unsupported yet */
+        abort();
+    }
+
+    a1->expn = a->expn;
+    a1->tab = a->tab;
+    a1->len = a->len;
+    a1->sign = 0;
+    
+    b1->expn = b->expn;
+    b1->tab = b->tab;
+    b1->len = b->len;
+    b1->sign = 0;
+
+    /* XXX: could improve to avoid having a large 'q' */
+    bf_tdivremu(q, r, a1, b1);
+
+    if (r->len != 0) {
+        if (is_rndn) {
+            int res;
+            b1->expn--;
+            res = bf_cmpu(r, b1);
+            b1->expn++;
+            if (res > 0 ||
+                (res == 0 &&
+                 (rnd_mode == BF_RNDNA ||
+                  get_bit(q->tab, q->len, q->len * LIMB_BITS - q->expn)))) {
+                goto do_sub_r;
+            }
+        } else if (is_ceil) {
+        do_sub_r:
+            bf_add_si(q, q, 1, BF_PREC_INF, BF_RNDZ);
+            bf_sub(r, r, b1, BF_PREC_INF, BF_RNDZ);
+        }
+    }
+
+    r->sign ^= a->sign;
+    q->sign = q_sign;
+    return bf_round(r, prec, flags);
+}
+
+int bf_fmod(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+            bf_flags_t flags)
+{
+    bf_t q_s, *q = &q_s;
+    int ret;
+    
+    bf_init(r->ctx, q);
+    ret = bf_divrem(q, r, a, b, prec, flags, BF_RNDZ);
+    bf_delete(q);
+    return ret;
+}
+
+int bf_remainder(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+                 bf_flags_t flags)
+{
+    bf_t q_s, *q = &q_s;
+    int ret;
+    
+    bf_init(r->ctx, q);
+    ret = bf_divrem(q, r, a, b, prec, flags, BF_RNDN);
+    bf_delete(q);
+    return ret;
+}
+
+static inline int bf_get_limb(slimb_t *pres, const bf_t *a, int flags)
+{
+#if LIMB_BITS == 32
+    return bf_get_int32(pres, a, flags);
+#else
+    return bf_get_int64(pres, a, flags);
+#endif
+}
+
+int bf_remquo(slimb_t *pq, bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+              bf_flags_t flags)
+{
+    bf_t q_s, *q = &q_s;
+    int ret;
+    
+    bf_init(r->ctx, q);
+    ret = bf_divrem(q, r, a, b, prec, flags, BF_RNDN);
+    bf_get_limb(pq, q, BF_GET_INT_MOD);
+    bf_delete(q);
+    return ret;
+}
+
+static unused inline limb_t mul_mod(limb_t a, limb_t b, limb_t m)
+{
+    dlimb_t t;
+    t = (dlimb_t)a * (dlimb_t)b;
+    return t % m;
+}
+
+#if defined(USE_MUL_CHECK)
+static limb_t mp_mod1(const limb_t *tab, limb_t n, limb_t m, limb_t r)
+{
+    slimb_t i;
+    dlimb_t t;
+
+    for(i = n - 1; i >= 0; i--) {
+        t = ((dlimb_t)r << LIMB_BITS) | tab[i];
+        r = t % m;
+    }
+    return r;
+}
+#endif
+
+/* (128.0 / sqrt((i + 64) / 256)) & 0xff */
+static const uint8_t rsqrt_table[192] = {
+  0,254,252,250,248,247,245,243,241,240,238,236,235,233,232,230,
+229,228,226,225,223,222,221,220,218,217,216,215,214,212,211,210,
+209,208,207,206,205,204,203,202,201,200,199,198,197,196,195,194,
+194,193,192,191,190,189,189,188,187,186,185,185,184,183,182,182,
+181,180,180,179,178,178,177,176,176,175,174,174,173,172,172,171,
+171,170,169,169,168,168,167,167,166,166,165,164,164,163,163,162,
+162,161,161,160,160,159,159,158,158,158,157,157,156,156,155,155,
+154,154,154,153,153,152,152,151,151,151,150,150,149,149,149,148,
+148,147,147,147,146,146,146,145,145,144,144,144,143,143,143,142,
+142,142,141,141,141,140,140,140,139,139,139,138,138,138,137,137,
+137,137,136,136,136,135,135,135,134,134,134,134,133,133,133,132,
+132,132,132,131,131,131,131,130,130,130,130,129,129,129,129,128,
+};
+
+static void __bf_rsqrt(bf_t *a, const bf_t *x, limb_t prec1)
+{
+    bf_t t0;
+    limb_t prec;
+
+    if (prec1 <= 7) {
+        slimb_t e;
+        limb_t v;
+        /* initial approximation using 8 mantissa bits */
+        v = x->tab[x->len - 1];
+        e = x->expn;
+        if (e & 1) {
+            v >>= 1;
+            e++;
+        }
+        v = rsqrt_table[(v >> (LIMB_BITS - 8)) - 64];
+        e = 1 - (e / 2);
+        if (v == 0) {
+            v = 128; /* real table value is 256 */
+            e++;
+        }
+        bf_resize(a, 1);
+        a->tab[0] = (v << (LIMB_BITS - 8)) &
+            limb_mask(LIMB_BITS - prec1, LIMB_BITS - 1);
+        a->expn = e;
+        a->sign = 0;
+    } else {
+        /* XXX: prove rounding */
+        __bf_rsqrt(a, x, (prec1 / 2) + 2);
+
+        prec = prec1 + 3;
+
+        /* x' = x + (x/2) * (1 - a * x^2) */
+        bf_init(a->ctx, &t0);
+
+        bf_mul(&t0, a, a, prec, BF_RNDF);
+        bf_mul(&t0, &t0, x, prec, BF_RNDF);
+        t0.sign ^= 1;
+        bf_add_si(&t0, &t0, 1, prec, BF_RNDF);
+        bf_mul(&t0, &t0, a, prec, BF_RNDF);
+        if (t0.len != 0)
+            t0.expn--;
+        bf_add(a, a, &t0, prec1, BF_RNDF);
+
+        bf_delete(&t0);
+    }
+}
+
+static int __bf_sqrt(bf_t *x, const bf_t *a, limb_t prec1, bf_flags_t flags)
+{
+    bf_t t0, t1;
+    limb_t prec;
+    int ret;
+    
+    /* XXX: prove rounding */
+    __bf_rsqrt(x, a, (prec1 / 2) + 2);
+    prec = prec1 + 3;
+
+    /* x' = a * x + (x/2) * (a - (a * x)^2) */
+    
+    bf_init(x->ctx, &t0);
+    bf_init(x->ctx, &t1);
+    bf_mul(&t1, x, a, prec, BF_RNDF);
+    bf_mul(&t0, &t1, &t1, prec, BF_RNDF);
+    t0.sign ^= 1;
+    bf_add(&t0, &t0, a, prec, BF_RNDF);
+    bf_mul(&t0, &t0, x, prec, BF_RNDF);
+    if (t0.len != 0)
+        t0.expn--;
+    ret = bf_add(x, &t1, &t0, prec1, flags);
+    
+    bf_delete(&t0);
+    bf_delete(&t1);
+    return ret;
+}
+
+/* Note: only faithful rounding is supported */
+void bf_rsqrt(bf_t *r, const bf_t *a, limb_t prec)
+{
+    if (a->len == 0) {
+        if (a->expn == BF_EXP_NAN ||
+            (a->sign && a->expn != BF_EXP_ZERO)) {
+            bf_set_nan(r);
+        } else if (a->expn == BF_EXP_INF) {
+            bf_set_zero(r, a->sign);
+        } else {
+            bf_set_inf(r, 0);
+        }
+    } else if (a->sign) {
+        bf_set_nan(r);
+    } else {
+        //        bf_print_str("a", a);
+        __bf_rsqrt(r, a, prec);
+    }
+}
+
+/* return floor(sqrt(a)) */
+static limb_t bf_isqrt(limb_t a)
+{
+    unsigned int l;
+    limb_t u, s;
+    
+    if (a == 0)
+        return 0;
+    l = ceil_log2(a);
+    u = (limb_t)1 << ((l + 1) / 2);
+    /* u >= floor(sqrt(a)) */
+    for(;;) {
+        s = u;
+        u = ((a / s) + s) / 2;
+        if (u >= s)
+            break;
+    }
+    return s;
+}
+
+/* Integer square root with remainder. 'a' must be an integer. r =
+   floor(sqrt(a)) and rem = a - r^2.  BF_ST_INEXACT is set if the result
+   is inexact. 'rem' can be NULL if the remainder is not needed. */
+int bf_sqrtrem(bf_t *r, bf_t *rem1, const bf_t *a)
+{
+    int ret;
+    
+    if (a->len == 0) {
+        if (a->expn == BF_EXP_NAN) {
+            bf_set_nan(r);
+        } else if (a->expn == BF_EXP_INF && a->sign) {
+            goto invalid_op;
+        } else {
+            bf_set(r, a);
+        }
+        if (rem1)
+            bf_set_ui(rem1, 0);
+        ret = 0;
+    } else if (a->sign) {
+ invalid_op:
+        bf_set_nan(r);
+        if (rem1)
+            bf_set_ui(rem1, 0);
+        ret = BF_ST_INVALID_OP;
+    } else {
+        bf_t rem_s, *rem;
+        int res;
+        
+        bf_sqrt(r, a, (a->expn + 1) / 2, BF_RNDF);
+        bf_rint(r, BF_PREC_INF, BF_RNDZ);
+        /* see if the result is exact by computing the remainder */
+        if (rem1) {
+            rem = rem1;
+        } else {
+            rem = &rem_s;
+            bf_init(r->ctx, rem);
+        }
+        bf_mul(rem, r, r, BF_PREC_INF, BF_RNDZ);
+        ret = 0;
+        if (rem1) {
+            bf_neg(rem);
+            bf_add(rem, rem, a, BF_PREC_INF, BF_RNDZ);
+            if (rem->len != 0) {
+                ret = BF_ST_INEXACT;
+                if (rem->sign) {
+                    bf_t a1_s, *a1 = &a1_s;
+                    bf_add_si(r, r, -1, BF_PREC_INF, BF_RNDZ);
+                    a1->tab = a->tab;
+                    a1->len = a->len;
+                    a1->sign = a->sign;
+                    a1->expn = a->expn + 1;
+                    bf_add(rem, rem, r, BF_PREC_INF, BF_RNDZ);
+                    bf_add_si(rem, rem, 1, BF_PREC_INF, BF_RNDZ);
+                }
+            } else {
+                ret = 0;
+            }
+        } else {
+            res = bf_cmpu(rem, a);
+            bf_delete(rem);
+            //            printf("res2=%d\n", res2);
+            if (res > 0) {
+                /* need to correct the result */
+                bf_add_si(r, r, -1, BF_PREC_INF, BF_RNDZ);
+            }
+            ret = (res != 0 ? BF_ST_INEXACT : 0);
+        }
+    }
+    return ret;
+}
+
+int bf_sqrt(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags)
+{
+    int rnd_mode, ret;
+
+    assert(r != a);
+
+    if (a->len == 0) {
+        if (a->expn == BF_EXP_NAN) {
+            bf_set_nan(r);
+        } else if (a->expn == BF_EXP_INF && a->sign) {
+            goto invalid_op;
+        } else {
+            bf_set(r, a);
+        }
+        ret = 0;
+    } else if (a->sign) {
+ invalid_op:
+        bf_set_nan(r);
+        ret = BF_ST_INVALID_OP;
+    } else {
+        rnd_mode = flags & BF_RND_MASK;
+        if (rnd_mode == BF_RNDF) {
+            ret = __bf_sqrt(r, a, prec, flags);
+        } else {
+            bf_t a1_s, *a1 = &a1_s;
+            slimb_t d, prec2;
+            int res1, res2;
+
+            bf_init(r->ctx, a1);
+            bf_set(a1, a);
+            /* convert the mantissa to an integer with at most 2 *
+               prec + 4 bits */
+            prec2 = prec + 2;
+            /* make '-a->expn + d' divisible by two */
+            d = prec2 * 2 - (a->expn & 1);
+            a1->expn = d;
+            res1 = bf_rint(a1, BF_PREC_INF, BF_RNDZ);
+            res2 = bf_sqrtrem(r, NULL, a1);
+            bf_delete(a1);
+            if ((res2 | res1) != 0) {
+                bf_or_one(r, (prec2 + LIMB_BITS - 1) / LIMB_BITS);
+            }
+            /* update the exponent */
+            r->expn -= (-a->expn + d) >> 1;
+            ret = bf_round(r, prec, flags);
+        }
+    }
+    return ret;
+}
+
+static no_inline int bf_op2(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+                            bf_flags_t flags, bf_op2_func_t *func)
+{
+    bf_t tmp;
+    int ret;
+    
+    if (r == a || r == b) {
+        bf_init(r->ctx, &tmp);
+        ret = func(&tmp, a, b, prec, flags);
+        bf_move(r, &tmp);
+    } else {
+        ret = func(r, a, b, prec, flags);
+    }
+    return ret;
+}
+
+int bf_add(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+            bf_flags_t flags)
+{
+    return bf_op2(r, a, b, prec, flags, __bf_add);
+}
+
+int bf_sub(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+            bf_flags_t flags)
+{
+    return bf_op2(r, a, b, prec, flags, __bf_sub);
+}
+
+int bf_div(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+           bf_flags_t flags)
+{
+    return bf_op2(r, a, b, prec, flags, __bf_div);
+}
+
+int bf_mul_ui(bf_t *r, const bf_t *a, uint64_t b1, limb_t prec,
+               bf_flags_t flags)
+{
+    bf_t b;
+    int ret;
+    bf_init(r->ctx, &b);
+    bf_set_ui(&b, b1);
+    ret = bf_mul(r, a, &b, prec, flags);
+    bf_delete(&b);
+    return ret;
+}
+
+int bf_mul_si(bf_t *r, const bf_t *a, int64_t b1, limb_t prec,
+               bf_flags_t flags)
+{
+    bf_t b;
+    int ret;
+    bf_init(r->ctx, &b);
+    bf_set_si(&b, b1);
+    ret = bf_mul(r, a, &b, prec, flags);
+    bf_delete(&b);
+    return ret;
+}
+
+int bf_add_si(bf_t *r, const bf_t *a, int64_t b1, limb_t prec,
+              bf_flags_t flags)
+{
+    bf_t b;
+    int ret;
+    
+    bf_init(r->ctx, &b);
+    bf_set_si(&b, b1);
+    ret = bf_add(r, a, &b, prec, flags);
+    bf_delete(&b);
+    return ret;
+}
+
+int bf_pow_ui(bf_t *r, const bf_t *a, limb_t b, limb_t prec,
+              bf_flags_t flags)
+{
+    int ret, n_bits, i;
+    
+    assert(r != a);
+    if (b == 0) {
+        bf_set_ui(r, 1);
+        return 0;
+    }
+    bf_set(r, a);
+    ret = 0;
+    n_bits = LIMB_BITS - clz(b);
+    for(i = n_bits - 2; i >= 0; i--) {
+        ret |= bf_mul(r, r, r, prec, flags);
+        if ((b >> i) & 1)
+            ret |= bf_mul(r, r, a, prec, flags);
+    }
+    return ret;
+}
+
+int bf_pow_ui_ui(bf_t *r, limb_t a1, limb_t b, limb_t prec, bf_flags_t flags)
+{
+    bf_t a;
+    int ret;
+    
+    bf_init(r->ctx, &a);
+    bf_set_ui(&a, a1);
+    ret = bf_pow_ui(r, &a, b, prec, flags);
+    bf_delete(&a);
+    return ret;
+}
+
+/* convert to integer (single rounding) */
+int bf_rint(bf_t *r, limb_t prec, bf_flags_t flags)
+{
+    int ret;
+    if (r->len == 0)
+        return 0;
+    if (r->expn <= 0) {
+        ret = __bf_round(r, r->expn, flags & ~BF_FLAG_SUBNORMAL, r->len) &
+            ~BF_ST_UNDERFLOW;
+    } else {
+        ret = __bf_round(r, bf_min(r->expn, prec), flags, r->len);
+    }
+    return ret;
+}
+
+/* logical operations */
+#define BF_LOGIC_OR  0
+#define BF_LOGIC_XOR 1
+#define BF_LOGIC_AND 2
+
+static inline limb_t bf_logic_op1(limb_t a, limb_t b, int op)
+{
+    switch(op) {
+    case BF_LOGIC_OR:
+        return a | b;
+    case BF_LOGIC_XOR:
+        return a ^ b;
+    default:
+    case BF_LOGIC_AND:
+        return a & b;
+    }
+}
+
+static void bf_logic_op(bf_t *r, const bf_t *a1, const bf_t *b1, int op)
+{
+    bf_t b1_s, a1_s, *a, *b;
+    limb_t a_sign, b_sign, r_sign;
+    slimb_t l, i, a_bit_offset, b_bit_offset;
+    limb_t v1, v2, v1_mask, v2_mask, r_mask;
+    
+    assert(r != a1 && r != b1);
+
+    if (a1->expn <= 0)
+        a_sign = 0; /* minus zero is considered as positive */
+    else
+        a_sign = a1->sign;
+
+    if (b1->expn <= 0)
+        b_sign = 0; /* minus zero is considered as positive */
+    else
+        b_sign = b1->sign;
+    
+    if (a_sign) {
+        a = &a1_s;
+        bf_init(r->ctx, a);
+        bf_add_si(a, a1, 1, BF_PREC_INF, BF_RNDZ);
+    } else {
+        a = (bf_t *)a1;
+    }
+
+    if (b_sign) {
+        b = &b1_s;
+        bf_init(r->ctx, b);
+        bf_add_si(b, b1, 1, BF_PREC_INF, BF_RNDZ);
+    } else {
+        b = (bf_t *)b1;
+    }
+    
+    r_sign = bf_logic_op1(a_sign, b_sign, op);
+    if (op == BF_LOGIC_AND && r_sign == 0) {
+        /* no need to compute extra zeros for and */
+        if (a_sign == 0 && b_sign == 0)
+            l = bf_min(a->expn, b->expn);
+        else if (a_sign == 0)
+            l = a->expn;
+        else
+            l = b->expn;
+    } else {
+        l = bf_max(a->expn, b->expn);
+    }
+    /* Note: a or b can be zero */
+    l = (bf_max(l, 1) + LIMB_BITS - 1) / LIMB_BITS;
+    bf_resize(r, l);
+    a_bit_offset = a->len * LIMB_BITS - a->expn;
+    b_bit_offset = b->len * LIMB_BITS - b->expn;
+    v1_mask = -a_sign;
+    v2_mask = -b_sign;
+    r_mask = -r_sign;
+    for(i = 0; i < l; i++) {
+        v1 = get_bits(a->tab, a->len, a_bit_offset + i * LIMB_BITS) ^ v1_mask;
+        v2 = get_bits(b->tab, b->len, b_bit_offset + i * LIMB_BITS) ^ v2_mask;
+        r->tab[i] = bf_logic_op1(v1, v2, op) ^ r_mask;
+    }
+    r->expn = l * LIMB_BITS;
+    r->sign = r_sign;
+    bf_normalize_and_round(r, BF_PREC_INF, BF_RNDZ);
+    if (r_sign)
+        bf_add_si(r, r, -1, BF_PREC_INF, BF_RNDZ);
+    if (a == &a1_s)
+        bf_delete(a);
+    if (b == &b1_s)
+        bf_delete(b);
+}
+
+/* 'a' and 'b' must be integers */
+void bf_logic_or(bf_t *r, const bf_t *a, const bf_t *b)
+{
+    bf_logic_op(r, a, b, BF_LOGIC_OR);
+}
+
+/* 'a' and 'b' must be integers */
+void bf_logic_xor(bf_t *r, const bf_t *a, const bf_t *b)
+{
+    bf_logic_op(r, a, b, BF_LOGIC_XOR);
+}
+
+/* 'a' and 'b' must be integers */
+void bf_logic_and(bf_t *r, const bf_t *a, const bf_t *b)
+{
+    bf_logic_op(r, a, b, BF_LOGIC_AND);
+}
+
+/* conversion between fixed size types */
+
+typedef union {
+    double d;
+    uint64_t u;
+} Float64Union;
+
+int bf_get_float64(const bf_t *a, double *pres, bf_rnd_t rnd_mode)
+{
+    Float64Union u;
+    int e, ret;
+    uint64_t m;
+    
+    ret = 0;
+    if (a->expn == BF_EXP_NAN) {
+        u.u = 0x7ff8000000000000; /* quiet nan */
+    } else {
+        bf_t b_s, *b = &b_s;
+        
+        bf_init(a->ctx, b);
+        bf_set(b, a);
+        if (bf_is_finite(b)) {
+            ret = bf_round(b, 53, rnd_mode | BF_FLAG_SUBNORMAL | bf_set_exp_bits(11));
+        }
+        if (b->expn == BF_EXP_INF) {
+            e = (1 << 11) - 1;
+            m = 0;
+        } else if (b->expn == BF_EXP_ZERO) {
+            e = 0;
+            m = 0;
+        } else {
+            e = b->expn + 1023 - 1;
+#if LIMB_BITS == 32
+            if (b->len == 2) {
+                m = ((uint64_t)b->tab[1] << 32) | b->tab[0];
+            } else {
+                m = ((uint64_t)b->tab[0] << 32);
+            }
+#else
+            m = b->tab[0];
+#endif
+            if (e <= 0) {
+                /* subnormal */
+                m = m >> (12 - e);
+                e = 0;
+            } else {
+                m = (m << 1) >> 12;
+            }
+        }
+        u.u = m | ((uint64_t)e << 52) | ((uint64_t)b->sign << 63);
+        bf_delete(b);
+    }
+    *pres = u.d;
+    return ret;
+}
+
+void bf_set_float64(bf_t *a, double d)
+{
+    Float64Union u;
+    uint64_t m;
+    int shift, e, sgn;
+    
+    u.d = d;
+    sgn = u.u >> 63;
+    e = (u.u >> 52) & ((1 << 11) - 1);
+    m = u.u & (((uint64_t)1 << 52) - 1);
+    if (e == ((1 << 11) - 1)) {
+        if (m != 0) {
+            bf_set_nan(a);
+        } else {
+            bf_set_inf(a, sgn);
+        }
+    } else if (e == 0) {
+        if (m == 0) {
+            bf_set_zero(a, sgn);
+        } else {
+            /* subnormal number */
+            m <<= 12;
+            shift = clz64(m);
+            m <<= shift;
+            e = -shift;
+            goto norm;
+        }
+    } else {
+        m = (m << 11) | ((uint64_t)1 << 63);
+    norm:
+        a->expn = e - 1023 + 1;
+#if LIMB_BITS == 32
+        bf_resize(a, 2);
+        a->tab[0] = m;
+        a->tab[1] = m >> 32;
+#else
+        bf_resize(a, 1);
+        a->tab[0] = m;
+#endif
+        a->sign = sgn;
+    }
+}
+
+/* The rounding mode is always BF_RNDZ. Return BF_ST_OVERFLOW if there
+   is an overflow and 0 otherwise. */
+int bf_get_int32(int *pres, const bf_t *a, int flags)
+{
+    uint32_t v;
+    int ret;
+    if (a->expn >= BF_EXP_INF) {
+        ret = 0;
+        if (flags & BF_GET_INT_MOD) {
+            v = 0;
+        } else if (a->expn == BF_EXP_INF) {
+            v = (uint32_t)INT32_MAX + a->sign;
+        } else {
+            v = INT32_MAX;
+        }
+    } else if (a->expn <= 0) {
+        v = 0;
+        ret = 0;
+    } else if (a->expn <= 31) {
+        v = a->tab[a->len - 1] >> (LIMB_BITS - a->expn);
+        if (a->sign)
+            v = -v;
+        ret = 0;
+    } else if (!(flags & BF_GET_INT_MOD)) {
+        ret = BF_ST_OVERFLOW;
+        if (a->sign) {
+            v = (uint32_t)INT32_MAX + 1;
+            if (a->expn == 32 && 
+                (a->tab[a->len - 1] >> (LIMB_BITS - 32)) == v) {
+                ret = 0;
+            }
+        } else {
+            v = INT32_MAX;
+        }
+    } else {
+        v = get_bits(a->tab, a->len, a->len * LIMB_BITS - a->expn); 
+        if (a->sign)
+            v = -v;
+        ret = 0;
+    }
+    *pres = v;
+    return ret;
+}
+
+/* The rounding mode is always BF_RNDZ. Return BF_ST_OVERFLOW if there
+   is an overflow and 0 otherwise. */
+int bf_get_int64(int64_t *pres, const bf_t *a, int flags)
+{
+    uint64_t v;
+    int ret;
+    if (a->expn >= BF_EXP_INF) {
+        ret = 0;
+        if (flags & BF_GET_INT_MOD) {
+            v = 0;
+        } else if (a->expn == BF_EXP_INF) {
+            v = (uint64_t)INT64_MAX + a->sign;
+        } else {
+            v = INT64_MAX;
+        }
+    } else if (a->expn <= 0) {
+        v = 0;
+        ret = 0;
+    } else if (a->expn <= 63) {
+#if LIMB_BITS == 32
+        if (a->expn <= 32)
+            v = a->tab[a->len - 1] >> (LIMB_BITS - a->expn);
+        else
+            v = (((uint64_t)a->tab[a->len - 1] << 32) |
+                 get_limbz(a, a->len - 2)) >> (64 - a->expn);
+#else
+        v = a->tab[a->len - 1] >> (LIMB_BITS - a->expn);
+#endif
+        if (a->sign)
+            v = -v;
+        ret = 0;
+    } else if (!(flags & BF_GET_INT_MOD)) {
+        ret = BF_ST_OVERFLOW;
+        if (a->sign) {
+            uint64_t v1;
+            v = (uint64_t)INT64_MAX + 1;
+            if (a->expn == 64) {
+                v1 = a->tab[a->len - 1];
+#if LIMB_BITS == 32
+                v1 |= (v1 << 32) | get_limbz(a, a->len - 2);
+#endif
+                if (v1 == v)
+                    ret = 0;
+            }
+        } else {
+            v = INT64_MAX;
+        }
+    } else {
+        slimb_t bit_pos = a->len * LIMB_BITS - a->expn;
+        v = get_bits(a->tab, a->len, bit_pos); 
+#if LIMB_BITS == 32
+        v |= (uint64_t)get_bits(a->tab, a->len, bit_pos + 32) << 32;
+#endif
+        if (a->sign)
+            v = -v;
+        ret = 0;
+    }
+    *pres = v;
+    return ret;
+}
+
+/* base conversion from radix */
+
+static const uint8_t digits_per_limb_table[BF_RADIX_MAX - 1] = {
+#if LIMB_BITS == 32
+32,20,16,13,12,11,10,10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
+#else
+64,40,32,27,24,22,21,20,19,18,17,17,16,16,16,15,15,15,14,14,14,14,13,13,13,13,13,13,13,12,12,12,12,12,12,
+#endif
+};
+
+static limb_t get_limb_radix(int radix)
+{
+    int i, k;
+    limb_t radixl;
+    
+    k = digits_per_limb_table[radix - 2];
+    radixl = radix;
+    for(i = 1; i < k; i++)
+        radixl *= radix;
+    return radixl;
+}
+
+static void bf_integer_from_radix_rec(bf_t *r, const limb_t *tab,
+                                      limb_t n, int level, limb_t n0,
+                                      limb_t radix, bf_t *pow_tab)
+{
+    if (n == 1) {
+        bf_set_ui(r, tab[0]);
+    } else {
+        bf_t T_s, *T = &T_s, *B;
+        limb_t n1, n2;
+        
+        n2 = (((n0 * 2) >> (level + 1)) + 1) / 2;
+        n1 = n - n2;
+        //        printf("level=%d n0=%ld n1=%ld n2=%ld\n", level, n0, n1, n2);
+        B = &pow_tab[level];
+        if (B->len == 0) {
+            bf_pow_ui_ui(B, radix, n2, BF_PREC_INF, BF_RNDZ);
+        }
+        bf_integer_from_radix_rec(r, tab + n2, n1, level + 1, n0,
+                                  radix, pow_tab);
+        bf_mul(r, r, B, BF_PREC_INF, BF_RNDZ);
+        bf_init(r->ctx, T);
+        bf_integer_from_radix_rec(T, tab, n2, level + 1, n0,
+                                  radix, pow_tab);
+        bf_add(r, r, T, BF_PREC_INF, BF_RNDZ);
+        bf_delete(T);
+    }
+    //    bf_print_str("  r=", r);
+}
+
+static void bf_integer_from_radix(bf_t *r, const limb_t *tab,
+                                 limb_t n, limb_t radix)
+{
+    bf_context_t *s = r->ctx;
+    int pow_tab_len, i;
+    limb_t radixl;
+    bf_t *pow_tab;
+    
+    radixl = get_limb_radix(radix);
+    pow_tab_len = ceil_log2(n) + 2; /* XXX: check */
+    pow_tab = bf_malloc(s, sizeof(pow_tab[0]) * pow_tab_len);
+    for(i = 0; i < pow_tab_len; i++)
+        bf_init(r->ctx, &pow_tab[i]);
+    bf_integer_from_radix_rec(r, tab, n, 0, n, radixl, pow_tab);
+    for(i = 0; i < pow_tab_len; i++) {
+        bf_delete(&pow_tab[i]);
+    }
+    bf_free(s, pow_tab);
+}
+
+/* compute and round T * radix^expn. */
+int bf_mul_pow_radix(bf_t *r, const bf_t *T, limb_t radix,
+                     slimb_t expn, limb_t prec, bf_flags_t flags)
+{
+    int ret, expn_sign, overflow;
+    slimb_t e, extra_bits, prec1, ziv_extra_bits;
+    bf_t B_s, *B = &B_s;
+
+    if (T->len == 0) {
+        bf_set(r, T);
+        return 0;
+    } else if (expn == 0) {
+        bf_set(r, T);
+        return bf_round(r, prec, flags);
+    }
+
+    e = expn;
+    expn_sign = 0;
+    if (e < 0) {
+        e = -e;
+        expn_sign = 1;
+    }
+    bf_init(r->ctx, B);
+    if (prec == BF_PREC_INF) {
+        /* infinite precision: only used if the result is known to be exact */
+        bf_pow_ui_ui(B, radix, e, BF_PREC_INF, BF_RNDN);
+        if (expn_sign) {
+            ret = bf_div(r, T, B, T->len * LIMB_BITS, BF_RNDN);
+        } else {
+            ret = bf_mul(r, T, B, BF_PREC_INF, BF_RNDN);
+        }
+    } else {
+        ziv_extra_bits = 16;
+        for(;;) {
+            prec1 = prec + ziv_extra_bits;
+            /* XXX: correct overflow/underflow handling */
+            /* XXX: rigorous error analysis needed */
+            extra_bits = ceil_log2(e) * 2 + 1;
+            ret = bf_pow_ui_ui(B, radix, e, prec1 + extra_bits, BF_RNDN);
+            overflow = !bf_is_finite(B);
+            /* XXX: if bf_pow_ui_ui returns an exact result, can stop
+               after the next operation */
+            if (expn_sign)
+                ret |= bf_div(r, T, B, prec1 + extra_bits, BF_RNDN);
+            else
+                ret |= bf_mul(r, T, B, prec1 + extra_bits, BF_RNDN);
+            if ((ret & BF_ST_INEXACT) &&
+                !bf_can_round(r, prec, flags & BF_RND_MASK, prec1) &&
+                !overflow) {
+                /* and more precision and retry */
+                ziv_extra_bits = ziv_extra_bits  + (ziv_extra_bits / 2);
+            } else {
+                ret = bf_round(r, prec, flags) | (ret & BF_ST_INEXACT);
+                break;
+            }
+        }
+    }
+    bf_delete(B);
+    return ret;
+}
+
+static inline int to_digit(int c)
+{
+    if (c >= '0' && c <= '9')
+        return c - '0';
+    else if (c >= 'A' && c <= 'Z')
+        return c - 'A' + 10;
+    else if (c >= 'a' && c <= 'z')
+        return c - 'a' + 10;
+    else
+        return 36;
+}
+
+/* add a limb at 'pos' and decrement pos. new space is created if needed */
+static void bf_add_limb(bf_t *a, slimb_t *ppos, limb_t v)
+{
+    slimb_t pos;
+    pos = *ppos;
+    if (unlikely(pos < 0)) {
+        limb_t new_size, d;
+        new_size = bf_max(a->len + 1, a->len * 3 / 2);
+        a->tab = bf_realloc(a->ctx, a->tab, sizeof(limb_t) * new_size);
+        d = new_size - a->len;
+        memmove(a->tab + d, a->tab, a->len * sizeof(limb_t));
+        a->len = new_size;
+        pos += d;
+    }
+    a->tab[pos--] = v;
+    *ppos = pos;
+}
+
+static int bf_tolower(int c)
+{
+    if (c >= 'A' && c <= 'Z')
+        c = c - 'A' + 'a';
+    return c;
+}
+
+static int strcasestart(const char *str, const char *val, const char **ptr)
+{
+    const char *p, *q;
+    p = str;
+    q = val;
+    while (*q != '\0') {
+        if (bf_tolower(*p) != *q)
+            return 0;
+        p++;
+        q++;
+    }
+    if (ptr)
+        *ptr = p;
+    return 1;
+}
+
+/* 
+   Return (status, n, exp). 'status' is the floating point status. 'n'
+   is the parsed number. 
+   If prec = BF_PREC_INF:
+      If the number is an integer or if the radix is a power of two,
+      *pexponent = 0. 
+      Otherwise, '*pexponent' is the exponent in radix 'radix'.
+   Otherwise
+      *pexponent = 0
+*/
+int bf_atof2(bf_t *r, slimb_t *pexponent,
+             const char *str, const char **pnext, int radix,
+             limb_t prec, bf_flags_t flags)
+{
+    const char *p, *p_start;
+    int is_neg, radix_bits, exp_is_neg, ret, digits_per_limb, shift, sep;
+    limb_t cur_limb;
+    slimb_t pos, expn, int_len, digit_count;
+    BOOL has_decpt, is_bin_exp, is_float;
+    bf_t a_s, *a;
+    
+    /* optional separator between digits */
+    sep = (flags & BF_ATOF_UNDERSCORE_SEP) ? '_' : 256;
+    
+    *pexponent = 0;
+    p = str;
+    if (!(flags & (BF_ATOF_INT_ONLY | BF_ATOF_JS_QUIRKS)) &&
+        radix <= 16 &&
+        strcasestart(p, "nan", &p)) {
+        bf_set_nan(r);
+        ret = 0;
+        goto done;
+    }
+    is_neg = 0;
+    
+    if (p[0] == '+') {
+        p++;
+        p_start = p;
+        if (flags & BF_ATOF_NO_PREFIX_AFTER_SIGN)
+            goto no_radix_prefix;
+    } else if (p[0] == '-') {
+        is_neg = 1;
+        p++;
+        p_start = p;
+        if (flags & BF_ATOF_NO_PREFIX_AFTER_SIGN)
+            goto no_radix_prefix;
+    } else {
+        p_start = p;
+    }
+    if (p[0] == '0') {
+        if ((p[1] == 'x' || p[1] == 'X') &&
+            (radix == 0 || radix == 16) &&
+            !(flags & BF_ATOF_NO_HEX)) {
+            radix = 16;
+            p += 2;
+        } else if ((p[1] == 'o' || p[1] == 'O') &&
+                   radix == 0 && (flags & BF_ATOF_BIN_OCT)) {
+            p += 2;
+            radix = 8;
+        } else if ((p[1] == 'b' || p[1] == 'B') &&
+                   radix == 0 && (flags & BF_ATOF_BIN_OCT)) {
+            p += 2;
+            radix = 2;
+        } else if ((p[1] >= '0' && p[1] <= '7') &&
+                   radix == 0 && (flags & BF_ATOF_LEGACY_OCTAL)) {
+            int i;
+            /* the separator is not allowed in legacy octal literals */
+            for (i = 2; (p[i] >= '0' && p[i] <= '7'); i++)
+                continue;
+            if (p[i] == '8' || p[i] == '9')
+                goto no_prefix;
+            p += 1;
+            radix = 8;
+        } else {
+            /* 0 cannot be followed by a separator */
+            if (p[1] == sep) {
+                p++;
+                bf_set_zero(r, 0);
+                ret = 0;
+                if (flags & BF_ATOF_INT_PREC_INF)
+                    ret |= BF_ATOF_ST_INTEGER;
+                goto done;
+            }
+            goto no_prefix;
+        }
+        /* there must be a digit after the prefix */
+        if (to_digit((uint8_t)*p) >= radix) {
+            bf_set_nan(r);
+            ret = 0;
+            goto done;
+        }
+    no_prefix: ;
+    } else {
+    no_radix_prefix:
+        if (!(flags & BF_ATOF_INT_ONLY) && radix <= 16 &&
+            ((!(flags & BF_ATOF_JS_QUIRKS) && strcasestart(p, "inf", &p)) ||
+             ((flags & BF_ATOF_JS_QUIRKS) && strstart(p, "Infinity", &p)))) {
+            bf_set_inf(r, is_neg);
+            ret = 0;
+            goto done;
+        }
+    }
+    
+    if (radix == 0)
+        radix = 10;
+    if ((radix & (radix - 1)) != 0) {
+        radix_bits = 0; /* base is not a power of two */
+        a = &a_s;
+        bf_init(r->ctx, a);
+    } else {
+        radix_bits = ceil_log2(radix);
+        a = r;
+    }
+
+    /* skip leading zeros */
+    /* XXX: could also skip zeros after the decimal point */
+    while (*p == '0' || (*p == sep && to_digit(p[1]) < radix))
+        p++;
+
+    if (radix_bits) {
+        shift = digits_per_limb = LIMB_BITS;
+    } else {
+        radix_bits = 0;
+        shift = digits_per_limb = digits_per_limb_table[radix - 2];
+    }
+    cur_limb = 0;
+    bf_resize(a, 1);
+    pos = 0;
+    has_decpt = FALSE;
+    int_len = digit_count = 0;
+    is_float = FALSE;
+    for(;;) {
+        limb_t c;
+        if (*p == '.' && (p > p_start || to_digit(p[1]) < radix)) {
+            if ((flags & BF_ATOF_INT_ONLY) ||
+                (radix != 10 && (flags & BF_ATOF_ONLY_DEC_FLOAT)))
+                break;
+            if (has_decpt)
+                break;
+            is_float = TRUE;
+            has_decpt = TRUE;
+            int_len = digit_count;
+            p++;
+        }
+        if (*p == sep && to_digit(p[1]) < radix)
+            p++;
+        c = to_digit(*p);
+        if (c >= radix)
+            break;
+        digit_count++;
+        p++;
+        if (radix_bits) {
+            shift -= radix_bits;
+            if (shift <= 0) {
+                cur_limb |= c >> (-shift);
+                bf_add_limb(a, &pos, cur_limb);
+                if (shift < 0)
+                    cur_limb = c << (LIMB_BITS + shift);
+                else
+                    cur_limb = 0;
+                shift += LIMB_BITS;
+            } else {
+                cur_limb |= c << shift;
+            }
+        } else {
+            cur_limb = cur_limb * radix + c;
+            shift--;
+            if (shift == 0) {
+                bf_add_limb(a, &pos, cur_limb);
+                shift = digits_per_limb;
+                cur_limb = 0;
+            }
+        }
+    }
+    if (!has_decpt)
+        int_len = digit_count;
+
+    /* add the last limb and pad with zeros */
+    if (shift != digits_per_limb) {
+        if (radix_bits == 0) {
+            while (shift != 0) {
+                cur_limb *= radix;
+                shift--;
+            }
+        }
+        bf_add_limb(a, &pos, cur_limb);
+    }
+            
+    /* reset the next limbs to zero (we prefer to reallocate in the
+       renormalization) */
+    memset(a->tab, 0, (pos + 1) * sizeof(limb_t));
+
+    if (p == p_start)
+        goto error;
+
+    /* parse the exponent, if any */
+    expn = 0;
+    is_bin_exp = FALSE;
+    if (!(flags & BF_ATOF_INT_ONLY) && 
+        !(radix != 10 && (flags & BF_ATOF_ONLY_DEC_FLOAT)) &&
+        ((radix == 10 && (*p == 'e' || *p == 'E')) ||
+         (radix != 10 && (*p == '@' ||
+                          (radix_bits && (*p == 'p' || *p == 'P'))))) &&
+        p > p_start) {
+        is_bin_exp = (*p == 'p' || *p == 'P');
+        p++;
+        is_float = TRUE;
+        exp_is_neg = 0;
+        if (*p == '+') {
+            p++;
+        } else if (*p == '-') {
+            exp_is_neg = 1;
+            p++;
+        }
+        for(;;) {
+            int c;
+            if (*p == sep && to_digit(p[1]) < 10)
+                p++;
+            c = to_digit(*p);
+            if (c >= 10)
+                break;
+            if (unlikely(expn > ((EXP_MAX - 2 - 9) / 10))) {
+                /* exponent overflow */
+                if (exp_is_neg) {
+                    bf_set_zero(r, is_neg);
+                    ret = BF_ST_UNDERFLOW | BF_ST_INEXACT;
+                } else {
+                    bf_set_inf(r, is_neg);
+                    ret = BF_ST_OVERFLOW | BF_ST_INEXACT;
+                }
+                goto done;
+            }
+            p++;
+            expn = expn * 10 + c;
+        }
+        if (exp_is_neg)
+            expn = -expn;
+    } else if (!is_float) {
+        if (*p == 'n' && (flags & BF_ATOF_INT_N_SUFFIX)) {
+            p++;
+            prec = BF_PREC_INF;
+        } else if (flags & BF_ATOF_INT_PREC_INF) {
+            prec = BF_PREC_INF;
+        } else {
+            is_float = TRUE;
+        }
+    }
+    if (radix_bits) {
+        /* XXX: may overflow */
+        if (!is_bin_exp)
+            expn *= radix_bits; 
+        a->expn = expn + (int_len * radix_bits);
+        a->sign = is_neg;
+        ret = bf_normalize_and_round(a, prec, flags);
+    } else {
+        limb_t l;
+        pos++;
+        l = a->len - pos; /* number of limbs */
+        if (l == 0) {
+            bf_set_zero(r, is_neg);
+            ret = 0;
+        } else {
+            bf_t T_s, *T = &T_s;
+
+            expn -= l * digits_per_limb - int_len;
+            bf_init(r->ctx, T);
+            bf_integer_from_radix(T, a->tab + pos, l, radix);
+            T->sign = is_neg;
+            if (prec == BF_PREC_INF && is_float) {
+                /* return the exponent */
+                *pexponent = expn;
+                bf_set(r, T);
+                ret = 0;
+            } else {
+                ret = bf_mul_pow_radix(r, T, radix, expn, prec, flags);
+            }
+            bf_delete(T);
+        }
+        bf_delete(a);
+    }
+    if (!is_float)
+        ret |= BF_ATOF_ST_INTEGER;
+ done:
+    if (pnext)
+        *pnext = p;
+    return ret;
+ error:
+    if (!radix_bits)
+        bf_delete(a);
+    ret = 0;
+    if (flags & BF_ATOF_NAN_IF_EMPTY)  {
+        bf_set_nan(r);
+    } else {
+        bf_set_zero(r, 0);
+        if (flags & BF_ATOF_INT_PREC_INF)
+            ret |= BF_ATOF_ST_INTEGER;
+    }
+    goto done;
+}
+
+int bf_atof(bf_t *r, const char *str, const char **pnext, int radix,
+            limb_t prec, bf_flags_t flags)
+{
+    slimb_t dummy_exp;
+    return bf_atof2(r, &dummy_exp, str, pnext, radix, prec, flags);
+}
+
+/* base conversion to radix */
+
+#if LIMB_BITS == 64
+#define RADIXL_10 UINT64_C(10000000000000000000)
+#else
+#define RADIXL_10 UINT64_C(1000000000)
+#endif
+
+static const uint32_t inv_log2_radix[BF_RADIX_MAX - 1][LIMB_BITS / 2 + 1] = {
+#if LIMB_BITS == 32
+{ 0x80000000, 0x00000000,},
+{ 0x50c24e60, 0xd4d4f4a7,},
+{ 0x40000000, 0x00000000,},
+{ 0x372068d2, 0x0a1ee5ca,},
+{ 0x3184648d, 0xb8153e7a,},
+{ 0x2d983275, 0x9d5369c4,},
+{ 0x2aaaaaaa, 0xaaaaaaab,},
+{ 0x28612730, 0x6a6a7a54,},
+{ 0x268826a1, 0x3ef3fde6,},
+{ 0x25001383, 0xbac8a744,},
+{ 0x23b46706, 0x82c0c709,},
+{ 0x229729f1, 0xb2c83ded,},
+{ 0x219e7ffd, 0xa5ad572b,},
+{ 0x20c33b88, 0xda7c29ab,},
+{ 0x20000000, 0x00000000,},
+{ 0x1f50b57e, 0xac5884b3,},
+{ 0x1eb22cc6, 0x8aa6e26f,},
+{ 0x1e21e118, 0x0c5daab2,},
+{ 0x1d9dcd21, 0x439834e4,},
+{ 0x1d244c78, 0x367a0d65,},
+{ 0x1cb40589, 0xac173e0c,},
+{ 0x1c4bd95b, 0xa8d72b0d,},
+{ 0x1bead768, 0x98f8ce4c,},
+{ 0x1b903469, 0x050f72e5,},
+{ 0x1b3b433f, 0x2eb06f15,},
+{ 0x1aeb6f75, 0x9c46fc38,},
+{ 0x1aa038eb, 0x0e3bfd17,},
+{ 0x1a593062, 0xb38d8c56,},
+{ 0x1a15f4c3, 0x2b95a2e6,},
+{ 0x19d630dc, 0xcc7ddef9,},
+{ 0x19999999, 0x9999999a,},
+{ 0x195fec80, 0x8a609431,},
+{ 0x1928ee7b, 0x0b4f22f9,},
+{ 0x18f46acf, 0x8c06e318,},
+{ 0x18c23246, 0xdc0a9f3d,},
+#else
+{ 0x80000000, 0x00000000, 0x00000000,},
+{ 0x50c24e60, 0xd4d4f4a7, 0x021f57bc,},
+{ 0x40000000, 0x00000000, 0x00000000,},
+{ 0x372068d2, 0x0a1ee5ca, 0x19ea911b,},
+{ 0x3184648d, 0xb8153e7a, 0x7fc2d2e1,},
+{ 0x2d983275, 0x9d5369c4, 0x4dec1661,},
+{ 0x2aaaaaaa, 0xaaaaaaaa, 0xaaaaaaab,},
+{ 0x28612730, 0x6a6a7a53, 0x810fabde,},
+{ 0x268826a1, 0x3ef3fde6, 0x23e2566b,},
+{ 0x25001383, 0xbac8a744, 0x385a3349,},
+{ 0x23b46706, 0x82c0c709, 0x3f891718,},
+{ 0x229729f1, 0xb2c83ded, 0x15fba800,},
+{ 0x219e7ffd, 0xa5ad572a, 0xe169744b,},
+{ 0x20c33b88, 0xda7c29aa, 0x9bddee52,},
+{ 0x20000000, 0x00000000, 0x00000000,},
+{ 0x1f50b57e, 0xac5884b3, 0x70e28eee,},
+{ 0x1eb22cc6, 0x8aa6e26f, 0x06d1a2a2,},
+{ 0x1e21e118, 0x0c5daab1, 0x81b4f4bf,},
+{ 0x1d9dcd21, 0x439834e3, 0x81667575,},
+{ 0x1d244c78, 0x367a0d64, 0xc8204d6d,},
+{ 0x1cb40589, 0xac173e0c, 0x3b7b16ba,},
+{ 0x1c4bd95b, 0xa8d72b0d, 0x5879f25a,},
+{ 0x1bead768, 0x98f8ce4c, 0x66cc2858,},
+{ 0x1b903469, 0x050f72e5, 0x0cf5488e,},
+{ 0x1b3b433f, 0x2eb06f14, 0x8c89719c,},
+{ 0x1aeb6f75, 0x9c46fc37, 0xab5fc7e9,},
+{ 0x1aa038eb, 0x0e3bfd17, 0x1bd62080,},
+{ 0x1a593062, 0xb38d8c56, 0x7998ab45,},
+{ 0x1a15f4c3, 0x2b95a2e6, 0x46aed6a0,},
+{ 0x19d630dc, 0xcc7ddef9, 0x5aadd61b,},
+{ 0x19999999, 0x99999999, 0x9999999a,},
+{ 0x195fec80, 0x8a609430, 0xe1106014,},
+{ 0x1928ee7b, 0x0b4f22f9, 0x5f69791d,},
+{ 0x18f46acf, 0x8c06e318, 0x4d2aeb2c,},
+{ 0x18c23246, 0xdc0a9f3d, 0x3fe16970,},
+#endif
+};
+
+static const limb_t log2_radix[BF_RADIX_MAX - 1] = {
+#if LIMB_BITS == 32
+0x20000000,
+0x32b80347,
+0x40000000,
+0x4a4d3c26,
+0x52b80347,
+0x59d5d9fd,
+0x60000000,
+0x6570068e,
+0x6a4d3c26,
+0x6eb3a9f0,
+0x72b80347,
+0x766a008e,
+0x79d5d9fd,
+0x7d053f6d,
+0x80000000,
+0x82cc7edf,
+0x8570068e,
+0x87ef05ae,
+0x8a4d3c26,
+0x8c8ddd45,
+0x8eb3a9f0,
+0x90c10501,
+0x92b80347,
+0x949a784c,
+0x966a008e,
+0x982809d6,
+0x99d5d9fd,
+0x9b74948f,
+0x9d053f6d,
+0x9e88c6b3,
+0xa0000000,
+0xa16bad37,
+0xa2cc7edf,
+0xa4231623,
+0xa570068e,
+#else
+0x2000000000000000,
+0x32b803473f7ad0f4,
+0x4000000000000000,
+0x4a4d3c25e68dc57f,
+0x52b803473f7ad0f4,
+0x59d5d9fd5010b366,
+0x6000000000000000,
+0x6570068e7ef5a1e8,
+0x6a4d3c25e68dc57f,
+0x6eb3a9f01975077f,
+0x72b803473f7ad0f4,
+0x766a008e4788cbcd,
+0x79d5d9fd5010b366,
+0x7d053f6d26089673,
+0x8000000000000000,
+0x82cc7edf592262d0,
+0x8570068e7ef5a1e8,
+0x87ef05ae409a0289,
+0x8a4d3c25e68dc57f,
+0x8c8ddd448f8b845a,
+0x8eb3a9f01975077f,
+0x90c10500d63aa659,
+0x92b803473f7ad0f4,
+0x949a784bcd1b8afe,
+0x966a008e4788cbcd,
+0x982809d5be7072dc,
+0x99d5d9fd5010b366,
+0x9b74948f5532da4b,
+0x9d053f6d26089673,
+0x9e88c6b3626a72aa,
+0xa000000000000000,
+0xa16bad3758efd873,
+0xa2cc7edf592262d0,
+0xa4231623369e78e6,
+0xa570068e7ef5a1e8,
+#endif
+};
+
+/* compute floor(a*b) or ceil(a*b) with b = log2(radix) or
+   b=1/log2(radix). For is_inv = 0, strict accuracy is not guaranteed
+   when radix is not a power of two. */
+slimb_t bf_mul_log2_radix(slimb_t a1, unsigned int radix, int is_inv,
+                          int is_ceil1)
+{
+    int is_neg;
+    limb_t a;
+    BOOL is_ceil;
+
+    is_ceil = is_ceil1;
+    a = a1;
+    if (a1 < 0) {
+        a = -a;
+        is_neg = 1;
+    } else {
+        is_neg = 0;
+    }
+    is_ceil ^= is_neg;
+    if ((radix & (radix - 1)) == 0) {
+        int radix_bits;
+        /* radix is a power of two */
+        radix_bits = ceil_log2(radix);
+        if (is_inv) {
+            if (is_ceil)
+                a += radix_bits - 1;
+            a = a / radix_bits;
+        } else {
+            a = a * radix_bits;
+        }
+    } else {
+        const uint32_t *tab;
+        limb_t b0, b1;
+        dlimb_t t;
+        
+        if (is_inv) {
+            tab = inv_log2_radix[radix - 2];
+#if LIMB_BITS == 32
+            b1 = tab[0];
+            b0 = tab[1];
+#else
+            b1 = ((limb_t)tab[0] << 32) | tab[1];
+            b0 = (limb_t)tab[2] << 32;
+#endif
+            t = (dlimb_t)b0 * (dlimb_t)a;
+            t = (dlimb_t)b1 * (dlimb_t)a + (t >> LIMB_BITS);
+            a = t >> (LIMB_BITS - 1);
+        } else {
+            b0 = log2_radix[radix - 2];
+            t = (dlimb_t)b0 * (dlimb_t)a;
+            a = t >> (LIMB_BITS - 3);
+        }
+        /* a = floor(result) and 'result' cannot be an integer */
+        a += is_ceil;
+    }
+    if (is_neg)
+        a = -a;
+    return a;
+}
+
+/* 'n' is the number of output limbs */
+static void bf_integer_to_radix_rec(bf_t *pow_tab,
+                                    limb_t *out, const bf_t *a, limb_t n,
+                                    int level, limb_t n0, limb_t radixl,
+                                    unsigned int radixl_bits)
+{
+    limb_t n1, n2, q_prec;
+    assert(n >= 1);
+    if (n == 1) {
+        out[0] = get_bits(a->tab, a->len, a->len * LIMB_BITS - a->expn);
+    } else if (n == 2) {
+        dlimb_t t;
+        slimb_t pos;
+        pos = a->len * LIMB_BITS - a->expn;
+        t = ((dlimb_t)get_bits(a->tab, a->len, pos + LIMB_BITS) << LIMB_BITS) |
+            get_bits(a->tab, a->len, pos);
+        if (likely(radixl == RADIXL_10)) {
+            /* use division by a constant when possible */
+            out[0] = t % RADIXL_10;
+            out[1] = t / RADIXL_10;
+        } else {
+            out[0] = t % radixl;
+            out[1] = t / radixl;
+        }
+    } else {
+        bf_t Q, R, *B, *B_inv;
+        int q_add;
+        bf_init(a->ctx, &Q);
+        bf_init(a->ctx, &R);
+        n2 = (((n0 * 2) >> (level + 1)) + 1) / 2;
+        n1 = n - n2;
+        B = &pow_tab[2 * level];
+        B_inv = &pow_tab[2 * level + 1];
+        if (B->len == 0) {
+            /* compute BASE^n2 */
+            bf_pow_ui_ui(B, radixl, n2, BF_PREC_INF, BF_RNDZ);
+            /* we use enough bits for the maximum possible 'n1' value,
+               i.e. n2 + 1 */
+            bf_recip(B_inv, B, (n2 + 1) * radixl_bits + 2);
+        }
+        //        printf("%d: n1=% " PRId64 " n2=%" PRId64 "\n", level, n1, n2);
+        q_prec = n1 * radixl_bits;
+        bf_mul(&Q, a, B_inv, q_prec, BF_RNDN);
+        bf_rint(&Q, BF_PREC_INF, BF_RNDZ);
+        
+        bf_mul(&R, &Q, B, BF_PREC_INF, BF_RNDZ);
+        bf_sub(&R, a, &R, BF_PREC_INF, BF_RNDZ);
+        /* adjust if necessary */
+        q_add = 0;
+        while (R.sign && R.len != 0) {
+            bf_add(&R, &R, B, BF_PREC_INF, BF_RNDZ);
+            q_add--;
+        }
+        while (bf_cmpu(&R, B) >= 0) {
+            bf_sub(&R, &R, B, BF_PREC_INF, BF_RNDZ);
+            q_add++;
+        }
+        if (q_add != 0) {
+            bf_add_si(&Q, &Q, q_add, BF_PREC_INF, BF_RNDZ);
+        }
+        bf_integer_to_radix_rec(pow_tab, out + n2, &Q, n1, level + 1, n0,
+                                radixl, radixl_bits);
+        bf_integer_to_radix_rec(pow_tab, out, &R, n2, level + 1, n0,
+                                radixl, radixl_bits);
+        bf_delete(&Q);
+        bf_delete(&R);
+    }
+}
+
+static void bf_integer_to_radix(bf_t *r, const bf_t *a, limb_t radixl)
+{
+    bf_context_t *s = r->ctx;
+    limb_t r_len;
+    bf_t *pow_tab;
+    int i, pow_tab_len;
+    
+    r_len = r->len;
+    pow_tab_len = (ceil_log2(r_len) + 2) * 2; /* XXX: check */
+    pow_tab = bf_malloc(s, sizeof(pow_tab[0]) * pow_tab_len);
+    for(i = 0; i < pow_tab_len; i++)
+        bf_init(r->ctx, &pow_tab[i]);
+
+    bf_integer_to_radix_rec(pow_tab, r->tab, a, r_len, 0, r_len, radixl,
+                            ceil_log2(radixl));
+
+    for(i = 0; i < pow_tab_len; i++) {
+        bf_delete(&pow_tab[i]);
+    }
+    bf_free(s, pow_tab);
+}
+
+/* a must be >= 0. 'P' is the wanted number of digits in radix
+   'radix'. 'r' is the mantissa represented as an integer. *pE
+   contains the exponent. */
+static void bf_convert_to_radix(bf_t *r, slimb_t *pE,
+                                const bf_t *a, int radix,
+                                limb_t P, bf_rnd_t rnd_mode,
+                                BOOL is_fixed_exponent)
+{
+    slimb_t E, e, prec, extra_bits, ziv_extra_bits, prec0;
+    bf_t B_s, *B = &B_s;
+    int e_sign, ret, res;
+    
+    if (a->len == 0) {
+        /* zero case */
+        *pE = 0;
+        bf_set(r, a);
+        return;
+    }
+
+    if (is_fixed_exponent) {
+        E = *pE;
+    } else {
+        /* compute the new exponent */
+        E = 1 + bf_mul_log2_radix(a->expn - 1, radix, TRUE, FALSE);
+    }
+    //    bf_print_str("a", a);
+    //    printf("E=%ld P=%ld radix=%d\n", E, P, radix);
+    
+    for(;;) {
+        e = P - E;
+        e_sign = 0;
+        if (e < 0) {
+            e = -e;
+            e_sign = 1;
+        }
+        /* Note: precision for log2(radix) is not critical here */
+        prec0 = bf_mul_log2_radix(P, radix, FALSE, TRUE);
+        ziv_extra_bits = 16;
+        for(;;) {
+            prec = prec0 + ziv_extra_bits;
+            /* XXX: rigorous error analysis needed */
+            extra_bits = ceil_log2(e) * 2 + 1;
+            ret = bf_pow_ui_ui(r, radix, e, prec + extra_bits, BF_RNDN);
+            if (!e_sign)
+                ret |= bf_mul(r, r, a, prec + extra_bits, BF_RNDN);
+            else
+                ret |= bf_div(r, a, r, prec + extra_bits, BF_RNDN);
+            /* if the result is not exact, check that it can be safely
+               rounded to an integer */
+            if ((ret & BF_ST_INEXACT) &&
+                !bf_can_round(r, r->expn, rnd_mode, prec)) {
+                /* and more precision and retry */
+                ziv_extra_bits = ziv_extra_bits  + (ziv_extra_bits / 2);
+                continue;
+            } else {
+                bf_rint(r, BF_PREC_INF, rnd_mode);
+                break;
+            }
+        }
+        if (is_fixed_exponent)
+            break;
+        /* check that the result is < B^P */
+        /* XXX: do an fast approximate test first ? */
+        bf_init(r->ctx, B);
+        bf_pow_ui_ui(B, radix, P, BF_PREC_INF, BF_RNDZ);
+        res = bf_cmpu(r, B);
+        bf_delete(B);
+        if (res < 0)
+            break;
+        /* try a larger exponent */
+        E++;
+    }
+    *pE = E;
+}
+
+static void limb_to_a(char *buf, limb_t n, unsigned int radix, int len)
+{
+    int digit, i;
+
+    if (radix == 10) {
+        /* specific case with constant divisor */
+        for(i = len - 1; i >= 0; i--) {
+            digit = (limb_t)n % 10;
+            n = (limb_t)n / 10;
+            buf[i] = digit + '0';
+        }
+    } else {
+        for(i = len - 1; i >= 0; i--) {
+            digit = (limb_t)n % radix;
+            n = (limb_t)n / radix;
+            if (digit < 10)
+                digit += '0';
+            else
+                digit += 'a' - 10;
+            buf[i] = digit;
+        }
+    }
+}
+
+/* for power of 2 radixes */
+static void limb_to_a2(char *buf, limb_t n, unsigned int radix_bits, int len)
+{
+    int digit, i;
+    unsigned int mask;
+
+    mask = (1 << radix_bits) - 1;
+    for(i = len - 1; i >= 0; i--) {
+        digit = n & mask;
+        n >>= radix_bits;
+        if (digit < 10)
+            digit += '0';
+        else
+            digit += 'a' - 10;
+        buf[i] = digit;
+    }
+}
+
+/* 'a' must be an integer. A dot is added before the 'dot_pos'
+   digit. dot_pos = n_digits does not display the dot. 0 <= dot_pos <=
+   n_digits. n_digits >= 1. */
+static void output_digits(DynBuf *s, const bf_t *a1, int radix, limb_t n_digits,
+                          limb_t dot_pos)
+{
+    limb_t i, v, l;
+    slimb_t pos, pos_incr;
+    int digits_per_limb, buf_pos, radix_bits, first_buf_pos;
+    char buf[65];
+    bf_t a_s, *a;
+    
+    if ((radix & (radix - 1)) != 0) {
+        limb_t n, radixl;
+
+        digits_per_limb = digits_per_limb_table[radix - 2];
+        radixl = get_limb_radix(radix);
+        a = &a_s;
+        bf_init(a1->ctx, a);
+        n = (n_digits + digits_per_limb - 1) / digits_per_limb;
+        bf_resize(a, n);
+        bf_integer_to_radix(a, a1, radixl);
+        radix_bits = 0;
+        pos = n;
+        pos_incr = 1;
+        first_buf_pos = pos * digits_per_limb - n_digits;
+    } else {
+        a = (bf_t *)a1;
+        radix_bits = ceil_log2(radix);
+        digits_per_limb = LIMB_BITS / radix_bits;
+        pos_incr = digits_per_limb * radix_bits;
+        pos = a->len * LIMB_BITS - a->expn + n_digits * radix_bits;
+        first_buf_pos = 0;
+    }
+    buf_pos = digits_per_limb;
+    i = 0;
+    while (i < n_digits) {
+        if (buf_pos == digits_per_limb) {
+            pos -= pos_incr;
+            if (radix_bits == 0) {
+                v = get_limbz(a, pos);
+                limb_to_a(buf, v, radix, digits_per_limb);
+            } else {
+                v = get_bits(a->tab, a->len, pos);
+                limb_to_a2(buf, v, radix_bits, digits_per_limb);
+            }
+            buf_pos = first_buf_pos;
+            first_buf_pos = 0;
+        }
+        if (i < dot_pos) {
+            l = dot_pos;
+        } else {
+            if (i == dot_pos)
+                dbuf_putc(s, '.');
+            l = n_digits;
+        }
+        l = bf_min(digits_per_limb - buf_pos, l - i);
+        dbuf_put(s, (uint8_t *)(buf + buf_pos), l);
+        buf_pos += l;
+        i += l;
+    }
+    if (a != a1)
+        bf_delete(a);
+}
+
+static void *bf_dbuf_realloc(void *opaque, void *ptr, size_t size)
+{
+    bf_context_t *s = opaque;
+    return bf_realloc(s, ptr, size);
+}
+
+/* return the length in bytes. A trailing '\0' is added */
+size_t bf_ftoa(char **pbuf, const bf_t *a2, int radix, limb_t prec,
+               bf_flags_t flags)
+{
+    DynBuf s_s, *s = &s_s;
+    int radix_bits;
+    
+    //    bf_print_str("ftoa", a2);
+    //    printf("radix=%d\n", radix);
+    dbuf_init2(s, a2->ctx, bf_dbuf_realloc);
+    if (a2->expn == BF_EXP_NAN) {
+        dbuf_putstr(s, "NaN");
+    } else {
+        if (a2->sign)
+            dbuf_putc(s, '-');
+        if (a2->expn == BF_EXP_INF) {
+            if (flags & BF_FTOA_JS_QUIRKS)
+                dbuf_putstr(s, "Infinity");
+            else
+                dbuf_putstr(s, "Inf");
+        } else {
+            int fmt;
+            slimb_t n_digits, n, i, n_max, n1;
+            bf_t a1_s, *a1;
+            bf_t a_s, *a = &a_s;
+
+            /* make a positive number */
+            a->tab = a2->tab;
+            a->len = a2->len;
+            a->expn = a2->expn;
+            a->sign = 0;
+            
+            if ((radix & (radix - 1)) != 0)
+                radix_bits = 0;
+            else
+                radix_bits = ceil_log2(radix);
+
+            fmt = flags & BF_FTOA_FORMAT_MASK;
+            a1 = &a1_s;
+            bf_init(a2->ctx, a1);
+            if (fmt == BF_FTOA_FORMAT_FRAC) {
+                size_t pos, start;
+                /* one more digit for the rounding */
+                n = 1 + bf_mul_log2_radix(bf_max(a->expn, 0), radix, TRUE, TRUE);
+                n_digits = n + prec;
+                n1 = n;
+                bf_convert_to_radix(a1, &n1, a, radix, n_digits,
+                                    flags & BF_RND_MASK, TRUE);
+                start = s->size;
+                output_digits(s, a1, radix, n_digits, n);
+                /* remove leading zeros because we allocated one more digit */
+                pos = start;
+                while ((pos + 1) < s->size && s->buf[pos] == '0' &&
+                       s->buf[pos + 1] != '.')
+                    pos++;
+                if (pos > start) {
+                    memmove(s->buf + start, s->buf + pos, s->size - pos);
+                    s->size -= (pos - start);
+                }
+            } else {
+                if (fmt == BF_FTOA_FORMAT_FIXED) {
+                    n_digits = prec;
+                    n_max = n_digits;
+                } else {
+                    slimb_t n_digits_max, n_digits_min;
+                    
+                    if (prec == BF_PREC_INF) {
+                        assert(radix_bits != 0);
+                        /* XXX: could use the exact number of bits */
+                        prec = a->len * LIMB_BITS;
+                    }
+                    n_digits = 1 + bf_mul_log2_radix(prec, radix, TRUE, TRUE);
+                    /* max number of digits for non exponential
+                       notation. The rational is to have the same rule
+                       as JS i.e. n_max = 21 for 64 bit float in base 10. */
+                    n_max = n_digits + 4;
+                    if (fmt == BF_FTOA_FORMAT_FREE_MIN) {
+                        bf_t b_s, *b = &b_s;
+                        
+                        /* find the minimum number of digits by
+                           dichotomy. */
+                        n_digits_max = n_digits;
+                        n_digits_min = 1;
+                        bf_init(a2->ctx, b);
+                        while (n_digits_min < n_digits_max) {
+                            n_digits = (n_digits_min + n_digits_max) / 2;
+                            bf_convert_to_radix(a1, &n, a, radix, n_digits,
+                                                flags & BF_RND_MASK, FALSE);
+                            /* convert back to a number and compare */
+                            bf_mul_pow_radix(b, a1, radix, n - n_digits,
+                                             prec,
+                                             (flags & ~BF_RND_MASK) |
+                                             BF_RNDN);
+                            if (bf_cmpu(b, a) == 0) {
+                                n_digits_max = n_digits;
+                            } else {
+                                n_digits_min = n_digits + 1;
+                            }
+                        }
+                        bf_delete(b);
+                        n_digits = n_digits_max;
+                    }
+                }
+                bf_convert_to_radix(a1, &n, a, radix, n_digits,
+                                    flags & BF_RND_MASK, FALSE);
+                if (a1->expn == BF_EXP_ZERO &&
+                    fmt != BF_FTOA_FORMAT_FIXED &&
+                    !(flags & BF_FTOA_FORCE_EXP)) {
+                    /* just output zero */
+                    dbuf_putstr(s, "0");
+                } else {
+                    if (flags & BF_FTOA_ADD_PREFIX) {
+                        if (radix == 16)
+                            dbuf_putstr(s, "0x");
+                        else if (radix == 8)
+                            dbuf_putstr(s, "0o");
+                        else if (radix == 2)
+                            dbuf_putstr(s, "0b");
+                    }
+                    if (a1->expn == BF_EXP_ZERO)
+                        n = 1;
+                    if ((flags & BF_FTOA_FORCE_EXP) ||
+                        n <= -6 || n > n_max) {
+                        const char *fmt;
+                        /* exponential notation */
+                        output_digits(s, a1, radix, n_digits, 1);
+                        if (radix_bits != 0 && radix <= 16) {
+                            if (flags & BF_FTOA_JS_QUIRKS)
+                                fmt = "p%+" PRId_LIMB;
+                            else
+                                fmt = "p%" PRId_LIMB;
+                            dbuf_printf(s, fmt, (n - 1) * radix_bits);
+                        } else {
+                            if (flags & BF_FTOA_JS_QUIRKS)
+                                fmt = "%c%+" PRId_LIMB;
+                            else
+                                fmt = "%c%" PRId_LIMB;
+                            dbuf_printf(s, fmt,
+                                        radix <= 10 ? 'e' : '@', n - 1);
+                        }
+                    } else if (n <= 0) {
+                        /* 0.x */
+                        dbuf_putstr(s, "0.");
+                        for(i = 0; i < -n; i++) {
+                            dbuf_putc(s, '0');
+                        }
+                        output_digits(s, a1, radix, n_digits, n_digits);
+                    } else {
+                        if (n_digits <= n) {
+                            /* no dot */
+                            output_digits(s, a1, radix, n_digits, n_digits);
+                            for(i = 0; i < (n - n_digits); i++)
+                                dbuf_putc(s, '0');
+                        } else {
+                            output_digits(s, a1, radix, n_digits, n);
+                        }
+                    }
+                }
+            }
+            bf_delete(a1);
+        }
+    }
+    dbuf_putc(s, '\0');
+    *pbuf = (char *)s->buf;
+    return s->size - 1;
+}
+
+/***************************************************************/
+/* transcendental functions */
+
+/* Note: the algorithm is from MPFR */
+static void bf_const_log2_rec(bf_t *T, bf_t *P, bf_t *Q, limb_t n1,
+                              limb_t n2, BOOL need_P)
+{
+    bf_context_t *s = T->ctx;
+    if ((n2 - n1) == 1) {
+        if (n1 == 0) {
+            bf_set_ui(P, 3);
+        } else {
+            bf_set_ui(P, n1);
+            P->sign = 1;
+        }
+        bf_set_ui(Q, 2 * n1 + 1);
+        Q->expn += 2;
+        bf_set(T, P);
+    } else {
+        limb_t m;
+        bf_t T1_s, *T1 = &T1_s;
+        bf_t P1_s, *P1 = &P1_s;
+        bf_t Q1_s, *Q1 = &Q1_s;
+        
+        m = n1 + ((n2 - n1) >> 1);
+        bf_const_log2_rec(T, P, Q, n1, m, TRUE);
+        bf_init(s, T1);
+        bf_init(s, P1);
+        bf_init(s, Q1);
+        bf_const_log2_rec(T1, P1, Q1, m, n2, need_P);
+        bf_mul(T, T, Q1, BF_PREC_INF, BF_RNDZ);
+        bf_mul(T1, T1, P, BF_PREC_INF, BF_RNDZ);
+        bf_add(T, T, T1, BF_PREC_INF, BF_RNDZ);
+        if (need_P)
+            bf_mul(P, P, P1, BF_PREC_INF, BF_RNDZ);
+        bf_mul(Q, Q, Q1, BF_PREC_INF, BF_RNDZ);
+        bf_delete(T1);
+        bf_delete(P1);
+        bf_delete(Q1);
+    }
+}
+
+/* compute log(2) with faithful rounding at precision 'prec' */
+static void bf_const_log2_internal(bf_t *T, limb_t prec)
+{
+    limb_t w, N;
+    bf_t P_s, *P = &P_s;
+    bf_t Q_s, *Q = &Q_s;
+
+    w = prec + 15;
+    N = w / 3 + 1;
+    bf_init(T->ctx, P);
+    bf_init(T->ctx, Q);
+    bf_const_log2_rec(T, P, Q, 0, N, FALSE);
+    bf_div(T, T, Q, prec, BF_RNDN);
+    bf_delete(P);
+    bf_delete(Q);
+}
+
+/* PI constant */
+
+#define CHUD_A 13591409
+#define CHUD_B 545140134
+#define CHUD_C 640320
+#define CHUD_BITS_PER_TERM 47
+
+static void chud_bs(bf_t *P, bf_t *Q, bf_t *G, int64_t a, int64_t b, int need_g,
+                    limb_t prec)
+{
+    bf_context_t *s = P->ctx;
+    int64_t c;
+
+    if (a == (b - 1)) {
+        bf_t T0, T1;
+        
+        bf_init(s, &T0);
+        bf_init(s, &T1);
+        bf_set_ui(G, 2 * b - 1);
+        bf_mul_ui(G, G, 6 * b - 1, prec, BF_RNDN);
+        bf_mul_ui(G, G, 6 * b - 5, prec, BF_RNDN);
+        bf_set_ui(&T0, CHUD_B);
+        bf_mul_ui(&T0, &T0, b, prec, BF_RNDN);
+        bf_set_ui(&T1, CHUD_A);
+        bf_add(&T0, &T0, &T1, prec, BF_RNDN);
+        bf_mul(P, G, &T0, prec, BF_RNDN);
+        P->sign = b & 1;
+
+        bf_set_ui(Q, b);
+        bf_mul_ui(Q, Q, b, prec, BF_RNDN);
+        bf_mul_ui(Q, Q, b, prec, BF_RNDN);
+        bf_mul_ui(Q, Q, (uint64_t)CHUD_C * CHUD_C * CHUD_C / 24, prec, BF_RNDN);
+        bf_delete(&T0);
+        bf_delete(&T1);
+    } else {
+        bf_t P2, Q2, G2;
+        
+        bf_init(s, &P2);
+        bf_init(s, &Q2);
+        bf_init(s, &G2);
+
+        c = (a + b) / 2;
+        chud_bs(P, Q, G, a, c, 1, prec);
+        chud_bs(&P2, &Q2, &G2, c, b, need_g, prec);
+        
+        /* Q = Q1 * Q2 */
+        /* G = G1 * G2 */
+        /* P = P1 * Q2 + P2 * G1 */
+        bf_mul(&P2, &P2, G, prec, BF_RNDN);
+        if (!need_g)
+            bf_set_ui(G, 0);
+        bf_mul(P, P, &Q2, prec, BF_RNDN);
+        bf_add(P, P, &P2, prec, BF_RNDN);
+        bf_delete(&P2);
+
+        bf_mul(Q, Q, &Q2, prec, BF_RNDN);
+        bf_delete(&Q2);
+        if (need_g)
+            bf_mul(G, G, &G2, prec, BF_RNDN);
+        bf_delete(&G2);
+    }
+}
+
+/* compute Pi with faithful rounding at precision 'prec' using the
+   Chudnovsky formula */
+static void bf_const_pi_internal(bf_t *Q, limb_t prec)
+{
+    bf_context_t *s = Q->ctx;
+    int64_t n, prec1;
+    bf_t P, G;
+
+    /* number of serie terms */
+    n = prec / CHUD_BITS_PER_TERM + 1;
+    /* XXX: precision analysis */
+    prec1 = prec + 32;
+
+    bf_init(s, &P);
+    bf_init(s, &G);
+
+    chud_bs(&P, Q, &G, 0, n, 0, BF_PREC_INF);
+    
+    bf_mul_ui(&G, Q, CHUD_A, prec1, BF_RNDN);
+    bf_add(&P, &G, &P, prec1, BF_RNDN);
+    bf_div(Q, Q, &P, prec1, BF_RNDF);
+ 
+    bf_set_ui(&P, CHUD_C / 64);
+    bf_rsqrt(&G, &P, prec1);
+    bf_mul_ui(&G, &G, (uint64_t)CHUD_C * CHUD_C / (8 * 12), prec1, BF_RNDF);
+    bf_mul(Q, Q, &G, prec, BF_RNDN);
+    bf_delete(&P);
+    bf_delete(&G);
+}
+
+static int bf_const_get(bf_t *T, limb_t prec, bf_flags_t flags,
+                        BFConstCache *c,
+                        void (*func)(bf_t *res, limb_t prec))
+{
+    limb_t ziv_extra_bits, prec1;
+
+    ziv_extra_bits = 32;
+    for(;;) {
+        prec1 = prec + ziv_extra_bits;
+        if (c->prec < prec1) {
+            if (c->val.len == 0)
+                bf_init(T->ctx, &c->val);
+            func(&c->val, prec1);
+            c->prec = prec1;
+        } else {
+            prec1 = c->prec;
+        }
+        bf_set(T, &c->val);
+        if (!bf_can_round(T, prec, flags & BF_RND_MASK, prec1)) {
+            /* and more precision and retry */
+            ziv_extra_bits = ziv_extra_bits  + (ziv_extra_bits / 2);
+        } else {
+            break;
+        }
+    }
+    return bf_round(T, prec, flags);
+}
+
+static void bf_const_free(BFConstCache *c)
+{
+    bf_delete(&c->val);
+    memset(c, 0, sizeof(*c));
+}
+
+int bf_const_log2(bf_t *T, limb_t prec, bf_flags_t flags)
+{
+    bf_context_t *s = T->ctx;
+    return bf_const_get(T, prec, flags, &s->log2_cache, bf_const_log2_internal);
+}
+
+int bf_const_pi(bf_t *T, limb_t prec, bf_flags_t flags)
+{
+    bf_context_t *s = T->ctx;
+    return bf_const_get(T, prec, flags, &s->pi_cache, bf_const_pi_internal);
+}
+
+void bf_clear_cache(bf_context_t *s)
+{
+#ifdef USE_FFT_MUL
+    fft_clear_cache(s);
+#endif
+    bf_const_free(&s->log2_cache);
+    bf_const_free(&s->pi_cache);
+}
+
+/* ZivFunc should compute the result 'r' with faithful rounding at
+   precision 'prec'. For efficiency purposes, the final bf_round()
+   does not need to be done in the function. */
+typedef int ZivFunc(bf_t *r, const bf_t *a, limb_t prec, void *opaque);
+
+static int bf_ziv_rounding(bf_t *r, const bf_t *a,
+                           limb_t prec, bf_flags_t flags,
+                           ZivFunc *f, void *opaque)
+{
+    int rnd_mode, ret;
+    slimb_t prec1, ziv_extra_bits;
+    
+    rnd_mode = flags & BF_RND_MASK;
+    if (rnd_mode == BF_RNDF) {
+        /* no need to iterate */
+        f(r, a, prec, opaque);
+        ret = 0;
+    } else {
+        ziv_extra_bits = 32;
+        for(;;) {
+            prec1 = prec + ziv_extra_bits;
+            ret = f(r, a, prec1, opaque);
+            if (ret & (BF_ST_OVERFLOW | BF_ST_UNDERFLOW)) {
+                /* should never happen because it indicates the
+                   rounding cannot be done correctly, but we do not
+                   catch all the cases */
+                return ret;
+            }
+            /* if the result is exact, we can stop */
+            if (!(ret & BF_ST_INEXACT)) {
+                ret = 0;
+                break;
+            }
+            if (bf_can_round(r, prec, rnd_mode, prec1)) {
+                ret = BF_ST_INEXACT;
+                break;
+            }
+            ziv_extra_bits = ziv_extra_bits * 2;
+        }
+    }
+    return bf_round(r, prec, flags) | ret;
+}
+
+/* Compute the exponential using faithful rounding at precision 'prec'.
+   Note: the algorithm is from MPFR */
+static int bf_exp_internal(bf_t *r, const bf_t *a, limb_t prec, void *opaque)
+{
+    bf_context_t *s = r->ctx;
+    bf_t T_s, *T = &T_s;
+    slimb_t n, K, l, i, prec1;
+    
+    assert(r != a);
+
+    /* argument reduction:
+       T = a - n*log(2) with 0 <= T < log(2) and n integer.
+    */
+    bf_init(s, T);
+    if (a->expn <= -1) {
+        /* 0 <= abs(a) <= 0.5 */
+        if (a->sign)
+            n = -1;
+        else
+            n = 0;
+    } else {
+        bf_const_log2(T, LIMB_BITS, BF_RNDZ);
+        bf_div(T, a, T, LIMB_BITS, BF_RNDD);
+        bf_get_limb(&n, T, 0);
+    }
+
+    K = bf_isqrt((prec + 1) / 2);
+    l = (prec - 1) / K + 1;
+    /* XXX: precision analysis ? */
+    prec1 = prec + (K + 2 * l + 18) + K + 8;
+    if (a->expn > 0)
+        prec1 += a->expn;
+    //    printf("n=%ld K=%ld prec1=%ld\n", n, K, prec1);
+
+    bf_const_log2(T, prec1, BF_RNDF);
+    bf_mul_si(T, T, n, prec1, BF_RNDN);
+    bf_sub(T, a, T, prec1, BF_RNDN);
+
+    /* reduce the range of T */
+    bf_mul_2exp(T, -K, BF_PREC_INF, BF_RNDZ);
+    
+    /* Taylor expansion around zero :
+     1 + x + x^2/2 + ... + x^n/n! 
+     = (1 + x * (1 + x/2 * (1 + ... (x/n))))
+    */
+    {
+        bf_t U_s, *U = &U_s;
+        
+        bf_init(s, U);
+        bf_set_ui(r, 1);
+        for(i = l ; i >= 1; i--) {
+            bf_set_ui(U, i);
+            bf_div(U, T, U, prec1, BF_RNDN);
+            bf_mul(r, r, U, prec1, BF_RNDN);
+            bf_add_si(r, r, 1, prec1, BF_RNDN);
+        }
+        bf_delete(U);
+    }
+    bf_delete(T);
+    
+    /* undo the range reduction */
+    for(i = 0; i < K; i++) {
+        bf_mul(r, r, r, prec1, BF_RNDN);
+    }
+
+    /* undo the argument reduction */
+    bf_mul_2exp(r, n, BF_PREC_INF, BF_RNDZ);
+
+    return BF_ST_INEXACT;
+}
+
+int bf_exp(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags)
+{
+    bf_context_t *s = r->ctx;
+    assert(r != a);
+    if (a->len == 0) {
+        if (a->expn == BF_EXP_NAN) {
+            bf_set_nan(r);
+        } else if (a->expn == BF_EXP_INF) {
+            if (a->sign)
+                bf_set_zero(r, 0);
+            else
+                bf_set_inf(r, 0);
+        } else {
+            bf_set_ui(r, 1);
+        }
+        return 0;
+    }
+
+    /* crude overflow and underflow tests */
+    if (a->expn > 0) {
+        bf_t T_s, *T = &T_s;
+        bf_t log2_s, *log2 = &log2_s;
+        slimb_t e_min, e_max;
+        e_max = (limb_t)1 << (bf_get_exp_bits(flags) - 1);
+        e_min = -e_max + 3;
+        if (flags & BF_FLAG_SUBNORMAL)
+            e_min -= (prec - 1);
+
+        bf_init(s, T);
+        bf_init(s, log2);
+        bf_const_log2(log2, LIMB_BITS, BF_RNDU);
+        bf_mul_ui(T, log2, e_max, LIMB_BITS, BF_RNDU);
+        /* a > e_max * log(2) implies exp(a) > e_max */
+        if (bf_cmp_lt(T, a) > 0) {
+            /* overflow */
+            bf_delete(T);
+            bf_delete(log2);
+            return bf_set_overflow(r, 0, prec, flags);
+        }
+        /* a < e_min * log(2) implies exp(a) < e_min */
+        bf_mul_si(T, log2, e_min, LIMB_BITS, BF_RNDD);
+        if (bf_cmp_lt(a, T)) {
+            int rnd_mode = flags & BF_RND_MASK;
+
+            /* underflow */
+            bf_delete(T);
+            bf_delete(log2);
+            if (rnd_mode == BF_RNDU) {
+                /* set the smallest value */
+                bf_set_ui(r, 1);
+                r->expn = e_min;
+            } else {
+                bf_set_zero(r, 0);
+            }
+            return BF_ST_UNDERFLOW | BF_ST_INEXACT;
+        }
+        bf_delete(log2);
+        bf_delete(T);
+    }
+
+    return bf_ziv_rounding(r, a, prec, flags, bf_exp_internal, NULL);
+}
+
+static int bf_log_internal(bf_t *r, const bf_t *a, limb_t prec, void *opaque)
+{
+    bf_context_t *s = r->ctx;
+    bf_t T_s, *T = &T_s;
+    bf_t U_s, *U = &U_s;
+    bf_t V_s, *V = &V_s;
+    slimb_t n, prec1, l, i, K;
+    
+    assert(r != a);
+
+    bf_init(s, T);
+    /* argument reduction 1 */
+    /* T=a*2^n with 2/3 <= T <= 4/3 */
+    {
+        bf_t U_s, *U = &U_s;
+        bf_set(T, a);
+        n = T->expn;
+        T->expn = 0;
+        /* U= ~ 2/3 */
+        bf_init(s, U);
+        bf_set_ui(U, 0xaaaaaaaa); 
+        U->expn = 0;
+        if (bf_cmp_lt(T, U)) {
+            T->expn++;
+            n--;
+        }
+        bf_delete(U);
+    }
+    //    printf("n=%ld\n", n);
+    //    bf_print_str("T", T);
+
+    /* XXX: precision analysis */
+    /* number of iterations for argument reduction 2 */
+    K = bf_isqrt((prec + 1) / 2); 
+    /* order of Taylor expansion */
+    l = prec / (2 * K) + 1; 
+    /* precision of the intermediate computations */
+    prec1 = prec + K + 2 * l + 32;
+
+    bf_init(s, U);
+    bf_init(s, V);
+    
+    /* Note: cancellation occurs here, so we use more precision (XXX:
+       reduce the precision by computing the exact cancellation) */
+    bf_add_si(T, T, -1, BF_PREC_INF, BF_RNDN); 
+
+    /* argument reduction 2 */
+    for(i = 0; i < K; i++) {
+        /* T = T / (1 + sqrt(1 + T)) */
+        bf_add_si(U, T, 1, prec1, BF_RNDN);
+        bf_sqrt(V, U, prec1, BF_RNDF);
+        bf_add_si(U, V, 1, prec1, BF_RNDN);
+        bf_div(T, T, U, prec1, BF_RNDN);
+    }
+
+    {
+        bf_t Y_s, *Y = &Y_s;
+        bf_t Y2_s, *Y2 = &Y2_s;
+        bf_init(s, Y);
+        bf_init(s, Y2);
+
+        /* compute ln(1+x) = ln((1+y)/(1-y)) with y=x/(2+x)
+           = y + y^3/3 + ... + y^(2*l + 1) / (2*l+1) 
+           with Y=Y^2
+           = y*(1+Y/3+Y^2/5+...) = y*(1+Y*(1/3+Y*(1/5 + ...)))
+        */
+        bf_add_si(Y, T, 2, prec1, BF_RNDN);
+        bf_div(Y, T, Y, prec1, BF_RNDN);
+
+        bf_mul(Y2, Y, Y, prec1, BF_RNDN);
+        bf_set_ui(r, 0);
+        for(i = l; i >= 1; i--) {
+            bf_set_ui(U, 1);
+            bf_set_ui(V, 2 * i + 1);
+            bf_div(U, U, V, prec1, BF_RNDN);
+            bf_add(r, r, U, prec1, BF_RNDN);
+            bf_mul(r, r, Y2, prec1, BF_RNDN);
+        }
+        bf_add_si(r, r, 1, prec1, BF_RNDN);
+        bf_mul(r, r, Y, prec1, BF_RNDN);
+        bf_delete(Y);
+        bf_delete(Y2);
+    }
+    bf_delete(V);
+    bf_delete(U);
+
+    /* multiplication by 2 for the Taylor expansion and undo the
+       argument reduction 2*/
+    bf_mul_2exp(r, K + 1, BF_PREC_INF, BF_RNDZ);
+    
+    /* undo the argument reduction 1 */
+    bf_const_log2(T, prec1, BF_RNDF);
+    bf_mul_si(T, T, n, prec1, BF_RNDN);
+    bf_add(r, r, T, prec1, BF_RNDN);
+    
+    bf_delete(T);
+    return BF_ST_INEXACT;
+}
+
+int bf_log(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags)
+{
+    bf_context_t *s = r->ctx;
+    bf_t T_s, *T = &T_s;
+    
+    assert(r != a);
+    if (a->len == 0) {
+        if (a->expn == BF_EXP_NAN) {
+            bf_set_nan(r);
+            return 0;
+        } else if (a->expn == BF_EXP_INF) {
+            if (a->sign) {
+                bf_set_nan(r);
+                return BF_ST_INVALID_OP;
+            } else {
+                bf_set_inf(r, 0);
+                return 0;
+            }
+        } else {
+            bf_set_inf(r, 1);
+            return 0;
+        }
+    }
+    if (a->sign) {
+        bf_set_nan(r);
+        return BF_ST_INVALID_OP;
+    }
+    bf_init(s, T);
+    bf_set_ui(T, 1);
+    if (bf_cmp_eq(a, T)) {
+        bf_set_zero(r, 0);
+        bf_delete(T);
+        return 0;
+    }
+    bf_delete(T);
+
+    return bf_ziv_rounding(r, a, prec, flags, bf_log_internal, NULL);
+}
+
+/* x and y finite and x > 0 */
+/* XXX: overflow/underflow handling */
+static int bf_pow_generic(bf_t *r, const bf_t *x, limb_t prec, void *opaque)
+{
+    bf_context_t *s = r->ctx;
+    const bf_t *y = opaque;
+    bf_t T_s, *T = &T_s;
+    limb_t prec1;
+
+    bf_init(s, T);
+    /* XXX: proof for the added precision */
+    prec1 = prec + 32;
+    bf_log(T, x, prec1, BF_RNDF);
+    bf_mul(T, T, y, prec1, BF_RNDF);
+    bf_exp(r, T, prec1, BF_RNDF);
+    bf_delete(T);
+    return BF_ST_INEXACT;
+}
+
+/* x and y finite, x > 0, y integer and y fits on one limb */
+/* XXX: overflow/underflow handling */ 
+static int bf_pow_int(bf_t *r, const bf_t *x, limb_t prec, void *opaque)
+{
+    bf_context_t *s = r->ctx;
+    const bf_t *y = opaque;
+    bf_t T_s, *T = &T_s;
+    limb_t prec1;
+    int ret;
+    slimb_t y1;
+    
+    bf_get_limb(&y1, y, 0);
+    if (y1 < 0)
+        y1 = -y1;
+    /* XXX: proof for the added precision */
+    prec1 = prec + ceil_log2(y1) * 2 + 8;
+    ret = bf_pow_ui(r, x, y1 < 0 ? -y1 : y1, prec1, BF_RNDN);
+    if (y->sign) {
+        bf_init(s, T);
+        bf_set_ui(T, 1);
+        ret |= bf_div(r, T, r, prec1, BF_RNDN);
+        bf_delete(T);
+    }
+    return ret;
+}
+
+/* x must be a finite non zero float. Return TRUE if there is a
+   floating point number r such as x=r^(2^n) and return this floating
+   point number 'r'. Otherwise return FALSE and r is undefined. */
+static BOOL check_exact_power2n(bf_t *r, const bf_t *x, slimb_t n)
+{
+    bf_context_t *s = r->ctx;
+    bf_t T_s, *T = &T_s;
+    slimb_t e, i, er;
+    limb_t v;
+    
+    /* x = m*2^e with m odd integer */
+    e = bf_get_exp_min(x);
+    /* fast check on the exponent */
+    if (n > (LIMB_BITS - 1)) {
+        if (e != 0)
+            return FALSE;
+        er = 0;
+    } else {
+        if ((e & (((limb_t)1 << n) - 1)) != 0)
+            return FALSE;
+        er = e >> n;
+    }
+    /* every perfect odd square = 1 modulo 8 */
+    v = get_bits(x->tab, x->len, x->len * LIMB_BITS - x->expn + e);
+    if ((v & 7) != 1)
+        return FALSE;
+
+    bf_init(s, T);
+    bf_set(T, x);
+    T->expn -= e;
+    for(i = 0; i < n; i++) {
+        if (i != 0)
+            bf_set(T, r);
+        if (bf_sqrtrem(r, NULL, T) != 0)
+            return FALSE;
+    }
+    r->expn += er;
+    return TRUE;
+}
+
+/* prec = BF_PREC_INF is accepted for x and y integers and y >= 0 */
+int bf_pow(bf_t *r, const bf_t *x, const bf_t *y, limb_t prec, bf_flags_t flags)
+{
+    bf_context_t *s = r->ctx;
+    bf_t T_s, *T = &T_s;
+    bf_t ytmp_s;
+    BOOL y_is_int, y_is_odd;
+    int r_sign, ret, rnd_mode;
+    slimb_t y_emin;
+    
+    if (x->len == 0 || y->len == 0) {
+        if (y->expn == BF_EXP_ZERO) {
+            /* pow(x, 0) = 1 */
+            bf_set_ui(r, 1);
+        } else if (x->expn == BF_EXP_NAN) {
+            bf_set_nan(r);
+        } else {
+            int cmp_x_abs_1;
+            bf_set_ui(r, 1);
+            cmp_x_abs_1 = bf_cmpu(x, r);
+            if (cmp_x_abs_1 == 0 && (flags & BF_POW_JS_QUICKS) &&
+                (y->expn >= BF_EXP_INF)) {
+                bf_set_nan(r);
+            } else if (cmp_x_abs_1 == 0 &&
+                       (!x->sign || y->expn != BF_EXP_NAN)) {
+                /* pow(1, y) = 1 even if y = NaN */
+                /* pow(-1, +/-inf) = 1 */
+            } else if (y->expn == BF_EXP_NAN) {
+                bf_set_nan(r);
+            } else if (y->expn == BF_EXP_INF) {
+                if (y->sign == (cmp_x_abs_1 > 0)) {
+                    bf_set_zero(r, 0);
+                } else {
+                    bf_set_inf(r, 0);
+                }
+            } else {
+                y_emin = bf_get_exp_min(y);
+                y_is_odd = (y_emin == 0);
+                if (y->sign == (x->expn == BF_EXP_ZERO)) {
+                    bf_set_inf(r, y_is_odd & x->sign);
+                    if (y->sign) {
+                        /* pow(0, y) with y < 0 */
+                        return BF_ST_DIVIDE_ZERO;
+                    }
+                } else {
+                    bf_set_zero(r, y_is_odd & x->sign);
+                }
+            }
+        }
+        return 0;
+    }
+    bf_init(s, T);
+    bf_set(T, x);
+    y_emin = bf_get_exp_min(y);
+    y_is_int = (y_emin >= 0);
+    rnd_mode = flags & BF_RND_MASK;
+    if (x->sign) {
+        if (!y_is_int) {
+            bf_set_nan(r);
+            bf_delete(T);
+            return BF_ST_INVALID_OP;
+        }
+        y_is_odd = (y_emin == 0);
+        r_sign = y_is_odd;
+        /* change the directed rounding mode if the sign of the result
+           is changed */
+        if (r_sign && (rnd_mode == BF_RNDD || rnd_mode == BF_RNDU))
+            flags ^= 1;
+        bf_neg(T);
+    } else {
+        r_sign = 0;
+    }
+
+    bf_set_ui(r, 1);
+    if (bf_cmp_eq(T, r)) {
+        /* abs(x) = 1: nothing more to do */
+        ret = 0;
+    } else if (y_is_int) {
+        slimb_t T_bits, e;
+    int_pow:
+        T_bits = T->expn - bf_get_exp_min(T);
+        if (T_bits == 1) {
+            /* pow(2^b, y) = 2^(b*y) */
+            bf_mul_si(T, y, T->expn - 1, LIMB_BITS, BF_RNDZ);
+            bf_get_limb(&e, T, 0);
+            bf_set_ui(r, 1);
+            ret = bf_mul_2exp(r, e, prec, flags);
+        } else if (prec == BF_PREC_INF) {
+            slimb_t y1;
+            /* specific case for infinite precision (integer case) */
+            bf_get_limb(&y1, y, 0);
+            assert(!y->sign);
+            /* x must be an integer, so abs(x) >= 2 */
+            if (y1 >= ((slimb_t)1 << BF_EXP_BITS_MAX)) {
+                bf_delete(T);
+                return bf_set_overflow(r, 0, BF_PREC_INF, flags);
+            }
+            ret = bf_pow_ui(r, T, y1, BF_PREC_INF, BF_RNDZ);
+        } else {
+            if (y->expn <= 31) {
+                /* small enough power: use exponentiation in all cases */
+            } else if (y->sign) {
+                /* cannot be exact */
+                goto general_case;
+            } else {
+                if (rnd_mode == BF_RNDF)
+                    goto general_case; /* no need to track exact results */
+                /* see if the result has a chance to be exact:
+                   if x=a*2^b (a odd), x^y=a^y*2^(b*y)
+                   x^y needs a precision of at least floor_log2(a)*y bits
+                */
+                bf_mul_si(r, y, T_bits - 1, LIMB_BITS, BF_RNDZ);
+                bf_get_limb(&e, r, 0);
+                if (prec < e)
+                    goto general_case;
+            }
+            ret = bf_ziv_rounding(r, T, prec, flags, bf_pow_int, (void *)y);
+        }
+    } else {
+        if (rnd_mode != BF_RNDF) {
+            bf_t *y1;
+            if (y_emin < 0 && check_exact_power2n(r, T, -y_emin)) {
+                /* the problem is reduced to a power to an integer */
+#if 0
+                printf("\nn=%ld\n", -y_emin);
+                bf_print_str("T", T);
+                bf_print_str("r", r);
+#endif
+                bf_set(T, r);
+                y1 = &ytmp_s;
+                y1->tab = y->tab;
+                y1->len = y->len;
+                y1->sign = y->sign;
+                y1->expn = y->expn - y_emin;
+                y = y1;
+                goto int_pow;
+            }
+        }
+    general_case:
+        ret = bf_ziv_rounding(r, T, prec, flags, bf_pow_generic, (void *)y);
+    }
+    bf_delete(T);
+    r->sign = r_sign;
+    return ret;
+}
+
+/* compute sqrt(-2*x-x^2) to get |sin(x)| from cos(x) - 1. */
+static void bf_sqrt_sin(bf_t *r, const bf_t *x, limb_t prec1)
+{
+    bf_context_t *s = r->ctx;
+    bf_t T_s, *T = &T_s;
+    bf_init(s, T);
+    bf_set(T, x);
+    bf_mul(r, T, T, prec1, BF_RNDN);
+    bf_mul_2exp(T, 1, BF_PREC_INF, BF_RNDZ);
+    bf_add(T, T, r, prec1, BF_RNDN);
+    bf_neg(T);
+    bf_sqrt(r, T, prec1, BF_RNDF);
+    bf_delete(T);
+}
+
+int bf_sincos(bf_t *s, bf_t *c, const bf_t *a, limb_t prec)
+{
+    bf_context_t *s1 = a->ctx;
+    bf_t T_s, *T = &T_s;
+    bf_t U_s, *U = &U_s;
+    bf_t r_s, *r = &r_s;
+    slimb_t K, prec1, i, l, mod, prec2;
+    int is_neg;
+    
+    assert(c != a && s != a);
+    if (a->len == 0) {
+        if (a->expn == BF_EXP_NAN) {
+            if (c)
+                bf_set_nan(c);
+            if (s)
+                bf_set_nan(s);
+            return 0;
+        } else if (a->expn == BF_EXP_INF) {
+            if (c)
+                bf_set_nan(c);
+            if (s)
+                bf_set_nan(s);
+            return BF_ST_INVALID_OP;
+        } else {
+            if (c)
+                bf_set_ui(c, 1);
+            if (s)
+                bf_set_zero(s, a->sign);
+            return 0;
+        }
+    }
+
+    bf_init(s1, T);
+    bf_init(s1, U);
+    bf_init(s1, r);
+    
+    /* XXX: precision analysis */
+    K = bf_isqrt(prec / 2);
+    l = prec / (2 * K) + 1;
+    prec1 = prec + 2 * K + l + 8;
+    
+    /* after the modulo reduction, -pi/4 <= T <= pi/4 */
+    if (a->expn <= -1) {
+        /* abs(a) <= 0.25: no modulo reduction needed */
+        bf_set(T, a);
+        mod = 0;
+    } else {
+        slimb_t cancel;
+        cancel = 0;
+        for(;;) {
+            prec2 = prec1 + cancel;
+            bf_const_pi(U, prec2, BF_RNDF);
+            bf_mul_2exp(U, -1, BF_PREC_INF, BF_RNDZ);
+            bf_remquo(&mod, T, a, U, prec2, BF_RNDN);
+            //            printf("T.expn=%ld prec2=%ld\n", T->expn, prec2);
+            if (mod == 0 || (T->expn != BF_EXP_ZERO &&
+                             (T->expn + prec2) >= (prec1 - 1)))
+                break;
+            /* increase the number of bits until the precision is good enough */
+            cancel = bf_max(-T->expn, (cancel + 1) * 3 / 2);
+        }
+        mod &= 3;
+    }
+    
+    is_neg = T->sign;
+        
+    /* compute cosm1(x) = cos(x) - 1 */
+    bf_mul(T, T, T, prec1, BF_RNDN);
+    bf_mul_2exp(T, -2 * K, BF_PREC_INF, BF_RNDZ);
+    
+    /* Taylor expansion:
+       -x^2/2 + x^4/4! - x^6/6! + ...
+    */
+    bf_set_ui(r, 1);
+    for(i = l ; i >= 1; i--) {
+        bf_set_ui(U, 2 * i - 1);
+        bf_mul_ui(U, U, 2 * i, BF_PREC_INF, BF_RNDZ);
+        bf_div(U, T, U, prec1, BF_RNDN);
+        bf_mul(r, r, U, prec1, BF_RNDN);
+        bf_neg(r);
+        if (i != 1)
+            bf_add_si(r, r, 1, prec1, BF_RNDN);
+    }
+    bf_delete(U);
+
+    /* undo argument reduction:
+       cosm1(2*x)= 2*(2*cosm1(x)+cosm1(x)^2)
+    */
+    for(i = 0; i < K; i++) {
+        bf_mul(T, r, r, prec1, BF_RNDN);
+        bf_mul_2exp(r, 1, BF_PREC_INF, BF_RNDZ);
+        bf_add(r, r, T, prec1, BF_RNDN);
+        bf_mul_2exp(r, 1, BF_PREC_INF, BF_RNDZ);
+    }
+    bf_delete(T);
+
+    if (c) {
+        if ((mod & 1) == 0) {
+            bf_add_si(c, r, 1, prec1, BF_RNDN);
+        } else {
+            bf_sqrt_sin(c, r, prec1);
+            c->sign = is_neg ^ 1;
+        }
+        c->sign ^= mod >> 1;
+    }
+    if (s) {
+        if ((mod & 1) == 0) {
+            bf_sqrt_sin(s, r, prec1);
+            s->sign = is_neg;
+        } else {
+            bf_add_si(s, r, 1, prec1, BF_RNDN);
+        }
+        s->sign ^= mod >> 1;
+    }
+    bf_delete(r);
+    return BF_ST_INEXACT;
+}
+
+static int bf_cos_internal(bf_t *r, const bf_t *a, limb_t prec, void *opaque)
+{
+    return bf_sincos(NULL, r, a, prec);
+}
+
+int bf_cos(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags)
+{
+    return bf_ziv_rounding(r, a, prec, flags, bf_cos_internal, NULL);
+}
+
+static int bf_sin_internal(bf_t *r, const bf_t *a, limb_t prec, void *opaque)
+{
+    return bf_sincos(r, NULL, a, prec);
+}
+
+int bf_sin(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags)
+{
+    return bf_ziv_rounding(r, a, prec, flags, bf_sin_internal, NULL);
+}
+
+static int bf_tan_internal(bf_t *r, const bf_t *a, limb_t prec, void *opaque)
+{
+    bf_context_t *s = r->ctx;
+    bf_t T_s, *T = &T_s;
+    limb_t prec1;
+    
+    if (a->len == 0) {
+        if (a->expn == BF_EXP_NAN) {
+            bf_set_nan(r);
+            return 0;
+        } else if (a->expn == BF_EXP_INF) {
+            bf_set_nan(r);
+            return BF_ST_INVALID_OP;
+        } else {
+            bf_set_zero(r, a->sign);
+            return 0;
+        }
+    }
+
+    /* XXX: precision analysis */
+    prec1 = prec + 8;
+    bf_init(s, T);
+    bf_sincos(r, T, a, prec1);
+    bf_div(r, r, T, prec1, BF_RNDF);
+    bf_delete(T);
+    return BF_ST_INEXACT;
+}
+
+int bf_tan(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags)
+{
+    return bf_ziv_rounding(r, a, prec, flags, bf_tan_internal, NULL);
+}
+
+/* if add_pi2 is true, add pi/2 to the result (used for acos(x) to
+   avoid cancellation) */
+static int bf_atan_internal(bf_t *r, const bf_t *a, limb_t prec,
+                            void *opaque)
+{
+    bf_context_t *s = r->ctx;
+    BOOL add_pi2 = (BOOL)(intptr_t)opaque;
+    bf_t T_s, *T = &T_s;
+    bf_t U_s, *U = &U_s;
+    bf_t V_s, *V = &V_s;
+    bf_t X2_s, *X2 = &X2_s;
+    int cmp_1;
+    slimb_t prec1, i, K, l;
+    
+    if (a->len == 0) {
+        if (a->expn == BF_EXP_NAN) {
+            bf_set_nan(r);
+            return 0;
+        } else {
+            if (a->expn == BF_EXP_INF)
+                i = 1 - 2 * a->sign;
+            else
+                i = 0;
+            i += add_pi2;
+            /* return i*(pi/2) with -1 <= i <= 2 */
+            if (i == 0) {
+                bf_set_zero(r, add_pi2 ? 0 : a->sign);
+                return 0;
+            } else {
+                /* PI or PI/2 */
+                bf_const_pi(r, prec, BF_RNDF);
+                if (i != 2)
+                    bf_mul_2exp(r, -1, BF_PREC_INF, BF_RNDZ);
+                r->sign = (i < 0);
+                return BF_ST_INEXACT;
+            }
+        }
+    }
+    
+    bf_init(s, T);
+    bf_set_ui(T, 1);
+    cmp_1 = bf_cmpu(a, T);
+    if (cmp_1 == 0 && !add_pi2) {
+        /* short cut: abs(a) == 1 -> +/-pi/4 */
+        bf_const_pi(r, prec, BF_RNDF);
+        bf_mul_2exp(r, -2, BF_PREC_INF, BF_RNDZ);
+        r->sign = a->sign;
+        bf_delete(T);
+        return BF_ST_INEXACT;
+    }
+
+    /* XXX: precision analysis */
+    K = bf_isqrt((prec + 1) / 2);
+    l = prec / (2 * K) + 1;
+    prec1 = prec + K + 2 * l + 32;
+    //    printf("prec=%ld K=%ld l=%ld prec1=%ld\n", prec, K, l, prec1);
+    
+    if (cmp_1 > 0) {
+        bf_set_ui(T, 1);
+        bf_div(T, T, a, prec1, BF_RNDN);
+    } else {
+        bf_set(T, a);
+    }
+
+    /* abs(T) <= 1 */
+
+    /* argument reduction */
+
+    bf_init(s, U);
+    bf_init(s, V);
+    bf_init(s, X2);
+    for(i = 0; i < K; i++) {
+        /* T = T / (1 + sqrt(1 + T^2)) */
+        bf_mul(U, T, T, prec1, BF_RNDN);
+        bf_add_si(U, U, 1, prec1, BF_RNDN);
+        bf_sqrt(V, U, prec1, BF_RNDN);
+        bf_add_si(V, V, 1, prec1, BF_RNDN);
+        bf_div(T, T, V, prec1, BF_RNDN);
+    }
+
+    /* Taylor series: 
+       x - x^3/3 + ... + (-1)^ l * y^(2*l + 1) / (2*l+1) 
+    */
+    bf_mul(X2, T, T, prec1, BF_RNDN);
+    bf_set_ui(r, 0);
+    for(i = l; i >= 1; i--) {
+        bf_set_si(U, 1);
+        bf_set_ui(V, 2 * i + 1);
+        bf_div(U, U, V, prec1, BF_RNDN);
+        bf_neg(r);
+        bf_add(r, r, U, prec1, BF_RNDN);
+        bf_mul(r, r, X2, prec1, BF_RNDN);
+    }
+    bf_neg(r);
+    bf_add_si(r, r, 1, prec1, BF_RNDN);
+    bf_mul(r, r, T, prec1, BF_RNDN);
+
+    /* undo the argument reduction */
+    bf_mul_2exp(r, K, BF_PREC_INF, BF_RNDZ);
+    
+    bf_delete(U);
+    bf_delete(V);
+    bf_delete(X2);
+
+    i = add_pi2;
+    if (cmp_1 > 0) {
+        /* undo the inversion : r = sign(a)*PI/2 - r */
+        bf_neg(r);
+        i += 1 - 2 * a->sign;
+    }
+    /* add i*(pi/2) with -1 <= i <= 2 */
+    if (i != 0) {
+        bf_const_pi(T, prec1, BF_RNDF);
+        if (i != 2)
+            bf_mul_2exp(T, -1, BF_PREC_INF, BF_RNDZ);
+        T->sign = (i < 0);
+        bf_add(r, T, r, prec1, BF_RNDN);
+    }
+    
+    bf_delete(T);
+    return BF_ST_INEXACT;
+}
+
+int bf_atan(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags)
+{
+    return bf_ziv_rounding(r, a, prec, flags, bf_atan_internal, (void *)FALSE);
+}
+
+static int bf_atan2_internal(bf_t *r, const bf_t *y, limb_t prec, void *opaque)
+{
+    bf_context_t *s = r->ctx;
+    const bf_t *x = opaque;
+    bf_t T_s, *T = &T_s;
+    limb_t prec1;
+    int ret;
+    
+    if (y->expn == BF_EXP_NAN || x->expn == BF_EXP_NAN) {
+        bf_set_nan(r);
+        return 0;
+    }
+
+    /* compute atan(y/x) assumming inf/inf = 1 and 0/0 = 0 */
+    bf_init(s, T);
+    prec1 = prec + 32;
+    if (y->expn == BF_EXP_INF && x->expn == BF_EXP_INF) {
+        bf_set_ui(T, 1);
+        T->sign = y->sign ^ x->sign;
+    } else if (y->expn == BF_EXP_ZERO && x->expn == BF_EXP_ZERO) {
+        bf_set_zero(T, y->sign ^ x->sign);
+    } else {
+        bf_div(T, y, x, prec1, BF_RNDF);
+    }
+    ret = bf_atan(r, T, prec1, BF_RNDF);
+
+    if (x->sign) {
+        /* if x < 0 (it includes -0), return sign(y)*pi + atan(y/x) */
+        bf_const_pi(T, prec1, BF_RNDF);
+        T->sign = y->sign;
+        bf_add(r, r, T, prec1, BF_RNDN);
+        ret |= BF_ST_INEXACT;
+    }
+
+    bf_delete(T);
+    return ret;
+}
+
+int bf_atan2(bf_t *r, const bf_t *y, const bf_t *x,
+             limb_t prec, bf_flags_t flags)
+{
+    return bf_ziv_rounding(r, y, prec, flags, bf_atan2_internal, (void *)x);
+}
+
+static int bf_asin_internal(bf_t *r, const bf_t *a, limb_t prec, void *opaque)
+{
+    bf_context_t *s = r->ctx;
+    BOOL is_acos = (BOOL)(intptr_t)opaque;
+    bf_t T_s, *T = &T_s;
+    limb_t prec1, prec2;
+    int res;
+    
+    if (a->len == 0) {
+        if (a->expn == BF_EXP_NAN) {
+            bf_set_nan(r);
+            return 0;
+        } else if (a->expn == BF_EXP_INF) {
+            bf_set_nan(r);
+            return BF_ST_INVALID_OP;
+        } else {
+            if (is_acos) {
+                bf_const_pi(r, prec, BF_RNDF);
+                bf_mul_2exp(r, -1, BF_PREC_INF, BF_RNDZ);
+                return BF_ST_INEXACT;
+            } else {
+                bf_set_zero(r, a->sign);
+                return 0;
+            }
+        }
+    }
+    bf_init(s, T);
+    bf_set_ui(T, 1);
+    res = bf_cmpu(a, T);
+    if (res > 0) {
+        bf_delete(T);
+        bf_set_nan(r);
+        return BF_ST_INVALID_OP;
+    } else if (res == 0 && a->sign == 0 && is_acos) {
+        bf_set_zero(r, 0);
+        bf_delete(T);
+        return 0;
+    }
+    
+    /* asin(x) = atan(x/sqrt(1-x^2)) 
+       acos(x) = pi/2 - asin(x) */
+    prec1 = prec + 8;
+    /* increase the precision in x^2 to compensate the cancellation in
+       (1-x^2) if x is close to 1 */
+    /* XXX: use less precision when possible */
+    if (a->expn >= 0)
+        prec2 = BF_PREC_INF;
+    else
+        prec2 = prec1;
+    bf_mul(T, a, a, prec2, BF_RNDN);
+    bf_neg(T);
+    bf_add_si(T, T, 1, prec2, BF_RNDN);
+
+    bf_sqrt(r, T, prec1, BF_RNDN);
+    bf_div(T, a, r, prec1, BF_RNDN);
+    if (is_acos)
+        bf_neg(T);
+    bf_atan_internal(r, T, prec1, (void *)(intptr_t)is_acos);
+    bf_delete(T);
+    return BF_ST_INEXACT;
+}
+
+int bf_asin(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags)
+{
+    return bf_ziv_rounding(r, a, prec, flags, bf_asin_internal, (void *)FALSE);
+}
+
+int bf_acos(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags)
+{
+    return bf_ziv_rounding(r, a, prec, flags, bf_asin_internal, (void *)TRUE);
+}
+
+#ifdef USE_FFT_MUL
+/***************************************************************/
+/* Integer multiplication with FFT */
+
+/* or LIMB_BITS at bit position 'pos' in tab */
+static inline void put_bits(limb_t *tab, limb_t len, slimb_t pos, limb_t val)
+{
+    limb_t i;
+    int p;
+
+    i = pos >> LIMB_LOG2_BITS;
+    p = pos & (LIMB_BITS - 1);
+    if (i < len)
+        tab[i] |= val << p;
+    if (p != 0) {
+        i++;
+        if (i < len) {
+            tab[i] |= val >> (LIMB_BITS - p);
+        }
+    }
+}
+
+#if defined(__AVX2__)
+
+typedef double NTTLimb;
+
+/* we must have: modulo >= 1 << NTT_MOD_LOG2_MIN */
+#define NTT_MOD_LOG2_MIN 50
+#define NTT_MOD_LOG2_MAX 51
+#define NB_MODS 5
+#define NTT_PROOT_2EXP 39
+static const int ntt_int_bits[NB_MODS] = { 254, 203, 152, 101, 50, };
+
+static const limb_t ntt_mods[NB_MODS] = { 0x00073a8000000001, 0x0007858000000001, 0x0007a38000000001, 0x0007a68000000001, 0x0007fd8000000001,
+};
+
+static const limb_t ntt_proot[2][NB_MODS] = {
+    { 0x00056198d44332c8, 0x0002eb5d640aad39, 0x00047e31eaa35fd0, 0x0005271ac118a150, 0x00075e0ce8442bd5, },
+    { 0x000461169761bcc5, 0x0002dac3cb2da688, 0x0004abc97751e3bf, 0x000656778fc8c485, 0x0000dc6469c269fa, },
+};
+
+static const limb_t ntt_mods_cr[NB_MODS * (NB_MODS - 1) / 2] = {
+ 0x00020e4da740da8e, 0x0004c3dc09c09c1d, 0x000063bd097b4271, 0x000799d8f18f18fd,
+ 0x0005384222222264, 0x000572b07c1f07fe, 0x00035cd08888889a,
+ 0x00066015555557e3, 0x000725960b60b623,
+ 0x0002fc1fa1d6ce12,
+};
+
+#else
+
+typedef limb_t NTTLimb;
+
+#if LIMB_BITS == 64
+
+#define NTT_MOD_LOG2_MIN 61
+#define NTT_MOD_LOG2_MAX 62
+#define NB_MODS 5
+#define NTT_PROOT_2EXP 51
+static const int ntt_int_bits[NB_MODS] = { 307, 246, 185, 123, 61, };
+
+static const limb_t ntt_mods[NB_MODS] = { 0x28d8000000000001, 0x2a88000000000001, 0x2ed8000000000001, 0x3508000000000001, 0x3aa8000000000001,
+};
+
+static const limb_t ntt_proot[2][NB_MODS] = {
+    { 0x1b8ea61034a2bea7, 0x21a9762de58206fb, 0x02ca782f0756a8ea, 0x278384537a3e50a1, 0x106e13fee74ce0ab, },
+    { 0x233513af133e13b8, 0x1d13140d1c6f75f1, 0x12cde57f97e3eeda, 0x0d6149e23cbe654f, 0x36cd204f522a1379, },
+};
+
+static const limb_t ntt_mods_cr[NB_MODS * (NB_MODS - 1) / 2] = {
+ 0x08a9ed097b425eea, 0x18a44aaaaaaaaab3, 0x2493f57f57f57f5d, 0x126b8d0649a7f8d4,
+ 0x09d80ed7303b5ccc, 0x25b8bcf3cf3cf3d5, 0x2ce6ce63398ce638,
+ 0x0e31fad40a57eb59, 0x02a3529fd4a7f52f,
+ 0x3a5493e93e93e94a,
+};
+
+#elif LIMB_BITS == 32
+
+/* we must have: modulo >= 1 << NTT_MOD_LOG2_MIN */
+#define NTT_MOD_LOG2_MIN 29
+#define NTT_MOD_LOG2_MAX 30
+#define NB_MODS 5
+#define NTT_PROOT_2EXP 20
+static const int ntt_int_bits[NB_MODS] = { 148, 119, 89, 59, 29, };
+
+static const limb_t ntt_mods[NB_MODS] = { 0x0000000032b00001, 0x0000000033700001, 0x0000000036d00001, 0x0000000037300001, 0x000000003e500001,
+};
+
+static const limb_t ntt_proot[2][NB_MODS] = {
+    { 0x0000000032525f31, 0x0000000005eb3b37, 0x00000000246eda9f, 0x0000000035f25901, 0x00000000022f5768, },
+    { 0x00000000051eba1a, 0x00000000107be10e, 0x000000001cd574e0, 0x00000000053806e6, 0x000000002cd6bf98, },
+};
+
+static const limb_t ntt_mods_cr[NB_MODS * (NB_MODS - 1) / 2] = {
+ 0x000000000449559a, 0x000000001eba6ca9, 0x000000002ec18e46, 0x000000000860160b,
+ 0x000000000d321307, 0x000000000bf51120, 0x000000000f662938,
+ 0x000000000932ab3e, 0x000000002f40eef8,
+ 0x000000002e760905,
+};
+
+#endif /* LIMB_BITS */
+
+#endif /* !AVX2 */
+
+#if defined(__AVX2__)
+#define NTT_TRIG_K_MAX 18
+#else
+#define NTT_TRIG_K_MAX 19
+#endif
+
+typedef struct BFNTTState {
+    bf_context_t *ctx;
+    
+    /* used for mul_mod_fast() */
+    limb_t ntt_mods_div[NB_MODS];
+
+    limb_t ntt_proot_pow[NB_MODS][2][NTT_PROOT_2EXP + 1];
+    limb_t ntt_proot_pow_inv[NB_MODS][2][NTT_PROOT_2EXP + 1];
+    NTTLimb *ntt_trig[NB_MODS][2][NTT_TRIG_K_MAX + 1];
+    /* 1/2^n mod m */
+    limb_t ntt_len_inv[NB_MODS][NTT_PROOT_2EXP + 1][2];
+#if defined(__AVX2__)
+    __m256d ntt_mods_cr_vec[NB_MODS * (NB_MODS - 1) / 2];
+    __m256d ntt_mods_vec[NB_MODS];
+    __m256d ntt_mods_inv_vec[NB_MODS];
+#else
+    limb_t ntt_mods_cr_inv[NB_MODS * (NB_MODS - 1) / 2];
+#endif
+} BFNTTState;
+
+static NTTLimb *get_trig(BFNTTState *s, int k, int inverse, int m_idx);
+
+/* add modulo with up to (LIMB_BITS-1) bit modulo */
+static inline limb_t add_mod(limb_t a, limb_t b, limb_t m)
+{
+    limb_t r;
+    r = a + b;
+    if (r >= m)
+        r -= m;
+    return r;
+}
+
+/* sub modulo with up to LIMB_BITS bit modulo */
+static inline limb_t sub_mod(limb_t a, limb_t b, limb_t m)
+{
+    limb_t r;
+    r = a - b;
+    if (r > a)
+        r += m;
+    return r;
+}
+
+/* return (r0+r1*B) mod m 
+   precondition: 0 <= r0+r1*B < 2^(64+NTT_MOD_LOG2_MIN) 
+*/
+static inline limb_t mod_fast(dlimb_t r, 
+                                limb_t m, limb_t m_inv)
+{
+    limb_t a1, q, t0, r1, r0;
+    
+    a1 = r >> NTT_MOD_LOG2_MIN;
+    
+    q = ((dlimb_t)a1 * m_inv) >> LIMB_BITS;
+    r = r - (dlimb_t)q * m - m * 2;
+    r1 = r >> LIMB_BITS;
+    t0 = (slimb_t)r1 >> 1;
+    r += m & t0;
+    r0 = r;
+    r1 = r >> LIMB_BITS;
+    r0 += m & r1;
+    return r0;
+}
+
+/* faster version using precomputed modulo inverse. 
+   precondition: 0 <= a * b < 2^(64+NTT_MOD_LOG2_MIN) */
+static inline limb_t mul_mod_fast(limb_t a, limb_t b, 
+                                    limb_t m, limb_t m_inv)
+{
+    dlimb_t r;
+    r = (dlimb_t)a * (dlimb_t)b;
+    return mod_fast(r, m, m_inv);
+}
+
+static inline limb_t init_mul_mod_fast(limb_t m)
+{
+    dlimb_t t;
+    assert(m < (limb_t)1 << NTT_MOD_LOG2_MAX);
+    assert(m >= (limb_t)1 << NTT_MOD_LOG2_MIN);
+    t = (dlimb_t)1 << (LIMB_BITS + NTT_MOD_LOG2_MIN);
+    return t / m;
+}
+
+/* Faster version used when the multiplier is constant. 0 <= a < 2^64,
+   0 <= b < m. */
+static inline limb_t mul_mod_fast2(limb_t a, limb_t b, 
+                                     limb_t m, limb_t b_inv)
+{
+    limb_t r, q;
+
+    q = ((dlimb_t)a * (dlimb_t)b_inv) >> LIMB_BITS;
+    r = a * b - q * m;
+    if (r >= m)
+        r -= m;
+    return r;
+}
+
+/* Faster version used when the multiplier is constant. 0 <= a < 2^64,
+   0 <= b < m. Let r = a * b mod m. The return value is 'r' or 'r +
+   m'. */
+static inline limb_t mul_mod_fast3(limb_t a, limb_t b, 
+                                     limb_t m, limb_t b_inv)
+{
+    limb_t r, q;
+
+    q = ((dlimb_t)a * (dlimb_t)b_inv) >> LIMB_BITS;
+    r = a * b - q * m;
+    return r;
+}
+
+static inline limb_t init_mul_mod_fast2(limb_t b, limb_t m)
+{
+    return ((dlimb_t)b << LIMB_BITS) / m;
+}
+
+#ifdef __AVX2__
+
+static inline limb_t ntt_limb_to_int(NTTLimb a, limb_t m)
+{
+    slimb_t v;
+    v = a;
+    if (v < 0)
+        v += m;
+    if (v >= m)
+        v -= m;
+    return v;
+}
+
+static inline NTTLimb int_to_ntt_limb(limb_t a, limb_t m)
+{
+    return (slimb_t)a;
+}
+
+static inline NTTLimb int_to_ntt_limb2(limb_t a, limb_t m)
+{
+    if (a >= (m / 2))
+        a -= m;
+    return (slimb_t)a;
+}
+
+/* return r + m if r < 0 otherwise r. */
+static inline __m256d ntt_mod1(__m256d r, __m256d m)
+{
+    return _mm256_blendv_pd(r, r + m, r);
+}
+
+/* input: abs(r) < 2 * m. Output: abs(r) < m */
+static inline __m256d ntt_mod(__m256d r, __m256d mf, __m256d m2f)
+{
+    return _mm256_blendv_pd(r, r + m2f, r) - mf;
+}
+
+/* input: abs(a*b) < 2 * m^2, output: abs(r) < m */
+static inline __m256d ntt_mul_mod(__m256d a, __m256d b, __m256d mf,
+                                  __m256d m_inv)
+{
+    __m256d r, q, ab1, ab0, qm0, qm1;
+    ab1 = a * b;
+    q = _mm256_round_pd(ab1 * m_inv, 0); /* round to nearest */
+    qm1 = q * mf;
+    qm0 = _mm256_fmsub_pd(q, mf, qm1); /* low part */
+    ab0 = _mm256_fmsub_pd(a, b, ab1); /* low part */
+    r = (ab1 - qm1) + (ab0 - qm0);
+    return r;
+}
+
+static void *bf_aligned_malloc(bf_context_t *s, size_t size, size_t align)
+{
+    void *ptr;
+    void **ptr1;
+    ptr = bf_malloc(s, size + sizeof(void *) + align - 1);
+    if (!ptr)
+        return NULL;
+    ptr1 = (void **)(((uintptr_t)ptr + sizeof(void *) + align - 1) &
+                     ~(align - 1));
+    ptr1[-1] = ptr;
+    return ptr1;
+}
+
+static void bf_aligned_free(bf_context_t *s, void *ptr)
+{
+    if (!ptr)
+        return;
+    bf_free(s, ((void **)ptr)[-1]);
+}
+
+static void *ntt_malloc(BFNTTState *s, size_t size)
+{
+    return bf_aligned_malloc(s->ctx, size, 64);
+}
+
+static void ntt_free(BFNTTState *s, void *ptr)
+{
+    bf_aligned_free(s->ctx, ptr);
+}
+
+static no_inline void ntt_fft(BFNTTState *s,
+                              NTTLimb *out_buf, NTTLimb *in_buf,
+                              NTTLimb *tmp_buf, int fft_len_log2,
+                              int inverse, int m_idx)
+{
+    limb_t nb_blocks, fft_per_block, p, k, n, stride_in, i, j;
+    NTTLimb *tab_in, *tab_out, *tmp, *trig;
+    __m256d m_inv, mf, m2f, c, a0, a1, b0, b1;
+    limb_t m;
+    int l;
+    
+    m = ntt_mods[m_idx];
+    
+    m_inv = _mm256_set1_pd(1.0 / (double)m);
+    mf = _mm256_set1_pd(m);
+    m2f = _mm256_set1_pd(m * 2);
+
+    n = (limb_t)1 << fft_len_log2;
+    assert(n >= 8);
+    stride_in = n / 2;
+
+    tab_in = in_buf;
+    tab_out = tmp_buf;
+    trig = get_trig(s, fft_len_log2, inverse, m_idx);
+    p = 0;
+    for(k = 0; k < stride_in; k += 4) {
+        a0 = _mm256_load_pd(&tab_in[k]);
+        a1 = _mm256_load_pd(&tab_in[k + stride_in]);
+        c = _mm256_load_pd(trig);
+        trig += 4;
+        b0 = ntt_mod(a0 + a1, mf, m2f);
+        b1 = ntt_mul_mod(a0 - a1, c, mf, m_inv);
+        a0 = _mm256_permute2f128_pd(b0, b1, 0x20);
+        a1 = _mm256_permute2f128_pd(b0, b1, 0x31);
+        a0 = _mm256_permute4x64_pd(a0, 0xd8);
+        a1 = _mm256_permute4x64_pd(a1, 0xd8);
+        _mm256_store_pd(&tab_out[p], a0);
+        _mm256_store_pd(&tab_out[p + 4], a1);
+        p += 2 * 4;
+    }
+    tmp = tab_in;
+    tab_in = tab_out;
+    tab_out = tmp;
+
+    trig = get_trig(s, fft_len_log2 - 1, inverse, m_idx);
+    p = 0;
+    for(k = 0; k < stride_in; k += 4) {
+        a0 = _mm256_load_pd(&tab_in[k]);
+        a1 = _mm256_load_pd(&tab_in[k + stride_in]);
+        c = _mm256_setr_pd(trig[0], trig[0], trig[1], trig[1]);
+        trig += 2;
+        b0 = ntt_mod(a0 + a1, mf, m2f);
+        b1 = ntt_mul_mod(a0 - a1, c, mf, m_inv);
+        a0 = _mm256_permute2f128_pd(b0, b1, 0x20);
+        a1 = _mm256_permute2f128_pd(b0, b1, 0x31);
+        _mm256_store_pd(&tab_out[p], a0);
+        _mm256_store_pd(&tab_out[p + 4], a1);
+        p += 2 * 4;
+    }
+    tmp = tab_in;
+    tab_in = tab_out;
+    tab_out = tmp;
+    
+    nb_blocks = n / 4;
+    fft_per_block = 4;
+
+    l = fft_len_log2 - 2;
+    while (nb_blocks != 2) {
+        nb_blocks >>= 1;
+        p = 0;
+        k = 0;
+        trig = get_trig(s, l, inverse, m_idx);
+        for(i = 0; i < nb_blocks; i++) {
+            c = _mm256_set1_pd(trig[0]);
+            trig++;
+            for(j = 0; j < fft_per_block; j += 4) {
+                a0 = _mm256_load_pd(&tab_in[k + j]);
+                a1 = _mm256_load_pd(&tab_in[k + j + stride_in]);
+                b0 = ntt_mod(a0 + a1, mf, m2f);
+                b1 = ntt_mul_mod(a0 - a1, c, mf, m_inv);
+                _mm256_store_pd(&tab_out[p + j], b0);
+                _mm256_store_pd(&tab_out[p + j + fft_per_block], b1);
+            }
+            k += fft_per_block;
+            p += 2 * fft_per_block;
+        }
+        fft_per_block <<= 1;
+        l--;
+        tmp = tab_in;
+        tab_in = tab_out;
+        tab_out = tmp;
+    }
+
+    tab_out = out_buf;
+    for(k = 0; k < stride_in; k += 4) {
+        a0 = _mm256_load_pd(&tab_in[k]);
+        a1 = _mm256_load_pd(&tab_in[k + stride_in]);
+        b0 = ntt_mod(a0 + a1, mf, m2f);
+        b1 = ntt_mod(a0 - a1, mf, m2f);
+        _mm256_store_pd(&tab_out[k], b0);
+        _mm256_store_pd(&tab_out[k + stride_in], b1);
+    }
+}
+
+static void ntt_vec_mul(BFNTTState *s,
+                        NTTLimb *tab1, NTTLimb *tab2, limb_t fft_len_log2,
+                        int k_tot, int m_idx)
+{
+    limb_t i, c_inv, n, m;
+    __m256d m_inv, mf, a, b, c;
+    
+    m = ntt_mods[m_idx];
+    c_inv = s->ntt_len_inv[m_idx][k_tot][0];
+    m_inv = _mm256_set1_pd(1.0 / (double)m);
+    mf = _mm256_set1_pd(m);
+    c = _mm256_set1_pd(int_to_ntt_limb(c_inv, m));
+    n = (limb_t)1 << fft_len_log2;
+    for(i = 0; i < n; i += 4) {
+        a = _mm256_load_pd(&tab1[i]);
+        b = _mm256_load_pd(&tab2[i]);
+        a = ntt_mul_mod(a, b, mf, m_inv);
+        a = ntt_mul_mod(a, c, mf, m_inv);
+        _mm256_store_pd(&tab1[i], a);
+    }
+}
+
+static no_inline void mul_trig(NTTLimb *buf,
+                               limb_t n, limb_t c1, limb_t m, limb_t m_inv1)
+{
+    limb_t i, c2, c3, c4;
+    __m256d c, c_mul, a0, mf, m_inv;
+    assert(n >= 2);
+    
+    mf = _mm256_set1_pd(m);
+    m_inv = _mm256_set1_pd(1.0 / (double)m);
+
+    c2 = mul_mod_fast(c1, c1, m, m_inv1);
+    c3 = mul_mod_fast(c2, c1, m, m_inv1);
+    c4 = mul_mod_fast(c2, c2, m, m_inv1);
+    c = _mm256_setr_pd(1, int_to_ntt_limb(c1, m),
+                       int_to_ntt_limb(c2, m), int_to_ntt_limb(c3, m));
+    c_mul = _mm256_set1_pd(int_to_ntt_limb(c4, m));
+    for(i = 0; i < n; i += 4) {
+        a0 = _mm256_load_pd(&buf[i]);
+        a0 = ntt_mul_mod(a0, c, mf, m_inv);
+        _mm256_store_pd(&buf[i], a0);
+        c = ntt_mul_mod(c, c_mul, mf, m_inv);
+    }
+}
+
+#else
+
+static void *ntt_malloc(BFNTTState *s, size_t size)
+{
+    return bf_malloc(s->ctx, size);
+}
+
+static void ntt_free(BFNTTState *s, void *ptr)
+{
+    bf_free(s->ctx, ptr);
+}
+
+static inline limb_t ntt_limb_to_int(NTTLimb a, limb_t m)
+{
+    if (a >= m)
+        a -= m;
+    return a;
+}
+
+static inline NTTLimb int_to_ntt_limb(slimb_t a, limb_t m)
+{
+    return a;
+}
+
+static no_inline void ntt_fft(BFNTTState *s, NTTLimb *out_buf, NTTLimb *in_buf,
+                              NTTLimb *tmp_buf, int fft_len_log2,
+                              int inverse, int m_idx)
+{
+    limb_t nb_blocks, fft_per_block, p, k, n, stride_in, i, j, m, m2;
+    NTTLimb *tab_in, *tab_out, *tmp, a0, a1, b0, b1, c, *trig, c_inv;
+    int l;
+    
+    m = ntt_mods[m_idx];
+    m2 = 2 * m;
+    n = (limb_t)1 << fft_len_log2;
+    nb_blocks = n;
+    fft_per_block = 1;
+    stride_in = n / 2;
+    tab_in = in_buf;
+    tab_out = tmp_buf;
+    l = fft_len_log2;
+    while (nb_blocks != 2) {
+        nb_blocks >>= 1;
+        p = 0;
+        k = 0;
+        trig = get_trig(s, l, inverse, m_idx);
+        for(i = 0; i < nb_blocks; i++) {
+            c = trig[0];
+            c_inv = trig[1];
+            trig += 2;
+            for(j = 0; j < fft_per_block; j++) {
+                a0 = tab_in[k + j];
+                a1 = tab_in[k + j + stride_in];
+                b0 = add_mod(a0, a1, m2);
+                b1 = a0 - a1 + m2;
+                b1 = mul_mod_fast3(b1, c, m, c_inv);
+                tab_out[p + j] = b0;
+                tab_out[p + j + fft_per_block] = b1;
+            }
+            k += fft_per_block;
+            p += 2 * fft_per_block;
+        }
+        fft_per_block <<= 1;
+        l--;
+        tmp = tab_in;
+        tab_in = tab_out;
+        tab_out = tmp;
+    }
+    /* no twiddle in last step */
+    tab_out = out_buf; 
+    for(k = 0; k < stride_in; k++) {
+        a0 = tab_in[k];
+        a1 = tab_in[k + stride_in];
+        b0 = add_mod(a0, a1, m2);
+        b1 = sub_mod(a0, a1, m2);
+        tab_out[k] = b0;
+        tab_out[k + stride_in] = b1;
+    }
+}
+
+static void ntt_vec_mul(BFNTTState *s,
+                        NTTLimb *tab1, NTTLimb *tab2, int fft_len_log2,
+                        int k_tot, int m_idx)
+{
+    limb_t i, norm, norm_inv, a, n, m, m_inv;
+    
+    m = ntt_mods[m_idx];
+    m_inv = s->ntt_mods_div[m_idx];
+    norm = s->ntt_len_inv[m_idx][k_tot][0];
+    norm_inv = s->ntt_len_inv[m_idx][k_tot][1];
+    n = (limb_t)1 << fft_len_log2;
+    for(i = 0; i < n; i++) {
+        a = tab1[i];
+        /* need to reduce the range so that the product is <
+           2^(LIMB_BITS+NTT_MOD_LOG2_MIN) */
+        if (a >= m)
+            a -= m;
+        a = mul_mod_fast(a, tab2[i], m, m_inv);
+        a = mul_mod_fast3(a, norm, m, norm_inv);
+        tab1[i] = a;
+    }
+}
+
+static no_inline void mul_trig(NTTLimb *buf,
+                               limb_t n, limb_t c_mul, limb_t m, limb_t m_inv)
+{
+    limb_t i, c0, c_mul_inv;
+    
+    c0 = 1;
+    c_mul_inv = init_mul_mod_fast2(c_mul, m);
+    for(i = 0; i < n; i++) {
+        buf[i] = mul_mod_fast(buf[i], c0, m, m_inv);
+        c0 = mul_mod_fast2(c0, c_mul, m, c_mul_inv);
+    }
+}
+
+#endif /* !AVX2 */
+
+static no_inline NTTLimb *get_trig(BFNTTState *s,
+                                   int k, int inverse1, int m_idx1)
+{
+    NTTLimb *tab;
+    limb_t i, n2, c, c_mul, m, c_mul_inv;
+    int m_idx, inverse;
+    
+    if (k > NTT_TRIG_K_MAX)
+        return NULL;
+
+    for(;;) {
+        tab = s->ntt_trig[m_idx1][inverse1][k];
+        if (tab)
+            return tab;
+        n2 = (limb_t)1 << (k - 1);
+        for(m_idx = 0; m_idx < NB_MODS; m_idx++) {
+            m = ntt_mods[m_idx];
+            for(inverse = 0; inverse < 2; inverse++) {
+#ifdef __AVX2__
+                tab = ntt_malloc(s, sizeof(NTTLimb) * n2);
+#else
+                tab = ntt_malloc(s, sizeof(NTTLimb) * n2 * 2);
+#endif
+                c = 1;
+                c_mul = s->ntt_proot_pow[m_idx][inverse][k];
+                c_mul_inv = s->ntt_proot_pow_inv[m_idx][inverse][k];
+                for(i = 0; i < n2; i++) {
+#ifdef __AVX2__
+                    tab[i] = int_to_ntt_limb2(c, m);
+#else
+                    tab[2 * i] = int_to_ntt_limb(c, m);
+                    tab[2 * i + 1] = init_mul_mod_fast2(c, m);
+#endif
+                    c = mul_mod_fast2(c, c_mul, m, c_mul_inv);
+                }
+                s->ntt_trig[m_idx][inverse][k] = tab;
+            }
+        }
+    }
+}
+
+void fft_clear_cache(bf_context_t *s1)
+{
+    int m_idx, inverse, k;
+    BFNTTState *s = s1->ntt_state;
+    if (s) {
+        for(m_idx = 0; m_idx < NB_MODS; m_idx++) {
+            for(inverse = 0; inverse < 2; inverse++) {
+                for(k = 0; k < NTT_TRIG_K_MAX + 1; k++) {
+                    if (s->ntt_trig[m_idx][inverse][k]) {
+                        ntt_free(s, s->ntt_trig[m_idx][inverse][k]);
+                        s->ntt_trig[m_idx][inverse][k] = NULL;
+                    }
+                }
+            }
+        }
+#if defined(__AVX2__)
+        bf_aligned_free(s1, s);
+#else
+        bf_free(s1, s);
+#endif
+        s1->ntt_state = NULL;
+    }
+}
+
+#define STRIP_LEN 16
+
+/* dst = buf1, src = buf2 */
+static void ntt_fft_partial(BFNTTState *s, NTTLimb *buf1,
+                            int k1, int k2, limb_t n1, limb_t n2, int inverse,
+                            limb_t m_idx)
+{
+    limb_t i, j, c_mul, c0, m, m_inv, strip_len, l;
+    NTTLimb *buf2, *buf3;
+    
+    buf3 = ntt_malloc(s, sizeof(NTTLimb) * n1);
+    if (k2 == 0) {
+        ntt_fft(s, buf1, buf1, buf3, k1, inverse, m_idx);
+    } else {
+        strip_len = STRIP_LEN;
+        buf2 = ntt_malloc(s, sizeof(NTTLimb) * n1 * strip_len);
+
+        m = ntt_mods[m_idx];
+        m_inv = s->ntt_mods_div[m_idx];
+        c0 = s->ntt_proot_pow[m_idx][inverse][k1 + k2];
+        c_mul = 1;
+        assert((n2 % strip_len) == 0);
+        for(j = 0; j < n2; j += strip_len) {
+            for(i = 0; i < n1; i++) {
+                for(l = 0; l < strip_len; l++) {
+                    buf2[i + l * n1] = buf1[i * n2 + (j + l)];
+                }
+            }
+            for(l = 0; l < strip_len; l++) {
+                if (inverse)
+                    mul_trig(buf2 + l * n1, n1, c_mul, m, m_inv);
+                ntt_fft(s, buf2 + l * n1, buf2 + l * n1, buf3, k1, inverse, m_idx);
+                if (!inverse)
+                    mul_trig(buf2 + l * n1, n1, c_mul, m, m_inv);
+                c_mul = mul_mod_fast(c_mul, c0, m, m_inv);
+            }
+            
+            for(i = 0; i < n1; i++) {
+                for(l = 0; l < strip_len; l++) {
+                    buf1[i * n2 + (j + l)] = buf2[i + l *n1];
+                }
+            }
+        }
+        ntt_free(s, buf2);
+    }
+    ntt_free(s, buf3);
+}
+
+
+/* dst = buf1, src = buf2, tmp = buf3 */
+static void ntt_conv(BFNTTState *s, NTTLimb *buf1, NTTLimb *buf2,
+                     int k, int k_tot, limb_t m_idx)
+{
+    limb_t n1, n2, i;
+    int k1, k2;
+    
+    if (k <= NTT_TRIG_K_MAX) {
+        k1 = k;
+    } else {
+        /* recursive split of the FFT */
+        k1 = bf_min(k / 2, NTT_TRIG_K_MAX);
+    }
+    k2 = k - k1;
+    n1 = (limb_t)1 << k1;
+    n2 = (limb_t)1 << k2;
+    
+    ntt_fft_partial(s, buf1, k1, k2, n1, n2, 0, m_idx);
+    ntt_fft_partial(s, buf2, k1, k2, n1, n2, 0, m_idx);
+    if (k2 == 0) {
+        ntt_vec_mul(s, buf1, buf2, k, k_tot, m_idx);
+    } else {
+        for(i = 0; i < n1; i++) {
+            ntt_conv(s, buf1 + i * n2, buf2 + i * n2, k2, k_tot, m_idx);
+        }
+    }
+    ntt_fft_partial(s, buf1, k1, k2, n1, n2, 1, m_idx);
+}
+
+
+static no_inline void limb_to_ntt(BFNTTState *s,
+                                  NTTLimb *tabr, limb_t fft_len,
+                                  const limb_t *taba, limb_t a_len, int dpl,
+                                  int first_m_idx, int nb_mods)
+{
+    slimb_t i, n;
+    dlimb_t a, b;
+    int j, shift;
+    limb_t base_mask1, a0, a1, a2, r, m, m_inv;
+    
+#if 0
+    for(i = 0; i < a_len; i++) {
+        printf("%" PRId64 ": " FMT_LIMB "\n",
+               (int64_t)i, taba[i]);
+    }
+#endif   
+    memset(tabr, 0, sizeof(NTTLimb) * fft_len * nb_mods);
+    shift = dpl & (LIMB_BITS - 1);
+    if (shift == 0)
+        base_mask1 = -1;
+    else
+        base_mask1 = ((limb_t)1 << shift) - 1;
+    n = bf_min(fft_len, (a_len * LIMB_BITS + dpl - 1) / dpl);
+    for(i = 0; i < n; i++) {
+        a0 = get_bits(taba, a_len, i * dpl);
+        if (dpl <= LIMB_BITS) {
+            a0 &= base_mask1;
+            a = a0;
+        } else {
+            a1 = get_bits(taba, a_len, i * dpl + LIMB_BITS);
+            if (dpl <= (LIMB_BITS + NTT_MOD_LOG2_MIN)) {
+                a = a0 | ((dlimb_t)(a1 & base_mask1) << LIMB_BITS);
+            } else {
+                if (dpl > 2 * LIMB_BITS) {
+                    a2 = get_bits(taba, a_len, i * dpl + LIMB_BITS * 2) &
+                        base_mask1;
+                } else {
+                    a1 &= base_mask1;
+                    a2 = 0;
+                }
+                //            printf("a=0x%016lx%016lx%016lx\n", a2, a1, a0);
+                a = (a0 >> (LIMB_BITS - NTT_MOD_LOG2_MAX + NTT_MOD_LOG2_MIN)) |
+                    ((dlimb_t)a1 << (NTT_MOD_LOG2_MAX - NTT_MOD_LOG2_MIN)) |
+                    ((dlimb_t)a2 << (LIMB_BITS + NTT_MOD_LOG2_MAX - NTT_MOD_LOG2_MIN));
+                a0 &= ((limb_t)1 << (LIMB_BITS - NTT_MOD_LOG2_MAX + NTT_MOD_LOG2_MIN)) - 1;
+            }
+        }
+        for(j = 0; j < nb_mods; j++) {
+            m = ntt_mods[first_m_idx + j];
+            m_inv = s->ntt_mods_div[first_m_idx + j];
+            r = mod_fast(a, m, m_inv);
+            if (dpl > (LIMB_BITS + NTT_MOD_LOG2_MIN)) {
+                b = ((dlimb_t)r << (LIMB_BITS - NTT_MOD_LOG2_MAX + NTT_MOD_LOG2_MIN)) | a0;
+                r = mod_fast(b, m, m_inv);
+            }
+            tabr[i + j * fft_len] = int_to_ntt_limb(r, m);
+        }
+    }
+}
+
+#if defined(__AVX2__)
+
+#define VEC_LEN 4
+
+typedef union {
+    __m256d v;
+    double d[4];
+} VecUnion;
+
+static no_inline void ntt_to_limb(BFNTTState *s, limb_t *tabr, limb_t r_len,
+                                  const NTTLimb *buf, int fft_len_log2, int dpl,
+                                  int nb_mods)
+{
+    const limb_t *mods = ntt_mods + NB_MODS - nb_mods;
+    const __m256d *mods_cr_vec, *mf, *m_inv;
+    VecUnion y[NB_MODS];
+    limb_t u[NB_MODS], carry[NB_MODS], fft_len, base_mask1, r;
+    slimb_t i, len, pos;
+    int j, k, l, shift, n_limb1, p;
+    dlimb_t t;
+        
+    j = NB_MODS * (NB_MODS - 1) / 2 - nb_mods * (nb_mods - 1) / 2;
+    mods_cr_vec = s->ntt_mods_cr_vec + j;
+    mf = s->ntt_mods_vec + NB_MODS - nb_mods;
+    m_inv = s->ntt_mods_inv_vec + NB_MODS - nb_mods;
+        
+    shift = dpl & (LIMB_BITS - 1);
+    if (shift == 0)
+        base_mask1 = -1;
+    else
+        base_mask1 = ((limb_t)1 << shift) - 1;
+    n_limb1 = ((unsigned)dpl - 1) / LIMB_BITS;
+    for(j = 0; j < NB_MODS; j++) 
+        carry[j] = 0;
+    for(j = 0; j < NB_MODS; j++) 
+        u[j] = 0; /* avoid warnings */
+    memset(tabr, 0, sizeof(limb_t) * r_len);
+    fft_len = (limb_t)1 << fft_len_log2;
+    len = bf_min(fft_len, (r_len * LIMB_BITS + dpl - 1) / dpl);
+    len = (len + VEC_LEN - 1) & ~(VEC_LEN - 1);
+    i = 0;
+    while (i < len) {
+        for(j = 0; j < nb_mods; j++)
+            y[j].v = *(__m256d *)&buf[i + fft_len * j];
+
+        /* Chinese remainder to get mixed radix representation */
+        l = 0;
+        for(j = 0; j < nb_mods - 1; j++) {
+            y[j].v = ntt_mod1(y[j].v, mf[j]);
+            for(k = j + 1; k < nb_mods; k++) {
+                y[k].v = ntt_mul_mod(y[k].v - y[j].v,
+                                     mods_cr_vec[l], mf[k], m_inv[k]);
+                l++;
+            }
+        }
+        y[j].v = ntt_mod1(y[j].v, mf[j]);
+        
+        for(p = 0; p < VEC_LEN; p++) {
+            /* back to normal representation */
+            u[0] = (int64_t)y[nb_mods - 1].d[p];
+            l = 1;
+            for(j = nb_mods - 2; j >= 1; j--) {
+                r = (int64_t)y[j].d[p];
+                for(k = 0; k < l; k++) {
+                    t = (dlimb_t)u[k] * mods[j] + r;
+                    r = t >> LIMB_BITS;
+                    u[k] = t;
+                }
+                u[l] = r;
+                l++;
+            }
+            /* XXX: for nb_mods = 5, l should be 4 */
+            
+            /* last step adds the carry */
+            r = (int64_t)y[0].d[p];
+            for(k = 0; k < l; k++) {
+                t = (dlimb_t)u[k] * mods[j] + r + carry[k];
+                r = t >> LIMB_BITS;
+                u[k] = t;
+            }
+            u[l] = r + carry[l];
+
+#if 0
+            printf("%" PRId64 ": ", i);
+            for(j = nb_mods - 1; j >= 0; j--) {
+                printf(" %019" PRIu64, u[j]);
+            }
+            printf("\n");
+#endif
+            
+            /* write the digits */
+            pos = i * dpl;
+            for(j = 0; j < n_limb1; j++) {
+                put_bits(tabr, r_len, pos, u[j]);
+                pos += LIMB_BITS;
+            }
+            put_bits(tabr, r_len, pos, u[n_limb1] & base_mask1);
+            /* shift by dpl digits and set the carry */
+            if (shift == 0) {
+                for(j = n_limb1 + 1; j < nb_mods; j++)
+                    carry[j - (n_limb1 + 1)] = u[j];
+            } else {
+                for(j = n_limb1; j < nb_mods - 1; j++) {
+                    carry[j - n_limb1] = (u[j] >> shift) |
+                        (u[j + 1] << (LIMB_BITS - shift));
+                }
+                carry[nb_mods - 1 - n_limb1] = u[nb_mods - 1] >> shift;
+            }
+            i++;
+        }
+    }
+}
+#else
+static no_inline void ntt_to_limb(BFNTTState *s, limb_t *tabr, limb_t r_len,
+                                  const NTTLimb *buf, int fft_len_log2, int dpl,
+                                  int nb_mods)
+{
+    const limb_t *mods = ntt_mods + NB_MODS - nb_mods;
+    const limb_t *mods_cr, *mods_cr_inv;
+    limb_t y[NB_MODS], u[NB_MODS], carry[NB_MODS], fft_len, base_mask1, r;
+    slimb_t i, len, pos;
+    int j, k, l, shift, n_limb1;
+    dlimb_t t;
+        
+    j = NB_MODS * (NB_MODS - 1) / 2 - nb_mods * (nb_mods - 1) / 2;
+    mods_cr = ntt_mods_cr + j;
+    mods_cr_inv = s->ntt_mods_cr_inv + j;
+
+    shift = dpl & (LIMB_BITS - 1);
+    if (shift == 0)
+        base_mask1 = -1;
+    else
+        base_mask1 = ((limb_t)1 << shift) - 1;
+    n_limb1 = ((unsigned)dpl - 1) / LIMB_BITS;
+    for(j = 0; j < NB_MODS; j++) 
+        carry[j] = 0;
+    for(j = 0; j < NB_MODS; j++) 
+        u[j] = 0; /* avoid warnings */
+    memset(tabr, 0, sizeof(limb_t) * r_len);
+    fft_len = (limb_t)1 << fft_len_log2;
+    len = bf_min(fft_len, (r_len * LIMB_BITS + dpl - 1) / dpl);
+    for(i = 0; i < len; i++) {
+        for(j = 0; j < nb_mods; j++)  {
+            y[j] = ntt_limb_to_int(buf[i + fft_len * j], mods[j]);
+        }
+
+        /* Chinese remainder to get mixed radix representation */
+        l = 0;
+        for(j = 0; j < nb_mods - 1; j++) {
+            for(k = j + 1; k < nb_mods; k++) {
+                limb_t m;
+                m = mods[k];
+                /* Note: there is no overflow in the sub_mod() because
+                   the modulos are sorted by increasing order */
+                y[k] = mul_mod_fast2(y[k] - y[j] + m, 
+                                     mods_cr[l], m, mods_cr_inv[l]);
+                l++;
+            }
+        }
+        
+        /* back to normal representation */
+        u[0] = y[nb_mods - 1];
+        l = 1;
+        for(j = nb_mods - 2; j >= 1; j--) {
+            r = y[j];
+            for(k = 0; k < l; k++) {
+                t = (dlimb_t)u[k] * mods[j] + r;
+                r = t >> LIMB_BITS;
+                u[k] = t;
+            }
+            u[l] = r;
+            l++;
+        }
+        
+        /* last step adds the carry */
+        r = y[0];
+        for(k = 0; k < l; k++) {
+            t = (dlimb_t)u[k] * mods[j] + r + carry[k];
+            r = t >> LIMB_BITS;
+            u[k] = t;
+        }
+        u[l] = r + carry[l];
+
+#if 0
+        printf("%" PRId64 ": ", (int64_t)i);
+        for(j = nb_mods - 1; j >= 0; j--) {
+            printf(" " FMT_LIMB, u[j]);
+        }
+        printf("\n");
+#endif
+        
+        /* write the digits */
+        pos = i * dpl;
+        for(j = 0; j < n_limb1; j++) {
+            put_bits(tabr, r_len, pos, u[j]);
+            pos += LIMB_BITS;
+        }
+        put_bits(tabr, r_len, pos, u[n_limb1] & base_mask1);
+        /* shift by dpl digits and set the carry */
+        if (shift == 0) {
+            for(j = n_limb1 + 1; j < nb_mods; j++)
+                carry[j - (n_limb1 + 1)] = u[j];
+        } else {
+            for(j = n_limb1; j < nb_mods - 1; j++) {
+                carry[j - n_limb1] = (u[j] >> shift) |
+                    (u[j + 1] << (LIMB_BITS - shift));
+            }
+            carry[nb_mods - 1 - n_limb1] = u[nb_mods - 1] >> shift;
+        }
+    }
+}
+#endif
+
+static int ntt_static_init(bf_context_t *s1)
+{
+    BFNTTState *s;
+    int inverse, i, j, k, l;
+    limb_t c, c_inv, c_inv2, m, m_inv;
+
+    if (s1->ntt_state)
+        return 0;
+#if defined(__AVX2__)
+    s = bf_aligned_malloc(s1, sizeof(*s), 64);
+#else
+    s = bf_malloc(s1, sizeof(*s));
+#endif
+    if (!s)
+        return -1;
+    memset(s, 0, sizeof(*s));
+    s1->ntt_state = s;
+    s->ctx = s1;
+    
+    for(j = 0; j < NB_MODS; j++) {
+        m = ntt_mods[j];
+        m_inv = init_mul_mod_fast(m);
+        s->ntt_mods_div[j] = m_inv;
+#if defined(__AVX2__)
+        s->ntt_mods_vec[j] = _mm256_set1_pd(m);
+        s->ntt_mods_inv_vec[j] = _mm256_set1_pd(1.0 / (double)m);
+#endif
+        c_inv2 = (m + 1) / 2; /* 1/2 */
+        c_inv = 1;
+        for(i = 0; i <= NTT_PROOT_2EXP; i++) {
+            s->ntt_len_inv[j][i][0] = c_inv;
+            s->ntt_len_inv[j][i][1] = init_mul_mod_fast2(c_inv, m);
+            c_inv = mul_mod_fast(c_inv, c_inv2, m, m_inv);
+        }
+
+        for(inverse = 0; inverse < 2; inverse++) {
+            c = ntt_proot[inverse][j];
+            for(i = 0; i < NTT_PROOT_2EXP; i++) {
+                s->ntt_proot_pow[j][inverse][NTT_PROOT_2EXP - i] = c;
+                s->ntt_proot_pow_inv[j][inverse][NTT_PROOT_2EXP - i] =
+                    init_mul_mod_fast2(c, m);
+                c = mul_mod_fast(c, c, m, m_inv);
+            }
+        }
+    }
+
+    l = 0;
+    for(j = 0; j < NB_MODS - 1; j++) {
+        for(k = j + 1; k < NB_MODS; k++) {
+#if defined(__AVX2__)
+            s->ntt_mods_cr_vec[l] = _mm256_set1_pd(int_to_ntt_limb2(ntt_mods_cr[l],
+                                                                    ntt_mods[k]));
+#else
+            s->ntt_mods_cr_inv[l] = init_mul_mod_fast2(ntt_mods_cr[l],
+                                                       ntt_mods[k]);
+#endif
+            l++;
+        }
+    }
+    return 0;
+}
+
+int bf_get_fft_size(int *pdpl, int *pnb_mods, limb_t len)
+{
+    int dpl, fft_len_log2, n_bits, nb_mods, dpl_found, fft_len_log2_found;
+    int int_bits, nb_mods_found;
+    limb_t cost, min_cost;
+    
+    min_cost = -1;
+    dpl_found = 0;
+    nb_mods_found = 4;
+    fft_len_log2_found = 0;
+    for(nb_mods = 3; nb_mods <= NB_MODS; nb_mods++) {
+        int_bits = ntt_int_bits[NB_MODS - nb_mods];
+        dpl = bf_min((int_bits - 4) / 2,
+                     2 * LIMB_BITS + 2 * NTT_MOD_LOG2_MIN - NTT_MOD_LOG2_MAX);
+        for(;;) {
+            fft_len_log2 = ceil_log2((len * LIMB_BITS + dpl - 1) / dpl);
+            if (fft_len_log2 > NTT_PROOT_2EXP)
+                goto next;
+            n_bits = fft_len_log2 + 2 * dpl;
+            if (n_bits <= int_bits) {
+                cost = ((limb_t)(fft_len_log2 + 1) << fft_len_log2) * nb_mods;
+                //                printf("n=%d dpl=%d: cost=%" PRId64 "\n", nb_mods, dpl, (int64_t)cost);
+                if (cost < min_cost) {
+                    min_cost = cost;
+                    dpl_found = dpl;
+                    nb_mods_found = nb_mods;
+                    fft_len_log2_found = fft_len_log2;
+                }
+                break;
+            }
+            dpl--;
+            if (dpl == 0)
+                break;
+        }
+    next: ;
+    }
+    if (!dpl_found)
+        abort();
+    /* limit dpl if possible to reduce fixed cost of limb/NTT conversion */
+    if (dpl_found > (LIMB_BITS + NTT_MOD_LOG2_MIN) &&
+        ((limb_t)(LIMB_BITS + NTT_MOD_LOG2_MIN) << fft_len_log2_found) >=
+        len * LIMB_BITS) {
+        dpl_found = LIMB_BITS + NTT_MOD_LOG2_MIN;
+    }
+    *pnb_mods = nb_mods_found;
+    *pdpl = dpl_found;
+    return fft_len_log2_found;
+}
+
+static no_inline void fft_mul(bf_t *res, limb_t *a_tab, limb_t a_len,
+                              limb_t *b_tab, limb_t b_len, int mul_flags)
+{
+    bf_context_t *s1 = res->ctx;
+    BFNTTState *s;
+    int dpl, fft_len_log2, j, nb_mods, reduced_mem;
+    slimb_t len, fft_len;
+    NTTLimb *buf1, *buf2, *ptr;
+#if defined(USE_MUL_CHECK)
+    limb_t ha, hb, hr, h_ref;
+#endif
+    
+    ntt_static_init(s1);
+    s = s1->ntt_state;
+    
+    /* find the optimal number of digits per limb (dpl) */
+    len = a_len + b_len;
+    fft_len_log2 = bf_get_fft_size(&dpl, &nb_mods, len);
+    fft_len = (uint64_t)1 << fft_len_log2;
+    //    printf("len=%" PRId64 " fft_len_log2=%d dpl=%d\n", len, fft_len_log2, dpl);
+#if defined(USE_MUL_CHECK)
+    ha = mp_mod1(a_tab, a_len, BF_CHKSUM_MOD, 0);
+    hb = mp_mod1(b_tab, b_len, BF_CHKSUM_MOD, 0);
+#endif
+    if ((mul_flags & (FFT_MUL_R_OVERLAP_A | FFT_MUL_R_OVERLAP_B)) == 0) {
+        bf_resize(res, 0);
+    } else if (mul_flags & FFT_MUL_R_OVERLAP_B) {
+        limb_t *tmp_tab, tmp_len;
+        /* it is better to free 'b' first */
+        tmp_tab = a_tab;
+        a_tab = b_tab;
+        b_tab = tmp_tab;
+        tmp_len = a_len;
+        a_len = b_len;
+        b_len = tmp_len;
+    }
+    buf1 = ntt_malloc(s, sizeof(NTTLimb) * fft_len * nb_mods);
+    limb_to_ntt(s, buf1, fft_len, a_tab, a_len, dpl,
+                NB_MODS - nb_mods, nb_mods);
+    if ((mul_flags & (FFT_MUL_R_OVERLAP_A | FFT_MUL_R_OVERLAP_B)) == 
+        FFT_MUL_R_OVERLAP_A) {
+        bf_resize(res, 0);
+    }
+    reduced_mem = (fft_len_log2 >= 14);
+    if (!reduced_mem) {
+        buf2 = ntt_malloc(s, sizeof(NTTLimb) * fft_len * nb_mods);
+        limb_to_ntt(s, buf2, fft_len, b_tab, b_len, dpl,
+                    NB_MODS - nb_mods, nb_mods);
+        bf_resize(res, 0); /* in case res == b */
+    } else {
+        buf2 = ntt_malloc(s, sizeof(NTTLimb) * fft_len);
+    }
+    for(j = 0; j < nb_mods; j++) {
+        if (reduced_mem) {
+            limb_to_ntt(s, buf2, fft_len, b_tab, b_len, dpl,
+                        NB_MODS - nb_mods + j, 1);
+            ptr = buf2;
+        } else {
+            ptr = buf2 + fft_len * j;
+        }
+        ntt_conv(s, buf1 + fft_len * j, ptr,
+                 fft_len_log2, fft_len_log2, j + NB_MODS - nb_mods);
+    }
+    bf_resize(res, 0); /* in case res == b and reduced mem */
+    ntt_free(s, buf2);
+    bf_resize(res, len);
+    ntt_to_limb(s, res->tab, len, buf1, fft_len_log2, dpl, nb_mods);
+    ntt_free(s, buf1);
+#if defined(USE_MUL_CHECK)
+    hr = mp_mod1(res->tab, len, BF_CHKSUM_MOD, 0);
+    h_ref = mul_mod(ha, hb, BF_CHKSUM_MOD);
+    if (hr != h_ref) {
+        printf("ntt_mul_error: len=%" PRId_LIMB " fft_len_log2=%d dpl=%d nb_mods=%d\n",
+               len, fft_len_log2, dpl, nb_mods);
+        //        printf("ha=0x" FMT_LIMB" hb=0x" FMT_LIMB " hr=0x" FMT_LIMB " expected=0x" FMT_LIMB "\n", ha, hb, hr, h_ref);
+        exit(1);
+    }
+#endif    
+}
+
+#else /* USE_FFT_MUL */
+
+int bf_get_fft_size(int *pdpl, int *pnb_mods, limb_t len)
+{
+    return 0;
+}
+
+#endif /* !USE_FFT_MUL */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libbf.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libbf.h
new file mode 100755
index 00000000..e73b51d9
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libbf.h
@@ -0,0 +1,350 @@
+/*
+ * Tiny arbitrary precision floating point library
+ * 
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#ifndef LIBBF_H
+#define LIBBF_H
+
+#include <stddef.h>
+#include <stdint.h>
+
+#if defined(__x86_64__)
+#define LIMB_LOG2_BITS 6
+#else
+#define LIMB_LOG2_BITS 5
+#endif
+
+#define LIMB_BITS (1 << LIMB_LOG2_BITS)
+
+#if LIMB_BITS == 64
+typedef __int128 int128_t;
+typedef unsigned __int128 uint128_t;
+typedef int64_t slimb_t;
+typedef uint64_t limb_t;
+typedef uint128_t dlimb_t;
+#define EXP_MIN INT64_MIN
+#define EXP_MAX INT64_MAX
+
+#else
+
+typedef int32_t slimb_t;
+typedef uint32_t limb_t;
+typedef uint64_t dlimb_t;
+#define EXP_MIN INT32_MIN
+#define EXP_MAX INT32_MAX
+
+#endif
+
+/* in bits */
+#define BF_EXP_BITS_MIN 3
+#define BF_EXP_BITS_MAX (LIMB_BITS - 2)
+#define BF_PREC_MIN 2
+#define BF_PREC_MAX (((limb_t)1 << BF_EXP_BITS_MAX) - 2)
+#define BF_PREC_INF (BF_PREC_MAX + 1) /* infinite precision */
+
+#if LIMB_BITS == 64
+#define BF_CHKSUM_MOD (UINT64_C(975620677) * UINT64_C(9795002197))
+#else
+#define BF_CHKSUM_MOD 975620677U
+#endif
+
+#define BF_EXP_ZERO EXP_MIN
+#define BF_EXP_INF (EXP_MAX - 1)
+#define BF_EXP_NAN EXP_MAX
+
+/* +/-zero is represented with expn = BF_EXP_ZERO and len = 0,
+   +/-infinity is represented with expn = BF_EXP_INF and len = 0,
+   NaN is represented with expn = BF_EXP_NAN and len = 0 (sign is ignored)
+ */
+typedef struct {
+    struct bf_context_t *ctx;
+    int sign;
+    slimb_t expn;
+    limb_t len;
+    limb_t *tab;
+} bf_t;
+
+typedef enum {
+    BF_RNDN, /* round to nearest, ties to even */
+    BF_RNDZ, /* round to zero */
+    BF_RNDD, /* round to -inf */
+    BF_RNDU, /* round to +inf */
+    BF_RNDNA, /* round to nearest, ties away from zero */
+    BF_RNDNU, /* round to nearest, ties to +inf */
+    BF_RNDF, /* faithful rounding (nondeterministic, either RNDD or RNDU,
+                inexact flag is always set)  */
+} bf_rnd_t;
+
+/* allow subnormal numbers (only available if the number of exponent
+   bits is < BF_EXP_BITS_MAX and prec != BF_PREC_INF) */
+#define BF_FLAG_SUBNORMAL (1 << 3)
+
+#define BF_RND_MASK 0x7
+#define BF_EXP_BITS_SHIFT 4
+#define BF_EXP_BITS_MASK 0x3f
+
+/* contains the rounding mode and number of exponents bits */
+typedef uint32_t bf_flags_t;
+
+typedef void *bf_realloc_func_t(void *opaque, void *ptr, size_t size);
+
+typedef struct {
+    bf_t val;
+    limb_t prec;
+} BFConstCache;
+
+typedef struct bf_context_t {
+    void *realloc_opaque;
+    bf_realloc_func_t *realloc_func;
+    BFConstCache log2_cache;
+    BFConstCache pi_cache;
+    struct BFNTTState *ntt_state;
+} bf_context_t;
+
+static inline int bf_get_exp_bits(bf_flags_t flags)
+{
+    return BF_EXP_BITS_MAX - ((flags >> BF_EXP_BITS_SHIFT) & BF_EXP_BITS_MASK);
+}
+
+static inline bf_flags_t bf_set_exp_bits(int n)
+{
+    return (BF_EXP_BITS_MAX - n) << BF_EXP_BITS_SHIFT;
+}
+
+/* returned status */
+#define BF_ST_INVALID_OP  (1 << 0)
+#define BF_ST_DIVIDE_ZERO (1 << 1)
+#define BF_ST_OVERFLOW    (1 << 2)
+#define BF_ST_UNDERFLOW   (1 << 3)
+#define BF_ST_INEXACT     (1 << 4)
+/* not used yet, indicate that a memory allocation error occured. NaN
+   is returned */
+#define BF_ST_MEM_ERROR   (1 << 5) 
+
+#define BF_RADIX_MAX 36 /* maximum radix for bf_atof() and bf_ftoa() */
+
+static inline slimb_t bf_max(slimb_t a, slimb_t b)
+{
+    if (a > b)
+        return a;
+    else
+        return b;
+}
+
+static inline slimb_t bf_min(slimb_t a, slimb_t b)
+{
+    if (a < b)
+        return a;
+    else
+        return b;
+}
+
+void bf_context_init(bf_context_t *s, bf_realloc_func_t *realloc_func,
+                     void *realloc_opaque);
+void bf_context_end(bf_context_t *s);
+/* free memory allocated for the bf cache data */
+void bf_clear_cache(bf_context_t *s);
+
+static inline void *bf_realloc(bf_context_t *s, void *ptr, size_t size)
+{
+    return s->realloc_func(s->realloc_opaque, ptr, size);
+}
+
+void bf_init(bf_context_t *s, bf_t *r);
+
+static inline void bf_delete(bf_t *r)
+{
+    bf_context_t *s = r->ctx;
+    /* we accept to delete a zeroed bf_t structure */
+    if (s) {
+        bf_realloc(s, r->tab, 0);
+    }
+}
+
+static inline void bf_neg(bf_t *r)
+{
+    r->sign ^= 1;
+}
+
+static inline int bf_is_finite(const bf_t *a)
+{
+    return (a->expn < BF_EXP_INF);
+}
+
+static inline int bf_is_nan(const bf_t *a)
+{
+    return (a->expn == BF_EXP_NAN);
+}
+
+static inline int bf_is_zero(const bf_t *a)
+{
+    return (a->expn == BF_EXP_ZERO);
+}
+
+void bf_set_ui(bf_t *r, uint64_t a);
+void bf_set_si(bf_t *r, int64_t a);
+void bf_set_nan(bf_t *r);
+void bf_set_zero(bf_t *r, int is_neg);
+void bf_set_inf(bf_t *r, int is_neg);
+void bf_set(bf_t *r, const bf_t *a);
+void bf_move(bf_t *r, bf_t *a);
+int bf_get_float64(const bf_t *a, double *pres, bf_rnd_t rnd_mode);
+void bf_set_float64(bf_t *a, double d);
+
+int bf_cmpu(const bf_t *a, const bf_t *b);
+int bf_cmp_full(const bf_t *a, const bf_t *b);
+int bf_cmp_eq(const bf_t *a, const bf_t *b);
+int bf_cmp_le(const bf_t *a, const bf_t *b);
+int bf_cmp_lt(const bf_t *a, const bf_t *b);
+int bf_add(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec, bf_flags_t flags);
+int bf_sub(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec, bf_flags_t flags);
+int bf_add_si(bf_t *r, const bf_t *a, int64_t b1, limb_t prec, bf_flags_t flags);
+int bf_mul(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec, bf_flags_t flags);
+int bf_mul_ui(bf_t *r, const bf_t *a, uint64_t b1, limb_t prec, bf_flags_t flags);
+int bf_mul_si(bf_t *r, const bf_t *a, int64_t b1, limb_t prec, 
+              bf_flags_t flags);
+int bf_mul_2exp(bf_t *r, slimb_t e, limb_t prec, bf_flags_t flags);
+int bf_div(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec, bf_flags_t flags);
+#define BF_DIVREM_EUCLIDIAN BF_RNDF
+int bf_divrem(bf_t *q, bf_t *r, const bf_t *a, const bf_t *b,
+              limb_t prec, bf_flags_t flags, int rnd_mode);
+int bf_fmod(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+            bf_flags_t flags);
+int bf_remainder(bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+                 bf_flags_t flags);
+int bf_remquo(slimb_t *pq, bf_t *r, const bf_t *a, const bf_t *b, limb_t prec,
+              bf_flags_t flags);
+int bf_pow_ui(bf_t *r, const bf_t *a, limb_t b, limb_t prec,
+              bf_flags_t flags);
+int bf_pow_ui_ui(bf_t *r, limb_t a1, limb_t b, limb_t prec, bf_flags_t flags);
+int bf_rint(bf_t *r, limb_t prec, bf_flags_t flags);
+int bf_round(bf_t *r, limb_t prec, bf_flags_t flags);
+int bf_sqrtrem(bf_t *r, bf_t *rem1, const bf_t *a);
+int bf_sqrt(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags);
+slimb_t bf_get_exp_min(const bf_t *a);
+void bf_logic_or(bf_t *r, const bf_t *a, const bf_t *b);
+void bf_logic_xor(bf_t *r, const bf_t *a, const bf_t *b);
+void bf_logic_and(bf_t *r, const bf_t *a, const bf_t *b);
+
+/* additional flags for bf_atof */
+/* do not accept hex radix prefix (0x or 0X) if radix = 0 or radix = 16 */
+#define BF_ATOF_NO_HEX       (1 << 16)
+/* accept binary (0b or 0B) or octal (0o or 0O) radix prefix if radix = 0 */
+#define BF_ATOF_BIN_OCT      (1 << 17)
+/* Only accept integers (no decimal point, no exponent, no infinity nor NaN */
+#define BF_ATOF_INT_ONLY     (1 << 18)
+/* Do not accept radix prefix after sign  */
+#define BF_ATOF_NO_PREFIX_AFTER_SIGN (1 << 19)
+/* Do not parse NaN and parse case sensitive 'Infinity' */
+#define BF_ATOF_JS_QUIRKS    (1 << 20)
+/* Do not round integers to the indicated precision */
+#define BF_ATOF_INT_PREC_INF (1 << 21)
+/* Support legacy octal syntax for well formed numbers */
+#define BF_ATOF_LEGACY_OCTAL (1 << 22)
+/* accept _ between digits as a digit separator */
+#define BF_ATOF_UNDERSCORE_SEP (1 << 23)
+/* if a 'n' suffix is present, force integer parsing (XXX: remove) */
+#define BF_ATOF_INT_N_SUFFIX   (1 << 24)
+/* if set return NaN if empty number string (instead of 0) */
+#define BF_ATOF_NAN_IF_EMPTY   (1 << 25)
+/* only accept decimal floating point if radix = 0 */
+#define BF_ATOF_ONLY_DEC_FLOAT (1 << 26)
+
+/* one more return flag: indicate that the parsed number is an integer
+   (only set when the flags BF_ATOF_INT_PREC_INF or
+   BF_ATOF_INT_N_SUFFIX are used) */
+#define BF_ATOF_ST_INTEGER   (1 << 5)
+
+int bf_atof(bf_t *a, const char *str, const char **pnext, int radix,
+            limb_t prec, bf_flags_t flags);
+/* this version accepts prec = BF_PREC_INF and returns the radix
+   exponent */
+int bf_atof2(bf_t *r, slimb_t *pexponent,
+             const char *str, const char **pnext, int radix,
+             limb_t prec, bf_flags_t flags);
+int bf_mul_pow_radix(bf_t *r, const bf_t *T, limb_t radix,
+                     slimb_t expn, limb_t prec, bf_flags_t flags);
+
+#define BF_FTOA_FORMAT_MASK (3 << 16)
+/* fixed format: prec significant digits rounded with (flags &
+   BF_RND_MASK). Exponential notation is used if too many zeros are
+   needed. */
+#define BF_FTOA_FORMAT_FIXED (0 << 16)
+/* fractional format: prec digits after the decimal point rounded with
+   (flags & BF_RND_MASK) */
+#define BF_FTOA_FORMAT_FRAC  (1 << 16)
+/* free format: use as many digits as necessary so that bf_atof()
+   return the same number when using precision 'prec', rounding to
+   nearest and the subnormal+exponent configuration of 'flags'. The
+   result is meaningful only if 'a' is already rounded to the wanted
+   precision.
+   
+   Infinite precision (BF_PREC_INF) is supported when the radix is a
+   power of two. */
+#define BF_FTOA_FORMAT_FREE  (2 << 16)
+/* same as BF_FTOA_FORMAT_FREE but uses the minimum number of digits
+   (takes more computation time). */
+#define BF_FTOA_FORMAT_FREE_MIN (3 << 16)
+
+/* force exponential notation for fixed or free format */
+#define BF_FTOA_FORCE_EXP    (1 << 20)
+/* add 0x prefix for base 16, 0o prefix for base 8 or 0b prefix for
+   base 2 if non zero value */
+#define BF_FTOA_ADD_PREFIX   (1 << 21)
+#define BF_FTOA_JS_QUIRKS    (1 << 22)
+
+size_t bf_ftoa(char **pbuf, const bf_t *a, int radix, limb_t prec,
+               bf_flags_t flags);
+
+/* modulo 2^n instead of saturation. NaN and infinity return 0 */
+#define BF_GET_INT_MOD (1 << 0) 
+int bf_get_int32(int *pres, const bf_t *a, int flags);
+int bf_get_int64(int64_t *pres, const bf_t *a, int flags);
+
+/* the following functions are exported for testing only. */
+void bf_print_str(const char *str, const bf_t *a);
+void bf_resize(bf_t *r, limb_t len);
+int bf_get_fft_size(int *pdpl, int *pnb_mods, limb_t len);
+void bf_recip(bf_t *r, const bf_t *a, limb_t prec);
+void bf_rsqrt(bf_t *a, const bf_t *x, limb_t prec);
+int bf_normalize_and_round(bf_t *r, limb_t prec1, bf_flags_t flags);
+int bf_can_round(const bf_t *a, slimb_t prec, bf_rnd_t rnd_mode, slimb_t k);
+slimb_t bf_mul_log2_radix(slimb_t a1, unsigned int radix, int is_inv,
+                          int is_ceil1);
+
+/* transcendental functions */
+int bf_const_log2(bf_t *T, limb_t prec, bf_flags_t flags);
+int bf_const_pi(bf_t *T, limb_t prec, bf_flags_t flags);
+int bf_exp(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags);
+int bf_log(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags);
+#define BF_POW_JS_QUICKS (1 << 16)
+int bf_pow(bf_t *r, const bf_t *x, const bf_t *y, limb_t prec, bf_flags_t flags);
+int bf_cos(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags);
+int bf_sin(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags);
+int bf_tan(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags);
+int bf_atan(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags);
+int bf_atan2(bf_t *r, const bf_t *y, const bf_t *x,
+             limb_t prec, bf_flags_t flags);
+int bf_asin(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags);
+int bf_acos(bf_t *r, const bf_t *a, limb_t prec, bf_flags_t flags);
+
+#endif /* LIBBF_H */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp-opcode.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp-opcode.h
new file mode 100755
index 00000000..f90c23b3
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp-opcode.h
@@ -0,0 +1,58 @@
+/*
+ * Regular Expression Engine
+ * 
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+
+#ifdef DEF
+
+DEF(invalid, 1) /* never used */
+DEF(char, 3)
+DEF(char32, 5)
+DEF(dot, 1)
+DEF(any, 1) /* same as dot but match any character including line terminator */
+DEF(line_start, 1)
+DEF(line_end, 1)
+DEF(goto, 5)
+DEF(split_goto_first, 5)
+DEF(split_next_first, 5)
+DEF(match, 1)
+DEF(save_start, 2) /* save start position */
+DEF(save_end, 2) /* save end position, must come after saved_start */
+DEF(save_reset, 3) /* reset save positions */
+DEF(loop, 5) /* decrement the top the stack and goto if != 0 */
+DEF(push_i32, 5) /* push integer on the stack */
+DEF(drop, 1)
+DEF(word_boundary, 1)
+DEF(not_word_boundary, 1)
+DEF(back_reference, 2)
+DEF(backward_back_reference, 2) /* must come after back_reference */
+DEF(range, 3) /* variable length */
+DEF(range32, 3) /* variable length */
+DEF(lookahead, 5)
+DEF(negative_lookahead, 5)
+DEF(push_char_pos, 1) /* push the character position on the stack */
+DEF(bne_char_pos, 5) /* pop one stack element and jump if equal to the character
+ position */
+DEF(prev, 1) /* go to the previous char */
+DEF(simple_greedy_quant, 17)
+
+#endif /* DEF */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp.c
new file mode 100755
index 00000000..757212a9
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp.c
@@ -0,0 +1,2567 @@
+/*
+ * Regular Expression Engine
+ * 
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include <stdlib.h>
+#include <stdio.h>
+#include <stdarg.h>
+#include <inttypes.h>
+#include <string.h>
+#include <assert.h>
+
+#include "cutils.h"
+#include "libregexp.h"
+
+/*
+  TODO:
+
+  - Add full unicode canonicalize rules for character ranges (not
+    really useful but needed for exact "ignorecase" compatibility).
+
+  - Add a lock step execution mode (=linear time execution guaranteed)
+    when the regular expression is "simple" i.e. no backreference nor
+    complicated lookahead. The opcodes are designed for this execution
+    model.
+*/
+
+#if defined(TEST)
+#define DUMP_REOP
+#endif
+
+typedef enum {
+#define DEF(id, size) REOP_ ## id,
+#include "libregexp-opcode.h"
+#undef DEF
+    REOP_COUNT,
+} REOPCodeEnum;
+
+#define CAPTURE_COUNT_MAX 255
+#define STACK_SIZE_MAX 255
+
+/* unicode code points */
+#define CP_LS   0x2028
+#define CP_PS   0x2029
+
+#define TMP_BUF_SIZE 128
+
+typedef struct {
+    DynBuf byte_code;
+    const uint8_t *buf_ptr;
+    const uint8_t *buf_end;
+    const uint8_t *buf_start;
+    int re_flags;
+    BOOL is_utf16;
+    BOOL ignore_case;
+    BOOL dotall;
+    int capture_count;
+    int total_capture_count; /* -1 = not computed yet */
+    int has_named_captures; /* -1 = don't know, 0 = no, 1 = yes */
+    void *mem_opaque;
+    DynBuf group_names;
+    union {
+        char error_msg[TMP_BUF_SIZE];
+        char tmp_buf[TMP_BUF_SIZE];
+    } u;
+} REParseState;
+
+typedef struct {
+#ifdef DUMP_REOP
+    const char *name;
+#endif
+    uint8_t size;
+} REOpCode;
+
+static const REOpCode reopcode_info[REOP_COUNT] = {
+#ifdef DUMP_REOP
+#define DEF(id, size) { #id, size },
+#else
+#define DEF(id, size) { size },
+#endif
+#include "libregexp-opcode.h"
+#undef DEF
+};
+
+#define RE_HEADER_FLAGS         0
+#define RE_HEADER_CAPTURE_COUNT 1
+#define RE_HEADER_STACK_SIZE    2
+
+#define RE_HEADER_LEN 7
+
+static inline int is_digit(int c) {
+    return c >= '0' && c <= '9';
+}
+
+/* insert 'len' bytes at position 'pos' */
+static void dbuf_insert(DynBuf *s, int pos, int len)
+{
+    dbuf_realloc(s, s->size + len);
+    memmove(s->buf + pos + len, s->buf + pos, s->size - pos);
+    s->size += len;
+}
+
+/* canonicalize with the specific JS regexp rules */
+static uint32_t lre_canonicalize(uint32_t c, BOOL is_utf16)
+{
+    uint32_t res[LRE_CC_RES_LEN_MAX];
+    int len;
+    if (is_utf16) {
+        if (likely(c < 128)) {
+            if (c >= 'A' && c <= 'Z')
+                c = c - 'A' + 'a';
+        } else {
+            lre_case_conv(res, c, 2);
+            c = res[0];
+        }
+    } else {
+        if (likely(c < 128)) {
+            if (c >= 'a' && c <= 'z')
+                c = c - 'a' + 'A';
+        } else {
+            /* legacy regexp: to upper case if single char >= 128 */
+            len = lre_case_conv(res, c, FALSE);
+            if (len == 1 && res[0] >= 128)
+                c = res[0];
+        }
+    }
+    return c;
+}
+
+static const uint16_t char_range_d[] = {
+    1,
+    0x0030, 0x0039 + 1,
+};
+
+/* code point ranges for Zs,Zl or Zp property */
+static const uint16_t char_range_s[] = {
+    10,
+    0x0009, 0x000D + 1,
+    0x0020, 0x0020 + 1,
+    0x00A0, 0x00A0 + 1,
+    0x1680, 0x1680 + 1,
+    0x2000, 0x200A + 1,
+    /* 2028;LINE SEPARATOR;Zl;0;WS;;;;;N;;;;; */
+    /* 2029;PARAGRAPH SEPARATOR;Zp;0;B;;;;;N;;;;; */
+    0x2028, 0x2029 + 1,
+    0x202F, 0x202F + 1,
+    0x205F, 0x205F + 1,
+    0x3000, 0x3000 + 1,
+    /* FEFF;ZERO WIDTH NO-BREAK SPACE;Cf;0;BN;;;;;N;BYTE ORDER MARK;;;; */
+    0xFEFF, 0xFEFF + 1,
+};
+
+BOOL lre_is_space(int c)
+{
+    int i, n, low, high;
+    n = (countof(char_range_s) - 1) / 2;
+    for(i = 0; i < n; i++) {
+        low = char_range_s[2 * i + 1];
+        if (c < low)
+            return FALSE;
+        high = char_range_s[2 * i + 2];
+        if (c < high)
+            return TRUE;
+    }
+    return FALSE;
+}
+
+uint32_t const lre_id_start_table_ascii[4] = {
+    /* $ A-Z _ a-z */
+    0x00000000, 0x00000010, 0x87FFFFFE, 0x07FFFFFE
+};
+
+uint32_t const lre_id_continue_table_ascii[4] = {
+    /* $ 0-9 A-Z _ a-z */
+    0x00000000, 0x03FF0010, 0x87FFFFFE, 0x07FFFFFE
+};
+
+
+static const uint16_t char_range_w[] = {
+    4,
+    0x0030, 0x0039 + 1,
+    0x0041, 0x005A + 1,
+    0x005F, 0x005F + 1,
+    0x0061, 0x007A + 1,
+};
+
+#define CLASS_RANGE_BASE 0x40000000
+
+typedef enum {
+    CHAR_RANGE_d,
+    CHAR_RANGE_D,
+    CHAR_RANGE_s,
+    CHAR_RANGE_S,
+    CHAR_RANGE_w,
+    CHAR_RANGE_W,
+} CharRangeEnum;
+
+static const uint16_t *char_range_table[] = {
+    char_range_d,
+    char_range_s,
+    char_range_w,
+};
+
+static int cr_init_char_range(REParseState *s, CharRange *cr, uint32_t c)
+{
+    BOOL invert;
+    const uint16_t *c_pt;
+    int len, i;
+    
+    invert = c & 1;
+    c_pt = char_range_table[c >> 1];
+    len = *c_pt++;
+    cr_init(cr, s->mem_opaque, lre_realloc);
+    for(i = 0; i < len * 2; i++) {
+        if (cr_add_point(cr, c_pt[i]))
+            goto fail;
+    }
+    if (invert) {
+        if (cr_invert(cr))
+            goto fail;
+    }
+    return 0;
+ fail:
+    cr_free(cr);
+    return -1;
+}
+
+static int cr_canonicalize(CharRange *cr)
+{
+    CharRange a;
+    uint32_t pt[2];
+    int i, ret;
+
+    cr_init(&a, cr->mem_opaque, lre_realloc);
+    pt[0] = 'a';
+    pt[1] = 'z' + 1;
+    ret = cr_op(&a, cr->points, cr->len, pt, 2, CR_OP_INTER);
+    if (ret)
+        goto fail;
+    /* convert to upper case */
+    /* XXX: the generic unicode case would be much more complicated
+       and not really useful */
+    for(i = 0; i < a.len; i++) {
+        a.points[i] += 'A' - 'a';
+    }
+    /* Note: for simplicity we keep the lower case ranges */
+    ret = cr_union1(cr, a.points, a.len);
+ fail:
+    cr_free(&a);
+    return ret;
+}
+
+#ifdef DUMP_REOP
+static __attribute__((unused)) void lre_dump_bytecode(const uint8_t *buf,
+                                                     int buf_len)
+{
+    int pos, len, opcode, bc_len, re_flags, i;
+    uint32_t val;
+    
+    assert(buf_len >= RE_HEADER_LEN);
+
+    re_flags=  buf[0];
+    bc_len = get_u32(buf + 3);
+    assert(bc_len + RE_HEADER_LEN <= buf_len);
+    printf("flags: 0x%x capture_count=%d stack_size=%d\n",
+           re_flags, buf[1], buf[2]);
+    if (re_flags & LRE_FLAG_NAMED_GROUPS) {
+        const char *p;
+        p = (char *)buf + RE_HEADER_LEN + bc_len;
+        printf("named groups: ");
+        for(i = 1; i < buf[1]; i++) {
+            if (i != 1)
+                printf(",");
+            printf("<%s>", p);
+            p += strlen(p) + 1;
+        }
+        printf("\n");
+        assert(p == (char *)(buf + buf_len));
+    }
+    printf("bytecode_len=%d\n", bc_len);
+
+    buf += RE_HEADER_LEN;
+    pos = 0;
+    while (pos < bc_len) {
+        printf("%5u: ", pos);
+        opcode = buf[pos];
+        len = reopcode_info[opcode].size;
+        if (opcode >= REOP_COUNT) {
+            printf(" invalid opcode=0x%02x\n", opcode);
+            break;
+        }
+        if ((pos + len) > bc_len) {
+            printf(" buffer overflow (opcode=0x%02x)\n", opcode);
+            break;
+        }
+        printf("%s", reopcode_info[opcode].name);
+        switch(opcode) {
+        case REOP_char:
+            val = get_u16(buf + pos + 1);
+            if (val >= ' ' && val <= 126)
+                printf(" '%c'", val);
+            else
+                printf(" 0x%04x", val);
+            break;
+        case REOP_char32:
+            val = get_u32(buf + pos + 1);
+            if (val >= ' ' && val <= 126)
+                printf(" '%c'", val);
+            else
+                printf(" 0x%08x", val);
+            break;
+        case REOP_goto:
+        case REOP_split_goto_first:
+        case REOP_split_next_first:
+        case REOP_loop:
+        case REOP_lookahead:
+        case REOP_negative_lookahead:
+        case REOP_bne_char_pos:
+            val = get_u32(buf + pos + 1);
+            val += (pos + 5);
+            printf(" %u", val);
+            break;
+        case REOP_simple_greedy_quant:
+            printf(" %u %u %u %u",
+                   get_u32(buf + pos + 1) + (pos + 17),
+                   get_u32(buf + pos + 1 + 4),
+                   get_u32(buf + pos + 1 + 8),
+                   get_u32(buf + pos + 1 + 12));
+            break;
+        case REOP_save_start:
+        case REOP_save_end:
+        case REOP_back_reference:
+        case REOP_backward_back_reference:
+            printf(" %u", buf[pos + 1]);
+            break;
+        case REOP_save_reset:
+            printf(" %u %u", buf[pos + 1], buf[pos + 2]);
+            break;
+        case REOP_push_i32:
+            val = get_u32(buf + pos + 1);
+            printf(" %d", val);
+            break;
+        case REOP_range:
+            {
+                int n, i;
+                n = get_u16(buf + pos + 1);
+                len += n * 4;
+                for(i = 0; i < n * 2; i++) {
+                    val = get_u16(buf + pos + 3 + i * 2);
+                    printf(" 0x%04x", val);
+                }
+            }
+            break;
+        case REOP_range32:
+            {
+                int n, i;
+                n = get_u16(buf + pos + 1);
+                len += n * 8;
+                for(i = 0; i < n * 2; i++) {
+                    val = get_u32(buf + pos + 3 + i * 4);
+                    printf(" 0x%08x", val);
+                }
+            }
+            break;
+        default:
+            break;
+        }
+        printf("\n");
+        pos += len;
+    }
+}
+#endif
+
+static void re_emit_op(REParseState *s, int op)
+{
+    dbuf_putc(&s->byte_code, op);
+}
+
+/* return the offset of the u32 value */
+static int re_emit_op_u32(REParseState *s, int op, uint32_t val)
+{
+    int pos;
+    dbuf_putc(&s->byte_code, op);
+    pos = s->byte_code.size;
+    dbuf_put_u32(&s->byte_code, val);
+    return pos;
+}
+
+static int re_emit_goto(REParseState *s, int op, uint32_t val)
+{
+    int pos;
+    dbuf_putc(&s->byte_code, op);
+    pos = s->byte_code.size;
+    dbuf_put_u32(&s->byte_code, val - (pos + 4));
+    return pos;
+}
+
+static void re_emit_op_u8(REParseState *s, int op, uint32_t val)
+{
+    dbuf_putc(&s->byte_code, op);
+    dbuf_putc(&s->byte_code, val);
+}
+
+static void re_emit_op_u16(REParseState *s, int op, uint32_t val)
+{
+    dbuf_putc(&s->byte_code, op);
+    dbuf_put_u16(&s->byte_code, val);
+}
+
+#if defined(_MSC_VER)
+static int re_parse_error(REParseState *s, const char *fmt, ...)
+#else
+static int __attribute__((format(printf, 2, 3))) re_parse_error(REParseState *s, const char *fmt, ...)
+#endif
+{
+    va_list ap;
+    va_start(ap, fmt);
+    vsnprintf(s->u.error_msg, sizeof(s->u.error_msg), fmt, ap);
+    va_end(ap);
+    return -1;
+}
+
+/* Return -1 in case of overflow */
+static int parse_digits(const uint8_t **pp)
+{
+    const uint8_t *p;
+    uint64_t v;
+    int c;
+    
+    p = *pp;
+    v = 0;
+    for(;;) {
+        c = *p;
+        if (c < '0' || c > '9')
+            break;
+        v = v * 10 + c - '0';
+        if (v >= INT32_MAX)
+            return -1;
+        p++;
+    }
+    *pp = p;
+    return v;
+}
+
+static int re_parse_expect(REParseState *s, const uint8_t **pp, int c)
+{
+    const uint8_t *p;
+    p = *pp;
+    if (*p != c)
+        return re_parse_error(s, "expecting '%c'", c);
+    p++;
+    *pp = p;
+    return 0;
+}
+
+/* Parse an escape sequence, *pp points after the '\':
+   allow_utf16 value:
+   0 : no UTF-16 escapes allowed
+   1 : UTF-16 escapes allowed
+   2 : UTF-16 escapes allowed and escapes of surrogate pairs are
+   converted to a unicode character (unicode regexp case).
+
+   Return the unicode char and update *pp if recognized,
+   return -1 if malformed escape,
+   return -2 otherwise. */
+int lre_parse_escape(const uint8_t **pp, int allow_utf16)
+{
+    const uint8_t *p;
+    uint32_t c;
+
+    p = *pp;
+    c = *p++;
+    switch(c) {
+    case 'b':
+        c = '\b';
+        break;
+    case 'f':
+        c = '\f';
+        break;
+    case 'n':
+        c = '\n';
+        break;
+    case 'r':
+        c = '\r';
+        break;
+    case 't':
+        c = '\t';
+        break;
+    case 'v':
+        c = '\v';
+        break;
+    case 'x':
+    case 'u':
+        {
+            int h, n, i;
+            uint32_t c1;
+            
+            if (*p == '{' && allow_utf16) {
+                p++;
+                c = 0;
+                for(;;) {
+                    h = from_hex(*p++);
+                    if (h < 0)
+                        return -1;
+                    c = (c << 4) | h;
+                    if (c > 0x10FFFF)
+                        return -1;
+                    if (*p == '}')
+                        break;
+                }
+                p++;
+            } else {
+                if (c == 'x') {
+                    n = 2;
+                } else {
+                    n = 4;
+                }
+
+                c = 0;
+                for(i = 0; i < n; i++) {
+                    h = from_hex(*p++);
+                    if (h < 0) {
+                        return -1;
+                    }
+                    c = (c << 4) | h;
+                }
+                if (c >= 0xd800 && c < 0xdc00 &&
+                    allow_utf16 == 2 && p[0] == '\\' && p[1] == 'u') {
+                    /* convert an escaped surrogate pair into a
+                       unicode char */
+                    c1 = 0;
+                    for(i = 0; i < 4; i++) {
+                        h = from_hex(p[2 + i]);
+                        if (h < 0)
+                            break;
+                        c1 = (c1 << 4) | h;
+                    }
+                    if (i == 4 && c1 >= 0xdc00 && c1 < 0xe000) {
+                        p += 6;
+                        c = (((c & 0x3ff) << 10) | (c1 & 0x3ff)) + 0x10000;
+                    }
+                }
+            }
+        }
+        break;
+#if defined(_MSC_VER)
+	case '0':
+	case '1':
+	case '2':
+	case '3':
+	case '4':
+	case '5':
+	case '6':
+	case '7':
+#else
+    case '0' ... '7':
+#endif
+        c -= '0';
+        if (allow_utf16 == 2) {
+            /* only accept \0 not followed by digit */
+            if (c != 0 || is_digit(*p))
+                return -1;
+        } else {
+            /* parse a legacy octal sequence */
+            uint32_t v;
+            v = *p - '0';
+            if (v > 7)
+                break;
+            c = (c << 3) | v;
+            p++;
+            if (c >= 32)
+                break;
+            v = *p - '0';
+            if (v > 7)
+                break;
+            c = (c << 3) | v;
+            p++;
+        }
+        break;
+    default:
+        return -2;
+    }
+    *pp = p;
+    return c;
+}
+
+#ifdef CONFIG_ALL_UNICODE
+/* XXX: we use the same chars for name and value */
+static BOOL is_unicode_char(int c)
+{
+    return ((c >= '0' && c <= '9') ||
+            (c >= 'A' && c <= 'Z') ||
+            (c >= 'a' && c <= 'z') ||
+            (c == '_'));
+}
+
+static int parse_unicode_property(REParseState *s, CharRange *cr,
+                                  const uint8_t **pp, BOOL is_inv)
+{
+    const uint8_t *p;
+    char name[64], value[64];
+    char *q;
+    BOOL script_ext;
+    int ret;
+
+    p = *pp;
+    if (*p != '{')
+        return re_parse_error(s, "expecting '{' after \\p");
+    p++;
+    q = name;
+    while (is_unicode_char(*p)) {
+        if ((q - name) > sizeof(name) - 1)
+            goto unknown_property_name;
+        *q++ = *p++;
+    }
+    *q = '\0';
+    q = value;
+    if (*p == '=') {
+        p++;
+        while (is_unicode_char(*p)) {
+            if ((q - value) > sizeof(value) - 1)
+                return re_parse_error(s, "unknown unicode property value");
+            *q++ = *p++;
+        }
+    }
+    *q = '\0';
+    if (*p != '}')
+        return re_parse_error(s, "expecting '}'");
+    p++;
+    //    printf("name=%s value=%s\n", name, value);
+
+    if (!strcmp(name, "Script") || !strcmp(name, "sc")) {
+        script_ext = FALSE;
+        goto do_script;
+    } else if (!strcmp(name, "Script_Extensions") || !strcmp(name, "scx")) {
+        script_ext = TRUE;
+    do_script:
+        cr_init(cr, s->mem_opaque, lre_realloc);
+        ret = unicode_script(cr, value, script_ext);
+        if (ret) {
+            cr_free(cr);
+            if (ret == -2)
+                return re_parse_error(s, "unknown unicode script");
+            else
+                goto out_of_memory;
+        }
+    } else if (!strcmp(name, "General_Category") || !strcmp(name, "gc")) {
+        cr_init(cr, s->mem_opaque, lre_realloc);
+        ret = unicode_general_category(cr, value);
+        if (ret) {
+            cr_free(cr);
+            if (ret == -2)
+                return re_parse_error(s, "unknown unicode general category");
+            else
+                goto out_of_memory;
+        }
+    } else if (value[0] == '\0') {
+        cr_init(cr, s->mem_opaque, lre_realloc);
+        ret = unicode_general_category(cr, name);
+        if (ret == -1) {
+            cr_free(cr);
+            goto out_of_memory;
+        }
+        if (ret < 0) {
+            ret = unicode_prop(cr, name);
+            if (ret) {
+                cr_free(cr);
+                if (ret == -2)
+                    goto unknown_property_name;
+                else
+                    goto out_of_memory;
+            }
+        }
+    } else {
+    unknown_property_name:
+        return re_parse_error(s, "unknown unicode property name");
+    }
+
+    if (is_inv) {
+        if (cr_invert(cr)) {
+            cr_free(cr);
+            return -1;
+        }
+    }
+    *pp = p;
+    return 0;
+ out_of_memory:
+    return re_parse_error(s, "out of memory");
+}
+#endif /* CONFIG_ALL_UNICODE */
+
+/* return -1 if error otherwise the character or a class range
+   (CLASS_RANGE_BASE). In case of class range, 'cr' is
+   initialized. Otherwise, it is ignored. */
+static int get_class_atom(REParseState *s, CharRange *cr,
+                          const uint8_t **pp, BOOL inclass)
+{
+    const uint8_t *p;
+    uint32_t c;
+    int ret;
+    
+    p = *pp;
+
+    c = *p;
+    switch(c) {
+    case '\\':
+        p++;
+        if (p >= s->buf_end)
+            goto unexpected_end;
+        c = *p++;
+        switch(c) {
+        case 'd':
+            c = CHAR_RANGE_d;
+            goto class_range;
+        case 'D':
+            c = CHAR_RANGE_D;
+            goto class_range;
+        case 's':
+            c = CHAR_RANGE_s;
+            goto class_range;
+        case 'S':
+            c = CHAR_RANGE_S;
+            goto class_range;
+        case 'w':
+            c = CHAR_RANGE_w;
+            goto class_range;
+        case 'W':
+            c = CHAR_RANGE_W;
+        class_range:
+            if (cr_init_char_range(s, cr, c))
+                return -1;
+            c = CLASS_RANGE_BASE;
+            break;
+        case 'c':
+            c = *p;
+            if ((c >= 'a' && c <= 'z') ||
+                (c >= 'A' && c <= 'Z') ||
+                (((c >= '0' && c <= '9') || c == '_') &&
+                 inclass && !s->is_utf16)) {   /* Annex B.1.4 */
+                c &= 0x1f;
+                p++;
+            } else if (s->is_utf16) {
+                goto invalid_escape;
+            } else {
+                /* otherwise return '\' and 'c' */
+                p--;
+                c = '\\';
+            }
+            break;
+#ifdef CONFIG_ALL_UNICODE
+        case 'p':
+        case 'P':
+            if (s->is_utf16) {
+                if (parse_unicode_property(s, cr, &p, (c == 'P')))
+                    return -1;
+                c = CLASS_RANGE_BASE;
+                break;
+            }
+            /* fall thru */
+#endif
+        default:
+            p--;
+            ret = lre_parse_escape(&p, s->is_utf16 * 2);
+            if (ret >= 0) {
+                c = ret;
+            } else {
+                if (ret == -2 && *p != '\0' && strchr("^$\\.*+?()[]{}|/", *p)) {
+                    /* always valid to escape these characters */
+                    goto normal_char;
+                } else if (s->is_utf16) {
+                invalid_escape:
+                    return re_parse_error(s, "invalid escape sequence in regular expression");
+                } else {
+                    /* just ignore the '\' */
+                    goto normal_char;
+                }
+            }
+            break;
+        }
+        break;
+    case '\0':
+        if (p >= s->buf_end) {
+        unexpected_end:
+            return re_parse_error(s, "unexpected end");
+        }
+        /* fall thru */
+    default:
+    normal_char:
+        /* normal char */
+        if (c >= 128) {
+            c = unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p);
+            if ((unsigned)c > 0xffff && !s->is_utf16) {
+                /* XXX: should handle non BMP-1 code points */
+                return re_parse_error(s, "malformed unicode char");
+            }
+        } else {
+            p++;
+        }
+        break;
+    }
+    *pp = p;
+    return c;
+}
+
+static int re_emit_range(REParseState *s, const CharRange *cr)
+{
+    int len, i;
+    uint32_t high;
+    
+    len = (unsigned)cr->len / 2;
+    if (len >= 65535)
+        return re_parse_error(s, "too many ranges");
+    if (len == 0) {
+        /* not sure it can really happen. Emit a match that is always
+           false */
+        re_emit_op_u32(s, REOP_char32, -1);
+    } else {
+        high = cr->points[cr->len - 1];
+        if (high == UINT32_MAX)
+            high = cr->points[cr->len - 2];
+        if (high <= 0xffff) {
+            /* can use 16 bit ranges with the conversion that 0xffff =
+               infinity */
+            re_emit_op_u16(s, REOP_range, len);
+            for(i = 0; i < cr->len; i += 2) {
+                dbuf_put_u16(&s->byte_code, cr->points[i]);
+                high = cr->points[i + 1] - 1;
+                if (high == UINT32_MAX - 1)
+                    high = 0xffff;
+                dbuf_put_u16(&s->byte_code, high);
+            }
+        } else {
+            re_emit_op_u16(s, REOP_range32, len);
+            for(i = 0; i < cr->len; i += 2) {
+                dbuf_put_u32(&s->byte_code, cr->points[i]);
+                dbuf_put_u32(&s->byte_code, cr->points[i + 1] - 1);
+            }
+        }
+    }
+    return 0;
+}
+
+static int re_parse_char_class(REParseState *s, const uint8_t **pp)
+{
+    const uint8_t *p;
+    uint32_t c1, c2;
+    CharRange cr_s, *cr = &cr_s;
+    CharRange cr1_s, *cr1 = &cr1_s;
+    BOOL invert;
+    
+    cr_init(cr, s->mem_opaque, lre_realloc);
+    p = *pp;
+    p++;    /* skip '[' */
+    invert = FALSE;
+    if (*p == '^') {
+        p++;
+        invert = TRUE;
+    }
+    for(;;) {
+        if (*p == ']')
+            break;
+        c1 = get_class_atom(s, cr1, &p, TRUE);
+        if ((int)c1 < 0)
+            goto fail;
+        if (*p == '-' && p[1] != ']') {
+            const uint8_t *p0 = p + 1;
+            if (c1 >= CLASS_RANGE_BASE) {
+                if (s->is_utf16) {
+                    cr_free(cr1);
+                    goto invalid_class_range;
+                }
+                /* Annex B: match '-' character */
+                goto class_atom;
+            }
+            c2 = get_class_atom(s, cr1, &p0, TRUE);
+            if ((int)c2 < 0)
+                goto fail;
+            if (c2 >= CLASS_RANGE_BASE) {
+                cr_free(cr1);
+                if (s->is_utf16) {
+                    goto invalid_class_range;
+                }
+                /* Annex B: match '-' character */
+                goto class_atom;
+            }
+            p = p0;
+            if (c2 < c1) {
+            invalid_class_range:
+                re_parse_error(s, "invalid class range");
+                goto fail;
+            }
+            if (cr_union_interval(cr, c1, c2))
+                goto memory_error;
+        } else {
+        class_atom:
+            if (c1 >= CLASS_RANGE_BASE) {
+                int ret;
+                ret = cr_union1(cr, cr1->points, cr1->len);
+                cr_free(cr1);
+                if (ret)
+                    goto memory_error;
+            } else {
+                if (cr_union_interval(cr, c1, c1))
+                    goto memory_error;
+            }
+        }
+    }
+    if (s->ignore_case) {
+        if (cr_canonicalize(cr))
+            goto memory_error;
+    }
+    if (invert) {
+        if (cr_invert(cr))
+            goto memory_error;
+    }
+    if (re_emit_range(s, cr))
+        goto fail;
+    cr_free(cr);
+    p++;    /* skip ']' */
+    *pp = p;
+    return 0;
+ memory_error:
+    re_parse_error(s, "out of memory");
+ fail:
+    cr_free(cr);
+    return -1;
+}
+
+/* Return:
+   1 if the opcodes in bc_buf[] always advance the character pointer.
+   0 if the character pointer may not be advanced.
+   -1 if the code may depend on side effects of its previous execution (backreference)
+*/
+static int re_check_advance(const uint8_t *bc_buf, int bc_buf_len)
+{
+    int pos, opcode, ret, len, i;
+    uint32_t val, last;
+    BOOL has_back_reference;
+    uint8_t capture_bitmap[CAPTURE_COUNT_MAX];
+    
+    ret = -2; /* not known yet */
+    pos = 0;
+    has_back_reference = FALSE;
+    memset(capture_bitmap, 0, sizeof(capture_bitmap));
+    
+    while (pos < bc_buf_len) {
+        opcode = bc_buf[pos];
+        len = reopcode_info[opcode].size;
+        switch(opcode) {
+        case REOP_range:
+            val = get_u16(bc_buf + pos + 1);
+            len += val * 4;
+            goto simple_char;
+        case REOP_range32:
+            val = get_u16(bc_buf + pos + 1);
+            len += val * 8;
+            goto simple_char;
+        case REOP_char:
+        case REOP_char32:
+        case REOP_dot:
+        case REOP_any:
+        simple_char:
+            if (ret == -2)
+                ret = 1;
+            break;
+        case REOP_line_start:
+        case REOP_line_end:
+        case REOP_push_i32:
+        case REOP_push_char_pos:
+        case REOP_drop:
+        case REOP_word_boundary:
+        case REOP_not_word_boundary:
+        case REOP_prev:
+            /* no effect */
+            break;
+        case REOP_save_start:
+        case REOP_save_end:
+            val = bc_buf[pos + 1];
+            capture_bitmap[val] |= 1;
+            break;
+        case REOP_save_reset:
+            {
+                val = bc_buf[pos + 1];
+                last = bc_buf[pos + 2];
+                while (val < last)
+                    capture_bitmap[val++] |= 1;
+            }
+            break;
+        case REOP_back_reference:
+        case REOP_backward_back_reference:
+            val = bc_buf[pos + 1];
+            capture_bitmap[val] |= 2;
+            has_back_reference = TRUE;
+            break;
+        default:
+            /* safe behvior: we cannot predict the outcome */
+            if (ret == -2)
+                ret = 0;
+            break;
+        }
+        pos += len;
+    }
+    if (has_back_reference) {
+        /* check if there is back reference which references a capture
+           made in the some code */
+        for(i = 0; i < CAPTURE_COUNT_MAX; i++) {
+            if (capture_bitmap[i] == 3)
+                return -1;
+        }
+    }
+    if (ret == -2)
+        ret = 0;
+    return ret;
+}
+
+/* return -1 if a simple quantifier cannot be used. Otherwise return
+   the number of characters in the atom. */
+static int re_is_simple_quantifier(const uint8_t *bc_buf, int bc_buf_len)
+{
+    int pos, opcode, len, count;
+    uint32_t val;
+    
+    count = 0;
+    pos = 0;
+    while (pos < bc_buf_len) {
+        opcode = bc_buf[pos];
+        len = reopcode_info[opcode].size;
+        switch(opcode) {
+        case REOP_range:
+            val = get_u16(bc_buf + pos + 1);
+            len += val * 4;
+            goto simple_char;
+        case REOP_range32:
+            val = get_u16(bc_buf + pos + 1);
+            len += val * 8;
+            goto simple_char;
+        case REOP_char:
+        case REOP_char32:
+        case REOP_dot:
+        case REOP_any:
+        simple_char:
+            count++;
+            break;
+        case REOP_line_start:
+        case REOP_line_end:
+        case REOP_word_boundary:
+        case REOP_not_word_boundary:
+            break;
+        default:
+            return -1;
+        }
+        pos += len;
+    }
+    return count;
+}
+
+/* '*pp' is the first char after '<' */
+static int re_parse_group_name(char *buf, int buf_size,
+                               const uint8_t **pp, BOOL is_utf16)
+{
+    const uint8_t *p;
+    uint32_t c;
+    char *q;
+
+    p = *pp;
+    q = buf;
+    for(;;) {
+        c = *p;
+        if (c == '\\') {
+            p++;
+            if (*p != 'u')
+                return -1;
+            c = lre_parse_escape(&p, is_utf16 * 2);
+        } else if (c == '>') {
+            break;
+        } else if (c >= 128) {
+            c = unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p);
+        } else {
+            p++;
+        }
+        if (c > 0x10FFFF)
+            return -1;
+        if (q == buf) {
+            if (!lre_js_is_ident_first(c))
+                return -1;
+        } else {
+            if (!lre_js_is_ident_next(c))
+                return -1;
+        }
+        if ((q - buf + UTF8_CHAR_LEN_MAX + 1) > buf_size)
+            return -1;
+        if (c < 128) {
+            *q++ = c;
+        } else {
+            q += unicode_to_utf8((uint8_t*)q, c);
+        }
+    }
+    if (q == buf)
+        return -1;
+    *q = '\0';
+    p++;
+    *pp = p;
+    return 0;
+}
+
+/* if capture_name = NULL: return the number of captures + 1.
+   Otherwise, return the capture index corresponding to capture_name
+   or -1 if none */
+static int re_parse_captures(REParseState *s, int *phas_named_captures,
+                             const char *capture_name)
+{
+    const uint8_t *p;
+    int capture_index;
+    char name[TMP_BUF_SIZE];
+
+    capture_index = 1;
+    *phas_named_captures = 0;
+    for (p = s->buf_start; p < s->buf_end; p++) {
+        switch (*p) {
+        case '(':
+            if (p[1] == '?') {
+                if (p[2] == '<' && p[3] != '=' && p[3] != '!') {
+                    *phas_named_captures = 1;
+                    /* potential named capture */
+                    if (capture_name) {
+                        p += 3;
+                        if (re_parse_group_name(name, sizeof(name), &p,
+                                                s->is_utf16) == 0) {
+                            if (!strcmp(name, capture_name))
+                                return capture_index;
+                        }
+                    }
+                    capture_index++;
+                }
+            } else {
+                capture_index++;
+            }
+            break;
+        case '\\':
+            p++;
+            break;
+        case '[':
+            for (p += 1 + (*p == ']'); p < s->buf_end && *p != ']'; p++) {
+                if (*p == '\\')
+                    p++;
+            }
+            break;
+        }
+    }
+    if (capture_name)
+        return -1;
+    else
+        return capture_index;
+}
+
+static int re_count_captures(REParseState *s)
+{
+    if (s->total_capture_count < 0) {
+        s->total_capture_count = re_parse_captures(s, &s->has_named_captures,
+                                                   NULL);
+    }
+    return s->total_capture_count;
+}
+
+static BOOL re_has_named_captures(REParseState *s)
+{
+    if (s->has_named_captures < 0)
+        re_count_captures(s);
+    return s->has_named_captures;
+}
+
+static int find_group_name(REParseState *s, const char *name)
+{
+    const char *p, *buf_end;
+    size_t len, name_len;
+    int capture_index;
+    
+    name_len = strlen(name);
+    p = (char *)s->group_names.buf;
+    buf_end = (char *)s->group_names.buf + s->group_names.size;
+    capture_index = 1;
+    while (p < buf_end) {
+        len = strlen(p);
+        if (len == name_len && memcmp(name, p, name_len) == 0)
+            return capture_index;
+        p += len + 1;
+        capture_index++;
+    }
+    return -1;
+}
+
+static int re_parse_disjunction(REParseState *s, BOOL is_backward_dir);
+
+static int re_parse_term(REParseState *s, BOOL is_backward_dir)
+{
+    const uint8_t *p;
+    int c, last_atom_start, quant_min, quant_max, last_capture_count;
+    BOOL greedy, add_zero_advance_check, is_neg, is_backward_lookahead;
+    CharRange cr_s, *cr = &cr_s;
+    
+    last_atom_start = -1;
+    last_capture_count = 0;
+    p = s->buf_ptr;
+    c = *p;
+    switch(c) {
+    case '^':
+        p++;
+        re_emit_op(s, REOP_line_start);
+        break;
+    case '$':
+        p++;
+        re_emit_op(s, REOP_line_end);
+        break;
+    case '.':
+        p++;
+        last_atom_start = s->byte_code.size;
+        last_capture_count = s->capture_count;
+        if (is_backward_dir)
+            re_emit_op(s, REOP_prev);
+        re_emit_op(s, s->dotall ? REOP_any : REOP_dot);
+        if (is_backward_dir)
+            re_emit_op(s, REOP_prev);
+        break;
+    case '{':
+        /* As an extension (see ES6 annex B), we accept '{' not
+           followed by digits as a normal atom */
+        if (!is_digit(p[1])) {
+            if (s->is_utf16)
+                goto invalid_quant_count;
+            goto parse_class_atom;
+        }
+        /* fall tru */
+    case '*':
+    case '+':
+    case '?':
+        return re_parse_error(s, "nothing to repeat");
+    case '(':
+        if (p[1] == '?') {
+            if (p[2] == ':') {
+                p += 3;
+                last_atom_start = s->byte_code.size;
+                last_capture_count = s->capture_count;
+                s->buf_ptr = p;
+                if (re_parse_disjunction(s, is_backward_dir))
+                    return -1;
+                p = s->buf_ptr;
+                if (re_parse_expect(s, &p, ')'))
+                    return -1;
+            } else if ((p[2] == '=' || p[2] == '!')) {
+                is_neg = (p[2] == '!');
+                is_backward_lookahead = FALSE;
+                p += 3;
+                goto lookahead;
+            } else if (p[2] == '<' &&
+                       (p[3] == '=' || p[3] == '!')) {
+                int pos;
+                is_neg = (p[3] == '!');
+                is_backward_lookahead = TRUE;
+                p += 4;
+                /* lookahead */
+            lookahead:
+                /* Annex B allows lookahead to be used as an atom for
+                   the quantifiers */
+                if (!s->is_utf16 && !is_backward_lookahead)  {
+                    last_atom_start = s->byte_code.size;
+                    last_capture_count = s->capture_count;
+                }
+                pos = re_emit_op_u32(s, REOP_lookahead + is_neg, 0);
+                s->buf_ptr = p;
+                if (re_parse_disjunction(s, is_backward_lookahead))
+                    return -1;
+                p = s->buf_ptr;
+                if (re_parse_expect(s, &p, ')'))
+                    return -1;
+                re_emit_op(s, REOP_match);
+                /* jump after the 'match' after the lookahead is successful */
+                put_u32(s->byte_code.buf + pos, s->byte_code.size - (pos + 4));
+            } else if (p[2] == '<') {
+                p += 3;
+                if (re_parse_group_name(s->u.tmp_buf, sizeof(s->u.tmp_buf),
+                                        &p, s->is_utf16)) {
+                    return re_parse_error(s, "invalid group name");
+                }
+                if (find_group_name(s, s->u.tmp_buf) > 0) {
+                    return re_parse_error(s, "duplicate group name");
+                }
+                /* group name with a trailing zero */
+                dbuf_put(&s->group_names, (uint8_t *)s->u.tmp_buf,
+                         strlen(s->u.tmp_buf) + 1);
+                s->has_named_captures = 1;
+                goto parse_capture;
+            } else {
+                return re_parse_error(s, "invalid group");
+            }
+        } else {
+            int capture_index;
+            p++;
+            /* capture without group name */
+            dbuf_putc(&s->group_names, 0);
+        parse_capture:
+            if (s->capture_count >= CAPTURE_COUNT_MAX)
+                return re_parse_error(s, "too many captures");
+            last_atom_start = s->byte_code.size;
+            last_capture_count = s->capture_count;
+            capture_index = s->capture_count++;
+            re_emit_op_u8(s, REOP_save_start + is_backward_dir,
+                          capture_index);
+            
+            s->buf_ptr = p;
+            if (re_parse_disjunction(s, is_backward_dir))
+                return -1;
+            p = s->buf_ptr;
+            
+            re_emit_op_u8(s, REOP_save_start + 1 - is_backward_dir,
+                          capture_index);
+            
+            if (re_parse_expect(s, &p, ')'))
+                return -1;
+        }
+        break;
+    case '\\':
+        switch(p[1]) {
+        case 'b':
+        case 'B':
+            re_emit_op(s, REOP_word_boundary + (p[1] != 'b'));
+            p += 2;
+            break;
+        case 'k':
+            {
+                const uint8_t *p1;
+                int dummy_res;
+                
+                p1 = p;
+                if (p1[2] != '<') {
+                    /* annex B: we tolerate invalid group names in non
+                       unicode mode if there is no named capture
+                       definition */
+                    if (s->is_utf16 || re_has_named_captures(s))
+                        return re_parse_error(s, "expecting group name");
+                    else
+                        goto parse_class_atom;
+                }
+                p1 += 3;
+                if (re_parse_group_name(s->u.tmp_buf, sizeof(s->u.tmp_buf),
+                                        &p1, s->is_utf16)) {
+                    if (s->is_utf16 || re_has_named_captures(s))
+                        return re_parse_error(s, "invalid group name");
+                    else
+                        goto parse_class_atom;
+                }
+                c = find_group_name(s, s->u.tmp_buf);
+                if (c < 0) {
+                    /* no capture name parsed before, try to look
+                       after (inefficient, but hopefully not common */
+                    c = re_parse_captures(s, &dummy_res, s->u.tmp_buf);
+                    if (c < 0) {
+                        if (s->is_utf16 || re_has_named_captures(s))
+                            return re_parse_error(s, "group name not defined");
+                        else
+                            goto parse_class_atom;
+                    }
+                }
+                p = p1;
+            }
+            goto emit_back_reference;
+        case '0':
+            p += 2;
+            c = 0;
+            if (s->is_utf16) {
+                if (is_digit(*p)) {
+                    return re_parse_error(s, "invalid decimal escape in regular expression");
+                }
+            } else {
+                /* Annex B.1.4: accept legacy octal */
+                if (*p >= '0' && *p <= '7') {
+                    c = *p++ - '0';
+                    if (*p >= '0' && *p <= '7') {
+                        c = (c << 3) + *p++ - '0';
+                    }
+                }
+            }
+            goto normal_char;
+#if defined(_MSC_VER)
+		case '1':
+		case '2':
+		case '3':
+		case '4':
+		case '5':
+		case '6':
+		case '7':
+		case '8':
+		case '9':
+#else
+        case '1' ... '9':
+#endif
+            {
+                const uint8_t *q = ++p;
+                
+                c = parse_digits(&p);
+                if (c < 0 || (c >= s->capture_count && c >= re_count_captures(s))) {
+                    if (!s->is_utf16) {
+                        /* Annex B.1.4: accept legacy octal */
+                        p = q;
+                        if (*p <= '7') {
+                            c = 0;
+                            if (*p <= '3')
+                                c = *p++ - '0';
+                            if (*p >= '0' && *p <= '7') {
+                                c = (c << 3) + *p++ - '0';
+                                if (*p >= '0' && *p <= '7') {
+                                    c = (c << 3) + *p++ - '0';
+                                }
+                            }
+                        } else {
+                            c = *p++;
+                        }
+                        goto normal_char;
+                    }
+                    return re_parse_error(s, "back reference out of range in reguar expression");
+                }
+            emit_back_reference:
+                last_atom_start = s->byte_code.size;
+                last_capture_count = s->capture_count;
+                re_emit_op_u8(s, REOP_back_reference + is_backward_dir, c);
+            }
+            break;
+        default:
+            goto parse_class_atom;
+        }
+        break;
+    case '[':
+        last_atom_start = s->byte_code.size;
+        last_capture_count = s->capture_count;
+        if (is_backward_dir)
+            re_emit_op(s, REOP_prev);
+        if (re_parse_char_class(s, &p))
+            return -1;
+        if (is_backward_dir)
+            re_emit_op(s, REOP_prev);
+        break;
+    case ']':
+    case '}':
+        if (s->is_utf16)
+            return re_parse_error(s, "syntax error");
+        goto parse_class_atom;
+    default:
+    parse_class_atom:
+        c = get_class_atom(s, cr, &p, FALSE);
+        if ((int)c < 0)
+            return -1;
+    normal_char:
+        last_atom_start = s->byte_code.size;
+        last_capture_count = s->capture_count;
+        if (is_backward_dir)
+            re_emit_op(s, REOP_prev);
+        if (c >= CLASS_RANGE_BASE) {
+            int ret;
+            /* Note: canonicalization is not needed */
+            ret = re_emit_range(s, cr);
+            cr_free(cr);
+            if (ret)
+                return -1;
+        } else {
+            if (s->ignore_case)
+                c = lre_canonicalize(c, s->is_utf16);
+            if (c <= 0xffff)
+                re_emit_op_u16(s, REOP_char, c);
+            else
+                re_emit_op_u32(s, REOP_char32, c);
+        }
+        if (is_backward_dir)
+            re_emit_op(s, REOP_prev);
+        break;
+    }
+
+    /* quantifier */
+    if (last_atom_start >= 0) {
+        c = *p;
+        switch(c) {
+        case '*':
+            p++;
+            quant_min = 0;
+            quant_max = INT32_MAX;
+            goto quantifier;
+        case '+':
+            p++;
+            quant_min = 1;
+            quant_max = INT32_MAX;
+            goto quantifier;
+        case '?':
+            p++;
+            quant_min = 0;
+            quant_max = 1;
+            goto quantifier;
+        case '{':
+            /* As an extension (see ES6 annex B), we accept '{' not
+               followed by digits as a normal atom */
+            if (!is_digit(p[1])) {
+                if (s->is_utf16)
+                    goto invalid_quant_count;
+                break;
+            }
+            p++;
+            quant_min = parse_digits(&p);
+            if (quant_min < 0) {
+            invalid_quant_count:
+                return re_parse_error(s, "invalid repetition count");
+            }
+            quant_max = quant_min;
+            if (*p == ',') {
+                p++;
+                if (is_digit(*p)) {
+                    quant_max = parse_digits(&p);
+                    if (quant_max < 0 || quant_max < quant_min)
+                        goto invalid_quant_count;
+                } else {
+                    quant_max = INT32_MAX; /* infinity */
+                }
+            }
+            if (re_parse_expect(s, &p, '}'))
+                return -1;
+        quantifier:
+            greedy = TRUE;
+            if (*p == '?') {
+                p++;
+                greedy = FALSE;
+            }
+            if (last_atom_start < 0) {
+                return re_parse_error(s, "nothing to repeat");
+            }
+            if (greedy) {
+                int len, pos;
+                
+                if (quant_max > 0) {
+                    /* specific optimization for simple quantifiers */
+                    len = re_is_simple_quantifier(s->byte_code.buf + last_atom_start,
+                                                 s->byte_code.size - last_atom_start);
+                    if (len > 0) {
+                        re_emit_op(s, REOP_match);
+                        
+                        dbuf_insert(&s->byte_code, last_atom_start, 17);
+                        pos = last_atom_start;
+                        s->byte_code.buf[pos++] = REOP_simple_greedy_quant;
+                        put_u32(&s->byte_code.buf[pos],
+                                s->byte_code.size - last_atom_start - 17);
+                        pos += 4;
+                        put_u32(&s->byte_code.buf[pos], quant_min);
+                        pos += 4;
+                        put_u32(&s->byte_code.buf[pos], quant_max);
+                        pos += 4;
+                        put_u32(&s->byte_code.buf[pos], len);
+                        pos += 4;
+                        goto done;
+                    }
+                }
+                
+                add_zero_advance_check = (re_check_advance(s->byte_code.buf + last_atom_start,
+                                                           s->byte_code.size - last_atom_start) == 0);
+            } else {
+                add_zero_advance_check = FALSE;
+            }
+            
+            {
+                int len, pos;
+                len = s->byte_code.size - last_atom_start;
+                if (quant_min == 0) {
+                    /* need to reset the capture in case the atom is
+                       not executed */
+                    if (last_capture_count != s->capture_count) {
+                        dbuf_insert(&s->byte_code, last_atom_start, 3);
+                        s->byte_code.buf[last_atom_start++] = REOP_save_reset;
+                        s->byte_code.buf[last_atom_start++] = last_capture_count;
+                        s->byte_code.buf[last_atom_start++] = s->capture_count - 1;
+                    }
+                    if (quant_max == 0) {
+                        s->byte_code.size = last_atom_start;
+                    } else if (quant_max == 1) {
+                        dbuf_insert(&s->byte_code, last_atom_start, 5);
+                        s->byte_code.buf[last_atom_start] = REOP_split_goto_first +
+                            greedy;
+                        put_u32(s->byte_code.buf + last_atom_start + 1, len);
+                    } else if (quant_max == INT32_MAX) {
+                        dbuf_insert(&s->byte_code, last_atom_start, 5 + add_zero_advance_check);
+                        s->byte_code.buf[last_atom_start] = REOP_split_goto_first +
+                            greedy;
+                        put_u32(s->byte_code.buf + last_atom_start + 1,
+                                len + 5 + add_zero_advance_check);
+                        if (add_zero_advance_check) {
+                            /* avoid infinite loop by stoping the
+                               recursion if no advance was made in the
+                               atom (only works if the atom has no
+                               side effect) */
+                            s->byte_code.buf[last_atom_start + 1 + 4] = REOP_push_char_pos;
+                            re_emit_goto(s, REOP_bne_char_pos, last_atom_start); 
+                        } else {
+                            re_emit_goto(s, REOP_goto, last_atom_start);
+                        }
+                    } else {
+                        dbuf_insert(&s->byte_code, last_atom_start, 10);
+                        pos = last_atom_start;
+                        s->byte_code.buf[pos++] = REOP_push_i32;
+                        put_u32(s->byte_code.buf + pos, quant_max);
+                        pos += 4;
+                        s->byte_code.buf[pos++] = REOP_split_goto_first + greedy;
+                        put_u32(s->byte_code.buf + pos, len + 5);
+                        re_emit_goto(s, REOP_loop, last_atom_start + 5);
+                        re_emit_op(s, REOP_drop);
+                    }
+                } else if (quant_min == 1 && quant_max == INT32_MAX &&
+                           !add_zero_advance_check) {
+                    re_emit_goto(s, REOP_split_next_first - greedy,
+                                 last_atom_start);
+                } else {
+                    if (quant_min == 1) {
+                        /* nothing to add */
+                    } else {
+                        dbuf_insert(&s->byte_code, last_atom_start, 5);
+                        s->byte_code.buf[last_atom_start] = REOP_push_i32;
+                        put_u32(s->byte_code.buf + last_atom_start + 1,
+                                quant_min);
+                        last_atom_start += 5;
+                        re_emit_goto(s, REOP_loop, last_atom_start);
+                        re_emit_op(s, REOP_drop);
+                    }
+                    if (quant_max == INT32_MAX) {
+                        pos = s->byte_code.size;
+                        re_emit_op_u32(s, REOP_split_goto_first + greedy,
+                                       len + 5 + add_zero_advance_check);
+                        if (add_zero_advance_check)
+                            re_emit_op(s, REOP_push_char_pos);
+                        /* copy the atom */
+                        dbuf_put_self(&s->byte_code, last_atom_start, len);
+                        if (add_zero_advance_check)
+                            re_emit_goto(s, REOP_bne_char_pos, pos);
+                        else
+                            re_emit_goto(s, REOP_goto, pos);
+                    } else if (quant_max > quant_min) {
+                        re_emit_op_u32(s, REOP_push_i32, quant_max - quant_min);
+                        pos = s->byte_code.size;
+                        re_emit_op_u32(s, REOP_split_goto_first + greedy, len + 5);
+                        /* copy the atom */
+                        dbuf_put_self(&s->byte_code, last_atom_start, len);
+                        
+                        re_emit_goto(s, REOP_loop, pos);
+                        re_emit_op(s, REOP_drop);
+                    }
+                }
+                last_atom_start = -1;
+            }
+            break;
+        default:
+            break;
+        }
+    }
+ done:
+    s->buf_ptr = p;
+    return 0;
+}
+
+static int re_parse_alternative(REParseState *s, BOOL is_backward_dir)
+{
+    const uint8_t *p;
+    int ret;
+    size_t start, term_start, end, term_size;
+
+    start = s->byte_code.size;
+    for(;;) {
+        p = s->buf_ptr;
+        if (p >= s->buf_end)
+            break;
+        if (*p == '|' || *p == ')')
+            break;
+        term_start = s->byte_code.size;
+        ret = re_parse_term(s, is_backward_dir);
+        if (ret)
+            return ret;
+        if (is_backward_dir) {
+            /* reverse the order of the terms (XXX: inefficient, but
+               speed is not really critical here) */
+            end = s->byte_code.size;
+            term_size = end - term_start;
+            if (dbuf_realloc(&s->byte_code, end + term_size))
+                return -1;
+            memmove(s->byte_code.buf + start + term_size,
+                    s->byte_code.buf + start,
+                    end - start);
+            memcpy(s->byte_code.buf + start, s->byte_code.buf + end,
+                   term_size);
+        }
+    }
+    return 0;
+}
+    
+static int re_parse_disjunction(REParseState *s, BOOL is_backward_dir)
+{
+    int start, len, pos;
+
+    start = s->byte_code.size;
+    if (re_parse_alternative(s, is_backward_dir))
+        return -1;
+    while (*s->buf_ptr == '|') {
+        s->buf_ptr++;
+
+        len = s->byte_code.size - start;
+
+        /* insert a split before the first alternative */
+        dbuf_insert(&s->byte_code, start, 5);
+        s->byte_code.buf[start] = REOP_split_next_first;
+        put_u32(s->byte_code.buf + start + 1, len + 5);
+
+        pos = re_emit_op_u32(s, REOP_goto, 0);
+
+        if (re_parse_alternative(s, is_backward_dir))
+            return -1;
+        
+        /* patch the goto */
+        len = s->byte_code.size - (pos + 4);
+        put_u32(s->byte_code.buf + pos, len);
+    }
+    return 0;
+}
+
+/* the control flow is recursive so the analysis can be linear */
+static int compute_stack_size(const uint8_t *bc_buf, int bc_buf_len)
+{
+    int stack_size, stack_size_max, pos, opcode, len;
+    uint32_t val;
+    
+    stack_size = 0;
+    stack_size_max = 0;
+    bc_buf += RE_HEADER_LEN;
+    bc_buf_len -= RE_HEADER_LEN;
+    pos = 0;
+    while (pos < bc_buf_len) {
+        opcode = bc_buf[pos];
+        len = reopcode_info[opcode].size;
+        assert(opcode < REOP_COUNT);
+        assert((pos + len) <= bc_buf_len);
+        switch(opcode) {
+        case REOP_push_i32:
+        case REOP_push_char_pos:
+            stack_size++;
+            if (stack_size > stack_size_max) {
+                if (stack_size > STACK_SIZE_MAX)
+                    return -1;
+                stack_size_max = stack_size;
+            }
+            break;
+        case REOP_drop:
+        case REOP_bne_char_pos:
+            assert(stack_size > 0);
+            stack_size--;
+            break;
+        case REOP_range:
+            val = get_u16(bc_buf + pos + 1);
+            len += val * 4;
+            break;
+        case REOP_range32:
+            val = get_u16(bc_buf + pos + 1);
+            len += val * 8;
+            break;
+        }
+        pos += len;
+    }
+    return stack_size_max;
+}
+
+/* 'buf' must be a zero terminated UTF-8 string of length buf_len.
+   Return NULL if error and allocate an error message in *perror_msg,
+   otherwise the compiled bytecode and its length in plen.
+*/
+uint8_t *lre_compile(int *plen, char *error_msg, int error_msg_size,
+                     const char *buf, size_t buf_len, int re_flags,
+                     void *opaque)
+{
+    REParseState s_s, *s = &s_s;
+    int stack_size;
+    BOOL is_sticky;
+    
+    memset(s, 0, sizeof(*s));
+    s->mem_opaque = opaque;
+    s->buf_ptr = (const uint8_t *)buf;
+    s->buf_end = s->buf_ptr + buf_len;
+    s->buf_start = s->buf_ptr;
+    s->re_flags = re_flags;
+    s->is_utf16 = ((re_flags & LRE_FLAG_UTF16) != 0);
+    is_sticky = ((re_flags & LRE_FLAG_STICKY) != 0);
+    s->ignore_case = ((re_flags & LRE_FLAG_IGNORECASE) != 0);
+    s->dotall = ((re_flags & LRE_FLAG_DOTALL) != 0);
+    s->capture_count = 1;
+    s->total_capture_count = -1;
+    s->has_named_captures = -1;
+    
+    dbuf_init2(&s->byte_code, opaque, lre_realloc);
+    dbuf_init2(&s->group_names, opaque, lre_realloc);
+
+    dbuf_putc(&s->byte_code, re_flags); /* first element is the flags */
+    dbuf_putc(&s->byte_code, 0); /* second element is the number of captures */
+    dbuf_putc(&s->byte_code, 0); /* stack size */
+    dbuf_put_u32(&s->byte_code, 0); /* bytecode length */
+    
+    if (!is_sticky) {
+        /* iterate thru all positions (about the same as .*?( ... ) )
+           .  We do it without an explicit loop so that lock step
+           thread execution will be possible in an optimized
+           implementation */
+        re_emit_op_u32(s, REOP_split_goto_first, 1 + 5);
+        re_emit_op(s, REOP_any);
+        re_emit_op_u32(s, REOP_goto, -(5 + 1 + 5));
+    }
+    re_emit_op_u8(s, REOP_save_start, 0);
+
+    if (re_parse_disjunction(s, FALSE)) {
+    error:
+        dbuf_free(&s->byte_code);
+        dbuf_free(&s->group_names);
+        pstrcpy(error_msg, error_msg_size, s->u.error_msg);
+        *plen = 0;
+        return NULL;
+    }
+
+    re_emit_op_u8(s, REOP_save_end, 0);
+    
+    re_emit_op(s, REOP_match);
+
+    if (*s->buf_ptr != '\0') {
+        re_parse_error(s, "extraneous characters at the end");
+        goto error;
+    }
+
+    if (dbuf_error(&s->byte_code)) {
+        re_parse_error(s, "out of memory");
+        goto error;
+    }
+    
+    stack_size = compute_stack_size(s->byte_code.buf, s->byte_code.size);
+    if (stack_size < 0) {
+        re_parse_error(s, "too many imbricated quantifiers");
+        goto error;
+    }
+    
+    s->byte_code.buf[RE_HEADER_CAPTURE_COUNT] = s->capture_count;
+    s->byte_code.buf[RE_HEADER_STACK_SIZE] = stack_size;
+    put_u32(s->byte_code.buf + 3, s->byte_code.size - RE_HEADER_LEN);
+
+    /* add the named groups if needed */
+    if (s->group_names.size > (s->capture_count - 1)) {
+        dbuf_put(&s->byte_code, s->group_names.buf, s->group_names.size);
+        s->byte_code.buf[RE_HEADER_FLAGS] |= LRE_FLAG_NAMED_GROUPS;
+    }
+    dbuf_free(&s->group_names);
+    
+#ifdef DUMP_REOP
+    lre_dump_bytecode(s->byte_code.buf, s->byte_code.size);
+#endif
+    
+    error_msg[0] = '\0';
+    *plen = s->byte_code.size;
+    return s->byte_code.buf;
+}
+
+static BOOL is_line_terminator(uint32_t c)
+{
+    return (c == '\n' || c == '\r' || c == CP_LS || c == CP_PS);
+}
+
+static BOOL is_word_char(uint32_t c)
+{
+    return ((c >= '0' && c <= '9') ||
+            (c >= 'a' && c <= 'z') ||
+            (c >= 'A' && c <= 'Z') ||
+            (c == '_'));
+}
+
+#define GET_CHAR(c, cptr, cbuf_end)                                     \
+    do {                                                                \
+        if (cbuf_type == 0) {                                           \
+            c = *cptr++;                                                \
+        } else {                                                        \
+            uint32_t __c1;                                              \
+            c = *(uint16_t *)cptr;                                      \
+            cptr += 2;                                                  \
+            if (c >= 0xd800 && c < 0xdc00 &&                            \
+                cbuf_type == 2 && cptr < cbuf_end) {                    \
+                __c1 = *(uint16_t *)cptr;                               \
+                if (__c1 >= 0xdc00 && __c1 < 0xe000) {                  \
+                    c = (((c & 0x3ff) << 10) | (__c1 & 0x3ff)) + 0x10000; \
+                    cptr += 2;                                          \
+                }                                                       \
+            }                                                           \
+        }                                                               \
+    } while (0)
+
+#define PEEK_CHAR(c, cptr, cbuf_end)             \
+    do {                                         \
+        if (cbuf_type == 0) {                    \
+            c = cptr[0];                         \
+        } else {                                 \
+            uint32_t __c1;                                              \
+            c = ((uint16_t *)cptr)[0];                                  \
+            if (c >= 0xd800 && c < 0xdc00 &&                            \
+                cbuf_type == 2 && (cptr + 2) < cbuf_end) {              \
+                __c1 = ((uint16_t *)cptr)[1];                           \
+                if (__c1 >= 0xdc00 && __c1 < 0xe000) {                  \
+                    c = (((c & 0x3ff) << 10) | (__c1 & 0x3ff)) + 0x10000; \
+                }                                                       \
+            }                                                           \
+        }                                        \
+    } while (0)
+
+#define PEEK_PREV_CHAR(c, cptr, cbuf_start)                 \
+    do {                                         \
+        if (cbuf_type == 0) {                    \
+            c = cptr[-1];                        \
+        } else {                                 \
+            uint32_t __c1;                                              \
+            c = ((uint16_t *)cptr)[-1];                                 \
+            if (c >= 0xdc00 && c < 0xe000 &&                            \
+                cbuf_type == 2 && (cptr - 4) >= cbuf_start) {              \
+                __c1 = ((uint16_t *)cptr)[-2];                          \
+                if (__c1 >= 0xd800 && __c1 < 0xdc00 ) {                 \
+                    c = (((__c1 & 0x3ff) << 10) | (c & 0x3ff)) + 0x10000; \
+                }                                                       \
+            }                                                           \
+        }                                                               \
+    } while (0)
+
+#define GET_PREV_CHAR(c, cptr, cbuf_start)       \
+    do {                                         \
+        if (cbuf_type == 0) {                    \
+            cptr--;                              \
+            c = cptr[0];                         \
+        } else {                                 \
+            uint32_t __c1;                                              \
+            cptr -= 2;                                                  \
+            c = ((uint16_t *)cptr)[0];                                 \
+            if (c >= 0xdc00 && c < 0xe000 &&                            \
+                cbuf_type == 2 && cptr > cbuf_start) {                  \
+                __c1 = ((uint16_t *)cptr)[-1];                          \
+                if (__c1 >= 0xd800 && __c1 < 0xdc00 ) {                 \
+                    cptr -= 2;                                          \
+                    c = (((__c1 & 0x3ff) << 10) | (c & 0x3ff)) + 0x10000; \
+                }                                                       \
+            }                                                           \
+        }                                                               \
+    } while (0)
+
+#define PREV_CHAR(cptr, cbuf_start)       \
+    do {                                  \
+        if (cbuf_type == 0) {             \
+            cptr--;                       \
+        } else {                          \
+            cptr -= 2;                          \
+            if (cbuf_type == 2) {                                       \
+                c = ((uint16_t *)cptr)[0];                              \
+                if (c >= 0xdc00 && c < 0xe000 && cptr > cbuf_start) {   \
+                    c = ((uint16_t *)cptr)[-1];                         \
+                    if (c >= 0xd800 && c < 0xdc00)                      \
+                        cptr -= 2;                                      \
+                }                                                       \
+            }                                                           \
+        }                                                               \
+    } while (0)
+
+typedef uintptr_t StackInt;
+
+typedef enum {
+    RE_EXEC_STATE_SPLIT,
+    RE_EXEC_STATE_LOOKAHEAD,
+    RE_EXEC_STATE_NEGATIVE_LOOKAHEAD,
+    RE_EXEC_STATE_GREEDY_QUANT,
+} REExecStateEnum;
+
+typedef struct REExecState {
+    REExecStateEnum type : 8;
+    uint8_t stack_len;
+    size_t count; /* only used for RE_EXEC_STATE_GREEDY_QUANT */
+    const uint8_t *cptr;
+    const uint8_t *pc;
+    void *buf[0];
+} REExecState;
+
+typedef struct {
+    const uint8_t *cbuf;
+    const uint8_t *cbuf_end;
+    /* 0 = 8 bit chars, 1 = 16 bit chars, 2 = 16 bit chars, UTF-16 */
+    int cbuf_type; 
+    int capture_count;
+    int stack_size_max;
+    BOOL multi_line;
+    BOOL ignore_case;
+    BOOL is_utf16;
+    void *opaque; /* used for stack overflow check */
+
+    size_t state_size;
+    uint8_t *state_stack;
+    size_t state_stack_size;
+    size_t state_stack_len;
+} REExecContext;
+
+static int push_state(REExecContext *s,
+                      uint8_t **capture,
+                      StackInt *stack, size_t stack_len,
+                      const uint8_t *pc, const uint8_t *cptr,
+                      REExecStateEnum type, size_t count)
+{
+    REExecState *rs;
+    uint8_t *new_stack;
+    size_t new_size, i, n;
+    StackInt *stack_buf;
+
+    if (unlikely((s->state_stack_len + 1) > s->state_stack_size)) {
+        /* reallocate the stack */
+        new_size = s->state_stack_size * 3 / 2;
+        if (new_size < 8)
+            new_size = 8;
+        new_stack = lre_realloc(s->opaque, s->state_stack, new_size * s->state_size);
+        if (!new_stack)
+            return -1;
+        s->state_stack_size = new_size;
+        s->state_stack = new_stack;
+    }
+    rs = (REExecState *)(s->state_stack + s->state_stack_len * s->state_size);
+    s->state_stack_len++;
+    rs->type = type;
+    rs->count = count;
+    rs->stack_len = stack_len;
+    rs->cptr = cptr;
+    rs->pc = pc;
+    n = 2 * s->capture_count;
+    for(i = 0; i < n; i++)
+        rs->buf[i] = capture[i];
+    stack_buf = (StackInt *)(rs->buf + n);
+    for(i = 0; i < stack_len; i++)
+        stack_buf[i] = stack[i];
+    return 0;
+}
+
+/* return 1 if match, 0 if not match or -1 if error. */
+static intptr_t lre_exec_backtrack(REExecContext *s, uint8_t **capture,
+                                   StackInt *stack, int stack_len,
+                                   const uint8_t *pc, const uint8_t *cptr,
+                                   BOOL no_recurse)
+{
+    int opcode, ret;
+    int cbuf_type;
+    uint32_t val, c;
+    const uint8_t *cbuf_end;
+    
+    cbuf_type = s->cbuf_type;
+    cbuf_end = s->cbuf_end;
+
+    for(;;) {
+        //        printf("top=%p: pc=%d\n", th_list.top, (int)(pc - (bc_buf + RE_HEADER_LEN)));
+        opcode = *pc++;
+        switch(opcode) {
+        case REOP_match:
+            {
+                REExecState *rs;
+                if (no_recurse)
+                    return (intptr_t)cptr;
+                ret = 1;
+                goto recurse;
+            no_match:
+                if (no_recurse)
+                    return 0;
+                ret = 0;
+            recurse:
+                for(;;) {
+                    if (s->state_stack_len == 0)
+                        return ret;
+                    rs = (REExecState *)(s->state_stack +
+                                         (s->state_stack_len - 1) * s->state_size);
+                    if (rs->type == RE_EXEC_STATE_SPLIT) {
+                        if (!ret) {
+                        pop_state:
+                            memcpy(capture, rs->buf,
+                                   sizeof(capture[0]) * 2 * s->capture_count);
+                        pop_state1:
+                            pc = rs->pc;
+                            cptr = rs->cptr;
+                            stack_len = rs->stack_len;
+                            memcpy(stack, rs->buf + 2 * s->capture_count,
+                                   stack_len * sizeof(stack[0]));
+                            s->state_stack_len--;
+                            break;
+                        }
+                    } else if (rs->type == RE_EXEC_STATE_GREEDY_QUANT) {
+                        if (!ret) {
+                            uint32_t char_count, i;
+                            memcpy(capture, rs->buf,
+                                   sizeof(capture[0]) * 2 * s->capture_count);
+                            stack_len = rs->stack_len;
+                            memcpy(stack, rs->buf + 2 * s->capture_count,
+                                   stack_len * sizeof(stack[0]));
+                            pc = rs->pc;
+                            cptr = rs->cptr;
+                            /* go backward */
+                            char_count = get_u32(pc + 12);
+                            for(i = 0; i < char_count; i++) {
+                                PREV_CHAR(cptr, s->cbuf);
+                            }
+                            pc = (pc + 16) + (int)get_u32(pc);
+                            rs->cptr = cptr;
+                            rs->count--;
+                            if (rs->count == 0) {
+                                s->state_stack_len--;
+                            }
+                            break;
+                        }
+                    } else {
+                        ret = ((rs->type == RE_EXEC_STATE_LOOKAHEAD && ret) ||
+                               (rs->type == RE_EXEC_STATE_NEGATIVE_LOOKAHEAD && !ret));
+                        if (ret) {
+                            /* keep the capture in case of positive lookahead */
+                            if (rs->type == RE_EXEC_STATE_LOOKAHEAD)
+                                goto pop_state1;
+                            else
+                                goto pop_state;
+                        }
+                    }
+                    s->state_stack_len--;
+                }
+            }
+            break;
+        case REOP_char32:
+            val = get_u32(pc);
+            pc += 4;
+            goto test_char;
+        case REOP_char:
+            val = get_u16(pc);
+            pc += 2;
+        test_char:
+            if (cptr >= cbuf_end)
+                goto no_match;
+            GET_CHAR(c, cptr, cbuf_end);
+            if (s->ignore_case) {
+                c = lre_canonicalize(c, s->is_utf16);
+            }
+            if (val != c)
+                goto no_match;
+            break;
+        case REOP_split_goto_first:
+        case REOP_split_next_first:
+            {
+                const uint8_t *pc1;
+                
+                val = get_u32(pc);
+                pc += 4;
+                if (opcode == REOP_split_next_first) {
+                    pc1 = pc + (int)val;
+                } else {
+                    pc1 = pc;
+                    pc = pc + (int)val;
+                }
+                ret = push_state(s, capture, stack, stack_len,
+                                 pc1, cptr, RE_EXEC_STATE_SPLIT, 0);
+                if (ret < 0)
+                    return -1;
+                break;
+            }
+        case REOP_lookahead:
+        case REOP_negative_lookahead:
+            val = get_u32(pc);
+            pc += 4;
+            ret = push_state(s, capture, stack, stack_len,
+                             pc + (int)val, cptr,
+                             RE_EXEC_STATE_LOOKAHEAD + opcode - REOP_lookahead,
+                             0);
+            if (ret < 0)
+                return -1;
+            break;
+            
+        case REOP_goto:
+            val = get_u32(pc);
+            pc += 4 + (int)val;
+            break;
+        case REOP_line_start:
+            if (cptr == s->cbuf)
+                break;
+            if (!s->multi_line)
+                goto no_match;
+            PEEK_PREV_CHAR(c, cptr, s->cbuf);
+            if (!is_line_terminator(c))
+                goto no_match;
+            break;
+        case REOP_line_end:
+            if (cptr == cbuf_end)
+                break;
+            if (!s->multi_line)
+                goto no_match;
+            PEEK_CHAR(c, cptr, cbuf_end);
+            if (!is_line_terminator(c))
+                goto no_match;
+            break;
+        case REOP_dot:
+            if (cptr == cbuf_end)
+                goto no_match;
+            GET_CHAR(c, cptr, cbuf_end);
+            if (is_line_terminator(c))
+                goto no_match;
+            break;
+        case REOP_any:
+            if (cptr == cbuf_end)
+                goto no_match;
+            GET_CHAR(c, cptr, cbuf_end);
+            break;
+        case REOP_save_start:
+        case REOP_save_end:
+            val = *pc++;
+            assert(val < s->capture_count);
+            capture[2 * val + opcode - REOP_save_start] = (uint8_t *)cptr;
+            break;
+        case REOP_save_reset:
+            {
+                uint32_t val2;
+                val = pc[0];
+                val2 = pc[1];
+                pc += 2;
+                assert(val2 < s->capture_count);
+                while (val <= val2) {
+                    capture[2 * val] = NULL;
+                    capture[2 * val + 1] = NULL;
+                    val++;
+                }
+            }
+            break;
+        case REOP_push_i32:
+            val = get_u32(pc);
+            pc += 4;
+            stack[stack_len++] = val;
+            break;
+        case REOP_drop:
+            stack_len--;
+            break;
+        case REOP_loop:
+            val = get_u32(pc);
+            pc += 4;
+            if (--stack[stack_len - 1] != 0) {
+                pc += (int)val;
+            }
+            break;
+        case REOP_push_char_pos:
+            stack[stack_len++] = (uintptr_t)cptr;
+            break;
+        case REOP_bne_char_pos:
+            val = get_u32(pc);
+            pc += 4;
+            if (stack[--stack_len] != (uintptr_t)cptr)
+                pc += (int)val;
+            break;
+        case REOP_word_boundary:
+        case REOP_not_word_boundary:
+            {
+                BOOL v1, v2;
+                /* char before */
+                if (cptr == s->cbuf) {
+                    v1 = FALSE;
+                } else {
+                    PEEK_PREV_CHAR(c, cptr, s->cbuf);
+                    v1 = is_word_char(c);
+                }
+                /* current char */
+                if (cptr >= cbuf_end) {
+                    v2 = FALSE;
+                } else {
+                    PEEK_CHAR(c, cptr, cbuf_end);
+                    v2 = is_word_char(c);
+                }
+                if (v1 ^ v2 ^ (REOP_not_word_boundary - opcode))
+                    goto no_match;
+            }
+            break;
+        case REOP_back_reference:
+        case REOP_backward_back_reference:
+            {
+                const uint8_t *cptr1, *cptr1_end, *cptr1_start;
+                uint32_t c1, c2;
+                
+                val = *pc++;
+                if (val >= s->capture_count)
+                    goto no_match;
+                cptr1_start = capture[2 * val];
+                cptr1_end = capture[2 * val + 1];
+                if (!cptr1_start || !cptr1_end)
+                    break;
+                if (opcode == REOP_back_reference) {
+                    cptr1 = cptr1_start;
+                    while (cptr1 < cptr1_end) {
+                        if (cptr >= cbuf_end)
+                            goto no_match;
+                        GET_CHAR(c1, cptr1, cptr1_end);
+                        GET_CHAR(c2, cptr, cbuf_end);
+                        if (s->ignore_case) {
+                            c1 = lre_canonicalize(c1, s->is_utf16);
+                            c2 = lre_canonicalize(c2, s->is_utf16);
+                        }
+                        if (c1 != c2)
+                            goto no_match;
+                    }
+                } else {
+                    cptr1 = cptr1_end;
+                    while (cptr1 > cptr1_start) {
+                        if (cptr == s->cbuf)
+                            goto no_match;
+                        GET_PREV_CHAR(c1, cptr1, cptr1_start);
+                        GET_PREV_CHAR(c2, cptr, s->cbuf);
+                        if (s->ignore_case) {
+                            c1 = lre_canonicalize(c1, s->is_utf16);
+                            c2 = lre_canonicalize(c2, s->is_utf16);
+                        }
+                        if (c1 != c2)
+                            goto no_match;
+                    }
+                }
+            }
+            break;
+        case REOP_range:
+            {
+                int n;
+                uint32_t low, high, idx_min, idx_max, idx;
+                
+                n = get_u16(pc); /* n must be >= 1 */
+                pc += 2;
+                if (cptr >= cbuf_end)
+                    goto no_match;
+                GET_CHAR(c, cptr, cbuf_end);
+                if (s->ignore_case) {
+                    c = lre_canonicalize(c, s->is_utf16);
+                }
+                idx_min = 0;
+                low = get_u16(pc + 0 * 4);
+                if (c < low)
+                    goto no_match;
+                idx_max = n - 1;
+                high = get_u16(pc + idx_max * 4 + 2);
+                /* 0xffff in for last value means +infinity */
+                if (unlikely(c >= 0xffff) && high == 0xffff)
+                    goto range_match;
+                if (c > high)
+                    goto no_match;
+                while (idx_min <= idx_max) {
+                    idx = (idx_min + idx_max) / 2;
+                    low = get_u16(pc + idx * 4);
+                    high = get_u16(pc + idx * 4 + 2);
+                    if (c < low)
+                        idx_max = idx - 1;
+                    else if (c > high)
+                        idx_min = idx + 1;
+                    else
+                        goto range_match;
+                }
+                goto no_match;
+            range_match:
+                pc += 4 * n;
+            }
+            break;
+        case REOP_range32:
+            {
+                int n;
+                uint32_t low, high, idx_min, idx_max, idx;
+                
+                n = get_u16(pc); /* n must be >= 1 */
+                pc += 2;
+                if (cptr >= cbuf_end)
+                    goto no_match;
+                GET_CHAR(c, cptr, cbuf_end);
+                if (s->ignore_case) {
+                    c = lre_canonicalize(c, s->is_utf16);
+                }
+                idx_min = 0;
+                low = get_u32(pc + 0 * 8);
+                if (c < low)
+                    goto no_match;
+                idx_max = n - 1;
+                high = get_u32(pc + idx_max * 8 + 4);
+                if (c > high)
+                    goto no_match;
+                while (idx_min <= idx_max) {
+                    idx = (idx_min + idx_max) / 2;
+                    low = get_u32(pc + idx * 8);
+                    high = get_u32(pc + idx * 8 + 4);
+                    if (c < low)
+                        idx_max = idx - 1;
+                    else if (c > high)
+                        idx_min = idx + 1;
+                    else
+                        goto range32_match;
+                }
+                goto no_match;
+            range32_match:
+                pc += 8 * n;
+            }
+            break;
+        case REOP_prev:
+            /* go to the previous char */
+            if (cptr == s->cbuf)
+                goto no_match;
+            PREV_CHAR(cptr, s->cbuf);
+            break;
+        case REOP_simple_greedy_quant:
+            {
+                uint32_t next_pos, quant_min, quant_max;
+                size_t q;
+                intptr_t res;
+                const uint8_t *pc1;
+                
+                next_pos = get_u32(pc);
+                quant_min = get_u32(pc + 4);
+                quant_max = get_u32(pc + 8);
+                pc += 16;
+                pc1 = pc;
+                pc += (int)next_pos;
+                
+                q = 0;
+                for(;;) {
+                    res = lre_exec_backtrack(s, capture, stack, stack_len,
+                                             pc1, cptr, TRUE);
+                    if (res < 0)
+                        return res;
+                    if (!res)
+                        break;
+                    cptr = (uint8_t *)res;
+                    q++;
+                    if (q >= quant_max && quant_max != INT32_MAX)
+                        break;
+                }
+                if (q < quant_min)
+                    goto no_match;
+                if (q > quant_min) {
+                    /* will examine all matches down to quant_min */
+                    ret = push_state(s, capture, stack, stack_len,
+                                     pc1 - 16, cptr,
+                                     RE_EXEC_STATE_GREEDY_QUANT,
+                                     q - quant_min);
+                    if (ret < 0)
+                        return -1;
+                }
+            }
+            break;
+        default:
+            abort();
+        }
+    }
+}
+
+/* Return 1 if match, 0 if not match or -1 if error. cindex is the
+   starting position of the match and must be such as 0 <= cindex <=
+   clen. */
+int lre_exec(uint8_t **capture,
+             const uint8_t *bc_buf, const uint8_t *cbuf, int cindex, int clen,
+             int cbuf_type, void *opaque)
+{
+    REExecContext s_s, *s = &s_s;
+    int re_flags, i, alloca_size, ret;
+    StackInt *stack_buf;
+    
+    re_flags = bc_buf[RE_HEADER_FLAGS];
+    s->multi_line = (re_flags & LRE_FLAG_MULTILINE) != 0;
+    s->ignore_case = (re_flags & LRE_FLAG_IGNORECASE) != 0;
+    s->is_utf16 = (re_flags & LRE_FLAG_UTF16) != 0;
+    s->capture_count = bc_buf[RE_HEADER_CAPTURE_COUNT];
+    s->stack_size_max = bc_buf[RE_HEADER_STACK_SIZE];
+    s->cbuf = cbuf;
+    s->cbuf_end = cbuf + (clen << cbuf_type);
+    s->cbuf_type = cbuf_type;
+    if (s->cbuf_type == 1 && s->is_utf16)
+        s->cbuf_type = 2;
+    s->opaque = opaque;
+
+    s->state_size = sizeof(REExecState) +
+        s->capture_count * sizeof(capture[0]) * 2 +
+        s->stack_size_max * sizeof(stack_buf[0]);
+    s->state_stack = NULL;
+    s->state_stack_len = 0;
+    s->state_stack_size = 0;
+    
+    for(i = 0; i < s->capture_count * 2; i++)
+        capture[i] = NULL;
+    alloca_size = s->stack_size_max * sizeof(stack_buf[0]);
+    stack_buf = alloca(alloca_size);
+    ret = lre_exec_backtrack(s, capture, stack_buf, 0, bc_buf + RE_HEADER_LEN,
+                             cbuf + (cindex << cbuf_type), FALSE);
+    lre_realloc(s->opaque, s->state_stack, 0);
+    return ret;
+}
+
+int lre_get_capture_count(const uint8_t *bc_buf)
+{
+    return bc_buf[RE_HEADER_CAPTURE_COUNT];
+}
+
+int lre_get_flags(const uint8_t *bc_buf)
+{
+    return bc_buf[RE_HEADER_FLAGS];
+}
+
+#ifdef TEST
+
+BOOL lre_check_stack_overflow(void *opaque, size_t alloca_size)
+{
+    return FALSE;
+}
+
+void *lre_realloc(void *opaque, void *ptr, size_t size)
+{
+    return realloc(ptr, size);
+}
+
+int main(int argc, char **argv)
+{
+    int len, ret, i;
+    uint8_t *bc;
+    char error_msg[64];
+    uint8_t *capture[CAPTURE_COUNT_MAX * 2];
+    const char *input;
+    int input_len, capture_count;
+    
+    if (argc < 3) {
+        printf("usage: %s regexp input\n", argv[0]);
+        exit(1);
+    }
+    bc = lre_compile(&len, error_msg, sizeof(error_msg), argv[1], 0, 0, NULL);
+    if (!bc) {
+        fprintf(stderr, "error: %s\n", error_msg);
+        exit(1);
+    }
+
+    input = argv[2];
+    input_len = strlen(input);
+    
+    ret = lre_exec(capture, bc, (uint8_t *)input, 0, input_len, 0, NULL);
+    printf("ret=%d\n", ret);
+    if (ret == 1) {
+        capture_count = lre_get_capture_count(bc);
+        for(i = 0; i < 2 * capture_count; i++) {
+            uint8_t *ptr;
+            ptr = capture[i];
+            printf("%d: ", i);
+            if (!ptr)
+                printf("<nil>");
+            else
+                printf("%u", (int)(ptr - (uint8_t *)input));
+            printf("\n");
+        }
+    }
+    return 0;
+}
+#endif
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp.h
new file mode 100755
index 00000000..cd0b24f2
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libregexp.h
@@ -0,0 +1,91 @@
+/*
+ * Regular Expression Engine
+ * 
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#ifndef LIBREGEXP_H
+#define LIBREGEXP_H
+
+#include <stddef.h>
+
+#include "libunicode.h"
+
+#define LRE_BOOL  int       /* for documentation purposes */
+
+#define LRE_FLAG_GLOBAL     (1 << 0)
+#define LRE_FLAG_IGNORECASE (1 << 1)
+#define LRE_FLAG_MULTILINE  (1 << 2)
+#define LRE_FLAG_DOTALL     (1 << 3)
+#define LRE_FLAG_UTF16      (1 << 4)
+#define LRE_FLAG_STICKY     (1 << 5)
+
+#define LRE_FLAG_NAMED_GROUPS (1 << 7) /* named groups are present in the regexp */
+
+uint8_t *lre_compile(int *plen, char *error_msg, int error_msg_size,
+                     const char *buf, size_t buf_len, int re_flags,
+                     void *opaque);
+int lre_get_capture_count(const uint8_t *bc_buf);
+int lre_get_flags(const uint8_t *bc_buf);
+int lre_exec(uint8_t **capture,
+             const uint8_t *bc_buf, const uint8_t *cbuf, int cindex, int clen,
+             int cbuf_type, void *opaque);
+
+int lre_parse_escape(const uint8_t **pp, int allow_utf16);
+LRE_BOOL lre_is_space(int c);
+
+/* must be provided by the user */
+LRE_BOOL lre_check_stack_overflow(void *opaque, size_t alloca_size); 
+void *lre_realloc(void *opaque, void *ptr, size_t size);
+
+/* JS identifier test */
+extern uint32_t const lre_id_start_table_ascii[4];
+extern uint32_t const lre_id_continue_table_ascii[4];
+
+static inline int lre_js_is_ident_first(int c)
+{
+    if ((uint32_t)c < 128) {
+        return (lre_id_start_table_ascii[c >> 5] >> (c & 31)) & 1;
+    } else {
+#ifdef CONFIG_ALL_UNICODE
+        return lre_is_id_start(c);
+#else
+        return !lre_is_space(c);
+#endif
+    }
+}
+
+static inline int lre_js_is_ident_next(int c)
+{
+    if ((uint32_t)c < 128) {
+        return (lre_id_continue_table_ascii[c >> 5] >> (c & 31)) & 1;
+    } else {
+        /* ZWNJ and ZWJ are accepted in identifiers */
+#ifdef CONFIG_ALL_UNICODE
+        return lre_is_id_continue(c) || c == 0x200C || c == 0x200D;
+#else
+        return !lre_is_space(c) || c == 0x200C || c == 0x200D;
+#endif
+    }
+}
+
+#undef LRE_BOOL
+
+#endif /* LIBREGEXP_H */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode-table.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode-table.h
new file mode 100755
index 00000000..76ec87c4
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode-table.h
@@ -0,0 +1,4269 @@
+/* Compressed unicode tables */
+/* Automatically generated file - do not edit */
+
+#include <stdint.h>
+
+static const uint32_t case_conv_table1[352] = {
+    0x00209a30, 0x00309a00, 0x005a8173, 0x00601730,
+    0x006c0730, 0x006f81b3, 0x00701700, 0x007c0700,
+    0x007f8100, 0x00803040, 0x009801c3, 0x00988190,
+    0x00990640, 0x009c9040, 0x00a481b4, 0x00a52e40,
+    0x00bc0130, 0x00bc8640, 0x00bf8170, 0x00c00100,
+    0x00c08130, 0x00c10440, 0x00c30130, 0x00c38240,
+    0x00c48230, 0x00c58240, 0x00c70130, 0x00c78130,
+    0x00c80130, 0x00c88240, 0x00c98130, 0x00ca0130,
+    0x00ca8100, 0x00cb0130, 0x00cb8130, 0x00cc0240,
+    0x00cd0100, 0x00ce0130, 0x00ce8130, 0x00cf0100,
+    0x00cf8130, 0x00d00640, 0x00d30130, 0x00d38240,
+    0x00d48130, 0x00d60240, 0x00d70130, 0x00d78240,
+    0x00d88230, 0x00d98440, 0x00db8130, 0x00dc0240,
+    0x00de0240, 0x00df8100, 0x00e20350, 0x00e38350,
+    0x00e50350, 0x00e69040, 0x00ee8100, 0x00ef1240,
+    0x00f801b4, 0x00f88350, 0x00fa0240, 0x00fb0130,
+    0x00fb8130, 0x00fc2840, 0x01100130, 0x01111240,
+    0x011d0131, 0x011d8240, 0x011e8130, 0x011f0131,
+    0x011f8201, 0x01208240, 0x01218130, 0x01220130,
+    0x01228130, 0x01230a40, 0x01280101, 0x01288101,
+    0x01290101, 0x01298100, 0x012a0100, 0x012b0200,
+    0x012c8100, 0x012d8100, 0x012e0101, 0x01300100,
+    0x01308101, 0x01318100, 0x01328101, 0x01330101,
+    0x01340100, 0x01348100, 0x01350101, 0x01358101,
+    0x01360101, 0x01378100, 0x01388101, 0x01390100,
+    0x013a8100, 0x013e8101, 0x01400100, 0x01418100,
+    0x01438101, 0x01440100, 0x01448100, 0x01450200,
+    0x01460100, 0x01490100, 0x014e8101, 0x014f0101,
+    0x01a28173, 0x01b80440, 0x01bb0240, 0x01bd8300,
+    0x01bf8130, 0x01c30130, 0x01c40330, 0x01c60130,
+    0x01c70230, 0x01c801d0, 0x01c89130, 0x01d18930,
+    0x01d60100, 0x01d68300, 0x01d801d3, 0x01d89100,
+    0x01e10173, 0x01e18900, 0x01e60100, 0x01e68200,
+    0x01e78130, 0x01e80173, 0x01e88173, 0x01ea8173,
+    0x01eb0173, 0x01eb8100, 0x01ec1840, 0x01f80173,
+    0x01f88173, 0x01f90100, 0x01f98100, 0x01fa01a0,
+    0x01fa8173, 0x01fb8240, 0x01fc8130, 0x01fd0240,
+    0x01fe8330, 0x02001030, 0x02082030, 0x02182000,
+    0x02281000, 0x02302240, 0x02453640, 0x02600130,
+    0x02608e40, 0x02678100, 0x02686040, 0x0298a630,
+    0x02b0a600, 0x02c381b5, 0x08502631, 0x08638131,
+    0x08668131, 0x08682b00, 0x087e8300, 0x09d05011,
+    0x09f80610, 0x09fc0620, 0x0e400174, 0x0e408174,
+    0x0e410174, 0x0e418174, 0x0e420174, 0x0e428174,
+    0x0e430174, 0x0e438180, 0x0e440180, 0x0e482b30,
+    0x0e5e8330, 0x0ebc8101, 0x0ebe8101, 0x0f007e40,
+    0x0f3f1840, 0x0f4b01b5, 0x0f4b81b6, 0x0f4c01b6,
+    0x0f4c81b6, 0x0f4d01b7, 0x0f4d8180, 0x0f4f0130,
+    0x0f506040, 0x0f800800, 0x0f840830, 0x0f880600,
+    0x0f8c0630, 0x0f900800, 0x0f940830, 0x0f980800,
+    0x0f9c0830, 0x0fa00600, 0x0fa40630, 0x0fa801b0,
+    0x0fa88100, 0x0fa901d3, 0x0fa98100, 0x0faa01d3,
+    0x0faa8100, 0x0fab01d3, 0x0fab8100, 0x0fac8130,
+    0x0fad8130, 0x0fae8130, 0x0faf8130, 0x0fb00800,
+    0x0fb40830, 0x0fb80200, 0x0fb90400, 0x0fbb0200,
+    0x0fbc0201, 0x0fbd0201, 0x0fbe0201, 0x0fc008b7,
+    0x0fc40867, 0x0fc808b8, 0x0fcc0868, 0x0fd008b8,
+    0x0fd40868, 0x0fd80200, 0x0fd901b9, 0x0fd981b1,
+    0x0fda01b9, 0x0fdb01b1, 0x0fdb81d7, 0x0fdc0230,
+    0x0fdd0230, 0x0fde0161, 0x0fdf0173, 0x0fe101b9,
+    0x0fe181b2, 0x0fe201ba, 0x0fe301b2, 0x0fe381d8,
+    0x0fe40430, 0x0fe60162, 0x0fe80200, 0x0fe901d0,
+    0x0fe981d0, 0x0feb01b0, 0x0feb81d0, 0x0fec0230,
+    0x0fed0230, 0x0ff00201, 0x0ff101d3, 0x0ff181d3,
+    0x0ff201ba, 0x0ff28101, 0x0ff301b0, 0x0ff381d3,
+    0x0ff40230, 0x0ff50230, 0x0ff60131, 0x0ff901ba,
+    0x0ff981b2, 0x0ffa01bb, 0x0ffb01b2, 0x0ffb81d9,
+    0x0ffc0230, 0x0ffd0230, 0x0ffe0162, 0x109301a0,
+    0x109501a0, 0x109581a0, 0x10990131, 0x10a70101,
+    0x10b01031, 0x10b81001, 0x10c18240, 0x125b1a31,
+    0x12681a01, 0x16002f31, 0x16182f01, 0x16300240,
+    0x16310130, 0x16318130, 0x16320130, 0x16328100,
+    0x16330100, 0x16338640, 0x16368130, 0x16370130,
+    0x16378130, 0x16380130, 0x16390240, 0x163a8240,
+    0x163f0230, 0x16406440, 0x16758440, 0x16790240,
+    0x16802600, 0x16938100, 0x16968100, 0x53202e40,
+    0x53401c40, 0x53910e40, 0x53993e40, 0x53bc8440,
+    0x53be8130, 0x53bf0a40, 0x53c58240, 0x53c68130,
+    0x53c80440, 0x53cb1440, 0x53d50130, 0x53d58130,
+    0x53d60130, 0x53d68130, 0x53d70130, 0x53d80130,
+    0x53d88130, 0x53d90130, 0x53d98131, 0x53da0640,
+    0x55a98101, 0x55b85020, 0x7d8001b2, 0x7d8081b2,
+    0x7d8101b2, 0x7d8181da, 0x7d8201da, 0x7d8281b3,
+    0x7d8301b3, 0x7d8981bb, 0x7d8a01bb, 0x7d8a81bb,
+    0x7d8b01bc, 0x7d8b81bb, 0x7f909a31, 0x7fa09a01,
+    0x82002831, 0x82142801, 0x82582431, 0x826c2401,
+    0x86403331, 0x86603301, 0x8c502031, 0x8c602001,
+    0xb7202031, 0xb7302001, 0xf4802231, 0xf4912201,
+};
+
+static const uint8_t case_conv_table2[352] = {
+    0x01, 0x00, 0x9c, 0x06, 0x07, 0x4d, 0x03, 0x04,
+    0x10, 0x00, 0x8f, 0x0b, 0x00, 0x00, 0x11, 0x00,
+    0x08, 0x00, 0x53, 0x4a, 0x51, 0x00, 0x52, 0x00,
+    0x53, 0x00, 0x3a, 0x54, 0x55, 0x00, 0x57, 0x59,
+    0x3f, 0x5d, 0x5c, 0x00, 0x46, 0x61, 0x63, 0x42,
+    0x64, 0x00, 0x66, 0x00, 0x67, 0x00, 0x69, 0x00,
+    0x6b, 0x00, 0x6d, 0x00, 0x00, 0x40, 0x00, 0x00,
+    0x00, 0x00, 0x1a, 0x00, 0x93, 0x00, 0x00, 0x20,
+    0x35, 0x00, 0x27, 0x00, 0x1f, 0x00, 0x24, 0x20,
+    0x28, 0x00, 0x13, 0x6a, 0x6c, 0x00, 0x24, 0x22,
+    0x25, 0x14, 0x16, 0x18, 0x1b, 0x1c, 0x3b, 0x1e,
+    0x3c, 0x1f, 0x37, 0x3a, 0x22, 0x21, 0x3e, 0x1c,
+    0x3d, 0x25, 0x23, 0x26, 0x28, 0x1e, 0x2a, 0x2c,
+    0x40, 0x2e, 0x4b, 0x30, 0x4c, 0x32, 0x41, 0x3f,
+    0x99, 0x00, 0x00, 0x94, 0x8e, 0x7c, 0x7d, 0x82,
+    0x83, 0x12, 0x7f, 0x81, 0x75, 0x76, 0x12, 0x7a,
+    0xa3, 0x7b, 0x77, 0x78, 0x89, 0x92, 0x98, 0xa6,
+    0xa0, 0x84, 0x00, 0x9a, 0xa1, 0x92, 0x74, 0x33,
+    0x95, 0x00, 0x8d, 0x00, 0x73, 0x98, 0x97, 0x96,
+    0x95, 0x00, 0x00, 0x9d, 0x00, 0x9b, 0x00, 0xa0,
+    0x9f, 0x15, 0x2c, 0x2d, 0x2e, 0xb3, 0xb4, 0x45,
+    0xa9, 0xa8, 0x12, 0x14, 0x1e, 0x21, 0x22, 0x22,
+    0x2a, 0x34, 0x35, 0xa5, 0xa6, 0x34, 0x1d, 0x00,
+    0x00, 0x97, 0x01, 0x5a, 0xda, 0x1d, 0x36, 0x05,
+    0x00, 0xc2, 0xc1, 0xc4, 0xc3, 0xc6, 0xc5, 0xc8,
+    0xc7, 0xca, 0xc9, 0xc4, 0xd3, 0x45, 0xd4, 0x42,
+    0xd5, 0x46, 0xd6, 0xcc, 0xce, 0xd0, 0xd2, 0xd8,
+    0xd7, 0xec, 0xf4, 0xfc, 0x0c, 0x05, 0x0d, 0x80,
+    0x9f, 0x00, 0x21, 0x80, 0xa3, 0xeb, 0x00, 0xc0,
+    0x40, 0xc6, 0x60, 0xe5, 0xd9, 0xe6, 0x99, 0xc0,
+    0x00, 0x00, 0x06, 0x60, 0xda, 0x29, 0xfb, 0x15,
+    0x12, 0x06, 0x16, 0xf6, 0xdb, 0x04, 0x15, 0x12,
+    0x84, 0x06, 0xc6, 0x16, 0xfd, 0xdd, 0x01, 0xc0,
+    0x40, 0x00, 0x46, 0x60, 0xdc, 0xde, 0x6d, 0x37,
+    0x38, 0x39, 0x13, 0x12, 0x15, 0x14, 0x00, 0x18,
+    0x17, 0x1a, 0x19, 0x00, 0x5f, 0xb6, 0x65, 0x44,
+    0x47, 0x00, 0x4f, 0x62, 0x4e, 0x50, 0x00, 0x00,
+    0x48, 0x00, 0x00, 0x00, 0xa2, 0xa3, 0xa4, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0xb5, 0x00, 0x00, 0x5a,
+    0x00, 0x00, 0x5b, 0x56, 0x58, 0x60, 0x5e, 0x6f,
+    0x68, 0x6e, 0x44, 0x00, 0x42, 0xa7, 0x8a, 0x8b,
+    0x8c, 0xab, 0xac, 0x58, 0x58, 0xaf, 0x94, 0xb0,
+    0x6f, 0xb2, 0x53, 0x52, 0x55, 0x54, 0x57, 0x56,
+    0x59, 0x58, 0x5b, 0x5a, 0x5d, 0x5c, 0x5f, 0x5e,
+};
+
+static const uint16_t case_conv_ext[58] = {
+    0x0399, 0x0308, 0x0301, 0x03a5, 0x0313, 0x0300, 0x0342, 0x0391,
+    0x0397, 0x03a9, 0x0046, 0x0049, 0x004c, 0x0053, 0x0069, 0x0307,
+    0x02bc, 0x004e, 0x004a, 0x030c, 0x0535, 0x0552, 0x0048, 0x0331,
+    0x0054, 0x0057, 0x030a, 0x0059, 0x0041, 0x02be, 0x1f08, 0x1f80,
+    0x1f28, 0x1f90, 0x1f68, 0x1fa0, 0x1fba, 0x0386, 0x1fb3, 0x1fca,
+    0x0389, 0x1fc3, 0x03a1, 0x1ffa, 0x038f, 0x1ff3, 0x0544, 0x0546,
+    0x053b, 0x054e, 0x053d, 0x03b8, 0x0462, 0xa64a, 0x1e60, 0x03c9,
+    0x006b, 0x00e5,
+};
+
+static const uint8_t unicode_prop_Cased1_table[170] = {
+    0x40, 0xa9, 0x80, 0x8e, 0x80, 0xfc, 0x80, 0xd3,
+    0x80, 0x8c, 0x80, 0x8d, 0x81, 0x8d, 0x02, 0x80,
+    0xe1, 0x80, 0x91, 0x85, 0x9a, 0x01, 0x00, 0x01,
+    0x11, 0x00, 0x01, 0x04, 0x08, 0x01, 0x08, 0x30,
+    0x08, 0x08, 0x15, 0x20, 0x00, 0x39, 0x99, 0x31,
+    0x9d, 0x84, 0x40, 0x94, 0x80, 0xd6, 0x82, 0xa6,
+    0x80, 0x41, 0x62, 0x80, 0xa6, 0x80, 0x57, 0x76,
+    0xf8, 0x02, 0x80, 0xc1, 0x40, 0xdb, 0x08, 0x80,
+    0x41, 0xd0, 0x80, 0x8c, 0x80, 0x8f, 0x8c, 0xe4,
+    0x03, 0x01, 0x89, 0x00, 0x14, 0x28, 0x10, 0x11,
+    0x02, 0x01, 0x18, 0x0b, 0x24, 0x4b, 0x26, 0x01,
+    0x01, 0x86, 0xe5, 0x80, 0x60, 0x79, 0xb6, 0x81,
+    0x40, 0x91, 0x81, 0xbd, 0x88, 0x94, 0x04, 0x81,
+    0x98, 0x80, 0xc7, 0x82, 0x43, 0x34, 0xa2, 0x06,
+    0x80, 0x89, 0x61, 0x28, 0x99, 0xd4, 0x80, 0xc6,
+    0x01, 0x08, 0x09, 0x0b, 0x80, 0x8b, 0x00, 0x06,
+    0x80, 0xc0, 0x03, 0x0f, 0x06, 0x80, 0x9b, 0x03,
+    0x04, 0x00, 0x16, 0x80, 0x41, 0x53, 0x81, 0x98,
+    0x80, 0x98, 0x80, 0x9e, 0x80, 0x98, 0x80, 0x9e,
+    0x80, 0x98, 0x80, 0x9e, 0x80, 0x98, 0x80, 0x9e,
+    0x80, 0x98, 0x07, 0x59, 0x63, 0x99, 0x85, 0x99,
+    0x85, 0x99,
+};
+
+static const uint8_t unicode_prop_Cased1_index[18] = {
+    0xb9, 0x02, 0xe0, 0xa0, 0x1e, 0x00, 0x9e, 0xa6,
+    0x00, 0xc4, 0xd4, 0x01, 0xa9, 0xd7, 0x01, 0x8a,
+    0xf1, 0x01,
+};
+
+static const uint8_t unicode_prop_Case_Ignorable_table[663] = {
+    0xa6, 0x05, 0x80, 0x8a, 0x80, 0xa2, 0x00, 0x80,
+    0xc6, 0x03, 0x00, 0x03, 0x01, 0x81, 0x41, 0xf6,
+    0x40, 0xbf, 0x19, 0x18, 0x88, 0x08, 0x80, 0x40,
+    0xfa, 0x86, 0x40, 0xce, 0x80, 0xb6, 0xac, 0x00,
+    0x01, 0x01, 0x00, 0xab, 0x80, 0x8a, 0x85, 0x89,
+    0x8a, 0x00, 0xa2, 0x80, 0x89, 0x94, 0x8f, 0x80,
+    0xe4, 0x38, 0x89, 0x03, 0xa0, 0x00, 0x80, 0x9d,
+    0x9a, 0xda, 0x8a, 0xb9, 0x8a, 0x18, 0x08, 0x97,
+    0x97, 0xaa, 0x82, 0xf6, 0xaf, 0xb6, 0x00, 0x03,
+    0x3b, 0x02, 0x86, 0x89, 0x81, 0x8c, 0x80, 0x8e,
+    0x80, 0xb9, 0x03, 0x1f, 0x80, 0x93, 0x81, 0x99,
+    0x01, 0x81, 0xb8, 0x03, 0x0b, 0x09, 0x12, 0x80,
+    0x9d, 0x0a, 0x80, 0x8a, 0x81, 0xb8, 0x03, 0x20,
+    0x0b, 0x80, 0x93, 0x81, 0x95, 0x28, 0x80, 0xb9,
+    0x01, 0x00, 0x1f, 0x07, 0x80, 0x8a, 0x81, 0x9d,
+    0x80, 0xbc, 0x80, 0x8b, 0x80, 0xb1, 0x02, 0x80,
+    0xb8, 0x14, 0x10, 0x1e, 0x81, 0x8a, 0x81, 0x9c,
+    0x80, 0xb9, 0x01, 0x05, 0x04, 0x81, 0x93, 0x81,
+    0x9b, 0x81, 0xb8, 0x0b, 0x1f, 0x80, 0x93, 0x81,
+    0xe5, 0x06, 0x10, 0x80, 0xd9, 0x01, 0x86, 0x8a,
+    0x88, 0xe1, 0x01, 0x28, 0x81, 0x88, 0x00, 0x85,
+    0xc9, 0x81, 0x9a, 0x00, 0x00, 0x80, 0xb6, 0x8d,
+    0x04, 0x01, 0x84, 0x8a, 0x80, 0xa3, 0x88, 0x80,
+    0xe5, 0x18, 0x28, 0x09, 0x81, 0x98, 0x0b, 0x82,
+    0x8f, 0x83, 0x8c, 0x01, 0x0d, 0x80, 0x8e, 0x80,
+    0xdd, 0x80, 0x42, 0x5f, 0x82, 0x43, 0xb1, 0x82,
+    0x9c, 0x82, 0x9c, 0x81, 0x9d, 0x81, 0xbf, 0x08,
+    0x37, 0x01, 0x8a, 0x10, 0x20, 0xac, 0x83, 0xb3,
+    0x80, 0xc0, 0x81, 0xa1, 0x80, 0xf5, 0x13, 0x81,
+    0x88, 0x05, 0x82, 0x40, 0xda, 0x09, 0x80, 0xb9,
+    0x00, 0x30, 0x00, 0x01, 0x3d, 0x89, 0x08, 0xa6,
+    0x07, 0x8e, 0xc0, 0x83, 0xaf, 0x00, 0x20, 0x04,
+    0x80, 0xa7, 0x88, 0x8b, 0x81, 0x9f, 0x19, 0x08,
+    0x82, 0xb7, 0x00, 0x0a, 0x00, 0x82, 0xb9, 0x39,
+    0x81, 0xbf, 0x85, 0xd1, 0x10, 0x8c, 0x06, 0x18,
+    0x28, 0x11, 0xb1, 0xbe, 0x8c, 0x80, 0xa1, 0xde,
+    0x04, 0x41, 0xbc, 0x00, 0x82, 0x8a, 0x82, 0x8c,
+    0x82, 0x8c, 0x82, 0x8c, 0x81, 0x8b, 0x27, 0x81,
+    0x89, 0x01, 0x01, 0x84, 0xb0, 0x20, 0x89, 0x00,
+    0x8c, 0x80, 0x8f, 0x8c, 0xb2, 0xa0, 0x4b, 0x8a,
+    0x81, 0xf0, 0x82, 0xfc, 0x80, 0x8e, 0x80, 0xdf,
+    0x9f, 0xae, 0x80, 0x41, 0xd4, 0x80, 0xa3, 0x1a,
+    0x24, 0x80, 0xdc, 0x85, 0xdc, 0x82, 0x60, 0x6f,
+    0x15, 0x80, 0x44, 0xe1, 0x85, 0x41, 0x0d, 0x80,
+    0xe1, 0x18, 0x89, 0x00, 0x9b, 0x83, 0xcf, 0x81,
+    0x8d, 0xa1, 0xcd, 0x80, 0x96, 0x82, 0xec, 0x0f,
+    0x02, 0x03, 0x80, 0x98, 0x81, 0x40, 0x9c, 0x81,
+    0x99, 0x91, 0x8c, 0x80, 0xa5, 0x87, 0x98, 0x8a,
+    0xad, 0x82, 0xaf, 0x01, 0x19, 0x80, 0x91, 0x80,
+    0x94, 0x81, 0xc1, 0x29, 0x09, 0x81, 0x8b, 0x07,
+    0x80, 0xa2, 0x80, 0x8a, 0x80, 0xb2, 0x00, 0x11,
+    0x0c, 0x08, 0x80, 0x9a, 0x80, 0x8d, 0x0c, 0x08,
+    0x80, 0xe3, 0x84, 0x40, 0x84, 0x01, 0x03, 0x80,
+    0x60, 0x4f, 0x2f, 0x80, 0x40, 0x92, 0x8f, 0x42,
+    0x3d, 0x8f, 0x10, 0x8b, 0x8f, 0xa1, 0x01, 0x80,
+    0x40, 0xa8, 0x06, 0x05, 0x80, 0x8a, 0x80, 0xa2,
+    0x00, 0x80, 0xae, 0x80, 0xac, 0x81, 0xc2, 0x80,
+    0x94, 0x82, 0x42, 0x00, 0x80, 0x40, 0xe1, 0x80,
+    0x40, 0x94, 0x84, 0x46, 0x85, 0x10, 0x0c, 0x83,
+    0xa7, 0x13, 0x80, 0x40, 0xa4, 0x81, 0x42, 0x3c,
+    0x83, 0x42, 0x1d, 0x8a, 0x40, 0xaf, 0x80, 0xb5,
+    0x8e, 0xb7, 0x82, 0xb0, 0x19, 0x09, 0x80, 0x8e,
+    0x80, 0xb1, 0x82, 0xa3, 0x20, 0x87, 0xbd, 0x80,
+    0x8b, 0x81, 0xb3, 0x88, 0x89, 0x83, 0xe1, 0x11,
+    0x00, 0x0d, 0x80, 0x40, 0x9f, 0x02, 0x87, 0x94,
+    0x81, 0xb8, 0x0a, 0x80, 0xa4, 0x32, 0x84, 0x40,
+    0xc2, 0x39, 0x10, 0x80, 0x96, 0x80, 0xd3, 0x28,
+    0x03, 0x08, 0x81, 0x40, 0xed, 0x1d, 0x08, 0x81,
+    0x9a, 0x81, 0xd4, 0x39, 0x00, 0x81, 0xe9, 0x00,
+    0x01, 0x28, 0x80, 0xe4, 0x11, 0x18, 0x84, 0x41,
+    0x02, 0x88, 0x01, 0x41, 0xc5, 0x89, 0xa7, 0x29,
+    0x1f, 0x80, 0x88, 0x29, 0x82, 0xad, 0x8c, 0x01,
+    0x41, 0x95, 0x30, 0x28, 0x80, 0xd1, 0x95, 0x0e,
+    0x01, 0x01, 0xf9, 0x2a, 0x00, 0x08, 0x30, 0x80,
+    0xc7, 0x0a, 0x00, 0x80, 0x41, 0x5a, 0x81, 0x60,
+    0x4b, 0xfa, 0x84, 0xba, 0x86, 0x88, 0x83, 0x44,
+    0x4a, 0x90, 0xbf, 0x81, 0x60, 0x4c, 0xba, 0x08,
+    0x83, 0x54, 0xc2, 0x82, 0x88, 0x8f, 0x0e, 0x9d,
+    0x83, 0x40, 0x93, 0x82, 0x47, 0xba, 0xb6, 0x83,
+    0xb1, 0x38, 0x8d, 0x80, 0x95, 0x20, 0x8e, 0x45,
+    0x4f, 0x30, 0x90, 0x0e, 0x01, 0x04, 0x48, 0xa4,
+    0x86, 0xec, 0x86, 0x4a, 0xaf, 0x84, 0x6c, 0x0c,
+    0x00, 0x80, 0x9d, 0xdf, 0xff, 0x40, 0xef,
+};
+
+static const uint8_t unicode_prop_Case_Ignorable_index[63] = {
+    0xc0, 0x05, 0x00, 0x2e, 0x08, 0x20, 0x52, 0x0a,
+    0x00, 0x05, 0x0c, 0x00, 0x4f, 0x0e, 0x20, 0x61,
+    0x10, 0x00, 0x44, 0x18, 0x20, 0x43, 0x1b, 0x20,
+    0xfa, 0x1d, 0x00, 0x7e, 0x2c, 0x20, 0x0d, 0xa6,
+    0x00, 0x52, 0xa9, 0x00, 0xf7, 0xaa, 0x20, 0x41,
+    0xff, 0x40, 0x28, 0x0d, 0x21, 0x3f, 0x12, 0x61,
+    0xc1, 0x15, 0x01, 0x9a, 0x1a, 0x01, 0xa0, 0x6f,
+    0x41, 0x19, 0xe0, 0x61, 0xf0, 0x01, 0x0e,
+};
+
+static const uint8_t unicode_prop_ID_Start_table[1003] = {
+    0xc0, 0x99, 0x85, 0x99, 0xae, 0x80, 0x89, 0x03,
+    0x04, 0x96, 0x80, 0x9e, 0x80, 0x41, 0xc9, 0x83,
+    0x8b, 0x8d, 0x26, 0x00, 0x80, 0x40, 0x80, 0x20,
+    0x09, 0x18, 0x05, 0x00, 0x10, 0x00, 0x93, 0x80,
+    0xd2, 0x80, 0x40, 0x8a, 0x87, 0x40, 0xa5, 0x80,
+    0xa5, 0x08, 0x85, 0xa8, 0xc6, 0x9a, 0x1b, 0xac,
+    0xaa, 0xa2, 0x08, 0xe2, 0x00, 0x8e, 0x0e, 0x81,
+    0x89, 0x11, 0x80, 0x8f, 0x00, 0x9d, 0x9c, 0xd8,
+    0x8a, 0x80, 0x97, 0xa0, 0x88, 0x0b, 0x04, 0x95,
+    0x18, 0x88, 0x02, 0x80, 0x96, 0x98, 0x86, 0x8a,
+    0xb4, 0x94, 0x07, 0xc5, 0xb5, 0x10, 0x91, 0x06,
+    0x89, 0x8e, 0x8f, 0x1f, 0x09, 0x81, 0x95, 0x06,
+    0x00, 0x13, 0x10, 0x8f, 0x80, 0x8c, 0x08, 0x82,
+    0x8d, 0x81, 0x89, 0x07, 0x2b, 0x09, 0x95, 0x06,
+    0x01, 0x01, 0x01, 0x9e, 0x18, 0x80, 0x92, 0x82,
+    0x8f, 0x88, 0x02, 0x80, 0x95, 0x06, 0x01, 0x04,
+    0x10, 0x91, 0x80, 0x8e, 0x81, 0x96, 0x80, 0x8a,
+    0x39, 0x09, 0x95, 0x06, 0x01, 0x04, 0x10, 0x9d,
+    0x08, 0x82, 0x8e, 0x80, 0x90, 0x00, 0x2a, 0x10,
+    0x1a, 0x08, 0x00, 0x0a, 0x0a, 0x12, 0x8b, 0x95,
+    0x80, 0xb3, 0x38, 0x10, 0x96, 0x80, 0x8f, 0x10,
+    0x99, 0x14, 0x81, 0x9d, 0x03, 0x38, 0x10, 0x96,
+    0x80, 0x89, 0x04, 0x10, 0x9f, 0x00, 0x81, 0x8e,
+    0x81, 0x91, 0x38, 0x10, 0xa8, 0x08, 0x8f, 0x04,
+    0x17, 0x82, 0x97, 0x2c, 0x91, 0x82, 0x97, 0x80,
+    0x88, 0x00, 0x0e, 0xb9, 0xaf, 0x01, 0x8b, 0x86,
+    0xb9, 0x08, 0x01, 0x08, 0x01, 0x05, 0x18, 0x30,
+    0x10, 0x00, 0x01, 0x08, 0x18, 0x81, 0x88, 0x01,
+    0x20, 0x80, 0x94, 0x83, 0x9f, 0x80, 0xbe, 0x38,
+    0xa3, 0x9a, 0x84, 0xf2, 0xaa, 0x93, 0x80, 0x8f,
+    0x2b, 0x1a, 0x02, 0x0e, 0x13, 0x8c, 0x8b, 0x80,
+    0x90, 0xa5, 0x00, 0x20, 0x81, 0xaa, 0x80, 0x41,
+    0x4c, 0x03, 0x0e, 0x00, 0x03, 0x81, 0xa8, 0x03,
+    0x81, 0xa0, 0x03, 0x0e, 0x00, 0x03, 0x81, 0x8e,
+    0x80, 0xb8, 0x03, 0x81, 0xc2, 0xa4, 0x8f, 0x8f,
+    0xd5, 0x0d, 0x82, 0x42, 0x6b, 0x81, 0x90, 0x80,
+    0x99, 0x84, 0xca, 0x82, 0x8a, 0x86, 0x8c, 0x03,
+    0x8d, 0x91, 0x8d, 0x91, 0x8d, 0x8c, 0x02, 0x8e,
+    0xb3, 0xa2, 0x03, 0x80, 0xc2, 0xd8, 0x86, 0xa8,
+    0x00, 0x84, 0xc5, 0x89, 0x9e, 0xb0, 0x9d, 0x0c,
+    0x8a, 0xab, 0x83, 0x99, 0xb5, 0x96, 0x88, 0xb4,
+    0xd1, 0x80, 0xdc, 0xae, 0x90, 0x86, 0xb6, 0x9d,
+    0x8c, 0x81, 0x89, 0xab, 0x99, 0xa3, 0xa8, 0x82,
+    0x89, 0xa3, 0x81, 0x88, 0x86, 0xaa, 0x0a, 0xa8,
+    0x18, 0x1a, 0x81, 0x88, 0x40, 0xbf, 0xbf, 0x41,
+    0x15, 0x0d, 0x81, 0xa5, 0x0d, 0x0f, 0x00, 0x00,
+    0x00, 0x80, 0x9e, 0x81, 0xb4, 0x06, 0x00, 0x12,
+    0x06, 0x13, 0x0d, 0x83, 0x8c, 0x22, 0x06, 0xf3,
+    0x80, 0x8c, 0x80, 0x8f, 0x8c, 0xe4, 0x03, 0x01,
+    0x89, 0x00, 0x0d, 0x28, 0x00, 0x00, 0x80, 0x8f,
+    0x0b, 0x24, 0x18, 0x90, 0xa8, 0x4a, 0x76, 0xae,
+    0x80, 0xae, 0x80, 0x40, 0x84, 0x2b, 0x11, 0x8b,
+    0xa5, 0x00, 0x20, 0x81, 0xb7, 0x30, 0x8f, 0x96,
+    0x88, 0x30, 0x30, 0x30, 0x30, 0x30, 0x30, 0x30,
+    0x86, 0x42, 0x25, 0x82, 0x98, 0x88, 0x34, 0x0c,
+    0x83, 0xd5, 0x1c, 0x80, 0xd9, 0x03, 0x84, 0xaa,
+    0x80, 0xdd, 0x90, 0x9a, 0xb4, 0x8f, 0x41, 0xff,
+    0x59, 0xb5, 0xc9, 0x60, 0x51, 0xef, 0x8f, 0x44,
+    0x8c, 0xc2, 0xad, 0x81, 0x41, 0x0c, 0x82, 0x8f,
+    0x89, 0x81, 0x93, 0xae, 0x8f, 0x9e, 0x81, 0xcf,
+    0xa6, 0x88, 0x81, 0xe6, 0x81, 0xae, 0xbc, 0x8a,
+    0x02, 0x03, 0x80, 0x96, 0x9c, 0xb3, 0x8d, 0xb1,
+    0xbd, 0x2a, 0x00, 0x81, 0x8a, 0x9b, 0x89, 0x96,
+    0x98, 0x9c, 0x86, 0xae, 0x9b, 0x80, 0x8f, 0x20,
+    0x89, 0x89, 0x20, 0xa8, 0x96, 0x10, 0x87, 0x93,
+    0x96, 0x10, 0x82, 0xb1, 0x00, 0x11, 0x0c, 0x08,
+    0x00, 0x97, 0x11, 0x8a, 0x32, 0x8b, 0x29, 0x29,
+    0x85, 0x88, 0x30, 0x30, 0xaa, 0x80, 0x89, 0x89,
+    0xf2, 0x9c, 0x60, 0x2b, 0xa3, 0x8b, 0x96, 0x83,
+    0xb0, 0x60, 0x21, 0x03, 0x41, 0x6d, 0x81, 0xe9,
+    0xa5, 0x86, 0x8b, 0x24, 0x00, 0x89, 0x80, 0x8c,
+    0x04, 0x00, 0x01, 0x01, 0x80, 0xeb, 0xa0, 0x41,
+    0x6a, 0x91, 0xbf, 0x81, 0xb5, 0xa7, 0x8b, 0xf3,
+    0x20, 0x40, 0x86, 0xa3, 0x99, 0x85, 0x99, 0x8a,
+    0xd8, 0x15, 0x0d, 0x0d, 0x0a, 0xa2, 0x8b, 0x80,
+    0x99, 0x80, 0x92, 0x01, 0x80, 0x8e, 0x81, 0x8d,
+    0xa1, 0xfa, 0xc4, 0xb4, 0x41, 0x0a, 0x9c, 0x82,
+    0xb0, 0xae, 0x9f, 0x8c, 0x9d, 0x84, 0xa5, 0x89,
+    0x9d, 0x81, 0xa3, 0x1f, 0x04, 0xa9, 0x40, 0x9d,
+    0x91, 0xa3, 0x83, 0xa3, 0x83, 0xa7, 0x87, 0xb3,
+    0x40, 0x9b, 0x41, 0x36, 0x88, 0x95, 0x89, 0x87,
+    0x40, 0x97, 0x29, 0x00, 0xab, 0x01, 0x10, 0x81,
+    0x96, 0x89, 0x96, 0x88, 0x9e, 0xc0, 0x92, 0x01,
+    0x89, 0x95, 0x89, 0x99, 0xc5, 0xb7, 0x29, 0xbf,
+    0x80, 0x8e, 0x18, 0x10, 0x9c, 0xa9, 0x9c, 0x82,
+    0x9c, 0xa2, 0x38, 0x9b, 0x9a, 0xb5, 0x89, 0x95,
+    0x89, 0x92, 0x8c, 0x91, 0xed, 0xc8, 0xb6, 0xb2,
+    0x8c, 0xb2, 0x8c, 0xa3, 0x41, 0xdb, 0x9c, 0x89,
+    0x07, 0x95, 0x40, 0xbc, 0xb4, 0xca, 0xac, 0x9f,
+    0x98, 0x99, 0xa3, 0x9c, 0x80, 0x8a, 0xa2, 0x10,
+    0x8b, 0xaf, 0x8d, 0x83, 0x94, 0x00, 0x80, 0xa2,
+    0x91, 0x80, 0x98, 0xd3, 0x30, 0x00, 0x18, 0x8e,
+    0x80, 0x89, 0x86, 0xae, 0xa5, 0x39, 0x09, 0x95,
+    0x06, 0x01, 0x04, 0x10, 0x91, 0x80, 0x8b, 0x84,
+    0x40, 0x9d, 0xb4, 0x91, 0x83, 0xb4, 0xaf, 0x93,
+    0x08, 0x80, 0x40, 0xb7, 0xae, 0xa8, 0x83, 0xa3,
+    0xaf, 0x93, 0x80, 0xba, 0xaa, 0xd4, 0x9a, 0x40,
+    0xe4, 0xab, 0xf3, 0xbf, 0x9e, 0x80, 0x40, 0xff,
+    0x80, 0x89, 0xa7, 0x30, 0x94, 0x80, 0x8a, 0xa7,
+    0x0b, 0x92, 0x80, 0xa1, 0xb8, 0x41, 0x06, 0x88,
+    0x80, 0xa4, 0x90, 0x80, 0xb0, 0x9d, 0xef, 0x30,
+    0x08, 0xa5, 0x94, 0x80, 0x98, 0x28, 0x08, 0x9f,
+    0x8d, 0x80, 0x41, 0x46, 0x92, 0x41, 0x0c, 0x43,
+    0x99, 0xe5, 0xee, 0x90, 0x40, 0xc3, 0x4a, 0xbb,
+    0x44, 0x2e, 0x4f, 0xd0, 0x42, 0x46, 0x60, 0x21,
+    0xb8, 0x42, 0x38, 0x86, 0x9e, 0xf0, 0x9d, 0x91,
+    0xaf, 0x8f, 0x83, 0x9e, 0x94, 0x84, 0x92, 0x42,
+    0xaf, 0xbf, 0xff, 0xc4, 0x8a, 0x80, 0xc1, 0x8c,
+    0xbf, 0x81, 0x9d, 0x57, 0xf1, 0x8d, 0x42, 0xf2,
+    0x60, 0x25, 0x0c, 0x41, 0x1e, 0xd0, 0x41, 0x8b,
+    0x49, 0x03, 0xea, 0x84, 0x8c, 0x82, 0x88, 0x86,
+    0x89, 0x57, 0x65, 0xd4, 0x80, 0xc6, 0x01, 0x08,
+    0x09, 0x0b, 0x80, 0x8b, 0x00, 0x06, 0x80, 0xc0,
+    0x03, 0x0f, 0x06, 0x80, 0x9b, 0x03, 0x04, 0x00,
+    0x16, 0x80, 0x41, 0x53, 0x81, 0x98, 0x80, 0x98,
+    0x80, 0x9e, 0x80, 0x98, 0x80, 0x9e, 0x80, 0x98,
+    0x80, 0x9e, 0x80, 0x98, 0x80, 0x9e, 0x80, 0x98,
+    0x07, 0x50, 0x33, 0x40, 0xc4, 0xba, 0xc3, 0x44,
+    0xbb, 0x18, 0x9a, 0x01, 0x00, 0x08, 0x80, 0x89,
+    0x03, 0x00, 0x00, 0x28, 0x18, 0x00, 0x00, 0x02,
+    0x01, 0x00, 0x08, 0x00, 0x00, 0x00, 0x00, 0x01,
+    0x00, 0x0b, 0x06, 0x03, 0x03, 0x00, 0x80, 0x89,
+    0x80, 0x90, 0x22, 0x04, 0x80, 0x90, 0x51, 0x43,
+    0x60, 0xa6, 0xd6, 0xa8, 0x50, 0x34, 0x8a, 0x40,
+    0xdd, 0x81, 0x56, 0x81, 0x8d, 0x5d, 0x30, 0x4c,
+    0x1e, 0x42, 0x1d,
+};
+
+static const uint8_t unicode_prop_ID_Start_index[96] = {
+    0xf6, 0x03, 0x20, 0xa6, 0x07, 0x00, 0xb1, 0x09,
+    0x00, 0xba, 0x0a, 0x00, 0xd1, 0x0b, 0x20, 0x62,
+    0x0d, 0x40, 0xc7, 0x0e, 0x40, 0x49, 0x12, 0x20,
+    0x9b, 0x16, 0x20, 0x75, 0x19, 0x00, 0xf7, 0x1c,
+    0x60, 0x72, 0x20, 0x20, 0x26, 0x2d, 0x20, 0x30,
+    0x31, 0x00, 0xf0, 0xa6, 0x00, 0xf0, 0xa9, 0x20,
+    0xe3, 0xab, 0x20, 0x3e, 0xfd, 0x20, 0x5e, 0x00,
+    0x01, 0x64, 0x05, 0x01, 0x01, 0x0a, 0x21, 0x46,
+    0x0f, 0x41, 0x9e, 0x12, 0x01, 0x30, 0x16, 0x21,
+    0x09, 0x1c, 0x01, 0x2f, 0x34, 0x41, 0xa0, 0x6f,
+    0x01, 0xa3, 0xd4, 0x01, 0x4f, 0xd7, 0x01, 0x50,
+    0xee, 0x01, 0x1e, 0xb8, 0x22, 0x1e, 0xfa, 0x02,
+};
+
+static const uint8_t unicode_prop_ID_Continue1_table[596] = {
+    0xaf, 0x89, 0xa4, 0x80, 0xd6, 0x80, 0x42, 0x47,
+    0xef, 0x96, 0x80, 0x40, 0xfa, 0x84, 0x41, 0x08,
+    0xac, 0x00, 0x01, 0x01, 0x00, 0xc7, 0x8a, 0xaf,
+    0x9e, 0x28, 0xe4, 0x31, 0x29, 0x08, 0x19, 0x89,
+    0x96, 0x80, 0x9d, 0x9a, 0xda, 0x8a, 0x8e, 0x89,
+    0xa0, 0x88, 0x88, 0x80, 0x97, 0x18, 0x88, 0x02,
+    0x04, 0xaa, 0x82, 0xf6, 0x8e, 0x80, 0xa0, 0xb5,
+    0x10, 0x91, 0x06, 0x89, 0x09, 0x89, 0x90, 0x82,
+    0xb7, 0x00, 0x31, 0x09, 0x82, 0x88, 0x80, 0x89,
+    0x09, 0x89, 0x8d, 0x01, 0x82, 0xb7, 0x00, 0x23,
+    0x09, 0x12, 0x80, 0x93, 0x8b, 0x10, 0x8a, 0x82,
+    0xb7, 0x00, 0x38, 0x10, 0x82, 0x93, 0x09, 0x89,
+    0x89, 0x28, 0x82, 0xb7, 0x00, 0x31, 0x09, 0x17,
+    0x81, 0x89, 0x09, 0x89, 0x91, 0x80, 0xba, 0x22,
+    0x10, 0x83, 0x88, 0x80, 0x8d, 0x89, 0x8f, 0x84,
+    0xb8, 0x30, 0x10, 0x1e, 0x81, 0x8a, 0x09, 0x89,
+    0x90, 0x82, 0xb7, 0x00, 0x30, 0x10, 0x1e, 0x81,
+    0x8a, 0x09, 0x89, 0x8f, 0x83, 0xb6, 0x08, 0x30,
+    0x10, 0x83, 0x88, 0x80, 0x89, 0x09, 0x89, 0x91,
+    0x81, 0xc5, 0x03, 0x28, 0x00, 0x3d, 0x89, 0x09,
+    0xbc, 0x01, 0x86, 0x8b, 0x38, 0x89, 0xd6, 0x01,
+    0x28, 0x81, 0x8a, 0x29, 0x89, 0xbd, 0x0d, 0x89,
+    0x8a, 0x00, 0x00, 0x03, 0x81, 0xb0, 0x93, 0x01,
+    0x84, 0x8a, 0x80, 0xa3, 0x88, 0x80, 0xe3, 0x93,
+    0x80, 0x89, 0x8b, 0x1b, 0x10, 0x11, 0x32, 0x83,
+    0x8c, 0x8b, 0x80, 0x8e, 0x42, 0xbe, 0x82, 0x88,
+    0x88, 0x43, 0x9f, 0x82, 0x9c, 0x82, 0x9c, 0x81,
+    0x9d, 0x81, 0xbf, 0x9f, 0x88, 0x01, 0x89, 0xa0,
+    0x11, 0x89, 0x40, 0x8e, 0x80, 0xf5, 0x8b, 0x83,
+    0x8b, 0x89, 0x89, 0xff, 0x8a, 0xbb, 0x84, 0xb8,
+    0x89, 0x80, 0x9c, 0x81, 0x8a, 0x85, 0x89, 0x95,
+    0x8d, 0xc1, 0x84, 0xae, 0x90, 0x8a, 0x89, 0x90,
+    0x88, 0x8b, 0x82, 0x9d, 0x8c, 0x81, 0x89, 0xab,
+    0x8d, 0xaf, 0x93, 0x87, 0x89, 0x85, 0x89, 0xf5,
+    0x10, 0x94, 0x18, 0x1a, 0x0a, 0x40, 0xc5, 0xb9,
+    0x04, 0x42, 0x3e, 0x81, 0x92, 0x80, 0xfa, 0x8c,
+    0x18, 0x82, 0x8b, 0x4b, 0xfd, 0x82, 0x40, 0x8c,
+    0x80, 0xdf, 0x9f, 0x42, 0x29, 0x85, 0xe8, 0x81,
+    0x60, 0x75, 0x84, 0x89, 0xc4, 0x03, 0x89, 0x9f,
+    0x81, 0xcf, 0x81, 0x41, 0x0f, 0x02, 0x03, 0x80,
+    0x96, 0x84, 0xd7, 0x81, 0xb1, 0x91, 0x89, 0x89,
+    0x85, 0x91, 0x8c, 0x8a, 0x9b, 0x87, 0x98, 0x8c,
+    0xab, 0x83, 0xae, 0x8d, 0x8e, 0x89, 0x8a, 0x80,
+    0x89, 0x89, 0xae, 0x8d, 0x8b, 0x07, 0x09, 0x89,
+    0xa0, 0x82, 0xb1, 0x00, 0x11, 0x0c, 0x08, 0x80,
+    0xa8, 0x24, 0x81, 0x40, 0xeb, 0x38, 0x09, 0x89,
+    0x60, 0x4f, 0x23, 0x80, 0x42, 0xe0, 0x8f, 0x8f,
+    0x8f, 0x11, 0x97, 0x82, 0x40, 0xbf, 0x89, 0xa4,
+    0x80, 0x42, 0xbc, 0x80, 0x40, 0xe1, 0x80, 0x40,
+    0x94, 0x84, 0x41, 0x24, 0x89, 0x45, 0x56, 0x10,
+    0x0c, 0x83, 0xa7, 0x13, 0x80, 0x40, 0xa4, 0x81,
+    0x42, 0x3c, 0x1f, 0x89, 0x42, 0x0b, 0x8a, 0x40,
+    0xae, 0x82, 0xb4, 0x8e, 0x9e, 0x89, 0x8e, 0x83,
+    0xac, 0x8a, 0xb4, 0x89, 0x2a, 0xa3, 0x8d, 0x80,
+    0x89, 0x21, 0xab, 0x80, 0x8b, 0x82, 0xaf, 0x8d,
+    0x3b, 0x82, 0x89, 0xd1, 0x8b, 0x28, 0x40, 0x9f,
+    0x8b, 0x84, 0x89, 0x2b, 0xb6, 0x08, 0x31, 0x09,
+    0x82, 0x88, 0x80, 0x89, 0x09, 0x32, 0x84, 0x40,
+    0xbf, 0x91, 0x88, 0x89, 0x18, 0xd0, 0x93, 0x8b,
+    0x89, 0x40, 0xd4, 0x31, 0x88, 0x9a, 0x81, 0xd1,
+    0x90, 0x8e, 0x89, 0xd0, 0x8c, 0x87, 0x89, 0xd2,
+    0x8e, 0x83, 0x89, 0x40, 0xf1, 0x8e, 0x40, 0xa4,
+    0x89, 0x41, 0x16, 0x89, 0xa7, 0x30, 0x1f, 0x80,
+    0x88, 0x8a, 0xad, 0x8f, 0x41, 0x94, 0x38, 0x87,
+    0x8f, 0x89, 0xb7, 0x95, 0x80, 0x8d, 0xf9, 0x2a,
+    0x00, 0x08, 0x30, 0x07, 0x89, 0xaf, 0x20, 0x08,
+    0x27, 0x89, 0x41, 0x48, 0x83, 0x60, 0x4b, 0x68,
+    0x89, 0x40, 0x85, 0x84, 0xba, 0x86, 0x98, 0x89,
+    0x43, 0xf6, 0xad, 0x8f, 0x83, 0x60, 0x4d, 0x09,
+    0x81, 0x54, 0xc5, 0x22, 0x2f, 0x39, 0x86, 0x9d,
+    0x83, 0x40, 0x93, 0x82, 0x45, 0x88, 0xb1, 0x41,
+    0xff, 0xb6, 0x83, 0xb1, 0x38, 0x8d, 0x80, 0x95,
+    0x20, 0x8e, 0x45, 0x4f, 0x30, 0x90, 0x0e, 0x01,
+    0x04, 0x48, 0xa4, 0x86, 0xec, 0x34, 0x89, 0x6c,
+    0x17, 0xa5, 0x40, 0xef,
+};
+
+static const uint8_t unicode_prop_ID_Continue1_index[57] = {
+    0xfa, 0x06, 0x00, 0x84, 0x09, 0x00, 0xf0, 0x0a,
+    0x00, 0x70, 0x0c, 0x00, 0xf4, 0x0d, 0x00, 0x3f,
+    0x10, 0x00, 0x1a, 0x18, 0x40, 0x74, 0x1b, 0x20,
+    0xdd, 0x20, 0x00, 0x0c, 0xa8, 0x00, 0x5a, 0xaa,
+    0x00, 0x40, 0xff, 0x20, 0x03, 0x10, 0x41, 0xeb,
+    0x12, 0x21, 0x41, 0x16, 0x21, 0x40, 0x1c, 0x01,
+    0x5a, 0x6b, 0x01, 0xb0, 0xda, 0x41, 0xf0, 0x01,
+    0x0e,
+};
+
+#ifdef CONFIG_ALL_UNICODE
+
+static const uint8_t unicode_cc_table[820] = {
+    0xb2, 0xcf, 0xd4, 0x00, 0xe8, 0x03, 0xdc, 0x00,
+    0xe8, 0x00, 0xd8, 0x04, 0xdc, 0x01, 0xca, 0x03,
+    0xdc, 0x01, 0xca, 0x0a, 0xdc, 0x04, 0x01, 0x03,
+    0xdc, 0xc7, 0x00, 0xf0, 0xc0, 0x02, 0xdc, 0xc2,
+    0x01, 0xdc, 0x80, 0xc2, 0x03, 0xdc, 0xc0, 0x00,
+    0xe8, 0x01, 0xdc, 0xc0, 0x41, 0xe9, 0x00, 0xea,
+    0x41, 0xe9, 0x00, 0xea, 0x00, 0xe9, 0xcc, 0xb0,
+    0xe2, 0xc4, 0xb0, 0xd8, 0x00, 0xdc, 0xc3, 0x00,
+    0xdc, 0xc2, 0x00, 0xde, 0x00, 0xdc, 0xc5, 0x05,
+    0xdc, 0xc1, 0x00, 0xdc, 0xc1, 0x00, 0xde, 0x00,
+    0xe4, 0xc0, 0x49, 0x0a, 0x43, 0x13, 0x80, 0x00,
+    0x17, 0x80, 0x41, 0x18, 0x80, 0xc0, 0x00, 0xdc,
+    0x80, 0x00, 0x12, 0xb0, 0x17, 0xc7, 0x42, 0x1e,
+    0xaf, 0x47, 0x1b, 0xc1, 0x01, 0xdc, 0xc4, 0x00,
+    0xdc, 0xc1, 0x00, 0xdc, 0x8f, 0x00, 0x23, 0xb0,
+    0x34, 0xc6, 0x81, 0xc3, 0x00, 0xdc, 0xc0, 0x81,
+    0xc1, 0x80, 0x00, 0xdc, 0xc1, 0x00, 0xdc, 0xa2,
+    0x00, 0x24, 0x9d, 0xc0, 0x00, 0xdc, 0xc1, 0x00,
+    0xdc, 0xc1, 0x02, 0xdc, 0xc0, 0x01, 0xdc, 0xc0,
+    0x00, 0xdc, 0xc2, 0x00, 0xdc, 0xc0, 0x00, 0xdc,
+    0xc0, 0x00, 0xdc, 0xc0, 0x00, 0xdc, 0xc1, 0xb0,
+    0x6f, 0xc6, 0x00, 0xdc, 0xc0, 0x88, 0x00, 0xdc,
+    0x97, 0xc3, 0x80, 0xc8, 0x80, 0xc2, 0x80, 0xc4,
+    0xaa, 0x02, 0xdc, 0xb0, 0x46, 0x00, 0xdc, 0xcd,
+    0x80, 0x00, 0xdc, 0xc1, 0x00, 0xdc, 0xc1, 0x00,
+    0xdc, 0xc2, 0x02, 0xdc, 0x42, 0x1b, 0xc2, 0x00,
+    0xdc, 0xc1, 0x01, 0xdc, 0xc4, 0xb0, 0x0b, 0x00,
+    0x07, 0x8f, 0x00, 0x09, 0x82, 0xc0, 0x00, 0xdc,
+    0xc1, 0xb0, 0x36, 0x00, 0x07, 0x8f, 0x00, 0x09,
+    0xaf, 0xc0, 0xb0, 0x0c, 0x00, 0x07, 0x8f, 0x00,
+    0x09, 0xb0, 0x3d, 0x00, 0x07, 0x8f, 0x00, 0x09,
+    0xb0, 0x3d, 0x00, 0x07, 0x8f, 0x00, 0x09, 0xb0,
+    0x4e, 0x00, 0x09, 0xb0, 0x4e, 0x00, 0x09, 0x86,
+    0x00, 0x54, 0x00, 0x5b, 0xb0, 0x34, 0x00, 0x07,
+    0x8f, 0x00, 0x09, 0xb0, 0x3c, 0x01, 0x09, 0x8f,
+    0x00, 0x09, 0xb0, 0x4b, 0x00, 0x09, 0xb0, 0x3c,
+    0x01, 0x67, 0x00, 0x09, 0x8c, 0x03, 0x6b, 0xb0,
+    0x3b, 0x01, 0x76, 0x8d, 0x03, 0x7a, 0xb0, 0x1b,
+    0x01, 0xdc, 0x9a, 0x00, 0xdc, 0x80, 0x00, 0xdc,
+    0x80, 0x00, 0xd8, 0xb0, 0x06, 0x41, 0x81, 0x80,
+    0x00, 0x84, 0x84, 0x03, 0x82, 0x81, 0x00, 0x82,
+    0x80, 0xc1, 0x00, 0x09, 0x80, 0xc1, 0xb0, 0x0d,
+    0x00, 0xdc, 0xb0, 0x3f, 0x00, 0x07, 0x80, 0x01,
+    0x09, 0xb0, 0x21, 0x00, 0xdc, 0xb2, 0x9e, 0xc2,
+    0xb3, 0x83, 0x00, 0x09, 0x9e, 0x00, 0x09, 0xb0,
+    0x6c, 0x00, 0x09, 0x89, 0xc0, 0xb0, 0x9a, 0x00,
+    0xe4, 0xb0, 0x5e, 0x00, 0xde, 0xc0, 0x00, 0xdc,
+    0xb0, 0xaa, 0xc0, 0x00, 0xdc, 0xb0, 0x16, 0x00,
+    0x09, 0x93, 0xc7, 0x81, 0x00, 0xdc, 0xaf, 0xc4,
+    0x05, 0xdc, 0xc1, 0x00, 0xdc, 0xb0, 0x45, 0x00,
+    0x07, 0x8e, 0x00, 0x09, 0xa5, 0xc0, 0x00, 0xdc,
+    0xc6, 0xb0, 0x05, 0x01, 0x09, 0xb0, 0x09, 0x00,
+    0x07, 0x8a, 0x01, 0x09, 0xb0, 0x12, 0x00, 0x07,
+    0xb0, 0x67, 0xc2, 0x41, 0x00, 0x04, 0xdc, 0xc1,
+    0x03, 0xdc, 0xc0, 0x41, 0x00, 0x05, 0x01, 0x83,
+    0x00, 0xdc, 0x85, 0xc0, 0x82, 0xc1, 0xb0, 0x95,
+    0xc1, 0x00, 0xdc, 0xc6, 0x00, 0xdc, 0xc1, 0x00,
+    0xea, 0x00, 0xd6, 0x00, 0xdc, 0x00, 0xca, 0xe4,
+    0x00, 0xe8, 0x01, 0xe4, 0x00, 0xdc, 0x80, 0xc0,
+    0x00, 0xe9, 0x00, 0xdc, 0xc0, 0x00, 0xdc, 0xb2,
+    0x9f, 0xc1, 0x01, 0x01, 0xc3, 0x02, 0x01, 0xc1,
+    0x83, 0xc0, 0x82, 0x01, 0x01, 0xc0, 0x00, 0xdc,
+    0xc0, 0x01, 0x01, 0x03, 0xdc, 0xc0, 0xb8, 0x03,
+    0xcd, 0xc2, 0xb0, 0x5c, 0x00, 0x09, 0xb0, 0x2f,
+    0xdf, 0xb1, 0xf9, 0x00, 0xda, 0x00, 0xe4, 0x00,
+    0xe8, 0x00, 0xde, 0x01, 0xe0, 0xb0, 0x38, 0x01,
+    0x08, 0xb8, 0x6d, 0xa3, 0xc0, 0x83, 0xc9, 0x9f,
+    0xc1, 0xb0, 0x1f, 0xc1, 0xb0, 0xe3, 0x00, 0x09,
+    0xb0, 0x8c, 0x00, 0x09, 0x9a, 0xd1, 0xb0, 0x08,
+    0x02, 0xdc, 0xa4, 0x00, 0x09, 0xb0, 0x2e, 0x00,
+    0x07, 0x8b, 0x00, 0x09, 0xb0, 0xbe, 0xc0, 0x80,
+    0xc1, 0x00, 0xdc, 0x81, 0xc1, 0x84, 0xc1, 0x80,
+    0xc0, 0xb0, 0x03, 0x00, 0x09, 0xb0, 0xc5, 0x00,
+    0x09, 0xb8, 0x46, 0xff, 0x00, 0x1a, 0xb2, 0xd0,
+    0xc6, 0x06, 0xdc, 0xc1, 0xb3, 0x9c, 0x00, 0xdc,
+    0xb0, 0xb1, 0x00, 0xdc, 0xb0, 0x64, 0xc4, 0xb6,
+    0x61, 0x00, 0xdc, 0x80, 0xc0, 0xa7, 0xc0, 0x00,
+    0x01, 0x00, 0xdc, 0x83, 0x00, 0x09, 0xb0, 0x74,
+    0xc0, 0x00, 0xdc, 0xb2, 0x0c, 0xc3, 0xb1, 0xed,
+    0x01, 0xdc, 0xc2, 0x00, 0xdc, 0xc0, 0x03, 0xdc,
+    0xb0, 0xc4, 0x00, 0x09, 0xb0, 0x07, 0x00, 0x09,
+    0xb0, 0x08, 0x00, 0x09, 0x00, 0x07, 0xb0, 0x14,
+    0xc2, 0xaf, 0x01, 0x09, 0xb0, 0x0d, 0x00, 0x07,
+    0xb0, 0x1b, 0x00, 0x09, 0x88, 0x00, 0x07, 0xb0,
+    0x39, 0x00, 0x09, 0x00, 0x07, 0xb0, 0x81, 0x00,
+    0x07, 0x00, 0x09, 0xb0, 0x1f, 0x01, 0x07, 0x8f,
+    0x00, 0x09, 0x97, 0xc6, 0x82, 0xc4, 0xb0, 0x9c,
+    0x00, 0x09, 0x82, 0x00, 0x07, 0x96, 0xc0, 0xb0,
+    0x32, 0x00, 0x09, 0x00, 0x07, 0xb0, 0xca, 0x00,
+    0x09, 0x00, 0x07, 0xb0, 0x4d, 0x00, 0x09, 0xb0,
+    0x45, 0x00, 0x09, 0x00, 0x07, 0xb0, 0x42, 0x00,
+    0x09, 0xb0, 0xdc, 0x00, 0x09, 0x00, 0x07, 0xb1,
+    0xc8, 0x00, 0x09, 0x91, 0x00, 0x09, 0xb0, 0x20,
+    0x00, 0x09, 0xb1, 0x74, 0x00, 0x09, 0xb0, 0xd1,
+    0x00, 0x07, 0x80, 0x01, 0x09, 0xb0, 0x20, 0x00,
+    0x09, 0xb8, 0x45, 0x27, 0x04, 0x01, 0xb0, 0x0a,
+    0xc6, 0xb8, 0x49, 0x36, 0x00, 0x01, 0xb8, 0x0c,
+    0x95, 0x01, 0xd8, 0x02, 0x01, 0x82, 0x00, 0xe2,
+    0x04, 0xd8, 0x87, 0x07, 0xdc, 0x81, 0xc4, 0x01,
+    0xdc, 0x9d, 0xc3, 0xb0, 0x63, 0xc2, 0xb8, 0x05,
+    0x8a, 0xc6, 0x80, 0xd0, 0x81, 0xc6, 0x80, 0xc1,
+    0x80, 0xc4, 0xb8, 0x00, 0x74, 0x06, 0xdc, 0xb0,
+    0x3c, 0xc5, 0x00, 0x07,
+};
+
+static const uint8_t unicode_cc_index[78] = {
+    0x4d, 0x03, 0x00, 0x97, 0x05, 0x20, 0xc6, 0x05,
+    0x00, 0xe7, 0x06, 0x00, 0x45, 0x07, 0x00, 0xe2,
+    0x08, 0x00, 0x53, 0x09, 0x00, 0xcd, 0x0b, 0x20,
+    0x38, 0x0e, 0x00, 0x74, 0x0f, 0x00, 0x60, 0x13,
+    0x00, 0x61, 0x1a, 0x20, 0xe7, 0x1b, 0x20, 0xc0,
+    0x1d, 0x00, 0xd0, 0x20, 0x20, 0xe0, 0x2d, 0x00,
+    0x07, 0xa8, 0x00, 0xc1, 0xaa, 0x00, 0x0d, 0x0a,
+    0x21, 0x51, 0x0f, 0x01, 0x35, 0x12, 0x21, 0xc2,
+    0x14, 0x21, 0x34, 0x1a, 0x21, 0x30, 0x6b, 0x01,
+    0x00, 0xe0, 0x21, 0x4b, 0xe9, 0x01,
+};
+
+static const uint32_t unicode_decomp_table1[686] = {
+    0x00280081, 0x002a0097, 0x002a8081, 0x002bc097,
+    0x002c8115, 0x002d0097, 0x002d4081, 0x002e0097,
+    0x002e4115, 0x002f0199, 0x00302016, 0x00400842,
+    0x00448a42, 0x004a0442, 0x004c0096, 0x004c8117,
+    0x004d0242, 0x004e4342, 0x004fc12f, 0x0050c342,
+    0x005240bf, 0x00530342, 0x00550942, 0x005a0842,
+    0x005e0096, 0x005e4342, 0x005fc081, 0x00680142,
+    0x006bc142, 0x00710185, 0x0071c317, 0x00734844,
+    0x00778344, 0x00798342, 0x007b02be, 0x007c4197,
+    0x007d0142, 0x007e0444, 0x00800e42, 0x00878142,
+    0x00898744, 0x00ac0483, 0x00b60317, 0x00b80283,
+    0x00d00214, 0x00d10096, 0x00dd0080, 0x00de8097,
+    0x00df8080, 0x00e10097, 0x00e1413e, 0x00e1c080,
+    0x00e204be, 0x00ea83ae, 0x00f282ae, 0x00f401ad,
+    0x00f4c12e, 0x00f54103, 0x00fc0303, 0x00fe4081,
+    0x0100023e, 0x0101c0be, 0x010301be, 0x010640be,
+    0x010e40be, 0x0114023e, 0x0115c0be, 0x011701be,
+    0x011d8144, 0x01304144, 0x01340244, 0x01358144,
+    0x01368344, 0x01388344, 0x013a8644, 0x013e0144,
+    0x0161c085, 0x018882ae, 0x019d422f, 0x01b00184,
+    0x01b4c084, 0x024a4084, 0x024c4084, 0x024d0084,
+    0x0256042e, 0x0272c12e, 0x02770120, 0x0277c084,
+    0x028cc084, 0x028d8084, 0x029641ae, 0x02978084,
+    0x02d20084, 0x02d2c12e, 0x02d70120, 0x02e50084,
+    0x02f281ae, 0x03120084, 0x03300084, 0x0331c122,
+    0x0332812e, 0x035281ae, 0x03768084, 0x037701ae,
+    0x038cc085, 0x03acc085, 0x03b7012f, 0x03c30081,
+    0x03d0c084, 0x03d34084, 0x03d48084, 0x03d5c084,
+    0x03d70084, 0x03da4084, 0x03dcc084, 0x03dd412e,
+    0x03ddc085, 0x03de0084, 0x03de4085, 0x03e04084,
+    0x03e4c084, 0x03e74084, 0x03e88084, 0x03e9c084,
+    0x03eb0084, 0x03ee4084, 0x04098084, 0x043f0081,
+    0x06c18484, 0x06c48084, 0x06cec184, 0x06d00120,
+    0x06d0c084, 0x074b0383, 0x074cc41f, 0x074f1783,
+    0x075e0081, 0x0766d283, 0x07801d44, 0x078e8942,
+    0x07931844, 0x079f0d42, 0x07a58216, 0x07a68085,
+    0x07a6c0be, 0x07a80d44, 0x07aea044, 0x07c00122,
+    0x07c08344, 0x07c20122, 0x07c28344, 0x07c40122,
+    0x07c48244, 0x07c60122, 0x07c68244, 0x07c8113e,
+    0x07d08244, 0x07d20122, 0x07d28244, 0x07d40122,
+    0x07d48344, 0x07d64c3e, 0x07dc4080, 0x07dc80be,
+    0x07dcc080, 0x07dd00be, 0x07dd4080, 0x07dd80be,
+    0x07ddc080, 0x07de00be, 0x07de4080, 0x07de80be,
+    0x07dec080, 0x07df00be, 0x07df4080, 0x07e00820,
+    0x07e40820, 0x07e80820, 0x07ec05be, 0x07eec080,
+    0x07ef00be, 0x07ef4097, 0x07ef8080, 0x07efc117,
+    0x07f0443e, 0x07f24080, 0x07f280be, 0x07f2c080,
+    0x07f303be, 0x07f4c080, 0x07f582ae, 0x07f6c080,
+    0x07f7433e, 0x07f8c080, 0x07f903ae, 0x07fac080,
+    0x07fb013e, 0x07fb8102, 0x07fc83be, 0x07fe4080,
+    0x07fe80be, 0x07fec080, 0x07ff00be, 0x07ff4080,
+    0x07ff8097, 0x0800011e, 0x08008495, 0x08044081,
+    0x0805c097, 0x08090081, 0x08094097, 0x08098099,
+    0x080bc081, 0x080cc085, 0x080d00b1, 0x080d8085,
+    0x080dc0b1, 0x080f0197, 0x0811c197, 0x0815c0b3,
+    0x0817c081, 0x081c0595, 0x081ec081, 0x081f0215,
+    0x0820051f, 0x08228583, 0x08254415, 0x082a0097,
+    0x08400119, 0x08408081, 0x0840c0bf, 0x08414119,
+    0x0841c081, 0x084240bf, 0x0842852d, 0x08454081,
+    0x08458097, 0x08464295, 0x08480097, 0x08484099,
+    0x08488097, 0x08490081, 0x08498080, 0x084a0081,
+    0x084a8102, 0x084b0495, 0x084d421f, 0x084e4081,
+    0x084ec099, 0x084f0283, 0x08514295, 0x08540119,
+    0x0854809b, 0x0854c619, 0x0857c097, 0x08580081,
+    0x08584097, 0x08588099, 0x0858c097, 0x08590081,
+    0x08594097, 0x08598099, 0x0859c09b, 0x085a0097,
+    0x085a4081, 0x085a8097, 0x085ac099, 0x085b0295,
+    0x085c4097, 0x085c8099, 0x085cc097, 0x085d0081,
+    0x085d4097, 0x085d8099, 0x085dc09b, 0x085e0097,
+    0x085e4081, 0x085e8097, 0x085ec099, 0x085f0215,
+    0x08624099, 0x0866813e, 0x086b80be, 0x087341be,
+    0x088100be, 0x088240be, 0x088300be, 0x088901be,
+    0x088b0085, 0x088b40b1, 0x088bc085, 0x088c00b1,
+    0x089040be, 0x089100be, 0x0891c1be, 0x089801be,
+    0x089b42be, 0x089d0144, 0x089e0144, 0x08a00144,
+    0x08a10144, 0x08a20144, 0x08ab023e, 0x08b80244,
+    0x08ba8220, 0x08ca411e, 0x0918049f, 0x091a4523,
+    0x091cc097, 0x091d04a5, 0x091f452b, 0x0921c09b,
+    0x092204a1, 0x09244525, 0x0926c099, 0x09270d25,
+    0x092d8d1f, 0x09340d1f, 0x093a8081, 0x0a8300b3,
+    0x0a9d0099, 0x0a9d4097, 0x0a9d8099, 0x0ab700be,
+    0x0b1f0115, 0x0b5bc081, 0x0ba7c081, 0x0bbcc081,
+    0x0bc004ad, 0x0bc244ad, 0x0bc484ad, 0x0bc6f383,
+    0x0be0852d, 0x0be31d03, 0x0bf1882d, 0x0c000081,
+    0x0c0d8283, 0x0c130b84, 0x0c194284, 0x0c1c0122,
+    0x0c1cc122, 0x0c1d8122, 0x0c1e4122, 0x0c1f0122,
+    0x0c250084, 0x0c26c123, 0x0c278084, 0x0c27c085,
+    0x0c2b0b84, 0x0c314284, 0x0c340122, 0x0c34c122,
+    0x0c358122, 0x0c364122, 0x0c370122, 0x0c3d0084,
+    0x0c3dc220, 0x0c3f8084, 0x0c3fc085, 0x0c4c4a2d,
+    0x0c51451f, 0x0c53ca9f, 0x0c5915ad, 0x0c648703,
+    0x0c800741, 0x0c838089, 0x0c83c129, 0x0c8441a9,
+    0x0c850089, 0x0c854129, 0x0c85c2a9, 0x0c870089,
+    0x0c87408f, 0x0c87808d, 0x0c881241, 0x0c910203,
+    0x0c940099, 0x0c9444a3, 0x0c968323, 0x0c98072d,
+    0x0c9b84af, 0x0c9dc2a1, 0x0c9f00b5, 0x0c9f40b3,
+    0x0c9f8085, 0x0ca01883, 0x0cac4223, 0x0cad4523,
+    0x0cafc097, 0x0cb004a1, 0x0cb241a5, 0x0cb30097,
+    0x0cb34099, 0x0cb38097, 0x0cb3c099, 0x0cb417ad,
+    0x0cc001b3, 0x0cc0c0b1, 0x0cc100b3, 0x0cc14131,
+    0x0cc1c0b5, 0x0cc200b3, 0x0cc241b1, 0x0cc30133,
+    0x0cc38131, 0x0cc40085, 0x0cc440b1, 0x0cc48133,
+    0x0cc50085, 0x0cc540b5, 0x0cc580b7, 0x0cc5c0b5,
+    0x0cc600b1, 0x0cc64135, 0x0cc6c0b3, 0x0cc701b1,
+    0x0cc7c0b3, 0x0cc800b5, 0x0cc840b3, 0x0cc881b1,
+    0x0cc9422f, 0x0cca4131, 0x0ccac0b5, 0x0ccb00b1,
+    0x0ccb40b3, 0x0ccb80b5, 0x0ccbc0b1, 0x0ccc012f,
+    0x0ccc80b5, 0x0cccc0b3, 0x0ccd00b5, 0x0ccd40b1,
+    0x0ccd80b5, 0x0ccdc085, 0x0cce02b1, 0x0ccf40b3,
+    0x0ccf80b1, 0x0ccfc085, 0x0cd001b1, 0x0cd0c0b3,
+    0x0cd101b1, 0x0cd1c0b5, 0x0cd200b3, 0x0cd24085,
+    0x0cd280b5, 0x0cd2c085, 0x0cd30133, 0x0cd381b1,
+    0x0cd440b3, 0x0cd48085, 0x0cd4c0b1, 0x0cd500b3,
+    0x0cd54085, 0x0cd580b5, 0x0cd5c0b1, 0x0cd60521,
+    0x0cd88525, 0x0cdb02a5, 0x0cdc4099, 0x0cdc8117,
+    0x0cdd0099, 0x0cdd4197, 0x0cde0127, 0x0cde8285,
+    0x0cdfc089, 0x0ce0043f, 0x0ce20099, 0x0ce2409b,
+    0x0ce283bf, 0x0ce44219, 0x0ce54205, 0x0ce6433f,
+    0x0ce7c131, 0x0ce84085, 0x0ce881b1, 0x0ce94085,
+    0x0ce98107, 0x0cea0089, 0x0cea4097, 0x0cea8219,
+    0x0ceb809d, 0x0cebc08d, 0x0cec083f, 0x0cf00105,
+    0x0cf0809b, 0x0cf0c197, 0x0cf1809b, 0x0cf1c099,
+    0x0cf20517, 0x0cf48099, 0x0cf4c117, 0x0cf54119,
+    0x0cf5c097, 0x0cf6009b, 0x0cf64099, 0x0cf68217,
+    0x0cf78119, 0x0cf804a1, 0x0cfa4525, 0x0cfcc525,
+    0x0cff4125, 0x0cffc099, 0x29a70103, 0x29dc0081,
+    0x29fe0103, 0x2ad70203, 0x3e401482, 0x3e4a7f82,
+    0x3e6a3f82, 0x3e8aa102, 0x3e9b0110, 0x3e9c2f82,
+    0x3eb3c590, 0x3ec00197, 0x3ec0c119, 0x3ec1413f,
+    0x3ec4c2af, 0x3ec74184, 0x3ec804ad, 0x3eca4081,
+    0x3eca8304, 0x3ecc03a0, 0x3ece02a0, 0x3ecf8084,
+    0x3ed00120, 0x3ed0c120, 0x3ed184ae, 0x3ed3c085,
+    0x3ed4312d, 0x3ef4cbad, 0x3efa892f, 0x3eff022d,
+    0x3f002f2f, 0x3f1782a5, 0x3f18c0b1, 0x3f1907af,
+    0x3f1cffaf, 0x3f3c81a5, 0x3f3d64af, 0x3f542031,
+    0x3f649b31, 0x3f7c0131, 0x3f7c83b3, 0x3f7e40b1,
+    0x3f7e80bd, 0x3f7ec0bb, 0x3f7f00b3, 0x3f840503,
+    0x3f8c01ad, 0x3f8cc315, 0x3f8e462d, 0x3f91cc03,
+    0x3f97c695, 0x3f9c01af, 0x3f9d0085, 0x3f9d852f,
+    0x3fa03aad, 0x3fbd442f, 0x3fc06f1f, 0x3fd7c11f,
+    0x3fd85fad, 0x3fe80081, 0x3fe84f1f, 0x3ff0831f,
+    0x3ff2831f, 0x3ff4831f, 0x3ff6819f, 0x3ff80783,
+    0x44268192, 0x442ac092, 0x444b8112, 0x44d2c112,
+    0x452ec212, 0x456e8112, 0x74578392, 0x746ec312,
+    0x75000d1f, 0x75068d1f, 0x750d0d1f, 0x7513839f,
+    0x7515891f, 0x751a0d1f, 0x75208d1f, 0x75271015,
+    0x752f439f, 0x7531459f, 0x75340d1f, 0x753a8d1f,
+    0x75410395, 0x7543441f, 0x7545839f, 0x75478d1f,
+    0x754e0795, 0x7552839f, 0x75548d1f, 0x755b0d1f,
+    0x75618d1f, 0x75680d1f, 0x756e8d1f, 0x75750d1f,
+    0x757b8d1f, 0x75820d1f, 0x75888d1f, 0x758f0d1f,
+    0x75958d1f, 0x759c0d1f, 0x75a28d1f, 0x75a90103,
+    0x75aa089f, 0x75ae4081, 0x75ae839f, 0x75b04081,
+    0x75b08c9f, 0x75b6c081, 0x75b7032d, 0x75b8889f,
+    0x75bcc081, 0x75bd039f, 0x75bec081, 0x75bf0c9f,
+    0x75c54081, 0x75c5832d, 0x75c7089f, 0x75cb4081,
+    0x75cb839f, 0x75cd4081, 0x75cd8c9f, 0x75d3c081,
+    0x75d4032d, 0x75d5889f, 0x75d9c081, 0x75da039f,
+    0x75dbc081, 0x75dc0c9f, 0x75e24081, 0x75e2832d,
+    0x75e4089f, 0x75e84081, 0x75e8839f, 0x75ea4081,
+    0x75ea8c9f, 0x75f0c081, 0x75f1042d, 0x75f3851f,
+    0x75f6051f, 0x75f8851f, 0x75fb051f, 0x75fd851f,
+    0x7b80022d, 0x7b814dad, 0x7b884203, 0x7b89c081,
+    0x7b8a452d, 0x7b8d0403, 0x7b908081, 0x7b91dc03,
+    0x7ba0052d, 0x7ba2c8ad, 0x7ba84483, 0x7baac8ad,
+    0x7c400097, 0x7c404521, 0x7c440d25, 0x7c4a8087,
+    0x7c4ac115, 0x7c4b4117, 0x7c4c0d1f, 0x7c528217,
+    0x7c538099, 0x7c53c097, 0x7c5a8117, 0x7c640097,
+    0x7c80012f, 0x7c808081, 0x7c841603, 0x7c9004c1,
+    0x7c940103, 0xbe0001ac, 0xbe00d110, 0xbe0947ac,
+    0xbe0d3910, 0xbe29872c, 0xbe2d022c, 0xbe2e3790,
+    0xbe49ff90, 0xbe69bc10,
+};
+
+static const uint16_t unicode_decomp_table2[686] = {
+    0x0020, 0x0000, 0x0061, 0x0002, 0x0004, 0x0006, 0x03bc, 0x0008,
+    0x000a, 0x000c, 0x0015, 0x0095, 0x00a5, 0x00b9, 0x00c1, 0x00c3,
+    0x00c7, 0x00cb, 0x00d1, 0x00d7, 0x00dd, 0x00e0, 0x00e6, 0x00f8,
+    0x0108, 0x010a, 0x0073, 0x0110, 0x0112, 0x0114, 0x0120, 0x012c,
+    0x0144, 0x014d, 0x0153, 0x0162, 0x0168, 0x016a, 0x0176, 0x0192,
+    0x0194, 0x01a9, 0x01bb, 0x01c7, 0x01d1, 0x01d5, 0x02b9, 0x01d7,
+    0x003b, 0x01d9, 0x01db, 0x00b7, 0x01e1, 0x01fc, 0x020c, 0x0218,
+    0x021d, 0x0223, 0x0227, 0x03a3, 0x0233, 0x023f, 0x0242, 0x024b,
+    0x024e, 0x0251, 0x025d, 0x0260, 0x0269, 0x026c, 0x026f, 0x0275,
+    0x0278, 0x0281, 0x028a, 0x029c, 0x029f, 0x02a3, 0x02af, 0x02b9,
+    0x02c5, 0x02c9, 0x02cd, 0x02d1, 0x02d5, 0x02e7, 0x02ed, 0x02f1,
+    0x02f5, 0x02f9, 0x02fd, 0x0305, 0x0309, 0x030d, 0x0313, 0x0317,
+    0x031b, 0x0323, 0x0327, 0x032b, 0x032f, 0x0335, 0x033d, 0x0341,
+    0x0349, 0x034d, 0x0351, 0x0f0b, 0x0357, 0x035b, 0x035f, 0x0363,
+    0x0367, 0x036b, 0x036f, 0x0373, 0x0379, 0x037d, 0x0381, 0x0385,
+    0x0389, 0x038d, 0x0391, 0x0395, 0x0399, 0x039d, 0x03a1, 0x10dc,
+    0x03a5, 0x03c9, 0x03cd, 0x03d9, 0x03dd, 0x03e1, 0x03ef, 0x03f1,
+    0x043d, 0x044f, 0x0499, 0x04f0, 0x0502, 0x054a, 0x0564, 0x056c,
+    0x0570, 0x0573, 0x059a, 0x05fa, 0x05fe, 0x0607, 0x060b, 0x0614,
+    0x0618, 0x061e, 0x0622, 0x0628, 0x068e, 0x0694, 0x0698, 0x069e,
+    0x06a2, 0x06ab, 0x03ac, 0x06f3, 0x03ad, 0x06f6, 0x03ae, 0x06f9,
+    0x03af, 0x06fc, 0x03cc, 0x06ff, 0x03cd, 0x0702, 0x03ce, 0x0705,
+    0x0709, 0x070d, 0x0711, 0x0386, 0x0732, 0x0735, 0x03b9, 0x0737,
+    0x073b, 0x0388, 0x0753, 0x0389, 0x0756, 0x0390, 0x076b, 0x038a,
+    0x0777, 0x03b0, 0x0789, 0x038e, 0x0799, 0x079f, 0x07a3, 0x038c,
+    0x07b8, 0x038f, 0x07bb, 0x00b4, 0x07be, 0x07c0, 0x07c2, 0x2010,
+    0x07cb, 0x002e, 0x07cd, 0x07cf, 0x0020, 0x07d2, 0x07d6, 0x07db,
+    0x07df, 0x07e4, 0x07ea, 0x07f0, 0x0020, 0x07f6, 0x2212, 0x0801,
+    0x0805, 0x0807, 0x081d, 0x0825, 0x0827, 0x0043, 0x082d, 0x0830,
+    0x0190, 0x0836, 0x0839, 0x004e, 0x0845, 0x0847, 0x084c, 0x084e,
+    0x0851, 0x005a, 0x03a9, 0x005a, 0x0853, 0x0857, 0x0860, 0x0069,
+    0x0862, 0x0865, 0x086f, 0x0874, 0x087a, 0x087e, 0x08a2, 0x0049,
+    0x08a4, 0x08a6, 0x08a9, 0x0056, 0x08ab, 0x08ad, 0x08b0, 0x08b4,
+    0x0058, 0x08b6, 0x08b8, 0x08bb, 0x08c0, 0x08c2, 0x08c5, 0x0076,
+    0x08c7, 0x08c9, 0x08cc, 0x08d0, 0x0078, 0x08d2, 0x08d4, 0x08d7,
+    0x08db, 0x08de, 0x08e4, 0x08e7, 0x08f0, 0x08f3, 0x08f6, 0x08f9,
+    0x0902, 0x0906, 0x090b, 0x090f, 0x0914, 0x0917, 0x091a, 0x0923,
+    0x092c, 0x093b, 0x093e, 0x0941, 0x0944, 0x0947, 0x094a, 0x0956,
+    0x095c, 0x0960, 0x0962, 0x0964, 0x0968, 0x096a, 0x0970, 0x0978,
+    0x097c, 0x0980, 0x0986, 0x0989, 0x098f, 0x0991, 0x0030, 0x0993,
+    0x0999, 0x099c, 0x099e, 0x09a1, 0x09a4, 0x2d61, 0x6bcd, 0x9f9f,
+    0x09a6, 0x09b1, 0x09bc, 0x09c7, 0x0a95, 0x0aa1, 0x0b15, 0x0020,
+    0x0b27, 0x0b31, 0x0b8d, 0x0ba1, 0x0ba5, 0x0ba9, 0x0bad, 0x0bb1,
+    0x0bb5, 0x0bb9, 0x0bbd, 0x0bc1, 0x0bc5, 0x0c21, 0x0c35, 0x0c39,
+    0x0c3d, 0x0c41, 0x0c45, 0x0c49, 0x0c4d, 0x0c51, 0x0c55, 0x0c59,
+    0x0c6f, 0x0c71, 0x0c73, 0x0ca0, 0x0cbc, 0x0cdc, 0x0ce4, 0x0cec,
+    0x0cf4, 0x0cfc, 0x0d04, 0x0d0c, 0x0d14, 0x0d22, 0x0d2e, 0x0d7a,
+    0x0d82, 0x0d85, 0x0d89, 0x0d8d, 0x0d9d, 0x0db1, 0x0db5, 0x0dbc,
+    0x0dc2, 0x0dc6, 0x0e28, 0x0e2c, 0x0e30, 0x0e32, 0x0e36, 0x0e3c,
+    0x0e3e, 0x0e41, 0x0e43, 0x0e46, 0x0e77, 0x0e85, 0x0e8a, 0x0e90,
+    0x0e98, 0x0e9f, 0x0ea5, 0x0eb0, 0x0eba, 0x0ec2, 0x0ec6, 0x0ecb,
+    0x0ed5, 0x0ed9, 0x0ee0, 0x0ee8, 0x0eef, 0x0ef4, 0x0f00, 0x0f06,
+    0x0f11, 0x0f17, 0x0f1e, 0x0f24, 0x0f2f, 0x0f39, 0x0f41, 0x0f48,
+    0x0f4d, 0x0f53, 0x0f5a, 0x0f5f, 0x0f65, 0x0f6c, 0x0f72, 0x0f79,
+    0x0f7e, 0x0f85, 0x0f89, 0x0f9a, 0x0fa0, 0x0fa5, 0x0fa9, 0x0fb4,
+    0x0fba, 0x0fc5, 0x0fcc, 0x0fd2, 0x0fd6, 0x0fdd, 0x0fe1, 0x0feb,
+    0x0ff6, 0x0ffc, 0x1000, 0x1005, 0x100b, 0x100f, 0x1016, 0x101b,
+    0x101f, 0x1025, 0x102b, 0x102e, 0x1032, 0x1035, 0x103b, 0x1041,
+    0x1055, 0x105d, 0x1075, 0x1078, 0x107c, 0x1091, 0x109d, 0x10ad,
+    0x10bf, 0x10c7, 0x10cb, 0x10d6, 0x10da, 0x10e6, 0x10ee, 0x10f0,
+    0x10fc, 0x1101, 0x110d, 0x113d, 0x1145, 0x1149, 0x114f, 0x1153,
+    0x1156, 0x116a, 0x116d, 0x1171, 0x1177, 0x1179, 0x117d, 0x1180,
+    0x1188, 0x118e, 0x1192, 0x1198, 0x119e, 0x11a4, 0x11a7, 0xa76f,
+    0x11ab, 0x11af, 0x11b7, 0x1209, 0x1307, 0x1405, 0x1489, 0x148e,
+    0x154c, 0x1565, 0x156b, 0x1571, 0x1577, 0x1583, 0x158f, 0x002b,
+    0x159a, 0x15b2, 0x15b6, 0x15ba, 0x15be, 0x15c2, 0x15c6, 0x15da,
+    0x15de, 0x1642, 0x165b, 0x1681, 0x1687, 0x1745, 0x174b, 0x1750,
+    0x1770, 0x1870, 0x1876, 0x190a, 0x19cc, 0x1a70, 0x1a78, 0x1a96,
+    0x1a9b, 0x1aaf, 0x1ab9, 0x1abf, 0x1ad3, 0x1ad8, 0x1ade, 0x1aec,
+    0x1b1c, 0x1b29, 0x1b31, 0x1b35, 0x1b4b, 0x1bc2, 0x1bd4, 0x1bd6,
+    0x1bd8, 0x3164, 0x1c19, 0x1c1b, 0x1c1d, 0x1c1f, 0x1c21, 0x1c23,
+    0x1c41, 0x1c4f, 0x1c54, 0x1c5d, 0x1c66, 0x1c78, 0x1c81, 0x1ca1,
+    0x1cbc, 0x1cbe, 0x1cc0, 0x1cc2, 0x1cc4, 0x1cc6, 0x1cc8, 0x1cca,
+    0x1cea, 0x1cec, 0x1cee, 0x1cf0, 0x1cf2, 0x1cf9, 0x1cfb, 0x1cfd,
+    0x1cff, 0x1d0e, 0x1d10, 0x1d12, 0x1d14, 0x1d16, 0x1d18, 0x1d1a,
+    0x1d1c, 0x1d1e, 0x1d20, 0x1d22, 0x1d24, 0x1d26, 0x1d28, 0x1d2a,
+    0x1d2e, 0x03f4, 0x1d30, 0x2207, 0x1d32, 0x2202, 0x1d34, 0x1d3c,
+    0x03f4, 0x1d3e, 0x2207, 0x1d40, 0x2202, 0x1d42, 0x1d4a, 0x03f4,
+    0x1d4c, 0x2207, 0x1d4e, 0x2202, 0x1d50, 0x1d58, 0x03f4, 0x1d5a,
+    0x2207, 0x1d5c, 0x2202, 0x1d5e, 0x1d66, 0x03f4, 0x1d68, 0x2207,
+    0x1d6a, 0x2202, 0x1d6c, 0x1d76, 0x1d78, 0x1d7a, 0x1d7c, 0x1d7e,
+    0x1d80, 0x1d86, 0x1da3, 0x062d, 0x1dab, 0x1db7, 0x062c, 0x1dc7,
+    0x1e37, 0x1e43, 0x1e56, 0x1e68, 0x1e7b, 0x1e7d, 0x1e81, 0x1e87,
+    0x1e8d, 0x1e8f, 0x1e93, 0x1e95, 0x1e9d, 0x1ea0, 0x1ea2, 0x1ea6,
+    0x1ea8, 0x30b5, 0x1eae, 0x1f06, 0x1f1c, 0x1f20, 0x1f25, 0x1f72,
+    0x1f83, 0x2084, 0x2094, 0x209a, 0x2194, 0x22b2,
+};
+
+static const uint8_t unicode_decomp_data[9152] = {
+    0x20, 0x88, 0x20, 0x84, 0x32, 0x33, 0x20, 0x81,
+    0x20, 0xa7, 0x31, 0x6f, 0x31, 0xd0, 0x34, 0x31,
+    0xd0, 0x32, 0x33, 0xd0, 0x34, 0x41, 0x80, 0x41,
+    0x81, 0x41, 0x82, 0x41, 0x83, 0x41, 0x88, 0x41,
+    0x8a, 0x00, 0x00, 0x43, 0xa7, 0x45, 0x80, 0x45,
+    0x81, 0x45, 0x82, 0x45, 0x88, 0x49, 0x80, 0x49,
+    0x81, 0x49, 0x82, 0x49, 0x88, 0x00, 0x00, 0x4e,
+    0x83, 0x4f, 0x80, 0x4f, 0x81, 0x4f, 0x82, 0x4f,
+    0x83, 0x4f, 0x88, 0x00, 0x00, 0x00, 0x00, 0x55,
+    0x80, 0x55, 0x81, 0x55, 0x82, 0x55, 0x88, 0x59,
+    0x81, 0x00, 0x00, 0x00, 0x00, 0x61, 0x80, 0x61,
+    0x81, 0x61, 0x82, 0x61, 0x83, 0x61, 0x88, 0x61,
+    0x8a, 0x00, 0x00, 0x63, 0xa7, 0x65, 0x80, 0x65,
+    0x81, 0x65, 0x82, 0x65, 0x88, 0x69, 0x80, 0x69,
+    0x81, 0x69, 0x82, 0x69, 0x88, 0x00, 0x00, 0x6e,
+    0x83, 0x6f, 0x80, 0x6f, 0x81, 0x6f, 0x82, 0x6f,
+    0x83, 0x6f, 0x88, 0x00, 0x00, 0x00, 0x00, 0x75,
+    0x80, 0x75, 0x81, 0x75, 0x82, 0x75, 0x88, 0x79,
+    0x81, 0x00, 0x00, 0x79, 0x88, 0x41, 0x84, 0x41,
+    0x86, 0x41, 0xa8, 0x43, 0x81, 0x43, 0x82, 0x43,
+    0x87, 0x43, 0x8c, 0x44, 0x8c, 0x45, 0x84, 0x45,
+    0x86, 0x45, 0x87, 0x45, 0xa8, 0x45, 0x8c, 0x47,
+    0x82, 0x47, 0x86, 0x47, 0x87, 0x47, 0xa7, 0x48,
+    0x82, 0x49, 0x83, 0x49, 0x84, 0x49, 0x86, 0x49,
+    0xa8, 0x49, 0x87, 0x49, 0x4a, 0x69, 0x6a, 0x4a,
+    0x82, 0x4b, 0xa7, 0x4c, 0x81, 0x4c, 0xa7, 0x4c,
+    0x8c, 0x4c, 0x00, 0x00, 0x6b, 0x20, 0x6b, 0x4e,
+    0x81, 0x4e, 0xa7, 0x4e, 0x8c, 0xbc, 0x02, 0x6e,
+    0x4f, 0x84, 0x4f, 0x86, 0x4f, 0x8b, 0x52, 0x81,
+    0x52, 0xa7, 0x52, 0x8c, 0x53, 0x81, 0x53, 0x82,
+    0x53, 0xa7, 0x53, 0x8c, 0x54, 0xa7, 0x54, 0x8c,
+    0x55, 0x83, 0x55, 0x84, 0x55, 0x86, 0x55, 0x8a,
+    0x55, 0x8b, 0x55, 0xa8, 0x57, 0x82, 0x59, 0x82,
+    0x59, 0x88, 0x5a, 0x81, 0x5a, 0x87, 0x5a, 0x8c,
+    0x4f, 0x9b, 0x55, 0x9b, 0x44, 0x00, 0x7d, 0x01,
+    0x44, 0x00, 0x7e, 0x01, 0x64, 0x00, 0x7e, 0x01,
+    0x4c, 0x4a, 0x4c, 0x6a, 0x6c, 0x6a, 0x4e, 0x4a,
+    0x4e, 0x6a, 0x6e, 0x6a, 0x41, 0x00, 0x8c, 0x49,
+    0x00, 0x8c, 0x4f, 0x00, 0x8c, 0x55, 0x00, 0x8c,
+    0xdc, 0x00, 0x84, 0xdc, 0x00, 0x81, 0xdc, 0x00,
+    0x8c, 0xdc, 0x00, 0x80, 0xc4, 0x00, 0x84, 0x26,
+    0x02, 0x84, 0xc6, 0x00, 0x84, 0x47, 0x8c, 0x4b,
+    0x8c, 0x4f, 0xa8, 0xea, 0x01, 0x84, 0xeb, 0x01,
+    0x84, 0xb7, 0x01, 0x8c, 0x92, 0x02, 0x8c, 0x6a,
+    0x00, 0x8c, 0x44, 0x5a, 0x44, 0x7a, 0x64, 0x7a,
+    0x47, 0x81, 0x4e, 0x00, 0x80, 0xc5, 0x00, 0x81,
+    0xc6, 0x00, 0x81, 0xd8, 0x00, 0x81, 0x41, 0x8f,
+    0x41, 0x91, 0x45, 0x8f, 0x45, 0x91, 0x49, 0x8f,
+    0x49, 0x91, 0x4f, 0x8f, 0x4f, 0x91, 0x52, 0x8f,
+    0x52, 0x91, 0x55, 0x8f, 0x55, 0x91, 0x53, 0xa6,
+    0x54, 0xa6, 0x48, 0x8c, 0x41, 0x00, 0x87, 0x45,
+    0x00, 0xa7, 0xd6, 0x00, 0x84, 0xd5, 0x00, 0x84,
+    0x4f, 0x00, 0x87, 0x2e, 0x02, 0x84, 0x59, 0x00,
+    0x84, 0x68, 0x00, 0x66, 0x02, 0x6a, 0x00, 0x72,
+    0x00, 0x79, 0x02, 0x7b, 0x02, 0x81, 0x02, 0x77,
+    0x00, 0x79, 0x00, 0x20, 0x86, 0x20, 0x87, 0x20,
+    0x8a, 0x20, 0xa8, 0x20, 0x83, 0x20, 0x8b, 0x63,
+    0x02, 0x6c, 0x00, 0x73, 0x00, 0x78, 0x00, 0x95,
+    0x02, 0x80, 0x81, 0x00, 0x93, 0x88, 0x81, 0x20,
+    0xc5, 0x20, 0x81, 0xa8, 0x00, 0x81, 0x91, 0x03,
+    0x81, 0x95, 0x03, 0x81, 0x97, 0x03, 0x81, 0x99,
+    0x03, 0x81, 0x00, 0x00, 0x00, 0x9f, 0x03, 0x81,
+    0x00, 0x00, 0x00, 0xa5, 0x03, 0x81, 0xa9, 0x03,
+    0x81, 0xca, 0x03, 0x81, 0x01, 0x03, 0x98, 0x07,
+    0xa4, 0x07, 0xb0, 0x00, 0xb4, 0x00, 0xb6, 0x00,
+    0xb8, 0x00, 0xca, 0x00, 0x01, 0x03, 0xb8, 0x07,
+    0xc4, 0x07, 0xbe, 0x00, 0xc4, 0x00, 0xc8, 0x00,
+    0xa5, 0x03, 0x0d, 0x13, 0x00, 0x01, 0x03, 0xd1,
+    0x00, 0xd1, 0x07, 0xc6, 0x03, 0xc0, 0x03, 0xba,
+    0x03, 0xc1, 0x03, 0xc2, 0x03, 0x00, 0x00, 0x98,
+    0x03, 0xb5, 0x03, 0x15, 0x04, 0x80, 0x15, 0x04,
+    0x88, 0x00, 0x00, 0x00, 0x13, 0x04, 0x81, 0x06,
+    0x04, 0x88, 0x1a, 0x04, 0x81, 0x18, 0x04, 0x80,
+    0x23, 0x04, 0x86, 0x18, 0x04, 0x86, 0x38, 0x04,
+    0x86, 0x35, 0x04, 0x80, 0x35, 0x04, 0x88, 0x00,
+    0x00, 0x00, 0x33, 0x04, 0x81, 0x56, 0x04, 0x88,
+    0x3a, 0x04, 0x81, 0x38, 0x04, 0x80, 0x43, 0x04,
+    0x86, 0x74, 0x04, 0x8f, 0x16, 0x04, 0x86, 0x10,
+    0x04, 0x86, 0x10, 0x04, 0x88, 0x15, 0x04, 0x86,
+    0xd8, 0x04, 0x88, 0x16, 0x04, 0x88, 0x17, 0x04,
+    0x88, 0x18, 0x04, 0x84, 0x18, 0x04, 0x88, 0x1e,
+    0x04, 0x88, 0xe8, 0x04, 0x88, 0x2d, 0x04, 0x88,
+    0x23, 0x04, 0x84, 0x23, 0x04, 0x88, 0x23, 0x04,
+    0x8b, 0x27, 0x04, 0x88, 0x2b, 0x04, 0x88, 0x65,
+    0x05, 0x82, 0x05, 0x27, 0x06, 0x00, 0x2c, 0x00,
+    0x2d, 0x21, 0x2d, 0x00, 0x2e, 0x23, 0x2d, 0x27,
+    0x06, 0x00, 0x4d, 0x21, 0x4d, 0xa0, 0x4d, 0x23,
+    0x4d, 0xd5, 0x06, 0x54, 0x06, 0x00, 0x00, 0x00,
+    0x00, 0xc1, 0x06, 0x54, 0x06, 0xd2, 0x06, 0x54,
+    0x06, 0x28, 0x09, 0x3c, 0x09, 0x30, 0x09, 0x3c,
+    0x09, 0x33, 0x09, 0x3c, 0x09, 0x15, 0x09, 0x00,
+    0x27, 0x01, 0x27, 0x02, 0x27, 0x07, 0x27, 0x0c,
+    0x27, 0x0d, 0x27, 0x16, 0x27, 0x1a, 0x27, 0xbe,
+    0x09, 0x09, 0x00, 0x09, 0x19, 0xa1, 0x09, 0xbc,
+    0x09, 0xaf, 0x09, 0xbc, 0x09, 0x32, 0x0a, 0x3c,
+    0x0a, 0x38, 0x0a, 0x3c, 0x0a, 0x16, 0x0a, 0x00,
+    0x26, 0x01, 0x26, 0x06, 0x26, 0x2b, 0x0a, 0x3c,
+    0x0a, 0x47, 0x0b, 0x56, 0x0b, 0x3e, 0x0b, 0x09,
+    0x00, 0x09, 0x19, 0x21, 0x0b, 0x3c, 0x0b, 0x92,
+    0x0b, 0xd7, 0x0b, 0xbe, 0x0b, 0x08, 0x00, 0x09,
+    0x00, 0x08, 0x19, 0x46, 0x0c, 0x56, 0x0c, 0xbf,
+    0x0c, 0xd5, 0x0c, 0xc6, 0x0c, 0xd5, 0x0c, 0xc2,
+    0x0c, 0x04, 0x00, 0x08, 0x13, 0x3e, 0x0d, 0x08,
+    0x00, 0x09, 0x00, 0x08, 0x19, 0xd9, 0x0d, 0xca,
+    0x0d, 0xca, 0x0d, 0x0f, 0x05, 0x12, 0x00, 0x0f,
+    0x15, 0x4d, 0x0e, 0x32, 0x0e, 0xcd, 0x0e, 0xb2,
+    0x0e, 0x99, 0x0e, 0x12, 0x00, 0x12, 0x08, 0x42,
+    0x0f, 0xb7, 0x0f, 0x4c, 0x0f, 0xb7, 0x0f, 0x51,
+    0x0f, 0xb7, 0x0f, 0x56, 0x0f, 0xb7, 0x0f, 0x5b,
+    0x0f, 0xb7, 0x0f, 0x40, 0x0f, 0xb5, 0x0f, 0x71,
+    0x0f, 0x72, 0x0f, 0x71, 0x0f, 0x00, 0x03, 0x41,
+    0x0f, 0xb2, 0x0f, 0x81, 0x0f, 0xb3, 0x0f, 0x80,
+    0x0f, 0xb3, 0x0f, 0x81, 0x0f, 0x71, 0x0f, 0x80,
+    0x0f, 0x92, 0x0f, 0xb7, 0x0f, 0x9c, 0x0f, 0xb7,
+    0x0f, 0xa1, 0x0f, 0xb7, 0x0f, 0xa6, 0x0f, 0xb7,
+    0x0f, 0xab, 0x0f, 0xb7, 0x0f, 0x90, 0x0f, 0xb5,
+    0x0f, 0x25, 0x10, 0x2e, 0x10, 0x05, 0x1b, 0x35,
+    0x1b, 0x00, 0x00, 0x00, 0x00, 0x07, 0x1b, 0x35,
+    0x1b, 0x00, 0x00, 0x00, 0x00, 0x09, 0x1b, 0x35,
+    0x1b, 0x00, 0x00, 0x00, 0x00, 0x0b, 0x1b, 0x35,
+    0x1b, 0x00, 0x00, 0x00, 0x00, 0x0d, 0x1b, 0x35,
+    0x1b, 0x11, 0x1b, 0x35, 0x1b, 0x3a, 0x1b, 0x35,
+    0x1b, 0x00, 0x00, 0x00, 0x00, 0x3c, 0x1b, 0x35,
+    0x1b, 0x3e, 0x1b, 0x35, 0x1b, 0x42, 0x1b, 0x35,
+    0x1b, 0x41, 0x00, 0xc6, 0x00, 0x42, 0x00, 0x00,
+    0x00, 0x44, 0x00, 0x45, 0x00, 0x8e, 0x01, 0x47,
+    0x00, 0x4f, 0x00, 0x22, 0x02, 0x50, 0x00, 0x52,
+    0x00, 0x54, 0x00, 0x55, 0x00, 0x57, 0x00, 0x61,
+    0x00, 0x50, 0x02, 0x51, 0x02, 0x02, 0x1d, 0x62,
+    0x00, 0x64, 0x00, 0x65, 0x00, 0x59, 0x02, 0x5b,
+    0x02, 0x5c, 0x02, 0x67, 0x00, 0x00, 0x00, 0x6b,
+    0x00, 0x6d, 0x00, 0x4b, 0x01, 0x6f, 0x00, 0x54,
+    0x02, 0x16, 0x1d, 0x17, 0x1d, 0x70, 0x00, 0x74,
+    0x00, 0x75, 0x00, 0x1d, 0x1d, 0x6f, 0x02, 0x76,
+    0x00, 0x25, 0x1d, 0xb2, 0x03, 0xb3, 0x03, 0xb4,
+    0x03, 0xc6, 0x03, 0xc7, 0x03, 0x69, 0x00, 0x72,
+    0x00, 0x75, 0x00, 0x76, 0x00, 0xb2, 0x03, 0xb3,
+    0x03, 0xc1, 0x03, 0xc6, 0x03, 0xc7, 0x03, 0x52,
+    0x02, 0x63, 0x00, 0x55, 0x02, 0xf0, 0x00, 0x5c,
+    0x02, 0x66, 0x00, 0x5f, 0x02, 0x61, 0x02, 0x65,
+    0x02, 0x68, 0x02, 0x69, 0x02, 0x6a, 0x02, 0x7b,
+    0x1d, 0x9d, 0x02, 0x6d, 0x02, 0x85, 0x1d, 0x9f,
+    0x02, 0x71, 0x02, 0x70, 0x02, 0x72, 0x02, 0x73,
+    0x02, 0x74, 0x02, 0x75, 0x02, 0x78, 0x02, 0x82,
+    0x02, 0x83, 0x02, 0xab, 0x01, 0x89, 0x02, 0x8a,
+    0x02, 0x1c, 0x1d, 0x8b, 0x02, 0x8c, 0x02, 0x7a,
+    0x00, 0x90, 0x02, 0x91, 0x02, 0x92, 0x02, 0xb8,
+    0x03, 0x41, 0x00, 0xa5, 0x42, 0x00, 0x87, 0x42,
+    0x00, 0xa3, 0x42, 0x00, 0xb1, 0xc7, 0x00, 0x81,
+    0x44, 0x00, 0x87, 0x44, 0x00, 0xa3, 0x44, 0x00,
+    0xb1, 0x44, 0x00, 0xa7, 0x44, 0x00, 0xad, 0x12,
+    0x01, 0x80, 0x12, 0x01, 0x81, 0x45, 0x00, 0xad,
+    0x45, 0x00, 0xb0, 0x28, 0x02, 0x86, 0x46, 0x00,
+    0x87, 0x47, 0x00, 0x84, 0x48, 0x00, 0x87, 0x48,
+    0x00, 0xa3, 0x48, 0x00, 0x88, 0x48, 0x00, 0xa7,
+    0x48, 0x00, 0xae, 0x49, 0x00, 0xb0, 0xcf, 0x00,
+    0x81, 0x4b, 0x00, 0x81, 0x4b, 0x00, 0xa3, 0x4b,
+    0x00, 0xb1, 0x4c, 0x00, 0xa3, 0x36, 0x1e, 0x84,
+    0x4c, 0xb1, 0x4c, 0xad, 0x4d, 0x81, 0x4d, 0x87,
+    0x4d, 0xa3, 0x4e, 0x87, 0x4e, 0xa3, 0x4e, 0xb1,
+    0x4e, 0xad, 0xd5, 0x00, 0x81, 0xd5, 0x00, 0x88,
+    0x4c, 0x01, 0x80, 0x4c, 0x01, 0x81, 0x50, 0x00,
+    0x81, 0x50, 0x00, 0x87, 0x52, 0x00, 0x87, 0x52,
+    0x00, 0xa3, 0x5a, 0x1e, 0x84, 0x52, 0x00, 0xb1,
+    0x53, 0x00, 0x87, 0x53, 0x00, 0xa3, 0x5a, 0x01,
+    0x87, 0x60, 0x01, 0x87, 0x62, 0x1e, 0x87, 0x54,
+    0x00, 0x87, 0x54, 0x00, 0xa3, 0x54, 0x00, 0xb1,
+    0x54, 0x00, 0xad, 0x55, 0x00, 0xa4, 0x55, 0x00,
+    0xb0, 0x55, 0x00, 0xad, 0x68, 0x01, 0x81, 0x6a,
+    0x01, 0x88, 0x56, 0x83, 0x56, 0xa3, 0x57, 0x80,
+    0x57, 0x81, 0x57, 0x88, 0x57, 0x87, 0x57, 0xa3,
+    0x58, 0x87, 0x58, 0x88, 0x59, 0x87, 0x5a, 0x82,
+    0x5a, 0xa3, 0x5a, 0xb1, 0x68, 0xb1, 0x74, 0x88,
+    0x77, 0x8a, 0x79, 0x8a, 0x61, 0x00, 0xbe, 0x02,
+    0x7f, 0x01, 0x87, 0x41, 0x00, 0xa3, 0x41, 0x00,
+    0x89, 0xc2, 0x00, 0x81, 0xc2, 0x00, 0x80, 0xc2,
+    0x00, 0x89, 0xc2, 0x00, 0x83, 0xa0, 0x1e, 0x82,
+    0x02, 0x01, 0x81, 0x02, 0x01, 0x80, 0x02, 0x01,
+    0x89, 0x02, 0x01, 0x83, 0xa0, 0x1e, 0x86, 0x45,
+    0x00, 0xa3, 0x45, 0x00, 0x89, 0x45, 0x00, 0x83,
+    0xca, 0x00, 0x81, 0xca, 0x00, 0x80, 0xca, 0x00,
+    0x89, 0xca, 0x00, 0x83, 0xb8, 0x1e, 0x82, 0x49,
+    0x00, 0x89, 0x49, 0x00, 0xa3, 0x4f, 0x00, 0xa3,
+    0x4f, 0x00, 0x89, 0xd4, 0x00, 0x81, 0xd4, 0x00,
+    0x80, 0xd4, 0x00, 0x89, 0xd4, 0x00, 0x83, 0xcc,
+    0x1e, 0x82, 0xa0, 0x01, 0x81, 0xa0, 0x01, 0x80,
+    0xa0, 0x01, 0x89, 0xa0, 0x01, 0x83, 0xa0, 0x01,
+    0xa3, 0x55, 0x00, 0xa3, 0x55, 0x00, 0x89, 0xaf,
+    0x01, 0x81, 0xaf, 0x01, 0x80, 0xaf, 0x01, 0x89,
+    0xaf, 0x01, 0x83, 0xaf, 0x01, 0xa3, 0x59, 0x00,
+    0x80, 0x59, 0x00, 0xa3, 0x59, 0x00, 0x89, 0x59,
+    0x00, 0x83, 0xb1, 0x03, 0x13, 0x03, 0x00, 0x1f,
+    0x80, 0x00, 0x1f, 0x81, 0x00, 0x1f, 0xc2, 0x91,
+    0x03, 0x13, 0x03, 0x08, 0x1f, 0x80, 0x08, 0x1f,
+    0x81, 0x08, 0x1f, 0xc2, 0xb5, 0x03, 0x13, 0x03,
+    0x10, 0x1f, 0x80, 0x10, 0x1f, 0x81, 0x95, 0x03,
+    0x13, 0x03, 0x18, 0x1f, 0x80, 0x18, 0x1f, 0x81,
+    0xb7, 0x03, 0x93, 0xb7, 0x03, 0x94, 0x20, 0x1f,
+    0x80, 0x21, 0x1f, 0x80, 0x20, 0x1f, 0x81, 0x21,
+    0x1f, 0x81, 0x20, 0x1f, 0xc2, 0x21, 0x1f, 0xc2,
+    0x97, 0x03, 0x93, 0x97, 0x03, 0x94, 0x28, 0x1f,
+    0x80, 0x29, 0x1f, 0x80, 0x28, 0x1f, 0x81, 0x29,
+    0x1f, 0x81, 0x28, 0x1f, 0xc2, 0x29, 0x1f, 0xc2,
+    0xb9, 0x03, 0x93, 0xb9, 0x03, 0x94, 0x30, 0x1f,
+    0x80, 0x31, 0x1f, 0x80, 0x30, 0x1f, 0x81, 0x31,
+    0x1f, 0x81, 0x30, 0x1f, 0xc2, 0x31, 0x1f, 0xc2,
+    0x99, 0x03, 0x93, 0x99, 0x03, 0x94, 0x38, 0x1f,
+    0x80, 0x39, 0x1f, 0x80, 0x38, 0x1f, 0x81, 0x39,
+    0x1f, 0x81, 0x38, 0x1f, 0xc2, 0x39, 0x1f, 0xc2,
+    0xbf, 0x03, 0x93, 0xbf, 0x03, 0x94, 0x40, 0x1f,
+    0x80, 0x40, 0x1f, 0x81, 0x9f, 0x03, 0x13, 0x03,
+    0x48, 0x1f, 0x80, 0x48, 0x1f, 0x81, 0xc5, 0x03,
+    0x13, 0x03, 0x50, 0x1f, 0x80, 0x50, 0x1f, 0x81,
+    0x50, 0x1f, 0xc2, 0xa5, 0x03, 0x94, 0x00, 0x00,
+    0x00, 0x59, 0x1f, 0x80, 0x00, 0x00, 0x00, 0x59,
+    0x1f, 0x81, 0x00, 0x00, 0x00, 0x59, 0x1f, 0xc2,
+    0xc9, 0x03, 0x93, 0xc9, 0x03, 0x94, 0x60, 0x1f,
+    0x80, 0x61, 0x1f, 0x80, 0x60, 0x1f, 0x81, 0x61,
+    0x1f, 0x81, 0x60, 0x1f, 0xc2, 0x61, 0x1f, 0xc2,
+    0xa9, 0x03, 0x93, 0xa9, 0x03, 0x94, 0x68, 0x1f,
+    0x80, 0x69, 0x1f, 0x80, 0x68, 0x1f, 0x81, 0x69,
+    0x1f, 0x81, 0x68, 0x1f, 0xc2, 0x69, 0x1f, 0xc2,
+    0xb1, 0x03, 0x80, 0xb5, 0x03, 0x80, 0xb7, 0x03,
+    0x80, 0xb9, 0x03, 0x80, 0xbf, 0x03, 0x80, 0xc5,
+    0x03, 0x80, 0xc9, 0x03, 0x80, 0x00, 0x1f, 0x45,
+    0x03, 0x20, 0x1f, 0x45, 0x03, 0x60, 0x1f, 0x45,
+    0x03, 0xb1, 0x03, 0x86, 0xb1, 0x03, 0x84, 0x70,
+    0x1f, 0xc5, 0xb1, 0x03, 0xc5, 0xac, 0x03, 0xc5,
+    0x00, 0x00, 0x00, 0xb1, 0x03, 0xc2, 0xb6, 0x1f,
+    0xc5, 0x91, 0x03, 0x86, 0x91, 0x03, 0x84, 0x91,
+    0x03, 0x80, 0x91, 0x03, 0xc5, 0x20, 0x93, 0x20,
+    0x93, 0x20, 0xc2, 0xa8, 0x00, 0xc2, 0x74, 0x1f,
+    0xc5, 0xb7, 0x03, 0xc5, 0xae, 0x03, 0xc5, 0x00,
+    0x00, 0x00, 0xb7, 0x03, 0xc2, 0xc6, 0x1f, 0xc5,
+    0x95, 0x03, 0x80, 0x97, 0x03, 0x80, 0x97, 0x03,
+    0xc5, 0xbf, 0x1f, 0x80, 0xbf, 0x1f, 0x81, 0xbf,
+    0x1f, 0xc2, 0xb9, 0x03, 0x86, 0xb9, 0x03, 0x84,
+    0xca, 0x03, 0x80, 0x00, 0x03, 0xb9, 0x42, 0xca,
+    0x42, 0x99, 0x06, 0x99, 0x04, 0x99, 0x00, 0xfe,
+    0x1f, 0x80, 0xfe, 0x1f, 0x81, 0xfe, 0x1f, 0xc2,
+    0xc5, 0x03, 0x86, 0xc5, 0x03, 0x84, 0xcb, 0x03,
+    0x80, 0x00, 0x03, 0xc1, 0x13, 0xc1, 0x14, 0xc5,
+    0x42, 0xcb, 0x42, 0xa5, 0x06, 0xa5, 0x04, 0xa5,
+    0x00, 0xa1, 0x03, 0x94, 0xa8, 0x00, 0x80, 0x85,
+    0x03, 0x60, 0x00, 0x7c, 0x1f, 0xc5, 0xc9, 0x03,
+    0xc5, 0xce, 0x03, 0xc5, 0x00, 0x00, 0x00, 0xc9,
+    0x03, 0xc2, 0xf6, 0x1f, 0xc5, 0x9f, 0x03, 0x80,
+    0xa9, 0x03, 0x80, 0xa9, 0x03, 0xc5, 0x20, 0x94,
+    0x02, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
+    0x20, 0x20, 0x20, 0x20, 0xb3, 0x2e, 0x2e, 0x2e,
+    0x2e, 0x2e, 0x32, 0x20, 0x32, 0x20, 0x32, 0x20,
+    0x00, 0x00, 0x00, 0x35, 0x20, 0x35, 0x20, 0x35,
+    0x20, 0x00, 0x00, 0x00, 0x21, 0x21, 0x00, 0x00,
+    0x20, 0x85, 0x3f, 0x3f, 0x3f, 0x21, 0x21, 0x3f,
+    0x32, 0x20, 0x00, 0x00, 0x00, 0x00, 0x30, 0x69,
+    0x00, 0x00, 0x34, 0x35, 0x36, 0x37, 0x38, 0x39,
+    0x2b, 0x3d, 0x28, 0x29, 0x6e, 0x30, 0x00, 0x2b,
+    0x00, 0x12, 0x22, 0x3d, 0x00, 0x28, 0x00, 0x29,
+    0x00, 0x00, 0x00, 0x61, 0x00, 0x65, 0x00, 0x6f,
+    0x00, 0x78, 0x00, 0x59, 0x02, 0x68, 0x6b, 0x6c,
+    0x6d, 0x6e, 0x70, 0x73, 0x74, 0x52, 0x73, 0x61,
+    0x2f, 0x63, 0x61, 0x2f, 0x73, 0xb0, 0x00, 0x43,
+    0x63, 0x2f, 0x6f, 0x63, 0x2f, 0x75, 0xb0, 0x00,
+    0x46, 0x48, 0x00, 0x1f, 0x00, 0x00, 0x00, 0x20,
+    0xdf, 0x01, 0x01, 0x04, 0x24, 0x4e, 0x6f, 0x50,
+    0x51, 0x52, 0x52, 0x52, 0x53, 0x4d, 0x54, 0x45,
+    0x4c, 0x54, 0x4d, 0x4b, 0x00, 0xc5, 0x00, 0x42,
+    0x43, 0x00, 0x65, 0x45, 0x46, 0x00, 0x4d, 0x6f,
+    0xd0, 0x05, 0x46, 0x41, 0x58, 0xc0, 0x03, 0xb3,
+    0x03, 0x93, 0x03, 0xa0, 0x03, 0x11, 0x22, 0x44,
+    0x64, 0x65, 0x69, 0x6a, 0x31, 0xd0, 0x37, 0x31,
+    0xd0, 0x39, 0x31, 0xd0, 0x31, 0x30, 0x31, 0xd0,
+    0x33, 0x32, 0xd0, 0x33, 0x31, 0xd0, 0x35, 0x32,
+    0xd0, 0x35, 0x33, 0xd0, 0x35, 0x34, 0xd0, 0x35,
+    0x31, 0xd0, 0x36, 0x35, 0xd0, 0x36, 0x31, 0xd0,
+    0x38, 0x33, 0xd0, 0x38, 0x35, 0xd0, 0x38, 0x37,
+    0xd0, 0x38, 0x31, 0xd0, 0x49, 0x49, 0x49, 0x49,
+    0x49, 0x49, 0x56, 0x56, 0x49, 0x56, 0x49, 0x49,
+    0x56, 0x49, 0x49, 0x49, 0x49, 0x58, 0x58, 0x49,
+    0x58, 0x49, 0x49, 0x4c, 0x43, 0x44, 0x4d, 0x69,
+    0x69, 0x69, 0x69, 0x69, 0x69, 0x69, 0x76, 0x76,
+    0x69, 0x76, 0x69, 0x69, 0x76, 0x69, 0x69, 0x69,
+    0x69, 0x78, 0x78, 0x69, 0x78, 0x69, 0x69, 0x6c,
+    0x63, 0x64, 0x6d, 0x30, 0xd0, 0x33, 0x90, 0x21,
+    0xb8, 0x92, 0x21, 0xb8, 0x94, 0x21, 0xb8, 0xd0,
+    0x21, 0xb8, 0xd4, 0x21, 0xb8, 0xd2, 0x21, 0xb8,
+    0x03, 0x22, 0xb8, 0x08, 0x22, 0xb8, 0x0b, 0x22,
+    0xb8, 0x23, 0x22, 0xb8, 0x00, 0x00, 0x00, 0x25,
+    0x22, 0xb8, 0x2b, 0x22, 0x2b, 0x22, 0x2b, 0x22,
+    0x00, 0x00, 0x00, 0x2e, 0x22, 0x2e, 0x22, 0x2e,
+    0x22, 0x00, 0x00, 0x00, 0x3c, 0x22, 0xb8, 0x43,
+    0x22, 0xb8, 0x45, 0x22, 0xb8, 0x00, 0x00, 0x00,
+    0x48, 0x22, 0xb8, 0x3d, 0x00, 0xb8, 0x00, 0x00,
+    0x00, 0x61, 0x22, 0xb8, 0x4d, 0x22, 0xb8, 0x3c,
+    0x00, 0xb8, 0x3e, 0x00, 0xb8, 0x64, 0x22, 0xb8,
+    0x65, 0x22, 0xb8, 0x72, 0x22, 0xb8, 0x76, 0x22,
+    0xb8, 0x7a, 0x22, 0xb8, 0x82, 0x22, 0xb8, 0x86,
+    0x22, 0xb8, 0xa2, 0x22, 0xb8, 0xa8, 0x22, 0xb8,
+    0xa9, 0x22, 0xb8, 0xab, 0x22, 0xb8, 0x7c, 0x22,
+    0xb8, 0x91, 0x22, 0xb8, 0xb2, 0x22, 0x38, 0x03,
+    0x08, 0x30, 0x31, 0x00, 0x31, 0x00, 0x30, 0x00,
+    0x32, 0x30, 0x28, 0x00, 0x31, 0x00, 0x29, 0x00,
+    0x28, 0x00, 0x31, 0x00, 0x30, 0x00, 0x29, 0x00,
+    0x28, 0x32, 0x30, 0x29, 0x31, 0x00, 0x2e, 0x00,
+    0x31, 0x00, 0x30, 0x00, 0x2e, 0x00, 0x32, 0x30,
+    0x2e, 0x28, 0x00, 0x61, 0x00, 0x29, 0x00, 0x41,
+    0x00, 0x61, 0x00, 0x2b, 0x22, 0x00, 0x00, 0x00,
+    0x00, 0x3a, 0x3a, 0x3d, 0x3d, 0x3d, 0x3d, 0x3d,
+    0x3d, 0xdd, 0x2a, 0xb8, 0x6a, 0x56, 0x00, 0x4e,
+    0x00, 0x28, 0x36, 0x3f, 0x59, 0x85, 0x8c, 0xa0,
+    0xba, 0x3f, 0x51, 0x00, 0x26, 0x2c, 0x43, 0x57,
+    0x6c, 0xa1, 0xb6, 0xc1, 0x9b, 0x52, 0x00, 0x5e,
+    0x7a, 0x7f, 0x9d, 0xa6, 0xc1, 0xce, 0xe7, 0xb6,
+    0x53, 0xc8, 0x53, 0xe3, 0x53, 0xd7, 0x56, 0x1f,
+    0x57, 0xeb, 0x58, 0x02, 0x59, 0x0a, 0x59, 0x15,
+    0x59, 0x27, 0x59, 0x73, 0x59, 0x50, 0x5b, 0x80,
+    0x5b, 0xf8, 0x5b, 0x0f, 0x5c, 0x22, 0x5c, 0x38,
+    0x5c, 0x6e, 0x5c, 0x71, 0x5c, 0xdb, 0x5d, 0xe5,
+    0x5d, 0xf1, 0x5d, 0xfe, 0x5d, 0x72, 0x5e, 0x7a,
+    0x5e, 0x7f, 0x5e, 0xf4, 0x5e, 0xfe, 0x5e, 0x0b,
+    0x5f, 0x13, 0x5f, 0x50, 0x5f, 0x61, 0x5f, 0x73,
+    0x5f, 0xc3, 0x5f, 0x08, 0x62, 0x36, 0x62, 0x4b,
+    0x62, 0x2f, 0x65, 0x34, 0x65, 0x87, 0x65, 0x97,
+    0x65, 0xa4, 0x65, 0xb9, 0x65, 0xe0, 0x65, 0xe5,
+    0x65, 0xf0, 0x66, 0x08, 0x67, 0x28, 0x67, 0x20,
+    0x6b, 0x62, 0x6b, 0x79, 0x6b, 0xb3, 0x6b, 0xcb,
+    0x6b, 0xd4, 0x6b, 0xdb, 0x6b, 0x0f, 0x6c, 0x14,
+    0x6c, 0x34, 0x6c, 0x6b, 0x70, 0x2a, 0x72, 0x36,
+    0x72, 0x3b, 0x72, 0x3f, 0x72, 0x47, 0x72, 0x59,
+    0x72, 0x5b, 0x72, 0xac, 0x72, 0x84, 0x73, 0x89,
+    0x73, 0xdc, 0x74, 0xe6, 0x74, 0x18, 0x75, 0x1f,
+    0x75, 0x28, 0x75, 0x30, 0x75, 0x8b, 0x75, 0x92,
+    0x75, 0x76, 0x76, 0x7d, 0x76, 0xae, 0x76, 0xbf,
+    0x76, 0xee, 0x76, 0xdb, 0x77, 0xe2, 0x77, 0xf3,
+    0x77, 0x3a, 0x79, 0xb8, 0x79, 0xbe, 0x79, 0x74,
+    0x7a, 0xcb, 0x7a, 0xf9, 0x7a, 0x73, 0x7c, 0xf8,
+    0x7c, 0x36, 0x7f, 0x51, 0x7f, 0x8a, 0x7f, 0xbd,
+    0x7f, 0x01, 0x80, 0x0c, 0x80, 0x12, 0x80, 0x33,
+    0x80, 0x7f, 0x80, 0x89, 0x80, 0xe3, 0x81, 0x00,
+    0x07, 0x10, 0x19, 0x29, 0x38, 0x3c, 0x8b, 0x8f,
+    0x95, 0x4d, 0x86, 0x6b, 0x86, 0x40, 0x88, 0x4c,
+    0x88, 0x63, 0x88, 0x7e, 0x89, 0x8b, 0x89, 0xd2,
+    0x89, 0x00, 0x8a, 0x37, 0x8c, 0x46, 0x8c, 0x55,
+    0x8c, 0x78, 0x8c, 0x9d, 0x8c, 0x64, 0x8d, 0x70,
+    0x8d, 0xb3, 0x8d, 0xab, 0x8e, 0xca, 0x8e, 0x9b,
+    0x8f, 0xb0, 0x8f, 0xb5, 0x8f, 0x91, 0x90, 0x49,
+    0x91, 0xc6, 0x91, 0xcc, 0x91, 0xd1, 0x91, 0x77,
+    0x95, 0x80, 0x95, 0x1c, 0x96, 0xb6, 0x96, 0xb9,
+    0x96, 0xe8, 0x96, 0x51, 0x97, 0x5e, 0x97, 0x62,
+    0x97, 0x69, 0x97, 0xcb, 0x97, 0xed, 0x97, 0xf3,
+    0x97, 0x01, 0x98, 0xa8, 0x98, 0xdb, 0x98, 0xdf,
+    0x98, 0x96, 0x99, 0x99, 0x99, 0xac, 0x99, 0xa8,
+    0x9a, 0xd8, 0x9a, 0xdf, 0x9a, 0x25, 0x9b, 0x2f,
+    0x9b, 0x32, 0x9b, 0x3c, 0x9b, 0x5a, 0x9b, 0xe5,
+    0x9c, 0x75, 0x9e, 0x7f, 0x9e, 0xa5, 0x9e, 0x00,
+    0x16, 0x1e, 0x28, 0x2c, 0x54, 0x58, 0x69, 0x6e,
+    0x7b, 0x96, 0xa5, 0xad, 0xe8, 0xf7, 0xfb, 0x12,
+    0x30, 0x00, 0x00, 0x41, 0x53, 0x44, 0x53, 0x45,
+    0x53, 0x4b, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+    0x00, 0x4d, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+    0x00, 0x4f, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+    0x00, 0x51, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+    0x00, 0x53, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+    0x00, 0x55, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+    0x00, 0x57, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+    0x00, 0x59, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+    0x00, 0x5b, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+    0x00, 0x5d, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+    0x00, 0x5f, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+    0x00, 0x61, 0x30, 0x99, 0x30, 0x64, 0x30, 0x99,
+    0x30, 0x00, 0x00, 0x00, 0x00, 0x66, 0x30, 0x99,
+    0x30, 0x00, 0x00, 0x00, 0x00, 0x68, 0x30, 0x99,
+    0x30, 0x6f, 0x30, 0x99, 0x30, 0x72, 0x30, 0x99,
+    0x30, 0x75, 0x30, 0x99, 0x30, 0x78, 0x30, 0x99,
+    0x30, 0x7b, 0x30, 0x99, 0x30, 0x46, 0x30, 0x99,
+    0x30, 0x20, 0x00, 0x99, 0x30, 0x9d, 0x30, 0x99,
+    0x30, 0x88, 0x30, 0x8a, 0x30, 0xab, 0x30, 0x99,
+    0x30, 0x00, 0x00, 0x00, 0x00, 0xad, 0x30, 0x99,
+    0x30, 0x00, 0x00, 0x00, 0x00, 0xaf, 0x30, 0x99,
+    0x30, 0x00, 0x00, 0x00, 0x00, 0xb1, 0x30, 0x99,
+    0x30, 0x00, 0x00, 0x00, 0x00, 0xb3, 0x30, 0x99,
+    0x30, 0x00, 0x00, 0x00, 0x00, 0xb5, 0x30, 0x99,
+    0x30, 0x00, 0x00, 0x00, 0x00, 0xb7, 0x30, 0x99,
+    0x30, 0x00, 0x00, 0x00, 0x00, 0xb9, 0x30, 0x99,
+    0x30, 0x00, 0x00, 0x00, 0x00, 0xbb, 0x30, 0x99,
+    0x30, 0x00, 0x00, 0x00, 0x00, 0xbd, 0x30, 0x99,
+    0x30, 0x00, 0x00, 0x00, 0x00, 0xbf, 0x30, 0x99,
+    0x30, 0x00, 0x00, 0x00, 0x00, 0xc1, 0x30, 0x99,
+    0x30, 0xc4, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+    0x00, 0xc6, 0x30, 0x99, 0x30, 0x00, 0x00, 0x00,
+    0x00, 0xc8, 0x30, 0x99, 0x30, 0xcf, 0x30, 0x99,
+    0x30, 0xd2, 0x30, 0x99, 0x30, 0xd5, 0x30, 0x99,
+    0x30, 0xd8, 0x30, 0x99, 0x30, 0xdb, 0x30, 0x99,
+    0x30, 0xa6, 0x30, 0x99, 0x30, 0xef, 0x30, 0x99,
+    0x30, 0xfd, 0x30, 0x99, 0x30, 0xb3, 0x30, 0xc8,
+    0x30, 0x00, 0x11, 0x00, 0x01, 0xaa, 0x02, 0xac,
+    0xad, 0x03, 0x04, 0x05, 0xb0, 0xb1, 0xb2, 0xb3,
+    0xb4, 0xb5, 0x1a, 0x06, 0x07, 0x08, 0x21, 0x09,
+    0x11, 0x61, 0x11, 0x14, 0x11, 0x4c, 0x00, 0x01,
+    0xb3, 0xb4, 0xb8, 0xba, 0xbf, 0xc3, 0xc5, 0x08,
+    0xc9, 0xcb, 0x09, 0x0a, 0x0c, 0x0e, 0x0f, 0x13,
+    0x15, 0x17, 0x18, 0x19, 0x1a, 0x1b, 0x1e, 0x22,
+    0x2c, 0x33, 0x38, 0xdd, 0xde, 0x43, 0x44, 0x45,
+    0x70, 0x71, 0x74, 0x7d, 0x7e, 0x80, 0x8a, 0x8d,
+    0x00, 0x4e, 0x8c, 0x4e, 0x09, 0x4e, 0xdb, 0x56,
+    0x0a, 0x4e, 0x2d, 0x4e, 0x0b, 0x4e, 0x32, 0x75,
+    0x59, 0x4e, 0x19, 0x4e, 0x01, 0x4e, 0x29, 0x59,
+    0x30, 0x57, 0xba, 0x4e, 0x28, 0x00, 0x29, 0x00,
+    0x00, 0x11, 0x02, 0x11, 0x03, 0x11, 0x05, 0x11,
+    0x06, 0x11, 0x07, 0x11, 0x09, 0x11, 0x0b, 0x11,
+    0x0c, 0x11, 0x0e, 0x11, 0x0f, 0x11, 0x10, 0x11,
+    0x11, 0x11, 0x12, 0x11, 0x28, 0x00, 0x00, 0x11,
+    0x61, 0x11, 0x29, 0x00, 0x28, 0x00, 0x02, 0x11,
+    0x61, 0x11, 0x29, 0x00, 0x28, 0x00, 0x05, 0x11,
+    0x61, 0x11, 0x29, 0x00, 0x28, 0x00, 0x09, 0x11,
+    0x61, 0x11, 0x29, 0x00, 0x28, 0x00, 0x0b, 0x11,
+    0x61, 0x11, 0x29, 0x00, 0x28, 0x00, 0x0e, 0x11,
+    0x61, 0x11, 0x29, 0x00, 0x28, 0x00, 0x0c, 0x11,
+    0x6e, 0x11, 0x29, 0x00, 0x28, 0x00, 0x0b, 0x11,
+    0x69, 0x11, 0x0c, 0x11, 0x65, 0x11, 0xab, 0x11,
+    0x29, 0x00, 0x28, 0x00, 0x0b, 0x11, 0x69, 0x11,
+    0x12, 0x11, 0x6e, 0x11, 0x29, 0x00, 0x28, 0x00,
+    0x29, 0x00, 0x00, 0x4e, 0x8c, 0x4e, 0x09, 0x4e,
+    0xdb, 0x56, 0x94, 0x4e, 0x6d, 0x51, 0x03, 0x4e,
+    0x6b, 0x51, 0x5d, 0x4e, 0x41, 0x53, 0x08, 0x67,
+    0x6b, 0x70, 0x34, 0x6c, 0x28, 0x67, 0xd1, 0x91,
+    0x1f, 0x57, 0xe5, 0x65, 0x2a, 0x68, 0x09, 0x67,
+    0x3e, 0x79, 0x0d, 0x54, 0x79, 0x72, 0xa1, 0x8c,
+    0x5d, 0x79, 0xb4, 0x52, 0xe3, 0x4e, 0x7c, 0x54,
+    0x66, 0x5b, 0xe3, 0x76, 0x01, 0x4f, 0xc7, 0x8c,
+    0x54, 0x53, 0x6d, 0x79, 0x11, 0x4f, 0xea, 0x81,
+    0xf3, 0x81, 0x4f, 0x55, 0x7c, 0x5e, 0x87, 0x65,
+    0x8f, 0x7b, 0x50, 0x54, 0x45, 0x32, 0x00, 0x31,
+    0x00, 0x33, 0x00, 0x30, 0x00, 0x00, 0x11, 0x00,
+    0x02, 0x03, 0x05, 0x06, 0x07, 0x09, 0x0b, 0x0c,
+    0x0e, 0x0f, 0x10, 0x11, 0x12, 0x00, 0x11, 0x00,
+    0x61, 0x02, 0x61, 0x03, 0x61, 0x05, 0x61, 0x06,
+    0x61, 0x07, 0x61, 0x09, 0x61, 0x0b, 0x61, 0x0c,
+    0x61, 0x0e, 0x11, 0x61, 0x11, 0x00, 0x11, 0x0e,
+    0x61, 0xb7, 0x00, 0x69, 0x0b, 0x11, 0x01, 0x63,
+    0x00, 0x69, 0x0b, 0x11, 0x6e, 0x11, 0x00, 0x4e,
+    0x8c, 0x4e, 0x09, 0x4e, 0xdb, 0x56, 0x94, 0x4e,
+    0x6d, 0x51, 0x03, 0x4e, 0x6b, 0x51, 0x5d, 0x4e,
+    0x41, 0x53, 0x08, 0x67, 0x6b, 0x70, 0x34, 0x6c,
+    0x28, 0x67, 0xd1, 0x91, 0x1f, 0x57, 0xe5, 0x65,
+    0x2a, 0x68, 0x09, 0x67, 0x3e, 0x79, 0x0d, 0x54,
+    0x79, 0x72, 0xa1, 0x8c, 0x5d, 0x79, 0xb4, 0x52,
+    0xd8, 0x79, 0x37, 0x75, 0x73, 0x59, 0x69, 0x90,
+    0x2a, 0x51, 0x70, 0x53, 0xe8, 0x6c, 0x05, 0x98,
+    0x11, 0x4f, 0x99, 0x51, 0x63, 0x6b, 0x0a, 0x4e,
+    0x2d, 0x4e, 0x0b, 0x4e, 0xe6, 0x5d, 0xf3, 0x53,
+    0x3b, 0x53, 0x97, 0x5b, 0x66, 0x5b, 0xe3, 0x76,
+    0x01, 0x4f, 0xc7, 0x8c, 0x54, 0x53, 0x1c, 0x59,
+    0x33, 0x00, 0x36, 0x00, 0x34, 0x00, 0x30, 0x00,
+    0x35, 0x30, 0x31, 0x00, 0x08, 0x67, 0x31, 0x00,
+    0x30, 0x00, 0x08, 0x67, 0x48, 0x67, 0x65, 0x72,
+    0x67, 0x65, 0x56, 0x4c, 0x54, 0x44, 0xa2, 0x30,
+    0x00, 0x02, 0x04, 0x06, 0x08, 0x09, 0x0b, 0x0d,
+    0x0f, 0x11, 0x13, 0x15, 0x17, 0x19, 0x1b, 0x1d,
+    0x1f, 0x22, 0x24, 0x26, 0x28, 0x29, 0x2a, 0x2b,
+    0x2c, 0x2d, 0x30, 0x33, 0x36, 0x39, 0x3c, 0x3d,
+    0x3e, 0x3f, 0x40, 0x42, 0x44, 0x46, 0x47, 0x48,
+    0x49, 0x4a, 0x4b, 0x4d, 0x4e, 0x4f, 0x50, 0xa1,
+    0x30, 0x01, 0x30, 0x5b, 0x27, 0x01, 0x4a, 0x34,
+    0x00, 0x01, 0x52, 0x39, 0x01, 0xa2, 0x30, 0x00,
+    0x5a, 0x49, 0xa4, 0x30, 0x00, 0x27, 0x4f, 0x0c,
+    0xa4, 0x30, 0x00, 0x4f, 0x1d, 0x02, 0x05, 0x4f,
+    0xa8, 0x30, 0x00, 0x11, 0x07, 0x54, 0x21, 0xa8,
+    0x30, 0x00, 0x54, 0x03, 0x54, 0xa4, 0x30, 0x06,
+    0x4f, 0x15, 0x06, 0x58, 0x3c, 0x07, 0x00, 0x46,
+    0xab, 0x30, 0x00, 0x3e, 0x18, 0x1d, 0x00, 0x42,
+    0x3f, 0x51, 0xac, 0x30, 0x00, 0x41, 0x47, 0x00,
+    0x47, 0x32, 0xae, 0x30, 0xac, 0x30, 0xae, 0x30,
+    0x00, 0x1d, 0x4e, 0xad, 0x30, 0x00, 0x38, 0x3d,
+    0x4f, 0x01, 0x3e, 0x13, 0x4f, 0xad, 0x30, 0xed,
+    0x30, 0xad, 0x30, 0x00, 0x40, 0x03, 0x3c, 0x33,
+    0xad, 0x30, 0x00, 0x40, 0x34, 0x4f, 0x1b, 0x3e,
+    0xad, 0x30, 0x00, 0x40, 0x42, 0x16, 0x1b, 0xb0,
+    0x30, 0x00, 0x39, 0x30, 0xa4, 0x30, 0x0c, 0x45,
+    0x3c, 0x24, 0x4f, 0x0b, 0x47, 0x18, 0x00, 0x49,
+    0xaf, 0x30, 0x00, 0x3e, 0x4d, 0x1e, 0xb1, 0x30,
+    0x00, 0x4b, 0x08, 0x02, 0x3a, 0x19, 0x02, 0x4b,
+    0x2c, 0xa4, 0x30, 0x11, 0x00, 0x0b, 0x47, 0xb5,
+    0x30, 0x00, 0x3e, 0x0c, 0x47, 0x2b, 0xb0, 0x30,
+    0x07, 0x3a, 0x43, 0x00, 0xb9, 0x30, 0x02, 0x3a,
+    0x08, 0x02, 0x3a, 0x0f, 0x07, 0x43, 0x00, 0xb7,
+    0x30, 0x10, 0x00, 0x12, 0x34, 0x11, 0x3c, 0x13,
+    0x17, 0xa4, 0x30, 0x2a, 0x1f, 0x24, 0x2b, 0x00,
+    0x20, 0xbb, 0x30, 0x16, 0x41, 0x00, 0x38, 0x0d,
+    0xc4, 0x30, 0x0d, 0x38, 0x00, 0xd0, 0x30, 0x00,
+    0x2c, 0x1c, 0x1b, 0xa2, 0x30, 0x32, 0x00, 0x17,
+    0x26, 0x49, 0xaf, 0x30, 0x25, 0x00, 0x3c, 0xb3,
+    0x30, 0x21, 0x00, 0x20, 0x38, 0xa1, 0x30, 0x34,
+    0x00, 0x48, 0x22, 0x28, 0xa3, 0x30, 0x32, 0x00,
+    0x59, 0x25, 0xa7, 0x30, 0x2f, 0x1c, 0x10, 0x00,
+    0x44, 0xd5, 0x30, 0x00, 0x14, 0x1e, 0xaf, 0x30,
+    0x29, 0x00, 0x10, 0x4d, 0x3c, 0xda, 0x30, 0xbd,
+    0x30, 0xb8, 0x30, 0x22, 0x13, 0x1a, 0x20, 0x33,
+    0x0c, 0x22, 0x3b, 0x01, 0x22, 0x44, 0x00, 0x21,
+    0x44, 0x07, 0xa4, 0x30, 0x39, 0x00, 0x4f, 0x24,
+    0xc8, 0x30, 0x14, 0x23, 0x00, 0xdb, 0x30, 0xf3,
+    0x30, 0xc9, 0x30, 0x14, 0x2a, 0x00, 0x12, 0x33,
+    0x22, 0x12, 0x33, 0x2a, 0xa4, 0x30, 0x3a, 0x00,
+    0x0b, 0x49, 0xa4, 0x30, 0x3a, 0x00, 0x47, 0x3a,
+    0x1f, 0x2b, 0x3a, 0x47, 0x0b, 0xb7, 0x30, 0x27,
+    0x3c, 0x00, 0x30, 0x3c, 0xaf, 0x30, 0x30, 0x00,
+    0x3e, 0x44, 0xdf, 0x30, 0xea, 0x30, 0xd0, 0x30,
+    0x0f, 0x1a, 0x00, 0x2c, 0x1b, 0xe1, 0x30, 0xac,
+    0x30, 0xac, 0x30, 0x35, 0x00, 0x1c, 0x47, 0x35,
+    0x50, 0x1c, 0x3f, 0xa2, 0x30, 0x42, 0x5a, 0x27,
+    0x42, 0x5a, 0x49, 0x44, 0x00, 0x51, 0xc3, 0x30,
+    0x27, 0x00, 0x05, 0x28, 0xea, 0x30, 0xe9, 0x30,
+    0xd4, 0x30, 0x17, 0x00, 0x28, 0xd6, 0x30, 0x15,
+    0x26, 0x00, 0x15, 0xec, 0x30, 0xe0, 0x30, 0xb2,
+    0x30, 0x3a, 0x41, 0x16, 0x00, 0x41, 0xc3, 0x30,
+    0x2c, 0x00, 0x05, 0x30, 0x00, 0xb9, 0x70, 0x31,
+    0x00, 0x30, 0x00, 0xb9, 0x70, 0x32, 0x00, 0x30,
+    0x00, 0xb9, 0x70, 0x68, 0x50, 0x61, 0x64, 0x61,
+    0x41, 0x55, 0x62, 0x61, 0x72, 0x6f, 0x56, 0x70,
+    0x63, 0x64, 0x6d, 0x64, 0x00, 0x6d, 0x00, 0xb2,
+    0x00, 0x49, 0x00, 0x55, 0x00, 0x73, 0x5e, 0x10,
+    0x62, 0x2d, 0x66, 0x8c, 0x54, 0x27, 0x59, 0x63,
+    0x6b, 0x0e, 0x66, 0xbb, 0x6c, 0x2a, 0x68, 0x0f,
+    0x5f, 0x1a, 0x4f, 0x3e, 0x79, 0x70, 0x00, 0x41,
+    0x6e, 0x00, 0x41, 0xbc, 0x03, 0x41, 0x6d, 0x00,
+    0x41, 0x6b, 0x00, 0x41, 0x4b, 0x00, 0x42, 0x4d,
+    0x00, 0x42, 0x47, 0x00, 0x42, 0x63, 0x61, 0x6c,
+    0x6b, 0x63, 0x61, 0x6c, 0x70, 0x00, 0x46, 0x6e,
+    0x00, 0x46, 0xbc, 0x03, 0x46, 0xbc, 0x03, 0x67,
+    0x6d, 0x00, 0x67, 0x6b, 0x00, 0x67, 0x48, 0x00,
+    0x7a, 0x6b, 0x48, 0x7a, 0x4d, 0x48, 0x7a, 0x47,
+    0x48, 0x7a, 0x54, 0x48, 0x7a, 0xbc, 0x03, 0x13,
+    0x21, 0x6d, 0x00, 0x13, 0x21, 0x64, 0x00, 0x13,
+    0x21, 0x6b, 0x00, 0x13, 0x21, 0x66, 0x00, 0x6d,
+    0x6e, 0x00, 0x6d, 0xbc, 0x03, 0x6d, 0x6d, 0x00,
+    0x6d, 0x63, 0x00, 0x6d, 0x6b, 0x00, 0x6d, 0x63,
+    0x00, 0x0a, 0x0a, 0x4f, 0x00, 0x0a, 0x4f, 0x6d,
+    0x00, 0xb2, 0x00, 0x63, 0x00, 0x08, 0x0a, 0x4f,
+    0x0a, 0x0a, 0x50, 0x00, 0x0a, 0x50, 0x6d, 0x00,
+    0xb3, 0x00, 0x6b, 0x00, 0x6d, 0x00, 0xb3, 0x00,
+    0x6d, 0x00, 0x15, 0x22, 0x73, 0x00, 0x6d, 0x00,
+    0x15, 0x22, 0x73, 0x00, 0xb2, 0x00, 0x50, 0x61,
+    0x6b, 0x50, 0x61, 0x4d, 0x50, 0x61, 0x47, 0x50,
+    0x61, 0x72, 0x61, 0x64, 0x72, 0x61, 0x64, 0xd1,
+    0x73, 0x72, 0x00, 0x61, 0x00, 0x64, 0x00, 0x15,
+    0x22, 0x73, 0x00, 0xb2, 0x00, 0x70, 0x00, 0x73,
+    0x6e, 0x00, 0x73, 0xbc, 0x03, 0x73, 0x6d, 0x00,
+    0x73, 0x70, 0x00, 0x56, 0x6e, 0x00, 0x56, 0xbc,
+    0x03, 0x56, 0x6d, 0x00, 0x56, 0x6b, 0x00, 0x56,
+    0x4d, 0x00, 0x56, 0x70, 0x00, 0x57, 0x6e, 0x00,
+    0x57, 0xbc, 0x03, 0x57, 0x6d, 0x00, 0x57, 0x6b,
+    0x00, 0x57, 0x4d, 0x00, 0x57, 0x6b, 0x00, 0xa9,
+    0x03, 0x4d, 0x00, 0xa9, 0x03, 0x61, 0x2e, 0x6d,
+    0x2e, 0x42, 0x71, 0x63, 0x63, 0x63, 0x64, 0x43,
+    0xd1, 0x6b, 0x67, 0x43, 0x6f, 0x2e, 0x64, 0x42,
+    0x47, 0x79, 0x68, 0x61, 0x48, 0x50, 0x69, 0x6e,
+    0x4b, 0x4b, 0x4b, 0x4d, 0x6b, 0x74, 0x6c, 0x6d,
+    0x6c, 0x6e, 0x6c, 0x6f, 0x67, 0x6c, 0x78, 0x6d,
+    0x62, 0x6d, 0x69, 0x6c, 0x6d, 0x6f, 0x6c, 0x50,
+    0x48, 0x70, 0x2e, 0x6d, 0x2e, 0x50, 0x50, 0x4d,
+    0x50, 0x52, 0x73, 0x72, 0x53, 0x76, 0x57, 0x62,
+    0x56, 0xd1, 0x6d, 0x41, 0xd1, 0x6d, 0x31, 0x00,
+    0xe5, 0x65, 0x31, 0x00, 0x30, 0x00, 0xe5, 0x65,
+    0x32, 0x00, 0x30, 0x00, 0xe5, 0x65, 0x33, 0x00,
+    0x30, 0x00, 0xe5, 0x65, 0x67, 0x61, 0x6c, 0x4a,
+    0x04, 0x4c, 0x04, 0x26, 0x01, 0x53, 0x01, 0x27,
+    0xa7, 0x37, 0xab, 0x6b, 0x02, 0x52, 0xab, 0x48,
+    0x8c, 0xf4, 0x66, 0xca, 0x8e, 0xc8, 0x8c, 0xd1,
+    0x6e, 0x32, 0x4e, 0xe5, 0x53, 0x9c, 0x9f, 0x9c,
+    0x9f, 0x51, 0x59, 0xd1, 0x91, 0x87, 0x55, 0x48,
+    0x59, 0xf6, 0x61, 0x69, 0x76, 0x85, 0x7f, 0x3f,
+    0x86, 0xba, 0x87, 0xf8, 0x88, 0x8f, 0x90, 0x02,
+    0x6a, 0x1b, 0x6d, 0xd9, 0x70, 0xde, 0x73, 0x3d,
+    0x84, 0x6a, 0x91, 0xf1, 0x99, 0x82, 0x4e, 0x75,
+    0x53, 0x04, 0x6b, 0x1b, 0x72, 0x2d, 0x86, 0x1e,
+    0x9e, 0x50, 0x5d, 0xeb, 0x6f, 0xcd, 0x85, 0x64,
+    0x89, 0xc9, 0x62, 0xd8, 0x81, 0x1f, 0x88, 0xca,
+    0x5e, 0x17, 0x67, 0x6a, 0x6d, 0xfc, 0x72, 0xce,
+    0x90, 0x86, 0x4f, 0xb7, 0x51, 0xde, 0x52, 0xc4,
+    0x64, 0xd3, 0x6a, 0x10, 0x72, 0xe7, 0x76, 0x01,
+    0x80, 0x06, 0x86, 0x5c, 0x86, 0xef, 0x8d, 0x32,
+    0x97, 0x6f, 0x9b, 0xfa, 0x9d, 0x8c, 0x78, 0x7f,
+    0x79, 0xa0, 0x7d, 0xc9, 0x83, 0x04, 0x93, 0x7f,
+    0x9e, 0xd6, 0x8a, 0xdf, 0x58, 0x04, 0x5f, 0x60,
+    0x7c, 0x7e, 0x80, 0x62, 0x72, 0xca, 0x78, 0xc2,
+    0x8c, 0xf7, 0x96, 0xd8, 0x58, 0x62, 0x5c, 0x13,
+    0x6a, 0xda, 0x6d, 0x0f, 0x6f, 0x2f, 0x7d, 0x37,
+    0x7e, 0x4b, 0x96, 0xd2, 0x52, 0x8b, 0x80, 0xdc,
+    0x51, 0xcc, 0x51, 0x1c, 0x7a, 0xbe, 0x7d, 0xf1,
+    0x83, 0x75, 0x96, 0x80, 0x8b, 0xcf, 0x62, 0x02,
+    0x6a, 0xfe, 0x8a, 0x39, 0x4e, 0xe7, 0x5b, 0x12,
+    0x60, 0x87, 0x73, 0x70, 0x75, 0x17, 0x53, 0xfb,
+    0x78, 0xbf, 0x4f, 0xa9, 0x5f, 0x0d, 0x4e, 0xcc,
+    0x6c, 0x78, 0x65, 0x22, 0x7d, 0xc3, 0x53, 0x5e,
+    0x58, 0x01, 0x77, 0x49, 0x84, 0xaa, 0x8a, 0xba,
+    0x6b, 0xb0, 0x8f, 0x88, 0x6c, 0xfe, 0x62, 0xe5,
+    0x82, 0xa0, 0x63, 0x65, 0x75, 0xae, 0x4e, 0x69,
+    0x51, 0xc9, 0x51, 0x81, 0x68, 0xe7, 0x7c, 0x6f,
+    0x82, 0xd2, 0x8a, 0xcf, 0x91, 0xf5, 0x52, 0x42,
+    0x54, 0x73, 0x59, 0xec, 0x5e, 0xc5, 0x65, 0xfe,
+    0x6f, 0x2a, 0x79, 0xad, 0x95, 0x6a, 0x9a, 0x97,
+    0x9e, 0xce, 0x9e, 0x9b, 0x52, 0xc6, 0x66, 0x77,
+    0x6b, 0x62, 0x8f, 0x74, 0x5e, 0x90, 0x61, 0x00,
+    0x62, 0x9a, 0x64, 0x23, 0x6f, 0x49, 0x71, 0x89,
+    0x74, 0xca, 0x79, 0xf4, 0x7d, 0x6f, 0x80, 0x26,
+    0x8f, 0xee, 0x84, 0x23, 0x90, 0x4a, 0x93, 0x17,
+    0x52, 0xa3, 0x52, 0xbd, 0x54, 0xc8, 0x70, 0xc2,
+    0x88, 0xaa, 0x8a, 0xc9, 0x5e, 0xf5, 0x5f, 0x7b,
+    0x63, 0xae, 0x6b, 0x3e, 0x7c, 0x75, 0x73, 0xe4,
+    0x4e, 0xf9, 0x56, 0xe7, 0x5b, 0xba, 0x5d, 0x1c,
+    0x60, 0xb2, 0x73, 0x69, 0x74, 0x9a, 0x7f, 0x46,
+    0x80, 0x34, 0x92, 0xf6, 0x96, 0x48, 0x97, 0x18,
+    0x98, 0x8b, 0x4f, 0xae, 0x79, 0xb4, 0x91, 0xb8,
+    0x96, 0xe1, 0x60, 0x86, 0x4e, 0xda, 0x50, 0xee,
+    0x5b, 0x3f, 0x5c, 0x99, 0x65, 0x02, 0x6a, 0xce,
+    0x71, 0x42, 0x76, 0xfc, 0x84, 0x7c, 0x90, 0x8d,
+    0x9f, 0x88, 0x66, 0x2e, 0x96, 0x89, 0x52, 0x7b,
+    0x67, 0xf3, 0x67, 0x41, 0x6d, 0x9c, 0x6e, 0x09,
+    0x74, 0x59, 0x75, 0x6b, 0x78, 0x10, 0x7d, 0x5e,
+    0x98, 0x6d, 0x51, 0x2e, 0x62, 0x78, 0x96, 0x2b,
+    0x50, 0x19, 0x5d, 0xea, 0x6d, 0x2a, 0x8f, 0x8b,
+    0x5f, 0x44, 0x61, 0x17, 0x68, 0x87, 0x73, 0x86,
+    0x96, 0x29, 0x52, 0x0f, 0x54, 0x65, 0x5c, 0x13,
+    0x66, 0x4e, 0x67, 0xa8, 0x68, 0xe5, 0x6c, 0x06,
+    0x74, 0xe2, 0x75, 0x79, 0x7f, 0xcf, 0x88, 0xe1,
+    0x88, 0xcc, 0x91, 0xe2, 0x96, 0x3f, 0x53, 0xba,
+    0x6e, 0x1d, 0x54, 0xd0, 0x71, 0x98, 0x74, 0xfa,
+    0x85, 0xa3, 0x96, 0x57, 0x9c, 0x9f, 0x9e, 0x97,
+    0x67, 0xcb, 0x6d, 0xe8, 0x81, 0xcb, 0x7a, 0x20,
+    0x7b, 0x92, 0x7c, 0xc0, 0x72, 0x99, 0x70, 0x58,
+    0x8b, 0xc0, 0x4e, 0x36, 0x83, 0x3a, 0x52, 0x07,
+    0x52, 0xa6, 0x5e, 0xd3, 0x62, 0xd6, 0x7c, 0x85,
+    0x5b, 0x1e, 0x6d, 0xb4, 0x66, 0x3b, 0x8f, 0x4c,
+    0x88, 0x4d, 0x96, 0x8b, 0x89, 0xd3, 0x5e, 0x40,
+    0x51, 0xc0, 0x55, 0x00, 0x00, 0x00, 0x00, 0x5a,
+    0x58, 0x00, 0x00, 0x74, 0x66, 0x00, 0x00, 0x00,
+    0x00, 0xde, 0x51, 0x2a, 0x73, 0xca, 0x76, 0x3c,
+    0x79, 0x5e, 0x79, 0x65, 0x79, 0x8f, 0x79, 0x56,
+    0x97, 0xbe, 0x7c, 0xbd, 0x7f, 0x00, 0x00, 0x12,
+    0x86, 0x00, 0x00, 0xf8, 0x8a, 0x00, 0x00, 0x00,
+    0x00, 0x38, 0x90, 0xfd, 0x90, 0xef, 0x98, 0xfc,
+    0x98, 0x28, 0x99, 0xb4, 0x9d, 0xde, 0x90, 0xb7,
+    0x96, 0xae, 0x4f, 0xe7, 0x50, 0x4d, 0x51, 0xc9,
+    0x52, 0xe4, 0x52, 0x51, 0x53, 0x9d, 0x55, 0x06,
+    0x56, 0x68, 0x56, 0x40, 0x58, 0xa8, 0x58, 0x64,
+    0x5c, 0x6e, 0x5c, 0x94, 0x60, 0x68, 0x61, 0x8e,
+    0x61, 0xf2, 0x61, 0x4f, 0x65, 0xe2, 0x65, 0x91,
+    0x66, 0x85, 0x68, 0x77, 0x6d, 0x1a, 0x6e, 0x22,
+    0x6f, 0x6e, 0x71, 0x2b, 0x72, 0x22, 0x74, 0x91,
+    0x78, 0x3e, 0x79, 0x49, 0x79, 0x48, 0x79, 0x50,
+    0x79, 0x56, 0x79, 0x5d, 0x79, 0x8d, 0x79, 0x8e,
+    0x79, 0x40, 0x7a, 0x81, 0x7a, 0xc0, 0x7b, 0xf4,
+    0x7d, 0x09, 0x7e, 0x41, 0x7e, 0x72, 0x7f, 0x05,
+    0x80, 0xed, 0x81, 0x79, 0x82, 0x79, 0x82, 0x57,
+    0x84, 0x10, 0x89, 0x96, 0x89, 0x01, 0x8b, 0x39,
+    0x8b, 0xd3, 0x8c, 0x08, 0x8d, 0xb6, 0x8f, 0x38,
+    0x90, 0xe3, 0x96, 0xff, 0x97, 0x3b, 0x98, 0x75,
+    0x60, 0xee, 0x42, 0x18, 0x82, 0x02, 0x26, 0x4e,
+    0xb5, 0x51, 0x68, 0x51, 0x80, 0x4f, 0x45, 0x51,
+    0x80, 0x51, 0xc7, 0x52, 0xfa, 0x52, 0x9d, 0x55,
+    0x55, 0x55, 0x99, 0x55, 0xe2, 0x55, 0x5a, 0x58,
+    0xb3, 0x58, 0x44, 0x59, 0x54, 0x59, 0x62, 0x5a,
+    0x28, 0x5b, 0xd2, 0x5e, 0xd9, 0x5e, 0x69, 0x5f,
+    0xad, 0x5f, 0xd8, 0x60, 0x4e, 0x61, 0x08, 0x61,
+    0x8e, 0x61, 0x60, 0x61, 0xf2, 0x61, 0x34, 0x62,
+    0xc4, 0x63, 0x1c, 0x64, 0x52, 0x64, 0x56, 0x65,
+    0x74, 0x66, 0x17, 0x67, 0x1b, 0x67, 0x56, 0x67,
+    0x79, 0x6b, 0xba, 0x6b, 0x41, 0x6d, 0xdb, 0x6e,
+    0xcb, 0x6e, 0x22, 0x6f, 0x1e, 0x70, 0x6e, 0x71,
+    0xa7, 0x77, 0x35, 0x72, 0xaf, 0x72, 0x2a, 0x73,
+    0x71, 0x74, 0x06, 0x75, 0x3b, 0x75, 0x1d, 0x76,
+    0x1f, 0x76, 0xca, 0x76, 0xdb, 0x76, 0xf4, 0x76,
+    0x4a, 0x77, 0x40, 0x77, 0xcc, 0x78, 0xb1, 0x7a,
+    0xc0, 0x7b, 0x7b, 0x7c, 0x5b, 0x7d, 0xf4, 0x7d,
+    0x3e, 0x7f, 0x05, 0x80, 0x52, 0x83, 0xef, 0x83,
+    0x79, 0x87, 0x41, 0x89, 0x86, 0x89, 0x96, 0x89,
+    0xbf, 0x8a, 0xf8, 0x8a, 0xcb, 0x8a, 0x01, 0x8b,
+    0xfe, 0x8a, 0xed, 0x8a, 0x39, 0x8b, 0x8a, 0x8b,
+    0x08, 0x8d, 0x38, 0x8f, 0x72, 0x90, 0x99, 0x91,
+    0x76, 0x92, 0x7c, 0x96, 0xe3, 0x96, 0x56, 0x97,
+    0xdb, 0x97, 0xff, 0x97, 0x0b, 0x98, 0x3b, 0x98,
+    0x12, 0x9b, 0x9c, 0x9f, 0x4a, 0x28, 0x44, 0x28,
+    0xd5, 0x33, 0x9d, 0x3b, 0x18, 0x40, 0x39, 0x40,
+    0x49, 0x52, 0xd0, 0x5c, 0xd3, 0x7e, 0x43, 0x9f,
+    0x8e, 0x9f, 0x2a, 0xa0, 0x02, 0x66, 0x66, 0x66,
+    0x69, 0x66, 0x6c, 0x66, 0x66, 0x69, 0x66, 0x66,
+    0x6c, 0x7f, 0x01, 0x74, 0x73, 0x00, 0x74, 0x65,
+    0x05, 0x0f, 0x11, 0x0f, 0x00, 0x0f, 0x06, 0x19,
+    0x11, 0x0f, 0x08, 0xd9, 0x05, 0xb4, 0x05, 0x00,
+    0x00, 0x00, 0x00, 0xf2, 0x05, 0xb7, 0x05, 0xd0,
+    0x05, 0x12, 0x00, 0x03, 0x04, 0x0b, 0x0c, 0x0d,
+    0x18, 0x1a, 0xe9, 0x05, 0xc1, 0x05, 0xe9, 0x05,
+    0xc2, 0x05, 0x49, 0xfb, 0xc1, 0x05, 0x49, 0xfb,
+    0xc2, 0x05, 0xd0, 0x05, 0xb7, 0x05, 0xd0, 0x05,
+    0xb8, 0x05, 0xd0, 0x05, 0xbc, 0x05, 0xd8, 0x05,
+    0xbc, 0x05, 0xde, 0x05, 0xbc, 0x05, 0xe0, 0x05,
+    0xbc, 0x05, 0xe3, 0x05, 0xbc, 0x05, 0xb9, 0x05,
+    0x2d, 0x03, 0x2e, 0x03, 0x2f, 0x03, 0x30, 0x03,
+    0x31, 0x03, 0x1c, 0x00, 0x18, 0x06, 0x22, 0x06,
+    0x2b, 0x06, 0xd0, 0x05, 0xdc, 0x05, 0x71, 0x06,
+    0x00, 0x00, 0x0a, 0x0a, 0x0a, 0x0a, 0x0d, 0x0d,
+    0x0d, 0x0d, 0x0f, 0x0f, 0x0f, 0x0f, 0x09, 0x09,
+    0x09, 0x09, 0x0e, 0x0e, 0x0e, 0x0e, 0x08, 0x08,
+    0x08, 0x08, 0x33, 0x33, 0x33, 0x33, 0x35, 0x35,
+    0x35, 0x35, 0x13, 0x13, 0x13, 0x13, 0x12, 0x12,
+    0x12, 0x12, 0x15, 0x15, 0x15, 0x15, 0x16, 0x16,
+    0x16, 0x16, 0x1c, 0x1c, 0x1b, 0x1b, 0x1d, 0x1d,
+    0x17, 0x17, 0x27, 0x27, 0x20, 0x20, 0x38, 0x38,
+    0x38, 0x38, 0x3e, 0x3e, 0x3e, 0x3e, 0x42, 0x42,
+    0x42, 0x42, 0x40, 0x40, 0x40, 0x40, 0x49, 0x49,
+    0x4a, 0x4a, 0x4a, 0x4a, 0x4f, 0x4f, 0x50, 0x50,
+    0x50, 0x50, 0x4d, 0x4d, 0x4d, 0x4d, 0x61, 0x61,
+    0x62, 0x62, 0x49, 0x06, 0x64, 0x64, 0x64, 0x64,
+    0x7e, 0x7e, 0x7d, 0x7d, 0x7f, 0x7f, 0x2e, 0x82,
+    0x82, 0x7c, 0x7c, 0x80, 0x80, 0x87, 0x87, 0x87,
+    0x87, 0x00, 0x00, 0x26, 0x06, 0x00, 0x01, 0x00,
+    0x01, 0x00, 0xaf, 0x00, 0xaf, 0x00, 0x22, 0x00,
+    0x22, 0x00, 0xa1, 0x00, 0xa1, 0x00, 0xa0, 0x00,
+    0xa0, 0x00, 0xa2, 0x00, 0xa2, 0x00, 0xaa, 0x00,
+    0xaa, 0x00, 0xaa, 0x00, 0x23, 0x00, 0x23, 0x00,
+    0x23, 0xcc, 0x06, 0x00, 0x00, 0x00, 0x00, 0x26,
+    0x06, 0x00, 0x06, 0x00, 0x07, 0x00, 0x1f, 0x00,
+    0x23, 0x00, 0x24, 0x02, 0x06, 0x02, 0x07, 0x02,
+    0x08, 0x02, 0x1f, 0x02, 0x23, 0x02, 0x24, 0x04,
+    0x06, 0x04, 0x07, 0x04, 0x08, 0x04, 0x1f, 0x04,
+    0x23, 0x04, 0x24, 0x05, 0x06, 0x05, 0x1f, 0x05,
+    0x23, 0x05, 0x24, 0x06, 0x07, 0x06, 0x1f, 0x07,
+    0x06, 0x07, 0x1f, 0x08, 0x06, 0x08, 0x07, 0x08,
+    0x1f, 0x0d, 0x06, 0x0d, 0x07, 0x0d, 0x08, 0x0d,
+    0x1f, 0x0f, 0x07, 0x0f, 0x1f, 0x10, 0x06, 0x10,
+    0x07, 0x10, 0x08, 0x10, 0x1f, 0x11, 0x07, 0x11,
+    0x1f, 0x12, 0x1f, 0x13, 0x06, 0x13, 0x1f, 0x14,
+    0x06, 0x14, 0x1f, 0x1b, 0x06, 0x1b, 0x07, 0x1b,
+    0x08, 0x1b, 0x1f, 0x1b, 0x23, 0x1b, 0x24, 0x1c,
+    0x07, 0x1c, 0x1f, 0x1c, 0x23, 0x1c, 0x24, 0x1d,
+    0x01, 0x1d, 0x06, 0x1d, 0x07, 0x1d, 0x08, 0x1d,
+    0x1e, 0x1d, 0x1f, 0x1d, 0x23, 0x1d, 0x24, 0x1e,
+    0x06, 0x1e, 0x07, 0x1e, 0x08, 0x1e, 0x1f, 0x1e,
+    0x23, 0x1e, 0x24, 0x1f, 0x06, 0x1f, 0x07, 0x1f,
+    0x08, 0x1f, 0x1f, 0x1f, 0x23, 0x1f, 0x24, 0x20,
+    0x06, 0x20, 0x07, 0x20, 0x08, 0x20, 0x1f, 0x20,
+    0x23, 0x20, 0x24, 0x21, 0x06, 0x21, 0x1f, 0x21,
+    0x23, 0x21, 0x24, 0x24, 0x06, 0x24, 0x07, 0x24,
+    0x08, 0x24, 0x1f, 0x24, 0x23, 0x24, 0x24, 0x0a,
+    0x4a, 0x0b, 0x4a, 0x23, 0x4a, 0x20, 0x00, 0x4c,
+    0x06, 0x51, 0x06, 0x51, 0x06, 0xff, 0x00, 0x1f,
+    0x26, 0x06, 0x00, 0x0b, 0x00, 0x0c, 0x00, 0x1f,
+    0x00, 0x20, 0x00, 0x23, 0x00, 0x24, 0x02, 0x0b,
+    0x02, 0x0c, 0x02, 0x1f, 0x02, 0x20, 0x02, 0x23,
+    0x02, 0x24, 0x04, 0x0b, 0x04, 0x0c, 0x04, 0x1f,
+    0x26, 0x06, 0x04, 0x20, 0x04, 0x23, 0x04, 0x24,
+    0x05, 0x0b, 0x05, 0x0c, 0x05, 0x1f, 0x05, 0x20,
+    0x05, 0x23, 0x05, 0x24, 0x1b, 0x23, 0x1b, 0x24,
+    0x1c, 0x23, 0x1c, 0x24, 0x1d, 0x01, 0x1d, 0x1e,
+    0x1d, 0x1f, 0x1d, 0x23, 0x1d, 0x24, 0x1e, 0x1f,
+    0x1e, 0x23, 0x1e, 0x24, 0x1f, 0x01, 0x1f, 0x1f,
+    0x20, 0x0b, 0x20, 0x0c, 0x20, 0x1f, 0x20, 0x20,
+    0x20, 0x23, 0x20, 0x24, 0x23, 0x4a, 0x24, 0x0b,
+    0x24, 0x0c, 0x24, 0x1f, 0x24, 0x20, 0x24, 0x23,
+    0x24, 0x24, 0x00, 0x06, 0x00, 0x07, 0x00, 0x08,
+    0x00, 0x1f, 0x00, 0x21, 0x02, 0x06, 0x02, 0x07,
+    0x02, 0x08, 0x02, 0x1f, 0x02, 0x21, 0x04, 0x06,
+    0x04, 0x07, 0x04, 0x08, 0x04, 0x1f, 0x04, 0x21,
+    0x05, 0x1f, 0x06, 0x07, 0x06, 0x1f, 0x07, 0x06,
+    0x07, 0x1f, 0x08, 0x06, 0x08, 0x1f, 0x0d, 0x06,
+    0x0d, 0x07, 0x0d, 0x08, 0x0d, 0x1f, 0x0f, 0x07,
+    0x0f, 0x08, 0x0f, 0x1f, 0x10, 0x06, 0x10, 0x07,
+    0x10, 0x08, 0x10, 0x1f, 0x11, 0x07, 0x12, 0x1f,
+    0x13, 0x06, 0x13, 0x1f, 0x14, 0x06, 0x14, 0x1f,
+    0x1b, 0x06, 0x1b, 0x07, 0x1b, 0x08, 0x1b, 0x1f,
+    0x1c, 0x07, 0x1c, 0x1f, 0x1d, 0x06, 0x1d, 0x07,
+    0x1d, 0x08, 0x1d, 0x1e, 0x1d, 0x1f, 0x1e, 0x06,
+    0x1e, 0x07, 0x1e, 0x08, 0x1e, 0x1f, 0x1e, 0x21,
+    0x1f, 0x06, 0x1f, 0x07, 0x1f, 0x08, 0x1f, 0x1f,
+    0x20, 0x06, 0x20, 0x07, 0x20, 0x08, 0x20, 0x1f,
+    0x20, 0x21, 0x21, 0x06, 0x21, 0x1f, 0x21, 0x4a,
+    0x24, 0x06, 0x24, 0x07, 0x24, 0x08, 0x24, 0x1f,
+    0x24, 0x21, 0x00, 0x1f, 0x00, 0x21, 0x02, 0x1f,
+    0x02, 0x21, 0x04, 0x1f, 0x04, 0x21, 0x05, 0x1f,
+    0x05, 0x21, 0x0d, 0x1f, 0x0d, 0x21, 0x0e, 0x1f,
+    0x0e, 0x21, 0x1d, 0x1e, 0x1d, 0x1f, 0x1e, 0x1f,
+    0x20, 0x1f, 0x20, 0x21, 0x24, 0x1f, 0x24, 0x21,
+    0x40, 0x06, 0x4e, 0x06, 0x51, 0x06, 0x27, 0x06,
+    0x10, 0x22, 0x10, 0x23, 0x12, 0x22, 0x12, 0x23,
+    0x13, 0x22, 0x13, 0x23, 0x0c, 0x22, 0x0c, 0x23,
+    0x0d, 0x22, 0x0d, 0x23, 0x06, 0x22, 0x06, 0x23,
+    0x05, 0x22, 0x05, 0x23, 0x07, 0x22, 0x07, 0x23,
+    0x0e, 0x22, 0x0e, 0x23, 0x0f, 0x22, 0x0f, 0x23,
+    0x0d, 0x05, 0x0d, 0x06, 0x0d, 0x07, 0x0d, 0x1e,
+    0x0d, 0x0a, 0x0c, 0x0a, 0x0e, 0x0a, 0x0f, 0x0a,
+    0x10, 0x22, 0x10, 0x23, 0x12, 0x22, 0x12, 0x23,
+    0x13, 0x22, 0x13, 0x23, 0x0c, 0x22, 0x0c, 0x23,
+    0x0d, 0x22, 0x0d, 0x23, 0x06, 0x22, 0x06, 0x23,
+    0x05, 0x22, 0x05, 0x23, 0x07, 0x22, 0x07, 0x23,
+    0x0e, 0x22, 0x0e, 0x23, 0x0f, 0x22, 0x0f, 0x23,
+    0x0d, 0x05, 0x0d, 0x06, 0x0d, 0x07, 0x0d, 0x1e,
+    0x0d, 0x0a, 0x0c, 0x0a, 0x0e, 0x0a, 0x0f, 0x0a,
+    0x0d, 0x05, 0x0d, 0x06, 0x0d, 0x07, 0x0d, 0x1e,
+    0x0c, 0x20, 0x0d, 0x20, 0x10, 0x1e, 0x0c, 0x05,
+    0x0c, 0x06, 0x0c, 0x07, 0x0d, 0x05, 0x0d, 0x06,
+    0x0d, 0x07, 0x10, 0x1e, 0x11, 0x1e, 0x00, 0x24,
+    0x00, 0x24, 0x2a, 0x06, 0x00, 0x02, 0x1b, 0x00,
+    0x03, 0x02, 0x00, 0x03, 0x02, 0x00, 0x03, 0x1b,
+    0x00, 0x04, 0x1b, 0x00, 0x1b, 0x02, 0x00, 0x1b,
+    0x03, 0x00, 0x1b, 0x04, 0x02, 0x1b, 0x03, 0x02,
+    0x1b, 0x03, 0x03, 0x1b, 0x20, 0x03, 0x1b, 0x1f,
+    0x09, 0x03, 0x02, 0x09, 0x02, 0x03, 0x09, 0x02,
+    0x1f, 0x09, 0x1b, 0x03, 0x09, 0x1b, 0x03, 0x09,
+    0x1b, 0x02, 0x09, 0x1b, 0x1b, 0x09, 0x1b, 0x1b,
+    0x0b, 0x03, 0x03, 0x0b, 0x03, 0x03, 0x0b, 0x1b,
+    0x1b, 0x0a, 0x03, 0x1b, 0x0a, 0x03, 0x1b, 0x0a,
+    0x02, 0x20, 0x0a, 0x1b, 0x04, 0x0a, 0x1b, 0x04,
+    0x0a, 0x1b, 0x1b, 0x0a, 0x1b, 0x1b, 0x0c, 0x03,
+    0x1f, 0x0c, 0x04, 0x1b, 0x0c, 0x04, 0x1b, 0x0d,
+    0x1b, 0x03, 0x0d, 0x1b, 0x03, 0x0d, 0x1b, 0x1b,
+    0x0d, 0x1b, 0x20, 0x0f, 0x02, 0x1b, 0x0f, 0x1b,
+    0x1b, 0x0f, 0x1b, 0x1b, 0x0f, 0x1b, 0x1f, 0x10,
+    0x1b, 0x1b, 0x10, 0x1b, 0x20, 0x10, 0x1b, 0x1f,
+    0x17, 0x04, 0x1b, 0x17, 0x04, 0x1b, 0x18, 0x1b,
+    0x03, 0x18, 0x1b, 0x1b, 0x1a, 0x03, 0x1b, 0x1a,
+    0x03, 0x20, 0x1a, 0x03, 0x1f, 0x1a, 0x02, 0x02,
+    0x1a, 0x02, 0x02, 0x1a, 0x04, 0x1b, 0x1a, 0x04,
+    0x1b, 0x1a, 0x1b, 0x03, 0x1a, 0x1b, 0x03, 0x1b,
+    0x03, 0x02, 0x1b, 0x03, 0x1b, 0x1b, 0x03, 0x20,
+    0x1b, 0x02, 0x03, 0x1b, 0x02, 0x1b, 0x1b, 0x04,
+    0x02, 0x1b, 0x04, 0x1b, 0x28, 0x06, 0x1d, 0x04,
+    0x06, 0x1f, 0x1d, 0x04, 0x1f, 0x1d, 0x1d, 0x1e,
+    0x05, 0x1d, 0x1e, 0x05, 0x21, 0x1e, 0x04, 0x1d,
+    0x1e, 0x04, 0x1d, 0x1e, 0x04, 0x21, 0x1e, 0x1d,
+    0x22, 0x1e, 0x1d, 0x21, 0x22, 0x1d, 0x1d, 0x22,
+    0x1d, 0x1d, 0x00, 0x06, 0x22, 0x02, 0x04, 0x22,
+    0x02, 0x04, 0x21, 0x02, 0x06, 0x22, 0x02, 0x06,
+    0x21, 0x02, 0x1d, 0x22, 0x02, 0x1d, 0x21, 0x04,
+    0x1d, 0x22, 0x04, 0x05, 0x21, 0x04, 0x1d, 0x21,
+    0x0b, 0x06, 0x21, 0x0d, 0x05, 0x22, 0x0c, 0x05,
+    0x22, 0x0e, 0x05, 0x22, 0x1c, 0x04, 0x22, 0x1c,
+    0x1d, 0x22, 0x22, 0x05, 0x22, 0x22, 0x04, 0x22,
+    0x22, 0x1d, 0x22, 0x1d, 0x1d, 0x22, 0x1a, 0x1d,
+    0x22, 0x1e, 0x05, 0x22, 0x1a, 0x1d, 0x05, 0x1c,
+    0x05, 0x1d, 0x11, 0x1d, 0x22, 0x1b, 0x1d, 0x22,
+    0x1e, 0x04, 0x05, 0x1d, 0x06, 0x22, 0x1c, 0x04,
+    0x1d, 0x1b, 0x1d, 0x1d, 0x1c, 0x04, 0x1d, 0x1e,
+    0x04, 0x05, 0x04, 0x05, 0x22, 0x05, 0x04, 0x22,
+    0x1d, 0x04, 0x22, 0x19, 0x1d, 0x22, 0x00, 0x05,
+    0x22, 0x1b, 0x1d, 0x1d, 0x11, 0x04, 0x1d, 0x0d,
+    0x1d, 0x1d, 0x0b, 0x06, 0x22, 0x1e, 0x04, 0x22,
+    0x35, 0x06, 0x00, 0x0f, 0x9d, 0x0d, 0x0f, 0x9d,
+    0x27, 0x06, 0x00, 0x1d, 0x1d, 0x20, 0x00, 0x1c,
+    0x01, 0x0a, 0x1e, 0x06, 0x1e, 0x08, 0x0e, 0x1d,
+    0x12, 0x1e, 0x0a, 0x0c, 0x21, 0x1d, 0x12, 0x1d,
+    0x23, 0x20, 0x21, 0x0c, 0x1d, 0x1e, 0x35, 0x06,
+    0x00, 0x0f, 0x14, 0x27, 0x06, 0x0e, 0x1d, 0x22,
+    0xff, 0x00, 0x1d, 0x1d, 0x20, 0xff, 0x12, 0x1d,
+    0x23, 0x20, 0xff, 0x21, 0x0c, 0x1d, 0x1e, 0x27,
+    0x06, 0x05, 0x1d, 0xff, 0x05, 0x1d, 0x00, 0x1d,
+    0x20, 0x27, 0x06, 0x0a, 0xa5, 0x00, 0x1d, 0x2c,
+    0x00, 0x01, 0x30, 0x02, 0x30, 0x3a, 0x00, 0x3b,
+    0x00, 0x21, 0x00, 0x3f, 0x00, 0x16, 0x30, 0x17,
+    0x30, 0x26, 0x20, 0x13, 0x20, 0x12, 0x01, 0x00,
+    0x5f, 0x5f, 0x28, 0x29, 0x7b, 0x7d, 0x08, 0x30,
+    0x0c, 0x0d, 0x08, 0x09, 0x02, 0x03, 0x00, 0x01,
+    0x04, 0x05, 0x06, 0x07, 0x5b, 0x00, 0x5d, 0x00,
+    0x3e, 0x20, 0x3e, 0x20, 0x3e, 0x20, 0x3e, 0x20,
+    0x5f, 0x00, 0x5f, 0x00, 0x5f, 0x00, 0x2c, 0x00,
+    0x01, 0x30, 0x2e, 0x00, 0x00, 0x00, 0x3b, 0x00,
+    0x3a, 0x00, 0x3f, 0x00, 0x21, 0x00, 0x14, 0x20,
+    0x28, 0x00, 0x29, 0x00, 0x7b, 0x00, 0x7d, 0x00,
+    0x14, 0x30, 0x15, 0x30, 0x23, 0x26, 0x2a, 0x2b,
+    0x2d, 0x3c, 0x3e, 0x3d, 0x00, 0x5c, 0x24, 0x25,
+    0x40, 0x40, 0x06, 0xff, 0x0b, 0x00, 0x0b, 0xff,
+    0x0c, 0x20, 0x00, 0x4d, 0x06, 0x40, 0x06, 0xff,
+    0x0e, 0x00, 0x0e, 0xff, 0x0f, 0x00, 0x0f, 0xff,
+    0x10, 0x00, 0x10, 0xff, 0x11, 0x00, 0x11, 0xff,
+    0x12, 0x00, 0x12, 0x21, 0x06, 0x00, 0x01, 0x01,
+    0x02, 0x02, 0x03, 0x03, 0x04, 0x04, 0x05, 0x05,
+    0x05, 0x05, 0x06, 0x06, 0x07, 0x07, 0x07, 0x07,
+    0x08, 0x08, 0x09, 0x09, 0x09, 0x09, 0x0a, 0x0a,
+    0x0a, 0x0a, 0x0b, 0x0b, 0x0b, 0x0b, 0x0c, 0x0c,
+    0x0c, 0x0c, 0x0d, 0x0d, 0x0d, 0x0d, 0x0e, 0x0e,
+    0x0f, 0x0f, 0x10, 0x10, 0x11, 0x11, 0x12, 0x12,
+    0x12, 0x12, 0x13, 0x13, 0x13, 0x13, 0x14, 0x14,
+    0x14, 0x14, 0x15, 0x15, 0x15, 0x15, 0x16, 0x16,
+    0x16, 0x16, 0x17, 0x17, 0x17, 0x17, 0x18, 0x18,
+    0x18, 0x18, 0x19, 0x19, 0x19, 0x19, 0x20, 0x20,
+    0x20, 0x20, 0x21, 0x21, 0x21, 0x21, 0x22, 0x22,
+    0x22, 0x22, 0x23, 0x23, 0x23, 0x23, 0x24, 0x24,
+    0x24, 0x24, 0x25, 0x25, 0x25, 0x25, 0x26, 0x26,
+    0x26, 0x26, 0x27, 0x27, 0x28, 0x28, 0x29, 0x29,
+    0x29, 0x29, 0x22, 0x06, 0x22, 0x00, 0x22, 0x00,
+    0x22, 0x01, 0x22, 0x01, 0x22, 0x03, 0x22, 0x03,
+    0x22, 0x05, 0x22, 0x05, 0x21, 0x00, 0x85, 0x29,
+    0x01, 0x30, 0x01, 0x0b, 0x0c, 0x00, 0xfa, 0xf1,
+    0xa0, 0xa2, 0xa4, 0xa6, 0xa8, 0xe2, 0xe4, 0xe6,
+    0xc2, 0xfb, 0xa1, 0xa3, 0xa5, 0xa7, 0xa9, 0xaa,
+    0xac, 0xae, 0xb0, 0xb2, 0xb4, 0xb6, 0xb8, 0xba,
+    0xbc, 0xbe, 0xc0, 0xc3, 0xc5, 0xc7, 0xc9, 0xca,
+    0xcb, 0xcc, 0xcd, 0xce, 0xd1, 0xd4, 0xd7, 0xda,
+    0xdd, 0xde, 0xdf, 0xe0, 0xe1, 0xe3, 0xe5, 0xe7,
+    0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xee, 0xf2, 0x98,
+    0x99, 0x31, 0x31, 0x4f, 0x31, 0x55, 0x31, 0x5b,
+    0x31, 0x61, 0x31, 0xa2, 0x00, 0xa3, 0x00, 0xac,
+    0x00, 0xaf, 0x00, 0xa6, 0x00, 0xa5, 0x00, 0xa9,
+    0x20, 0x00, 0x00, 0x02, 0x25, 0x90, 0x21, 0x91,
+    0x21, 0x92, 0x21, 0x93, 0x21, 0xa0, 0x25, 0xcb,
+    0x25, 0x99, 0x10, 0xba, 0x10, 0x00, 0x00, 0x00,
+    0x00, 0x9b, 0x10, 0xba, 0x10, 0x05, 0x05, 0xa5,
+    0x10, 0xba, 0x10, 0x05, 0x31, 0x11, 0x27, 0x11,
+    0x32, 0x11, 0x27, 0x11, 0x55, 0x47, 0x13, 0x3e,
+    0x13, 0x47, 0x13, 0x57, 0x13, 0x55, 0xb9, 0x14,
+    0xba, 0x14, 0xb9, 0x14, 0xb0, 0x14, 0x00, 0x00,
+    0x00, 0x00, 0xb9, 0x14, 0xbd, 0x14, 0x55, 0x50,
+    0xb8, 0x15, 0xaf, 0x15, 0xb9, 0x15, 0xaf, 0x15,
+    0x55, 0x57, 0xd1, 0x65, 0xd1, 0x58, 0xd1, 0x65,
+    0xd1, 0x5f, 0xd1, 0x6e, 0xd1, 0x5f, 0xd1, 0x6f,
+    0xd1, 0x5f, 0xd1, 0x70, 0xd1, 0x5f, 0xd1, 0x71,
+    0xd1, 0x5f, 0xd1, 0x72, 0xd1, 0x55, 0x55, 0x55,
+    0x05, 0xb9, 0xd1, 0x65, 0xd1, 0xba, 0xd1, 0x65,
+    0xd1, 0xbb, 0xd1, 0x6e, 0xd1, 0xbc, 0xd1, 0x6e,
+    0xd1, 0xbb, 0xd1, 0x6f, 0xd1, 0xbc, 0xd1, 0x6f,
+    0xd1, 0x55, 0x55, 0x55, 0x41, 0x00, 0x61, 0x00,
+    0x41, 0x00, 0x61, 0x00, 0x69, 0x00, 0x41, 0x00,
+    0x61, 0x00, 0x41, 0x00, 0x43, 0x44, 0x00, 0x00,
+    0x47, 0x00, 0x00, 0x4a, 0x4b, 0x00, 0x00, 0x4e,
+    0x4f, 0x50, 0x51, 0x00, 0x53, 0x54, 0x55, 0x56,
+    0x57, 0x58, 0x59, 0x5a, 0x61, 0x62, 0x63, 0x64,
+    0x00, 0x66, 0x68, 0x00, 0x70, 0x00, 0x41, 0x00,
+    0x61, 0x00, 0x41, 0x42, 0x00, 0x44, 0x45, 0x46,
+    0x47, 0x4a, 0x00, 0x53, 0x00, 0x61, 0x00, 0x41,
+    0x42, 0x00, 0x44, 0x45, 0x46, 0x47, 0x00, 0x49,
+    0x4a, 0x4b, 0x4c, 0x4d, 0x00, 0x4f, 0x53, 0x00,
+    0x61, 0x00, 0x41, 0x00, 0x61, 0x00, 0x41, 0x00,
+    0x61, 0x00, 0x41, 0x00, 0x61, 0x00, 0x41, 0x00,
+    0x61, 0x00, 0x41, 0x00, 0x61, 0x00, 0x41, 0x00,
+    0x61, 0x00, 0x31, 0x01, 0x37, 0x02, 0x91, 0x03,
+    0xa3, 0x03, 0xb1, 0x03, 0xd1, 0x03, 0x24, 0x00,
+    0x1f, 0x04, 0x20, 0x05, 0x91, 0x03, 0xa3, 0x03,
+    0xb1, 0x03, 0xd1, 0x03, 0x24, 0x00, 0x1f, 0x04,
+    0x20, 0x05, 0x91, 0x03, 0xa3, 0x03, 0xb1, 0x03,
+    0xd1, 0x03, 0x24, 0x00, 0x1f, 0x04, 0x20, 0x05,
+    0x91, 0x03, 0xa3, 0x03, 0xb1, 0x03, 0xd1, 0x03,
+    0x24, 0x00, 0x1f, 0x04, 0x20, 0x05, 0x91, 0x03,
+    0xa3, 0x03, 0xb1, 0x03, 0xd1, 0x03, 0x24, 0x00,
+    0x1f, 0x04, 0x20, 0x05, 0x0b, 0x0c, 0x30, 0x00,
+    0x30, 0x00, 0x30, 0x00, 0x30, 0x00, 0x30, 0x00,
+    0x27, 0x06, 0x00, 0x01, 0x05, 0x08, 0x2a, 0x06,
+    0x1e, 0x08, 0x03, 0x0d, 0x20, 0x19, 0x1a, 0x1b,
+    0x1c, 0x09, 0x0f, 0x17, 0x0b, 0x18, 0x07, 0x0a,
+    0x00, 0x01, 0x04, 0x06, 0x0c, 0x0e, 0x10, 0x44,
+    0x90, 0x77, 0x45, 0x28, 0x06, 0x2c, 0x06, 0x00,
+    0x00, 0x47, 0x06, 0x33, 0x06, 0x17, 0x10, 0x11,
+    0x12, 0x13, 0x00, 0x06, 0x0e, 0x02, 0x0f, 0x34,
+    0x06, 0x2a, 0x06, 0x2b, 0x06, 0x2e, 0x06, 0x00,
+    0x00, 0x36, 0x06, 0x00, 0x00, 0x3a, 0x06, 0x2d,
+    0x06, 0x00, 0x00, 0x4a, 0x06, 0x00, 0x00, 0x44,
+    0x06, 0x00, 0x00, 0x46, 0x06, 0x33, 0x06, 0x39,
+    0x06, 0x00, 0x00, 0x35, 0x06, 0x42, 0x06, 0x00,
+    0x00, 0x34, 0x06, 0x00, 0x00, 0x00, 0x00, 0x2e,
+    0x06, 0x00, 0x00, 0x36, 0x06, 0x00, 0x00, 0x3a,
+    0x06, 0x00, 0x00, 0xba, 0x06, 0x00, 0x00, 0x6f,
+    0x06, 0x00, 0x00, 0x28, 0x06, 0x2c, 0x06, 0x00,
+    0x00, 0x47, 0x06, 0x00, 0x00, 0x00, 0x00, 0x2d,
+    0x06, 0x37, 0x06, 0x4a, 0x06, 0x43, 0x06, 0x00,
+    0x00, 0x45, 0x06, 0x46, 0x06, 0x33, 0x06, 0x39,
+    0x06, 0x41, 0x06, 0x35, 0x06, 0x42, 0x06, 0x00,
+    0x00, 0x34, 0x06, 0x2a, 0x06, 0x2b, 0x06, 0x2e,
+    0x06, 0x00, 0x00, 0x36, 0x06, 0x38, 0x06, 0x3a,
+    0x06, 0x6e, 0x06, 0x00, 0x00, 0xa1, 0x06, 0x27,
+    0x06, 0x00, 0x01, 0x05, 0x08, 0x20, 0x21, 0x0b,
+    0x06, 0x10, 0x23, 0x2a, 0x06, 0x1a, 0x1b, 0x1c,
+    0x09, 0x0f, 0x17, 0x0b, 0x18, 0x07, 0x0a, 0x00,
+    0x01, 0x04, 0x06, 0x0c, 0x0e, 0x10, 0x28, 0x06,
+    0x2c, 0x06, 0x2f, 0x06, 0x00, 0x00, 0x48, 0x06,
+    0x32, 0x06, 0x2d, 0x06, 0x37, 0x06, 0x4a, 0x06,
+    0x2a, 0x06, 0x1a, 0x1b, 0x1c, 0x09, 0x0f, 0x17,
+    0x0b, 0x18, 0x07, 0x0a, 0x00, 0x01, 0x04, 0x06,
+    0x0c, 0x0e, 0x10, 0x30, 0x2e, 0x30, 0x00, 0x2c,
+    0x00, 0x28, 0x00, 0x41, 0x00, 0x29, 0x00, 0x14,
+    0x30, 0x53, 0x00, 0x15, 0x30, 0x43, 0x52, 0x43,
+    0x44, 0x57, 0x5a, 0x41, 0x00, 0x48, 0x56, 0x4d,
+    0x56, 0x53, 0x44, 0x53, 0x53, 0x50, 0x50, 0x56,
+    0x57, 0x43, 0x4d, 0x43, 0x4d, 0x44, 0x44, 0x4a,
+    0x4b, 0x30, 0x30, 0x00, 0x68, 0x68, 0x4b, 0x62,
+    0x57, 0x5b, 0xcc, 0x53, 0xc7, 0x30, 0x8c, 0x4e,
+    0x1a, 0x59, 0xe3, 0x89, 0x29, 0x59, 0xa4, 0x4e,
+    0x20, 0x66, 0x21, 0x71, 0x99, 0x65, 0x4d, 0x52,
+    0x8c, 0x5f, 0x8d, 0x51, 0xb0, 0x65, 0x1d, 0x52,
+    0x42, 0x7d, 0x1f, 0x75, 0xa9, 0x8c, 0xf0, 0x58,
+    0x39, 0x54, 0x14, 0x6f, 0x95, 0x62, 0x55, 0x63,
+    0x00, 0x4e, 0x09, 0x4e, 0x4a, 0x90, 0xe6, 0x5d,
+    0x2d, 0x4e, 0xf3, 0x53, 0x07, 0x63, 0x70, 0x8d,
+    0x53, 0x62, 0x81, 0x79, 0x7a, 0x7a, 0x08, 0x54,
+    0x80, 0x6e, 0x09, 0x67, 0x08, 0x67, 0x33, 0x75,
+    0x72, 0x52, 0xb6, 0x55, 0x4d, 0x91, 0x14, 0x30,
+    0x15, 0x30, 0x2c, 0x67, 0x09, 0x4e, 0x8c, 0x4e,
+    0x89, 0x5b, 0xb9, 0x70, 0x53, 0x62, 0xd7, 0x76,
+    0xdd, 0x52, 0x57, 0x65, 0x97, 0x5f, 0xef, 0x53,
+    0x38, 0x4e, 0x05, 0x00, 0x09, 0x22, 0x01, 0x60,
+    0x4f, 0xae, 0x4f, 0xbb, 0x4f, 0x02, 0x50, 0x7a,
+    0x50, 0x99, 0x50, 0xe7, 0x50, 0xcf, 0x50, 0x9e,
+    0x34, 0x3a, 0x06, 0x4d, 0x51, 0x54, 0x51, 0x64,
+    0x51, 0x77, 0x51, 0x1c, 0x05, 0xb9, 0x34, 0x67,
+    0x51, 0x8d, 0x51, 0x4b, 0x05, 0x97, 0x51, 0xa4,
+    0x51, 0xcc, 0x4e, 0xac, 0x51, 0xb5, 0x51, 0xdf,
+    0x91, 0xf5, 0x51, 0x03, 0x52, 0xdf, 0x34, 0x3b,
+    0x52, 0x46, 0x52, 0x72, 0x52, 0x77, 0x52, 0x15,
+    0x35, 0x02, 0x00, 0x20, 0x80, 0x80, 0x00, 0x08,
+    0x00, 0x00, 0xc7, 0x52, 0x00, 0x02, 0x1d, 0x33,
+    0x3e, 0x3f, 0x50, 0x82, 0x8a, 0x93, 0xac, 0xb6,
+    0xb8, 0xb8, 0xb8, 0x2c, 0x0a, 0x70, 0x70, 0xca,
+    0x53, 0xdf, 0x53, 0x63, 0x0b, 0xeb, 0x53, 0xf1,
+    0x53, 0x06, 0x54, 0x9e, 0x54, 0x38, 0x54, 0x48,
+    0x54, 0x68, 0x54, 0xa2, 0x54, 0xf6, 0x54, 0x10,
+    0x55, 0x53, 0x55, 0x63, 0x55, 0x84, 0x55, 0x84,
+    0x55, 0x99, 0x55, 0xab, 0x55, 0xb3, 0x55, 0xc2,
+    0x55, 0x16, 0x57, 0x06, 0x56, 0x17, 0x57, 0x51,
+    0x56, 0x74, 0x56, 0x07, 0x52, 0xee, 0x58, 0xce,
+    0x57, 0xf4, 0x57, 0x0d, 0x58, 0x8b, 0x57, 0x32,
+    0x58, 0x31, 0x58, 0xac, 0x58, 0xe4, 0x14, 0xf2,
+    0x58, 0xf7, 0x58, 0x06, 0x59, 0x1a, 0x59, 0x22,
+    0x59, 0x62, 0x59, 0xa8, 0x16, 0xea, 0x16, 0xec,
+    0x59, 0x1b, 0x5a, 0x27, 0x5a, 0xd8, 0x59, 0x66,
+    0x5a, 0xee, 0x36, 0xfc, 0x36, 0x08, 0x5b, 0x3e,
+    0x5b, 0x3e, 0x5b, 0xc8, 0x19, 0xc3, 0x5b, 0xd8,
+    0x5b, 0xe7, 0x5b, 0xf3, 0x5b, 0x18, 0x1b, 0xff,
+    0x5b, 0x06, 0x5c, 0x53, 0x5f, 0x22, 0x5c, 0x81,
+    0x37, 0x60, 0x5c, 0x6e, 0x5c, 0xc0, 0x5c, 0x8d,
+    0x5c, 0xe4, 0x1d, 0x43, 0x5d, 0xe6, 0x1d, 0x6e,
+    0x5d, 0x6b, 0x5d, 0x7c, 0x5d, 0xe1, 0x5d, 0xe2,
+    0x5d, 0x2f, 0x38, 0xfd, 0x5d, 0x28, 0x5e, 0x3d,
+    0x5e, 0x69, 0x5e, 0x62, 0x38, 0x83, 0x21, 0x7c,
+    0x38, 0xb0, 0x5e, 0xb3, 0x5e, 0xb6, 0x5e, 0xca,
+    0x5e, 0x92, 0xa3, 0xfe, 0x5e, 0x31, 0x23, 0x31,
+    0x23, 0x01, 0x82, 0x22, 0x5f, 0x22, 0x5f, 0xc7,
+    0x38, 0xb8, 0x32, 0xda, 0x61, 0x62, 0x5f, 0x6b,
+    0x5f, 0xe3, 0x38, 0x9a, 0x5f, 0xcd, 0x5f, 0xd7,
+    0x5f, 0xf9, 0x5f, 0x81, 0x60, 0x3a, 0x39, 0x1c,
+    0x39, 0x94, 0x60, 0xd4, 0x26, 0xc7, 0x60, 0x02,
+    0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x08, 0x00, 0x0a, 0x00, 0x00, 0x02, 0x08, 0x00,
+    0x80, 0x08, 0x00, 0x00, 0x08, 0x80, 0x28, 0x80,
+    0x02, 0x00, 0x00, 0x02, 0x48, 0x61, 0x00, 0x04,
+    0x06, 0x04, 0x32, 0x46, 0x6a, 0x5c, 0x67, 0x96,
+    0xaa, 0xae, 0xc8, 0xd3, 0x5d, 0x62, 0x00, 0x54,
+    0x77, 0xf3, 0x0c, 0x2b, 0x3d, 0x63, 0xfc, 0x62,
+    0x68, 0x63, 0x83, 0x63, 0xe4, 0x63, 0xf1, 0x2b,
+    0x22, 0x64, 0xc5, 0x63, 0xa9, 0x63, 0x2e, 0x3a,
+    0x69, 0x64, 0x7e, 0x64, 0x9d, 0x64, 0x77, 0x64,
+    0x6c, 0x3a, 0x4f, 0x65, 0x6c, 0x65, 0x0a, 0x30,
+    0xe3, 0x65, 0xf8, 0x66, 0x49, 0x66, 0x19, 0x3b,
+    0x91, 0x66, 0x08, 0x3b, 0xe4, 0x3a, 0x92, 0x51,
+    0x95, 0x51, 0x00, 0x67, 0x9c, 0x66, 0xad, 0x80,
+    0xd9, 0x43, 0x17, 0x67, 0x1b, 0x67, 0x21, 0x67,
+    0x5e, 0x67, 0x53, 0x67, 0xc3, 0x33, 0x49, 0x3b,
+    0xfa, 0x67, 0x85, 0x67, 0x52, 0x68, 0x85, 0x68,
+    0x6d, 0x34, 0x8e, 0x68, 0x1f, 0x68, 0x14, 0x69,
+    0x9d, 0x3b, 0x42, 0x69, 0xa3, 0x69, 0xea, 0x69,
+    0xa8, 0x6a, 0xa3, 0x36, 0xdb, 0x6a, 0x18, 0x3c,
+    0x21, 0x6b, 0xa7, 0x38, 0x54, 0x6b, 0x4e, 0x3c,
+    0x72, 0x6b, 0x9f, 0x6b, 0xba, 0x6b, 0xbb, 0x6b,
+    0x8d, 0x3a, 0x0b, 0x1d, 0xfa, 0x3a, 0x4e, 0x6c,
+    0xbc, 0x3c, 0xbf, 0x6c, 0xcd, 0x6c, 0x67, 0x6c,
+    0x16, 0x6d, 0x3e, 0x6d, 0x77, 0x6d, 0x41, 0x6d,
+    0x69, 0x6d, 0x78, 0x6d, 0x85, 0x6d, 0x1e, 0x3d,
+    0x34, 0x6d, 0x2f, 0x6e, 0x6e, 0x6e, 0x33, 0x3d,
+    0xcb, 0x6e, 0xc7, 0x6e, 0xd1, 0x3e, 0xf9, 0x6d,
+    0x6e, 0x6f, 0x5e, 0x3f, 0x8e, 0x3f, 0xc6, 0x6f,
+    0x39, 0x70, 0x1e, 0x70, 0x1b, 0x70, 0x96, 0x3d,
+    0x4a, 0x70, 0x7d, 0x70, 0x77, 0x70, 0xad, 0x70,
+    0x25, 0x05, 0x45, 0x71, 0x63, 0x42, 0x9c, 0x71,
+    0xab, 0x43, 0x28, 0x72, 0x35, 0x72, 0x50, 0x72,
+    0x08, 0x46, 0x80, 0x72, 0x95, 0x72, 0x35, 0x47,
+    0x02, 0x20, 0x00, 0x00, 0x20, 0x00, 0x00, 0x00,
+    0x00, 0x08, 0x80, 0x00, 0x00, 0x02, 0x02, 0x80,
+    0x8a, 0x00, 0x00, 0x20, 0x00, 0x08, 0x0a, 0x00,
+    0x80, 0x88, 0x80, 0x20, 0x14, 0x48, 0x7a, 0x73,
+    0x8b, 0x73, 0xac, 0x3e, 0xa5, 0x73, 0xb8, 0x3e,
+    0xb8, 0x3e, 0x47, 0x74, 0x5c, 0x74, 0x71, 0x74,
+    0x85, 0x74, 0xca, 0x74, 0x1b, 0x3f, 0x24, 0x75,
+    0x36, 0x4c, 0x3e, 0x75, 0x92, 0x4c, 0x70, 0x75,
+    0x9f, 0x21, 0x10, 0x76, 0xa1, 0x4f, 0xb8, 0x4f,
+    0x44, 0x50, 0xfc, 0x3f, 0x08, 0x40, 0xf4, 0x76,
+    0xf3, 0x50, 0xf2, 0x50, 0x19, 0x51, 0x33, 0x51,
+    0x1e, 0x77, 0x1f, 0x77, 0x1f, 0x77, 0x4a, 0x77,
+    0x39, 0x40, 0x8b, 0x77, 0x46, 0x40, 0x96, 0x40,
+    0x1d, 0x54, 0x4e, 0x78, 0x8c, 0x78, 0xcc, 0x78,
+    0xe3, 0x40, 0x26, 0x56, 0x56, 0x79, 0x9a, 0x56,
+    0xc5, 0x56, 0x8f, 0x79, 0xeb, 0x79, 0x2f, 0x41,
+    0x40, 0x7a, 0x4a, 0x7a, 0x4f, 0x7a, 0x7c, 0x59,
+    0xa7, 0x5a, 0xa7, 0x5a, 0xee, 0x7a, 0x02, 0x42,
+    0xab, 0x5b, 0xc6, 0x7b, 0xc9, 0x7b, 0x27, 0x42,
+    0x80, 0x5c, 0xd2, 0x7c, 0xa0, 0x42, 0xe8, 0x7c,
+    0xe3, 0x7c, 0x00, 0x7d, 0x86, 0x5f, 0x63, 0x7d,
+    0x01, 0x43, 0xc7, 0x7d, 0x02, 0x7e, 0x45, 0x7e,
+    0x34, 0x43, 0x28, 0x62, 0x47, 0x62, 0x59, 0x43,
+    0xd9, 0x62, 0x7a, 0x7f, 0x3e, 0x63, 0x95, 0x7f,
+    0xfa, 0x7f, 0x05, 0x80, 0xda, 0x64, 0x23, 0x65,
+    0x60, 0x80, 0xa8, 0x65, 0x70, 0x80, 0x5f, 0x33,
+    0xd5, 0x43, 0xb2, 0x80, 0x03, 0x81, 0x0b, 0x44,
+    0x3e, 0x81, 0xb5, 0x5a, 0xa7, 0x67, 0xb5, 0x67,
+    0x93, 0x33, 0x9c, 0x33, 0x01, 0x82, 0x04, 0x82,
+    0x9e, 0x8f, 0x6b, 0x44, 0x91, 0x82, 0x8b, 0x82,
+    0x9d, 0x82, 0xb3, 0x52, 0xb1, 0x82, 0xb3, 0x82,
+    0xbd, 0x82, 0xe6, 0x82, 0x3c, 0x6b, 0xe5, 0x82,
+    0x1d, 0x83, 0x63, 0x83, 0xad, 0x83, 0x23, 0x83,
+    0xbd, 0x83, 0xe7, 0x83, 0x57, 0x84, 0x53, 0x83,
+    0xca, 0x83, 0xcc, 0x83, 0xdc, 0x83, 0x36, 0x6c,
+    0x6b, 0x6d, 0x02, 0x00, 0x00, 0x20, 0x22, 0x2a,
+    0xa0, 0x0a, 0x00, 0x20, 0x80, 0x28, 0x00, 0xa8,
+    0x20, 0x20, 0x00, 0x02, 0x80, 0x22, 0x02, 0x8a,
+    0x08, 0x00, 0xaa, 0x00, 0x00, 0x00, 0x02, 0x00,
+    0x00, 0x28, 0xd5, 0x6c, 0x2b, 0x45, 0xf1, 0x84,
+    0xf3, 0x84, 0x16, 0x85, 0xca, 0x73, 0x64, 0x85,
+    0x2c, 0x6f, 0x5d, 0x45, 0x61, 0x45, 0xb1, 0x6f,
+    0xd2, 0x70, 0x6b, 0x45, 0x50, 0x86, 0x5c, 0x86,
+    0x67, 0x86, 0x69, 0x86, 0xa9, 0x86, 0x88, 0x86,
+    0x0e, 0x87, 0xe2, 0x86, 0x79, 0x87, 0x28, 0x87,
+    0x6b, 0x87, 0x86, 0x87, 0xd7, 0x45, 0xe1, 0x87,
+    0x01, 0x88, 0xf9, 0x45, 0x60, 0x88, 0x63, 0x88,
+    0x67, 0x76, 0xd7, 0x88, 0xde, 0x88, 0x35, 0x46,
+    0xfa, 0x88, 0xbb, 0x34, 0xae, 0x78, 0x66, 0x79,
+    0xbe, 0x46, 0xc7, 0x46, 0xa0, 0x8a, 0xed, 0x8a,
+    0x8a, 0x8b, 0x55, 0x8c, 0xa8, 0x7c, 0xab, 0x8c,
+    0xc1, 0x8c, 0x1b, 0x8d, 0x77, 0x8d, 0x2f, 0x7f,
+    0x04, 0x08, 0xcb, 0x8d, 0xbc, 0x8d, 0xf0, 0x8d,
+    0xde, 0x08, 0xd4, 0x8e, 0x38, 0x8f, 0xd2, 0x85,
+    0xed, 0x85, 0x94, 0x90, 0xf1, 0x90, 0x11, 0x91,
+    0x2e, 0x87, 0x1b, 0x91, 0x38, 0x92, 0xd7, 0x92,
+    0xd8, 0x92, 0x7c, 0x92, 0xf9, 0x93, 0x15, 0x94,
+    0xfa, 0x8b, 0x8b, 0x95, 0x95, 0x49, 0xb7, 0x95,
+    0x77, 0x8d, 0xe6, 0x49, 0xc3, 0x96, 0xb2, 0x5d,
+    0x23, 0x97, 0x45, 0x91, 0x1a, 0x92, 0x6e, 0x4a,
+    0x76, 0x4a, 0xe0, 0x97, 0x0a, 0x94, 0xb2, 0x4a,
+    0x96, 0x94, 0x0b, 0x98, 0x0b, 0x98, 0x29, 0x98,
+    0xb6, 0x95, 0xe2, 0x98, 0x33, 0x4b, 0x29, 0x99,
+    0xa7, 0x99, 0xc2, 0x99, 0xfe, 0x99, 0xce, 0x4b,
+    0x30, 0x9b, 0x12, 0x9b, 0x40, 0x9c, 0xfd, 0x9c,
+    0xce, 0x4c, 0xed, 0x4c, 0x67, 0x9d, 0xce, 0xa0,
+    0xf8, 0x4c, 0x05, 0xa1, 0x0e, 0xa2, 0x91, 0xa2,
+    0xbb, 0x9e, 0x56, 0x4d, 0xf9, 0x9e, 0xfe, 0x9e,
+    0x05, 0x9f, 0x0f, 0x9f, 0x16, 0x9f, 0x3b, 0x9f,
+    0x00, 0xa6, 0x02, 0x88, 0xa0, 0x00, 0x00, 0x00,
+    0x00, 0x80, 0x00, 0x28, 0x00, 0x08, 0xa0, 0x80,
+    0xa0, 0x80, 0x00, 0x80, 0x80, 0x00, 0x0a, 0x88,
+    0x80, 0x00, 0x80, 0x00, 0x20, 0x2a, 0x00, 0x80,
+};
+
+static const uint16_t unicode_comp_table[944] = {
+    0x4a01, 0x49c0, 0x4a02, 0x0280, 0x0281, 0x0282, 0x0283, 0x02c0,
+    0x02c2, 0x0a00, 0x0284, 0x2442, 0x0285, 0x07c0, 0x0980, 0x0982,
+    0x2440, 0x2280, 0x02c4, 0x2282, 0x2284, 0x2286, 0x02c6, 0x02c8,
+    0x02ca, 0x02cc, 0x0287, 0x228a, 0x02ce, 0x228c, 0x2290, 0x2292,
+    0x228e, 0x0288, 0x0289, 0x028a, 0x2482, 0x0300, 0x0302, 0x0304,
+    0x028b, 0x2480, 0x0308, 0x0984, 0x0986, 0x2458, 0x0a02, 0x0306,
+    0x2298, 0x229a, 0x229e, 0x0900, 0x030a, 0x22a0, 0x030c, 0x030e,
+    0x0840, 0x0310, 0x0312, 0x22a2, 0x22a6, 0x09c0, 0x22a4, 0x22a8,
+    0x22aa, 0x028c, 0x028d, 0x028e, 0x0340, 0x0342, 0x0344, 0x0380,
+    0x028f, 0x248e, 0x07c2, 0x0988, 0x098a, 0x2490, 0x0346, 0x22ac,
+    0x0400, 0x22b0, 0x0842, 0x22b2, 0x0402, 0x22b4, 0x0440, 0x0444,
+    0x22b6, 0x0442, 0x22c2, 0x22c0, 0x22c4, 0x22c6, 0x22c8, 0x0940,
+    0x04c0, 0x0291, 0x22ca, 0x04c4, 0x22cc, 0x04c2, 0x22d0, 0x22ce,
+    0x0292, 0x0293, 0x0294, 0x0295, 0x0540, 0x0542, 0x0a08, 0x0296,
+    0x2494, 0x0544, 0x07c4, 0x098c, 0x098e, 0x06c0, 0x2492, 0x0844,
+    0x2308, 0x230a, 0x0580, 0x230c, 0x0584, 0x0990, 0x0992, 0x230e,
+    0x0582, 0x2312, 0x0586, 0x0588, 0x2314, 0x058c, 0x2316, 0x0998,
+    0x058a, 0x231e, 0x0590, 0x2320, 0x099a, 0x058e, 0x2324, 0x2322,
+    0x0299, 0x029a, 0x029b, 0x05c0, 0x05c2, 0x05c4, 0x029c, 0x24ac,
+    0x05c6, 0x05c8, 0x07c6, 0x0994, 0x0996, 0x0700, 0x24aa, 0x2326,
+    0x05ca, 0x232a, 0x2328, 0x2340, 0x2342, 0x2344, 0x2346, 0x05cc,
+    0x234a, 0x2348, 0x234c, 0x234e, 0x2350, 0x24b8, 0x029d, 0x05ce,
+    0x24be, 0x0a0c, 0x2352, 0x0600, 0x24bc, 0x24ba, 0x0640, 0x2354,
+    0x0642, 0x0644, 0x2356, 0x2358, 0x02a0, 0x02a1, 0x02a2, 0x02a3,
+    0x02c1, 0x02c3, 0x0a01, 0x02a4, 0x2443, 0x02a5, 0x07c1, 0x0981,
+    0x0983, 0x2441, 0x2281, 0x02c5, 0x2283, 0x2285, 0x2287, 0x02c7,
+    0x02c9, 0x02cb, 0x02cd, 0x02a7, 0x228b, 0x02cf, 0x228d, 0x2291,
+    0x2293, 0x228f, 0x02a8, 0x02a9, 0x02aa, 0x2483, 0x0301, 0x0303,
+    0x0305, 0x02ab, 0x2481, 0x0309, 0x0985, 0x0987, 0x2459, 0x0a03,
+    0x0307, 0x2299, 0x229b, 0x229f, 0x0901, 0x030b, 0x22a1, 0x030d,
+    0x030f, 0x0841, 0x0311, 0x0313, 0x22a3, 0x22a7, 0x09c1, 0x22a5,
+    0x22a9, 0x22ab, 0x2380, 0x02ac, 0x02ad, 0x02ae, 0x0341, 0x0343,
+    0x0345, 0x02af, 0x248f, 0x07c3, 0x0989, 0x098b, 0x2491, 0x0347,
+    0x22ad, 0x0401, 0x0884, 0x22b1, 0x0843, 0x22b3, 0x0403, 0x22b5,
+    0x0441, 0x0445, 0x22b7, 0x0443, 0x22c3, 0x22c1, 0x22c5, 0x22c7,
+    0x22c9, 0x0941, 0x04c1, 0x02b1, 0x22cb, 0x04c5, 0x22cd, 0x04c3,
+    0x22d1, 0x22cf, 0x02b2, 0x02b3, 0x02b4, 0x02b5, 0x0541, 0x0543,
+    0x0a09, 0x02b6, 0x2495, 0x0545, 0x07c5, 0x098d, 0x098f, 0x06c1,
+    0x2493, 0x0845, 0x2309, 0x230b, 0x0581, 0x230d, 0x0585, 0x0991,
+    0x0993, 0x230f, 0x0583, 0x2313, 0x0587, 0x0589, 0x2315, 0x058d,
+    0x2317, 0x0999, 0x058b, 0x231f, 0x2381, 0x0591, 0x2321, 0x099b,
+    0x058f, 0x2325, 0x2323, 0x02b9, 0x02ba, 0x02bb, 0x05c1, 0x05c3,
+    0x05c5, 0x02bc, 0x24ad, 0x05c7, 0x05c9, 0x07c7, 0x0995, 0x0997,
+    0x0701, 0x24ab, 0x2327, 0x05cb, 0x232b, 0x2329, 0x2341, 0x2343,
+    0x2345, 0x2347, 0x05cd, 0x234b, 0x2349, 0x2382, 0x234d, 0x234f,
+    0x2351, 0x24b9, 0x02bd, 0x05cf, 0x24bf, 0x0a0d, 0x2353, 0x02bf,
+    0x24bd, 0x2383, 0x24bb, 0x0641, 0x2355, 0x0643, 0x0645, 0x2357,
+    0x2359, 0x3101, 0x0c80, 0x2e00, 0x2446, 0x2444, 0x244a, 0x2448,
+    0x0800, 0x0942, 0x0944, 0x0804, 0x2288, 0x2486, 0x2484, 0x248a,
+    0x2488, 0x22ae, 0x2498, 0x2496, 0x249c, 0x249a, 0x2300, 0x0a06,
+    0x2302, 0x0a04, 0x0946, 0x07ce, 0x07ca, 0x07c8, 0x07cc, 0x2447,
+    0x2445, 0x244b, 0x2449, 0x0801, 0x0943, 0x0945, 0x0805, 0x2289,
+    0x2487, 0x2485, 0x248b, 0x2489, 0x22af, 0x2499, 0x2497, 0x249d,
+    0x249b, 0x2301, 0x0a07, 0x2303, 0x0a05, 0x0947, 0x07cf, 0x07cb,
+    0x07c9, 0x07cd, 0x2450, 0x244e, 0x2454, 0x2452, 0x2451, 0x244f,
+    0x2455, 0x2453, 0x2294, 0x2296, 0x2295, 0x2297, 0x2304, 0x2306,
+    0x2305, 0x2307, 0x2318, 0x2319, 0x231a, 0x231b, 0x232c, 0x232d,
+    0x232e, 0x232f, 0x2400, 0x24a2, 0x24a0, 0x24a6, 0x24a4, 0x24a8,
+    0x24a3, 0x24a1, 0x24a7, 0x24a5, 0x24a9, 0x24b0, 0x24ae, 0x24b4,
+    0x24b2, 0x24b6, 0x24b1, 0x24af, 0x24b5, 0x24b3, 0x24b7, 0x0882,
+    0x0880, 0x0881, 0x0802, 0x0803, 0x229c, 0x229d, 0x0a0a, 0x0a0b,
+    0x0883, 0x0b40, 0x2c8a, 0x0c81, 0x2c89, 0x2c88, 0x2540, 0x2541,
+    0x2d00, 0x2e07, 0x0d00, 0x2640, 0x2641, 0x2e80, 0x0d01, 0x26c8,
+    0x26c9, 0x2f00, 0x2f84, 0x0d02, 0x2f83, 0x2f82, 0x0d40, 0x26d8,
+    0x26d9, 0x3186, 0x0d04, 0x2740, 0x2741, 0x3100, 0x3086, 0x0d06,
+    0x3085, 0x3084, 0x0d41, 0x2840, 0x3200, 0x0d07, 0x284f, 0x2850,
+    0x3280, 0x2c84, 0x2e03, 0x2857, 0x0d42, 0x2c81, 0x2c80, 0x24c0,
+    0x24c1, 0x2c86, 0x2c83, 0x28c0, 0x0d43, 0x25c0, 0x25c1, 0x2940,
+    0x0d44, 0x26c0, 0x26c1, 0x2e05, 0x2e02, 0x29c0, 0x0d45, 0x2f05,
+    0x2f04, 0x0d80, 0x26d0, 0x26d1, 0x2f80, 0x2a40, 0x0d82, 0x26e0,
+    0x26e1, 0x3080, 0x3081, 0x2ac0, 0x0d83, 0x3004, 0x3003, 0x0d81,
+    0x27c0, 0x27c1, 0x3082, 0x2b40, 0x0d84, 0x2847, 0x2848, 0x3184,
+    0x3181, 0x2f06, 0x0d08, 0x2f81, 0x3005, 0x0d46, 0x3083, 0x3182,
+    0x0e00, 0x0e01, 0x0f40, 0x1180, 0x1182, 0x0f03, 0x0f00, 0x11c0,
+    0x0f01, 0x1140, 0x1202, 0x1204, 0x0f81, 0x1240, 0x0fc0, 0x1242,
+    0x0f80, 0x1244, 0x1284, 0x0f82, 0x1286, 0x1288, 0x128a, 0x12c0,
+    0x1282, 0x1181, 0x1183, 0x1043, 0x1040, 0x11c1, 0x1041, 0x1141,
+    0x1203, 0x1205, 0x10c1, 0x1241, 0x1000, 0x1243, 0x10c0, 0x1245,
+    0x1285, 0x10c2, 0x1287, 0x1289, 0x128b, 0x12c1, 0x1283, 0x1080,
+    0x1100, 0x1101, 0x1200, 0x1201, 0x1280, 0x1281, 0x1340, 0x1341,
+    0x1343, 0x1342, 0x1344, 0x13c2, 0x1400, 0x13c0, 0x1440, 0x1480,
+    0x14c0, 0x1540, 0x1541, 0x1740, 0x1700, 0x1741, 0x17c0, 0x1800,
+    0x1802, 0x1801, 0x1840, 0x1880, 0x1900, 0x18c0, 0x18c1, 0x1901,
+    0x1940, 0x1942, 0x1941, 0x1980, 0x19c0, 0x19c2, 0x19c1, 0x1c80,
+    0x1cc0, 0x1dc0, 0x1f80, 0x2000, 0x2002, 0x2004, 0x2006, 0x2008,
+    0x2040, 0x2080, 0x2082, 0x20c0, 0x20c1, 0x2100, 0x22b8, 0x22b9,
+    0x2310, 0x2311, 0x231c, 0x231d, 0x244c, 0x2456, 0x244d, 0x2457,
+    0x248c, 0x248d, 0x249e, 0x249f, 0x2500, 0x2502, 0x2504, 0x2bc0,
+    0x2501, 0x2503, 0x2505, 0x2bc1, 0x2bc2, 0x2bc3, 0x2bc4, 0x2bc5,
+    0x2bc6, 0x2bc7, 0x2580, 0x2582, 0x2584, 0x2bc8, 0x2581, 0x2583,
+    0x2585, 0x2bc9, 0x2bca, 0x2bcb, 0x2bcc, 0x2bcd, 0x2bce, 0x2bcf,
+    0x2600, 0x2602, 0x2601, 0x2603, 0x2680, 0x2682, 0x2681, 0x2683,
+    0x26c2, 0x26c4, 0x26c6, 0x2c00, 0x26c3, 0x26c5, 0x26c7, 0x2c01,
+    0x2c02, 0x2c03, 0x2c04, 0x2c05, 0x2c06, 0x2c07, 0x26ca, 0x26cc,
+    0x26ce, 0x2c08, 0x26cb, 0x26cd, 0x26cf, 0x2c09, 0x2c0a, 0x2c0b,
+    0x2c0c, 0x2c0d, 0x2c0e, 0x2c0f, 0x26d2, 0x26d4, 0x26d6, 0x26d3,
+    0x26d5, 0x26d7, 0x26da, 0x26dc, 0x26de, 0x26db, 0x26dd, 0x26df,
+    0x2700, 0x2702, 0x2701, 0x2703, 0x2780, 0x2782, 0x2781, 0x2783,
+    0x2800, 0x2802, 0x2804, 0x2801, 0x2803, 0x2805, 0x2842, 0x2844,
+    0x2846, 0x2849, 0x284b, 0x284d, 0x2c40, 0x284a, 0x284c, 0x284e,
+    0x2c41, 0x2c42, 0x2c43, 0x2c44, 0x2c45, 0x2c46, 0x2c47, 0x2851,
+    0x2853, 0x2855, 0x2c48, 0x2852, 0x2854, 0x2856, 0x2c49, 0x2c4a,
+    0x2c4b, 0x2c4c, 0x2c4d, 0x2c4e, 0x2c4f, 0x2c82, 0x2e01, 0x3180,
+    0x2c87, 0x2f01, 0x2f02, 0x2f03, 0x2e06, 0x3185, 0x3000, 0x3001,
+    0x3002, 0x4640, 0x4641, 0x4680, 0x46c0, 0x46c2, 0x46c1, 0x4700,
+    0x4740, 0x4780, 0x47c0, 0x47c2, 0x4900, 0x4940, 0x4980, 0x4982,
+    0x4a00, 0x49c2, 0x4a03, 0x4a04, 0x4a40, 0x4a41, 0x4a80, 0x4a81,
+    0x4ac0, 0x4ac1, 0x4bc0, 0x4bc1, 0x4b00, 0x4b01, 0x4b40, 0x4b41,
+    0x4bc2, 0x4bc3, 0x4b80, 0x4b81, 0x4b82, 0x4b83, 0x4c00, 0x4c01,
+    0x4c02, 0x4c03, 0x5600, 0x5440, 0x5442, 0x5444, 0x5446, 0x5448,
+    0x544a, 0x544c, 0x544e, 0x5450, 0x5452, 0x5454, 0x5456, 0x5480,
+    0x5482, 0x5484, 0x54c0, 0x54c1, 0x5500, 0x5501, 0x5540, 0x5541,
+    0x5580, 0x5581, 0x55c0, 0x55c1, 0x5680, 0x58c0, 0x5700, 0x5702,
+    0x5704, 0x5706, 0x5708, 0x570a, 0x570c, 0x570e, 0x5710, 0x5712,
+    0x5714, 0x5716, 0x5740, 0x5742, 0x5744, 0x5780, 0x5781, 0x57c0,
+    0x57c1, 0x5800, 0x5801, 0x5840, 0x5841, 0x5880, 0x5881, 0x5900,
+    0x5901, 0x5902, 0x5903, 0x5940, 0x8e00, 0x8e02, 0x8e40, 0x8e80,
+    0x8e81, 0x8ec0, 0x8ec1, 0x8f01, 0x8f00, 0x8f03, 0x8f40, 0x8f41,
+};
+
+typedef enum {
+    UNICODE_GC_Cn,
+    UNICODE_GC_Lu,
+    UNICODE_GC_Ll,
+    UNICODE_GC_Lt,
+    UNICODE_GC_Lm,
+    UNICODE_GC_Lo,
+    UNICODE_GC_Mn,
+    UNICODE_GC_Mc,
+    UNICODE_GC_Me,
+    UNICODE_GC_Nd,
+    UNICODE_GC_Nl,
+    UNICODE_GC_No,
+    UNICODE_GC_Sm,
+    UNICODE_GC_Sc,
+    UNICODE_GC_Sk,
+    UNICODE_GC_So,
+    UNICODE_GC_Pc,
+    UNICODE_GC_Pd,
+    UNICODE_GC_Ps,
+    UNICODE_GC_Pe,
+    UNICODE_GC_Pi,
+    UNICODE_GC_Pf,
+    UNICODE_GC_Po,
+    UNICODE_GC_Zs,
+    UNICODE_GC_Zl,
+    UNICODE_GC_Zp,
+    UNICODE_GC_Cc,
+    UNICODE_GC_Cf,
+    UNICODE_GC_Cs,
+    UNICODE_GC_Co,
+    UNICODE_GC_LC,
+    UNICODE_GC_L,
+    UNICODE_GC_M,
+    UNICODE_GC_N,
+    UNICODE_GC_S,
+    UNICODE_GC_P,
+    UNICODE_GC_Z,
+    UNICODE_GC_C,
+    UNICODE_GC_COUNT,
+} UnicodeGCEnum;
+
+static const char unicode_gc_name_table[] =
+    "Cn,Unassigned"            "\0"
+    "Lu,Uppercase_Letter"      "\0"
+    "Ll,Lowercase_Letter"      "\0"
+    "Lt,Titlecase_Letter"      "\0"
+    "Lm,Modifier_Letter"       "\0"
+    "Lo,Other_Letter"          "\0"
+    "Mn,Nonspacing_Mark"       "\0"
+    "Mc,Spacing_Mark"          "\0"
+    "Me,Enclosing_Mark"        "\0"
+    "Nd,Decimal_Number,digit"  "\0"
+    "Nl,Letter_Number"         "\0"
+    "No,Other_Number"          "\0"
+    "Sm,Math_Symbol"           "\0"
+    "Sc,Currency_Symbol"       "\0"
+    "Sk,Modifier_Symbol"       "\0"
+    "So,Other_Symbol"          "\0"
+    "Pc,Connector_Punctuation" "\0"
+    "Pd,Dash_Punctuation"      "\0"
+    "Ps,Open_Punctuation"      "\0"
+    "Pe,Close_Punctuation"     "\0"
+    "Pi,Initial_Punctuation"   "\0"
+    "Pf,Final_Punctuation"     "\0"
+    "Po,Other_Punctuation"     "\0"
+    "Zs,Space_Separator"       "\0"
+    "Zl,Line_Separator"        "\0"
+    "Zp,Paragraph_Separator"   "\0"
+    "Cc,Control,cntrl"         "\0"
+    "Cf,Format"                "\0"
+    "Cs,Surrogate"             "\0"
+    "Co,Private_Use"           "\0"
+    "LC,Cased_Letter"          "\0"
+    "L,Letter"                 "\0"
+    "M,Mark,Combining_Mark"    "\0"
+    "N,Number"                 "\0"
+    "S,Symbol"                 "\0"
+    "P,Punctuation,punct"      "\0"
+    "Z,Separator"              "\0"
+    "C,Other"                  "\0"
+;
+
+static const uint8_t unicode_gc_table[3655] = {
+    0xfa, 0x18, 0x17, 0x56, 0x0d, 0x56, 0x12, 0x13,
+    0x16, 0x0c, 0x16, 0x11, 0x36, 0xe9, 0x02, 0x36,
+    0x4c, 0x36, 0xe1, 0x12, 0x12, 0x16, 0x13, 0x0e,
+    0x10, 0x0e, 0xe2, 0x12, 0x12, 0x0c, 0x13, 0x0c,
+    0xfa, 0x19, 0x17, 0x16, 0x6d, 0x0f, 0x16, 0x0e,
+    0x0f, 0x05, 0x14, 0x0c, 0x1b, 0x0f, 0x0e, 0x0f,
+    0x0c, 0x2b, 0x0e, 0x02, 0x36, 0x0e, 0x0b, 0x05,
+    0x15, 0x4b, 0x16, 0xe1, 0x0f, 0x0c, 0xc1, 0xe2,
+    0x10, 0x0c, 0xe2, 0x00, 0xff, 0x30, 0x02, 0xff,
+    0x08, 0x02, 0xff, 0x27, 0xbf, 0x22, 0x21, 0x02,
+    0x5f, 0x5f, 0x21, 0x22, 0x61, 0x02, 0x21, 0x02,
+    0x41, 0x42, 0x21, 0x02, 0x21, 0x02, 0x9f, 0x7f,
+    0x02, 0x5f, 0x5f, 0x21, 0x02, 0x5f, 0x3f, 0x02,
+    0x05, 0x3f, 0x22, 0x65, 0x01, 0x03, 0x02, 0x01,
+    0x03, 0x02, 0x01, 0x03, 0x02, 0xff, 0x08, 0x02,
+    0xff, 0x0a, 0x02, 0x01, 0x03, 0x02, 0x5f, 0x21,
+    0x02, 0xff, 0x32, 0xa2, 0x21, 0x02, 0x21, 0x22,
+    0x5f, 0x41, 0x02, 0xff, 0x00, 0xe2, 0x3c, 0x05,
+    0xe2, 0x13, 0xe4, 0x0a, 0x6e, 0xe4, 0x04, 0xee,
+    0x06, 0x84, 0xce, 0x04, 0x0e, 0x04, 0xee, 0x09,
+    0xe6, 0x68, 0x7f, 0x04, 0x0e, 0x3f, 0x20, 0x04,
+    0x42, 0x16, 0x01, 0x60, 0x2e, 0x01, 0x16, 0x41,
+    0x00, 0x01, 0x00, 0x21, 0x02, 0xe1, 0x09, 0x00,
+    0xe1, 0x01, 0xe2, 0x1b, 0x3f, 0x02, 0x41, 0x42,
+    0xff, 0x10, 0x62, 0x3f, 0x0c, 0x5f, 0x3f, 0x02,
+    0xe1, 0x2b, 0xe2, 0x28, 0xff, 0x1a, 0x0f, 0x86,
+    0x28, 0xff, 0x2f, 0xff, 0x06, 0x02, 0xff, 0x58,
+    0x00, 0xe1, 0x1e, 0x20, 0x04, 0xb6, 0xe2, 0x21,
+    0x16, 0x11, 0x20, 0x2f, 0x0d, 0x00, 0xe6, 0x25,
+    0x11, 0x06, 0x16, 0x26, 0x16, 0x26, 0x16, 0x06,
+    0xe0, 0x00, 0xe5, 0x13, 0x60, 0x65, 0x36, 0xe0,
+    0x03, 0xbb, 0x4c, 0x36, 0x0d, 0x36, 0x2f, 0xe6,
+    0x03, 0x16, 0x1b, 0x00, 0x36, 0xe5, 0x18, 0x04,
+    0xe5, 0x02, 0xe6, 0x0d, 0xe9, 0x02, 0x76, 0x25,
+    0x06, 0xe5, 0x5b, 0x16, 0x05, 0xc6, 0x1b, 0x0f,
+    0xa6, 0x24, 0x26, 0x0f, 0x66, 0x25, 0xe9, 0x02,
+    0x45, 0x2f, 0x05, 0xf6, 0x06, 0x00, 0x1b, 0x05,
+    0x06, 0xe5, 0x16, 0xe6, 0x13, 0x20, 0xe5, 0x51,
+    0xe6, 0x03, 0x05, 0xe0, 0x06, 0xe9, 0x02, 0xe5,
+    0x19, 0xe6, 0x01, 0x24, 0x0f, 0x56, 0x04, 0x20,
+    0x06, 0x2d, 0xe5, 0x0e, 0x66, 0x04, 0xe6, 0x01,
+    0x04, 0x46, 0x04, 0x86, 0x20, 0xf6, 0x07, 0x00,
+    0xe5, 0x11, 0x46, 0x20, 0x16, 0x00, 0xe5, 0x03,
+    0xe0, 0x2d, 0xe5, 0x0d, 0x00, 0xe5, 0x00, 0xe0,
+    0x0d, 0xe6, 0x07, 0x1b, 0xe6, 0x18, 0x07, 0xe5,
+    0x2e, 0x06, 0x07, 0x06, 0x05, 0x47, 0xe6, 0x00,
+    0x67, 0x06, 0x27, 0x05, 0xc6, 0xe5, 0x02, 0x26,
+    0x36, 0xe9, 0x02, 0x16, 0x04, 0xe5, 0x07, 0x06,
+    0x27, 0x00, 0xe5, 0x00, 0x20, 0x25, 0x20, 0xe5,
+    0x0e, 0x00, 0xc5, 0x00, 0x05, 0x40, 0x65, 0x20,
+    0x06, 0x05, 0x47, 0x66, 0x20, 0x27, 0x20, 0x27,
+    0x06, 0x05, 0xe0, 0x00, 0x07, 0x60, 0x25, 0x00,
+    0x45, 0x26, 0x20, 0xe9, 0x02, 0x25, 0x2d, 0xab,
+    0x0f, 0x0d, 0x05, 0x16, 0x06, 0x20, 0x26, 0x07,
+    0x00, 0xa5, 0x60, 0x25, 0x20, 0xe5, 0x0e, 0x00,
+    0xc5, 0x00, 0x25, 0x00, 0x25, 0x00, 0x25, 0x20,
+    0x06, 0x00, 0x47, 0x26, 0x60, 0x26, 0x20, 0x46,
+    0x40, 0x06, 0xc0, 0x65, 0x00, 0x05, 0xc0, 0xe9,
+    0x02, 0x26, 0x45, 0x06, 0x16, 0xe0, 0x02, 0x26,
+    0x07, 0x00, 0xe5, 0x01, 0x00, 0x45, 0x00, 0xe5,
+    0x0e, 0x00, 0xc5, 0x00, 0x25, 0x00, 0x85, 0x20,
+    0x06, 0x05, 0x47, 0x86, 0x00, 0x26, 0x07, 0x00,
+    0x27, 0x06, 0x20, 0x05, 0xe0, 0x07, 0x25, 0x26,
+    0x20, 0xe9, 0x02, 0x16, 0x0d, 0xc0, 0x05, 0xa6,
+    0x00, 0x06, 0x27, 0x00, 0xe5, 0x00, 0x20, 0x25,
+    0x20, 0xe5, 0x0e, 0x00, 0xc5, 0x00, 0x25, 0x00,
+    0x85, 0x20, 0x06, 0x05, 0x07, 0x06, 0x07, 0x66,
+    0x20, 0x27, 0x20, 0x27, 0x06, 0xe0, 0x00, 0x06,
+    0x07, 0x60, 0x25, 0x00, 0x45, 0x26, 0x20, 0xe9,
+    0x02, 0x0f, 0x05, 0xab, 0xe0, 0x02, 0x06, 0x05,
+    0x00, 0xa5, 0x40, 0x45, 0x00, 0x65, 0x40, 0x25,
+    0x00, 0x05, 0x00, 0x25, 0x40, 0x25, 0x40, 0x45,
+    0x40, 0xe5, 0x04, 0x60, 0x27, 0x06, 0x27, 0x40,
+    0x47, 0x00, 0x47, 0x06, 0x20, 0x05, 0xa0, 0x07,
+    0xe0, 0x06, 0xe9, 0x02, 0x4b, 0xaf, 0x0d, 0x0f,
+    0x80, 0x06, 0x47, 0x06, 0xe5, 0x00, 0x00, 0x45,
+    0x00, 0xe5, 0x0f, 0x00, 0xe5, 0x08, 0x40, 0x05,
+    0x46, 0x67, 0x00, 0x46, 0x00, 0x66, 0xc0, 0x26,
+    0x00, 0x45, 0x80, 0x25, 0x26, 0x20, 0xe9, 0x02,
+    0xe0, 0x00, 0xcb, 0x0f, 0x05, 0x06, 0x27, 0x16,
+    0xe5, 0x00, 0x00, 0x45, 0x00, 0xe5, 0x0f, 0x00,
+    0xe5, 0x02, 0x00, 0x85, 0x20, 0x06, 0x05, 0x07,
+    0x06, 0x87, 0x00, 0x06, 0x27, 0x00, 0x27, 0x26,
+    0xc0, 0x27, 0xc0, 0x05, 0x00, 0x25, 0x26, 0x20,
+    0xe9, 0x02, 0x00, 0x25, 0xe0, 0x05, 0x26, 0x27,
+    0x00, 0xe5, 0x00, 0x00, 0x45, 0x00, 0xe5, 0x21,
+    0x26, 0x05, 0x47, 0x66, 0x00, 0x47, 0x00, 0x47,
+    0x06, 0x05, 0x0f, 0x60, 0x45, 0x07, 0xcb, 0x45,
+    0x26, 0x20, 0xe9, 0x02, 0xeb, 0x01, 0x0f, 0xa5,
+    0x20, 0x27, 0x00, 0xe5, 0x0a, 0x40, 0xe5, 0x10,
+    0x00, 0xe5, 0x01, 0x00, 0x05, 0x20, 0xc5, 0x40,
+    0x06, 0x60, 0x47, 0x46, 0x00, 0x06, 0x00, 0xe7,
+    0x00, 0xa0, 0xe9, 0x02, 0x20, 0x27, 0x16, 0xe0,
+    0x04, 0xe5, 0x28, 0x06, 0x25, 0xc6, 0x60, 0x0d,
+    0xa5, 0x04, 0xe6, 0x00, 0x16, 0xe9, 0x02, 0x36,
+    0xe0, 0x1d, 0x25, 0x00, 0x05, 0x20, 0x25, 0x00,
+    0x05, 0x20, 0x05, 0xa0, 0x65, 0x00, 0xc5, 0x00,
+    0x45, 0x00, 0x05, 0x00, 0x05, 0x20, 0x25, 0x00,
+    0x65, 0x06, 0x25, 0xa6, 0x00, 0x26, 0x05, 0x20,
+    0x85, 0x00, 0x04, 0x00, 0xa6, 0x20, 0xe9, 0x02,
+    0x20, 0x65, 0xe0, 0x18, 0x05, 0x4f, 0xf6, 0x07,
+    0x0f, 0x16, 0x4f, 0x26, 0xaf, 0xe9, 0x02, 0xeb,
+    0x02, 0x0f, 0x06, 0x0f, 0x06, 0x0f, 0x06, 0x12,
+    0x13, 0x12, 0x13, 0x27, 0xe5, 0x00, 0x00, 0xe5,
+    0x1c, 0x60, 0xe6, 0x06, 0x07, 0x86, 0x16, 0x26,
+    0x85, 0xe6, 0x03, 0x00, 0xe6, 0x1c, 0x00, 0xef,
+    0x00, 0x06, 0xaf, 0x00, 0x2f, 0x96, 0x6f, 0x36,
+    0xe0, 0x1d, 0xe5, 0x23, 0x27, 0x66, 0x07, 0xa6,
+    0x07, 0x26, 0x27, 0x26, 0x05, 0xe9, 0x02, 0xb6,
+    0xa5, 0x27, 0x26, 0x65, 0x46, 0x05, 0x47, 0x25,
+    0xc7, 0x45, 0x66, 0xe5, 0x05, 0x06, 0x27, 0x26,
+    0xa7, 0x06, 0x05, 0x07, 0xe9, 0x02, 0x47, 0x06,
+    0x2f, 0xe1, 0x1e, 0x00, 0x01, 0x80, 0x01, 0x20,
+    0xe2, 0x23, 0x16, 0x04, 0x42, 0xe5, 0x80, 0xc1,
+    0x00, 0x65, 0x20, 0xc5, 0x00, 0x05, 0x00, 0x65,
+    0x20, 0xe5, 0x21, 0x00, 0x65, 0x20, 0xe5, 0x19,
+    0x00, 0x65, 0x20, 0xc5, 0x00, 0x05, 0x00, 0x65,
+    0x20, 0xe5, 0x07, 0x00, 0xe5, 0x31, 0x00, 0x65,
+    0x20, 0xe5, 0x3b, 0x20, 0x46, 0xf6, 0x01, 0xeb,
+    0x0c, 0x40, 0xe5, 0x08, 0xef, 0x02, 0xa0, 0xe1,
+    0x4e, 0x20, 0xa2, 0x20, 0x11, 0xe5, 0x81, 0xe4,
+    0x36, 0xe5, 0x09, 0x17, 0xe5, 0x12, 0x12, 0x13,
+    0x40, 0xe5, 0x43, 0x56, 0x4a, 0xe5, 0x00, 0xc0,
+    0xe5, 0x05, 0x00, 0x65, 0x46, 0xe0, 0x03, 0xe5,
+    0x0a, 0x46, 0x36, 0xe0, 0x01, 0xe5, 0x0a, 0x26,
+    0xe0, 0x04, 0xe5, 0x05, 0x00, 0x45, 0x00, 0x26,
+    0xe0, 0x04, 0xe5, 0x2c, 0x26, 0x07, 0xc6, 0xe7,
+    0x00, 0x06, 0x27, 0xe6, 0x03, 0x56, 0x04, 0x56,
+    0x0d, 0x05, 0x06, 0x20, 0xe9, 0x02, 0xa0, 0xeb,
+    0x02, 0xa0, 0xb6, 0x11, 0x76, 0x46, 0x1b, 0x00,
+    0xe9, 0x02, 0xa0, 0xe5, 0x1b, 0x04, 0xe5, 0x2d,
+    0xc0, 0x85, 0x26, 0xe5, 0x1a, 0x06, 0x05, 0x80,
+    0xe5, 0x3e, 0xe0, 0x02, 0xe5, 0x17, 0x00, 0x46,
+    0x67, 0x26, 0x47, 0x60, 0x27, 0x06, 0xa7, 0x46,
+    0x60, 0x0f, 0x40, 0x36, 0xe9, 0x02, 0xe5, 0x16,
+    0x20, 0x85, 0xe0, 0x03, 0xe5, 0x24, 0x60, 0xe5,
+    0x12, 0xa0, 0xe9, 0x02, 0x0b, 0x40, 0xef, 0x1a,
+    0xe5, 0x0f, 0x26, 0x27, 0x06, 0x20, 0x36, 0xe5,
+    0x2d, 0x07, 0x06, 0x07, 0xc6, 0x00, 0x06, 0x07,
+    0x06, 0x27, 0xe6, 0x00, 0xa7, 0xe6, 0x02, 0x20,
+    0x06, 0xe9, 0x02, 0xa0, 0xe9, 0x02, 0xa0, 0xd6,
+    0x04, 0xb6, 0x20, 0xe6, 0x06, 0x08, 0xe0, 0x39,
+    0x66, 0x07, 0xe5, 0x27, 0x06, 0x07, 0x86, 0x07,
+    0x06, 0x87, 0x06, 0x27, 0xc5, 0x60, 0xe9, 0x02,
+    0xd6, 0xef, 0x02, 0xe6, 0x01, 0xef, 0x01, 0x40,
+    0x26, 0x07, 0xe5, 0x16, 0x07, 0x66, 0x27, 0x26,
+    0x07, 0x46, 0x25, 0xe9, 0x02, 0xe5, 0x24, 0x06,
+    0x07, 0x26, 0x47, 0x06, 0x07, 0x46, 0x27, 0xe0,
+    0x00, 0x76, 0xe5, 0x1c, 0xe7, 0x00, 0xe6, 0x00,
+    0x27, 0x26, 0x40, 0x96, 0xe9, 0x02, 0x40, 0x45,
+    0xe9, 0x02, 0xe5, 0x16, 0xa4, 0x36, 0xe2, 0x01,
+    0xc0, 0xe1, 0x23, 0x20, 0x41, 0xf6, 0x00, 0xe0,
+    0x00, 0x46, 0x16, 0xe6, 0x05, 0x07, 0xc6, 0x65,
+    0x06, 0x65, 0x27, 0x06, 0x25, 0x07, 0x26, 0xa0,
+    0xe2, 0x24, 0xe4, 0x37, 0xe2, 0x05, 0x04, 0xe2,
+    0x1a, 0xe4, 0x1d, 0xe6, 0x32, 0x00, 0x86, 0xff,
+    0x80, 0x0e, 0xe2, 0x00, 0xff, 0x5a, 0xe2, 0x00,
+    0xe1, 0x00, 0xa2, 0x20, 0xa1, 0x20, 0xe2, 0x00,
+    0xe1, 0x00, 0xe2, 0x00, 0xe1, 0x00, 0xa2, 0x20,
+    0xa1, 0x20, 0xe2, 0x00, 0x00, 0x01, 0x00, 0x01,
+    0x00, 0x01, 0x00, 0x3f, 0xc2, 0xe1, 0x00, 0xe2,
+    0x06, 0x20, 0xe2, 0x00, 0xe3, 0x00, 0xe2, 0x00,
+    0xe3, 0x00, 0xe2, 0x00, 0xe3, 0x00, 0x82, 0x00,
+    0x22, 0x61, 0x03, 0x0e, 0x02, 0x4e, 0x42, 0x00,
+    0x22, 0x61, 0x03, 0x4e, 0x62, 0x20, 0x22, 0x61,
+    0x00, 0x4e, 0xe2, 0x00, 0x81, 0x4e, 0x20, 0x42,
+    0x00, 0x22, 0x61, 0x03, 0x2e, 0x00, 0xf7, 0x03,
+    0x9b, 0xb1, 0x36, 0x14, 0x15, 0x12, 0x34, 0x15,
+    0x12, 0x14, 0xf6, 0x00, 0x18, 0x19, 0x9b, 0x17,
+    0xf6, 0x01, 0x14, 0x15, 0x76, 0x30, 0x56, 0x0c,
+    0x12, 0x13, 0xf6, 0x03, 0x0c, 0x16, 0x10, 0xf6,
+    0x02, 0x17, 0x9b, 0x00, 0xfb, 0x02, 0x0b, 0x04,
+    0x20, 0xab, 0x4c, 0x12, 0x13, 0x04, 0xeb, 0x02,
+    0x4c, 0x12, 0x13, 0x00, 0xe4, 0x05, 0x40, 0xed,
+    0x18, 0xe0, 0x08, 0xe6, 0x05, 0x68, 0x06, 0x48,
+    0xe6, 0x04, 0xe0, 0x07, 0x2f, 0x01, 0x6f, 0x01,
+    0x2f, 0x02, 0x41, 0x22, 0x41, 0x02, 0x0f, 0x01,
+    0x2f, 0x0c, 0x81, 0xaf, 0x01, 0x0f, 0x01, 0x0f,
+    0x01, 0x0f, 0x61, 0x0f, 0x02, 0x61, 0x02, 0x65,
+    0x02, 0x2f, 0x22, 0x21, 0x8c, 0x3f, 0x42, 0x0f,
+    0x0c, 0x2f, 0x02, 0x0f, 0xeb, 0x08, 0xea, 0x1b,
+    0x3f, 0x6a, 0x0b, 0x2f, 0x60, 0x8c, 0x8f, 0x2c,
+    0x6f, 0x0c, 0x2f, 0x0c, 0x2f, 0x0c, 0xcf, 0x0c,
+    0xef, 0x17, 0x2c, 0x2f, 0x0c, 0x0f, 0x0c, 0xef,
+    0x17, 0xec, 0x80, 0x84, 0xef, 0x00, 0x12, 0x13,
+    0x12, 0x13, 0xef, 0x0c, 0x2c, 0xcf, 0x12, 0x13,
+    0xef, 0x49, 0x0c, 0xef, 0x16, 0xec, 0x11, 0xef,
+    0x20, 0xac, 0xef, 0x3d, 0xe0, 0x11, 0xef, 0x03,
+    0xe0, 0x0d, 0xeb, 0x34, 0xef, 0x46, 0xeb, 0x0e,
+    0xef, 0x80, 0x2f, 0x0c, 0xef, 0x01, 0x0c, 0xef,
+    0x2e, 0xec, 0x00, 0xef, 0x67, 0x0c, 0xef, 0x80,
+    0x70, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0x12,
+    0x13, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0xeb,
+    0x16, 0xef, 0x24, 0x8c, 0x12, 0x13, 0xec, 0x17,
+    0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13,
+    0x12, 0x13, 0xec, 0x08, 0xef, 0x80, 0x78, 0xec,
+    0x7b, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0x12,
+    0x13, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0x12,
+    0x13, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0xec,
+    0x37, 0x12, 0x13, 0x12, 0x13, 0xec, 0x18, 0x12,
+    0x13, 0xec, 0x80, 0x7a, 0xef, 0x28, 0xec, 0x0d,
+    0x2f, 0xac, 0xef, 0x1f, 0x20, 0xef, 0x18, 0x20,
+    0xef, 0x29, 0x00, 0xef, 0x2d, 0x00, 0xe1, 0x27,
+    0x00, 0xe2, 0x27, 0x00, 0x5f, 0x21, 0x22, 0xdf,
+    0x41, 0x02, 0x3f, 0x02, 0x3f, 0x82, 0x24, 0x41,
+    0x02, 0xff, 0x5a, 0x02, 0xaf, 0x7f, 0x46, 0x3f,
+    0x80, 0x76, 0x0b, 0x36, 0xe2, 0x1e, 0x00, 0x02,
+    0x80, 0x02, 0x20, 0xe5, 0x30, 0xc0, 0x04, 0x16,
+    0xe0, 0x06, 0x06, 0xe5, 0x0f, 0xe0, 0x01, 0xc5,
+    0x00, 0xc5, 0x00, 0xc5, 0x00, 0xc5, 0x00, 0xc5,
+    0x00, 0xc5, 0x00, 0xc5, 0x00, 0xc5, 0x00, 0xe6,
+    0x18, 0x36, 0x14, 0x15, 0x14, 0x15, 0x56, 0x14,
+    0x15, 0x16, 0x14, 0x15, 0xf6, 0x01, 0x11, 0x36,
+    0x11, 0x16, 0x14, 0x15, 0x36, 0x14, 0x15, 0x12,
+    0x13, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0x96,
+    0x04, 0xf6, 0x02, 0x31, 0x76, 0x11, 0x16, 0x12,
+    0xf6, 0x04, 0xe0, 0x29, 0xef, 0x12, 0x00, 0xef,
+    0x51, 0xe0, 0x04, 0xef, 0x80, 0x4e, 0xe0, 0x12,
+    0xef, 0x04, 0x60, 0x17, 0x56, 0x0f, 0x04, 0x05,
+    0x0a, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0x12,
+    0x13, 0x12, 0x13, 0x2f, 0x12, 0x13, 0x12, 0x13,
+    0x12, 0x13, 0x12, 0x13, 0x11, 0x12, 0x33, 0x0f,
+    0xea, 0x01, 0x66, 0x27, 0x11, 0x84, 0x2f, 0x4a,
+    0x04, 0x05, 0x16, 0x2f, 0x00, 0xe5, 0x4e, 0x20,
+    0x26, 0x2e, 0x24, 0x05, 0x11, 0xe5, 0x52, 0x16,
+    0x44, 0x05, 0x80, 0xe5, 0x23, 0x00, 0xe5, 0x56,
+    0x00, 0x2f, 0x6b, 0xef, 0x02, 0xe5, 0x13, 0x80,
+    0xef, 0x1c, 0xe0, 0x04, 0xe5, 0x08, 0xef, 0x17,
+    0x00, 0xeb, 0x02, 0xef, 0x16, 0xeb, 0x00, 0x0f,
+    0xeb, 0x07, 0xef, 0x18, 0xeb, 0x02, 0xef, 0x1f,
+    0xeb, 0x07, 0xef, 0x37, 0x00, 0xef, 0x80, 0x78,
+    0xe5, 0x99, 0x2e, 0xe0, 0x02, 0xef, 0x38, 0xe5,
+    0xc0, 0x11, 0x68, 0xe0, 0x08, 0xe5, 0x0d, 0x04,
+    0xe5, 0x83, 0xef, 0x40, 0xef, 0x2f, 0xe0, 0x01,
+    0xe5, 0x20, 0xa4, 0x36, 0xe5, 0x80, 0x84, 0x04,
+    0x56, 0xe5, 0x08, 0xe9, 0x02, 0x25, 0xe0, 0x0c,
+    0xff, 0x26, 0x05, 0x06, 0x48, 0x16, 0xe6, 0x02,
+    0x16, 0x04, 0xff, 0x14, 0x24, 0x26, 0xe5, 0x3e,
+    0xea, 0x02, 0x26, 0xb6, 0xe0, 0x00, 0xee, 0x0f,
+    0xe4, 0x01, 0x2e, 0xff, 0x06, 0x22, 0xff, 0x36,
+    0x04, 0xe2, 0x00, 0x9f, 0xff, 0x02, 0x04, 0x2e,
+    0x7f, 0x05, 0x7f, 0x22, 0xff, 0x0d, 0x61, 0x02,
+    0x81, 0x02, 0x7f, 0xe0, 0x35, 0x05, 0x24, 0x02,
+    0xc5, 0x06, 0x45, 0x06, 0x65, 0x06, 0xe5, 0x0f,
+    0x27, 0x26, 0x07, 0x6f, 0x60, 0xab, 0x2f, 0x0d,
+    0x0f, 0xa0, 0xe5, 0x2c, 0x76, 0xe0, 0x00, 0x27,
+    0xe5, 0x2a, 0xe7, 0x08, 0x26, 0xe0, 0x00, 0x36,
+    0xe9, 0x02, 0xa0, 0xe6, 0x0a, 0xa5, 0x56, 0x05,
+    0x16, 0x25, 0x06, 0xe9, 0x02, 0xe5, 0x14, 0xe6,
+    0x00, 0x36, 0xe5, 0x0f, 0xe6, 0x03, 0x27, 0xe0,
+    0x03, 0x16, 0xe5, 0x15, 0x40, 0x46, 0x07, 0xe5,
+    0x27, 0x06, 0x27, 0x66, 0x27, 0x06, 0x67, 0xf6,
+    0x05, 0x00, 0x04, 0xe9, 0x02, 0x60, 0x36, 0x85,
+    0x06, 0x04, 0xe5, 0x01, 0xe9, 0x02, 0x85, 0x00,
+    0xe5, 0x21, 0xa6, 0x27, 0x26, 0x27, 0x26, 0xe0,
+    0x01, 0x45, 0x06, 0xe5, 0x00, 0x06, 0x07, 0x20,
+    0xe9, 0x02, 0x20, 0x76, 0xe5, 0x08, 0x04, 0xa5,
+    0x4f, 0x05, 0x07, 0x06, 0x07, 0xe5, 0x2a, 0x06,
+    0x05, 0x46, 0x25, 0x26, 0x85, 0x26, 0x05, 0x06,
+    0x05, 0xe0, 0x10, 0x25, 0x04, 0x36, 0xe5, 0x03,
+    0x07, 0x26, 0x27, 0x36, 0x05, 0x24, 0x07, 0x06,
+    0xe0, 0x02, 0xa5, 0x20, 0xa5, 0x20, 0xa5, 0xe0,
+    0x01, 0xc5, 0x00, 0xc5, 0x00, 0xe2, 0x23, 0x0e,
+    0x64, 0xa2, 0xe0, 0x02, 0xe2, 0x48, 0xe5, 0x1b,
+    0x27, 0x06, 0x27, 0x06, 0x27, 0x16, 0x07, 0x06,
+    0x20, 0xe9, 0x02, 0xa0, 0xe5, 0xab, 0x1c, 0xe0,
+    0x04, 0xe5, 0x0f, 0x60, 0xe5, 0x29, 0x60, 0xfc,
+    0x87, 0x78, 0xfd, 0x98, 0x78, 0xe5, 0x80, 0xe6,
+    0x20, 0xe5, 0x62, 0xe0, 0x1e, 0xc2, 0xe0, 0x04,
+    0x82, 0x80, 0x05, 0x06, 0xe5, 0x02, 0x0c, 0xe5,
+    0x05, 0x00, 0x85, 0x00, 0x05, 0x00, 0x25, 0x00,
+    0x25, 0x00, 0xe5, 0x64, 0xee, 0x08, 0xe0, 0x09,
+    0xe5, 0x80, 0xe3, 0x13, 0x12, 0xe0, 0x08, 0xe5,
+    0x38, 0x20, 0xe5, 0x2e, 0xe0, 0x20, 0xe5, 0x04,
+    0x0d, 0x0f, 0x20, 0xe6, 0x08, 0xd6, 0x12, 0x13,
+    0x16, 0xa0, 0xe6, 0x08, 0x16, 0x31, 0x30, 0x12,
+    0x13, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0x12,
+    0x13, 0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0x36,
+    0x12, 0x13, 0x76, 0x50, 0x56, 0x00, 0x76, 0x11,
+    0x12, 0x13, 0x12, 0x13, 0x12, 0x13, 0x56, 0x0c,
+    0x11, 0x4c, 0x00, 0x16, 0x0d, 0x36, 0x60, 0x85,
+    0x00, 0xe5, 0x7f, 0x20, 0x1b, 0x00, 0x56, 0x0d,
+    0x56, 0x12, 0x13, 0x16, 0x0c, 0x16, 0x11, 0x36,
+    0xe9, 0x02, 0x36, 0x4c, 0x36, 0xe1, 0x12, 0x12,
+    0x16, 0x13, 0x0e, 0x10, 0x0e, 0xe2, 0x12, 0x12,
+    0x0c, 0x13, 0x0c, 0x12, 0x13, 0x16, 0x12, 0x13,
+    0x36, 0xe5, 0x02, 0x04, 0xe5, 0x25, 0x24, 0xe5,
+    0x17, 0x40, 0xa5, 0x20, 0xa5, 0x20, 0xa5, 0x20,
+    0x45, 0x40, 0x2d, 0x0c, 0x0e, 0x0f, 0x2d, 0x00,
+    0x0f, 0x6c, 0x2f, 0xe0, 0x02, 0x5b, 0x2f, 0x20,
+    0xe5, 0x04, 0x00, 0xe5, 0x12, 0x00, 0xe5, 0x0b,
+    0x00, 0x25, 0x00, 0xe5, 0x07, 0x20, 0xe5, 0x06,
+    0xe0, 0x1a, 0xe5, 0x73, 0x80, 0x56, 0x60, 0xeb,
+    0x25, 0x40, 0xef, 0x01, 0xea, 0x2d, 0x6b, 0xef,
+    0x09, 0x2b, 0x4f, 0x00, 0xef, 0x04, 0x60, 0x0f,
+    0xe0, 0x27, 0xef, 0x25, 0x06, 0xe0, 0x7a, 0xe5,
+    0x15, 0x40, 0xe5, 0x29, 0xe0, 0x07, 0x06, 0xeb,
+    0x13, 0x60, 0xe5, 0x18, 0x6b, 0xe0, 0x01, 0xe5,
+    0x0c, 0x0a, 0xe5, 0x00, 0x0a, 0x80, 0xe5, 0x1e,
+    0x86, 0x80, 0xe5, 0x16, 0x00, 0x16, 0xe5, 0x1c,
+    0x60, 0xe5, 0x00, 0x16, 0x8a, 0xe0, 0x22, 0xe1,
+    0x20, 0xe2, 0x20, 0xe5, 0x46, 0x20, 0xe9, 0x02,
+    0xa0, 0xe1, 0x1c, 0x60, 0xe2, 0x1c, 0x60, 0xe5,
+    0x20, 0xe0, 0x00, 0xe5, 0x2c, 0xe0, 0x03, 0x16,
+    0xe0, 0x80, 0x08, 0xe5, 0x80, 0xaf, 0xe0, 0x01,
+    0xe5, 0x0e, 0xe0, 0x02, 0xe5, 0x00, 0xe0, 0x80,
+    0x10, 0xa5, 0x20, 0x05, 0x00, 0xe5, 0x24, 0x00,
+    0x25, 0x40, 0x05, 0x20, 0xe5, 0x0f, 0x00, 0x16,
+    0xeb, 0x00, 0xe5, 0x0f, 0x2f, 0xcb, 0xe5, 0x17,
+    0xe0, 0x00, 0xeb, 0x01, 0xe0, 0x28, 0xe5, 0x0b,
+    0x00, 0x25, 0x80, 0x8b, 0xe5, 0x0e, 0xab, 0x40,
+    0x16, 0xe5, 0x12, 0x80, 0x16, 0xe0, 0x38, 0xe5,
+    0x30, 0x60, 0x2b, 0x25, 0xeb, 0x08, 0x20, 0xeb,
+    0x26, 0x05, 0x46, 0x00, 0x26, 0x80, 0x66, 0x65,
+    0x00, 0x45, 0x00, 0xe5, 0x15, 0x20, 0x46, 0x60,
+    0x06, 0xeb, 0x01, 0xc0, 0xf6, 0x01, 0xc0, 0xe5,
+    0x15, 0x2b, 0x16, 0xe5, 0x15, 0x4b, 0xe0, 0x18,
+    0xe5, 0x00, 0x0f, 0xe5, 0x14, 0x26, 0x60, 0x8b,
+    0xd6, 0xe0, 0x01, 0xe5, 0x2e, 0x40, 0xd6, 0xe5,
+    0x0e, 0x20, 0xeb, 0x00, 0xe5, 0x0b, 0x80, 0xeb,
+    0x00, 0xe5, 0x0a, 0xc0, 0x76, 0xe0, 0x04, 0xcb,
+    0xe0, 0x48, 0xe5, 0x41, 0xe0, 0x2f, 0xe1, 0x2b,
+    0xe0, 0x05, 0xe2, 0x2b, 0xc0, 0xab, 0xe5, 0x1c,
+    0x66, 0xe0, 0x00, 0xe9, 0x02, 0xe0, 0x80, 0x9e,
+    0xeb, 0x17, 0xe0, 0x79, 0xe5, 0x15, 0xeb, 0x02,
+    0x05, 0xe0, 0x00, 0xe5, 0x0e, 0xe6, 0x03, 0x6b,
+    0x96, 0xe0, 0x80, 0x1e, 0x07, 0x06, 0x07, 0xe5,
+    0x2d, 0xe6, 0x07, 0xd6, 0x60, 0xeb, 0x0c, 0xe9,
+    0x02, 0xe0, 0x07, 0x46, 0x07, 0xe5, 0x25, 0x47,
+    0x66, 0x27, 0x26, 0x36, 0x1b, 0x76, 0xe0, 0x03,
+    0x1b, 0x20, 0xe5, 0x11, 0xc0, 0xe9, 0x02, 0xa0,
+    0x46, 0xe5, 0x1c, 0x86, 0x07, 0xe6, 0x00, 0x00,
+    0xe9, 0x02, 0x76, 0x05, 0x27, 0xe0, 0x01, 0xe5,
+    0x1b, 0x06, 0x36, 0x05, 0xe0, 0x01, 0x26, 0x07,
+    0xe5, 0x28, 0x47, 0xe6, 0x01, 0x27, 0x65, 0x76,
+    0x66, 0x16, 0x20, 0xe9, 0x02, 0x05, 0x16, 0x05,
+    0x56, 0x00, 0xeb, 0x0c, 0xe0, 0x03, 0xe5, 0x0a,
+    0x00, 0xe5, 0x11, 0x47, 0x46, 0x27, 0x06, 0x07,
+    0x26, 0xb6, 0x06, 0xe0, 0x39, 0xc5, 0x00, 0x05,
+    0x00, 0x65, 0x00, 0xe5, 0x07, 0x00, 0xe5, 0x02,
+    0x16, 0xa0, 0xe5, 0x27, 0x06, 0x47, 0xe6, 0x00,
+    0x80, 0xe9, 0x02, 0xa0, 0x26, 0x27, 0x00, 0xe5,
+    0x00, 0x20, 0x25, 0x20, 0xe5, 0x0e, 0x00, 0xc5,
+    0x00, 0x25, 0x00, 0x85, 0x00, 0x26, 0x05, 0x27,
+    0x06, 0x67, 0x20, 0x27, 0x20, 0x47, 0x20, 0x05,
+    0xa0, 0x07, 0x80, 0x85, 0x27, 0x20, 0xc6, 0x40,
+    0x86, 0xe0, 0x80, 0x03, 0xe5, 0x2d, 0x47, 0xe6,
+    0x00, 0x27, 0x46, 0x07, 0x06, 0x65, 0x96, 0xe9,
+    0x02, 0x00, 0x16, 0x00, 0x16, 0x06, 0xe0, 0x19,
+    0xe5, 0x28, 0x47, 0xa6, 0x07, 0x06, 0x67, 0x26,
+    0x07, 0x26, 0x25, 0x16, 0x05, 0xe0, 0x00, 0xe9,
+    0x02, 0xe0, 0x80, 0x1e, 0xe5, 0x27, 0x47, 0x66,
+    0x20, 0x67, 0x26, 0x07, 0x26, 0xf6, 0x0f, 0x65,
+    0x26, 0xe0, 0x1a, 0xe5, 0x28, 0x47, 0xe6, 0x00,
+    0x27, 0x06, 0x07, 0x26, 0x56, 0x05, 0xe0, 0x03,
+    0xe9, 0x02, 0xa0, 0xf6, 0x05, 0xe0, 0x0b, 0xe5,
+    0x23, 0x06, 0x07, 0x06, 0x27, 0xa6, 0x07, 0x06,
+    0xe0, 0x00, 0xe9, 0x02, 0xe0, 0x2e, 0xe5, 0x13,
+    0x20, 0x46, 0x27, 0x66, 0x07, 0x86, 0x60, 0xe9,
+    0x02, 0x2b, 0x56, 0x0f, 0xe0, 0x80, 0x38, 0xe5,
+    0x24, 0x47, 0xe6, 0x01, 0x07, 0x26, 0x16, 0xe0,
+    0x5c, 0xe1, 0x18, 0xe2, 0x18, 0xe9, 0x02, 0xeb,
+    0x01, 0xe0, 0x04, 0x05, 0xe0, 0x80, 0x78, 0x05,
+    0xe6, 0x02, 0xe5, 0x20, 0xa6, 0x07, 0x05, 0x66,
+    0xf6, 0x00, 0x06, 0xe0, 0x00, 0x05, 0xa6, 0x27,
+    0x46, 0xe5, 0x20, 0x20, 0x65, 0xe6, 0x05, 0x07,
+    0x26, 0x56, 0x05, 0x96, 0xe0, 0x15, 0xe5, 0x31,
+    0xe0, 0x80, 0x7f, 0xe5, 0x01, 0x00, 0xe5, 0x1d,
+    0x07, 0xc6, 0x00, 0xa6, 0x07, 0x06, 0x05, 0x96,
+    0xe0, 0x02, 0xe9, 0x02, 0xeb, 0x0b, 0x40, 0x36,
+    0xe5, 0x16, 0x20, 0xe6, 0x0e, 0x00, 0x07, 0xc6,
+    0x07, 0x26, 0x07, 0x26, 0xe0, 0x41, 0xc5, 0x00,
+    0x25, 0x00, 0xe5, 0x1e, 0xa6, 0x40, 0x06, 0x00,
+    0x26, 0x00, 0xc6, 0x05, 0x06, 0xe0, 0x00, 0xe9,
+    0x02, 0xa0, 0xa5, 0x00, 0x25, 0x00, 0xe5, 0x18,
+    0x87, 0x00, 0x26, 0x00, 0x27, 0x06, 0x07, 0x06,
+    0x05, 0xc0, 0xe9, 0x02, 0xe0, 0x80, 0xae, 0xe5,
+    0x0b, 0x26, 0x27, 0x36, 0xe0, 0x80, 0x7f, 0xe5,
+    0x83, 0x12, 0xe0, 0x5e, 0xea, 0x67, 0x00, 0x96,
+    0xe0, 0x03, 0xe5, 0x80, 0x3c, 0xe0, 0x8a, 0x34,
+    0xe5, 0x83, 0xa7, 0xe0, 0x8f, 0x49, 0xe5, 0x81,
+    0xbf, 0xe0, 0xa1, 0x31, 0xe5, 0x81, 0xb1, 0xc0,
+    0xe5, 0x17, 0x00, 0xe9, 0x02, 0x60, 0x36, 0xe0,
+    0x58, 0xe5, 0x16, 0x20, 0x86, 0x16, 0xe0, 0x02,
+    0xe5, 0x28, 0xc6, 0x96, 0x6f, 0x64, 0x16, 0x0f,
+    0xe0, 0x02, 0xe9, 0x02, 0x00, 0xcb, 0x00, 0xe5,
+    0x0d, 0x80, 0xe5, 0x0b, 0xe0, 0x82, 0x28, 0xe1,
+    0x18, 0xe2, 0x18, 0xeb, 0x0f, 0x76, 0xe0, 0x5d,
+    0xe5, 0x3d, 0xe0, 0x03, 0x05, 0xe7, 0x26, 0xe0,
+    0x08, 0x66, 0xe4, 0x05, 0xe0, 0x38, 0x24, 0xe0,
+    0x16, 0xe5, 0x97, 0x6a, 0xe0, 0x06, 0xe5, 0x82,
+    0x6b, 0xe0, 0xa4, 0x85, 0xe5, 0x80, 0x97, 0xe0,
+    0x49, 0xe5, 0x81, 0x04, 0xe0, 0x88, 0x7c, 0xe5,
+    0x63, 0x80, 0xe5, 0x05, 0x40, 0xe5, 0x01, 0xc0,
+    0xe5, 0x02, 0x20, 0x0f, 0x26, 0x16, 0x7b, 0xe0,
+    0x92, 0xd4, 0xef, 0x80, 0x6e, 0xe0, 0x02, 0xef,
+    0x1f, 0x20, 0xef, 0x34, 0x27, 0x46, 0x4f, 0xa7,
+    0xfb, 0x00, 0xe6, 0x00, 0x2f, 0xc6, 0xef, 0x16,
+    0x66, 0xef, 0x33, 0xe0, 0x0f, 0xef, 0x3a, 0x46,
+    0x0f, 0xe0, 0x80, 0x12, 0xeb, 0x0c, 0xe0, 0x04,
+    0xef, 0x4f, 0xe0, 0x01, 0xeb, 0x11, 0xe0, 0x7f,
+    0xe1, 0x12, 0xe2, 0x12, 0xe1, 0x12, 0xc2, 0x00,
+    0xe2, 0x0a, 0xe1, 0x12, 0xe2, 0x12, 0x01, 0x00,
+    0x21, 0x20, 0x01, 0x20, 0x21, 0x20, 0x61, 0x00,
+    0xe1, 0x00, 0x62, 0x00, 0x02, 0x00, 0xc2, 0x00,
+    0xe2, 0x03, 0xe1, 0x12, 0xe2, 0x12, 0x21, 0x00,
+    0x61, 0x20, 0xe1, 0x00, 0x00, 0xc1, 0x00, 0xe2,
+    0x12, 0x21, 0x00, 0x61, 0x00, 0x81, 0x00, 0x01,
+    0x40, 0xc1, 0x00, 0xe2, 0x12, 0xe1, 0x12, 0xe2,
+    0x12, 0xe1, 0x12, 0xe2, 0x12, 0xe1, 0x12, 0xe2,
+    0x12, 0xe1, 0x12, 0xe2, 0x12, 0xe1, 0x12, 0xe2,
+    0x12, 0xe1, 0x12, 0xe2, 0x14, 0x20, 0xe1, 0x11,
+    0x0c, 0xe2, 0x11, 0x0c, 0xa2, 0xe1, 0x11, 0x0c,
+    0xe2, 0x11, 0x0c, 0xa2, 0xe1, 0x11, 0x0c, 0xe2,
+    0x11, 0x0c, 0xa2, 0xe1, 0x11, 0x0c, 0xe2, 0x11,
+    0x0c, 0xa2, 0xe1, 0x11, 0x0c, 0xe2, 0x11, 0x0c,
+    0xa2, 0x3f, 0x20, 0xe9, 0x2a, 0xef, 0x81, 0x78,
+    0xe6, 0x2f, 0x6f, 0xe6, 0x2a, 0xef, 0x00, 0x06,
+    0xef, 0x06, 0x06, 0x2f, 0x96, 0xe0, 0x07, 0x86,
+    0x00, 0xe6, 0x07, 0xe0, 0x84, 0xc8, 0xc6, 0x00,
+    0xe6, 0x09, 0x20, 0xc6, 0x00, 0x26, 0x00, 0x86,
+    0xe0, 0x87, 0x4d, 0xe5, 0x80, 0x3d, 0x20, 0xeb,
+    0x01, 0xc6, 0xe0, 0x21, 0xe1, 0x1a, 0xe2, 0x1a,
+    0xc6, 0x80, 0xe9, 0x02, 0x60, 0x36, 0xe0, 0x82,
+    0x89, 0xeb, 0x33, 0x0f, 0x4b, 0x0d, 0x6b, 0xe0,
+    0x80, 0xc3, 0x65, 0x00, 0xe5, 0x13, 0x00, 0x25,
+    0x00, 0x05, 0x20, 0x05, 0x00, 0xe5, 0x02, 0x00,
+    0x65, 0x00, 0x05, 0x00, 0x05, 0xa0, 0x05, 0x60,
+    0x05, 0x00, 0x05, 0x00, 0x05, 0x00, 0x45, 0x00,
+    0x25, 0x00, 0x05, 0x20, 0x05, 0x00, 0x05, 0x00,
+    0x05, 0x00, 0x05, 0x00, 0x05, 0x00, 0x25, 0x00,
+    0x05, 0x20, 0x65, 0x00, 0xc5, 0x00, 0x65, 0x00,
+    0x65, 0x00, 0x05, 0x00, 0xe5, 0x02, 0x00, 0xe5,
+    0x09, 0x80, 0x45, 0x00, 0x85, 0x00, 0xe5, 0x09,
+    0xe0, 0x2c, 0x2c, 0xe0, 0x80, 0x86, 0xef, 0x24,
+    0x60, 0xef, 0x5c, 0xe0, 0x04, 0xef, 0x07, 0x20,
+    0xef, 0x07, 0x00, 0xef, 0x07, 0x00, 0xef, 0x1d,
+    0xe0, 0x02, 0xeb, 0x05, 0x40, 0xef, 0x54, 0x60,
+    0xef, 0x35, 0xe0, 0x31, 0xef, 0x15, 0xe0, 0x05,
+    0xef, 0x24, 0x60, 0xef, 0x01, 0xc0, 0x2f, 0xe0,
+    0x06, 0xaf, 0xe0, 0x80, 0x12, 0xef, 0x80, 0x73,
+    0x8e, 0xef, 0x82, 0x4d, 0xe0, 0x03, 0xef, 0x05,
+    0x40, 0xef, 0x02, 0xa0, 0xef, 0x6c, 0xe0, 0x04,
+    0xef, 0x51, 0xe0, 0x1f, 0xef, 0x04, 0x60, 0xef,
+    0x30, 0xe0, 0x00, 0xef, 0x02, 0xa0, 0xef, 0x20,
+    0xe0, 0x00, 0xef, 0x16, 0xe0, 0x4a, 0xef, 0x04,
+    0x60, 0xef, 0x27, 0x00, 0xef, 0x29, 0x20, 0x6f,
+    0x40, 0x0f, 0x00, 0xef, 0x1f, 0xe0, 0x05, 0xef,
+    0x02, 0xa0, 0x4f, 0xe0, 0x05, 0xef, 0x28, 0xe0,
+    0x58, 0xef, 0x06, 0xe0, 0x85, 0x0a, 0xe5, 0xc0,
+    0x66, 0x4f, 0xe0, 0x21, 0xe5, 0x8f, 0xad, 0xe0,
+    0x03, 0xe5, 0x80, 0x56, 0x20, 0xe5, 0x95, 0xfa,
+    0xe0, 0x06, 0xe5, 0x9c, 0xa9, 0xe0, 0x8b, 0x97,
+    0xe5, 0x81, 0x96, 0xe0, 0xca, 0xc5, 0x5b, 0x1b,
+    0xe0, 0x16, 0xfb, 0x58, 0xe0, 0x78, 0xe6, 0x80,
+    0x68, 0xe0, 0xc0, 0xbd, 0x88, 0xfd, 0xc0, 0xbf,
+    0x76, 0x20, 0xfd, 0xc0, 0xbf, 0x76, 0x20,
+};
+
+typedef enum {
+    UNICODE_SCRIPT_Unknown,
+    UNICODE_SCRIPT_Adlam,
+    UNICODE_SCRIPT_Ahom,
+    UNICODE_SCRIPT_Anatolian_Hieroglyphs,
+    UNICODE_SCRIPT_Arabic,
+    UNICODE_SCRIPT_Armenian,
+    UNICODE_SCRIPT_Avestan,
+    UNICODE_SCRIPT_Balinese,
+    UNICODE_SCRIPT_Bamum,
+    UNICODE_SCRIPT_Bassa_Vah,
+    UNICODE_SCRIPT_Batak,
+    UNICODE_SCRIPT_Bengali,
+    UNICODE_SCRIPT_Bhaiksuki,
+    UNICODE_SCRIPT_Bopomofo,
+    UNICODE_SCRIPT_Brahmi,
+    UNICODE_SCRIPT_Braille,
+    UNICODE_SCRIPT_Buginese,
+    UNICODE_SCRIPT_Buhid,
+    UNICODE_SCRIPT_Canadian_Aboriginal,
+    UNICODE_SCRIPT_Carian,
+    UNICODE_SCRIPT_Caucasian_Albanian,
+    UNICODE_SCRIPT_Chakma,
+    UNICODE_SCRIPT_Cham,
+    UNICODE_SCRIPT_Cherokee,
+    UNICODE_SCRIPT_Common,
+    UNICODE_SCRIPT_Coptic,
+    UNICODE_SCRIPT_Cuneiform,
+    UNICODE_SCRIPT_Cypriot,
+    UNICODE_SCRIPT_Cyrillic,
+    UNICODE_SCRIPT_Deseret,
+    UNICODE_SCRIPT_Devanagari,
+    UNICODE_SCRIPT_Dogra,
+    UNICODE_SCRIPT_Duployan,
+    UNICODE_SCRIPT_Egyptian_Hieroglyphs,
+    UNICODE_SCRIPT_Elbasan,
+    UNICODE_SCRIPT_Ethiopic,
+    UNICODE_SCRIPT_Georgian,
+    UNICODE_SCRIPT_Glagolitic,
+    UNICODE_SCRIPT_Gothic,
+    UNICODE_SCRIPT_Grantha,
+    UNICODE_SCRIPT_Greek,
+    UNICODE_SCRIPT_Gujarati,
+    UNICODE_SCRIPT_Gunjala_Gondi,
+    UNICODE_SCRIPT_Gurmukhi,
+    UNICODE_SCRIPT_Han,
+    UNICODE_SCRIPT_Hangul,
+    UNICODE_SCRIPT_Hanifi_Rohingya,
+    UNICODE_SCRIPT_Hanunoo,
+    UNICODE_SCRIPT_Hatran,
+    UNICODE_SCRIPT_Hebrew,
+    UNICODE_SCRIPT_Hiragana,
+    UNICODE_SCRIPT_Imperial_Aramaic,
+    UNICODE_SCRIPT_Inherited,
+    UNICODE_SCRIPT_Inscriptional_Pahlavi,
+    UNICODE_SCRIPT_Inscriptional_Parthian,
+    UNICODE_SCRIPT_Javanese,
+    UNICODE_SCRIPT_Kaithi,
+    UNICODE_SCRIPT_Kannada,
+    UNICODE_SCRIPT_Katakana,
+    UNICODE_SCRIPT_Kayah_Li,
+    UNICODE_SCRIPT_Kharoshthi,
+    UNICODE_SCRIPT_Khmer,
+    UNICODE_SCRIPT_Khojki,
+    UNICODE_SCRIPT_Khudawadi,
+    UNICODE_SCRIPT_Lao,
+    UNICODE_SCRIPT_Latin,
+    UNICODE_SCRIPT_Lepcha,
+    UNICODE_SCRIPT_Limbu,
+    UNICODE_SCRIPT_Linear_A,
+    UNICODE_SCRIPT_Linear_B,
+    UNICODE_SCRIPT_Lisu,
+    UNICODE_SCRIPT_Lycian,
+    UNICODE_SCRIPT_Lydian,
+    UNICODE_SCRIPT_Makasar,
+    UNICODE_SCRIPT_Mahajani,
+    UNICODE_SCRIPT_Malayalam,
+    UNICODE_SCRIPT_Mandaic,
+    UNICODE_SCRIPT_Manichaean,
+    UNICODE_SCRIPT_Marchen,
+    UNICODE_SCRIPT_Masaram_Gondi,
+    UNICODE_SCRIPT_Medefaidrin,
+    UNICODE_SCRIPT_Meetei_Mayek,
+    UNICODE_SCRIPT_Mende_Kikakui,
+    UNICODE_SCRIPT_Meroitic_Cursive,
+    UNICODE_SCRIPT_Meroitic_Hieroglyphs,
+    UNICODE_SCRIPT_Miao,
+    UNICODE_SCRIPT_Modi,
+    UNICODE_SCRIPT_Mongolian,
+    UNICODE_SCRIPT_Mro,
+    UNICODE_SCRIPT_Multani,
+    UNICODE_SCRIPT_Myanmar,
+    UNICODE_SCRIPT_Nabataean,
+    UNICODE_SCRIPT_New_Tai_Lue,
+    UNICODE_SCRIPT_Newa,
+    UNICODE_SCRIPT_Nko,
+    UNICODE_SCRIPT_Nushu,
+    UNICODE_SCRIPT_Ogham,
+    UNICODE_SCRIPT_Ol_Chiki,
+    UNICODE_SCRIPT_Old_Hungarian,
+    UNICODE_SCRIPT_Old_Italic,
+    UNICODE_SCRIPT_Old_North_Arabian,
+    UNICODE_SCRIPT_Old_Permic,
+    UNICODE_SCRIPT_Old_Persian,
+    UNICODE_SCRIPT_Old_Sogdian,
+    UNICODE_SCRIPT_Old_South_Arabian,
+    UNICODE_SCRIPT_Old_Turkic,
+    UNICODE_SCRIPT_Oriya,
+    UNICODE_SCRIPT_Osage,
+    UNICODE_SCRIPT_Osmanya,
+    UNICODE_SCRIPT_Pahawh_Hmong,
+    UNICODE_SCRIPT_Palmyrene,
+    UNICODE_SCRIPT_Pau_Cin_Hau,
+    UNICODE_SCRIPT_Phags_Pa,
+    UNICODE_SCRIPT_Phoenician,
+    UNICODE_SCRIPT_Psalter_Pahlavi,
+    UNICODE_SCRIPT_Rejang,
+    UNICODE_SCRIPT_Runic,
+    UNICODE_SCRIPT_Samaritan,
+    UNICODE_SCRIPT_Saurashtra,
+    UNICODE_SCRIPT_Sharada,
+    UNICODE_SCRIPT_Shavian,
+    UNICODE_SCRIPT_Siddham,
+    UNICODE_SCRIPT_SignWriting,
+    UNICODE_SCRIPT_Sinhala,
+    UNICODE_SCRIPT_Sogdian,
+    UNICODE_SCRIPT_Sora_Sompeng,
+    UNICODE_SCRIPT_Soyombo,
+    UNICODE_SCRIPT_Sundanese,
+    UNICODE_SCRIPT_Syloti_Nagri,
+    UNICODE_SCRIPT_Syriac,
+    UNICODE_SCRIPT_Tagalog,
+    UNICODE_SCRIPT_Tagbanwa,
+    UNICODE_SCRIPT_Tai_Le,
+    UNICODE_SCRIPT_Tai_Tham,
+    UNICODE_SCRIPT_Tai_Viet,
+    UNICODE_SCRIPT_Takri,
+    UNICODE_SCRIPT_Tamil,
+    UNICODE_SCRIPT_Tangut,
+    UNICODE_SCRIPT_Telugu,
+    UNICODE_SCRIPT_Thaana,
+    UNICODE_SCRIPT_Thai,
+    UNICODE_SCRIPT_Tibetan,
+    UNICODE_SCRIPT_Tifinagh,
+    UNICODE_SCRIPT_Tirhuta,
+    UNICODE_SCRIPT_Ugaritic,
+    UNICODE_SCRIPT_Vai,
+    UNICODE_SCRIPT_Warang_Citi,
+    UNICODE_SCRIPT_Yi,
+    UNICODE_SCRIPT_Zanabazar_Square,
+    UNICODE_SCRIPT_COUNT,
+} UnicodeScriptEnum;
+
+static const char unicode_script_name_table[] =
+    "Adlam,Adlm"                  "\0"
+    "Ahom,Ahom"                   "\0"
+    "Anatolian_Hieroglyphs,Hluw"  "\0"
+    "Arabic,Arab"                 "\0"
+    "Armenian,Armn"               "\0"
+    "Avestan,Avst"                "\0"
+    "Balinese,Bali"               "\0"
+    "Bamum,Bamu"                  "\0"
+    "Bassa_Vah,Bass"              "\0"
+    "Batak,Batk"                  "\0"
+    "Bengali,Beng"                "\0"
+    "Bhaiksuki,Bhks"              "\0"
+    "Bopomofo,Bopo"               "\0"
+    "Brahmi,Brah"                 "\0"
+    "Braille,Brai"                "\0"
+    "Buginese,Bugi"               "\0"
+    "Buhid,Buhd"                  "\0"
+    "Canadian_Aboriginal,Cans"    "\0"
+    "Carian,Cari"                 "\0"
+    "Caucasian_Albanian,Aghb"     "\0"
+    "Chakma,Cakm"                 "\0"
+    "Cham,Cham"                   "\0"
+    "Cherokee,Cher"               "\0"
+    "Common,Zyyy"                 "\0"
+    "Coptic,Copt,Qaac"            "\0"
+    "Cuneiform,Xsux"              "\0"
+    "Cypriot,Cprt"                "\0"
+    "Cyrillic,Cyrl"               "\0"
+    "Deseret,Dsrt"                "\0"
+    "Devanagari,Deva"             "\0"
+    "Dogra,Dogr"                  "\0"
+    "Duployan,Dupl"               "\0"
+    "Egyptian_Hieroglyphs,Egyp"   "\0"
+    "Elbasan,Elba"                "\0"
+    "Ethiopic,Ethi"               "\0"
+    "Georgian,Geor"               "\0"
+    "Glagolitic,Glag"             "\0"
+    "Gothic,Goth"                 "\0"
+    "Grantha,Gran"                "\0"
+    "Greek,Grek"                  "\0"
+    "Gujarati,Gujr"               "\0"
+    "Gunjala_Gondi,Gong"          "\0"
+    "Gurmukhi,Guru"               "\0"
+    "Han,Hani"                    "\0"
+    "Hangul,Hang"                 "\0"
+    "Hanifi_Rohingya,Rohg"        "\0"
+    "Hanunoo,Hano"                "\0"
+    "Hatran,Hatr"                 "\0"
+    "Hebrew,Hebr"                 "\0"
+    "Hiragana,Hira"               "\0"
+    "Imperial_Aramaic,Armi"       "\0"
+    "Inherited,Zinh,Qaai"         "\0"
+    "Inscriptional_Pahlavi,Phli"  "\0"
+    "Inscriptional_Parthian,Prti" "\0"
+    "Javanese,Java"               "\0"
+    "Kaithi,Kthi"                 "\0"
+    "Kannada,Knda"                "\0"
+    "Katakana,Kana"               "\0"
+    "Kayah_Li,Kali"               "\0"
+    "Kharoshthi,Khar"             "\0"
+    "Khmer,Khmr"                  "\0"
+    "Khojki,Khoj"                 "\0"
+    "Khudawadi,Sind"              "\0"
+    "Lao,Laoo"                    "\0"
+    "Latin,Latn"                  "\0"
+    "Lepcha,Lepc"                 "\0"
+    "Limbu,Limb"                  "\0"
+    "Linear_A,Lina"               "\0"
+    "Linear_B,Linb"               "\0"
+    "Lisu,Lisu"                   "\0"
+    "Lycian,Lyci"                 "\0"
+    "Lydian,Lydi"                 "\0"
+    "Makasar,Maka"                "\0"
+    "Mahajani,Mahj"               "\0"
+    "Malayalam,Mlym"              "\0"
+    "Mandaic,Mand"                "\0"
+    "Manichaean,Mani"             "\0"
+    "Marchen,Marc"                "\0"
+    "Masaram_Gondi,Gonm"          "\0"
+    "Medefaidrin,Medf"            "\0"
+    "Meetei_Mayek,Mtei"           "\0"
+    "Mende_Kikakui,Mend"          "\0"
+    "Meroitic_Cursive,Merc"       "\0"
+    "Meroitic_Hieroglyphs,Mero"   "\0"
+    "Miao,Plrd"                   "\0"
+    "Modi,Modi"                   "\0"
+    "Mongolian,Mong"              "\0"
+    "Mro,Mroo"                    "\0"
+    "Multani,Mult"                "\0"
+    "Myanmar,Mymr"                "\0"
+    "Nabataean,Nbat"              "\0"
+    "New_Tai_Lue,Talu"            "\0"
+    "Newa,Newa"                   "\0"
+    "Nko,Nkoo"                    "\0"
+    "Nushu,Nshu"                  "\0"
+    "Ogham,Ogam"                  "\0"
+    "Ol_Chiki,Olck"               "\0"
+    "Old_Hungarian,Hung"          "\0"
+    "Old_Italic,Ital"             "\0"
+    "Old_North_Arabian,Narb"      "\0"
+    "Old_Permic,Perm"             "\0"
+    "Old_Persian,Xpeo"            "\0"
+    "Old_Sogdian,Sogo"            "\0"
+    "Old_South_Arabian,Sarb"      "\0"
+    "Old_Turkic,Orkh"             "\0"
+    "Oriya,Orya"                  "\0"
+    "Osage,Osge"                  "\0"
+    "Osmanya,Osma"                "\0"
+    "Pahawh_Hmong,Hmng"           "\0"
+    "Palmyrene,Palm"              "\0"
+    "Pau_Cin_Hau,Pauc"            "\0"
+    "Phags_Pa,Phag"               "\0"
+    "Phoenician,Phnx"             "\0"
+    "Psalter_Pahlavi,Phlp"        "\0"
+    "Rejang,Rjng"                 "\0"
+    "Runic,Runr"                  "\0"
+    "Samaritan,Samr"              "\0"
+    "Saurashtra,Saur"             "\0"
+    "Sharada,Shrd"                "\0"
+    "Shavian,Shaw"                "\0"
+    "Siddham,Sidd"                "\0"
+    "SignWriting,Sgnw"            "\0"
+    "Sinhala,Sinh"                "\0"
+    "Sogdian,Sogd"                "\0"
+    "Sora_Sompeng,Sora"           "\0"
+    "Soyombo,Soyo"                "\0"
+    "Sundanese,Sund"              "\0"
+    "Syloti_Nagri,Sylo"           "\0"
+    "Syriac,Syrc"                 "\0"
+    "Tagalog,Tglg"                "\0"
+    "Tagbanwa,Tagb"               "\0"
+    "Tai_Le,Tale"                 "\0"
+    "Tai_Tham,Lana"               "\0"
+    "Tai_Viet,Tavt"               "\0"
+    "Takri,Takr"                  "\0"
+    "Tamil,Taml"                  "\0"
+    "Tangut,Tang"                 "\0"
+    "Telugu,Telu"                 "\0"
+    "Thaana,Thaa"                 "\0"
+    "Thai,Thai"                   "\0"
+    "Tibetan,Tibt"                "\0"
+    "Tifinagh,Tfng"               "\0"
+    "Tirhuta,Tirh"                "\0"
+    "Ugaritic,Ugar"               "\0"
+    "Vai,Vaii"                    "\0"
+    "Warang_Citi,Wara"            "\0"
+    "Yi,Yiii"                     "\0"
+    "Zanabazar_Square,Zanb"       "\0"
+;
+
+static const uint8_t unicode_script_table[2522] = {
+    0xc0, 0x18, 0x99, 0x41, 0x85, 0x18, 0x99, 0x41,
+    0xae, 0x18, 0x80, 0x41, 0x8e, 0x18, 0x80, 0x41,
+    0x84, 0x18, 0x96, 0x41, 0x80, 0x18, 0x9e, 0x41,
+    0x80, 0x18, 0xe1, 0x60, 0x41, 0xa6, 0x18, 0x84,
+    0x41, 0x84, 0x18, 0x81, 0x0d, 0x93, 0x18, 0xe0,
+    0x0f, 0x34, 0x83, 0x28, 0x80, 0x18, 0x82, 0x28,
+    0x01, 0x83, 0x28, 0x80, 0x18, 0x80, 0x28, 0x03,
+    0x80, 0x28, 0x80, 0x18, 0x80, 0x28, 0x80, 0x18,
+    0x82, 0x28, 0x00, 0x80, 0x28, 0x00, 0x93, 0x28,
+    0x00, 0xbe, 0x28, 0x8d, 0x19, 0x8f, 0x28, 0xe0,
+    0x24, 0x1c, 0x81, 0x34, 0xe0, 0x48, 0x1c, 0x00,
+    0xa5, 0x05, 0x01, 0xaf, 0x05, 0x80, 0x18, 0x80,
+    0x05, 0x01, 0x82, 0x05, 0x00, 0xb6, 0x31, 0x07,
+    0x9a, 0x31, 0x03, 0x85, 0x31, 0x0a, 0x84, 0x04,
+    0x80, 0x18, 0x85, 0x04, 0x80, 0x18, 0x8d, 0x04,
+    0x80, 0x18, 0x80, 0x04, 0x00, 0x80, 0x04, 0x80,
+    0x18, 0x9f, 0x04, 0x80, 0x18, 0x89, 0x04, 0x8a,
+    0x34, 0x99, 0x04, 0x80, 0x34, 0xe0, 0x0b, 0x04,
+    0x80, 0x18, 0xa1, 0x04, 0x8d, 0x81, 0x00, 0xbb,
+    0x81, 0x01, 0x82, 0x81, 0xaf, 0x04, 0xb1, 0x8b,
+    0x0d, 0xba, 0x5e, 0x01, 0x82, 0x5e, 0xad, 0x75,
+    0x01, 0x8e, 0x75, 0x00, 0x9b, 0x4c, 0x01, 0x80,
+    0x4c, 0x00, 0x8a, 0x81, 0x34, 0x94, 0x04, 0x00,
+    0x87, 0x04, 0x14, 0x8e, 0x04, 0x80, 0x18, 0x9c,
+    0x04, 0xd0, 0x1e, 0x81, 0x34, 0x90, 0x1e, 0x81,
+    0x18, 0x99, 0x1e, 0x83, 0x0b, 0x00, 0x87, 0x0b,
+    0x01, 0x81, 0x0b, 0x01, 0x95, 0x0b, 0x00, 0x86,
+    0x0b, 0x00, 0x80, 0x0b, 0x02, 0x83, 0x0b, 0x01,
+    0x88, 0x0b, 0x01, 0x81, 0x0b, 0x01, 0x83, 0x0b,
+    0x07, 0x80, 0x0b, 0x03, 0x81, 0x0b, 0x00, 0x84,
+    0x0b, 0x01, 0x98, 0x0b, 0x01, 0x82, 0x2b, 0x00,
+    0x85, 0x2b, 0x03, 0x81, 0x2b, 0x01, 0x95, 0x2b,
+    0x00, 0x86, 0x2b, 0x00, 0x81, 0x2b, 0x00, 0x81,
+    0x2b, 0x00, 0x81, 0x2b, 0x01, 0x80, 0x2b, 0x00,
+    0x84, 0x2b, 0x03, 0x81, 0x2b, 0x01, 0x82, 0x2b,
+    0x02, 0x80, 0x2b, 0x06, 0x83, 0x2b, 0x00, 0x80,
+    0x2b, 0x06, 0x90, 0x2b, 0x09, 0x82, 0x29, 0x00,
+    0x88, 0x29, 0x00, 0x82, 0x29, 0x00, 0x95, 0x29,
+    0x00, 0x86, 0x29, 0x00, 0x81, 0x29, 0x00, 0x84,
+    0x29, 0x01, 0x89, 0x29, 0x00, 0x82, 0x29, 0x00,
+    0x82, 0x29, 0x01, 0x80, 0x29, 0x0e, 0x83, 0x29,
+    0x01, 0x8b, 0x29, 0x06, 0x86, 0x29, 0x00, 0x82,
+    0x6a, 0x00, 0x87, 0x6a, 0x01, 0x81, 0x6a, 0x01,
+    0x95, 0x6a, 0x00, 0x86, 0x6a, 0x00, 0x81, 0x6a,
+    0x00, 0x84, 0x6a, 0x01, 0x88, 0x6a, 0x01, 0x81,
+    0x6a, 0x01, 0x82, 0x6a, 0x07, 0x81, 0x6a, 0x03,
+    0x81, 0x6a, 0x00, 0x84, 0x6a, 0x01, 0x91, 0x6a,
+    0x09, 0x81, 0x88, 0x00, 0x85, 0x88, 0x02, 0x82,
+    0x88, 0x00, 0x83, 0x88, 0x02, 0x81, 0x88, 0x00,
+    0x80, 0x88, 0x00, 0x81, 0x88, 0x02, 0x81, 0x88,
+    0x02, 0x82, 0x88, 0x02, 0x8b, 0x88, 0x03, 0x84,
+    0x88, 0x02, 0x82, 0x88, 0x00, 0x83, 0x88, 0x01,
+    0x80, 0x88, 0x05, 0x80, 0x88, 0x0d, 0x94, 0x88,
+    0x04, 0x8c, 0x8a, 0x00, 0x82, 0x8a, 0x00, 0x96,
+    0x8a, 0x00, 0x8f, 0x8a, 0x02, 0x87, 0x8a, 0x00,
+    0x82, 0x8a, 0x00, 0x83, 0x8a, 0x06, 0x81, 0x8a,
+    0x00, 0x82, 0x8a, 0x04, 0x83, 0x8a, 0x01, 0x89,
+    0x8a, 0x07, 0x87, 0x8a, 0x8c, 0x39, 0x00, 0x82,
+    0x39, 0x00, 0x96, 0x39, 0x00, 0x89, 0x39, 0x00,
+    0x84, 0x39, 0x01, 0x88, 0x39, 0x00, 0x82, 0x39,
+    0x00, 0x83, 0x39, 0x06, 0x81, 0x39, 0x06, 0x80,
+    0x39, 0x00, 0x83, 0x39, 0x01, 0x89, 0x39, 0x00,
+    0x81, 0x39, 0x0c, 0x83, 0x4b, 0x00, 0x87, 0x4b,
+    0x00, 0x82, 0x4b, 0x00, 0xb2, 0x4b, 0x00, 0x82,
+    0x4b, 0x00, 0x85, 0x4b, 0x03, 0x8f, 0x4b, 0x01,
+    0x99, 0x4b, 0x01, 0x81, 0x7b, 0x00, 0x91, 0x7b,
+    0x02, 0x97, 0x7b, 0x00, 0x88, 0x7b, 0x00, 0x80,
+    0x7b, 0x01, 0x86, 0x7b, 0x02, 0x80, 0x7b, 0x03,
+    0x85, 0x7b, 0x00, 0x80, 0x7b, 0x00, 0x87, 0x7b,
+    0x05, 0x89, 0x7b, 0x01, 0x82, 0x7b, 0x0b, 0xb9,
+    0x8c, 0x03, 0x80, 0x18, 0x9b, 0x8c, 0x24, 0x81,
+    0x40, 0x00, 0x80, 0x40, 0x01, 0x81, 0x40, 0x00,
+    0x80, 0x40, 0x01, 0x80, 0x40, 0x05, 0x83, 0x40,
+    0x00, 0x86, 0x40, 0x00, 0x82, 0x40, 0x00, 0x80,
+    0x40, 0x00, 0x80, 0x40, 0x01, 0x81, 0x40, 0x00,
+    0x8c, 0x40, 0x00, 0x82, 0x40, 0x01, 0x84, 0x40,
+    0x00, 0x80, 0x40, 0x00, 0x85, 0x40, 0x01, 0x89,
+    0x40, 0x01, 0x83, 0x40, 0x1f, 0xc7, 0x8d, 0x00,
+    0xa3, 0x8d, 0x03, 0xa6, 0x8d, 0x00, 0xa3, 0x8d,
+    0x00, 0x8e, 0x8d, 0x00, 0x86, 0x8d, 0x83, 0x18,
+    0x81, 0x8d, 0x24, 0xe0, 0x3f, 0x5a, 0xa5, 0x24,
+    0x00, 0x80, 0x24, 0x04, 0x80, 0x24, 0x01, 0xaa,
+    0x24, 0x80, 0x18, 0x83, 0x24, 0xe0, 0x9f, 0x2d,
+    0xc8, 0x23, 0x00, 0x83, 0x23, 0x01, 0x86, 0x23,
+    0x00, 0x80, 0x23, 0x00, 0x83, 0x23, 0x01, 0xa8,
+    0x23, 0x00, 0x83, 0x23, 0x01, 0xa0, 0x23, 0x00,
+    0x83, 0x23, 0x01, 0x86, 0x23, 0x00, 0x80, 0x23,
+    0x00, 0x83, 0x23, 0x01, 0x8e, 0x23, 0x00, 0xb8,
+    0x23, 0x00, 0x83, 0x23, 0x01, 0xc2, 0x23, 0x01,
+    0x9f, 0x23, 0x02, 0x99, 0x23, 0x05, 0xd5, 0x17,
+    0x01, 0x85, 0x17, 0x01, 0xe2, 0x1f, 0x12, 0x9c,
+    0x60, 0x02, 0xca, 0x74, 0x82, 0x18, 0x8a, 0x74,
+    0x06, 0x8c, 0x82, 0x00, 0x86, 0x82, 0x0a, 0x94,
+    0x2f, 0x81, 0x18, 0x08, 0x93, 0x11, 0x0b, 0x8c,
+    0x83, 0x00, 0x82, 0x83, 0x00, 0x81, 0x83, 0x0b,
+    0xdd, 0x3d, 0x01, 0x89, 0x3d, 0x05, 0x89, 0x3d,
+    0x05, 0x81, 0x57, 0x81, 0x18, 0x80, 0x57, 0x80,
+    0x18, 0x88, 0x57, 0x00, 0x89, 0x57, 0x05, 0xd8,
+    0x57, 0x06, 0xaa, 0x57, 0x04, 0xc5, 0x12, 0x09,
+    0x9e, 0x43, 0x00, 0x8b, 0x43, 0x03, 0x8b, 0x43,
+    0x03, 0x80, 0x43, 0x02, 0x8b, 0x43, 0x9d, 0x84,
+    0x01, 0x84, 0x84, 0x0a, 0xab, 0x5c, 0x03, 0x99,
+    0x5c, 0x05, 0x8a, 0x5c, 0x02, 0x81, 0x5c, 0x9f,
+    0x3d, 0x9b, 0x10, 0x01, 0x81, 0x10, 0xbe, 0x85,
+    0x00, 0x9c, 0x85, 0x01, 0x8a, 0x85, 0x05, 0x89,
+    0x85, 0x05, 0x8d, 0x85, 0x01, 0x8e, 0x34, 0x40,
+    0xcb, 0x07, 0x03, 0xac, 0x07, 0x02, 0xbf, 0x7f,
+    0xb3, 0x0a, 0x07, 0x83, 0x0a, 0xb7, 0x42, 0x02,
+    0x8e, 0x42, 0x02, 0x82, 0x42, 0xaf, 0x61, 0x88,
+    0x1c, 0x06, 0xaa, 0x24, 0x01, 0x82, 0x24, 0x87,
+    0x7f, 0x07, 0x82, 0x34, 0x80, 0x18, 0x8c, 0x34,
+    0x80, 0x18, 0x86, 0x34, 0x83, 0x18, 0x80, 0x34,
+    0x85, 0x18, 0x80, 0x34, 0x82, 0x18, 0x81, 0x34,
+    0x05, 0xa5, 0x41, 0x84, 0x28, 0x80, 0x1c, 0xb0,
+    0x41, 0x84, 0x28, 0x83, 0x41, 0x84, 0x28, 0x8c,
+    0x41, 0x80, 0x1c, 0xc5, 0x41, 0x80, 0x28, 0xb9,
+    0x34, 0x00, 0x84, 0x34, 0xe0, 0x9f, 0x41, 0x95,
+    0x28, 0x01, 0x85, 0x28, 0x01, 0xa5, 0x28, 0x01,
+    0x85, 0x28, 0x01, 0x87, 0x28, 0x00, 0x80, 0x28,
+    0x00, 0x80, 0x28, 0x00, 0x80, 0x28, 0x00, 0x9e,
+    0x28, 0x01, 0xb4, 0x28, 0x00, 0x8e, 0x28, 0x00,
+    0x8d, 0x28, 0x01, 0x85, 0x28, 0x00, 0x92, 0x28,
+    0x01, 0x82, 0x28, 0x00, 0x88, 0x28, 0x00, 0x8b,
+    0x18, 0x81, 0x34, 0xd6, 0x18, 0x00, 0x8a, 0x18,
+    0x80, 0x41, 0x01, 0x8a, 0x18, 0x80, 0x41, 0x8e,
+    0x18, 0x00, 0x8c, 0x41, 0x02, 0x9f, 0x18, 0x0f,
+    0xa0, 0x34, 0x0e, 0xa5, 0x18, 0x80, 0x28, 0x82,
+    0x18, 0x81, 0x41, 0x85, 0x18, 0x80, 0x41, 0x9a,
+    0x18, 0x80, 0x41, 0x90, 0x18, 0xa8, 0x41, 0x82,
+    0x18, 0x03, 0xe2, 0x36, 0x18, 0x18, 0x8a, 0x18,
+    0x14, 0xe3, 0x3f, 0x18, 0xe0, 0x9f, 0x0f, 0xe2,
+    0x13, 0x18, 0x01, 0x9f, 0x18, 0x01, 0xb0, 0x18,
+    0x00, 0xb4, 0x18, 0x00, 0xae, 0x25, 0x00, 0xae,
+    0x25, 0x00, 0x9f, 0x41, 0xe0, 0x13, 0x19, 0x04,
+    0x86, 0x19, 0xa5, 0x24, 0x00, 0x80, 0x24, 0x04,
+    0x80, 0x24, 0x01, 0xb7, 0x8e, 0x06, 0x81, 0x8e,
+    0x0d, 0x80, 0x8e, 0x96, 0x23, 0x08, 0x86, 0x23,
+    0x00, 0x86, 0x23, 0x00, 0x86, 0x23, 0x00, 0x86,
+    0x23, 0x00, 0x86, 0x23, 0x00, 0x86, 0x23, 0x00,
+    0x86, 0x23, 0x00, 0x86, 0x23, 0x00, 0x9f, 0x1c,
+    0xce, 0x18, 0x30, 0x99, 0x2c, 0x00, 0xd8, 0x2c,
+    0x0b, 0xe0, 0x75, 0x2c, 0x19, 0x8b, 0x18, 0x03,
+    0x84, 0x18, 0x80, 0x2c, 0x80, 0x18, 0x80, 0x2c,
+    0x98, 0x18, 0x88, 0x2c, 0x83, 0x34, 0x81, 0x2d,
+    0x87, 0x18, 0x83, 0x2c, 0x83, 0x18, 0x00, 0xd5,
+    0x32, 0x01, 0x81, 0x34, 0x81, 0x18, 0x82, 0x32,
+    0x80, 0x18, 0xd9, 0x3a, 0x81, 0x18, 0x82, 0x3a,
+    0x04, 0xaa, 0x0d, 0x00, 0xdd, 0x2d, 0x00, 0x8f,
+    0x18, 0x9a, 0x0d, 0x04, 0xa3, 0x18, 0x0b, 0x8f,
+    0x3a, 0x9e, 0x2d, 0x00, 0xbf, 0x18, 0x9e, 0x2d,
+    0xd0, 0x18, 0xae, 0x3a, 0x00, 0xd7, 0x3a, 0xe0,
+    0x47, 0x18, 0xf0, 0x09, 0x55, 0x2c, 0x09, 0xbf,
+    0x18, 0xf0, 0x41, 0x8f, 0x2c, 0x0f, 0xe4, 0x2c,
+    0x93, 0x02, 0xb6, 0x93, 0x08, 0xaf, 0x46, 0xe0,
+    0xcb, 0x91, 0x13, 0xdf, 0x1c, 0xd7, 0x08, 0x07,
+    0xa1, 0x18, 0xe0, 0x05, 0x41, 0x82, 0x18, 0xae,
+    0x41, 0x3c, 0x88, 0x41, 0xab, 0x80, 0x03, 0x89,
+    0x18, 0x05, 0xb7, 0x70, 0x07, 0xc5, 0x76, 0x07,
+    0x8b, 0x76, 0x05, 0x9f, 0x1e, 0xad, 0x3b, 0x80,
+    0x18, 0x80, 0x3b, 0xa3, 0x73, 0x0a, 0x80, 0x73,
+    0x9c, 0x2d, 0x02, 0xcd, 0x37, 0x00, 0x80, 0x18,
+    0x89, 0x37, 0x03, 0x81, 0x37, 0x9e, 0x5a, 0x00,
+    0xb6, 0x16, 0x08, 0x8d, 0x16, 0x01, 0x89, 0x16,
+    0x01, 0x83, 0x16, 0x9f, 0x5a, 0xc2, 0x86, 0x17,
+    0x84, 0x86, 0x96, 0x51, 0x09, 0x85, 0x23, 0x01,
+    0x85, 0x23, 0x01, 0x85, 0x23, 0x08, 0x86, 0x23,
+    0x00, 0x86, 0x23, 0x00, 0xaa, 0x41, 0x80, 0x18,
+    0x88, 0x41, 0x80, 0x28, 0x09, 0xcf, 0x17, 0xad,
+    0x51, 0x01, 0x89, 0x51, 0x05, 0xf0, 0x1b, 0x43,
+    0x2d, 0x0b, 0x96, 0x2d, 0x03, 0xb0, 0x2d, 0x70,
+    0x10, 0xa3, 0xe1, 0x0d, 0x2c, 0x01, 0xe0, 0x09,
+    0x2c, 0x25, 0x86, 0x41, 0x0b, 0x84, 0x05, 0x04,
+    0x99, 0x31, 0x00, 0x84, 0x31, 0x00, 0x80, 0x31,
+    0x00, 0x81, 0x31, 0x00, 0x81, 0x31, 0x00, 0x89,
+    0x31, 0xe0, 0x11, 0x04, 0x10, 0xe1, 0x0a, 0x04,
+    0x81, 0x18, 0x0f, 0xbf, 0x04, 0x01, 0xb5, 0x04,
+    0x27, 0x8d, 0x04, 0x01, 0x8f, 0x34, 0x89, 0x18,
+    0x05, 0x8d, 0x34, 0x81, 0x1c, 0xa2, 0x18, 0x00,
+    0x92, 0x18, 0x00, 0x83, 0x18, 0x03, 0x84, 0x04,
+    0x00, 0xe0, 0x26, 0x04, 0x01, 0x80, 0x18, 0x00,
+    0x9f, 0x18, 0x99, 0x41, 0x85, 0x18, 0x99, 0x41,
+    0x8a, 0x18, 0x89, 0x3a, 0x80, 0x18, 0xac, 0x3a,
+    0x81, 0x18, 0x9e, 0x2d, 0x02, 0x85, 0x2d, 0x01,
+    0x85, 0x2d, 0x01, 0x85, 0x2d, 0x01, 0x82, 0x2d,
+    0x02, 0x86, 0x18, 0x00, 0x86, 0x18, 0x09, 0x84,
+    0x18, 0x01, 0x8b, 0x45, 0x00, 0x99, 0x45, 0x00,
+    0x92, 0x45, 0x00, 0x81, 0x45, 0x00, 0x8e, 0x45,
+    0x01, 0x8d, 0x45, 0x21, 0xe0, 0x1a, 0x45, 0x04,
+    0x82, 0x18, 0x03, 0xac, 0x18, 0x02, 0x88, 0x18,
+    0xce, 0x28, 0x00, 0x8b, 0x18, 0x03, 0x80, 0x28,
+    0x2e, 0xac, 0x18, 0x80, 0x34, 0x60, 0x21, 0x9c,
+    0x47, 0x02, 0xb0, 0x13, 0x0e, 0x80, 0x34, 0x9a,
+    0x18, 0x03, 0xa3, 0x63, 0x08, 0x82, 0x63, 0x9a,
+    0x26, 0x04, 0xaa, 0x65, 0x04, 0x9d, 0x90, 0x00,
+    0x80, 0x90, 0xa3, 0x66, 0x03, 0x8d, 0x66, 0x29,
+    0xcf, 0x1d, 0xaf, 0x78, 0x9d, 0x6c, 0x01, 0x89,
+    0x6c, 0x05, 0xa3, 0x6b, 0x03, 0xa3, 0x6b, 0x03,
+    0xa7, 0x22, 0x07, 0xb3, 0x14, 0x0a, 0x80, 0x14,
+    0x60, 0x2f, 0xe0, 0xd6, 0x44, 0x08, 0x95, 0x44,
+    0x09, 0x87, 0x44, 0x60, 0x37, 0x85, 0x1b, 0x01,
+    0x80, 0x1b, 0x00, 0xab, 0x1b, 0x00, 0x81, 0x1b,
+    0x02, 0x80, 0x1b, 0x01, 0x80, 0x1b, 0x95, 0x33,
+    0x00, 0x88, 0x33, 0x9f, 0x6e, 0x9e, 0x5b, 0x07,
+    0x88, 0x5b, 0x2f, 0x92, 0x30, 0x00, 0x81, 0x30,
+    0x04, 0x84, 0x30, 0x9b, 0x71, 0x02, 0x80, 0x71,
+    0x99, 0x48, 0x04, 0x80, 0x48, 0x3f, 0x9f, 0x54,
+    0x97, 0x53, 0x03, 0x93, 0x53, 0x01, 0xad, 0x53,
+    0x83, 0x3c, 0x00, 0x81, 0x3c, 0x04, 0x87, 0x3c,
+    0x00, 0x82, 0x3c, 0x00, 0x9c, 0x3c, 0x01, 0x82,
+    0x3c, 0x03, 0x89, 0x3c, 0x06, 0x88, 0x3c, 0x06,
+    0x9f, 0x68, 0x9f, 0x64, 0x1f, 0xa6, 0x4d, 0x03,
+    0x8b, 0x4d, 0x08, 0xb5, 0x06, 0x02, 0x86, 0x06,
+    0x95, 0x36, 0x01, 0x87, 0x36, 0x92, 0x35, 0x04,
+    0x87, 0x35, 0x91, 0x72, 0x06, 0x83, 0x72, 0x0b,
+    0x86, 0x72, 0x4f, 0xc8, 0x69, 0x36, 0xb2, 0x62,
+    0x0c, 0xb2, 0x62, 0x06, 0x85, 0x62, 0xa7, 0x2e,
+    0x07, 0x89, 0x2e, 0x60, 0xc5, 0x9e, 0x04, 0x60,
+    0x20, 0xa7, 0x67, 0x07, 0xa9, 0x7c, 0x60, 0x45,
+    0xcd, 0x0e, 0x03, 0x9d, 0x0e, 0x0e, 0x80, 0x0e,
+    0xc1, 0x38, 0x0a, 0x80, 0x38, 0x01, 0x98, 0x7d,
+    0x06, 0x89, 0x7d, 0x05, 0xb4, 0x15, 0x00, 0x90,
+    0x15, 0x08, 0xa6, 0x4a, 0x08, 0xcd, 0x77, 0x01,
+    0x8f, 0x77, 0x00, 0x93, 0x7b, 0x0a, 0x91, 0x3e,
+    0x00, 0xab, 0x3e, 0x40, 0x86, 0x59, 0x00, 0x80,
+    0x59, 0x00, 0x83, 0x59, 0x00, 0x8e, 0x59, 0x00,
+    0x8a, 0x59, 0x05, 0xba, 0x3f, 0x04, 0x89, 0x3f,
+    0x05, 0x83, 0x27, 0x00, 0x87, 0x27, 0x01, 0x81,
+    0x27, 0x01, 0x95, 0x27, 0x00, 0x86, 0x27, 0x00,
+    0x81, 0x27, 0x00, 0x84, 0x27, 0x00, 0x80, 0x34,
+    0x88, 0x27, 0x01, 0x81, 0x27, 0x01, 0x82, 0x27,
+    0x01, 0x80, 0x27, 0x05, 0x80, 0x27, 0x04, 0x86,
+    0x27, 0x01, 0x86, 0x27, 0x02, 0x84, 0x27, 0x60,
+    0x2a, 0xd9, 0x5d, 0x00, 0x80, 0x5d, 0x00, 0x81,
+    0x5d, 0x20, 0xc7, 0x8f, 0x07, 0x89, 0x8f, 0x60,
+    0x45, 0xb5, 0x79, 0x01, 0xa5, 0x79, 0x21, 0xc4,
+    0x56, 0x0a, 0x89, 0x56, 0x05, 0x8c, 0x57, 0x12,
+    0xb7, 0x87, 0x07, 0x89, 0x87, 0x35, 0x9a, 0x02,
+    0x01, 0x8e, 0x02, 0x03, 0x8f, 0x02, 0x60, 0x5f,
+    0xbb, 0x1f, 0x60, 0x03, 0xd2, 0x92, 0x0b, 0x80,
+    0x92, 0x60, 0x9f, 0xc7, 0x94, 0x07, 0xb3, 0x7e,
+    0x01, 0x9c, 0x7e, 0x1c, 0xb8, 0x6f, 0x60, 0xa6,
+    0x88, 0x0c, 0x00, 0xac, 0x0c, 0x00, 0x8d, 0x0c,
+    0x09, 0x9c, 0x0c, 0x02, 0x9f, 0x4e, 0x01, 0x95,
+    0x4e, 0x00, 0x8d, 0x4e, 0x48, 0x86, 0x4f, 0x00,
+    0x81, 0x4f, 0x00, 0xab, 0x4f, 0x02, 0x80, 0x4f,
+    0x00, 0x81, 0x4f, 0x00, 0x88, 0x4f, 0x07, 0x89,
+    0x4f, 0x05, 0x85, 0x2a, 0x00, 0x81, 0x2a, 0x00,
+    0xa4, 0x2a, 0x00, 0x81, 0x2a, 0x00, 0x85, 0x2a,
+    0x06, 0x89, 0x2a, 0x60, 0xd5, 0x98, 0x49, 0x60,
+    0xa6, 0xe3, 0x39, 0x1a, 0x60, 0x05, 0xe0, 0x0e,
+    0x1a, 0x00, 0x84, 0x1a, 0x0a, 0xe0, 0x63, 0x1a,
+    0x6a, 0x5b, 0xe3, 0xce, 0x21, 0x6f, 0x70, 0xe1,
+    0xe6, 0x03, 0x70, 0x11, 0x58, 0xe1, 0xd8, 0x08,
+    0x06, 0x9e, 0x58, 0x00, 0x89, 0x58, 0x03, 0x81,
+    0x58, 0x5f, 0x9d, 0x09, 0x01, 0x85, 0x09, 0x09,
+    0xc5, 0x6d, 0x09, 0x89, 0x6d, 0x00, 0x86, 0x6d,
+    0x00, 0x94, 0x6d, 0x04, 0x92, 0x6d, 0x62, 0x4f,
+    0xda, 0x50, 0x60, 0x04, 0xc4, 0x55, 0x0a, 0xae,
+    0x55, 0x0f, 0x90, 0x55, 0x3f, 0x80, 0x89, 0x80,
+    0x5f, 0x1d, 0xf0, 0x07, 0x91, 0x89, 0x0d, 0xe2,
+    0x92, 0x89, 0x70, 0x14, 0xac, 0x80, 0x3a, 0xe0,
+    0xbd, 0x32, 0x50, 0xe1, 0x2b, 0x5f, 0x68, 0xa3,
+    0xe0, 0x0a, 0x20, 0x04, 0x8c, 0x20, 0x02, 0x88,
+    0x20, 0x06, 0x89, 0x20, 0x01, 0x83, 0x20, 0x83,
+    0x18, 0x70, 0x02, 0xfb, 0xe0, 0x95, 0x18, 0x09,
+    0xa6, 0x18, 0x01, 0xbd, 0x18, 0x82, 0x34, 0x90,
+    0x18, 0x87, 0x34, 0x81, 0x18, 0x86, 0x34, 0x9d,
+    0x18, 0x83, 0x34, 0xba, 0x18, 0x16, 0xc5, 0x28,
+    0x60, 0x39, 0x93, 0x18, 0x0b, 0xd6, 0x18, 0x08,
+    0x98, 0x18, 0x60, 0x26, 0xd4, 0x18, 0x00, 0xc6,
+    0x18, 0x00, 0x81, 0x18, 0x01, 0x80, 0x18, 0x01,
+    0x81, 0x18, 0x01, 0x83, 0x18, 0x00, 0x8b, 0x18,
+    0x00, 0x80, 0x18, 0x00, 0x86, 0x18, 0x00, 0xc0,
+    0x18, 0x00, 0x83, 0x18, 0x01, 0x87, 0x18, 0x00,
+    0x86, 0x18, 0x00, 0x9b, 0x18, 0x00, 0x83, 0x18,
+    0x00, 0x84, 0x18, 0x00, 0x80, 0x18, 0x02, 0x86,
+    0x18, 0x00, 0xe0, 0xf3, 0x18, 0x01, 0xe0, 0xc3,
+    0x18, 0x01, 0xb1, 0x18, 0xe2, 0x2b, 0x7a, 0x0e,
+    0x84, 0x7a, 0x00, 0x8e, 0x7a, 0x64, 0xef, 0x86,
+    0x25, 0x00, 0x90, 0x25, 0x01, 0x86, 0x25, 0x00,
+    0x81, 0x25, 0x00, 0x84, 0x25, 0x67, 0x74, 0xe0,
+    0x64, 0x52, 0x01, 0x8f, 0x52, 0x28, 0xca, 0x01,
+    0x04, 0x89, 0x01, 0x03, 0x81, 0x01, 0x62, 0xb0,
+    0xc3, 0x18, 0x60, 0xea, 0x83, 0x04, 0x00, 0x9a,
+    0x04, 0x00, 0x81, 0x04, 0x00, 0x80, 0x04, 0x01,
+    0x80, 0x04, 0x00, 0x89, 0x04, 0x00, 0x83, 0x04,
+    0x00, 0x80, 0x04, 0x00, 0x80, 0x04, 0x05, 0x80,
+    0x04, 0x03, 0x80, 0x04, 0x00, 0x80, 0x04, 0x00,
+    0x80, 0x04, 0x00, 0x82, 0x04, 0x00, 0x81, 0x04,
+    0x00, 0x80, 0x04, 0x01, 0x80, 0x04, 0x00, 0x80,
+    0x04, 0x00, 0x80, 0x04, 0x00, 0x80, 0x04, 0x00,
+    0x80, 0x04, 0x00, 0x81, 0x04, 0x00, 0x80, 0x04,
+    0x01, 0x83, 0x04, 0x00, 0x86, 0x04, 0x00, 0x83,
+    0x04, 0x00, 0x83, 0x04, 0x00, 0x80, 0x04, 0x00,
+    0x89, 0x04, 0x00, 0x90, 0x04, 0x04, 0x82, 0x04,
+    0x00, 0x84, 0x04, 0x00, 0x90, 0x04, 0x33, 0x81,
+    0x04, 0x60, 0xad, 0xab, 0x18, 0x03, 0xe0, 0x03,
+    0x18, 0x0b, 0x8e, 0x18, 0x01, 0x8e, 0x18, 0x00,
+    0x8e, 0x18, 0x00, 0xa4, 0x18, 0x09, 0x8c, 0x18,
+    0x02, 0xdb, 0x18, 0x03, 0xbc, 0x18, 0x38, 0x99,
+    0x18, 0x80, 0x32, 0x81, 0x18, 0x0c, 0xab, 0x18,
+    0x03, 0x88, 0x18, 0x06, 0x81, 0x18, 0x0d, 0x85,
+    0x18, 0x60, 0x39, 0xe3, 0x74, 0x18, 0x0a, 0x8c,
+    0x18, 0x02, 0x89, 0x18, 0x05, 0xe0, 0x13, 0x18,
+    0x0b, 0xd8, 0x18, 0x26, 0x8b, 0x18, 0x03, 0xb7,
+    0x18, 0x07, 0x89, 0x18, 0x05, 0xa7, 0x18, 0x07,
+    0x9d, 0x18, 0x51, 0x8b, 0x18, 0x03, 0xae, 0x18,
+    0x00, 0xb0, 0x18, 0x01, 0x83, 0x18, 0x02, 0x80,
+    0x18, 0x00, 0xa6, 0x18, 0x0c, 0x89, 0x18, 0x05,
+    0x82, 0x18, 0x0c, 0xaf, 0x18, 0x5f, 0x8d, 0x18,
+    0x65, 0x31, 0xf0, 0x96, 0x76, 0x2c, 0x28, 0xef,
+    0xd4, 0x2c, 0x0a, 0xe0, 0x7d, 0x2c, 0x01, 0xf0,
+    0x06, 0x21, 0x2c, 0x0d, 0xf0, 0x0c, 0xd0, 0x2c,
+    0x6b, 0xbe, 0xe1, 0xbd, 0x2c, 0x7a, 0xf5, 0x82,
+    0x80, 0x18, 0x1d, 0xdf, 0x18, 0x60, 0x1f, 0xe0,
+    0x8f, 0x34,
+};
+
+static const uint8_t unicode_script_ext_table[735] = {
+    0x82, 0xc1, 0x00, 0x00, 0x01, 0x28, 0x01, 0x00,
+    0x00, 0x01, 0x28, 0x1c, 0x00, 0x0c, 0x01, 0x41,
+    0x80, 0x92, 0x00, 0x00, 0x02, 0x1c, 0x65, 0x00,
+    0x02, 0x1c, 0x25, 0x01, 0x02, 0x1c, 0x41, 0x00,
+    0x02, 0x1c, 0x25, 0x80, 0x80, 0x00, 0x00, 0x02,
+    0x05, 0x24, 0x80, 0x01, 0x00, 0x00, 0x04, 0x04,
+    0x2e, 0x81, 0x8b, 0x0d, 0x00, 0x00, 0x04, 0x04,
+    0x2e, 0x81, 0x8b, 0x00, 0x03, 0x04, 0x81, 0x8b,
+    0x01, 0x00, 0x00, 0x04, 0x04, 0x2e, 0x81, 0x8b,
+    0x1f, 0x00, 0x00, 0x08, 0x01, 0x04, 0x4c, 0x4d,
+    0x72, 0x2e, 0x7c, 0x81, 0x09, 0x00, 0x0a, 0x02,
+    0x04, 0x81, 0x09, 0x00, 0x09, 0x02, 0x04, 0x8b,
+    0x05, 0x00, 0x00, 0x02, 0x04, 0x81, 0x62, 0x00,
+    0x00, 0x02, 0x04, 0x2e, 0x81, 0xfb, 0x00, 0x00,
+    0x0d, 0x0b, 0x1e, 0x27, 0x29, 0x2b, 0x39, 0x41,
+    0x4b, 0x6a, 0x77, 0x88, 0x8a, 0x8f, 0x00, 0x0c,
+    0x0b, 0x1e, 0x27, 0x29, 0x2b, 0x39, 0x41, 0x4b,
+    0x6a, 0x88, 0x8a, 0x8f, 0x10, 0x00, 0x00, 0x12,
+    0x0b, 0x1e, 0x1f, 0x2a, 0x27, 0x29, 0x2b, 0x39,
+    0x4a, 0x4b, 0x6a, 0x3f, 0x7b, 0x80, 0x87, 0x88,
+    0x8a, 0x8f, 0x00, 0x13, 0x0b, 0x1e, 0x1f, 0x2a,
+    0x27, 0x29, 0x2b, 0x39, 0x43, 0x4a, 0x4b, 0x6a,
+    0x3f, 0x7b, 0x80, 0x87, 0x88, 0x8a, 0x8f, 0x09,
+    0x04, 0x1e, 0x1f, 0x38, 0x4a, 0x75, 0x00, 0x09,
+    0x03, 0x0b, 0x15, 0x80, 0x75, 0x00, 0x09, 0x02,
+    0x2b, 0x59, 0x75, 0x00, 0x09, 0x02, 0x29, 0x3e,
+    0x80, 0x75, 0x00, 0x0d, 0x02, 0x27, 0x88, 0x83,
+    0xcb, 0x00, 0x09, 0x03, 0x15, 0x5a, 0x84, 0x80,
+    0x30, 0x00, 0x00, 0x02, 0x24, 0x41, 0x85, 0xb8,
+    0x00, 0x01, 0x04, 0x11, 0x2f, 0x83, 0x82, 0x80,
+    0x4a, 0x00, 0x01, 0x02, 0x57, 0x70, 0x00, 0x00,
+    0x00, 0x02, 0x57, 0x70, 0x84, 0x49, 0x00, 0x00,
+    0x04, 0x0b, 0x1e, 0x27, 0x39, 0x00, 0x01, 0x1e,
+    0x00, 0x04, 0x0b, 0x1e, 0x27, 0x39, 0x00, 0x02,
+    0x1e, 0x27, 0x00, 0x01, 0x1e, 0x01, 0x02, 0x0b,
+    0x1e, 0x00, 0x02, 0x1e, 0x77, 0x00, 0x02, 0x0b,
+    0x1e, 0x00, 0x02, 0x1e, 0x77, 0x00, 0x06, 0x1e,
+    0x39, 0x4b, 0x6a, 0x88, 0x8a, 0x00, 0x01, 0x1e,
+    0x01, 0x02, 0x1e, 0x77, 0x01, 0x01, 0x1e, 0x00,
+    0x02, 0x1e, 0x77, 0x00, 0x02, 0x0b, 0x1e, 0x07,
+    0x01, 0x1e, 0x00, 0x02, 0x0b, 0x1e, 0x01, 0x01,
+    0x1e, 0x00, 0x02, 0x0b, 0x1e, 0x03, 0x01, 0x1e,
+    0x01, 0x02, 0x1e, 0x27, 0x00, 0x03, 0x1e, 0x27,
+    0x39, 0x01, 0x02, 0x0b, 0x1e, 0x00, 0x01, 0x0b,
+    0x01, 0x02, 0x1e, 0x27, 0x80, 0x45, 0x00, 0x01,
+    0x01, 0x28, 0x82, 0xad, 0x00, 0x00, 0x03, 0x1e,
+    0x27, 0x41, 0x8c, 0xd1, 0x00, 0x00, 0x02, 0x1c,
+    0x25, 0x81, 0x3c, 0x00, 0x01, 0x06, 0x0d, 0x2d,
+    0x2c, 0x32, 0x3a, 0x93, 0x00, 0x05, 0x0d, 0x2d,
+    0x2c, 0x32, 0x3a, 0x01, 0x00, 0x00, 0x01, 0x2c,
+    0x00, 0x00, 0x09, 0x06, 0x0d, 0x2d, 0x2c, 0x32,
+    0x3a, 0x93, 0x00, 0x00, 0x00, 0x05, 0x0d, 0x2d,
+    0x2c, 0x32, 0x3a, 0x07, 0x06, 0x0d, 0x2d, 0x2c,
+    0x32, 0x3a, 0x93, 0x03, 0x05, 0x0d, 0x2d, 0x2c,
+    0x32, 0x3a, 0x09, 0x00, 0x03, 0x02, 0x0d, 0x2c,
+    0x01, 0x00, 0x00, 0x05, 0x0d, 0x2d, 0x2c, 0x32,
+    0x3a, 0x04, 0x02, 0x32, 0x3a, 0x00, 0x00, 0x00,
+    0x05, 0x0d, 0x2d, 0x2c, 0x32, 0x3a, 0x03, 0x00,
+    0x01, 0x03, 0x2c, 0x32, 0x3a, 0x01, 0x01, 0x2c,
+    0x58, 0x00, 0x03, 0x02, 0x32, 0x3a, 0x02, 0x00,
+    0x00, 0x02, 0x32, 0x3a, 0x59, 0x00, 0x00, 0x06,
+    0x0d, 0x2d, 0x2c, 0x32, 0x3a, 0x93, 0x00, 0x02,
+    0x32, 0x3a, 0x80, 0x12, 0x00, 0x0f, 0x01, 0x2c,
+    0x1f, 0x00, 0x23, 0x01, 0x2c, 0x3b, 0x00, 0x27,
+    0x01, 0x2c, 0x37, 0x00, 0x30, 0x01, 0x2c, 0x0e,
+    0x00, 0x0b, 0x01, 0x2c, 0x80, 0x0b, 0x00, 0x18,
+    0x01, 0x2c, 0x09, 0x00, 0x04, 0x01, 0x2c, 0x5f,
+    0x00, 0x1e, 0x01, 0x2c, 0xc0, 0x31, 0xef, 0x00,
+    0x00, 0x02, 0x1c, 0x25, 0x81, 0x3f, 0x00, 0x02,
+    0x0d, 0x1e, 0x1f, 0x29, 0x2b, 0x3e, 0x39, 0x38,
+    0x4a, 0x4b, 0x56, 0x3f, 0x87, 0x8f, 0x02, 0x0c,
+    0x1e, 0x1f, 0x29, 0x2b, 0x3e, 0x39, 0x38, 0x4a,
+    0x56, 0x3f, 0x87, 0x8f, 0x03, 0x0b, 0x1e, 0x1f,
+    0x29, 0x2b, 0x3e, 0x38, 0x4a, 0x56, 0x3f, 0x87,
+    0x8f, 0x80, 0x36, 0x00, 0x00, 0x02, 0x0b, 0x1e,
+    0x00, 0x00, 0x00, 0x02, 0x1e, 0x88, 0x39, 0x00,
+    0x00, 0x03, 0x3b, 0x41, 0x5a, 0x80, 0x1f, 0x00,
+    0x00, 0x02, 0x10, 0x37, 0xc0, 0x13, 0xa1, 0x00,
+    0x00, 0x02, 0x04, 0x8b, 0x09, 0x00, 0x00, 0x02,
+    0x04, 0x8b, 0x46, 0x00, 0x01, 0x05, 0x0d, 0x2d,
+    0x2c, 0x32, 0x3a, 0x80, 0x99, 0x00, 0x04, 0x06,
+    0x0d, 0x2d, 0x2c, 0x32, 0x3a, 0x93, 0x09, 0x00,
+    0x00, 0x02, 0x32, 0x3a, 0x2c, 0x00, 0x01, 0x02,
+    0x32, 0x3a, 0x80, 0xdf, 0x00, 0x02, 0x02, 0x1b,
+    0x45, 0x03, 0x00, 0x2c, 0x03, 0x1b, 0x44, 0x45,
+    0x02, 0x00, 0x08, 0x02, 0x1b, 0x45, 0x81, 0x1f,
+    0x00, 0x1b, 0x02, 0x04, 0x19, 0x8f, 0x84, 0x00,
+    0x00, 0x02, 0x27, 0x88, 0x00, 0x00, 0x00, 0x02,
+    0x27, 0x88, 0x36, 0x00, 0x01, 0x02, 0x27, 0x88,
+    0xc0, 0x68, 0xe2, 0x00, 0x03, 0x01, 0x20, 0x96,
+    0x3b, 0x00, 0x11, 0x01, 0x2c, 0x9e, 0x5d, 0x00,
+    0x01, 0x01, 0x2c, 0xce, 0xcd, 0x2d, 0x00,
+};
+
+static const uint8_t unicode_prop_Hyphen_table[28] = {
+    0xac, 0x80, 0xfe, 0x80, 0x44, 0xdb, 0x80, 0x52,
+    0x7a, 0x80, 0x48, 0x08, 0x81, 0x4e, 0x04, 0x80,
+    0x42, 0xe2, 0x80, 0x60, 0xcd, 0x66, 0x80, 0x40,
+    0xa8, 0x80, 0xd6, 0x80,
+};
+
+static const uint8_t unicode_prop_Other_Math_table[200] = {
+    0xdd, 0x80, 0x43, 0x70, 0x11, 0x80, 0x99, 0x09,
+    0x81, 0x5c, 0x1f, 0x80, 0x9a, 0x82, 0x8a, 0x80,
+    0x9f, 0x83, 0x97, 0x81, 0x8d, 0x81, 0xc0, 0x8c,
+    0x18, 0x11, 0x1c, 0x91, 0x03, 0x01, 0x89, 0x00,
+    0x14, 0x28, 0x11, 0x09, 0x02, 0x05, 0x13, 0x24,
+    0xca, 0x21, 0x18, 0x08, 0x08, 0x00, 0x21, 0x0b,
+    0x0b, 0x91, 0x09, 0x00, 0x06, 0x00, 0x29, 0x41,
+    0x21, 0x83, 0x40, 0xa7, 0x08, 0x80, 0x97, 0x80,
+    0x90, 0x80, 0x41, 0xbc, 0x81, 0x8b, 0x88, 0x24,
+    0x21, 0x09, 0x14, 0x8d, 0x00, 0x01, 0x85, 0x97,
+    0x81, 0xb8, 0x00, 0x80, 0x9c, 0x83, 0x88, 0x81,
+    0x41, 0x55, 0x81, 0x9e, 0x89, 0x41, 0x92, 0x95,
+    0xbe, 0x83, 0x9f, 0x81, 0x60, 0xd4, 0x62, 0x00,
+    0x03, 0x80, 0x40, 0xd2, 0x00, 0x80, 0x60, 0xd4,
+    0xc0, 0xd4, 0x80, 0xc6, 0x01, 0x08, 0x09, 0x0b,
+    0x80, 0x8b, 0x00, 0x06, 0x80, 0xc0, 0x03, 0x0f,
+    0x06, 0x80, 0x9b, 0x03, 0x04, 0x00, 0x16, 0x80,
+    0x41, 0x53, 0x81, 0x98, 0x80, 0x98, 0x80, 0x9e,
+    0x80, 0x98, 0x80, 0x9e, 0x80, 0x98, 0x80, 0x9e,
+    0x80, 0x98, 0x80, 0x9e, 0x80, 0x98, 0x07, 0x81,
+    0xb1, 0x55, 0xff, 0x18, 0x9a, 0x01, 0x00, 0x08,
+    0x80, 0x89, 0x03, 0x00, 0x00, 0x28, 0x18, 0x00,
+    0x00, 0x02, 0x01, 0x00, 0x08, 0x00, 0x00, 0x00,
+    0x00, 0x01, 0x00, 0x0b, 0x06, 0x03, 0x03, 0x00,
+    0x80, 0x89, 0x80, 0x90, 0x22, 0x04, 0x80, 0x90,
+};
+
+static const uint8_t unicode_prop_Other_Alphabetic_table[389] = {
+    0x43, 0x44, 0x80, 0x42, 0x69, 0x8d, 0x00, 0x01,
+    0x01, 0x00, 0xc7, 0x8a, 0xaf, 0x8c, 0x06, 0x8f,
+    0x80, 0xe4, 0x33, 0x19, 0x0b, 0x80, 0xa2, 0x80,
+    0x9d, 0x8f, 0xe5, 0x8a, 0xe4, 0x0a, 0x88, 0x02,
+    0x03, 0x40, 0xa6, 0x8b, 0x16, 0x85, 0x93, 0xb5,
+    0x09, 0x8e, 0x01, 0x22, 0x89, 0x81, 0x9c, 0x82,
+    0xb9, 0x31, 0x09, 0x81, 0x89, 0x80, 0x89, 0x81,
+    0x9c, 0x82, 0xb9, 0x23, 0x09, 0x0b, 0x80, 0x9d,
+    0x0a, 0x80, 0x8a, 0x82, 0xb9, 0x38, 0x10, 0x81,
+    0x94, 0x81, 0x95, 0x13, 0x82, 0xb9, 0x31, 0x09,
+    0x81, 0x88, 0x81, 0x89, 0x81, 0x9d, 0x80, 0xba,
+    0x22, 0x10, 0x82, 0x89, 0x80, 0xa7, 0x83, 0xb9,
+    0x30, 0x10, 0x17, 0x81, 0x8a, 0x81, 0x9c, 0x82,
+    0xb9, 0x30, 0x10, 0x17, 0x81, 0x8a, 0x81, 0x9b,
+    0x83, 0xb9, 0x30, 0x10, 0x82, 0x89, 0x80, 0x89,
+    0x81, 0x9d, 0x81, 0xca, 0x28, 0x00, 0x87, 0x91,
+    0x81, 0xbc, 0x01, 0x86, 0x91, 0x80, 0xe2, 0x01,
+    0x28, 0x81, 0x8f, 0x80, 0x40, 0xa2, 0x90, 0x8a,
+    0x8a, 0x80, 0xa3, 0xed, 0x8b, 0x00, 0x0b, 0x96,
+    0x1b, 0x10, 0x03, 0x0f, 0x83, 0x8c, 0x84, 0x94,
+    0x81, 0x42, 0xc0, 0x80, 0x43, 0xb1, 0x81, 0x9d,
+    0x81, 0x9d, 0x81, 0x9d, 0x81, 0xc1, 0x92, 0x40,
+    0xbb, 0x81, 0xa1, 0x80, 0xf5, 0x8b, 0x83, 0x88,
+    0x40, 0xdd, 0x84, 0xb8, 0x89, 0x81, 0x93, 0x40,
+    0x8a, 0x84, 0xaf, 0x8e, 0xbb, 0x82, 0x9d, 0x88,
+    0x09, 0xb8, 0x8a, 0xb1, 0x91, 0x40, 0xbb, 0x81,
+    0x40, 0xf2, 0x8d, 0x46, 0xc0, 0xb3, 0x48, 0xf5,
+    0x9f, 0x60, 0x78, 0x73, 0x87, 0xa1, 0x81, 0x41,
+    0x82, 0x84, 0xd7, 0x81, 0xb1, 0x8f, 0x00, 0xdf,
+    0x84, 0x9b, 0x8b, 0xac, 0x83, 0xaf, 0x8b, 0xe8,
+    0x8d, 0x8b, 0x07, 0x81, 0xe1, 0x00, 0x11, 0x0c,
+    0x80, 0xab, 0x24, 0x80, 0x40, 0xec, 0x87, 0x60,
+    0x4f, 0x32, 0x80, 0x48, 0x56, 0x84, 0x46, 0x85,
+    0x10, 0x0c, 0x83, 0x43, 0x13, 0x83, 0x42, 0xd7,
+    0x82, 0xb4, 0x8d, 0xbb, 0x80, 0xac, 0x88, 0xc6,
+    0x82, 0xa3, 0x8b, 0x91, 0x81, 0xb8, 0x82, 0xaf,
+    0x8c, 0xeb, 0x88, 0x08, 0x28, 0x40, 0x9f, 0x89,
+    0x96, 0x83, 0xb9, 0x31, 0x09, 0x81, 0x89, 0x80,
+    0x89, 0x81, 0x40, 0xd0, 0x8c, 0x02, 0xe9, 0x91,
+    0x40, 0xec, 0x31, 0x86, 0x9c, 0x81, 0xd1, 0x8e,
+    0x00, 0xe9, 0x8a, 0xe6, 0x8d, 0x41, 0x00, 0x8c,
+    0x41, 0xc7, 0x89, 0xa9, 0x20, 0x83, 0x91, 0x8a,
+    0xad, 0x8d, 0x41, 0x96, 0x38, 0x86, 0xd2, 0x95,
+    0x80, 0x8d, 0xf9, 0x2a, 0x00, 0x08, 0x10, 0x02,
+    0x80, 0xc1, 0x20, 0x08, 0x83, 0x41, 0x5b, 0x83,
+    0x60, 0x4c, 0x38, 0x86, 0x44, 0x19, 0xad, 0x60,
+    0x4d, 0x1e, 0x80, 0x60, 0x23, 0x60, 0x30, 0x90,
+    0x0e, 0x01, 0x04, 0x49, 0x1b, 0x80, 0x47, 0xe7,
+    0x99, 0x85, 0x99, 0x85, 0x99,
+};
+
+static const uint8_t unicode_prop_Other_Lowercase_table[51] = {
+    0x40, 0xa9, 0x80, 0x8e, 0x80, 0x41, 0xf4, 0x88,
+    0x31, 0x9d, 0x84, 0xdf, 0x80, 0xb3, 0x80, 0x59,
+    0xb0, 0xbe, 0x8c, 0x80, 0xa1, 0xa4, 0x42, 0xb0,
+    0x80, 0x8c, 0x80, 0x8f, 0x8c, 0x40, 0xd2, 0x8f,
+    0x43, 0x4f, 0x99, 0x47, 0x91, 0x81, 0x60, 0x7a,
+    0x1d, 0x81, 0x40, 0xd1, 0x80, 0x40, 0x86, 0x81,
+    0x43, 0x61, 0x83,
+};
+
+static const uint8_t unicode_prop_Other_Uppercase_table[15] = {
+    0x60, 0x21, 0x5f, 0x8f, 0x43, 0x45, 0x99, 0x61,
+    0xcc, 0x5f, 0x99, 0x85, 0x99, 0x85, 0x99,
+};
+
+static const uint8_t unicode_prop_Other_Grapheme_Extend_table[59] = {
+    0x49, 0xbd, 0x80, 0x97, 0x80, 0x41, 0x65, 0x80,
+    0x97, 0x80, 0xe5, 0x80, 0x97, 0x80, 0x40, 0xe9,
+    0x80, 0x91, 0x81, 0xe6, 0x80, 0x97, 0x80, 0xf6,
+    0x80, 0x8e, 0x80, 0x52, 0x2b, 0x80, 0x50, 0x20,
+    0x81, 0x60, 0xcf, 0x6d, 0x81, 0x53, 0x9d, 0x80,
+    0x97, 0x80, 0x41, 0x57, 0x80, 0x8b, 0x80, 0x40,
+    0xf0, 0x80, 0x60, 0xbb, 0xb4, 0x07, 0x84, 0x6c,
+    0x2e, 0xac, 0xdf,
+};
+
+static const uint8_t unicode_prop_Other_Default_Ignorable_Code_Point_table[32] = {
+    0x43, 0x4e, 0x80, 0x4e, 0x0e, 0x81, 0x46, 0x52,
+    0x81, 0x48, 0xae, 0x80, 0x50, 0xfd, 0x80, 0x60,
+    0xce, 0x3a, 0x80, 0xce, 0x88, 0x6d, 0x00, 0x06,
+    0x00, 0x9d, 0xdf, 0xff, 0x40, 0xef, 0x4e, 0x0f,
+};
+
+static const uint8_t unicode_prop_Other_ID_Start_table[11] = {
+    0x58, 0x84, 0x81, 0x48, 0x90, 0x80, 0x94, 0x80,
+    0x4f, 0x6b, 0x81,
+};
+
+static const uint8_t unicode_prop_Other_ID_Continue_table[12] = {
+    0x40, 0xb6, 0x80, 0x42, 0xce, 0x80, 0x4f, 0xe0,
+    0x88, 0x46, 0x67, 0x80,
+};
+
+static const uint8_t unicode_prop_Prepended_Concatenation_Mark_table[17] = {
+    0x45, 0xff, 0x85, 0x40, 0xd6, 0x80, 0xb0, 0x80,
+    0x41, 0xd1, 0x80, 0x61, 0x07, 0xd9, 0x80, 0x8e,
+    0x80,
+};
+
+static const uint8_t unicode_prop_XID_Start1_table[31] = {
+    0x43, 0x79, 0x80, 0x4a, 0xb7, 0x80, 0xfe, 0x80,
+    0x60, 0x21, 0xe6, 0x81, 0x60, 0xcb, 0xc0, 0x85,
+    0x41, 0x95, 0x81, 0xf3, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x80, 0x41, 0x1e, 0x81,
+};
+
+static const uint8_t unicode_prop_XID_Continue1_table[23] = {
+    0x43, 0x79, 0x80, 0x60, 0x2d, 0x1f, 0x81, 0x60,
+    0xcb, 0xc0, 0x85, 0x41, 0x95, 0x81, 0xf3, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x80,
+};
+
+static const uint8_t unicode_prop_Changes_When_Titlecased1_table[22] = {
+    0x41, 0xc3, 0x08, 0x08, 0x81, 0xa4, 0x81, 0x4e,
+    0xdc, 0xaa, 0x0a, 0x4e, 0x87, 0x3f, 0x3f, 0x87,
+    0x8b, 0x80, 0x8e, 0x80, 0xae, 0x80,
+};
+
+static const uint8_t unicode_prop_Changes_When_Casefolded1_table[33] = {
+    0x40, 0xde, 0x80, 0xcf, 0x80, 0x97, 0x80, 0x44,
+    0x3c, 0x80, 0x59, 0x11, 0x80, 0x40, 0xe4, 0x3f,
+    0x3f, 0x87, 0x89, 0x11, 0x05, 0x02, 0x11, 0x80,
+    0xa9, 0x11, 0x80, 0x60, 0xdb, 0x07, 0x86, 0x8b,
+    0x84,
+};
+
+static const uint8_t unicode_prop_Changes_When_NFKC_Casefolded1_table[438] = {
+    0x40, 0x9f, 0x06, 0x00, 0x01, 0x00, 0x01, 0x12,
+    0x10, 0x82, 0x9f, 0x80, 0xcf, 0x01, 0x80, 0x8b,
+    0x07, 0x80, 0xfb, 0x01, 0x01, 0x80, 0xa5, 0x80,
+    0x40, 0xbb, 0x88, 0x9e, 0x29, 0x84, 0xda, 0x08,
+    0x81, 0x89, 0x80, 0xa3, 0x04, 0x02, 0x04, 0x08,
+    0x80, 0xc9, 0x82, 0x9c, 0x80, 0x41, 0x93, 0x80,
+    0x40, 0x93, 0x80, 0xd7, 0x83, 0x42, 0xde, 0x87,
+    0xfb, 0x08, 0x80, 0xd2, 0x01, 0x80, 0xa1, 0x11,
+    0x80, 0x40, 0xfc, 0x81, 0x42, 0xd4, 0x80, 0xfe,
+    0x80, 0xa7, 0x81, 0xad, 0x80, 0xb5, 0x80, 0x88,
+    0x03, 0x03, 0x03, 0x80, 0x8b, 0x80, 0x88, 0x00,
+    0x26, 0x80, 0x90, 0x80, 0x88, 0x03, 0x03, 0x03,
+    0x80, 0x8b, 0x80, 0x41, 0x41, 0x80, 0xe1, 0x81,
+    0x46, 0x52, 0x81, 0xd4, 0x83, 0x45, 0x1c, 0x10,
+    0x8a, 0x80, 0x91, 0x80, 0x9b, 0x8c, 0x80, 0xa1,
+    0xa4, 0x40, 0xd9, 0x80, 0x40, 0xd5, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x01, 0x3f, 0x3f, 0x87,
+    0x89, 0x11, 0x04, 0x00, 0x29, 0x04, 0x12, 0x80,
+    0x88, 0x12, 0x80, 0x88, 0x11, 0x11, 0x04, 0x08,
+    0x8f, 0x00, 0x20, 0x8b, 0x12, 0x2a, 0x08, 0x0b,
+    0x00, 0x07, 0x82, 0x8c, 0x06, 0x92, 0x81, 0x9a,
+    0x80, 0x8c, 0x8a, 0x80, 0xd6, 0x18, 0x10, 0x8a,
+    0x01, 0x0c, 0x0a, 0x00, 0x10, 0x11, 0x02, 0x06,
+    0x05, 0x1c, 0x85, 0x8f, 0x8f, 0x8f, 0x88, 0x80,
+    0x40, 0xa1, 0x08, 0x81, 0x40, 0xf7, 0x81, 0x41,
+    0x34, 0xd5, 0x99, 0x9a, 0x45, 0x20, 0x80, 0xe6,
+    0x82, 0xe4, 0x80, 0x41, 0x9e, 0x81, 0x40, 0xf0,
+    0x80, 0x41, 0x2e, 0x80, 0xd2, 0x80, 0x8b, 0x40,
+    0xd5, 0xa9, 0x80, 0xb4, 0x00, 0x82, 0xdf, 0x09,
+    0x80, 0xde, 0x80, 0xb0, 0xdd, 0x82, 0x8d, 0xdf,
+    0x9e, 0x80, 0xa7, 0x87, 0xae, 0x80, 0xfe, 0x80,
+    0x40, 0xff, 0x60, 0x72, 0x9b, 0x81, 0x40, 0xd1,
+    0x80, 0x40, 0x86, 0x81, 0x43, 0x61, 0x83, 0x60,
+    0x4d, 0x9f, 0x41, 0x0d, 0x08, 0x00, 0x81, 0x89,
+    0x00, 0x00, 0x09, 0x82, 0xc3, 0x81, 0xe9, 0xa5,
+    0x86, 0x8b, 0x24, 0x00, 0x97, 0x04, 0x00, 0x01,
+    0x01, 0x80, 0xeb, 0xa0, 0x41, 0x6a, 0x91, 0xbf,
+    0x81, 0xb5, 0xa7, 0x8c, 0x82, 0x99, 0x95, 0x94,
+    0x81, 0x8b, 0x80, 0x92, 0x03, 0x1a, 0x00, 0x80,
+    0x40, 0x86, 0x08, 0x80, 0x9f, 0x99, 0x40, 0x83,
+    0x15, 0x0d, 0x0d, 0x0a, 0x16, 0x06, 0x80, 0x88,
+    0x60, 0xbc, 0xa6, 0x83, 0x54, 0xb9, 0x86, 0x8d,
+    0x87, 0xbf, 0x85, 0x42, 0x3e, 0xd4, 0x80, 0xc6,
+    0x01, 0x08, 0x09, 0x0b, 0x80, 0x8b, 0x00, 0x06,
+    0x80, 0xc0, 0x03, 0x0f, 0x06, 0x80, 0x9b, 0x03,
+    0x04, 0x00, 0x16, 0x80, 0x41, 0x53, 0x81, 0x41,
+    0x23, 0x81, 0xb1, 0x55, 0xff, 0x18, 0x9a, 0x01,
+    0x00, 0x08, 0x80, 0x89, 0x03, 0x00, 0x00, 0x28,
+    0x18, 0x00, 0x00, 0x02, 0x01, 0x00, 0x08, 0x00,
+    0x00, 0x00, 0x00, 0x01, 0x00, 0x0b, 0x06, 0x03,
+    0x03, 0x00, 0x80, 0x89, 0x80, 0x90, 0x22, 0x04,
+    0x80, 0x90, 0x42, 0x43, 0x8a, 0x84, 0x9e, 0x80,
+    0x9f, 0x99, 0x81, 0xa3, 0x80, 0xee, 0x82, 0x8c,
+    0xab, 0x83, 0x88, 0x31, 0x61, 0x05, 0xad, 0x42,
+    0x1d, 0x6b, 0x05, 0xe1, 0x4f, 0xff,
+};
+
+static const uint8_t unicode_prop_ASCII_Hex_Digit_table[5] = {
+    0xaf, 0x89, 0x35, 0x99, 0x85,
+};
+
+static const uint8_t unicode_prop_Bidi_Control_table[10] = {
+    0x46, 0x1b, 0x80, 0x59, 0xf0, 0x81, 0x99, 0x84,
+    0xb6, 0x83,
+};
+
+static const uint8_t unicode_prop_Dash_table[50] = {
+    0xac, 0x80, 0x45, 0x5b, 0x80, 0xb2, 0x80, 0x4e,
+    0x40, 0x80, 0x44, 0x04, 0x80, 0x48, 0x08, 0x85,
+    0xbc, 0x80, 0xa6, 0x80, 0x8e, 0x80, 0x41, 0x85,
+    0x80, 0x4c, 0x03, 0x01, 0x80, 0x9e, 0x0b, 0x80,
+    0x41, 0xda, 0x80, 0x92, 0x80, 0xee, 0x80, 0x60,
+    0xcd, 0x8f, 0x81, 0xa4, 0x80, 0x89, 0x80, 0x40,
+    0xa8, 0x80,
+};
+
+static const uint8_t unicode_prop_Deprecated_table[23] = {
+    0x41, 0x48, 0x80, 0x45, 0x28, 0x80, 0x49, 0x02,
+    0x00, 0x80, 0x48, 0x28, 0x81, 0x48, 0xc4, 0x85,
+    0x42, 0xb8, 0x81, 0x6d, 0xdc, 0xd5, 0x80,
+};
+
+static const uint8_t unicode_prop_Diacritic_table[332] = {
+    0xdd, 0x00, 0x80, 0xc6, 0x05, 0x03, 0x01, 0x81,
+    0x41, 0xf6, 0x40, 0x9e, 0x07, 0x25, 0x90, 0x0b,
+    0x80, 0x88, 0x81, 0x40, 0xfc, 0x84, 0x40, 0xd0,
+    0x80, 0xb6, 0x90, 0x80, 0x9a, 0x00, 0x01, 0x00,
+    0x40, 0x85, 0x3b, 0x81, 0x40, 0x85, 0x0b, 0x0a,
+    0x82, 0xc2, 0x9a, 0xda, 0x8a, 0xb9, 0x8a, 0xa1,
+    0x81, 0x40, 0xc8, 0x9b, 0xbc, 0x80, 0x8f, 0x02,
+    0x83, 0x9b, 0x80, 0xc9, 0x80, 0x8f, 0x80, 0xed,
+    0x80, 0x8f, 0x80, 0xed, 0x80, 0x8f, 0x80, 0xae,
+    0x82, 0xbb, 0x80, 0x8f, 0x80, 0xfe, 0x80, 0xfe,
+    0x80, 0xed, 0x80, 0x8f, 0x80, 0xec, 0x81, 0x8f,
+    0x80, 0xfb, 0x80, 0xfb, 0x28, 0x80, 0xf8, 0x84,
+    0xca, 0x81, 0x9a, 0x00, 0x00, 0x03, 0x81, 0xc1,
+    0x10, 0x81, 0xbd, 0x80, 0xef, 0x00, 0x81, 0xcb,
+    0x30, 0x80, 0x89, 0x81, 0x47, 0x2c, 0x8a, 0x88,
+    0x80, 0x41, 0x5a, 0x82, 0x41, 0x38, 0x39, 0x80,
+    0xaf, 0x8d, 0xf5, 0x80, 0x8e, 0x80, 0xa5, 0x88,
+    0xb5, 0x81, 0x40, 0x89, 0x81, 0xbf, 0x85, 0xd1,
+    0x98, 0x18, 0x28, 0x0a, 0xb1, 0xbe, 0xd8, 0x8b,
+    0xa4, 0x22, 0x82, 0x41, 0xbc, 0x00, 0x82, 0x8a,
+    0x82, 0x8c, 0x82, 0x8c, 0x82, 0x8c, 0x81, 0x4c,
+    0xef, 0x82, 0x41, 0x3c, 0x80, 0x41, 0xf9, 0x85,
+    0xe8, 0x83, 0xde, 0x80, 0x60, 0x75, 0x71, 0x80,
+    0x8b, 0x08, 0x80, 0x9b, 0x81, 0xd1, 0x81, 0xa4,
+    0x8a, 0xe5, 0x80, 0xee, 0x81, 0x40, 0xc9, 0x80,
+    0x9a, 0x91, 0xb8, 0x83, 0xa3, 0x80, 0xde, 0x80,
+    0x8b, 0x80, 0xa3, 0x80, 0x40, 0x94, 0x82, 0xc0,
+    0x83, 0xb2, 0x80, 0xe3, 0x84, 0x40, 0x8b, 0x81,
+    0x60, 0x4f, 0x2f, 0x80, 0x43, 0x00, 0x8f, 0x41,
+    0x0d, 0x00, 0x80, 0xae, 0x80, 0xac, 0x81, 0xc2,
+    0x80, 0x42, 0xfb, 0x80, 0x48, 0x03, 0x81, 0x42,
+    0x3a, 0x85, 0x42, 0x1d, 0x8a, 0x41, 0x67, 0x81,
+    0xf7, 0x81, 0xbd, 0x80, 0xcb, 0x80, 0x88, 0x82,
+    0xe7, 0x81, 0x40, 0xb1, 0x81, 0xd0, 0x80, 0x8f,
+    0x80, 0x97, 0x32, 0x84, 0x40, 0xcc, 0x02, 0x80,
+    0xfa, 0x81, 0x40, 0xfa, 0x81, 0xfd, 0x80, 0xf5,
+    0x81, 0xf2, 0x80, 0x41, 0x0c, 0x81, 0x41, 0xf8,
+    0x80, 0x91, 0x80, 0xd0, 0x80, 0x41, 0xa4, 0x80,
+    0x41, 0x01, 0x00, 0x81, 0xd0, 0x80, 0x60, 0x4d,
+    0x57, 0x84, 0x44, 0x99, 0x90, 0x60, 0x61, 0xc6,
+    0x12, 0x2f, 0x39, 0x86, 0x9d, 0x83, 0x57, 0x21,
+    0x86, 0xec, 0x10, 0x82,
+};
+
+static const uint8_t unicode_prop_Extender_table[82] = {
+    0x40, 0xb6, 0x80, 0x42, 0x17, 0x81, 0x43, 0x6d,
+    0x80, 0x41, 0xb8, 0x80, 0x46, 0x4a, 0x80, 0xfe,
+    0x80, 0x49, 0x42, 0x80, 0xb7, 0x80, 0x42, 0x62,
+    0x80, 0x41, 0x8d, 0x80, 0xc3, 0x80, 0x53, 0x88,
+    0x80, 0xaa, 0x84, 0xe6, 0x81, 0xdc, 0x82, 0x60,
+    0x6f, 0x15, 0x80, 0x45, 0xf5, 0x80, 0x43, 0xc1,
+    0x80, 0x95, 0x80, 0x40, 0x88, 0x80, 0xeb, 0x80,
+    0x94, 0x81, 0x60, 0x54, 0x7a, 0x80, 0x53, 0xeb,
+    0x80, 0x42, 0x67, 0x82, 0x44, 0xce, 0x80, 0x60,
+    0x50, 0xa8, 0x81, 0x44, 0x9b, 0x81, 0x60, 0x79,
+    0x61, 0x82,
+};
+
+static const uint8_t unicode_prop_Hex_Digit_table[12] = {
+    0xaf, 0x89, 0x35, 0x99, 0x85, 0x60, 0xfe, 0xa8,
+    0x89, 0x35, 0x99, 0x85,
+};
+
+static const uint8_t unicode_prop_IDS_Binary_Operator_table[5] = {
+    0x60, 0x2f, 0xef, 0x09, 0x87,
+};
+
+static const uint8_t unicode_prop_IDS_Trinary_Operator_table[4] = {
+    0x60, 0x2f, 0xf1, 0x81,
+};
+
+static const uint8_t unicode_prop_Ideographic_table[58] = {
+    0x60, 0x30, 0x05, 0x81, 0x98, 0x88, 0x8d, 0x82,
+    0x43, 0xc4, 0x59, 0xb5, 0xc9, 0x60, 0x51, 0xef,
+    0x60, 0x59, 0x0f, 0x41, 0x6d, 0x81, 0xe9, 0x60,
+    0x75, 0x25, 0x57, 0xf1, 0x8d, 0x42, 0xf2, 0x60,
+    0x26, 0x7c, 0x41, 0x8b, 0x60, 0x4d, 0x03, 0x60,
+    0xa6, 0xd6, 0xa8, 0x50, 0x34, 0x8a, 0x40, 0xdd,
+    0x81, 0x56, 0x81, 0x8d, 0x5d, 0x30, 0x4c, 0x1e,
+    0x42, 0x1d,
+};
+
+static const uint8_t unicode_prop_Join_Control_table[4] = {
+    0x60, 0x20, 0x0b, 0x81,
+};
+
+static const uint8_t unicode_prop_Logical_Order_Exception_table[15] = {
+    0x4e, 0x3f, 0x84, 0xfa, 0x84, 0x4a, 0xef, 0x11,
+    0x80, 0x60, 0x90, 0xf9, 0x09, 0x00, 0x81,
+};
+
+static const uint8_t unicode_prop_Noncharacter_Code_Point_table[71] = {
+    0x60, 0xfd, 0xcf, 0x9f, 0x42, 0x0d, 0x81, 0x60,
+    0xff, 0xfd, 0x81, 0x60, 0xff, 0xfd, 0x81, 0x60,
+    0xff, 0xfd, 0x81, 0x60, 0xff, 0xfd, 0x81, 0x60,
+    0xff, 0xfd, 0x81, 0x60, 0xff, 0xfd, 0x81, 0x60,
+    0xff, 0xfd, 0x81, 0x60, 0xff, 0xfd, 0x81, 0x60,
+    0xff, 0xfd, 0x81, 0x60, 0xff, 0xfd, 0x81, 0x60,
+    0xff, 0xfd, 0x81, 0x60, 0xff, 0xfd, 0x81, 0x60,
+    0xff, 0xfd, 0x81, 0x60, 0xff, 0xfd, 0x81, 0x60,
+    0xff, 0xfd, 0x81, 0x60, 0xff, 0xfd, 0x81,
+};
+
+static const uint8_t unicode_prop_Pattern_Syntax_table[58] = {
+    0xa0, 0x8e, 0x89, 0x86, 0x99, 0x18, 0x80, 0x99,
+    0x83, 0xa1, 0x30, 0x00, 0x08, 0x00, 0x0b, 0x03,
+    0x02, 0x80, 0x96, 0x80, 0x9e, 0x80, 0x5f, 0x17,
+    0x97, 0x87, 0x8e, 0x81, 0x92, 0x80, 0x89, 0x41,
+    0x30, 0x42, 0xcf, 0x40, 0x9f, 0x42, 0x75, 0x9d,
+    0x44, 0x6b, 0x41, 0xff, 0xff, 0x41, 0x80, 0x13,
+    0x98, 0x8e, 0x80, 0x60, 0xcd, 0x0c, 0x81, 0x41,
+    0x04, 0x81,
+};
+
+static const uint8_t unicode_prop_Pattern_White_Space_table[11] = {
+    0x88, 0x84, 0x91, 0x80, 0xe3, 0x80, 0x5f, 0x87,
+    0x81, 0x97, 0x81,
+};
+
+static const uint8_t unicode_prop_Quotation_Mark_table[31] = {
+    0xa1, 0x03, 0x80, 0x40, 0x82, 0x80, 0x8e, 0x80,
+    0x5f, 0x5b, 0x87, 0x98, 0x81, 0x4e, 0x06, 0x80,
+    0x41, 0xc8, 0x83, 0x8c, 0x82, 0x60, 0xce, 0x20,
+    0x83, 0x40, 0xbc, 0x03, 0x80, 0xd9, 0x81,
+};
+
+static const uint8_t unicode_prop_Radical_table[9] = {
+    0x60, 0x2e, 0x7f, 0x99, 0x80, 0xd8, 0x8b, 0x40,
+    0xd5,
+};
+
+static const uint8_t unicode_prop_Regional_Indicator_table[4] = {
+    0x61, 0xf1, 0xe5, 0x99,
+};
+
+static const uint8_t unicode_prop_Sentence_Terminal_table[184] = {
+    0xa0, 0x80, 0x8b, 0x80, 0x8f, 0x80, 0x45, 0x48,
+    0x80, 0x40, 0x93, 0x81, 0x40, 0xb3, 0x80, 0xaa,
+    0x82, 0x40, 0xf5, 0x80, 0xbc, 0x00, 0x02, 0x81,
+    0x41, 0x24, 0x81, 0x46, 0xe3, 0x81, 0x43, 0x15,
+    0x03, 0x81, 0x43, 0x04, 0x80, 0x40, 0xc5, 0x81,
+    0x40, 0xcb, 0x04, 0x80, 0x41, 0x39, 0x81, 0x41,
+    0x61, 0x83, 0x40, 0xad, 0x09, 0x81, 0x40, 0xda,
+    0x81, 0xc0, 0x81, 0x43, 0xbb, 0x81, 0x88, 0x82,
+    0x4d, 0xe3, 0x80, 0x8c, 0x80, 0x41, 0xc4, 0x80,
+    0x60, 0x74, 0xfb, 0x80, 0x41, 0x0d, 0x81, 0x40,
+    0xe2, 0x02, 0x80, 0x41, 0x7d, 0x81, 0xd5, 0x81,
+    0xde, 0x80, 0x40, 0x97, 0x81, 0x40, 0x92, 0x82,
+    0x40, 0x8f, 0x81, 0x40, 0xf8, 0x80, 0x60, 0x52,
+    0x65, 0x02, 0x81, 0x40, 0xa8, 0x80, 0x8b, 0x80,
+    0x8f, 0x80, 0xc0, 0x80, 0x4a, 0xf3, 0x81, 0x44,
+    0xfc, 0x84, 0x40, 0xec, 0x81, 0xf4, 0x83, 0xfe,
+    0x82, 0x40, 0x80, 0x0d, 0x80, 0x8f, 0x81, 0xd7,
+    0x08, 0x81, 0xeb, 0x80, 0x41, 0xa0, 0x81, 0x41,
+    0x74, 0x0c, 0x8e, 0xe8, 0x81, 0x40, 0xf8, 0x82,
+    0x43, 0x02, 0x81, 0xd6, 0x81, 0x41, 0xa3, 0x81,
+    0x42, 0xb3, 0x81, 0x60, 0x4b, 0x74, 0x81, 0x40,
+    0x84, 0x80, 0xc0, 0x81, 0x8a, 0x80, 0x43, 0x52,
+    0x80, 0x60, 0x4e, 0x05, 0x80, 0x5d, 0xe7, 0x80,
+};
+
+static const uint8_t unicode_prop_Soft_Dotted_table[71] = {
+    0xe8, 0x81, 0x40, 0xc3, 0x80, 0x41, 0x18, 0x80,
+    0x9d, 0x80, 0xb3, 0x80, 0x93, 0x80, 0x41, 0x3f,
+    0x80, 0xe1, 0x00, 0x80, 0x59, 0x08, 0x80, 0xb2,
+    0x80, 0x8c, 0x02, 0x80, 0x40, 0x83, 0x80, 0x40,
+    0x9c, 0x80, 0x41, 0xa4, 0x80, 0x40, 0xd5, 0x81,
+    0x4b, 0x31, 0x80, 0x61, 0xa7, 0xa4, 0x81, 0xb1,
+    0x81, 0xb1, 0x81, 0xb1, 0x81, 0xb1, 0x81, 0xb1,
+    0x81, 0xb1, 0x81, 0xb1, 0x81, 0xb1, 0x81, 0xb1,
+    0x81, 0xb1, 0x81, 0xb1, 0x81, 0xb1, 0x81,
+};
+
+static const uint8_t unicode_prop_Terminal_Punctuation_table[237] = {
+    0xa0, 0x80, 0x89, 0x00, 0x80, 0x8a, 0x0a, 0x80,
+    0x43, 0x3d, 0x07, 0x80, 0x42, 0x00, 0x80, 0xb8,
+    0x80, 0xc7, 0x80, 0x8d, 0x01, 0x81, 0x40, 0xb3,
+    0x80, 0xaa, 0x8a, 0x00, 0x40, 0xea, 0x81, 0xb5,
+    0x8e, 0x9e, 0x80, 0x41, 0x04, 0x81, 0x44, 0xf3,
+    0x81, 0x40, 0xab, 0x03, 0x85, 0x41, 0x36, 0x81,
+    0x43, 0x14, 0x87, 0x43, 0x03, 0x81, 0xfb, 0x82,
+    0xc6, 0x81, 0x40, 0x9c, 0x12, 0x80, 0xa6, 0x19,
+    0x81, 0x41, 0x39, 0x81, 0x41, 0x61, 0x83, 0x40,
+    0xad, 0x08, 0x82, 0x40, 0xda, 0x84, 0xbd, 0x81,
+    0x43, 0xbb, 0x81, 0x88, 0x82, 0x4d, 0xe3, 0x80,
+    0x8c, 0x03, 0x80, 0x89, 0x00, 0x80, 0x41, 0xb1,
+    0x81, 0x60, 0x74, 0xfa, 0x81, 0x41, 0x0c, 0x82,
+    0x40, 0xe2, 0x84, 0x41, 0x7d, 0x81, 0xd5, 0x81,
+    0xde, 0x80, 0x40, 0x96, 0x82, 0x40, 0x92, 0x82,
+    0xfe, 0x80, 0x8f, 0x81, 0x40, 0xf8, 0x80, 0x60,
+    0x52, 0x63, 0x10, 0x83, 0x40, 0xa8, 0x80, 0x89,
+    0x00, 0x80, 0x8a, 0x0a, 0x80, 0xc0, 0x01, 0x80,
+    0x44, 0x39, 0x80, 0xaf, 0x80, 0x44, 0x85, 0x80,
+    0x40, 0xc6, 0x80, 0x41, 0x35, 0x81, 0x40, 0x97,
+    0x85, 0xc3, 0x85, 0xd8, 0x83, 0x43, 0xb7, 0x84,
+    0x40, 0xec, 0x86, 0xef, 0x83, 0xfe, 0x82, 0x40,
+    0x80, 0x0d, 0x80, 0x8f, 0x81, 0xd7, 0x84, 0xeb,
+    0x80, 0x41, 0xa0, 0x82, 0x8c, 0x80, 0x41, 0x65,
+    0x1a, 0x8e, 0xe8, 0x81, 0x40, 0xf8, 0x82, 0x43,
+    0x02, 0x81, 0xd6, 0x0b, 0x81, 0x41, 0x9d, 0x82,
+    0xac, 0x80, 0x42, 0x84, 0x81, 0x45, 0x76, 0x84,
+    0x60, 0x45, 0xf8, 0x81, 0x40, 0x84, 0x80, 0xc0,
+    0x82, 0x89, 0x80, 0x43, 0x51, 0x81, 0x60, 0x4e,
+    0x05, 0x80, 0x5d, 0xe6, 0x83,
+};
+
+static const uint8_t unicode_prop_Unified_Ideograph_table[38] = {
+    0x60, 0x33, 0xff, 0x59, 0xb5, 0xc9, 0x60, 0x51,
+    0xef, 0x60, 0x5a, 0x1d, 0x08, 0x00, 0x81, 0x89,
+    0x00, 0x00, 0x09, 0x82, 0x61, 0x05, 0xd5, 0x60,
+    0xa6, 0xd6, 0xa8, 0x50, 0x34, 0x8a, 0x40, 0xdd,
+    0x81, 0x56, 0x81, 0x8d, 0x5d, 0x30,
+};
+
+static const uint8_t unicode_prop_Variation_Selector_table[12] = {
+    0x58, 0x0a, 0x82, 0x60, 0xe5, 0xf1, 0x8f, 0x6d,
+    0x02, 0xef, 0x40, 0xef,
+};
+
+static const uint8_t unicode_prop_White_Space_table[22] = {
+    0x88, 0x84, 0x91, 0x80, 0xe3, 0x80, 0x99, 0x80,
+    0x55, 0xde, 0x80, 0x49, 0x7e, 0x8a, 0x9c, 0x0c,
+    0x80, 0xae, 0x80, 0x4f, 0x9f, 0x80,
+};
+
+static const uint8_t unicode_prop_Bidi_Mirrored_table[171] = {
+    0xa7, 0x81, 0x91, 0x00, 0x80, 0x9b, 0x00, 0x80,
+    0x9c, 0x00, 0x80, 0xac, 0x80, 0x8e, 0x80, 0x4e,
+    0x7d, 0x83, 0x47, 0x5c, 0x81, 0x49, 0x9b, 0x81,
+    0x89, 0x81, 0xb5, 0x81, 0x8d, 0x81, 0x40, 0xb0,
+    0x80, 0x40, 0xbf, 0x1a, 0x2a, 0x02, 0x0a, 0x18,
+    0x18, 0x00, 0x03, 0x88, 0x20, 0x80, 0x91, 0x23,
+    0x88, 0x08, 0x00, 0x39, 0x9e, 0x0b, 0x20, 0x88,
+    0x09, 0x92, 0x21, 0x88, 0x21, 0x0b, 0x97, 0x81,
+    0x8f, 0x3b, 0x93, 0x0e, 0x81, 0x44, 0x3c, 0x8d,
+    0xc9, 0x01, 0x18, 0x08, 0x14, 0x1c, 0x12, 0x8d,
+    0x41, 0x92, 0x95, 0x0d, 0x80, 0x8d, 0x38, 0x35,
+    0x10, 0x1c, 0x01, 0x0c, 0x18, 0x02, 0x09, 0x89,
+    0x29, 0x81, 0x8b, 0x92, 0x03, 0x08, 0x00, 0x08,
+    0x03, 0x21, 0x2a, 0x97, 0x81, 0x8a, 0x0b, 0x18,
+    0x09, 0x0b, 0xaa, 0x0f, 0x80, 0xa7, 0x20, 0x00,
+    0x14, 0x22, 0x18, 0x14, 0x00, 0x40, 0xff, 0x80,
+    0x42, 0x02, 0x1a, 0x08, 0x81, 0x8d, 0x09, 0x89,
+    0x41, 0xdd, 0x89, 0x0f, 0x60, 0xce, 0x3c, 0x2c,
+    0x81, 0x40, 0xa1, 0x81, 0x91, 0x00, 0x80, 0x9b,
+    0x00, 0x80, 0x9c, 0x00, 0x00, 0x08, 0x81, 0x60,
+    0xd7, 0x76, 0x80, 0xb8, 0x80, 0xb8, 0x80, 0xb8,
+    0x80, 0xb8, 0x80,
+};
+
+static const uint8_t unicode_prop_Emoji_table[227] = {
+    0xa2, 0x05, 0x04, 0x89, 0xee, 0x03, 0x80, 0x5f,
+    0x8c, 0x80, 0x8b, 0x80, 0x40, 0xd7, 0x80, 0x95,
+    0x80, 0xd9, 0x85, 0x8e, 0x81, 0x41, 0x6e, 0x81,
+    0x8b, 0x80, 0x40, 0xa5, 0x80, 0x98, 0x8a, 0x1a,
+    0x40, 0xc6, 0x80, 0x40, 0xe6, 0x81, 0x89, 0x80,
+    0x88, 0x80, 0xb9, 0x18, 0x84, 0x88, 0x01, 0x01,
+    0x09, 0x03, 0x01, 0x00, 0x09, 0x02, 0x02, 0x0f,
+    0x14, 0x00, 0x04, 0x8b, 0x8a, 0x09, 0x00, 0x08,
+    0x80, 0x91, 0x01, 0x81, 0x91, 0x28, 0x00, 0x0a,
+    0x0f, 0x0b, 0x81, 0x8a, 0x0c, 0x09, 0x04, 0x08,
+    0x00, 0x81, 0x93, 0x0c, 0x28, 0x19, 0x03, 0x01,
+    0x01, 0x28, 0x01, 0x00, 0x00, 0x05, 0x02, 0x05,
+    0x80, 0x89, 0x81, 0x8e, 0x01, 0x03, 0x00, 0x03,
+    0x10, 0x80, 0x8a, 0x81, 0xaf, 0x82, 0x88, 0x80,
+    0x8d, 0x80, 0x8d, 0x80, 0x41, 0x73, 0x81, 0x41,
+    0xce, 0x82, 0x92, 0x81, 0xb2, 0x03, 0x80, 0x44,
+    0xd9, 0x80, 0x8b, 0x80, 0x42, 0x58, 0x00, 0x80,
+    0x61, 0xbd, 0x69, 0x80, 0x40, 0xc9, 0x80, 0x40,
+    0x9f, 0x81, 0x8b, 0x81, 0x8d, 0x01, 0x89, 0xca,
+    0x99, 0x01, 0x96, 0x80, 0x93, 0x01, 0x88, 0x94,
+    0x81, 0x40, 0xad, 0xa1, 0x81, 0xef, 0x09, 0x02,
+    0x81, 0xd2, 0x0a, 0x80, 0x41, 0x06, 0x80, 0xbe,
+    0x8a, 0x28, 0x97, 0x31, 0x0f, 0x8b, 0x01, 0x19,
+    0x03, 0x81, 0x8c, 0x09, 0x07, 0x81, 0x88, 0x04,
+    0x82, 0x8b, 0x17, 0x11, 0x00, 0x03, 0x05, 0x02,
+    0x05, 0xd5, 0xaf, 0xc5, 0x27, 0x8c, 0x2a, 0x00,
+    0x0a, 0x01, 0x86, 0x42, 0x15, 0xaa, 0x02, 0x05,
+    0x80, 0xa9, 0x0b, 0x10, 0x80, 0xa6, 0x8c, 0x89,
+    0x2a, 0x8c, 0xaf,
+};
+
+static const uint8_t unicode_prop_Emoji_Component_table[28] = {
+    0xa2, 0x05, 0x04, 0x89, 0x5f, 0xd2, 0x80, 0x40,
+    0xd4, 0x80, 0x60, 0xdd, 0x2a, 0x80, 0x60, 0xf3,
+    0xd5, 0x99, 0x41, 0xfa, 0x84, 0x45, 0xaf, 0x83,
+    0x6c, 0x06, 0x6b, 0xdf,
+};
+
+static const uint8_t unicode_prop_Emoji_Modifier_table[4] = {
+    0x61, 0xf3, 0xfa, 0x84,
+};
+
+static const uint8_t unicode_prop_Emoji_Modifier_Base_table[61] = {
+    0x60, 0x26, 0x1c, 0x80, 0x40, 0xda, 0x80, 0x8f,
+    0x83, 0x61, 0xcc, 0x76, 0x80, 0xbb, 0x11, 0x01,
+    0x82, 0xf4, 0x09, 0x8a, 0x94, 0x1b, 0x00, 0x88,
+    0x10, 0x1a, 0x02, 0xa1, 0x80, 0x40, 0xc8, 0x0b,
+    0x80, 0x94, 0x03, 0x81, 0x40, 0xad, 0x12, 0x84,
+    0xd2, 0x80, 0x8f, 0x82, 0x88, 0x80, 0x8a, 0x80,
+    0x42, 0x4a, 0x20, 0x0d, 0x80, 0x88, 0x89, 0x11,
+    0xf5, 0x08, 0x81, 0x96, 0x8c,
+};
+
+static const uint8_t unicode_prop_Emoji_Presentation_table[134] = {
+    0x60, 0x23, 0x19, 0x81, 0x40, 0xcc, 0x1a, 0x01,
+    0x80, 0x42, 0x08, 0x81, 0x94, 0x81, 0xb1, 0x8b,
+    0xaa, 0x80, 0x92, 0x80, 0x8c, 0x07, 0x81, 0x90,
+    0x0c, 0x0f, 0x04, 0x80, 0x94, 0x06, 0x08, 0x03,
+    0x01, 0x06, 0x03, 0x81, 0x9b, 0x80, 0xa2, 0x00,
+    0x03, 0x10, 0x80, 0xbc, 0x82, 0x97, 0x80, 0x8d,
+    0x80, 0x43, 0x5a, 0x81, 0xb2, 0x03, 0x80, 0x61,
+    0xc4, 0xad, 0x80, 0x40, 0xc9, 0x80, 0x40, 0xbd,
+    0x01, 0x89, 0xca, 0x99, 0x00, 0x97, 0x80, 0x93,
+    0x01, 0x20, 0x82, 0x94, 0x81, 0x40, 0xad, 0xa0,
+    0x8b, 0x88, 0x80, 0xc5, 0x80, 0x95, 0x8b, 0xaa,
+    0x1c, 0x8b, 0x90, 0x10, 0x82, 0xc6, 0x00, 0x80,
+    0x40, 0xba, 0x81, 0xbe, 0x8c, 0x18, 0x97, 0x91,
+    0x80, 0x99, 0x81, 0x8c, 0x80, 0xd5, 0xd4, 0xaf,
+    0xc5, 0x28, 0x12, 0x97, 0x0e, 0x85, 0x42, 0x15,
+    0xaa, 0x02, 0x05, 0x80, 0xa9, 0x0b, 0x10, 0x80,
+    0xa6, 0x8c, 0x89, 0x2a, 0x8c, 0xaf,
+};
+
+static const uint8_t unicode_prop_Extended_Pictographic_table[152] = {
+    0x40, 0xa8, 0x03, 0x80, 0x5f, 0x8c, 0x80, 0x8b,
+    0x80, 0x40, 0xd7, 0x80, 0x95, 0x80, 0xd9, 0x85,
+    0x8e, 0x81, 0x41, 0x6e, 0x81, 0x8b, 0x80, 0xde,
+    0x80, 0xc5, 0x80, 0x98, 0x8a, 0x1a, 0x40, 0xc6,
+    0x80, 0x40, 0xe6, 0x81, 0x89, 0x80, 0x88, 0x80,
+    0xb9, 0x18, 0x28, 0x8b, 0x80, 0xf1, 0x89, 0xf5,
+    0x81, 0x8a, 0x00, 0x00, 0x28, 0x10, 0x28, 0x89,
+    0x81, 0x8e, 0x01, 0x03, 0x00, 0x03, 0x10, 0x80,
+    0x8a, 0x84, 0xac, 0x82, 0x88, 0x80, 0x8d, 0x80,
+    0x8d, 0x80, 0x41, 0x73, 0x81, 0x41, 0xce, 0x82,
+    0x92, 0x81, 0xb2, 0x03, 0x80, 0x44, 0xd9, 0x80,
+    0x8b, 0x80, 0x42, 0x58, 0x00, 0x80, 0x61, 0xbd,
+    0x65, 0x40, 0xff, 0x8c, 0x82, 0x9e, 0x80, 0xbb,
+    0x85, 0x8b, 0x81, 0x8d, 0x01, 0x89, 0x91, 0xb8,
+    0x9a, 0x8e, 0x89, 0x80, 0x93, 0x01, 0x88, 0x03,
+    0x88, 0x41, 0xb1, 0x84, 0x41, 0x3d, 0x87, 0x41,
+    0x09, 0xaf, 0xff, 0xf3, 0x8b, 0xd4, 0xaa, 0x8b,
+    0x83, 0xb7, 0x87, 0x89, 0x85, 0xa7, 0x87, 0x9d,
+    0xd1, 0x8b, 0xae, 0x80, 0x89, 0x80, 0x46, 0xb6,
+};
+
+static const uint8_t unicode_prop_Default_Ignorable_Code_Point_table[51] = {
+    0x40, 0xac, 0x80, 0x42, 0xa0, 0x80, 0x42, 0xcb,
+    0x80, 0x4b, 0x41, 0x81, 0x46, 0x52, 0x81, 0xd4,
+    0x83, 0x47, 0xfb, 0x84, 0x99, 0x84, 0xb0, 0x8f,
+    0x50, 0xf3, 0x80, 0x60, 0xcc, 0x9a, 0x8f, 0x40,
+    0xee, 0x80, 0x40, 0x9f, 0x80, 0xce, 0x88, 0x60,
+    0xbc, 0xa6, 0x83, 0x54, 0xce, 0x87, 0x6c, 0x2e,
+    0x84, 0x4f, 0xff,
+};
+
+typedef enum {
+    UNICODE_PROP_Hyphen,
+    UNICODE_PROP_Other_Math,
+    UNICODE_PROP_Other_Alphabetic,
+    UNICODE_PROP_Other_Lowercase,
+    UNICODE_PROP_Other_Uppercase,
+    UNICODE_PROP_Other_Grapheme_Extend,
+    UNICODE_PROP_Other_Default_Ignorable_Code_Point,
+    UNICODE_PROP_Other_ID_Start,
+    UNICODE_PROP_Other_ID_Continue,
+    UNICODE_PROP_Prepended_Concatenation_Mark,
+    UNICODE_PROP_ID_Continue1,
+    UNICODE_PROP_XID_Start1,
+    UNICODE_PROP_XID_Continue1,
+    UNICODE_PROP_Changes_When_Titlecased1,
+    UNICODE_PROP_Changes_When_Casefolded1,
+    UNICODE_PROP_Changes_When_NFKC_Casefolded1,
+    UNICODE_PROP_ASCII_Hex_Digit,
+    UNICODE_PROP_Bidi_Control,
+    UNICODE_PROP_Dash,
+    UNICODE_PROP_Deprecated,
+    UNICODE_PROP_Diacritic,
+    UNICODE_PROP_Extender,
+    UNICODE_PROP_Hex_Digit,
+    UNICODE_PROP_IDS_Binary_Operator,
+    UNICODE_PROP_IDS_Trinary_Operator,
+    UNICODE_PROP_Ideographic,
+    UNICODE_PROP_Join_Control,
+    UNICODE_PROP_Logical_Order_Exception,
+    UNICODE_PROP_Noncharacter_Code_Point,
+    UNICODE_PROP_Pattern_Syntax,
+    UNICODE_PROP_Pattern_White_Space,
+    UNICODE_PROP_Quotation_Mark,
+    UNICODE_PROP_Radical,
+    UNICODE_PROP_Regional_Indicator,
+    UNICODE_PROP_Sentence_Terminal,
+    UNICODE_PROP_Soft_Dotted,
+    UNICODE_PROP_Terminal_Punctuation,
+    UNICODE_PROP_Unified_Ideograph,
+    UNICODE_PROP_Variation_Selector,
+    UNICODE_PROP_White_Space,
+    UNICODE_PROP_Bidi_Mirrored,
+    UNICODE_PROP_Emoji,
+    UNICODE_PROP_Emoji_Component,
+    UNICODE_PROP_Emoji_Modifier,
+    UNICODE_PROP_Emoji_Modifier_Base,
+    UNICODE_PROP_Emoji_Presentation,
+    UNICODE_PROP_Extended_Pictographic,
+    UNICODE_PROP_Default_Ignorable_Code_Point,
+    UNICODE_PROP_ID_Start,
+    UNICODE_PROP_Case_Ignorable,
+    UNICODE_PROP_ASCII,
+    UNICODE_PROP_Alphabetic,
+    UNICODE_PROP_Any,
+    UNICODE_PROP_Assigned,
+    UNICODE_PROP_Cased,
+    UNICODE_PROP_Changes_When_Casefolded,
+    UNICODE_PROP_Changes_When_Casemapped,
+    UNICODE_PROP_Changes_When_Lowercased,
+    UNICODE_PROP_Changes_When_NFKC_Casefolded,
+    UNICODE_PROP_Changes_When_Titlecased,
+    UNICODE_PROP_Changes_When_Uppercased,
+    UNICODE_PROP_Grapheme_Base,
+    UNICODE_PROP_Grapheme_Extend,
+    UNICODE_PROP_ID_Continue,
+    UNICODE_PROP_Lowercase,
+    UNICODE_PROP_Math,
+    UNICODE_PROP_Uppercase,
+    UNICODE_PROP_XID_Continue,
+    UNICODE_PROP_XID_Start,
+    UNICODE_PROP_Cased1,
+    UNICODE_PROP_COUNT,
+} UnicodePropertyEnum;
+
+static const char unicode_prop_name_table[] =
+    "ASCII_Hex_Digit,AHex"               "\0"
+    "Bidi_Control,Bidi_C"                "\0"
+    "Dash"                               "\0"
+    "Deprecated,Dep"                     "\0"
+    "Diacritic,Dia"                      "\0"
+    "Extender,Ext"                       "\0"
+    "Hex_Digit,Hex"                      "\0"
+    "IDS_Binary_Operator,IDSB"           "\0"
+    "IDS_Trinary_Operator,IDST"          "\0"
+    "Ideographic,Ideo"                   "\0"
+    "Join_Control,Join_C"                "\0"
+    "Logical_Order_Exception,LOE"        "\0"
+    "Noncharacter_Code_Point,NChar"      "\0"
+    "Pattern_Syntax,Pat_Syn"             "\0"
+    "Pattern_White_Space,Pat_WS"         "\0"
+    "Quotation_Mark,QMark"               "\0"
+    "Radical"                            "\0"
+    "Regional_Indicator,RI"              "\0"
+    "Sentence_Terminal,STerm"            "\0"
+    "Soft_Dotted,SD"                     "\0"
+    "Terminal_Punctuation,Term"          "\0"
+    "Unified_Ideograph,UIdeo"            "\0"
+    "Variation_Selector,VS"              "\0"
+    "White_Space,space"                  "\0"
+    "Bidi_Mirrored,Bidi_M"               "\0"
+    "Emoji"                              "\0"
+    "Emoji_Component"                    "\0"
+    "Emoji_Modifier"                     "\0"
+    "Emoji_Modifier_Base"                "\0"
+    "Emoji_Presentation"                 "\0"
+    "Extended_Pictographic"              "\0"
+    "Default_Ignorable_Code_Point,DI"    "\0"
+    "ID_Start,IDS"                       "\0"
+    "Case_Ignorable,CI"                  "\0"
+    "ASCII"                              "\0"
+    "Alphabetic,Alpha"                   "\0"
+    "Any"                                "\0"
+    "Assigned"                           "\0"
+    "Cased"                              "\0"
+    "Changes_When_Casefolded,CWCF"       "\0"
+    "Changes_When_Casemapped,CWCM"       "\0"
+    "Changes_When_Lowercased,CWL"        "\0"
+    "Changes_When_NFKC_Casefolded,CWKCF" "\0"
+    "Changes_When_Titlecased,CWT"        "\0"
+    "Changes_When_Uppercased,CWU"        "\0"
+    "Grapheme_Base,Gr_Base"              "\0"
+    "Grapheme_Extend,Gr_Ext"             "\0"
+    "ID_Continue,IDC"                    "\0"
+    "Lowercase,Lower"                    "\0"
+    "Math"                               "\0"
+    "Uppercase,Upper"                    "\0"
+    "XID_Continue,XIDC"                  "\0"
+    "XID_Start,XIDS"                     "\0"
+;
+
+static const uint8_t * const unicode_prop_table[] = {
+    unicode_prop_Hyphen_table,
+    unicode_prop_Other_Math_table,
+    unicode_prop_Other_Alphabetic_table,
+    unicode_prop_Other_Lowercase_table,
+    unicode_prop_Other_Uppercase_table,
+    unicode_prop_Other_Grapheme_Extend_table,
+    unicode_prop_Other_Default_Ignorable_Code_Point_table,
+    unicode_prop_Other_ID_Start_table,
+    unicode_prop_Other_ID_Continue_table,
+    unicode_prop_Prepended_Concatenation_Mark_table,
+    unicode_prop_ID_Continue1_table,
+    unicode_prop_XID_Start1_table,
+    unicode_prop_XID_Continue1_table,
+    unicode_prop_Changes_When_Titlecased1_table,
+    unicode_prop_Changes_When_Casefolded1_table,
+    unicode_prop_Changes_When_NFKC_Casefolded1_table,
+    unicode_prop_ASCII_Hex_Digit_table,
+    unicode_prop_Bidi_Control_table,
+    unicode_prop_Dash_table,
+    unicode_prop_Deprecated_table,
+    unicode_prop_Diacritic_table,
+    unicode_prop_Extender_table,
+    unicode_prop_Hex_Digit_table,
+    unicode_prop_IDS_Binary_Operator_table,
+    unicode_prop_IDS_Trinary_Operator_table,
+    unicode_prop_Ideographic_table,
+    unicode_prop_Join_Control_table,
+    unicode_prop_Logical_Order_Exception_table,
+    unicode_prop_Noncharacter_Code_Point_table,
+    unicode_prop_Pattern_Syntax_table,
+    unicode_prop_Pattern_White_Space_table,
+    unicode_prop_Quotation_Mark_table,
+    unicode_prop_Radical_table,
+    unicode_prop_Regional_Indicator_table,
+    unicode_prop_Sentence_Terminal_table,
+    unicode_prop_Soft_Dotted_table,
+    unicode_prop_Terminal_Punctuation_table,
+    unicode_prop_Unified_Ideograph_table,
+    unicode_prop_Variation_Selector_table,
+    unicode_prop_White_Space_table,
+    unicode_prop_Bidi_Mirrored_table,
+    unicode_prop_Emoji_table,
+    unicode_prop_Emoji_Component_table,
+    unicode_prop_Emoji_Modifier_table,
+    unicode_prop_Emoji_Modifier_Base_table,
+    unicode_prop_Emoji_Presentation_table,
+    unicode_prop_Extended_Pictographic_table,
+    unicode_prop_Default_Ignorable_Code_Point_table,
+    unicode_prop_ID_Start_table,
+    unicode_prop_Case_Ignorable_table,
+};
+
+static const uint16_t unicode_prop_len_table[] = {
+    countof(unicode_prop_Hyphen_table),
+    countof(unicode_prop_Other_Math_table),
+    countof(unicode_prop_Other_Alphabetic_table),
+    countof(unicode_prop_Other_Lowercase_table),
+    countof(unicode_prop_Other_Uppercase_table),
+    countof(unicode_prop_Other_Grapheme_Extend_table),
+    countof(unicode_prop_Other_Default_Ignorable_Code_Point_table),
+    countof(unicode_prop_Other_ID_Start_table),
+    countof(unicode_prop_Other_ID_Continue_table),
+    countof(unicode_prop_Prepended_Concatenation_Mark_table),
+    countof(unicode_prop_ID_Continue1_table),
+    countof(unicode_prop_XID_Start1_table),
+    countof(unicode_prop_XID_Continue1_table),
+    countof(unicode_prop_Changes_When_Titlecased1_table),
+    countof(unicode_prop_Changes_When_Casefolded1_table),
+    countof(unicode_prop_Changes_When_NFKC_Casefolded1_table),
+    countof(unicode_prop_ASCII_Hex_Digit_table),
+    countof(unicode_prop_Bidi_Control_table),
+    countof(unicode_prop_Dash_table),
+    countof(unicode_prop_Deprecated_table),
+    countof(unicode_prop_Diacritic_table),
+    countof(unicode_prop_Extender_table),
+    countof(unicode_prop_Hex_Digit_table),
+    countof(unicode_prop_IDS_Binary_Operator_table),
+    countof(unicode_prop_IDS_Trinary_Operator_table),
+    countof(unicode_prop_Ideographic_table),
+    countof(unicode_prop_Join_Control_table),
+    countof(unicode_prop_Logical_Order_Exception_table),
+    countof(unicode_prop_Noncharacter_Code_Point_table),
+    countof(unicode_prop_Pattern_Syntax_table),
+    countof(unicode_prop_Pattern_White_Space_table),
+    countof(unicode_prop_Quotation_Mark_table),
+    countof(unicode_prop_Radical_table),
+    countof(unicode_prop_Regional_Indicator_table),
+    countof(unicode_prop_Sentence_Terminal_table),
+    countof(unicode_prop_Soft_Dotted_table),
+    countof(unicode_prop_Terminal_Punctuation_table),
+    countof(unicode_prop_Unified_Ideograph_table),
+    countof(unicode_prop_Variation_Selector_table),
+    countof(unicode_prop_White_Space_table),
+    countof(unicode_prop_Bidi_Mirrored_table),
+    countof(unicode_prop_Emoji_table),
+    countof(unicode_prop_Emoji_Component_table),
+    countof(unicode_prop_Emoji_Modifier_table),
+    countof(unicode_prop_Emoji_Modifier_Base_table),
+    countof(unicode_prop_Emoji_Presentation_table),
+    countof(unicode_prop_Extended_Pictographic_table),
+    countof(unicode_prop_Default_Ignorable_Code_Point_table),
+    countof(unicode_prop_ID_Start_table),
+    countof(unicode_prop_Case_Ignorable_table),
+};
+
+#endif /* CONFIG_ALL_UNICODE */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode.c
new file mode 100755
index 00000000..f4ef5560
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode.c
@@ -0,0 +1,1540 @@
+/*
+ * Unicode utilities
+ * 
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include <stdlib.h>
+#include <stdio.h>
+#include <stdarg.h>
+#include <string.h>
+#include <assert.h>
+
+#include "cutils.h"
+#include "libunicode.h"
+#include "libunicode-table.h"
+
+enum {
+    RUN_TYPE_U,
+    RUN_TYPE_L,
+    RUN_TYPE_UF,
+    RUN_TYPE_LF,
+    RUN_TYPE_UL,
+    RUN_TYPE_LSU,
+    RUN_TYPE_U2L_399_EXT2,
+    RUN_TYPE_UF_D20,
+    RUN_TYPE_UF_D1_EXT,
+    RUN_TYPE_U_EXT,
+    RUN_TYPE_LF_EXT,
+    RUN_TYPE_U_EXT2,
+    RUN_TYPE_L_EXT2,
+    RUN_TYPE_U_EXT3,
+};
+
+/* conv_type:
+   0 = to upper 
+   1 = to lower
+   2 = case folding (= to lower with modifications) 
+*/
+int lre_case_conv(uint32_t *res, uint32_t c, int conv_type)
+{
+    if (c < 128) {
+        if (conv_type) {
+            if (c >= 'A' && c <= 'Z') {
+                c = c - 'A' + 'a';
+            }
+        } else {
+            if (c >= 'a' && c <= 'z') {
+                c = c - 'a' + 'A';
+            }
+        }
+    } else {
+        uint32_t v, code, data, type, len, a, is_lower;
+        int idx, idx_min, idx_max;
+        
+        is_lower = (conv_type != 0);
+        idx_min = 0;
+        idx_max = countof(case_conv_table1) - 1;
+        while (idx_min <= idx_max) {
+            idx = (unsigned)(idx_max + idx_min) / 2;
+            v = case_conv_table1[idx];
+            code = v >> (32 - 17);
+            len = (v >> (32 - 17 - 7)) & 0x7f;
+            if (c < code) {
+                idx_max = idx - 1;
+            } else if (c >= code + len) {
+                idx_min = idx + 1;
+            } else {
+                type = (v >> (32 - 17 - 7 - 4)) & 0xf;
+                data = ((v & 0xf) << 8) | case_conv_table2[idx];
+                switch(type) {
+                case RUN_TYPE_U:
+                case RUN_TYPE_L:
+                case RUN_TYPE_UF:
+                case RUN_TYPE_LF:
+                    if (conv_type == (type & 1) ||
+                        (type >= RUN_TYPE_UF && conv_type == 2)) {
+                        c = c - code + (case_conv_table1[data] >> (32 - 17));
+                    }
+                    break;
+                case RUN_TYPE_UL:
+                    a = c - code;
+                    if ((a & 1) != (1 - is_lower))
+                        break;
+                    c = (a ^ 1) + code;
+                    break;
+                case RUN_TYPE_LSU:
+                    a = c - code;
+                    if (a == 1) {
+                        c += 2 * is_lower - 1;
+                    } else if (a == (1 - is_lower) * 2) {
+                        c += (2 * is_lower - 1) * 2;
+                    }
+                    break;
+                case RUN_TYPE_U2L_399_EXT2:
+                    if (!is_lower) {
+                        res[0] = c - code + case_conv_ext[data >> 6];
+                        res[1] = 0x399;
+                        return 2;
+                    } else {
+                        c = c - code + case_conv_ext[data & 0x3f];
+                    }
+                    break;
+                case RUN_TYPE_UF_D20:
+                    if (conv_type == 1)
+                        break;
+                    c = data + (conv_type == 2) * 0x20;
+                    break;
+                case RUN_TYPE_UF_D1_EXT:
+                    if (conv_type == 1)
+                        break;
+                    c = case_conv_ext[data] + (conv_type == 2);
+                    break;
+                case RUN_TYPE_U_EXT:
+                case RUN_TYPE_LF_EXT:
+                    if (is_lower != (type - RUN_TYPE_U_EXT))
+                        break;
+                    c = case_conv_ext[data];
+                    break;
+                case RUN_TYPE_U_EXT2:
+                case RUN_TYPE_L_EXT2:
+                    if (conv_type != (type - RUN_TYPE_U_EXT2))
+                        break;
+                    res[0] = c - code + case_conv_ext[data >> 6];
+                    res[1] = case_conv_ext[data & 0x3f];
+                    return 2;
+                default:
+                case RUN_TYPE_U_EXT3:
+                    if (conv_type != 0)
+                        break;
+                    res[0] = case_conv_ext[data >> 8];
+                    res[1] = case_conv_ext[(data >> 4) & 0xf];
+                    res[2] = case_conv_ext[data & 0xf];
+                    return 3;
+                }
+                break;
+            }
+        }
+    }
+    res[0] = c;
+    return 1;
+}
+
+static uint32_t get_le24(const uint8_t *ptr)
+{
+#if defined(__x86__) || defined(__x86_64__)
+    return *(uint16_t *)ptr | (ptr[2] << 16);
+#else
+    return ptr[0] | (ptr[1] << 8) | (ptr[2] << 16);
+#endif
+}
+
+#define UNICODE_INDEX_BLOCK_LEN 32
+
+/* return -1 if not in table, otherwise the offset in the block */
+static int get_index_pos(uint32_t *pcode, uint32_t c,
+                         const uint8_t *index_table, int index_table_len)
+{
+    uint32_t code, v;
+    int idx_min, idx_max, idx;
+
+    idx_min = 0;
+    v = get_le24(index_table);
+    code = v & ((1 << 21) - 1);
+    if (c < code) {
+        *pcode = 0;
+        return 0;
+    }
+    idx_max = index_table_len - 1;
+    code = get_le24(index_table + idx_max * 3);
+    if (c >= code)
+        return -1;
+    /* invariant: tab[idx_min] <= c < tab2[idx_max] */
+    while ((idx_max - idx_min) > 1) {
+        idx = (idx_max + idx_min) / 2;
+        v = get_le24(index_table + idx * 3);
+        code = v & ((1 << 21) - 1);
+        if (c < code) {
+            idx_max = idx;
+        } else {
+            idx_min = idx;
+        }
+    }
+    v = get_le24(index_table + idx_min * 3);
+    *pcode = v & ((1 << 21) - 1);
+    return (idx_min + 1) * UNICODE_INDEX_BLOCK_LEN + (v >> 21);
+}
+
+static BOOL lre_is_in_table(uint32_t c, const uint8_t *table,
+                            const uint8_t *index_table, int index_table_len)
+{
+    uint32_t code, b, bit;
+    int pos;
+    const uint8_t *p;
+    
+    pos = get_index_pos(&code, c, index_table, index_table_len);
+    if (pos < 0)
+        return FALSE; /* outside the table */
+    p = table + pos;
+    bit = 0;
+    for(;;) {
+        b = *p++;
+        if (b < 64) {
+            code += (b >> 3) + 1;
+            if (c < code)
+                return bit;
+            bit ^= 1;
+            code += (b & 7) + 1;
+        } else if (b >= 0x80) {
+            code += b - 0x80 + 1;
+        } else if (b < 0x60) {
+            code += (((b - 0x40) << 8) | p[0]) + 1;
+            p++;
+        } else {
+            code += (((b - 0x60) << 16) | (p[0] << 8) | p[1]) + 1;
+            p += 2;
+        }
+        if (c < code)
+            return bit;
+        bit ^= 1;
+    }
+}
+
+BOOL lre_is_cased(uint32_t c)
+{
+    uint32_t v, code, len;
+    int idx, idx_min, idx_max;
+        
+    idx_min = 0;
+    idx_max = countof(case_conv_table1) - 1;
+    while (idx_min <= idx_max) {
+        idx = (unsigned)(idx_max + idx_min) / 2;
+        v = case_conv_table1[idx];
+        code = v >> (32 - 17);
+        len = (v >> (32 - 17 - 7)) & 0x7f;
+        if (c < code) {
+            idx_max = idx - 1;
+        } else if (c >= code + len) {
+            idx_min = idx + 1;
+        } else {
+            return TRUE;
+        }
+    }
+    return lre_is_in_table(c, unicode_prop_Cased1_table,
+                           unicode_prop_Cased1_index,
+                           sizeof(unicode_prop_Cased1_index) / 3);
+}
+
+BOOL lre_is_case_ignorable(uint32_t c)
+{
+    return lre_is_in_table(c, unicode_prop_Case_Ignorable_table,
+                           unicode_prop_Case_Ignorable_index,
+                           sizeof(unicode_prop_Case_Ignorable_index) / 3);
+}
+
+/* character range */
+#if defined(_MSC_VER)
+static void cr_dump(CharRange *cr)
+#else
+static __attribute__((unused)) void cr_dump(CharRange *cr)
+#endif
+{
+    int i;
+    for(i = 0; i < cr->len; i++)
+        printf("%d: 0x%04x\n", i, cr->points[i]);
+}
+
+static void *cr_default_realloc(void *opaque, void *ptr, size_t size)
+{
+    return realloc(ptr, size);
+}
+
+void cr_init(CharRange *cr, void *mem_opaque, DynBufReallocFunc *realloc_func)
+{
+    cr->len = cr->size = 0;
+    cr->points = NULL;
+    cr->mem_opaque = mem_opaque;
+    cr->realloc_func = realloc_func ? realloc_func : cr_default_realloc;
+}
+
+void cr_free(CharRange *cr)
+{
+    cr->realloc_func(cr->mem_opaque, cr->points, 0);
+}
+
+int cr_realloc(CharRange *cr, int size)
+{
+    int new_size;
+    uint32_t *new_buf;
+    
+    if (size > cr->size) {
+        new_size = max_int(size, cr->size * 3 / 2);
+        new_buf = cr->realloc_func(cr->mem_opaque, cr->points,
+                                   new_size * sizeof(cr->points[0]));
+        if (!new_buf)
+            return -1;
+        cr->points = new_buf;
+        cr->size = new_size;
+    }
+    return 0;
+}
+
+int cr_copy(CharRange *cr, const CharRange *cr1)
+{
+    if (cr_realloc(cr, cr1->len))
+        return -1;
+    memcpy(cr->points, cr1->points, sizeof(cr->points[0]) * cr1->len);
+    cr->len = cr1->len;
+    return 0;
+}
+
+/* merge consecutive intervals and remove empty intervals */
+static void cr_compress(CharRange *cr)
+{
+    int i, j, k, len;
+    uint32_t *pt;
+    
+    pt = cr->points;
+    len = cr->len;
+    i = 0;
+    j = 0;
+    k = 0;
+    while ((i + 1) < len) {
+        if (pt[i] == pt[i + 1]) {
+            /* empty interval */
+            i += 2;
+        } else {
+            j = i;
+            while ((j + 3) < len && pt[j + 1] == pt[j + 2])
+                j += 2;
+            /* just copy */
+            pt[k] = pt[i];
+            pt[k + 1] = pt[j + 1];
+            k += 2;
+            i = j + 2;
+        }
+    }
+    cr->len = k;
+}
+
+/* union or intersection */
+int cr_op(CharRange *cr, const uint32_t *a_pt, int a_len,
+          const uint32_t *b_pt, int b_len, int op)
+{
+    int a_idx, b_idx, is_in;
+    uint32_t v;
+    
+    a_idx = 0;
+    b_idx = 0;
+    for(;;) {
+        /* get one more point from a or b in increasing order */
+        if (a_idx < a_len && b_idx < b_len) {
+            if (a_pt[a_idx] < b_pt[b_idx]) {
+                goto a_add;
+            } else if (a_pt[a_idx] == b_pt[b_idx]) {
+                v = a_pt[a_idx];
+                a_idx++;
+                b_idx++;
+            } else {
+                goto b_add;
+            }
+        } else if (a_idx < a_len) {
+        a_add:
+            v = a_pt[a_idx++];
+        } else if (b_idx < b_len) {
+        b_add:
+            v = b_pt[b_idx++];
+        } else {
+            break;
+        }
+        /* add the point if the in/out status changes */
+        switch(op) {
+        case CR_OP_UNION:
+            is_in = (a_idx & 1) | (b_idx & 1);
+            break;
+        case CR_OP_INTER:
+            is_in = (a_idx & 1) & (b_idx & 1);
+            break;
+        case CR_OP_XOR:
+            is_in = (a_idx & 1) ^ (b_idx & 1);
+            break;
+        default:
+            abort();
+        }
+        if (is_in != (cr->len & 1)) {
+            if (cr_add_point(cr, v))
+                return -1;
+        }
+    }
+    cr_compress(cr);
+    return 0;
+}
+
+int cr_union1(CharRange *cr, const uint32_t *b_pt, int b_len)
+{
+    CharRange a = *cr;
+    int ret;
+    cr->len = 0;
+    cr->size = 0;
+    cr->points = NULL;
+    ret = cr_op(cr, a.points, a.len, b_pt, b_len, CR_OP_UNION);
+    cr_free(&a);
+    return ret;
+}
+
+int cr_invert(CharRange *cr)
+{
+    int len;
+    len = cr->len;
+    if (cr_realloc(cr, len + 2))
+        return -1;
+    memmove(cr->points + 1, cr->points, len * sizeof(cr->points[0]));
+    cr->points[0] = 0;
+    cr->points[len + 1] = UINT32_MAX;
+    cr->len = len + 2;
+    cr_compress(cr);
+    return 0;
+}
+
+#ifdef CONFIG_ALL_UNICODE
+
+BOOL lre_is_id_start(uint32_t c)
+{
+    return lre_is_in_table(c, unicode_prop_ID_Start_table,
+                           unicode_prop_ID_Start_index,
+                           sizeof(unicode_prop_ID_Start_index) / 3);
+}
+
+BOOL lre_is_id_continue(uint32_t c)
+{
+    return lre_is_id_start(c) ||
+        lre_is_in_table(c, unicode_prop_ID_Continue1_table,
+                        unicode_prop_ID_Continue1_index,
+                        sizeof(unicode_prop_ID_Continue1_index) / 3);
+}
+
+#define UNICODE_DECOMP_LEN_MAX 18
+
+typedef enum {
+    DECOMP_TYPE_C1, /* 16 bit char */
+    DECOMP_TYPE_L1, /* 16 bit char table */
+    DECOMP_TYPE_L2,
+    DECOMP_TYPE_L3,
+    DECOMP_TYPE_L4,
+    DECOMP_TYPE_L5, /* XXX: not used */
+    DECOMP_TYPE_L6, /* XXX: could remove */
+    DECOMP_TYPE_L7, /* XXX: could remove */
+    DECOMP_TYPE_LL1, /* 18 bit char table */
+    DECOMP_TYPE_LL2,
+    DECOMP_TYPE_S1, /* 8 bit char table */
+    DECOMP_TYPE_S2,
+    DECOMP_TYPE_S3,
+    DECOMP_TYPE_S4,
+    DECOMP_TYPE_S5,
+    DECOMP_TYPE_I1, /* increment 16 bit char value */
+    DECOMP_TYPE_I2_0,
+    DECOMP_TYPE_I2_1,
+    DECOMP_TYPE_I3_1,
+    DECOMP_TYPE_I3_2,
+    DECOMP_TYPE_I4_1,
+    DECOMP_TYPE_I4_2,
+    DECOMP_TYPE_B1, /* 16 bit base + 8 bit offset */
+    DECOMP_TYPE_B2,
+    DECOMP_TYPE_B3,
+    DECOMP_TYPE_B4,
+    DECOMP_TYPE_B5,
+    DECOMP_TYPE_B6,
+    DECOMP_TYPE_B7,
+    DECOMP_TYPE_B8,
+    DECOMP_TYPE_B18,
+    DECOMP_TYPE_LS2,
+    DECOMP_TYPE_PAT3,
+    DECOMP_TYPE_S2_UL,
+    DECOMP_TYPE_LS2_UL,
+} DecompTypeEnum;
+
+static uint32_t unicode_get_short_code(uint32_t c)
+{
+    static const uint16_t unicode_short_table[2] = { 0x2044, 0x2215 };
+
+    if (c < 0x80)
+        return c;
+    else if (c < 0x80 + 0x50)
+        return c - 0x80 + 0x300;
+    else
+        return unicode_short_table[c - 0x80 - 0x50];
+}
+
+static uint32_t unicode_get_lower_simple(uint32_t c)
+{
+    if (c < 0x100 || (c >= 0x410 && c <= 0x42f))
+        c += 0x20;
+    else
+        c++;
+    return c;
+}
+
+static uint16_t unicode_get16(const uint8_t *p)
+{
+    return p[0] | (p[1] << 8);
+}
+
+static int unicode_decomp_entry(uint32_t *res, uint32_t c,
+                                int idx, uint32_t code, uint32_t len,
+                                uint32_t type)
+{
+    uint32_t c1;
+    int l, i, p;
+    const uint8_t *d;
+
+    if (type == DECOMP_TYPE_C1) {
+        res[0] = unicode_decomp_table2[idx];
+        return 1;
+    } else {
+        d = unicode_decomp_data + unicode_decomp_table2[idx];
+        if (type >= DECOMP_TYPE_L1 && type <= DECOMP_TYPE_L7) {
+            l = type - DECOMP_TYPE_L1 + 1;
+            d += (c - code) * l * 2;
+            for(i = 0; i < l; i++) {
+                if ((res[i] = unicode_get16(d + 2 * i)) == 0)
+                    return 0;
+            }
+            return l;
+        } else if (type >= DECOMP_TYPE_LL1 && type <= DECOMP_TYPE_LL2) {
+            {
+                uint32_t k, p;
+                l = type - DECOMP_TYPE_LL1 + 1;
+                k = (c - code) * l;
+                p = len * l * 2;
+                for(i = 0; i < l; i++) {
+                    c1 = unicode_get16(d + 2 * k) |
+                        (((d[p + (k / 4)] >> ((k % 4) * 2)) & 3) << 16);
+                    if (!c1)
+                        return 0;
+                    res[i] = c1;
+                    k++;
+                }
+            }
+            return l;
+        } else if (type >= DECOMP_TYPE_S1 && type <= DECOMP_TYPE_S5) {
+            l = type - DECOMP_TYPE_S1 + 1;
+            d += (c - code) * l;
+            for(i = 0; i < l; i++) {
+                if ((res[i] = unicode_get_short_code(d[i])) == 0)
+                    return 0;
+            }
+            return l;
+        } else if (type == DECOMP_TYPE_I1) {
+            l = 1;
+            p = 0;
+            goto decomp_type_i;
+        } else if (type == DECOMP_TYPE_I2_0 ||
+				type == DECOMP_TYPE_I2_1 ||
+				type == DECOMP_TYPE_I3_1 ||
+				type == DECOMP_TYPE_I3_2 ||
+				type == DECOMP_TYPE_I4_1 ||
+				type == DECOMP_TYPE_I4_2) {
+            l = 2 + ((type - DECOMP_TYPE_I2_0) >> 1);
+            p = ((type - DECOMP_TYPE_I2_0) & 1) + (l > 2);
+        decomp_type_i:
+            for(i = 0; i < l; i++) {
+                c1 = unicode_get16(d + 2 * i);
+                if (i == p)
+                    c1 += c - code;
+                res[i] = c1;
+            }
+            return l;
+        } else if (type == DECOMP_TYPE_B18) {
+            l = 18;
+            goto decomp_type_b;
+        } else if (type >= DECOMP_TYPE_B1 && type <= DECOMP_TYPE_B8) {
+            l = type - DECOMP_TYPE_B1 + 1;
+        decomp_type_b:
+            {
+                uint32_t c_min;
+                c_min = unicode_get16(d);
+                d += 2 + (c - code) * l;
+                for(i = 0; i < l; i++) {
+                    c1 = d[i];
+                    if (c1 == 0xff)
+                        c1 = 0x20;
+                    else
+                        c1 += c_min;
+                    res[i] = c1;
+                }
+            }
+            return l;
+        } else if (type == DECOMP_TYPE_LS2) {
+            d += (c - code) * 3;
+            if (!(res[0] = unicode_get16(d)))
+                return 0;
+            res[1] = unicode_get_short_code(d[2]);
+            return 2;
+        } else if (type == DECOMP_TYPE_PAT3) {
+            res[0] = unicode_get16(d);
+            res[2] = unicode_get16(d + 2);
+            d += 4 + (c - code) * 2;
+            res[1] = unicode_get16(d);
+            return 3;
+        } else if (type == DECOMP_TYPE_S2_UL ||
+				type == DECOMP_TYPE_LS2_UL) {
+            c1 = c - code;
+            if (type == DECOMP_TYPE_S2_UL) {
+                d += c1 & ~1;
+                c = unicode_get_short_code(*d);
+                d++;
+            } else {
+                d += (c1 >> 1) * 3;
+                c = unicode_get16(d);
+                d += 2;
+            }
+            if (c1 & 1)
+                c = unicode_get_lower_simple(c);
+            res[0] = c;
+            res[1] = unicode_get_short_code(*d);
+            return 2;
+        }
+    }
+    return 0;
+}
+
+
+/* return the length of the decomposition (length <=
+   UNICODE_DECOMP_LEN_MAX) or 0 if no decomposition */
+static int unicode_decomp_char(uint32_t *res, uint32_t c, BOOL is_compat1)
+{
+    uint32_t v, type, is_compat, code, len;
+    int idx_min, idx_max, idx;
+    
+    idx_min = 0;
+    idx_max = countof(unicode_decomp_table1) - 1;
+    while (idx_min <= idx_max) {
+        idx = (idx_max + idx_min) / 2;
+        v = unicode_decomp_table1[idx];
+        code = v >> (32 - 18);
+        len = (v >> (32 - 18 - 7)) & 0x7f;
+        //        printf("idx=%d code=%05x len=%d\n", idx, code, len);
+        if (c < code) {
+            idx_max = idx - 1;
+        } else if (c >= code + len) {
+            idx_min = idx + 1;
+        } else {
+            is_compat = v & 1;
+            if (is_compat1 < is_compat)
+                break;
+            type = (v >> (32 - 18 - 7 - 6)) & 0x3f;
+            return unicode_decomp_entry(res, c, idx, code, len, type);
+        }
+    }
+    return 0;
+}
+
+/* return 0 if no pair found */
+static int unicode_compose_pair(uint32_t c0, uint32_t c1)
+{
+    uint32_t code, len, type, v, idx1, d_idx, d_offset, ch;
+    int idx_min, idx_max, idx, d;
+    uint32_t pair[2];
+    
+    idx_min = 0;
+    idx_max = countof(unicode_comp_table) - 1;
+    while (idx_min <= idx_max) {
+        idx = (idx_max + idx_min) / 2;
+        idx1 = unicode_comp_table[idx];
+
+        /* idx1 represent an entry of the decomposition table */
+        d_idx = idx1 >> 6;
+        d_offset = idx1 & 0x3f;
+        v = unicode_decomp_table1[d_idx];
+        code = v >> (32 - 18);
+        len = (v >> (32 - 18 - 7)) & 0x7f;
+        type = (v >> (32 - 18 - 7 - 6)) & 0x3f;
+        ch = code + d_offset;
+        unicode_decomp_entry(pair, ch, d_idx, code, len, type);
+        d = c0 - pair[0];
+        if (d == 0)
+            d = c1 - pair[1];
+        if (d < 0) {
+            idx_max = idx - 1;
+        } else if (d > 0) {
+            idx_min = idx + 1;
+        } else {
+            return ch;
+        }
+    }
+    return 0;
+}
+
+/* return the combining class of character c (between 0 and 255) */
+static int unicode_get_cc(uint32_t c)
+{
+    uint32_t code, n, type, cc, c1, b;
+    int pos;
+    const uint8_t *p;
+    
+    pos = get_index_pos(&code, c,
+                        unicode_cc_index, sizeof(unicode_cc_index) / 3);
+    if (pos < 0)
+        return 0;
+    p = unicode_cc_table + pos;
+    for(;;) {
+        b = *p++;
+        type = b >> 6;
+        n = b & 0x3f;
+        if (n < 48) {
+        } else if (n < 56) {
+            n = (n - 48) << 8;
+            n |= *p++;
+            n += 48;
+        } else {
+            n = (n - 56) << 8;
+            n |= *p++ << 8;
+            n |= *p++;
+            n += 48 + (1 << 11);
+        }
+        if (type <= 1)
+            p++;
+        c1 = code + n + 1;
+        if (c < c1) {
+            switch(type) {
+            case 0:
+                cc = p[-1];
+                break;
+            case 1:
+                cc = p[-1] + c - code;
+                break;
+            case 2:
+                cc = 0;
+                break;
+            default:
+            case 3:
+                cc = 230;
+                break;
+            }
+            return cc;
+        }
+        code = c1;
+    }
+}
+
+static void sort_cc(int *buf, int len)
+{
+    int i, j, k, cc, cc1, start, ch1;
+    
+    for(i = 0; i < len; i++) {
+        cc = unicode_get_cc(buf[i]);
+        if (cc != 0) {
+            start = i;
+            j = i + 1;
+            while (j < len) {
+                ch1 = buf[j];
+                cc1 = unicode_get_cc(ch1);
+                if (cc1 == 0)
+                    break;
+                k = j - 1;
+                while (k >= start) {
+                    if (unicode_get_cc(buf[k]) <= cc1)
+                        break;
+                    buf[k + 1] = buf[k];
+                    k--;
+                }
+                buf[k + 1] = ch1;
+                j++;
+            }
+#if 0
+            printf("cc:");
+            for(k = start; k < j; k++) {
+                printf(" %3d", unicode_get_cc(buf[k]));
+            }
+            printf("\n");
+#endif
+            i = j;
+        }
+    }
+}
+
+static void to_nfd_rec(DynBuf *dbuf,
+                       const int *src, int src_len, int is_compat)
+{
+    uint32_t c, v;
+    int i, l;
+    uint32_t res[UNICODE_DECOMP_LEN_MAX];
+    
+    for(i = 0; i < src_len; i++) {
+        c = src[i];
+        if (c >= 0xac00 && c < 0xd7a4) {
+            /* Hangul decomposition */
+            c -= 0xac00;
+            dbuf_put_u32(dbuf, 0x1100 + c / 588);
+            dbuf_put_u32(dbuf, 0x1161 + (c % 588) / 28);
+            v = c % 28;
+            if (v != 0)
+                dbuf_put_u32(dbuf, 0x11a7 + v);
+        } else {
+            l = unicode_decomp_char(res, c, is_compat);
+            if (l) {
+                to_nfd_rec(dbuf, (int *)res, l, is_compat);
+            } else {
+                dbuf_put_u32(dbuf, c);
+            }
+        }
+    }
+}
+
+/* return 0 if not found */
+static int compose_pair(uint32_t c0, uint32_t c1)
+{
+    /* Hangul composition */
+    if (c0 >= 0x1100 && c0 < 0x1100 + 19 &&
+        c1 >= 0x1161 && c1 < 0x1161 + 21) {
+        return 0xac00 + (c0 - 0x1100) * 588 + (c1 - 0x1161) * 28;
+    } else if (c0 >= 0xac00 && c0 < 0xac00 + 11172 &&
+               (c0 - 0xac00) % 28 == 0 &&
+               c1 >= 0x11a7 && c1 < 0x11a7 + 28) {
+        return c0 + c1 - 0x11a7;
+    } else {
+        return unicode_compose_pair(c0, c1);
+    }
+}
+
+int unicode_normalize(uint32_t **pdst, const uint32_t *src, int src_len,
+                      UnicodeNormalizationEnum n_type,
+                      void *opaque, DynBufReallocFunc *realloc_func)
+{
+    int *buf, buf_len, i, p, starter_pos, cc, last_cc, out_len;
+    BOOL is_compat;
+    DynBuf dbuf_s, *dbuf = &dbuf_s;
+    
+    is_compat = n_type >> 1;
+
+    dbuf_init2(dbuf, opaque, realloc_func);
+    if (dbuf_realloc(dbuf, sizeof(int) * src_len))
+        goto fail;
+
+    /* common case: latin1 is unaffected by NFC */
+    if (n_type == UNICODE_NFC) {
+        for(i = 0; i < src_len; i++) {
+            if (src[i] >= 0x100)
+                goto not_latin1;
+        }
+        buf = (int *)dbuf->buf;
+        memcpy(buf, src, src_len * sizeof(int));
+        *pdst = (uint32_t *)buf;
+        return src_len;
+    not_latin1: ;
+    }
+
+    to_nfd_rec(dbuf, (const int *)src, src_len, is_compat);
+    if (dbuf_error(dbuf)) {
+    fail:
+        *pdst = NULL;
+        return -1;
+    }
+    buf = (int *)dbuf->buf;
+    buf_len = dbuf->size / sizeof(int);
+        
+    sort_cc(buf, buf_len);
+    
+    if (buf_len <= 1 || (n_type & 1) != 0) {
+        /* NFD / NFKD */
+        *pdst = (uint32_t *)buf;
+        return buf_len;
+    }
+    
+    i = 1;
+    out_len = 1;
+    while (i < buf_len) {
+        /* find the starter character and test if it is blocked from
+           the character at 'i' */
+        last_cc = unicode_get_cc(buf[i]);
+        starter_pos = out_len - 1;
+        while (starter_pos >= 0) {
+            cc = unicode_get_cc(buf[starter_pos]);
+            if (cc == 0)
+                break;
+            if (cc >= last_cc)
+                goto next;
+            last_cc = 256;
+            starter_pos--;
+        }
+        if (starter_pos >= 0 &&
+            (p = compose_pair(buf[starter_pos], buf[i])) != 0) {
+            buf[starter_pos] = p;
+            i++;
+        } else {
+        next:
+            buf[out_len++] = buf[i++];
+        }
+    }
+    *pdst = (uint32_t *)buf;
+    return out_len;
+}
+
+/* char ranges for various unicode properties */
+
+static int unicode_find_name(const char *name_table, const char *name)
+{
+    const char *p, *r;
+    int pos;
+    size_t name_len, len;
+    
+    p = name_table;
+    pos = 0;
+    name_len = strlen(name);
+    while (*p) {
+        for(;;) {
+            r = strchr(p, ',');
+            if (!r)
+                len = strlen(p);
+            else
+                len = r - p;
+            if (len == name_len && !memcmp(p, name, name_len))
+                return pos;
+            p += len + 1;
+            if (!r)
+                break;
+        }
+        pos++;
+    }
+    return -1;
+}
+
+/* 'cr' must be initialized and empty. Return 0 if OK, -1 if error, -2
+   if not found */
+int unicode_script(CharRange *cr,
+                   const char *script_name, BOOL is_ext)
+{
+    int script_idx;
+    const uint8_t *p, *p_end;
+    uint32_t c, c1, b, n, v, v_len, i, type;
+    CharRange cr1_s, *cr1;
+    CharRange cr2_s, *cr2 = &cr2_s;
+    BOOL is_common;
+    
+    script_idx = unicode_find_name(unicode_script_name_table, script_name);
+    if (script_idx < 0)
+        return -2;
+    /* Note: we remove the "Unknown" Script */
+    script_idx += UNICODE_SCRIPT_Unknown + 1;
+        
+    is_common = (script_idx == UNICODE_SCRIPT_Common ||
+                 script_idx == UNICODE_SCRIPT_Inherited);
+    if (is_ext) {
+        cr1 = &cr1_s;
+        cr_init(cr1, cr->mem_opaque, cr->realloc_func);
+        cr_init(cr2, cr->mem_opaque, cr->realloc_func);
+    } else {
+        cr1 = cr;
+    }
+
+    p = unicode_script_table;
+    p_end = unicode_script_table + countof(unicode_script_table);
+    c = 0;
+    while (p < p_end) {
+        b = *p++;
+        type = b >> 7;
+        n = b & 0x7f;
+        if (n < 96) {
+        } else if (n < 112) {
+            n = (n - 96) << 8;
+            n |= *p++;
+            n += 96;
+        } else {
+            n = (n - 112) << 16;
+            n |= *p++ << 8;
+            n |= *p++;
+            n += 96 + (1 << 12);
+        }
+        if (type == 0)
+            v = 0;
+        else
+            v = *p++;
+        c1 = c + n + 1;
+        if (v == script_idx) {
+            if (cr_add_interval(cr1, c, c1))
+                goto fail;
+        }
+        c = c1;
+    }
+
+    if (is_ext) {
+        /* add the script extensions */
+        p = unicode_script_ext_table;
+        p_end = unicode_script_ext_table + countof(unicode_script_ext_table);
+        c = 0;
+        while (p < p_end) {
+            b = *p++;
+            if (b < 128) {
+                n = b;
+            } else if (b < 128 + 64) {
+                n = (b - 128) << 8;
+                n |= *p++;
+                n += 128;
+            } else {
+                n = (b - 128 - 64) << 16;
+                n |= *p++ << 8;
+                n |= *p++;
+                n += 128 + (1 << 14);
+            }
+            c1 = c + n + 1;
+            v_len = *p++;
+            if (is_common) {
+                if (v_len != 0) {
+                    if (cr_add_interval(cr2, c, c1))
+                        goto fail;
+                }
+            } else {
+                for(i = 0; i < v_len; i++) {
+                    if (p[i] == script_idx) {
+                        if (cr_add_interval(cr2, c, c1))
+                            goto fail;
+                        break;
+                    }
+                }
+            }
+            p += v_len;
+            c = c1;
+        }
+        if (is_common) {
+            /* remove all the characters with script extensions */
+            if (cr_invert(cr2))
+                goto fail;
+            if (cr_op(cr, cr1->points, cr1->len, cr2->points, cr2->len,
+                      CR_OP_INTER))
+                goto fail;
+        } else {
+            if (cr_op(cr, cr1->points, cr1->len, cr2->points, cr2->len,
+                      CR_OP_UNION))
+                goto fail;
+        }
+        cr_free(cr1);
+        cr_free(cr2);
+    }
+    return 0;
+ fail:
+    if (is_ext) {
+        cr_free(cr1);
+        cr_free(cr2);
+    }
+    goto fail;
+}
+
+#define M(id) (1U << UNICODE_GC_ ## id)
+
+static int unicode_general_category1(CharRange *cr, uint32_t gc_mask)
+{
+    const uint8_t *p, *p_end;
+    uint32_t c, c0, b, n, v;
+
+    p = unicode_gc_table;
+    p_end = unicode_gc_table + countof(unicode_gc_table);
+    c = 0;
+    while (p < p_end) {
+        b = *p++;
+        n = b >> 5;
+        v = b & 0x1f;
+        if (n == 7) {
+            n = *p++;
+            if (n < 128) {
+                n += 7;
+            } else if (n < 128 + 64) {
+                n = (n - 128) << 8;
+                n |= *p++;
+                n += 7 + 128;
+            } else {
+                n = (n - 128 - 64) << 16;
+                n |= *p++ << 8;
+                n |= *p++;
+                n += 7 + 128 + (1 << 14);
+            }
+        }
+        c0 = c;
+        c += n + 1;
+        if (v == 31) {
+            /* run of Lu / Ll */
+            b = gc_mask & (M(Lu) | M(Ll));
+            if (b != 0) {
+                if (b == (M(Lu) | M(Ll))) {
+                    goto add_range;
+                } else {
+                    c0 += ((gc_mask & M(Ll)) != 0);
+                    for(; c0 < c; c0 += 2) {
+                        if (cr_add_interval(cr, c0, c0 + 1))
+                            return -1;
+                    }
+                }
+            }
+        } else if ((gc_mask >> v) & 1) {
+        add_range:
+            if (cr_add_interval(cr, c0, c))
+                return -1;
+        }
+    }
+    return 0;
+}
+
+static int unicode_prop1(CharRange *cr, int prop_idx)
+{
+    const uint8_t *p, *p_end;
+    uint32_t c, c0, b, bit;
+
+    p = unicode_prop_table[prop_idx];
+    p_end = p + unicode_prop_len_table[prop_idx];
+    c = 0;
+    bit = 0;
+    while (p < p_end) {
+        c0 = c;
+        b = *p++;
+        if (b < 64) {
+            c += (b >> 3) + 1;
+            if (bit)  {
+                if (cr_add_interval(cr, c0, c))
+                    return -1;
+            }
+            bit ^= 1;
+            c0 = c;
+            c += (b & 7) + 1;
+        } else if (b >= 0x80) {
+            c += b - 0x80 + 1;
+        } else if (b < 0x60) {
+            c += (((b - 0x40) << 8) | p[0]) + 1;
+            p++;
+        } else {
+            c += (((b - 0x60) << 16) | (p[0] << 8) | p[1]) + 1;
+            p += 2;
+        }
+        if (bit)  {
+            if (cr_add_interval(cr, c0, c))
+                return -1;
+        }
+        bit ^= 1;
+    }
+    return 0;
+}
+
+#define CASE_U (1 << 0)
+#define CASE_L (1 << 1)
+#define CASE_F (1 << 2)
+
+/* use the case conversion table to generate range of characters.
+   CASE_U: set char if modified by uppercasing,
+   CASE_L: set char if modified by lowercasing,
+   CASE_F: set char if modified by case folding,
+ */
+static int unicode_case1(CharRange *cr, int case_mask)
+{
+#define MR(x) (1 << RUN_TYPE_ ## x)
+    const uint32_t tab_run_mask[3] = {
+        MR(U) | MR(UF) | MR(UL) | MR(LSU) | MR(U2L_399_EXT2) | MR(UF_D20) |
+        MR(UF_D1_EXT) | MR(U_EXT) | MR(U_EXT2) | MR(U_EXT3),
+
+        MR(L) | MR(LF) | MR(UL) | MR(LSU) | MR(U2L_399_EXT2) | MR(LF_EXT) | MR(L_EXT2),
+
+        MR(UF) | MR(LF) | MR(UL) | MR(LSU) | MR(U2L_399_EXT2) | MR(LF_EXT) | MR(UF_D20) | MR(UF_D1_EXT) | MR(LF_EXT),
+    };
+#undef MR
+    uint32_t mask, v, code, type, len, i, idx;
+
+    if (case_mask == 0)
+        return 0;
+    mask = 0;
+    for(i = 0; i < 3; i++) {
+        if ((case_mask >> i) & 1)
+            mask |= tab_run_mask[i];
+    }
+    for(idx = 0; idx < countof(case_conv_table1); idx++) {
+        v = case_conv_table1[idx];
+        type = (v >> (32 - 17 - 7 - 4)) & 0xf;
+        code = v >> (32 - 17);
+        len = (v >> (32 - 17 - 7)) & 0x7f;
+        if ((mask >> type) & 1) {
+            //            printf("%d: type=%d %04x %04x\n", idx, type, code, code + len - 1);
+            switch(type) {
+            case RUN_TYPE_UL:
+                if ((case_mask & CASE_U) && (case_mask & (CASE_L | CASE_F)))
+                    goto def_case;
+                code += ((case_mask & CASE_U) != 0);
+                for(i = 0; i < len; i += 2) {
+                    if (cr_add_interval(cr, code + i, code + i + 1))
+                        return -1;
+                }
+                break;
+            case RUN_TYPE_LSU:
+                if ((case_mask & CASE_U) && (case_mask & (CASE_L | CASE_F)))
+                    goto def_case;
+                if (!(case_mask & CASE_U)) {
+                    if (cr_add_interval(cr, code, code + 1))
+                        return -1;
+                }
+                if (cr_add_interval(cr, code + 1, code + 2))
+                    return -1;
+                if (case_mask & CASE_U) {
+                    if (cr_add_interval(cr, code + 2, code + 3))
+                        return -1;
+                }
+                break;
+            default:
+            def_case:
+                if (cr_add_interval(cr, code, code + len))
+                    return -1;
+                break;
+            }
+        }
+    }
+    return 0;
+}
+        
+typedef enum {
+    POP_GC,
+    POP_PROP,
+    POP_CASE,
+    POP_UNION,
+    POP_INTER,
+    POP_XOR,
+    POP_INVERT,
+    POP_END,
+} PropOPEnum;
+
+#define POP_STACK_LEN_MAX 4
+
+static int unicode_prop_ops(CharRange *cr, ...)
+{
+    va_list ap;
+    CharRange stack[POP_STACK_LEN_MAX];
+    int stack_len, op, ret, i;
+    uint32_t a;
+    
+    va_start(ap, cr);
+    stack_len = 0;
+    for(;;) {
+        op = va_arg(ap, int);
+        switch(op) {
+        case POP_GC:
+            assert(stack_len < POP_STACK_LEN_MAX);
+            a = va_arg(ap, int);
+            cr_init(&stack[stack_len++], cr->mem_opaque, cr->realloc_func);
+            if (unicode_general_category1(&stack[stack_len - 1], a))
+                goto fail;
+            break;
+        case POP_PROP:
+            assert(stack_len < POP_STACK_LEN_MAX);
+            a = va_arg(ap, int);
+            cr_init(&stack[stack_len++], cr->mem_opaque, cr->realloc_func);
+            if (unicode_prop1(&stack[stack_len - 1], a))
+                goto fail;
+            break;
+        case POP_CASE:
+            assert(stack_len < POP_STACK_LEN_MAX);
+            a = va_arg(ap, int);
+            cr_init(&stack[stack_len++], cr->mem_opaque, cr->realloc_func);
+            if (unicode_case1(&stack[stack_len - 1], a))
+                goto fail;
+            break;
+        case POP_UNION:
+        case POP_INTER:
+        case POP_XOR:
+            {
+                CharRange *cr1, *cr2, *cr3;
+                assert(stack_len >= 2);
+                assert(stack_len < POP_STACK_LEN_MAX);
+                cr1 = &stack[stack_len - 2];
+                cr2 = &stack[stack_len - 1];
+                cr3 = &stack[stack_len++];
+                cr_init(cr3, cr->mem_opaque, cr->realloc_func);
+                if (cr_op(cr3, cr1->points, cr1->len,
+                          cr2->points, cr2->len, op - POP_UNION + CR_OP_UNION))
+                    goto fail;
+                cr_free(cr1);
+                cr_free(cr2);
+                *cr1 = *cr3;
+                stack_len -= 2;
+            }
+            break;
+        case POP_INVERT:
+            assert(stack_len >= 1);
+            if (cr_invert(&stack[stack_len - 1]))
+                goto fail;
+            break;
+        case POP_END:
+            goto done;
+        default:
+            abort();
+        }
+    }
+ done:
+    assert(stack_len == 1);
+    ret = cr_copy(cr, &stack[0]);
+    cr_free(&stack[0]);
+    return ret;
+ fail:
+    for(i = 0; i < stack_len; i++)
+        cr_free(&stack[i]);
+    return -1;
+}
+
+static const uint32_t unicode_gc_mask_table[] = {
+    M(Lu) | M(Ll) | M(Lt), /* LC */
+    M(Lu) | M(Ll) | M(Lt) | M(Lm) | M(Lo), /* L */
+    M(Mn) | M(Mc) | M(Me), /* M */
+    M(Nd) | M(Nl) | M(No), /* N */
+    M(Sm) | M(Sc) | M(Sk) | M(So), /* S */
+    M(Pc) | M(Pd) | M(Ps) | M(Pe) | M(Pi) | M(Pf) | M(Po), /* P */
+    M(Zs) | M(Zl) | M(Zp), /* Z */
+    M(Cc) | M(Cf) | M(Cs) | M(Co) | M(Cn), /* C */
+};
+
+/* 'cr' must be initialized and empty. Return 0 if OK, -1 if error, -2
+   if not found */
+int unicode_general_category(CharRange *cr, const char *gc_name)
+{
+    int gc_idx;
+    uint32_t gc_mask;
+    
+    gc_idx = unicode_find_name(unicode_gc_name_table, gc_name);
+    if (gc_idx < 0)
+        return -2;
+    if (gc_idx <= UNICODE_GC_Co) {
+        gc_mask = (uint64_t)1 << gc_idx;
+    } else {
+        gc_mask = unicode_gc_mask_table[gc_idx - UNICODE_GC_LC];
+    }
+    return unicode_general_category1(cr, gc_mask);
+}
+
+
+/* 'cr' must be initialized and empty. Return 0 if OK, -1 if error, -2
+   if not found */
+int unicode_prop(CharRange *cr, const char *prop_name)
+{
+    int prop_idx, ret;
+    
+    prop_idx = unicode_find_name(unicode_prop_name_table, prop_name);
+    if (prop_idx < 0)
+        return -2;
+    prop_idx += UNICODE_PROP_ASCII_Hex_Digit;
+
+    ret = 0;
+    switch(prop_idx) {
+    case UNICODE_PROP_ASCII:
+        if (cr_add_interval(cr, 0x00, 0x7f + 1))
+            return -1;
+        break;
+    case UNICODE_PROP_Any:
+        if (cr_add_interval(cr, 0x00000, 0x10ffff + 1))
+            return -1;
+        break;
+    case UNICODE_PROP_Assigned:
+        ret = unicode_prop_ops(cr,
+                               POP_GC, M(Cn),
+                               POP_INVERT,
+                               POP_END);
+        break;
+    case UNICODE_PROP_Math:
+        ret = unicode_prop_ops(cr,
+                               POP_GC, M(Sm),
+                               POP_PROP, UNICODE_PROP_Other_Math,
+                               POP_UNION,
+                               POP_END);
+        break;
+    case UNICODE_PROP_Lowercase:
+        ret = unicode_prop_ops(cr,
+                               POP_GC, M(Ll),
+                               POP_PROP, UNICODE_PROP_Other_Lowercase,
+                               POP_UNION,
+                               POP_END);
+        break;
+    case UNICODE_PROP_Uppercase:
+        ret = unicode_prop_ops(cr,
+                               POP_GC, M(Lu),
+                               POP_PROP, UNICODE_PROP_Other_Uppercase,
+                               POP_UNION,
+                               POP_END);
+        break;
+    case UNICODE_PROP_Cased:
+        ret = unicode_prop_ops(cr,
+                               POP_GC, M(Lu) | M(Ll) | M(Lt),
+                               POP_PROP, UNICODE_PROP_Other_Uppercase,
+                               POP_UNION,
+                               POP_PROP, UNICODE_PROP_Other_Lowercase,
+                               POP_UNION,
+                               POP_END);
+        break;
+    case UNICODE_PROP_Alphabetic:
+        ret = unicode_prop_ops(cr,
+                               POP_GC, M(Lu) | M(Ll) | M(Lt) | M(Lm) | M(Lo) | M(Nl),
+                               POP_PROP, UNICODE_PROP_Other_Uppercase,
+                               POP_UNION,
+                               POP_PROP, UNICODE_PROP_Other_Lowercase,
+                               POP_UNION,
+                               POP_PROP, UNICODE_PROP_Other_Alphabetic,
+                               POP_UNION,
+                               POP_END);
+        break;
+    case UNICODE_PROP_Grapheme_Base:
+        ret = unicode_prop_ops(cr,
+                               POP_GC, M(Cc) | M(Cf) | M(Cs) | M(Co) | M(Cn) | M(Zl) | M(Zp) | M(Me) | M(Mn),
+                               POP_PROP, UNICODE_PROP_Other_Grapheme_Extend,
+                               POP_UNION,
+                               POP_INVERT,
+                               POP_END);
+        break;
+    case UNICODE_PROP_Grapheme_Extend:
+        ret = unicode_prop_ops(cr,
+                               POP_GC, M(Me) | M(Mn),
+                               POP_PROP, UNICODE_PROP_Other_Grapheme_Extend,
+                               POP_UNION,
+                               POP_END);
+        break;
+    case UNICODE_PROP_XID_Start:
+        ret = unicode_prop_ops(cr,
+                               POP_GC, M(Lu) | M(Ll) | M(Lt) | M(Lm) | M(Lo) | M(Nl),
+                               POP_PROP, UNICODE_PROP_Other_ID_Start,
+                               POP_UNION,
+                               POP_PROP, UNICODE_PROP_Pattern_Syntax,
+                               POP_PROP, UNICODE_PROP_Pattern_White_Space,
+                               POP_UNION,
+                               POP_PROP, UNICODE_PROP_XID_Start1,
+                               POP_UNION,
+                               POP_INVERT,
+                               POP_INTER,
+                               POP_END);
+        break;
+    case UNICODE_PROP_XID_Continue:
+        ret = unicode_prop_ops(cr,
+                               POP_GC, M(Lu) | M(Ll) | M(Lt) | M(Lm) | M(Lo) | M(Nl) |
+                               M(Mn) | M(Mc) | M(Nd) | M(Pc),
+                               POP_PROP, UNICODE_PROP_Other_ID_Start,
+                               POP_UNION,
+                               POP_PROP, UNICODE_PROP_Other_ID_Continue,
+                               POP_UNION,
+                               POP_PROP, UNICODE_PROP_Pattern_Syntax,
+                               POP_PROP, UNICODE_PROP_Pattern_White_Space,
+                               POP_UNION,
+                               POP_PROP, UNICODE_PROP_XID_Continue1,
+                               POP_UNION,
+                               POP_INVERT,
+                               POP_INTER,
+                               POP_END);
+        break;
+    case UNICODE_PROP_Changes_When_Uppercased:
+        ret = unicode_case1(cr, CASE_U);
+        break;
+    case UNICODE_PROP_Changes_When_Lowercased:
+        ret = unicode_case1(cr, CASE_L);
+        break;
+    case UNICODE_PROP_Changes_When_Casemapped:
+        ret = unicode_case1(cr, CASE_U | CASE_L | CASE_F);
+        break;
+    case UNICODE_PROP_Changes_When_Titlecased:
+        ret = unicode_prop_ops(cr,
+                               POP_CASE, CASE_U,
+                               POP_PROP, UNICODE_PROP_Changes_When_Titlecased1,
+                               POP_XOR,
+                               POP_END);
+        break;
+    case UNICODE_PROP_Changes_When_Casefolded:
+        ret = unicode_prop_ops(cr,
+                               POP_CASE, CASE_F,
+                               POP_PROP, UNICODE_PROP_Changes_When_Casefolded1,
+                               POP_XOR,
+                               POP_END);
+        break;
+    case UNICODE_PROP_Changes_When_NFKC_Casefolded:
+        ret = unicode_prop_ops(cr,
+                               POP_CASE, CASE_F,
+                               POP_PROP, UNICODE_PROP_Changes_When_NFKC_Casefolded1,
+                               POP_XOR,
+                               POP_END);
+        break;
+#if 0
+    case UNICODE_PROP_ID_Start:
+        ret = unicode_prop_ops(cr,
+                               POP_GC, M(Lu) | M(Ll) | M(Lt) | M(Lm) | M(Lo) | M(Nl),
+                               POP_PROP, UNICODE_PROP_Other_ID_Start,
+                               POP_UNION,
+                               POP_PROP, UNICODE_PROP_Pattern_Syntax,
+                               POP_PROP, UNICODE_PROP_Pattern_White_Space,
+                               POP_UNION,
+                               POP_INVERT,
+                               POP_INTER,
+                               POP_END);
+        break;
+    case UNICODE_PROP_ID_Continue:
+        ret = unicode_prop_ops(cr,
+                               POP_GC, M(Lu) | M(Ll) | M(Lt) | M(Lm) | M(Lo) | M(Nl) |
+                               M(Mn) | M(Mc) | M(Nd) | M(Pc),
+                               POP_PROP, UNICODE_PROP_Other_ID_Start,
+                               POP_UNION,
+                               POP_PROP, UNICODE_PROP_Other_ID_Continue,
+                               POP_UNION,
+                               POP_PROP, UNICODE_PROP_Pattern_Syntax,
+                               POP_PROP, UNICODE_PROP_Pattern_White_Space,
+                               POP_UNION,
+                               POP_INVERT,
+                               POP_INTER,
+                               POP_END);
+        break;
+    case UNICODE_PROP_Case_Ignorable:
+        ret = unicode_prop_ops(cr,
+                               POP_GC, M(Mn) | M(Cf) | M(Lm) | M(Sk),
+                               POP_PROP, UNICODE_PROP_Case_Ignorable1,
+                               POP_XOR,
+                               POP_END);
+        break;
+#else
+        /* we use the existing tables */
+    case UNICODE_PROP_ID_Continue:
+        ret = unicode_prop_ops(cr,
+                               POP_PROP, UNICODE_PROP_ID_Start,
+                               POP_PROP, UNICODE_PROP_ID_Continue1,
+                               POP_XOR,
+                               POP_END);
+        break;
+#endif
+    default:
+        if (prop_idx >= countof(unicode_prop_table))
+            return -2;
+        ret = unicode_prop1(cr, prop_idx);
+        break;
+    }
+    return ret;
+}
+
+#endif /* CONFIG_ALL_UNICODE */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode.h
new file mode 100755
index 00000000..cfa600a5
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/libunicode.h
@@ -0,0 +1,124 @@
+/*
+ * Unicode utilities
+ * 
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#ifndef LIBUNICODE_H
+#define LIBUNICODE_H
+
+#include <inttypes.h>
+
+#define LRE_BOOL  int       /* for documentation purposes */
+
+/* define it to include all the unicode tables (40KB larger) */
+#define CONFIG_ALL_UNICODE
+
+#define LRE_CC_RES_LEN_MAX 3
+
+typedef enum {
+    UNICODE_NFC,
+    UNICODE_NFD,
+    UNICODE_NFKC,
+    UNICODE_NFKD,
+} UnicodeNormalizationEnum;
+
+int lre_case_conv(uint32_t *res, uint32_t c, int conv_type);
+LRE_BOOL lre_is_cased(uint32_t c);
+LRE_BOOL lre_is_case_ignorable(uint32_t c);
+
+/* char ranges */
+
+typedef struct {
+    int len; /* in points, always even */
+    int size;
+    uint32_t *points; /* points sorted by increasing value */
+    void *mem_opaque;
+    void *(*realloc_func)(void *opaque, void *ptr, size_t size);
+} CharRange;
+
+typedef enum {
+    CR_OP_UNION,
+    CR_OP_INTER,
+    CR_OP_XOR,
+} CharRangeOpEnum;
+
+void cr_init(CharRange *cr, void *mem_opaque, void *(*realloc_func)(void *opaque, void *ptr, size_t size));
+void cr_free(CharRange *cr);
+int cr_realloc(CharRange *cr, int size);
+int cr_copy(CharRange *cr, const CharRange *cr1);
+
+static inline int cr_add_point(CharRange *cr, uint32_t v)
+{
+    if (cr->len >= cr->size) {
+        if (cr_realloc(cr, cr->len + 1))
+            return -1;
+    }
+    cr->points[cr->len++] = v;
+    return 0;
+}
+
+static inline int cr_add_interval(CharRange *cr, uint32_t c1, uint32_t c2)
+{
+    if ((cr->len + 2) > cr->size) {
+        if (cr_realloc(cr, cr->len + 2))
+            return -1;
+    }
+    cr->points[cr->len++] = c1;
+    cr->points[cr->len++] = c2;
+    return 0;
+}
+
+int cr_union1(CharRange *cr, const uint32_t *b_pt, int b_len);
+
+static inline int cr_union_interval(CharRange *cr, uint32_t c1, uint32_t c2)
+{
+    uint32_t b_pt[2];
+    b_pt[0] = c1;
+    b_pt[1] = c2 + 1;
+    return cr_union1(cr, b_pt, 2);
+}
+
+int cr_op(CharRange *cr, const uint32_t *a_pt, int a_len,
+          const uint32_t *b_pt, int b_len, int op);
+
+int cr_invert(CharRange *cr);
+
+#ifdef CONFIG_ALL_UNICODE
+
+LRE_BOOL lre_is_id_start(uint32_t c);
+LRE_BOOL lre_is_id_continue(uint32_t c);
+
+int unicode_normalize(uint32_t **pdst, const uint32_t *src, int src_len,
+                      UnicodeNormalizationEnum n_type,
+                      void *opaque, void *(*realloc_func)(void *opaque, void *ptr, size_t size));
+
+/* Unicode character range functions */
+
+int unicode_script(CharRange *cr,
+                   const char *script_name, LRE_BOOL is_ext);
+int unicode_general_category(CharRange *cr, const char *gc_name);
+int unicode_prop(CharRange *cr, const char *prop_name);
+
+#endif /* CONFIG_ALL_UNICODE */
+
+#undef LRE_BOOL
+
+#endif /* LIBUNICODE_H */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/list.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/list.h
new file mode 100755
index 00000000..0a1bc5a4
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/list.h
@@ -0,0 +1,100 @@
+/*
+ * Linux klist like system
+ * 
+ * Copyright (c) 2016-2017 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#ifndef LIST_H
+#define LIST_H
+
+#ifndef NULL
+#include <stddef.h>
+#endif
+
+struct list_head {
+    struct list_head *prev;
+    struct list_head *next;
+};
+
+#define LIST_HEAD_INIT(el) { &(el), &(el) }
+
+/* return the pointer of type 'type *' containing 'el' as field 'member' */
+#define list_entry(el, type, member) \
+    ((type *)((uint8_t *)(el) - offsetof(type, member)))
+
+static inline void init_list_head(struct list_head *head)
+{
+    head->prev = head;
+    head->next = head;
+}
+
+/* insert 'el' between 'prev' and 'next' */
+static inline void __list_add(struct list_head *el, 
+                              struct list_head *prev, struct list_head *next)
+{
+    prev->next = el;
+    el->prev = prev;
+    el->next = next;
+    next->prev = el;
+}
+
+/* add 'el' at the head of the list 'head' (= after element head) */
+static inline void list_add(struct list_head *el, struct list_head *head)
+{
+    __list_add(el, head, head->next);
+}
+
+/* add 'el' at the end of the list 'head' (= before element head) */
+static inline void list_add_tail(struct list_head *el, struct list_head *head)
+{
+    __list_add(el, head->prev, head);
+}
+
+static inline void list_del(struct list_head *el)
+{
+    struct list_head *prev, *next;
+    prev = el->prev;
+    next = el->next;
+    prev->next = next;
+    next->prev = prev;
+    el->prev = NULL; /* fail safe */
+    el->next = NULL; /* fail safe */
+}
+
+static inline int list_empty(struct list_head *el)
+{
+    return el->next == el;
+}
+
+#define list_for_each(el, head) \
+  for(el = (head)->next; el != (head); el = el->next)
+
+#define list_for_each_safe(el, el1, head)                \
+    for(el = (head)->next, el1 = el->next; el != (head); \
+        el = el1, el1 = el->next)
+
+#define list_for_each_prev(el, head) \
+  for(el = (head)->prev; el != (head); el = el->prev)
+
+#define list_for_each_prev_safe(el, el1, head)           \
+    for(el = (head)->prev, el1 = el->prev; el != (head); \
+        el = el1, el1 = el->prev)
+
+#endif /* LIST_H */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjs.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjs.c
new file mode 100755
index 00000000..975e83c9
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjs.c
@@ -0,0 +1,466 @@
+/*
+ * QuickJS stand alone interpreter
+ * 
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ * Copyright (c) 2017-2018 Charlie Gordon
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include <stdlib.h>
+#include <stdio.h>
+#include <stdarg.h>
+#include <inttypes.h>
+#include <string.h>
+#include <assert.h>
+#include <unistd.h>
+#include <errno.h>
+#include <fcntl.h>
+#include <time.h>
+#if defined(__APPLE__)
+#include <malloc/malloc.h>
+#elif defined(__linux__)
+#include <malloc.h>
+#endif
+
+#include "cutils.h"
+#include "quickjs-libc.h"
+
+extern const uint8_t repl[];
+extern const uint32_t repl_size;
+#ifdef CONFIG_BIGNUM
+extern const uint8_t qjscalc[];
+extern const uint32_t qjscalc_size;
+#endif
+
+static int eval_buf(JSContext *ctx, const void *buf, int buf_len,
+                    const char *filename, int eval_flags)
+{
+    JSValue val;
+    int ret;
+
+    val = JS_Eval(ctx, buf, buf_len, filename, eval_flags);
+    if (JS_IsException(val)) {
+        js_std_dump_error(ctx);
+        ret = -1;
+    } else {
+        ret = 0;
+    }
+    JS_FreeValue(ctx, val);
+    return ret;
+}
+
+static int eval_file(JSContext *ctx, const char *filename, int eval_flags)
+{
+    uint8_t *buf;
+    int ret;
+    size_t buf_len;
+    
+    buf = js_load_file(ctx, &buf_len, filename);
+    if (!buf) {
+        perror(filename);
+        exit(1);
+    }
+    ret = eval_buf(ctx, buf, buf_len, filename, eval_flags);
+    js_free(ctx, buf);
+    return ret;
+}
+
+#if defined(__APPLE__)
+#define MALLOC_OVERHEAD  0
+#else
+#define MALLOC_OVERHEAD  8
+#endif
+
+struct trace_malloc_data {
+    uint8_t *base;
+};
+
+static inline unsigned long long js_trace_malloc_ptr_offset(uint8_t *ptr,
+                                                struct trace_malloc_data *dp)
+{
+    return ptr - dp->base;
+}
+
+/* default memory allocation functions with memory limitation */
+static inline size_t js_trace_malloc_usable_size(void *ptr)
+{
+#if defined(__APPLE__)
+    return malloc_size(ptr);
+#elif defined(_WIN32)
+    return _msize(ptr);
+#elif defined(EMSCRIPTEN)
+    return 0;
+#elif defined(__linux__)
+    return malloc_usable_size(ptr);
+#else
+    /* change this to `return 0;` if compilation fails */
+    return malloc_usable_size(ptr);
+#endif
+}
+
+static void __attribute__((format(printf, 2, 3)))
+    js_trace_malloc_printf(JSMallocState *s, const char *fmt, ...)
+{
+    va_list ap;
+    int c;
+
+    va_start(ap, fmt);
+    while ((c = *fmt++) != '\0') {
+        if (c == '%') {
+            /* only handle %p and %zd */
+            if (*fmt == 'p') {
+                uint8_t *ptr = va_arg(ap, void *);
+                if (ptr == NULL) {
+                    printf("NULL");
+                } else {
+                    printf("H%+06lld.%zd",
+                           js_trace_malloc_ptr_offset(ptr, s->opaque),
+                           js_trace_malloc_usable_size(ptr));
+                }
+                fmt++;
+                continue;
+            }
+            if (fmt[0] == 'z' && fmt[1] == 'd') {
+                size_t sz = va_arg(ap, size_t);
+                printf("%zd", sz);
+                fmt += 2;
+                continue;
+            }
+        }
+        putc(c, stdout);
+    }
+    va_end(ap);
+}
+
+static void js_trace_malloc_init(struct trace_malloc_data *s)
+{
+    free(s->base = malloc(8));
+}
+
+static void *js_trace_malloc(JSMallocState *s, size_t size)
+{
+    void *ptr;
+
+    /* Do not allocate zero bytes: behavior is platform dependent */
+    assert(size != 0);
+
+    if (unlikely(s->malloc_size + size > s->malloc_limit))
+        return NULL;
+    ptr = malloc(size);
+    js_trace_malloc_printf(s, "A %zd -> %p\n", size, ptr);
+    if (ptr) {
+        s->malloc_count++;
+        s->malloc_size += js_trace_malloc_usable_size(ptr) + MALLOC_OVERHEAD;
+    }
+    return ptr;
+}
+
+static void js_trace_free(JSMallocState *s, void *ptr)
+{
+    if (!ptr)
+        return;
+
+    js_trace_malloc_printf(s, "F %p\n", ptr);
+    s->malloc_count--;
+    s->malloc_size -= js_trace_malloc_usable_size(ptr) + MALLOC_OVERHEAD;
+    free(ptr);
+}
+
+static void *js_trace_realloc(JSMallocState *s, void *ptr, size_t size)
+{
+    size_t old_size;
+
+    if (!ptr) {
+        if (size == 0)
+            return NULL;
+        return js_trace_malloc(s, size);
+    }
+    old_size = js_trace_malloc_usable_size(ptr);
+    if (size == 0) {
+        js_trace_malloc_printf(s, "R %zd %p\n", size, ptr);
+        s->malloc_count--;
+        s->malloc_size -= old_size + MALLOC_OVERHEAD;
+        free(ptr);
+        return NULL;
+    }
+    if (s->malloc_size + size - old_size > s->malloc_limit)
+        return NULL;
+
+    js_trace_malloc_printf(s, "R %zd %p", size, ptr);
+
+    ptr = realloc(ptr, size);
+    js_trace_malloc_printf(s, " -> %p\n", ptr);
+    if (ptr) {
+        s->malloc_size += js_trace_malloc_usable_size(ptr) - old_size;
+    }
+    return ptr;
+}
+
+static const JSMallocFunctions trace_mf = {
+    js_trace_malloc,
+    js_trace_free,
+    js_trace_realloc,
+#if defined(__APPLE__)
+    malloc_size,
+#elif defined(_WIN32)
+    (size_t (*)(const void *))_msize,
+#elif defined(EMSCRIPTEN)
+    NULL,
+#elif defined(__linux__)
+    (size_t (*)(const void *))malloc_usable_size,
+#else
+    /* change this to `NULL,` if compilation fails */
+    malloc_usable_size,
+#endif
+};
+
+#ifdef CONFIG_BIGNUM
+#define PROG_NAME "qjsbn"
+#else
+#define PROG_NAME "qjs"
+#endif
+
+void help(void)
+{
+    printf("QuickJS version " CONFIG_VERSION "\n"
+           "usage: " PROG_NAME " [options] [files]\n"
+           "-h  --help         list options\n"
+           "-e  --eval EXPR    evaluate EXPR\n"
+           "-i  --interactive  go to interactive mode\n"
+           "-m  --module       load as ES6 module (default if .mjs file extension)\n"
+#ifdef CONFIG_BIGNUM
+           "    --qjscalc      load the QJSCalc runtime (default if invoked as qjscalc)\n"
+#endif
+           "-T  --trace        trace memory allocation\n"
+           "-d  --dump         dump the memory usage stats\n"
+           "-q  --quit         just instantiate the interpreter and quit\n");
+    exit(1);
+}
+
+int main(int argc, char **argv)
+{
+    JSRuntime *rt;
+    JSContext *ctx;
+    struct trace_malloc_data trace_data = { NULL };
+    int optind;
+    char *expr = NULL;
+    int interactive = 0;
+    int dump_memory = 0;
+    int trace_memory = 0;
+    int empty_run = 0;
+    int module = 0;
+    int load_std = 1;
+#ifdef CONFIG_BIGNUM
+    int load_jscalc;
+#endif
+
+#ifdef CONFIG_BIGNUM
+    /* load jscalc runtime if invoked as 'qjscalc' */
+    {
+        const char *p, *exename;
+        exename = argv[0];
+        p = strrchr(exename, '/');
+        if (p)
+            exename = p + 1;
+        load_jscalc = !strcmp(exename, "qjscalc");
+    }
+#endif
+    
+    /* cannot use getopt because we want to pass the command line to
+       the script */
+    optind = 1;
+    while (optind < argc && *argv[optind] == '-') {
+        char *arg = argv[optind] + 1;
+        const char *longopt = "";
+        /* a single - is not an option, it also stops argument scanning */
+        if (!*arg)
+            break;
+        optind++;
+        if (*arg == '-') {
+            longopt = arg + 1;
+            arg += strlen(arg);
+            /* -- stops argument scanning */
+            if (!*longopt)
+                break;
+        }
+        for (; *arg || *longopt; longopt = "") {
+            char opt = *arg;
+            if (opt)
+                arg++;
+            if (opt == 'h' || opt == '?' || !strcmp(longopt, "help")) {
+                help();
+                continue;
+            }
+            if (opt == 'e' || !strcmp(longopt, "eval")) {
+                if (*arg) {
+                    expr = arg;
+                    break;
+                }
+                if (optind < argc) {
+                    expr = argv[optind++];
+                    break;
+                }
+                fprintf(stderr, "qjs: missing expression for -e\n");
+                exit(2);
+            }
+            if (opt == 'i' || !strcmp(longopt, "interactive")) {
+                interactive++;
+                continue;
+            }
+            if (opt == 'm' || !strcmp(longopt, "module")) {
+                module = 1;
+                continue;
+            }
+            if (opt == 'd' || !strcmp(longopt, "dump")) {
+                dump_memory++;
+                continue;
+            }
+            if (opt == 'T' || !strcmp(longopt, "trace")) {
+                trace_memory++;
+                continue;
+            }
+            if (!strcmp(longopt, "nostd")) {
+                load_std = 0;
+                continue;
+            }
+#ifdef CONFIG_BIGNUM
+            if (!strcmp(longopt, "qjscalc")) {
+                load_jscalc = 1;
+                continue;
+            }
+#endif
+            if (opt == 'q' || !strcmp(longopt, "quit")) {
+                empty_run++;
+                continue;
+            }
+            if (opt) {
+                fprintf(stderr, "qjs: unknown option '-%c'\n", opt);
+            } else {
+                fprintf(stderr, "qjs: unknown option '--%s'\n", longopt);
+            }
+            help();
+        }
+    }
+
+    if (trace_memory) {
+        js_trace_malloc_init(&trace_data);
+        rt = JS_NewRuntime2(&trace_mf, &trace_data);
+    } else {
+        rt = JS_NewRuntime();
+    }
+    if (!rt) {
+        fprintf(stderr, "qjs: cannot allocate JS runtime\n");
+        exit(2);
+    }
+    ctx = JS_NewContext(rt);
+    if (!ctx) {
+        fprintf(stderr, "qjs: cannot allocate JS context\n");
+        exit(2);
+    }
+
+    /* loader for ES6 modules */
+    JS_SetModuleLoaderFunc(rt, NULL, js_module_loader, NULL);
+                           
+    if (!empty_run) {
+#ifdef CONFIG_BIGNUM
+        if (load_jscalc) {
+            js_std_eval_binary(ctx, qjscalc, qjscalc_size, 0);
+        }
+#endif
+        js_std_add_helpers(ctx, argc - optind, argv + optind);
+
+        /* system modules */
+        js_init_module_std(ctx, "std");
+        js_init_module_os(ctx, "os");
+
+        /* make 'std' and 'os' visible to non module code */
+        if (load_std) {
+            const char *str = "import * as std from 'std';\n"
+                "import * as os from 'os';\n"
+                "std.global.std = std;\n"
+                "std.global.os = os;\n";
+            eval_buf(ctx, str, strlen(str), "<input>", JS_EVAL_TYPE_MODULE);
+        }
+
+        if (expr) {
+            if (eval_buf(ctx, expr, strlen(expr), "<cmdline>", 0))
+                goto fail;
+        } else
+        if (optind >= argc) {
+            /* interactive mode */
+            interactive = 1;
+        } else {
+            int eval_flags;
+            const char *filename;
+            filename = argv[optind];
+
+            if (module || has_suffix(filename, ".mjs"))
+                eval_flags = JS_EVAL_TYPE_MODULE;
+            else
+                eval_flags = JS_EVAL_TYPE_GLOBAL;
+            eval_flags |= JS_EVAL_FLAG_SHEBANG;
+            if (eval_file(ctx, filename, eval_flags))
+                goto fail;
+        }
+        if (interactive) {
+            js_std_eval_binary(ctx, repl, repl_size, 0);
+        }
+        js_std_loop(ctx);
+    }
+    
+    if (dump_memory) {
+        JSMemoryUsage stats;
+        JS_ComputeMemoryUsage(rt, &stats);
+        JS_DumpMemoryUsage(stdout, &stats, rt);
+    }
+    js_std_free_handlers(rt);
+    JS_FreeContext(ctx);
+    JS_FreeRuntime(rt);
+
+    if (empty_run && dump_memory) {
+        clock_t t[5];
+        double best[5];
+        int i, j;
+        for (i = 0; i < 100; i++) {
+            t[0] = clock();
+            rt = JS_NewRuntime();
+            t[1] = clock();
+            ctx = JS_NewContext(rt);
+            t[2] = clock();
+            JS_FreeContext(ctx);
+            t[3] = clock();
+            JS_FreeRuntime(rt);
+            t[4] = clock();
+            for (j = 4; j > 0; j--) {
+                double ms = 1000.0 * (t[j] - t[j - 1]) / CLOCKS_PER_SEC;
+                if (i == 0 || best[j] > ms)
+                    best[j] = ms;
+            }
+        }
+        printf("\nInstantiation times (ms): %.3f = %.3f+%.3f+%.3f+%.3f\n",
+               best[1] + best[2] + best[3] + best[4],
+               best[1], best[2], best[3], best[4]);
+    }
+    return 0;
+ fail:
+    js_std_free_handlers(rt);
+    JS_FreeContext(ctx);
+    JS_FreeRuntime(rt);
+    return 1;
+}
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjsc.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjsc.c
new file mode 100755
index 00000000..9e6c7524
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjsc.c
@@ -0,0 +1,636 @@
+/*
+ * QuickJS command line compiler
+ * 
+ * Copyright (c) 2018-2019 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include <stdlib.h>
+#include <stdio.h>
+#include <stdarg.h>
+#include <inttypes.h>
+#include <string.h>
+#include <assert.h>
+#include <unistd.h>
+#include <errno.h>
+#if !defined(_WIN32)
+#include <sys/wait.h>
+#endif
+
+#include "cutils.h"
+#include "quickjs-libc.h"
+
+typedef struct {
+    char *name;
+    char *short_name;
+    int flags;
+} namelist_entry_t;
+
+typedef struct namelist_t {
+    namelist_entry_t *array;
+    int count;
+    int size;
+} namelist_t;
+
+typedef struct {
+    const char *option_name;
+    const char *init_name;
+} FeatureEntry;
+
+#define FE_ALL (-1)
+
+static namelist_t cname_list;
+static namelist_t cmodule_list;
+static namelist_t init_module_list;
+static uint64_t feature_bitmap;
+static FILE *outfile;
+static BOOL byte_swap;
+
+static const FeatureEntry feature_list[] = {
+    { "eval", "Eval" },
+    { "string-normalize", "StringNormalize" },
+    { "regexp", "RegExp" },
+    { "json", "JSON" },
+    { "proxy", "Proxy" },
+    { "map", "MapSet" },
+    { "typedarray", "TypedArrays" },
+    { "promise", "Promise" },
+};
+
+void namelist_add(namelist_t *lp, const char *name, const char *short_name,
+                  int flags)
+{
+    namelist_entry_t *e;
+    if (lp->count == lp->size) {
+        size_t newsize = lp->size + (lp->size >> 1) + 4;
+        namelist_entry_t *a =
+            realloc(lp->array, sizeof(lp->array[0]) * newsize);
+        /* XXX: check for realloc failure */
+        lp->array = a;
+        lp->size = newsize;
+    }
+    e =  &lp->array[lp->count++];
+    e->name = strdup(name);
+    if (short_name)
+        e->short_name = strdup(short_name);
+    else
+        e->short_name = NULL;
+    e->flags = flags;
+}
+
+void namelist_free(namelist_t *lp)
+{
+    while (lp->count > 0) {
+        namelist_entry_t *e = &lp->array[--lp->count];
+        free(e->name);
+        free(e->short_name);
+    }
+    free(lp->array);
+    lp->array = NULL;
+    lp->size = 0;
+}
+
+namelist_entry_t *namelist_find(namelist_t *lp, const char *name)
+{
+    int i;
+    for(i = 0; i < lp->count; i++) {
+        namelist_entry_t *e = &lp->array[i];
+        if (!strcmp(e->name, name))
+            return e;
+    }
+    return NULL;
+}
+
+
+static void get_c_name(char *buf, int buf_size, const char *file)
+{
+    const char *p, *r;
+    size_t len;
+    
+    p = strrchr(file, '/');
+    if (!p)
+        p = file;
+    else
+        p++;
+    r = strrchr(p, '.');
+    if (!r)
+        r =  p + strlen(p);
+    len = r - p;
+    if (len > buf_size - 1)
+        len = buf_size - 1;
+    memcpy(buf, p, len);
+    buf[len] = '\0';
+}
+
+static void dump_hex(FILE *f, const uint8_t *buf, size_t len)
+{
+    size_t i, col;
+    col = 0;
+    for(i = 0; i < len; i++) {
+        fprintf(f, " 0x%02x,", buf[i]);
+        if (++col == 8) {
+            fprintf(f, "\n");
+            col = 0;
+        }
+    }
+    if (col != 0)
+        fprintf(f, "\n");
+}
+
+static void output_object_code(JSContext *ctx,
+                               FILE *fo, JSValueConst obj, const char *c_name,
+                               BOOL load_only)
+{
+    uint8_t *out_buf;
+    size_t out_buf_len;
+    int flags;
+    flags = JS_WRITE_OBJ_BYTECODE;
+    if (byte_swap)
+        flags |= JS_WRITE_OBJ_BSWAP;
+    out_buf = JS_WriteObject(ctx, &out_buf_len, obj, flags);
+    if (!out_buf) {
+        js_std_dump_error(ctx);
+        exit(1);
+    }
+
+    namelist_add(&cname_list, c_name, NULL, load_only);
+    
+    fprintf(fo, "const uint32_t %s_size = %u;\n\n", 
+            c_name, (unsigned int)out_buf_len);
+    fprintf(fo, "const uint8_t %s[%u] = {\n",
+            c_name, (unsigned int)out_buf_len);
+    dump_hex(fo, out_buf, out_buf_len);
+    fprintf(fo, "};\n\n");
+
+    js_free(ctx, out_buf);
+}
+
+static int js_module_dummy_init(JSContext *ctx, JSModuleDef *m)
+{
+    /* should never be called when compiling JS code */
+    abort();
+}
+
+JSModuleDef *jsc_module_loader(JSContext *ctx,
+                              const char *module_name, void *opaque)
+{
+    JSModuleDef *m;
+    namelist_entry_t *e;
+
+    /* check if it is a declared C or system module */
+    e = namelist_find(&cmodule_list, module_name);
+    if (e) {
+        /* add in the static init module list */
+        namelist_add(&init_module_list, e->name, e->short_name, 0);
+        /* create a dummy module */
+        m = JS_NewCModule(ctx, module_name, js_module_dummy_init);
+    } else if (has_suffix(module_name, ".so")) {
+        fprintf(stderr, "Warning: binary module '%s' is not compiled\n", module_name);
+        /* create a dummy module */
+        m = JS_NewCModule(ctx, module_name, js_module_dummy_init);
+    } else {
+        size_t buf_len;
+        uint8_t *buf;
+        JSValue func_val;
+        char cname[1024];
+        
+        buf = js_load_file(ctx, &buf_len, module_name);
+        if (!buf) {
+            JS_ThrowReferenceError(ctx, "could not load module filename '%s'",
+                                   module_name);
+            return NULL;
+        }
+        
+        /* compile the module */
+        func_val = JS_Eval(ctx, (char *)buf, buf_len, module_name,
+                           JS_EVAL_TYPE_MODULE | JS_EVAL_FLAG_COMPILE_ONLY);
+        js_free(ctx, buf);
+        if (JS_IsException(func_val))
+            return NULL;
+        get_c_name(cname, sizeof(cname), module_name);
+        output_object_code(ctx, outfile, func_val, cname, TRUE);
+        
+        /* the module is already referenced, so we must free it */
+        m = JS_VALUE_GET_PTR(func_val);
+        JS_FreeValue(ctx, func_val);
+    }
+    return m;
+}
+
+static void compile_file(JSContext *ctx, FILE *fo,
+                         const char *filename,
+                         const char *c_name1,
+                         BOOL is_module)
+{
+    uint8_t *buf;
+    char c_name[1024];
+    int eval_flags;
+    JSValue obj;
+    size_t buf_len;
+    
+    buf = js_load_file(ctx, &buf_len, filename);
+    if (!buf) {
+        fprintf(stderr, "Could not load '%s'\n", filename);
+        exit(1);
+    }
+    eval_flags = JS_EVAL_FLAG_SHEBANG | JS_EVAL_FLAG_COMPILE_ONLY;
+    if (is_module)
+        eval_flags |= JS_EVAL_TYPE_MODULE;
+    else
+        eval_flags |= JS_EVAL_TYPE_GLOBAL;
+    obj = JS_Eval(ctx, (char *)buf, buf_len, filename, eval_flags);
+    if (JS_IsException(obj)) {
+        js_std_dump_error(ctx);
+        exit(1);
+    }
+    js_free(ctx, buf);
+    if (c_name1) {
+        pstrcpy(c_name, sizeof(c_name), c_name1);
+    } else {
+        get_c_name(c_name, sizeof(c_name), filename);
+    }
+    output_object_code(ctx, fo, obj, c_name, FALSE);
+    JS_FreeValue(ctx, obj);
+}
+
+static const char main_c_template1[] =
+    "int main(int argc, char **argv)\n"
+    "{\n"
+    "  JSRuntime *rt;\n"
+    "  JSContext *ctx;\n"
+    "  rt = JS_NewRuntime();\n"
+    ;
+
+static const char main_c_template2[] =
+    "  js_std_loop(ctx);\n"
+    "  JS_FreeContext(ctx);\n"
+    "  JS_FreeRuntime(rt);\n"
+    "  return 0;\n"
+    "}\n";
+
+#ifdef CONFIG_BIGNUM
+#define PROG_NAME "qjscbn"
+#else
+#define PROG_NAME "qjsc"
+#endif
+
+void help(void)
+{
+    printf("QuickJS Compiler version " CONFIG_VERSION "\n"
+           "usage: " PROG_NAME " [options] [files]\n"
+           "\n"
+           "options are:\n"
+           "-c          only output bytecode in a C file\n"
+           "-e          output main() and bytecode in a C file (default = executable output)\n"
+           "-o output   set the output filename\n"
+           "-N cname    set the C name of the generated data\n"
+           "-m          compile as Javascript module\n"
+           "-M module_name[,cname] add initialization code for an external C module\n"
+           "-x          byte swapped output\n"
+           );
+#ifdef CONFIG_LTO
+    {
+        int i;
+        printf("-flto       use link time optimization\n");
+        printf("-fno-[");
+        for(i = 0; i < countof(feature_list); i++) {
+            if (i != 0)
+                printf("|");
+            printf("%s", feature_list[i].option_name);
+        }
+        printf("]\n"
+               "            disable selected language features (smaller code size)\n");
+    }
+#endif
+    exit(1);
+}
+
+#if defined(CONFIG_CC) && !defined(_WIN32)
+
+int exec_cmd(char **argv)
+{
+    int pid, status, ret;
+
+    pid = fork();
+    if (pid == 0) {
+        execvp(argv[0], argv);
+        exit(1);
+    } 
+
+    for(;;) {
+        ret = waitpid(pid, &status, 0);
+        if (ret == pid && WIFEXITED(status))
+            break;
+    }
+    return WEXITSTATUS(status);
+}
+
+static int output_executable(const char *out_filename, const char *cfilename,
+                             BOOL use_lto, BOOL verbose, const char *exename)
+{
+    const char *argv[64];
+    const char **arg, *bn_suffix, *lto_suffix;
+    char libjsname[1024];
+    char exe_dir[1024], inc_dir[1024], lib_dir[1024], buf[1024], *p;
+    int ret;
+    
+    /* get the directory of the executable */
+    pstrcpy(exe_dir, sizeof(exe_dir), exename);
+    p = strrchr(exe_dir, '/');
+    if (p) {
+        *p = '\0';
+    } else {
+        pstrcpy(exe_dir, sizeof(exe_dir), ".");
+    }
+
+    /* if 'quickjs.h' is present at the same path as the executable, we
+       use it as include and lib directory */
+    snprintf(buf, sizeof(buf), "%s/quickjs.h", exe_dir);
+    if (access(buf, R_OK) == 0) {
+        pstrcpy(inc_dir, sizeof(inc_dir), exe_dir);
+        pstrcpy(lib_dir, sizeof(lib_dir), exe_dir);
+    } else {
+        snprintf(inc_dir, sizeof(inc_dir), "%s/include/quickjs", CONFIG_PREFIX);
+        snprintf(lib_dir, sizeof(lib_dir), "%s/lib/quickjs", CONFIG_PREFIX);
+    }
+    
+    lto_suffix = "";
+#ifdef CONFIG_BIGNUM
+    bn_suffix = ".bn";
+#else
+    bn_suffix = "";
+#endif
+    
+    arg = argv;
+    *arg++ = CONFIG_CC;
+    *arg++ = "-O2";
+#ifdef CONFIG_LTO
+    if (use_lto) {
+        *arg++ = "-flto";
+        lto_suffix = ".lto";
+    }
+#endif
+    /* XXX: use the executable path to find the includes files and
+       libraries */
+    *arg++ = "-D";
+    *arg++ = "_GNU_SOURCE";
+    *arg++ = "-I";
+    *arg++ = inc_dir;
+    *arg++ = "-o";
+    *arg++ = out_filename;
+    *arg++ = cfilename;
+    snprintf(libjsname, sizeof(libjsname), "%s/libquickjs%s%s.a",
+             lib_dir, bn_suffix, lto_suffix);
+    *arg++ = libjsname;
+    *arg++ = "-lm";
+    *arg++ = "-ldl";
+    *arg = NULL;
+    
+    if (verbose) {
+        for(arg = argv; *arg != NULL; arg++)
+            printf("%s ", *arg);
+        printf("\n");
+    }
+    
+    ret = exec_cmd((char **)argv);
+    unlink(cfilename);
+    return ret;
+}
+#else
+static int output_executable(const char *out_filename, const char *cfilename,
+                             BOOL use_lto, BOOL verbose, const char *exename)
+{
+    fprintf(stderr, "Executable output is not supported for this target\n");
+    exit(1);
+    return 0;
+}
+#endif
+
+
+typedef enum {
+    OUTPUT_C,
+    OUTPUT_C_MAIN,
+    OUTPUT_EXECUTABLE,
+} OutputTypeEnum;
+
+int main(int argc, char **argv)
+{
+    int c, i, verbose;
+    const char *out_filename, *cname;
+    char cfilename[1024];
+    FILE *fo;
+    JSRuntime *rt;
+    JSContext *ctx;
+    BOOL module, use_lto;
+    OutputTypeEnum output_type;
+    
+    out_filename = NULL;
+    output_type = OUTPUT_EXECUTABLE;
+    cname = NULL;
+    feature_bitmap = FE_ALL;
+    module = FALSE;
+    byte_swap = FALSE;
+    verbose = 0;
+    use_lto = FALSE;
+
+    /* add system modules */
+    namelist_add(&cmodule_list, "std", "std", 0);
+    namelist_add(&cmodule_list, "os", "os", 0);
+
+    for(;;) {
+        c = getopt(argc, argv, "ho:cN:f:mxevM:");
+        if (c == -1)
+            break;
+        switch(c) {
+        case 'h':
+            help();
+        case 'o':
+            out_filename = optarg;
+            break;
+        case 'c':
+            output_type = OUTPUT_C;
+            break;
+        case 'e':
+            output_type = OUTPUT_C_MAIN;
+            break;
+        case 'N':
+            cname = optarg;
+            break;
+        case 'f':
+            {
+                const char *p;
+                p = optarg;
+                if (!strcmp(optarg, "lto")) {
+                    use_lto = TRUE;
+                } else if (strstart(p, "no-", &p)) {
+                    use_lto = TRUE;
+                    for(i = 0; i < countof(feature_list); i++) {
+                        if (!strcmp(p, feature_list[i].option_name)) {
+                            feature_bitmap &= ~((uint64_t)1 << i);
+                            break;
+                        }
+                    }
+                    if (i == countof(feature_list))
+                        goto bad_feature;
+                } else {
+                bad_feature:
+                    fprintf(stderr, "unsupported feature: %s\n", optarg);
+                    exit(1);
+                }
+            }
+            break;
+        case 'm':
+            module = TRUE;
+            break;
+        case 'M':
+            {
+                char *p;
+                char path[1024];
+                char cname[1024];
+                pstrcpy(path, sizeof(path), optarg);
+                p = strchr(path, ',');
+                if (p) {
+                    *p = '\0';
+                    pstrcpy(cname, sizeof(cname), p + 1);
+                } else {
+                    get_c_name(cname, sizeof(cname), path);
+                }
+                namelist_add(&cmodule_list, path, cname, 0);
+            }
+            break;
+        case 'x':
+            byte_swap = TRUE;
+            break;
+        case 'v':
+            verbose++;
+            break;
+        default:
+            break;
+        }
+    }
+
+    if (optind >= argc)
+        help();
+
+    if (!out_filename) {
+        if (output_type == OUTPUT_EXECUTABLE) {
+            out_filename = "a.out";
+        } else {
+            out_filename = "out.c";
+        }
+    }
+
+    if (output_type == OUTPUT_EXECUTABLE) {
+#if defined(_WIN32) || defined(__ANDROID__)
+        /* XXX: find a /tmp directory ? */
+        snprintf(cfilename, sizeof(cfilename), "out%d.c", getpid());
+#else
+        snprintf(cfilename, sizeof(cfilename), "/tmp/out%d.c", getpid());
+#endif
+    } else {
+        pstrcpy(cfilename, sizeof(cfilename), out_filename);
+    }
+    
+    fo = fopen(cfilename, "w");
+    if (!fo) {
+        perror(cfilename);
+        exit(1);
+    }
+    outfile = fo;
+    
+    rt = JS_NewRuntime();
+    ctx = JS_NewContextRaw(rt);
+    JS_AddIntrinsicEval(ctx);
+    JS_AddIntrinsicRegExpCompiler(ctx);
+    
+    /* loader for ES6 modules */
+    JS_SetModuleLoaderFunc(rt, NULL, jsc_module_loader, NULL);
+
+    fprintf(fo, "/* File generated automatically by the QuickJS compiler. */\n"
+            "\n"
+            );
+    
+    if (output_type != OUTPUT_C) {
+        fprintf(fo, "#include \"quickjs-libc.h\"\n"
+                "\n"
+                );
+    } else {
+        fprintf(fo, "#include <inttypes.h>\n"
+                "\n"
+                );
+    }
+
+    for(i = optind; i < argc; i++) {
+        const char *filename = argv[i];
+        BOOL module1 = module || has_suffix(filename, ".mjs");
+        compile_file(ctx, fo, filename, cname, module1);
+        cname = NULL;
+    }
+
+    if (output_type != OUTPUT_C) {
+        fputs(main_c_template1, fo);
+        fprintf(fo, "  ctx = JS_NewContextRaw(rt);\n");
+        
+        /* add the basic objects */
+        
+        fprintf(fo, "  JS_AddIntrinsicBaseObjects(ctx);\n");
+        for(i = 0; i < countof(feature_list); i++) {
+            if (feature_bitmap & ((uint64_t)1 << i)) {
+                fprintf(fo, "  JS_AddIntrinsic%s(ctx);\n",
+                        feature_list[i].init_name);
+            }
+        }
+
+        fprintf(fo, "  js_std_add_helpers(ctx, argc, argv);\n");
+
+        for(i = 0; i < init_module_list.count; i++) {
+            namelist_entry_t *e = &init_module_list.array[i];
+            /* initialize the static C modules */
+            
+            fprintf(fo,
+                    "  {\n"
+                    "    extern JSModuleDef *js_init_module_%s(JSContext *ctx, const char *name);\n"
+                    "    js_init_module_%s(ctx, \"%s\");\n"
+                    "  }\n",
+                    e->short_name, e->short_name, e->name);
+        }
+
+        for(i = 0; i < cname_list.count; i++) {
+            namelist_entry_t *e = &cname_list.array[i];
+            fprintf(fo, "  js_std_eval_binary(ctx, %s, %s_size, %s);\n",
+                    e->name, e->name,
+                    e->flags ? "JS_EVAL_BINARY_LOAD_ONLY" : "0");
+        }
+        fputs(main_c_template2, fo);
+    }
+    
+    JS_FreeContext(ctx);
+    JS_FreeRuntime(rt);
+
+    fclose(fo);
+
+    if (output_type == OUTPUT_EXECUTABLE) {
+        return output_executable(out_filename, cfilename, use_lto, verbose,
+                                 argv[0]);
+    }
+    namelist_free(&cname_list);
+    namelist_free(&cmodule_list);
+    namelist_free(&init_module_list);
+    return 0;
+}
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjscalc.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjscalc.js
new file mode 100755
index 00000000..05f33e94
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/qjscalc.js
@@ -0,0 +1,2454 @@
+/*
+ * QuickJS Javascript Calculator
+ * 
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+"use strict";
+"use math";
+
+var Integer, Float, Fraction, Complex, Mod, Polynomial, PolyMod, RationalFunction, Series, Matrix;
+
+(function(global) {
+    /* the types index are used to dispatch the operator functions */
+    var OT_INT = 0;
+    var OT_FRACTION = 10;
+    var OT_FLOAT64 = 19;
+    var OT_FLOAT = 20;
+    var OT_COMPLEX = 30;
+    var OT_MOD = 40;
+    var OT_POLY = 50;
+    var OT_POLYMOD = 55;
+    var OT_RFUNC = 60;
+    var OT_SERIES = 70;
+    var OT_ARRAY = 80;
+
+    global.Integer = global.BigInt;
+    global.algebraicMode = true;
+    
+    /* add non enumerable properties */
+    function add_props(obj, props) {
+        var i, val, prop, tab, desc, prop1;
+        tab = Reflect.ownKeys(props);
+        for(i = 0; i < tab.length; i++) {
+            prop = tab[i];
+            desc = Object.getOwnPropertyDescriptor(props, prop);
+            desc.enumerable = false;
+            if ("value" in desc) {
+                if (typeof desc.value !== "function") {
+                    desc.writable = false;
+                    desc.configurable = false;
+                }
+            } else {
+                /* getter/setter */
+                desc.configurable = false;
+            }
+            Object.defineProperty(obj, prop, desc);
+            if (obj !== Integer) {
+                /* by default also add the non math operators */
+                switch(prop) {
+                case Symbol.operatorMathDiv:
+                    prop1 = Symbol.operatorDiv;
+                    break;
+                case Symbol.operatorMathMod:
+                    prop1 = Symbol.operatorMod;
+                    break;
+                case Symbol.operatorMathPow:
+                    prop1 = Symbol.operatorPow;
+                    break;
+                default:
+                    prop1 = null;
+                    break;
+                }
+                if (prop1)
+                    Object.defineProperty(obj, prop1, desc);
+            }
+        }
+    }
+    
+    /* Integer */
+
+    function generic_pow(a, b) {
+        var r, is_neg, i;
+        if (!Integer.isInteger(b)) {
+            return exp(log(a) * b);
+        }
+        if (Array.isArray(a) && !(a instanceof Polynomial ||
+                                  a instanceof Series)) {
+            r = idn(Matrix.check_square(a));
+        } else {
+            r = 1;
+        }
+        if (b == 0)
+            return r;
+        is_neg = false;
+        if (b < 0) {
+            is_neg = true;
+            b = -b;
+        }
+        r = a;
+        for(i = Integer.floorLog2(b) - 1; i >= 0; i--) {
+            r *= r;
+            if ((b >> i) & 1)
+                r *= a;
+        }
+        if (is_neg) {
+            if (typeof r.inverse != "function")
+                throw "negative powers are not supported for this type";
+            r = r.inverse();
+        }
+        return r;
+    }
+    
+    var small_primes = [ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499 ];
+
+    function miller_rabin_test(n, t) {
+        var d, r, s, i, j, a;
+        d = n - 1;
+        s = 0;
+        while (d & 1) {
+            d >>= 1;
+            s++;
+        }
+        t = Math.min(t, small_primes.length);
+        loop: for(j = 0; j < t; j++) {
+            a = small_primes[j];
+            r = Integer.pmod(a, d, n);
+            if (r == 1 || r == (n - 1))
+                continue;
+            for(i = 1; i < s; i++) {
+                r = (r * r) % n;
+                if (r == 1)
+                    return false;
+                if (r == (n - 1))
+                    continue loop;
+            }
+            return false; /* n is composite */
+        }
+        return true; /* n is probably prime with probability (1-0.5^t) */
+    }
+
+    function fact_rec(a, b) {  /* assumes a <= b */
+        var i, r;
+        if ((b - a) <= 5) {
+            r = a;
+            for(i = a + 1; i <= b; i++)
+                r *= i;
+            return r;
+        } else {
+            /* to avoid a quadratic running time it is better to
+               multiply numbers of similar size */
+            i = (a + b) >> 1;
+            return fact_rec(a, i) * fact_rec(i + 1, b);
+        }
+    }
+    
+    add_props(Integer, {
+        isInteger(a) {
+            return typeof a === "bigint";
+        },
+        [Symbol.operatorOrder]: OT_INT,
+        [Symbol.operatorMathDiv](a, b) {
+            if (algebraicMode) {
+                return Fraction.toFraction(a, b);
+            } else {
+                return Float(a) / Float(b);
+            }
+        },
+        [Symbol.operatorMathPow](a, b) {
+            if (algebraicMode) {
+                return generic_pow(a, b);
+            } else {
+                return Float(a) ** Float(b);
+            }
+        },
+        gcd(a, b) {
+            var r;
+            while (b != 0) {
+                r = a % b;
+                a = b;
+                b = r;
+            }
+            return a;
+        },
+        fact(n) {
+            return n <= 0 ? 1 : fact_rec(1, n);
+        },
+        /* binomial coefficient */
+        comb(n, k) {
+            if (k < 0 || k > n)
+                return 0;
+            if (k > n - k)
+                k = n - k;
+            if (k == 0)
+                return 1;
+            return Integer.tdiv(fact_rec(n - k + 1, n), fact_rec(1, k));
+        },
+        /* inverse of x modulo y */
+        invmod(x, y) {
+            var q, u, v, a, c, t;
+            u = x;
+            v = y;
+            c = 1;
+            a = 0;
+            while (u != 0) {
+                t = Integer.fdivrem(v, u);
+                q = t[0];
+                v = u;
+                u = t[1];
+                t = c;
+                c = a - q * c;
+                a = t;
+            }
+            /* v = gcd(x, y) */
+            if (v != 1)
+                throw RangeError("not invertible");
+            return a % y;
+        },
+        /* return a ^ b modulo m */
+        pmod(a, b, m) {
+            var r;
+            if (b == 0)
+                return 1;
+            if (b < 0) {
+                a = Integer.invmod(a, m);
+                b = -b;
+            }
+            r = 1;
+            for(;;) {
+                if (b & 1) {
+                    r = (r * a) % m;
+                }
+                b >>= 1;
+                if (b == 0)
+                    break;
+                a = (a * a) % m;
+            }
+            return r;
+        },
+
+        /* return true if n is prime (or probably prime with
+           probability 1-0.5^t) */
+        isPrime(n, t) {
+            var i, d, n1;
+            if (!Integer.isInteger(n))
+                throw TypeError("invalid type");
+            if (n <= 1)
+                return false;
+            n1 = small_primes.length;
+            /* XXX: need Integer.sqrt() */
+            for(i = 0; i < n1; i++) {
+                d = small_primes[i];
+                if (d == n)
+                    return true;
+                if (d > n)
+                    return false;
+                if ((n % d) == 0)
+                    return false;
+            }
+            if (n < d * d)
+                return true;
+            if (typeof t == "undefined")
+                t = 64;
+            return miller_rabin_test(n, t);
+        },
+        nextPrime(n) {
+            if (!Integer.isInteger(n))
+                throw TypeError("invalid type");
+            if (n < 1)
+                n = 1;
+            for(;;) {
+                n++;
+                if (Integer.isPrime(n))
+                    return n;
+            }
+        },
+        factor(n) {
+            var r, d;
+            if (!Integer.isInteger(n))
+                throw TypeError("invalid type");
+            r = [];
+            if (abs(n) <= 1) {
+                r.push(n);
+                return r;
+            }
+            if (n < 0) {
+                r.push(-1);
+                n = -n;
+            }
+            
+            while ((n % 2) == 0) {
+                n >>= 1;
+                r.push(2);
+            }
+
+            d = 3;
+            while (n != 1) {
+                if (Integer.isPrime(n)) {
+                    r.push(n);
+                    break;
+                }
+                /* we are sure there is at least one divisor, so one test */
+                for(;;) {
+                    if ((n % d) == 0)
+                        break;
+                    d += 2;
+                }
+                for(;;) {
+                    r.push(d);
+                    n = Integer.tdiv(n, d);
+                    if ((n % d) != 0)
+                        break;
+                }
+            }
+            return r;
+        },
+    });
+
+    add_props(Integer.prototype, {
+        inverse() {
+            return 1 / this;
+        },
+        norm2() {
+            return this * this;
+        },
+        abs() {
+            return Math.abs(this);
+        },
+        conj() {
+            return this;
+        },
+        arg() {
+            if (this >= 0)
+                return 0;
+            else
+                return Float.PI;
+        },
+        exp() {
+            if (this == 0)
+                return 1;
+            else
+                return Float.exp(this);
+        },
+        log() {
+            if (this == 1)
+                return 0;
+            else
+                return Float(this).log();
+        },
+    });
+
+    /* Fraction */
+
+    Fraction = function Fraction(a, b)
+    {
+        var d, r, obj;
+
+        if (new.target)
+            throw TypeError("not a constructor");
+        if (a instanceof Fraction)
+            return a;
+        if (!Integer.isInteger(a))
+            throw TypeError("integer expected");
+        if (typeof b === "undefined") {
+            b = 1;
+        } else {
+            if (!Integer.isInteger(b))
+                throw TypeError("integer expected");
+            if (b == 0)
+                throw RangeError("division by zero");
+            d = Integer.gcd(a, b);
+            if (d != 1) {
+                a = Integer.tdiv(a, d);
+                b = Integer.tdiv(b, d);
+            }
+            
+            /* the fractions are normalized with den > 0 */
+            if (b < 0) {
+                a = -a;
+                b = -b;
+            }
+        }
+        obj = Object.create(Fraction.prototype);
+        obj.num = a;
+        obj.den = b;
+        return obj;
+    }
+
+    add_props(Fraction, {
+        [Symbol.operatorOrder]: OT_FRACTION,
+        /* (internal use) simplify 'a' to an integer when possible */
+        toFraction(a, b) {
+            var r = Fraction(a, b);
+            if (algebraicMode && r.den == 1)
+                return r.num;
+            else
+                return r;
+        },
+
+        [Symbol.operatorAdd](a, b) {
+            a = Fraction(a);
+            b = Fraction(b);
+            return Fraction.toFraction(a.num * b.den + a.den * b.num, a.den * b.den);
+        },
+        [Symbol.operatorSub](a, b) {
+            a = Fraction(a);
+            b = Fraction(b);
+            return Fraction.toFraction(a.num * b.den - a.den * b.num, a.den * b.den);
+        },
+        [Symbol.operatorMul](a, b) {
+            a = Fraction(a);
+            b = Fraction(b);
+            return Fraction.toFraction(a.num * b.num, a.den * b.den);
+        },
+        [Symbol.operatorMathDiv](a, b) {
+            a = Fraction(a);
+            b = Fraction(b);
+            return Fraction.toFraction(a.num * b.den, a.den * b.num);
+        },
+        [Symbol.operatorMathMod](a, b) {
+            var a1 = Fraction(a);
+            var b1 = Fraction(b);
+            return a - Integer.ediv(a1.num * b1.den, a1.den * b1.num) * b;
+        },
+        [Symbol.operatorMathPow]: generic_pow,
+        [Symbol.operatorCmpEQ](a, b) {
+            a = Fraction(a);
+            b = Fraction(b);
+            /* we assume the fractions are normalized */
+            return (a.num == b.num && a.den == b.den);
+        },
+        [Symbol.operatorCmpLT](a, b) {
+            a = Fraction(a);
+            b = Fraction(b);
+            return (a.num * b.den < b.num * a.den);
+        },
+        [Symbol.operatorCmpLE](a, b) {
+            a = Fraction(a);
+            b = Fraction(b);
+            return (a.num * b.den <= b.num * a.den);
+        },
+    });
+
+    add_props(Fraction.prototype, {
+        [Symbol.toPrimitive](hint) {
+            if (hint === "integer") {
+                return Integer.tdiv(this.num, this.den);
+            } else if (hint === "string") {
+                return this.toString();
+            } else {
+                return Float(this.num) / this.den;
+            }
+        },
+        [Symbol.operatorPlus]() {
+            return this;
+        },
+        [Symbol.operatorNeg]() {
+            return Fraction(-this.num, this.den);
+        },
+        inverse() {
+            return Fraction(this.den, this.num);
+        },
+        toString() {
+            return this.num + "/" + this.den;
+        },
+        norm2() {
+            return this * this;
+        },
+        abs() {
+            if (this.num < 0)
+                return this[Symbol.operatorNeg]();
+            else
+                return this;
+        },
+        conj() {
+            return this;
+        },
+        arg() {
+            if (this.num >= 0)
+                return 0;
+            else
+                return Float.PI;
+        },
+        exp() {
+            return Float.exp(Float(this));
+        },
+        log() {
+            return Float(this).log();
+        },
+    });
+
+    /* Number (Float64) */
+
+    add_props(Number, {
+        [Symbol.operatorOrder]: OT_FLOAT64,
+        /* operators are needed for fractions */
+        [Symbol.operatorAdd](a, b) {
+            return Number(a) + Number(b);
+        },
+        [Symbol.operatorSub](a, b) {
+            return Number(a) - Number(b);
+        },
+        [Symbol.operatorMul](a, b) {
+            return Number(a) * Number(b);
+        },
+        [Symbol.operatorMathDiv](a, b) {
+            return Number(a) / Number(b);
+        },
+        [Symbol.operatorMathPow](a, b) {
+            return Number(a) ** Number(b);
+        },
+    });
+              
+    add_props(Number.prototype, {
+        inverse() {
+            return 1.0 / this;
+        },
+        norm2() {
+            return this * this;
+        },
+        abs() {
+            return Math.abs(this);
+        },
+        conj() {
+            return this;
+        },
+        arg() {
+            if (this >= 0)
+                return 0;
+            else
+                return Float.PI;
+        },
+        exp() {
+            return Float.exp(this);
+        },
+        log() {
+            if (this < 0) {
+                return Complex(this).log();
+            } else {
+                return Float.log(this);
+            }
+        },
+    });
+    
+    /* Float */
+
+    global.Float = global.BigFloat;
+
+    var const_tab = [];
+    
+    /* we cache the constants for small precisions */
+    function get_const(n) {
+        var t, c, p;
+        t = const_tab[n];
+        p = BigFloatEnv.prec;
+        if (t && t.prec == p) {
+            return t.val;
+        } else {
+            switch(n) {
+            case 0: c = Float.exp(1); break;
+            case 1: c = Float.log(10); break;
+//            case 2: c = Float.log(2); break;
+            case 3: c = 1/Float.log(2); break;
+            case 4: c = 1/Float.log(10); break;
+//            case 5: c = Float.atan(1) * 4; break;
+            case 6: c = Float.sqrt(0.5); break;
+            case 7: c = Float.sqrt(2); break;
+            }
+            if (p <= 1024) {
+                const_tab[n] = { prec: p, val: c };
+            }
+            return c;
+        }
+    }
+    
+    add_props(Float, {
+        isFloat(a) {
+            return typeof a === "number" || typeof a === "bigfloat";
+        },
+        bestappr(u, b) {
+            var num1, num0, den1, den0, u, num, den, n;
+
+            if (typeof b === "undefined")
+                throw TypeError("second argument expected");
+            num1 = 1;
+            num0 = 0;
+            den1 = 0;
+            den0 = 1;
+            for(;;) {
+                n = Integer(Float.floor(u));
+                num = n * num1 + num0;
+                den = n * den1 + den0;
+                if (den > b)
+                    break;
+                u = 1.0 / (u - n);
+                num0 = num1;
+                num1 = num;
+                den0 = den1;
+                den1 = den;
+            }
+            return Fraction(num1, den1);
+        },
+        /* similar constants as Math.x */
+        get E() { return get_const(0); },
+        get LN10() { return get_const(1); },
+//        get LN2() { return get_const(2); },
+        get LOG2E() { return get_const(3); },
+        get LOG10E() { return get_const(4); },
+//        get PI() { return get_const(5); },
+        get SQRT1_2() { return get_const(6); },
+        get SQRT2() { return get_const(7); },
+    });
+
+    add_props(Float, {
+        [Symbol.operatorOrder]: OT_FLOAT,
+        /* operators are needed for fractions */
+        [Symbol.operatorAdd](a, b) {
+            return Float(a) + Float(b);
+        },
+        [Symbol.operatorSub](a, b) {
+            return Float(a) - Float(b);
+        },
+        [Symbol.operatorMul](a, b) {
+            return Float(a) * Float(b);
+        },
+        [Symbol.operatorMathDiv](a, b) {
+            return Float(a) / Float(b);
+        },
+        [Symbol.operatorMathPow](a, b) {
+            return Float(a) ** Float(b);
+        },
+    });
+              
+    add_props(Float.prototype, {
+        inverse() {
+            return 1.0 / this;
+        },
+        norm2() {
+            return this * this;
+        },
+        abs() {
+            return Math.abs(this);
+        },
+        conj() {
+            return this;
+        },
+        arg() {
+            if (this >= 0)
+                return 0;
+            else
+                return Float.PI;
+        },
+        exp() {
+            return Float.exp(this);
+        },
+        log() {
+            if (this < 0) {
+                return Complex(this).log();
+            } else {
+                return Float.log(this);
+            }
+        },
+    });
+       
+    /* Complex */
+    
+    Complex = function Complex(re, im)
+    {
+        var obj;
+        if (new.target)
+            throw TypeError("not a constructor");
+        if (re instanceof Complex)
+            return re;
+        if (typeof im === "undefined") {
+            im = 0;
+        }
+        obj = Object.create(Complex.prototype);
+        obj.re = re;
+        obj.im = im;
+        return obj;
+    }
+
+    add_props(Complex, {
+        [Symbol.operatorOrder]: OT_COMPLEX,
+        /* simplify to real number when possible */
+        toComplex(re, im) {
+            if (algebraicMode && im == 0)
+                return re;
+            else
+                return Complex(re, im);
+        },
+        
+        [Symbol.operatorAdd](a, b) {
+            a = Complex(a);
+            b = Complex(b);
+            return Complex.toComplex(a.re + b.re, a.im + b.im);
+        },
+        [Symbol.operatorSub](a, b) {
+            a = Complex(a);
+            b = Complex(b);
+            return Complex.toComplex(a.re - b.re, a.im - b.im);
+        },
+        [Symbol.operatorMul](a, b) {
+            a = Complex(a);
+            b = Complex(b);
+            return Complex.toComplex(a.re * b.re - a.im * b.im,
+                                     a.re * b.im + a.im * b.re);
+        },
+        [Symbol.operatorMathDiv](a, b) {
+            a = Complex(a);
+            b = Complex(b);
+            return a * b.inverse();
+        },
+        [Symbol.operatorMathPow]: generic_pow,
+        [Symbol.operatorCmpEQ](a, b) {
+            a = Complex(a);
+            b = Complex(b);
+            return a.re == b.re && a.im == b.im;
+        }
+    });
+
+    add_props(Complex.prototype, {
+        [Symbol.operatorPlus]() {
+            return this;
+        },
+        [Symbol.operatorNeg]() {
+            return Complex(-this.re, -this.im);
+        },
+        inverse() {
+            var c = this.norm2();
+            return Complex(this.re / c, -this.im / c);
+        },
+        toString() {
+            var v, s = "", a = this;
+            if (a.re != 0)
+                s += a.re.toString();
+            if (a.im == 1) {
+                if (s != "")
+                    s += "+";
+                s += "I";
+            } else if (a.im == -1) {
+                s += "-I";
+            } else {
+                v = a.im.toString();
+                if (v[0] != "-" && s != "")
+                    s += "+";
+                s += v + "*I";
+            }
+            return s;
+        },
+        norm2() {
+            return this.re * this.re + this.im * this.im;
+        },
+        abs() {
+            return Float.sqrt(norm2(this));
+        },
+        conj() {
+            return Complex(this.re, -this.im);
+        },
+        arg() {
+            return Float.atan2(this.im, this.re);
+        },
+        exp() {
+            var arg = this.im, r = this.re.exp();
+            return Complex(r * cos(arg), r * sin(arg));
+        },
+        log() {
+            return Complex(abs(this).log(), atan2(this.im, this.re));
+        },
+    });
+
+    /* Mod */
+
+    Mod = function Mod(a, m) {
+        var obj, t;
+        if (new.target)
+            throw TypeError("not a constructor");
+        obj = Object.create(Mod.prototype);
+        if (Integer.isInteger(m)) {
+            if (m <= 0)
+                throw RangeError("the modulo cannot be <= 0");
+            if (Integer.isInteger(a)) {
+                a %= m;
+            } else if (a instanceof Fraction) {
+                return Mod(a.num, m) / a.den;
+            } else {
+                throw TypeError("invalid types");
+            }
+        } else {
+            throw TypeError("invalid types");
+        }
+        obj.res = a;
+        obj.mod = m;
+        return obj;
+    };
+
+    add_props(Mod.prototype, {
+        [Symbol.operatorPlus]() {
+            return this;
+        },
+        [Symbol.operatorNeg]() {
+            return Mod(-this.res, this.mod);
+        },
+        inverse() {
+            var a = this, m = a.mod;
+            if (Integer.isInteger(m)) {
+                return Mod(Integer.invmod(a.res, m), m);
+            } else {
+                throw TypeError("unsupported type");
+            }
+        },
+        toString() {
+            return "Mod(" + this.res + "," + this.mod + ")";
+        },
+    });
+
+    add_props(Mod, {
+        [Symbol.operatorOrder]: OT_MOD,
+        [Symbol.operatorAdd](a, b) {
+            if (!(a instanceof Mod)) {
+                return Mod(a + b.res, b.mod);
+            } else if (!(b instanceof Mod)) {
+                return Mod(a.res + b, a.mod);
+            } else {
+                if (a.mod != b.mod)
+                    throw TypeError("different modulo for binary operator");
+                return Mod(a.res + b.res, a.mod);
+            }
+        },
+        [Symbol.operatorSub](a, b) {
+            if (!(a instanceof Mod)) {
+                return Mod(a - b.res, b.mod);
+            } else if (!(b instanceof Mod)) {
+                return Mod(a.res - b, a.mod);
+            } else {
+                if (a.mod != b.mod)
+                    throw TypeError("different modulo for binary operator");
+                return Mod(a.res - b.res, a.mod);
+            }
+        },
+        [Symbol.operatorMul](a, b) {
+            if (!(a instanceof Mod)) {
+                return Mod(a * b.res, b.mod);
+            } else if (!(b instanceof Mod)) {
+                return Mod(a.res * b, a.mod);
+            } else {
+                if (a.mod != b.mod)
+                    throw TypeError("different modulo for binary operator");
+                return Mod(a.res * b.res, a.mod);
+            }
+        },
+        [Symbol.operatorMathDiv](a, b) {
+            if (!(b instanceof Mod))
+                b = Mod(b, a.mod);
+            return Mod[Symbol.operatorMul](a, b.inverse());
+        },
+        [Symbol.operatorMathPow]: generic_pow,
+        [Symbol.operatorCmpEQ](a, b) {
+            if (!(a instanceof Mod) ||
+                !(b instanceof Mod))
+                return false;
+            return (a.mod == b.mod && a.res == b.res);
+        }
+    });
+            
+    /* Polynomial */
+
+    Polynomial = function Polynomial(a)
+    {
+        if (new.target)
+            throw TypeError("not a constructor");
+        if (a instanceof Polynomial) {
+            return a;
+        } else if (Array.isArray(a)) {
+            if (a.length == 0)
+                a = [ 0 ];
+            Object.setPrototypeOf(a, Polynomial.prototype);
+            return a.trim();
+        } else if (a.constructor[Symbol.operatorOrder] <= OT_MOD) {
+            a = [a];
+            Object.setPrototypeOf(a, Polynomial.prototype);
+            return a;
+        } else {
+            throw TypeError("invalid type");
+        }
+    }
+
+    function number_need_paren(c)
+    {
+        return !(Integer.isInteger(c) ||
+                 Float.isFloat(c) ||
+                 c instanceof Fraction ||
+                 (c instanceof Complex && c.re == 0));
+    }
+
+    /* string for c*X^i */
+    function monomial_toString(c, i)
+    {
+        var str1;
+        if (i == 0) {
+            str1 = c.toString();
+        } else {
+            if (c == 1) {
+                str1 = "";
+            } else if (c == -1) {
+                str1 = "-";
+            } else {
+                if (number_need_paren(c)) {
+                    str1 = "(" + c + ")";
+                } else {
+                    str1 = String(c);
+                }
+                str1 += "*";
+            }
+            str1 += "X";
+            if (i != 1) {
+                str1 += "^" + i;
+            }
+        }
+        return str1;
+    }
+
+    /* find one complex root of 'p' starting from z at precision eps using
+       at most max_it iterations. Return null if could not find root. */
+    function poly_root_laguerre1(p, z, max_it)
+    {
+        var p1, p2, i, z0, z1, z2, d, t0, t1, d1, d2, e, el, zl;
+
+        d = p.deg();
+        if (d == 1) {
+            /* monomial case */
+            return -p[0] / p[1];
+        }
+        /* trivial zero */
+        if (p[0] == 0)
+            return 0.0;
+        
+        p1 = p.deriv();
+        p2 = p1.deriv();
+        el = 0.0;
+        zl = 0.0;
+        for(i = 0; i < max_it; i++) {
+            z0 = p.apply(z);
+            if (z0 == 0)
+                return z; /* simple exit case */
+
+            /* Ward stopping criteria */
+            e = abs(z - zl);
+//            print("e", i, e);
+            if (i >= 2 && e >= el) {
+                if (abs(zl) < 1e-4) {
+                    if (e < 1e-7)
+                        return zl;
+                } else {
+                    if (e < abs(zl) * 1e-3)
+                        return zl;
+                }
+            }
+            el = e;
+            zl = z;
+            
+            z1 = p1.apply(z);
+            z2 = p2.apply(z);
+            t0 = (d - 1) * z1;
+            t0 = t0 * t0;
+            t1 = d * (d - 1) * z0 * z2;
+            t0 = sqrt(t0 - t1);
+            d1 = z1 + t0;
+            d2 = z1 - t0;
+            if (norm2(d2) > norm2(d1))
+                d1 = d2;
+            if (d1 == 0) 
+                return null;
+            z = z - d * z0 / d1;
+        }
+        return null;
+    }
+
+    function poly_roots(p)
+    {
+        var d, i, roots, j, z, eps;
+        var start_points = [ 0.1, -1.4, 1.7 ];
+
+        if (!(p instanceof Polynomial))
+            throw TypeError("polynomial expected");
+        d = p.deg();
+        if (d <= 0)
+            return [];
+        eps = 2.0 ^ (-BigFloatEnv.prec);
+        roots = [];
+        for(i = 0; i < d; i++) {
+            /* XXX: should select another start point if error */
+            for(j = 0; j < 3; j++) {
+                z = poly_root_laguerre1(p, start_points[j], 100);
+                if (z !== null)
+                    break;
+            }
+            if (j == 3)
+                throw RangeError("error in root finding algorithm");
+            roots[i] = z;
+            p = Polynomial.divrem(p, X - z)[0];
+        }
+        return roots;
+    }
+
+    add_props(Polynomial.prototype, {
+        trim() {
+            var a = this, i;
+            i = a.length;
+            while (i > 1 && a[i - 1] == 0)
+                i--;
+            a.length = i;
+            return a;
+        },
+        [Symbol.operatorPlus]() {
+            return this;
+        },
+        [Symbol.operatorNeg]() {
+            var r, i, n, a;
+            a = this;
+            n = a.length;
+            r = [];
+            for(i = 0; i < n; i++)
+                r[i] = -a[i];
+            return Polynomial(r);
+        },
+        conj() {
+            var r, i, n, a;
+            a = this;
+            n = a.length;
+            r = [];
+            for(i = 0; i < n; i++)
+                r[i] = a[i].conj();
+            return Polynomial(r);
+        },
+        inverse() {
+            return RationalFunction(Polynomial([1]), this);
+        },
+        toString() {
+            var i, str, str1, c, a = this;
+            if (a.length == 1) {
+                return a[0].toString();
+            }
+            str="";
+            for(i = a.length - 1; i >= 0; i--) {
+                c = a[i];
+                if (c == 0 ||
+                    (c instanceof Mod) && c.res == 0)
+                    continue;
+                str1 = monomial_toString(c, i);
+                if (str1[0] != "-") {
+                    if (str != "")
+                        str += "+";
+                }
+                str += str1;
+            }
+            return str;
+        },
+        deg() {
+            if (this.length == 1 && this[0] == 0)
+                return -Infinity;
+            else
+                return this.length - 1;
+        },
+        apply(b) {
+            var i, n, r, a = this;
+            n = a.length - 1;
+            r = a[n];
+            while (n > 0) {
+                n--;
+                r = r * b + a[n];
+            }
+            return r;
+        },
+        deriv() {
+            var a = this, n, r, i;
+            n = a.length;
+            if (n == 1) {
+                return Polynomial(0);
+            } else {
+                r = [];
+                for(i = 1; i < n; i++) {
+                    r[i - 1] = i * a[i];
+                }
+                return Polynomial(r);
+            }
+        },
+        integ() {
+            var a = this, n, r, i;
+            n = a.length;
+            r = [0];
+            for(i = 0; i < n; i++) {
+                r[i + 1] = a[i] / (i + 1);
+            }
+            return Polynomial(r);
+        },
+        norm2() {
+            var a = this, n, r, i;
+            n = a.length;
+            r = 0;
+            for(i = 0; i < n; i++) {
+                r += a[i].norm2();
+            }
+            return r;
+        },
+    });
+
+    add_props(Polynomial, {
+        [Symbol.operatorOrder]: OT_POLY,
+        [Symbol.operatorAdd](a, b) {
+            var tmp, r, i, n1, n2;
+            a = Polynomial(a);
+            b = Polynomial(b);
+            if (a.length < b.length) {
+                tmp = a;
+                a = b;
+                b = tmp;
+            }
+            n1 = b.length;
+            n2 = a.length;
+            r = [];
+            for(i = 0; i < n1; i++)
+                r[i] = a[i] + b[i];
+            for(i = n1; i < n2; i++)
+                r[i] = a[i];
+            return Polynomial(r);
+        },
+        [Symbol.operatorSub](a, b) {
+            return Polynomial[Symbol.operatorAdd](a, -b);
+        },
+        [Symbol.operatorMul](a, b) {
+            var i, j, n1, n2, n, r;
+            a = Polynomial(a);
+            b = Polynomial(b);
+            n1 = a.length;
+            n2 = b.length;
+            n = n1 + n2 - 1;
+            r = [];
+            for(i = 0; i < n; i++)
+                r[i] = 0;
+            for(i = 0; i < n1; i++) {
+                for(j = 0; j < n2; j++) {
+                    r[i + j] += a[i] * b[j];
+                }
+            }
+            return Polynomial(r);
+        },
+        [Symbol.operatorMathDiv](a, b) {
+            if (b.constructor[Symbol.operatorOrder] <= OT_COMPLEX)
+                return a * (1 / b);
+            else
+                return RationalFunction(Polynomial(a),
+                                        Polynomial(b));
+        },
+        [Symbol.operatorMathPow]: generic_pow,
+        [Symbol.operatorMathMod](a, b) {
+            return Polynomial.divrem(a, b)[1];
+        },
+        [Symbol.operatorCmpEQ](a, b) {
+            var n, i;
+            if (!(a instanceof Polynomial) ||
+                !(b instanceof Polynomial))
+                return false;
+            n = a.length;
+            if (n != b.length)
+                return false;
+            for(i = 0; i < n; i++) {
+                if (a[i] != b[i])
+                    return false;
+            }
+            return true;
+        },
+        divrem(a, b) {
+            var n1, n2, i, j, q, r, n, c;
+            if (b.deg() < 0)
+                throw RangeError("division by zero");
+            n1 = a.length;
+            n2 = b.length;
+            if (n1 < n2)
+                return [Polynomial([0]), a];
+            r = Array.prototype.dup.call(a);
+            q = [];
+            n2--;
+            n = n1 - n2;
+            for(i = 0; i < n; i++)
+                q[i] = 0;
+            for(i = n - 1; i >= 0; i--) {
+                c = r[i + n2];
+                if (c != 0) {
+                    c = c / b[n2];
+                    r[i + n2] = 0;
+                    for(j = 0; j < n2; j++) {
+                        r[i + j] -= b[j] * c;
+                    }
+                    q[i] = c;
+                }
+            }
+            return [Polynomial(q), Polynomial(r)];
+        },
+        gcd(a, b) {
+            var t;
+            while (b.deg() >= 0) {
+                t = Polynomial.divrem(a, b);
+                a = b;
+                b = t[1];
+            }
+            /* convert to monic form */
+            return a / a[a.length - 1];
+        },
+        invmod(x, y) {
+            var q, u, v, a, c, t;
+            u = x;
+            v = y;
+            c = Polynomial([1]);
+            a = Polynomial([0]);
+            while (u.deg() >= 0) {
+                t = Polynomial.divrem(v, u);
+                q = t[0];
+                v = u;
+                u = t[1];
+                t = c;
+                c = a - q * c;
+                a = t;
+            }
+            /* v = gcd(x, y) */
+            if (v.deg() > 0)
+                throw RangeError("not invertible");
+            return Polynomial.divrem(a, y)[1];
+        },
+        roots(p) {
+            return poly_roots(p);
+        }
+    });
+
+    /* Polynomial Modulo Q */
+
+    PolyMod = function PolyMod(a, m) {
+        var obj, t;
+        if (new.target)
+            throw TypeError("not a constructor");
+        obj = Object.create(PolyMod.prototype);
+        if (m instanceof Polynomial) {
+            if (m.deg() <= 0)
+                throw RangeError("the modulo cannot have a degree <= 0");
+            if (a instanceof RationalFunction) {
+                return PolyMod(a.num, m) / a.den;
+            } else {
+                a = Polynomial(a);
+                t = Polynomial.divrem(a, m);
+                a = t[1];
+            }
+        } else {
+            throw TypeError("invalid types");
+        }
+        obj.res = a;
+        obj.mod = m;
+        return obj;
+    };
+
+    add_props(PolyMod.prototype, {
+        [Symbol.operatorPlus]() {
+            return this;
+        },
+        [Symbol.operatorNeg]() {
+            return PolyMod(-this.res, this.mod);
+        },
+        inverse() {
+            var a = this, m = a.mod;
+            if (m instanceof Polynomial) {
+                return PolyMod(Polynomial.invmod(a.res, m), m);
+            } else {
+                throw TypeError("unsupported type");
+            }
+        },
+        toString() {
+            return "PolyMod(" + this.res + "," + this.mod + ")";
+        },
+    });
+
+    add_props(PolyMod, {
+        [Symbol.operatorOrder]: OT_POLYMOD,
+        [Symbol.operatorAdd](a, b) {
+            if (!(a instanceof PolyMod)) {
+                return PolyMod(a + b.res, b.mod);
+            } else if (!(b instanceof PolyMod)) {
+                return PolyMod(a.res + b, a.mod);
+            } else {
+                if (a.mod != b.mod)
+                    throw TypeError("different modulo for binary operator");
+                return PolyMod(a.res + b.res, a.mod);
+            }
+        },
+        [Symbol.operatorSub](a, b) {
+            if (!(a instanceof PolyMod)) {
+                return PolyMod(a - b.res, b.mod);
+            } else if (!(b instanceof PolyMod)) {
+                return PolyMod(a.res - b, a.mod);
+            } else {
+                if (a.mod != b.mod)
+                    throw TypeError("different modulo for binary operator");
+                return PolyMod(a.res - b.res, a.mod);
+            }
+        },
+        [Symbol.operatorMul](a, b) {
+            if (!(a instanceof PolyMod)) {
+                return PolyMod(a * b.res, b.mod);
+            } else if (!(b instanceof PolyMod)) {
+                return PolyMod(a.res * b, a.mod);
+            } else {
+                if (a.mod != b.mod)
+                    throw TypeError("different modulo for binary operator");
+                return PolyMod(a.res * b.res, a.mod);
+            }
+        },
+        [Symbol.operatorMathDiv](a, b) {
+            if (!(b instanceof PolyMod))
+                b = PolyMod(b, a.mod);
+            return PolyMod[Symbol.operatorMul](a, b.inverse());
+        },
+        [Symbol.operatorMathPow]: generic_pow,
+        [Symbol.operatorCmpEQ](a, b) {
+            if (!(a instanceof PolyMod) ||
+                !(b instanceof PolyMod))
+                return false;
+            return (a.mod == b.mod && a.res == b.res);
+        }
+    });
+
+    /* Rational function */
+    
+    RationalFunction = function RationalFunction(a, b)
+    {
+        var t, r, d, obj;
+        if (new.target)
+            throw TypeError("not a constructor");
+        if (!(a instanceof Polynomial) ||
+            !(b instanceof Polynomial))
+            throw TypeError("polynomial expected");
+        t = Polynomial.divrem(a, b);
+        r = t[1];
+        if (r.deg() < 0)
+            return t[0]; /* no need for a fraction */
+        d = Polynomial.gcd(b, r);
+        if (d.deg() > 0) {
+            a = Polynomial.divrem(a, d)[0];
+            b = Polynomial.divrem(b, d)[0];
+        }
+        obj = Object.create(RationalFunction.prototype);
+        obj.num = a;
+        obj.den = b;
+        return obj;
+    }
+
+    add_props(RationalFunction.prototype, {
+        [Symbol.operatorPlus]() {
+            return this;
+        },
+        [Symbol.operatorNeg]() {
+            return RationalFunction(-this.num, this.den);
+        },
+        inverse() {
+            return RationalFunction(this.den, this.num);
+        },
+        conj() {
+            return RationalFunction(this.num.conj(), this.den.conj());
+        },
+        toString() {
+            var str;
+            if (this.num.deg() <= 0 &&
+                !number_need_paren(this.num[0]))
+                str = this.num.toString();
+            else
+                str = "(" + this.num.toString() + ")";
+            str += "/(" + this.den.toString() + ")"
+            return str;
+        },
+        apply(b) {
+            return this.num.apply(b) / this.den.apply(b);
+        },
+        deriv() {
+            var n = this.num, d = this.den;
+            return RationalFunction(n.deriv() * d - n * d.deriv(), d * d);
+        },
+    });
+
+    add_props(RationalFunction, {
+        [Symbol.operatorOrder]: OT_RFUNC,
+        /* This function always return a RationalFunction object even
+           if it could simplified to a polynomial, so it is not
+           equivalent to RationalFunction(a) */
+        toRationalFunction(a) {
+            var obj;
+            if (a instanceof RationalFunction) {
+                return a;
+            } else {
+                obj = Object.create(RationalFunction.prototype);
+                obj.num = Polynomial(a);
+                obj.den = Polynomial(1);
+                return obj;
+            }
+        },
+        [Symbol.operatorAdd](a, b) {
+            a = RationalFunction.toRationalFunction(a);
+            b = RationalFunction.toRationalFunction(b);
+            return RationalFunction(a.num * b.den + a.den * b.num, a.den * b.den);
+        },
+        [Symbol.operatorSub](a, b) {
+            a = RationalFunction.toRationalFunction(a);
+            b = RationalFunction.toRationalFunction(b);
+            return RationalFunction(a.num * b.den - a.den * b.num, a.den * b.den);
+        },
+        [Symbol.operatorMul](a, b) {
+            a = RationalFunction.toRationalFunction(a);
+            b = RationalFunction.toRationalFunction(b);
+            return RationalFunction(a.num * b.num, a.den * b.den);
+        },
+        [Symbol.operatorMathDiv](a, b) {
+            a = RationalFunction.toRationalFunction(a);
+            b = RationalFunction.toRationalFunction(b);
+            return RationalFunction(a.num * b.den, a.den * b.num);
+        },
+        [Symbol.operatorMathPow]: generic_pow,
+        [Symbol.operatorCmpEQ](a, b) {
+            a = RationalFunction.toRationalFunction(a);
+            b = RationalFunction.toRationalFunction(b);
+            /* we assume the fractions are normalized */
+            return (a.num == b.num && a.den == b.den);
+        },
+    });
+              
+    /* Power series */
+
+    /* 'a' is an array */
+    function get_emin(a) {
+        var i, n;
+        n = a.length;
+        for(i = 0; i < n; i++) {
+            if (a[i] != 0)
+                return i;
+        }
+        return n;
+    };
+    
+    /* n is the maximum number of terms if 'a' is not a serie */
+    Series = function Series(a, n) {
+        var emin, r, i;
+        
+        if (a instanceof Series) {
+            return a;
+        } else if (a.constructor[Symbol.operatorOrder] <= OT_POLY) {
+            if (n <= 0) {
+                /* XXX: should still use the polynomial degree */
+                return Series.zero(0, 0);
+            } else {
+                a = Polynomial(a);
+                emin = get_emin(a);
+                r = Series.zero(n, emin);
+                n = Math.min(a.length - emin, n);
+                for(i = 0; i < n; i++)
+                    r[i] = a[i + emin];
+                return r;
+            }
+        } else if (a instanceof RationalFunction) {
+            return Series(a.num, n) / a.den;
+        } else {
+            throw TypeError("invalid type");
+        }
+    };
+
+    add_props(Series.prototype, {
+        [Symbol.operatorPlus]() {
+            return this;
+        },
+        [Symbol.operatorNeg]() {
+            var obj, n, i;
+            n = this.length;
+            obj = Series.zero(this.length, this.emin);
+            for(i = 0; i < n; i++) {
+                obj[i] = -this[i];
+            }
+            return obj;
+        },
+        conj() {
+            var obj, n, i;
+            n = this.length;
+            obj = Series.zero(this.length, this.emin);
+            for(i = 0; i < n; i++) {
+                obj[i] = this[i].conj();
+            }
+            return obj;
+        },
+        inverse() {
+            var r, n, i, j, sum, v1 = this;
+            n = v1.length;
+            if (n == 0)
+                throw RangeError("division by zero");
+            r = Series.zero(n, -v1.emin);
+            r[0] = 1 / v1[0];
+            for(i = 1; i < n; i++) {
+                sum = 0;
+                for(j = 1; j <= i; j++) {
+                    sum += v1[j] * r[i - j];
+                }
+                r[i] = -sum * r[0];
+            }
+            return r;
+        },
+        /* remove leading zero terms */
+        trim() {
+            var i, j, n, r, v1 = this;
+            n = v1.length;
+            i = 0;
+            while (i < n && v1[i] == 0)
+                i++;
+            if (i == 0)
+                return v1;
+            for(j = i; j < n; j++)
+                v1[j - i] = v1[j];
+            v1.length = n - i;
+            v1.__proto__.emin += i;
+            return v1;
+        },
+        toString() {
+            var i, j, str, str1, c, a = this, emin, n;
+            str="";
+            emin = this.emin;
+            n = this.length;
+            for(j = 0; j < n; j++) {
+                i = j + emin;
+                c = a[j];
+                if (c != 0) {
+                    str1 = monomial_toString(c, i);
+                    if (str1[0] != "-") {
+                        if (str != "")
+                            str += "+";
+                    }
+                    str += str1;
+                }
+            }
+            if (str != "")
+                str += "+";
+            str += "O(" + monomial_toString(1, n + emin) + ")";
+            return str;
+        },
+        apply(b) {
+            var i, n, r, a = this;
+            n = a.length;
+            if (n == 0)
+                return 0;
+            r = a[--n];
+            while (n > 0) {
+                n--;
+                r = r * b + a[n];
+            }
+            if (a.emin != 0)
+                r *= b ^ a.emin;
+            return r;
+        },
+        deriv() {
+            var a = this, n = a.length, emin = a.emin, r, i, j;
+            if (n == 0 && emin == 0) {
+                return Series.zero(0, 0);
+            } else {
+                r = Series.zero(n, emin - 1);
+                for(i = 0; i < n; i++) {
+                    j = emin + i;
+                    if (j == 0)
+                        r[i] = 0;
+                    else
+                        r[i] = j * a[i];
+                }
+                return r.trim();
+            }
+        },
+        integ() {
+            var a = this, n = a.length, emin = a.emin, i, j, r;
+            r = Series.zero(n, emin + 1);
+            for(i = 0; i < n; i++) {
+                j = emin + i;
+                if (j == -1) {
+                    if (a[i] != 0)
+                        throw RangError("cannot represent integ(1/X)");
+                } else {
+                    r[i] = a[i] / (j + 1);
+                }
+            }
+            return r.trim();
+        },
+        exp() {
+            var c, i, r, n, a = this;
+            n = a.emin;
+            if (n < 0)
+                throw RangeError("negative exponent in exp");
+            if (n > 0 || a[0] == 0) {
+                c = 1;
+            } else {
+                c = global.exp(a[0]);
+                a -= a[0];
+            }
+            n += a.length;
+            r = Series.zero(n, 0);
+            for(i = 0; i < n; i++) {
+                r[i] = c / fact(i);
+            }
+            return r.apply(a);
+        },
+        log() {
+            var a = this, r;
+            if (a.emin != 0)
+                throw Range("log argument must have a non zero constant term");
+            r = integ(deriv(a) / a);
+            /* add the constant term */
+            r += global.log(a[0]);
+            return r;
+        },
+    });
+
+    add_props(Series, {
+        [Symbol.operatorOrder]: OT_SERIES,
+        /* new series of length n and first exponent emin */
+        zero(n, emin) {
+            var r, i, obj;
+
+            r = [];
+            for(i = 0; i < n; i++)
+                r[i] = 0;
+            /* we return an array and store emin in its prototype */
+            obj = Object.create(Series.prototype);
+            obj.emin = emin;
+            Object.setPrototypeOf(r, obj);
+            return r;
+        },
+        [Symbol.operatorAdd](v1, v2) {
+            var tmp, d, emin, n, r, i, j, v2_emin, c1, c2;
+            if (!(v1 instanceof Series)) {
+                tmp = v1;
+                v1 = v2;
+                v2 = tmp;
+            }
+            d = v1.emin + v1.length;
+            if (v2.constructor[Symbol.operatorOrder] <= OT_POLY) {
+                v2 = Polynomial(v2);
+                if (d <= 0)
+                    return v1;
+                v2_emin = 0;
+            } else if (v2 instanceof RationalFunction) {
+                /* compute the emin of the rational fonction */
+                i = get_emin(v2.num) - get_emin(v2.den);
+                if (d <= i)
+                    return v1;
+                /* compute the serie with the required terms */
+                v2 = Series(v2, d - i);
+                v2_emin = v2.emin;
+            } else {
+                v2_emin = v2.emin;
+                d = Math.min(d, v2_emin + v2.length);
+            }
+            emin = Math.min(v1.emin, v2_emin);
+            n = d - emin;
+            r = Series.zero(n, emin);
+            /* XXX: slow */
+            for(i = emin; i < d; i++) {
+                j = i - v1.emin;
+                if (j >= 0 && j < v1.length)
+                    c1 = v1[j];
+                else
+                    c1 = 0;
+                j = i - v2_emin;
+                if (j >= 0 && j < v2.length)
+                    c2 = v2[j];
+                else
+                    c2 = 0;
+                r[i - emin] = c1 + c2;
+            }
+            return r.trim();
+        },
+        [Symbol.operatorSub](a, b) {
+            return Series[Symbol.operatorAdd](a, -b);
+        },
+        [Symbol.operatorMul](v1, v2) {
+            var n, i, j, r, n, emin, n1, n2, k;
+            if (!(v1 instanceof Series))
+                v1 = Series(v1, v2.length);
+            else if (!(v2 instanceof Series))
+                v2 = Series(v2, v1.length);
+            emin = v1.emin + v2.emin;
+            n = Math.min(v1.length, v2.length);
+            n1 = v1.length;
+            n2 = v2.length;
+            r = Series.zero(n, emin);
+            for(i = 0; i < n1; i++) {
+                k = Math.min(n2, n - i);
+                for(j = 0; j < k; j++) {
+                    r[i + j] += v1[i] * v2[j];
+                }
+            }
+            return r.trim();
+        },
+        [Symbol.operatorMathDiv](v1, v2) {
+            if (!(v2 instanceof Series))
+                v2 = Series(v2, v1.length);
+            return Series[Symbol.operatorMul](v1, v2.inverse());
+        },
+        [Symbol.operatorMathPow](a, b) {
+            if (Integer.isInteger(b)) {
+                return generic_pow(a, b);
+            } else {
+                if (!(a instanceof Series))
+                    a = Series(a, b.length);
+                return exp(log(a) * b);
+            }
+        },
+        [Symbol.operatorCmpEQ](a, b) {
+            var n, i;
+            if (!(a instanceof Series) ||
+                !(b instanceof Series))
+                return false;
+            if (a.emin != b.emin)
+                return false;
+            n = a.length;
+            if (n != b.length)
+                return false;
+            for(i = 0; i < n; i++) {
+                if (a[i] != b[i])
+                    return false;
+            }
+            return true;
+        },
+        O(a) {
+            function ErrorO() {
+                return TypeError("invalid O() argument");
+            }
+            var n;
+            if (a.constructor[Symbol.operatorOrder] <= OT_POLY) {
+                a = Polynomial(a);
+                n = a.deg();
+                if (n < 0)
+                    throw ErrorO();
+            } else if (a instanceof RationalFunction) {
+                if (a.num.deg() != 0)
+                    throw ErrorO();
+                n = a.den.deg();
+                if (n < 0)
+                    throw ErrorO();
+                n = -n;
+            } else
+                throw ErrorO();
+            return Series.zero(0, n);
+        },
+    });
+    
+    /* Array (Matrix) */
+
+    Matrix = function Matrix(h, w) {
+        var i, j, r, rl;
+        if (typeof w === "undefined")
+            w = h;
+        r = [];
+        for(i = 0; i < h; i++) {
+            rl = [];
+            for(j = 0; j < w; j++)
+                rl[j] = 0;
+            r[i] = rl;
+        }
+        return r;
+    };
+
+    add_props(Matrix, {
+        idn(n) {
+            var r, i;
+            r = Matrix(n, n);
+            for(i = 0; i < n; i++)
+                r[i][i] = 1;
+            return r;
+        },
+        diag(a) {
+            var r, i, n;
+            n = a.length;
+            r = Matrix(n, n);
+            for(i = 0; i < n; i++)
+                r[i][i] = a[i];
+            return r;
+        },
+        hilbert(n) {
+            var i, j, r;
+            r = Matrix(n);
+            for(i = 0; i < n; i++) {
+                for(j = 0; j < n; j++) {
+                    r[i][j] = 1 / (1 + i + j);
+                }
+            }
+            return r;
+        },
+        trans(a) {
+            var h, w, r, i, j;
+            if (!Array.isArray(a))
+                throw TypeError("matrix expected");
+            h = a.length;
+            if (!Array.isArray(a[0])) {
+                w = 1;
+                r = Matrix(w, h);
+                for(i = 0; i < h; i++) {
+                    r[0][i] = a[i];
+                }
+            } else {
+                w = a[0].length;
+                r = Matrix(w, h);
+                for(i = 0; i < h; i++) {
+                    for(j = 0; j < w; j++) {
+                        r[j][i] = a[i][j];
+                    }
+                }
+            }
+            return r;
+        },
+        check_square(a) {
+            var a, n;
+            if (!Array.isArray(a))
+                throw TypeError("array expected");
+            n = a.length;
+            if (!Array.isArray(a[0]) || n != a[0].length)
+                throw TypeError("square matrix expected");
+            return n;
+        },
+        trace(a) {
+            var n, r, i;
+            n = Matrix.check_square(a);
+            r = a[0][0];
+            for(i = 1; i < n; i++) {
+                r += a[i][i];
+            }
+            return r;
+        },
+        charpoly(a) {
+            var n, p, c, i, j, coef;
+            n = Matrix.check_square(a);
+            p = [];
+            for(i = 0; i < n + 1; i++)
+                p[i] = 0;
+            p[n] = 1;
+            c = Matrix.idn(n);
+            for(i = 0; i < n; i++) {
+                c = c * a;
+                coef = -trace(c) / (i + 1);
+                p[n - i - 1] = coef;
+                for(j = 0; j < n; j++)
+                    c[j][j] += coef;
+            }
+            return Polynomial(p);
+        },
+        eigenvals(a) {
+            return Polynomial.roots(Matrix.charpoly(a));
+        },
+        det(a) {
+            var n, i, j, k, s, src, v, c;
+            
+            n = Matrix.check_square(a);
+            s = 1;
+            src = a.dup();
+            for(i=0;i<n;i++) {
+                for(j = i; j < n; j++) {
+                    if (src[j][i] != 0)
+                        break;
+                }
+                if (j == n)
+                    return 0;
+                if (j != i) {
+                    for(k = 0;k < n; k++) {
+                        v = src[j][k];
+                        src[j][k] = src[i][k];
+                        src[i][k] = v;
+                    }
+                    s = -s;
+                }
+                c = src[i][i].inverse();
+                for(j = i + 1; j < n; j++) {
+                    v = c * src[j][i];
+                    for(k = 0;k < n; k++) {
+                        src[j][k] -= src[i][k] * v;
+                    }
+                }
+            }
+            c = s;
+            for(i=0;i<n;i++)
+                c *= src[i][i];
+            return c;
+        },
+        inverse(a) {
+            var n, dst, src, i, j, k, n2, r, c, v;
+            n = Matrix.check_square(a);
+            src = a.dup();
+            dst = Matrix.idn(n);
+            for(i=0;i<n;i++) {
+                for(j = i; j < n; j++) {
+                    if (src[j][i] != 0)
+                        break;
+                }
+                if (j == n)
+                    throw RangeError("matrix is not invertible");
+                if (j != i) {
+                    /* swap lines in src and dst */
+                    v = src[j];
+                    src[j] = src[i];
+                    src[i] = v;
+                    v = dst[j];
+                    dst[j] = dst[i];
+                    dst[i] = v;
+                }
+
+                c = src[i][i].inverse();
+                for(k = 0; k < n; k++) {
+                    src[i][k] *= c;
+                    dst[i][k] *= c;
+                }
+                
+                for(j = 0; j < n; j++) {
+                    if (j != i) {
+                        c = src[j][i];
+                        for(k = i; k < n; k++) {
+                            src[j][k] -= src[i][k] * c;
+                        }
+                        for(k = 0; k < n; k++) {
+                            dst[j][k] -= dst[i][k] * c;
+                        }
+                    }
+                }
+            }
+            return dst;
+        },
+        rank(a) {
+            var src, i, j, k, w, h, l, c;
+            
+            if (!Array.isArray(a) ||
+                !Array.isArray(a[0]))
+                throw TypeError("matrix expected");
+            h = a.length;
+            w = a[0].length;
+            src = a.dup();
+            l = 0;
+            for(i=0;i<w;i++) {
+                for(j = l; j < h; j++) {
+                    if (src[j][i] != 0)
+                        break;
+                }
+                if (j == h)
+                    continue;
+                if (j != l) {
+                    /* swap lines */
+                    for(k = 0; k < w; k++) {
+                        v = src[j][k];
+                        src[j][k] = src[l][k];
+                        src[l][k] = v;
+                    }
+                }
+                
+                c = src[l][i].inverse();
+                for(k = 0; k < w; k++) {
+                    src[l][k] *= c;
+                }
+                
+                for(j = l + 1; j < h; j++) {
+                    c = src[j][i];
+                    for(k = i; k < w; k++) {
+                        src[j][k] -= src[l][k] * c;
+                    }
+                }
+                l++;
+            }
+            return l;
+        },
+        ker(a) {
+            var src, i, j, k, w, h, l, m, r, im_cols, ker_dim, c;
+            
+            if (!Array.isArray(a) ||
+                !Array.isArray(a[0]))
+                throw TypeError("matrix expected");
+            h = a.length;
+            w = a[0].length;
+            src = a.dup();
+            im_cols = [];
+            l = 0;
+            for(i=0;i<w;i++) {
+                im_cols[i] = false;
+                for(j = l; j < h; j++) {
+                    if (src[j][i] != 0)
+                        break;
+                }
+                if (j == h)
+                    continue;
+                im_cols[i] = true;
+                if (j != l) {
+                    /* swap lines */
+                    for(k = 0; k < w; k++) {
+                        v = src[j][k];
+                        src[j][k] = src[l][k];
+                        src[l][k] = v;
+                    }
+                }
+                
+                c = src[l][i].inverse();
+                for(k = 0; k < w; k++) {
+                    src[l][k] *= c;
+                }
+                
+                for(j = 0; j < h; j++) {
+                    if (j != l) {
+                        c = src[j][i];
+                        for(k = i; k < w; k++) {
+                            src[j][k] -= src[l][k] * c;
+                        }
+                    }
+                }
+                l++;
+                //        log_str("m=" + cval_toString(v1) + "\n");
+            }
+            //    log_str("im cols="+im_cols+"\n");
+
+            /* build the kernel vectors */
+            ker_dim = w - l;
+            r = Matrix(w, ker_dim);
+            k = 0;
+            for(i = 0; i < w; i++) {
+                if (!im_cols[i]) {
+                    /* select this column from the matrix */
+                    l = 0;
+                    m = 0;
+                    for(j = 0; j < w; j++) {
+                        if (im_cols[j]) {
+                            r[j][k] = -src[m][i];
+                            m++;
+                        } else {
+                            if (l == k) {
+                                r[j][k] = 1;
+                            } else {
+                                r[j][k] = 0;
+                            }
+                            l++;
+                        }
+                    }
+                    k++;
+                }
+            }
+            return r;
+        },
+        dp(a, b) {
+            var i, n, r;
+            n = a.length;
+            if (n != b.length)
+                throw TypeError("incompatible array length");
+            /* XXX: could do complex product */
+            r = 0;
+            for(i = 0; i < n; i++) {
+                r += a[i] * b[i];
+            }
+            return r;
+        },
+        /* cross product */
+        cp(v1, v2) {
+            var r;
+            if (v1.length != 3 || v2.length != 3)
+                throw TypeError("vectors must have 3 elements");
+            r = [];
+            r[0] = v1[1] * v2[2] - v1[2] * v2[1];
+            r[1] = v1[2] * v2[0] - v1[0] * v2[2];
+            r[2] = v1[0] * v2[1] - v1[1] * v2[0];
+            return r;
+        },
+    });
+
+    add_props(Array, {
+        [Symbol.operatorOrder]: OT_ARRAY,
+        [Symbol.operatorAdd](a, b) {
+            var r, i, n;
+            if (!Array.isArray(a) || !Array.isArray(b))
+                throw TypeError("array expected");
+            n = a.length;
+            if (n != b.length)
+                throw TypeError("incompatible array size");
+            r = [];
+            for(i = 0; i < n; i++)
+                r[i] = a[i] + b[i];
+            return r;
+        },
+        [Symbol.operatorSub](a, b) {
+            var r, i, n;
+            n = a.length;
+            if (!Array.isArray(a) || !Array.isArray(b))
+                throw TypeError("array expected");
+            if (n != b.length)
+                throw TypeError("incompatible array size");
+            r = [];
+            for(i = 0; i < n; i++)
+                r[i] = a[i] - b[i];
+            return r;
+        },
+        scalar_mul(a, b) {
+            var r, i, n;
+            n = a.length;
+            r = [];
+            for(i = 0; i < n; i++)
+                r[i] = a[i] * b;
+            return r;
+        },
+        [Symbol.operatorMul](a, b) {
+            var h, w, l, i, j, k, r, rl, sum, a_mat, b_mat, a_is_array, b_is_array;
+            a_is_array = Array.isArray(a);
+            b_is_array = Array.isArray(b);
+            if (!a_is_array && !b_is_array) {
+                throw TypeError("array expected");
+            } else if (!a_is_array && b_is_array) {
+                return Array.scalar_mul(b, a);
+            } else if (a_is_array && !b_is_array) {
+                return Array.scalar_mul(a, b);
+            }
+            h = a.length;
+            a_mat = Array.isArray(a[0]);
+            if (a_mat) {
+                l = a[0].length;
+            } else {
+                l = 1;
+            }
+            if (l != b.length)
+                throw RangeError("incompatible matrix size");
+            b_mat = Array.isArray(b[0]);
+            if (b_mat)
+                w = b[0].length;
+            else
+                w = 1;
+            r = [];
+            if (a_mat && b_mat) {
+                for(i = 0; i < h; i++) {
+                    rl = [];
+                    for(j = 0; j < w; j++) {
+                        sum = 0;
+                        for(k = 0; k < l; k++) {
+                            sum += a[i][k] * b[k][j];
+                        }
+                        rl[j] = sum;
+                    }
+                    r[i] = rl;
+                }
+            } else if (a_mat && !b_mat) {
+                for(i = 0; i < h; i++) {
+                    sum = 0;
+                    for(k = 0; k < l; k++) {
+                        sum += a[i][k] * b[k];
+                    }
+                    r[i] = sum;
+                }
+            } else if (!a_mat && b_mat) {
+                for(i = 0; i < h; i++) {
+                    rl = [];
+                    for(j = 0; j < w; j++) {
+                        rl[j] = a[i] * b[0][j];
+                    }
+                    r[i] = rl;
+                }
+            } else {
+                for(i = 0; i < h; i++) {
+                    r[i] = a[i] * b[0];
+                }
+            }
+            return r;
+        },
+        [Symbol.operatorMathDiv](a, b) {
+            return Array[Symbol.operatorMul](a, b.inverse());
+        },
+        [Symbol.operatorMathPow]: generic_pow,
+        [Symbol.operatorCmpEQ](a, b) {
+            var n, i;
+            n = a.length;
+            if (n != b.length)
+                return false;
+            for(i = 0; i < n; i++) {
+                if (a[i] != b[i])
+                    return false;
+            }
+            return true;
+        },
+    });
+
+    add_props(Array.prototype, {
+        [Symbol.operatorPlus]() {
+            return this;
+        },
+        [Symbol.operatorNeg]() {
+            var i, n, r;
+            n = this.length;
+            r = [];
+            for(i = 0; i < n; i++)
+                r[i] = -this[i];
+            return r;
+        },
+        conj() {
+            var i, n, r;
+            n = this.length;
+            r = [];
+            for(i = 0; i < n; i++)
+                r[i] = this[i].conj();
+            return r;
+        },
+        dup() {
+            var r, i, n, el, a = this;
+            r = [];
+            n = a.length;
+            for(i = 0; i < n; i++) {
+                el = a[i];
+                if (Array.isArray(el))
+                    el = el.dup();
+                r[i] = el;
+            }
+            return r;
+        },
+        inverse() {
+            return Matrix.inverse(this);
+        },
+        norm2: Polynomial.prototype.norm2,
+    });
+
+})(this);
+
+/* global definitions */
+var I = Complex(0, 1);
+var X = Polynomial([0, 1]);
+var O = Series.O;
+
+Object.defineProperty(this, "PI", { get: function () { return Float.PI } });
+
+/* put frequently used functions in the global context */
+var gcd = Integer.gcd;
+var fact = Integer.fact;
+var comb = Integer.comb;
+var pmod = Integer.pmod;
+var invmod = Integer.invmod;
+var factor = Integer.factor;
+var isprime = Integer.isPrime;
+var nextprime = Integer.nextPrime;
+
+function deriv(a)
+{
+    return a.deriv();
+}
+
+function integ(a)
+{
+    return a.integ();
+}
+
+function norm2(a)
+{
+    return a.norm2();
+}
+
+function abs(a)
+{
+    return a.abs();
+}
+
+function conj(a)
+{
+    return a.conj();
+}
+
+function arg(a)
+{
+    return a.arg();
+}
+
+function inverse(a)
+{
+    return a.inverse();
+}
+
+function trunc(a)
+{
+    if (Integer.isInteger(a)) {
+        return a;
+    } else if (a instanceof Fraction) {
+        return Integer.tdiv(a.num, a.den);
+    } else if (a instanceof Polynomial) {
+        return a;
+    } else if (a instanceof RationalFunction) {
+        return Polynomial.divrem(a.num, a.den)[0];
+    } else {
+        return Float.ceil(a);
+    }
+}
+
+function floor(a)
+{
+    if (Integer.isInteger(a)) {
+        return a;
+    } else if (a instanceof Fraction) {
+        return Integer.fdiv(a.num, a.den);
+    } else {
+        return Float.floor(a);
+    }
+}
+
+function ceil(a)
+{
+    if (Integer.isInteger(a)) {
+        return a;
+    } else if (a instanceof Fraction) {
+        return Integer.cdiv(a.num, a.den);
+    } else {
+        return Float.ceil(a);
+    }
+}
+
+function sqrt(a)
+{
+    var t, u, re, im;
+    if (a instanceof Series) {
+        return a ^ (1/2);
+    } else if (a instanceof Complex) {
+        t = abs(a);
+        u = a.re;
+        re = sqrt((t + u) / 2);
+        im = sqrt((t - u) / 2);
+        if (a.im < 0)
+            im = -im;
+        return Complex.toComplex(re, im);
+    } else {
+        a = Float(a);
+        if (a < 0) {
+            return Complex(0, Float.sqrt(-a));
+        } else {
+            return Float.sqrt(a);
+        }
+    }
+}
+
+function exp(a)
+{
+    return a.exp();
+}
+
+function log(a)
+{
+    return a.log();
+}
+
+function log2(a)
+{
+    return log(a) * Float.LOG2E;
+}
+
+function log10(a)
+{
+    return log(a) * Float.LOG10E;
+}
+
+function todb(a)
+{
+    return log10(a) * 10;
+}
+
+function fromdb(a)
+{
+    return 10 ^ (a / 10);
+}
+
+function sin(a)
+{
+    var t;
+    if (a instanceof Complex || a instanceof Series) {
+        t = exp(a * I);
+        return (t - 1/t) / (2 * I);
+    } else {
+        return Float.sin(Float(a));
+    }
+}
+
+function cos(a)
+{
+    var t;
+    if (a instanceof Complex || a instanceof Series) {
+        t = exp(a * I);
+        return (t + 1/t) / 2;
+    } else {
+        return Float.cos(Float(a));
+    }
+}
+
+function tan(a)
+{
+    if (a instanceof Complex || a instanceof Series) {
+        return sin(a) / cos(a);
+    } else {
+        return Float.tan(Float(a));
+    }
+}
+
+function asin(a)
+{
+    return Float.asin(Float(a));
+}
+
+function acos(a)
+{
+    return Float.acos(Float(a));
+}
+
+function atan(a)
+{
+    return Float.atan(Float(a));
+}
+
+function atan2(a, b)
+{
+    return Float.atan2(Float(a), Float(b));
+}
+
+function sinc(a)
+{
+    if (a == 0) {
+        return 1;
+    } else {
+        a *= Float.PI;
+        return sin(a) / a;
+    }
+}
+
+function todeg(a)
+{
+    return a * 180 / Float.PI;
+}
+
+function fromdeg(a)
+{
+    return a * Float.PI / 180;
+}
+
+var idn = Matrix.idn;
+var diag = Matrix.diag;
+var trans = Matrix.trans;
+var trace = Matrix.trace;
+var charpoly = Matrix.charpoly;
+var eigenvals = Matrix.eigenvals;
+var det = Matrix.det;
+var rank = Matrix.rank;
+var ker = Matrix.ker;
+var cp = Matrix.cp;
+var dp = Matrix.dp;
+
+var polroots = Polynomial.roots;
+var bestappr = Float.bestappr;
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-atom.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-atom.h
new file mode 100755
index 00000000..6f5b7ee9
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-atom.h
@@ -0,0 +1,274 @@
+/*
+ * QuickJS atom definitions
+ * 
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ * Copyright (c) 2017-2018 Charlie Gordon
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+
+#ifdef DEF
+
+/* Note: first atoms are considered as keywords in the parser */
+DEF(null, "null") /* must be first */
+DEF(false, "false")
+DEF(true, "true")
+DEF(if, "if")
+DEF(else, "else")
+DEF(return, "return")
+DEF(var, "var")
+DEF(this, "this")
+DEF(delete, "delete")
+DEF(void, "void")
+DEF(typeof, "typeof")
+DEF(new, "new")
+DEF(in, "in")
+DEF(instanceof, "instanceof")
+DEF(do, "do")
+DEF(while, "while")
+DEF(for, "for")
+DEF(break, "break")
+DEF(continue, "continue")
+DEF(switch, "switch")
+DEF(case, "case")
+DEF(default, "default")
+DEF(throw, "throw")
+DEF(try, "try")
+DEF(catch, "catch")
+DEF(finally, "finally")
+DEF(function, "function")
+DEF(debugger, "debugger")
+DEF(with, "with")
+/* FutureReservedWord */
+DEF(class, "class")
+DEF(const, "const")
+DEF(enum, "enum")
+DEF(export, "export")
+DEF(extends, "extends")
+DEF(import, "import")
+DEF(super, "super")
+/* FutureReservedWords when parsing strict mode code */
+DEF(implements, "implements")
+DEF(interface, "interface")
+DEF(let, "let")
+DEF(package, "package")
+DEF(private, "private")
+DEF(protected, "protected")
+DEF(public, "public")
+DEF(static, "static")
+DEF(yield, "yield")
+DEF(await, "await")
+
+/* empty string */
+DEF(empty_string, "")
+/* identifiers */
+DEF(length, "length")
+DEF(fileName, "fileName")
+DEF(lineNumber, "lineNumber")
+DEF(message, "message")
+DEF(stack, "stack")
+DEF(name, "name")
+DEF(toString, "toString")
+DEF(toLocaleString, "toLocaleString")
+DEF(valueOf, "valueOf")
+DEF(eval, "eval")
+DEF(prototype, "prototype")
+DEF(constructor, "constructor")
+DEF(configurable, "configurable")
+DEF(writable, "writable")
+DEF(enumerable, "enumerable")
+DEF(value, "value")
+DEF(get, "get")
+DEF(set, "set")
+DEF(of, "of")
+DEF(__proto__, "__proto__")
+DEF(undefined, "undefined")
+DEF(number, "number")
+DEF(boolean, "boolean")
+DEF(string, "string")
+DEF(object, "object")
+DEF(symbol, "symbol")
+DEF(integer, "integer")
+DEF(unknown, "unknown")
+DEF(arguments, "arguments")
+DEF(callee, "callee")
+DEF(caller, "caller")
+DEF(_eval_, "<eval>")
+DEF(_ret_, "<ret>")
+DEF(_var_, "<var>")
+DEF(_with_, "<with>")
+DEF(lastIndex, "lastIndex")
+DEF(target, "target")
+DEF(index, "index")
+DEF(input, "input")
+DEF(defineProperties, "defineProperties")
+DEF(apply, "apply")
+DEF(join, "join")
+DEF(concat, "concat")
+DEF(split, "split")
+DEF(construct, "construct")
+DEF(getPrototypeOf, "getPrototypeOf")
+DEF(setPrototypeOf, "setPrototypeOf")
+DEF(isExtensible, "isExtensible")
+DEF(preventExtensions, "preventExtensions")
+DEF(has, "has")
+DEF(deleteProperty, "deleteProperty")
+DEF(defineProperty, "defineProperty")
+DEF(getOwnPropertyDescriptor, "getOwnPropertyDescriptor")
+DEF(ownKeys, "ownKeys")
+DEF(add, "add")
+DEF(done, "done")
+DEF(next, "next")
+DEF(values, "values")
+DEF(source, "source")
+DEF(flags, "flags")
+DEF(global, "global")
+DEF(unicode, "unicode")
+DEF(raw, "raw")
+DEF(new_target, "new.target")
+DEF(this_active_func, "this.active_func")
+DEF(home_object, "<home_object>")
+DEF(as, "as")
+DEF(from, "from")
+DEF(_default_, "*default*")
+DEF(_star_, "*")
+DEF(Module, "Module")
+DEF(then, "then")
+DEF(resolve, "resolve")
+DEF(reject, "reject")
+DEF(promise, "promise")
+DEF(proxy, "proxy")
+DEF(revoke, "revoke")
+DEF(async, "async")
+DEF(exec, "exec")
+DEF(groups, "groups")
+#ifdef CONFIG_BIGNUM
+DEF(bigint, "bigint")
+DEF(bigfloat, "bigfloat")
+#endif
+#ifdef CONFIG_ATOMICS
+DEF(not_equal, "not-equal")
+DEF(timed_out, "timed-out")
+DEF(ok, "ok")
+#endif
+DEF(toJSON, "toJSON")
+/* class names */
+DEF(Object, "Object")
+DEF(Array, "Array")
+DEF(Error, "Error")
+DEF(Number, "Number")
+DEF(String, "String")
+DEF(Boolean, "Boolean")
+DEF(Symbol, "Symbol")
+DEF(Arguments, "Arguments")
+DEF(Math, "Math")
+DEF(JSON, "JSON")
+DEF(Date, "Date")
+DEF(Function, "Function")
+DEF(GeneratorFunction, "GeneratorFunction")
+DEF(ForInIterator, "ForInIterator")
+DEF(RegExp, "RegExp")
+DEF(ArrayBuffer, "ArrayBuffer")
+DEF(SharedArrayBuffer, "SharedArrayBuffer")
+/* must keep same order as class IDs for typed arrays */
+DEF(Uint8ClampedArray, "Uint8ClampedArray") 
+DEF(Int8Array, "Int8Array")
+DEF(Uint8Array, "Uint8Array")
+DEF(Int16Array, "Int16Array")
+DEF(Uint16Array, "Uint16Array")
+DEF(Int32Array, "Int32Array")
+DEF(Uint32Array, "Uint32Array")
+#ifdef CONFIG_BIGNUM
+DEF(BigInt64Array, "BigInt64Array")
+DEF(BigUint64Array, "BigUint64Array")
+#endif
+DEF(Float32Array, "Float32Array")
+DEF(Float64Array, "Float64Array")
+DEF(DataView, "DataView")
+#ifdef CONFIG_BIGNUM
+DEF(BigInt, "BigInt")
+DEF(BigFloat, "BigFloat")
+DEF(BigFloatEnv, "BigFloatEnv")
+#endif
+DEF(Map, "Map")
+DEF(Set, "Set") /* Map + 1 */
+DEF(WeakMap, "WeakMap") /* Map + 2 */
+DEF(WeakSet, "WeakSet") /* Map + 3 */
+DEF(Map_Iterator, "Map Iterator")
+DEF(Set_Iterator, "Set Iterator")
+DEF(Array_Iterator, "Array Iterator")
+DEF(String_Iterator, "String Iterator")
+DEF(Generator, "Generator")
+DEF(Proxy, "Proxy")
+DEF(Promise, "Promise")
+DEF(PromiseResolveFunction, "PromiseResolveFunction")
+DEF(PromiseRejectFunction, "PromiseRejectFunction")
+DEF(AsyncFunction, "AsyncFunction")
+DEF(AsyncFunctionResolve, "AsyncFunctionResolve")
+DEF(AsyncFunctionReject, "AsyncFunctionReject")
+DEF(AsyncGeneratorFunction, "AsyncGeneratorFunction")
+DEF(AsyncGenerator, "AsyncGenerator")
+DEF(EvalError, "EvalError")
+DEF(RangeError, "RangeError")
+DEF(ReferenceError, "ReferenceError")
+DEF(SyntaxError, "SyntaxError")
+DEF(TypeError, "TypeError")
+DEF(URIError, "URIError")
+DEF(InternalError, "InternalError")
+
+/* symbols */
+DEF(Symbol_toPrimitive, "Symbol.toPrimitive")
+DEF(Symbol_iterator, "Symbol.iterator")
+DEF(Symbol_match, "Symbol.match")
+DEF(Symbol_replace, "Symbol.replace")
+DEF(Symbol_search, "Symbol.search")
+DEF(Symbol_split, "Symbol.split")
+DEF(Symbol_toStringTag, "Symbol.toStringTag")
+DEF(Symbol_isConcatSpreadable, "Symbol.isConcatSpreadable")
+DEF(Symbol_hasInstance, "Symbol.hasInstance")
+DEF(Symbol_species, "Symbol.species")
+DEF(Symbol_unscopables, "Symbol.unscopables")
+DEF(Symbol_asyncIterator, "Symbol.asyncIterator")
+#ifdef CONFIG_BIGNUM
+DEF(Symbol_operatorOrder, "Symbol.operatorOrder")
+DEF(Symbol_operatorAdd, "Symbol.operatorAdd")
+DEF(Symbol_operatorSub, "Symbol.operatorSub")
+DEF(Symbol_operatorMul, "Symbol.operatorMul")
+DEF(Symbol_operatorDiv, "Symbol.operatorDiv")
+DEF(Symbol_operatorMod, "Symbol.operatorMod")
+DEF(Symbol_operatorPow, "Symbol.operatorPow")
+DEF(Symbol_operatorShl, "Symbol.operatorShl")
+DEF(Symbol_operatorShr, "Symbol.operatorShr")
+DEF(Symbol_operatorAnd, "Symbol.operatorAnd")
+DEF(Symbol_operatorOr, "Symbol.operatorOr")
+DEF(Symbol_operatorXor, "Symbol.operatorXor")
+DEF(Symbol_operatorCmpLT, "Symbol.operatorCmpLT")
+DEF(Symbol_operatorCmpLE, "Symbol.operatorCmpLE")
+DEF(Symbol_operatorCmpEQ, "Symbol.operatorCmpEQ")
+DEF(Symbol_operatorPlus, "Symbol.operatorPlus")
+DEF(Symbol_operatorNeg, "Symbol.operatorNeg")
+DEF(Symbol_operatorNot, "Symbol.operatorNot")
+DEF(Symbol_operatorInc, "Symbol.operatorInc")
+DEF(Symbol_operatorDec, "Symbol.operatorDec")
+DEF(Symbol_operatorMathDiv, "Symbol.operatorMathDiv")
+DEF(Symbol_operatorMathMod, "Symbol.operatorMathMod")
+DEF(Symbol_operatorMathPow, "Symbol.operatorMathPow")
+#endif
+
+#endif /* DEF */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-libc.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-libc.c
new file mode 100755
index 00000000..4d248b60
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-libc.c
@@ -0,0 +1,1825 @@
+/*
+ * QuickJS C library
+ * 
+ * Copyright (c) 2017-2019 Fabrice Bellard
+ * Copyright (c) 2017-2019 Charlie Gordon
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include <stdlib.h>
+#include <stdio.h>
+#include <stdarg.h>
+#include <inttypes.h>
+#include <string.h>
+#include <assert.h>
+#include <unistd.h>
+#include <errno.h>
+#include <fcntl.h>
+#include <sys/time.h>
+#include <time.h>
+#include <signal.h>
+#if defined(_WIN32)
+#include <windows.h>
+#include <conio.h>
+#else
+#include <dlfcn.h>
+#include <termios.h>
+#include <sys/ioctl.h>
+#if defined(__APPLE__)
+typedef sig_t sighandler_t;
+#endif
+#endif
+
+#include "cutils.h"
+#include "list.h"
+#include "quickjs-libc.h"
+
+static void js_std_dbuf_init(JSContext *ctx, DynBuf *s)
+{
+    dbuf_init2(s, JS_GetRuntime(ctx), (DynBufReallocFunc *)js_realloc_rt);
+}
+
+/* TODO:
+   - add exec() wrapper
+   - add minimal VT100 emulation for win32
+   - add socket calls
+*/
+
+typedef struct {
+    struct list_head link;
+    int fd;
+    JSValue rw_func[2];
+} JSOSRWHandler;
+
+typedef struct {
+    struct list_head link;
+    int sig_num;
+    JSValue func;
+} JSOSSignalHandler;
+
+typedef struct {
+    struct list_head link;
+    BOOL has_object;
+    int64_t timeout;
+    JSValue func;
+} JSOSTimer;
+
+/* initialize the lists so js_std_free_handlers() can always be called */
+static struct list_head os_rw_handlers = LIST_HEAD_INIT(os_rw_handlers);
+static struct list_head os_signal_handlers = LIST_HEAD_INIT(os_signal_handlers);
+static struct list_head os_timers = LIST_HEAD_INIT(os_timers);
+static uint64_t os_pending_signals;
+static int eval_script_recurse;
+static int (*os_poll_func)(JSContext *ctx);
+
+static JSValue js_printf_internal(JSContext *ctx,
+                                  int argc, JSValueConst *argv, FILE *fp)
+{
+    char fmtbuf[32];
+    uint8_t cbuf[UTF8_CHAR_LEN_MAX+1];
+    JSValue res;
+    DynBuf dbuf;
+    const char *fmt_str;
+    const uint8_t *fmt, *fmt_end;
+    const uint8_t *p;
+    char *q;
+    int i, c, len;
+    int32_t int32_arg;
+    int64_t int64_arg;
+    double double_arg;
+    const char *string_arg;
+    enum { PART_FLAGS, PART_WIDTH, PART_DOT, PART_PREC, PART_MODIFIER } part;
+    int modsize;
+    /* Use indirect call to dbuf_printf to prevent gcc warning */
+    int (*dbuf_printf_fun)(DynBuf *s, const char *fmt, ...) = (void*)dbuf_printf;
+
+    js_std_dbuf_init(ctx, &dbuf);
+
+    if (argc > 0) {
+        fmt_str = JS_ToCStringLen(ctx, &len, argv[0], FALSE);
+        if (!fmt_str)
+            goto fail;
+
+        i = 1;
+        fmt = (const uint8_t *)fmt_str;
+        fmt_end = fmt + len;
+        while (fmt < fmt_end) {
+            for (p = fmt; fmt < fmt_end && *fmt != '%'; fmt++)
+                continue;
+            dbuf_put(&dbuf, p, fmt - p);
+            if (fmt >= fmt_end)
+                break;
+            q = fmtbuf;
+            *q++ = *fmt++;  /* copy '%' */
+            part = PART_FLAGS;
+            modsize = 0;
+            for (;;) {
+                if (q >= fmtbuf + sizeof(fmtbuf) - 1)
+                    goto invalid;
+
+                c = *fmt++;
+                *q++ = c;
+                *q = '\0';
+
+                switch (c) {
+                case '1': case '2': case '3':
+                case '4': case '5': case '6':
+                case '7': case '8': case '9':
+                    if (part != PART_PREC) {
+                        if (part <= PART_WIDTH)
+                            part = PART_WIDTH;
+                        else 
+                            goto invalid;
+                    }
+                    continue;
+
+                case '0': case '#': case '+': case '-': case ' ': case '\'':
+                    if (part > PART_FLAGS)
+                        goto invalid;
+                    continue;
+
+                case '.':
+                    if (part > PART_DOT)
+                        goto invalid;
+                    part = PART_DOT;
+                    continue;
+
+                case '*':
+                    if (part < PART_WIDTH)
+                        part = PART_DOT;
+                    else if (part == PART_DOT)
+                        part = PART_MODIFIER;
+                    else
+                        goto invalid;
+
+                    if (i >= argc)
+                        goto missing;
+
+                    if (JS_ToInt32(ctx, &int32_arg, argv[i++]))
+                        goto fail;
+                    q += snprintf(q, fmtbuf + sizeof(fmtbuf) - q, "%d", int32_arg);
+                    continue;
+
+                case 'h':
+                    if (modsize != 0 && modsize != -1)
+                        goto invalid;
+                    modsize--;
+                    part = PART_MODIFIER;
+                    continue;
+                case 'l':
+                    q--;
+                    if (modsize != 0 && modsize != 1)
+                        goto invalid;
+                    modsize++;
+                    part = PART_MODIFIER;
+                    continue;
+
+                case 'c':
+                    if (i >= argc)
+                        goto missing;
+                    if (JS_IsString(argv[i])) {
+                        string_arg = JS_ToCString(ctx, argv[i++]);
+                        if (!string_arg)
+                            goto fail;
+                        int32_arg = unicode_from_utf8((uint8_t *)string_arg, UTF8_CHAR_LEN_MAX, &p);
+                        JS_FreeCString(ctx, string_arg);
+                    } else {
+                        if (JS_ToInt32(ctx, &int32_arg, argv[i++]))
+                            goto fail;
+                    }
+                    /* handle utf-8 encoding explicitly */
+                    if ((unsigned)int32_arg > 0x10FFFF)
+                        int32_arg = 0xFFFD;
+                    /* ignore conversion flags, width and precision */
+                    len = unicode_to_utf8(cbuf, int32_arg);
+                    dbuf_put(&dbuf, cbuf, len);
+                    break;
+
+                case 'd':
+                case 'i':
+                case 'o':
+                case 'u':
+                case 'x':
+                case 'X':
+                    if (i >= argc)
+                        goto missing;
+                    if (modsize > 0) {
+                        if (JS_ToInt64(ctx, &int64_arg, argv[i++]))
+                            goto fail;
+                        q[1] = q[-1];
+                        q[-1] = q[0] = 'l';
+                        q[2] = '\0';
+                        dbuf_printf_fun(&dbuf, fmtbuf, (long long)int64_arg);
+                    } else {
+                        if (JS_ToInt32(ctx, &int32_arg, argv[i++]))
+                            goto fail;
+                        dbuf_printf_fun(&dbuf, fmtbuf, int32_arg);
+                    }
+                    break;
+
+                case 's':
+                    if (i >= argc)
+                        goto missing;
+                    string_arg = JS_ToCString(ctx, argv[i++]);
+                    if (!string_arg)
+                        goto fail;
+                    dbuf_printf_fun(&dbuf, fmtbuf, string_arg);
+                    JS_FreeCString(ctx, string_arg);
+                    break;
+
+                case 'e':
+                case 'f':
+                case 'g':
+                case 'a':
+                case 'E':
+                case 'F':
+                case 'G':
+                case 'A':
+                    if (i >= argc)
+                        goto missing;
+                    if (JS_ToFloat64(ctx, &double_arg, argv[i++]))
+                        goto fail;
+                    dbuf_printf_fun(&dbuf, fmtbuf, double_arg);
+                    break;
+
+                case '%':
+                    dbuf_putc(&dbuf, '%');
+                    break;
+
+                default:
+                    /* XXX: should support an extension mechanism */
+                invalid:
+                    JS_ThrowTypeError(ctx, "invalid conversion specifier in format string");
+                    goto fail;
+                missing:
+                    JS_ThrowReferenceError(ctx, "missing argument for conversion specifier");
+                    goto fail;
+                }
+                break;
+            }
+        }
+        JS_FreeCString(ctx, fmt_str);
+    }
+    if (dbuf.error) {
+        res = JS_ThrowOutOfMemory(ctx);
+    } else {
+        if (fp) {
+            len = fwrite(dbuf.buf, 1, dbuf.size, fp);
+            res = JS_NewInt32(ctx, len);
+        } else {
+            res = JS_NewStringLen(ctx, (char *)dbuf.buf, dbuf.size);
+        }
+    }
+    dbuf_free(&dbuf);
+    return res;
+
+fail:
+    dbuf_free(&dbuf);
+    return JS_EXCEPTION;
+}
+
+uint8_t *js_load_file(JSContext *ctx, size_t *pbuf_len, const char *filename)
+{
+    FILE *f;
+    uint8_t *buf;
+    size_t buf_len;
+
+    f = fopen(filename, "rb");
+    if (!f)
+        return NULL;
+    fseek(f, 0, SEEK_END);
+    buf_len = ftell(f);
+    fseek(f, 0, SEEK_SET);
+    if (ctx)
+        buf = js_malloc(ctx, buf_len + 1);
+    else
+        buf = malloc(buf_len + 1);
+    fread(buf, 1, buf_len, f);
+    buf[buf_len] = '\0';
+    fclose(f);
+    *pbuf_len = buf_len;
+    return buf;
+}
+
+/* load and evaluate a file */
+static JSValue js_loadScript(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv)
+{
+    uint8_t *buf;
+    const char *filename;
+    JSValue ret;
+    size_t buf_len;
+    
+    filename = JS_ToCString(ctx, argv[0]);
+    if (!filename)
+        return JS_EXCEPTION;
+    buf = js_load_file(ctx, &buf_len, filename);
+    if (!buf) {
+        JS_ThrowReferenceError(ctx, "could not load '%s'", filename);
+        JS_FreeCString(ctx, filename);
+        return JS_EXCEPTION;
+    }
+    ret = JS_Eval(ctx, (char *)buf, buf_len, filename,
+                  JS_EVAL_TYPE_GLOBAL | JS_EVAL_FLAG_SHEBANG);
+    js_free(ctx, buf);
+    JS_FreeCString(ctx, filename);
+    return ret;
+}
+
+typedef JSModuleDef *(JSInitModuleFunc)(JSContext *ctx,
+                                        const char *module_name);
+
+
+#if defined(_WIN32)
+static JSModuleDef *js_module_loader_so(JSContext *ctx,
+                                        const char *module_name)
+{
+    JS_ThrowReferenceError(ctx, "shared library modules are not supported yet");
+    return NULL;
+}
+#else
+static JSModuleDef *js_module_loader_so(JSContext *ctx,
+                                        const char *module_name)
+{
+    JSModuleDef *m;
+    void *hd;
+    JSInitModuleFunc *init;
+    char *filename;
+    
+    if (!strchr(module_name, '/')) {
+        /* must add a '/' so that the DLL is not searched in the
+           system library paths */
+        filename = js_malloc(ctx, strlen(module_name) + 2 + 1);
+        if (!filename)
+            return NULL;
+        strcpy(filename, "./");
+        strcpy(filename + 2, module_name);
+    } else {
+        filename = (char *)module_name;
+    }
+    
+    /* C module */
+    hd = dlopen(filename, RTLD_NOW | RTLD_LOCAL);
+    if (filename != module_name)
+        js_free(ctx, filename);
+    if (!hd) {
+        JS_ThrowReferenceError(ctx, "could not load module filename '%s' as shared library",
+                               module_name);
+        goto fail;
+    }
+
+    init = dlsym(hd, "js_init_module");
+    if (!init) {
+        JS_ThrowReferenceError(ctx, "could not load module filename '%s': js_init_module not found",
+                               module_name);
+        goto fail;
+    }
+
+    m = init(ctx, module_name);
+    if (!m) {
+        JS_ThrowReferenceError(ctx, "could not load module filename '%s': initialization error",
+                               module_name);
+    fail:
+        if (hd)
+            dlclose(hd);
+        return NULL;
+    }
+    return m;
+}
+#endif /* !_WIN32 */
+
+JSModuleDef *js_module_loader(JSContext *ctx,
+                              const char *module_name, void *opaque)
+{
+    JSModuleDef *m;
+
+    if (has_suffix(module_name, ".so")) {
+        m = js_module_loader_so(ctx, module_name);
+    } else {
+        size_t buf_len;
+        uint8_t *buf;
+        JSValue func_val;
+    
+        buf = js_load_file(ctx, &buf_len, module_name);
+        if (!buf) {
+            JS_ThrowReferenceError(ctx, "could not load module filename '%s'",
+                                   module_name);
+            return NULL;
+        }
+        
+        /* compile the module */
+        func_val = JS_Eval(ctx, (char *)buf, buf_len, module_name,
+                           JS_EVAL_TYPE_MODULE | JS_EVAL_FLAG_COMPILE_ONLY);
+        js_free(ctx, buf);
+        if (JS_IsException(func_val))
+            return NULL;
+        /* the module is already referenced, so we must free it */
+        m = JS_VALUE_GET_PTR(func_val);
+        JS_FreeValue(ctx, func_val);
+    }
+    return m;
+}
+
+static JSValue js_std_exit(JSContext *ctx, JSValueConst this_val,
+                           int argc, JSValueConst *argv)
+{
+    int status;
+    if (JS_ToInt32(ctx, &status, argv[0]))
+        status = -1;
+    exit(status);
+    return JS_UNDEFINED;
+}
+
+static JSValue js_std_getenv(JSContext *ctx, JSValueConst this_val,
+                           int argc, JSValueConst *argv)
+{
+    const char *name, *str;
+    name = JS_ToCString(ctx, argv[0]);
+    if (!name)
+        return JS_EXCEPTION;
+    str = getenv(name);
+    JS_FreeCString(ctx, name);
+    if (!str)
+        return JS_UNDEFINED;
+    else
+        return JS_NewString(ctx, str);
+}
+
+static JSValue js_std_gc(JSContext *ctx, JSValueConst this_val,
+                         int argc, JSValueConst *argv)
+{
+    JS_RunGC(JS_GetRuntime(ctx));
+    return JS_UNDEFINED;
+}
+
+static int interrupt_handler(JSRuntime *rt, void *opaque)
+{
+    return (os_pending_signals >> SIGINT) & 1;
+}
+
+static JSValue js_evalScript(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv)
+{
+    const char *str;
+    int len;
+    JSValue ret;
+    str = JS_ToCStringLen(ctx, &len, argv[0], FALSE);
+    if (!str)
+        return JS_EXCEPTION;
+    if (++eval_script_recurse == 1) {
+        /* install the interrupt handler */
+        JS_SetInterruptHandler(JS_GetRuntime(ctx), interrupt_handler, NULL);
+    }
+    ret = JS_Eval(ctx, str, len, "<evalScript>", JS_EVAL_TYPE_GLOBAL);
+    if (--eval_script_recurse == 0) {
+        /* remove the interrupt handler */
+        JS_SetInterruptHandler(JS_GetRuntime(ctx), NULL, NULL);
+        os_pending_signals &= ~((uint64_t)1 << SIGINT);
+        /* convert the uncatchable "interrupted" error into a normal error
+           so that it can be caught by the REPL */
+        if (JS_IsException(ret))
+            JS_ResetUncatchableError(ctx);
+    }
+    return ret;
+}
+
+static JSClassID js_std_file_class_id;
+
+typedef struct {
+    FILE *f;
+    BOOL close_in_finalizer;
+} JSSTDFile;
+
+static void js_std_file_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSSTDFile *s = JS_GetOpaque(val, js_std_file_class_id);
+    if (s) {
+        if (s->f && s->close_in_finalizer)
+            fclose(s->f);
+        js_free_rt(rt, s);
+    }
+}
+
+static JSValue js_new_std_error(JSContext *ctx, int err)
+{
+    JSValue obj;
+    /* XXX: could add a specific Error prototype */
+    obj = JS_NewError(ctx);
+    JS_DefinePropertyValueStr(ctx, obj, "message",
+                              JS_NewString(ctx, strerror(err)),
+                              JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+    JS_DefinePropertyValueStr(ctx, obj, "errno",
+                              JS_NewInt32(ctx, err),
+                              JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+    return obj;
+}
+
+static JSValue js_std_error_constructor(JSContext *ctx, JSValueConst new_target,
+                                        int argc, JSValueConst *argv)
+{
+    int err;
+    if (JS_ToInt32(ctx, &err, argv[0]))
+        return JS_EXCEPTION;
+    return js_new_std_error(ctx, err);
+}
+
+static JSValue js_std_error_strerror(JSContext *ctx, JSValueConst this_val,
+                                     int argc, JSValueConst *argv)
+{
+    int err;
+    if (JS_ToInt32(ctx, &err, argv[0]))
+        return JS_EXCEPTION;
+    return JS_NewString(ctx, strerror(err));
+}
+
+static JSValue js_std_throw_errno(JSContext *ctx, int err)
+{
+    JSValue obj;
+    obj = js_new_std_error(ctx, err);
+    if (JS_IsException(obj))
+        obj = JS_NULL;
+    return JS_Throw(ctx, obj);
+}
+
+static JSValue js_new_std_file(JSContext *ctx, FILE *f, BOOL close_in_finalizer)
+{
+    JSSTDFile *s;
+    JSValue obj;
+    obj = JS_NewObjectClass(ctx, js_std_file_class_id);
+    if (JS_IsException(obj))
+        return obj;
+    s = js_mallocz(ctx, sizeof(*s));
+    if (!s) {
+        JS_FreeValue(ctx, obj);
+        return JS_EXCEPTION;
+    }
+    s->close_in_finalizer = close_in_finalizer;
+    s->f = f;
+    JS_SetOpaque(obj, s);
+    return obj;
+}
+
+static JSValue js_std_open(JSContext *ctx, JSValueConst this_val,
+                           int argc, JSValueConst *argv)
+{
+    const char *filename, *mode = NULL;
+    FILE *f;
+
+    filename = JS_ToCString(ctx, argv[0]);
+    if (!filename)
+        goto fail;
+    mode = JS_ToCString(ctx, argv[1]);
+    if (!mode)
+        goto fail;
+    if (mode[strspn(mode, "rwa+b")] != '\0') {
+        js_std_throw_errno(ctx, EINVAL);
+        goto fail;
+    }
+
+    f = fopen(filename, mode);
+    JS_FreeCString(ctx, filename);
+    JS_FreeCString(ctx, mode);
+    if (!f)
+        return js_std_throw_errno(ctx, errno);
+    return js_new_std_file(ctx, f, TRUE);
+ fail:
+    JS_FreeCString(ctx, filename);
+    JS_FreeCString(ctx, mode);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_std_tmpfile(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv)
+{
+    FILE *f;
+    f = tmpfile();
+    if (!f)
+        return js_std_throw_errno(ctx, errno);
+    return js_new_std_file(ctx, f, TRUE);
+}
+
+static JSValue js_std_sprintf(JSContext *ctx, JSValueConst this_val,
+                          int argc, JSValueConst *argv)
+{
+    return js_printf_internal(ctx, argc, argv, NULL);
+}
+
+static JSValue js_std_printf(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv)
+{
+    return js_printf_internal(ctx, argc, argv, stdout);
+}
+
+static FILE *js_std_file_get(JSContext *ctx, JSValueConst obj)
+{
+    JSSTDFile *s = JS_GetOpaque2(ctx, obj, js_std_file_class_id);
+    if (!s)
+        return NULL;
+    if (!s->f) {
+        js_std_throw_errno(ctx, EBADF);
+        return NULL;
+    }
+    return s->f;
+}
+
+static JSValue js_std_file_puts(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv, int magic)
+{
+    FILE *f;
+    int i;
+    const char *str;
+
+    if (magic == 0) {
+        f = stdout;
+    } else {
+        f = js_std_file_get(ctx, this_val);
+        if (!f)
+            return JS_EXCEPTION;
+    }
+    
+    for(i = 0; i < argc; i++) {
+        str = JS_ToCString(ctx, argv[i]);
+        if (!str)
+            return JS_EXCEPTION;
+        fputs(str, f);
+        JS_FreeCString(ctx, str);
+    }
+    return JS_UNDEFINED;
+}
+
+static JSValue js_std_file_close(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv)
+{
+    JSSTDFile *s = JS_GetOpaque2(ctx, this_val, js_std_file_class_id);
+    if (!s)
+        return JS_EXCEPTION;
+    if (!s->f)
+        return js_std_throw_errno(ctx, EBADF);
+    fclose(s->f);
+    s->f = NULL;
+    return JS_UNDEFINED;
+}
+
+static JSValue js_std_file_printf(JSContext *ctx, JSValueConst this_val,
+                                  int argc, JSValueConst *argv)
+{
+    FILE *f = js_std_file_get(ctx, this_val);
+    if (!f)
+        return JS_EXCEPTION;
+    return js_printf_internal(ctx, argc, argv, f);
+}
+
+static JSValue js_std_file_flush(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv)
+{
+    FILE *f = js_std_file_get(ctx, this_val);
+    if (!f)
+        return JS_EXCEPTION;
+    fflush(f);
+    return JS_UNDEFINED;
+}
+
+static JSValue js_std_file_tell(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    FILE *f = js_std_file_get(ctx, this_val);
+    int64_t pos;
+    if (!f)
+        return JS_EXCEPTION;
+#if defined(__linux__)
+    pos = ftello(f);
+#else
+    pos = ftell(f);
+#endif
+    return JS_NewInt64(ctx, pos);
+}
+
+static JSValue js_std_file_seek(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    FILE *f = js_std_file_get(ctx, this_val);
+    int64_t pos;
+    int whence, ret;
+    if (!f)
+        return JS_EXCEPTION;
+    if (JS_ToInt64(ctx, &pos, argv[0]))
+        return JS_EXCEPTION;
+    if (JS_ToInt32(ctx, &whence, argv[1]))
+        return JS_EXCEPTION;
+#if defined(__linux__)
+    ret = fseeko(f, pos, whence);
+#else
+    ret = fseek(f, pos, whence);
+#endif
+    if (ret < 0)
+        return js_std_throw_errno(ctx, EBADF);
+    return JS_UNDEFINED;
+}
+
+static JSValue js_std_file_eof(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv)
+{
+    FILE *f = js_std_file_get(ctx, this_val);
+    if (!f)
+        return JS_EXCEPTION;
+    return JS_NewBool(ctx, feof(f));
+}
+
+static JSValue js_std_file_fileno(JSContext *ctx, JSValueConst this_val,
+                                  int argc, JSValueConst *argv)
+{
+    FILE *f = js_std_file_get(ctx, this_val);
+    if (!f)
+        return JS_EXCEPTION;
+    return JS_NewInt32(ctx, fileno(f));
+}
+
+static JSValue js_std_file_read_write(JSContext *ctx, JSValueConst this_val,
+                                      int argc, JSValueConst *argv, int magic)
+{
+    FILE *f = js_std_file_get(ctx, this_val);
+    uint64_t pos, len;
+    size_t size, ret;
+    uint8_t *buf;
+    
+    if (!f)
+        return JS_EXCEPTION;
+    if (JS_ToIndex(ctx, &pos, argv[1]))
+        return JS_EXCEPTION;
+    if (JS_ToIndex(ctx, &len, argv[2]))
+        return JS_EXCEPTION;
+    buf = JS_GetArrayBuffer(ctx, &size, argv[0]);
+    if (!buf)
+        return JS_EXCEPTION;
+    if (pos + len > size)
+        return JS_ThrowRangeError(ctx, "read/write array buffer overflow");
+    if (magic)
+        ret = fwrite(buf + pos, 1, len, f);
+    else
+        ret = fread(buf + pos, 1, len, f);
+    return JS_NewInt64(ctx, ret);
+}
+
+/* XXX: could use less memory and go faster */
+static JSValue js_std_file_getline(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv)
+{
+    FILE *f = js_std_file_get(ctx, this_val);
+    int c;
+    DynBuf dbuf;
+    JSValue obj;
+    
+    if (!f)
+        return JS_EXCEPTION;
+
+    js_std_dbuf_init(ctx, &dbuf);
+    for(;;) {
+        c = fgetc(f);
+        if (c == EOF) {
+            if (dbuf.size == 0) {
+                /* EOF */
+                dbuf_free(&dbuf);
+                return JS_NULL;
+            } else {
+                break;
+            }
+        }
+        if (c == '\n')
+            break;
+        if (dbuf_putc(&dbuf, c)) {
+            dbuf_free(&dbuf);
+            return JS_ThrowOutOfMemory(ctx);
+        }
+    }
+    obj = JS_NewStringLen(ctx, (const char *)dbuf.buf, dbuf.size);
+    dbuf_free(&dbuf);
+    return obj;
+}
+
+/* XXX: could use less memory and go faster */
+static JSValue js_std_file_readAsString(JSContext *ctx, JSValueConst this_val,
+                                        int argc, JSValueConst *argv)
+{
+    FILE *f = js_std_file_get(ctx, this_val);
+    int c;
+    DynBuf dbuf;
+    JSValue obj;
+    uint64_t max_size64;
+    size_t max_size;
+    JSValueConst max_size_val;
+    
+    if (!f)
+        return JS_EXCEPTION;
+
+    if (argc >= 1)
+        max_size_val = argv[0];
+    else
+        max_size_val = JS_UNDEFINED;
+    max_size = (size_t)-1;
+    if (!JS_IsUndefined(max_size_val)) {
+        if (JS_ToIndex(ctx, &max_size64, max_size_val))
+            return JS_EXCEPTION;
+        if (max_size64 < max_size)
+            max_size = max_size64;
+    }
+
+    js_std_dbuf_init(ctx, &dbuf);
+    while (max_size != 0) {
+        c = fgetc(f);
+        if (c == EOF)
+            break;
+        if (dbuf_putc(&dbuf, c)) {
+            dbuf_free(&dbuf);
+            return JS_EXCEPTION;
+        }
+        max_size--;
+    }
+    obj = JS_NewStringLen(ctx, (const char *)dbuf.buf, dbuf.size);
+    dbuf_free(&dbuf);
+    return obj;
+}
+
+static JSValue js_std_file_getByte(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv)
+{
+    FILE *f = js_std_file_get(ctx, this_val);
+    if (!f)
+        return JS_EXCEPTION;
+    return JS_NewInt32(ctx, fgetc(f));
+}
+
+static JSValue js_std_file_putByte(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv)
+{
+    FILE *f = js_std_file_get(ctx, this_val);
+    int c;
+    if (!f)
+        return JS_EXCEPTION;
+    if (JS_ToInt32(ctx, &c, argv[0]))
+        return JS_EXCEPTION;
+    c = fputc(c, f);
+    return JS_NewInt32(ctx, c);
+}
+
+static JSClassDef js_std_file_class = {
+    "FILE",
+    .finalizer = js_std_file_finalizer,
+}; 
+
+static const JSCFunctionListEntry js_std_funcs[] = {
+    JS_CFUNC_DEF("exit", 1, js_std_exit ),
+    JS_CFUNC_DEF("gc", 0, js_std_gc ),
+    JS_CFUNC_DEF("evalScript", 1, js_evalScript ),
+    JS_CFUNC_DEF("loadScript", 1, js_loadScript ),
+    JS_CFUNC_DEF("getenv", 1, js_std_getenv ),
+
+    /* FILE I/O */
+    JS_CFUNC_DEF("open", 2, js_std_open ),
+    JS_CFUNC_DEF("tmpfile", 0, js_std_tmpfile ),
+    JS_CFUNC_MAGIC_DEF("puts", 1, js_std_file_puts, 0 ),
+    JS_CFUNC_DEF("printf", 1, js_std_printf ),
+    JS_CFUNC_DEF("sprintf", 1, js_std_sprintf ),
+    JS_PROP_INT32_DEF("SEEK_SET", SEEK_SET, JS_PROP_CONFIGURABLE ),
+    JS_PROP_INT32_DEF("SEEK_CUR", SEEK_CUR, JS_PROP_CONFIGURABLE ),
+    JS_PROP_INT32_DEF("SEEK_END", SEEK_END, JS_PROP_CONFIGURABLE ),
+
+    /* setenv, ... */
+};
+
+static const JSCFunctionListEntry js_std_error_funcs[] = {
+    JS_CFUNC_DEF("strerror", 1, js_std_error_strerror ),
+    /* various errno values */
+#define DEF(x) JS_PROP_INT32_DEF(#x, x, JS_PROP_CONFIGURABLE )
+    DEF(EINVAL),
+    DEF(EIO),
+    DEF(EACCES),
+    DEF(EEXIST),
+    DEF(ENOSPC),
+    DEF(ENOSYS),
+    DEF(EBUSY),
+    DEF(ENOENT),
+    DEF(EPERM),
+    DEF(EPIPE),
+    DEF(EBADF),
+#undef DEF
+};
+
+static const JSCFunctionListEntry js_std_file_proto_funcs[] = {
+    JS_CFUNC_DEF("close", 0, js_std_file_close ),
+    JS_CFUNC_MAGIC_DEF("puts", 1, js_std_file_puts, 1 ),
+    JS_CFUNC_DEF("printf", 1, js_std_file_printf ),
+    JS_CFUNC_DEF("flush", 0, js_std_file_flush ),
+    JS_CFUNC_DEF("tell", 0, js_std_file_tell ),
+    JS_CFUNC_DEF("seek", 2, js_std_file_seek ),
+    JS_CFUNC_DEF("eof", 0, js_std_file_eof ),
+    JS_CFUNC_DEF("fileno", 0, js_std_file_fileno ),
+    JS_CFUNC_MAGIC_DEF("read", 3, js_std_file_read_write, 0 ),
+    JS_CFUNC_MAGIC_DEF("write", 3, js_std_file_read_write, 1 ),
+    JS_CFUNC_DEF("getline", 0, js_std_file_getline ),
+    JS_CFUNC_DEF("readAsString", 0, js_std_file_readAsString ),
+    JS_CFUNC_DEF("getByte", 0, js_std_file_getByte ),
+    JS_CFUNC_DEF("putByte", 1, js_std_file_putByte ),
+    /* setvbuf, ferror, clearerr, ...  */
+};
+
+static int js_std_init(JSContext *ctx, JSModuleDef *m)
+{
+    JSValue proto, obj;
+    
+    /* FILE class */
+    /* the class ID is created once */
+    JS_NewClassID(&js_std_file_class_id);
+    /* the class is created once per runtime */
+    JS_NewClass(JS_GetRuntime(ctx), js_std_file_class_id, &js_std_file_class);
+    proto = JS_NewObject(ctx);
+    JS_SetPropertyFunctionList(ctx, proto, js_std_file_proto_funcs,
+                               countof(js_std_file_proto_funcs));
+    JS_SetClassProto(ctx, js_std_file_class_id, proto);
+
+    JS_SetModuleExportList(ctx, m, js_std_funcs,
+                           countof(js_std_funcs));
+    JS_SetModuleExport(ctx, m, "in", js_new_std_file(ctx, stdin, FALSE));
+    JS_SetModuleExport(ctx, m, "out", js_new_std_file(ctx, stdout, FALSE));
+    JS_SetModuleExport(ctx, m, "err", js_new_std_file(ctx, stderr, FALSE));
+    
+    obj = JS_NewCFunction2(ctx, js_std_error_constructor,
+                           "Error", 1, JS_CFUNC_constructor, 0);
+    JS_SetPropertyFunctionList(ctx, obj, js_std_error_funcs,
+                               countof(js_std_error_funcs));
+    JS_SetModuleExport(ctx, m, "Error", obj);
+
+    /* global object */
+    JS_SetModuleExport(ctx, m, "global", JS_GetGlobalObject(ctx));
+    return 0;
+}
+
+JSModuleDef *js_init_module_std(JSContext *ctx, const char *module_name)
+{
+    JSModuleDef *m;
+    m = JS_NewCModule(ctx, module_name, js_std_init);
+    if (!m)
+        return NULL;
+    JS_AddModuleExportList(ctx, m, js_std_funcs, countof(js_std_funcs));
+    JS_AddModuleExport(ctx, m, "in");
+    JS_AddModuleExport(ctx, m, "out");
+    JS_AddModuleExport(ctx, m, "err");
+    JS_AddModuleExport(ctx, m, "global");
+    JS_AddModuleExport(ctx, m, "Error");
+    return m;
+}
+
+/**********************************************************/
+/* 'os' object */
+
+static JSValue js_os_return(JSContext *ctx, ssize_t ret)
+{
+    if (ret < 0)
+        ret = -errno;
+    return JS_NewInt64(ctx, ret);
+}
+
+static JSValue js_os_open(JSContext *ctx, JSValueConst this_val,
+                          int argc, JSValueConst *argv)
+{
+    const char *filename;
+    int flags, mode, ret;
+
+    filename = JS_ToCString(ctx, argv[0]);
+    if (!filename)
+        return JS_EXCEPTION;
+    if (JS_ToInt32(ctx, &flags, argv[1]))
+        goto fail;
+    if (argc >= 3 && !JS_IsUndefined(argv[2])) {
+        if (JS_ToInt32(ctx, &mode, argv[2])) {
+        fail:
+            JS_FreeCString(ctx, filename);
+            return JS_EXCEPTION;
+        }
+    } else {
+        mode = 0666;
+    }
+#if defined(_WIN32)
+    /* force binary mode by default */
+    if (!(flags & O_TEXT))
+        flags |= O_BINARY;
+#endif
+    ret = open(filename, flags, mode);
+    JS_FreeCString(ctx, filename);
+    return js_os_return(ctx, ret);
+}
+
+static JSValue js_os_close(JSContext *ctx, JSValueConst this_val,
+                           int argc, JSValueConst *argv)
+{
+    int fd, ret;
+    if (JS_ToInt32(ctx, &fd, argv[0]))
+        return JS_EXCEPTION;
+    ret = close(fd);
+    return js_os_return(ctx, ret);
+}
+
+static JSValue js_os_seek(JSContext *ctx, JSValueConst this_val,
+                          int argc, JSValueConst *argv)
+{
+    int fd, whence, ret;
+    int64_t pos;
+    
+    if (JS_ToInt32(ctx, &fd, argv[0]))
+        return JS_EXCEPTION;
+    if (JS_ToInt64(ctx, &pos, argv[1]))
+        return JS_EXCEPTION;
+    if (JS_ToInt32(ctx, &whence, argv[2]))
+        return JS_EXCEPTION;
+    ret = lseek(fd, pos, whence);
+    return js_os_return(ctx, ret);
+}
+
+static JSValue js_os_read_write(JSContext *ctx, JSValueConst this_val,
+                                      int argc, JSValueConst *argv, int magic)
+{
+    int fd;
+    uint64_t pos, len;
+    size_t size;
+    ssize_t ret;
+    uint8_t *buf;
+    
+    if (JS_ToInt32(ctx, &fd, argv[0]))
+        return JS_EXCEPTION;
+    if (JS_ToIndex(ctx, &pos, argv[2]))
+        return JS_EXCEPTION;
+    if (JS_ToIndex(ctx, &len, argv[3]))
+        return JS_EXCEPTION;
+    buf = JS_GetArrayBuffer(ctx, &size, argv[1]);
+    if (!buf)
+        return JS_EXCEPTION;
+    if (pos + len > size)
+        return JS_ThrowRangeError(ctx, "read/write array buffer overflow");
+    if (magic)
+        ret = write(fd, buf + pos, len);
+    else
+        ret = read(fd, buf + pos, len);
+    return js_os_return(ctx, ret);
+}
+
+static JSValue js_os_isatty(JSContext *ctx, JSValueConst this_val,
+                            int argc, JSValueConst *argv)
+{
+    int fd;
+    if (JS_ToInt32(ctx, &fd, argv[0]))
+        return JS_EXCEPTION;
+    return JS_NewBool(ctx, isatty(fd) == 1);
+}
+
+#if defined(_WIN32)
+static JSValue js_os_ttyGetWinSize(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv)
+{
+    int fd;
+    HANDLE handle;
+    CONSOLE_SCREEN_BUFFER_INFO info;
+    JSValue obj;
+
+    if (JS_ToInt32(ctx, &fd, argv[0]))
+        return JS_EXCEPTION;
+    handle = (HANDLE)_get_osfhandle(fd);
+    
+    if (!GetConsoleScreenBufferInfo(handle, &info))
+        return JS_NULL;
+    obj = JS_NewArray(ctx);
+    if (JS_IsException(obj))
+        return obj;
+    JS_DefinePropertyValueUint32(ctx, obj, 0, JS_NewInt32(ctx, info.dwSize.X), JS_PROP_C_W_E);
+    JS_DefinePropertyValueUint32(ctx, obj, 1, JS_NewInt32(ctx, info.dwSize.Y), JS_PROP_C_W_E);
+    return obj;
+}
+
+static JSValue js_os_ttySetRaw(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv)
+{
+    int fd;
+    HANDLE handle;
+
+    if (JS_ToInt32(ctx, &fd, argv[0]))
+        return JS_EXCEPTION;
+    handle = (HANDLE)_get_osfhandle(fd);
+    
+    SetConsoleMode(handle, ENABLE_WINDOW_INPUT);
+    return JS_UNDEFINED;
+}
+#else
+static JSValue js_os_ttyGetWinSize(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv)
+{
+    int fd;
+    struct winsize ws;
+    JSValue obj;
+    
+    if (JS_ToInt32(ctx, &fd, argv[0]))
+        return JS_EXCEPTION;
+    if (ioctl(fd, TIOCGWINSZ, &ws) == 0 &&
+        ws.ws_col >= 4 && ws.ws_row >= 4) {
+        obj = JS_NewArray(ctx);
+        if (JS_IsException(obj))
+            return obj;
+        JS_DefinePropertyValueUint32(ctx, obj, 0, JS_NewInt32(ctx, ws.ws_col), JS_PROP_C_W_E);
+        JS_DefinePropertyValueUint32(ctx, obj, 1, JS_NewInt32(ctx, ws.ws_row), JS_PROP_C_W_E);
+        return obj;
+    } else {
+        return JS_NULL;
+    }
+}
+
+static struct termios oldtty;
+
+static void term_exit(void)
+{
+    tcsetattr(0, TCSANOW, &oldtty);
+}
+
+/* XXX: should add a way to go back to normal mode */
+static JSValue js_os_ttySetRaw(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv)
+{
+    struct termios tty;
+    int fd;
+    
+    if (JS_ToInt32(ctx, &fd, argv[0]))
+        return JS_EXCEPTION;
+    
+    memset(&tty, 0, sizeof(tty));
+    tcgetattr(fd, &tty);
+    oldtty = tty;
+
+    tty.c_iflag &= ~(IGNBRK|BRKINT|PARMRK|ISTRIP
+                          |INLCR|IGNCR|ICRNL|IXON);
+    tty.c_oflag |= OPOST;
+    tty.c_lflag &= ~(ECHO|ECHONL|ICANON|IEXTEN);
+    tty.c_cflag &= ~(CSIZE|PARENB);
+    tty.c_cflag |= CS8;
+    tty.c_cc[VMIN] = 1;
+    tty.c_cc[VTIME] = 0;
+
+    tcsetattr(fd, TCSANOW, &tty);
+
+    atexit(term_exit);
+    return JS_UNDEFINED;
+}
+
+#endif /* !_WIN32 */
+
+static JSValue js_os_remove(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv)
+{
+    const char *filename;
+    int ret;
+    
+    filename = JS_ToCString(ctx, argv[0]);
+    if (!filename)
+        return JS_EXCEPTION;
+    ret = remove(filename);
+    JS_FreeCString(ctx, filename);
+    return js_os_return(ctx, ret);
+}
+
+static JSValue js_os_rename(JSContext *ctx, JSValueConst this_val,
+                            int argc, JSValueConst *argv)
+{
+    const char *oldpath, *newpath;
+    int ret;
+    
+    oldpath = JS_ToCString(ctx, argv[0]);
+    if (!oldpath)
+        return JS_EXCEPTION;
+    newpath = JS_ToCString(ctx, argv[1]);
+    if (!newpath) {
+        JS_FreeCString(ctx, oldpath);
+        return JS_EXCEPTION;
+    }
+    ret = rename(oldpath, newpath);
+    JS_FreeCString(ctx, oldpath);
+    JS_FreeCString(ctx, newpath);
+    return js_os_return(ctx, ret);
+}
+
+static JSOSRWHandler *find_rh(int fd)
+{
+    JSOSRWHandler *rh;
+    struct list_head *el;
+    list_for_each(el, &os_rw_handlers) {
+        rh = list_entry(el, JSOSRWHandler, link);
+        if (rh->fd == fd)
+            return rh;
+    }
+    return NULL;
+}
+
+static void free_rw_handler(JSRuntime *rt, JSOSRWHandler *rh)
+{
+    int i;
+    list_del(&rh->link);
+    for(i = 0; i < 2; i++) {
+        JS_FreeValueRT(rt, rh->rw_func[i]);
+    }
+    js_free_rt(rt, rh);
+}
+
+static JSValue js_os_setReadHandler(JSContext *ctx, JSValueConst this_val,
+                                    int argc, JSValueConst *argv, int magic)
+{
+    JSOSRWHandler *rh;
+    int fd;
+    JSValueConst func;
+    
+    if (JS_ToInt32(ctx, &fd, argv[0]))
+        return JS_EXCEPTION;
+    func = argv[1];
+    if (JS_IsNull(func)) {
+        rh = find_rh(fd);
+        if (rh) {
+            JS_FreeValue(ctx, rh->rw_func[magic]);
+            rh->rw_func[magic] = JS_NULL;
+            if (JS_IsNull(rh->rw_func[0]) &&
+                JS_IsNull(rh->rw_func[1])) {
+                /* remove the entry */
+                free_rw_handler(JS_GetRuntime(ctx), rh);
+            }
+        }
+    } else {
+        if (!JS_IsFunction(ctx, func))
+            return JS_ThrowTypeError(ctx, "not a function");
+        rh = find_rh(fd);
+        if (!rh) {
+            rh = js_mallocz(ctx, sizeof(*rh));
+            if (!rh)
+                return JS_EXCEPTION;
+            rh->fd = fd;
+            rh->rw_func[0] = JS_NULL;
+            rh->rw_func[1] = JS_NULL;
+            list_add_tail(&rh->link, &os_rw_handlers);
+        }
+        JS_FreeValue(ctx, rh->rw_func[magic]);
+        rh->rw_func[magic] = JS_DupValue(ctx, func);
+    }
+    return JS_UNDEFINED;
+}
+
+static JSOSSignalHandler *find_sh(int sig_num)
+{
+    JSOSSignalHandler *sh;
+    struct list_head *el;
+    list_for_each(el, &os_signal_handlers) {
+        sh = list_entry(el, JSOSSignalHandler, link);
+        if (sh->sig_num == sig_num)
+            return sh;
+    }
+    return NULL;
+}
+
+static void free_sh(JSRuntime *rt, JSOSSignalHandler *sh)
+{
+    list_del(&sh->link);
+    JS_FreeValueRT(rt, sh->func);
+    js_free_rt(rt, sh);
+}
+
+static void os_signal_handler(int sig_num)
+{
+    os_pending_signals |= ((uint64_t)1 << sig_num);
+}
+
+#if defined(_WIN32)
+typedef void (*sighandler_t)(int sig_num);
+#endif
+
+static JSValue js_os_signal(JSContext *ctx, JSValueConst this_val,
+                            int argc, JSValueConst *argv)
+{
+    JSOSSignalHandler *sh;
+    uint32_t sig_num;
+    JSValueConst func;
+    sighandler_t handler;
+    
+    if (JS_ToUint32(ctx, &sig_num, argv[0]))
+        return JS_EXCEPTION;
+    if (sig_num >= 64)
+        return JS_ThrowRangeError(ctx, "invalid signal number");
+    func = argv[1];
+    /* func = null: SIG_DFL, func = undefined, SIG_IGN */
+    if (JS_IsNull(func) || JS_IsUndefined(func)) {
+        sh = find_sh(sig_num);
+        if (sh) {
+            free_sh(JS_GetRuntime(ctx), sh);
+        }
+        if (JS_IsNull(func))
+            handler = SIG_DFL;
+        else
+            handler = SIG_IGN;
+        signal(sig_num, handler);
+    } else {
+        if (!JS_IsFunction(ctx, func))
+            return JS_ThrowTypeError(ctx, "not a function");
+        sh = find_sh(sig_num);
+        if (!sh) {
+            sh = js_mallocz(ctx, sizeof(*sh));
+            if (!sh)
+                return JS_EXCEPTION;
+            sh->sig_num = sig_num;
+            list_add_tail(&sh->link, &os_signal_handlers);
+        }
+        JS_FreeValue(ctx, sh->func);
+        sh->func = JS_DupValue(ctx, func);
+        signal(sig_num, os_signal_handler);
+    }
+    return JS_UNDEFINED;
+}
+
+#if defined(__linux__) || defined(__APPLE__)
+static int64_t get_time_ms(void)
+{
+    struct timespec ts;
+    clock_gettime(CLOCK_MONOTONIC, &ts);
+    return (uint64_t)ts.tv_sec * 1000 + (ts.tv_nsec / 1000000);
+}
+#else
+/* more portable, but does not work if the date is updated */
+static int64_t get_time_ms(void)
+{
+    struct timeval tv;
+    gettimeofday(&tv, NULL);
+    return (int64_t)tv.tv_sec * 1000 + (tv.tv_usec / 1000);
+}
+#endif
+
+static void unlink_timer(JSRuntime *rt, JSOSTimer *th)
+{
+    if (th->link.prev) {
+        list_del(&th->link);
+        th->link.prev = th->link.next = NULL;
+    }
+}
+
+static void free_timer(JSRuntime *rt, JSOSTimer *th)
+{
+    JS_FreeValueRT(rt, th->func);
+    js_free_rt(rt, th);
+}
+
+static JSClassID js_os_timer_class_id;
+
+static void js_os_timer_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSOSTimer *th = JS_GetOpaque(val, js_os_timer_class_id);
+    if (th) {
+        th->has_object = FALSE;
+        if (!th->link.prev)
+            free_timer(rt, th);
+    }
+}
+
+static void js_os_timer_mark(JSRuntime *rt, JSValueConst val,
+                             JS_MarkFunc *mark_func)
+{
+    JSOSTimer *th = JS_GetOpaque(val, js_os_timer_class_id);
+    if (th) {
+        JS_MarkValue(rt, th->func, mark_func);
+    }
+}
+
+static JSValue js_os_setTimeout(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    int64_t delay;
+    JSValueConst func;
+    JSOSTimer *th;
+    JSValue obj;
+
+    if (JS_ToInt64(ctx, &delay, argv[0]))
+        return JS_EXCEPTION;
+    func = argv[1];
+    if (!JS_IsFunction(ctx, func))
+        return JS_ThrowTypeError(ctx, "not a function");
+    obj = JS_NewObjectClass(ctx, js_os_timer_class_id);
+    if (JS_IsException(obj))
+        return obj;
+    th = js_mallocz(ctx, sizeof(*th));
+    th->has_object = TRUE;
+    if (!th) {
+        JS_FreeValue(ctx, obj);
+        return JS_EXCEPTION;
+    }
+    th->timeout = get_time_ms() + delay;
+    th->func = JS_DupValue(ctx, func);
+    list_add_tail(&th->link, &os_timers);
+    JS_SetOpaque(obj, th);
+    return obj;
+}
+
+static JSValue js_os_clearTimeout(JSContext *ctx, JSValueConst this_val,
+                                  int argc, JSValueConst *argv)
+{
+    JSOSTimer *th = JS_GetOpaque2(ctx, argv[0], js_os_timer_class_id);
+    if (!th)
+        return JS_EXCEPTION;
+    unlink_timer(JS_GetRuntime(ctx), th);
+    return JS_UNDEFINED;
+}
+
+static JSClassDef js_os_timer_class = {
+    "OSTimer",
+    .finalizer = js_os_timer_finalizer,
+    .gc_mark = js_os_timer_mark,
+}; 
+
+static void call_handler(JSContext *ctx, JSValueConst func)
+{
+    JSValue ret;
+    ret = JS_Call(ctx, func, JS_UNDEFINED, 0, NULL);
+    if (JS_IsException(ret))
+        js_std_dump_error(ctx);
+    JS_FreeValue(ctx, ret);
+}
+
+#if defined(_WIN32)
+
+static int js_os_poll(JSContext *ctx)
+{
+    int min_delay, console_fd;
+    int64_t cur_time, delay;
+    JSOSRWHandler *rh;
+    struct list_head *el;
+    
+    /* XXX: handle signals if useful */
+
+    if (list_empty(&os_rw_handlers) && list_empty(&os_timers))
+        return -1; /* no more events */
+    
+    /* XXX: only timers and basic console input are supported */
+    if (!list_empty(&os_timers)) {
+        cur_time = get_time_ms();
+        min_delay = 10000;
+        list_for_each(el, &os_timers) {
+            JSOSTimer *th = list_entry(el, JSOSTimer, link);
+            delay = th->timeout - cur_time;
+            if (delay <= 0) {
+                JSValue func;
+                /* the timer expired */
+                func = th->func;
+                th->func = JS_UNDEFINED;
+                unlink_timer(JS_GetRuntime(ctx), th);
+                if (!th->has_object)
+                    free_timer(JS_GetRuntime(ctx), th);
+                call_handler(ctx, func);
+                JS_FreeValue(ctx, func);
+                return 0;
+            } else if (delay < min_delay) {
+                min_delay = delay;
+            }
+        }
+    } else {
+        min_delay = -1;
+    }
+
+    console_fd = -1;
+    list_for_each(el, &os_rw_handlers) {
+        rh = list_entry(el, JSOSRWHandler, link);
+        if (rh->fd == 0 && !JS_IsNull(rh->rw_func[0])) {
+            console_fd = rh->fd;
+            break;
+        }
+    }
+
+    if (console_fd >= 0) {
+        DWORD ti, ret;
+        HANDLE handle;
+        if (min_delay == -1)
+            ti = INFINITE;
+        else
+            ti = min_delay;
+        handle = (HANDLE)_get_osfhandle(console_fd);
+        ret = WaitForSingleObject(handle, ti);
+        if (ret == WAIT_OBJECT_0) {
+            list_for_each(el, &os_rw_handlers) {
+                rh = list_entry(el, JSOSRWHandler, link);
+                if (rh->fd == console_fd && !JS_IsNull(rh->rw_func[0])) {
+                    call_handler(ctx, rh->rw_func[0]);
+                    /* must stop because the list may have been modified */
+                    break;
+                }
+            }
+        }
+    } else {
+        Sleep(min_delay);
+    }
+    return 0;
+}
+#else
+static int js_os_poll(JSContext *ctx)
+{
+    int ret, fd_max, min_delay;
+    int64_t cur_time, delay;
+    fd_set rfds, wfds;
+    JSOSRWHandler *rh;
+    struct list_head *el;
+    struct timeval tv, *tvp;
+
+    if (unlikely(os_pending_signals != 0)) {
+        JSOSSignalHandler *sh;
+        uint64_t mask;
+        
+        list_for_each(el, &os_signal_handlers) {
+            sh = list_entry(el, JSOSSignalHandler, link);
+            mask = (uint64_t)1 << sh->sig_num;
+            if (os_pending_signals & mask) {
+                os_pending_signals &= ~mask;
+                call_handler(ctx, sh->func);
+                return 0;
+            }
+        }
+    }
+    
+    if (list_empty(&os_rw_handlers) && list_empty(&os_timers))
+        return -1; /* no more events */
+    
+    if (!list_empty(&os_timers)) {
+        cur_time = get_time_ms();
+        min_delay = 10000;
+        list_for_each(el, &os_timers) {
+            JSOSTimer *th = list_entry(el, JSOSTimer, link);
+            delay = th->timeout - cur_time;
+            if (delay <= 0) {
+                JSValue func;
+                /* the timer expired */
+                func = th->func;
+                th->func = JS_UNDEFINED;
+                unlink_timer(JS_GetRuntime(ctx), th);
+                if (!th->has_object)
+                    free_timer(JS_GetRuntime(ctx), th);
+                call_handler(ctx, func);
+                JS_FreeValue(ctx, func);
+                return 0;
+            } else if (delay < min_delay) {
+                min_delay = delay;
+            }
+        }
+        tv.tv_sec = min_delay / 1000;
+        tv.tv_usec = (min_delay % 1000) * 1000;
+        tvp = &tv;
+    } else {
+        tvp = NULL;
+    }
+    
+    FD_ZERO(&rfds);
+    FD_ZERO(&wfds);
+    fd_max = -1;
+    list_for_each(el, &os_rw_handlers) {
+        rh = list_entry(el, JSOSRWHandler, link);
+        fd_max = max_int(fd_max, rh->fd);
+        if (!JS_IsNull(rh->rw_func[0]))
+            FD_SET(rh->fd, &rfds);
+        if (!JS_IsNull(rh->rw_func[1]))
+            FD_SET(rh->fd, &wfds);
+    }
+    
+    ret = select(fd_max + 1, &rfds, &wfds, NULL, tvp);
+    if (ret > 0) {
+        list_for_each(el, &os_rw_handlers) {
+            rh = list_entry(el, JSOSRWHandler, link);
+            if (!JS_IsNull(rh->rw_func[0]) &&
+                FD_ISSET(rh->fd, &rfds)) {
+                call_handler(ctx, rh->rw_func[0]);
+                /* must stop because the list may have been modified */
+                break;
+            }
+            if (!JS_IsNull(rh->rw_func[1])) {
+                FD_SET(rh->fd, &wfds);
+                call_handler(ctx, rh->rw_func[1]);
+                /* must stop because the list may have been modified */
+                break;
+            }
+        }
+    }
+    return 0;
+}
+#endif /* !_WIN32 */
+
+#if defined(_WIN32)
+#define OS_PLATFORM "win32"
+#elif defined(__APPLE__)
+#define OS_PLATFORM "darwin"
+#elif defined(EMSCRIPTEN)
+#define OS_PLATFORM "js"
+#else
+#define OS_PLATFORM "linux"
+#endif
+
+#define OS_FLAG(x) JS_PROP_INT32_DEF(#x, x, JS_PROP_CONFIGURABLE )
+
+static const JSCFunctionListEntry js_os_funcs[] = {
+    JS_CFUNC_DEF("open", 2, js_os_open ),
+    OS_FLAG(O_RDONLY),
+    OS_FLAG(O_WRONLY),
+    OS_FLAG(O_RDWR),
+    OS_FLAG(O_APPEND),
+    OS_FLAG(O_CREAT),
+    OS_FLAG(O_EXCL),
+    OS_FLAG(O_TRUNC),
+#if defined(_WIN32)
+    OS_FLAG(O_BINARY),
+    OS_FLAG(O_TEXT),
+#endif
+    JS_CFUNC_DEF("close", 1, js_os_close ),
+    JS_CFUNC_DEF("seek", 3, js_os_seek ),
+    JS_CFUNC_MAGIC_DEF("read", 4, js_os_read_write, 0 ),
+    JS_CFUNC_MAGIC_DEF("write", 4, js_os_read_write, 1 ),
+    JS_CFUNC_DEF("isatty", 1, js_os_isatty ),
+    JS_CFUNC_DEF("ttyGetWinSize", 1, js_os_ttyGetWinSize ),
+    JS_CFUNC_DEF("ttySetRaw", 1, js_os_ttySetRaw ),
+    JS_CFUNC_DEF("remove", 1, js_os_remove ),
+    JS_CFUNC_DEF("rename", 2, js_os_rename ),
+    JS_CFUNC_MAGIC_DEF("setReadHandler", 2, js_os_setReadHandler, 0 ),
+    JS_CFUNC_MAGIC_DEF("setWriteHandler", 2, js_os_setReadHandler, 1 ),
+    JS_CFUNC_DEF("signal", 2, js_os_signal ),
+    OS_FLAG(SIGINT),
+    OS_FLAG(SIGABRT),
+    OS_FLAG(SIGFPE),
+    OS_FLAG(SIGILL),
+    OS_FLAG(SIGSEGV),
+    OS_FLAG(SIGTERM),
+    JS_CFUNC_DEF("setTimeout", 2, js_os_setTimeout ),
+    JS_CFUNC_DEF("clearTimeout", 1, js_os_clearTimeout ),
+    JS_PROP_STRING_DEF("platform", OS_PLATFORM, 0 ),
+    /* stat, readlink, opendir, closedir, ... */
+};
+
+static int js_os_init(JSContext *ctx, JSModuleDef *m)
+{
+    os_poll_func = js_os_poll;
+    
+    /* OSTimer class */
+    JS_NewClassID(&js_os_timer_class_id);
+    JS_NewClass(JS_GetRuntime(ctx), js_os_timer_class_id, &js_os_timer_class);
+    
+    return JS_SetModuleExportList(ctx, m, js_os_funcs,
+                                  countof(js_os_funcs));
+}
+
+JSModuleDef *js_init_module_os(JSContext *ctx, const char *module_name)
+{
+    JSModuleDef *m;
+    m = JS_NewCModule(ctx, module_name, js_os_init);
+    if (!m)
+        return NULL;
+    JS_AddModuleExportList(ctx, m, js_os_funcs, countof(js_os_funcs));
+    return m;
+}
+
+/**********************************************************/
+
+static JSValue js_print(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv)
+{
+    int i;
+    const char *str;
+
+    for(i = 0; i < argc; i++) {
+        if (i != 0)
+            putchar(' ');
+        str = JS_ToCString(ctx, argv[i]);
+        if (!str)
+            return JS_EXCEPTION;
+        fputs(str, stdout);
+        JS_FreeCString(ctx, str);
+    }
+    putchar('\n');
+    return JS_UNDEFINED;
+}
+
+void js_std_add_helpers(JSContext *ctx, int argc, char **argv)
+{
+    JSValue global_obj, console, args;
+    int i;
+
+    /* XXX: should these global definitions be enumerable? */
+    global_obj = JS_GetGlobalObject(ctx);
+
+    console = JS_NewObject(ctx);
+    JS_SetPropertyStr(ctx, console, "log",
+                      JS_NewCFunction(ctx, js_print, "log", 1));
+    JS_SetPropertyStr(ctx, global_obj, "console", console);
+
+    /* same methods as the mozilla JS shell */
+    args = JS_NewArray(ctx);
+    for(i = 0; i < argc; i++) {
+        JS_SetPropertyUint32(ctx, args, i, JS_NewString(ctx, argv[i]));
+    }
+    JS_SetPropertyStr(ctx, global_obj, "scriptArgs", args);
+
+    JS_SetPropertyStr(ctx, global_obj, "print",
+                      JS_NewCFunction(ctx, js_print, "print", 1));
+    JS_SetPropertyStr(ctx, global_obj, "__loadScript",
+                      JS_NewCFunction(ctx, js_loadScript, "__loadScript", 1));
+    
+    JS_FreeValue(ctx, global_obj);
+
+    /* XXX: not multi-context */
+    init_list_head(&os_rw_handlers);
+    init_list_head(&os_signal_handlers);
+    init_list_head(&os_timers);
+    os_pending_signals = 0;
+}
+
+void js_std_free_handlers(JSRuntime *rt)
+{
+    struct list_head *el, *el1;
+
+    list_for_each_safe(el, el1, &os_rw_handlers) {
+        JSOSRWHandler *rh = list_entry(el, JSOSRWHandler, link);
+        free_rw_handler(rt, rh);
+    }
+
+    list_for_each_safe(el, el1, &os_signal_handlers) {
+        JSOSSignalHandler *sh = list_entry(el, JSOSSignalHandler, link);
+        free_sh(rt, sh);
+    }
+    
+    list_for_each_safe(el, el1, &os_timers) {
+        JSOSTimer *th = list_entry(el, JSOSTimer, link);
+        unlink_timer(rt, th);
+        if (!th->has_object)
+            free_timer(rt, th);
+    }
+}
+
+void js_std_dump_error(JSContext *ctx)
+{
+    JSValue exception_val, val;
+    const char *stack;
+    BOOL is_error;
+    
+    exception_val = JS_GetException(ctx);
+    is_error = JS_IsError(ctx, exception_val);
+    if (!is_error)
+        printf("Throw: ");
+    js_print(ctx, JS_NULL, 1, (JSValueConst *)&exception_val);
+    if (is_error) {
+        val = JS_GetPropertyStr(ctx, exception_val, "stack");
+        if (!JS_IsUndefined(val)) {
+            stack = JS_ToCString(ctx, val);
+            printf("%s\n", stack);
+            JS_FreeCString(ctx, stack);
+        }
+        JS_FreeValue(ctx, val);
+    }
+    JS_FreeValue(ctx, exception_val);
+}
+
+/* main loop which calls the user JS callbacks */
+void js_std_loop(JSContext *ctx)
+{
+    JSContext *ctx1;
+    int err;
+
+    for(;;) {
+        /* execute the pending jobs */
+        for(;;) {
+            err = JS_ExecutePendingJob(JS_GetRuntime(ctx), &ctx1);
+            if (err <= 0) {
+                if (err < 0) {
+                    js_std_dump_error(ctx1);
+                }
+                break;
+            }
+        }
+
+        if (!os_poll_func || os_poll_func(ctx))
+            break;
+    }
+}
+
+void js_std_eval_binary(JSContext *ctx, const uint8_t *buf, size_t buf_len,
+                        int flags)
+{
+    JSValue val;
+    val = JS_EvalBinary(ctx, buf, buf_len, flags);
+    if (JS_IsException(val)) {
+        js_std_dump_error(ctx);
+        exit(1);
+    }
+    JS_FreeValue(ctx, val);
+}
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-libc.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-libc.h
new file mode 100755
index 00000000..35ca4cff
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-libc.h
@@ -0,0 +1,44 @@
+/*
+ * QuickJS C library
+ * 
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#ifndef QUICKJS_LIBC_H
+#define QUICKJS_LIBC_H
+
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "quickjs.h"
+
+JSModuleDef *js_init_module_std(JSContext *ctx, const char *module_name);
+JSModuleDef *js_init_module_os(JSContext *ctx, const char *module_name);
+void js_std_add_helpers(JSContext *ctx, int argc, char **argv);
+void js_std_loop(JSContext *ctx);
+void js_std_free_handlers(JSRuntime *rt);
+void js_std_dump_error(JSContext *ctx);
+uint8_t *js_load_file(JSContext *ctx, size_t *pbuf_len, const char *filename);
+JSModuleDef *js_module_loader(JSContext *ctx,
+                              const char *module_name, void *opaque);
+void js_std_eval_binary(JSContext *ctx, const uint8_t *buf, size_t buf_len,
+                        int flags);
+
+#endif /* QUICKJS_LIBC_H */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-opcode.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-opcode.h
new file mode 100755
index 00000000..44fcc83c
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs-opcode.h
@@ -0,0 +1,354 @@
+/*
+ * QuickJS opcode definitions
+ * 
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ * Copyright (c) 2017-2018 Charlie Gordon
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+
+#ifdef FMT
+FMT(none)
+FMT(none_int)
+FMT(none_loc)
+FMT(none_arg)
+FMT(none_var_ref)
+FMT(u8)
+FMT(i8)
+FMT(loc8)
+FMT(const8)
+FMT(label8)
+FMT(u16)
+FMT(i16)
+FMT(label16)
+FMT(npop)
+FMT(npopx)
+FMT(loc)
+FMT(arg)
+FMT(var_ref)
+FMT(u32)
+FMT(i32)
+FMT(const)
+FMT(label)
+FMT(atom)
+FMT(atom_u8)
+FMT(atom_u16)
+FMT(atom_label_u8)
+FMT(atom_label_u16)
+FMT(label_u16)
+#undef FMT
+#endif /* FMT */
+
+#ifdef DEF
+
+#ifndef def
+#define def(id, size, n_pop, n_push, f) DEF(id, size, n_pop, n_push, f)
+#endif
+
+def(invalid, 1, 0, 0, none) /* never emitted */
+
+/* push values */
+DEF(       push_i32, 5, 0, 1, i32)
+DEF(     push_const, 5, 0, 1, const)
+DEF(       fclosure, 5, 0, 1, const) /* must follow push_const */
+DEF(push_atom_value, 5, 0, 1, atom)
+DEF(      undefined, 1, 0, 1, none)
+DEF(           null, 1, 0, 1, none)
+DEF(      push_this, 1, 0, 1, none) /* only used at the start of a function */
+DEF(     push_false, 1, 0, 1, none)
+DEF(      push_true, 1, 0, 1, none)
+DEF(         object, 1, 0, 1, none)
+DEF(     var_object, 1, 0, 1, none)
+DEF(      this_func, 1, 0, 1, none) /* only used at the start of a function */
+DEF(      arguments, 2, 0, 1, none) /* only used at the start of a function */
+DEF(           rest, 3, 0, 1, u16) /* only used at the start of a function */
+DEF(     new_target, 1, 0, 1, none) /* only used at the start of a function */
+DEF(    home_object, 1, 0, 1, none) /* only used at the start of a function */
+
+DEF(           drop, 1, 1, 0, none) /* a -> */
+DEF(            nip, 1, 2, 1, none) /* a b -> b */
+DEF(           nip1, 1, 3, 2, none) /* a b c -> b c */
+DEF(            dup, 1, 1, 2, none) /* a -> a a */
+DEF(           dup1, 1, 2, 3, none) /* a b -> a a b */
+DEF(           dup2, 1, 2, 4, none) /* a b -> a b a b */
+DEF(           dup3, 1, 3, 6, none) /* a b c -> a b c a b c */
+DEF(        insert2, 1, 2, 3, none) /* obj a -> a obj a (dup_x1) */
+DEF(        insert3, 1, 3, 4, none) /* obj prop a -> a obj prop a (dup_x2) */
+DEF(        insert4, 1, 4, 5, none) /* this obj prop a -> a this obj prop a */
+DEF(          perm3, 1, 3, 3, none) /* obj a b -> a obj b */
+DEF(          perm4, 1, 4, 4, none) /* obj prop a b -> a obj prop b */
+DEF(          perm5, 1, 5, 5, none) /* this obj prop a b -> a this obj prop b */
+DEF(           swap, 1, 2, 2, none) /* a b -> b a */
+DEF(          swap2, 1, 4, 4, none) /* a b c d -> c d a b */
+DEF(          rot3l, 1, 3, 3, none) /* x a b -> a b x */
+DEF(          rot3r, 1, 3, 3, none) /* a b x -> x a b */
+DEF(          rot4l, 1, 4, 4, none) /* x a b c -> a b c x */
+DEF(          rot5l, 1, 5, 5, none) /* x a b c d -> a b c d x */
+
+DEF(call_constructor, 3, 2, 1, npop) /* func new.target args -> ret. arguments are not counted in n_pop */
+DEF(           call, 3, 1, 1, npop) /* arguments are not counted in n_pop */
+DEF(      tail_call, 3, 1, 0, npop) /* arguments are not counted in n_pop */
+DEF(    call_method, 3, 2, 1, npop) /* arguments are not counted in n_pop */
+DEF(tail_call_method, 3, 2, 0, npop) /* arguments are not counted in n_pop */
+DEF(     array_from, 3, 0, 1, npop) /* arguments are not counted in n_pop */
+DEF(          apply, 3, 3, 1, u16)
+DEF(         return, 1, 1, 0, none)
+DEF(   return_undef, 1, 0, 0, none)
+DEF(check_ctor_return, 1, 1, 2, none)
+DEF(     check_ctor, 1, 0, 0, none)
+DEF(   return_async, 1, 1, 0, none)
+DEF(          throw, 1, 1, 0, none)
+DEF(      throw_var, 6, 0, 0, atom_u8)
+DEF(           eval, 3, 1, 1, u16)
+DEF(         regexp, 1, 2, 1, none) /* create a RegExp object from the pattern and a
+                                       bytecode string */
+DEF( get_super_ctor, 1, 1, 1, none)
+DEF(      get_super, 1, 1, 1, none)
+
+DEF(      check_var, 5, 0, 1, atom) /* check if a variable exists */
+DEF(  get_var_undef, 5, 0, 1, atom) /* push undefined if the variable does not exist */
+DEF(        get_var, 5, 0, 1, atom) /* throw an exception if the variable does not exist */
+DEF(        put_var, 5, 1, 0, atom) /* must come after get_var */
+DEF(   put_var_init, 5, 1, 0, atom) /* must come after put_var. Used to initialize a global lexical variable */
+DEF( put_var_strict, 5, 2, 0, atom) /* for strict mode variable write */
+
+DEF(  get_ref_value, 1, 2, 3, none)
+DEF(  put_ref_value, 1, 3, 0, none)
+
+DEF(     define_var, 6, 0, 0, atom_u8)
+DEF(check_define_var, 6, 0, 0, atom_u8)
+DEF(    define_func, 6, 1, 0, atom_u8)
+DEF(      get_field, 5, 1, 1, atom)
+DEF(     get_field2, 5, 1, 2, atom)
+DEF(      put_field, 5, 2, 0, atom)
+DEF(   get_array_el, 1, 2, 1, none)
+DEF(  get_array_el2, 1, 2, 2, none) /* obj prop -> obj value */
+DEF(   put_array_el, 1, 3, 0, none)
+DEF(get_super_value, 1, 3, 1, none) /* this obj prop -> value */
+DEF(put_super_value, 1, 4, 0, none) /* this obj prop value -> */
+DEF(   define_field, 5, 2, 1, atom)
+DEF(       set_name, 5, 1, 1, atom)
+DEF(set_name_computed, 1, 2, 2, none)
+DEF(      set_proto, 1, 2, 1, none)
+DEF(define_array_el, 1, 3, 2, none)
+DEF(         append, 1, 3, 2, none) /* append enumerated object, update length */
+DEF(copy_data_properties, 2, 3, 3, u8)
+DEF(  define_method, 6, 2, 1, atom_u8)
+DEF(define_method_computed, 2, 3, 1, u8) /* must come after define_method */
+DEF(   define_class, 2, 2, 2, u8)
+
+DEF(        get_loc, 3, 0, 1, loc)
+DEF(        put_loc, 3, 1, 0, loc) /* must come after get_loc */
+DEF(        set_loc, 3, 1, 1, loc) /* must come after put_loc */
+DEF(        get_arg, 3, 0, 1, arg)
+DEF(        put_arg, 3, 1, 0, arg) /* must come after get_arg */
+DEF(        set_arg, 3, 1, 1, arg) /* must come after put_arg */
+DEF(    get_var_ref, 3, 0, 1, var_ref) 
+DEF(    put_var_ref, 3, 1, 0, var_ref) /* must come after get_var_ref */
+DEF(    set_var_ref, 3, 1, 1, var_ref) /* must come after put_var_ref */
+DEF(set_loc_uninitialized, 3, 0, 0, loc)
+def(set_arg_valid_upto, 3, 0, 0, arg) /* emitted in phase 1, removed in phase 2 */
+DEF(  get_loc_check, 3, 0, 1, loc)
+DEF(  put_loc_check, 3, 1, 0, loc) /* must come after get_loc_check */
+DEF(  put_loc_check_init, 3, 1, 0, loc)
+DEF(get_var_ref_check, 3, 0, 1, var_ref) 
+DEF(put_var_ref_check, 3, 1, 0, var_ref) /* must come after get_var_ref_check */
+DEF(put_var_ref_check_init, 3, 1, 0, var_ref)
+DEF(      close_loc, 3, 0, 0, loc)
+def(close_var_object, 1, 0, 0, none) /* emitted in phase 1, removed in phase 2 */
+def(    enter_scope, 3, 0, 0, u16)  /* emitted in phase 1, removed in phase 2 */
+def(    leave_scope, 3, 0, 0, u16)  /* emitted in phase 1, removed in phase 2 */
+
+DEF(       if_false, 5, 1, 0, label)
+DEF(        if_true, 5, 1, 0, label) /* must come after if_false */
+DEF(           goto, 5, 0, 0, label) /* must come after if_true */
+def(          label, 5, 0, 0, label) /* emitted in phase 1, removed in phase 3 */
+DEF(          catch, 5, 0, 1, label)
+DEF(          gosub, 5, 0, 0, label) /* used to execute the finally block */
+DEF(            ret, 1, 1, 0, none) /* used to return from the finally block */
+
+def(scope_get_var_undef, 7, 0, 1, atom_u16) /* emitted in phase 1, removed in phase 2 */
+def(  scope_get_var, 7, 0, 1, atom_u16) /* emitted in phase 1, removed in phase 2 */
+def(  scope_put_var, 7, 1, 0, atom_u16) /* emitted in phase 1, removed in phase 2 */
+def(scope_delete_var, 7, 0, 1, atom_u16) /* emitted in phase 1, removed in phase 2 */
+def( scope_make_ref, 11, 0, 2, atom_label_u16) /* emitted in phase 1, removed in phase 2 */
+def(  scope_get_ref, 7, 0, 2, atom_u16) /* emitted in phase 1, removed in phase 2 */
+def(scope_put_var_init, 7, 0, 2, atom_u16) /* emitted in phase 1, removed in phase 2 */
+
+DEF(      to_object, 1, 1, 1, none)
+//DEF(      to_string, 1, 1, 1, none)
+DEF(     to_propkey, 1, 1, 1, none)
+DEF(    to_propkey2, 1, 2, 2, none)
+
+DEF(   with_get_var, 10, 1, 0, atom_label_u8)     /* must be in the same order as scope_xxx */
+DEF(   with_put_var, 10, 2, 1, atom_label_u8)     /* must be in the same order as scope_xxx */
+DEF(with_delete_var, 10, 1, 0, atom_label_u8)     /* must be in the same order as scope_xxx */
+DEF(  with_make_ref, 10, 1, 0, atom_label_u8)     /* must be in the same order as scope_xxx */
+DEF(   with_get_ref, 10, 1, 0, atom_label_u8)     /* must be in the same order as scope_xxx */
+DEF(with_get_ref_undef, 10, 1, 0, atom_label_u8)
+
+DEF(   make_loc_ref, 7, 0, 2, atom_u16)
+DEF(   make_arg_ref, 7, 0, 2, atom_u16)
+DEF(make_var_ref_ref, 7, 0, 2, atom_u16)
+DEF(   make_var_ref, 5, 0, 2, atom)
+
+def(       line_num, 5, 0, 0, u32) /* emitted in phase 1, removed in phase 3 */
+
+DEF(   for_in_start, 1, 1, 1, none)
+DEF(   for_of_start, 1, 1, 3, none)
+DEF(for_await_of_start, 1, 1, 3, none)
+DEF(    for_in_next, 1, 1, 3, none)
+DEF(    for_of_next, 2, 3, 5, u8)
+DEF(for_await_of_next, 1, 3, 4, none)
+DEF(iterator_get_value_done, 1, 1, 2, none)
+DEF( iterator_close, 1, 3, 0, none)
+DEF(iterator_close_return, 1, 4, 4, none)
+DEF(async_iterator_close, 1, 3, 2, none)
+DEF(async_iterator_next, 1, 4, 4, none)
+DEF(async_iterator_get, 2, 4, 5, u8)
+DEF(  initial_yield, 1, 0, 0, none)
+DEF(          yield, 1, 1, 2, none)
+DEF(     yield_star, 1, 2, 2, none)
+DEF(async_yield_star, 1, 1, 2, none)
+DEF(          await, 1, 1, 1, none)
+
+/* arithmetic/logic operations */
+DEF(            neg, 1, 1, 1, none)
+DEF(           plus, 1, 1, 1, none)
+DEF(            dec, 1, 1, 1, none)
+DEF(            inc, 1, 1, 1, none)
+DEF(       post_dec, 1, 1, 2, none)
+DEF(       post_inc, 1, 1, 2, none)
+DEF(        dec_loc, 2, 0, 0, loc8)
+DEF(        inc_loc, 2, 0, 0, loc8)
+DEF(        add_loc, 2, 1, 0, loc8)
+DEF(            not, 1, 1, 1, none)
+DEF(           lnot, 1, 1, 1, none)
+DEF(         typeof, 1, 1, 1, none)
+DEF(         delete, 1, 2, 1, none)
+DEF(     delete_var, 5, 0, 1, atom)
+
+DEF(            mul, 1, 2, 1, none)
+DEF(            div, 1, 2, 1, none)
+DEF(            mod, 1, 2, 1, none)
+DEF(            add, 1, 2, 1, none)
+DEF(            sub, 1, 2, 1, none)
+DEF(            pow, 1, 2, 1, none)
+DEF(            shl, 1, 2, 1, none)
+DEF(            sar, 1, 2, 1, none)
+DEF(            shr, 1, 2, 1, none)
+DEF(             lt, 1, 2, 1, none)
+DEF(            lte, 1, 2, 1, none)
+DEF(             gt, 1, 2, 1, none)
+DEF(            gte, 1, 2, 1, none)
+DEF(     instanceof, 1, 2, 1, none)
+DEF(             in, 1, 2, 1, none)
+DEF(             eq, 1, 2, 1, none)
+DEF(            neq, 1, 2, 1, none)
+DEF(      strict_eq, 1, 2, 1, none)
+DEF(     strict_neq, 1, 2, 1, none)
+DEF(            and, 1, 2, 1, none)
+DEF(            xor, 1, 2, 1, none)
+DEF(             or, 1, 2, 1, none)
+#ifdef CONFIG_BIGNUM
+DEF(      mul_pow10, 1, 2, 1, none)
+DEF(       math_div, 1, 2, 1, none)
+DEF(       math_mod, 1, 2, 1, none)
+DEF(       math_pow, 1, 2, 1, none)
+#endif
+
+#if SHORT_OPCODES
+DEF(    push_minus1, 1, 0, 1, none_int)
+DEF(         push_0, 1, 0, 1, none_int)
+DEF(         push_1, 1, 0, 1, none_int)
+DEF(         push_2, 1, 0, 1, none_int)
+DEF(         push_3, 1, 0, 1, none_int)
+DEF(         push_4, 1, 0, 1, none_int)
+DEF(         push_5, 1, 0, 1, none_int)
+DEF(         push_6, 1, 0, 1, none_int)
+DEF(         push_7, 1, 0, 1, none_int)
+DEF(        push_i8, 2, 0, 1, i8)
+DEF(       push_i16, 3, 0, 1, i16)
+DEF(    push_const8, 2, 0, 1, const8)
+DEF(      fclosure8, 2, 0, 1, const8) /* must follow push_const8 */
+DEF(push_empty_string, 1, 0, 1, none)
+
+DEF(       get_loc8, 2, 0, 1, loc8)
+DEF(       put_loc8, 2, 1, 0, loc8)
+DEF(       set_loc8, 2, 1, 1, loc8)
+
+DEF(       get_loc0, 1, 0, 1, none_loc)
+DEF(       get_loc1, 1, 0, 1, none_loc)
+DEF(       get_loc2, 1, 0, 1, none_loc)
+DEF(       get_loc3, 1, 0, 1, none_loc)
+DEF(       put_loc0, 1, 1, 0, none_loc)
+DEF(       put_loc1, 1, 1, 0, none_loc)
+DEF(       put_loc2, 1, 1, 0, none_loc)
+DEF(       put_loc3, 1, 1, 0, none_loc)
+DEF(       set_loc0, 1, 1, 1, none_loc)
+DEF(       set_loc1, 1, 1, 1, none_loc)
+DEF(       set_loc2, 1, 1, 1, none_loc)
+DEF(       set_loc3, 1, 1, 1, none_loc)
+DEF(       get_arg0, 1, 0, 1, none_arg)
+DEF(       get_arg1, 1, 0, 1, none_arg)
+DEF(       get_arg2, 1, 0, 1, none_arg)
+DEF(       get_arg3, 1, 0, 1, none_arg)
+DEF(       put_arg0, 1, 1, 0, none_arg)
+DEF(       put_arg1, 1, 1, 0, none_arg)
+DEF(       put_arg2, 1, 1, 0, none_arg)
+DEF(       put_arg3, 1, 1, 0, none_arg)
+DEF(       set_arg0, 1, 1, 1, none_arg)
+DEF(       set_arg1, 1, 1, 1, none_arg)
+DEF(       set_arg2, 1, 1, 1, none_arg)
+DEF(       set_arg3, 1, 1, 1, none_arg)
+DEF(   get_var_ref0, 1, 0, 1, none_var_ref)
+DEF(   get_var_ref1, 1, 0, 1, none_var_ref)
+DEF(   get_var_ref2, 1, 0, 1, none_var_ref)
+DEF(   get_var_ref3, 1, 0, 1, none_var_ref)
+DEF(   put_var_ref0, 1, 1, 0, none_var_ref)
+DEF(   put_var_ref1, 1, 1, 0, none_var_ref)
+DEF(   put_var_ref2, 1, 1, 0, none_var_ref)
+DEF(   put_var_ref3, 1, 1, 0, none_var_ref)
+DEF(   set_var_ref0, 1, 1, 1, none_var_ref)
+DEF(   set_var_ref1, 1, 1, 1, none_var_ref)
+DEF(   set_var_ref2, 1, 1, 1, none_var_ref)
+DEF(   set_var_ref3, 1, 1, 1, none_var_ref)
+
+DEF(     get_length, 1, 1, 1, none)
+
+DEF(      if_false8, 2, 1, 0, label8)
+DEF(       if_true8, 2, 1, 0, label8) /* must come after if_false8 */
+DEF(          goto8, 2, 0, 0, label8) /* must come after if_true8 */
+DEF(         goto16, 3, 0, 0, label16)
+
+DEF(          call0, 1, 1, 1, npopx)
+DEF(          call1, 1, 1, 1, npopx)
+DEF(          call2, 1, 1, 1, npopx)
+DEF(          call3, 1, 1, 1, npopx)
+
+DEF(   is_undefined, 1, 1, 1, none)
+DEF(        is_null, 1, 1, 1, none)
+DEF(    is_function, 1, 1, 1, none)
+#endif
+
+DEF(            nop, 1, 0, 0, none) /* temporary use during code generation */
+
+#undef DEF
+#undef def
+#endif  /* DEF */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs.c
new file mode 100755
index 00000000..059a69ef
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs.c
@@ -0,0 +1,48183 @@
+/*
+ * QuickJS Javascript Engine
+ * 
+ * Copyright (c) 2017-2019 Fabrice Bellard
+ * Copyright (c) 2017-2019 Charlie Gordon
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include <stdlib.h>
+#include <stdio.h>
+#include <stdarg.h>
+#include <inttypes.h>
+#include <string.h>
+#include <assert.h>
+//#include <sys/time.h>
+#include <time.h>
+#include <fenv.h>
+#include <math.h>
+#if defined(__APPLE__)
+#include <malloc/malloc.h>
+#elif defined(__linux__)
+#include <malloc.h>
+#endif
+
+#include "cutils.h"
+#include "list.h"
+#include "quickjs.h"
+#include "libregexp.h"
+#ifdef CONFIG_BIGNUM
+#include "libbf.h"
+#endif
+
+#define OPTIMIZE         1
+#define SHORT_OPCODES    1
+#if defined(_MSC_VER)
+#define DIRECT_DISPATCH  0
+#else
+#if defined(EMSCRIPTEN)
+#define DIRECT_DISPATCH  0
+#else
+#define DIRECT_DISPATCH  1
+#endif
+#endif
+
+#if defined(__APPLE__)
+#define MALLOC_OVERHEAD  0
+#else
+#define MALLOC_OVERHEAD  8
+#endif
+
+#if !defined(_WIN32)
+/* define it if printf uses the RNDN rounding mode instead of RNDNA */
+#define CONFIG_PRINTF_RNDN
+#endif
+
+/* define to include Atomics.* operations which depend on the OS
+   threads */
+#if !defined(EMSCRIPTEN)
+#if !defined(_MSC_VER) && !defined(__linux__)
+#define CONFIG_ATOMICS
+#endif
+#endif
+#define JSON_SUPERSET  1
+
+/* dump object free */
+//#define DUMP_FREE
+//#define DUMP_CLOSURE
+/* dump the bytecode of the compiled functions: combination of bits
+   1: dump pass 3 final byte code
+   2: dump pass 2 code
+   4: dump pass 1 code
+   8: dump stdlib functions
+  16: dump bytecode in hex
+  32: dump line number table
+ */
+//#define DUMP_BYTECODE  (1)
+/* dump the occurence of the automatic GC */
+//#define DUMP_GC
+/* dump objects freed by the garbage collector */
+//#define DUMP_GC_FREE
+/* dump objects leaking when freeing the runtime */
+//#define DUMP_LEAKS  1
+/* dump memory usage before running the garbage collector */
+//#define DUMP_MEM
+//#define DUMP_OBJECTS    /* dump objects in JS_FreeContext */
+//#define DUMP_ATOMS      /* dump atoms in JS_FreeContext */
+//#define DUMP_SHAPES     /* dump shapes in JS_FreeContext */
+//#define DUMP_MODULE_RESOLVE
+//#define DUMP_PROMISE
+//#define DUMP_READ_OBJECT
+
+/* test the GC by forcing it before each object allocation */
+//#define FORCE_GC_AT_MALLOC
+
+#ifdef CONFIG_ATOMICS
+#include <pthread.h>
+#include <stdatomic.h>
+#include <errno.h>
+#endif
+
+enum {
+    /* classid tag        */    /* union usage   | properties */
+    JS_CLASS_OBJECT = 1,        /* must be first */
+    JS_CLASS_ARRAY,             /* u.array       | length */
+    JS_CLASS_ERROR,
+    JS_CLASS_NUMBER,            /* u.object_data */
+    JS_CLASS_STRING,            /* u.object_data */
+    JS_CLASS_BOOLEAN,           /* u.object_data */
+    JS_CLASS_SYMBOL,            /* u.object_data */
+    JS_CLASS_ARGUMENTS,         /* u.array       | length */
+    JS_CLASS_MAPPED_ARGUMENTS,  /*               | length */
+    JS_CLASS_DATE,              /* u.object_data */
+    JS_CLASS_MODULE_NS,
+    JS_CLASS_C_FUNCTION,        /* u.cfunc */
+    JS_CLASS_BYTECODE_FUNCTION, /* u.func */
+    JS_CLASS_BOUND_FUNCTION,    /* u.bound_function */
+    JS_CLASS_C_FUNCTION_DATA,   /* u.c_function_data_record */
+    JS_CLASS_GENERATOR_FUNCTION, /* u.func */
+    JS_CLASS_FOR_IN_ITERATOR,   /* u.for_in_iterator */
+    JS_CLASS_REGEXP,            /* u.regexp */
+    JS_CLASS_ARRAY_BUFFER,      /* u.array_buffer */
+    JS_CLASS_SHARED_ARRAY_BUFFER, /* u.array_buffer */
+    JS_CLASS_UINT8C_ARRAY,      /* u.array (typed_array) */
+    JS_CLASS_INT8_ARRAY,        /* u.array (typed_array) */
+    JS_CLASS_UINT8_ARRAY,       /* u.array (typed_array) */
+    JS_CLASS_INT16_ARRAY,       /* u.array (typed_array) */
+    JS_CLASS_UINT16_ARRAY,      /* u.array (typed_array) */
+    JS_CLASS_INT32_ARRAY,       /* u.array (typed_array) */
+    JS_CLASS_UINT32_ARRAY,      /* u.array (typed_array) */
+#ifdef CONFIG_BIGNUM
+    JS_CLASS_BIG_INT64_ARRAY,   /* u.array (typed_array) */
+    JS_CLASS_BIG_UINT64_ARRAY,  /* u.array (typed_array) */
+#endif
+    JS_CLASS_FLOAT32_ARRAY,     /* u.array (typed_array) */
+    JS_CLASS_FLOAT64_ARRAY,     /* u.array (typed_array) */
+    JS_CLASS_DATAVIEW,          /* u.typed_array */
+#ifdef CONFIG_BIGNUM
+    JS_CLASS_BIG_INT,           /* u.object_data */
+    JS_CLASS_BIG_FLOAT,         /* u.object_data */
+    JS_CLASS_FLOAT_ENV,         /* u.float_env */
+#endif
+    JS_CLASS_MAP,               /* u.map_state */
+    JS_CLASS_SET,               /* u.map_state */
+    JS_CLASS_WEAKMAP,           /* u.map_state */
+    JS_CLASS_WEAKSET,           /* u.map_state */
+    JS_CLASS_MAP_ITERATOR,      /* u.map_iterator_data */
+    JS_CLASS_SET_ITERATOR,      /* u.map_iterator_data */
+    JS_CLASS_ARRAY_ITERATOR,    /* u.array_iterator_data */
+    JS_CLASS_STRING_ITERATOR,   /* u.array_iterator_data */
+    JS_CLASS_GENERATOR,         /* u.generator_data */
+    JS_CLASS_PROXY,             /* u.proxy_data */
+    JS_CLASS_PROMISE,           /* u.promise_data */
+    JS_CLASS_PROMISE_RESOLVE_FUNCTION,  /* u.promise_function_data */
+    JS_CLASS_PROMISE_REJECT_FUNCTION,   /* u.promise_function_data */
+    JS_CLASS_ASYNC_FUNCTION,            /* u.func */
+    JS_CLASS_ASYNC_FUNCTION_RESOLVE,    /* u.async_function_data */
+    JS_CLASS_ASYNC_FUNCTION_REJECT,     /* u.async_function_data */
+    JS_CLASS_ASYNC_FROM_SYNC_ITERATOR,  /* u.async_from_sync_iterator_data */
+    JS_CLASS_ASYNC_GENERATOR_FUNCTION,  /* u.func */
+    JS_CLASS_ASYNC_GENERATOR,   /* u.async_generator_data */
+
+    JS_CLASS_INIT_COUNT, /* last entry for predefined classes */
+};
+
+/* number of typed array types */
+#define JS_TYPED_ARRAY_COUNT  (JS_CLASS_FLOAT64_ARRAY - JS_CLASS_UINT8C_ARRAY + 1)
+static uint8_t const typed_array_size_log2[JS_TYPED_ARRAY_COUNT];
+#define typed_array_size_log2(classid)  (typed_array_size_log2[(classid)- JS_CLASS_UINT8C_ARRAY])
+
+typedef enum JSErrorEnum {
+    JS_EVAL_ERROR,
+    JS_RANGE_ERROR,
+    JS_REFERENCE_ERROR,
+    JS_SYNTAX_ERROR,
+    JS_TYPE_ERROR,
+    JS_URI_ERROR,
+    JS_INTERNAL_ERROR,
+
+    JS_NATIVE_ERROR_COUNT, /* number of different NativeError objects */
+} JSErrorEnum;
+
+#define JS_MAX_LOCAL_VARS 65536
+#define JS_STACK_SIZE_MAX 65536
+#define JS_STRING_LEN_MAX ((1 << 30) - 1)
+
+#if defined(_MSC_VER)
+#define __exception
+#else
+#define __exception __attribute__((warn_unused_result))
+#endif
+
+typedef struct JSShape JSShape;
+typedef struct JSString JSString;
+typedef struct JSString JSAtomStruct;
+
+struct JSRuntime {
+    JSMallocFunctions mf;
+    JSMallocState malloc_state;
+    const char *rt_info;
+
+    int atom_hash_size; /* power of two */
+    int atom_count;
+    int atom_size;
+    int atom_count_resize; /* resize hash table at this count */
+    uint32_t *atom_hash;
+    JSAtomStruct **atom_array;
+    int atom_free_index; /* 0 = none */
+
+    int class_count;    /* size of class_array */
+    JSClass *class_array;
+
+    struct list_head context_list; /* list of JSContext.link */
+    /* list of allocated objects (used by the garbage collector) */
+    struct list_head obj_list; /* list of JSObject.link */
+    size_t malloc_gc_threshold;
+#ifdef DUMP_LEAKS
+    struct list_head string_list; /* list of JSString.link */
+#endif
+    struct list_head tmp_obj_list; /* used during gc */
+    struct list_head free_obj_list; /* used during gc */
+    struct list_head *el_next; /* used during gc */
+
+    JSInterruptHandler *interrupt_handler;
+    void *interrupt_opaque;
+
+    struct list_head job_list; /* list of JSJobEntry.link */
+
+    JSModuleNormalizeFunc *module_normalize_func;
+    JSModuleLoaderFunc *module_loader_func;
+    void *module_loader_opaque;
+
+    BOOL in_gc_sweep : 8;
+    BOOL can_block : 8; /* TRUE if Atomics.wait can block */
+
+    /* Shape hash table */
+    int shape_hash_bits;
+    int shape_hash_size;
+    int shape_hash_count; /* number of hashed shapes */
+    JSShape **shape_hash;
+#ifdef CONFIG_BIGNUM
+    bf_context_t bf_ctx;
+#endif
+};
+
+struct JSClass {
+    uint32_t class_id; /* 0 means free entry */
+    JSAtom class_name;
+    JSClassFinalizer *finalizer;
+    JSClassGCMark *gc_mark;
+    JSClassCall *call;
+    /* pointers for exotic behavior, can be NULL if none are present */
+    const JSClassExoticMethods *exotic;
+};
+
+#define JS_MODE_STRICT (1 << 0)
+#define JS_MODE_STRIP  (1 << 1)
+#define JS_MODE_BIGINT (1 << 2)
+#define JS_MODE_MATH   (1 << 3)
+
+typedef struct JSStackFrame {
+    struct JSStackFrame *prev_frame; /* NULL if first stack frame */
+    JSValue cur_func; /* current function, JS_UNDEFINED if the frame is detached */
+    JSValue *arg_buf; /* arguments */
+    JSValue *var_buf; /* variables */
+    struct list_head var_ref_list; /* list of JSVarRef.link */
+    const uint8_t *cur_pc; /* only used in bytecode functions : PC of the
+                        instruction after the call */
+    int arg_count;
+    int js_mode; /* for C functions: 0 */
+    /* only used in generators. Current stack pointer value. NULL if
+       the function is running. */ 
+    JSValue *cur_sp;
+} JSStackFrame;
+
+typedef struct JSGCHeader {
+    uint8_t mark;
+} JSGCHeader;
+
+typedef struct JSVarRef {
+    JSRefCountHeader header; /* must come first, 32-bit */
+    JSGCHeader gc_header; /* must come after JSRefCountHeader, 8-bit */
+    uint8_t is_arg : 1;
+    int var_idx; /* index of the corresponding function variable on
+                    the stack */
+    struct list_head link; /* prev = NULL if no longer on the stack */
+    JSValue *pvalue; /* pointer to the value, either on the stack or
+                        to 'value' */
+    JSValue value; /* used when the variable is no longer on the stack */
+} JSVarRef;
+
+#ifdef CONFIG_BIGNUM
+typedef struct JSFloatEnv {
+    limb_t prec;
+    bf_flags_t flags;
+    unsigned int status;
+} JSFloatEnv;
+
+/* the same structure is used for big integers and big floats. Big
+   integers are never infinite or NaNs */
+typedef struct JSBigFloat {
+    JSRefCountHeader header; /* must come first, 32-bit */
+    bf_t num;
+} JSBigFloat;
+#endif
+
+/* must be large enough to have a negligible runtime cost and small
+   enough to call the interrupt callback often. */
+#define JS_INTERRUPT_COUNTER_INIT 10000
+
+struct JSContext {
+    JSRuntime *rt;
+    struct list_head link;
+    const uint8_t *stack_top;
+    size_t stack_size; /* in bytes */
+
+    JSValue current_exception;
+    /* true if a backtrace needs to be added to the current exception
+       (the backtrace generation cannot be done immediately in a bytecode
+       function) */
+    BOOL exception_needs_backtrace : 8;
+    /* true if inside an out of memory error, to avoid recursing */
+    BOOL in_out_of_memory : 8;
+    uint16_t binary_object_count;
+    int binary_object_size;
+
+    JSShape *array_shape;   /* initial shape for Array objects */
+
+    JSStackFrame *current_stack_frame;
+
+    JSValue *class_proto;
+    JSValue function_proto;
+    JSValue function_ctor;
+    JSValue regexp_ctor;
+    JSValue native_error_proto[JS_NATIVE_ERROR_COUNT];
+    JSValue iterator_proto;
+    JSValue async_iterator_proto;
+    JSValue array_proto_values;
+    JSValue throw_type_error;
+
+    JSValue global_obj; /* global object */
+    JSValue global_var_obj; /* contains the global let/const definitions */
+
+    uint64_t random_state;
+#ifdef CONFIG_BIGNUM
+    bf_context_t *bf_ctx;   /* points to rt->bf_ctx, shared by all contexts */
+    JSFloatEnv fp_env; /* global FP environment */
+#endif
+    /* when the counter reaches zero, JSRutime.interrupt_handler is called */
+    int interrupt_counter;
+    BOOL is_error_property_enabled;
+
+    struct list_head loaded_modules; /* list of JSModuleDef.link */
+
+    /* if NULL, RegExp compilation is not supported */
+    JSValue (*compile_regexp)(JSContext *ctx, JSValueConst pattern,
+                              JSValueConst flags);
+    /* if NULL, eval is not supported */
+    JSValue (*eval_internal)(JSContext *ctx, JSValueConst this_obj,
+                             const char *input, size_t input_len,
+                             const char *filename, int flags, int scope_idx);
+    void *user_opaque;
+};
+
+typedef union JSFloat64Union {
+    double d;
+    uint64_t u64;
+    uint32_t u32[2];
+} JSFloat64Union;
+
+enum {
+    JS_ATOM_TYPE_STRING = 1,
+    JS_ATOM_TYPE_GLOBAL_SYMBOL,
+    JS_ATOM_TYPE_SYMBOL,
+};
+
+#define JS_ATOM_HASH_MASK  ((1 << 30) - 1)
+
+struct JSString {
+    JSRefCountHeader header; /* must come first, 32-bit */
+    uint32_t len : 31;
+    uint8_t is_wide_char : 1; /* 0 = 8 bits, 1 = 16 bits characters */
+    uint32_t hash : 30;
+    uint8_t atom_type : 2; /* != 0 if atom, JS_ATOM_TYPE_x */
+    uint32_t hash_next; /* atom_index for JS_ATOM_TYPE_SYMBOL */
+#ifdef DUMP_LEAKS
+    struct list_head link; /* string list */
+#endif
+    union {
+        uint8_t str8[0]; /* 8 bit strings will get an extra null terminator */
+        uint16_t str16[0];
+    } u;
+};
+
+typedef struct JSClosureVar {
+    uint8_t is_local : 1;
+    uint8_t is_arg : 1;
+    uint8_t is_const : 1;
+    uint8_t is_lexical : 1;
+    uint8_t is_catch : 1;
+    /* 11 bits available */
+    uint16_t var_idx; /* is_local = TRUE: index to a normal variable of the
+                    parent function. otherwise: index to a closure
+                    variable of the parent function */
+    JSAtom var_name;
+} JSClosureVar;
+
+typedef struct JSVarScope {
+    int parent;  /* index into fd->scopes of the enclosing scope */
+    int first;   /* index into fd->vars of the last variable in this scope */
+} JSVarScope;
+
+typedef struct JSVarDef {
+    JSAtom var_name;
+    int scope_level;   /* index into fd->scopes of this variable lexical scope */
+    int scope_next;    /* index into fd->vars of the next variable in the
+                        * same or enclosing lexical scope */
+    uint8_t is_catch : 1;
+    uint8_t is_function : 1; /* only used for debug */
+    uint8_t is_func_var : 1; /* used for the function self reference */
+    uint8_t is_const : 1;
+    uint8_t is_lexical : 1;
+    uint8_t is_captured : 1;
+    int func_pool_idx : 26; /* only used during compilation */
+} JSVarDef;
+
+/* for the encoding of the pc2line table */
+#define PC2LINE_BASE     (-1)
+#define PC2LINE_RANGE    5
+#define PC2LINE_OP_FIRST 1
+#define PC2LINE_DIFF_PC_MAX ((255 - PC2LINE_OP_FIRST) / PC2LINE_RANGE)
+
+typedef enum JSFunctionKindEnum {
+    JS_FUNC_NORMAL = 0,
+    JS_FUNC_GENERATOR = (1 << 0),
+    JS_FUNC_ASYNC = (1 << 1),
+    JS_FUNC_ASYNC_GENERATOR = (JS_FUNC_GENERATOR | JS_FUNC_ASYNC),
+} JSFunctionKindEnum;
+
+typedef struct JSFunctionBytecode {
+    JSRefCountHeader header; /* must come first, 32-bit */
+    JSGCHeader gc_header; /* must come after header, 8-bit */
+    uint8_t js_mode;
+    uint8_t has_prototype : 1; /* true if a prototype field is necessary */
+    uint8_t has_simple_parameter_list : 1;
+    uint8_t is_derived_class_constructor : 1;
+    /* true if home_object needs to be initialized */
+    uint8_t need_home_object : 1;
+    uint8_t func_kind : 2;
+    uint8_t new_target_allowed : 1;
+    uint8_t super_call_allowed : 1;
+    uint8_t super_allowed : 1;
+    uint8_t has_debug : 1;
+    uint8_t read_only_bytecode : 1;
+    /* XXX: 5 bits available */
+    uint8_t *byte_code_buf; /* (self pointer) */
+    int byte_code_len;
+    JSAtom func_name;
+    JSVarDef *vardefs; /* arguments + local variables (arg_count + var_count) (self pointer) */
+    JSClosureVar *closure_var; /* list of variables in the closure (self pointer) */
+    uint16_t arg_count;
+    uint16_t var_count;
+    uint16_t defined_arg_count; /* for length function property */
+    uint16_t stack_size; /* maximum stack size */
+    JSValue *cpool; /* constant pool (self pointer) */
+    int cpool_count;
+    int closure_var_count;
+    struct {
+        /* debug info, move to separate structure to save memory? */
+        JSAtom filename;
+        int line_num;
+        int source_len;
+        int pc2line_len;
+        uint8_t *pc2line_buf;
+        char *source;
+    } debug;
+} JSFunctionBytecode;
+
+typedef struct JSBoundFunction {
+    JSValue func_obj;
+    JSValue this_val;
+    int argc;
+    JSValue argv[0];
+} JSBoundFunction;
+
+typedef enum JSIteratorKindEnum {
+    JS_ITERATOR_KIND_KEY,
+    JS_ITERATOR_KIND_VALUE,
+    JS_ITERATOR_KIND_KEY_AND_VALUE,
+} JSIteratorKindEnum;
+
+typedef struct JSForInIterator {
+    JSValue obj;
+    BOOL is_array;
+    uint32_t array_length;
+    uint32_t idx;
+} JSForInIterator;
+
+typedef struct JSRegExp {
+    JSString *pattern;
+    JSString *bytecode; /* also contains the flags */
+} JSRegExp;
+
+typedef struct JSProxyData {
+    JSValue target;
+    JSValue handler;
+    JSValue proto;
+    uint8_t is_func;
+} JSProxyData;
+
+typedef struct JSArrayBuffer {
+    int byte_length; /* 0 if detached */
+    uint8_t detached;
+    uint8_t shared; /* if shared, the array buffer cannot be detached */
+    uint8_t *data; /* NULL if detached */
+    struct list_head array_list;
+    void *opaque;
+    JSFreeArrayBufferDataFunc *free_func;
+} JSArrayBuffer;
+
+typedef struct JSTypedArray {
+    struct list_head link; /* link to arraybuffer */
+    JSObject *obj; /* back pointer to the TypedArray/DataView object */
+    JSObject *buffer; /* based array buffer */
+    uint32_t offset; /* offset in the array buffer */
+    uint32_t length; /* length in the array buffer */
+} JSTypedArray;
+
+typedef struct JSAsyncFunctionState {
+    JSValue this_val; /* 'this' generator argument */
+    int argc; /* number of function arguments */
+    BOOL throw_flag; /* used to throw an exception in JS_CallInternal() */
+    JSStackFrame frame;
+} JSAsyncFunctionState;
+
+/* XXX: could use an object instead to avoid the
+   JS_TAG_ASYNC_FUNCTION tag for the GC */
+typedef struct JSAsyncFunctionData {
+    JSRefCountHeader header; /* must come first, 32-bit */
+    JSGCHeader gc_header; /* must come after JSRefCountHeader, 8-bit */
+    JSValue resolving_funcs[2];
+    BOOL is_active; /* true if the async function state is valid */
+    JSAsyncFunctionState func_state;
+} JSAsyncFunctionData;
+
+typedef struct JSReqModuleEntry {
+    JSAtom module_name;
+    JSModuleDef *module; /* used using resolution */
+} JSReqModuleEntry;
+
+typedef enum JSExportTypeEnum {
+    JS_EXPORT_TYPE_LOCAL,
+    JS_EXPORT_TYPE_INDIRECT,
+} JSExportTypeEnum;
+
+typedef struct JSExportEntry {
+    union {
+        struct {
+            int var_idx; /* closure variable index */
+            JSVarRef *var_ref; /* if != NULL, reference to the variable */
+        } local; /* for local export */
+        int req_module_idx; /* module for indirect export */
+    } u;
+    JSExportTypeEnum export_type;
+    JSAtom local_name; /* not used for local export after compilation */
+    JSAtom export_name; /* exported variable name */
+} JSExportEntry;
+
+typedef struct JSStarExportEntry {
+    int req_module_idx; /* in req_module_entries */
+} JSStarExportEntry;
+
+typedef struct JSImportEntry {
+    int var_idx; /* closure variable index */
+    JSAtom import_name;
+    int req_module_idx; /* in req_module_entries */
+} JSImportEntry;
+
+struct JSModuleDef {
+    JSRefCountHeader header; /* must come first, 32-bit */
+    JSAtom module_name;
+    struct list_head link;
+
+    JSReqModuleEntry *req_module_entries;
+    int req_module_entries_count;
+    int req_module_entries_size;
+
+    JSExportEntry *export_entries;
+    int export_entries_count;
+    int export_entries_size;
+
+    JSStarExportEntry *star_export_entries;
+    int star_export_entries_count;
+    int star_export_entries_size;
+
+    JSImportEntry *import_entries;
+    int import_entries_count;
+    int import_entries_size;
+
+    JSValue module_ns;
+    JSValue func_obj; /* only used for JS modules */
+    JSModuleInitFunc *init_func; /* only used for C modules */
+    BOOL resolved;
+    BOOL instantiated;
+    BOOL evaluated;
+};
+
+typedef struct JSJobEntry {
+    struct list_head link;
+    JSContext *ctx;
+    JSJobFunc *job_func;
+    int argc;
+    JSValue argv[0];
+} JSJobEntry;
+
+typedef struct JSProperty {
+    union {
+        JSValue value;      /* JS_PROP_NORMAL */
+        struct {            /* JS_PROP_GETSET */
+            JSObject *getter; /* NULL if undefined */
+            JSObject *setter; /* NULL if undefined */
+        } getset;
+        JSVarRef *var_ref;  /* JS_PROP_VARREF */
+        struct {            /* JS_PROP_AUTOINIT */
+            int (*init_func)(JSContext *ctx, JSObject *obj,
+                             JSAtom prop, void *opaque);
+            void *opaque;
+        } init;
+    } u;
+} JSProperty;
+
+#define JS_PROP_INITIAL_SIZE 2
+#define JS_PROP_INITIAL_HASH_SIZE 4 /* must be a power of two */
+#define JS_ARRAY_INITIAL_SIZE 2
+
+typedef struct JSShapeProperty {
+    uint32_t hash_next : 26; /* 0 if last in list */
+    uint32_t flags : 6;   /* JS_PROP_XXX */
+    JSAtom atom; /* JS_ATOM_NULL = free property entry */
+} JSShapeProperty;
+
+struct JSShape {
+#if !defined(_MSC_VER)
+    uint32_t prop_hash_end[0]; /* hash table of size hash_mask + 1
+                                  before the start of the structure. */
+#endif
+    JSRefCountHeader header; /* must come first, 32-bit */
+    JSGCHeader gc_header; /* must come after JSRefCountHeader, 8-bit */
+    /* true if the shape is inserted in the shape hash table. If not,
+       JSShape.hash is not valid */
+    uint8_t is_hashed;
+    /* If true, the shape may have small array index properties 'n' with 0
+       <= n <= 2^31-1. If false, the shape is guaranteed not to have
+       small array index properties */
+    uint8_t has_small_array_index;
+    uint32_t hash; /* current hash value */
+    uint32_t prop_hash_mask;
+    int prop_size; /* allocated properties */
+    int prop_count;
+    JSShape *shape_hash_next; /* in JSRuntime.shape_hash[h] list */
+    JSObject *proto;
+    JSShapeProperty prop[0]; /* prop_size elements */
+};
+#if defined(_MSC_VER)
+#define prop_hash_end_field_of_shape(shape) ((uint32_t *)(shape))
+#else
+#define prop_hash_end_field_of_shape(shape) (shape)->prop_hash_end
+#endif
+struct JSObject {
+    JSRefCountHeader header; /* must come first, 32-bit */
+    JSGCHeader gc_header; /* must come after JSRefCountHeader, 8-bit */
+    uint8_t extensible : 1;
+    uint8_t free_mark : 1; /* only used when freeing objects with cycles */
+    uint8_t is_exotic : 1; /* TRUE if object has exotic property handlers */
+    uint8_t fast_array : 1; /* TRUE if u.array is used for get/put */
+    uint8_t is_constructor : 1; /* TRUE if object is a constructor function */
+    uint8_t is_uncatchable_error : 1; /* if TRUE, error is not catchable */
+    uint8_t is_class : 1; /* TRUE if object is a class constructor */
+    uint8_t tmp_mark : 1; /* used in JS_WriteObjectRec() */
+    uint16_t class_id; /* see JS_CLASS_x */
+    /* byte offsets: 8/8 */
+    struct list_head link; /* object list */
+    /* byte offsets: 16/24 */
+    JSShape *shape; /* prototype and property names + flag */
+    JSProperty *prop; /* array of properties */
+    /* byte offsets: 24/40 */
+    struct JSMapRecord *first_weak_ref; /* XXX: use a bit and an external hash table? */
+    /* byte offsets: 28/48 */
+    union {
+        void *opaque;
+        struct JSBoundFunction *bound_function; /* JS_CLASS_BOUND_FUNCTION */
+        struct JSCFunctionDataRecord *c_function_data_record; /* JS_CLASS_C_FUNCTION_DATA */
+        struct JSForInIterator *for_in_iterator; /* JS_CLASS_FOR_IN_ITERATOR */
+        struct JSArrayBuffer *array_buffer; /* JS_CLASS_ARRAY_BUFFER, JS_CLASS_SHARED_ARRAY_BUFFER */
+        struct JSTypedArray *typed_array; /* JS_CLASS_UINT8C_ARRAY..JS_CLASS_DATAVIEW */
+#ifdef CONFIG_BIGNUM
+        struct JSFloatEnv *float_env; /* JS_CLASS_FLOAT_ENV */
+#endif
+        struct JSMapState *map_state;   /* JS_CLASS_MAP..JS_CLASS_WEAKSET */
+        struct JSMapIteratorData *map_iterator_data; /* JS_CLASS_MAP_ITERATOR, JS_CLASS_SET_ITERATOR */
+        struct JSArrayIteratorData *array_iterator_data; /* JS_CLASS_ARRAY_ITERATOR, JS_CLASS_STRING_ITERATOR */
+        struct JSGeneratorData *generator_data; /* JS_CLASS_GENERATOR */
+        struct JSProxyData *proxy_data; /* JS_CLASS_PROXY */
+        struct JSPromiseData *promise_data; /* JS_CLASS_PROMISE */
+        struct JSPromiseFunctionData *promise_function_data; /* JS_CLASS_PROMISE_RESOLVE_FUNCTION, JS_CLASS_PROMISE_REJECT_FUNCTION */
+        struct JSAsyncFunctionData *async_function_data; /* JS_CLASS_ASYNC_FUNCTION_RESOLVE, JS_CLASS_ASYNC_FUNCTION_REJECT */
+        struct JSAsyncFromSyncIteratorData *async_from_sync_iterator_data; /* JS_CLASS_ASYNC_FROM_SYNC_ITERATOR */
+        struct JSAsyncGeneratorData *async_generator_data; /* JS_CLASS_ASYNC_GENERATOR */
+        struct { /* JS_CLASS_BYTECODE_FUNCTION: 12/24 bytes */
+            /* also used by JS_CLASS_GENERATOR_FUNCTION, JS_CLASS_ASYNC_FUNCTION and JS_CLASS_ASYNC_GENERATOR_FUNCTION */
+            struct JSFunctionBytecode *function_bytecode;
+            JSVarRef **var_refs;
+            JSObject *home_object; /* for 'super' access */
+        } func;
+        struct { /* JS_CLASS_C_FUNCTION: 8/12 bytes */
+            JSCFunctionType c_function;
+            uint8_t length;
+            uint8_t cproto;
+            int16_t magic;
+        } cfunc;
+        /* array part for fast arrays and typed arrays */
+        struct { /* JS_CLASS_ARRAY, JS_CLASS_ARGUMENTS, JS_CLASS_UINT8C_ARRAY..JS_CLASS_FLOAT64_ARRAY */
+            union {
+                uint32_t size;          /* JS_CLASS_ARRAY, JS_CLASS_ARGUMENTS */
+                struct JSTypedArray *typed_array; /* JS_CLASS_UINT8C_ARRAY..JS_CLASS_FLOAT64_ARRAY */
+            } u1;
+            union {
+                JSValue *values;        /* JS_CLASS_ARRAY, JS_CLASS_ARGUMENTS */ 
+                void *ptr;              /* JS_CLASS_UINT8C_ARRAY..JS_CLASS_FLOAT64_ARRAY */
+                int8_t *int8_ptr;       /* JS_CLASS_INT8_ARRAY */
+                uint8_t *uint8_ptr;     /* JS_CLASS_UINT8_ARRAY, JS_CLASS_UINT8C_ARRAY */
+                int16_t *int16_ptr;     /* JS_CLASS_INT16_ARRAY */
+                uint16_t *uint16_ptr;   /* JS_CLASS_UINT16_ARRAY */
+                int32_t *int32_ptr;     /* JS_CLASS_INT32_ARRAY */
+                uint32_t *uint32_ptr;   /* JS_CLASS_UINT32_ARRAY */
+                int64_t *int64_ptr;     /* JS_CLASS_INT64_ARRAY */
+                uint64_t *uint64_ptr;   /* JS_CLASS_UINT64_ARRAY */
+                float *float_ptr;       /* JS_CLASS_FLOAT32_ARRAY */
+                double *double_ptr;     /* JS_CLASS_FLOAT64_ARRAY */
+            } u;
+            uint32_t count; /* <= 2^31-1. 0 for a detached typed array */
+        } array;    /* 12/20 bytes */
+        JSRegExp regexp;    /* JS_CLASS_REGEXP: 8/16 bytes */
+        JSValue object_data;    /* for JS_SetObjectData(): 8/16/16 bytes */
+    } u;
+    /* byte sizes: 40/48/72 */
+};
+enum {
+    JS_ATOM_NULL,
+#define DEF(name, str) JS_ATOM_ ## name,
+#include "quickjs-atom.h"
+#undef DEF
+    JS_ATOM_END,
+};
+#define JS_ATOM_LAST_KEYWORD JS_ATOM_super
+#define JS_ATOM_LAST_STRICT_KEYWORD JS_ATOM_yield
+
+static const char js_atom_init[] =
+#define DEF(name, str) str "\0"
+#include "quickjs-atom.h"
+#undef DEF
+;
+
+typedef enum OPCodeFormat {
+#define FMT(f) OP_FMT_ ## f,
+#define DEF(id, size, n_pop, n_push, f)
+#include "quickjs-opcode.h"
+#undef DEF
+#undef FMT
+} OPCodeFormat;
+
+typedef enum OPCodeEnum {
+#define FMT(f)
+#define DEF(id, size, n_pop, n_push, f) OP_ ## id,
+#include "quickjs-opcode.h"
+#undef DEF
+#undef FMT
+    OP_COUNT,
+} OPCodeEnum;
+
+static int JS_InitAtoms(JSRuntime *rt);
+static JSAtom __JS_NewAtomInit(JSRuntime *rt, const char *str, int len,
+                               int atom_type);
+static void JS_FreeAtomStruct(JSRuntime *rt, JSAtomStruct *p);
+static void free_function_bytecode(JSRuntime *rt, JSFunctionBytecode *b);
+static JSValue JS_CallInternal(JSContext *ctx, JSValueConst func_obj,
+                               JSValueConst this_obj, JSValueConst new_target,
+                               int argc, JSValue *argv, int flags);
+static JSValue JS_CallConstructorInternal(JSContext *ctx,
+                                          JSValueConst func_obj,
+                                          JSValueConst new_target,
+                                          int argc, JSValue *argv, int flags);
+static JSValue JS_CallFree(JSContext *ctx, JSValue func_obj, JSValueConst this_obj,
+                           int argc, JSValueConst *argv);
+static JSValue JS_InvokeFree(JSContext *ctx, JSValue this_val, JSAtom atom,
+                             int argc, JSValueConst *argv);
+static __exception int JS_ToArrayLengthFree(JSContext *ctx, uint32_t *plen,
+                                            JSValue val);
+static JSValue JS_EvalObject(JSContext *ctx, JSValueConst this_obj,
+                             JSValueConst val, int flags, int scope_idx);
+#if defined(_MSC_VER)
+JSValue JS_ThrowInternalError(JSContext *ctx, const char *fmt, ...);
+static void JS_DumpAtoms(JSRuntime *rt);
+static void JS_DumpString(JSRuntime *rt,
+                                                  const JSString *p);
+static void JS_DumpObjectHeader(JSRuntime *rt);
+static void JS_DumpObject(JSRuntime *rt, JSObject *p);
+static void JS_DumpValueShort(JSRuntime *rt,
+                                                      JSValueConst val);
+static void JS_DumpValue(JSContext *ctx, JSValueConst val);
+static void JS_PrintValue(JSContext *ctx,
+                                                  const char *str,
+                                                  JSValueConst val);
+static void JS_DumpShapes(JSRuntime *rt);
+#else
+JSValue __attribute__((format(printf, 2, 3))) JS_ThrowInternalError(JSContext *ctx, const char *fmt, ...);
+static __attribute__((unused)) void JS_DumpAtoms(JSRuntime *rt);
+static __attribute__((unused)) void JS_DumpString(JSRuntime *rt,
+                                                  const JSString *p);
+static __attribute__((unused)) void JS_DumpObjectHeader(JSRuntime *rt);
+static __attribute__((unused)) void JS_DumpObject(JSRuntime *rt, JSObject *p);
+static __attribute__((unused)) void JS_DumpValueShort(JSRuntime *rt,
+                                                      JSValueConst val);
+static __attribute__((unused)) void JS_DumpValue(JSContext *ctx, JSValueConst val);
+static __attribute__((unused)) void JS_PrintValue(JSContext *ctx,
+                                                  const char *str,
+                                                  JSValueConst val);
+static __attribute__((unused)) void JS_DumpShapes(JSRuntime *rt);
+#endif
+static JSValue js_function_apply(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv, int magic);
+static void js_array_finalizer(JSRuntime *rt, JSValue val);
+static void js_array_mark(JSRuntime *rt, JSValueConst val,
+                          JS_MarkFunc *mark_func);
+static void js_object_data_finalizer(JSRuntime *rt, JSValue val);
+static void js_object_data_mark(JSRuntime *rt, JSValueConst val,
+                                JS_MarkFunc *mark_func);
+static void js_bytecode_function_finalizer(JSRuntime *rt, JSValue val);
+static void js_bytecode_function_mark(JSRuntime *rt, JSValueConst val,
+                                JS_MarkFunc *mark_func);
+static void js_bound_function_finalizer(JSRuntime *rt, JSValue val);
+static void js_bound_function_mark(JSRuntime *rt, JSValueConst val,
+                                JS_MarkFunc *mark_func);
+static void js_for_in_iterator_finalizer(JSRuntime *rt, JSValue val);
+static void js_for_in_iterator_mark(JSRuntime *rt, JSValueConst val,
+                                JS_MarkFunc *mark_func);
+static void js_regexp_finalizer(JSRuntime *rt, JSValue val);
+static void js_array_buffer_finalizer(JSRuntime *rt, JSValue val);
+static void js_typed_array_finalizer(JSRuntime *rt, JSValue val);
+static void js_typed_array_mark(JSRuntime *rt, JSValueConst val,
+                                JS_MarkFunc *mark_func);
+static void js_proxy_finalizer(JSRuntime *rt, JSValue val);
+static void js_proxy_mark(JSRuntime *rt, JSValueConst val,
+                                JS_MarkFunc *mark_func);
+static void js_map_finalizer(JSRuntime *rt, JSValue val);
+static void js_map_mark(JSRuntime *rt, JSValueConst val,
+                                JS_MarkFunc *mark_func);
+static void js_map_iterator_finalizer(JSRuntime *rt, JSValue val);
+static void js_map_iterator_mark(JSRuntime *rt, JSValueConst val,
+                                JS_MarkFunc *mark_func);
+static void js_array_iterator_finalizer(JSRuntime *rt, JSValue val);
+static void js_array_iterator_mark(JSRuntime *rt, JSValueConst val,
+                                JS_MarkFunc *mark_func);
+static void js_generator_finalizer(JSRuntime *rt, JSValue obj);
+static void js_generator_mark(JSRuntime *rt, JSValueConst val,
+                                JS_MarkFunc *mark_func);
+static void js_promise_finalizer(JSRuntime *rt, JSValue val);
+static void js_promise_mark(JSRuntime *rt, JSValueConst val,
+                                JS_MarkFunc *mark_func);
+static void js_promise_resolve_function_finalizer(JSRuntime *rt, JSValue val);
+static void js_promise_resolve_function_mark(JSRuntime *rt, JSValueConst val,
+                                JS_MarkFunc *mark_func);
+static JSValue js_promise_resolve_function_call(JSContext *ctx,
+                                                JSValueConst func_obj,
+                                                JSValueConst this_val,
+                                                int argc, JSValueConst *argv);
+static JSValue JS_ToStringFree(JSContext *ctx, JSValue val);
+static int JS_ToBoolFree(JSContext *ctx, JSValue val);
+static int JS_ToInt32Free(JSContext *ctx, int32_t *pres, JSValue val);
+static int JS_ToFloat64Free(JSContext *ctx, double *pres, JSValue val);
+static int JS_ToUint8ClampFree(JSContext *ctx, int32_t *pres, JSValue val);
+static JSValue js_compile_regexp(JSContext *ctx, JSValueConst pattern,
+                                 JSValueConst flags);
+static JSValue js_regexp_constructor_internal(JSContext *ctx, JSValueConst ctor,
+                                              JSValue pattern, JSValue bc);
+static void gc_decref(JSRuntime *rt);
+static int JS_NewClass1(JSRuntime *rt, JSClassID class_id,
+                        const JSClassDef *class_def, JSAtom name);
+
+typedef enum JSStrictEqModeEnum {
+    JS_EQ_STRICT,
+    JS_EQ_SAME_VALUE,
+    JS_EQ_SAME_VALUE_ZERO,
+} JSStrictEqModeEnum;
+
+static BOOL js_strict_eq2(JSContext *ctx, JSValue op1, JSValue op2,
+                          JSStrictEqModeEnum eq_mode);
+static BOOL js_strict_eq(JSContext *ctx, JSValue op1, JSValue op2);
+static BOOL js_same_value(JSContext *ctx, JSValueConst op1, JSValueConst op2);
+static BOOL js_same_value_zero(JSContext *ctx, JSValueConst op1, JSValueConst op2);
+static JSValue JS_ToObject(JSContext *ctx, JSValueConst val);
+static JSValue JS_ToObjectFree(JSContext *ctx, JSValue val);
+static JSProperty *add_property(JSContext *ctx,
+                                JSObject *p, JSAtom prop, int prop_flags);
+#ifdef CONFIG_BIGNUM
+static void js_float_env_finalizer(JSRuntime *rt, JSValue val);
+static JSValue JS_NewBigInt64(JSContext *ctx, int64_t v);
+static JSValue JS_NewBigUint64(JSContext *ctx, uint64_t v);
+static JSValue JS_NewBigFloat(JSContext *ctx, bf_t *a);
+static JSValue JS_NewBigInt2(JSContext *ctx, bf_t *a, BOOL force_bigint);
+static JSValue JS_NewBigInt(JSContext *ctx, bf_t *a);
+static int JS_ToBigInt64Free(JSContext *ctx, int64_t *pres, JSValue val);
+static int JS_ToBigInt64(JSContext *ctx, int64_t *pres, JSValueConst val);
+static bf_t *JS_ToBigFloat(JSContext *ctx, BOOL *pis_float, bf_t *buf,
+                           JSValueConst val);
+#endif
+JSValue JS_ThrowOutOfMemory(JSContext *ctx);
+static JSValue js_proxy_call(JSContext *ctx, JSValueConst func_obj,
+                             JSValueConst this_obj,
+                             int argc, JSValueConst *argv);
+static JSValue js_proxy_call_constructor(JSContext *ctx, JSValueConst func_obj,
+                                         JSValueConst new_target,
+                                         int argc, JSValueConst *argv);
+static JSValueConst js_proxy_getPrototypeOf(JSContext *ctx, JSValueConst obj);
+static int js_proxy_setPrototypeOf(JSContext *ctx, JSValueConst obj,
+                                   JSValueConst proto_val, BOOL throw_flag);
+static int js_proxy_isExtensible(JSContext *ctx, JSValueConst obj);
+static int js_proxy_preventExtensions(JSContext *ctx, JSValueConst obj);
+static int js_proxy_isArray(JSContext *ctx, JSValueConst obj);
+static int JS_CreateProperty(JSContext *ctx, JSObject *p,
+                             JSAtom prop, JSValueConst val,
+                             JSValueConst getter, JSValueConst setter,
+                             int flags);
+static int js_string_memcmp(const JSString *p1, const JSString *p2, int len);
+static void reset_weak_ref(JSRuntime *rt, JSObject *p);
+static BOOL typed_array_is_detached(JSContext *ctx, JSObject *p);
+static uint32_t typed_array_get_length(JSContext *ctx, JSObject *p);
+static JSValue JS_ThrowTypeErrorDetachedArrayBuffer(JSContext *ctx);
+static JSVarRef *get_var_ref(JSContext *ctx, JSStackFrame *sf, int var_idx,
+                             BOOL is_arg);
+static JSValue js_generator_function_call(JSContext *ctx, JSValueConst func_obj,
+                                          JSValueConst this_obj,
+                                          int argc, JSValueConst *argv);
+static void js_async_function_resolve_finalizer(JSRuntime *rt, JSValue val);
+static void js_async_function_resolve_mark(JSRuntime *rt, JSValueConst val,
+                                           JS_MarkFunc *mark_func);
+static JSValue JS_EvalInternal(JSContext *ctx, JSValueConst this_obj,
+                               const char *input, size_t input_len,
+                               const char *filename, int flags, int scope_idx);
+static void js_free_module_def(JSContext *ctx, JSModuleDef *m);
+static void free_var_ref(JSRuntime *rt, JSVarRef *var_ref);
+static JSValue js_new_promise_capability(JSContext *ctx,
+                                         JSValue *resolving_funcs,
+                                         JSValueConst ctor);
+static __exception int perform_promise_then(JSContext *ctx,
+                                            JSValueConst promise,
+                                            JSValueConst *resolve_reject,
+                                            JSValueConst *cap_resolving_funcs);
+static int js_string_compare(JSContext *ctx,
+                             const JSString *p1, const JSString *p2);
+static JSValue JS_ToNumber(JSContext *ctx, JSValueConst val);
+static int JS_SetPropertyValue(JSContext *ctx, JSValueConst this_obj,
+                               JSValue prop, JSValue val, int flags);
+static int JS_NumberIsInteger(JSContext *ctx, JSValueConst val);
+static BOOL JS_NumberIsNegativeOrMinusZero(JSContext *ctx, JSValueConst val);
+static JSValue JS_ToNumberFree(JSContext *ctx, JSValue val);
+static int JS_GetOwnProperty(JSContext *ctx, JSPropertyDescriptor *desc,
+                             JSObject *p, JSAtom prop);
+static void js_free_desc(JSContext *ctx, JSPropertyDescriptor *desc);
+static void async_func_mark(JSRuntime *rt, JSAsyncFunctionState *s,
+                            JS_MarkFunc *mark_func);
+static void JS_AddIntrinsicBasicObjects(JSContext *ctx);
+static void js_free_shape(JSRuntime *rt, JSShape *sh);
+static void js_free_shape_null(JSRuntime *rt, JSShape *sh);
+static int js_shape_prepare_update(JSContext *ctx, JSObject *p,
+                                   JSShapeProperty **pprs);
+static int init_shape_hash(JSRuntime *rt);
+static __exception int js_get_length32(JSContext *ctx, uint32_t *pres,
+                                       JSValueConst obj);
+static __exception int js_get_length64(JSContext *ctx, int64_t *pres,
+                                       JSValueConst obj);
+static JSValue JS_CreateAsyncFromSyncIterator(JSContext *ctx,
+                                              JSValueConst sync_iter);
+static void js_c_function_data_finalizer(JSRuntime *rt, JSValue val);
+static void js_c_function_data_mark(JSRuntime *rt, JSValueConst val,
+                                    JS_MarkFunc *mark_func);
+static JSValue js_c_function_data_call(JSContext *ctx, JSValueConst func_obj,
+                                       JSValueConst this_val,
+                                       int argc, JSValueConst *argv);
+
+static const JSClassExoticMethods js_arguments_exotic_methods;
+static const JSClassExoticMethods js_string_exotic_methods;
+static const JSClassExoticMethods js_proxy_exotic_methods;
+static const JSClassExoticMethods js_module_ns_exotic_methods;
+static JSClassID js_class_id_alloc = JS_CLASS_INIT_COUNT;
+
+JS_BOOL JS_IsNumber(JSValueConst v)
+{
+#ifdef CONFIG_BIGNUM
+    int tag = JS_VALUE_GET_TAG(v);
+    return tag == JS_TAG_INT || tag == JS_TAG_BIG_INT ||
+        tag == JS_TAG_BIG_FLOAT || JS_TAG_IS_FLOAT64(tag);
+#else
+    int tag = JS_VALUE_GET_TAG(v);
+    return tag == JS_TAG_INT || JS_TAG_IS_FLOAT64(tag);
+#endif
+}
+
+static void js_trigger_gc(JSRuntime *rt, size_t size)
+{
+    BOOL force_gc;
+#ifdef FORCE_GC_AT_MALLOC
+    force_gc = TRUE;
+#else
+    force_gc = ((rt->malloc_state.malloc_size + size) >
+                rt->malloc_gc_threshold);
+#endif
+    if (force_gc) {
+#ifdef DUMP_GC
+        printf("GC: size=%" PRIu64 "\n",
+               (uint64_t)rt->malloc_state.malloc_size);
+#endif
+        JS_RunGC(rt);
+        rt->malloc_gc_threshold = rt->malloc_state.malloc_size +
+            (rt->malloc_state.malloc_size >> 1);
+    }
+}
+
+static size_t js_malloc_usable_size_unknown(const void *ptr)
+{
+    return 0;
+}
+
+void *js_malloc_rt(JSRuntime *rt, size_t size)
+{
+    return rt->mf.js_malloc(&rt->malloc_state, size);
+}
+
+void js_free_rt(JSRuntime *rt, void *ptr)
+{
+    rt->mf.js_free(&rt->malloc_state, ptr);
+}
+
+void *js_realloc_rt(JSRuntime *rt, void *ptr, size_t size)
+{
+    return rt->mf.js_realloc(&rt->malloc_state, ptr, size);
+}
+
+size_t js_malloc_usable_size_rt(JSRuntime *rt, const void *ptr)
+{
+    return rt->mf.js_malloc_usable_size(ptr);
+}
+
+void *js_mallocz_rt(JSRuntime *rt, size_t size)
+{
+    void *ptr;
+    ptr = js_malloc_rt(rt, size);
+    if (!ptr)
+        return NULL;
+    return memset(ptr, 0, size);
+}
+
+#ifdef CONFIG_BIGNUM
+/* called by libbf */
+static void *js_bf_realloc(void *opaque, void *ptr, size_t size)
+{
+    JSRuntime *rt = opaque;
+    return js_realloc_rt(rt, ptr, size);
+}
+#endif /* CONFIG_BIGNUM */
+
+/* Throw out of memory in case of error */
+void *js_malloc(JSContext *ctx, size_t size)
+{
+    void *ptr;
+    ptr = js_malloc_rt(ctx->rt, size);
+    if (unlikely(!ptr)) {
+        JS_ThrowOutOfMemory(ctx);
+        return NULL;
+    }
+    return ptr;
+}
+
+/* Throw out of memory in case of error */
+void *js_mallocz(JSContext *ctx, size_t size)
+{
+    void *ptr;
+    ptr = js_mallocz_rt(ctx->rt, size);
+    if (unlikely(!ptr)) {
+        JS_ThrowOutOfMemory(ctx);
+        return NULL;
+    }
+    return ptr;
+}
+
+void js_free(JSContext *ctx, void *ptr)
+{
+    js_free_rt(ctx->rt, ptr);
+}
+
+/* Throw out of memory in case of error */
+void *js_realloc(JSContext *ctx, void *ptr, size_t size)
+{
+    void *ret;
+    ret = js_realloc_rt(ctx->rt, ptr, size);
+    if (unlikely(!ret && size != 0)) {
+        JS_ThrowOutOfMemory(ctx);
+        return NULL;
+    }
+    return ret;
+}
+
+/* store extra allocated size in *pslack if successful */
+void *js_realloc2(JSContext *ctx, void *ptr, size_t size, size_t *pslack)
+{
+    void *ret;
+    ret = js_realloc_rt(ctx->rt, ptr, size);
+    if (unlikely(!ret && size != 0)) {
+        JS_ThrowOutOfMemory(ctx);
+        return NULL;
+    }
+    if (pslack) {
+        size_t new_size = js_malloc_usable_size_rt(ctx->rt, ret);
+        *pslack = (new_size > size) ? new_size - size : 0;
+    }
+    return ret;
+}
+
+size_t js_malloc_usable_size(JSContext *ctx, const void *ptr)
+{
+    return js_malloc_usable_size_rt(ctx->rt, ptr);
+}
+
+/* Throw out of memory exception in case of error */
+char *js_strndup(JSContext *ctx, const char *s, size_t n)
+{
+    char *ptr;
+    ptr = js_malloc(ctx, n + 1);
+    if (ptr) {
+        memcpy(ptr, s, n);
+        ptr[n] = '\0';
+    }
+    return ptr;
+}
+
+char *js_strdup(JSContext *ctx, const char *str)
+{
+    return js_strndup(ctx, str, strlen(str));
+}
+
+static inline void js_dbuf_init(JSContext *ctx, DynBuf *s)
+{
+    dbuf_init2(s, ctx->rt, (DynBufReallocFunc *)js_realloc_rt);
+}
+
+static inline int is_digit(int c) {
+    return c >= '0' && c <= '9';
+}
+
+typedef struct JSClassShortDef {
+    JSAtom class_name;
+    JSClassFinalizer *finalizer;
+    JSClassGCMark *gc_mark;
+} JSClassShortDef;
+
+static JSClassShortDef const js_std_class_def[] = {
+    { JS_ATOM_Object, NULL, NULL },                             /* JS_CLASS_OBJECT */
+    { JS_ATOM_Array, js_array_finalizer, js_array_mark },       /* JS_CLASS_ARRAY */
+    { JS_ATOM_Error, NULL, NULL },                              /* JS_CLASS_ERROR */
+    { JS_ATOM_Number, js_object_data_finalizer, js_object_data_mark }, /* JS_CLASS_NUMBER */
+    { JS_ATOM_String, js_object_data_finalizer, js_object_data_mark }, /* JS_CLASS_STRING */
+    { JS_ATOM_Boolean, js_object_data_finalizer, js_object_data_mark }, /* JS_CLASS_BOOLEAN */
+    { JS_ATOM_Symbol, js_object_data_finalizer, js_object_data_mark }, /* JS_CLASS_SYMBOL */
+    { JS_ATOM_Arguments, js_array_finalizer, js_array_mark },   /* JS_CLASS_ARGUMENTS */
+    { JS_ATOM_Arguments, NULL, NULL },                          /* JS_CLASS_MAPPED_ARGUMENTS */
+    { JS_ATOM_Date, js_object_data_finalizer, js_object_data_mark }, /* JS_CLASS_DATE */
+    { JS_ATOM_Object, NULL, NULL },                             /* JS_CLASS_MODULE_NS */
+    { JS_ATOM_Function, NULL, NULL },                           /* JS_CLASS_C_FUNCTION */
+    { JS_ATOM_Function, js_bytecode_function_finalizer, js_bytecode_function_mark }, /* JS_CLASS_BYTECODE_FUNCTION */
+    { JS_ATOM_Function, js_bound_function_finalizer, js_bound_function_mark }, /* JS_CLASS_BOUND_FUNCTION */
+    { JS_ATOM_Function, js_c_function_data_finalizer, js_c_function_data_mark }, /* JS_CLASS_C_FUNCTION_DATA */
+    { JS_ATOM_GeneratorFunction, js_bytecode_function_finalizer, js_bytecode_function_mark },  /* JS_CLASS_GENERATOR_FUNCTION */
+    { JS_ATOM_ForInIterator, js_for_in_iterator_finalizer, js_for_in_iterator_mark },      /* JS_CLASS_FOR_IN_ITERATOR */
+    { JS_ATOM_RegExp, js_regexp_finalizer, NULL },                              /* JS_CLASS_REGEXP */
+    { JS_ATOM_ArrayBuffer, js_array_buffer_finalizer, NULL },                   /* JS_CLASS_ARRAY_BUFFER */
+    { JS_ATOM_SharedArrayBuffer, js_array_buffer_finalizer, NULL },             /* JS_CLASS_SHARED_ARRAY_BUFFER */
+    { JS_ATOM_Uint8ClampedArray, js_typed_array_finalizer, js_typed_array_mark }, /* JS_CLASS_UINT8C_ARRAY */
+    { JS_ATOM_Int8Array, js_typed_array_finalizer, js_typed_array_mark },       /* JS_CLASS_INT8_ARRAY */
+    { JS_ATOM_Uint8Array, js_typed_array_finalizer, js_typed_array_mark },      /* JS_CLASS_UINT8_ARRAY */
+    { JS_ATOM_Int16Array, js_typed_array_finalizer, js_typed_array_mark },      /* JS_CLASS_INT16_ARRAY */
+    { JS_ATOM_Uint16Array, js_typed_array_finalizer, js_typed_array_mark },     /* JS_CLASS_UINT16_ARRAY */
+    { JS_ATOM_Int32Array, js_typed_array_finalizer, js_typed_array_mark },      /* JS_CLASS_INT32_ARRAY */
+    { JS_ATOM_Uint32Array, js_typed_array_finalizer, js_typed_array_mark },     /* JS_CLASS_UINT32_ARRAY */
+#ifdef CONFIG_BIGNUM
+    { JS_ATOM_BigInt64Array, js_typed_array_finalizer, js_typed_array_mark },   /* JS_CLASS_BIG_INT64_ARRAY */
+    { JS_ATOM_BigUint64Array, js_typed_array_finalizer, js_typed_array_mark },  /* JS_CLASS_BIG_UINT64_ARRAY */
+#endif
+    { JS_ATOM_Float32Array, js_typed_array_finalizer, js_typed_array_mark },    /* JS_CLASS_FLOAT32_ARRAY */
+    { JS_ATOM_Float64Array, js_typed_array_finalizer, js_typed_array_mark },    /* JS_CLASS_FLOAT64_ARRAY */
+    { JS_ATOM_DataView, js_typed_array_finalizer, js_typed_array_mark },        /* JS_CLASS_DATAVIEW */
+#ifdef CONFIG_BIGNUM
+    { JS_ATOM_BigInt, js_object_data_finalizer, js_object_data_mark },      /* JS_CLASS_BIG_INT */
+    { JS_ATOM_BigFloat, js_object_data_finalizer, js_object_data_mark },    /* JS_CLASS_BIG_FLOAT */
+    { JS_ATOM_BigFloatEnv, js_float_env_finalizer, NULL },      /* JS_CLASS_FLOAT_ENV */
+#endif
+    { JS_ATOM_Map, js_map_finalizer, js_map_mark },             /* JS_CLASS_MAP */
+    { JS_ATOM_Set, js_map_finalizer, js_map_mark },             /* JS_CLASS_SET */
+    { JS_ATOM_WeakMap, js_map_finalizer, js_map_mark },         /* JS_CLASS_WEAKMAP */
+    { JS_ATOM_WeakSet, js_map_finalizer, js_map_mark },         /* JS_CLASS_WEAKSET */
+    { JS_ATOM_Map_Iterator, js_map_iterator_finalizer, js_map_iterator_mark }, /* JS_CLASS_MAP_ITERATOR */
+    { JS_ATOM_Set_Iterator, js_map_iterator_finalizer, js_map_iterator_mark }, /* JS_CLASS_SET_ITERATOR */
+    { JS_ATOM_Array_Iterator, js_array_iterator_finalizer, js_array_iterator_mark }, /* JS_CLASS_ARRAY_ITERATOR */
+    { JS_ATOM_String_Iterator, js_array_iterator_finalizer, js_array_iterator_mark }, /* JS_CLASS_STRING_ITERATOR */
+    { JS_ATOM_Generator, js_generator_finalizer, js_generator_mark }, /* JS_CLASS_GENERATOR */
+};
+
+static int init_class_range(JSRuntime *rt, JSClassShortDef const *tab,
+                            int start, int count)
+{
+    JSClassDef cm_s, *cm = &cm_s;
+    int i, class_id;
+
+    for(i = 0; i < count; i++) {
+        class_id = i + start;
+        memset(cm, 0, sizeof(*cm));
+        cm->finalizer = tab[i].finalizer;
+        cm->gc_mark = tab[i].gc_mark;
+        if (JS_NewClass1(rt, class_id, cm, tab[i].class_name) < 0)
+            return -1;
+    }
+    return 0;
+}
+
+JSRuntime *JS_NewRuntime2(const JSMallocFunctions *mf, void *opaque)
+{
+    JSRuntime *rt;
+    JSMallocState ms;
+
+    memset(&ms, 0, sizeof(ms));
+    ms.opaque = opaque;
+    ms.malloc_limit = -1;
+
+    rt = mf->js_malloc(&ms, sizeof(JSRuntime));
+    if (!rt)
+        return NULL;
+    memset(rt, 0, sizeof(*rt));
+    rt->mf = *mf;
+    if (!rt->mf.js_malloc_usable_size) {
+        /* use dummy function if none provided */
+        rt->mf.js_malloc_usable_size = js_malloc_usable_size_unknown;
+    }
+    rt->malloc_state = ms;
+    rt->malloc_gc_threshold = 256 * 1024;
+
+#ifdef CONFIG_BIGNUM
+    bf_context_init(&rt->bf_ctx, js_bf_realloc, rt);
+#endif
+
+    init_list_head(&rt->context_list);
+    init_list_head(&rt->obj_list);
+#ifdef DUMP_LEAKS
+    init_list_head(&rt->string_list);
+#endif
+    init_list_head(&rt->job_list);
+
+    if (JS_InitAtoms(rt))
+        goto fail;
+
+    /* create the object, array and function classes */
+    if (init_class_range(rt, js_std_class_def, JS_CLASS_OBJECT,
+                         countof(js_std_class_def)) < 0)
+        goto fail;
+    rt->class_array[JS_CLASS_ARGUMENTS].exotic = &js_arguments_exotic_methods;
+    rt->class_array[JS_CLASS_STRING].exotic = &js_string_exotic_methods;
+    rt->class_array[JS_CLASS_MODULE_NS].exotic = &js_module_ns_exotic_methods;
+
+    rt->class_array[JS_CLASS_C_FUNCTION_DATA].call = js_c_function_data_call;
+    rt->class_array[JS_CLASS_GENERATOR_FUNCTION].call = js_generator_function_call;
+    if (init_shape_hash(rt))
+        goto fail;
+    return rt;
+ fail:
+    JS_FreeRuntime(rt);
+    return NULL;
+}
+
+/* default memory allocation functions with memory limitation */
+static inline size_t js_def_malloc_usable_size(void *ptr)
+{
+#if defined(__APPLE__)
+    return malloc_size(ptr);
+#elif defined(_WIN32)
+    return _msize(ptr);
+#elif defined(EMSCRIPTEN)
+    return 0;
+#elif defined(__linux__)
+    return malloc_usable_size(ptr);
+#else
+    /* change this to `return 0;` if compilation fails */
+    return malloc_usable_size(ptr);
+#endif
+}
+
+static void *js_def_malloc(JSMallocState *s, size_t size)
+{
+    void *ptr;
+
+    /* Do not allocate zero bytes: behavior is platform dependent */
+    assert(size != 0);
+
+    if (unlikely(s->malloc_size + size > s->malloc_limit))
+        return NULL;
+
+    ptr = malloc(size);
+    if (!ptr)
+        return NULL;
+
+    s->malloc_count++;
+    s->malloc_size += js_def_malloc_usable_size(ptr) + MALLOC_OVERHEAD;
+    return ptr;
+}
+
+static void js_def_free(JSMallocState *s, void *ptr)
+{
+    if (!ptr)
+        return;
+
+    s->malloc_count--;
+    s->malloc_size -= js_def_malloc_usable_size(ptr) + MALLOC_OVERHEAD;
+    free(ptr);
+}
+
+static void *js_def_realloc(JSMallocState *s, void *ptr, size_t size)
+{
+    size_t old_size;
+
+    if (!ptr) {
+        if (size == 0)
+            return NULL;
+        return js_def_malloc(s, size);
+    }
+    old_size = js_def_malloc_usable_size(ptr);
+    if (size == 0) {
+        s->malloc_count--;
+        s->malloc_size -= old_size + MALLOC_OVERHEAD;
+        free(ptr);
+        return NULL;
+    }
+    if (s->malloc_size + size - old_size > s->malloc_limit)
+        return NULL;
+
+    ptr = realloc(ptr, size);
+    if (!ptr)
+        return NULL;
+
+    s->malloc_size += js_def_malloc_usable_size(ptr) - old_size;
+    return ptr;
+}
+
+static const JSMallocFunctions def_malloc_funcs = {
+    js_def_malloc,
+    js_def_free,
+    js_def_realloc,
+#if defined(__APPLE__)
+    malloc_size,
+#elif defined(_WIN32)
+    (size_t (*)(const void *))_msize,
+#elif defined(EMSCRIPTEN)
+    NULL,
+#elif defined(__linux__)
+    (size_t (*)(const void *))malloc_usable_size,
+#else
+    /* change this to `NULL,` if compilation fails */
+    malloc_usable_size,
+#endif
+};
+
+JSRuntime *JS_NewRuntime(void)
+{
+    return JS_NewRuntime2(&def_malloc_funcs, NULL);
+}
+
+void JS_SetMemoryLimit(JSRuntime *rt, size_t limit)
+{
+    rt->malloc_state.malloc_limit = limit;
+}
+
+/* use -1 to disable automatic GC */
+void JS_SetGCThreshold(JSRuntime *rt, size_t gc_threshold)
+{
+    rt->malloc_gc_threshold = gc_threshold;
+}
+
+#define malloc(s) malloc_is_forbidden(s)
+#define free(p) free_is_forbidden(p)
+#define realloc(p,s) realloc_is_forbidden(p,s)
+
+void JS_SetInterruptHandler(JSRuntime *rt, JSInterruptHandler *cb, void *opaque)
+{
+    rt->interrupt_handler = cb;
+    rt->interrupt_opaque = opaque;
+}
+
+void JS_SetCanBlock(JSRuntime *rt, BOOL can_block)
+{
+    rt->can_block = can_block;
+}
+
+/* return 0 if OK, < 0 if exception */
+int JS_EnqueueJob(JSContext *ctx, JSJobFunc *job_func,
+                  int argc, JSValueConst *argv)
+{
+    JSRuntime *rt = ctx->rt;
+    JSJobEntry *e;
+    int i;
+
+    e = js_malloc(ctx, sizeof(*e) + argc * sizeof(JSValue));
+    if (!e)
+        return -1;
+    e->ctx = ctx;
+    e->job_func = job_func;
+    e->argc = argc;
+    for(i = 0; i < argc; i++) {
+        e->argv[i] = JS_DupValue(ctx, argv[i]);
+    }
+    list_add_tail(&e->link, &rt->job_list);
+    return 0;
+}
+
+BOOL JS_IsJobPending(JSRuntime *rt)
+{
+    return !list_empty(&rt->job_list);
+}
+
+/* return < 0 if exception, 0 if no job pending, 1 if a job was
+   executed successfully. the context of the job is stored in '*pctx' */
+int JS_ExecutePendingJob(JSRuntime *rt, JSContext **pctx)
+{
+    JSContext *ctx;
+    JSJobEntry *e;
+    JSValue res;
+    int i, ret;
+
+    if (list_empty(&rt->job_list)) {
+        *pctx = NULL;
+        return 0;
+    }
+
+    /* get the first pending job and execute it */
+    e = list_entry(rt->job_list.next, JSJobEntry, link);
+    list_del(&e->link);
+    ctx = e->ctx;
+    res = e->job_func(e->ctx, e->argc, (JSValueConst *)e->argv);
+    for(i = 0; i < e->argc; i++)
+        JS_FreeValue(ctx, e->argv[i]);
+    if (JS_IsException(res))
+        ret = -1;
+    else
+        ret = 1;
+    JS_FreeValue(ctx, res);
+    js_free(ctx, e);
+    *pctx = ctx;
+    return ret;
+}
+
+static inline uint32_t atom_get_free(const JSAtomStruct *p)
+{
+    return (uintptr_t)p >> 1;
+}
+
+static inline BOOL atom_is_free(const JSAtomStruct *p)
+{
+    return (uintptr_t)p & 1;
+}
+
+static inline JSAtomStruct *atom_set_free(uint32_t v)
+{
+    return (JSAtomStruct *)(((uintptr_t)v << 1) | 1);
+}
+
+/* Note: the string contents are uninitialized */
+static JSString *js_alloc_string_rt(JSRuntime *rt, int max_len, int is_wide_char)
+{
+    JSString *str;
+    str = js_malloc_rt(rt, sizeof(JSString) + (max_len << is_wide_char) + 1 - is_wide_char);
+    if (unlikely(!str))
+        return NULL;
+    str->header.ref_count = 1;
+    str->is_wide_char = is_wide_char;
+    str->len = max_len;
+    str->atom_type = 0;
+    str->hash = 0;          /* optional but costless */
+    str->hash_next = 0;     /* optional */
+#ifdef DUMP_LEAKS
+    list_add_tail(&str->link, &rt->string_list);
+#endif
+    return str;
+}
+
+static JSString *js_alloc_string(JSContext *ctx, int max_len, int is_wide_char)
+{
+    JSString *p;
+    p = js_alloc_string_rt(ctx->rt, max_len, is_wide_char);
+    if (unlikely(!p)) {
+        JS_ThrowOutOfMemory(ctx);
+        return NULL;
+    }
+    return p;
+}
+
+/* same as JS_FreeValueRT() but faster */
+static inline void js_free_string(JSRuntime *rt, JSString *str)
+{
+    if (--str->header.ref_count <= 0) {
+        if (str->atom_type) {
+            JS_FreeAtomStruct(rt, str);
+        } else {
+#ifdef DUMP_LEAKS
+            list_del(&str->link);
+#endif
+            js_free_rt(rt, str);
+        }
+    }
+}
+
+void JS_SetRuntimeInfo(JSRuntime *rt, const char *s)
+{
+    if (rt)
+        rt->rt_info = s;
+}
+
+void JS_FreeRuntime(JSRuntime *rt)
+{
+    struct list_head *el, *el1;
+    int i;
+
+    list_for_each_safe(el, el1, &rt->context_list) {
+        JSContext *ctx = list_entry(el, JSContext, link);
+        JS_FreeContext(ctx);
+    }
+
+    list_for_each_safe(el, el1, &rt->job_list) {
+        JSJobEntry *e = list_entry(el, JSJobEntry, link);
+        for(i = 0; i < e->argc; i++)
+            JS_FreeValueRT(rt, e->argv[i]);
+        js_free_rt(rt, e);
+    }
+    init_list_head(&rt->job_list);
+
+    JS_RunGC(rt);
+
+#ifdef DUMP_LEAKS
+    /* leaking objects */
+    {
+        BOOL header_done;
+        JSObject *p;
+        int count;
+
+        /* remove the internal refcounts to display only the object
+           referenced externally */
+        list_for_each(el, &rt->obj_list) {
+            p = list_entry(el, JSObject, link);
+            p->gc_header.mark = 0;
+        }
+        gc_decref(rt);
+
+        header_done = FALSE;
+        list_for_each(el, &rt->obj_list) {
+            p = list_entry(el, JSObject, link);
+            if (p->header.ref_count != 0) {
+                if (!header_done) {
+                    printf("Object leaks:\n");
+                    JS_DumpObjectHeader(rt);
+                    header_done = TRUE;
+                }
+                JS_DumpObject(rt, p);
+            }
+        }
+
+        count = 0;
+        list_for_each(el, &rt->obj_list) {
+            p = list_entry(el, JSObject, link);
+            if (p->header.ref_count == 0) {
+                count++;
+            }
+        }
+        if (count != 0)
+            printf("Secondary object leaks: %d\n", count);
+    }
+#endif
+    assert(list_empty(&rt->obj_list));
+
+    /* free the classes */
+    for(i = 0; i < rt->class_count; i++) {
+        JSClass *cl = &rt->class_array[i];
+        if (cl->class_id != 0) {
+            JS_FreeAtomRT(rt, cl->class_name);
+        }
+    }
+    js_free_rt(rt, rt->class_array);
+
+#ifdef CONFIG_BIGNUM
+    bf_context_end(&rt->bf_ctx);
+#endif
+
+#ifdef DUMP_LEAKS
+    /* only the atoms defined in JS_InitAtoms() should be left */
+    {
+        BOOL header_done = FALSE;
+
+        for(i = 0; i < rt->atom_size; i++) {
+            JSAtomStruct *p = rt->atom_array[i];
+            if (!atom_is_free(p) /* && p->str*/) {
+                if (i >= JS_ATOM_END || p->header.ref_count != 1) {
+                    if (!header_done) {
+                        header_done = TRUE;
+                        if (rt->rt_info) {
+                            printf("%s:1: atom leakage:", rt->rt_info);
+                        } else {
+                            printf("Atom leaks:\n"
+                                   "    %6s %6s %s\n",
+                                   "ID", "REFCNT", "NAME");
+                        }
+                    }
+                    if (rt->rt_info) {
+                        printf(" ");
+                    } else {
+                        printf("    %6u %6u ", i, p->header.ref_count);
+                    }
+                    switch (p->atom_type) {
+                    case JS_ATOM_TYPE_STRING:
+                        JS_DumpString(rt, p);
+                        break;
+                    case JS_ATOM_TYPE_GLOBAL_SYMBOL:
+                        printf("Symbol.for(");
+                        JS_DumpString(rt, p);
+                        printf(")");
+                        break;
+                    case JS_ATOM_TYPE_SYMBOL:
+                        printf("Symbol(");
+                        JS_DumpString(rt, p);
+                        printf(")");
+                        break;
+                    }
+                    if (rt->rt_info) {
+                        printf(":%u", p->header.ref_count);
+                    } else {
+                        printf("\n");
+                    }
+                }
+            }
+        }
+        if (rt->rt_info && header_done)
+            printf("\n");
+    }
+#endif
+
+    /* free the atoms */
+    for(i = 0; i < rt->atom_size; i++) {
+        JSAtomStruct *p = rt->atom_array[i];
+        if (!atom_is_free(p)) {
+#ifdef DUMP_LEAKS
+            list_del(&p->link);
+#endif
+            js_free_rt(rt, p);
+        }
+    }
+    js_free_rt(rt, rt->atom_array);
+    js_free_rt(rt, rt->atom_hash);
+    js_free_rt(rt, rt->shape_hash);
+#ifdef DUMP_LEAKS
+    if (!list_empty(&rt->string_list)) {
+        if (rt->rt_info) {
+            printf("%s:1: string leakage:", rt->rt_info);
+        } else {
+            printf("String leaks:\n"
+                   "    %6s %s\n",
+                   "REFCNT", "VALUE");
+        }
+        list_for_each_safe(el, el1, &rt->string_list) {
+            JSString *str = list_entry(el, JSString, link);
+            if (rt->rt_info) {
+                printf(" ");
+            } else {
+                printf("    %6u ", str->header.ref_count);
+            }
+            JS_DumpString(rt, str);
+            if (rt->rt_info) {
+                printf(":%u", str->header.ref_count);
+            } else {
+                printf("\n");
+            }
+            list_del(&str->link);
+            js_free_rt(rt, str);
+        }
+        if (rt->rt_info)
+            printf("\n");
+    }
+    {
+        JSMallocState *s = &rt->malloc_state;
+        if (s->malloc_count > 1) {
+            if (rt->rt_info)
+                printf("%s:1: ", rt->rt_info);
+            printf("Memory leak: %"PRIu64" bytes lost in %"PRIu64" block%s\n",
+                   (uint64_t)(s->malloc_size - sizeof(JSRuntime)),
+                   (uint64_t)(s->malloc_count - 1), &"s"[s->malloc_count == 2]);
+        }
+    }
+#endif
+
+    {
+        JSMallocState ms = rt->malloc_state;
+        rt->mf.js_free(&ms, rt);
+    }
+}
+
+#if defined(_MSC_VER)
+static inline uint8_t *js_get_stack_pointer(void)
+{
+    return NULL;
+}
+
+static inline BOOL js_check_stack_overflow(JSContext *ctx, size_t alloca_size)
+{
+    return FALSE;
+}
+#else
+#if defined(EMSCRIPTEN)
+/* currently no stack limitation */
+static inline uint8_t *js_get_stack_pointer(void)
+{
+    return NULL;
+}
+
+static inline BOOL js_check_stack_overflow(JSContext *ctx, size_t alloca_size)
+{
+    return FALSE;
+}
+#else
+/* Note: OS and CPU dependent */
+static inline uint8_t *js_get_stack_pointer(void)
+{
+    return __builtin_frame_address(0);
+}
+
+static inline BOOL js_check_stack_overflow(JSContext *ctx, size_t alloca_size)
+{
+    size_t size;
+    size = ctx->stack_top - js_get_stack_pointer();
+    return unlikely((size + alloca_size) > ctx->stack_size);
+}
+#endif
+#endif
+
+JSContext *JS_NewContextRaw(JSRuntime *rt)
+{
+    JSContext *ctx;
+    int i;
+
+    ctx = js_mallocz_rt(rt, sizeof(JSContext));
+    if (!ctx)
+        return NULL;
+    ctx->class_proto = js_malloc_rt(rt, sizeof(ctx->class_proto[0]) *
+                                    rt->class_count);
+    if (!ctx->class_proto) {
+        js_free_rt(rt, ctx);
+        return NULL;
+    }
+    ctx->rt = rt;
+    list_add_tail(&ctx->link, &rt->context_list);
+    ctx->stack_top = js_get_stack_pointer();
+    ctx->stack_size = JS_DEFAULT_STACK_SIZE;
+    ctx->current_exception = JS_NULL;
+#ifdef CONFIG_BIGNUM
+    ctx->bf_ctx = &rt->bf_ctx;
+    ctx->fp_env.prec = 53;
+    ctx->fp_env.flags = bf_set_exp_bits(11) | BF_RNDN | BF_FLAG_SUBNORMAL;
+#endif
+    for(i = 0; i < rt->class_count; i++)
+        ctx->class_proto[i] = JS_NULL;
+    init_list_head(&ctx->loaded_modules);
+
+    JS_AddIntrinsicBasicObjects(ctx);
+    return ctx;
+}
+
+JSContext *JS_NewContext(JSRuntime *rt)
+{
+    JSContext *ctx;
+
+    ctx = JS_NewContextRaw(rt);
+    if (!ctx)
+        return NULL;
+
+    JS_AddIntrinsicBaseObjects(ctx);
+    //JS_AddIntrinsicDate(ctx);
+    JS_AddIntrinsicEval(ctx);
+    JS_AddIntrinsicStringNormalize(ctx);
+    JS_AddIntrinsicRegExp(ctx);
+    JS_AddIntrinsicJSON(ctx);
+    JS_AddIntrinsicProxy(ctx);
+    JS_AddIntrinsicMapSet(ctx);
+    JS_AddIntrinsicTypedArrays(ctx);
+    JS_AddIntrinsicPromise(ctx);
+
+    return ctx;
+}
+
+void *JS_GetContextOpaque(JSContext *ctx)
+{
+    return ctx->user_opaque;
+}
+
+void JS_SetContextOpaque(JSContext *ctx, void *opaque)
+{
+    ctx->user_opaque = opaque;
+}
+
+/* set the new value and free the old value after (freeing the value
+   can reallocate the object data) */
+static inline void set_value(JSContext *ctx, JSValue *pval, JSValue new_val)
+{
+    JSValue old_val;
+    old_val = *pval;
+    *pval = new_val;
+    JS_FreeValue(ctx, old_val);
+}
+
+void JS_SetClassProto(JSContext *ctx, JSClassID class_id, JSValue obj)
+{
+    JSRuntime *rt = ctx->rt;
+    assert(class_id < rt->class_count);
+    set_value(ctx, &ctx->class_proto[class_id], obj);
+}
+
+JSValue JS_GetClassProto(JSContext *ctx, JSClassID class_id)
+{
+    JSRuntime *rt = ctx->rt;
+    assert(class_id < rt->class_count);
+    return JS_DupValue(ctx, ctx->class_proto[class_id]);
+}
+
+typedef enum JSFreeModuleEnum {
+    JS_FREE_MODULE_ALL,
+    JS_FREE_MODULE_NOT_RESOLVED,
+    JS_FREE_MODULE_NOT_EVALUATED,
+} JSFreeModuleEnum;
+
+/* XXX: would be more efficient with separate module lists */
+static void js_free_modules(JSContext *ctx, JSFreeModuleEnum flag)
+{
+    struct list_head *el, *el1;
+    list_for_each_safe(el, el1, &ctx->loaded_modules) {
+        JSModuleDef *m = list_entry(el, JSModuleDef, link);
+        if (flag == JS_FREE_MODULE_ALL ||
+            (flag == JS_FREE_MODULE_NOT_RESOLVED && !m->resolved) ||
+            (flag == JS_FREE_MODULE_NOT_EVALUATED && !m->evaluated)) {
+            js_free_module_def(ctx, m);
+        }
+    }
+}
+
+void JS_FreeContext(JSContext *ctx)
+{
+    JSRuntime *rt = ctx->rt;
+    int i;
+
+#ifdef DUMP_ATOMS
+    JS_DumpAtoms(ctx->rt);
+#endif
+#ifdef DUMP_SHAPES
+    JS_DumpShapes(ctx->rt);
+#endif
+#ifdef DUMP_OBJECTS
+    {
+        struct list_head *el;
+        JSObject *p;
+        printf("JSObjects: {\n");
+        JS_DumpObjectHeader(ctx->rt);
+        list_for_each(el, &rt->obj_list) {
+            p = list_entry(el, JSObject, link);
+            JS_DumpObject(rt, p);
+        }
+        printf("}\n");
+    }
+#endif
+#ifdef DUMP_MEM
+    {
+        JSMemoryUsage stats;
+        JS_ComputeMemoryUsage(rt, &stats);
+        JS_DumpMemoryUsage(stdout, &stats, rt);
+    }
+#endif
+
+    js_free_modules(ctx, JS_FREE_MODULE_ALL);
+
+    JS_FreeValue(ctx, ctx->current_exception);
+
+    JS_FreeValue(ctx, ctx->global_obj);
+    JS_FreeValue(ctx, ctx->global_var_obj);
+
+    JS_FreeValue(ctx, ctx->throw_type_error);
+
+    JS_FreeValue(ctx, ctx->array_proto_values);
+    for(i = 0; i < JS_NATIVE_ERROR_COUNT; i++) {
+        JS_FreeValue(ctx, ctx->native_error_proto[i]);
+    }
+    for(i = 0; i < rt->class_count; i++) {
+        JS_FreeValue(ctx, ctx->class_proto[i]);
+    }
+    js_free_rt(rt, ctx->class_proto);
+    JS_FreeValue(ctx, ctx->iterator_proto);
+    JS_FreeValue(ctx, ctx->async_iterator_proto);
+    JS_FreeValue(ctx, ctx->regexp_ctor);
+    JS_FreeValue(ctx, ctx->function_ctor);
+    JS_FreeValue(ctx, ctx->function_proto);
+
+    js_free_shape_null(ctx->rt, ctx->array_shape);
+
+    list_del(&ctx->link);
+    js_free_rt(ctx->rt, ctx);
+}
+
+JSRuntime *JS_GetRuntime(JSContext *ctx)
+{
+    return ctx->rt;
+}
+
+void JS_SetMaxStackSize(JSContext *ctx, size_t stack_size)
+{
+    ctx->stack_size = stack_size;
+}
+
+static inline BOOL is_strict_mode(JSContext *ctx)
+{
+    JSStackFrame *sf = ctx->current_stack_frame;
+    return (sf && (sf->js_mode & JS_MODE_STRICT));
+}
+
+#ifdef CONFIG_BIGNUM
+static inline BOOL is_bignum_mode(JSContext *ctx)
+{
+    JSStackFrame *sf = ctx->current_stack_frame;
+    return (sf && (sf->js_mode & JS_MODE_BIGINT));
+}
+#endif
+
+JSValue JS_NewInt64(JSContext *ctx, int64_t v)
+{
+    if (v == (int32_t)v) {
+        return JS_NewInt32(ctx, v);
+    } else {
+#ifdef CONFIG_BIGNUM
+        if (is_bignum_mode(ctx)) {
+            bf_t a_s, *a = &a_s;
+            bf_init(ctx->bf_ctx, a);
+            bf_set_si(a, v);
+            return JS_NewBigInt(ctx, a);
+        } else
+#endif
+        {
+            return __JS_NewFloat64(ctx, (double)v);
+        }
+    }
+}
+
+static force_inline JSValue JS_NewUint32(JSContext *ctx, uint32_t val)
+{
+#ifdef CONFIG_BIGNUM
+    return JS_NewInt64(ctx, val);
+#else
+    JSValue v;
+    if (val <= 0x7fffffff) {
+        v = JS_MKVAL(JS_TAG_INT, val);
+    } else {
+        v = __JS_NewFloat64(ctx, val);
+    }
+    return v;
+#endif
+}
+
+/* JSAtom support */
+
+#define JS_ATOM_TAG_INT (1U << 31)
+#define JS_ATOM_MAX_INT (JS_ATOM_TAG_INT - 1)
+#define JS_ATOM_MAX     ((1U << 30) - 1)
+
+/* return the max count from the hash size */
+#define JS_ATOM_COUNT_RESIZE(n) ((n) * 2)
+
+static inline BOOL __JS_AtomIsConst(JSAtom v)
+{
+#if defined(DUMP_LEAKS) && DUMP_LEAKS > 1
+        return (int32_t)v <= 0;
+#else
+        return (int32_t)v < JS_ATOM_END;
+#endif
+}
+
+static inline BOOL __JS_AtomIsTaggedInt(JSAtom v)
+{
+    return (v & JS_ATOM_TAG_INT) != 0;
+}
+
+static inline JSAtom __JS_AtomFromUInt32(uint32_t v)
+{
+    return v | JS_ATOM_TAG_INT;
+}
+
+static inline uint32_t __JS_AtomToUInt32(JSAtom atom)
+{
+    return atom & ~JS_ATOM_TAG_INT;
+}
+
+static inline int is_num(int c)
+{
+    return c >= '0' && c <= '9';
+}
+
+/* return TRUE if the string is a number n with 0 <= n <= 2^32-1 */
+static inline BOOL is_num_string(uint32_t *pval, const JSString *p)
+{
+    uint32_t n;
+    uint64_t n64;
+    int c, i, len;
+
+    len = p->len;
+    if (len == 0 || len > 10)
+        return FALSE;
+    if (p->is_wide_char)
+        c = p->u.str16[0];
+    else
+        c = p->u.str8[0];
+    if (is_num(c)) {
+        if (c == '0') {
+            if (len != 1)
+                return FALSE;
+            n = 0;
+        } else {
+            n = c - '0';
+            for(i = 1; i < len; i++) {
+                if (p->is_wide_char)
+                    c = p->u.str16[i];
+                else
+                    c = p->u.str8[i];
+                if (!is_num(c))
+                    return FALSE;
+                n64 = (uint64_t)n * 10 + (c - '0');
+                if ((n64 >> 32) != 0)
+                    return FALSE;
+                n = n64;
+            }
+        }
+        *pval = n;
+        return TRUE;
+    } else {
+        return FALSE;
+    }
+}
+
+/* XXX: could use faster version ? */
+static inline uint32_t hash_string8(const uint8_t *str, int len, uint32_t h)
+{
+    int i;
+
+    for(i = 0; i < len; i++)
+        h = h * 263 + str[i];
+    return h;
+}
+
+static inline uint32_t hash_string16(const uint16_t *str, int len, uint32_t h)
+{
+    int i;
+
+    for(i = 0; i < len; i++)
+        h = h * 263 + str[i];
+    return h;
+}
+
+static uint32_t hash_string(const JSString *str, uint32_t h)
+{
+    if (str->is_wide_char)
+        h = hash_string16(str->u.str16, str->len, h);
+    else
+        h = hash_string8(str->u.str8, str->len, h);
+    return h;
+}
+
+#if defined(_MSC_VER)
+static void JS_DumpString(JSRuntime *rt,
+                                                  const JSString *p)
+#else
+static __attribute__((unused)) void JS_DumpString(JSRuntime *rt,
+                                                  const JSString *p)
+#endif
+{
+    int i, c, sep;
+
+    if (p == NULL) {
+        printf("<null>");
+        return;
+    }
+    printf("%d", p->header.ref_count);
+    sep = (p->header.ref_count == 1) ? '\"' : '\'';
+    putchar(sep);
+    for(i = 0; i < p->len; i++) {
+        if (p->is_wide_char)
+            c = p->u.str16[i];
+        else
+            c = p->u.str8[i];
+        if (c == sep || c == '\\') {
+            putchar('\\');
+            putchar(c);
+        } else if (c >= ' ' && c <= 126) {
+            putchar(c);
+        } else if (c == '\n') {
+            putchar('\\');
+            putchar('n');
+        } else {
+            printf("\\u%04x", c);
+        }
+    }
+    putchar(sep);
+}
+
+#if defined(_MSC_VER)
+static void JS_DumpAtoms(JSRuntime *rt)
+#else
+static __attribute__((unused)) void JS_DumpAtoms(JSRuntime *rt)
+#endif
+{
+    JSAtomStruct *p;
+    int h, i;
+    /* This only dumps hashed atoms, not JS_ATOM_TYPE_SYMBOL atoms */
+    printf("JSAtom count=%d size=%d hash_size=%d:\n",
+           rt->atom_count, rt->atom_size, rt->atom_hash_size);
+    printf("JSAtom hash table: {\n");
+    for(i = 0; i < rt->atom_hash_size; i++) {
+        h = rt->atom_hash[i];
+        if (h) {
+            printf("  %d:", i);
+            while (h) {
+                p = rt->atom_array[h];
+                printf(" ");
+                JS_DumpString(rt, p);
+                h = p->hash_next;
+            }
+            printf("\n");
+        }
+    }
+    printf("}\n");
+    printf("JSAtom table: {\n");
+    for(i = 0; i < rt->atom_size; i++) {
+        p = rt->atom_array[i];
+        if (!atom_is_free(p)) {
+            printf("  %d: { %d %08x ", i, p->atom_type, p->hash);
+            if (!(p->len == 0 && p->is_wide_char != 0))
+                JS_DumpString(rt, p);
+            printf(" %d }\n", p->hash_next);
+        }
+    }
+    printf("}\n");
+}
+
+static int JS_ResizeAtomHash(JSRuntime *rt, int new_hash_size)
+{
+    JSAtomStruct *p;
+    uint32_t new_hash_mask, h, i, hash_next1, j, *new_hash;
+
+    assert((new_hash_size & (new_hash_size - 1)) == 0); /* power of two */
+    new_hash_mask = new_hash_size - 1;
+    new_hash = js_mallocz_rt(rt, sizeof(rt->atom_hash[0]) * new_hash_size);
+    if (!new_hash)
+        return -1;
+    for(i = 0; i < rt->atom_hash_size; i++) {
+        h = rt->atom_hash[i];
+        while (h != 0) {
+            p = rt->atom_array[h];
+            hash_next1 = p->hash_next;
+            /* add in new hash table */
+            j = p->hash & new_hash_mask;
+            p->hash_next = new_hash[j];
+            new_hash[j] = h;
+            h = hash_next1;
+        }
+    }
+    js_free_rt(rt, rt->atom_hash);
+    rt->atom_hash = new_hash;
+    rt->atom_hash_size = new_hash_size;
+    rt->atom_count_resize = JS_ATOM_COUNT_RESIZE(new_hash_size);
+    //    JS_DumpAtoms(rt);
+    return 0;
+}
+
+static int JS_InitAtoms(JSRuntime *rt)
+{
+    int i, len, atom_type;
+    const char *p;
+
+    rt->atom_hash_size = 0;
+    rt->atom_hash = NULL;
+    rt->atom_count = 0;
+    rt->atom_size = 0;
+    rt->atom_free_index = 0;
+    if (JS_ResizeAtomHash(rt, 256))     /* there are at least 195 predefined atoms */
+        return -1;
+
+    p = js_atom_init;
+    for(i = 1; i < JS_ATOM_END; i++) {
+        if (i >= JS_ATOM_Symbol_toPrimitive)
+            atom_type = JS_ATOM_TYPE_SYMBOL;
+        else
+            atom_type = JS_ATOM_TYPE_STRING;
+        len = strlen(p);
+        if (__JS_NewAtomInit(rt, p, len, atom_type) == JS_ATOM_NULL)
+            return -1;
+        p = p + len + 1;
+    }
+    return 0;
+}
+
+static JSAtom JS_DupAtomRT(JSRuntime *rt, JSAtom v)
+{
+    JSAtomStruct *p;
+
+    if (!__JS_AtomIsConst(v)) {
+        p = rt->atom_array[v];
+        p->header.ref_count++;
+    }
+    return v;
+}
+
+JSAtom JS_DupAtom(JSContext *ctx, JSAtom v)
+{
+    JSRuntime *rt;
+    JSAtomStruct *p;
+
+    if (!__JS_AtomIsConst(v)) {
+        rt = ctx->rt;
+        p = rt->atom_array[v];
+        p->header.ref_count++;
+    }
+    return v;
+}
+
+static BOOL JS_AtomIsString(JSContext *ctx, JSAtom v)
+{
+    JSRuntime *rt;
+    JSAtomStruct *p;
+
+    rt = ctx->rt;
+    if (__JS_AtomIsTaggedInt(v))
+        return TRUE;
+    p = rt->atom_array[v];
+    return p->atom_type == JS_ATOM_TYPE_STRING;
+}
+
+static JSAtom js_get_atom_index(JSRuntime *rt, JSAtomStruct *p)
+{
+    uint32_t i = p->hash_next;  /* atom_index */
+    if (p->atom_type != JS_ATOM_TYPE_SYMBOL) {
+        JSAtomStruct *p1;
+
+        i = rt->atom_hash[p->hash & (rt->atom_hash_size - 1)];
+        p1 = rt->atom_array[i];
+        while (p1 != p) {
+            assert(i != 0);
+            i = p1->hash_next;
+            p1 = rt->atom_array[i];
+        }
+    }
+    return i;
+}
+
+/* string case (internal). Return JS_ATOM_NULL if error. 'str' is
+   freed. */
+static JSAtom __JS_NewAtom(JSRuntime *rt, JSString *str, int atom_type)
+{
+    uint32_t h, h1, i;
+    JSAtomStruct *p;
+    int len;
+
+#if 0
+    printf("__JS_NewAtom: ");  JS_DumpString(rt, str); printf("\n");
+#endif
+    if (atom_type != JS_ATOM_TYPE_SYMBOL) {
+        /* str is not NULL */
+        if (str->atom_type == atom_type) {
+            /* str is the atom, return its index */
+            i = js_get_atom_index(rt, str);
+            /* reduce string refcount and increase atom's unless constant */
+            if (__JS_AtomIsConst(i))
+                str->header.ref_count--;
+            return i;
+        }
+        /* try and locate an already registered atom */
+        len = str->len;
+        h = hash_string(str, atom_type);
+        h &= JS_ATOM_HASH_MASK;
+        h1 = h & (rt->atom_hash_size - 1);
+        i = rt->atom_hash[h1];
+        while (i != 0) {
+            p = rt->atom_array[i];
+            if (p->hash == h &&
+                p->atom_type == atom_type &&
+                p->len == len &&
+                js_string_memcmp(p, str, len) == 0) {
+                if (!__JS_AtomIsConst(i))
+                    p->header.ref_count++;
+                goto done;
+            }
+            i = p->hash_next;
+        }
+    } else {
+        h1 = 0; /* avoid warning */
+        h = 0;  /* avoid warning */
+    }
+
+    if (rt->atom_free_index == 0) {
+        /* allow new atom entries */
+        uint32_t new_size, start;
+        JSAtomStruct **new_array;
+
+        /* alloc new with size progression 3/2:
+           4 6 9 13 19 28 42 63 94 141 211 316 474 711 1066 1599 2398 3597 5395 8092
+           preallocating space for predefined atoms (at least 195).
+         */
+        new_size = max_int(211, rt->atom_size * 3 / 2);
+        if (new_size > JS_ATOM_MAX)
+            goto fail;
+        /* XXX: should use realloc2 to use slack space */
+        new_array = js_realloc_rt(rt, rt->atom_array, sizeof(*new_array) * new_size);
+        if (!new_array)
+            goto fail;
+        /* Note: the atom 0 is not used */
+        start = rt->atom_size;
+        if (start == 0) {
+            /* JS_ATOM_NULL entry */
+            p = js_mallocz_rt(rt, sizeof(JSAtomStruct));
+            if (!p) {
+                js_free_rt(rt, new_array);
+                goto fail;
+            }
+            p->header.ref_count = 1;  /* not refcounted */
+            p->atom_type = JS_ATOM_TYPE_SYMBOL;
+#ifdef DUMP_LEAKS
+            list_add_tail(&p->link, &rt->string_list);
+#endif
+            new_array[0] = p;
+            rt->atom_count++;
+            start = 1;
+        }
+        rt->atom_size = new_size;
+        rt->atom_array = new_array;
+        rt->atom_free_index = start;
+        for(i = start; i < new_size; i++) {
+            uint32_t next;
+            if (i == (new_size - 1))
+                next = 0;
+            else
+                next = i + 1;
+            rt->atom_array[i] = atom_set_free(next);
+        }
+    }
+
+    if (str) {
+        if (str->atom_type == 0) {
+            p = str;
+            p->atom_type = atom_type;
+        } else {
+            p = js_malloc_rt(rt, sizeof(JSString) +
+                             (str->len << str->is_wide_char) +
+                             1 - str->is_wide_char);
+            if (unlikely(!p))
+                goto fail;
+            p->header.ref_count = 1;
+            p->is_wide_char = str->is_wide_char;
+            p->len = str->len;
+#ifdef DUMP_LEAKS
+            list_add_tail(&p->link, &rt->string_list);
+#endif
+            memcpy(p->u.str8, str->u.str8, (str->len << str->is_wide_char) +
+                   1 - str->is_wide_char);
+            js_free_string(rt, str);
+        }
+    } else {
+        p = js_malloc_rt(rt, sizeof(JSAtomStruct)); /* empty wide string */
+        if (!p)
+            return JS_ATOM_NULL;
+        p->header.ref_count = 1;
+        p->is_wide_char = 1;    /* Hack to represent NULL as a JSString */
+        p->len = 0;
+#ifdef DUMP_LEAKS
+        list_add_tail(&p->link, &rt->string_list);
+#endif
+    }
+
+    /* use an already free entry */
+    i = rt->atom_free_index;
+    rt->atom_free_index = atom_get_free(rt->atom_array[i]);
+    rt->atom_array[i] = p;
+
+    p->hash = h;
+    p->hash_next = i;   /* atom_index */
+    p->atom_type = atom_type;
+
+    rt->atom_count++;
+
+    if (atom_type != JS_ATOM_TYPE_SYMBOL) {
+        p->hash_next = rt->atom_hash[h1];
+        rt->atom_hash[h1] = i;
+        if (unlikely(rt->atom_count >= rt->atom_count_resize))
+            JS_ResizeAtomHash(rt, rt->atom_hash_size * 2);
+    }
+
+    //    JS_DumpAtoms(rt);
+    return i;
+
+ fail:
+    i = JS_ATOM_NULL;
+ done:
+    if (str)
+        js_free_string(rt, str);
+    return i;
+}
+
+/* only works with zero terminated 8 bit strings */
+static JSAtom __JS_NewAtomInit(JSRuntime *rt, const char *str, int len,
+                               int atom_type)
+{
+    JSString *p;
+    p = js_alloc_string_rt(rt, len, 0);
+    if (!p)
+        return JS_ATOM_NULL;
+    memcpy(p->u.str8, str, len);
+    p->u.str8[len] = '\0';
+    return __JS_NewAtom(rt, p, atom_type);
+}
+
+static JSAtom __JS_FindAtom(JSRuntime *rt, const char *str, int len,
+                            int atom_type)
+{
+    uint32_t h, h1, i;
+    JSAtomStruct *p;
+
+    h = hash_string8((const uint8_t *)str, len, JS_ATOM_TYPE_STRING);
+    h &= JS_ATOM_HASH_MASK;
+    h1 = h & (rt->atom_hash_size - 1);
+    i = rt->atom_hash[h1];
+    while (i != 0) {
+        p = rt->atom_array[i];
+        if (p->hash == h &&
+            p->atom_type == JS_ATOM_TYPE_STRING &&
+            p->len == len &&
+            p->is_wide_char == 0 &&
+            memcmp(p->u.str8, str, len) == 0) {
+            if (!__JS_AtomIsConst(i))
+                p->header.ref_count++;
+            return i;
+        }
+        i = p->hash_next;
+    }
+    return JS_ATOM_NULL;
+}
+
+static void JS_FreeAtomStruct(JSRuntime *rt, JSAtomStruct *p)
+{
+#if 0   /* JS_ATOM_NULL is not refcounted: __JS_AtomIsConst() includes 0 */
+    if (unlikely(i == JS_ATOM_NULL)) {
+        p->header.ref_count = INT32_MAX / 2;
+        return;
+    }
+#endif
+    uint32_t i = p->hash_next;  /* atom_index */
+    if (p->atom_type != JS_ATOM_TYPE_SYMBOL) {
+        JSAtomStruct *p0, *p1;
+        uint32_t h0;
+
+        h0 = p->hash & (rt->atom_hash_size - 1);
+        i = rt->atom_hash[h0];
+        p1 = rt->atom_array[i];
+        if (p1 == p) {
+            rt->atom_hash[h0] = p1->hash_next;
+        } else {
+            for(;;) {
+                assert(i != 0);
+                p0 = p1;
+                i = p1->hash_next;
+                p1 = rt->atom_array[i];
+                if (p1 == p) {
+                    p0->hash_next = p1->hash_next;
+                    break;
+                }
+            }
+        }
+    }
+    /* insert in free atom list */
+    rt->atom_array[i] = atom_set_free(rt->atom_free_index);
+    rt->atom_free_index = i;
+    /* free the string structure */
+#ifdef DUMP_LEAKS
+    list_del(&p->link);
+#endif
+    js_free_rt(rt, p);
+    rt->atom_count--;
+    assert(rt->atom_count >= 0);
+}
+
+static void __JS_FreeAtom(JSRuntime *rt, uint32_t i)
+{
+    JSAtomStruct *p;
+
+    p = rt->atom_array[i];
+    if (--p->header.ref_count > 0)
+        return;
+    JS_FreeAtomStruct(rt, p);
+}
+
+/* Warning: 'p' is freed */
+static JSAtom JS_NewAtomStr(JSContext *ctx, JSString *p)
+{
+    JSRuntime *rt = ctx->rt;
+    uint32_t n;
+    if (is_num_string(&n, p)) {
+        if (n <= JS_ATOM_MAX_INT) {
+            js_free_string(rt, p);
+            return __JS_AtomFromUInt32(n);
+        }
+    }
+    /* XXX: should generate an exception */
+    return __JS_NewAtom(rt, p, JS_ATOM_TYPE_STRING);
+}
+
+JSAtom JS_NewAtomLen(JSContext *ctx, const char *str, int len)
+{
+    JSValue val;
+
+    if (len == 0 || !is_digit(*str)) {
+        JSAtom atom = __JS_FindAtom(ctx->rt, str, len, JS_ATOM_TYPE_STRING);
+        if (atom)
+            return atom;
+    }
+    val = JS_NewStringLen(ctx, str, len);
+    if (JS_IsException(val))
+        return JS_ATOM_NULL;
+    return JS_NewAtomStr(ctx, JS_VALUE_GET_STRING(val));
+}
+
+JSAtom JS_NewAtom(JSContext *ctx, const char *str)
+{
+    return JS_NewAtomLen(ctx, str, strlen(str));
+}
+
+JSAtom JS_NewAtomUInt32(JSContext *ctx, uint32_t n)
+{
+    if (n <= JS_ATOM_MAX_INT) {
+        return __JS_AtomFromUInt32(n);
+    } else {
+        char buf[11];
+        JSValue val;
+        snprintf(buf, sizeof(buf), "%u", n);
+        val = JS_NewString(ctx, buf);
+        if (JS_IsException(val))
+            return JS_ATOM_NULL;
+        return __JS_NewAtom(ctx->rt, JS_VALUE_GET_STRING(val),
+                            JS_ATOM_TYPE_STRING);
+    }
+}
+
+static JSAtom JS_NewAtomInt64(JSContext *ctx, int64_t n)
+{
+    if ((uint64_t)n <= JS_ATOM_MAX_INT) {
+        return __JS_AtomFromUInt32((uint32_t)n);
+    } else {
+        char buf[24];
+        JSValue val;
+        snprintf(buf, sizeof(buf), "%" PRId64 , n);
+        val = JS_NewString(ctx, buf);
+        if (JS_IsException(val))
+            return JS_ATOM_NULL;
+        return __JS_NewAtom(ctx->rt, JS_VALUE_GET_STRING(val),
+                            JS_ATOM_TYPE_STRING);
+    }
+}
+
+/* 'p' is freed */
+static JSValue JS_NewSymbol(JSContext *ctx, JSString *p, int atom_type)
+{
+    JSRuntime *rt = ctx->rt;
+    JSAtom atom;
+    atom = __JS_NewAtom(rt, p, atom_type);
+    if (atom == JS_ATOM_NULL)
+        return JS_ThrowOutOfMemory(ctx);
+    return JS_MKPTR(JS_TAG_SYMBOL, rt->atom_array[atom]);
+}
+
+#define ATOM_GET_STR_BUF_SIZE 64
+
+/* Should only be used for debug. */
+static const char *JS_AtomGetStrRT(JSRuntime *rt, char *buf, int buf_size,
+                                   JSAtom atom)
+{
+    if (__JS_AtomIsTaggedInt(atom)) {
+        snprintf(buf, buf_size, "%u", __JS_AtomToUInt32(atom));
+    } else {
+        JSAtomStruct *p;
+        assert(atom < rt->atom_size);
+        if (atom == JS_ATOM_NULL) {
+            snprintf(buf, buf_size, "<null>");
+        } else {
+            int i, c;
+            char *q;
+            JSString *str;
+
+            q = buf;
+            p = rt->atom_array[atom];
+            assert(!atom_is_free(p));
+            str = p;
+            if (str) {
+                if (!str->is_wide_char) {
+                    /* special case ASCII strings */
+                    c = 0;
+                    for(i = 0; i < str->len; i++) {
+                        c |= str->u.str8[i];
+                    }
+                    if (c < 0x80)
+                        return (const char *)str->u.str8;
+                }
+                for(i = 0; i < str->len; i++) {
+                    if (str->is_wide_char)
+                        c = str->u.str16[i];
+                    else
+                        c = str->u.str8[i];
+                    if ((q - buf) >= buf_size - UTF8_CHAR_LEN_MAX)
+                        break;
+                    if (c < 128) {
+                        *q++ = c;
+                    } else {
+                        q += unicode_to_utf8((uint8_t *)q, c);
+                    }
+                }
+            }
+            *q = '\0';
+        }
+    }
+    return buf;
+}
+
+static const char *JS_AtomGetStr(JSContext *ctx, char *buf, int buf_size, JSAtom atom)
+{
+    return JS_AtomGetStrRT(ctx->rt, buf, buf_size, atom);
+}
+
+static JSValue __JS_AtomToValue(JSContext *ctx, JSAtom atom, BOOL force_string)
+{
+    char buf[ATOM_GET_STR_BUF_SIZE];
+
+    if (__JS_AtomIsTaggedInt(atom)) {
+        snprintf(buf, sizeof(buf), "%u", __JS_AtomToUInt32(atom));
+        return JS_NewString(ctx, buf);
+    } else {
+        JSRuntime *rt = ctx->rt;
+        JSAtomStruct *p;
+        assert(atom < rt->atom_size);
+        p = rt->atom_array[atom];
+        if (p->atom_type == JS_ATOM_TYPE_STRING) {
+            goto ret_string;
+        } else if (force_string) {
+            if (p->len == 0 && p->is_wide_char != 0) {
+                /* no description string */
+                p = rt->atom_array[JS_ATOM_empty_string];
+            }
+        ret_string:
+            return JS_DupValue(ctx, JS_MKPTR(JS_TAG_STRING, p));
+        } else {
+            return JS_DupValue(ctx, JS_MKPTR(JS_TAG_SYMBOL, p));
+        }
+    }
+}
+
+JSValue JS_AtomToValue(JSContext *ctx, JSAtom atom)
+{
+    return __JS_AtomToValue(ctx, atom, FALSE);
+}
+
+JSValue JS_AtomToString(JSContext *ctx, JSAtom atom)
+{
+    return __JS_AtomToValue(ctx, atom, TRUE);
+}
+
+/* return TRUE if the atom is a uint32 and return its value */
+static BOOL JS_AtomGetUint32(JSContext *ctx, uint32_t *pval, JSAtom atom)
+{
+    if (__JS_AtomIsTaggedInt(atom)) {
+        *pval = __JS_AtomToUInt32(atom);
+        return TRUE;
+    } else {
+        JSRuntime *rt = ctx->rt;
+        JSAtomStruct *p;
+        uint32_t val;
+
+        assert(atom < rt->atom_size);
+        p = rt->atom_array[atom];
+        if (p->atom_type == JS_ATOM_TYPE_STRING &&
+            is_num_string(&val, p)) {
+            *pval = val;
+            return TRUE;
+        } else {
+            *pval = 0;
+            return FALSE;
+        }
+    }
+}
+
+/* return TRUE if the string is a number n with 0 <= n <= 2^53-1 */
+static inline BOOL is_integer_index_string(uint64_t *pval, const JSString *p)
+{
+    uint64_t n;
+    int c, i, len;
+
+    len = p->len;
+    if (len == 0 || len > 16)
+        return FALSE;
+    if (p->is_wide_char)
+        c = p->u.str16[0];
+    else
+        c = p->u.str8[0];
+    if (is_num(c)) {
+        if (c == '0') {
+            if (len != 1)
+                return FALSE;
+            n = 0;
+        } else {
+            n = c - '0';
+            for(i = 1; i < len; i++) {
+                if (p->is_wide_char)
+                    c = p->u.str16[i];
+                else
+                    c = p->u.str8[i];
+                if (!is_num(c))
+                    return FALSE;
+                n = n * 10 + (c - '0');
+                if (n >= ((uint64_t)1 << 53))
+                    return FALSE;
+            }
+        }
+        *pval = n;
+        return TRUE;
+    } else {
+        return FALSE;
+    }
+}
+
+/* return TRUE if the atom is an integer index (i.e. 0 <= index <=
+   2^53-1 and return its value */
+static BOOL JS_AtomIsIntegerIndex(JSContext *ctx, uint64_t *pval, JSAtom atom)
+{
+    if (__JS_AtomIsTaggedInt(atom)) {
+        *pval = __JS_AtomToUInt32(atom);
+        return TRUE;
+    } else {
+        JSRuntime *rt = ctx->rt;
+        JSAtomStruct *p;
+        uint64_t val;
+
+        assert(atom < rt->atom_size);
+        p = rt->atom_array[atom];
+        if (p->atom_type == JS_ATOM_TYPE_STRING &&
+            is_integer_index_string(&val, p)) {
+            *pval = val;
+            return TRUE;
+        } else {
+            *pval = 0;
+            return FALSE;
+        }
+    }
+}
+
+/* This test must be fast if atom is not a numeric index (e.g. a
+   method name). Return JS_UNDEFINED if not a numeric
+   index. JS_EXCEPTION can also be returned. */
+static JSValue JS_AtomIsNumericIndex1(JSContext *ctx, JSAtom atom)
+{
+    JSRuntime *rt = ctx->rt;
+    JSAtomStruct *p1;
+    JSString *p;
+    int c, len, ret;
+    JSValue num, str;
+
+    if (__JS_AtomIsTaggedInt(atom))
+        return JS_NewInt32(ctx, __JS_AtomToUInt32(atom));
+    assert(atom < rt->atom_size);
+    p1 = rt->atom_array[atom];
+    if (p1->atom_type != JS_ATOM_TYPE_STRING)
+        return JS_UNDEFINED;
+    p = p1;
+    len = p->len;
+    if (p->is_wide_char) {
+        const uint16_t *r = p->u.str16, *r_end = p->u.str16 + len;
+        if (r >= r_end)
+            return JS_UNDEFINED;
+        c = *r;
+        if (c == '-') {
+            if (r >= r_end)
+                return JS_UNDEFINED;
+            r++;
+            c = *r;
+            /* -0 case is specific */
+            if (c == '0' && len == 2)
+                goto minus_zero;
+        }
+        /* XXX: should test NaN, but the tests do not check it */
+        if (!is_num(c)) {
+            /* XXX: String should be normalized, therefore 8-bit only */
+            const uint16_t nfinity16[7] = { 'n', 'f', 'i', 'n', 'i', 't', 'y' };
+            if (!(c =='I' && (r_end - r) == 8 &&
+                  !memcmp(r + 1, nfinity16, sizeof(nfinity16))))
+                return JS_UNDEFINED;
+        }
+    } else {
+        const uint8_t *r = p->u.str8, *r_end = p->u.str8 + len;
+        if (r >= r_end)
+            return JS_UNDEFINED;
+        c = *r;
+        if (c == '-') {
+            if (r >= r_end)
+                return JS_UNDEFINED;
+            r++;
+            c = *r;
+            /* -0 case is specific */
+            if (c == '0' && len == 2) {
+            minus_zero:
+                return __JS_NewFloat64(ctx, -0.0);
+            }
+        }
+        if (!is_num(c)) {
+            if (!(c =='I' && (r_end - r) == 8 &&
+                  !memcmp(r + 1, "nfinity", 7)))
+                return JS_UNDEFINED;
+        }
+    }
+    /* XXX: bignum: would be better to only accept integer to avoid
+       relying on current floating point precision */
+    /* this is ECMA CanonicalNumericIndexString primitive */
+    num = JS_ToNumber(ctx, JS_MKPTR(JS_TAG_STRING, p));
+    if (JS_IsException(num))
+        return num;
+    str = JS_ToString(ctx, num);
+    if (JS_IsException(str)) {
+        JS_FreeValue(ctx, num);
+        return str;
+    }
+    ret = js_string_compare(ctx, p, JS_VALUE_GET_STRING(str));
+    JS_FreeValue(ctx, str);
+    if (ret == 0) {
+        return num;
+    } else {
+        JS_FreeValue(ctx, num);
+        return JS_UNDEFINED;
+    }
+}
+
+/* return -1 if exception or TRUE/FALSE */
+static int JS_AtomIsNumericIndex(JSContext *ctx, JSAtom atom)
+{
+    JSValue num;
+    num = JS_AtomIsNumericIndex1(ctx, atom);
+    if (likely(JS_IsUndefined(num)))
+        return FALSE;
+    if (JS_IsException(num))
+        return -1;
+    JS_FreeValue(ctx, num);
+    return TRUE;
+}
+
+void JS_FreeAtom(JSContext *ctx, JSAtom v)
+{
+    if (!__JS_AtomIsConst(v))
+        __JS_FreeAtom(ctx->rt, v);
+}
+
+void JS_FreeAtomRT(JSRuntime *rt, JSAtom v)
+{
+    if (!__JS_AtomIsConst(v))
+        __JS_FreeAtom(rt, v);
+}
+
+/* return TRUE if 'v' is a symbol with a string description */
+static BOOL JS_AtomSymbolHasDescription(JSContext *ctx, JSAtom v)
+{
+    JSRuntime *rt;
+    JSAtomStruct *p;
+
+    rt = ctx->rt;
+    if (__JS_AtomIsTaggedInt(v))
+        return FALSE;
+    p = rt->atom_array[v];
+    return (p->atom_type != JS_ATOM_TYPE_STRING &&
+            !(p->len == 0 && p->is_wide_char != 0));
+}
+
+#if defined(_MSC_VER)
+static void print_atom(JSContext *ctx, JSAtom atom)
+#else
+static __attribute__((unused)) void print_atom(JSContext *ctx, JSAtom atom)
+#endif
+{
+    char buf[ATOM_GET_STR_BUF_SIZE];
+    const char *p;
+    int i;
+
+    /* XXX: should handle embedded null characters */
+    /* XXX: should move encoding code to JS_AtomGetStr */
+    p = JS_AtomGetStr(ctx, buf, sizeof(buf), atom);
+    for (i = 0; p[i]; i++) {
+        int c = (unsigned char)p[i];
+        if (!((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') ||
+              (c == '_' || c == '$') || (c >= '0' && c <= '9' && i > 0)))
+            break;
+    }
+    if (i > 0 && p[i] == '\0') {
+        printf("%s", p);
+    } else {
+        putchar('"');
+        printf("%.*s", i, p);
+        for (; p[i]; i++) {
+            int c = (unsigned char)p[i];
+            if (c == '\"' || c == '\\') {
+                putchar('\\');
+                putchar(c);
+            } else if (c >= ' ' && c <= 126) {
+                putchar(c);
+            } else if (c == '\n') {
+                putchar('\\');
+                putchar('n');
+            } else {
+                printf("\\u%04x", c);
+            }
+        }
+        putchar('\"');
+    }
+}
+
+/* free with JS_FreeCString() */
+const char *JS_AtomToCString(JSContext *ctx, JSAtom atom)
+{
+    JSValue str;
+    const char *cstr;
+
+    str = JS_AtomToString(ctx, atom);
+    if (JS_IsException(str))
+        return NULL;
+    cstr = JS_ToCString(ctx, str);
+    JS_FreeValue(ctx, str);
+    return cstr;
+}
+
+static inline BOOL JS_IsEmptyString(JSValueConst v)
+{
+    return JS_VALUE_GET_TAG(v) == JS_TAG_STRING && JS_VALUE_GET_STRING(v)->len == 0;
+}
+
+/* JSClass support */
+
+/* a new class ID is allocated if *pclass_id != 0 */
+JSClassID JS_NewClassID(JSClassID *pclass_id)
+{
+    JSClassID class_id;
+    /* XXX: make it thread safe */
+    class_id = *pclass_id;
+    if (class_id == 0) {
+        class_id = js_class_id_alloc++;
+        *pclass_id = class_id;
+    }
+    return class_id;
+}
+
+BOOL JS_IsRegisteredClass(JSRuntime *rt, JSClassID class_id)
+{
+    return (class_id < rt->class_count &&
+            rt->class_array[class_id].class_id != 0);
+}
+
+/* create a new object internal class. Return -1 if error, 0 if
+   OK. The finalizer can be NULL if none is needed. */
+static int JS_NewClass1(JSRuntime *rt, JSClassID class_id,
+                        const JSClassDef *class_def, JSAtom name)
+{
+    int new_size, i;
+    JSClass *cl, *new_class_array;
+    struct list_head *el;
+
+    if (class_id < rt->class_count &&
+        rt->class_array[class_id].class_id != 0)
+        return -1;
+
+    if (class_id >= rt->class_count) {
+        new_size = max_int(JS_CLASS_INIT_COUNT,
+                           max_int(class_id + 1, rt->class_count * 3 / 2));
+
+        /* reallocate the context class prototype array, if any */
+        list_for_each(el, &rt->context_list) {
+            JSContext *ctx = list_entry(el, JSContext, link);
+            JSValue *new_tab;
+            new_tab = js_realloc_rt(rt, ctx->class_proto,
+                                    sizeof(ctx->class_proto[0]) * new_size);
+            if (!new_tab)
+                return -1;
+            for(i = rt->class_count; i < new_size; i++)
+                new_tab[i] = JS_NULL;
+            ctx->class_proto = new_tab;
+        }
+        /* reallocate the class array */
+        new_class_array = js_realloc_rt(rt, rt->class_array,
+                                        sizeof(JSClass) * new_size);
+        if (!new_class_array)
+            return -1;
+        memset(new_class_array + rt->class_count, 0,
+               (new_size - rt->class_count) * sizeof(JSClass));
+        rt->class_array = new_class_array;
+        rt->class_count = new_size;
+    }
+    cl = &rt->class_array[class_id];
+    cl->class_id = class_id;
+    cl->class_name = JS_DupAtomRT(rt, name);
+    cl->finalizer = class_def->finalizer;
+    cl->gc_mark = class_def->gc_mark;
+    cl->call = class_def->call;
+    cl->exotic = class_def->exotic;
+    return 0;
+}
+
+int JS_NewClass(JSRuntime *rt, JSClassID class_id, const JSClassDef *class_def)
+{
+    int ret, len;
+    JSAtom name;
+
+    len = strlen(class_def->class_name);
+    name = __JS_FindAtom(rt, class_def->class_name, len, JS_ATOM_TYPE_STRING);
+    if (name == JS_ATOM_NULL) {
+        name = __JS_NewAtomInit(rt, class_def->class_name, len, JS_ATOM_TYPE_STRING);
+        if (name == JS_ATOM_NULL)
+            return -1;
+    }
+    ret = JS_NewClass1(rt, class_id, class_def, name);
+    JS_FreeAtomRT(rt, name);
+    return ret;
+}
+
+static JSValue js_new_string8(JSContext *ctx, const uint8_t *buf, int len)
+{
+    JSString *str;
+
+    if (len <= 0) {
+        return JS_AtomToString(ctx, JS_ATOM_empty_string);
+    }
+    str = js_alloc_string(ctx, len, 0);
+    if (!str)
+        return JS_EXCEPTION;
+    memcpy(str->u.str8, buf, len);
+    str->u.str8[len] = '\0';
+    return JS_MKPTR(JS_TAG_STRING, str);
+}
+
+static JSValue js_new_string16(JSContext *ctx, const uint16_t *buf, int len)
+{
+    JSString *str;
+    str = js_alloc_string(ctx, len, 1);
+    if (!str)
+        return JS_EXCEPTION;
+    memcpy(str->u.str16, buf, len * 2);
+    return JS_MKPTR(JS_TAG_STRING, str);
+}
+
+static JSValue js_new_string_char(JSContext *ctx, uint16_t c)
+{
+    if (c < 0x100) {
+        uint8_t ch8 = c;
+        return js_new_string8(ctx, &ch8, 1);
+    } else {
+        uint16_t ch16 = c;
+        return js_new_string16(ctx, &ch16, 1);
+    }
+}
+
+static JSValue js_sub_string(JSContext *ctx, JSString *p, int start, int end)
+{
+    int len = end - start;
+    if (start == 0 && end == p->len) {
+        return JS_DupValue(ctx, JS_MKPTR(JS_TAG_STRING, p));
+    }
+    if (p->is_wide_char && len > 0) {
+        JSString *str;
+        int i;
+        uint16_t c = 0;
+        for (i = start; i < end; i++) {
+            c |= p->u.str16[i];
+        }
+        if (c > 0xFF)
+            return js_new_string16(ctx, p->u.str16 + start, len);
+
+        str = js_alloc_string(ctx, len, 0);
+        if (!str)
+            return JS_EXCEPTION;
+        for (i = 0; i < len; i++) {
+            str->u.str8[i] = p->u.str16[start + i];
+        }
+        str->u.str8[len] = '\0';
+        return JS_MKPTR(JS_TAG_STRING, str);
+    } else {
+        return js_new_string8(ctx, p->u.str8 + start, len);
+    }
+}
+
+typedef struct StringBuffer {
+    JSContext *ctx;
+    JSString *str;
+    int len;
+    int size;
+    int is_wide_char;
+    int error_status;
+} StringBuffer;
+
+/* It is valid to call string_buffer_end() and all string_buffer functions even
+   if string_buffer_init() or another string_buffer function returns an error.
+   If the error_status is set, string_buffer_end() returns JS_EXCEPTION.
+ */
+static int string_buffer_init2(JSContext *ctx, StringBuffer *s, int size,
+                               int is_wide)
+{
+    s->ctx = ctx;
+    s->size = size;
+    s->len = 0;
+    s->is_wide_char = is_wide;
+    s->error_status = 0;
+    s->str = js_alloc_string(ctx, size, is_wide);
+    if (unlikely(!s->str)) {
+        s->size = 0;
+        return s->error_status = -1;
+    }
+#ifdef DUMP_LEAKS
+    /* the StringBuffer may reallocate the JSString, only link it at the end */
+    list_del(&s->str->link);
+#endif
+    return 0;
+}
+
+static inline int string_buffer_init(JSContext *ctx, StringBuffer *s, int size)
+{
+    return string_buffer_init2(ctx, s, size, 0);
+}
+
+static void string_buffer_free(StringBuffer *s)
+{
+    js_free(s->ctx, s->str);
+    s->str = NULL;
+}
+
+static int string_buffer_set_error(StringBuffer *s)
+{
+    js_free(s->ctx, s->str);
+    s->str = NULL;
+    s->size = 0;
+    s->len = 0;
+    return s->error_status = -1;
+}
+
+static no_inline int string_buffer_widen(StringBuffer *s, int size)
+{
+    JSString *str;
+    size_t slack;
+    int i;
+
+    if (s->error_status)
+        return -1;
+
+    str = js_realloc2(s->ctx, s->str, sizeof(JSString) + (size << 1), &slack);
+    if (!str)
+        return string_buffer_set_error(s);
+    size += slack >> 1;
+    for(i = s->len; i-- > 0;) {
+        str->u.str16[i] = str->u.str8[i];
+    }
+    s->is_wide_char = 1;
+    s->size = size;
+    s->str = str;
+    return 0;
+}
+
+static no_inline int string_buffer_realloc(StringBuffer *s, int new_len, int c)
+{
+    JSString *new_str;
+    int new_size;
+    size_t new_size_bytes, slack;
+
+    if (s->error_status)
+        return -1;
+
+    if (new_len > JS_STRING_LEN_MAX) {
+        JS_ThrowInternalError(s->ctx, "string too long");
+        return string_buffer_set_error(s);
+    }
+    new_size = min_int(max_int(new_len, s->size * 3 / 2), JS_STRING_LEN_MAX);
+    if (!s->is_wide_char && c >= 0x100) {
+        return string_buffer_widen(s, new_size);
+    }
+    new_size_bytes = sizeof(JSString) + (new_size << s->is_wide_char) + 1 - s->is_wide_char;
+    new_str = js_realloc2(s->ctx, s->str, new_size_bytes, &slack);
+    if (!new_str)
+        return string_buffer_set_error(s);
+    new_size = min_int(new_size + (slack >> s->is_wide_char), JS_STRING_LEN_MAX);
+    s->size = new_size;
+    s->str = new_str;
+    return 0;
+}
+
+static no_inline int string_buffer_putc_slow(StringBuffer *s, uint32_t c)
+{
+    if (unlikely(s->len >= s->size)) {
+        if (string_buffer_realloc(s, s->len + 1, c))
+            return -1;
+    }
+    if (s->is_wide_char) {
+        s->str->u.str16[s->len++] = c;
+    } else if (c < 0x100) {
+        s->str->u.str8[s->len++] = c;
+    } else {
+        if (string_buffer_widen(s, s->size))
+            return -1;
+        s->str->u.str16[s->len++] = c;
+    }
+    return 0;
+}
+
+/* 0 <= c <= 0xff */
+static int string_buffer_putc8(StringBuffer *s, uint32_t c)
+{
+    if (unlikely(s->len >= s->size)) {
+        if (string_buffer_realloc(s, s->len + 1, c))
+            return -1;
+    }
+    if (s->is_wide_char) {
+        s->str->u.str16[s->len++] = c;
+    } else {
+        s->str->u.str8[s->len++] = c;
+    }
+    return 0;
+}
+
+/* 0 <= c <= 0xffff */
+static int string_buffer_putc16(StringBuffer *s, uint32_t c)
+{
+    if (likely(s->len < s->size)) {
+        if (s->is_wide_char) {
+            s->str->u.str16[s->len++] = c;
+            return 0;
+        } else if (c < 0x100) {
+            s->str->u.str8[s->len++] = c;
+            return 0;
+        }
+    }
+    return string_buffer_putc_slow(s, c);
+}
+
+/* 0 <= c <= 0x10ffff */
+static int string_buffer_putc(StringBuffer *s, uint32_t c)
+{
+    if (unlikely(c >= 0x10000)) {
+        /* surrogate pair */
+        c -= 0x10000;
+        if (string_buffer_putc16(s, (c >> 10) + 0xd800))
+            return -1;
+        c = (c & 0x3ff) + 0xdc00;
+    }
+    return string_buffer_putc16(s, c);
+}
+
+static int string_get(const JSString *p, int idx) {
+    return p->is_wide_char ? p->u.str16[idx] : p->u.str8[idx];
+}
+
+static int string_buffer_write8(StringBuffer *s, const uint8_t *p, int len)
+{
+    int i;
+
+    if (s->len + len > s->size) {
+        if (string_buffer_realloc(s, s->len + len, 0))
+            return -1;
+    }
+    if (s->is_wide_char) {
+        for (i = 0; i < len; i++) {
+            s->str->u.str16[s->len + i] = p[i];
+        }
+        s->len += len;
+    } else {
+        memcpy(&s->str->u.str8[s->len], p, len);
+        s->len += len;
+    }
+    return 0;
+}
+
+static int string_buffer_write16(StringBuffer *s, const uint16_t *p, int len)
+{
+    int c = 0, i;
+
+    for (i = 0; i < len; i++) {
+        c |= p[i];
+    }
+    if (s->len + len > s->size) {
+        if (string_buffer_realloc(s, s->len + len, c))
+            return -1;
+    } else if (!s->is_wide_char && c >= 0x100) {
+        if (string_buffer_widen(s, s->size))
+            return -1;
+    }
+    if (s->is_wide_char) {
+        memcpy(&s->str->u.str16[s->len], p, len << 1);
+        s->len += len;
+    } else {
+        for (i = 0; i < len; i++) {
+            s->str->u.str8[s->len + i] = p[i];
+        }
+        s->len += len;
+    }
+    return 0;
+}
+
+/* appending an ASCII string */
+static int string_buffer_puts8(StringBuffer *s, const char *str)
+{
+    return string_buffer_write8(s, (const uint8_t *)str, strlen(str));
+}
+
+static int string_buffer_concat(StringBuffer *s, const JSString *p,
+                                uint32_t from, uint32_t to)
+{
+    if (to <= from)
+        return 0;
+    if (p->is_wide_char)
+        return string_buffer_write16(s, p->u.str16 + from, to - from);
+    else
+        return string_buffer_write8(s, p->u.str8 + from, to - from);
+}
+
+static int string_buffer_concat_value(StringBuffer *s, JSValueConst v)
+{
+    JSString *p;
+    JSValue v1;
+    int res;
+
+    if (s->error_status) {
+        /* prevent exception overload */
+        return -1;
+    }
+    if (unlikely(JS_VALUE_GET_TAG(v) != JS_TAG_STRING)) {
+        v1 = JS_ToString(s->ctx, v);
+        if (JS_IsException(v1))
+            return string_buffer_set_error(s);
+        p = JS_VALUE_GET_STRING(v1);
+        res = string_buffer_concat(s, p, 0, p->len);
+        JS_FreeValue(s->ctx, v1);
+        return res;
+    }
+    p = JS_VALUE_GET_STRING(v);
+    return string_buffer_concat(s, p, 0, p->len);
+}
+
+static int string_buffer_concat_value_free(StringBuffer *s, JSValue v)
+{
+    JSString *p;
+    int res;
+
+    if (s->error_status) {
+        /* prevent exception overload */
+        JS_FreeValue(s->ctx, v);
+        return -1;
+    }
+    if (unlikely(JS_VALUE_GET_TAG(v) != JS_TAG_STRING)) {
+        v = JS_ToStringFree(s->ctx, v);
+        if (JS_IsException(v))
+            return string_buffer_set_error(s);
+    }
+    p = JS_VALUE_GET_STRING(v);
+    res = string_buffer_concat(s, p, 0, p->len);
+    JS_FreeValue(s->ctx, v);
+    return res;
+}
+
+static int string_buffer_fill(StringBuffer *s, int c, int count)
+{
+    /* XXX: optimize */
+    if (s->len + count > s->size) {
+        if (string_buffer_realloc(s, s->len + count, c))
+            return -1;
+    }
+    while (count-- > 0) {
+        if (string_buffer_putc16(s, c))
+            return -1;
+    }
+    return 0;
+}
+
+static JSValue string_buffer_end(StringBuffer *s)
+{
+    JSString *str;
+    str = s->str;
+    if (s->error_status)
+        return JS_EXCEPTION;
+    if (s->len == 0) {
+        js_free(s->ctx, str);
+        s->str = NULL;
+        return JS_AtomToString(s->ctx, JS_ATOM_empty_string);
+    }
+    if (s->len < s->size) {
+        /* smaller size so js_realloc should not fail, but OK if it does */
+        /* XXX: should add some slack to avoid unnecessary calls */
+        /* XXX: might need to use malloc+free to ensure smaller size */
+        str = js_realloc_rt(s->ctx->rt, str, sizeof(JSString) +
+                            (s->len << s->is_wide_char) + 1 - s->is_wide_char);
+        if (str == NULL)
+            str = s->str;
+        s->str = str;
+    }
+    if (!s->is_wide_char)
+        str->u.str8[s->len] = 0;
+#ifdef DUMP_LEAKS
+    list_add_tail(&str->link, &s->ctx->rt->string_list);
+#endif
+    str->is_wide_char = s->is_wide_char;
+    str->len = s->len;
+    s->str = NULL;
+    return JS_MKPTR(JS_TAG_STRING, str);
+}
+
+/* create a string from a UTF-8 buffer */
+JSValue JS_NewStringLen(JSContext *ctx, const char *buf, int buf_len)
+{
+    const uint8_t *p, *p_end, *p_start, *p_next;
+    uint32_t c;
+    StringBuffer b_s, *b = &b_s;
+
+    p_start = (const uint8_t *)buf;
+    p_end = p_start + buf_len;
+    p = p_start;
+    while (p < p_end && *p < 128)
+        p++;
+    if (p == p_end) {
+        /* ASCII string */
+        return js_new_string8(ctx, (const uint8_t *)buf, buf_len);
+    } else {
+        int len1 = p - p_start;
+        if (string_buffer_init(ctx, b, buf_len))
+            goto fail;
+        string_buffer_write8(b, p_start, len1);
+        while (p < p_end) {
+            if (*p < 128) {
+                string_buffer_putc8(b, *p++);
+            } else {
+                /* parse utf-8 sequence, return 0xFFFFFFFF for error */
+                c = unicode_from_utf8(p, p_end - p, &p_next);
+                if (c < 0x10000) {
+                    p = p_next;
+                } else if (c <= 0x10FFFF) {
+                    p = p_next;
+                    /* surrogate pair */
+                    c -= 0x10000;
+                    string_buffer_putc16(b, (c >> 10) + 0xd800);
+                    c = (c & 0x3ff) + 0xdc00;
+                } else {
+                    /* invalid char */
+                    c = 0xfffd;
+                    /* skip the invalid chars */
+                    /* XXX: seems incorrect. Why not just use c = *p++; ? */
+                    while (p < p_end && (*p >= 0x80 && *p < 0xc0))
+                        p++;
+                    if (p < p_end) {
+                        p++;
+                        while (p < p_end && (*p >= 0x80 && *p < 0xc0))
+                            p++;
+                    }
+                }
+                string_buffer_putc16(b, c);
+            }
+        }
+    }
+    return string_buffer_end(b);
+
+ fail:
+    string_buffer_free(b);
+    return JS_EXCEPTION;
+}
+
+static JSValue JS_ConcatString3(JSContext *ctx, const char *str1,
+                                JSValue str2, const char *str3)
+{
+    StringBuffer b_s, *b = &b_s;
+    int len1, len3;
+    JSString *p;
+
+    if (unlikely(JS_VALUE_GET_TAG(str2) != JS_TAG_STRING)) {
+        str2 = JS_ToStringFree(ctx, str2);
+        if (JS_IsException(str2))
+            goto fail;
+    }
+    p = JS_VALUE_GET_STRING(str2);
+    len1 = strlen(str1);
+    len3 = strlen(str3);
+
+    if (string_buffer_init2(ctx, b, len1 + p->len + len3, p->is_wide_char))
+        goto fail;
+
+    string_buffer_write8(b, (const uint8_t *)str1, len1);
+    string_buffer_concat(b, p, 0, p->len);
+    string_buffer_write8(b, (const uint8_t *)str3, len3);
+
+    JS_FreeValue(ctx, str2);
+    return string_buffer_end(b);
+
+ fail:
+    JS_FreeValue(ctx, str2);
+    return JS_EXCEPTION;
+}
+
+JSValue JS_NewString(JSContext *ctx, const char *str)
+{
+    return JS_NewStringLen(ctx, str, strlen(str));
+}
+
+JSValue JS_NewAtomString(JSContext *ctx, const char *str)
+{
+    JSAtom atom = JS_NewAtom(ctx, str);
+    if (atom == JS_ATOM_NULL)
+        return JS_EXCEPTION;
+    JSValue val = JS_AtomToString(ctx, atom);
+    JS_FreeAtom(ctx, atom);
+    return val;
+}
+
+/* return (NULL, 0) if exception. */
+/* return pointer into a JSString with a live ref_count */
+/* cesu8 determines if non-BMP1 codepoints are encoded as 1 or 2 utf-8 sequences */
+const char *JS_ToCStringLen(JSContext *ctx, int *plen, JSValueConst val1, BOOL cesu8)
+{
+    JSValue val;
+    JSString *str, *str_new;
+    int pos, len, c, c1;
+    uint8_t *q;
+
+    if (JS_VALUE_GET_TAG(val1) != JS_TAG_STRING) {
+        val = JS_ToString(ctx, val1);
+        if (JS_IsException(val))
+            goto fail;
+    } else {
+        val = JS_DupValue(ctx, val1);
+    }
+
+    str = JS_VALUE_GET_STRING(val);
+    len = str->len;
+    if (!str->is_wide_char) {
+        const uint8_t *src = str->u.str8;
+        int count;
+
+        /* count the number of non-ASCII characters */
+        /* Scanning the whole string is required for ASCII strings,
+           and computing the number of non-ASCII bytes is less expensive
+           than testing each byte, hence this method is faster for ASCII
+           strings, which is the most common case.
+         */
+        count = 0;
+        for (pos = 0; pos < len; pos++) {
+            count += src[pos] >> 7;
+        }
+        if (count == 0) {
+            if (plen)
+                *plen = len;
+            return (const char *)src;
+        }
+        str_new = js_alloc_string(ctx, len + count, 0);
+        if (!str_new)
+            goto fail;
+        q = str_new->u.str8;
+        for (pos = 0; pos < len; pos++) {
+            c = src[pos];
+            if (c < 0x80) {
+                *q++ = c;
+            } else {
+                *q++ = (c >> 6) | 0xc0;
+                *q++ = (c & 0x3f) | 0x80;
+            }
+        }
+    } else {
+        const uint16_t *src = str->u.str16;
+        /* Allocate 3 bytes per 16 bit code point. Surrogate pairs may
+           produce 4 bytes but use 2 code points.
+         */
+        str_new = js_alloc_string(ctx, len * 3, 0);
+        if (!str_new)
+            goto fail;
+        q = str_new->u.str8;
+        pos = 0;
+        while (pos < len) {
+            c = src[pos++];
+            if (c < 0x80) {
+                *q++ = c;
+            } else {
+                if (c >= 0xd800 && c < 0xdc00) {
+                    if (pos < len && !cesu8) {
+                        c1 = src[pos];
+                        if (c1 >= 0xdc00 && c1 < 0xe000) {
+                            pos++;
+                            /* surrogate pair */
+                            c = (((c & 0x3ff) << 10) | (c1 & 0x3ff)) + 0x10000;
+                        } else {
+                            /* Keep unmatched surrogate code points */
+                            /* c = 0xfffd; */ /* error */
+                        }
+                    } else {
+                        /* Keep unmatched surrogate code points */
+                        /* c = 0xfffd; */ /* error */
+                    }
+                }
+                q += unicode_to_utf8(q, c);
+            }
+        }
+    }
+
+    *q = '\0';
+    str_new->len = q - str_new->u.str8;
+    JS_FreeValue(ctx, val);
+    if (plen)
+        *plen = str_new->len;
+    return (const char *)str_new->u.str8;
+ fail:
+    if (plen)
+        *plen = 0;
+    return NULL;
+}
+
+void JS_FreeCString(JSContext *ctx, const char *ptr)
+{
+    JSString *p;
+    if (!ptr)
+        return;
+    /* purposely removing constness */
+    p = (JSString *)(void *)(ptr - offsetof(JSString, u));
+    JS_FreeValue(ctx, JS_MKPTR(JS_TAG_STRING, p));
+}
+
+static int memcmp16_8(const uint16_t *src1, const uint8_t *src2, int len)
+{
+    int c, i;
+    for(i = 0; i < len; i++) {
+        c = src1[i] - src2[i];
+        if (c != 0)
+            return c;
+    }
+    return 0;
+}
+
+static int memcmp16(const uint16_t *src1, const uint16_t *src2, int len)
+{
+    int c, i;
+    for(i = 0; i < len; i++) {
+        c = src1[i] - src2[i];
+        if (c != 0)
+            return c;
+    }
+    return 0;
+}
+
+static int js_string_memcmp(const JSString *p1, const JSString *p2, int len)
+{
+    int res;
+
+    if (likely(!p1->is_wide_char)) {
+        if (likely(!p2->is_wide_char))
+            res = memcmp(p1->u.str8, p2->u.str8, len);
+        else
+            res = -memcmp16_8(p2->u.str16, p1->u.str8, len);
+    } else {
+        if (!p2->is_wide_char)
+            res = memcmp16_8(p1->u.str16, p2->u.str8, len);
+        else
+            res = memcmp16(p1->u.str16, p2->u.str16, len);
+    }
+    return res;
+}
+
+/* return < 0, 0 or > 0 */
+static int js_string_compare(JSContext *ctx,
+                             const JSString *p1, const JSString *p2)
+{
+    int res, len;
+    len = min_int(p1->len, p2->len);
+    res = js_string_memcmp(p1, p2, len);
+    if (res == 0) {
+        if (p1->len == p2->len)
+            res = 0;
+        else if (p1->len < p2->len)
+            res = -1;
+        else
+            res = 1;
+    }
+    return res;
+}
+
+static void copy_str16(uint16_t *dst, const JSString *p, int offset, int len)
+{
+    if (p->is_wide_char) {
+        memcpy(dst, p->u.str16 + offset, len * 2);
+    } else {
+        const uint8_t *src1 = p->u.str8 + offset;
+        int i;
+
+        for(i = 0; i < len; i++)
+            dst[i] = src1[i];
+    }
+}
+
+static JSValue JS_ConcatString1(JSContext *ctx,
+                                const JSString *p1, const JSString *p2)
+{
+    JSString *p;
+    uint32_t len;
+    int is_wide_char;
+
+    len = p1->len + p2->len;
+    if (len > JS_STRING_LEN_MAX)
+        return JS_ThrowInternalError(ctx, "string too long");
+    is_wide_char = p1->is_wide_char | p2->is_wide_char;
+    p = js_alloc_string(ctx, len, is_wide_char);
+    if (!p)
+        return JS_EXCEPTION;
+    if (!is_wide_char) {
+        memcpy(p->u.str8, p1->u.str8, p1->len);
+        memcpy(p->u.str8 + p1->len, p2->u.str8, p2->len);
+        p->u.str8[len] = '\0';
+    } else {
+        copy_str16(p->u.str16, p1, 0, p1->len);
+        copy_str16(p->u.str16 + p1->len, p2, 0, p2->len);
+    }
+    return JS_MKPTR(JS_TAG_STRING, p);
+}
+
+/* op1 and op2 are converted to strings. For convience, op1 or op2 =
+   JS_EXCEPTION are accepted and return JS_EXCEPTION.  */
+static JSValue JS_ConcatString(JSContext *ctx, JSValue op1, JSValue op2)
+{
+    JSValue ret;
+    JSString *p1, *p2;
+
+    if (unlikely(JS_VALUE_GET_TAG(op1) != JS_TAG_STRING)) {
+        op1 = JS_ToStringFree(ctx, op1);
+        if (JS_IsException(op1)) {
+            JS_FreeValue(ctx, op2);
+            return JS_EXCEPTION;
+        }
+    }
+    if (unlikely(JS_VALUE_GET_TAG(op2) != JS_TAG_STRING)) {
+        op2 = JS_ToStringFree(ctx, op2);
+        if (JS_IsException(op2)) {
+            JS_FreeValue(ctx, op1);
+            return JS_EXCEPTION;
+        }
+    }
+    p1 = JS_VALUE_GET_STRING(op1);
+    p2 = JS_VALUE_GET_STRING(op2);
+
+    /* XXX: could also check if p1 is empty */
+    if (p2->len == 0) {
+        goto ret_op1;
+    }
+    if (p1->header.ref_count == 1 && p1->is_wide_char == p2->is_wide_char
+    &&  js_malloc_usable_size(ctx, p1) >= sizeof(*p1) + ((p1->len + p2->len) << p2->is_wide_char) + 1 - p1->is_wide_char) {
+        /* Concatenate in place in available space at the end of p1 */
+        if (p1->is_wide_char) {
+            memcpy(p1->u.str16 + p1->len, p2->u.str16, p2->len << 1);
+            p1->len += p2->len;
+        } else {
+            memcpy(p1->u.str8 + p1->len, p2->u.str8, p2->len);
+            p1->len += p2->len;
+            p1->u.str8[p1->len] = '\0';
+        }
+    ret_op1:
+        JS_FreeValue(ctx, op2);
+        return op1;
+    }
+    ret = JS_ConcatString1(ctx, p1, p2);
+    JS_FreeValue(ctx, op1);
+    JS_FreeValue(ctx, op2);
+    return ret;
+}
+
+/* Shape support */
+
+static inline size_t get_shape_size(size_t hash_size, size_t prop_size)
+{
+    return hash_size * sizeof(uint32_t) + sizeof(JSShape) +
+        prop_size * sizeof(JSShapeProperty);
+}
+
+static inline JSShape *get_shape_from_alloc(void *sh_alloc, size_t hash_size)
+{
+    return (JSShape *)(void *)((uint32_t *)sh_alloc + hash_size);
+}
+
+static inline void *get_alloc_from_shape(JSShape *sh)
+{
+    return prop_hash_end_field_of_shape(sh) - ((intptr_t)sh->prop_hash_mask + 1);
+}
+
+static inline JSShapeProperty *get_shape_prop(JSShape *sh)
+{
+    return sh->prop;
+}
+
+static int init_shape_hash(JSRuntime *rt)
+{
+    rt->shape_hash_bits = 4;   /* 16 shapes */
+    rt->shape_hash_size = 1 << rt->shape_hash_bits;
+    rt->shape_hash_count = 0;
+    rt->shape_hash = js_mallocz_rt(rt, sizeof(rt->shape_hash[0]) *
+                                   rt->shape_hash_size);
+    if (!rt->shape_hash)
+        return -1;
+    return 0;
+}
+
+/* same magic hash multiplier as the Linux kernel */
+static uint32_t shape_hash(uint32_t h, uint32_t val)
+{
+    return (h + val) * 0x9e370001;
+}
+
+/* truncate the shape hash to 'hash_bits' bits */
+static uint32_t get_shape_hash(uint32_t h, int hash_bits)
+{
+    return h >> (32 - hash_bits);
+}
+
+static uint32_t shape_initial_hash(JSObject *proto)
+{
+    uint32_t h;
+    h = shape_hash(1, (uintptr_t)proto);
+    if (sizeof(proto) > 4)
+        h = shape_hash(h, (uint64_t)(uintptr_t)proto >> 32);
+    return h;
+}
+
+static int resize_shape_hash(JSRuntime *rt, int new_shape_hash_bits)
+{
+    int new_shape_hash_size, i;
+    uint32_t h;
+    JSShape **new_shape_hash, *sh, *sh_next;
+
+    new_shape_hash_size = 1 << new_shape_hash_bits;
+    new_shape_hash = js_mallocz_rt(rt, sizeof(rt->shape_hash[0]) *
+                                   new_shape_hash_size);
+    if (!new_shape_hash)
+        return -1;
+    for(i = 0; i < rt->shape_hash_size; i++) {
+        for(sh = rt->shape_hash[i]; sh != NULL; sh = sh_next) {
+            sh_next = sh->shape_hash_next;
+            h = get_shape_hash(sh->hash, new_shape_hash_bits);
+            sh->shape_hash_next = new_shape_hash[h];
+            new_shape_hash[h] = sh;
+        }
+    }
+    js_free_rt(rt, rt->shape_hash);
+    rt->shape_hash_bits = new_shape_hash_bits;
+    rt->shape_hash_size = new_shape_hash_size;
+    rt->shape_hash = new_shape_hash;
+    return 0;
+}
+
+static void js_shape_hash_link(JSRuntime *rt, JSShape *sh)
+{
+    uint32_t h;
+    h = get_shape_hash(sh->hash, rt->shape_hash_bits);
+    sh->shape_hash_next = rt->shape_hash[h];
+    rt->shape_hash[h] = sh;
+    rt->shape_hash_count++;
+}
+
+static void js_shape_hash_unlink(JSRuntime *rt, JSShape *sh)
+{
+    uint32_t h;
+    JSShape **psh;
+
+    h = get_shape_hash(sh->hash, rt->shape_hash_bits);
+    psh = &rt->shape_hash[h];
+    while (*psh != sh)
+        psh = &(*psh)->shape_hash_next;
+    *psh = sh->shape_hash_next;
+    rt->shape_hash_count--;
+}
+
+/* create a new empty shape with prototype 'proto' */
+static no_inline JSShape *js_new_shape2(JSContext *ctx, JSObject *proto,
+                                        int hash_size, int prop_size)
+{
+    JSRuntime *rt = ctx->rt;
+    void *sh_alloc;
+    JSShape *sh;
+
+    /* resize the shape hash table if necessary */
+    if (2 * (rt->shape_hash_count + 1) > rt->shape_hash_size) {
+        resize_shape_hash(rt, rt->shape_hash_bits + 1);
+    }
+
+    sh_alloc = js_malloc(ctx, get_shape_size(hash_size, prop_size));
+    if (!sh_alloc)
+        return NULL;
+    sh = get_shape_from_alloc(sh_alloc, hash_size);
+    sh->header.ref_count = 1;
+    sh->gc_header.mark = 0;
+    if (proto)
+        JS_DupValue(ctx, JS_MKPTR(JS_TAG_OBJECT, proto));
+    sh->proto = proto;
+    memset(prop_hash_end_field_of_shape(sh) - hash_size, 0, sizeof(prop_hash_end_field_of_shape(sh)[0]) *
+           hash_size);
+    sh->prop_hash_mask = hash_size - 1;
+    sh->prop_count = 0;
+    sh->prop_size = prop_size;
+
+    /* insert in the hash table */
+    sh->hash = shape_initial_hash(proto);
+    sh->is_hashed = TRUE;
+    sh->has_small_array_index = FALSE;
+    js_shape_hash_link(ctx->rt, sh);
+    return sh;
+}
+
+static JSShape *js_new_shape(JSContext *ctx, JSObject *proto)
+{
+    return js_new_shape2(ctx, proto, JS_PROP_INITIAL_HASH_SIZE,
+                         JS_PROP_INITIAL_SIZE);
+}
+
+/* The shape is cloned. The new shape is not inserted in the shape
+   hash table */
+static JSShape *js_clone_shape(JSContext *ctx, JSShape *sh1)
+{
+    JSShape *sh;
+    void *sh_alloc, *sh_alloc1;
+    size_t size;
+    JSShapeProperty *pr;
+    uint32_t i, hash_size;
+
+    hash_size = sh1->prop_hash_mask + 1;
+    size = get_shape_size(hash_size, sh1->prop_size);
+    sh_alloc = js_malloc(ctx, size);
+    if (!sh_alloc)
+        return NULL;
+    sh_alloc1 = get_alloc_from_shape(sh1);
+    memcpy(sh_alloc, sh_alloc1, size);
+    sh = get_shape_from_alloc(sh_alloc, hash_size);
+    sh->header.ref_count = 1;
+    sh->gc_header.mark = 0;
+    sh->is_hashed = FALSE;
+    if (sh->proto) {
+        JS_DupValue(ctx, JS_MKPTR(JS_TAG_OBJECT, sh->proto));
+    }
+    for(i = 0, pr = get_shape_prop(sh); i < sh->prop_count; i++, pr++) {
+        JS_DupAtom(ctx, pr->atom);
+    }
+    return sh;
+}
+
+static JSShape *js_dup_shape(JSShape *sh)
+{
+    sh->header.ref_count++;
+    return sh;
+}
+
+static void js_free_shape(JSRuntime *rt, JSShape *sh)
+{
+    uint32_t i;
+    JSShapeProperty *pr;
+
+    if (unlikely(--sh->header.ref_count <= 0)) {
+        assert(sh->header.ref_count == 0);
+        if (sh->is_hashed)
+            js_shape_hash_unlink(rt, sh);
+        if (sh->proto != NULL) {
+            JS_FreeValueRT(rt, JS_MKPTR(JS_TAG_OBJECT, sh->proto));
+        }
+        pr = get_shape_prop(sh);
+        for(i = 0; i < sh->prop_count; i++) {
+            JS_FreeAtomRT(rt, pr->atom);
+            pr++;
+        }
+        js_free_rt(rt, get_alloc_from_shape(sh));
+    }
+}
+
+static void js_free_shape_null(JSRuntime *rt, JSShape *sh)
+{
+    if (sh)
+        js_free_shape(rt, sh);
+}
+
+/* make space to hold at least 'count' properties */
+static no_inline int resize_properties(JSContext *ctx, JSShape **psh,
+                                       JSObject *p, uint32_t count)
+{
+    JSShape *sh;
+    uint32_t new_size, new_hash_size, new_hash_mask, i;
+    JSShapeProperty *pr;
+    void *sh_alloc;
+    intptr_t h;
+
+    sh = *psh;
+    new_size = max_int(count, sh->prop_size * 3 / 2);
+    /* Reallocate prop array first to avoid crash or size inconsistency
+       in case of memory allocation failure */
+    if (p) {
+        JSProperty *new_prop;
+        new_prop = js_realloc(ctx, p->prop, sizeof(new_prop[0]) * new_size);
+        if (unlikely(!new_prop))
+            return -1;
+        p->prop = new_prop;
+    }
+    new_hash_size = sh->prop_hash_mask + 1;
+    while (new_hash_size < new_size)
+        new_hash_size = 2 * new_hash_size;
+    if (new_hash_size != (sh->prop_hash_mask + 1)) {
+        JSShape *old_sh;
+        /* resize the hash table and the properties */
+        old_sh = sh;
+        sh_alloc = js_malloc(ctx, get_shape_size(new_hash_size, new_size));
+        if (!sh_alloc)
+            return -1;
+        sh = get_shape_from_alloc(sh_alloc, new_hash_size);
+        /* copy all the fields and the properties */
+        memcpy(sh, old_sh,
+               sizeof(JSShape) + sizeof(sh->prop[0]) * old_sh->prop_count);
+        new_hash_mask = new_hash_size - 1;
+        sh->prop_hash_mask = new_hash_mask;
+        memset(prop_hash_end_field_of_shape(sh) - new_hash_size, 0,
+               sizeof(prop_hash_end_field_of_shape(sh)[0]) * new_hash_size);
+        for(i = 0, pr = sh->prop; i < sh->prop_count; i++, pr++) {
+            if (pr->atom != JS_ATOM_NULL) {
+                h = ((uintptr_t)pr->atom & new_hash_mask);
+                pr->hash_next = prop_hash_end_field_of_shape(sh)[-h - 1];
+                prop_hash_end_field_of_shape(sh)[-h - 1] = i + 1;
+            }
+        }
+        js_free(ctx, get_alloc_from_shape(old_sh));
+    } else {
+        /* only resize the properties */
+        sh_alloc = js_realloc(ctx, get_alloc_from_shape(sh),
+                              get_shape_size(new_hash_size, new_size));
+        if (unlikely(!sh_alloc))
+            return -1;
+        sh = get_shape_from_alloc(sh_alloc, new_hash_size);
+    }
+    *psh = sh;
+    sh->prop_size = new_size;
+    return 0;
+}
+
+static int add_shape_property(JSContext *ctx, JSShape **psh,
+                              JSObject *p, JSAtom atom, int prop_flags)
+{
+    JSRuntime *rt = ctx->rt;
+    JSShape *sh = *psh;
+    JSShapeProperty *pr, *prop;
+    uint32_t hash_mask, new_shape_hash = 0;
+    intptr_t h;
+
+    /* update the shape hash */
+    if (sh->is_hashed) {
+        js_shape_hash_unlink(rt, sh);
+        new_shape_hash = shape_hash(shape_hash(sh->hash, atom), prop_flags);
+    }
+
+    if (unlikely(sh->prop_count >= sh->prop_size)) {
+        if (resize_properties(ctx, psh, p, sh->prop_count + 1)) {
+            /* in case of error, reinsert in the hash table.
+               sh is still valid if resize_properties() failed */
+            if (sh->is_hashed)
+                js_shape_hash_link(rt, sh);
+            return -1;
+        }
+        sh = *psh;
+    }
+    if (sh->is_hashed) {
+        sh->hash = new_shape_hash;
+        js_shape_hash_link(rt, sh);
+    }
+    /* Initialize the new shape property.
+       The object property at p->prop[sh->prop_count] is uninitialized */
+    prop = get_shape_prop(sh);
+    pr = &prop[sh->prop_count++];
+    pr->atom = JS_DupAtom(ctx, atom);
+    pr->flags = prop_flags;
+    sh->has_small_array_index |= __JS_AtomIsTaggedInt(atom);
+    /* add in hash table */
+    hash_mask = sh->prop_hash_mask;
+    h = atom & hash_mask;
+    pr->hash_next = prop_hash_end_field_of_shape(sh)[-h - 1];
+    prop_hash_end_field_of_shape(sh)[-h - 1] = sh->prop_count;
+    return 0;
+}
+
+/* find a hashed empty shape matching the prototype. Return NULL if
+   not found */
+static JSShape *find_hashed_shape_proto(JSRuntime *rt, JSObject *proto)
+{
+    JSShape *sh1;
+    uint32_t h, h1;
+
+    h = shape_initial_hash(proto);
+    h1 = get_shape_hash(h, rt->shape_hash_bits);
+    for(sh1 = rt->shape_hash[h1]; sh1 != NULL; sh1 = sh1->shape_hash_next) {
+        if (sh1->hash == h &&
+            sh1->proto == proto &&
+            sh1->prop_count == 0) {
+            return sh1;
+        }
+    }
+    return NULL;
+}
+
+/* find a hashed shape matching sh + (prop, prop_flags). Return NULL if
+   not found */
+static JSShape *find_hashed_shape_prop(JSRuntime *rt, JSShape *sh,
+                                       JSAtom atom, int prop_flags)
+{
+    JSShape *sh1;
+    uint32_t h, h1, i, n;
+
+    h = sh->hash;
+    h = shape_hash(h, atom);
+    h = shape_hash(h, prop_flags);
+    h1 = get_shape_hash(h, rt->shape_hash_bits);
+    for(sh1 = rt->shape_hash[h1]; sh1 != NULL; sh1 = sh1->shape_hash_next) {
+        /* we test the hash first so that the rest is done only if the
+           shapes really match */
+        if (sh1->hash == h &&
+            sh1->proto == sh->proto &&
+            sh1->prop_count == ((n = sh->prop_count) + 1)) {
+            for(i = 0; i < n; i++) {
+                if (unlikely(sh1->prop[i].atom != sh->prop[i].atom) ||
+                    unlikely(sh1->prop[i].flags != sh->prop[i].flags))
+                    goto next;
+            }
+            if (unlikely(sh1->prop[n].atom != atom) ||
+                unlikely(sh1->prop[n].flags != prop_flags))
+                goto next;
+            return sh1;
+        }
+    next: ;
+    }
+    return NULL;
+}
+
+#if defined(_MSC_VER)
+static void JS_DumpShape(JSRuntime *rt, int i, JSShape *sh)
+#else
+static __attribute__((unused)) void JS_DumpShape(JSRuntime *rt, int i, JSShape *sh)
+#endif
+{
+    char atom_buf[ATOM_GET_STR_BUF_SIZE];
+    int j;
+
+    /* XXX: should output readable class prototype */
+    printf("%5d %3d%c %14p %5d %5d", i,
+           sh->header.ref_count, " *"[sh->is_hashed],
+           (void *)sh->proto, sh->prop_size, sh->prop_count);
+    for(j = 0; j < sh->prop_count; j++) {
+        printf(" %s", JS_AtomGetStrRT(rt, atom_buf, sizeof(atom_buf),
+                                      sh->prop[j].atom));
+    }
+    printf("\n");
+}
+
+#if defined(_MSC_VER)
+static void JS_DumpShapes(JSRuntime *rt)
+#else
+static __attribute__((unused)) void JS_DumpShapes(JSRuntime *rt)
+#endif
+{
+    int i;
+    JSShape *sh;
+    struct list_head *el;
+    JSObject *p;
+
+    printf("JSShapes: {\n");
+    printf("%5s %4s %14s %5s %5s %s\n", "SLOT", "REFS", "PROTO", "SIZE", "COUNT", "PROPS");
+    for(i = 0; i < rt->shape_hash_size; i++) {
+        for(sh = rt->shape_hash[i]; sh != NULL; sh = sh->shape_hash_next) {
+            JS_DumpShape(rt, i, sh);
+            assert(sh->is_hashed);
+        }
+    }
+    /* dump non-hashed shapes */
+    list_for_each(el, &rt->obj_list) {
+        p = list_entry(el, JSObject, link);
+        if (!p->shape->is_hashed) {
+            JS_DumpShape(rt, -1, p->shape);
+        }
+    }
+    printf("}\n");
+}
+
+static JSValue JS_NewObjectFromShape(JSContext *ctx, JSShape *sh, JSClassID class_id)
+{
+    JSObject *p;
+
+    js_trigger_gc(ctx->rt, sizeof(JSObject));
+    p = js_malloc(ctx, sizeof(JSObject));
+    if (unlikely(!p))
+        goto fail;
+    p->header.ref_count = 1;
+    p->gc_header.mark = 0;
+    p->class_id = class_id;
+    p->extensible = TRUE;
+    p->free_mark = 0;
+    p->is_exotic = 0;
+    p->fast_array = 0;
+    p->is_constructor = 0;
+    p->is_uncatchable_error = 0;
+    p->is_class = 0;
+    p->tmp_mark = 0;
+    p->first_weak_ref = NULL;
+    p->u.opaque = NULL;
+    p->shape = sh;
+    p->prop = js_malloc(ctx, sizeof(JSProperty) * sh->prop_size);
+    if (unlikely(!p->prop)) {
+        js_free(ctx, p);
+    fail:
+        js_free_shape(ctx->rt, sh);
+        return JS_EXCEPTION;
+    }
+
+    switch(class_id) {
+    case JS_CLASS_OBJECT:
+        break;
+    case JS_CLASS_ARRAY:
+        {
+            JSProperty *pr;
+            p->is_exotic = 1;
+            p->fast_array = 1;
+            p->u.array.u.values = NULL;
+            p->u.array.count = 0;
+            p->u.array.u1.size = 0;
+            /* the length property is always the first one */
+            if (likely(sh == ctx->array_shape)) {
+                pr = &p->prop[0];
+            } else {
+                /* only used for the first array */
+                /* cannot fail */
+                pr = add_property(ctx, p, JS_ATOM_length,
+                                  JS_PROP_WRITABLE | JS_PROP_LENGTH);
+            }
+            pr->u.value = JS_NewInt32(ctx, 0);
+        }
+        break;
+    case JS_CLASS_C_FUNCTION:
+        p->prop[0].u.value = JS_UNDEFINED;
+        break;
+    case JS_CLASS_ARGUMENTS:
+#if defined(_MSC_VER)
+	case JS_CLASS_UINT8C_ARRAY:      /* u.array (typed_array) */
+	case JS_CLASS_INT8_ARRAY:        /* u.array (typed_array) */
+	case JS_CLASS_UINT8_ARRAY:       /* u.array (typed_array) */
+	case JS_CLASS_INT16_ARRAY:       /* u.array (typed_array) */
+	case JS_CLASS_UINT16_ARRAY:      /* u.array (typed_array) */
+	case JS_CLASS_INT32_ARRAY:       /* u.array (typed_array) */
+	case JS_CLASS_UINT32_ARRAY:      /* u.array (typed_array) */
+#ifdef CONFIG_BIGNUM
+	case JS_CLASS_BIG_INT64_ARRAY:   /* u.array (typed_array) */
+	case JS_CLASS_BIG_UINT64_ARRAY:  /* u.array (typed_array) */
+#endif
+	case JS_CLASS_FLOAT32_ARRAY:     /* u.array (typed_array) */
+	case JS_CLASS_FLOAT64_ARRAY:     /* u.array (typed_array) */
+#else
+    case JS_CLASS_UINT8C_ARRAY ... JS_CLASS_FLOAT64_ARRAY:
+#endif
+        p->is_exotic = 1;
+        p->fast_array = 1;
+        p->u.array.u.ptr = NULL;
+        p->u.array.count = 0;
+        break;
+    case JS_CLASS_DATAVIEW:
+        p->u.array.u.ptr = NULL;
+        p->u.array.count = 0;
+        break;
+    case JS_CLASS_NUMBER:
+    case JS_CLASS_STRING:
+    case JS_CLASS_BOOLEAN:
+    case JS_CLASS_SYMBOL:
+    case JS_CLASS_DATE:
+#ifdef CONFIG_BIGNUM
+    case JS_CLASS_BIG_INT:
+    case JS_CLASS_BIG_FLOAT:
+#endif
+        p->u.object_data = JS_UNDEFINED;
+        goto set_exotic;
+    case JS_CLASS_REGEXP:
+        p->u.regexp.pattern = NULL;
+        p->u.regexp.bytecode = NULL;
+        goto set_exotic;
+    default:
+    set_exotic:
+        if (ctx->rt->class_array[class_id].exotic) {
+            p->is_exotic = 1;
+        }
+        break;
+    }
+    list_add_tail(&p->link, &ctx->rt->obj_list);
+    return JS_MKPTR(JS_TAG_OBJECT, p);
+}
+
+static JSObject *get_proto_obj(JSValueConst proto_val)
+{
+    if (JS_VALUE_GET_TAG(proto_val) != JS_TAG_OBJECT)
+        return NULL;
+    else
+        return JS_VALUE_GET_OBJ(proto_val);
+}
+
+/* WARNING: proto must be an object or JS_NULL */
+JSValue JS_NewObjectProtoClass(JSContext *ctx, JSValueConst proto_val,
+                               JSClassID class_id)
+{
+    JSShape *sh;
+    JSObject *proto;
+
+    proto = get_proto_obj(proto_val);
+    sh = find_hashed_shape_proto(ctx->rt, proto);
+    if (likely(sh)) {
+        sh = js_dup_shape(sh);
+    } else {
+        sh = js_new_shape(ctx, proto);
+        if (!sh)
+            return JS_EXCEPTION;
+    }
+    return JS_NewObjectFromShape(ctx, sh, class_id);
+}
+
+#if 0
+static JSValue JS_GetObjectData(JSContext *ctx, JSValueConst obj)
+{
+    JSObject *p;
+
+    if (JS_VALUE_GET_TAG(obj) == JS_TAG_OBJECT) {
+        p = JS_VALUE_GET_OBJ(obj);
+        switch(p->class_id) {
+        case JS_CLASS_NUMBER:
+        case JS_CLASS_STRING:
+        case JS_CLASS_BOOLEAN:
+        case JS_CLASS_SYMBOL:
+        case JS_CLASS_DATE:
+#ifdef CONFIG_BIGNUM
+        case JS_CLASS_BIG_INT:
+        case JS_CLASS_BIG_FLOAT:
+#endif
+            return JS_DupValue(ctx, p->u.object_data);
+        }
+    }
+    return JS_UNDEFINED;
+}
+#endif
+
+static int JS_SetObjectData(JSContext *ctx, JSValueConst obj, JSValue val)
+{
+    JSObject *p;
+
+    if (JS_VALUE_GET_TAG(obj) == JS_TAG_OBJECT) {
+        p = JS_VALUE_GET_OBJ(obj);
+        switch(p->class_id) {
+        case JS_CLASS_NUMBER:
+        case JS_CLASS_STRING:
+        case JS_CLASS_BOOLEAN:
+        case JS_CLASS_SYMBOL:
+        case JS_CLASS_DATE:
+#ifdef CONFIG_BIGNUM
+        case JS_CLASS_BIG_INT:
+        case JS_CLASS_BIG_FLOAT:
+#endif
+            JS_FreeValue(ctx, p->u.object_data);
+            p->u.object_data = val;
+            return 0;
+        }
+    }
+    JS_FreeValue(ctx, val);
+    if (!JS_IsException(obj))
+        JS_ThrowTypeError(ctx, "invalid object type");
+    return -1;
+}
+
+JSValue JS_NewObjectClass(JSContext *ctx, int class_id)
+{
+    return JS_NewObjectProtoClass(ctx, ctx->class_proto[class_id], class_id);
+}
+
+JSValue JS_NewObjectProto(JSContext *ctx, JSValueConst proto)
+{
+    return JS_NewObjectProtoClass(ctx, proto, JS_CLASS_OBJECT);
+}
+
+JSValue JS_NewArray(JSContext *ctx)
+{
+    return JS_NewObjectFromShape(ctx, js_dup_shape(ctx->array_shape),
+                                 JS_CLASS_ARRAY);
+}
+
+JSValue JS_NewObject(JSContext *ctx)
+{
+    /* inline JS_NewObjectClass(ctx, JS_CLASS_OBJECT); */
+    return JS_NewObjectProtoClass(ctx, ctx->class_proto[JS_CLASS_OBJECT], JS_CLASS_OBJECT);
+}
+
+static void js_function_set_properties(JSContext *ctx, JSValueConst func_obj,
+                                       JSValue name, int len)
+{
+    /* ES6 feature non compatible with ES5.1: length is configurable */
+    JS_DefinePropertyValue(ctx, func_obj, JS_ATOM_length, JS_NewInt32(ctx, len),
+                           JS_PROP_CONFIGURABLE);
+    if (!JS_IsUndefined(name)) {
+        JS_DefinePropertyValue(ctx, func_obj, JS_ATOM_name, name,
+                               JS_PROP_CONFIGURABLE);
+    }
+}
+
+static BOOL js_class_has_bytecode(JSClassID class_id)
+{
+    return (class_id == JS_CLASS_BYTECODE_FUNCTION ||
+            class_id == JS_CLASS_GENERATOR_FUNCTION ||
+            class_id == JS_CLASS_ASYNC_FUNCTION ||
+            class_id == JS_CLASS_ASYNC_GENERATOR_FUNCTION);
+}
+
+/* return NULL without exception if not a function or no bytecode */
+static JSFunctionBytecode *JS_GetFunctionBytecode(JSValueConst val)
+{
+    JSObject *p;
+    if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT)
+        return NULL;
+    p = JS_VALUE_GET_OBJ(val);
+    if (!js_class_has_bytecode(p->class_id))
+        return NULL;
+    return p->u.func.function_bytecode;
+}
+
+static void js_method_set_home_object(JSContext *ctx, JSValueConst func_obj,
+                                      JSValueConst home_obj)
+{
+    JSObject *p, *p1;
+    JSFunctionBytecode *b;
+
+    if (JS_VALUE_GET_TAG(func_obj) != JS_TAG_OBJECT)
+        return;
+    p = JS_VALUE_GET_OBJ(func_obj);
+    if (!js_class_has_bytecode(p->class_id))
+        return;
+    b = p->u.func.function_bytecode;
+    if (b->need_home_object) {
+        p1 = p->u.func.home_object;
+        if (p1) {
+            JS_FreeValue(ctx, JS_MKPTR(JS_TAG_OBJECT, p1));
+        }
+        if (JS_VALUE_GET_TAG(home_obj) == JS_TAG_OBJECT)
+            p1 = JS_VALUE_GET_OBJ(JS_DupValue(ctx, home_obj));
+        else
+            p1 = NULL;
+        p->u.func.home_object = p1;
+    }
+}
+
+static JSValue js_get_function_name(JSContext *ctx, JSAtom name)
+{
+    JSValue name_str;
+
+    name_str = JS_AtomToString(ctx, name);
+    if (JS_AtomSymbolHasDescription(ctx, name)) {
+        name_str = JS_ConcatString3(ctx, "[", name_str, "]");
+    }
+    return name_str;
+}
+
+/* Modify the name of a method according to the atom and
+   'flags'. 'flags' is a bitmask of JS_PROP_HAS_GET and
+   JS_PROP_HAS_SET. Also set the home object of the method.
+   Return < 0 if exception. */
+static int js_method_set_properties(JSContext *ctx, JSValueConst func_obj,
+                                    JSAtom name, int flags, JSValueConst home_obj)
+{
+    JSValue name_str;
+
+    name_str = js_get_function_name(ctx, name);
+    if (flags & JS_PROP_HAS_GET) {
+        name_str = JS_ConcatString3(ctx, "get ", name_str, "");
+    } else if (flags & JS_PROP_HAS_SET) {
+        name_str = JS_ConcatString3(ctx, "set ", name_str, "");
+    }
+    if (JS_IsException(name_str))
+        return -1;
+    if (JS_DefinePropertyValue(ctx, func_obj, JS_ATOM_name, name_str,
+                               JS_PROP_CONFIGURABLE) < 0)
+        return -1;
+    js_method_set_home_object(ctx, func_obj, home_obj);
+    return 0;
+}
+
+/* Note: at least 'length' arguments will be readable in 'argv' */
+static JSValue JS_NewCFunction3(JSContext *ctx, JSCFunction *func,
+                                const char *name,
+                                int length, JSCFunctionEnum cproto, int magic,
+                                JSValueConst proto_val)
+{
+    JSValue func_obj, name_val;
+    JSObject *p;
+
+    func_obj = JS_NewObjectProtoClass(ctx, proto_val, JS_CLASS_C_FUNCTION);
+    if (JS_IsException(func_obj))
+        return func_obj;
+    p = JS_VALUE_GET_OBJ(func_obj);
+    p->u.cfunc.c_function.generic = func;
+    p->u.cfunc.length = length;
+    p->u.cfunc.cproto = cproto;
+    p->u.cfunc.magic = magic;
+    p->is_constructor = (cproto == JS_CFUNC_constructor ||
+                         cproto == JS_CFUNC_constructor_magic ||
+                         cproto == JS_CFUNC_constructor_or_func ||
+                         cproto == JS_CFUNC_constructor_or_func_magic);
+    if (name)
+        name_val = JS_NewAtomString(ctx, name);
+    else
+        name_val = JS_UNDEFINED;
+    js_function_set_properties(ctx, func_obj, name_val, length);
+    return func_obj;
+}
+
+/* Note: at least 'length' arguments will be readable in 'argv' */
+JSValue JS_NewCFunction2(JSContext *ctx, JSCFunction *func,
+                         const char *name,
+                         int length, JSCFunctionEnum cproto, int magic)
+{
+    return JS_NewCFunction3(ctx, func, name, length, cproto, magic,
+                            ctx->function_proto);
+}
+
+typedef struct JSCFunctionDataRecord {
+    JSCFunctionData *func;
+    uint8_t length;
+    uint8_t data_len;
+    uint16_t magic;
+    JSValue data[0];
+} JSCFunctionDataRecord;
+
+static void js_c_function_data_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSCFunctionDataRecord *s = JS_GetOpaque(val, JS_CLASS_C_FUNCTION_DATA);
+    int i;
+
+    if (s) {
+        for(i = 0; i < s->data_len; i++) {
+            JS_FreeValueRT(rt, s->data[i]);
+        }
+        js_free_rt(rt, s);
+    }
+}
+
+static void js_c_function_data_mark(JSRuntime *rt, JSValueConst val,
+                                    JS_MarkFunc *mark_func)
+{
+    JSCFunctionDataRecord *s = JS_GetOpaque(val, JS_CLASS_C_FUNCTION_DATA);
+    int i;
+
+    if (s) {
+        for(i = 0; i < s->data_len; i++) {
+            JS_MarkValue(rt, s->data[i], mark_func);
+        }
+    }
+}
+
+static JSValue js_c_function_data_call(JSContext *ctx, JSValueConst func_obj,
+                                       JSValueConst this_val,
+                                       int argc, JSValueConst *argv)
+{
+    JSCFunctionDataRecord *s = JS_GetOpaque(func_obj, JS_CLASS_C_FUNCTION_DATA);
+    JSValueConst *arg_buf;
+    int i;
+
+    /* XXX: could add the function on the stack for debug */
+    if (unlikely(argc < s->length)) {
+        arg_buf = alloca(sizeof(arg_buf[0]) * s->length);
+        for(i = 0; i < argc; i++)
+            arg_buf[i] = argv[i];
+        for(i = argc; i < s->length; i++)
+            arg_buf[i] = JS_UNDEFINED;
+    } else {
+        arg_buf = argv;
+    }
+
+    return s->func(ctx, this_val, argc, arg_buf, s->magic, s->data);
+}
+
+JSValue JS_NewCFunctionData(JSContext *ctx, JSCFunctionData *func,
+                            int length, int magic, int data_len,
+                            JSValueConst *data)
+{
+    JSCFunctionDataRecord *s;
+    JSValue func_obj;
+    int i;
+
+    func_obj = JS_NewObjectProtoClass(ctx, ctx->function_proto,
+                                      JS_CLASS_C_FUNCTION_DATA);
+    if (JS_IsException(func_obj))
+        return func_obj;
+    s = js_malloc(ctx, sizeof(*s) + data_len * sizeof(JSValue));
+    if (!s) {
+        JS_FreeValue(ctx, func_obj);
+        return JS_EXCEPTION;
+    }
+    s->func = func;
+    s->length = length;
+    s->data_len = data_len;
+    s->magic = magic;
+    for(i = 0; i < data_len; i++)
+        s->data[i] = JS_DupValue(ctx, data[i]);
+    JS_SetOpaque(func_obj, s);
+    js_function_set_properties(ctx, func_obj, JS_UNDEFINED, length);
+    return func_obj;
+}
+
+static void free_property(JSRuntime *rt, JSProperty *pr, int prop_flags)
+{
+    if (unlikely(prop_flags & JS_PROP_TMASK)) {
+        if ((prop_flags & JS_PROP_TMASK) == JS_PROP_GETSET) {
+            if (pr->u.getset.getter)
+                JS_FreeValueRT(rt, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.getter));
+            if (pr->u.getset.setter)
+                JS_FreeValueRT(rt, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.setter));
+        } else if ((prop_flags & JS_PROP_TMASK) == JS_PROP_VARREF) {
+            free_var_ref(rt, pr->u.var_ref);
+        } else if ((prop_flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+            /* nothing to do */
+        }
+    } else {
+        JS_FreeValueRT(rt, pr->u.value);
+    }
+}
+
+static force_inline JSShapeProperty *find_own_property1(JSObject *p,
+                                                        JSAtom atom)
+{
+    JSShape *sh;
+    JSShapeProperty *pr, *prop;
+    intptr_t h;
+    sh = p->shape;
+    h = (uintptr_t)atom & sh->prop_hash_mask;
+    h = prop_hash_end_field_of_shape(sh)[-h - 1];
+    prop = get_shape_prop(sh);
+    while (h) {
+        pr = &prop[h - 1];
+        if (likely(pr->atom == atom)) {
+            return pr;
+        }
+        h = pr->hash_next;
+    }
+    return NULL;
+}
+
+static force_inline JSShapeProperty *find_own_property(JSProperty **ppr,
+                                                       JSObject *p,
+                                                       JSAtom atom)
+{
+    JSShape *sh;
+    JSShapeProperty *pr, *prop;
+    intptr_t h;
+    sh = p->shape;
+    h = (uintptr_t)atom & sh->prop_hash_mask;
+    h = prop_hash_end_field_of_shape(sh)[-h - 1];
+    prop = get_shape_prop(sh);
+    while (h) {
+        pr = &prop[h - 1];
+        if (likely(pr->atom == atom)) {
+            *ppr = &p->prop[h - 1];
+            /* the compiler should be able to assume that pr != NULL here */
+            return pr;
+        }
+        h = pr->hash_next;
+    }
+    *ppr = NULL;
+    return NULL;
+}
+
+/* indicate that the object may be part of a function prototype cycle */
+static void set_cycle_flag(JSContext *ctx, JSValueConst obj)
+{
+}
+
+static void free_var_ref(JSRuntime *rt, JSVarRef *var_ref)
+{
+    if (var_ref) {
+        assert(var_ref->header.ref_count > 0);
+        if (--var_ref->header.ref_count == 0) {
+            if (var_ref->link.prev != NULL) {
+                list_del(&var_ref->link); /* still on the stack */
+            } else {
+                JS_FreeValueRT(rt, var_ref->value);
+            }
+            js_free_rt(rt, var_ref);
+        }
+    }
+}
+
+static void js_array_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    int i;
+
+    for(i = 0; i < p->u.array.count; i++) {
+        JS_FreeValueRT(rt, p->u.array.u.values[i]);
+    }
+    js_free_rt(rt, p->u.array.u.values);
+}
+
+static void js_array_mark(JSRuntime *rt, JSValueConst val,
+                          JS_MarkFunc *mark_func)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    int i;
+
+    for(i = 0; i < p->u.array.count; i++) {
+        JS_MarkValue(rt, p->u.array.u.values[i], mark_func);
+    }
+}
+
+static void js_object_data_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    JS_FreeValueRT(rt, p->u.object_data);
+    p->u.object_data = JS_UNDEFINED;
+}
+
+static void js_object_data_mark(JSRuntime *rt, JSValueConst val,
+                                JS_MarkFunc *mark_func)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    JS_MarkValue(rt, p->u.object_data, mark_func);
+}
+
+static void js_bytecode_function_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSObject *p1, *p = JS_VALUE_GET_OBJ(val);
+    JSFunctionBytecode *b;
+    JSVarRef **var_refs;
+    int i;
+
+    p1 = p->u.func.home_object;
+    if (p1) {
+        JS_FreeValueRT(rt, JS_MKPTR(JS_TAG_OBJECT, p1));
+    }
+    b = p->u.func.function_bytecode;
+    if (b) {
+        var_refs = p->u.func.var_refs;
+        if (var_refs) {
+            for(i = 0; i < b->closure_var_count; i++)
+                free_var_ref(rt, var_refs[i]);
+            js_free_rt(rt, var_refs);
+        }
+        JS_FreeValueRT(rt, JS_MKPTR(JS_TAG_FUNCTION_BYTECODE, b));
+    }
+}
+
+static void js_bytecode_function_mark(JSRuntime *rt, JSValueConst val,
+                                      JS_MarkFunc *mark_func)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    JSVarRef **var_refs = p->u.func.var_refs;
+    JSFunctionBytecode *b = p->u.func.function_bytecode;
+    int i;
+
+    if (p->u.func.home_object) {
+        JS_MarkValue(rt, JS_MKPTR(JS_TAG_OBJECT, p->u.func.home_object),
+                     mark_func);
+    }
+    if (b) {
+        if (var_refs) {
+            for(i = 0; i < b->closure_var_count; i++) {
+                JSVarRef *var_ref = var_refs[i];
+                if (var_ref) {
+                    JS_MarkValue(rt, JS_MKPTR(JS_TAG_VAR_REF, var_ref),
+                                 mark_func);
+                }
+            }
+        }
+        /* must mark the function bytecode because template objects may be
+           part of a cycle */
+        JS_MarkValue(rt, JS_MKPTR(JS_TAG_FUNCTION_BYTECODE, b), mark_func);
+    }
+}
+
+static void js_bound_function_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    JSBoundFunction *bf = p->u.bound_function;
+    int i;
+
+    JS_FreeValueRT(rt, bf->func_obj);
+    JS_FreeValueRT(rt, bf->this_val);
+    for(i = 0; i < bf->argc; i++) {
+        JS_FreeValueRT(rt, bf->argv[i]);
+    }
+    js_free_rt(rt, bf);
+}
+
+static void js_bound_function_mark(JSRuntime *rt, JSValueConst val,
+                                JS_MarkFunc *mark_func)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    JSBoundFunction *bf = p->u.bound_function;
+    int i;
+
+    JS_MarkValue(rt, bf->func_obj, mark_func);
+    JS_MarkValue(rt, bf->this_val, mark_func);
+    for(i = 0; i < bf->argc; i++)
+        JS_MarkValue(rt, bf->argv[i], mark_func);
+}
+
+static void js_for_in_iterator_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    JSForInIterator *it = p->u.for_in_iterator;
+    JS_FreeValueRT(rt, it->obj);
+    js_free_rt(rt, it);
+}
+
+static void js_for_in_iterator_mark(JSRuntime *rt, JSValueConst val,
+                                JS_MarkFunc *mark_func)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    JSForInIterator *it = p->u.for_in_iterator;
+    JS_MarkValue(rt, it->obj, mark_func);
+}
+
+static void free_object_struct(JSRuntime *rt, JSObject *p)
+{
+    int i;
+    JSClassFinalizer *finalizer;
+    JSShape *sh;
+    JSShapeProperty *pr;
+
+    /* free all the fields */
+    sh = p->shape;
+    pr = get_shape_prop(sh);
+    for(i = 0; i < sh->prop_count; i++) {
+        free_property(rt, &p->prop[i], pr->flags);
+        pr++;
+    }
+    js_free_rt(rt, p->prop);
+    js_free_shape(rt, sh);
+
+    /* fail safe */
+    p->shape = NULL;
+    p->prop = NULL;
+
+    if (unlikely(p->first_weak_ref)) {
+        reset_weak_ref(rt, p);
+    }
+
+    finalizer = rt->class_array[p->class_id].finalizer;
+    if (finalizer)
+        (*finalizer)(rt, JS_MKPTR(JS_TAG_OBJECT, p));
+
+    /* fail safe */
+    p->class_id = 0;
+    p->u.opaque = NULL;
+    p->u.func.var_refs = NULL;
+    p->u.func.home_object = NULL;
+}
+
+static void free_object2(JSRuntime *rt, JSObject *p)
+{
+    if (p->free_mark) {
+        /* already freed (happen when freeing cycles) */
+        return;
+    }
+    /* indicate that the object is being freed */
+    p->free_mark = 1;
+
+    free_object_struct(rt, p);
+
+    /* remove from the global object list */
+    list_del(&p->link);
+    if (rt->in_gc_sweep) {
+        list_add_tail(&p->link, &rt->free_obj_list);
+    } else {
+        js_free_rt(rt, p);
+    }
+}
+
+static void free_object(JSRuntime *rt, JSObject *p)
+{
+    assert(p->header.ref_count == 0);
+    if (!rt->in_gc_sweep)
+        free_object2(rt, p);
+}
+
+/* called with the ref_count of 'v' reaches zero. */
+void __JS_FreeValueRT(JSRuntime *rt, JSValue v)
+{
+    uint32_t tag = JS_VALUE_GET_TAG(v);
+
+#ifdef DUMP_FREE
+    {
+        printf("Freeing ");
+        if (tag == JS_TAG_OBJECT) {
+            JS_DumpObject(rt, JS_VALUE_GET_OBJ(v));
+        } else {
+            JS_DumpValueShort(rt, v);
+            printf("\n");
+        }
+    }
+#endif
+
+    switch(tag) {
+    case JS_TAG_STRING:
+        {
+            JSString *p = JS_VALUE_GET_STRING(v);
+            if (p->atom_type) {
+                JS_FreeAtomStruct(rt, p);
+            } else {
+#ifdef DUMP_LEAKS
+                list_del(&p->link);
+#endif
+                js_free_rt(rt, p);
+            }
+        }
+        break;
+    case JS_TAG_OBJECT:
+        free_object(rt, JS_VALUE_GET_OBJ(v));
+        break;
+    case JS_TAG_FUNCTION_BYTECODE:
+        free_function_bytecode(rt, JS_VALUE_GET_PTR(v));
+        break;
+    case JS_TAG_SHAPE:
+    case JS_TAG_ASYNC_FUNCTION:
+    case JS_TAG_VAR_REF:
+    case JS_TAG_MODULE:
+        abort(); /* never freed here */
+        break;
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_INT:
+    case JS_TAG_BIG_FLOAT:
+        {
+            JSBigFloat *bf = JS_VALUE_GET_PTR(v);
+            bf_delete(&bf->num);
+            js_free_rt(rt, bf);
+        }
+        break;
+#endif
+    case JS_TAG_SYMBOL:
+        {
+            JSAtomStruct *p = JS_VALUE_GET_PTR(v);
+            JS_FreeAtomStruct(rt, p);
+        }
+        break;
+    default:
+        printf("__JS_FreeValue: unknown tag=%d\n", tag);
+        abort();
+    }
+}
+
+void __JS_FreeValue(JSContext *ctx, JSValue v)
+{
+    __JS_FreeValueRT(ctx->rt, v);
+}
+
+/* garbage collection */
+
+static BOOL has_children(JSValueConst val)
+{
+    switch(JS_VALUE_GET_TAG(val)) {
+    case JS_TAG_VAR_REF:
+    case JS_TAG_OBJECT:
+    case JS_TAG_FUNCTION_BYTECODE:
+    case JS_TAG_ASYNC_FUNCTION:
+    case JS_TAG_SHAPE:
+        return TRUE;
+    default:
+        return FALSE;
+    }
+}
+
+void JS_MarkValue(JSRuntime *rt, JSValueConst val, JS_MarkFunc *mark_func)
+{
+    if (JS_VALUE_HAS_REF_COUNT(val) && has_children(val)) {
+        mark_func(rt, val);
+    }
+}
+
+static void mark_children(JSRuntime *rt, JSValueConst val, JS_MarkFunc *mark_func)
+{
+    switch(JS_VALUE_GET_TAG(val)) {
+    case JS_TAG_OBJECT:
+        {
+            JSObject *p = JS_VALUE_GET_OBJ(val);
+            JSShapeProperty *prs;
+            JSShape *sh;
+            int i;
+            sh = p->shape;
+            mark_func(rt, JS_MKPTR(JS_TAG_SHAPE, sh));
+            /* mark all the fields */
+            prs = get_shape_prop(sh);
+            for(i = 0; i < sh->prop_count; i++) {
+                JSProperty *pr = &p->prop[i];
+                if (prs->atom != JS_ATOM_NULL) {
+                    if (prs->flags & JS_PROP_TMASK) {
+                        if ((prs->flags & JS_PROP_TMASK) == JS_PROP_GETSET) {
+                            if (pr->u.getset.getter)
+                                mark_func(rt, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.getter));
+                            if (pr->u.getset.setter)
+                                mark_func(rt, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.setter));
+                        } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF) {
+                            JS_MarkValue(rt, JS_MKPTR(JS_TAG_VAR_REF, pr->u.var_ref), mark_func);
+                        } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+                            /* nothing to do */
+                        }
+                    } else {
+                        JS_MarkValue(rt, pr->u.value, mark_func);
+                    }
+                }
+                prs++;
+            }
+
+            if (p->class_id != JS_CLASS_OBJECT) {
+                JSClassGCMark *gc_mark;
+                gc_mark = rt->class_array[p->class_id].gc_mark;
+                if (gc_mark)
+                    gc_mark(rt, JS_MKPTR(JS_TAG_OBJECT, p), mark_func);
+            }
+        }
+        break;
+    case JS_TAG_FUNCTION_BYTECODE:
+        /* the template objects can be part of a cycle */
+        {
+            JSFunctionBytecode *b = JS_VALUE_GET_PTR(val);
+            int i;
+            for(i = 0; i < b->cpool_count; i++) {
+                JS_MarkValue(rt, b->cpool[i], mark_func);
+            }
+        }
+        break;
+    case JS_TAG_VAR_REF:
+        {
+            JSVarRef *var_ref = JS_VALUE_GET_PTR(val);
+            /* the refcount of stack values is not incremented, hence
+               the test */
+            if (var_ref->link.prev == NULL) {
+                JS_MarkValue(rt, *var_ref->pvalue, mark_func);
+            }
+        }
+        break;
+    case JS_TAG_ASYNC_FUNCTION:
+        {
+            JSAsyncFunctionData *s = JS_VALUE_GET_PTR(val);
+            if (s->is_active)
+                async_func_mark(rt, &s->func_state, mark_func);
+            JS_MarkValue(rt, s->resolving_funcs[0], mark_func);
+            JS_MarkValue(rt, s->resolving_funcs[1], mark_func);
+        }
+        break;
+    case JS_TAG_SHAPE:
+        {
+            JSShape *sh = JS_VALUE_GET_PTR(val);
+            if (sh->proto != NULL) {
+                mark_func(rt, JS_MKPTR(JS_TAG_OBJECT, sh->proto));
+            }
+        }
+        break;
+    default:
+        /* no children */
+        break;
+    }
+}
+
+#if 0
+/* not useful until realms are supported */
+static void mark_context(JSRuntime *rt, JSContext *ctx)
+{
+    int i;
+    struct list_head *el;
+
+    list_for_each(el, &ctx->loaded_modules) {
+        JSModuleDef *m = list_entry(el, JSModuleDef, link);
+        JS_MarkValue(rt, m->module_ns);
+        JS_MarkValue(rt, m->func_obj);
+    }
+
+    JS_MarkValue(rt, ctx->current_exception);
+
+    for(i = 0; i < rt->class_count; i++)
+        JS_MarkValue(rt, ctx->class_proto[i]);
+    JS_MarkValue(rt, ctx->regexp_ctor);
+    JS_MarkValue(rt, ctx->function_ctor);
+    JS_MarkValue(rt, ctx->function_proto);
+    JS_MarkValue(rt, ctx->iterator_proto);
+    JS_MarkValue(rt, ctx->async_iterator_proto);
+    JS_MarkValue(rt, ctx->array_proto_values);
+
+    for(i = 0; i < JS_NATIVE_ERROR_COUNT; i++)
+        JS_MarkValue(rt, ctx->native_error_proto[i]);
+
+    JS_MarkValue(rt, ctx->throw_type_error);
+    JS_MarkValue(rt, ctx->global_obj);
+    JS_MarkValue(rt, ctx->global_var_obj);
+}
+#endif
+
+/* 1 = possible member of a cycle
+   2 = member of a cycle
+*/
+
+static void gc_decref_mark(JSRuntime *rt, JSValueConst obj);
+
+//#define DUMP_GC_DECREF
+
+#ifdef DUMP_GC_DECREF
+static int decref_indent;
+#endif
+
+static void gc_decref_child(JSRuntime *rt, JSValueConst obj)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(obj);
+
+#ifdef DUMP_LEAKS
+#ifdef DUMP_GC_DECREF
+    {
+        int i;
+        for(i = 0; i < decref_indent; i++)
+                printf("  ");
+        if (JS_IsObject(obj)) {
+            JS_DumpObject(rt, p);
+        } else {
+            JS_DumpValueShort(rt, obj); printf("\n");
+        }
+    }
+#endif
+    if (p->header.ref_count <= 0) {
+        printf("%p: invalid refcount (%d)\n", p, p->header.ref_count);
+        if (JS_IsObject(obj)) {
+            JS_DumpObject(rt, p);
+        } else {
+            JS_DumpValueShort(rt, obj);
+        }
+    }
+#endif
+    assert(p->header.ref_count > 0);
+    p->header.ref_count--;
+    gc_decref_mark(rt, obj);
+}
+
+static void gc_decref_mark(JSRuntime *rt, JSValueConst obj)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(obj);
+    if (p->gc_header.mark == 0) {
+        p->gc_header.mark = 1;
+#ifdef DUMP_GC_DECREF
+        decref_indent++;
+#endif
+        mark_children(rt, obj, gc_decref_child);
+#ifdef DUMP_GC_DECREF
+        decref_indent--;
+#endif
+    }
+}
+
+static void gc_decref(JSRuntime *rt)
+{
+    struct list_head *el;
+    JSObject *p;
+
+    list_for_each(el, &rt->obj_list) {
+        p = list_entry(el, JSObject, link);
+        gc_decref_mark(rt, JS_MKPTR(JS_TAG_OBJECT, p));
+    }
+}
+
+static void gc_scan_incref(JSRuntime *rt, JSValueConst obj);
+
+static void gc_scan_incref_child(JSRuntime *rt, JSValueConst obj)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(obj);
+    p->header.ref_count++;
+    if (p->gc_header.mark != 0) {
+        gc_scan_incref(rt, obj);
+    }
+}
+
+static void gc_scan_incref(JSRuntime *rt, JSValueConst obj)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(obj);
+    p->gc_header.mark = 0; /* not freed */
+    if (JS_IsObject(obj)) {
+        /* remove the tmp_obj_list and update the next object to
+           explore */
+        if (rt->el_next == &p->link)
+            rt->el_next = rt->el_next->next;
+        /* add to rt->obj_list */
+        list_del(&p->link);
+        list_add_tail(&p->link, &rt->obj_list);
+    }
+    mark_children(rt, obj, gc_scan_incref_child);
+}
+
+static void gc_scan_obj(JSRuntime *rt, JSValueConst obj)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(obj);
+    if (p->gc_header.mark == 1) {
+        if (p->header.ref_count > 0) {
+            gc_scan_incref(rt, obj);
+        } else {
+            p->gc_header.mark = 2;
+            mark_children(rt, obj, gc_scan_obj);
+        }
+    }
+}
+
+static void gc_scan_obj2(JSRuntime *rt, JSValueConst obj);
+
+static void gc_scan_incref_child2(JSRuntime *rt, JSValueConst obj)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(obj);
+    p->header.ref_count++;
+    gc_scan_obj2(rt, obj);
+}
+
+static void gc_scan_obj2(JSRuntime *rt, JSValueConst obj)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(obj);
+    if (p->gc_header.mark == 2) {
+        p->gc_header.mark = 3;
+        mark_children(rt, obj, gc_scan_incref_child2);
+    }
+}
+
+static void gc_scan(JSRuntime *rt)
+{
+    struct list_head *el;
+    JSObject *p;
+
+    /* move obj_list to tmp_obj_list */
+    list_add(&rt->tmp_obj_list, &rt->obj_list);
+    list_del(&rt->obj_list);
+    init_list_head(&rt->obj_list);
+
+    /* keep the objects with a refcount > 0 and their children. After
+       this pass, obj_list contains the objects to be deleted. Their
+       mark is 2. */
+    for(el = rt->tmp_obj_list.next; el != &rt->tmp_obj_list;
+        el = rt->el_next) {
+        rt->el_next = el->next; /* may be modified by gc_scan_obj() */
+        p = list_entry(el, JSObject, link);
+        gc_scan_obj(rt, JS_MKPTR(JS_TAG_OBJECT, p));
+    }
+
+    /* restore the refcount of the objects to be deleted. After this
+       pass, their mark is 3 */
+    list_for_each(el, &rt->tmp_obj_list) {
+        p = list_entry(el, JSObject, link);
+        gc_scan_obj2(rt, JS_MKPTR(JS_TAG_OBJECT, p));
+    }
+}
+
+static void gc_free_cycles(JSRuntime *rt)
+{
+    struct list_head *el, *el1;
+    JSObject *p;
+#ifdef DUMP_GC_FREE
+    BOOL header_done = FALSE;
+#endif
+    init_list_head(&rt->free_obj_list);
+    rt->in_gc_sweep = TRUE;
+    list_for_each_safe(el, el1, &rt->tmp_obj_list) {
+        p = list_entry(el, JSObject, link);
+        assert(p->gc_header.mark == 3);
+#ifdef DUMP_GC_FREE
+        if (!header_done) {
+            printf("Freeing cycles:\n");
+            JS_DumpObjectHeader(rt);
+            header_done = TRUE;
+        }
+        JS_DumpObject(rt, p);
+#endif
+        free_object2(rt, p);
+    }
+    rt->in_gc_sweep = FALSE;
+
+    /* free all the object structures */
+    list_for_each_safe(el, el1, &rt->free_obj_list) {
+        p = list_entry(el, JSObject, link);
+        js_free_rt(rt, p);
+    }
+}
+
+void JS_RunGC(JSRuntime *rt)
+{
+    /* decrement the reference of the children of each object. mark =
+       1 after this pass. */
+    gc_decref(rt);
+
+    /* keep objects with a non zero refcount and their childs */
+    gc_scan(rt);
+
+    /* free the objects with a zero refcount */
+    gc_free_cycles(rt);
+}
+
+/* Return false if not an object or if the object has already been
+   freed (zombie objects are visible in finalizers when freeing
+   cycles). */
+BOOL JS_IsLiveObject(JSRuntime *rt, JSValueConst obj)
+{
+    JSObject *p;
+    if (!JS_IsObject(obj))
+        return FALSE;
+    p = JS_VALUE_GET_OBJ(obj);
+    return !p->free_mark;
+}
+
+/* Return true during the GC sweep phase (can be useful inside in finalizer) */
+BOOL JS_IsInGCSweep(JSRuntime *rt)
+{
+    return rt->in_gc_sweep;
+}
+
+/* Compute memory used by various object types */
+/* XXX: poor man's approach to handling multiply referenced objects */
+typedef struct JSMemoryUsage_helper {
+    double memory_used_count;
+    double str_count;
+    double str_size;
+    double js_func_count;
+    double js_func_size;
+    double js_func_code_size;
+    double js_func_pc2line_count;
+    double js_func_pc2line_size;
+} JSMemoryUsage_helper;
+
+static void compute_value_size(JSValueConst val, JSMemoryUsage_helper *hp);
+
+static void compute_jsstring_size(JSString *str, JSMemoryUsage_helper *hp)
+{
+    if (!str->atom_type) {  /* atoms are handled separately */
+        double s_ref_count = str->header.ref_count;
+        hp->str_count += 1 / s_ref_count;
+        hp->str_size += ((sizeof(*str) + (str->len << str->is_wide_char) +
+                          1 - str->is_wide_char) / s_ref_count);
+    }
+}
+
+static void compute_bytecode_size(JSFunctionBytecode *b, JSMemoryUsage_helper *hp)
+{
+    int memory_used_count, js_func_size, i;
+    double ref_count = b->header.ref_count;
+
+    memory_used_count = 0;
+    js_func_size = offsetof(JSFunctionBytecode, debug);
+    if (b->vardefs) {
+        js_func_size += (b->arg_count + b->var_count) * sizeof(*b->vardefs);
+    }
+    if (b->cpool) {
+        js_func_size += b->cpool_count * sizeof(*b->cpool);
+        for (i = 0; i < b->cpool_count; i++) {
+            JSValueConst val = b->cpool[i];
+            compute_value_size(val, hp);
+        }
+    }
+    if (b->closure_var) {
+        js_func_size += b->closure_var_count * sizeof(*b->closure_var);
+    }
+    if (!b->read_only_bytecode && b->byte_code_buf) {
+        hp->js_func_code_size += b->byte_code_len / ref_count;
+    }
+    if (b->has_debug) {
+        js_func_size += sizeof(*b) - offsetof(JSFunctionBytecode, debug);
+        if (b->debug.source) {
+            memory_used_count++;
+            js_func_size += b->debug.source_len + 1;
+        }
+        if (b->debug.pc2line_len) {
+            memory_used_count++;
+            hp->js_func_pc2line_count += 1 / ref_count;
+            hp->js_func_pc2line_size += b->debug.pc2line_len / ref_count;
+        }
+    }
+    hp->js_func_size += js_func_size / ref_count;
+    hp->js_func_count += 1 / ref_count;
+    hp->memory_used_count += memory_used_count / ref_count;
+}
+
+static void compute_value_size(JSValueConst val, JSMemoryUsage_helper *hp)
+{
+    switch(JS_VALUE_GET_TAG(val)) {
+    case JS_TAG_STRING:
+        compute_jsstring_size(JS_VALUE_GET_STRING(val), hp);
+        break;
+    case JS_TAG_FUNCTION_BYTECODE:
+        compute_bytecode_size(JS_VALUE_GET_PTR(val), hp);
+        break;
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_INT:
+    case JS_TAG_BIG_FLOAT:
+        /* should track JSBigFloat usage */
+        break;
+#endif
+    }
+}
+
+void JS_ComputeMemoryUsage(JSRuntime *rt, JSMemoryUsage *s)
+{
+    struct list_head *el, *el1;
+    int i;
+    JSMemoryUsage_helper mem = { 0 }, *hp = &mem;
+
+    memset(s, 0, sizeof(*s));
+    s->malloc_count = rt->malloc_state.malloc_count;
+    s->malloc_size = rt->malloc_state.malloc_size;
+    s->malloc_limit = rt->malloc_state.malloc_limit;
+
+    s->memory_used_count = 2; /* rt + rt->class_array */
+    s->memory_used_size = sizeof(JSRuntime) + sizeof(JSValue) * rt->class_count;
+
+    list_for_each(el, &rt->context_list) {
+        JSContext *ctx = list_entry(el, JSContext, link);
+        JSShape *sh = ctx->array_shape;
+        s->memory_used_count += 2; /* ctx + ctx->class_proto */
+        s->memory_used_size += sizeof(JSContext) +
+            sizeof(JSValue) * rt->class_count;
+        s->binary_object_count += ctx->binary_object_count;
+        s->binary_object_size += ctx->binary_object_size;
+
+        /* the hashed shapes are counted separately */
+        if (sh && !sh->is_hashed) {
+            int hash_size = sh->prop_hash_mask + 1;
+            s->shape_count++;
+            s->shape_size += get_shape_size(hash_size, sh->prop_size);
+        }
+        list_for_each(el1, &ctx->loaded_modules) {
+            JSModuleDef *m = list_entry(el1, JSModuleDef, link);
+            s->memory_used_count += 1;
+            s->memory_used_size += sizeof(*m);
+            if (m->req_module_entries) {
+                s->memory_used_count += 1;
+                s->memory_used_size += m->req_module_entries_count * sizeof(*m->req_module_entries);
+            }
+            if (m->export_entries) {
+                s->memory_used_count += 1;
+                s->memory_used_size += m->export_entries_count * sizeof(*m->export_entries);
+                for (i = 0; i < m->export_entries_count; i++) {
+                    JSExportEntry *me = &m->export_entries[i];
+                    if (me->export_type == JS_EXPORT_TYPE_LOCAL && me->u.local.var_ref) {
+                        /* potential multiple count */
+                        s->memory_used_count += 1;
+                        compute_value_size(me->u.local.var_ref->value, hp);
+                    }
+                }
+            }
+            if (m->star_export_entries) {
+                s->memory_used_count += 1;
+                s->memory_used_size += m->star_export_entries_count * sizeof(*m->star_export_entries);
+            }
+            if (m->import_entries) {
+                s->memory_used_count += 1;
+                s->memory_used_size += m->import_entries_count * sizeof(*m->import_entries);
+            }
+            compute_value_size(m->module_ns, hp);
+            compute_value_size(m->func_obj, hp);
+        }
+    }
+
+    list_for_each(el, &rt->obj_list) {
+        JSObject *p = list_entry(el, JSObject, link);
+        JSShape *sh = p->shape;
+        JSShapeProperty *prs;
+        s->obj_count++;
+        if (p->prop) {
+            s->memory_used_count++;
+            s->prop_size += sh->prop_size * sizeof(*p->prop);
+            s->prop_count += sh->prop_count;
+            prs = get_shape_prop(sh);
+            for(i = 0; i < sh->prop_count; i++) {
+                JSProperty *pr = &p->prop[i];
+                if (prs->atom != JS_ATOM_NULL && !(prs->flags & JS_PROP_TMASK)) {
+                    compute_value_size(pr->u.value, hp);
+                }
+                prs++;
+            }
+        }
+        /* the hashed shapes are counted separately */
+        if (!sh->is_hashed) {
+            int hash_size = sh->prop_hash_mask + 1;
+            s->shape_count++;
+            s->shape_size += get_shape_size(hash_size, sh->prop_size);
+        }
+
+        switch(p->class_id) {
+        case JS_CLASS_ARRAY:             /* u.array | length */
+        case JS_CLASS_ARGUMENTS:         /* u.array | length */
+            s->array_count++;
+            if (p->fast_array) {
+                s->fast_array_count++;
+                if (p->u.array.u.values) {
+                    s->memory_used_count++;
+                    s->memory_used_size += p->u.array.count *
+                        sizeof(*p->u.array.u.values);
+                    s->fast_array_elements += p->u.array.count;
+                    for (i = 0; i < p->u.array.count; i++) {
+                        compute_value_size(p->u.array.u.values[i], hp);
+                    }
+                }
+            }
+            break;
+        case JS_CLASS_NUMBER:            /* u.object_data */
+        case JS_CLASS_STRING:            /* u.object_data */
+        case JS_CLASS_BOOLEAN:           /* u.object_data */
+        case JS_CLASS_SYMBOL:            /* u.object_data */
+        case JS_CLASS_DATE:              /* u.object_data */
+#ifdef CONFIG_BIGNUM
+        case JS_CLASS_BIG_INT:           /* u.object_data */
+        case JS_CLASS_BIG_FLOAT:         /* u.object_data */
+#endif
+            compute_value_size(p->u.object_data, hp);
+            break;
+        case JS_CLASS_C_FUNCTION:        /* u.cfunc */
+            s->c_func_count++;
+            break;
+        case JS_CLASS_BYTECODE_FUNCTION: /* u.func */
+            {
+                JSFunctionBytecode *b = p->u.func.function_bytecode;
+                JSVarRef **var_refs = p->u.func.var_refs;
+                /* home_object: object will be accounted for in list scan */
+                if (var_refs) {
+                    s->memory_used_count++;
+                    s->js_func_size += b->closure_var_count * sizeof(*var_refs);
+                    for (i = 0; i < b->closure_var_count; i++) {
+                        if (var_refs[i]) {
+                            double ref_count = var_refs[i]->header.ref_count;
+                            s->memory_used_count += 1 / ref_count;
+                            s->js_func_size += sizeof(*var_refs[i]) / ref_count;
+                            /* handle non object closed values */
+                            if (var_refs[i]->pvalue == &var_refs[i]->value) {
+                                /* potential multiple count */
+                                compute_value_size(var_refs[i]->value, hp);
+                            }
+                        }
+                    }
+                }
+                compute_bytecode_size(b, hp);
+            }
+            break;
+        case JS_CLASS_BOUND_FUNCTION:    /* u.bound_function */
+            {
+                JSBoundFunction *bf = p->u.bound_function;
+                /* func_obj and this_val are objects */
+                for (i = 0; i < bf->argc; i++) {
+                    compute_value_size(bf->argv[i], hp);
+                }
+                s->memory_used_count += 1;
+                s->memory_used_size += sizeof(*bf) + bf->argc * sizeof(*bf->argv);
+            }
+            break;
+        case JS_CLASS_C_FUNCTION_DATA:   /* u.c_function_data_record */
+            {
+                JSCFunctionDataRecord *fd = p->u.c_function_data_record;
+                if (fd) {
+                    for (i = 0; i < fd->data_len; i++) {
+                        compute_value_size(fd->data[i], hp);
+                    }
+                    s->memory_used_count += 1;
+                    s->memory_used_size += sizeof(*fd) + fd->data_len * sizeof(*fd->data);
+                }
+            }
+            break;
+        case JS_CLASS_REGEXP:            /* u.regexp */
+            compute_jsstring_size(p->u.regexp.pattern, hp);
+            compute_jsstring_size(p->u.regexp.bytecode, hp);
+            break;
+
+        case JS_CLASS_FOR_IN_ITERATOR:   /* u.for_in_iterator */
+            {
+                JSForInIterator *it = p->u.for_in_iterator;
+                if (it) {
+                    compute_value_size(it->obj, hp);
+                    s->memory_used_count += 1;
+                    s->memory_used_size += sizeof(*it);
+                }
+            }
+            break;
+        case JS_CLASS_ARRAY_BUFFER:      /* u.array_buffer */
+        case JS_CLASS_SHARED_ARRAY_BUFFER: /* u.array_buffer */
+            {
+                JSArrayBuffer *abuf = p->u.array_buffer;
+                if (abuf) {
+                    s->memory_used_count += 1;
+                    s->memory_used_size += sizeof(*abuf);
+                    if (abuf->data) {
+                        s->memory_used_count += 1;
+                        s->memory_used_size += abuf->byte_length;
+                    }
+                }
+            }
+            break;
+        case JS_CLASS_GENERATOR:         /* u.generator_data */
+        case JS_CLASS_UINT8C_ARRAY:      /* u.typed_array / u.array */
+        case JS_CLASS_INT8_ARRAY:        /* u.typed_array / u.array */
+        case JS_CLASS_UINT8_ARRAY:       /* u.typed_array / u.array */
+        case JS_CLASS_INT16_ARRAY:       /* u.typed_array / u.array */
+        case JS_CLASS_UINT16_ARRAY:      /* u.typed_array / u.array */
+        case JS_CLASS_INT32_ARRAY:       /* u.typed_array / u.array */
+        case JS_CLASS_UINT32_ARRAY:      /* u.typed_array / u.array */
+#ifdef CONFIG_BIGNUM
+        case JS_CLASS_BIG_INT64_ARRAY:   /* u.typed_array / u.array */
+        case JS_CLASS_BIG_UINT64_ARRAY:  /* u.typed_array / u.array */
+#endif
+        case JS_CLASS_FLOAT32_ARRAY:     /* u.typed_array / u.array */
+        case JS_CLASS_FLOAT64_ARRAY:     /* u.typed_array / u.array */
+        case JS_CLASS_DATAVIEW:          /* u.typed_array */
+#ifdef CONFIG_BIGNUM
+        case JS_CLASS_FLOAT_ENV:         /* u.float_env */
+#endif
+        case JS_CLASS_MAP:               /* u.map_state */
+        case JS_CLASS_SET:               /* u.map_state */
+        case JS_CLASS_WEAKMAP:           /* u.map_state */
+        case JS_CLASS_WEAKSET:           /* u.map_state */
+        case JS_CLASS_MAP_ITERATOR:      /* u.map_iterator_data */
+        case JS_CLASS_SET_ITERATOR:      /* u.map_iterator_data */
+        case JS_CLASS_ARRAY_ITERATOR:    /* u.array_iterator_data */
+        case JS_CLASS_STRING_ITERATOR:   /* u.array_iterator_data */
+        case JS_CLASS_PROXY:             /* u.proxy_data */
+        case JS_CLASS_PROMISE:           /* u.promise_data */
+        case JS_CLASS_PROMISE_RESOLVE_FUNCTION:  /* u.promise_function_data */
+        case JS_CLASS_PROMISE_REJECT_FUNCTION:   /* u.promise_function_data */
+        case JS_CLASS_ASYNC_FUNCTION_RESOLVE:    /* u.async_function_data */
+        case JS_CLASS_ASYNC_FUNCTION_REJECT:     /* u.async_function_data */
+        case JS_CLASS_ASYNC_FROM_SYNC_ITERATOR:  /* u.async_from_sync_iterator_data */
+        case JS_CLASS_ASYNC_GENERATOR:   /* u.async_generator_data */
+            /* TODO */
+        default:
+            /* XXX: class definition should have an opaque block size */
+            if (p->u.opaque) {
+                s->memory_used_count += 1;
+            }
+            break;
+        }
+    }
+    s->obj_size += s->obj_count * sizeof(JSObject);
+
+    /* hashed shapes */
+    s->memory_used_count++; /* rt->shape_hash */
+    s->memory_used_size += sizeof(rt->shape_hash[0]) * rt->shape_hash_size;
+    for(i = 0; i < rt->shape_hash_size; i++) {
+        JSShape *sh;
+        for(sh = rt->shape_hash[i]; sh != NULL; sh = sh->shape_hash_next) {
+            int hash_size = sh->prop_hash_mask + 1;
+            s->shape_count++;
+            s->shape_size += get_shape_size(hash_size, sh->prop_size);
+        }
+    }
+
+    /* atoms */
+    s->memory_used_count += 2; /* rt->atom_array, rt->atom_hash */
+    s->atom_count = rt->atom_count;
+    s->atom_size = sizeof(rt->atom_array[0]) * rt->atom_size +
+        sizeof(rt->atom_hash[0]) * rt->atom_hash_size;
+    for(i = 0; i < rt->atom_size; i++) {
+        JSAtomStruct *p = rt->atom_array[i];
+        if (!atom_is_free(p)) {
+            s->atom_size += (sizeof(*p) + (p->len << p->is_wide_char) +
+                             1 - p->is_wide_char);
+        }
+    }
+    s->str_count = round(mem.str_count);
+    s->str_size = round(mem.str_size);
+    s->js_func_count = round(mem.js_func_count);
+    s->js_func_size = round(mem.js_func_size);
+    s->js_func_code_size = round(mem.js_func_code_size);
+    s->js_func_pc2line_count = round(mem.js_func_pc2line_count);
+    s->js_func_pc2line_size = round(mem.js_func_pc2line_size);
+    s->memory_used_count += round(mem.memory_used_count) +
+        s->atom_count + s->str_count +
+        s->obj_count + s->shape_count +
+        s->js_func_count + s->js_func_pc2line_count;
+    s->memory_used_size += s->atom_size + s->str_size +
+        s->obj_size + s->prop_size + s->shape_size +
+        s->js_func_size + s->js_func_code_size + s->js_func_pc2line_size;
+}
+
+void JS_DumpMemoryUsage(FILE *fp, const JSMemoryUsage *s, JSRuntime *rt)
+{
+    fprintf(fp, "QuickJS memory usage -- "
+#ifdef CONFIG_BIGNUM
+            "BigNum "
+#endif
+            CONFIG_VERSION " version, %d-bit, malloc limit: %"PRId64"\n\n",
+            (int)sizeof(void *) * 8, (int64_t)(ssize_t)s->malloc_limit);
+#if 1
+    if (rt) {
+        static const struct {
+            const char *name;
+            size_t size;
+        } object_types[] = {
+            { "JSRuntime", sizeof(JSRuntime) },
+            { "JSContext", sizeof(JSContext) },
+            { "JSObject", sizeof(JSObject) },
+            { "JSString", sizeof(JSString) },
+            { "JSFunctionBytecode", sizeof(JSFunctionBytecode) },
+        };
+        int i, usage_size_ok = 0;
+        for(i = 0; i < countof(object_types); i++) {
+            unsigned int size = object_types[i].size;
+            void *p = js_malloc_rt(rt, size);
+            if (p) {
+                unsigned int size1 = js_malloc_usable_size_rt(rt, p);
+                if (size1 >= size) {
+                    usage_size_ok = 1;
+                    fprintf(fp, "  %3u + %-2u  %s\n",
+                            size, size1 - size, object_types[i].name);
+                }
+                js_free_rt(rt, p);
+            }
+        }
+        if (!usage_size_ok) {
+            fprintf(fp, "  malloc_usable_size unavailable\n");
+        }
+        {
+            int obj_classes[JS_CLASS_INIT_COUNT + 1] = { 0 };
+            int class_id;
+            struct list_head *el;
+            list_for_each(el, &rt->obj_list) {
+                JSObject *p = list_entry(el, JSObject, link);
+                obj_classes[min_uint32(p->class_id, JS_CLASS_INIT_COUNT)]++;
+            }
+            fprintf(fp, "\n" "JSObject classes\n");
+            if (obj_classes[0])
+                fprintf(fp, "  %5d  %2.0d %s\n", obj_classes[0], 0, "none");
+            for (class_id = 1; class_id < JS_CLASS_INIT_COUNT; class_id++) {
+                if (obj_classes[class_id]) {
+                    char buf[ATOM_GET_STR_BUF_SIZE];
+                    fprintf(fp, "  %5d  %2.0d %s\n", obj_classes[class_id], class_id,
+                            JS_AtomGetStrRT(rt, buf, sizeof(buf), js_std_class_def[class_id - 1].class_name));
+                }
+            }
+            if (obj_classes[JS_CLASS_INIT_COUNT])
+                fprintf(fp, "  %5d  %2.0d %s\n", obj_classes[JS_CLASS_INIT_COUNT], 0, "other");
+        }
+        fprintf(fp, "\n");
+    }
+#endif
+    fprintf(fp, "%-20s %8s %8s\n", "NAME", "COUNT", "SIZE");
+
+    if (s->malloc_count) {
+        fprintf(fp, "%-20s %8"PRId64" %8"PRId64"  (%0.1f per block)\n",
+                "memory allocated", s->malloc_count, s->malloc_size,
+                (double)s->malloc_size / s->malloc_count);
+        fprintf(fp, "%-20s %8"PRId64" %8"PRId64"  (%d overhead, %0.1f average slack)\n",
+                "memory used", s->memory_used_count, s->memory_used_size,
+                MALLOC_OVERHEAD, ((double)(s->malloc_size - s->memory_used_size) /
+                                  s->memory_used_count));
+    }
+    if (s->atom_count) {
+        fprintf(fp, "%-20s %8"PRId64" %8"PRId64"  (%0.1f per atom)\n",
+                "atoms", s->atom_count, s->atom_size,
+                (double)s->atom_size / s->atom_count);
+    }
+    if (s->str_count) {
+        fprintf(fp, "%-20s %8"PRId64" %8"PRId64"  (%0.1f per string)\n",
+                "strings", s->str_count, s->str_size,
+                (double)s->str_size / s->str_count);
+    }
+    if (s->obj_count) {
+        fprintf(fp, "%-20s %8"PRId64" %8"PRId64"  (%0.1f per object)\n",
+                "objects", s->obj_count, s->obj_size,
+                (double)s->obj_size / s->obj_count);
+        fprintf(fp, "%-20s %8"PRId64" %8"PRId64"  (%0.1f per object)\n",
+                "  properties", s->prop_count, s->prop_size,
+                (double)s->prop_count / s->obj_count);
+        fprintf(fp, "%-20s %8"PRId64" %8"PRId64"  (%0.1f per shape)\n",
+                "  shapes", s->shape_count, s->shape_size,
+                (double)s->shape_size / s->shape_count);
+    }
+    if (s->js_func_count) {
+        fprintf(fp, "%-20s %8"PRId64" %8"PRId64"\n",
+                "bytecode functions", s->js_func_count, s->js_func_size);
+        fprintf(fp, "%-20s %8"PRId64" %8"PRId64"  (%0.1f per function)\n",
+                "  bytecode", s->js_func_count, s->js_func_code_size,
+                (double)s->js_func_code_size / s->js_func_count);
+        if (s->js_func_pc2line_count) {
+            fprintf(fp, "%-20s %8"PRId64" %8"PRId64"  (%0.1f per function)\n",
+                    "  pc2line", s->js_func_pc2line_count,
+                    s->js_func_pc2line_size,
+                    (double)s->js_func_pc2line_size / s->js_func_pc2line_count);
+        }
+    }
+    if (s->c_func_count) {
+        fprintf(fp, "%-20s %8"PRId64"\n", "C functions", s->c_func_count);
+    }
+    if (s->array_count) {
+        fprintf(fp, "%-20s %8"PRId64"\n", "arrays", s->array_count);
+        if (s->fast_array_count) {
+            fprintf(fp, "%-20s %8"PRId64"\n", "  fast arrays", s->fast_array_count);
+            fprintf(fp, "%-20s %8"PRId64" %8"PRId64"  (%0.1f per fast array)\n",
+                    "  elements", s->fast_array_elements,
+                    s->fast_array_elements * (int)sizeof(JSValue),
+                    (double)s->fast_array_elements / s->fast_array_count);
+        }
+    }
+    if (s->binary_object_count) {
+        fprintf(fp, "%-20s %8"PRId64" %8"PRId64"\n",
+                "binary objects", s->binary_object_count, s->binary_object_size);
+    }
+}
+
+JSValue JS_GetGlobalObject(JSContext *ctx)
+{
+    return JS_DupValue(ctx, ctx->global_obj);
+}
+
+/* WARNING: obj is freed */
+JSValue JS_Throw(JSContext *ctx, JSValue obj)
+{
+    JS_FreeValue(ctx, ctx->current_exception);
+    ctx->current_exception = obj;
+    ctx->exception_needs_backtrace = JS_IsError(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+/* return the pending exception (cannot be called twice). */
+JSValue JS_GetException(JSContext *ctx)
+{
+    JSValue val;
+    val = ctx->current_exception;
+    ctx->current_exception = JS_NULL;
+    ctx->exception_needs_backtrace = FALSE;
+    return val;
+}
+
+static void dbuf_put_leb128(DynBuf *s, uint32_t v)
+{
+    uint32_t a;
+    for(;;) {
+        a = v & 0x7f;
+        v >>= 7;
+        if (v != 0) {
+            dbuf_putc(s, a | 0x80);
+        } else {
+            dbuf_putc(s, a);
+            break;
+        }
+    }
+}
+
+static void dbuf_put_sleb128(DynBuf *s, int32_t v1)
+{
+    uint32_t v = v1;
+    dbuf_put_leb128(s, (2 * v) ^ -(v >> 31));
+}
+
+static int get_leb128(uint32_t *pval, const uint8_t *buf,
+                      const uint8_t *buf_end)
+{
+    const uint8_t *ptr = buf;
+    uint32_t v, a, i;
+    v = 0;
+    for(i = 0; i < 5; i++) {
+        if (unlikely(ptr >= buf_end))
+            break;
+        a = *ptr++;
+        v |= (a & 0x7f) << (i * 7);
+        if (!(a & 0x80)) {
+            *pval = v;
+            return ptr - buf;
+        }
+    }
+    *pval = 0;
+    return -1;
+}
+
+static int get_sleb128(int32_t *pval, const uint8_t *buf,
+                       const uint8_t *buf_end)
+{
+    int ret;
+    uint32_t val;
+    ret = get_leb128(&val, buf, buf_end);
+    if (ret < 0) {
+        *pval = 0;
+        return -1;
+    }
+    *pval = (val >> 1) ^ -(val & 1);
+    return ret;
+}
+
+static int find_line_num(JSContext *ctx, JSFunctionBytecode *b,
+                         uint32_t pc_value)
+{
+    const uint8_t *p_end, *p;
+    int new_line_num, line_num, pc, v, ret;
+    unsigned int op;
+
+    if (!b->has_debug || !b->debug.pc2line_buf) {
+        /* function was stripped */
+        return -1;
+    }
+
+    p = b->debug.pc2line_buf;
+    p_end = p + b->debug.pc2line_len;
+    pc = 0;
+    line_num = b->debug.line_num;
+    while (p < p_end) {
+        op = *p++;
+        if (op == 0) {
+            uint32_t val;
+            ret = get_leb128(&val, p, p_end);
+            if (ret < 0)
+                goto fail;
+            pc += val;
+            p += ret;
+            ret = get_sleb128(&v, p, p_end);
+            if (ret < 0) {
+            fail:
+                /* should never happen */
+                return b->debug.line_num;
+            }
+            p += ret;
+            new_line_num = line_num + v;
+        } else {
+            op -= PC2LINE_OP_FIRST;
+            pc += (op / PC2LINE_RANGE);
+            new_line_num = line_num + (op % PC2LINE_RANGE) + PC2LINE_BASE;
+        }
+        if (pc_value < pc)
+            return line_num;
+        line_num = new_line_num;
+    }
+    return line_num;
+}
+
+/* if filename != NULL, an additional level is added with the filename
+   and line number information (used for parse error). If 'pc' !=
+   NULL, it is used as the cur_pc value for the current stack frame */
+static void build_backtrace(JSContext *ctx, JSValueConst error_obj,
+                            const char *filename, int line_num,
+                            const uint8_t *cur_pc)
+{
+    JSStackFrame *sf;
+    JSValue str, func_name;
+    DynBuf dbuf;
+    const char *func_name_str;
+    const char *str1;
+    JSObject *p;
+
+    ctx->exception_needs_backtrace = FALSE;
+    js_dbuf_init(ctx, &dbuf);
+    if (filename) {
+        dbuf_printf(&dbuf, "    at %s", filename);
+        if (line_num != -1)
+            dbuf_printf(&dbuf, ":%d", line_num);
+        dbuf_putc(&dbuf, '\n');
+        str = JS_NewString(ctx, filename);
+        JS_DefinePropertyValue(ctx, error_obj, JS_ATOM_fileName, str,
+                               JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+        JS_DefinePropertyValue(ctx, error_obj, JS_ATOM_lineNumber, JS_NewInt32(ctx, line_num),
+                               JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+    }
+    for(sf = ctx->current_stack_frame; sf != NULL; sf = sf->prev_frame) {
+        func_name = JS_GetProperty(ctx, sf->cur_func, JS_ATOM_name);
+        func_name_str = JS_ToCString(ctx, func_name);
+        if (!func_name_str || func_name_str[0] == '\0')
+            str1 = "<anonymous>";
+        else
+            str1 = func_name_str;
+        dbuf_printf(&dbuf, "    at %s", str1);
+        JS_FreeCString(ctx, func_name_str);
+        JS_FreeValue(ctx, func_name);
+
+        p = JS_VALUE_GET_OBJ(sf->cur_func);
+        if (js_class_has_bytecode(p->class_id)) {
+            JSFunctionBytecode *b;
+            char atom_buf[ATOM_GET_STR_BUF_SIZE];
+            int line_num1;
+
+            b = p->u.func.function_bytecode;
+            if (b->has_debug) {
+                if (sf == ctx->current_stack_frame) {
+                    if (!cur_pc) {
+                        line_num1 = b->debug.line_num;
+                    } else {
+                        line_num1 = find_line_num(ctx, b,
+                                                  cur_pc - b->byte_code_buf - 1);
+                    }
+                } else {
+                    line_num1 = find_line_num(ctx, b,
+                                              sf->cur_pc - b->byte_code_buf - 1);
+                }
+                dbuf_printf(&dbuf, " (%s",
+                            JS_AtomGetStr(ctx, atom_buf, sizeof(atom_buf),
+                                          b->debug.filename));
+                if (line_num1 != -1)
+                    dbuf_printf(&dbuf, ":%d", line_num1);
+                dbuf_putc(&dbuf, ')');
+            }
+        } else {
+            dbuf_printf(&dbuf, " (native)");
+        }
+        dbuf_putc(&dbuf, '\n');
+    }
+    dbuf_putc(&dbuf, '\0');
+    str = JS_NewString(ctx, (char *)dbuf.buf);
+    dbuf_free(&dbuf);
+    JS_DefinePropertyValue(ctx, error_obj, JS_ATOM_stack, str,
+                           JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+}
+
+JSValue JS_NewError(JSContext *ctx)
+{
+    return JS_NewObjectClass(ctx, JS_CLASS_ERROR);
+}
+
+static JSValue JS_ThrowError(JSContext *ctx, JSErrorEnum error_num,
+                             const char *fmt, va_list ap)
+{
+    char buf[256];
+    JSValue obj, ret;
+
+    vsnprintf(buf, sizeof(buf), fmt, ap);
+    obj = JS_NewObjectProtoClass(ctx, ctx->native_error_proto[error_num],
+                                 JS_CLASS_ERROR);
+    if (unlikely(JS_IsException(obj))) {
+        /* out of memory: throw JS_NULL to avoid recursing */
+        obj = JS_NULL;
+    } else {
+        JS_DefinePropertyValue(ctx, obj, JS_ATOM_message,
+                               JS_NewString(ctx, buf),
+                               JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+    }
+    ret = JS_Throw(ctx, obj);
+    return ret;
+}
+
+#if defined(_MSC_VER)
+JSValue JS_ThrowSyntaxError(JSContext *ctx, const char *fmt, ...)
+#else
+JSValue __attribute__((format(printf, 2, 3))) JS_ThrowSyntaxError(JSContext *ctx, const char *fmt, ...)
+#endif
+{
+    JSValue val;
+    va_list ap;
+
+    va_start(ap, fmt);
+    val = JS_ThrowError(ctx, JS_SYNTAX_ERROR, fmt, ap);
+    va_end(ap);
+    return val;
+}
+
+#if defined(_MSC_VER)
+JSValue JS_ThrowTypeError(JSContext *ctx, const char *fmt, ...)
+#else
+JSValue __attribute__((format(printf, 2, 3))) JS_ThrowTypeError(JSContext *ctx, const char *fmt, ...)
+#endif
+{
+    JSValue val;
+    va_list ap;
+
+    va_start(ap, fmt);
+    val = JS_ThrowError(ctx, JS_TYPE_ERROR, fmt, ap);
+    va_end(ap);
+    return val;
+}
+
+#if defined(_MSC_VER)
+static int JS_ThrowTypeErrorOrFalse(JSContext *ctx, int flags, const char *fmt, ...)
+#else
+static int __attribute__((format(printf, 3, 4))) JS_ThrowTypeErrorOrFalse(JSContext *ctx, int flags, const char *fmt, ...)
+#endif
+{
+    va_list ap;
+
+    if ((flags & JS_PROP_THROW) ||
+        ((flags & JS_PROP_THROW_STRICT) && is_strict_mode(ctx))) {
+        va_start(ap, fmt);
+        JS_ThrowError(ctx, JS_TYPE_ERROR, fmt, ap);
+        va_end(ap);
+        return -1;
+    } else {
+        return FALSE;
+    }
+}
+
+static int JS_ThrowTypeErrorReadOnly(JSContext *ctx, int flags, JSAtom atom)
+{
+    if ((flags & JS_PROP_THROW) ||
+        ((flags & JS_PROP_THROW_STRICT) && is_strict_mode(ctx))) {
+        char buf[ATOM_GET_STR_BUF_SIZE];
+        JS_ThrowTypeError(ctx, "%s is read-only",
+                          JS_AtomGetStr(ctx, buf, sizeof(buf), atom));
+        return -1;
+    } else {
+        return FALSE;
+    }
+}
+
+#if defined(_MSC_VER)
+JSValue JS_ThrowReferenceError(JSContext *ctx, const char *fmt, ...)
+#else
+JSValue __attribute__((format(printf, 2, 3))) JS_ThrowReferenceError(JSContext *ctx, const char *fmt, ...)
+#endif
+{
+    JSValue val;
+    va_list ap;
+
+    va_start(ap, fmt);
+    val = JS_ThrowError(ctx, JS_REFERENCE_ERROR, fmt, ap);
+    va_end(ap);
+    return val;
+}
+
+#if defined(_MSC_VER)
+JSValue JS_ThrowRangeError(JSContext *ctx, const char *fmt, ...)
+#else
+JSValue __attribute__((format(printf, 2, 3))) JS_ThrowRangeError(JSContext *ctx, const char *fmt, ...)
+#endif
+{
+    JSValue val;
+    va_list ap;
+
+    va_start(ap, fmt);
+    val = JS_ThrowError(ctx, JS_RANGE_ERROR, fmt, ap);
+    va_end(ap);
+    return val;
+}
+
+#if defined(_MSC_VER)
+JSValue JS_ThrowInternalError(JSContext *ctx, const char *fmt, ...)
+#else
+JSValue __attribute__((format(printf, 2, 3))) JS_ThrowInternalError(JSContext *ctx, const char *fmt, ...)
+#endif
+{
+    JSValue val;
+    va_list ap;
+
+    va_start(ap, fmt);
+    val = JS_ThrowError(ctx, JS_INTERNAL_ERROR, fmt, ap);
+    va_end(ap);
+    return val;
+}
+
+JSValue JS_ThrowOutOfMemory(JSContext *ctx)
+{
+    if (!ctx->in_out_of_memory) {
+        ctx->in_out_of_memory = TRUE;
+        JS_ThrowInternalError(ctx, "out of memory");
+        ctx->in_out_of_memory = FALSE;
+    }
+    return JS_EXCEPTION;
+}
+
+static JSValue JS_ThrowStackOverflow(JSContext *ctx)
+{
+    return JS_ThrowInternalError(ctx, "stack overflow");
+}
+
+static JSValue JS_ThrowTypeErrorNotAnObject(JSContext *ctx)
+{
+    return JS_ThrowTypeError(ctx, "not an object");
+}
+
+static JSValue JS_ThrowReferenceErrorNotDefined(JSContext *ctx, JSAtom name)
+{
+    char buf[ATOM_GET_STR_BUF_SIZE];
+    return JS_ThrowReferenceError(ctx, "%s is not defined",
+                                  JS_AtomGetStr(ctx, buf, sizeof(buf), name));
+}
+
+static JSValue JS_ThrowReferenceErrorUninitialized(JSContext *ctx, JSAtom name)
+{
+    char buf[ATOM_GET_STR_BUF_SIZE];
+    return JS_ThrowReferenceError(ctx, "%s is not initialized",
+                                  name == JS_ATOM_NULL ? "lexical variable" :
+                                  JS_AtomGetStr(ctx, buf, sizeof(buf), name));
+}
+
+static JSValue JS_ThrowTypeErrorInvalidClass(JSContext *ctx, int class_id)
+{
+    JSRuntime *rt = ctx->rt;
+    char buf[ATOM_GET_STR_BUF_SIZE];
+    JSAtom name;
+    name = rt->class_array[class_id].class_name;
+    return JS_ThrowTypeError(ctx, "%s object expected",
+                             JS_AtomGetStr(ctx, buf, sizeof(buf), name));
+}
+
+/* return -1 (exception) or TRUE/FALSE */
+static int JS_SetPrototypeInternal(JSContext *ctx, JSValueConst obj,
+                                   JSValueConst proto_val,
+                                   BOOL throw_flag)
+{
+    JSObject *proto, *p, *p1;
+    JSShape *sh;
+
+    if (throw_flag) {
+        if (JS_VALUE_GET_TAG(obj) == JS_TAG_NULL ||
+            JS_VALUE_GET_TAG(obj) == JS_TAG_UNDEFINED)
+            goto not_obj;
+    } else {
+        if (JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT)
+            goto not_obj;
+    }
+    p = JS_VALUE_GET_OBJ(obj);
+    if (JS_VALUE_GET_TAG(proto_val) != JS_TAG_OBJECT) {
+        if (JS_VALUE_GET_TAG(proto_val) != JS_TAG_NULL) {
+        not_obj:
+            JS_ThrowTypeErrorNotAnObject(ctx);
+            return -1;
+        }
+        proto = NULL;
+    } else {
+        proto = JS_VALUE_GET_OBJ(proto_val);
+    }
+
+    if (throw_flag && JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT)
+        return TRUE;
+
+    if (unlikely(p->class_id == JS_CLASS_PROXY))
+        return js_proxy_setPrototypeOf(ctx, obj, proto_val, throw_flag);
+    sh = p->shape;
+    if (sh->proto == proto)
+        return TRUE;
+    if (!p->extensible) {
+        if (throw_flag) {
+            JS_ThrowTypeError(ctx, "object is not extensible");
+            return -1;
+        } else {
+            return FALSE;
+        }
+    }
+    if (proto) {
+        /* check if there is a cycle */
+        p1 = proto;
+        do {
+            if (p1 == p) {
+                if (throw_flag) {
+                    JS_ThrowTypeError(ctx, "circular prototype chain");
+                    return -1;
+                } else {
+                    return FALSE;
+                }
+            }
+            /* Note: for Proxy objects, proto is NULL */
+            p1 = p1->shape->proto;
+        } while (p1 != NULL);
+        JS_DupValue(ctx, proto_val);
+    }
+
+    if (js_shape_prepare_update(ctx, p, NULL))
+        return -1;
+    sh = p->shape;
+    if (sh->proto)
+        JS_FreeValue(ctx, JS_MKPTR(JS_TAG_OBJECT, sh->proto));
+    sh->proto = proto;
+    return TRUE;
+}
+
+/* return -1 (exception) or TRUE/FALSE */
+int JS_SetPrototype(JSContext *ctx, JSValueConst obj, JSValueConst proto_val)
+{
+    return JS_SetPrototypeInternal(ctx, obj, proto_val, TRUE);
+}
+
+/* Return an Object, JS_NULL or JS_EXCEPTION in case of Proxy object. */
+JSValueConst JS_GetPrototype(JSContext *ctx, JSValueConst val)
+{
+    JSObject *p;
+
+    switch(JS_VALUE_GET_NORM_TAG(val)) {
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_INT:
+        val = ctx->class_proto[JS_CLASS_BIG_INT];
+        break;
+    case JS_TAG_INT:
+        if (is_bignum_mode(ctx)) {
+            val = ctx->class_proto[JS_CLASS_BIG_INT];
+        } else {
+            val = ctx->class_proto[JS_CLASS_NUMBER];
+        }
+        break;
+    case JS_TAG_FLOAT64:
+        val = ctx->class_proto[JS_CLASS_NUMBER];
+        break;
+    case JS_TAG_BIG_FLOAT:
+        val = ctx->class_proto[JS_CLASS_BIG_FLOAT];
+        break;
+#else
+    case JS_TAG_INT:
+    case JS_TAG_FLOAT64:
+        val = ctx->class_proto[JS_CLASS_NUMBER];
+        break;
+#endif
+    case JS_TAG_BOOL:
+        val = ctx->class_proto[JS_CLASS_BOOLEAN];
+        break;
+    case JS_TAG_STRING:
+        val = ctx->class_proto[JS_CLASS_STRING];
+        break;
+    case JS_TAG_SYMBOL:
+        val = ctx->class_proto[JS_CLASS_SYMBOL];
+        break;
+    case JS_TAG_OBJECT:
+        p = JS_VALUE_GET_OBJ(val);
+        if (unlikely(p->class_id == JS_CLASS_PROXY)) {
+            val = js_proxy_getPrototypeOf(ctx, val);
+        } else {
+            p = p->shape->proto;
+            if (!p)
+                val = JS_NULL;
+            else
+                val = JS_MKPTR(JS_TAG_OBJECT, p);
+        }
+        break;
+    case JS_TAG_NULL:
+    case JS_TAG_UNDEFINED:
+    default:
+        val = JS_NULL;
+        break;
+    }
+    return val;
+}
+
+/* return TRUE, FALSE or (-1) in case of exception */
+static int JS_OrdinaryIsInstanceOf(JSContext *ctx, JSValueConst val,
+                                   JSValueConst obj)
+{
+    JSValue obj_proto;
+    JSObject *proto;
+    const JSObject *p, *proto1;
+    BOOL ret;
+
+    if (!JS_IsFunction(ctx, obj))
+        return FALSE;
+    p = JS_VALUE_GET_OBJ(obj);
+    if (p->class_id == JS_CLASS_BOUND_FUNCTION) {
+        JSBoundFunction *s = p->u.bound_function;
+        return JS_IsInstanceOf(ctx, val, s->func_obj);
+    }
+
+    /* Only explicitly boxed values are instances of constructors */
+    if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT)
+        return FALSE;
+    ret = FALSE;
+    obj_proto = JS_GetProperty(ctx, obj, JS_ATOM_prototype);
+    if (JS_VALUE_GET_TAG(obj_proto) != JS_TAG_OBJECT) {
+        if (!JS_IsException(obj_proto))
+            JS_ThrowTypeError(ctx, "operand 'prototype' property is not an object");
+        ret = -1;
+        goto done;
+    }
+    proto = JS_VALUE_GET_OBJ(obj_proto);
+    p = JS_VALUE_GET_OBJ(val);
+    for(;;) {
+        proto1 = p->shape->proto;
+        if (!proto1) {
+            if (p->class_id == JS_CLASS_PROXY) {
+                JSValueConst proto_val;
+                proto_val = JS_GetPrototype(ctx, JS_MKPTR(JS_TAG_OBJECT, (JSObject *)p));
+                if (JS_IsException(proto_val)) {
+                    ret = -1;
+                    goto done;
+                }
+                proto1 = JS_VALUE_GET_OBJ(proto_val);
+                if (!proto1)
+                    break;
+            } else {
+                break;
+            }
+        }
+        p = proto1;
+        if (proto == p) {
+            ret = TRUE;
+            break;
+        }
+    }
+done:
+    JS_FreeValue(ctx, obj_proto);
+    return ret;
+}
+
+/* return TRUE, FALSE or (-1) in case of exception */
+int JS_IsInstanceOf(JSContext *ctx, JSValueConst val, JSValueConst obj)
+{
+    JSValue method;
+
+    if (!JS_IsObject(obj))
+        goto fail;
+    method = JS_GetProperty(ctx, obj, JS_ATOM_Symbol_hasInstance);
+    if (JS_IsException(method))
+        return -1;
+    if (!JS_IsNull(method) && !JS_IsUndefined(method)) {
+        JSValue ret;
+        ret = JS_CallFree(ctx, method, obj, 1, &val);
+        return JS_ToBoolFree(ctx, ret);
+    }
+
+    /* legacy case */
+    if (!JS_IsFunction(ctx, obj)) {
+    fail:
+        JS_ThrowTypeError(ctx, "invalid 'instanceof' right operand");
+        return -1;
+    }
+    return JS_OrdinaryIsInstanceOf(ctx, val, obj);
+}
+
+static int JS_AutoInitProperty(JSContext *ctx, JSObject *p, JSAtom prop, JSProperty *pr)
+{
+    return (*pr->u.init.init_func)(ctx, p, prop, pr->u.init.opaque);
+}
+
+JSValue JS_GetPropertyInternal(JSContext *ctx, JSValueConst obj,
+                               JSAtom prop, JSValueConst this_obj,
+                               BOOL throw_ref_error)
+{
+    JSObject *p;
+    JSProperty *pr;
+    JSShapeProperty *prs;
+    uint32_t tag;
+
+    tag = JS_VALUE_GET_TAG(obj);
+    if (unlikely(tag != JS_TAG_OBJECT)) {
+        switch(tag) {
+        case JS_TAG_NULL:
+        case JS_TAG_UNDEFINED:
+            return JS_ThrowTypeError(ctx, "value has no property");
+        case JS_TAG_EXCEPTION:
+            return JS_EXCEPTION;
+        case JS_TAG_STRING:
+            {
+                JSString *p1 = JS_VALUE_GET_STRING(obj);
+                if (__JS_AtomIsTaggedInt(prop)) {
+                    uint32_t idx, ch;
+                    idx = __JS_AtomToUInt32(prop);
+                    if (idx < p1->len) {
+                        if (p1->is_wide_char)
+                            ch = p1->u.str16[idx];
+                        else
+                            ch = p1->u.str8[idx];
+                        return js_new_string_char(ctx, ch);
+                    }
+                } else if (prop == JS_ATOM_length) {
+                    return JS_NewInt32(ctx, p1->len);
+                }
+            }
+            break;
+        default:
+            break;
+        }
+        /* cannot raise an exception */
+        p = JS_VALUE_GET_OBJ(JS_GetPrototype(ctx, obj));
+        if (!p)
+            return JS_UNDEFINED;
+    } else {
+        p = JS_VALUE_GET_OBJ(obj);
+    }
+
+    for(;;) {
+        prs = find_own_property(&pr, p, prop);
+        if (prs) {
+            /* found */
+            if (unlikely(prs->flags & JS_PROP_TMASK)) {
+                if ((prs->flags & JS_PROP_TMASK) == JS_PROP_GETSET) {
+                    if (unlikely(!pr->u.getset.getter)) {
+                        return JS_UNDEFINED;
+                    } else {
+                        JSValue func = JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.getter);
+                        /* Note: the field could be removed in the getter */
+                        func = JS_DupValue(ctx, func);
+                        return JS_CallFree(ctx, func, this_obj, 0, NULL);
+                    }
+                } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF) {
+                    JSValue val = *pr->u.var_ref->pvalue;
+                    if (unlikely(JS_IsUninitialized(val)))
+                        return JS_ThrowReferenceErrorUninitialized(ctx, prs->atom);
+                    return JS_DupValue(ctx, val);
+                } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+                    /* Instantiate property and retry */
+                    if (JS_AutoInitProperty(ctx, p, prop, pr))
+                        return JS_EXCEPTION;
+                    continue;
+                }
+            } else {
+                return JS_DupValue(ctx, pr->u.value);
+            }
+        }
+        if (unlikely(p->is_exotic)) {
+            /* exotic behaviors */
+            if (p->fast_array) {
+                if (__JS_AtomIsTaggedInt(prop)) {
+                    uint32_t idx = __JS_AtomToUInt32(prop);
+                    if (idx < p->u.array.count) {
+                        /* we avoid duplicating the code */
+                        return JS_GetPropertyUint32(ctx, JS_MKPTR(JS_TAG_OBJECT, p), idx);
+                    } else if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+                               p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+                        goto typed_array_oob;
+                    }
+                } else if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+                           p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+                    int ret;
+                    ret = JS_AtomIsNumericIndex(ctx, prop);
+                    if (ret != 0) {
+                        if (ret < 0)
+                            return JS_EXCEPTION;
+                    typed_array_oob:
+                        if (typed_array_is_detached(ctx, p))
+                            return JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+                        return JS_UNDEFINED;
+                    }
+                }
+            } else {
+                const JSClassExoticMethods *em = ctx->rt->class_array[p->class_id].exotic;
+                if (em) {
+                    if (em->get_property) {
+                        /* XXX: should pass throw_ref_error */
+                        return em->get_property(ctx, JS_MKPTR(JS_TAG_OBJECT, p),
+                                                prop, this_obj);
+                    }
+                    if (em->get_own_property) {
+                        JSPropertyDescriptor desc;
+                        int ret;
+
+                        ret = em->get_own_property(ctx, &desc, JS_MKPTR(JS_TAG_OBJECT, p), prop);
+                        if (ret < 0)
+                            return JS_EXCEPTION;
+                        if (ret) {
+                            if (desc.flags & JS_PROP_GETSET) {
+                                JS_FreeValue(ctx, desc.setter);
+                                return JS_CallFree(ctx, desc.getter, this_obj, 0, NULL);
+                            } else {
+                                return desc.value;
+                            }
+                        }
+                    }
+                }
+            }
+        }
+        p = p->shape->proto;
+        if (!p)
+            break;
+    }
+    if (unlikely(throw_ref_error)) {
+        return JS_ThrowReferenceErrorNotDefined(ctx, prop);
+    } else {
+        return JS_UNDEFINED;
+    }
+}
+
+static int num_keys_cmp(const void *p1, const void *p2, void *opaque)
+{
+    JSContext *ctx = opaque;
+    JSAtom atom1 = ((const JSPropertyEnum *)p1)->atom;
+    JSAtom atom2 = ((const JSPropertyEnum *)p2)->atom;
+    uint64_t v1, v2;
+    BOOL atom1_is_integer, atom2_is_integer;
+
+    atom1_is_integer = JS_AtomIsIntegerIndex(ctx, &v1, atom1);
+    atom2_is_integer = JS_AtomIsIntegerIndex(ctx, &v2, atom2);
+    assert(atom1_is_integer && atom2_is_integer);
+    if (v1 < v2)
+        return -1;
+    else if (v1 == v2)
+        return 0;
+    else
+        return 1;
+}
+
+static void js_free_prop_enum(JSContext *ctx, JSPropertyEnum *tab, uint32_t len)
+{
+    uint32_t i;
+    if (tab) {
+        for(i = 0; i < len; i++)
+            JS_FreeAtom(ctx, tab[i].atom);
+        js_free(ctx, tab);
+    }
+}
+
+#define JS_GPN_SYMBOL_MASK  (1 << 0)
+#define JS_GPN_STRING_MASK  (1 << 1)
+/* only include the enumerable properties */
+#define JS_GPN_ENUM_ONLY    (1 << 2)
+/* set theJSPropertyEnum.is_enumerable field */
+#define JS_GPN_SET_ENUM     (1 << 3)
+
+static int __exception JS_GetOwnPropertyNames(JSContext *ctx, JSPropertyEnum **ptab,
+                                              uint32_t *plen,
+                                              JSObject *p, int flags)
+{
+    int i, j;
+    JSShape *sh;
+    JSShapeProperty *prs;
+    JSPropertyEnum *tab_atom, *tab_exotic;
+    JSAtom atom;
+    uint32_t num_keys_count, str_keys_count, sym_keys_count, atom_count;
+    uint32_t num_index, str_index, sym_index, exotic_count;
+    BOOL is_enumerable, is_string, num_sorted;
+    uint64_t num_key;
+
+    /* clear pointer for consistency in case of failure */
+    *ptab = NULL;
+    *plen = 0;
+
+    /* compute the number of returned properties */
+    num_keys_count = 0;
+    str_keys_count = 0;
+    sym_keys_count = 0;
+    exotic_count = 0;
+    tab_exotic = NULL;
+    sh = p->shape;
+    for(i = 0, prs = get_shape_prop(sh); i < sh->prop_count; i++, prs++) {
+        atom = prs->atom;
+        if (atom != JS_ATOM_NULL) {
+            is_enumerable = ((prs->flags & JS_PROP_ENUMERABLE) != 0);
+            is_string = JS_AtomIsString(ctx, atom);
+            if ((!(flags & JS_GPN_ENUM_ONLY) || is_enumerable) &&
+                ((flags >> is_string) & 1) != 0) {
+                /* need to raise an exception in case of the module
+                   name space (implicit GetOwnProperty) */
+                if (unlikely((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF) &&
+                    (flags & (JS_GPN_SET_ENUM | JS_GPN_ENUM_ONLY))) {
+                    JSVarRef *var_ref = p->prop[i].u.var_ref;
+                    if (unlikely(JS_IsUninitialized(*var_ref->pvalue))) {
+                        JS_ThrowReferenceErrorUninitialized(ctx, prs->atom);
+                        return -1;
+                    }
+                }
+                if (JS_AtomIsIntegerIndex(ctx, &num_key, atom)) {
+                    num_keys_count++;
+                } else if (is_string) {
+                    str_keys_count++;
+                } else {
+                    sym_keys_count++;
+                }
+            }
+        }
+    }
+
+    if (p->is_exotic) {
+        if (p->fast_array) {
+            /* the implicit GetOwnProperty raises an exception if the
+               typed array is detached */
+            if ((flags & (JS_GPN_SET_ENUM | JS_GPN_ENUM_ONLY)) &&
+                 (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+                  p->class_id <= JS_CLASS_FLOAT64_ARRAY) &&
+                 typed_array_is_detached(ctx, p) &&
+                typed_array_get_length(ctx, p) != 0) {
+                JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+                return -1;
+            }
+            num_keys_count += p->u.array.count;
+        } else {
+            const JSClassExoticMethods *em = ctx->rt->class_array[p->class_id].exotic;
+            if (em && em->get_own_property_names) {
+                if (em->get_own_property_names(ctx, &tab_exotic, &exotic_count,
+                                               JS_MKPTR(JS_TAG_OBJECT, p)))
+                    return -1;
+                for(i = 0; i < exotic_count; i++) {
+                    atom = tab_exotic[i].atom;
+                    is_string = JS_AtomIsString(ctx, atom);
+                    if (((flags >> is_string) & 1) != 0) {
+                        is_enumerable = FALSE;
+                        if (flags & (JS_GPN_SET_ENUM | JS_GPN_ENUM_ONLY)) {
+                            JSPropertyDescriptor desc;
+                            int res;
+                            /* set the "is_enumerable" field if necessary */
+                            res = JS_GetOwnProperty(ctx, &desc, p, atom);
+                            if (res < 0) {
+                                js_free_prop_enum(ctx, tab_exotic, exotic_count);
+                                return -1;
+                            }
+                            if (res) {
+                                is_enumerable =
+                                    ((desc.flags & JS_PROP_ENUMERABLE) != 0);
+                                js_free_desc(ctx, &desc);
+                            }
+                            tab_exotic[i].is_enumerable = is_enumerable;
+                        }
+                        if (!(flags & JS_GPN_ENUM_ONLY) || is_enumerable) {
+                            if (JS_AtomIsIntegerIndex(ctx, &num_key, atom)) {
+                                num_keys_count++;
+                            } else if (is_string) {
+                                str_keys_count++;
+                            } else {
+                                sym_keys_count++;
+                            }
+                        }
+                    }
+                }
+            }
+        }
+    }
+
+    /* fill them */
+
+    atom_count = num_keys_count + str_keys_count + sym_keys_count;
+    /* avoid allocating 0 bytes */
+    tab_atom = js_malloc(ctx, sizeof(tab_atom[0]) * max_int(atom_count, 1));
+    if (!tab_atom) {
+        js_free_prop_enum(ctx, tab_exotic, exotic_count);
+        return -1;
+    }
+
+    num_index = 0;
+    str_index = num_keys_count;
+    sym_index = str_index + str_keys_count;
+
+    num_sorted = TRUE;
+    sh = p->shape;
+    for(i = 0, prs = get_shape_prop(sh); i < sh->prop_count; i++, prs++) {
+        atom = prs->atom;
+        if (atom != JS_ATOM_NULL) {
+            is_enumerable = ((prs->flags & JS_PROP_ENUMERABLE) != 0);
+            is_string = JS_AtomIsString(ctx, atom);
+            if ((!(flags & JS_GPN_ENUM_ONLY) || is_enumerable) &&
+                ((flags >> is_string) & 1) != 0) {
+                if (JS_AtomIsIntegerIndex(ctx, &num_key, atom)) {
+                    j = num_index++;
+                    num_sorted = FALSE;
+                } else if (is_string) {
+                    j = str_index++;
+                } else {
+                    j = sym_index++;
+                }
+                tab_atom[j].atom = JS_DupAtom(ctx, atom);
+                tab_atom[j].is_enumerable = is_enumerable;
+            }
+        }
+    }
+
+    if (p->is_exotic) {
+        if (p->fast_array) {
+            for(i = 0; i < p->u.array.count; i++) {
+                tab_atom[num_index].atom = __JS_AtomFromUInt32(i);
+                if (tab_atom[num_index].atom == JS_ATOM_NULL) {
+                    js_free_prop_enum(ctx, tab_exotic, exotic_count);
+                    js_free_prop_enum(ctx, tab_atom, num_index);
+                    return -1;
+                }
+                tab_atom[num_index].is_enumerable = TRUE;
+                num_index++;
+            }
+        }
+        if (exotic_count > 0) {
+            for(i = 0; i < exotic_count; i++) {
+                atom = tab_exotic[i].atom;
+                is_enumerable = tab_exotic[i].is_enumerable;
+                is_string = JS_AtomIsString(ctx, atom);
+                if ((!(flags & JS_GPN_ENUM_ONLY) || is_enumerable) &&
+                    ((flags >> is_string) & 1) != 0) {
+                    if (JS_AtomIsIntegerIndex(ctx, &num_key, atom)) {
+                        j = num_index++;
+                        num_sorted = FALSE;
+                    } else if (is_string) {
+                        j = str_index++;
+                    } else {
+                        j = sym_index++;
+                    }
+                    tab_atom[j].atom = atom;
+                    tab_atom[j].is_enumerable = is_enumerable;
+                } else {
+                    JS_FreeAtom(ctx, atom);
+                }
+            }
+        }
+        js_free(ctx, tab_exotic);
+    }
+
+    assert(num_index == num_keys_count);
+    assert(str_index == num_keys_count + str_keys_count);
+    assert(sym_index == atom_count);
+
+    if (num_keys_count != 0 && !num_sorted) {
+        rqsort(tab_atom, num_keys_count, sizeof(tab_atom[0]), num_keys_cmp,
+               ctx);
+    }
+    *ptab = tab_atom;
+    *plen = atom_count;
+    return 0;
+}
+
+/* Return -1 if exception,
+   FALSE if the property does not exist, TRUE if it exists. If TRUE is
+   returned, the property descriptor 'desc' is filled present. */
+static int JS_GetOwnProperty(JSContext *ctx, JSPropertyDescriptor *desc,
+                             JSObject *p, JSAtom prop)
+{
+    JSShapeProperty *prs;
+    JSProperty *pr;
+
+retry:
+    prs = find_own_property(&pr, p, prop);
+    if (prs) {
+        if (desc) {
+            desc->flags = prs->flags & JS_PROP_C_W_E;
+            desc->getter = JS_UNDEFINED;
+            desc->setter = JS_UNDEFINED;
+            desc->value = JS_UNDEFINED;
+            if (unlikely(prs->flags & JS_PROP_TMASK)) {
+                if ((prs->flags & JS_PROP_TMASK) == JS_PROP_GETSET) {
+                    desc->flags |= JS_PROP_GETSET;
+                    if (pr->u.getset.getter)
+                        desc->getter = JS_DupValue(ctx, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.getter));
+                    if (pr->u.getset.setter)
+                        desc->setter = JS_DupValue(ctx, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.setter));
+                } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF) {
+                    JSValue val = *pr->u.var_ref->pvalue;
+                    if (unlikely(JS_IsUninitialized(val))) {
+                        JS_ThrowReferenceErrorUninitialized(ctx, prs->atom);
+                        return -1;
+                    }
+                    desc->value = JS_DupValue(ctx, val);
+                } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+                    /* Instantiate property and retry */
+                    if (JS_AutoInitProperty(ctx, p, prop, pr))
+                        return -1;
+                    goto retry;
+                }
+            } else {
+                desc->value = JS_DupValue(ctx, pr->u.value);
+            }
+        } else {
+            /* for consistency, send the exception even if desc is NULL */
+            if (unlikely((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF)) {
+                if (unlikely(JS_IsUninitialized(*pr->u.var_ref->pvalue))) {
+                    JS_ThrowReferenceErrorUninitialized(ctx, prs->atom);
+                    return -1;
+                }
+            } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+                /* nothing to do: delay instantiation until actual value and/or attributes are read */
+            }
+        }
+        return TRUE;
+    }
+    if (p->is_exotic) {
+        if (p->fast_array) {
+            /* specific case for fast arrays */
+            if (__JS_AtomIsTaggedInt(prop)) {
+                uint32_t idx;
+                idx = __JS_AtomToUInt32(prop);
+                if (idx < p->u.array.count) {
+                    if (desc) {
+                        desc->flags = JS_PROP_WRITABLE | JS_PROP_ENUMERABLE;
+                        if (p->class_id == JS_CLASS_ARRAY ||
+                            p->class_id == JS_CLASS_ARGUMENTS)
+                            desc->flags |= JS_PROP_CONFIGURABLE;
+                        desc->getter = JS_UNDEFINED;
+                        desc->setter = JS_UNDEFINED;
+                        desc->value = JS_GetPropertyUint32(ctx, JS_MKPTR(JS_TAG_OBJECT, p), idx);
+                    }
+                    return TRUE;
+                }
+            }
+            if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+                p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+                int ret;
+                ret = JS_AtomIsNumericIndex(ctx, prop);
+                if (ret != 0) {
+                    if (ret < 0)
+                        return -1;
+                    if (typed_array_is_detached(ctx, p)) {
+                        JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+                        return -1;
+                    }
+                }
+            }
+        } else {
+            const JSClassExoticMethods *em = ctx->rt->class_array[p->class_id].exotic;
+            if (em && em->get_own_property) {
+                return em->get_own_property(ctx, desc,
+                                            JS_MKPTR(JS_TAG_OBJECT, p), prop);
+            }
+        }
+    }
+    return FALSE;
+}
+
+/* return -1 if exception (Proxy object only) or TRUE/FALSE */
+int JS_IsExtensible(JSContext *ctx, JSValueConst obj)
+{
+    JSObject *p;
+
+    if (unlikely(JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT))
+        return FALSE;
+    p = JS_VALUE_GET_OBJ(obj);
+    if (unlikely(p->class_id == JS_CLASS_PROXY))
+        return js_proxy_isExtensible(ctx, obj);
+    else
+        return p->extensible;
+}
+
+/* return -1 if exception (Proxy object only) or TRUE/FALSE */
+int JS_PreventExtensions(JSContext *ctx, JSValueConst obj)
+{
+    JSObject *p;
+
+    if (unlikely(JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT))
+        return FALSE;
+    p = JS_VALUE_GET_OBJ(obj);
+    if (unlikely(p->class_id == JS_CLASS_PROXY))
+        return js_proxy_preventExtensions(ctx, obj);
+    p->extensible = FALSE;
+    return TRUE;
+}
+
+/* return -1 if exception otherwise TRUE or FALSE */
+int JS_HasProperty(JSContext *ctx, JSValueConst obj, JSAtom prop)
+{
+    JSObject *p;
+    int ret;
+
+    if (unlikely(JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT))
+        return FALSE;
+    p = JS_VALUE_GET_OBJ(obj);
+    for(;;) {
+        if (p->is_exotic) {
+            const JSClassExoticMethods *em = ctx->rt->class_array[p->class_id].exotic;
+            if (em && em->has_property)
+                return em->has_property(ctx, JS_MKPTR(JS_TAG_OBJECT, p), prop);
+        }
+        ret = JS_GetOwnProperty(ctx, NULL, p, prop);
+        if (ret != 0)
+            return ret;
+        if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+            p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+            ret = JS_AtomIsNumericIndex(ctx, prop);
+            if (ret != 0) {
+                if (ret < 0)
+                    return -1;
+                /* the detached array test was done in
+                   JS_GetOwnProperty() */
+                return FALSE;
+            }
+        }
+        p = p->shape->proto;
+        if (!p)
+            break;
+    }
+    return FALSE;
+}
+
+/* return JS_ATOM_NULL in case of exception */
+static JSAtom js_value_to_atom(JSContext *ctx, JSValueConst val)
+{
+    JSAtom atom;
+    uint32_t tag;
+    tag = JS_VALUE_GET_TAG(val);
+    if (tag == JS_TAG_INT &&
+        (uint32_t)JS_VALUE_GET_INT(val) <= JS_ATOM_MAX_INT) {
+        /* fast path for integer values */
+        atom = __JS_AtomFromUInt32(JS_VALUE_GET_INT(val));
+    } else if (tag == JS_TAG_SYMBOL) {
+        JSAtomStruct *p = JS_VALUE_GET_PTR(val);
+        atom = JS_DupAtom(ctx, js_get_atom_index(ctx->rt, p));
+    } else {
+        JSValue str;
+        str = JS_ToPropertyKey(ctx, val);
+        if (JS_IsException(str))
+            return JS_ATOM_NULL;
+        if (JS_VALUE_GET_TAG(str) == JS_TAG_SYMBOL) {
+            JSAtomStruct *p = JS_VALUE_GET_PTR(str);
+            atom = js_get_atom_index(ctx->rt, p);
+        } else {
+            atom = JS_NewAtomStr(ctx, JS_VALUE_GET_STRING(str));
+        }
+    }
+    return atom;
+}
+
+static JSValue JS_GetPropertyValue(JSContext *ctx, JSValueConst this_obj,
+                                   JSValue prop)
+{
+    JSAtom atom;
+    JSValue ret;
+
+    if (likely(JS_VALUE_GET_TAG(this_obj) == JS_TAG_OBJECT &&
+               JS_VALUE_GET_TAG(prop) == JS_TAG_INT)) {
+        JSObject *p;
+        uint32_t idx, len;
+        /* fast path for array access */
+        p = JS_VALUE_GET_OBJ(this_obj);
+        idx = JS_VALUE_GET_INT(prop);
+        len = (uint32_t)p->u.array.count;
+        if (unlikely(idx >= len))
+            goto slow_path;
+        switch(p->class_id) {
+        case JS_CLASS_ARRAY:
+        case JS_CLASS_ARGUMENTS:
+            return JS_DupValue(ctx, p->u.array.u.values[idx]);
+        case JS_CLASS_INT8_ARRAY:
+            return JS_NewInt32(ctx, p->u.array.u.int8_ptr[idx]);
+        case JS_CLASS_UINT8C_ARRAY:
+        case JS_CLASS_UINT8_ARRAY:
+            return JS_NewInt32(ctx, p->u.array.u.uint8_ptr[idx]);
+        case JS_CLASS_INT16_ARRAY:
+            return JS_NewInt32(ctx, p->u.array.u.int16_ptr[idx]);
+        case JS_CLASS_UINT16_ARRAY:
+            return JS_NewInt32(ctx, p->u.array.u.uint16_ptr[idx]);
+        case JS_CLASS_INT32_ARRAY:
+            return JS_NewInt32(ctx, p->u.array.u.int32_ptr[idx]);
+        case JS_CLASS_UINT32_ARRAY:
+            return JS_NewUint32(ctx, p->u.array.u.uint32_ptr[idx]);
+#ifdef CONFIG_BIGNUM
+        case JS_CLASS_BIG_INT64_ARRAY:
+            return JS_NewBigInt64(ctx, p->u.array.u.int64_ptr[idx]);
+        case JS_CLASS_BIG_UINT64_ARRAY:
+            return JS_NewBigUint64(ctx, p->u.array.u.uint64_ptr[idx]);
+#endif
+        case JS_CLASS_FLOAT32_ARRAY:
+            return __JS_NewFloat64(ctx, p->u.array.u.float_ptr[idx]);
+        case JS_CLASS_FLOAT64_ARRAY:
+            return __JS_NewFloat64(ctx, p->u.array.u.double_ptr[idx]);
+        default:
+            goto slow_path;
+        }
+    } else {
+    slow_path:
+        atom = js_value_to_atom(ctx, prop);
+        JS_FreeValue(ctx, prop);
+        if (unlikely(atom == JS_ATOM_NULL))
+            return JS_EXCEPTION;
+        ret = JS_GetProperty(ctx, this_obj, atom);
+        JS_FreeAtom(ctx, atom);
+        return ret;
+    }
+}
+
+JSValue JS_GetPropertyUint32(JSContext *ctx, JSValueConst this_obj,
+                             uint32_t idx)
+{
+    return JS_GetPropertyValue(ctx, this_obj, JS_NewUint32(ctx, idx));
+}
+
+/* Check if an object has a generalized numeric property. Return value:
+   -1 for exception,
+   TRUE if property exists, stored into *pval,
+   FALSE if proprty does not exist.
+ */
+static int JS_TryGetPropertyInt64(JSContext *ctx, JSValueConst obj, int64_t idx, JSValue *pval)
+{
+    JSValue val = JS_UNDEFINED;
+    JSAtom prop;
+    int present;
+
+    if (likely((uint64_t)idx <= JS_ATOM_MAX_INT)) {
+        /* fast path */
+        present = JS_HasProperty(ctx, obj, __JS_AtomFromUInt32(idx));
+        if (present > 0) {
+            val = JS_GetPropertyValue(ctx, obj, JS_NewInt32(ctx, idx));
+            if (unlikely(JS_IsException(val)))
+                present = -1;
+        }
+    } else {
+        prop = JS_NewAtomInt64(ctx, idx);
+        present = -1;
+        if (likely(prop != JS_ATOM_NULL)) {
+            present = JS_HasProperty(ctx, obj, prop);
+            if (present > 0) {
+                val = JS_GetProperty(ctx, obj, prop);
+                if (unlikely(JS_IsException(val)))
+                    present = -1;
+            }
+            JS_FreeAtom(ctx, prop);
+        }
+    }
+    *pval = val;
+    return present;
+}
+
+static JSValue JS_GetPropertyInt64(JSContext *ctx, JSValueConst obj, int64_t idx)
+{
+    JSAtom prop;
+    JSValue val;
+
+    if ((uint64_t)idx <= INT32_MAX) {
+        /* fast path for fast arrays */
+        return JS_GetPropertyValue(ctx, obj, JS_NewInt32(ctx, idx));
+    }
+    prop = JS_NewAtomInt64(ctx, idx);
+    if (prop == JS_ATOM_NULL)
+        return JS_EXCEPTION;
+
+    val = JS_GetProperty(ctx, obj, prop);
+    JS_FreeAtom(ctx, prop);
+    return val;
+}
+
+JSValue JS_GetPropertyStr(JSContext *ctx, JSValueConst this_obj,
+                          const char *prop)
+{
+    JSAtom atom;
+    JSValue ret;
+    atom = JS_NewAtom(ctx, prop);
+    ret = JS_GetProperty(ctx, this_obj, atom);
+    JS_FreeAtom(ctx, atom);
+    return ret;
+}
+
+/* Note: the property value is not initialized. Return NULL if memory
+   error. */
+static JSProperty *add_property(JSContext *ctx,
+                                JSObject *p, JSAtom prop, int prop_flags)
+{
+    JSShape *sh, *new_sh;
+
+    sh = p->shape;
+    if (sh->is_hashed) {
+        /* try to find an existing shape */
+        new_sh = find_hashed_shape_prop(ctx->rt, sh, prop, prop_flags);
+        if (new_sh) {
+            /* matching shape found: use it */
+            /*  the property array may need to be resized */
+            if (new_sh->prop_size != sh->prop_size) {
+                JSProperty *new_prop;
+                new_prop = js_realloc(ctx, p->prop, sizeof(p->prop[0]) *
+                                      new_sh->prop_size);
+                if (!new_prop)
+                    return NULL;
+                p->prop = new_prop;
+            }
+            p->shape = js_dup_shape(new_sh);
+            js_free_shape(ctx->rt, sh);
+            return &p->prop[new_sh->prop_count - 1];
+        } else if (sh->header.ref_count != 1) {
+            /* if the shape is shared, clone it */
+            new_sh = js_clone_shape(ctx, sh);
+            if (!new_sh)
+                return NULL;
+            /* hash the cloned shape */
+            new_sh->is_hashed = TRUE;
+            js_shape_hash_link(ctx->rt, new_sh);
+            js_free_shape(ctx->rt, p->shape);
+            p->shape = new_sh;
+        }
+    }
+    assert(p->shape->header.ref_count == 1);
+    if (add_shape_property(ctx, &p->shape, p, prop, prop_flags))
+        return NULL;
+    return &p->prop[p->shape->prop_count - 1];
+}
+
+/* can be called on Array or Arguments objects. return < 0 if
+   memory alloc error. */
+static no_inline __exception int convert_fast_array_to_array(JSContext *ctx,
+                                                             JSObject *p)
+{
+    JSProperty *pr;
+    JSShape *sh;
+    JSValue *tab;
+    uint32_t i, len, new_count;
+
+    if (js_shape_prepare_update(ctx, p, NULL))
+        return -1;
+    len = p->u.array.count;
+    /* resize the properties once to simplify the error handling */
+    sh = p->shape;
+    new_count = sh->prop_count + len;
+    if (new_count > sh->prop_size) {
+        if (resize_properties(ctx, &p->shape, p, new_count))
+            return -1;
+    }
+
+    tab = p->u.array.u.values;
+    for(i = 0; i < len; i++) {
+        /* add_property cannot fail here but
+           __JS_AtomFromUInt32(i) fails for i > INT32_MAX */
+        pr = add_property(ctx, p, __JS_AtomFromUInt32(i), JS_PROP_C_W_E);
+        pr->u.value = *tab++;
+    }
+    js_free(ctx, p->u.array.u.values);
+    p->u.array.count = 0;
+    p->u.array.u.values = NULL; /* fail safe */
+    p->u.array.u1.size = 0;
+    p->fast_array = 0;
+    return 0;
+}
+
+static int delete_property(JSContext *ctx, JSObject *p, JSAtom atom)
+{
+    JSShape *sh;
+    JSShapeProperty *pr, *lpr, *prop;
+    JSProperty *pr1;
+    uint32_t lpr_idx;
+    intptr_t h, h1;
+
+ redo:
+    sh = p->shape;
+    h1 = atom & sh->prop_hash_mask;
+    h = prop_hash_end_field_of_shape(sh)[-h1 - 1];
+    prop = get_shape_prop(sh);
+    lpr = NULL;
+    lpr_idx = 0;   /* prevent warning */
+    while (h != 0) {
+        pr = &prop[h - 1];
+        if (likely(pr->atom == atom)) {
+            /* found ! */
+            if (!(pr->flags & JS_PROP_CONFIGURABLE))
+                return FALSE;
+            /* realloc the shape if needed */
+            if (lpr)
+                lpr_idx = lpr - get_shape_prop(sh);
+            if (js_shape_prepare_update(ctx, p, &pr))
+                return -1;
+            sh = p->shape;
+            /* remove property */
+            if (lpr) {
+                lpr = get_shape_prop(sh) + lpr_idx;
+                lpr->hash_next = pr->hash_next;
+            } else {
+                prop_hash_end_field_of_shape(sh)[-h1 - 1] = pr->hash_next;
+            }
+            /* free the entry */
+            pr1 = &p->prop[h - 1];
+            free_property(ctx->rt, pr1, pr->flags);
+            JS_FreeAtom(ctx, pr->atom);
+            /* put default values */
+            pr->flags = 0;
+            pr->atom = JS_ATOM_NULL;
+            pr1->u.value = JS_UNDEFINED;
+            return TRUE;
+        }
+        lpr = pr;
+        h = pr->hash_next;
+    }
+
+    if (p->is_exotic) {
+        if (p->fast_array) {
+            uint32_t idx;
+            if (JS_AtomGetUint32(ctx, &idx, atom) &&
+                idx < p->u.array.count) {
+                if (p->class_id == JS_CLASS_ARRAY ||
+                    p->class_id == JS_CLASS_ARGUMENTS) {
+                    /* Special case deleting the last element of a fast Array */
+                    if (idx == p->u.array.count - 1) {
+                        JS_FreeValue(ctx, p->u.array.u.values[idx]);
+                        p->u.array.count = idx;
+                        return TRUE;
+                    }
+                    if (convert_fast_array_to_array(ctx, p))
+                        return -1;
+                    goto redo;
+                } else {
+                    return FALSE; /* not configurable */
+                }
+            }
+        } else {
+            const JSClassExoticMethods *em = ctx->rt->class_array[p->class_id].exotic;
+            if (em && em->delete_property) {
+                return em->delete_property(ctx, JS_MKPTR(JS_TAG_OBJECT, p), atom);
+            }
+        }
+    }
+    /* not found */
+    return TRUE;
+}
+
+static int call_setter(JSContext *ctx, JSObject *setter,
+                       JSValueConst this_obj, JSValue val, int flags)
+{
+    JSValue ret, func;
+    if (likely(setter)) {
+        func = JS_MKPTR(JS_TAG_OBJECT, setter);
+        /* Note: the field could be removed in the setter */
+        func = JS_DupValue(ctx, func);
+        ret = JS_CallFree(ctx, func, this_obj, 1, (JSValueConst *)&val);
+        JS_FreeValue(ctx, val);
+        if (JS_IsException(ret))
+            return -1;
+        JS_FreeValue(ctx, ret);
+    } else {
+        JS_FreeValue(ctx, val);
+        if ((flags & JS_PROP_THROW) ||
+            ((flags & JS_PROP_THROW_STRICT) && is_strict_mode(ctx))) {
+            JS_ThrowTypeError(ctx, "no setter for property");
+            return -1;
+        }
+        /* XXX: should return FALSE? */
+    }
+    return TRUE;
+}
+
+/* set the array length and remove the array elements if necessary. */
+static int set_array_length(JSContext *ctx, JSObject *p, JSProperty *prop,
+                            JSValue val, int flags)
+{
+    uint32_t len, idx, cur_len;
+    int i, ret;
+
+    ret = JS_ToArrayLengthFree(ctx, &len, val);
+    if (ret)
+        return -1;
+    if (likely(p->fast_array)) {
+        uint32_t old_len = p->u.array.count;
+        if (len < old_len) {
+            for(i = len; i < old_len; i++) {
+                JS_FreeValue(ctx, p->u.array.u.values[i]);
+            }
+            p->u.array.count = len;
+        }
+#ifdef CONFIG_BIGNUM
+        set_value(ctx, &prop->u.value, JS_NewUint32(ctx, len));
+#else
+        prop->u.value = JS_NewUint32(ctx, len);
+#endif
+    } else {
+        /* Note: length is always a uint32 because the object is an
+           array */
+        JS_ToUint32(ctx, &cur_len, prop->u.value);
+        if (len < cur_len) {
+            uint32_t d;
+            JSShape *sh;
+            JSShapeProperty *pr;
+
+            d = cur_len - len;
+            sh = p->shape;
+            if (d <= sh->prop_count) {
+                JSAtom atom;
+
+                /* faster to iterate */
+                while (cur_len > len) {
+                    atom = JS_NewAtomUInt32(ctx, cur_len - 1);
+                    ret = delete_property(ctx, p, atom);
+                    JS_FreeAtom(ctx, atom);
+                    if (unlikely(!ret)) {
+                        /* unlikely case: property is not
+                           configurable */
+                        break;
+                    }
+                    cur_len--;
+                }
+            } else {
+                /* faster to iterate thru all the properties. Need two
+                   passes in case one of the property is not
+                   configurable */
+                cur_len = len;
+                for(i = 0, pr = get_shape_prop(sh); i < sh->prop_count;
+                    i++, pr++) {
+                    if (pr->atom != JS_ATOM_NULL &&
+                        JS_AtomGetUint32(ctx, &idx, pr->atom) &&
+                        idx != 0xffffffff) {
+                        if (idx >= cur_len &&
+                            !(pr->flags & JS_PROP_CONFIGURABLE)) {
+                            cur_len = idx + 1;
+                        }
+                    }
+                }
+
+                for(i = 0, pr = get_shape_prop(sh); i < sh->prop_count;
+                    i++, pr++) {
+                    if (pr->atom != JS_ATOM_NULL &&
+                        JS_AtomGetUint32(ctx, &idx, pr->atom) &&
+                        idx != 0xffffffff) {
+                        if (idx >= cur_len) {
+                            /* remove the property */
+                            delete_property(ctx, p, pr->atom);
+                            /* WARNING: the shape may have been modified */
+                            sh = p->shape;
+                            pr = get_shape_prop(sh) + i;
+                        }
+                    }
+                }
+            }
+        } else {
+            cur_len = len;
+        }
+        set_value(ctx, &p->prop[0].u.value, JS_NewUint32(ctx, cur_len));
+        if (unlikely(cur_len > len)) {
+            return JS_ThrowTypeErrorOrFalse(ctx, flags, "not configurable");
+        }
+    }
+    return TRUE;
+}
+
+/* Preconditions: 'p' must be of class JS_CLASS_ARRAY, p->fast_array =
+   TRUE and p->extensible = TRUE */
+static int add_fast_array_element(JSContext *ctx, JSObject *p,
+                                  JSValue val, int flags)
+{
+    uint32_t new_len, array_len;
+    /* extend the array by one */
+    /* XXX: convert to slow array if new_len > 2^31-1 elements */
+    new_len = p->u.array.count + 1;
+    /* update the length if necessary. We assume that if the length is
+       not an integer, then if it >= 2^31.  */
+    if (likely(JS_VALUE_GET_TAG(p->prop[0].u.value) == JS_TAG_INT)) {
+        array_len = JS_VALUE_GET_INT(p->prop[0].u.value);
+        if (new_len > array_len) {
+            if (unlikely(!(get_shape_prop(p->shape)->flags & JS_PROP_WRITABLE))) {
+                JS_FreeValue(ctx, val);
+                return JS_ThrowTypeErrorReadOnly(ctx, flags, JS_ATOM_length);
+            }
+            p->prop[0].u.value = JS_NewInt32(ctx, new_len);
+        }
+    }
+    if (unlikely(new_len > p->u.array.u1.size)) {
+        uint32_t new_size;
+        size_t slack;
+        JSValue *new_array_prop;
+        /* XXX: potential arithmetic overflow */
+        new_size = max_int(new_len, p->u.array.u1.size * 3 / 2);
+        new_array_prop = js_realloc2(ctx, p->u.array.u.values, sizeof(JSValue) * new_size, &slack);
+        if (!new_array_prop) {
+            JS_FreeValue(ctx, val);
+            return -1;
+        }
+        new_size += slack / sizeof(*new_array_prop);
+        p->u.array.u.values = new_array_prop;
+        p->u.array.u1.size = new_size;
+    }
+    p->u.array.u.values[new_len - 1] = val;
+    p->u.array.count = new_len;
+    return TRUE;
+}
+
+static void js_free_desc(JSContext *ctx, JSPropertyDescriptor *desc)
+{
+    JS_FreeValue(ctx, desc->getter);
+    JS_FreeValue(ctx, desc->setter);
+    JS_FreeValue(ctx, desc->value);
+}
+
+/* generic (and slower) version of JS_SetProperty() for Reflect.set() */
+static int JS_SetPropertyGeneric(JSContext *ctx,
+                                 JSObject *p, JSAtom prop,
+                                 JSValue val, JSValueConst this_obj,
+                                 int flags)
+{
+    int ret;
+    JSPropertyDescriptor desc;
+
+    while (p != NULL) {
+        if (p->is_exotic) {
+            const JSClassExoticMethods *em = ctx->rt->class_array[p->class_id].exotic;
+            if (em && em->set_property) {
+                ret = em->set_property(ctx, JS_MKPTR(JS_TAG_OBJECT, p), prop,
+                                       val, this_obj, flags);
+                JS_FreeValue(ctx, val);
+                return ret;
+            }
+        }
+
+        ret = JS_GetOwnProperty(ctx, &desc, p, prop);
+        if (ret < 0)
+            return ret;
+        if (ret) {
+            if (desc.flags & JS_PROP_GETSET) {
+                JSObject *setter;
+                if (JS_IsUndefined(desc.setter))
+                    setter = NULL;
+                else
+                    setter = JS_VALUE_GET_OBJ(desc.setter);
+                ret = call_setter(ctx, setter, this_obj, val, flags);
+                JS_FreeValue(ctx, desc.getter);
+                JS_FreeValue(ctx, desc.setter);
+                return ret;
+            } else {
+                JS_FreeValue(ctx, desc.value);
+                if (!(desc.flags & JS_PROP_WRITABLE)) {
+                    goto read_only_error;
+                }
+            }
+            break;
+        }
+        p = p->shape->proto;
+    }
+
+    if (!JS_IsObject(this_obj))
+        return JS_ThrowTypeErrorOrFalse(ctx, flags, "receiver is not an object");
+
+    p = JS_VALUE_GET_OBJ(this_obj);
+
+    /* modify the property in this_obj if it already exists */
+    ret = JS_GetOwnProperty(ctx, &desc, p, prop);
+    if (ret < 0)
+        return ret;
+    if (ret) {
+        if (desc.flags & JS_PROP_GETSET) {
+            JS_FreeValue(ctx, desc.getter);
+            JS_FreeValue(ctx, desc.setter);
+            JS_FreeValue(ctx, val);
+            return JS_ThrowTypeErrorOrFalse(ctx, flags, "setter is forbidden");
+        } else {
+            JS_FreeValue(ctx, desc.value);
+            if (!(desc.flags & JS_PROP_WRITABLE) ||
+                p->class_id == JS_CLASS_MODULE_NS) {
+            read_only_error:
+                JS_FreeValue(ctx, val);
+                return JS_ThrowTypeErrorReadOnly(ctx, flags, prop);
+            }
+        }
+        ret = JS_DefineProperty(ctx, this_obj, prop, val,
+                                JS_UNDEFINED, JS_UNDEFINED,
+                                JS_PROP_HAS_VALUE);
+        JS_FreeValue(ctx, val);
+        return ret;
+    }
+
+    ret = JS_CreateProperty(ctx, p, prop, val, JS_UNDEFINED, JS_UNDEFINED,
+                            flags |
+                            JS_PROP_HAS_VALUE |
+                            JS_PROP_HAS_ENUMERABLE |
+                            JS_PROP_HAS_WRITABLE |
+                            JS_PROP_HAS_CONFIGURABLE |
+                            JS_PROP_C_W_E);
+    JS_FreeValue(ctx, val);
+    return ret;
+}
+
+/* return -1 in case of exception or TRUE or FALSE. Warning: 'val' is
+   freed by the function. 'flags' is a bitmask of JS_PROP_NO_ADD,
+   JS_PROP_THROW or JS_PROP_THROW_STRICT. If JS_PROP_NO_ADD is set,
+   the new property is not added and an error is raised. */
+int JS_SetPropertyInternal(JSContext *ctx, JSValueConst this_obj,
+                           JSAtom prop, JSValue val, int flags)
+{
+    JSObject *p, *p1;
+    JSShapeProperty *prs;
+    JSProperty *pr;
+    uint32_t tag;
+    JSPropertyDescriptor desc;
+    int ret;
+#if 0
+    printf("JS_SetPropertyInternal: "); print_atom(ctx, prop); printf("\n");
+#endif
+    tag = JS_VALUE_GET_TAG(this_obj);
+    if (unlikely(tag != JS_TAG_OBJECT)) {
+        switch(tag) {
+        case JS_TAG_NULL:
+        case JS_TAG_UNDEFINED:
+            JS_FreeValue(ctx, val);
+            JS_ThrowTypeError(ctx, "value has no property");
+            return -1;
+        default:
+            /* even on a primitive type we can have setters on the prototype */
+            p = NULL;
+            p1 = JS_VALUE_GET_OBJ(JS_GetPrototype(ctx, this_obj));
+            goto prototype_lookup;
+        }
+    }
+    p = JS_VALUE_GET_OBJ(this_obj);
+retry:
+    prs = find_own_property(&pr, p, prop);
+    if (prs) {
+        if (likely((prs->flags & (JS_PROP_TMASK | JS_PROP_WRITABLE |
+                                  JS_PROP_LENGTH)) == JS_PROP_WRITABLE)) {
+            /* fast case */
+            set_value(ctx, &pr->u.value, val);
+            return TRUE;
+        } else if ((prs->flags & (JS_PROP_LENGTH | JS_PROP_WRITABLE)) ==
+                   (JS_PROP_LENGTH | JS_PROP_WRITABLE)) {
+            assert(p->class_id == JS_CLASS_ARRAY);
+            assert(prop == JS_ATOM_length);
+            return set_array_length(ctx, p, pr, val, flags);
+        } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_GETSET) {
+            return call_setter(ctx, pr->u.getset.setter, this_obj, val, flags);
+        } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF) {
+            /* JS_PROP_WRITABLE is always true for variable
+               references, but they are write protected in module name
+               spaces. */
+            if (p->class_id == JS_CLASS_MODULE_NS)
+                goto read_only_prop;
+            set_value(ctx, pr->u.var_ref->pvalue, val);
+            return TRUE;
+        } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+            /* Instantiate property and retry (potentially useless) */
+            if (JS_AutoInitProperty(ctx, p, prop, pr)) {
+                JS_FreeValue(ctx, val);
+                return -1;
+            }
+            goto retry;
+        } else {
+            goto read_only_prop;
+        }
+    }
+
+    p1 = p;
+    for(;;) {
+        if (p1->is_exotic) {
+            if (p1->fast_array) {
+                if (__JS_AtomIsTaggedInt(prop)) {
+                    uint32_t idx = __JS_AtomToUInt32(prop);
+                    if (idx < p1->u.array.count) {
+                        if (unlikely(p == p1))
+                            return JS_SetPropertyValue(ctx, this_obj, JS_NewInt32(ctx, idx), val, flags);
+                        else
+                            break;
+                    } else if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+                               p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+                        goto typed_array_oob;
+                    }
+                } else if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+                           p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+                    ret = JS_AtomIsNumericIndex(ctx, prop);
+                    if (ret != 0) {
+                        if (ret < 0) {
+                            JS_FreeValue(ctx, val);
+                            return -1;
+                        }
+                    typed_array_oob:
+                        val = JS_ToNumberFree(ctx, val);
+                        JS_FreeValue(ctx, val);
+                        if (JS_IsException(val))
+                            return -1;
+                        if (typed_array_is_detached(ctx, p)) {
+                            JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+                            return -1;
+                        }
+                        return JS_ThrowTypeErrorOrFalse(ctx, flags, "out-of-bound numeric index");
+                    }
+                }
+            } else {
+                const JSClassExoticMethods *em = ctx->rt->class_array[p1->class_id].exotic;
+                if (em) {
+                    if (em->set_property) {
+                        ret = em->set_property(ctx, JS_MKPTR(JS_TAG_OBJECT, p1), prop,
+                                               val, this_obj, flags);
+                        JS_FreeValue(ctx, val);
+                        return ret;
+                    }
+                    if (em->get_own_property) {
+                        ret = em->get_own_property(ctx, &desc,
+                                                   JS_MKPTR(JS_TAG_OBJECT, p1), prop);
+                        if (ret < 0) {
+                            JS_FreeValue(ctx, val);
+                            return ret;
+                        }
+                        if (ret) {
+                            if (desc.flags & JS_PROP_GETSET) {
+                                JSObject *setter;
+                                if (JS_IsUndefined(desc.setter))
+                                    setter = NULL;
+                                else
+                                    setter = JS_VALUE_GET_OBJ(desc.setter);
+                                ret = call_setter(ctx, setter, this_obj, val, flags);
+                                JS_FreeValue(ctx, desc.getter);
+                                JS_FreeValue(ctx, desc.setter);
+                                return ret;
+                            } else {
+                                JS_FreeValue(ctx, desc.value);
+                                if (!(desc.flags & JS_PROP_WRITABLE))
+                                    goto read_only_prop;
+                                if (likely(p == p1)) {
+                                    ret = JS_DefineProperty(ctx, this_obj, prop, val,
+                                                            JS_UNDEFINED, JS_UNDEFINED,
+                                                            JS_PROP_HAS_VALUE);
+                                    JS_FreeValue(ctx, val);
+                                    return ret;
+                                } else {
+                                    break;
+                                }
+                            }
+                        }
+                    }
+                }
+            }
+        }
+        p1 = p1->shape->proto;
+    prototype_lookup:
+        if (!p1)
+            break;
+
+    retry2:
+        prs = find_own_property(&pr, p1, prop);
+        if (prs) {
+            if ((prs->flags & JS_PROP_TMASK) == JS_PROP_GETSET) {
+                return call_setter(ctx, pr->u.getset.setter, this_obj, val, flags);
+            } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+                /* Instantiate property and retry (potentially useless) */
+                if (JS_AutoInitProperty(ctx, p1, prop, pr))
+                    return -1;
+                goto retry2;
+            } else if (!(prs->flags & JS_PROP_WRITABLE)) {
+            read_only_prop:
+                JS_FreeValue(ctx, val);
+                return JS_ThrowTypeErrorReadOnly(ctx, flags, prop);
+            }
+        }
+    }
+
+    if (unlikely(flags & JS_PROP_NO_ADD)) {
+        JS_FreeValue(ctx, val);
+        JS_ThrowReferenceErrorNotDefined(ctx, prop);
+        return -1;
+    }
+
+    if (unlikely(!p)) {
+        JS_FreeValue(ctx, val);
+        return JS_ThrowTypeErrorOrFalse(ctx, flags, "not an object");
+    }
+
+    if (unlikely(!p->extensible)) {
+        JS_FreeValue(ctx, val);
+        return JS_ThrowTypeErrorOrFalse(ctx, flags, "object is not extensible");
+    }
+
+    if (p->is_exotic) {
+        if (p->class_id == JS_CLASS_ARRAY && p->fast_array) {
+            uint32_t idx = __JS_AtomToUInt32(prop);
+            if (idx == p->u.array.count) {
+                /* fast case */
+                return add_fast_array_element(ctx, p, val, flags);
+            } else {
+                goto generic_create_prop;
+            }
+        } else {
+        generic_create_prop:
+            ret = JS_CreateProperty(ctx, p, prop, val, JS_UNDEFINED, JS_UNDEFINED,
+                                    flags |
+                                    JS_PROP_HAS_VALUE |
+                                    JS_PROP_HAS_ENUMERABLE |
+                                    JS_PROP_HAS_WRITABLE |
+                                    JS_PROP_HAS_CONFIGURABLE |
+                                    JS_PROP_C_W_E);
+            JS_FreeValue(ctx, val);
+            return ret;
+        }
+    }
+
+    pr = add_property(ctx, p, prop, JS_PROP_C_W_E);
+    if (unlikely(!pr)) {
+        JS_FreeValue(ctx, val);
+        return -1;
+    }
+    pr->u.value = val;
+    return TRUE;
+}
+
+/* flags can be JS_PROP_THROW or JS_PROP_THROW_STRICT */
+static int JS_SetPropertyValue(JSContext *ctx, JSValueConst this_obj,
+                               JSValue prop, JSValue val, int flags)
+{
+    if (likely(JS_VALUE_GET_TAG(this_obj) == JS_TAG_OBJECT &&
+               JS_VALUE_GET_TAG(prop) == JS_TAG_INT)) {
+        JSObject *p;
+        uint32_t idx;
+        double d;
+        int32_t v;
+
+        /* fast path for array access */
+        p = JS_VALUE_GET_OBJ(this_obj);
+        idx = JS_VALUE_GET_INT(prop);
+        switch(p->class_id) {
+        case JS_CLASS_ARRAY:
+            if (unlikely(idx >= (uint32_t)p->u.array.count)) {
+                JSObject *p1;
+                JSShape *sh1;
+
+                /* fast path to add an element to the array */
+                if (idx != (uint32_t)p->u.array.count ||
+                    !p->fast_array || !p->extensible)
+                    goto slow_path;
+                /* check if prototype chain has a numeric property */
+                p1 = p->shape->proto;
+                while (p1 != NULL) {
+                    sh1 = p1->shape;
+                    if (p1->class_id == JS_CLASS_ARRAY) {
+                        if (unlikely(!p1->fast_array))
+                            goto slow_path;
+                    } else if (p1->class_id == JS_CLASS_OBJECT) {
+                        if (unlikely(sh1->has_small_array_index))
+                            goto slow_path;
+                    } else {
+                        goto slow_path;
+                    }
+                    p1 = sh1->proto;
+                }
+                /* add element */
+                return add_fast_array_element(ctx, p, val, flags);
+            }
+            set_value(ctx, &p->u.array.u.values[idx], val);
+            break;
+        case JS_CLASS_ARGUMENTS:
+            if (unlikely(idx >= (uint32_t)p->u.array.count))
+                goto slow_path;
+            set_value(ctx, &p->u.array.u.values[idx], val);
+            break;
+        case JS_CLASS_UINT8C_ARRAY:
+            if (JS_ToUint8ClampFree(ctx, &v, val))
+                return -1;
+            /* Note: the conversion can detach the typed array, so the
+               array bound check must be done after */
+            if (unlikely(idx >= (uint32_t)p->u.array.count))
+                goto ta_out_of_bound;
+            p->u.array.u.uint8_ptr[idx] = v;
+            break;
+        case JS_CLASS_INT8_ARRAY:
+        case JS_CLASS_UINT8_ARRAY:
+            if (JS_ToInt32Free(ctx, &v, val))
+                return -1;
+            if (unlikely(idx >= (uint32_t)p->u.array.count))
+                goto ta_out_of_bound;
+            p->u.array.u.uint8_ptr[idx] = v;
+            break;
+        case JS_CLASS_INT16_ARRAY:
+        case JS_CLASS_UINT16_ARRAY:
+            if (JS_ToInt32Free(ctx, &v, val))
+                return -1;
+            if (unlikely(idx >= (uint32_t)p->u.array.count))
+                goto ta_out_of_bound;
+            p->u.array.u.uint16_ptr[idx] = v;
+            break;
+        case JS_CLASS_INT32_ARRAY:
+        case JS_CLASS_UINT32_ARRAY:
+            if (JS_ToInt32Free(ctx, &v, val))
+                return -1;
+            if (unlikely(idx >= (uint32_t)p->u.array.count))
+                goto ta_out_of_bound;
+            p->u.array.u.uint32_ptr[idx] = v;
+            break;
+#ifdef CONFIG_BIGNUM
+        case JS_CLASS_BIG_INT64_ARRAY:
+        case JS_CLASS_BIG_UINT64_ARRAY:
+            /* XXX: need specific conversion function */
+            {
+                int64_t v;
+                if (JS_ToBigInt64Free(ctx, &v, val))
+                    return -1;
+                if (unlikely(idx >= (uint32_t)p->u.array.count))
+                    goto ta_out_of_bound;
+                p->u.array.u.uint64_ptr[idx] = v;
+            }
+            break;
+#endif
+        case JS_CLASS_FLOAT32_ARRAY:
+            if (JS_ToFloat64Free(ctx, &d, val))
+                return -1;
+            if (unlikely(idx >= (uint32_t)p->u.array.count))
+                goto ta_out_of_bound;
+            p->u.array.u.float_ptr[idx] = d;
+            break;
+        case JS_CLASS_FLOAT64_ARRAY:
+            if (JS_ToFloat64Free(ctx, &d, val))
+                return -1;
+            if (unlikely(idx >= (uint32_t)p->u.array.count)) {
+            ta_out_of_bound:
+                if (typed_array_is_detached(ctx, p)) {
+                    JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+                    return -1;
+                } else {
+                    return JS_ThrowTypeErrorOrFalse(ctx, flags, "out-of-bound numeric index");
+                }
+            }
+            p->u.array.u.double_ptr[idx] = d;
+            break;
+        default:
+            goto slow_path;
+        }
+        return TRUE;
+    } else {
+        JSAtom atom;
+        int ret;
+    slow_path:
+        atom = js_value_to_atom(ctx, prop);
+        JS_FreeValue(ctx, prop);
+        if (unlikely(atom == JS_ATOM_NULL)) {
+            JS_FreeValue(ctx, val);
+            return -1;
+        }
+        ret = JS_SetPropertyInternal(ctx, this_obj, atom, val, flags);
+        JS_FreeAtom(ctx, atom);
+        return ret;
+    }
+}
+
+int JS_SetPropertyUint32(JSContext *ctx, JSValueConst this_obj,
+                         uint32_t idx, JSValue val)
+{
+    return JS_SetPropertyValue(ctx, this_obj, JS_NewUint32(ctx, idx), val,
+                               JS_PROP_THROW);
+}
+
+int JS_SetPropertyInt64(JSContext *ctx, JSValueConst this_obj,
+                        int64_t idx, JSValue val)
+{
+    JSAtom prop;
+    int res;
+
+    if ((uint64_t)idx <= INT32_MAX) {
+        /* fast path for fast arrays */
+        return JS_SetPropertyValue(ctx, this_obj, JS_NewInt32(ctx, idx), val,
+                                   JS_PROP_THROW);
+    }
+    prop = JS_NewAtomInt64(ctx, idx);
+    if (prop == JS_ATOM_NULL) {
+        JS_FreeValue(ctx, val);
+        return -1;
+    }
+    res = JS_SetProperty(ctx, this_obj, prop, val);
+    JS_FreeAtom(ctx, prop);
+    return res;
+}
+
+int JS_SetPropertyStr(JSContext *ctx, JSValueConst this_obj,
+                      const char *prop, JSValue val)
+{
+    JSAtom atom;
+    int ret;
+    atom = JS_NewAtom(ctx, prop);
+    ret = JS_SetPropertyInternal(ctx, this_obj, atom, val, JS_PROP_THROW);
+    JS_FreeAtom(ctx, atom);
+    return ret;
+}
+
+/* compute the property flags. For each flag: (JS_PROP_HAS_x forces
+   it, otherwise def_flags is used)
+   Note: makes assumption about the bit pattern of the flags
+*/
+static int get_prop_flags(int flags, int def_flags)
+{
+    int mask;
+    mask = (flags >> JS_PROP_HAS_SHIFT) & JS_PROP_C_W_E;
+    return (flags & mask) | (def_flags & ~mask);
+}
+
+static int JS_CreateProperty(JSContext *ctx, JSObject *p,
+                             JSAtom prop, JSValueConst val,
+                             JSValueConst getter, JSValueConst setter,
+                             int flags)
+{
+    JSProperty *pr;
+    int ret, prop_flags;
+
+    /* add a new property or modify an existing exotic one */
+    if (p->is_exotic) {
+        if (p->class_id == JS_CLASS_ARRAY) {
+            uint32_t idx, len;
+
+            if (p->fast_array) {
+                if (__JS_AtomIsTaggedInt(prop)) {
+                    idx = __JS_AtomToUInt32(prop);
+                    if (idx == p->u.array.count) {
+                        if (!p->extensible)
+                            goto not_extensible;
+                        if (flags & (JS_PROP_HAS_GET | JS_PROP_HAS_SET))
+                            goto convert_to_array;
+                        prop_flags = get_prop_flags(flags, 0);
+                        if (prop_flags != JS_PROP_C_W_E)
+                            goto convert_to_array;
+                        return add_fast_array_element(ctx, p,
+                                                      JS_DupValue(ctx, val), flags);
+                    } else {
+                        goto convert_to_array;
+                    }
+                } else if (JS_AtomGetUint32(ctx, &idx, prop) && idx != 0xffffffff) {
+                    /* convert the fast array to normal array */
+                convert_to_array:
+                    if (convert_fast_array_to_array(ctx, p))
+                        return -1;
+                    goto generic_array;
+                }
+            } else if (JS_AtomGetUint32(ctx, &idx, prop) && idx != 0xffffffff) {
+                JSProperty *plen;
+                JSShapeProperty *pslen;
+            generic_array:
+                /* update the length field */
+                plen = &p->prop[0];
+                JS_ToUint32(ctx, &len, plen->u.value);
+                if ((idx + 1) > len) {
+                    pslen = get_shape_prop(p->shape);
+                    if (unlikely(!(pslen->flags & JS_PROP_WRITABLE)))
+                        return JS_ThrowTypeErrorReadOnly(ctx, flags, JS_ATOM_length);
+                    /* XXX: should update the length after defining
+                       the property */
+                    len = idx + 1;
+                    set_value(ctx, &plen->u.value, JS_NewUint32(ctx, len));
+                }
+            }
+        } else if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+                   p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+            ret = JS_AtomIsNumericIndex(ctx, prop);
+            if (ret != 0) {
+                if (ret < 0)
+                    return -1;
+                return JS_ThrowTypeErrorOrFalse(ctx, flags, "cannot create numeric index in typed array");
+            }
+        } else if (!(flags & JS_PROP_NO_EXOTIC)) {
+            const JSClassExoticMethods *em = ctx->rt->class_array[p->class_id].exotic;
+            if (em) {
+                if (em->define_own_property) {
+                    return em->define_own_property(ctx, JS_MKPTR(JS_TAG_OBJECT, p),
+                                                   prop, val, getter, setter, flags);
+                }
+                ret = JS_IsExtensible(ctx, JS_MKPTR(JS_TAG_OBJECT, p));
+                if (ret < 0)
+                    return -1;
+                if (!ret)
+                    goto not_extensible;
+            }
+        }
+    }
+
+    if (!p->extensible) {
+    not_extensible:
+        return JS_ThrowTypeErrorOrFalse(ctx, flags, "object is not extensible");
+    }
+
+    if (flags & (JS_PROP_HAS_GET | JS_PROP_HAS_SET)) {
+        prop_flags = (flags & (JS_PROP_CONFIGURABLE | JS_PROP_ENUMERABLE)) |
+            JS_PROP_GETSET;
+    } else {
+        prop_flags = flags & JS_PROP_C_W_E;
+    }
+    pr = add_property(ctx, p, prop, prop_flags);
+    if (unlikely(!pr))
+        return -1;
+    if (flags & (JS_PROP_HAS_GET | JS_PROP_HAS_SET)) {
+        pr->u.getset.getter = NULL;
+        if ((flags & JS_PROP_HAS_GET) && JS_IsFunction(ctx, getter)) {
+            pr->u.getset.getter =
+                JS_VALUE_GET_OBJ(JS_DupValue(ctx, getter));
+        }
+        pr->u.getset.setter = NULL;
+        if ((flags & JS_PROP_HAS_SET) && JS_IsFunction(ctx, setter)) {
+            pr->u.getset.setter =
+                JS_VALUE_GET_OBJ(JS_DupValue(ctx, setter));
+        }
+    } else {
+        if (flags & JS_PROP_HAS_VALUE) {
+            pr->u.value = JS_DupValue(ctx, val);
+        } else {
+            pr->u.value = JS_UNDEFINED;
+        }
+    }
+    return TRUE;
+}
+
+/* return FALSE if not OK */
+static BOOL check_define_prop_flags(int prop_flags, int flags)
+{
+    BOOL has_accessor, is_getset;
+
+    if (!(prop_flags & JS_PROP_CONFIGURABLE)) {
+        if ((flags & (JS_PROP_HAS_CONFIGURABLE | JS_PROP_CONFIGURABLE)) ==
+            (JS_PROP_HAS_CONFIGURABLE | JS_PROP_CONFIGURABLE)) {
+            return FALSE;
+        }
+        if ((flags & JS_PROP_HAS_ENUMERABLE) &&
+            (flags & JS_PROP_ENUMERABLE) != (prop_flags & JS_PROP_ENUMERABLE))
+            return FALSE;
+    }
+    if (flags & (JS_PROP_HAS_VALUE | JS_PROP_HAS_WRITABLE |
+                 JS_PROP_HAS_GET | JS_PROP_HAS_SET)) {
+        if (!(prop_flags & JS_PROP_CONFIGURABLE)) {
+            has_accessor = ((flags & (JS_PROP_HAS_GET | JS_PROP_HAS_SET)) != 0);
+            is_getset = ((prop_flags & JS_PROP_TMASK) == JS_PROP_GETSET);
+            if (has_accessor != is_getset)
+                return FALSE;
+            if (!has_accessor && !is_getset && !(prop_flags & JS_PROP_WRITABLE)) {
+                /* not writable: cannot set the writable bit */
+                if ((flags & (JS_PROP_HAS_WRITABLE | JS_PROP_WRITABLE)) ==
+                    (JS_PROP_HAS_WRITABLE | JS_PROP_WRITABLE))
+                    return FALSE;
+            }
+        }
+    }
+    return TRUE;
+}
+
+/* ensure that the shape can be safely modified */
+static int js_shape_prepare_update(JSContext *ctx, JSObject *p,
+                                   JSShapeProperty **pprs)
+{
+    JSShape *sh;
+    uint32_t idx = 0;    /* prevent warning */
+
+    sh = p->shape;
+    if (sh->is_hashed) {
+        if (sh->header.ref_count != 1) {
+            if (pprs)
+                idx = *pprs - get_shape_prop(sh);
+            /* clone the shape (the resulting one is no longer hashed) */
+            sh = js_clone_shape(ctx, sh);
+            if (!sh)
+                return -1;
+            js_free_shape(ctx->rt, p->shape);
+            p->shape = sh;
+            if (pprs)
+                *pprs = get_shape_prop(sh) + idx;
+        } else {
+            js_shape_hash_unlink(ctx->rt, sh);
+            sh->is_hashed = FALSE;
+        }
+    }
+    return 0;
+}
+
+static int js_update_property_flags(JSContext *ctx, JSObject *p,
+                                    JSShapeProperty **pprs, int flags)
+{
+    if (flags != (*pprs)->flags) {
+        if (js_shape_prepare_update(ctx, p, pprs))
+            return -1;
+        (*pprs)->flags = flags;
+    }
+    return 0;
+}
+
+/* allowed flags:
+   JS_PROP_CONFIGURABLE, JS_PROP_WRITABLE, JS_PROP_ENUMERABLE
+   JS_PROP_HAS_GET, JS_PROP_HAS_SET, JS_PROP_HAS_VALUE,
+   JS_PROP_HAS_CONFIGURABLE, JS_PROP_HAS_WRITABLE, JS_PROP_HAS_ENUMERABLE,
+   JS_PROP_THROW, JS_PROP_NO_EXOTIC.
+   If JS_PROP_THROW is set, return an exception instead of FALSE.
+   if JS_PROP_NO_EXOTIC is set, do not call the exotic
+   define_own_property callback.
+   return -1 (exception), FALSE or TRUE.
+*/
+int JS_DefineProperty(JSContext *ctx, JSValueConst this_obj,
+                      JSAtom prop, JSValueConst val,
+                      JSValueConst getter, JSValueConst setter, int flags)
+{
+    JSObject *p;
+    JSShapeProperty *prs;
+    JSProperty *pr;
+    int mask, res;
+
+    if (JS_VALUE_GET_TAG(this_obj) != JS_TAG_OBJECT) {
+        JS_ThrowTypeErrorNotAnObject(ctx);
+        return -1;
+    }
+    p = JS_VALUE_GET_OBJ(this_obj);
+
+ redo_prop_update:
+    prs = find_own_property(&pr, p, prop);
+    if (prs) {
+        /* property already exists */
+        if (!check_define_prop_flags(prs->flags, flags)) {
+        not_configurable:
+            return JS_ThrowTypeErrorOrFalse(ctx, flags, "property is not configurable");
+        }
+
+    retry:
+        if (flags & (JS_PROP_HAS_VALUE | JS_PROP_HAS_WRITABLE |
+                     JS_PROP_HAS_GET | JS_PROP_HAS_SET)) {
+            if (flags & (JS_PROP_HAS_GET | JS_PROP_HAS_SET)) {
+                JSObject *new_getter, *new_setter;
+
+                if (JS_IsFunction(ctx, getter)) {
+                    new_getter = JS_VALUE_GET_OBJ(getter);
+                } else {
+                    new_getter = NULL;
+                }
+                if (JS_IsFunction(ctx, setter)) {
+                    new_setter = JS_VALUE_GET_OBJ(setter);
+                } else {
+                    new_setter = NULL;
+                }
+
+                if ((prs->flags & JS_PROP_TMASK) != JS_PROP_GETSET) {
+                    if (js_shape_prepare_update(ctx, p, &prs))
+                        return -1;
+                    /* convert to getset */
+                    if ((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF) {
+                        free_var_ref(ctx->rt, pr->u.var_ref);
+                    } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+                        /* clear property and update */
+                        if (js_shape_prepare_update(ctx, p, &prs))
+                            return -1;
+                        prs->flags &= ~JS_PROP_TMASK;
+                        pr->u.value = JS_UNDEFINED;
+                        goto retry;
+                    } else {
+                        JS_FreeValue(ctx, pr->u.value);
+                    }
+                    prs->flags = (prs->flags &
+                                  (JS_PROP_CONFIGURABLE | JS_PROP_ENUMERABLE)) |
+                        JS_PROP_GETSET;
+                    pr->u.getset.getter = NULL;
+                    pr->u.getset.setter = NULL;
+                } else {
+                    if (!(prs->flags & JS_PROP_CONFIGURABLE)) {
+                        if ((flags & JS_PROP_HAS_GET) &&
+                            new_getter != pr->u.getset.getter) {
+                            goto not_configurable;
+                        }
+                        if ((flags & JS_PROP_HAS_SET) &&
+                            new_setter != pr->u.getset.setter) {
+                            goto not_configurable;
+                        }
+                    }
+                }
+                if (flags & JS_PROP_HAS_GET) {
+                    if (pr->u.getset.getter)
+                        JS_FreeValue(ctx, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.getter));
+                    if (new_getter)
+                        JS_DupValue(ctx, getter);
+                    pr->u.getset.getter = new_getter;
+                }
+                if (flags & JS_PROP_HAS_SET) {
+                    if (pr->u.getset.setter)
+                        JS_FreeValue(ctx, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.setter));
+                    if (new_setter)
+                        JS_DupValue(ctx, setter);
+                    pr->u.getset.setter = new_setter;
+                }
+            } else {
+                if ((prs->flags & JS_PROP_TMASK) == JS_PROP_GETSET) {
+                    /* convert to data descriptor */
+                    if (js_shape_prepare_update(ctx, p, &prs))
+                        return -1;
+                    if (pr->u.getset.getter)
+                        JS_FreeValue(ctx, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.getter));
+                    if (pr->u.getset.setter)
+                        JS_FreeValue(ctx, JS_MKPTR(JS_TAG_OBJECT, pr->u.getset.setter));
+                    prs->flags &= ~(JS_PROP_TMASK | JS_PROP_WRITABLE);
+                    pr->u.value = JS_UNDEFINED;
+                } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF) {
+                    /* Note: JS_PROP_VARREF is always writable */
+                } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+                    /* clear property and update */
+                    if (js_shape_prepare_update(ctx, p, &prs))
+                        return -1;
+                    prs->flags &= ~JS_PROP_TMASK;
+                    pr->u.value = JS_UNDEFINED;
+                } else {
+                    if ((prs->flags & (JS_PROP_CONFIGURABLE | JS_PROP_WRITABLE)) == 0 &&
+                        (flags & JS_PROP_HAS_VALUE) &&
+                        !js_same_value(ctx, val, pr->u.value)) {
+                        goto not_configurable;
+                    }
+                }
+                if (prs->flags & JS_PROP_LENGTH) {
+                    if (flags & JS_PROP_HAS_VALUE) {
+                        res = set_array_length(ctx, p, pr, JS_DupValue(ctx, val),
+                                               flags);
+                    } else {
+                        res = TRUE;
+                    }
+                    /* still need to reset the writable flag if needed.
+                       The JS_PROP_LENGTH is reset to have the correct
+                       read-only behavior in JS_SetProperty(). */
+                    if ((flags & (JS_PROP_HAS_WRITABLE | JS_PROP_WRITABLE)) ==
+                        JS_PROP_HAS_WRITABLE) {
+                        prs = get_shape_prop(p->shape);
+                        if (js_update_property_flags(ctx, p, &prs,
+                                                     prs->flags & ~(JS_PROP_WRITABLE | JS_PROP_LENGTH)))
+                            return -1;
+                    }
+                    return res;
+                } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF) {
+                    if (flags & JS_PROP_HAS_VALUE) {
+                        if (p->class_id == JS_CLASS_MODULE_NS) {
+                            /* JS_PROP_WRITABLE is always true for variable
+                               references, but they are write protected in module name
+                               spaces. */
+                            if (!js_same_value(ctx, val, *pr->u.var_ref->pvalue))
+                                goto not_configurable;
+                        }
+                        /* update the reference */
+                        set_value(ctx, pr->u.var_ref->pvalue,
+                                  JS_DupValue(ctx, val));
+                    }
+                    /* if writable is set to false, no longer a
+                       reference (for mapped arguments) */
+                    if ((flags & (JS_PROP_HAS_WRITABLE | JS_PROP_WRITABLE)) == JS_PROP_HAS_WRITABLE) {
+                        JSValue val1;
+                        if (js_shape_prepare_update(ctx, p, &prs))
+                            return -1;
+                        val1 = JS_DupValue(ctx, *pr->u.var_ref->pvalue);
+                        free_var_ref(ctx->rt, pr->u.var_ref);
+                        pr->u.value = val1;
+                        prs->flags &= ~(JS_PROP_TMASK | JS_PROP_WRITABLE);
+                    }
+                } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+                    /* XXX: should never happen, type was reset above */
+                    abort();
+                } else {
+                    if (flags & JS_PROP_HAS_VALUE) {
+                        JS_FreeValue(ctx, pr->u.value);
+                        pr->u.value = JS_DupValue(ctx, val);
+                    }
+                    if (flags & JS_PROP_HAS_WRITABLE) {
+                        if (js_update_property_flags(ctx, p, &prs,
+                                                     (prs->flags & ~JS_PROP_WRITABLE) |
+                                                     (flags & JS_PROP_WRITABLE)))
+                            return -1;
+                    }
+                }
+            }
+        }
+        mask = 0;
+        if (flags & JS_PROP_HAS_CONFIGURABLE)
+            mask |= JS_PROP_CONFIGURABLE;
+        if (flags & JS_PROP_HAS_ENUMERABLE)
+            mask |= JS_PROP_ENUMERABLE;
+        if (js_update_property_flags(ctx, p, &prs,
+                                     (prs->flags & ~mask) | (flags & mask)))
+            return -1;
+        return TRUE;
+    }
+
+    /* handle modification of fast array elements */
+    if (p->fast_array) {
+        uint32_t idx;
+        uint32_t prop_flags;
+        if (p->class_id == JS_CLASS_ARRAY) {
+            if (__JS_AtomIsTaggedInt(prop)) {
+                idx = __JS_AtomToUInt32(prop);
+                if (idx < p->u.array.count) {
+                    prop_flags = get_prop_flags(flags, JS_PROP_C_W_E);
+                    if (prop_flags != JS_PROP_C_W_E)
+                        goto convert_to_slow_array;
+                    if (flags & (JS_PROP_HAS_GET | JS_PROP_HAS_SET)) {
+                    convert_to_slow_array:
+                        if (convert_fast_array_to_array(ctx, p))
+                            return -1;
+                        else
+                            goto redo_prop_update;
+                    }
+                    if (flags & JS_PROP_HAS_VALUE) {
+                        set_value(ctx, &p->u.array.u.values[idx], JS_DupValue(ctx, val));
+                    }
+                    return TRUE;
+                }
+            }
+        } else if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+                   p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+            JSValue num;
+            int ret;
+
+            if (!__JS_AtomIsTaggedInt(prop)) {
+                /* slow path with to handle all numeric indexes */
+                num = JS_AtomIsNumericIndex1(ctx, prop);
+                if (JS_IsUndefined(num))
+                    goto typed_array_done;
+                if (JS_IsException(num))
+                    return -1;
+                ret = JS_NumberIsInteger(ctx, num);
+                if (ret < 0) {
+                    JS_FreeValue(ctx, num);
+                    return -1;
+                }
+                if (!ret) {
+                    JS_FreeValue(ctx, num);
+                    return JS_ThrowTypeErrorOrFalse(ctx, flags, "non integer index in typed array");
+                }
+                ret = JS_NumberIsNegativeOrMinusZero(ctx, num);
+                JS_FreeValue(ctx, num);
+                if (ret) {
+                    return JS_ThrowTypeErrorOrFalse(ctx, flags, "negative index in typed array");
+                }
+                if (!__JS_AtomIsTaggedInt(prop))
+                    goto typed_array_oob;
+            }
+            idx = __JS_AtomToUInt32(prop);
+            /* if the typed array is detached, p->u.array.count = 0 */
+            if (idx >= typed_array_get_length(ctx, p)) {
+            typed_array_oob:
+                return JS_ThrowTypeErrorOrFalse(ctx, flags, "out-of-bound index in typed array");
+            }
+            prop_flags = get_prop_flags(flags, JS_PROP_ENUMERABLE | JS_PROP_WRITABLE);
+            if (flags & (JS_PROP_HAS_GET | JS_PROP_HAS_SET) ||
+                prop_flags != (JS_PROP_ENUMERABLE | JS_PROP_WRITABLE)) {
+                return JS_ThrowTypeErrorOrFalse(ctx, flags, "invalid descriptor flags");
+            }
+            if (flags & JS_PROP_HAS_VALUE) {
+                return JS_SetPropertyValue(ctx, this_obj, JS_NewInt32(ctx, idx), JS_DupValue(ctx, val), flags);
+            }
+            return TRUE;
+        typed_array_done: ;
+        }
+    }
+
+    return JS_CreateProperty(ctx, p, prop, val, getter, setter, flags);
+}
+
+static int JS_DefineAutoInitProperty(JSContext *ctx, JSValueConst this_obj,
+                                     JSAtom prop, int (*init_func)(JSContext *ctx, JSObject *obj,
+                                                                   JSAtom prop, void *opaque),
+                                     void *opaque, int flags)
+{
+    JSObject *p;
+    JSProperty *pr;
+
+    if (JS_VALUE_GET_TAG(this_obj) != JS_TAG_OBJECT)
+        return FALSE;
+
+    p = JS_VALUE_GET_OBJ(this_obj);
+
+    if (find_own_property(&pr, p, prop)) {
+        /* property already exists */
+        abort();
+        return FALSE;
+    }
+
+    /* Specialized CreateProperty */
+    pr = add_property(ctx, p, prop, (flags & JS_PROP_C_W_E) | JS_PROP_AUTOINIT);
+    if (unlikely(!pr))
+        return -1;
+
+    pr->u.init.init_func = init_func;
+    pr->u.init.opaque = opaque;
+    return TRUE;
+}
+
+/* shortcut to add or redefine a new property value */
+int JS_DefinePropertyValue(JSContext *ctx, JSValueConst this_obj,
+                           JSAtom prop, JSValue val, int flags)
+{
+    int ret;
+    ret = JS_DefineProperty(ctx, this_obj, prop, val, JS_UNDEFINED, JS_UNDEFINED,
+                            flags | JS_PROP_HAS_VALUE | JS_PROP_HAS_CONFIGURABLE | JS_PROP_HAS_WRITABLE | JS_PROP_HAS_ENUMERABLE);
+    JS_FreeValue(ctx, val);
+    return ret;
+}
+
+int JS_DefinePropertyValueValue(JSContext *ctx, JSValueConst this_obj,
+                                JSValue prop, JSValue val, int flags)
+{
+    JSAtom atom;
+    int ret;
+    atom = js_value_to_atom(ctx, prop);
+    JS_FreeValue(ctx, prop);
+    if (unlikely(atom == JS_ATOM_NULL)) {
+        JS_FreeValue(ctx, val);
+        return -1;
+    }
+    ret = JS_DefinePropertyValue(ctx, this_obj, atom, val, flags);
+    JS_FreeAtom(ctx, atom);
+    return ret;
+}
+
+int JS_DefinePropertyValueUint32(JSContext *ctx, JSValueConst this_obj,
+                                 uint32_t idx, JSValue val, int flags)
+{
+    return JS_DefinePropertyValueValue(ctx, this_obj, JS_NewUint32(ctx, idx),
+                                       val, flags);
+}
+
+int JS_DefinePropertyValueInt64(JSContext *ctx, JSValueConst this_obj,
+                                int64_t idx, JSValue val, int flags)
+{
+    return JS_DefinePropertyValueValue(ctx, this_obj, JS_NewInt64(ctx, idx),
+                                       val, flags);
+}
+
+int JS_DefinePropertyValueStr(JSContext *ctx, JSValueConst this_obj,
+                              const char *prop, JSValue val, int flags)
+{
+    JSAtom atom;
+    int ret;
+    atom = JS_NewAtom(ctx, prop);
+    ret = JS_DefinePropertyValue(ctx, this_obj, atom, val, flags);
+    JS_FreeAtom(ctx, atom);
+    return ret;
+}
+
+/* shortcut to add getter & setter */
+int JS_DefinePropertyGetSet(JSContext *ctx, JSValueConst this_obj,
+                            JSAtom prop, JSValue getter, JSValue setter,
+                            int flags)
+{
+    int ret;
+    ret = JS_DefineProperty(ctx, this_obj, prop, JS_UNDEFINED, getter, setter,
+                            flags | JS_PROP_HAS_GET | JS_PROP_HAS_SET |
+                            JS_PROP_HAS_CONFIGURABLE | JS_PROP_HAS_ENUMERABLE);
+    JS_FreeValue(ctx, getter);
+    JS_FreeValue(ctx, setter);
+    return ret;
+}
+
+static int JS_CreateDataPropertyUint32(JSContext *ctx, JSValueConst this_obj,
+                                       int64_t idx, JSValue val, int flags)
+{
+    return JS_DefinePropertyValueValue(ctx, this_obj, JS_NewInt64(ctx, idx),
+                                       val, flags | JS_PROP_CONFIGURABLE |
+                                       JS_PROP_ENUMERABLE | JS_PROP_WRITABLE);
+}
+
+static int JS_DefineObjectName(JSContext *ctx, JSValueConst obj,
+                               JSAtom name, int flags)
+{
+    if (name != JS_ATOM_NULL
+    &&  JS_IsObject(obj)
+    &&  !find_own_property1(JS_VALUE_GET_OBJ(obj), JS_ATOM_name)
+    &&  JS_DefinePropertyValue(ctx, obj, JS_ATOM_name, JS_AtomToString(ctx, name), flags) < 0) {
+        return -1;
+    }
+    return 0;
+}
+
+static int JS_DefineObjectNameComputed(JSContext *ctx, JSValueConst obj,
+                                       JSValueConst str, int flags)
+{
+    if (JS_IsObject(obj) &&
+        !find_own_property1(JS_VALUE_GET_OBJ(obj), JS_ATOM_name)) {
+        JSAtom prop;
+        JSValue name_str;
+        prop = js_value_to_atom(ctx, str);
+        if (prop == JS_ATOM_NULL)
+            return -1;
+        name_str = js_get_function_name(ctx, prop);
+        JS_FreeAtom(ctx, prop);
+        if (JS_IsException(name_str))
+            return -1;
+        if (JS_DefinePropertyValue(ctx, obj, JS_ATOM_name, name_str, flags) < 0)
+            return -1;
+    }
+    return 0;
+}
+
+#define DEFINE_GLOBAL_LEX_VAR (1 << 7)
+#define DEFINE_GLOBAL_FUNC_VAR (1 << 6)
+
+static JSValue JS_ThrowSyntaxErrorVarRedeclaration(JSContext *ctx, JSAtom prop)
+{
+    char buf[ATOM_GET_STR_BUF_SIZE];
+    return JS_ThrowSyntaxError(ctx, "redeclaration of %s",
+                               JS_AtomGetStr(ctx, buf, sizeof(buf), prop));
+}
+
+/* flags is 0, DEFINE_GLOBAL_LEX_VAR or DEFINE_GLOBAL_FUNC_VAR */
+/* XXX: could support exotic global object. */
+static int JS_CheckDefineGlobalVar(JSContext *ctx, JSAtom prop, int flags)
+{
+    JSObject *p;
+    JSShapeProperty *prs;
+    char buf[ATOM_GET_STR_BUF_SIZE];
+
+    p = JS_VALUE_GET_OBJ(ctx->global_obj);
+    prs = find_own_property1(p, prop);
+    /* XXX: should handle JS_PROP_AUTOINIT */
+    if (flags & DEFINE_GLOBAL_LEX_VAR) {
+        if (prs && !(prs->flags & JS_PROP_CONFIGURABLE))
+            goto fail_redeclaration;
+    } else {
+        if (!prs && !p->extensible)
+            goto define_error;
+        if (flags & DEFINE_GLOBAL_FUNC_VAR) {
+            if (prs) {
+                if (!(prs->flags & JS_PROP_CONFIGURABLE) &&
+                    ((prs->flags & JS_PROP_TMASK) == JS_PROP_GETSET ||
+                     ((prs->flags & (JS_PROP_WRITABLE | JS_PROP_ENUMERABLE)) !=
+                      (JS_PROP_WRITABLE | JS_PROP_ENUMERABLE)))) {
+                define_error:
+                    JS_ThrowTypeError(ctx, "cannot define variable %s",
+                                      JS_AtomGetStr(ctx, buf, sizeof(buf), prop));
+                    return -1;
+                }
+            }
+        }
+    }
+    /* check if there already is a lexical declaration */
+    p = JS_VALUE_GET_OBJ(ctx->global_var_obj);
+    prs = find_own_property1(p, prop);
+    if (prs) {
+    fail_redeclaration:
+        JS_ThrowSyntaxErrorVarRedeclaration(ctx, prop);
+        return -1;
+    }
+    return 0;
+}
+
+/* def_flags is (0, DEFINE_GLOBAL_LEX_VAR) |
+   JS_PROP_CONFIGURABLE | JS_PROP_WRITABLE */
+/* XXX: could support exotic global object. */
+static int JS_DefineGlobalVar(JSContext *ctx, JSAtom prop, int def_flags)
+{
+    JSObject *p;
+    JSShapeProperty *prs;
+    JSProperty *pr;
+    JSValue val;
+    int flags;
+
+    if (def_flags & DEFINE_GLOBAL_LEX_VAR) {
+        p = JS_VALUE_GET_OBJ(ctx->global_var_obj);
+        flags = JS_PROP_ENUMERABLE | (def_flags & JS_PROP_WRITABLE) |
+            JS_PROP_CONFIGURABLE;
+        val = JS_UNINITIALIZED;
+    } else {
+        p = JS_VALUE_GET_OBJ(ctx->global_obj);
+        flags = JS_PROP_ENUMERABLE | JS_PROP_WRITABLE |
+            (def_flags & JS_PROP_CONFIGURABLE);
+        val = JS_UNDEFINED;
+    }
+    prs = find_own_property1(p, prop);
+    if (prs)
+        return 0;
+    if (!p->extensible)
+        return 0;
+    pr = add_property(ctx, p, prop, flags);
+    if (unlikely(!pr))
+        return -1;
+    pr->u.value = val;
+    return 0;
+}
+
+/* 'def_flags' is 0 or JS_PROP_CONFIGURABLE. */
+/* XXX: could support exotic global object. */
+static int JS_DefineGlobalFunction(JSContext *ctx, JSAtom prop,
+                                   JSValueConst func, int def_flags)
+{
+
+    JSObject *p;
+    JSShapeProperty *prs;
+    int flags;
+
+    p = JS_VALUE_GET_OBJ(ctx->global_obj);
+    prs = find_own_property1(p, prop);
+    flags = JS_PROP_HAS_VALUE | JS_PROP_THROW;
+    if (!prs || (prs->flags & JS_PROP_CONFIGURABLE)) {
+        flags |= JS_PROP_ENUMERABLE | JS_PROP_WRITABLE | def_flags |
+            JS_PROP_HAS_CONFIGURABLE | JS_PROP_HAS_WRITABLE | JS_PROP_HAS_ENUMERABLE;
+    }
+    if (JS_DefineProperty(ctx, ctx->global_obj, prop, func,
+                          JS_UNDEFINED, JS_UNDEFINED, flags) < 0)
+        return -1;
+    return 0;
+}
+
+static JSValue JS_GetGlobalVar(JSContext *ctx, JSAtom prop,
+                               BOOL throw_ref_error)
+{
+    JSObject *p;
+    JSShapeProperty *prs;
+    JSProperty *pr;
+
+    /* no exotic behavior is possible in global_var_obj */
+    p = JS_VALUE_GET_OBJ(ctx->global_var_obj);
+    prs = find_own_property(&pr, p, prop);
+    if (prs) {
+        /* XXX: should handle JS_PROP_TMASK properties */
+        if (unlikely(JS_IsUninitialized(pr->u.value)))
+            return JS_ThrowReferenceErrorUninitialized(ctx, prs->atom);
+        return JS_DupValue(ctx, pr->u.value);
+    }
+    return JS_GetPropertyInternal(ctx, ctx->global_obj, prop,
+                                 ctx->global_obj, throw_ref_error);
+}
+
+/* construct a reference to a global variable */
+static int JS_GetGlobalVarRef(JSContext *ctx, JSAtom prop, JSValue *sp)
+{
+    JSObject *p;
+    JSShapeProperty *prs;
+    JSProperty *pr;
+
+    /* no exotic behavior is possible in global_var_obj */
+    p = JS_VALUE_GET_OBJ(ctx->global_var_obj);
+    prs = find_own_property(&pr, p, prop);
+    if (prs) {
+        /* XXX: should handle JS_PROP_AUTOINIT properties? */
+        /* XXX: conformance: do these tests in
+           OP_put_var_ref/OP_get_var_ref ? */
+        if (unlikely(JS_IsUninitialized(pr->u.value))) {
+            JS_ThrowReferenceErrorUninitialized(ctx, prs->atom);
+            return -1;
+        }
+        if (unlikely(!(prs->flags & JS_PROP_WRITABLE))) {
+            return JS_ThrowTypeErrorReadOnly(ctx, JS_PROP_THROW, prop);
+        }
+        sp[0] = JS_DupValue(ctx, ctx->global_var_obj);
+    } else {
+        int ret;
+        ret = JS_HasProperty(ctx, ctx->global_obj, prop);
+        if (ret < 0)
+            return -1;
+        if (ret) {
+            sp[0] = JS_DupValue(ctx, ctx->global_obj);
+        } else {
+            sp[0] = JS_UNDEFINED;
+        }
+    }
+    sp[1] = JS_AtomToValue(ctx, prop);
+    return 0;
+}
+
+/* use for strict variable access: test if the variable exists */
+static int JS_CheckGlobalVar(JSContext *ctx, JSAtom prop)
+{
+    JSObject *p;
+    JSShapeProperty *prs;
+    int ret;
+
+    /* no exotic behavior is possible in global_var_obj */
+    p = JS_VALUE_GET_OBJ(ctx->global_var_obj);
+    prs = find_own_property1(p, prop);
+    if (prs) {
+        ret = TRUE;
+    } else {
+        ret = JS_HasProperty(ctx, ctx->global_obj, prop);
+        if (ret < 0)
+            return -1;
+    }
+    return ret;
+}
+
+/* flag = 0: normal variable write
+   flag = 1: initialize lexical variable
+   flag = 2: normal variable write, strict check was done before
+*/
+static int JS_SetGlobalVar(JSContext *ctx, JSAtom prop, JSValue val,
+                           int flag)
+{
+    JSObject *p;
+    JSShapeProperty *prs;
+    JSProperty *pr;
+    int flags;
+
+    /* no exotic behavior is possible in global_var_obj */
+    p = JS_VALUE_GET_OBJ(ctx->global_var_obj);
+    prs = find_own_property(&pr, p, prop);
+    if (prs) {
+        /* XXX: should handle JS_PROP_AUTOINIT properties? */
+        if (flag != 1) {
+            if (unlikely(JS_IsUninitialized(pr->u.value))) {
+                JS_ThrowReferenceErrorUninitialized(ctx, prs->atom);
+                return -1;
+            }
+            if (unlikely(!(prs->flags & JS_PROP_WRITABLE))) {
+                JS_FreeValue(ctx, val);
+                return JS_ThrowTypeErrorReadOnly(ctx, JS_PROP_THROW, prop);
+            }
+        }
+        set_value(ctx, &pr->u.value, val);
+        return 0;
+    }
+
+    flags = JS_PROP_THROW_STRICT;
+    if (flag != 2 && is_strict_mode(ctx))
+        flags |= JS_PROP_NO_ADD;
+    return JS_SetPropertyInternal(ctx, ctx->global_obj, prop, val, flags);
+}
+
+/* return -1, FALSE or TRUE. return FALSE if not configurable or
+   invalid object. return -1 in case of exception.
+   flags can be 0, JS_PROP_THROW or JS_PROP_THROW_STRICT */
+int JS_DeleteProperty(JSContext *ctx, JSValueConst obj, JSAtom prop, int flags)
+{
+    if (JS_VALUE_GET_TAG(obj) == JS_TAG_OBJECT) {
+        JSObject *p = JS_VALUE_GET_OBJ(obj);
+        int res = delete_property(ctx, p, prop);
+        if (res != FALSE)
+            return res;
+    }
+    if ((flags & JS_PROP_THROW) ||
+        ((flags & JS_PROP_THROW_STRICT) && is_strict_mode(ctx))) {
+        JS_ThrowTypeError(ctx, "could not delete property");
+        return -1;
+    }
+    return FALSE;
+}
+
+int JS_DeletePropertyInt64(JSContext *ctx, JSValueConst obj, int64_t idx, int flags)
+{
+    JSAtom prop;
+    int res;
+
+    if ((uint64_t)idx <= JS_ATOM_MAX_INT) {
+        /* fast path for fast arrays */
+        return JS_DeleteProperty(ctx, obj, __JS_AtomFromUInt32(idx), flags);
+    }
+    prop = JS_NewAtomInt64(ctx, idx);
+    if (prop == JS_ATOM_NULL)
+        return -1;
+    res = JS_DeleteProperty(ctx, obj, prop, flags);
+    JS_FreeAtom(ctx, prop);
+    return res;
+}
+
+BOOL JS_IsFunction(JSContext *ctx, JSValueConst val)
+{
+    JSObject *p;
+    if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT)
+        return FALSE;
+    p = JS_VALUE_GET_OBJ(val);
+    switch(p->class_id) {
+    case JS_CLASS_BYTECODE_FUNCTION:
+    case JS_CLASS_C_FUNCTION:
+    case JS_CLASS_BOUND_FUNCTION:
+        return TRUE;
+    case JS_CLASS_PROXY:
+        return p->u.proxy_data->is_func;
+    default:
+        return (ctx->rt->class_array[p->class_id].call != NULL);
+    }
+}
+
+BOOL JS_IsCFunction(JSContext *ctx, JSValueConst val, JSCFunction *func, int magic)
+{
+    JSObject *p;
+    if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT)
+        return FALSE;
+    p = JS_VALUE_GET_OBJ(val);
+    if (p->class_id == JS_CLASS_C_FUNCTION)
+        return (p->u.cfunc.c_function.generic == func && p->u.cfunc.magic == magic);
+    else
+        return FALSE;
+}
+
+BOOL JS_IsConstructor(JSContext *ctx, JSValueConst val)
+{
+    JSObject *p;
+    if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT)
+        return FALSE;
+    p = JS_VALUE_GET_OBJ(val);
+    return p->is_constructor;
+}
+
+static BOOL JS_SetConstructorBit(JSContext *ctx, JSValueConst func_obj,
+                                 BOOL val)
+{
+    JSObject *p;
+    if (JS_VALUE_GET_TAG(func_obj) != JS_TAG_OBJECT)
+        return FALSE;
+    p = JS_VALUE_GET_OBJ(func_obj);
+    p->is_constructor = val;
+    return TRUE;
+}
+
+BOOL JS_IsError(JSContext *ctx, JSValueConst val)
+{
+    JSObject *p;
+    if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT)
+        return FALSE;
+    p = JS_VALUE_GET_OBJ(val);
+    if (p->class_id == JS_CLASS_ERROR)
+        return TRUE;
+    if (ctx->is_error_property_enabled) {
+        /* check for a special property for test262 test suites */
+        JSValue isError;
+        isError = JS_GetPropertyStr(ctx, val, "isError");
+        return JS_ToBoolFree(ctx, isError);
+    } else {
+        return FALSE;
+    }
+}
+
+/* only used for test262 test suites */
+void JS_EnableIsErrorProperty(JSContext *ctx, BOOL enable)
+{
+    ctx->is_error_property_enabled = enable;
+}
+
+/* used to avoid catching interrupt exceptions */
+BOOL JS_IsUncatchableError(JSContext *ctx, JSValueConst val)
+{
+    JSObject *p;
+    if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT)
+        return FALSE;
+    p = JS_VALUE_GET_OBJ(val);
+    return p->class_id == JS_CLASS_ERROR && p->is_uncatchable_error;
+}
+
+void JS_SetUncatchableError(JSContext *ctx, JSValueConst val, BOOL flag)
+{
+    JSObject *p;
+    if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT)
+        return;
+    p = JS_VALUE_GET_OBJ(val);
+    if (p->class_id == JS_CLASS_ERROR)
+        p->is_uncatchable_error = flag;
+}
+
+void JS_ResetUncatchableError(JSContext *ctx)
+{
+    JS_SetUncatchableError(ctx, ctx->current_exception, FALSE);
+}
+
+void JS_SetOpaque(JSValue obj, void *opaque)
+{
+   JSObject *p;
+    if (JS_VALUE_GET_TAG(obj) == JS_TAG_OBJECT) {
+        p = JS_VALUE_GET_OBJ(obj);
+        p->u.opaque = opaque;
+    }
+}
+
+/* return NULL if not an object of class class_id */
+void *JS_GetOpaque(JSValueConst obj, JSClassID class_id)
+{
+    JSObject *p;
+    if (JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT)
+        return NULL;
+    p = JS_VALUE_GET_OBJ(obj);
+    if (p->class_id != class_id)
+        return NULL;
+    return p->u.opaque;
+}
+
+void *JS_GetOpaque2(JSContext *ctx, JSValueConst obj, JSClassID class_id)
+{
+    void *p = JS_GetOpaque(obj, class_id);
+    if (unlikely(!p)) {
+        JS_ThrowTypeErrorInvalidClass(ctx, class_id);
+    }
+    return p;
+}
+
+#define HINT_STRING  0
+#define HINT_NUMBER  1
+#define HINT_NONE    2
+#ifdef CONFIG_BIGNUM
+#define HINT_INTEGER 3
+#endif
+/* don't try Symbol.toPrimitive */
+#define HINT_FORCE_ORDINARY (1 << 4)
+
+static JSValue JS_ToPrimitiveFree(JSContext *ctx, JSValue val, int hint)
+{
+    int i;
+    BOOL force_ordinary;
+
+    JSAtom method_name;
+    JSValue method, ret;
+    if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT)
+        return val;
+    force_ordinary = hint & HINT_FORCE_ORDINARY;
+    hint &= ~HINT_FORCE_ORDINARY;
+    if (!force_ordinary) {
+        method = JS_GetProperty(ctx, val, JS_ATOM_Symbol_toPrimitive);
+        if (JS_IsException(method))
+            goto exception;
+        /* ECMA says *If exoticToPrim is not undefined* but tests in
+           test262 use null as a non callable converter */
+        if (!JS_IsUndefined(method) && !JS_IsNull(method)) {
+            JSAtom atom;
+            JSValue arg;
+            switch(hint) {
+            case HINT_STRING:
+                atom = JS_ATOM_string;
+                break;
+            case HINT_NUMBER:
+                atom = JS_ATOM_number;
+                break;
+            default:
+            case HINT_NONE:
+                atom = JS_ATOM_default;
+                break;
+#ifdef CONFIG_BIGNUM
+            case HINT_INTEGER:
+                atom = JS_ATOM_integer;
+                break;
+#endif
+            }
+            arg = JS_AtomToString(ctx, atom);
+            ret = JS_CallFree(ctx, method, val, 1, (JSValueConst *)&arg);
+            JS_FreeValue(ctx, arg);
+            if (JS_IsException(ret))
+                goto exception;
+            JS_FreeValue(ctx, val);
+            if (JS_VALUE_GET_TAG(ret) != JS_TAG_OBJECT)
+                return ret;
+            JS_FreeValue(ctx, ret);
+            return JS_ThrowTypeError(ctx, "toPrimitive");
+        }
+    }
+    if (hint != HINT_STRING)
+        hint = HINT_NUMBER;
+    for(i = 0; i < 2; i++) {
+        if ((i ^ hint) == 0) {
+            method_name = JS_ATOM_toString;
+        } else {
+            method_name = JS_ATOM_valueOf;
+        }
+        method = JS_GetProperty(ctx, val, method_name);
+        if (JS_IsException(method))
+            goto exception;
+        if (JS_IsFunction(ctx, method)) {
+            ret = JS_CallFree(ctx, method, val, 0, NULL);
+            if (JS_IsException(ret))
+                goto exception;
+            if (JS_VALUE_GET_TAG(ret) != JS_TAG_OBJECT) {
+                JS_FreeValue(ctx, val);
+                return ret;
+            }
+            JS_FreeValue(ctx, ret);
+        } else {
+            JS_FreeValue(ctx, method);
+        }
+    }
+    JS_ThrowTypeError(ctx, "toPrimitive");
+exception:
+    JS_FreeValue(ctx, val);
+    return JS_EXCEPTION;
+}
+
+static JSValue JS_ToPrimitive(JSContext *ctx, JSValueConst val, int hint)
+{
+    return JS_ToPrimitiveFree(ctx, JS_DupValue(ctx, val), hint);
+}
+
+static int JS_ToBoolFree(JSContext *ctx, JSValue val)
+{
+    uint32_t tag = JS_VALUE_GET_TAG(val);
+    switch(tag) {
+    case JS_TAG_INT:
+        return JS_VALUE_GET_INT(val) != 0;
+    case JS_TAG_BOOL:
+    case JS_TAG_NULL:
+    case JS_TAG_UNDEFINED:
+        return JS_VALUE_GET_INT(val);
+    case JS_TAG_EXCEPTION:
+        return -1;
+    case JS_TAG_STRING:
+        {
+            BOOL ret = JS_VALUE_GET_STRING(val)->len != 0;
+            JS_FreeValue(ctx, val);
+            return ret;
+        }
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_INT:
+    case JS_TAG_BIG_FLOAT:
+        {
+            JSBigFloat *p = JS_VALUE_GET_PTR(val);
+            BOOL ret;
+            ret = p->num.expn != BF_EXP_ZERO && p->num.expn != BF_EXP_NAN;
+            JS_FreeValue(ctx, val);
+            return ret;
+        }
+#endif
+    default:
+        if (JS_TAG_IS_FLOAT64(tag)) {
+            double d = JS_VALUE_GET_FLOAT64(val);
+            return !isnan(d) && d != 0;
+        } else {
+            JS_FreeValue(ctx, val);
+            return TRUE;
+        }
+    }
+}
+
+int JS_ToBool(JSContext *ctx, JSValueConst val)
+{
+    return JS_ToBoolFree(ctx, JS_DupValue(ctx, val));
+}
+
+static int skip_spaces(const char *pc)
+{
+    const uint8_t *p, *p_next, *p_start;
+    uint32_t c;
+
+    p = p_start = (const uint8_t *)pc;
+    for (;;) {
+        c = *p;
+        if (c < 128) {
+            if (!((c >= 0x09 && c <= 0x0d) || (c == 0x20)))
+                break;
+            p++;
+        } else {
+            c = unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p_next);
+            if (!lre_is_space(c))
+                break;
+            p = p_next;
+        }
+    }
+    return p - p_start;
+}
+
+#ifdef CONFIG_BIGNUM
+
+/* force big int type if integer result */
+#define BF_ATOF_BIG_INT     (1 << 30)
+/* return JS_EXCEPTION if invalid syntax. Otherwise return NaN */
+#define BF_ATOF_THROW       (1 << 29)
+#define BF_ATOF_FLOAT64     (1 << 28)
+
+static JSValue js_atof(JSContext *ctx, const char *p, const char **pp,
+                       int radix, int flags)
+{
+    bf_t a_s, *a = &a_s;
+    int res;
+    slimb_t prec;
+    JSValue val;
+
+    bf_init(ctx->bf_ctx, a);
+    if (flags & BF_ATOF_FLOAT64) {
+        prec = 53;
+        flags |= bf_set_exp_bits(11) | BF_RNDN | BF_FLAG_SUBNORMAL;
+    } else {
+        /* use the current precision */
+        prec = ctx->fp_env.prec;
+        flags |= ctx->fp_env.flags;
+    }
+    p += skip_spaces(p);
+    res = bf_atof(a, p, &p, radix, prec, flags);
+    if ((flags & BF_ATOF_THROW) && bf_is_nan(a)) {
+        bf_delete(a);
+        return JS_EXCEPTION;
+    }
+    if (res & BF_ATOF_ST_INTEGER) {
+        val = JS_NewBigInt2(ctx, a, (flags & BF_ATOF_BIG_INT) != 0);
+    } else if (flags & BF_ATOF_FLOAT64) {
+        double d;
+        bf_get_float64(a, &d, BF_RNDN);
+        bf_delete(a);
+        /* return int or float64 */
+        val = JS_NewFloat64(ctx, d);
+    } else {
+        val = JS_NewBigFloat(ctx, a);
+    }
+    if (pp)
+        *pp = p;
+    return val;
+}
+
+#else
+
+static inline int to_digit(int c)
+{
+    if (c >= '0' && c <= '9')
+        return c - '0';
+    else if (c >= 'A' && c <= 'Z')
+        return c - 'A' + 10;
+    else if (c >= 'a' && c <= 'z')
+        return c - 'a' + 10;
+    else
+        return 36;
+}
+
+#define ATOD_INT_ONLY        (1 << 0)
+/* return JS_EXCEPTION if invalid syntax. Otherwise return NaN */
+#define ATOD_THROW           (1 << 1)
+/* accept Oo and Ob prefixes in addition to 0x prefix if radix = 0 */
+#define ATOD_ACCEPT_BIN_OCT  (1 << 2)
+/* if set return NaN if empty number string */
+#define ATOD_NAN_IF_EMPTY    (1 << 3)
+/* accept O prefix as octal if radix == 0 and properly formed (Annex B) */
+#define ATOD_ACCEPT_LEGACY_OCTAL  (1 << 4)
+/* accept _ between digits as a digit separator */
+#define ATOD_ACCEPT_UNDERSCORES  (1 << 5)
+
+#if defined(_MSC_VER)
+static inline float Infinite() { 
+  int value = 0x7f800000; 
+  return *(float*)&value; 
+}
+#endif
+
+/* radix = 0 accepts prefixes. radix = 16 also
+   accepts 0x prefix. radix must be 0 or between 2 and 36 */
+static JSValue js_atod(JSContext *ctx, const char *str, const char **pp,
+                       int radix, int flags)
+{
+    const char *p;
+    const char *p_start;
+    int is_neg, c, sep;
+    double d;
+
+    /* optional separator between digits */
+    sep = (flags & ATOD_ACCEPT_UNDERSCORES) ? '_' : 256;
+
+    p = str + skip_spaces(str);
+    p_start = p;
+    is_neg = 0;
+    if (p[0] == '+') {
+        p++;
+        p_start++;
+        if (!(flags & ATOD_INT_ONLY))
+            goto no_radix_prefix;
+    } else if (p[0] == '-') {
+        is_neg = 1;
+        p++;
+        p_start++;
+        if (!(flags & ATOD_INT_ONLY))
+            goto no_radix_prefix;
+    }
+    if (p[0] == '0') {
+        if ((p[1] == 'x' || p[1] == 'X') &&
+            (radix == 0 || radix == 16)) {
+            p += 2;
+            radix = 16;
+        } else if ((p[1] == 'o' || p[1] == 'O') &&
+                   radix == 0 && (flags & ATOD_ACCEPT_BIN_OCT)) {
+            p += 2;
+            radix = 8;
+        } else if ((p[1] == 'b' || p[1] == 'B') &&
+                   radix == 0 && (flags & ATOD_ACCEPT_BIN_OCT)) {
+            p += 2;
+            radix = 2;
+        } else if ((p[1] >= '0' && p[1] <= '7') &&
+                   radix == 0 && (flags & ATOD_ACCEPT_LEGACY_OCTAL)) {
+            int i;
+            for (i = 2; (p[i] >= '0' && p[i] <= '7') ||
+                (p[i] == sep && is_digit((uint8_t)p[i + 1])); i++)
+                continue;
+            if (p[i] == '8' || p[i] == '9')
+                goto no_prefix;
+            p += 1;
+            radix = 8;
+        } else {
+            goto no_prefix;
+        }
+        /* there must be a digit after the prefix */
+        if (to_digit((uint8_t)*p) >= radix)
+            goto fail;
+    no_prefix: ;
+    } else {
+ no_radix_prefix:
+        if (!(flags & ATOD_INT_ONLY) && strstart(p, "Infinity", &p)) {
+#if defined(_MSC_VER)
+			d = Infinite();
+#else
+            d = 1.0 / 0.0;
+#endif
+            goto done;
+        }
+    }
+    if (radix == 0)
+        radix = 10;
+    if ((flags & ATOD_INT_ONLY) || radix != 10) {
+        uint64_t n_max, n;
+        int int_exp;
+
+        /* skip leading zeros */
+        while (*p == '0')
+            p++;
+        n = 0;
+        if (radix == 10)
+            n_max = ((uint64_t)-1 - 9) / 10; /* most common case */
+        else
+            n_max = ((uint64_t)-1 - (radix - 1)) / radix;
+        /* XXX: could be more precise */
+        int_exp = 0;
+        while (*p != '\0') {
+            if (*p == sep && to_digit(p[1]) < radix)
+                p++;
+            c = to_digit((uint8_t)*p);
+            if (c >= radix)
+                break;
+            if (n <= n_max) {
+                n = n * radix + c;
+            } else {
+                int_exp++;
+            }
+            p++;
+        }
+        d = n;
+        if (int_exp != 0) {
+            d *= pow(radix, int_exp);
+        }
+    } else {
+        p_start = p;
+        while (is_digit((uint8_t)*p)
+           ||  (*p == sep && (p != p_start + 1 || p[-1] != '0') &&
+               is_digit((uint8_t)p[1]))) {
+            p++;
+        }
+        if (*p == '.' && (p > p_start || is_digit((uint8_t)p[1]))) {
+            p++;
+            while (is_digit((uint8_t)*p) || (*p == sep && is_digit((uint8_t)p[1])))
+                p++;
+        }
+        if (p > p_start && (*p == 'e' || *p == 'E')) {
+            const char *p1 = p + 1;
+            if (*p1 == '+') {
+                p1++;
+            } else if (*p1 == '-') {
+                p1++;
+            }
+            if (is_digit((uint8_t)*p1)) {
+                p = p1 + 1;
+                while (is_digit((uint8_t)*p) || (*p == sep && is_digit((uint8_t)p[1])))
+                    p++;
+            }
+        }
+        if (*p == '\0' && sep != '_') {
+            d = strtod(p_start, NULL);
+        } else {
+            char buf1[64], *buf;
+            int i, j, len;
+            BOOL buf_allocated;
+
+            buf = buf1;
+            buf_allocated = FALSE;
+            len = p - p_start;
+            if (len >= sizeof(buf1)) {
+                buf = js_malloc(ctx, len + 1);
+                if (!buf)
+                    return JS_EXCEPTION;
+                buf_allocated = TRUE;
+            }
+            for (i = j = 0; i < len; i++) {
+                if (p_start[i] != '_')
+                    buf[j++] = p_start[i];
+            }
+            buf[j] = '\0';
+            d = strtod(buf, NULL);
+            if (buf_allocated)
+                js_free(ctx, buf);
+        }
+    }
+done:
+    if (is_neg)
+        d = -d;
+    if (p == p_start && (flags & ATOD_NAN_IF_EMPTY)) {
+        d = JS_FLOAT64_NAN;
+    }
+    if (pp)
+        *pp = p;
+    return JS_NewFloat64(ctx, d);
+ fail:
+    if (pp)
+        *pp = p;
+    if (flags & ATOD_THROW)
+        return JS_EXCEPTION;
+    else
+        return JS_NAN;
+}
+#endif
+
+typedef enum JSToNumberHintEnum {
+    TON_FLAG_NUMBER,
+    TON_FLAG_INTEGER,
+    TON_FLAG_NUMERIC,
+} JSToNumberHintEnum;
+
+static JSValue JS_ToNumberHintFree(JSContext *ctx, JSValue val,
+                                   JSToNumberHintEnum flag)
+{
+    uint32_t tag;
+    JSValue ret;
+    int hint;
+
+ redo:
+    tag = JS_VALUE_GET_NORM_TAG(val);
+    switch(tag) {
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_INT:
+        if (flag == TON_FLAG_NUMBER && !is_bignum_mode(ctx)) {
+            JS_FreeValue(ctx, val);
+            return JS_ThrowTypeError(ctx, "cannot convert bigint to number");
+        }
+        /* fall thru */
+    case JS_TAG_BIG_FLOAT:
+#endif
+    case JS_TAG_FLOAT64:
+    case JS_TAG_INT:
+    case JS_TAG_EXCEPTION:
+        ret = val;
+        break;
+    case JS_TAG_BOOL:
+    case JS_TAG_NULL:
+        ret = JS_NewInt32(ctx, JS_VALUE_GET_INT(val));
+        break;
+    case JS_TAG_UNDEFINED:
+        ret = JS_NAN;
+        break;
+    case JS_TAG_OBJECT:
+#ifdef CONFIG_BIGNUM
+        hint = flag == TON_FLAG_INTEGER ? HINT_INTEGER : HINT_NUMBER;
+#else
+        hint = HINT_NUMBER;
+#endif
+        val = JS_ToPrimitiveFree(ctx, val, hint);
+        if (JS_IsException(val))
+            return JS_EXCEPTION;
+        goto redo;
+    case JS_TAG_STRING:
+        {
+            const char *str;
+            const char *p;
+
+            str = JS_ToCString(ctx, val);
+            JS_FreeValue(ctx, val);
+            if (!str)
+                return JS_EXCEPTION;
+#ifdef CONFIG_BIGNUM
+            {
+                int flags;
+                flags = BF_ATOF_BIN_OCT | BF_ATOF_NO_PREFIX_AFTER_SIGN |
+                    BF_ATOF_JS_QUIRKS | BF_ATOF_FLOAT64;
+                if (is_bignum_mode(ctx))
+                    flags |= BF_ATOF_INT_PREC_INF;
+                else
+                    flags |= BF_ATOF_ONLY_DEC_FLOAT;
+                ret = js_atof(ctx, str, &p, 0, flags);
+            }
+#else
+            ret = js_atod(ctx, str, &p, 0, ATOD_ACCEPT_BIN_OCT);
+#endif
+            p += skip_spaces(p);
+            if (*p != '\0') {
+                JS_FreeValue(ctx, ret);
+                ret = JS_NAN;
+            }
+            JS_FreeCString(ctx, str);
+        }
+        break;
+    case JS_TAG_SYMBOL:
+        JS_FreeValue(ctx, val);
+        return JS_ThrowTypeError(ctx, "cannot convert symbol to number");
+    default:
+        JS_FreeValue(ctx, val);
+        ret = JS_NAN;
+        break;
+    }
+    return ret;
+}
+
+static JSValue JS_ToNumberFree(JSContext *ctx, JSValue val)
+{
+    return JS_ToNumberHintFree(ctx, val, TON_FLAG_NUMBER);
+}
+
+#ifdef CONFIG_BIGNUM
+static JSValue JS_ToNumericFree(JSContext *ctx, JSValue val)
+{
+    return JS_ToNumberHintFree(ctx, val, TON_FLAG_NUMERIC);
+}
+
+static JSValue JS_ToNumeric(JSContext *ctx, JSValueConst val)
+{
+    return JS_ToNumericFree(ctx, JS_DupValue(ctx, val));
+}
+#endif
+
+static __exception int __JS_ToFloat64Free(JSContext *ctx, double *pres,
+                                          JSValue val)
+{
+    double d;
+    uint32_t tag;
+
+    val = JS_ToNumberFree(ctx, val);
+    if (JS_IsException(val)) {
+        *pres = JS_FLOAT64_NAN;
+        return -1;
+    }
+    tag = JS_VALUE_GET_NORM_TAG(val);
+    switch(tag) {
+    case JS_TAG_INT:
+        d = JS_VALUE_GET_INT(val);
+        break;
+    case JS_TAG_FLOAT64:
+        d = JS_VALUE_GET_FLOAT64(val);
+        break;
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_INT:
+    case JS_TAG_BIG_FLOAT:
+        {
+            JSBigFloat *p = JS_VALUE_GET_PTR(val);
+            /* XXX: there can be a double rounding issue with some
+               primitives (such as JS_ToUint8ClampFree()), but it is
+               not critical to fix it. */
+            bf_get_float64(&p->num, &d, BF_RNDN);
+            JS_FreeValue(ctx, val);
+        }
+        break;
+#endif
+    default:
+        abort();
+    }
+    *pres = d;
+    return 0;
+}
+
+static inline int JS_ToFloat64Free(JSContext *ctx, double *pres, JSValue val)
+{
+    uint32_t tag;
+
+    tag = JS_VALUE_GET_TAG(val);
+    if (tag <= JS_TAG_NULL) {
+        *pres = JS_VALUE_GET_INT(val);
+        return 0;
+    } else if (JS_TAG_IS_FLOAT64(tag)) {
+        *pres = JS_VALUE_GET_FLOAT64(val);
+        return 0;
+    } else {
+        return __JS_ToFloat64Free(ctx, pres, val);
+    }
+}
+
+int JS_ToFloat64(JSContext *ctx, double *pres, JSValueConst val)
+{
+    return JS_ToFloat64Free(ctx, pres, JS_DupValue(ctx, val));
+}
+
+static JSValue JS_ToNumber(JSContext *ctx, JSValueConst val)
+{
+    return JS_ToNumberFree(ctx, JS_DupValue(ctx, val));
+}
+
+#if defined(_MSC_VER)
+static JSValue JS_ToIntegerFree(JSContext *ctx, JSValue val)
+#else
+static __attribute__((unused)) JSValue JS_ToIntegerFree(JSContext *ctx, JSValue val)
+#endif
+{
+    uint32_t tag;
+    JSValue ret;
+
+ redo:
+    tag = JS_VALUE_GET_NORM_TAG(val);
+    switch(tag) {
+    case JS_TAG_INT:
+    case JS_TAG_BOOL:
+    case JS_TAG_NULL:
+    case JS_TAG_UNDEFINED:
+        ret = JS_NewInt32(ctx, JS_VALUE_GET_INT(val));
+        break;
+    case JS_TAG_FLOAT64:
+        {
+            double d = JS_VALUE_GET_FLOAT64(val);
+            if (isnan(d)) {
+                ret = JS_NewInt32(ctx, 0);
+            } else {
+                /* convert -0 to +0 */
+                /* XXX: should not be done here ? */
+                d = trunc(d) + 0.0;
+                ret = JS_NewFloat64(ctx, d);
+            }
+        }
+        break;
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_INT:
+        if (!is_bignum_mode(ctx))
+            goto to_number;
+        ret = val;
+        break;
+    case JS_TAG_BIG_FLOAT:
+        {
+            bf_t a_s, *a, r_s, *r = &r_s;
+            BOOL is_float, is_nan;
+
+            a = JS_ToBigFloat(ctx, &is_float, &a_s, val);
+            if (!bf_is_finite(a)) {
+                is_nan = bf_is_nan(a);
+                if (is_nan)
+                    ret = JS_NewInt32(ctx, 0);
+                else
+                    ret = JS_DupValue(ctx, val);
+            } else {
+                bf_init(ctx->bf_ctx, r);
+                bf_set(r, a);
+                bf_rint(r, BF_PREC_INF, BF_RNDZ);
+                ret = JS_NewBigInt(ctx, r);
+            }
+            if (a == &a_s)
+                bf_delete(a);
+            JS_FreeValue(ctx, val);
+        }
+        break;
+#endif
+    default:
+#ifdef CONFIG_BIGNUM
+    to_number:
+#endif
+        val = JS_ToNumberFree(ctx, val);
+        if (JS_IsException(val))
+            return val;
+        goto redo;
+    }
+    return ret;
+}
+
+/* Note: the integer value is satured to 32 bits */
+static int JS_ToInt32SatFree(JSContext *ctx, int *pres, JSValue val)
+{
+    uint32_t tag;
+    int ret;
+
+ redo:
+    tag = JS_VALUE_GET_NORM_TAG(val);
+    switch(tag) {
+    case JS_TAG_INT:
+    case JS_TAG_BOOL:
+    case JS_TAG_NULL:
+    case JS_TAG_UNDEFINED:
+        ret = JS_VALUE_GET_INT(val);
+        break;
+    case JS_TAG_EXCEPTION:
+        *pres = 0;
+        return -1;
+    case JS_TAG_FLOAT64:
+        {
+            double d = JS_VALUE_GET_FLOAT64(val);
+            if (isnan(d)) {
+                ret = 0;
+            } else {
+                if (d < INT32_MIN)
+                    ret = INT32_MIN;
+                else if (d > INT32_MAX)
+                    ret = INT32_MAX;
+                else
+                    ret = (int)d;
+            }
+        }
+        break;
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_FLOAT:
+    to_bf:
+        {
+            JSBigFloat *p = JS_VALUE_GET_PTR(val);
+            bf_get_int32(&ret, &p->num, 0);
+            JS_FreeValue(ctx, val);
+        }
+        break;
+    case JS_TAG_BIG_INT:
+        if (is_bignum_mode(ctx))
+            goto to_bf;
+        /* fall thru */
+#endif
+    default:
+        val = JS_ToNumberFree(ctx, val);
+        if (JS_IsException(val)) {
+            *pres = 0;
+            return -1;
+        }
+        goto redo;
+    }
+    *pres = ret;
+    return 0;
+}
+
+int JS_ToInt32Sat(JSContext *ctx, int *pres, JSValueConst val)
+{
+    return JS_ToInt32SatFree(ctx, pres, JS_DupValue(ctx, val));
+}
+
+int JS_ToInt32Clamp(JSContext *ctx, int *pres, JSValueConst val,
+                    int min, int max, int min_offset)
+{
+    int res = JS_ToInt32SatFree(ctx, pres, JS_DupValue(ctx, val));
+    if (res == 0) {
+        if (*pres < min) {
+            *pres += min_offset;
+            if (*pres < min)
+                *pres = min;
+        } else {
+            if (*pres > max)
+                *pres = max;
+        }
+    }
+    return res;
+}
+
+static int JS_ToInt64SatFree(JSContext *ctx, int64_t *pres, JSValue val)
+{
+    uint32_t tag;
+
+ redo:
+    tag = JS_VALUE_GET_NORM_TAG(val);
+    switch(tag) {
+    case JS_TAG_INT:
+    case JS_TAG_BOOL:
+    case JS_TAG_NULL:
+    case JS_TAG_UNDEFINED:
+        *pres = JS_VALUE_GET_INT(val);
+        return 0;
+    case JS_TAG_EXCEPTION:
+        *pres = 0;
+        return -1;
+    case JS_TAG_FLOAT64:
+        {
+            double d = JS_VALUE_GET_FLOAT64(val);
+            if (isnan(d)) {
+                *pres = 0;
+            } else {
+                if (d < INT64_MIN)
+                    *pres = INT64_MIN;
+                else if (d > INT64_MAX)
+                    *pres = INT64_MAX;
+                else
+                    *pres = (int64_t)d;
+            }
+        }
+        return 0;
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_FLOAT:
+    to_bf:
+        {
+            JSBigFloat *p = JS_VALUE_GET_PTR(val);
+            bf_get_int64(pres, &p->num, 0);
+            JS_FreeValue(ctx, val);
+        }
+        return 0;
+    case JS_TAG_BIG_INT:
+        if (is_bignum_mode(ctx))
+            goto to_bf;
+        /* fall thru */
+#endif
+    default:
+        val = JS_ToNumberFree(ctx, val);
+        if (JS_IsException(val)) {
+            *pres = 0;
+            return -1;
+        }
+        goto redo;
+    }
+}
+
+int JS_ToInt64Sat(JSContext *ctx, int64_t *pres, JSValueConst val)
+{
+    return JS_ToInt64SatFree(ctx, pres, JS_DupValue(ctx, val));
+}
+
+int JS_ToInt64Clamp(JSContext *ctx, int64_t *pres, JSValueConst val,
+                    int64_t min, int64_t max, int64_t neg_offset)
+{
+    int res = JS_ToInt64SatFree(ctx, pres, JS_DupValue(ctx, val));
+    if (res == 0) {
+        if (*pres < 0)
+            *pres += neg_offset;
+        if (*pres < min)
+            *pres = min;
+        else if (*pres > max)
+            *pres = max;
+    }
+    return res;
+}
+
+/* Same as JS_ToInt32Free() but with a 64 bit result. Return (<0, 0)
+   in case of exception */
+static int JS_ToInt64Free(JSContext *ctx, int64_t *pres, JSValue val)
+{
+    uint32_t tag;
+    int64_t ret;
+
+ redo:
+    tag = JS_VALUE_GET_NORM_TAG(val);
+    switch(tag) {
+    case JS_TAG_INT:
+    case JS_TAG_BOOL:
+    case JS_TAG_NULL:
+    case JS_TAG_UNDEFINED:
+        ret = JS_VALUE_GET_INT(val);
+        break;
+    case JS_TAG_FLOAT64:
+        {
+            JSFloat64Union u;
+            double d;
+            int e;
+            d = JS_VALUE_GET_FLOAT64(val);
+            u.d = d;
+            /* we avoid doing fmod(x, 2^64) */
+            e = (u.u64 >> 52) & 0x7ff;
+            if (likely(e <= (1023 + 62))) {
+                /* fast case */
+                ret = (int64_t)d;
+            } else if (e <= (1023 + 62 + 53)) {
+                uint64_t v;
+                /* remainder modulo 2^64 */
+                v = (u.u64 & (((uint64_t)1 << 52) - 1)) | ((uint64_t)1 << 52);
+                ret = v << ((e - 1023) - 52);
+                /* take the sign into account */
+                if (u.u64 >> 63)
+                    ret = -ret;
+            } else {
+                ret = 0; /* also handles NaN and +inf */
+            }
+        }
+        break;
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_FLOAT:
+    to_bf:
+        {
+            JSBigFloat *p = JS_VALUE_GET_PTR(val);
+            bf_get_int64(&ret, &p->num, BF_GET_INT_MOD);
+            JS_FreeValue(ctx, val);
+        }
+        break;
+    case JS_TAG_BIG_INT:
+        if (is_bignum_mode(ctx))
+            goto to_bf;
+        /* fall thru */
+#endif
+    default:
+        val = JS_ToNumberFree(ctx, val);
+        if (JS_IsException(val)) {
+            *pres = 0;
+            return -1;
+        }
+        goto redo;
+    }
+    *pres = ret;
+    return 0;
+}
+
+int JS_ToInt64(JSContext *ctx, int64_t *pres, JSValueConst val)
+{
+    return JS_ToInt64Free(ctx, pres, JS_DupValue(ctx, val));
+}
+
+/* return (<0, 0) in case of exception */
+static int JS_ToInt32Free(JSContext *ctx, int32_t *pres, JSValue val)
+{
+    uint32_t tag;
+    int32_t ret;
+
+ redo:
+    tag = JS_VALUE_GET_NORM_TAG(val);
+    switch(tag) {
+    case JS_TAG_INT:
+    case JS_TAG_BOOL:
+    case JS_TAG_NULL:
+    case JS_TAG_UNDEFINED:
+        ret = JS_VALUE_GET_INT(val);
+        break;
+    case JS_TAG_FLOAT64:
+        {
+            JSFloat64Union u;
+            double d;
+            int e;
+            d = JS_VALUE_GET_FLOAT64(val);
+            u.d = d;
+            /* we avoid doing fmod(x, 2^32) */
+            e = (u.u64 >> 52) & 0x7ff;
+            if (likely(e <= (1023 + 30))) {
+                /* fast case */
+                ret = (int32_t)d;
+            } else if (e <= (1023 + 30 + 53)) {
+                uint64_t v;
+                /* remainder modulo 2^32 */
+                v = (u.u64 & (((uint64_t)1 << 52) - 1)) | ((uint64_t)1 << 52);
+                v = v << ((e - 1023) - 52 + 32);
+                ret = v >> 32;
+                /* take the sign into account */
+                if (u.u64 >> 63)
+                    ret = -ret;
+            } else {
+                ret = 0; /* also handles NaN and +inf */
+            }
+        }
+        break;
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_FLOAT:
+    to_bf:
+        {
+            JSBigFloat *p = JS_VALUE_GET_PTR(val);
+            bf_get_int32(&ret, &p->num, BF_GET_INT_MOD);
+            JS_FreeValue(ctx, val);
+        }
+        break;
+    case JS_TAG_BIG_INT:
+        if (is_bignum_mode(ctx))
+            goto to_bf;
+        /* fall thru */
+#endif
+    default:
+        val = JS_ToNumberFree(ctx, val);
+        if (JS_IsException(val)) {
+            *pres = 0;
+            return -1;
+        }
+        goto redo;
+    }
+    *pres = ret;
+    return 0;
+}
+
+int JS_ToInt32(JSContext *ctx, int32_t *pres, JSValueConst val)
+{
+    return JS_ToInt32Free(ctx, pres, JS_DupValue(ctx, val));
+}
+
+static inline int JS_ToUint32Free(JSContext *ctx, uint32_t *pres, JSValue val)
+{
+    return JS_ToInt32Free(ctx, (int32_t *)pres, val);
+}
+
+static int JS_ToUint8ClampFree(JSContext *ctx, int32_t *pres, JSValue val)
+{
+    uint32_t tag;
+    int res;
+
+ redo:
+    tag = JS_VALUE_GET_NORM_TAG(val);
+    switch(tag) {
+    case JS_TAG_INT:
+    case JS_TAG_BOOL:
+    case JS_TAG_NULL:
+    case JS_TAG_UNDEFINED:
+        res = JS_VALUE_GET_INT(val);
+#ifdef CONFIG_BIGNUM
+    int_clamp:
+#endif
+        res = max_int(0, min_int(255, res));
+        break;
+    case JS_TAG_FLOAT64:
+        {
+            double d = JS_VALUE_GET_FLOAT64(val);
+            if (isnan(d)) {
+                res = 0;
+            } else {
+                if (d < 0)
+                    res = 0;
+                else if (d > 255)
+                    res = 255;
+                else
+                    res = lrint(d);
+            }
+        }
+        break;
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_INT:
+        {
+            JSBigFloat *p = JS_VALUE_GET_PTR(val);
+            if (!is_bignum_mode(ctx))
+                goto to_number;
+            bf_get_int32(&res, &p->num, 0);
+            JS_FreeValue(ctx, val);
+        }
+        goto int_clamp;
+    case JS_TAG_BIG_FLOAT:
+        {
+            JSBigFloat *p = JS_VALUE_GET_PTR(val);
+            bf_t r_s, *r = &r_s;
+            bf_init(ctx->bf_ctx, r);
+            bf_set(r, &p->num);
+            bf_rint(r, BF_PREC_INF, BF_RNDN);
+            bf_get_int32(&res, r, 0);
+            bf_delete(r);
+            JS_FreeValue(ctx, val);
+        }
+        goto int_clamp;
+#endif
+    default:
+#ifdef CONFIG_BIGNUM
+    to_number:
+#endif
+        val = JS_ToNumberFree(ctx, val);
+        if (JS_IsException(val)) {
+            *pres = 0;
+            return -1;
+        }
+        goto redo;
+    }
+    *pres = res;
+    return 0;
+}
+
+static __exception int JS_ToArrayLengthFree(JSContext *ctx, uint32_t *plen,
+                                            JSValue val)
+{
+    uint32_t tag, len;
+
+ redo:
+    tag = JS_VALUE_GET_TAG(val);
+    switch(tag) {
+    case JS_TAG_INT:
+    case JS_TAG_BOOL:
+    case JS_TAG_NULL:
+        {
+            int v;
+            v = JS_VALUE_GET_INT(val);
+            if (v < 0)
+                goto fail;
+            len = v;
+        }
+        break;
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_INT:
+    case JS_TAG_BIG_FLOAT:
+        {
+            JSBigFloat *p = JS_VALUE_GET_PTR(val);
+            bf_t a;
+            BOOL res;
+            bf_get_int32((int32_t *)&len, &p->num, BF_GET_INT_MOD);
+            bf_init(ctx->bf_ctx, &a);
+            bf_set_ui(&a, len);
+            res = bf_cmp_eq(&a, &p->num);
+            bf_delete(&a);
+            JS_FreeValue(ctx, val);
+            if (!res)
+                goto fail;
+        }
+        break;
+#endif
+    default:
+        if (JS_TAG_IS_FLOAT64(tag)) {
+            double d;
+            d = JS_VALUE_GET_FLOAT64(val);
+            len = (uint32_t)d;
+            if (len != d) {
+            fail:
+                JS_ThrowRangeError(ctx, "invalid array length");
+                return -1;
+            }
+        } else {
+            val = JS_ToNumberFree(ctx, val);
+            if (JS_IsException(val))
+                return -1;
+            goto redo;
+        }
+        break;
+    }
+    *plen = len;
+    return 0;
+}
+
+#define MAX_SAFE_INTEGER (((int64_t)1 << 53) - 1)
+
+int JS_ToIndex(JSContext *ctx, uint64_t *plen, JSValueConst val)
+{
+    int64_t v;
+    if (JS_ToInt64Sat(ctx, &v, val))
+        return -1;
+    if (v < 0 || v > MAX_SAFE_INTEGER) {
+        JS_ThrowRangeError(ctx, "invalid array index");
+        *plen = 0;
+        return -1;
+    }
+    *plen = v;
+    return 0;
+}
+
+/* convert a value to a length between 0 and MAX_SAFE_INTEGER.
+   return -1 for exception */
+static __exception int JS_ToLengthFree(JSContext *ctx, int64_t *plen,
+                                       JSValue val)
+{
+    int res = JS_ToInt64Clamp(ctx, plen, val, 0, MAX_SAFE_INTEGER, 0);
+    JS_FreeValue(ctx, val);
+    return res;
+}
+
+/* Note: can return an exception */
+/* XXX: bignum case */
+static int JS_NumberIsInteger(JSContext *ctx, JSValueConst val)
+{
+    double d;
+    if (!JS_IsNumber(val))
+        return FALSE;
+    if (unlikely(JS_ToFloat64(ctx, &d, val)))
+        return -1;
+    return isfinite(d) && floor(d) == d;
+}
+
+static BOOL JS_NumberIsNegativeOrMinusZero(JSContext *ctx, JSValueConst val)
+{
+    uint32_t tag;
+
+    tag = JS_VALUE_GET_NORM_TAG(val);
+    switch(tag) {
+    case JS_TAG_INT:
+        {
+            int v;
+            v = JS_VALUE_GET_INT(val);
+            return (v < 0);
+        }
+    case JS_TAG_FLOAT64:
+        {
+            JSFloat64Union u;
+            u.d = JS_VALUE_GET_FLOAT64(val);
+            return (u.u64 >> 63);
+        }
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_INT:
+        {
+            JSBigFloat *p = JS_VALUE_GET_PTR(val);
+            /* Note: integer zeros are not necessarily positive */
+            return p->num.sign && !bf_is_zero(&p->num);
+        }
+    case JS_TAG_BIG_FLOAT:
+        {
+            JSBigFloat *p = JS_VALUE_GET_PTR(val);
+            return p->num.sign;
+        }
+        break;
+#endif
+    default:
+        return FALSE;
+    }
+}
+
+#ifdef CONFIG_BIGNUM
+
+static JSValue js_ftoa(JSContext *ctx, JSValueConst val1, int radix,
+                       limb_t prec, bf_flags_t flags)
+{
+    JSValue val, ret;
+    bf_t a_s, *a;
+    BOOL is_float;
+    char *str;
+    int saved_sign;
+
+    val = JS_ToNumeric(ctx, val1);
+    if (JS_IsException(val))
+        return val;
+    a = JS_ToBigFloat(ctx, &is_float, &a_s, val);
+    saved_sign = a->sign;
+    if (a->expn == BF_EXP_ZERO)
+        a->sign = 0;
+    flags |= BF_FTOA_JS_QUIRKS;
+    if ((flags & BF_FTOA_FORMAT_MASK) == BF_FTOA_FORMAT_FREE_MIN) {
+        /* Note: for floating point numbers with a radix which is not
+           a power of two, the current precision is used to compute
+           the number of digits. For integers, the full precision is
+           always returned. */
+        if (is_float || (flags & BF_FTOA_FORCE_EXP)) {
+            if ((radix & (radix - 1)) != 0) {
+                bf_t r_s, *r = &r_s;
+                int prec, flags1;
+                /* must round first */
+                if (JS_VALUE_GET_TAG(val) == JS_TAG_BIG_FLOAT) {
+                    prec = ctx->fp_env.prec;
+                    flags1 = ctx->fp_env.flags &
+                        (BF_FLAG_SUBNORMAL | (BF_EXP_BITS_MASK << BF_EXP_BITS_SHIFT));
+                } else {
+                    prec = 53;
+                    flags1 = bf_set_exp_bits(11) | BF_FLAG_SUBNORMAL;
+                }
+                bf_init(ctx->bf_ctx, r);
+                bf_set(r, a);
+                bf_round(r, prec, flags1 | BF_RNDN);
+                bf_ftoa(&str, r, radix, prec, flags1 | flags);
+                bf_delete(r);
+            } else {
+                bf_ftoa(&str, a, radix, BF_PREC_INF, flags);
+            }
+        } else {
+            bf_ftoa(&str, a, radix, 0, BF_RNDZ | BF_FTOA_FORMAT_FRAC | BF_FTOA_JS_QUIRKS);
+        }
+    } else {
+        bf_ftoa(&str, a, radix, prec, flags);
+    }
+    a->sign = saved_sign;
+    if (a == &a_s)
+        bf_delete(a);
+    JS_FreeValue(ctx, val);
+    ret = JS_NewString(ctx, str);
+    bf_realloc(ctx->bf_ctx, str, 0);
+    return ret;
+}
+
+#else /* !CONFIG_BIGNUM */
+
+/* 2 <= base <= 36 */
+static char *i64toa(char *buf_end, int64_t n, unsigned int base)
+{
+    char *q = buf_end;
+    int digit, is_neg;
+
+    is_neg = 0;
+    if (n < 0) {
+        is_neg = 1;
+        n = -n;
+    }
+    *--q = '\0';
+    do {
+        digit = (uint64_t)n % base;
+        n = (uint64_t)n / base;
+        if (digit < 10)
+            digit += '0';
+        else
+            digit += 'a' - 10;
+        *--q = digit;
+    } while (n != 0);
+    if (is_neg)
+        *--q = '-';
+    return q;
+}
+
+/* buf1 contains the printf result */
+static void js_ecvt1(double d, int n_digits, int *decpt, int *sign, char *buf,
+                     int rounding_mode, char *buf1, int buf1_size)
+{
+    if (rounding_mode != FE_TONEAREST)
+        fesetround(rounding_mode);
+    snprintf(buf1, buf1_size, "%+.*e", n_digits - 1, d);
+    if (rounding_mode != FE_TONEAREST)
+        fesetround(FE_TONEAREST);
+    *sign = (buf1[0] == '-');
+    /* mantissa */
+    buf[0] = buf1[1];
+    if (n_digits > 1)
+        memcpy(buf + 1, buf1 + 3, n_digits - 1);
+    buf[n_digits] = '\0';
+    /* exponent */
+    *decpt = atoi(buf1 + n_digits + 2 + (n_digits > 1)) + 1;
+}
+
+/* maximum buffer size for js_dtoa */
+#define JS_DTOA_BUF_SIZE 128
+
+/* needed because ecvt usually limits the number of digits to
+   17. Return the number of digits. */
+static int js_ecvt(double d, int n_digits, int *decpt, int *sign, char *buf,
+                   BOOL is_fixed)
+{
+    int rounding_mode;
+    char buf_tmp[JS_DTOA_BUF_SIZE];
+
+    if (!is_fixed) {
+        unsigned int n_digits_min, n_digits_max;
+        /* find the minimum amount of digits (XXX: inefficient but simple) */
+        n_digits_min = 1;
+        n_digits_max = 17;
+        while (n_digits_min < n_digits_max) {
+            n_digits = (n_digits_min + n_digits_max) / 2;
+            js_ecvt1(d, n_digits, decpt, sign, buf, FE_TONEAREST,
+                     buf_tmp, sizeof(buf_tmp));
+            if (strtod(buf_tmp, NULL) == d) {
+                /* no need to keep the trailing zeros */
+                while (n_digits >= 2 && buf[n_digits - 1] == '0')
+                    n_digits--;
+                n_digits_max = n_digits;
+            } else {
+                n_digits_min = n_digits + 1;
+            }
+        }
+        n_digits = n_digits_max;
+        rounding_mode = FE_TONEAREST;
+    } else {
+        rounding_mode = FE_TONEAREST;
+#ifdef CONFIG_PRINTF_RNDN
+        {
+            char buf1[JS_DTOA_BUF_SIZE], buf2[JS_DTOA_BUF_SIZE];
+            int decpt1, sign1, decpt2, sign2;
+            /* The JS rounding is specified as round to nearest ties away
+               from zero (RNDNA), but in printf the "ties" case is not
+               specified (for example it is RNDN for glibc, RNDNA for
+               Windows), so we must round manually. */
+            js_ecvt1(d, n_digits + 1, &decpt1, &sign1, buf1, FE_TONEAREST,
+                     buf_tmp, sizeof(buf_tmp));
+            /* XXX: could use 2 digits to reduce the average running time */
+            if (buf1[n_digits] == '5') {
+                js_ecvt1(d, n_digits + 1, &decpt1, &sign1, buf1, FE_DOWNWARD,
+                         buf_tmp, sizeof(buf_tmp));
+                js_ecvt1(d, n_digits + 1, &decpt2, &sign2, buf2, FE_UPWARD,
+                         buf_tmp, sizeof(buf_tmp));
+                if (memcmp(buf1, buf2, n_digits + 1) == 0 && decpt1 == decpt2) {
+                    /* exact result: round away from zero */
+                    if (sign1)
+                        rounding_mode = FE_DOWNWARD;
+                    else
+                        rounding_mode = FE_UPWARD;
+                }
+            }
+        }
+#endif /* CONFIG_PRINTF_RNDN */
+    }
+    js_ecvt1(d, n_digits, decpt, sign, buf, rounding_mode,
+             buf_tmp, sizeof(buf_tmp));
+    return n_digits;
+}
+
+static int js_fcvt1(char *buf, int buf_size, double d, int n_digits,
+                    int rounding_mode)
+{
+    int n;
+    if (rounding_mode != FE_TONEAREST)
+        fesetround(rounding_mode);
+    n = snprintf(buf, buf_size, "%.*f", n_digits, d);
+    if (rounding_mode != FE_TONEAREST)
+        fesetround(FE_TONEAREST);
+    assert(n < buf_size);
+    return n;
+}
+
+static void js_fcvt(char *buf, int buf_size, double d, int n_digits)
+{
+    int rounding_mode;
+    rounding_mode = FE_TONEAREST;
+#ifdef CONFIG_PRINTF_RNDN
+    {
+        int n1, n2;
+        char buf1[JS_DTOA_BUF_SIZE];
+        char buf2[JS_DTOA_BUF_SIZE];
+
+        /* The JS rounding is specified as round to nearest ties away from
+           zero (RNDNA), but in printf the "ties" case is not specified
+           (for example it is RNDN for glibc, RNDNA for Windows), so we
+           must round manually. */
+        n1 = js_fcvt1(buf1, sizeof(buf1), d, n_digits + 1, FE_TONEAREST);
+        rounding_mode = FE_TONEAREST;
+        /* XXX: could use 2 digits to reduce the average running time */
+        if (buf1[n1 - 1] == '5') {
+            n1 = js_fcvt1(buf1, sizeof(buf1), d, n_digits + 1, FE_DOWNWARD);
+            n2 = js_fcvt1(buf2, sizeof(buf2), d, n_digits + 1, FE_UPWARD);
+            if (n1 == n2 && memcmp(buf1, buf2, n1) == 0) {
+                /* exact result: round away from zero */
+                if (buf1[0] == '-')
+                    rounding_mode = FE_DOWNWARD;
+                else
+                    rounding_mode = FE_UPWARD;
+            }
+        }
+    }
+#endif /* CONFIG_PRINTF_RNDN */
+    js_fcvt1(buf, buf_size, d, n_digits, rounding_mode);
+}
+
+/* radix != 10 is only supported with flags = JS_DTOA_VAR_FORMAT */
+/* use as many digits as necessary */
+#define JS_DTOA_VAR_FORMAT   (0 << 0)
+/* use n_digits significant digits (1 <= n_digits <= 101) */
+#define JS_DTOA_FIXED_FORMAT (1 << 0)
+/* force fractional format: [-]dd.dd with n_digits fractional digits */
+#define JS_DTOA_FRAC_FORMAT  (2 << 0)
+/* force exponential notation either in fixed or variable format */
+#define JS_DTOA_FORCE_EXP    (1 << 2)
+
+/* XXX: slow and maybe not fully correct
+   XXX: radix != 10 is only supported for small integers
+*/
+static void js_dtoa1(char *buf, double d, int radix, int n_digits, int flags)
+{
+    char *q;
+
+    if (!isfinite(d)) {
+        if (isnan(d)) {
+            strcpy(buf, "NaN");
+        } else {
+            q = buf;
+            if (d < 0)
+                *q++ = '-';
+            strcpy(q, "Infinity");
+        }
+    } else if (flags == JS_DTOA_VAR_FORMAT) {
+        int64_t i64;
+        char buf1[70], *ptr;
+        i64 = (int64_t)d;
+        if (d != i64 || i64 > MAX_SAFE_INTEGER || i64 < -MAX_SAFE_INTEGER)
+            goto generic_conv;
+        /* fast path for integers */
+        ptr = i64toa(buf1 + sizeof(buf1), i64, radix);
+        strcpy(buf, ptr);
+    } else {
+        if (d == 0.0)
+            d = 0.0; /* convert -0 to 0 */
+        if (flags == JS_DTOA_FRAC_FORMAT) {
+            js_fcvt(buf, JS_DTOA_BUF_SIZE, d, n_digits);
+        } else {
+            char buf1[JS_DTOA_BUF_SIZE];
+            int sign, decpt, k, n, i, p, n_max;
+            BOOL is_fixed;
+        generic_conv:
+            is_fixed = ((flags & 3) == JS_DTOA_FIXED_FORMAT);
+            if (is_fixed) {
+                n_max = n_digits;
+            } else {
+                n_max = 21;
+            }
+            /* the number has k digits (k >= 1) */
+            k = js_ecvt(d, n_digits, &decpt, &sign, buf1, is_fixed);
+            n = decpt; /* d=10^(n-k)*(buf1) i.e. d= < x.yyyy 10^(n-1) */
+            q = buf;
+            if (sign)
+                *q++ = '-';
+            if (flags & JS_DTOA_FORCE_EXP)
+                goto force_exp;
+            if (n >= 1 && n <= n_max) {
+                if (k <= n) {
+                    memcpy(q, buf1, k);
+                    q += k;
+                    for(i = 0; i < (n - k); i++)
+                        *q++ = '0';
+                    *q = '\0';
+                } else {
+                    /* k > n */
+                    memcpy(q, buf1, n);
+                    q += n;
+                    *q++ = '.';
+                    for(i = 0; i < (k - n); i++)
+                        *q++ = buf1[n + i];
+                    *q = '\0';
+                }
+            } else if (n >= -5 && n <= 0) {
+                *q++ = '0';
+                *q++ = '.';
+                for(i = 0; i < -n; i++)
+                    *q++ = '0';
+                memcpy(q, buf1, k);
+                q += k;
+                *q = '\0';
+            } else {
+            force_exp:
+                /* exponential notation */
+                *q++ = buf1[0];
+                if (k > 1) {
+                    *q++ = '.';
+                    for(i = 1; i < k; i++)
+                        *q++ = buf1[i];
+                }
+                *q++ = 'e';
+                p = n - 1;
+                if (p >= 0)
+                    *q++ = '+';
+                sprintf(q, "%d", p);
+            }
+        }
+    }
+}
+
+static JSValue js_dtoa(JSContext *ctx,
+                       double d, int radix, int n_digits, int flags)
+{
+    char buf[JS_DTOA_BUF_SIZE];
+    js_dtoa1(buf, d, radix, n_digits, flags);
+    return JS_NewString(ctx, buf);
+}
+
+#endif /* !CONFIG_BIGNUM */
+
+JSValue JS_ToStringInternal(JSContext *ctx, JSValueConst val, BOOL is_ToPropertyKey)
+{
+    uint32_t tag;
+    const char *str;
+    char buf[32];
+
+    tag = JS_VALUE_GET_NORM_TAG(val);
+    switch(tag) {
+    case JS_TAG_STRING:
+        return JS_DupValue(ctx, val);
+    case JS_TAG_INT:
+        snprintf(buf, sizeof(buf), "%d", JS_VALUE_GET_INT(val));
+        str = buf;
+        goto new_string;
+    case JS_TAG_BOOL:
+        return JS_AtomToString(ctx, JS_VALUE_GET_BOOL(val) ?
+                          JS_ATOM_true : JS_ATOM_false);
+    case JS_TAG_NULL:
+        return JS_AtomToString(ctx, JS_ATOM_null);
+    case JS_TAG_UNDEFINED:
+        return JS_AtomToString(ctx, JS_ATOM_undefined);
+    case JS_TAG_EXCEPTION:
+        return JS_EXCEPTION;
+    case JS_TAG_OBJECT:
+        {
+            JSValue val1, ret;
+            val1 = JS_ToPrimitive(ctx, val, HINT_STRING);
+            if (JS_IsException(val1))
+                return val1;
+            ret = JS_ToStringInternal(ctx, val1, is_ToPropertyKey);
+            JS_FreeValue(ctx, val1);
+            return ret;
+        }
+        break;
+    case JS_TAG_FUNCTION_BYTECODE:
+        str = "[function bytecode]";
+        goto new_string;
+    case JS_TAG_SYMBOL:
+        if (is_ToPropertyKey) {
+            return JS_DupValue(ctx, val);
+        } else {
+            return JS_ThrowTypeError(ctx, "cannot convert symbol to string");
+        }
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_FLOAT64:
+    case JS_TAG_BIG_FLOAT:
+    case JS_TAG_BIG_INT:
+        return js_ftoa(ctx, val, 10, 0, BF_RNDN | BF_FTOA_FORMAT_FREE_MIN);
+#else
+    case JS_TAG_FLOAT64:
+        return js_dtoa(ctx, JS_VALUE_GET_FLOAT64(val), 10, 0,
+                       JS_DTOA_VAR_FORMAT);
+#endif
+    default:
+        str = "[unsupported type]";
+    new_string:
+        return JS_NewString(ctx, str);
+    }
+}
+
+JSValue JS_ToString(JSContext *ctx, JSValueConst val)
+{
+    return JS_ToStringInternal(ctx, val, FALSE);
+}
+
+static JSValue JS_ToStringFree(JSContext *ctx, JSValue val)
+{
+    JSValue ret;
+    ret = JS_ToString(ctx, val);
+    JS_FreeValue(ctx, val);
+    return ret;
+}
+
+static JSValue JS_ToLocaleStringFree(JSContext *ctx, JSValue val)
+{
+    if (JS_IsUndefined(val) || JS_IsNull(val))
+        return JS_ToStringFree(ctx, val);
+    return JS_InvokeFree(ctx, val, JS_ATOM_toLocaleString, 0, NULL);
+}
+
+JSValue JS_ToPropertyKey(JSContext *ctx, JSValueConst val)
+{
+    return JS_ToStringInternal(ctx, val, TRUE);
+}
+
+static JSValue JS_ToStringCheckObject(JSContext *ctx, JSValueConst val)
+{
+    uint32_t tag = JS_VALUE_GET_TAG(val);
+    if (tag == JS_TAG_NULL || tag == JS_TAG_UNDEFINED)
+        return JS_ThrowTypeError(ctx, "null or undefined are forbidden");
+    return JS_ToString(ctx, val);
+}
+
+static JSValue JS_ToQuotedString(JSContext *ctx, JSValueConst val1)
+{
+    JSValue val;
+    JSString *p;
+    int i;
+    uint32_t c;
+    StringBuffer b_s, *b = &b_s;
+    char buf[16];
+
+    val = JS_ToStringCheckObject(ctx, val1);
+    if (JS_IsException(val))
+        return val;
+    p = JS_VALUE_GET_STRING(val);
+
+    if (string_buffer_init(ctx, b, p->len + 2))
+        goto fail;
+
+    if (string_buffer_putc8(b, '\"'))
+        goto fail;
+    for(i = 0; i < p->len; i++) {
+        c = string_get(p, i);
+        switch(c) {
+        case '\t':
+            c = 't';
+            goto quote;
+        case '\r':
+            c = 'r';
+            goto quote;
+        case '\n':
+            c = 'n';
+            goto quote;
+        case '\b':
+            c = 'b';
+            goto quote;
+        case '\f':
+            c = 'f';
+            goto quote;
+        case '\"':
+        case '\\':
+        quote:
+            if (string_buffer_putc8(b, '\\'))
+                goto fail;
+            if (string_buffer_putc8(b, c))
+                goto fail;
+            break;
+        default:
+            if (c < 32) {
+                snprintf(buf, sizeof(buf), "\\u%04x", c);
+                if (string_buffer_puts8(b, buf))
+                    goto fail;
+            } else {
+                if (string_buffer_putc16(b, c))
+                    goto fail;
+            }
+            break;
+        }
+    }
+    if (string_buffer_putc8(b, '\"'))
+        goto fail;
+    JS_FreeValue(ctx, val);
+    return string_buffer_end(b);
+ fail:
+    JS_FreeValue(ctx, val);
+    string_buffer_free(b);
+    return JS_EXCEPTION;
+}
+
+#if defined(_MSC_VER)
+static void JS_DumpObjectHeader(JSRuntime *rt)
+#else
+static __attribute__((unused)) void JS_DumpObjectHeader(JSRuntime *rt)
+#endif
+{
+    printf("%14s %4s %4s %14s %10s %s\n",
+           "ADDRESS", "REFS", "SHRF", "PROTO", "CLASS", "PROPS");
+}
+
+/* for debug only: dump an object without side effect */
+#if defined(_MSC_VER)
+static void JS_DumpObject(JSRuntime *rt, JSObject *p)
+#else
+static __attribute__((unused)) void JS_DumpObject(JSRuntime *rt, JSObject *p)
+#endif
+{
+    uint32_t i;
+    char atom_buf[ATOM_GET_STR_BUF_SIZE];
+    JSShape *sh;
+    JSShapeProperty *prs;
+    JSProperty *pr;
+    BOOL is_first = TRUE;
+
+    /* XXX: should encode atoms with special characters */
+    printf("%14p %4d %3d%c %14p %10s ",
+           (void *)p,
+           p->header.ref_count,
+           p->shape->header.ref_count,
+           " *"[p->shape->is_hashed],
+           (void *)p->shape->proto,
+           JS_AtomGetStrRT(rt, atom_buf, sizeof(atom_buf), rt->class_array[p->class_id].class_name));
+    if (p->is_exotic && p->fast_array) {
+        printf("[ ");
+        for(i = 0; i < p->u.array.count; i++) {
+            if (i != 0)
+                printf(", ");
+            switch (p->class_id) {
+            case JS_CLASS_ARRAY:
+            case JS_CLASS_ARGUMENTS:
+                JS_DumpValueShort(rt, p->u.array.u.values[i]);
+                break;
+#if defined(_MSC_VER)
+			case JS_CLASS_UINT8C_ARRAY:      /* u.array (typed_array) */
+			case JS_CLASS_INT8_ARRAY:        /* u.array (typed_array) */
+			case JS_CLASS_UINT8_ARRAY:       /* u.array (typed_array) */
+			case JS_CLASS_INT16_ARRAY:       /* u.array (typed_array) */
+			case JS_CLASS_UINT16_ARRAY:      /* u.array (typed_array) */
+			case JS_CLASS_INT32_ARRAY:       /* u.array (typed_array) */
+			case JS_CLASS_UINT32_ARRAY:      /* u.array (typed_array) */
+		#ifdef CONFIG_BIGNUM
+			case JS_CLASS_BIG_INT64_ARRAY:   /* u.array (typed_array) */
+			case JS_CLASS_BIG_UINT64_ARRAY:  /* u.array (typed_array) */
+		#endif
+			case JS_CLASS_FLOAT32_ARRAY:     /* u.array (typed_array) */
+			case JS_CLASS_FLOAT64_ARRAY:     /* u.array (typed_array) */
+#else
+			case JS_CLASS_UINT8C_ARRAY ... JS_CLASS_FLOAT64_ARRAY:
+#endif
+                {
+                    int size = 1 << typed_array_size_log2(p->class_id);
+                    const uint8_t *b = p->u.array.u.uint8_ptr + i * size;
+                    while (size-- > 0)
+                        printf("%02X", *b++);
+                }
+                break;
+            }
+        }
+        printf(" ] ");
+    }
+
+    printf("{ ");
+    sh = p->shape;
+    for(i = 0, prs = get_shape_prop(sh); i < sh->prop_count; i++, prs++) {
+        if (prs->atom != JS_ATOM_NULL) {
+            pr = &p->prop[i];
+            if (!is_first)
+                printf(", ");
+            printf("%s: ",
+                   JS_AtomGetStrRT(rt, atom_buf, sizeof(atom_buf), prs->atom));
+            if ((prs->flags & JS_PROP_TMASK) == JS_PROP_GETSET) {
+                printf("[getset %p %p]", (void *)pr->u.getset.getter,
+                       (void *)pr->u.getset.setter);
+            } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_VARREF) {
+                printf("[varref %p]", (void *)pr->u.var_ref);
+            } else if ((prs->flags & JS_PROP_TMASK) == JS_PROP_AUTOINIT) {
+                printf("[autoinit %p %p]", (void *)pr->u.init.init_func,
+                       (void *)pr->u.init.opaque);
+            } else {
+                JS_DumpValueShort(rt, pr->u.value);
+            }
+            is_first = FALSE;
+        }
+    }
+    printf(" }");
+
+    if (js_class_has_bytecode(p->class_id)) {
+        JSFunctionBytecode *b = p->u.func.function_bytecode;
+        JSVarRef **var_refs;
+        if (b->closure_var_count) {
+            var_refs = p->u.func.var_refs;
+            printf(" Closure:");
+            for(i = 0; i < b->closure_var_count; i++) {
+                printf(" ");
+                JS_DumpValueShort(rt, var_refs[i]->value);
+            }
+            if (p->u.func.home_object) {
+                printf(" HomeObject: ");
+                JS_DumpValueShort(rt, JS_MKPTR(JS_TAG_OBJECT, p->u.func.home_object));
+            }
+        }
+    }
+    printf("\n");
+}
+
+#if defined(_MSC_VER)
+static void JS_DumpValueShort(JSRuntime *rt,
+                                                      JSValueConst val)
+#else
+static __attribute__((unused)) void JS_DumpValueShort(JSRuntime *rt,
+                                                      JSValueConst val)
+#endif
+{
+    uint32_t tag = JS_VALUE_GET_NORM_TAG(val);
+    const char *str;
+
+    switch(tag) {
+    case JS_TAG_INT:
+        printf("%d", JS_VALUE_GET_INT(val));
+        break;
+    case JS_TAG_BOOL:
+        if (JS_VALUE_GET_BOOL(val))
+            str = "true";
+        else
+            str = "false";
+        goto print_str;
+    case JS_TAG_NULL:
+        str = "null";
+        goto print_str;
+    case JS_TAG_EXCEPTION:
+        str = "exception";
+        goto print_str;
+    case JS_TAG_UNINITIALIZED:
+        str = "uninitialized";
+        goto print_str;
+    case JS_TAG_UNDEFINED:
+        str = "undefined";
+    print_str:
+        printf("%s", str);
+        break;
+    case JS_TAG_FLOAT64:
+        printf("%.14g", JS_VALUE_GET_FLOAT64(val));
+        break;
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_INT:
+        {
+            JSBigFloat *p = JS_VALUE_GET_PTR(val);
+            char *str;
+            bf_ftoa(&str, &p->num, 10, 0,
+                    BF_RNDZ | BF_FTOA_FORMAT_FRAC);
+            printf("%sn", str);
+            bf_realloc(&rt->bf_ctx, str, 0);
+        }
+        break;
+    case JS_TAG_BIG_FLOAT:
+        {
+            JSBigFloat *p = JS_VALUE_GET_PTR(val);
+            char *str;
+            bf_ftoa(&str, &p->num, 16, BF_PREC_INF,
+                    BF_RNDZ | BF_FTOA_FORMAT_FREE | BF_FTOA_ADD_PREFIX);
+            printf("%sl", str);
+            bf_realloc(&rt->bf_ctx, str, 0);
+        }
+        break;
+#endif
+    case JS_TAG_STRING:
+        {
+            JSString *p;
+            p = JS_VALUE_GET_STRING(val);
+            JS_DumpString(rt, p);
+        }
+        break;
+    case JS_TAG_FUNCTION_BYTECODE:
+        {
+            JSFunctionBytecode *b = JS_VALUE_GET_PTR(val);
+            char buf[ATOM_GET_STR_BUF_SIZE];
+            printf("[bytecode %s]", JS_AtomGetStrRT(rt, buf, sizeof(buf), b->func_name));
+        }
+        break;
+    case JS_TAG_OBJECT:
+        {
+            JSObject *p = JS_VALUE_GET_OBJ(val);
+            JSAtom atom = rt->class_array[p->class_id].class_name;
+            char atom_buf[ATOM_GET_STR_BUF_SIZE];
+            printf("[%s %p]",
+                   JS_AtomGetStrRT(rt, atom_buf, sizeof(atom_buf), atom), (void *)p);
+        }
+        break;
+    case JS_TAG_SYMBOL:
+        {
+            JSAtomStruct *p = JS_VALUE_GET_PTR(val);
+            char atom_buf[ATOM_GET_STR_BUF_SIZE];
+            printf("Symbol(%s)",
+                   JS_AtomGetStrRT(rt, atom_buf, sizeof(atom_buf), js_get_atom_index(rt, p)));
+        }
+        break;
+    case JS_TAG_MODULE:
+        printf("[module]");
+        break;
+    case JS_TAG_VAR_REF:
+        printf("[var_ref]");
+        break;
+    default:
+        printf("[unknown tag %d]", tag);
+        break;
+    }
+}
+
+#if defined(_MSC_VER)
+static void JS_DumpValue(JSContext *ctx,
+                                                 JSValueConst val)
+#else
+static __attribute__((unused)) void JS_DumpValue(JSContext *ctx,
+                                                 JSValueConst val)
+#endif
+{
+    JS_DumpValueShort(ctx->rt, val);
+}
+
+#if defined(_MSC_VER)
+static void JS_PrintValue(JSContext *ctx,
+                                                  const char *str,
+                                                  JSValueConst val)
+#else
+static __attribute__((unused)) void JS_PrintValue(JSContext *ctx,
+                                                  const char *str,
+                                                  JSValueConst val)
+#endif
+{
+    printf("%s=", str);
+    JS_DumpValueShort(ctx->rt, val);
+    printf("\n");
+}
+
+/* return -1 if exception (proxy case) or TRUE/FALSE */
+int JS_IsArray(JSContext *ctx, JSValueConst val)
+{
+    JSObject *p;
+    if (JS_VALUE_GET_TAG(val) == JS_TAG_OBJECT) {
+        p = JS_VALUE_GET_OBJ(val);
+        if (unlikely(p->class_id == JS_CLASS_PROXY))
+            return js_proxy_isArray(ctx, val);
+        else
+            return p->class_id == JS_CLASS_ARRAY;
+    } else {
+        return FALSE;
+    }
+}
+
+static double js_pow(double a, double b)
+{
+    if (unlikely(!isfinite(b)) && fabs(a) == 1) {
+        /* not compatible with IEEE 754 */
+        return JS_FLOAT64_NAN;
+    } else {
+        return pow(a, b);
+    }
+}
+
+#ifdef CONFIG_BIGNUM
+
+static JSValue JS_NewBigInt64(JSContext *ctx, int64_t v)
+{
+    BOOL is_bignum = is_bignum_mode(ctx);
+    if (is_bignum && v == (int32_t)v) {
+        return JS_NewInt32(ctx, v);
+    } else {
+        bf_t a_s, *a = &a_s;
+        bf_init(ctx->bf_ctx, a);
+        bf_set_si(a, v);
+        return JS_NewBigInt2(ctx, a, TRUE);
+    }
+}
+
+static JSValue JS_NewBigUint64(JSContext *ctx, uint64_t v)
+{
+    BOOL is_bignum = is_bignum_mode(ctx);
+    if (is_bignum && v == (int32_t)v) {
+        return JS_NewInt32(ctx, v);
+    } else {
+        bf_t a_s, *a = &a_s;
+        bf_init(ctx->bf_ctx, a);
+        bf_set_ui(a, v);
+        return JS_NewBigInt2(ctx, a, TRUE);
+    }
+}
+
+/* if the returned bigfloat is allocated it is equal to
+   'buf'. Otherwise it is a pointer to the bigfloat in 'val'. */
+static bf_t *JS_ToBigFloat(JSContext *ctx, BOOL *pis_float, bf_t *buf,
+                           JSValueConst val)
+{
+    uint32_t tag;
+    bf_t *r;
+    BOOL is_float;
+    JSBigFloat *p;
+
+    tag = JS_VALUE_GET_NORM_TAG(val);
+    switch(tag) {
+    case JS_TAG_INT:
+    case JS_TAG_BOOL:
+    case JS_TAG_NULL:
+        r = buf;
+        bf_init(ctx->bf_ctx, r);
+        bf_set_si(r, JS_VALUE_GET_INT(val));
+        is_float = FALSE;
+        break;
+    case JS_TAG_FLOAT64:
+        r = buf;
+        bf_init(ctx->bf_ctx, r);
+        bf_set_float64(r, JS_VALUE_GET_FLOAT64(val));
+        is_float = TRUE;
+        break;
+    case JS_TAG_BIG_INT:
+        is_float = FALSE;
+        goto get_ptr;
+    case JS_TAG_BIG_FLOAT:
+        is_float = TRUE;
+    get_ptr:
+        p = JS_VALUE_GET_PTR(val);
+        r = &p->num;
+        break;
+    case JS_TAG_UNDEFINED:
+    default:
+        r = buf;
+        bf_init(ctx->bf_ctx, r);
+        bf_set_nan(r);
+        is_float = TRUE;
+        break;
+    }
+    *pis_float = is_float;
+    return r;
+}
+
+/* return NaN if bad bigint literal */
+static JSValue JS_StringToBigInt(JSContext *ctx, JSValue val)
+{
+    const char *str;
+    const char *p;
+    int flags, err;
+
+    str = JS_ToCString(ctx, val);
+    JS_FreeValue(ctx, val);
+    if (!str)
+        return JS_EXCEPTION;
+    flags = BF_ATOF_BIN_OCT | BF_ATOF_NO_PREFIX_AFTER_SIGN |
+        BF_ATOF_JS_QUIRKS | BF_ATOF_INT_ONLY | BF_ATOF_INT_PREC_INF;
+    if (!is_bignum_mode(ctx))
+        flags |= BF_ATOF_BIG_INT;
+    val = js_atof(ctx, str, &p, 0, flags);
+    p += skip_spaces(p);
+    err = (*p != '\0');
+    JS_FreeCString(ctx, str);
+    if (err) {
+        JS_FreeValue(ctx, val);
+        val = JS_NAN;
+    }
+    return val;
+}
+
+static JSValue JS_StringToBigIntErr(JSContext *ctx, JSValue val)
+{
+    val = JS_StringToBigInt(ctx, val);
+    if (JS_VALUE_GET_TAG(val) != JS_TAG_BIG_INT) {
+        JS_FreeValue(ctx, val);
+        return JS_ThrowSyntaxError(ctx, "invalid bigint literal");
+    }
+    return val;
+}
+
+/* if the returned bigfloat is allocated it is equal to
+   'buf'. Otherwise it is a pointer to the bigfloat in 'val'. */
+static bf_t *JS_ToBigIntFree(JSContext *ctx, bf_t *buf, JSValue val)
+{
+    uint32_t tag;
+    bf_t *r;
+    JSBigFloat *p;
+
+ redo:
+    tag = JS_VALUE_GET_NORM_TAG(val);
+    switch(tag) {
+    case JS_TAG_INT:
+    case JS_TAG_NULL:
+    case JS_TAG_UNDEFINED:
+        if (!is_bignum_mode(ctx))
+            goto fail;
+        /* fall tru */
+    case JS_TAG_BOOL:
+        r = buf;
+        bf_init(ctx->bf_ctx, r);
+        bf_set_si(r, JS_VALUE_GET_INT(val));
+        break;
+    case JS_TAG_FLOAT64:
+        {
+            double d = JS_VALUE_GET_FLOAT64(val);
+            if (!is_bignum_mode(ctx))
+                goto fail;
+            if (!isfinite(d))
+                goto fail;
+            r = buf;
+            bf_init(ctx->bf_ctx, r);
+            d = trunc(d);
+            bf_set_float64(r, d);
+        }
+        break;
+    case JS_TAG_BIG_INT:
+        p = JS_VALUE_GET_PTR(val);
+        r = &p->num;
+        break;
+    case JS_TAG_BIG_FLOAT:
+        if (!is_bignum_mode(ctx))
+            goto fail;
+        p = JS_VALUE_GET_PTR(val);
+        if (!bf_is_finite(&p->num))
+            goto fail;
+        r = buf;
+        bf_init(ctx->bf_ctx, r);
+        bf_set(r, &p->num);
+        bf_rint(r, BF_PREC_INF, BF_RNDZ);
+        JS_FreeValue(ctx, val);
+        break;
+    case JS_TAG_STRING:
+        val = JS_StringToBigIntErr(ctx, val);
+        if (JS_IsException(val))
+            return NULL;
+        goto redo;
+    case JS_TAG_OBJECT:
+        val = JS_ToPrimitiveFree(ctx, val,
+                                 is_bignum_mode(ctx) ? HINT_INTEGER : HINT_NUMBER);
+        if (JS_IsException(val))
+            return NULL;
+        goto redo;
+    default:
+    fail:
+        JS_FreeValue(ctx, val);
+        JS_ThrowTypeError(ctx, "cannot convert to bigint");
+        return NULL;
+    }
+    return r;
+}
+
+static bf_t *JS_ToBigInt(JSContext *ctx, bf_t *buf, JSValueConst val)
+{
+    return JS_ToBigIntFree(ctx, buf, JS_DupValue(ctx, val));
+}
+
+/* free the bf_t allocated by JS_ToBigInt */
+static void JS_FreeBigInt(JSContext *ctx, bf_t *a, bf_t *buf)
+{
+    if (a == buf) {
+        bf_delete(a);
+    } else {
+        JSBigFloat *p = (JSBigFloat *)((uint8_t *)a -
+                                       offsetof(JSBigFloat, num));
+        JS_FreeValue(ctx, JS_MKPTR(JS_TAG_BIG_FLOAT, p));
+    }
+}
+
+/* XXX: merge with JS_ToInt64Free with a specific flag */
+static int JS_ToBigInt64Free(JSContext *ctx, int64_t *pres, JSValue val)
+{
+    bf_t a_s, *a;
+
+    a = JS_ToBigIntFree(ctx, &a_s, val);
+    if (!a) {
+        *pres = 0;
+        return -1;
+    }
+    bf_get_int64(pres, a, BF_GET_INT_MOD);
+    JS_FreeBigInt(ctx, a, &a_s);
+    return 0;
+}
+
+static int JS_ToBigInt64(JSContext *ctx, int64_t *pres, JSValueConst val)
+{
+    return JS_ToBigInt64Free(ctx, pres, JS_DupValue(ctx, val));
+}
+
+static JSBigFloat *js_new_bf(JSContext *ctx)
+{
+    JSBigFloat *p;
+    p = js_mallocz(ctx, sizeof(*p));
+    if (!p)
+        return NULL;
+    p->header.ref_count = 1;
+    bf_init(ctx->bf_ctx, &p->num);
+    return p;
+}
+
+/* WARNING: 'a' is freed */
+static JSValue JS_NewBigFloat(JSContext *ctx, bf_t *a)
+{
+    JSValue ret;
+    JSBigFloat *p;
+
+    p = js_new_bf(ctx);
+    p->num = *a;
+    ret = JS_MKPTR(JS_TAG_BIG_FLOAT, p);
+    return ret;
+}
+
+/* WARNING: 'a' is freed */
+static JSValue JS_NewBigInt2(JSContext *ctx, bf_t *a, BOOL force_bigint)
+{
+    JSValue ret;
+    JSBigFloat *p;
+    int32_t v;
+
+    if (!force_bigint && bf_get_int32(&v, a, 0) == 0) {
+        /* can fit in an int32 */
+        ret = JS_NewInt32(ctx, v);
+        bf_delete(a);
+    } else {
+        p = js_new_bf(ctx);
+        p->num = *a;
+        /* normalize the zero representation */
+        if (bf_is_zero(&p->num))
+            p->num.sign = 0;
+        ret = JS_MKPTR(JS_TAG_BIG_INT, p);
+    }
+    return ret;
+}
+
+static JSValue JS_NewBigInt(JSContext *ctx, bf_t *a)
+{
+    return JS_NewBigInt2(ctx, a, FALSE);
+}
+
+/* return < 0 if exception, 0 if overloading method, 1 if overloading
+   operator called */
+static __exception int js_call_binary_op_fallback(JSContext *ctx,
+                                                   JSValue *pret,
+                                                   JSValueConst op1,
+                                                   JSValueConst op2,
+                                                   OPCodeEnum op)
+{
+    JSAtom op_name;
+    JSValue method, ret, c1, c2;
+    BOOL bool_result, swap_op;
+    JSValueConst args[2];
+
+    bool_result = FALSE;
+    swap_op = FALSE;
+    c1 = JS_UNDEFINED;
+    c2 = JS_UNDEFINED;
+    switch(op) {
+    case OP_add:
+        op_name = JS_ATOM_Symbol_operatorAdd;
+        break;
+    case OP_sub:
+        op_name = JS_ATOM_Symbol_operatorSub;
+        break;
+    case OP_mul:
+        op_name = JS_ATOM_Symbol_operatorMul;
+        break;
+    case OP_div:
+        op_name = JS_ATOM_Symbol_operatorDiv;
+        break;
+    case OP_mod:
+        op_name = JS_ATOM_Symbol_operatorMod;
+        break;
+    case OP_pow:
+        op_name = JS_ATOM_Symbol_operatorPow;
+        break;
+    case OP_math_div:
+        op_name = JS_ATOM_Symbol_operatorMathDiv;
+        break;
+    case OP_math_mod:
+        op_name = JS_ATOM_Symbol_operatorMathMod;
+        break;
+    case OP_math_pow:
+        op_name = JS_ATOM_Symbol_operatorMathPow;
+        break;
+    case OP_shl:
+        op_name = JS_ATOM_Symbol_operatorShl;
+        break;
+    case OP_sar:
+        op_name = JS_ATOM_Symbol_operatorShr;
+        break;
+    case OP_and:
+        op_name = JS_ATOM_Symbol_operatorAnd;
+        break;
+    case OP_or:
+        op_name = JS_ATOM_Symbol_operatorOr;
+        break;
+    case OP_xor:
+        op_name = JS_ATOM_Symbol_operatorXor;
+        break;
+    case OP_lt:
+        op_name = JS_ATOM_Symbol_operatorCmpLT;
+        bool_result = TRUE;
+        break;
+    case OP_lte:
+        op_name = JS_ATOM_Symbol_operatorCmpLE;
+        bool_result = TRUE;
+        break;
+    case OP_gt:
+        op_name = JS_ATOM_Symbol_operatorCmpLT;
+        bool_result = TRUE;
+        swap_op = TRUE;
+        break;
+    case OP_gte:
+        op_name = JS_ATOM_Symbol_operatorCmpLE;
+        bool_result = TRUE;
+        swap_op = TRUE;
+        break;
+    case OP_eq:
+    case OP_neq:
+        op_name = JS_ATOM_Symbol_operatorCmpEQ;
+        bool_result = TRUE;
+        break;
+    default:
+        goto fail;
+    }
+    c1 = JS_GetProperty(ctx, op1, JS_ATOM_constructor);
+    if (JS_IsException(c1))
+        goto exception;
+    c2 = JS_GetProperty(ctx, op2, JS_ATOM_constructor);
+    if (JS_IsException(c2))
+        goto exception;
+    if (JS_VALUE_GET_TAG(c1) != JS_TAG_OBJECT ||
+        JS_VALUE_GET_TAG(c2) != JS_TAG_OBJECT)
+        goto fail;
+    if (JS_VALUE_GET_OBJ(c1) == JS_VALUE_GET_OBJ(c2)) {
+        /* if same constructor, there is no ambiguity */
+        method = JS_GetProperty(ctx, c1, op_name);
+    } else {
+        JSValue val;
+        int order1, order2;
+
+        /* different constructors: we use a user-defined ordering */
+        val = JS_GetProperty(ctx, c1, JS_ATOM_Symbol_operatorOrder);
+        if (JS_IsException(val))
+            goto exception;
+        if (JS_IsUndefined(val))
+            goto undef_order;
+        if (JS_ToInt32Free(ctx, &order1, val))
+            goto exception;
+        val = JS_GetProperty(ctx, c2, JS_ATOM_Symbol_operatorOrder);
+        if (JS_IsException(val))
+            goto exception;
+        if (JS_IsUndefined(val)) {
+        undef_order:
+            JS_FreeValue(ctx, c1);
+            JS_FreeValue(ctx, c2);
+            *pret = JS_UNDEFINED;
+            return 0;
+        }
+        if (JS_ToInt32Free(ctx, &order2, val))
+            goto exception;
+        /* ambiguous priority: error */
+        if (order1 == order2) {
+            JS_ThrowTypeError(ctx, "operator_order is identical in both constructors");
+            goto exception;
+        }
+        if (order1 > order2) {
+            val = c1;
+        } else {
+            val = c2;
+        }
+        method = JS_GetProperty(ctx, val, op_name);
+    }
+    JS_FreeValue(ctx, c1);
+    JS_FreeValue(ctx, c2);
+    c1 = JS_UNDEFINED;
+    c2 = JS_UNDEFINED;
+    if (JS_IsException(method))
+        goto exception;
+    if (JS_IsUndefined(method) || JS_IsNull(method)) {
+        *pret = JS_UNDEFINED;
+        return 0;
+    }
+    if (swap_op) {
+        args[0] = op2;
+        args[1] = op1;
+    } else {
+        args[0] = op1;
+        args[1] = op2;
+    }
+    ret = JS_CallFree(ctx, method, JS_UNDEFINED, 2, args);
+    if (JS_IsException(ret))
+        goto exception;
+    if (bool_result) {
+        BOOL res = JS_ToBoolFree(ctx, ret);
+        if (op == OP_neq)
+            res ^= 1;
+        ret = JS_NewBool(ctx, res);
+    }
+    *pret = ret;
+    return 1;
+ fail:
+    JS_ThrowTypeError(ctx, "invalid types for binary operator");
+ exception:
+    JS_FreeValue(ctx, c1);
+    JS_FreeValue(ctx, c2);
+    *pret = JS_UNDEFINED;
+    return -1;
+}
+
+static JSValue throw_bf_exception(JSContext *ctx, int status)
+{
+    const char *str;
+    if (status & BF_ST_DIVIDE_ZERO) {
+        str = "division by zero";
+    } else if (status & BF_ST_INVALID_OP) {
+        str = "invalid operation";
+    } else {
+        str = "integer overflow";
+    }
+    return JS_ThrowRangeError(ctx, "%s", str);
+}
+
+static no_inline __exception int js_unary_arith_slow(JSContext *ctx,
+                                                     JSValue *sp,
+                                                     OPCodeEnum op)
+{
+    JSValue op1, val, method;
+    bf_t a_s, r_s, *r = &r_s, *a;
+    BOOL is_float, is_legacy;
+    JSAtom op_name;
+    int ret, v;
+    uint32_t tag;
+
+    op1 = sp[-1];
+    /* fast path for float64 */
+    if (JS_TAG_IS_FLOAT64(JS_VALUE_GET_TAG(op1)))
+        goto handle_float64;
+    if (JS_IsObject(op1)) {
+        switch(op) {
+        case OP_plus:
+            op_name = JS_ATOM_Symbol_operatorPlus;
+            break;
+        case OP_neg:
+            op_name = JS_ATOM_Symbol_operatorNeg;
+            break;
+        case OP_inc:
+            op_name = JS_ATOM_Symbol_operatorInc;
+            break;
+        case OP_dec:
+            op_name = JS_ATOM_Symbol_operatorDec;
+            break;
+        default:
+            abort();
+        }
+        method = JS_GetProperty(ctx, op1, op_name);
+        if (JS_IsException(method))
+            return -1;
+        if (JS_IsUndefined(method) || JS_IsNull(method))
+            goto to_number;
+        val = JS_CallFree(ctx, method, op1, 0, NULL);
+        if (JS_IsException(val))
+            return -1;
+        JS_FreeValue(ctx, op1);
+        sp[-1] = val;
+    } else {
+    to_number:
+        op1 = JS_ToNumericFree(ctx, op1);
+        if (JS_IsException(op1))
+            goto exception;
+        is_legacy = is_bignum_mode(ctx) ^ 1;
+        tag = JS_VALUE_GET_TAG(op1);
+        switch(tag) {
+        case JS_TAG_INT:
+            {
+                int64_t v64;
+                v64 = JS_VALUE_GET_INT(op1);
+                switch(op) {
+                case OP_inc:
+                case OP_dec:
+                    v = 2 * (op - OP_dec) - 1;
+                    v64 += v;
+                    break;
+                case OP_plus:
+                    break;
+                case OP_neg:
+                    if (v64 == 0 && is_legacy) {
+                        sp[-1] = __JS_NewFloat64(ctx, -0.0);
+                        return 0;
+                    } else {
+                        v64 = -v64;
+                    }
+                    break;
+                default:
+                    abort();
+                }
+                sp[-1] = JS_NewInt64(ctx, v64);
+            }
+            break;
+        case JS_TAG_BIG_INT:
+            if (is_legacy && op == OP_plus) {
+                JS_ThrowTypeError(ctx, "bigint argument with unary +");
+                JS_FreeValue(ctx, op1);
+                goto exception;
+            }
+            a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+            bf_init(ctx->bf_ctx, r);
+            ret = 0;
+            switch(op) {
+            case OP_inc:
+            case OP_dec:
+                v = 2 * (op - OP_dec) - 1;
+                ret = bf_add_si(r, a, v, BF_PREC_INF, BF_RNDZ) & BF_ST_OVERFLOW;
+                break;
+            case OP_plus:
+                bf_set(r, a);
+                break;
+            case OP_neg:
+                bf_set(r, a);
+                bf_neg(r);
+                break;
+            default:
+                abort();
+            }
+            if (a == &a_s)
+                bf_delete(a);
+            JS_FreeValue(ctx, op1);
+            if (unlikely(ret)) {
+                bf_delete(r);
+                throw_bf_exception(ctx, ret);
+                goto exception;
+            }
+            sp[-1] = JS_NewBigInt2(ctx, r, is_legacy);
+            break;
+        case JS_TAG_BIG_FLOAT:
+            a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+            bf_init(ctx->bf_ctx, r);
+            ret = 0;
+            switch(op) {
+            case OP_inc:
+            case OP_dec:
+                v = 2 * (op - OP_dec) - 1;
+                bf_add_si(r, a, v, ctx->fp_env.prec, ctx->fp_env.flags);
+                break;
+            case OP_plus:
+                bf_set(r, a);
+                break;
+            case OP_neg:
+                bf_set(r, a);
+                bf_neg(r);
+                break;
+            default:
+                abort();
+            }
+            if (a == &a_s)
+                bf_delete(a);
+            JS_FreeValue(ctx, op1);
+            if (unlikely(ret)) {
+                bf_delete(r);
+                throw_bf_exception(ctx, ret);
+                goto exception;
+            }
+            sp[-1] = JS_NewBigFloat(ctx, r);
+            break;
+        default:
+        handle_float64:
+            {
+                double d;
+                d = JS_VALUE_GET_FLOAT64(op1);
+                switch(op) {
+                case OP_inc:
+                case OP_dec:
+                    v = 2 * (op - OP_dec) - 1;
+                    d += v;
+                    break;
+                case OP_plus:
+                    break;
+                case OP_neg:
+                    d = -d;
+                    break;
+                default:
+                    abort();
+                }
+                sp[-1] = __JS_NewFloat64(ctx, d);
+            }
+            break;
+        }
+    }
+    return 0;
+ exception:
+    sp[-1] = JS_UNDEFINED;
+    return -1;
+}
+
+static __exception int js_post_inc_slow(JSContext *ctx,
+                                        JSValue *sp, OPCodeEnum op)
+{
+    JSValue op1;
+
+    /* XXX: allow custom operators */
+    op1 = sp[-1];
+    op1 = JS_ToNumericFree(ctx, op1);
+    if (JS_IsException(op1)) {
+        sp[-1] = JS_UNDEFINED;
+        return -1;
+    }
+    sp[-1] = op1;
+    sp[0] = JS_DupValue(ctx, op1);
+    return js_unary_arith_slow(ctx, sp + 1, op - OP_post_dec + OP_dec);
+}
+
+static no_inline int js_not_slow(JSContext *ctx, JSValue *sp)
+{
+    JSValue op1, method, val;
+    bf_t a_s, r_s, *r = &r_s, *a;
+    int ret;
+    BOOL is_legacy;
+
+    op1 = sp[-1];
+    if (JS_IsObject(op1)) {
+        method = JS_GetProperty(ctx, op1, JS_ATOM_Symbol_operatorNot);
+        if (JS_IsException(method))
+            return -1;
+        if (JS_IsUndefined(method) || JS_IsNull(method))
+            goto to_number;
+        val = JS_CallFree(ctx, method, op1, 0, NULL);
+        if (JS_IsException(val))
+            return -1;
+        JS_FreeValue(ctx, op1);
+        sp[-1] = val;
+    } else {
+        if (JS_IsString(op1)) {
+        to_number:
+            op1 = JS_ToNumberHintFree(ctx, op1, TON_FLAG_INTEGER);
+            if (JS_IsException(op1))
+                goto exception;
+        }
+        is_legacy = is_bignum_mode(ctx) ^ 1;
+        if (!is_legacy || JS_VALUE_GET_TAG(op1) == JS_TAG_BIG_INT) {
+            a = JS_ToBigIntFree(ctx, &a_s, op1);
+            bf_init(ctx->bf_ctx, r);
+            ret = bf_add_si(r, a, 1, BF_PREC_INF, BF_RNDZ) & BF_ST_OVERFLOW;
+            bf_neg(r);
+            JS_FreeBigInt(ctx, a, &a_s);
+            if (unlikely(ret)) {
+                bf_delete(r);
+                throw_bf_exception(ctx, ret);
+                goto exception;
+            }
+            sp[-1] = JS_NewBigInt2(ctx, r, is_legacy);
+        } else {
+            int32_t v1;
+            if (unlikely(JS_ToInt32Free(ctx, &v1, op1)))
+                goto exception;
+            sp[-1] = JS_NewInt32(ctx, ~v1);
+        }
+    }
+    return 0;
+ exception:
+    sp[-1] = JS_UNDEFINED;
+    return -1;
+}
+
+static no_inline __exception int js_binary_arith_slow(JSContext *ctx, JSValue *sp,
+                                                      OPCodeEnum op)
+{
+    JSValue op1, op2, res;
+    BOOL is_float, is_legacy;
+    uint32_t tag1, tag2;
+    int ret, rnd_mode;
+    double d1, d2;
+
+    op1 = sp[-2];
+    op2 = sp[-1];
+    tag1 = JS_VALUE_GET_NORM_TAG(op1);
+    tag2 = JS_VALUE_GET_NORM_TAG(op2);
+    /* fast path for float operations */
+    if (tag1 == JS_TAG_FLOAT64 && tag2 == JS_TAG_FLOAT64) {
+        d1 = JS_VALUE_GET_FLOAT64(op1);
+        d2 = JS_VALUE_GET_FLOAT64(op2);
+        goto handle_float64;
+    }
+
+    /* try to call an overloaded operator */
+    if ((tag1 == JS_TAG_OBJECT &&
+         (tag2 != JS_TAG_NULL && tag2 != JS_TAG_UNDEFINED)) ||
+        (tag2 == JS_TAG_OBJECT &&
+         (tag1 != JS_TAG_NULL && tag1 != JS_TAG_UNDEFINED))) {
+        ret = js_call_binary_op_fallback(ctx, &res, op1, op2, op);
+        if (ret != 0) {
+            JS_FreeValue(ctx, op1);
+            JS_FreeValue(ctx, op2);
+            if (ret < 0) {
+                goto exception;
+            } else {
+                sp[-2] = res;
+                return 0;
+            }
+        }
+    }
+
+    op1 = JS_ToNumericFree(ctx, op1);
+    if (JS_IsException(op1)) {
+        JS_FreeValue(ctx, op2);
+        goto exception;
+    }
+    op2 = JS_ToNumericFree(ctx, op2);
+    if (JS_IsException(op2)) {
+        JS_FreeValue(ctx, op1);
+        goto exception;
+    }
+    tag1 = JS_VALUE_GET_NORM_TAG(op1);
+    tag2 = JS_VALUE_GET_NORM_TAG(op2);
+
+    is_legacy = is_bignum_mode(ctx) ^ 1;
+    if (is_legacy && (tag1 == JS_TAG_BIG_INT || tag2 == JS_TAG_BIG_INT) &&
+        tag1 != tag2) {
+        JS_FreeValue(ctx, op1);
+        JS_FreeValue(ctx, op2);
+        JS_ThrowTypeError(ctx, "both operands must be bigint");
+        goto exception;
+    }
+
+    if (tag1 == JS_TAG_INT && tag2 == JS_TAG_INT) {
+        int32_t v1, v2;
+        int64_t v;
+        v1 = JS_VALUE_GET_INT(op1);
+        v2 = JS_VALUE_GET_INT(op2);
+        switch(op) {
+        case OP_sub:
+            v = (int64_t)v1 - (int64_t)v2;
+            break;
+        case OP_mul:
+            v = (int64_t)v1 * (int64_t)v2;
+            if (is_legacy && v == 0 && (v1 | v2) < 0) {
+                sp[-2] = __JS_NewFloat64(ctx, -0.0);
+                return 0;
+            }
+            break;
+        case OP_math_div:
+            goto op_fallback2;
+        case OP_div:
+            sp[-2] = __JS_NewFloat64(ctx, (double)v1 / (double)v2);
+            return 0;
+        case OP_math_mod:
+            if (unlikely(v2 == 0)) {
+                throw_bf_exception(ctx, BF_ST_DIVIDE_ZERO);
+                goto exception;
+            }
+            v = (int64_t)v1 % (int64_t)v2;
+            if (v < 0) {
+                if (v2 < 0)
+                    v -= v2;
+                else
+                    v += v2;
+            }
+            break;
+        case OP_mod:
+            if (is_legacy && (v1 < 0 || v2 <= 0)) {
+                sp[-2] = JS_NewFloat64(ctx, fmod(v1, v2));
+                return 0;
+            } else {
+                if (unlikely(v2 == 0)) {
+                    throw_bf_exception(ctx, BF_ST_DIVIDE_ZERO);
+                    goto exception;
+                }
+                v = (int64_t)v1 % (int64_t)v2;
+            }
+            break;
+        case OP_pow:
+        case OP_math_pow:
+            if (is_legacy) {
+                sp[-2] = JS_NewFloat64(ctx, js_pow(v1, v2));
+                return 0;
+            } else {
+                goto handle_bigint;
+            }
+            break;
+        default:
+            abort();
+        }
+        sp[-2] = JS_NewInt64(ctx, v);
+    } else if ((tag1 == JS_TAG_BIG_INT && (tag2 == JS_TAG_INT ||
+                                           tag2 == JS_TAG_BIG_INT)) ||
+               (tag2 == JS_TAG_BIG_INT && tag1 == JS_TAG_INT)) {
+        /* big int result */
+        bf_t a_s, b_s, r_s, *r, *a, *b;
+    handle_bigint:
+        a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+        b = JS_ToBigFloat(ctx, &is_float, &b_s, op2);
+        r = &r_s;
+        bf_init(ctx->bf_ctx, r);
+        ret = 0;
+        switch(op) {
+        case OP_sub:
+            ret = bf_sub(r, a, b, BF_PREC_INF, BF_RNDZ) & BF_ST_OVERFLOW;
+            break;
+        case OP_mul:
+            ret = bf_mul(r, a, b, BF_PREC_INF, BF_RNDZ) & BF_ST_OVERFLOW;
+            break;
+        case OP_math_div:
+            goto op_fallback;
+        case OP_div:
+            if (is_legacy) {
+                bf_t rem_s, *rem = &rem_s;
+                bf_init(ctx->bf_ctx, rem);
+                ret = bf_divrem(r, rem, a, b, BF_PREC_INF, BF_RNDZ,
+                                BF_RNDZ) & BF_ST_INVALID_OP;
+                bf_delete(rem);
+            } else {
+                bf_div(r, a, b, ctx->fp_env.prec, ctx->fp_env.flags);
+                goto float64_result;
+            }
+            break;
+        case OP_math_mod:
+            /* Euclidian remainder */
+            rnd_mode = BF_DIVREM_EUCLIDIAN;
+            goto do_int_mod;
+        case OP_mod:
+            rnd_mode = BF_RNDZ;
+        do_int_mod:
+            {
+                bf_t q_s, *q = &q_s;
+                bf_init(ctx->bf_ctx, q);
+                ret = bf_divrem(q, r, a, b, BF_PREC_INF, BF_RNDZ,
+                                rnd_mode) & BF_ST_INVALID_OP;
+                bf_delete(q);
+            }
+            break;
+        case OP_pow:
+        case OP_math_pow:
+            if (b->sign) {
+                if (is_legacy) {
+                    ret = BF_ST_INVALID_OP;
+                } else {
+                    bf_set_ui(r, 1);
+                    if (bf_cmpu(a, r) <= 0) {
+                        goto do_int_pow;
+                    } else if (op == OP_math_pow) {
+                    op_fallback:
+                        bf_delete(r);
+                        if (a == &a_s)
+                            bf_delete(a);
+                        if (b == &b_s)
+                            bf_delete(b);
+                    op_fallback2:
+                        ret = js_call_binary_op_fallback(ctx, &res, op1, op2, op);
+                        JS_FreeValue(ctx, op1);
+                        JS_FreeValue(ctx, op2);
+                        if (ret < 0) {
+                            goto exception;
+                        } else if (ret == 0) {
+                            JS_ThrowTypeError(ctx, "operator must be defined for exact division or power");
+                            goto exception;
+                        }
+                        sp[-2] = res;
+                        return 0;
+                    } else {
+                        double dr;
+                        bf_pow(r, a, b, 53, bf_set_exp_bits(11) |
+                               BF_RNDN | BF_FLAG_SUBNORMAL);
+                    float64_result:
+                        bf_get_float64(r, &dr, BF_RNDN);
+                        bf_delete(r);
+                        if (a == &a_s)
+                            bf_delete(a);
+                        if (b == &b_s)
+                            bf_delete(b);
+                        JS_FreeValue(ctx, op1);
+                        JS_FreeValue(ctx, op2);
+                        sp[-2] = __JS_NewFloat64(ctx, dr);
+                        return 0;
+                    }
+                }
+            } else {
+            do_int_pow:
+                ret = bf_pow(r, a, b, BF_PREC_INF, BF_RNDZ | BF_POW_JS_QUICKS) &
+                    (BF_ST_OVERFLOW | BF_ST_DIVIDE_ZERO);
+            }
+            break;
+        default:
+            abort();
+        }
+        if (a == &a_s)
+            bf_delete(a);
+        if (b == &b_s)
+            bf_delete(b);
+        JS_FreeValue(ctx, op1);
+        JS_FreeValue(ctx, op2);
+        if (unlikely(ret)) {
+            bf_delete(r);
+            throw_bf_exception(ctx, ret);
+            goto exception;
+        }
+        sp[-2] = JS_NewBigInt2(ctx, r, is_legacy);
+    } else if ((tag1 == JS_TAG_FLOAT64 && (tag2 == JS_TAG_FLOAT64 ||
+                                           tag2 == JS_TAG_INT ||
+                                           tag2 == JS_TAG_BIG_INT)) ||
+               (tag2 == JS_TAG_FLOAT64 && (tag1 == JS_TAG_INT ||
+                                           tag1 == JS_TAG_BIG_INT))) {
+        double dr;
+        /* float64 result */
+        JS_ToFloat64Free(ctx, &d1, op1);
+        JS_ToFloat64Free(ctx, &d2, op2);
+    handle_float64:
+        switch(op) {
+        case OP_sub:
+            dr = d1 - d2;
+            break;
+        case OP_mul:
+            dr = d1 * d2;
+            break;
+        case OP_div:
+        case OP_math_div:
+            dr = d1 / d2;
+            break;
+        case OP_mod:
+            dr = fmod(d1, d2);
+            break;
+        case OP_math_mod:
+            if (d1 >= 0 && d2 >= 0) {
+                dr = fmod(d1, d2);
+            } else {
+                /* XXX: slow */
+                bf_t a, b, r, q;
+                bf_init(ctx->bf_ctx, &a);
+                bf_init(ctx->bf_ctx, &b);
+                bf_init(ctx->bf_ctx, &r);
+                bf_set_float64(&a, d1);
+                bf_set_float64(&b, d2);
+                bf_divrem(&q, &r, &a, &b,
+                          53, bf_set_exp_bits(11) | BF_RNDN | BF_FLAG_SUBNORMAL,
+                          BF_DIVREM_EUCLIDIAN);
+                bf_get_float64(&q, &dr, BF_RNDN);
+                bf_delete(&a);
+                bf_delete(&b);
+                bf_delete(&q);
+                bf_delete(&r);
+            }
+            break;
+        case OP_pow:
+        case OP_math_pow:
+            dr = js_pow(d1, d2);
+            break;
+        default:
+            abort();
+        }
+        sp[-2] = __JS_NewFloat64(ctx, dr);
+    } else {
+        bf_t a_s, b_s, r_s, *r, *a, *b;
+        /* big float result */
+        a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+        b = JS_ToBigFloat(ctx, &is_float, &b_s, op2);
+        r = &r_s;
+        bf_init(ctx->bf_ctx, r);
+        ret = 0;
+        switch(op) {
+        case OP_sub:
+            bf_sub(r, a, b, ctx->fp_env.prec, ctx->fp_env.flags);
+            break;
+        case OP_mul:
+            bf_mul(r, a, b, ctx->fp_env.prec, ctx->fp_env.flags);
+            break;
+        case OP_math_div:
+        case OP_div:
+            bf_div(r, a, b, ctx->fp_env.prec, ctx->fp_env.flags);
+            break;
+        case OP_math_mod:
+            /* Euclidian remainder */
+            rnd_mode = BF_DIVREM_EUCLIDIAN;
+            goto do_mod;
+        case OP_mod:
+            rnd_mode = BF_RNDZ;
+        do_mod:
+            {
+                bf_t q_s, *q = &q_s;
+                bf_init(ctx->bf_ctx, q);
+                bf_divrem(q, r, a, b, ctx->fp_env.prec, ctx->fp_env.flags,
+                          rnd_mode);
+                bf_delete(q);
+            }
+            break;
+        case OP_pow:
+        case OP_math_pow:
+            bf_pow(r, a, b, ctx->fp_env.prec,
+                   ctx->fp_env.flags | BF_POW_JS_QUICKS);
+            break;
+        default:
+            abort();
+        }
+        if (a == &a_s)
+            bf_delete(a);
+        if (b == &b_s)
+            bf_delete(b);
+        JS_FreeValue(ctx, op1);
+        JS_FreeValue(ctx, op2);
+        if (unlikely(ret)) {
+            bf_delete(r);
+            throw_bf_exception(ctx, ret);
+            goto exception;
+        }
+        sp[-2] = JS_NewBigFloat(ctx, r);
+    }
+    return 0;
+ exception:
+    sp[-2] = JS_UNDEFINED;
+    sp[-1] = JS_UNDEFINED;
+    return -1;
+}
+
+static no_inline __exception int js_add_slow(JSContext *ctx, JSValue *sp)
+{
+    JSValue op1, op2, res;
+    uint32_t tag1, tag2;
+    BOOL is_float, is_legacy;
+    int ret;
+
+    op1 = sp[-2];
+    op2 = sp[-1];
+
+    tag1 = JS_VALUE_GET_NORM_TAG(op1);
+    tag2 = JS_VALUE_GET_NORM_TAG(op2);
+    /* fast path for float64 */
+    if (tag1 == JS_TAG_FLOAT64 && tag2 == JS_TAG_FLOAT64) {
+        double d1, d2;
+        d1 = JS_VALUE_GET_FLOAT64(op1);
+        d2 = JS_VALUE_GET_FLOAT64(op2);
+        sp[-2] = __JS_NewFloat64(ctx, d1 + d2);
+        return 0;
+    }
+
+    if (tag1 == JS_TAG_OBJECT || tag2 == JS_TAG_OBJECT) {
+        /* try to call an overloaded operator */
+        if ((tag1 == JS_TAG_OBJECT &&
+             (tag2 != JS_TAG_NULL && tag2 != JS_TAG_UNDEFINED)) ||
+            (tag2 == JS_TAG_OBJECT &&
+             (tag1 != JS_TAG_NULL && tag1 != JS_TAG_UNDEFINED))) {
+            ret = js_call_binary_op_fallback(ctx, &res, op1, op2, OP_add);
+            if (ret != 0) {
+                JS_FreeValue(ctx, op1);
+                JS_FreeValue(ctx, op2);
+                if (ret < 0) {
+                    goto exception;
+                } else {
+                    sp[-2] = res;
+                    return 0;
+                }
+            }
+        }
+
+        op1 = JS_ToPrimitiveFree(ctx, op1, HINT_NONE);
+        if (JS_IsException(op1)) {
+            JS_FreeValue(ctx, op2);
+            goto exception;
+        }
+
+        op2 = JS_ToPrimitiveFree(ctx, op2, HINT_NONE);
+        if (JS_IsException(op2)) {
+            JS_FreeValue(ctx, op1);
+            goto exception;
+        }
+        tag1 = JS_VALUE_GET_NORM_TAG(op1);
+        tag2 = JS_VALUE_GET_NORM_TAG(op2);
+    }
+
+    if (tag1 == JS_TAG_STRING || tag2 == JS_TAG_STRING) {
+        sp[-2] = JS_ConcatString(ctx, op1, op2);
+        if (JS_IsException(sp[-2]))
+            goto exception;
+        return 0;
+    }
+
+    op1 = JS_ToNumericFree(ctx, op1);
+    if (JS_IsException(op1)) {
+        JS_FreeValue(ctx, op2);
+        goto exception;
+    }
+    op2 = JS_ToNumericFree(ctx, op2);
+    if (JS_IsException(op2)) {
+        JS_FreeValue(ctx, op1);
+        goto exception;
+    }
+    tag1 = JS_VALUE_GET_NORM_TAG(op1);
+    tag2 = JS_VALUE_GET_NORM_TAG(op2);
+
+    is_legacy = is_bignum_mode(ctx) ^ 1;
+    if (is_legacy && (tag1 == JS_TAG_BIG_INT || tag2 == JS_TAG_BIG_INT) &&
+        tag1 != tag2) {
+        JS_FreeValue(ctx, op1);
+        JS_FreeValue(ctx, op2);
+        JS_ThrowTypeError(ctx, "both operands must be bigint");
+        goto exception;
+    }
+
+    if (tag1 == JS_TAG_INT && tag2 == JS_TAG_INT) {
+        int32_t v1, v2;
+        int64_t v;
+        v1 = JS_VALUE_GET_INT(op1);
+        v2 = JS_VALUE_GET_INT(op2);
+        v = (int64_t)v1 + (int64_t)v2;
+        sp[-2] = JS_NewInt64(ctx, v);
+    } else if ((tag1 == JS_TAG_BIG_INT && (tag2 == JS_TAG_INT ||
+                                           tag2 == JS_TAG_BIG_INT)) ||
+               (tag2 == JS_TAG_BIG_INT && tag1 == JS_TAG_INT)) {
+        bf_t a_s, b_s, r_s, *r, *a, *b;
+        /* big int result */
+        a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+        b = JS_ToBigFloat(ctx, &is_float, &b_s, op2);
+        r = &r_s;
+        bf_init(ctx->bf_ctx, r);
+        ret = bf_add(r, a, b, BF_PREC_INF, BF_RNDZ) & BF_ST_OVERFLOW;
+        if (a == &a_s)
+            bf_delete(a);
+        if (b == &b_s)
+            bf_delete(b);
+        JS_FreeValue(ctx, op1);
+        JS_FreeValue(ctx, op2);
+        if (unlikely(ret)) {
+            bf_delete(r);
+            throw_bf_exception(ctx, ret);
+            goto exception;
+        }
+        sp[-2] = JS_NewBigInt2(ctx, r, is_legacy);
+    } else if ((tag1 == JS_TAG_FLOAT64 && (tag2 == JS_TAG_FLOAT64 ||
+                                           tag2 == JS_TAG_INT ||
+                                           tag2 == JS_TAG_BIG_INT)) ||
+               (tag2 == JS_TAG_FLOAT64 && (tag1 == JS_TAG_INT ||
+                                           tag1 == JS_TAG_BIG_INT))) {
+        double d1, d2;
+        /* float64 result */
+        JS_ToFloat64Free(ctx, &d1, op1);
+        JS_ToFloat64Free(ctx, &d2, op2);
+        sp[-2] = __JS_NewFloat64(ctx, d1 + d2);
+    } else {
+        bf_t a_s, b_s, r_s, *r, *a, *b;
+        /* big float result */
+        a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+        b = JS_ToBigFloat(ctx, &is_float, &b_s, op2);
+
+        r = &r_s;
+        bf_init(ctx->bf_ctx, r);
+        bf_add(r, a, b, ctx->fp_env.prec, ctx->fp_env.flags);
+        if (a == &a_s)
+            bf_delete(a);
+        if (b == &b_s)
+            bf_delete(b);
+        JS_FreeValue(ctx, op1);
+        JS_FreeValue(ctx, op2);
+        if (unlikely(ret)) {
+            bf_delete(r);
+            throw_bf_exception(ctx, ret);
+            goto exception;
+        }
+        sp[-2] = JS_NewBigFloat(ctx, r);
+    }
+    return 0;
+ exception:
+    sp[-2] = JS_UNDEFINED;
+    sp[-1] = JS_UNDEFINED;
+    return -1;
+}
+
+static no_inline __exception int js_binary_logic_slow(JSContext *ctx,
+                                                      JSValue *sp,
+                                                      OPCodeEnum op)
+{
+    JSValue op1, op2, res;
+    bf_t a_s, b_s, r_s, *r, *a, *b;
+    int ret;
+    uint32_t tag1, tag2;
+    BOOL is_legacy;
+
+    op1 = sp[-2];
+    op2 = sp[-1];
+    tag1 = JS_VALUE_GET_NORM_TAG(op1);
+    tag2 = JS_VALUE_GET_NORM_TAG(op2);
+
+    /* try to call an overloaded operator */
+    if ((tag1 == JS_TAG_OBJECT &&
+         (tag2 != JS_TAG_NULL && tag2 != JS_TAG_UNDEFINED)) ||
+        (tag2 == JS_TAG_OBJECT &&
+         (tag1 != JS_TAG_NULL && tag1 != JS_TAG_UNDEFINED))) {
+        ret = js_call_binary_op_fallback(ctx, &res, op1, op2, op);
+        if (ret != 0) {
+            JS_FreeValue(ctx, op1);
+            JS_FreeValue(ctx, op2);
+            if (ret < 0) {
+                goto exception;
+            } else {
+                sp[-2] = res;
+                return 0;
+            }
+        }
+    }
+
+    op1 = JS_ToNumberHintFree(ctx, op1, TON_FLAG_INTEGER);
+    if (JS_IsException(op1)) {
+        JS_FreeValue(ctx, op2);
+        goto exception;
+    }
+    op2 = JS_ToNumberHintFree(ctx, op2, TON_FLAG_INTEGER);
+    if (JS_IsException(op2)) {
+        JS_FreeValue(ctx, op1);
+        goto exception;
+    }
+
+    is_legacy = is_bignum_mode(ctx) ^ 1;
+    if (is_legacy) {
+        uint32_t v1, v2, r;
+
+        tag1 = JS_VALUE_GET_TAG(op1);
+        tag2 = JS_VALUE_GET_TAG(op2);
+        if (tag1 == JS_TAG_BIG_INT || tag2 == JS_TAG_BIG_INT) {
+            if (tag1 != tag2) {
+                JS_FreeValue(ctx, op1);
+                JS_FreeValue(ctx, op2);
+                JS_ThrowTypeError(ctx, "both operands must be bigint");
+                goto exception;
+            }
+        } else {
+            if (unlikely(JS_ToInt32Free(ctx, (int32_t *)&v1, op1))) {
+                JS_FreeValue(ctx, op2);
+                goto exception;
+            }
+            if (unlikely(JS_ToInt32Free(ctx, (int32_t *)&v2, op2)))
+                goto exception;
+            switch(op) {
+            case OP_shl:
+                r = v1 << (v2 & 0x1f);
+                break;
+            case OP_sar:
+                r = (int)v1 >> (v2 & 0x1f);
+                break;
+            case OP_and:
+                r = v1 & v2;
+                break;
+            case OP_or:
+                r = v1 | v2;
+                break;
+            case OP_xor:
+                r = v1 ^ v2;
+                break;
+            default:
+                abort();
+            }
+            sp[-2] = JS_NewInt32(ctx, r);
+            return 0;
+        }
+    }
+
+    a = JS_ToBigIntFree(ctx, &a_s, op1);
+    b = JS_ToBigIntFree(ctx, &b_s, op2);
+
+    r = &r_s;
+    bf_init(ctx->bf_ctx, r);
+    ret = 0;
+    switch(op) {
+    case OP_shl:
+    case OP_sar:
+        {
+            slimb_t v2;
+#if LIMB_BITS == 32
+            bf_get_int32(&v2, b, 0);
+            if (v2 == INT32_MIN)
+                v2 = INT32_MIN + 1;
+#else
+            bf_get_int64(&v2, b, 0);
+            if (v2 == INT64_MIN)
+                v2 = INT64_MIN + 1;
+#endif
+            if (op == OP_sar)
+                v2 = -v2;
+            bf_set(r, a);
+            ret = bf_mul_2exp(r, v2, BF_PREC_INF, BF_RNDZ);
+            if (v2 < 0) {
+                ret |= bf_rint(r, BF_PREC_INF, BF_RNDD);
+            }
+            ret &= BF_ST_OVERFLOW;
+        }
+        break;
+    case OP_and:
+        bf_logic_and(r, a, b);
+        break;
+    case OP_or:
+        bf_logic_or(r, a, b);
+        break;
+    case OP_xor:
+        bf_logic_xor(r, a, b);
+        break;
+    default:
+        abort();
+    }
+    JS_FreeBigInt(ctx, a, &a_s);
+    JS_FreeBigInt(ctx, b, &b_s);
+    if (unlikely(ret)) {
+        bf_delete(r);
+        throw_bf_exception(ctx, ret);
+        goto exception;
+    }
+    sp[-2] = JS_NewBigInt2(ctx, r, is_legacy);
+    return 0;
+ exception:
+    sp[-2] = JS_UNDEFINED;
+    sp[-1] = JS_UNDEFINED;
+    return -1;
+}
+
+static no_inline int js_relational_slow(JSContext *ctx, JSValue *sp,
+                                        OPCodeEnum op)
+{
+    JSValue op1, op2, ret;
+    int res;
+    uint32_t tag1, tag2;
+
+    op1 = sp[-2];
+    op2 = sp[-1];
+    tag1 = JS_VALUE_GET_NORM_TAG(op1);
+    tag2 = JS_VALUE_GET_NORM_TAG(op2);
+    /* try to call an overloaded operator */
+    if ((tag1 == JS_TAG_OBJECT &&
+         (tag2 != JS_TAG_NULL && tag2 != JS_TAG_UNDEFINED)) ||
+        (tag2 == JS_TAG_OBJECT &&
+         (tag1 != JS_TAG_NULL && tag1 != JS_TAG_UNDEFINED))) {
+        res = js_call_binary_op_fallback(ctx, &ret, op1, op2, op);
+        if (res != 0) {
+            JS_FreeValue(ctx, op1);
+            JS_FreeValue(ctx, op2);
+            if (res < 0) {
+                goto exception;
+            } else {
+                sp[-2] = ret;
+                return 0;
+            }
+        }
+    }
+    op1 = JS_ToPrimitiveFree(ctx, op1, HINT_NUMBER);
+    if (JS_IsException(op1)) {
+        JS_FreeValue(ctx, op2);
+        goto exception;
+    }
+    op2 = JS_ToPrimitiveFree(ctx, op2, HINT_NUMBER);
+    if (JS_IsException(op2)) {
+        JS_FreeValue(ctx, op1);
+        goto exception;
+    }
+    tag1 = JS_VALUE_GET_NORM_TAG(op1);
+    tag2 = JS_VALUE_GET_NORM_TAG(op2);
+
+    if (tag1 == JS_TAG_STRING && tag2 == JS_TAG_STRING) {
+        JSString *p1, *p2;
+        p1 = JS_VALUE_GET_STRING(op1);
+        p2 = JS_VALUE_GET_STRING(op2);
+        res = js_string_compare(ctx, p1, p2);
+        switch(op) {
+        case OP_lt:
+            res = (res < 0);
+            break;
+        case OP_lte:
+            res = (res <= 0);
+            break;
+        case OP_gt:
+            res = (res > 0);
+            break;
+        default:
+        case OP_gte:
+            res = (res >= 0);
+            break;
+        }
+        JS_FreeValue(ctx, op1);
+        JS_FreeValue(ctx, op2);
+    } else if ((tag1 <= JS_TAG_NULL || tag1 == JS_TAG_FLOAT64) &&
+               (tag2 <= JS_TAG_NULL || tag2 == JS_TAG_FLOAT64)) {
+        /* can use floating point comparison */
+        double d1, d2;
+        if (tag1 == JS_TAG_FLOAT64) {
+            d1 = JS_VALUE_GET_FLOAT64(op1);
+        } else {
+            d1 = JS_VALUE_GET_INT(op1);
+        }
+        if (tag2 == JS_TAG_FLOAT64) {
+            d2 = JS_VALUE_GET_FLOAT64(op2);
+        } else {
+            d2 = JS_VALUE_GET_INT(op2);
+        }
+        switch(op) {
+        case OP_lt:
+            res = (d1 < d2); /* if NaN return false */
+            break;
+        case OP_lte:
+            res = (d1 <= d2); /* if NaN return false */
+            break;
+        case OP_gt:
+            res = (d1 > d2); /* if NaN return false */
+            break;
+        default:
+        case OP_gte:
+            res = (d1 >= d2); /* if NaN return false */
+            break;
+        }
+    } else {
+        bf_t a_s, b_s, *a, *b;
+        BOOL is_float;
+
+        if (((tag1 == JS_TAG_BIG_INT && tag2 == JS_TAG_STRING) ||
+             (tag2 == JS_TAG_BIG_INT && tag1 == JS_TAG_STRING)) &&
+            !is_bignum_mode(ctx)) {
+            if (tag1 == JS_TAG_STRING) {
+                op1 = JS_StringToBigInt(ctx, op1);
+                if (JS_VALUE_GET_TAG(op1) != JS_TAG_BIG_INT)
+                    goto invalid_bigint_string;
+            }
+            if (tag2 == JS_TAG_STRING) {
+                op2 = JS_StringToBigInt(ctx, op2);
+                if (JS_VALUE_GET_TAG(op2) != JS_TAG_BIG_INT) {
+                invalid_bigint_string:
+                    JS_FreeValue(ctx, op1);
+                    JS_FreeValue(ctx, op2);
+                    res = FALSE;
+                    goto done;
+                }
+            }
+        } else {
+            op1 = JS_ToNumericFree(ctx, op1);
+            if (JS_IsException(op1)) {
+                JS_FreeValue(ctx, op2);
+                goto exception;
+            }
+            op2 = JS_ToNumericFree(ctx, op2);
+            if (JS_IsException(op2)) {
+                JS_FreeValue(ctx, op1);
+                goto exception;
+            }
+        }
+
+        a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+        b = JS_ToBigFloat(ctx, &is_float, &b_s, op2);
+
+        switch(op) {
+        case OP_lt:
+            res = bf_cmp_lt(a, b); /* if NaN return false */
+            break;
+        case OP_lte:
+            res = bf_cmp_le(a, b); /* if NaN return false */
+            break;
+        case OP_gt:
+            res = bf_cmp_lt(b, a); /* if NaN return false */
+            break;
+        default:
+        case OP_gte:
+            res = bf_cmp_le(b, a); /* if NaN return false */
+            break;
+        }
+        if (a == &a_s)
+            bf_delete(a);
+        if (b == &b_s)
+            bf_delete(b);
+        JS_FreeValue(ctx, op1);
+        JS_FreeValue(ctx, op2);
+    }
+ done:
+    sp[-2] = JS_NewBool(ctx, res);
+    return 0;
+ exception:
+    sp[-2] = JS_UNDEFINED;
+    sp[-1] = JS_UNDEFINED;
+    return -1;
+}
+
+static BOOL tag_is_number(uint32_t tag)
+{
+    return (tag == JS_TAG_INT || tag == JS_TAG_BIG_INT ||
+            tag == JS_TAG_FLOAT64 || tag == JS_TAG_BIG_FLOAT);
+}
+
+static no_inline __exception int js_eq_slow(JSContext *ctx, JSValue *sp,
+                                            BOOL is_neq)
+{
+    JSValue op1, op2, ret;
+    int res;
+    uint32_t tag1, tag2;
+
+    op1 = sp[-2];
+    op2 = sp[-1];
+ redo:
+    tag1 = JS_VALUE_GET_NORM_TAG(op1);
+    tag2 = JS_VALUE_GET_NORM_TAG(op2);
+    if (tag_is_number(tag1) && tag_is_number(tag2)) {
+        if (tag1 == JS_TAG_INT && tag2 == JS_TAG_INT) {
+            res = JS_VALUE_GET_INT(op1) == JS_VALUE_GET_INT(op2);
+        } else if ((tag1 == JS_TAG_FLOAT64 &&
+                    (tag2 == JS_TAG_INT || tag2 == JS_TAG_FLOAT64)) ||
+                   (tag2 == JS_TAG_FLOAT64 &&
+                    (tag1 == JS_TAG_INT || tag1 == JS_TAG_FLOAT64))) {
+            double d1, d2;
+            if (tag1 == JS_TAG_FLOAT64) {
+                d1 = JS_VALUE_GET_FLOAT64(op1);
+            } else {
+                d1 = JS_VALUE_GET_INT(op1);
+            }
+            if (tag2 == JS_TAG_FLOAT64) {
+                d2 = JS_VALUE_GET_FLOAT64(op2);
+            } else {
+                d2 = JS_VALUE_GET_INT(op2);
+            }
+            res = (d1 == d2);
+        } else {
+            bf_t a_s, b_s, *a, *b;
+            BOOL is_float;
+            a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+            b = JS_ToBigFloat(ctx, &is_float, &b_s, op2);
+            res = bf_cmp_eq(a, b);
+            if (a == &a_s)
+                bf_delete(a);
+            if (b == &b_s)
+                bf_delete(b);
+            JS_FreeValue(ctx, op1);
+            JS_FreeValue(ctx, op2);
+        }
+    } else if (tag1 == tag2) {
+        if (tag1 == JS_TAG_OBJECT) {
+            /* try the fallback operator */
+            res = js_call_binary_op_fallback(ctx, &ret, op1, op2,
+                                              is_neq ? OP_neq : OP_eq);
+            if (res != 0) {
+                JS_FreeValue(ctx, op1);
+                JS_FreeValue(ctx, op2);
+                if (res < 0) {
+                    goto exception;
+                } else {
+                    sp[-2] = ret;
+                    return 0;
+                }
+            }
+        }
+        res = js_strict_eq2(ctx, op1, op2, JS_EQ_STRICT);
+    } else if ((tag1 == JS_TAG_NULL && tag2 == JS_TAG_UNDEFINED) ||
+               (tag2 == JS_TAG_NULL && tag1 == JS_TAG_UNDEFINED)) {
+        res = TRUE;
+    } else if ((tag1 == JS_TAG_STRING && tag_is_number(tag2)) ||
+               (tag2 == JS_TAG_STRING && tag_is_number(tag1))) {
+
+        if ((tag1 == JS_TAG_BIG_INT || tag2 == JS_TAG_BIG_INT) &&
+            !is_bignum_mode(ctx)) {
+            if (tag1 == JS_TAG_STRING) {
+                op1 = JS_StringToBigInt(ctx, op1);
+                if (JS_VALUE_GET_TAG(op1) != JS_TAG_BIG_INT)
+                    goto invalid_bigint_string;
+            }
+            if (tag2 == JS_TAG_STRING) {
+                op2 = JS_StringToBigInt(ctx, op2);
+                if (JS_VALUE_GET_TAG(op2) != JS_TAG_BIG_INT) {
+                invalid_bigint_string:
+                    JS_FreeValue(ctx, op1);
+                    JS_FreeValue(ctx, op2);
+                    res = FALSE;
+                    goto done;
+                }
+            }
+        } else {
+            op1 = JS_ToNumericFree(ctx, op1);
+            if (JS_IsException(op1)) {
+                JS_FreeValue(ctx, op2);
+                goto exception;
+            }
+            op2 = JS_ToNumericFree(ctx, op2);
+            if (JS_IsException(op2)) {
+                JS_FreeValue(ctx, op1);
+                goto exception;
+            }
+        }
+        res = js_strict_eq(ctx, op1, op2);
+    } else if (tag1 == JS_TAG_BOOL) {
+        op1 = JS_NewInt32(ctx, JS_VALUE_GET_INT(op1));
+        goto redo;
+    } else if (tag2 == JS_TAG_BOOL) {
+        op2 = JS_NewInt32(ctx, JS_VALUE_GET_INT(op2));
+        goto redo;
+    } else if ((tag1 == JS_TAG_OBJECT &&
+                (tag_is_number(tag2) || tag2 == JS_TAG_STRING || tag2 == JS_TAG_SYMBOL)) ||
+               (tag2 == JS_TAG_OBJECT &&
+                (tag_is_number(tag1) || tag1 == JS_TAG_STRING || tag1 == JS_TAG_SYMBOL))) {
+
+        /* try the fallback operator */
+        res = js_call_binary_op_fallback(ctx, &ret, op1, op2,
+                                          is_neq ? OP_neq : OP_eq);
+        if (res != 0) {
+            JS_FreeValue(ctx, op1);
+            JS_FreeValue(ctx, op2);
+            if (res < 0) {
+                goto exception;
+            } else {
+                sp[-2] = ret;
+                return 0;
+            }
+        }
+
+        op1 = JS_ToPrimitiveFree(ctx, op1, HINT_NONE);
+        if (JS_IsException(op1)) {
+            JS_FreeValue(ctx, op2);
+            goto exception;
+        }
+        op2 = JS_ToPrimitiveFree(ctx, op2, HINT_NONE);
+        if (JS_IsException(op2)) {
+            JS_FreeValue(ctx, op1);
+            goto exception;
+        }
+        goto redo;
+    } else {
+        JS_FreeValue(ctx, op1);
+        JS_FreeValue(ctx, op2);
+        res = FALSE;
+    }
+ done:
+    sp[-2] = JS_NewBool(ctx, res ^ is_neq);
+    return 0;
+ exception:
+    sp[-2] = JS_UNDEFINED;
+    sp[-1] = JS_UNDEFINED;
+    return -1;
+}
+
+static no_inline int js_shr_slow(JSContext *ctx, JSValue *sp)
+{
+    JSValue op1, op2;
+    uint32_t v1, v2, r;
+
+    op1 = sp[-2];
+    op2 = sp[-1];
+    op1 = JS_ToNumericFree(ctx, op1);
+    if (JS_IsException(op1)) {
+        JS_FreeValue(ctx, op2);
+        goto exception;
+    }
+    op2 = JS_ToNumericFree(ctx, op2);
+    if (JS_IsException(op2)) {
+        JS_FreeValue(ctx, op1);
+        goto exception;
+    }
+    /* XXX: could forbid >>> in bignum mode */
+    if (!is_bignum_mode(ctx) &&
+        (JS_VALUE_GET_TAG(op1) == JS_TAG_BIG_INT ||
+         JS_VALUE_GET_TAG(op2) == JS_TAG_BIG_INT)) {
+        JS_ThrowTypeError(ctx, "bigint operands are forbidden for >>>");
+        JS_FreeValue(ctx, op1);
+        JS_FreeValue(ctx, op2);
+        goto exception;
+    }
+    /* cannot give an exception */
+    JS_ToUint32Free(ctx, &v1, op1);
+    JS_ToUint32Free(ctx, &v2, op2);
+    r = v1 >> (v2 & 0x1f);
+    sp[-2] = JS_NewUint32(ctx, r);
+    return 0;
+ exception:
+    sp[-2] = JS_UNDEFINED;
+    sp[-1] = JS_UNDEFINED;
+    return -1;
+}
+
+static double bf_mul_pow10_to_float64(JSContext *ctx, const bf_t *a,
+                                      int64_t exponent)
+{
+    bf_t r_s, *r = &r_s;
+    double d;
+    /* always convert to Float64 */
+    bf_init(ctx->bf_ctx, r);
+    bf_mul_pow_radix(r, a, 10, exponent,
+                     53, bf_set_exp_bits(11) | BF_RNDN | BF_FLAG_SUBNORMAL);
+    bf_get_float64(r, &d, BF_RNDN);
+    bf_delete(r);
+    return d;
+}
+
+static no_inline int js_mul_pow10(JSContext *ctx, JSValue *sp)
+{
+    bf_t a_s, *a, r_s, *r = &r_s;
+    BOOL is_float;
+    JSValue op1, op2;
+    slimb_t e;
+    int ret;
+
+    op1 = sp[-2];
+    op2 = sp[-1];
+    a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+    if (!a)
+        return -1;
+#if LIMB_BITS == 32
+    ret = JS_ToInt32(ctx, &e, op2);
+#else
+    ret = JS_ToInt64(ctx, &e, op2);
+#endif
+    if (ret) {
+        if (a == &a_s)
+            bf_delete(a);
+        return -1;
+    }
+
+    bf_init(ctx->bf_ctx, r);
+    bf_mul_pow_radix(r, a, 10, e, ctx->fp_env.prec, ctx->fp_env.flags);
+    if (a == &a_s)
+        bf_delete(a);
+    JS_FreeValue(ctx, op1);
+    JS_FreeValue(ctx, op2);
+    sp[-2] = JS_NewBigFloat(ctx, r);
+    return 0;
+}
+
+#else /* !CONFIG_BIGNUM */
+
+static no_inline __exception int js_unary_arith_slow(JSContext *ctx,
+                                                     JSValue *sp,
+                                                     OPCodeEnum op)
+{
+    JSValue op1;
+    double d;
+
+    op1 = sp[-1];
+    if (unlikely(JS_ToFloat64Free(ctx, &d, op1))) {
+        sp[-1] = JS_UNDEFINED;
+        return -1;
+    }
+    switch(op) {
+    case OP_inc:
+        d++;
+        break;
+    case OP_dec:
+        d--;
+        break;
+    case OP_plus:
+        break;
+    case OP_neg:
+        d = -d;
+        break;
+    default:
+        abort();
+    }
+    sp[-1] = JS_NewFloat64(ctx, d);
+    return 0;
+}
+
+/* specific case necessary for correct return value semantics */
+static __exception int js_post_inc_slow(JSContext *ctx,
+                                        JSValue *sp, OPCodeEnum op)
+{
+    JSValue op1;
+    double d, r;
+
+    op1 = sp[-1];
+    if (unlikely(JS_ToFloat64Free(ctx, &d, op1))) {
+        sp[-1] = JS_UNDEFINED;
+        return -1;
+    }
+    r = d + 2 * (op - OP_post_dec) - 1;
+    sp[0] = JS_NewFloat64(ctx, r);
+    sp[-1] = JS_NewFloat64(ctx, d);
+    return 0;
+}
+
+static no_inline __exception int js_binary_arith_slow(JSContext *ctx, JSValue *sp,
+                                                      OPCodeEnum op)
+{
+    JSValue op1, op2;
+    double d1, d2, r;
+
+    op1 = sp[-2];
+    op2 = sp[-1];
+    if (unlikely(JS_ToFloat64Free(ctx, &d1, op1))) {
+        JS_FreeValue(ctx, op2);
+        goto exception;
+    }
+    if (unlikely(JS_ToFloat64Free(ctx, &d2, op2))) {
+        goto exception;
+    }
+    switch(op) {
+    case OP_sub:
+        r = d1 - d2;
+        break;
+    case OP_mul:
+        r = d1 * d2;
+        break;
+    case OP_div:
+        r = d1 / d2;
+        break;
+    case OP_mod:
+        r = fmod(d1, d2);
+        break;
+    case OP_pow:
+        r = js_pow(d1, d2);
+        break;
+    default:
+        abort();
+    }
+    sp[-2] = JS_NewFloat64(ctx, r);
+    return 0;
+ exception:
+    sp[-2] = JS_UNDEFINED;
+    sp[-1] = JS_UNDEFINED;
+    return -1;
+}
+
+static no_inline __exception int js_add_slow(JSContext *ctx, JSValue *sp)
+{
+    JSValue op1, op2;
+    uint32_t tag1, tag2;
+
+    op1 = sp[-2];
+    op2 = sp[-1];
+    tag1 = JS_VALUE_GET_TAG(op1);
+    tag2 = JS_VALUE_GET_TAG(op2);
+    if ((tag1 == JS_TAG_INT || JS_TAG_IS_FLOAT64(tag1)) &&
+        (tag2 == JS_TAG_INT || JS_TAG_IS_FLOAT64(tag2))) {
+        goto add_numbers;
+    } else {
+        op1 = JS_ToPrimitiveFree(ctx, op1, HINT_NONE);
+        if (JS_IsException(op1)) {
+            JS_FreeValue(ctx, op2);
+            goto exception;
+        }
+        op2 = JS_ToPrimitiveFree(ctx, op2, HINT_NONE);
+        if (JS_IsException(op2)) {
+            JS_FreeValue(ctx, op1);
+            goto exception;
+        }
+        tag1 = JS_VALUE_GET_TAG(op1);
+        tag2 = JS_VALUE_GET_TAG(op2);
+        if (tag1 == JS_TAG_STRING || tag2 == JS_TAG_STRING) {
+            sp[-2] = JS_ConcatString(ctx, op1, op2);
+            if (JS_IsException(sp[-2]))
+                goto exception;
+        } else {
+            double d1, d2;
+        add_numbers:
+            if (JS_ToFloat64Free(ctx, &d1, op1)) {
+                JS_FreeValue(ctx, op2);
+                goto exception;
+            }
+            if (JS_ToFloat64Free(ctx, &d2, op2))
+                goto exception;
+            sp[-2] = JS_NewFloat64(ctx, d1 + d2);
+        }
+    }
+    return 0;
+ exception:
+    sp[-2] = JS_UNDEFINED;
+    sp[-1] = JS_UNDEFINED;
+    return -1;
+}
+
+static no_inline __exception int js_binary_logic_slow(JSContext *ctx,
+                                                      JSValue *sp,
+                                                      OPCodeEnum op)
+{
+    JSValue op1, op2;
+    uint32_t v1, v2, r;
+
+    op1 = sp[-2];
+    op2 = sp[-1];
+    if (unlikely(JS_ToInt32Free(ctx, (int32_t *)&v1, op1))) {
+        JS_FreeValue(ctx, op2);
+        goto exception;
+    }
+    if (unlikely(JS_ToInt32Free(ctx, (int32_t *)&v2, op2)))
+        goto exception;
+    switch(op) {
+    case OP_shl:
+        r = v1 << (v2 & 0x1f);
+        break;
+    case OP_sar:
+        r = (int)v1 >> (v2 & 0x1f);
+        break;
+    case OP_and:
+        r = v1 & v2;
+        break;
+    case OP_or:
+        r = v1 | v2;
+        break;
+    case OP_xor:
+        r = v1 ^ v2;
+        break;
+    default:
+        abort();
+    }
+    sp[-2] = JS_NewInt32(ctx, r);
+    return 0;
+ exception:
+    sp[-2] = JS_UNDEFINED;
+    sp[-1] = JS_UNDEFINED;
+    return -1;
+}
+
+static no_inline int js_not_slow(JSContext *ctx, JSValue *sp)
+{
+    int32_t v1;
+
+    if (unlikely(JS_ToInt32Free(ctx, &v1, sp[-1]))) {
+        sp[-1] = JS_UNDEFINED;
+        return -1;
+    }
+    sp[-1] = JS_NewInt32(ctx, ~v1);
+    return 0;
+}
+
+static no_inline int js_relational_slow(JSContext *ctx, JSValue *sp,
+                                        OPCodeEnum op)
+{
+    JSValue op1, op2;
+    int res;
+
+    op1 = sp[-2];
+    op2 = sp[-1];
+    op1 = JS_ToPrimitiveFree(ctx, op1, HINT_NUMBER);
+    if (JS_IsException(op1)) {
+        JS_FreeValue(ctx, op2);
+        goto exception;
+    }
+    op2 = JS_ToPrimitiveFree(ctx, op2, HINT_NUMBER);
+    if (JS_IsException(op2)) {
+        JS_FreeValue(ctx, op1);
+        goto exception;
+    }
+    if (JS_VALUE_GET_TAG(op1) == JS_TAG_STRING &&
+        JS_VALUE_GET_TAG(op2) == JS_TAG_STRING) {
+        JSString *p1, *p2;
+        p1 = JS_VALUE_GET_STRING(op1);
+        p2 = JS_VALUE_GET_STRING(op2);
+        res = js_string_compare(ctx, p1, p2);
+        JS_FreeValue(ctx, op1);
+        JS_FreeValue(ctx, op2);
+        switch(op) {
+        case OP_lt:
+            res = (res < 0);
+            break;
+        case OP_lte:
+            res = (res <= 0);
+            break;
+        case OP_gt:
+            res = (res > 0);
+            break;
+        default:
+        case OP_gte:
+            res = (res >= 0);
+            break;
+        }
+    } else {
+        double d1, d2;
+        if (JS_ToFloat64Free(ctx, &d1, op1)) {
+            JS_FreeValue(ctx, op2);
+            goto exception;
+        }
+        if (JS_ToFloat64Free(ctx, &d2, op2))
+            goto exception;
+        switch(op) {
+        case OP_lt:
+            res = (d1 < d2); /* if NaN return false */
+            break;
+        case OP_lte:
+            res = (d1 <= d2); /* if NaN return false */
+            break;
+        case OP_gt:
+            res = (d1 > d2); /* if NaN return false */
+            break;
+        default:
+        case OP_gte:
+            res = (d1 >= d2); /* if NaN return false */
+            break;
+        }
+    }
+    sp[-2] = JS_NewBool(ctx, res);
+    return 0;
+ exception:
+    sp[-2] = JS_UNDEFINED;
+    sp[-1] = JS_UNDEFINED;
+    return -1;
+}
+
+static no_inline __exception int js_eq_slow(JSContext *ctx, JSValue *sp,
+                                            BOOL is_neq)
+{
+    JSValue op1, op2;
+    int tag1, tag2;
+    BOOL res;
+
+    op1 = sp[-2];
+    op2 = sp[-1];
+ redo:
+    tag1 = JS_VALUE_GET_NORM_TAG(op1);
+    tag2 = JS_VALUE_GET_NORM_TAG(op2);
+    if (tag1 == tag2 ||
+        (tag1 == JS_TAG_INT && tag2 == JS_TAG_FLOAT64) ||
+        (tag2 == JS_TAG_INT && tag1 == JS_TAG_FLOAT64)) {
+        res = js_strict_eq(ctx, op1, op2);
+    } else if ((tag1 == JS_TAG_NULL && tag2 == JS_TAG_UNDEFINED) ||
+               (tag2 == JS_TAG_NULL && tag1 == JS_TAG_UNDEFINED)) {
+        res = TRUE;
+    } else if ((tag1 == JS_TAG_STRING && (tag2 == JS_TAG_INT ||
+                                   tag2 == JS_TAG_FLOAT64)) ||
+        (tag2 == JS_TAG_STRING && (tag1 == JS_TAG_INT ||
+                                   tag1 == JS_TAG_FLOAT64))) {
+        double d1;
+        double d2;
+        if (JS_ToFloat64Free(ctx, &d1, op1)) {
+            JS_FreeValue(ctx, op2);
+            goto exception;
+        }
+        if (JS_ToFloat64Free(ctx, &d2, op2))
+            goto exception;
+        res = (d1 == d2);
+    } else if (tag1 == JS_TAG_BOOL) {
+        op1 = JS_NewInt32(ctx, JS_VALUE_GET_INT(op1));
+        goto redo;
+    } else if (tag2 == JS_TAG_BOOL) {
+        op2 = JS_NewInt32(ctx, JS_VALUE_GET_INT(op2));
+        goto redo;
+    } else if (tag1 == JS_TAG_OBJECT &&
+               (tag2 == JS_TAG_INT || tag2 == JS_TAG_FLOAT64 || tag2 == JS_TAG_STRING || tag2 == JS_TAG_SYMBOL)) {
+        op1 = JS_ToPrimitiveFree(ctx, op1, HINT_NONE);
+        if (JS_IsException(op1)) {
+            JS_FreeValue(ctx, op2);
+            goto exception;
+        }
+        goto redo;
+    } else if (tag2 == JS_TAG_OBJECT &&
+               (tag1 == JS_TAG_INT || tag1 == JS_TAG_FLOAT64 || tag1 == JS_TAG_STRING || tag1 == JS_TAG_SYMBOL)) {
+        op2 = JS_ToPrimitiveFree(ctx, op2, HINT_NONE);
+        if (JS_IsException(op2)) {
+            JS_FreeValue(ctx, op1);
+            goto exception;
+        }
+        goto redo;
+    } else {
+        JS_FreeValue(ctx, op1);
+        JS_FreeValue(ctx, op2);
+        res = FALSE;
+    }
+    sp[-2] = JS_NewBool(ctx, res ^ is_neq);
+    return 0;
+ exception:
+    sp[-2] = JS_UNDEFINED;
+    sp[-1] = JS_UNDEFINED;
+    return -1;
+}
+
+static no_inline int js_shr_slow(JSContext *ctx, JSValue *sp)
+{
+    JSValue op1, op2;
+    uint32_t v1, v2, r;
+
+    op1 = sp[-2];
+    op2 = sp[-1];
+    if (unlikely(JS_ToUint32Free(ctx, &v1, op1))) {
+        JS_FreeValue(ctx, op2);
+        goto exception;
+    }
+    if (unlikely(JS_ToUint32Free(ctx, &v2, op2)))
+        goto exception;
+    r = v1 >> (v2 & 0x1f);
+    sp[-2] = JS_NewUint32(ctx, r);
+    return 0;
+ exception:
+    sp[-2] = JS_UNDEFINED;
+    sp[-1] = JS_UNDEFINED;
+    return -1;
+}
+
+#endif /* !CONFIG_BIGNUM */
+
+/* XXX: Should take JSValueConst arguments */
+static BOOL js_strict_eq2(JSContext *ctx, JSValue op1, JSValue op2,
+                          JSStrictEqModeEnum eq_mode)
+{
+    BOOL res;
+    int tag1, tag2;
+    double d1, d2;
+
+    tag1 = JS_VALUE_GET_NORM_TAG(op1);
+    tag2 = JS_VALUE_GET_NORM_TAG(op2);
+    switch(tag1) {
+    case JS_TAG_BOOL:
+        if (tag1 != tag2) {
+            res = FALSE;
+        } else {
+            res = JS_VALUE_GET_INT(op1) == JS_VALUE_GET_INT(op2);
+            goto done_no_free;
+        }
+        break;
+    case JS_TAG_NULL:
+    case JS_TAG_UNDEFINED:
+        res = (tag1 == tag2);
+        break;
+    case JS_TAG_STRING:
+        {
+            JSString *p1, *p2;
+            if (tag1 != tag2) {
+                res = FALSE;
+            } else {
+                p1 = JS_VALUE_GET_STRING(op1);
+                p2 = JS_VALUE_GET_STRING(op2);
+                res = (js_string_compare(ctx, p1, p2) == 0);
+            }
+        }
+        break;
+    case JS_TAG_SYMBOL:
+        {
+            JSAtomStruct *p1, *p2;
+            if (tag1 != tag2) {
+                res = FALSE;
+            } else {
+                p1 = JS_VALUE_GET_PTR(op1);
+                p2 = JS_VALUE_GET_PTR(op2);
+                res = (p1 == p2);
+            }
+        }
+        break;
+    case JS_TAG_OBJECT:
+        if (tag1 != tag2)
+            res = FALSE;
+        else
+            res = JS_VALUE_GET_OBJ(op1) == JS_VALUE_GET_OBJ(op2);
+        break;
+    case JS_TAG_INT:
+        d1 = JS_VALUE_GET_INT(op1);
+        if (tag2 == JS_TAG_INT) {
+            d2 = JS_VALUE_GET_INT(op2);
+            goto number_test;
+        } else if (tag2 == JS_TAG_FLOAT64) {
+#ifdef CONFIG_BIGNUM
+            if (is_bignum_mode(ctx)) {
+                res = FALSE;
+            } else
+#endif
+            {
+                d2 = JS_VALUE_GET_FLOAT64(op2);
+                goto number_test;
+            }
+        } else
+#ifdef CONFIG_BIGNUM
+        if (tag2 == JS_TAG_BIG_INT && is_bignum_mode(ctx)) {
+            goto bigint_test;
+        } else
+#endif
+        {
+            res = FALSE;
+        }
+        break;
+    case JS_TAG_FLOAT64:
+        d1 = JS_VALUE_GET_FLOAT64(op1);
+        if (tag2 == JS_TAG_FLOAT64) {
+            d2 = JS_VALUE_GET_FLOAT64(op2);
+        } else if (tag2 == JS_TAG_INT
+#ifdef CONFIG_BIGNUM
+                   && !is_bignum_mode(ctx)
+#endif
+                   ) {
+            d2 = JS_VALUE_GET_INT(op2);
+        } else {
+            res = FALSE;
+            break;
+        }
+    number_test:
+        if (unlikely(eq_mode >= JS_EQ_SAME_VALUE)) {
+            JSFloat64Union u1, u2;
+            /* NaN is not always normalized, so this test is necessary */
+            if (isnan(d1) || isnan(d2)) {
+                res = isnan(d1) == isnan(d2);
+            } else if (eq_mode == JS_EQ_SAME_VALUE_ZERO) {
+                res = (d1 == d2); /* +0 == -0 */
+            } else {
+                u1.d = d1;
+                u2.d = d2;
+                res = (u1.u64 == u2.u64); /* +0 != -0 */
+            }
+        } else {
+            res = (d1 == d2); /* if NaN return false and +0 == -0 */
+        }
+        goto done_no_free;
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_INT:
+        {
+            bf_t a_s, *a, b_s, *b;
+            BOOL is_float;
+            if (tag1 == tag2) {
+                /* OK */
+            } else if (tag2 == JS_TAG_INT && is_bignum_mode(ctx)) {
+                /* OK */
+            } else {
+                res = FALSE;
+                break;
+            }
+        bigint_test:
+            a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+            b = JS_ToBigFloat(ctx, &is_float, &b_s, op2);
+            res = bf_cmp_eq(a, b);
+            if (a == &a_s)
+                bf_delete(a);
+            if (b == &b_s)
+                bf_delete(a);
+        }
+        break;
+    case JS_TAG_BIG_FLOAT:
+        {
+            JSBigFloat *p1, *p2;
+            const bf_t *a, *b;
+            if (tag1 != tag2) {
+                res = FALSE;
+                break;
+            }
+            p1 = JS_VALUE_GET_PTR(op1);
+            p2 = JS_VALUE_GET_PTR(op2);
+            a = &p1->num;
+            b = &p2->num;
+            if (unlikely(eq_mode >= JS_EQ_SAME_VALUE)) {
+                if (eq_mode == JS_EQ_SAME_VALUE_ZERO &&
+                           a->expn == BF_EXP_ZERO && b->expn == BF_EXP_ZERO) {
+                    res = TRUE;
+                } else {
+                    res = (bf_cmp_full(a, b) == 0);
+                }
+            } else {
+                res = bf_cmp_eq(a, b);
+            }
+        }
+        break;
+#endif
+    default:
+        res = FALSE;
+        break;
+    }
+    JS_FreeValue(ctx, op1);
+    JS_FreeValue(ctx, op2);
+ done_no_free:
+    return res;
+}
+
+static BOOL js_strict_eq(JSContext *ctx, JSValue op1, JSValue op2)
+{
+    return js_strict_eq2(ctx, op1, op2, JS_EQ_STRICT);
+}
+
+static BOOL js_same_value(JSContext *ctx, JSValueConst op1, JSValueConst op2)
+{
+    return js_strict_eq2(ctx,
+                         JS_DupValue(ctx, op1), JS_DupValue(ctx, op2),
+                         JS_EQ_SAME_VALUE);
+}
+
+static BOOL js_same_value_zero(JSContext *ctx, JSValueConst op1, JSValueConst op2)
+{
+    return js_strict_eq2(ctx,
+                         JS_DupValue(ctx, op1), JS_DupValue(ctx, op2),
+                         JS_EQ_SAME_VALUE_ZERO);
+}
+
+static no_inline int js_strict_eq_slow(JSContext *ctx, JSValue *sp,
+                                       BOOL is_neq)
+{
+    BOOL res;
+    res = js_strict_eq(ctx, sp[-2], sp[-1]);
+    sp[-2] = JS_NewBool(ctx, res ^ is_neq);
+    return 0;
+}
+
+static __exception int js_operator_in(JSContext *ctx, JSValue *sp)
+{
+    JSValue op1, op2;
+    JSAtom atom;
+    int ret;
+
+    op1 = sp[-2];
+    op2 = sp[-1];
+
+    if (JS_VALUE_GET_TAG(op2) != JS_TAG_OBJECT) {
+        JS_ThrowTypeError(ctx, "invalid 'in' operand");
+        return -1;
+    }
+    atom = js_value_to_atom(ctx, op1);
+    if (unlikely(atom == JS_ATOM_NULL))
+        return -1;
+    ret = JS_HasProperty(ctx, op2, atom);
+    JS_FreeAtom(ctx, atom);
+    if (ret < 0)
+        return -1;
+    JS_FreeValue(ctx, op1);
+    JS_FreeValue(ctx, op2);
+    sp[-2] = JS_NewBool(ctx, ret);
+    return 0;
+}
+
+static __exception int js_has_unscopable(JSContext *ctx, JSValueConst obj,
+                                         JSAtom atom)
+{
+    JSValue arr, val;
+    int ret;
+
+    arr = JS_GetProperty(ctx, obj, JS_ATOM_Symbol_unscopables);
+    if (JS_IsException(arr))
+        return -1;
+    ret = 0;
+    if (JS_IsObject(arr)) {
+        val = JS_GetProperty(ctx, arr, atom);
+        ret = JS_ToBoolFree(ctx, val);
+    }
+    JS_FreeValue(ctx, arr);
+    return ret;
+}
+
+static __exception int js_operator_instanceof(JSContext *ctx, JSValue *sp)
+{
+    JSValue op1, op2;
+    BOOL ret;
+
+    op1 = sp[-2];
+    op2 = sp[-1];
+    ret = JS_IsInstanceOf(ctx, op1, op2);
+    if (ret < 0)
+        return ret;
+    JS_FreeValue(ctx, op1);
+    JS_FreeValue(ctx, op2);
+    sp[-2] = JS_NewBool(ctx, ret);
+    return 0;
+}
+
+static __exception int js_operator_typeof(JSContext *ctx, JSValue op1)
+{
+    JSAtom atom;
+    uint32_t tag;
+
+    tag = JS_VALUE_GET_NORM_TAG(op1);
+    switch(tag) {
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_INT:
+        if (is_bignum_mode(ctx))
+            atom = JS_ATOM_bigint;
+        else
+            atom = JS_ATOM_number;
+        break;
+    case JS_TAG_BIG_INT:
+        atom = JS_ATOM_bigint;
+        break;
+    case JS_TAG_FLOAT64:
+        atom = JS_ATOM_number;
+        break;
+    case JS_TAG_BIG_FLOAT:
+        atom = JS_ATOM_bigfloat;
+        break;
+#else
+    case JS_TAG_INT:
+    case JS_TAG_FLOAT64:
+        atom = JS_ATOM_number;
+        break;
+#endif
+    case JS_TAG_UNDEFINED:
+        atom = JS_ATOM_undefined;
+        break;
+    case JS_TAG_BOOL:
+        atom = JS_ATOM_boolean;
+        break;
+    case JS_TAG_STRING:
+        atom = JS_ATOM_string;
+        break;
+    case JS_TAG_OBJECT:
+        if (JS_IsFunction(ctx, op1))
+            atom = JS_ATOM_function;
+        else
+            goto obj_type;
+        break;
+    case JS_TAG_NULL:
+    obj_type:
+        atom = JS_ATOM_object;
+        break;
+    case JS_TAG_SYMBOL:
+        atom = JS_ATOM_symbol;
+        break;
+    default:
+        atom = JS_ATOM_unknown;
+        break;
+    }
+    return atom;
+}
+
+static __exception int js_operator_delete(JSContext *ctx, JSValue *sp)
+{
+    JSValue op1, op2;
+    JSAtom atom;
+    int ret;
+
+    op1 = sp[-2];
+    op2 = sp[-1];
+    atom = js_value_to_atom(ctx, op2);
+    if (unlikely(atom == JS_ATOM_NULL))
+        return -1;
+    ret = JS_DeleteProperty(ctx, op1, atom, JS_PROP_THROW_STRICT);
+    JS_FreeAtom(ctx, atom);
+    if (unlikely(ret < 0))
+        return -1;
+    JS_FreeValue(ctx, op1);
+    JS_FreeValue(ctx, op2);
+    sp[-2] = JS_NewBool(ctx, ret);
+    return 0;
+}
+
+static JSValue js_throw_type_error(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv)
+{
+    return JS_ThrowTypeError(ctx, "invalid property access");
+}
+
+/* XXX: not 100% compatible, but mozilla seems to use a similar
+   implementation to ensure that caller in non strict mode does not
+   throw (ES5 compatibility) */
+static JSValue js_function_proto_caller(JSContext *ctx, JSValueConst this_val,
+                                        int argc, JSValueConst *argv)
+{
+    JSFunctionBytecode *b = JS_GetFunctionBytecode(this_val);
+    if (!b || (b->js_mode & JS_MODE_STRICT) || !b->has_prototype) {
+        return js_throw_type_error(ctx, this_val, 0, NULL);
+    }
+    return JS_UNDEFINED;
+}
+
+static JSValue js_function_proto_fileName(JSContext *ctx,
+                                          JSValueConst this_val)
+{
+    JSFunctionBytecode *b = JS_GetFunctionBytecode(this_val);
+    if (b && b->has_debug) {
+        return JS_AtomToString(ctx, b->debug.filename);
+    }
+    return JS_UNDEFINED;
+}
+
+static JSValue js_function_proto_lineNumber(JSContext *ctx,
+                                            JSValueConst this_val)
+{
+    JSFunctionBytecode *b = JS_GetFunctionBytecode(this_val);
+    if (b && b->has_debug) {
+        return JS_NewInt32(ctx, b->debug.line_num);
+    }
+    return JS_UNDEFINED;
+}
+
+static int js_arguments_define_own_property(JSContext *ctx,
+                                            JSValueConst this_obj,
+                                            JSAtom prop, JSValueConst val,
+                                            JSValueConst getter, JSValueConst setter, int flags)
+{
+    JSObject *p;
+    uint32_t idx;
+    p = JS_VALUE_GET_OBJ(this_obj);
+    /* convert to normal array when redefining an existing numeric field */
+    if (p->fast_array && JS_AtomGetUint32(ctx, &idx, prop) &&
+        idx < p->u.array.count) {
+        if (convert_fast_array_to_array(ctx, p))
+            return -1;
+    }
+    /* run the default define own property */
+    return JS_DefineProperty(ctx, this_obj, prop, val, getter, setter,
+                             flags | JS_PROP_NO_EXOTIC);
+}
+
+static const JSClassExoticMethods js_arguments_exotic_methods = {
+    .define_own_property = js_arguments_define_own_property,
+};
+
+static JSValue js_build_arguments(JSContext *ctx, int argc, JSValueConst *argv)
+{
+    JSValue val, *tab;
+    JSProperty *pr;
+    JSObject *p;
+    int i;
+
+    val = JS_NewObjectProtoClass(ctx, ctx->class_proto[JS_CLASS_OBJECT],
+                                 JS_CLASS_ARGUMENTS);
+    if (JS_IsException(val))
+        return val;
+    p = JS_VALUE_GET_OBJ(val);
+
+    /* add the length field (cannot fail) */
+    pr = add_property(ctx, p, JS_ATOM_length,
+                      JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+    pr->u.value = JS_NewInt32(ctx, argc);
+
+    /* initialize the fast array part */
+    tab = NULL;
+    if (argc > 0) {
+        tab = js_malloc(ctx, sizeof(tab[0]) * argc);
+        if (!tab) {
+            JS_FreeValue(ctx, val);
+            return JS_EXCEPTION;
+        }
+        for(i = 0; i < argc; i++) {
+            tab[i] = JS_DupValue(ctx, argv[i]);
+        }
+    }
+    p->u.array.u.values = tab;
+    p->u.array.count = argc;
+
+    JS_DefinePropertyValue(ctx, val, JS_ATOM_Symbol_iterator,
+                           JS_DupValue(ctx, ctx->array_proto_values),
+                           JS_PROP_CONFIGURABLE | JS_PROP_WRITABLE);
+    /* add callee property to throw a TypeError in strict mode */
+    JS_DefineProperty(ctx, val, JS_ATOM_callee, JS_UNDEFINED,
+                      ctx->throw_type_error, ctx->throw_type_error,
+                      JS_PROP_HAS_GET | JS_PROP_HAS_SET);
+    return val;
+}
+
+#define GLOBAL_VAR_OFFSET 0x40000000
+#define ARGUMENT_VAR_OFFSET 0x20000000
+
+/* legacy arguments object: add references to the function arguments */
+static JSValue js_build_mapped_arguments(JSContext *ctx, int argc,
+                                         JSValueConst *argv,
+                                         JSStackFrame *sf, int arg_count)
+{
+    JSValue val;
+    JSProperty *pr;
+    JSObject *p;
+    int i;
+
+    val = JS_NewObjectProtoClass(ctx, ctx->class_proto[JS_CLASS_OBJECT],
+                                 JS_CLASS_MAPPED_ARGUMENTS);
+    if (JS_IsException(val))
+        return val;
+    p = JS_VALUE_GET_OBJ(val);
+
+    /* add the length field (cannot fail) */
+    pr = add_property(ctx, p, JS_ATOM_length,
+                      JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+    pr->u.value = JS_NewInt32(ctx, argc);
+
+    for(i = 0; i < arg_count; i++) {
+        JSVarRef *var_ref;
+        var_ref = get_var_ref(ctx, sf, i, TRUE);
+        if (!var_ref)
+            goto fail;
+        pr = add_property(ctx, p, __JS_AtomFromUInt32(i), JS_PROP_C_W_E | JS_PROP_VARREF);
+        if (!pr) {
+            free_var_ref(ctx->rt, var_ref);
+            goto fail;
+        }
+        pr->u.var_ref = var_ref;
+    }
+
+    /* the arguments not mapped to the arguments of the function can
+       be normal properties */
+    for(i = arg_count; i < argc; i++) {
+        if (JS_DefinePropertyValueUint32(ctx, val, i,
+                                         JS_DupValue(ctx, argv[i]),
+                                         JS_PROP_C_W_E) < 0)
+            goto fail;
+    }
+
+    JS_DefinePropertyValue(ctx, val, JS_ATOM_Symbol_iterator,
+                           JS_DupValue(ctx, ctx->array_proto_values),
+                           JS_PROP_CONFIGURABLE | JS_PROP_WRITABLE);
+    /* callee returns this function in non strict mode */
+    JS_DefinePropertyValue(ctx, val, JS_ATOM_callee,
+                           JS_DupValue(ctx, ctx->current_stack_frame->cur_func),
+                           JS_PROP_CONFIGURABLE | JS_PROP_WRITABLE);
+    return val;
+ fail:
+    JS_FreeValue(ctx, val);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_build_rest(JSContext *ctx, int first, int argc, JSValueConst *argv)
+{
+    JSValue val;
+    int i, ret;
+
+    val = JS_NewArray(ctx);
+    if (JS_IsException(val))
+        return val;
+    for (i = first; i < argc; i++) {
+        ret = JS_DefinePropertyValueUint32(ctx, val, i - first,
+                                           JS_DupValue(ctx, argv[i]),
+                                           JS_PROP_C_W_E);
+        if (ret < 0) {
+            JS_FreeValue(ctx, val);
+            return JS_EXCEPTION;
+        }
+    }
+    return val;
+}
+
+static JSValue build_for_in_iterator(JSContext *ctx, JSValue obj)
+{
+    JSObject *p, *p1;
+    JSPropertyEnum *tab_atom;
+    int i;
+    JSValue enum_obj;
+    JSForInIterator *it;
+    uint32_t tag, tab_atom_count;
+
+    tag = JS_VALUE_GET_TAG(obj);
+    if (tag != JS_TAG_OBJECT && tag != JS_TAG_NULL && tag != JS_TAG_UNDEFINED) {
+        obj = JS_ToObjectFree(ctx, obj);
+    }
+
+    it = js_malloc(ctx, sizeof(*it));
+    if (!it) {
+        JS_FreeValue(ctx, obj);
+        return JS_EXCEPTION;
+    }
+    enum_obj = JS_NewObjectProtoClass(ctx, JS_NULL, JS_CLASS_FOR_IN_ITERATOR);
+    if (JS_IsException(enum_obj)) {
+        js_free(ctx, it);
+        JS_FreeValue(ctx, obj);
+        return JS_EXCEPTION;
+    }
+    it->is_array = FALSE;
+    it->obj = obj;
+    it->idx = 0;
+    p = JS_VALUE_GET_OBJ(enum_obj);
+    p->u.for_in_iterator = it;
+
+    if (tag == JS_TAG_NULL || tag == JS_TAG_UNDEFINED)
+        return enum_obj;
+
+    p = JS_VALUE_GET_OBJ(obj);
+
+    /* fast path: assume no enumerable properties in the prototype chain */
+    p1 = p->shape->proto;
+    while (p1 != NULL) {
+        if (JS_GetOwnPropertyNames(ctx, &tab_atom, &tab_atom_count, p1,
+                                   JS_GPN_STRING_MASK | JS_GPN_ENUM_ONLY))
+            goto fail;
+        js_free_prop_enum(ctx, tab_atom, tab_atom_count);
+        if (tab_atom_count != 0) {
+            goto slow_path;
+        }
+        p1 = p1->shape->proto;
+    }
+    if (p->fast_array) {
+        JSShape *sh;
+        JSShapeProperty *prs;
+        /* check that there are no enumerable normal fields */
+        sh = p->shape;
+        for(i = 0, prs = get_shape_prop(sh); i < sh->prop_count; i++, prs++) {
+            if (prs->flags & JS_PROP_ENUMERABLE)
+                goto normal_case;
+        }
+        /* the implicit GetOwnProperty raises an exception if the
+           typed array is detached */
+        if ((p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+             p->class_id <= JS_CLASS_FLOAT64_ARRAY) &&
+            typed_array_is_detached(ctx, p) &&
+            typed_array_get_length(ctx, p) != 0) {
+            JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+            goto fail;
+        }
+        /* for fast arrays, we only store the number of elements */
+        it->is_array = TRUE;
+        it->array_length = p->u.array.count;
+    } else {
+    normal_case:
+        if (JS_GetOwnPropertyNames(ctx, &tab_atom, &tab_atom_count, p,
+                                   JS_GPN_STRING_MASK | JS_GPN_ENUM_ONLY))
+            goto fail;
+        for(i = 0; i < tab_atom_count; i++) {
+            JS_SetPropertyInternal(ctx, enum_obj, tab_atom[i].atom, JS_NULL, 0);
+        }
+        js_free_prop_enum(ctx, tab_atom, tab_atom_count);
+    }
+    return enum_obj;
+
+ slow_path:
+    /* non enumerable properties hide the enumerables ones in the
+       prototype chain */
+    while (p != NULL) {
+        if (JS_GetOwnPropertyNames(ctx, &tab_atom, &tab_atom_count, p,
+                                   JS_GPN_STRING_MASK | JS_GPN_SET_ENUM))
+            goto fail;
+        for(i = 0; i < tab_atom_count; i++) {
+            JS_DefinePropertyValue(ctx, enum_obj, tab_atom[i].atom, JS_NULL,
+                                   (tab_atom[i].is_enumerable ?
+                                    JS_PROP_ENUMERABLE : 0));
+        }
+        js_free_prop_enum(ctx, tab_atom, tab_atom_count);
+        p = p->shape->proto;
+    }
+    return enum_obj;
+
+ fail:
+    JS_FreeValue(ctx, enum_obj);
+    return JS_EXCEPTION;
+}
+
+/* obj -> enum_obj */
+static __exception int js_for_in_start(JSContext *ctx, JSValue *sp)
+{
+    sp[-1] = build_for_in_iterator(ctx, sp[-1]);
+    if (JS_IsException(sp[-1]))
+        return -1;
+    return 0;
+}
+
+/* enum_obj -> enum_obj value done */
+static __exception int js_for_in_next(JSContext *ctx, JSValue *sp)
+{
+    JSValueConst enum_obj;
+    JSObject *p;
+    JSAtom prop;
+    JSForInIterator *it;
+    int ret;
+
+    enum_obj = sp[-1];
+    /* fail safe */
+    if (JS_VALUE_GET_TAG(enum_obj) != JS_TAG_OBJECT)
+        goto done;
+    p = JS_VALUE_GET_OBJ(enum_obj);
+    if (p->class_id != JS_CLASS_FOR_IN_ITERATOR)
+        goto done;
+    it = p->u.for_in_iterator;
+
+    for(;;) {
+        if (it->is_array) {
+            if (it->idx >= it->array_length)
+                goto done;
+            prop = __JS_AtomFromUInt32(it->idx);
+            it->idx++;
+        } else {
+            JSShape *sh = p->shape;
+            JSShapeProperty *prs;
+            if (it->idx >= sh->prop_count)
+                goto done;
+            prs = get_shape_prop(sh) + it->idx;
+            prop = prs->atom;
+            it->idx++;
+            if (prop == JS_ATOM_NULL || !(prs->flags & JS_PROP_ENUMERABLE))
+                continue;
+        }
+        /* check if the property was deleted */
+        ret = JS_HasProperty(ctx, it->obj, prop);
+        if (ret < 0)
+            return ret;
+        if (ret)
+            break;
+    }
+    /* return the property */
+    sp[0] = JS_AtomToValue(ctx, prop);
+    sp[1] = JS_FALSE;
+    return 0;
+ done:
+    /* return the end */
+    sp[0] = JS_UNDEFINED;
+    sp[1] = JS_TRUE;
+    return 0;
+}
+
+static JSValue JS_GetIterator2(JSContext *ctx, JSValueConst obj,
+                               JSValueConst method)
+{
+    JSValue enum_obj;
+
+    enum_obj = JS_Call(ctx, method, obj, 0, NULL);
+    if (JS_IsException(enum_obj))
+        return enum_obj;
+    if (!JS_IsObject(enum_obj)) {
+        JS_FreeValue(ctx, enum_obj);
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+    }
+    return enum_obj;
+}
+
+JSValue JS_GetIterator(JSContext *ctx, JSValueConst obj, BOOL is_async)
+{
+    JSValue method, ret, sync_iter;
+
+    if (is_async) {
+        method = JS_GetProperty(ctx, obj, JS_ATOM_Symbol_asyncIterator);
+        if (JS_IsException(method))
+            return method;
+        if (JS_IsUndefined(method) || JS_IsNull(method)) {
+            method = JS_GetProperty(ctx, obj, JS_ATOM_Symbol_iterator);
+            if (JS_IsException(method))
+                return method;
+            sync_iter = JS_GetIterator2(ctx, obj, method);
+            JS_FreeValue(ctx, method);
+            if (JS_IsException(sync_iter))
+                return sync_iter;
+            ret = JS_CreateAsyncFromSyncIterator(ctx, sync_iter);
+            JS_FreeValue(ctx, sync_iter);
+            return ret;
+        }
+    } else {
+        method = JS_GetProperty(ctx, obj, JS_ATOM_Symbol_iterator);
+        if (JS_IsException(method))
+            return method;
+    }
+    if (!JS_IsFunction(ctx, method)) {
+        JS_FreeValue(ctx, method);
+        return JS_ThrowTypeError(ctx, "value is not iterable");
+    }
+    ret = JS_GetIterator2(ctx, obj, method);
+    JS_FreeValue(ctx, method);
+    return ret;
+}
+
+/* return *pdone = 2 if the iterator object is not parsed */
+static JSValue JS_IteratorNext2(JSContext *ctx, JSValueConst enum_obj,
+                                JSValueConst method,
+                                int argc, JSValueConst *argv, int *pdone)
+{
+    JSValue obj;
+
+    /* fast path for the built-in iterators (avoid creating the
+       intermediate result object) */
+    if (JS_IsObject(method)) {
+        JSObject *p = JS_VALUE_GET_OBJ(method);
+        if (p->class_id == JS_CLASS_C_FUNCTION &&
+            p->u.cfunc.cproto == JS_CFUNC_iterator_next) {
+            JSCFunctionType func;
+            JSValueConst args[1];
+
+            /* in case the function expects one argument */
+            if (argc == 0) {
+                args[0] = JS_UNDEFINED;
+                argv = args;
+            }
+            func = p->u.cfunc.c_function;
+            return func.iterator_next(ctx, enum_obj, argc, argv,
+                                      pdone, p->u.cfunc.magic);
+        }
+    }
+    obj = JS_Call(ctx, method, enum_obj, argc, argv);
+    if (JS_IsException(obj))
+        goto fail;
+    if (!JS_IsObject(obj)) {
+        JS_FreeValue(ctx, obj);
+        JS_ThrowTypeError(ctx, "iterator must return an object");
+        goto fail;
+    }
+    *pdone = 2;
+    return obj;
+ fail:
+    *pdone = FALSE;
+    return JS_EXCEPTION;
+}
+
+JSValue JS_IteratorNext(JSContext *ctx, JSValueConst enum_obj,
+                               JSValueConst method,
+                               int argc, JSValueConst *argv, BOOL *pdone)
+{
+    JSValue obj, value, done_val;
+    int done;
+
+    obj = JS_IteratorNext2(ctx, enum_obj, method, argc, argv, &done);
+    if (JS_IsException(obj))
+        goto fail;
+    if (done != 2) {
+        *pdone = done;
+        return obj;
+    } else {
+        done_val = JS_GetProperty(ctx, obj, JS_ATOM_done);
+        if (JS_IsException(done_val))
+            goto fail;
+        *pdone = JS_ToBoolFree(ctx, done_val);
+        value = JS_UNDEFINED;
+        if (!*pdone) {
+            value = JS_GetProperty(ctx, obj, JS_ATOM_value);
+        }
+        JS_FreeValue(ctx, obj);
+        return value;
+    }
+ fail:
+    JS_FreeValue(ctx, obj);
+    *pdone = FALSE;
+    return JS_EXCEPTION;
+}
+
+/* return < 0 in case of exception */
+static int JS_IteratorClose(JSContext *ctx, JSValueConst enum_obj,
+                            BOOL is_exception_pending)
+{
+    JSValue method, ret, ex_obj;
+    int res;
+
+    if (is_exception_pending) {
+        ex_obj = ctx->current_exception;
+        ctx->current_exception = JS_NULL;
+        res = -1;
+    } else {
+        ex_obj = JS_UNDEFINED;
+        res = 0;
+    }
+    method = JS_GetProperty(ctx, enum_obj, JS_ATOM_return);
+    if (JS_IsException(method)) {
+        res = -1;
+        goto done;
+    }
+    if (JS_IsUndefined(method) || JS_IsNull(method)) {
+        goto done;
+    }
+    ret = JS_CallFree(ctx, method, enum_obj, 0, NULL);
+    if (!is_exception_pending) {
+        if (JS_IsException(ret)) {
+            res = -1;
+        } else if (!JS_IsObject(ret)) {
+            JS_ThrowTypeErrorNotAnObject(ctx);
+            res = -1;
+        }
+    }
+    JS_FreeValue(ctx, ret);
+ done:
+    if (is_exception_pending) {
+        JS_Throw(ctx, ex_obj);
+    }
+    return res;
+}
+
+/* obj -> enum_rec (3 slots) */
+static __exception int js_for_of_start(JSContext *ctx, JSValue *sp,
+                                       BOOL is_async)
+{
+    JSValue op1, obj, method;
+    op1 = sp[-1];
+    obj = JS_GetIterator(ctx, op1, is_async);
+    if (JS_IsException(obj))
+        return -1;
+    JS_FreeValue(ctx, op1);
+    sp[-1] = obj;
+    method = JS_GetProperty(ctx, obj, JS_ATOM_next);
+    if (JS_IsException(method))
+        return -1;
+    sp[0] = method;
+    return 0;
+}
+
+/* enum_rec -> enum_rec value done */
+static __exception int js_for_of_next(JSContext *ctx, JSValue *sp, int offset)
+{
+    JSValue value = JS_UNDEFINED;
+    int done = 1;
+
+    if (likely(!JS_IsUndefined(sp[offset]))) {
+        value = JS_IteratorNext(ctx, sp[offset], sp[offset + 1], 0, NULL, &done);
+        if (JS_IsException(value))
+            done = -1;
+        if (done) {
+            /* value is JS_UNDEFINED or JS_EXCEPTION */
+            /* replace the iteration object with undefined */
+            JS_FreeValue(ctx, sp[offset]);
+            sp[offset] = JS_UNDEFINED;
+            if (done < 0)
+                return -1;
+        }
+    }
+    sp[0] = value;
+    sp[1] = JS_NewBool(ctx, done);
+    return 0;
+}
+
+static __exception int js_for_await_of_next(JSContext *ctx, JSValue *sp)
+{
+    JSValue result;
+    result = JS_Call(ctx, sp[-2], sp[-3], 0, NULL);
+    if (JS_IsException(result))
+        return -1;
+    sp[0] = result;
+    return 0;
+}
+
+static JSValue JS_IteratorGetCompleteValue(JSContext *ctx, JSValueConst obj,
+                                           BOOL *pdone)
+{
+    JSValue done_val, value;
+    BOOL done;
+    done_val = JS_GetProperty(ctx, obj, JS_ATOM_done);
+    if (JS_IsException(done_val))
+        goto fail;
+    done = JS_ToBoolFree(ctx, done_val);
+    value = JS_GetProperty(ctx, obj, JS_ATOM_value);
+    if (JS_IsException(value))
+        goto fail;
+    *pdone = done;
+    return value;
+ fail:
+    *pdone = FALSE;
+    return JS_EXCEPTION;
+}
+
+static __exception int js_iterator_get_value_done(JSContext *ctx, JSValue *sp)
+{
+    JSValue obj, value;
+    BOOL done;
+    obj = sp[-1];
+    if (!JS_IsObject(obj)) {
+        JS_ThrowTypeError(ctx, "iterator must return an object");
+        return -1;
+    }
+    value = JS_IteratorGetCompleteValue(ctx, obj, &done);
+    if (JS_IsException(value))
+        return -1;
+    JS_FreeValue(ctx, obj);
+    sp[-1] = value;
+    sp[0] = JS_NewBool(ctx, done);
+    return 0;
+}
+
+static JSValue js_create_iterator_result(JSContext *ctx,
+                                         JSValue val,
+                                         BOOL done)
+{
+    JSValue obj;
+    obj = JS_NewObject(ctx);
+    if (JS_IsException(obj)) {
+        JS_FreeValue(ctx, val);
+        return obj;
+    }
+    if (JS_DefinePropertyValue(ctx, obj, JS_ATOM_value,
+                               val, JS_PROP_C_W_E) < 0) {
+        goto fail;
+    }
+    if (JS_DefinePropertyValue(ctx, obj, JS_ATOM_done,
+                               JS_NewBool(ctx, done), JS_PROP_C_W_E) < 0) {
+    fail:
+        JS_FreeValue(ctx, obj);
+        return JS_EXCEPTION;
+    }
+    return obj;
+}
+
+static JSValue js_array_iterator_next(JSContext *ctx, JSValueConst this_val,
+                                      int argc, JSValueConst *argv,
+                                      BOOL *pdone, int magic);
+
+static JSValue js_create_array_iterator(JSContext *ctx, JSValueConst this_val,
+                                        int argc, JSValueConst *argv, int magic);
+
+/* Access an Array's internal JSValue array if available */
+int js_get_fast_array(JSContext *ctx, JSValueConst obj,
+                              JSValue **arrpp, uint32_t *countp)
+{
+    /* Try and handle fast arrays explicitly */
+    if (JS_VALUE_GET_TAG(obj) == JS_TAG_OBJECT) {
+        JSObject *p = JS_VALUE_GET_OBJ(obj);
+        if (p->class_id == JS_CLASS_ARRAY && p->fast_array) {
+            *countp = p->u.array.count;
+            *arrpp = p->u.array.u.values;
+            return TRUE;
+        }
+    }
+    return FALSE;
+}
+
+static __exception int js_append_enumerate(JSContext *ctx, JSValue *sp)
+{
+    JSValue iterator, enumobj, method, value;
+    int pos, is_array_iterator;
+    JSValue *arrp;
+    uint32_t i, count32;
+
+    if (JS_VALUE_GET_TAG(sp[-2]) != JS_TAG_INT) {
+        JS_ThrowInternalError(ctx, "invalid index for append");
+        return -1;
+    }
+
+    pos = JS_VALUE_GET_INT(sp[-2]);
+
+    /* XXX: further optimisations:
+       - use ctx->array_proto_values?
+       - check if array_iterator_prototype next method is built-in and
+         avoid constructing actual iterator object?
+       - build this into js_for_of_start and use in all `for (x of o)` loops
+     */
+    iterator = JS_GetProperty(ctx, sp[-1], JS_ATOM_Symbol_iterator);
+    if (JS_IsException(iterator))
+        return -1;
+    is_array_iterator = JS_IsCFunction(ctx, iterator,
+                                       (JSCFunction *)js_create_array_iterator,
+                                       JS_ITERATOR_KIND_VALUE);
+    JS_FreeValue(ctx, iterator);
+
+    enumobj = JS_GetIterator(ctx, sp[-1], FALSE);
+    if (JS_IsException(enumobj))
+        return -1;
+    method = JS_GetProperty(ctx, enumobj, JS_ATOM_next);
+    if (JS_IsException(method)) {
+        JS_FreeValue(ctx, enumobj);
+        return -1;
+    }
+    if (is_array_iterator
+    &&  JS_IsCFunction(ctx, method, (JSCFunction *)js_array_iterator_next, 0)
+    &&  js_get_fast_array(ctx, sp[-1], &arrp, &count32)) {
+        int64_t len;
+        /* Handle fast arrays explicitly */
+        if (js_get_length64(ctx, &len, sp[-1]))
+            goto exception;
+        for (i = 0; i < count32; i++) {
+            if (JS_DefinePropertyValueUint32(ctx, sp[-3], pos++,
+                                             JS_DupValue(ctx, arrp[i]), JS_PROP_C_W_E) < 0)
+                goto exception;
+        }
+        if (len > count32) {
+            /* This is not strictly correct because the trailing elements are
+               empty instead of undefined. Append undefined entries instead.
+             */
+            pos += len - count32;
+            if (JS_SetProperty(ctx, sp[-3], JS_ATOM_length, JS_NewUint32(ctx, pos)) < 0)
+                goto exception;
+        }
+    } else {
+        for (;;) {
+            BOOL done;
+            value = JS_IteratorNext(ctx, enumobj, method, 0, NULL, &done);
+            if (JS_IsException(value))
+                goto exception;
+            if (done) {
+                /* value is JS_UNDEFINED */
+                break;
+            }
+            if (JS_DefinePropertyValueUint32(ctx, sp[-3], pos++, value, JS_PROP_C_W_E) < 0)
+                goto exception;
+        }
+    }
+    sp[-2] = JS_NewInt32(ctx, pos);
+    JS_FreeValue(ctx, enumobj);
+    JS_FreeValue(ctx, method);
+    return 0;
+
+exception:
+    JS_IteratorClose(ctx, enumobj, TRUE);
+    JS_FreeValue(ctx, enumobj);
+    JS_FreeValue(ctx, method);
+    return -1;
+}
+
+static __exception int JS_CopyDataProperties(JSContext *ctx,
+                                             JSValueConst target,
+                                             JSValueConst source,
+                                             JSValueConst excluded,
+                                             BOOL setprop)
+{
+    JSPropertyEnum *tab_atom;
+    JSValue val;
+    uint32_t i, tab_atom_count;
+    JSObject *p;
+    JSObject *pexcl = NULL;
+    int ret = 0, flags;
+
+    if (JS_VALUE_GET_TAG(source) != JS_TAG_OBJECT)
+        return 0;
+
+    if (JS_VALUE_GET_TAG(excluded) == JS_TAG_OBJECT)
+        pexcl = JS_VALUE_GET_OBJ(excluded);
+
+    p = JS_VALUE_GET_OBJ(source);
+    if (JS_GetOwnPropertyNames(ctx, &tab_atom, &tab_atom_count, p,
+                               JS_GPN_STRING_MASK | JS_GPN_SYMBOL_MASK |
+                               JS_GPN_ENUM_ONLY))
+        return -1;
+
+    flags = JS_PROP_C_W_E;
+
+    for (i = 0; i < tab_atom_count; i++) {
+        if (pexcl) {
+            ret = JS_GetOwnProperty(ctx, NULL, pexcl, tab_atom[i].atom);
+            if (ret) {
+                if (ret < 0)
+                    break;
+                ret = 0;
+                continue;
+            }
+        }
+        ret = -1;
+        val = JS_GetProperty(ctx, source, tab_atom[i].atom);
+        if (JS_IsException(val))
+            break;
+        if (setprop)
+            ret = JS_SetProperty(ctx, target, tab_atom[i].atom, val);
+        else
+            ret = JS_DefinePropertyValue(ctx, target, tab_atom[i].atom, val, flags);
+        if (ret < 0)
+            break;
+        ret = 0;
+    }
+    js_free_prop_enum(ctx, tab_atom, tab_atom_count);
+    return ret;
+}
+
+/* only valid inside C functions */
+static JSValueConst JS_GetActiveFunction(JSContext *ctx)
+{
+    return ctx->current_stack_frame->cur_func;
+}
+
+static JSVarRef *get_var_ref(JSContext *ctx, JSStackFrame *sf,
+                             int var_idx, BOOL is_arg)
+{
+    JSVarRef *var_ref;
+    struct list_head *el;
+
+    list_for_each(el, &sf->var_ref_list) {
+        var_ref = list_entry(el, JSVarRef, link);
+        if (var_ref->var_idx == var_idx && var_ref->is_arg == is_arg) {
+            var_ref->header.ref_count++;
+            return var_ref;
+        }
+    }
+    /* create a new one */
+    var_ref = js_malloc(ctx, sizeof(JSVarRef));
+    if (!var_ref)
+        return NULL;
+    var_ref->header.ref_count = 1;
+    var_ref->gc_header.mark = 0;
+    var_ref->is_arg = is_arg;
+    var_ref->var_idx = var_idx;
+    list_add_tail(&var_ref->link, &sf->var_ref_list);
+    if (is_arg)
+        var_ref->pvalue = &sf->arg_buf[var_idx];
+    else
+        var_ref->pvalue = &sf->var_buf[var_idx];
+    var_ref->value = JS_UNDEFINED;
+    return var_ref;
+}
+
+static JSValue js_closure2(JSContext *ctx, JSValue func_obj,
+                           JSFunctionBytecode *b,
+                           JSVarRef **cur_var_refs,
+                           JSStackFrame *sf)
+{
+    JSObject *p;
+    JSVarRef **var_refs;
+    int i;
+
+    p = JS_VALUE_GET_OBJ(func_obj);
+    p->u.func.function_bytecode = b;
+    p->u.func.home_object = NULL;
+    p->u.func.var_refs = NULL;
+    if (b->closure_var_count) {
+        var_refs = js_mallocz(ctx, sizeof(var_refs[0]) * b->closure_var_count);
+        if (!var_refs)
+            goto fail;
+        p->u.func.var_refs = var_refs;
+        for(i = 0; i < b->closure_var_count; i++) {
+            JSClosureVar *cv = &b->closure_var[i];
+            JSVarRef *var_ref;
+            if (cv->is_local) {
+                /* reuse the existing variable reference if it already exists */
+                var_ref = get_var_ref(ctx, sf, cv->var_idx, cv->is_arg);
+                if (!var_ref)
+                    goto fail;
+            } else {
+                var_ref = cur_var_refs[cv->var_idx];
+                var_ref->header.ref_count++;
+            }
+            var_refs[i] = var_ref;
+        }
+    }
+    return func_obj;
+ fail:
+    /* bfunc is freed when func_obj is freed */
+    JS_FreeValue(ctx, func_obj);
+    return JS_EXCEPTION;
+}
+
+static int js_instantiate_prototype(JSContext *ctx, JSObject *p, JSAtom atom, void *opaque)
+{
+    JSValue obj, this_val;
+    int ret;
+
+    this_val = JS_MKPTR(JS_TAG_OBJECT, p);
+    obj = JS_NewObject(ctx);
+    if (JS_IsException(obj))
+        return -1;
+    set_cycle_flag(ctx, obj);
+    set_cycle_flag(ctx, this_val);
+    ret = JS_DefinePropertyValue(ctx, obj, JS_ATOM_constructor,
+                                 JS_DupValue(ctx, this_val),
+                                 JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+    if (JS_DefinePropertyValue(ctx, this_val, atom, obj, JS_PROP_WRITABLE) < 0 || ret < 0)
+        return -1;
+    return 0;
+}
+
+static JSValue js_closure(JSContext *ctx, JSValue bfunc,
+                          JSVarRef **cur_var_refs,
+                          JSStackFrame *sf)
+{
+    JSFunctionBytecode *b;
+    JSValue name_val, func_obj;
+    JSAtom name_atom;
+    static const uint16_t func_kind_to_class_id[] = {
+        [JS_FUNC_NORMAL] = JS_CLASS_BYTECODE_FUNCTION,
+        [JS_FUNC_GENERATOR] = JS_CLASS_GENERATOR_FUNCTION,
+        [JS_FUNC_ASYNC] = JS_CLASS_ASYNC_FUNCTION,
+        [JS_FUNC_ASYNC_GENERATOR] = JS_CLASS_ASYNC_GENERATOR_FUNCTION,
+    };
+
+    b = JS_VALUE_GET_PTR(bfunc);
+    func_obj = JS_NewObjectClass(ctx, func_kind_to_class_id[b->func_kind]);
+    if (JS_IsException(func_obj)) {
+        JS_FreeValue(ctx, bfunc);
+        return JS_EXCEPTION;
+    }
+    func_obj = js_closure2(ctx, func_obj, b, cur_var_refs, sf);
+    if (JS_IsException(func_obj)) {
+        /* bfunc has been freed */
+        goto fail;
+    }
+    name_val = JS_UNDEFINED;
+    name_atom = b->func_name;
+    if (name_atom != JS_ATOM_NULL)
+        name_val = JS_AtomToString(ctx, name_atom);
+    js_function_set_properties(ctx, func_obj, name_val,
+                               b->defined_arg_count);
+
+    if (b->func_kind & JS_FUNC_GENERATOR) {
+        JSValue proto;
+        int proto_class_id;
+        /* generators have a prototype field which is used as
+           prototype for the generator object */
+        if (b->func_kind == JS_FUNC_ASYNC_GENERATOR)
+            proto_class_id = JS_CLASS_ASYNC_GENERATOR;
+        else
+            proto_class_id = JS_CLASS_GENERATOR;
+        proto = JS_NewObjectProto(ctx, ctx->class_proto[proto_class_id]);
+        if (JS_IsException(proto))
+            goto fail;
+        JS_DefinePropertyValue(ctx, func_obj, JS_ATOM_prototype, proto,
+                               JS_PROP_WRITABLE);
+    } else if (b->has_prototype) {
+        /* add the 'prototype' property: delay instantiation to avoid
+           creating cycles for every javascript function. The prototype
+           object is created on the fly when first accessed */
+        JS_SetConstructorBit(ctx, func_obj, TRUE);
+        JS_DefineAutoInitProperty(ctx, func_obj, JS_ATOM_prototype,
+                                  js_instantiate_prototype, NULL,
+                                  JS_PROP_WRITABLE);
+    }
+    return func_obj;
+ fail:
+    /* bfunc is freed when func_obj is freed */
+    JS_FreeValue(ctx, func_obj);
+    return JS_EXCEPTION;
+}
+
+#define JS_DEFINE_CLASS_HAS_HERITAGE     (1 << 0)
+
+static int js_op_define_class(JSContext *ctx, JSValue *sp,
+                              int class_flags,
+                              JSVarRef **cur_var_refs,
+                              JSStackFrame *sf)
+{
+    JSValue bfunc, parent_class, proto = JS_UNDEFINED;
+    JSValue ctor = JS_UNDEFINED, parent_proto = JS_UNDEFINED;
+    JSFunctionBytecode *b;
+
+    parent_class = sp[-2];
+    bfunc = sp[-1];
+
+    if (class_flags & JS_DEFINE_CLASS_HAS_HERITAGE) {
+        if (JS_IsNull(parent_class)) {
+            parent_proto = JS_NULL;
+            parent_class = JS_DupValue(ctx, ctx->function_proto);
+        } else {
+            if (!JS_IsConstructor(ctx, parent_class)) {
+                JS_ThrowTypeError(ctx, "parent class must be constructor");
+                goto fail;
+            }
+            parent_proto = JS_GetProperty(ctx, parent_class, JS_ATOM_prototype);
+            if (JS_IsException(parent_proto))
+                goto fail;
+            if (!JS_IsNull(parent_proto) && !JS_IsObject(parent_proto)) {
+                JS_ThrowTypeError(ctx, "parent prototype must be an object or null");
+                goto fail;
+            }
+        }
+    } else {
+        /* parent_class is JS_UNDEFINED in this case */
+        parent_proto = JS_DupValue(ctx, ctx->class_proto[JS_CLASS_OBJECT]);
+        parent_class = JS_DupValue(ctx, ctx->function_proto);
+    }
+    proto = JS_NewObjectProto(ctx, parent_proto);
+    if (JS_IsException(proto))
+        goto fail;
+
+    b = JS_VALUE_GET_PTR(bfunc);
+    assert(b->func_kind == JS_FUNC_NORMAL);
+    ctor = JS_NewObjectProtoClass(ctx, parent_class,
+                                  JS_CLASS_BYTECODE_FUNCTION);
+    if (JS_IsException(ctor))
+        goto fail;
+    ctor = js_closure2(ctx, ctor, b, cur_var_refs, sf);
+    bfunc = JS_UNDEFINED;
+    if (JS_IsException(ctor))
+        goto fail;
+    js_method_set_home_object(ctx, ctor, proto);
+    JS_SetConstructorBit(ctx, ctor, TRUE);
+
+    JS_DefinePropertyValue(ctx, ctor, JS_ATOM_length,
+                           JS_NewInt32(ctx, b->defined_arg_count),
+                           JS_PROP_CONFIGURABLE);
+
+    /* the constructor property must be first. It can be overriden by
+       computed property names */
+    if (JS_DefinePropertyValue(ctx, proto, JS_ATOM_constructor,
+                               JS_DupValue(ctx, ctor),
+                               JS_PROP_CONFIGURABLE |
+                               JS_PROP_WRITABLE | JS_PROP_THROW) < 0)
+        goto fail;
+    /* set the prototype property */
+    if (JS_DefinePropertyValue(ctx, ctor, JS_ATOM_prototype,
+                               JS_DupValue(ctx, proto), JS_PROP_THROW) < 0)
+        goto fail;
+    set_cycle_flag(ctx, ctor);
+    set_cycle_flag(ctx, proto);
+
+    JS_FreeValue(ctx, parent_proto);
+    JS_FreeValue(ctx, parent_class);
+
+    sp[-2] = ctor;
+    sp[-1] = proto;
+    return 0;
+ fail:
+    JS_FreeValue(ctx, parent_class);
+    JS_FreeValue(ctx, parent_proto);
+    JS_FreeValue(ctx, bfunc);
+    JS_FreeValue(ctx, proto);
+    JS_FreeValue(ctx, ctor);
+    sp[-2] = JS_UNDEFINED;
+    sp[-1] = JS_UNDEFINED;
+    return -1;
+}
+
+static void close_var_refs(JSContext *ctx, JSStackFrame *sf)
+{
+    struct list_head *el, *el1;
+    JSVarRef *var_ref;
+    int var_idx;
+
+    list_for_each_safe(el, el1, &sf->var_ref_list) {
+        var_ref = list_entry(el, JSVarRef, link);
+        var_idx = var_ref->var_idx;
+        if (var_ref->is_arg)
+            var_ref->value = JS_DupValue(ctx, sf->arg_buf[var_idx]);
+        else
+            var_ref->value = JS_DupValue(ctx, sf->var_buf[var_idx]);
+        var_ref->pvalue = &var_ref->value;
+        var_ref->link.prev = NULL; /* the reference is no longer to a
+                                      local variable */
+    }
+}
+
+static void close_lexical_var(JSContext *ctx, JSStackFrame *sf, int idx, int is_arg)
+{
+    struct list_head *el, *el1;
+    JSVarRef *var_ref;
+    int var_idx = idx;
+
+    list_for_each_safe(el, el1, &sf->var_ref_list) {
+        var_ref = list_entry(el, JSVarRef, link);
+        if (var_idx == var_ref->var_idx && var_ref->is_arg == is_arg) {
+            var_ref->value = JS_DupValue(ctx, sf->var_buf[var_idx]);
+            var_ref->pvalue = &var_ref->value;
+            list_del(&var_ref->link);
+            var_ref->link.prev = NULL; /* the reference is no longer to a
+                                          local variable */
+        }
+    }
+}
+
+#define CALL_FLAG_CONSTRUCTOR (1 << 0)
+#define CALL_FLAG_COPY_ARGV   (1 << 1)
+#define CALL_FLAG_GENERATOR   (1 << 2)
+
+static JSValue js_call_c_function(JSContext *ctx, JSValueConst func_obj,
+                                  JSValueConst this_obj,
+                                  int argc, JSValueConst *argv, int flags)
+{
+    JSCFunctionType func;
+    JSObject *p;
+    JSStackFrame sf_s, *sf = &sf_s, *prev_sf;
+    JSValue ret_val;
+    JSValueConst *arg_buf;
+    int arg_count, i;
+    JSCFunctionEnum cproto;
+
+    p = JS_VALUE_GET_OBJ(func_obj);
+    cproto = p->u.cfunc.cproto;
+    prev_sf = ctx->current_stack_frame;
+    sf->prev_frame = prev_sf;
+    ctx->current_stack_frame = sf;
+#ifdef CONFIG_BIGNUM
+    /* we only propagate the bignum mode as some runtime functions
+       test it */
+    if (prev_sf)
+        sf->js_mode = prev_sf->js_mode & JS_MODE_BIGINT;
+    else
+        sf->js_mode = 0;
+#else
+    sf->js_mode = 0;
+#endif
+    sf->cur_func = CastToJSValue(func_obj);
+    sf->arg_count = argc;
+    arg_buf = argv;
+
+    arg_count = p->u.cfunc.length;
+
+    if (unlikely(argc < arg_count)) {
+        /* ensure that at least argc_count arguments are readable */
+        arg_buf = alloca(sizeof(arg_buf[0]) * arg_count);
+        for(i = 0; i < argc; i++)
+            arg_buf[i] = argv[i];
+        for(i = argc; i < arg_count; i++)
+            arg_buf[i] = JS_UNDEFINED;
+        sf->arg_count = arg_count;
+    }
+    sf->arg_buf = (JSValue*)arg_buf;
+
+    func = p->u.cfunc.c_function;
+    switch(cproto) {
+    case JS_CFUNC_constructor:
+    case JS_CFUNC_constructor_or_func:
+        if (!(flags & CALL_FLAG_CONSTRUCTOR)) {
+            if (cproto == JS_CFUNC_constructor) {
+            not_a_constructor:
+                ret_val = JS_ThrowTypeError(ctx, "must be called with new");
+                break;
+            } else {
+                this_obj = JS_UNDEFINED;
+            }
+        }
+        /* here this_obj is new_target */
+        /* fall thru */
+    case JS_CFUNC_generic:
+        ret_val = func.generic(ctx, this_obj, argc, arg_buf);
+        break;
+    case JS_CFUNC_constructor_magic:
+    case JS_CFUNC_constructor_or_func_magic:
+        if (!(flags & CALL_FLAG_CONSTRUCTOR)) {
+            if (cproto == JS_CFUNC_constructor_magic) {
+                goto not_a_constructor;
+            } else {
+                this_obj = JS_UNDEFINED;
+            }
+        }
+        /* fall thru */
+    case JS_CFUNC_generic_magic:
+        ret_val = func.generic_magic(ctx, this_obj, argc, arg_buf,
+                                     p->u.cfunc.magic);
+        break;
+    case JS_CFUNC_getter:
+        ret_val = func.getter(ctx, this_obj);
+        break;
+    case JS_CFUNC_setter:
+        ret_val = func.setter(ctx, this_obj, arg_buf[0]);
+        break;
+    case JS_CFUNC_getter_magic:
+        ret_val = func.getter_magic(ctx, this_obj, p->u.cfunc.magic);
+        break;
+    case JS_CFUNC_setter_magic:
+        ret_val = func.setter_magic(ctx, this_obj, arg_buf[0], p->u.cfunc.magic);
+        break;
+    case JS_CFUNC_f_f:
+        {
+            double d1;
+
+            if (unlikely(JS_ToFloat64(ctx, &d1, arg_buf[0]))) {
+                ret_val = JS_EXCEPTION;
+                break;
+            }
+            ret_val = JS_NewFloat64(ctx, func.f_f(d1));
+        }
+        break;
+    case JS_CFUNC_f_f_f:
+        {
+            double d1, d2;
+
+            if (unlikely(JS_ToFloat64(ctx, &d1, arg_buf[0]))) {
+                ret_val = JS_EXCEPTION;
+                break;
+            }
+            if (unlikely(JS_ToFloat64(ctx, &d2, arg_buf[1]))) {
+                ret_val = JS_EXCEPTION;
+                break;
+            }
+            ret_val = JS_NewFloat64(ctx, func.f_f_f(d1, d2));
+        }
+        break;
+    case JS_CFUNC_iterator_next:
+        {
+            int done;
+            ret_val = func.iterator_next(ctx, this_obj, argc, arg_buf,
+                                         &done, p->u.cfunc.magic);
+            if (!JS_IsException(ret_val) && done != 2) {
+                ret_val = js_create_iterator_result(ctx, ret_val, done);
+            }
+        }
+        break;
+    default:
+        abort();
+    }
+
+    ctx->current_stack_frame = sf->prev_frame;
+    return ret_val;
+}
+
+static JSValue js_call_bound_function(JSContext *ctx, JSValueConst func_obj,
+                                      JSValueConst this_obj,
+                                      int argc, JSValueConst *argv, int flags)
+{
+    JSObject *p;
+    JSBoundFunction *bf;
+    JSValueConst *arg_buf, new_target;
+    int arg_count, i;
+
+    p = JS_VALUE_GET_OBJ(func_obj);
+    bf = p->u.bound_function;
+    arg_count = bf->argc + argc;
+    arg_buf = alloca(sizeof(JSValue) * arg_count);
+    for(i = 0; i < bf->argc; i++) {
+        arg_buf[i] = bf->argv[i];
+    }
+    for(i = 0; i < argc; i++) {
+        arg_buf[bf->argc + i] = argv[i];
+    }
+    if (flags & CALL_FLAG_CONSTRUCTOR) {
+        new_target = this_obj;
+        if (js_same_value(ctx, func_obj, new_target))
+            new_target = bf->func_obj;
+        return JS_CallConstructor2(ctx, bf->func_obj, new_target,
+                                   arg_count, arg_buf);
+    } else {
+        return JS_Call(ctx, bf->func_obj, bf->this_val,
+                       arg_count, arg_buf);
+    }
+}
+
+static no_inline __exception int __js_poll_interrupts(JSContext *ctx)
+{
+    JSRuntime *rt = ctx->rt;
+    ctx->interrupt_counter = JS_INTERRUPT_COUNTER_INIT;
+    if (rt->interrupt_handler) {
+        if (rt->interrupt_handler(rt, rt->interrupt_opaque)) {
+            /* XXX: should set a specific flag to avoid catching */
+            JS_ThrowInternalError(ctx, "interrupted");
+            JS_SetUncatchableError(ctx, ctx->current_exception, TRUE);
+            return -1;
+        }
+    }
+    return 0;
+}
+
+static inline __exception int js_poll_interrupts(JSContext *ctx)
+{
+    if (unlikely(--ctx->interrupt_counter <= 0)) {
+        return __js_poll_interrupts(ctx);
+    } else {
+        return 0;
+    }
+}
+
+#define FUNC_RET_AWAIT      0
+#define FUNC_RET_YIELD      1
+#define FUNC_RET_YIELD_STAR 2
+
+/* argv[] is modified if (flags & CALL_FLAG_COPY_ARGV) = 0. */
+static JSValue JS_CallInternal(JSContext *ctx, JSValueConst func_obj,
+                               JSValueConst this_obj, JSValueConst new_target,
+                               int argc, JSValue *argv, int flags)
+{
+    JSObject *p;
+    JSFunctionBytecode *b;
+    JSStackFrame sf_s, *sf = &sf_s;
+    const uint8_t *pc;
+    int opcode, arg_allocated_size, i;
+    JSValue *local_buf, *stack_buf, *var_buf, *arg_buf, *sp, ret_val, *pval;
+    JSVarRef **var_refs;
+    size_t alloca_size;
+
+#if !DIRECT_DISPATCH
+#define SWITCH(pc)      switch (opcode = *pc++)
+#define CASE(op)        case op
+#define DEFAULT         default
+#define BREAK           break
+#else
+    static const void * const dispatch_table[256] = {
+#define DEF(id, size, n_pop, n_push, f) && case_OP_ ## id,
+#define def(id, size, n_pop, n_push, f) && case_default,
+#include "quickjs-opcode.h"
+        [ OP_nop + 1 ... 255 ] = &&case_default
+    };
+#define SWITCH(pc)      goto *dispatch_table[opcode = *pc++];
+#define CASE(op)        case_ ## op
+#define DEFAULT         case_default
+#define BREAK           SWITCH(pc)
+#endif
+
+    if (js_poll_interrupts(ctx))
+        return JS_EXCEPTION;
+    if (unlikely(JS_VALUE_GET_TAG(func_obj) != JS_TAG_OBJECT)) {
+        if (flags & CALL_FLAG_GENERATOR) {
+            JSAsyncFunctionState *s = JS_VALUE_GET_PTR(func_obj);
+            /* func_obj get contains a pointer to JSFuncAsyncState */
+            /* the stack frame is already allocated */
+            sf = &s->frame;
+            p = JS_VALUE_GET_OBJ(sf->cur_func);
+            b = p->u.func.function_bytecode;
+            var_refs = p->u.func.var_refs;
+            local_buf = arg_buf = sf->arg_buf;
+            var_buf = sf->var_buf;
+            stack_buf = sf->var_buf + b->var_count;
+            sp = sf->cur_sp;
+            sf->cur_sp = NULL; /* cur_sp is NULL if the function is running */
+            pc = sf->cur_pc;
+            sf->prev_frame = ctx->current_stack_frame;
+            ctx->current_stack_frame = sf;
+            if (s->throw_flag)
+                goto exception;
+            else
+                goto restart;
+        } else {
+            goto not_a_function;
+        }
+    }
+    p = JS_VALUE_GET_OBJ(func_obj);
+    if (unlikely(p->class_id != JS_CLASS_BYTECODE_FUNCTION)) {
+        switch(p->class_id) {
+        case JS_CLASS_C_FUNCTION:
+            return js_call_c_function(ctx, func_obj, this_obj, argc,
+                                      (JSValueConst *)argv, flags);
+        case JS_CLASS_BOUND_FUNCTION:
+            return js_call_bound_function(ctx, func_obj, this_obj, argc,
+                                          (JSValueConst *)argv, flags);
+        default:
+            {
+                JSClassCall *call_func;
+                call_func = ctx->rt->class_array[p->class_id].call;
+                if (!call_func) {
+                not_a_function:
+                    return JS_ThrowTypeError(ctx, "not a function");
+                }
+                return call_func(ctx, func_obj, this_obj, argc,
+                                 (JSValueConst *)argv);
+            }
+        }
+    }
+    b = p->u.func.function_bytecode;
+
+    if (unlikely(argc < b->arg_count || (flags & CALL_FLAG_COPY_ARGV))) {
+        arg_allocated_size = b->arg_count;
+    } else {
+        arg_allocated_size = 0;
+    }
+
+    alloca_size = sizeof(JSValue) * (arg_allocated_size + b->var_count +
+                                     b->stack_size);
+    if (js_check_stack_overflow(ctx, alloca_size))
+        return JS_ThrowStackOverflow(ctx);
+
+    sf->js_mode = b->js_mode;
+    arg_buf = argv;
+    sf->arg_count = argc;
+    sf->cur_func = CastToJSValue(func_obj);
+    init_list_head(&sf->var_ref_list);
+    var_refs = p->u.func.var_refs;
+
+    local_buf = alloca(alloca_size);
+    if (unlikely(arg_allocated_size)) {
+        int n = min_int(argc, b->arg_count);
+        arg_buf = local_buf;
+        for(i = 0; i < n; i++)
+            arg_buf[i] = JS_DupValue(ctx, argv[i]);
+        for(; i < b->arg_count; i++)
+            arg_buf[i] = JS_UNDEFINED;
+        sf->arg_count = b->arg_count;
+    }
+    var_buf = local_buf + arg_allocated_size;
+    sf->var_buf = var_buf;
+    sf->arg_buf = arg_buf;
+
+    for(i = 0; i < b->var_count; i++)
+        var_buf[i] = JS_UNDEFINED;
+
+    stack_buf = var_buf + b->var_count;
+    sp = stack_buf;
+    pc = b->byte_code_buf;
+    sf->prev_frame = ctx->current_stack_frame;
+    ctx->current_stack_frame = sf;
+ restart:
+    for(;;) {
+        int call_argc;
+        JSValue *call_argv;
+
+        SWITCH(pc) {
+        CASE(OP_push_i32):
+            *sp++ = JS_NewInt32(ctx, get_u32(pc));
+            pc += 4;
+            BREAK;
+        CASE(OP_push_const):
+            *sp++ = JS_DupValue(ctx, b->cpool[get_u32(pc)]);
+            pc += 4;
+            BREAK;
+#if SHORT_OPCODES
+        CASE(OP_push_minus1):
+        CASE(OP_push_0):
+        CASE(OP_push_1):
+        CASE(OP_push_2):
+        CASE(OP_push_3):
+        CASE(OP_push_4):
+        CASE(OP_push_5):
+        CASE(OP_push_6):
+        CASE(OP_push_7):
+            *sp++ = JS_NewInt32(ctx, opcode - OP_push_0);
+            BREAK;
+        CASE(OP_push_i8):
+            *sp++ = JS_NewInt32(ctx, get_i8(pc));
+            pc += 1;
+            BREAK;
+        CASE(OP_push_i16):
+            *sp++ = JS_NewInt32(ctx, get_i16(pc));
+            pc += 2;
+            BREAK;
+        CASE(OP_push_const8):
+            *sp++ = JS_DupValue(ctx, b->cpool[*pc++]);
+            BREAK;
+        CASE(OP_fclosure8):
+            *sp++ = js_closure(ctx, JS_DupValue(ctx, b->cpool[*pc++]), var_refs, sf);
+            if (unlikely(JS_IsException(sp[-1])))
+                goto exception;
+            BREAK;
+        CASE(OP_push_empty_string):
+            *sp++ = JS_AtomToString(ctx, JS_ATOM_empty_string);
+            BREAK;
+        CASE(OP_get_length):
+            {
+                JSValue val;
+
+                val = JS_GetProperty(ctx, sp[-1], JS_ATOM_length);
+                if (unlikely(JS_IsException(val)))
+                    goto exception;
+                JS_FreeValue(ctx, sp[-1]);
+                sp[-1] = val;
+            }
+            BREAK;
+#endif
+        CASE(OP_push_atom_value):
+            *sp++ = JS_AtomToValue(ctx, get_u32(pc));
+            pc += 4;
+            BREAK;
+        CASE(OP_undefined):
+            *sp++ = JS_UNDEFINED;
+            BREAK;
+        CASE(OP_null):
+            *sp++ = JS_NULL;
+            BREAK;
+        CASE(OP_push_this):
+            /* OP_push_this is only called at the start of a function */
+            {
+                JSValue val;
+                if (!(b->js_mode & JS_MODE_STRICT)) {
+                    uint32_t tag = JS_VALUE_GET_TAG(this_obj);
+                    if (likely(tag == JS_TAG_OBJECT))
+                        goto normal_this;
+                    if (tag == JS_TAG_NULL || tag == JS_TAG_UNDEFINED) {
+                        val = JS_DupValue(ctx, ctx->global_obj);
+                    } else {
+                        val = JS_ToObject(ctx, this_obj);
+                        if (JS_IsException(val))
+                            goto exception;
+                    }
+                } else {
+                normal_this:
+                    val = JS_DupValue(ctx, this_obj);
+                }
+                *sp++ = val;
+            }
+            BREAK;
+        CASE(OP_push_false):
+            *sp++ = JS_FALSE;
+            BREAK;
+        CASE(OP_push_true):
+            *sp++ = JS_TRUE;
+            BREAK;
+        CASE(OP_object):
+            *sp++ = JS_NewObject(ctx);
+            if (unlikely(JS_IsException(sp[-1])))
+                goto exception;
+            BREAK;
+        CASE(OP_var_object):
+            *sp++ = JS_NewObjectProto(ctx, JS_NULL);
+            if (unlikely(JS_IsException(sp[-1])))
+                goto exception;
+            BREAK;
+        CASE(OP_this_func):
+            *sp++ = JS_DupValue(ctx, sf->cur_func);
+            BREAK;
+        CASE(OP_arguments):
+            {
+                int mapped = *pc++;
+                if (mapped) {
+                    *sp++ = js_build_mapped_arguments(ctx, argc, (JSValueConst *)argv,
+                                                      sf, min_int(argc, b->arg_count));
+                } else {
+                    *sp++ = js_build_arguments(ctx, argc, (JSValueConst *)argv);
+                }
+                if (unlikely(JS_IsException(sp[-1])))
+                    goto exception;
+            }
+            BREAK;
+        CASE(OP_rest):
+            {
+                int first = get_u16(pc);
+                pc += 2;
+                *sp++ = js_build_rest(ctx, first, argc, (JSValueConst *)argv);
+                if (unlikely(JS_IsException(sp[-1])))
+                    goto exception;
+            }
+            BREAK;
+        CASE(OP_new_target):
+            *sp++ = JS_DupValue(ctx, new_target);
+            BREAK;
+        CASE(OP_home_object):
+            {
+                JSObject *p1;
+                p1 = p->u.func.home_object;
+                if (unlikely(!p1))
+                    *sp++ = JS_UNDEFINED;
+                else
+                    *sp++ = JS_DupValue(ctx, JS_MKPTR(JS_TAG_OBJECT, p1));
+            }
+            BREAK;
+
+        CASE(OP_drop):
+            JS_FreeValue(ctx, sp[-1]);
+            sp--;
+            BREAK;
+        CASE(OP_nip):
+            JS_FreeValue(ctx, sp[-2]);
+            sp[-2] = sp[-1];
+            sp--;
+            BREAK;
+        CASE(OP_nip1): /* a b c -> b c */
+            JS_FreeValue(ctx, sp[-3]);
+            sp[-3] = sp[-2];
+            sp[-2] = sp[-1];
+            sp--;
+            BREAK;
+        CASE(OP_dup):
+            sp[0] = JS_DupValue(ctx, sp[-1]);
+            sp++;
+            BREAK;
+        CASE(OP_dup2): /* a b -> a b a b */
+            sp[0] = JS_DupValue(ctx, sp[-2]);
+            sp[1] = JS_DupValue(ctx, sp[-1]);
+            sp += 2;
+            BREAK;
+        CASE(OP_dup3): /* a b c -> a b c a b c */
+            sp[0] = JS_DupValue(ctx, sp[-3]);
+            sp[1] = JS_DupValue(ctx, sp[-2]);
+            sp[2] = JS_DupValue(ctx, sp[-1]);
+            sp += 3;
+            BREAK;
+        CASE(OP_dup1): /* a b -> a a b */
+            sp[0] = sp[-1];
+            sp[-1] = JS_DupValue(ctx, sp[-2]);
+            sp++;
+            BREAK;
+        CASE(OP_insert2): /* obj a -> a obj a (dup_x1) */
+            sp[0] = sp[-1];
+            sp[-1] = sp[-2];
+            sp[-2] = JS_DupValue(ctx, sp[0]);
+            sp++;
+            BREAK;
+        CASE(OP_insert3): /* obj prop a -> a obj prop a (dup_x2) */
+            sp[0] = sp[-1];
+            sp[-1] = sp[-2];
+            sp[-2] = sp[-3];
+            sp[-3] = JS_DupValue(ctx, sp[0]);
+            sp++;
+            BREAK;
+        CASE(OP_insert4): /* this obj prop a -> a this obj prop a */
+            sp[0] = sp[-1];
+            sp[-1] = sp[-2];
+            sp[-2] = sp[-3];
+            sp[-3] = sp[-4];
+            sp[-4] = JS_DupValue(ctx, sp[0]);
+            sp++;
+            BREAK;
+        CASE(OP_perm3): /* obj a b -> a obj b (213) */
+            {
+                JSValue tmp;
+                tmp = sp[-2];
+                sp[-2] = sp[-3];
+                sp[-3] = tmp;
+            }
+            BREAK;
+        CASE(OP_rot3l): /* x a b -> a b x (231) */
+            {
+                JSValue tmp;
+                tmp = sp[-3];
+                sp[-3] = sp[-2];
+                sp[-2] = sp[-1];
+                sp[-1] = tmp;
+            }
+            BREAK;
+        CASE(OP_rot4l): /* x a b c -> a b c x */
+            {
+                JSValue tmp;
+                tmp = sp[-4];
+                sp[-4] = sp[-3];
+                sp[-3] = sp[-2];
+                sp[-2] = sp[-1];
+                sp[-1] = tmp;
+            }
+            BREAK;
+        CASE(OP_rot5l): /* x a b c d -> a b c d x */
+            {
+                JSValue tmp;
+                tmp = sp[-5];
+                sp[-5] = sp[-4];
+                sp[-4] = sp[-3];
+                sp[-3] = sp[-2];
+                sp[-2] = sp[-1];
+                sp[-1] = tmp;
+            }
+            BREAK;
+        CASE(OP_rot3r): /* a b x -> x a b (312) */
+            {
+                JSValue tmp;
+                tmp = sp[-1];
+                sp[-1] = sp[-2];
+                sp[-2] = sp[-3];
+                sp[-3] = tmp;
+            }
+            BREAK;
+        CASE(OP_perm4): /* obj prop a b -> a obj prop b */
+            {
+                JSValue tmp;
+                tmp = sp[-2];
+                sp[-2] = sp[-3];
+                sp[-3] = sp[-4];
+                sp[-4] = tmp;
+            }
+            BREAK;
+        CASE(OP_perm5): /* this obj prop a b -> a this obj prop b */
+            {
+                JSValue tmp;
+                tmp = sp[-2];
+                sp[-2] = sp[-3];
+                sp[-3] = sp[-4];
+                sp[-4] = sp[-5];
+                sp[-5] = tmp;
+            }
+            BREAK;
+        CASE(OP_swap): /* a b -> b a */
+            {
+                JSValue tmp;
+                tmp = sp[-2];
+                sp[-2] = sp[-1];
+                sp[-1] = tmp;
+            }
+            BREAK;
+        CASE(OP_swap2): /* a b c d -> c d a b */
+            {
+                JSValue tmp1, tmp2;
+                tmp1 = sp[-4];
+                tmp2 = sp[-3];
+                sp[-4] = sp[-2];
+                sp[-3] = sp[-1];
+                sp[-2] = tmp1;
+                sp[-1] = tmp2;
+            }
+            BREAK;
+
+        CASE(OP_fclosure):
+            {
+                JSValue bfunc = JS_DupValue(ctx, b->cpool[get_u32(pc)]);
+                pc += 4;
+                *sp++ = js_closure(ctx, bfunc, var_refs, sf);
+                if (unlikely(JS_IsException(sp[-1])))
+                    goto exception;
+            }
+            BREAK;
+#if SHORT_OPCODES
+        CASE(OP_call0):
+        CASE(OP_call1):
+        CASE(OP_call2):
+        CASE(OP_call3):
+            call_argc = opcode - OP_call0;
+            goto has_call_argc;
+#endif
+        CASE(OP_call):
+        CASE(OP_tail_call):
+            {
+                call_argc = get_u16(pc);
+                pc += 2;
+                goto has_call_argc;
+            has_call_argc:
+                call_argv = sp - call_argc;
+                sf->cur_pc = pc;
+                ret_val = JS_CallInternal(ctx, call_argv[-1], JS_UNDEFINED,
+                                          JS_UNDEFINED, call_argc, call_argv, 0);
+                if (unlikely(JS_IsException(ret_val)))
+                    goto exception;
+                if (opcode == OP_tail_call)
+                    goto done;
+                for(i = -1; i < call_argc; i++)
+                    JS_FreeValue(ctx, call_argv[i]);
+                sp -= call_argc + 1;
+                *sp++ = ret_val;
+            }
+            BREAK;
+        CASE(OP_call_constructor):
+            {
+                call_argc = get_u16(pc);
+                pc += 2;
+                call_argv = sp - call_argc;
+                sf->cur_pc = pc;
+                ret_val = JS_CallConstructorInternal(ctx, call_argv[-2],
+                                                     call_argv[-1],
+                                                     call_argc, call_argv, 0);
+                if (unlikely(JS_IsException(ret_val)))
+                    goto exception;
+                for(i = -2; i < call_argc; i++)
+                    JS_FreeValue(ctx, call_argv[i]);
+                sp -= call_argc + 2;
+                *sp++ = ret_val;
+            }
+            BREAK;
+        CASE(OP_call_method):
+        CASE(OP_tail_call_method):
+            {
+                call_argc = get_u16(pc);
+                pc += 2;
+                call_argv = sp - call_argc;
+                sf->cur_pc = pc;
+                ret_val = JS_CallInternal(ctx, call_argv[-1], call_argv[-2],
+                                          JS_UNDEFINED, call_argc, call_argv, 0);
+                if (unlikely(JS_IsException(ret_val)))
+                    goto exception;
+                if (opcode == OP_tail_call_method)
+                    goto done;
+                for(i = -2; i < call_argc; i++)
+                    JS_FreeValue(ctx, call_argv[i]);
+                sp -= call_argc + 2;
+                *sp++ = ret_val;
+            }
+            BREAK;
+        CASE(OP_array_from):
+            {
+                int i, ret;
+
+                call_argc = get_u16(pc);
+                pc += 2;
+                ret_val = JS_NewArray(ctx);
+                if (unlikely(JS_IsException(ret_val)))
+                    goto exception;
+                call_argv = sp - call_argc;
+                for(i = 0; i < call_argc; i++) {
+                    ret = JS_DefinePropertyValue(ctx, ret_val, __JS_AtomFromUInt32(i), call_argv[i],
+                                                 JS_PROP_C_W_E | JS_PROP_THROW);
+                    call_argv[i] = JS_UNDEFINED;
+                    if (ret < 0) {
+                        JS_FreeValue(ctx, ret_val);
+                        goto exception;
+                    }
+                }
+                sp -= call_argc;
+                *sp++ = ret_val;
+            }
+            BREAK;
+
+        CASE(OP_apply):
+            {
+                int magic;
+                magic = get_u16(pc);
+                pc += 2;
+
+                ret_val = js_function_apply(ctx, sp[-3], 2, (JSValueConst *)&sp[-2], magic);
+                if (unlikely(JS_IsException(ret_val)))
+                    goto exception;
+                JS_FreeValue(ctx, sp[-3]);
+                JS_FreeValue(ctx, sp[-2]);
+                JS_FreeValue(ctx, sp[-1]);
+                sp -= 3;
+                *sp++ = ret_val;
+            }
+            BREAK;
+        CASE(OP_return):
+            ret_val = *--sp;
+            goto done;
+        CASE(OP_return_undef):
+            ret_val = JS_UNDEFINED;
+            goto done;
+
+        CASE(OP_check_ctor_return):
+            /* return TRUE if 'this' should be returned */
+            if (!JS_IsObject(sp[-1])) {
+                if (!JS_IsUndefined(sp[-1])) {
+                    JS_ThrowTypeError(ctx, "derived class constructor must return an object or undefined");
+                    goto exception;
+                }
+                sp[0] = JS_TRUE;
+            } else {
+                sp[0] = JS_FALSE;
+            }
+            sp++;
+            BREAK;
+        CASE(OP_check_ctor):
+            if (JS_IsUndefined(new_target)) {
+                JS_ThrowTypeError(ctx, "class constructors must be invoked with 'new'");
+                goto exception;
+            }
+            BREAK;
+
+        CASE(OP_throw):
+            JS_Throw(ctx, *--sp);
+            goto exception;
+
+        CASE(OP_throw_var):
+#define JS_THROW_VAR_RO             0
+#define JS_THROW_VAR_REDECL         1
+#define JS_THROW_VAR_UNINITIALIZED  2
+            {
+                JSAtom atom;
+                atom = get_u32(pc);
+                int type = pc[4];
+                pc += 5;
+                if (type == JS_THROW_VAR_RO)
+                    JS_ThrowTypeErrorReadOnly(ctx, JS_PROP_THROW, atom);
+                else
+                if (type == JS_THROW_VAR_REDECL)
+                    JS_ThrowSyntaxErrorVarRedeclaration(ctx, atom);
+                else
+                if (type == JS_THROW_VAR_UNINITIALIZED)
+                    JS_ThrowReferenceErrorUninitialized(ctx, atom);
+                else
+                    JS_ThrowInternalError(ctx, "invalid throw var type %d", type);
+            }
+            goto exception;
+
+        CASE(OP_eval):
+            {
+                JSValue obj;
+                int scope_idx;
+
+                scope_idx = get_u16(pc) - 1;
+                pc += 2;
+                obj = sp[-1];
+                sp[-1] = JS_EvalObject(ctx, JS_UNDEFINED, obj,
+                                       JS_EVAL_TYPE_DIRECT, scope_idx);
+                JS_FreeValue(ctx, obj);
+                if (unlikely(JS_IsException(sp[-1])))
+                    goto exception;
+            }
+            BREAK;
+
+        CASE(OP_regexp):
+            {
+                sp[-2] = js_regexp_constructor_internal(ctx, JS_UNDEFINED,
+                                                        sp[-2], sp[-1]);
+                sp--;
+            }
+            BREAK;
+
+        CASE(OP_get_super_ctor):
+            {
+                JSValue proto;
+                proto = JS_DupValue(ctx, JS_GetPrototype(ctx, sp[-1]));
+                if (JS_IsException(proto))
+                    goto exception;
+                if (!JS_IsConstructor(ctx, proto)) {
+                    JS_FreeValue(ctx, proto);
+                    JS_ThrowTypeError(ctx, "not a constructor");
+                    goto exception;
+                }
+                JS_FreeValue(ctx, sp[-1]);
+                sp[-1] = proto;
+            }
+            BREAK;
+
+        CASE(OP_get_super):
+            {
+                JSValue proto;
+                proto = JS_DupValue(ctx, JS_GetPrototype(ctx, sp[-1]));
+                if (JS_IsException(proto))
+                    goto exception;
+                JS_FreeValue(ctx, sp[-1]);
+                sp[-1] = proto;
+            }
+            BREAK;
+
+        CASE(OP_check_var):
+            {
+                int ret;
+                JSAtom atom;
+                atom = get_u32(pc);
+                pc += 4;
+
+                ret = JS_CheckGlobalVar(ctx, atom);
+                if (ret < 0)
+                    goto exception;
+                *sp++ = JS_NewBool(ctx, ret);
+            }
+            BREAK;
+
+        CASE(OP_get_var_undef):
+        CASE(OP_get_var):
+            {
+                JSValue val;
+                JSAtom atom;
+                atom = get_u32(pc);
+                pc += 4;
+
+                val = JS_GetGlobalVar(ctx, atom, opcode - OP_get_var_undef);
+                if (unlikely(JS_IsException(val)))
+                    goto exception;
+                *sp++ = val;
+            }
+            BREAK;
+
+        CASE(OP_put_var):
+        CASE(OP_put_var_init):
+            {
+                int ret;
+                JSAtom atom;
+                atom = get_u32(pc);
+                pc += 4;
+
+                ret = JS_SetGlobalVar(ctx, atom, sp[-1], opcode - OP_put_var);
+                sp--;
+                if (unlikely(ret < 0))
+                    goto exception;
+            }
+            BREAK;
+
+        CASE(OP_put_var_strict):
+            {
+                int ret;
+                JSAtom atom;
+                atom = get_u32(pc);
+                pc += 4;
+
+                /* sp[-2] is JS_TRUE or JS_FALSE */
+                if (unlikely(!JS_VALUE_GET_INT(sp[-2]))) {
+                    JS_ThrowReferenceErrorNotDefined(ctx, atom);
+                    goto exception;
+                }
+                ret = JS_SetGlobalVar(ctx, atom, sp[-1], 2);
+                sp -= 2;
+                if (unlikely(ret < 0))
+                    goto exception;
+            }
+            BREAK;
+
+        CASE(OP_check_define_var):
+            {
+                JSAtom atom;
+                int flags;
+                atom = get_u32(pc);
+                flags = pc[4];
+                pc += 5;
+                if (JS_CheckDefineGlobalVar(ctx, atom, flags))
+                    goto exception;
+            }
+            BREAK;
+        CASE(OP_define_var):
+            {
+                JSAtom atom;
+                int flags;
+                atom = get_u32(pc);
+                flags = pc[4];
+                pc += 5;
+                if (JS_DefineGlobalVar(ctx, atom, flags))
+                    goto exception;
+            }
+            BREAK;
+        CASE(OP_define_func):
+            {
+                JSAtom atom;
+                int flags;
+                atom = get_u32(pc);
+                flags = pc[4];
+                pc += 5;
+                if (JS_DefineGlobalFunction(ctx, atom, sp[-1], flags))
+                    goto exception;
+                JS_FreeValue(ctx, sp[-1]);
+                sp--;
+            }
+            BREAK;
+
+        CASE(OP_get_loc):
+            {
+                int idx;
+                idx = get_u16(pc);
+                pc += 2;
+                sp[0] = JS_DupValue(ctx, var_buf[idx]);
+                sp++;
+            }
+            BREAK;
+        CASE(OP_put_loc):
+            {
+                int idx;
+                idx = get_u16(pc);
+                pc += 2;
+                set_value(ctx, &var_buf[idx], sp[-1]);
+                sp--;
+            }
+            BREAK;
+        CASE(OP_set_loc):
+            {
+                int idx;
+                idx = get_u16(pc);
+                pc += 2;
+                set_value(ctx, &var_buf[idx], JS_DupValue(ctx, sp[-1]));
+            }
+            BREAK;
+        CASE(OP_get_arg):
+            {
+                int idx;
+                idx = get_u16(pc);
+                pc += 2;
+                sp[0] = JS_DupValue(ctx, arg_buf[idx]);
+                sp++;
+            }
+            BREAK;
+        CASE(OP_put_arg):
+            {
+                int idx;
+                idx = get_u16(pc);
+                pc += 2;
+                set_value(ctx, &arg_buf[idx], sp[-1]);
+                sp--;
+            }
+            BREAK;
+        CASE(OP_set_arg):
+            {
+                int idx;
+                idx = get_u16(pc);
+                pc += 2;
+                set_value(ctx, &arg_buf[idx], JS_DupValue(ctx, sp[-1]));
+            }
+            BREAK;
+
+#if SHORT_OPCODES
+        CASE(OP_get_loc8): *sp++ = JS_DupValue(ctx, var_buf[*pc++]); BREAK;
+        CASE(OP_put_loc8): set_value(ctx, &var_buf[*pc++], *--sp); BREAK;
+        CASE(OP_set_loc8): set_value(ctx, &var_buf[*pc++], JS_DupValue(ctx, sp[-1])); BREAK;
+
+        CASE(OP_get_loc0): *sp++ = JS_DupValue(ctx, var_buf[0]); BREAK;
+        CASE(OP_get_loc1): *sp++ = JS_DupValue(ctx, var_buf[1]); BREAK;
+        CASE(OP_get_loc2): *sp++ = JS_DupValue(ctx, var_buf[2]); BREAK;
+        CASE(OP_get_loc3): *sp++ = JS_DupValue(ctx, var_buf[3]); BREAK;
+        CASE(OP_put_loc0): set_value(ctx, &var_buf[0], *--sp); BREAK;
+        CASE(OP_put_loc1): set_value(ctx, &var_buf[1], *--sp); BREAK;
+        CASE(OP_put_loc2): set_value(ctx, &var_buf[2], *--sp); BREAK;
+        CASE(OP_put_loc3): set_value(ctx, &var_buf[3], *--sp); BREAK;
+        CASE(OP_set_loc0): set_value(ctx, &var_buf[0], JS_DupValue(ctx, sp[-1])); BREAK;
+        CASE(OP_set_loc1): set_value(ctx, &var_buf[1], JS_DupValue(ctx, sp[-1])); BREAK;
+        CASE(OP_set_loc2): set_value(ctx, &var_buf[2], JS_DupValue(ctx, sp[-1])); BREAK;
+        CASE(OP_set_loc3): set_value(ctx, &var_buf[3], JS_DupValue(ctx, sp[-1])); BREAK;
+        CASE(OP_get_arg0): *sp++ = JS_DupValue(ctx, arg_buf[0]); BREAK;
+        CASE(OP_get_arg1): *sp++ = JS_DupValue(ctx, arg_buf[1]); BREAK;
+        CASE(OP_get_arg2): *sp++ = JS_DupValue(ctx, arg_buf[2]); BREAK;
+        CASE(OP_get_arg3): *sp++ = JS_DupValue(ctx, arg_buf[3]); BREAK;
+        CASE(OP_put_arg0): set_value(ctx, &arg_buf[0], *--sp); BREAK;
+        CASE(OP_put_arg1): set_value(ctx, &arg_buf[1], *--sp); BREAK;
+        CASE(OP_put_arg2): set_value(ctx, &arg_buf[2], *--sp); BREAK;
+        CASE(OP_put_arg3): set_value(ctx, &arg_buf[3], *--sp); BREAK;
+        CASE(OP_set_arg0): set_value(ctx, &arg_buf[0], JS_DupValue(ctx, sp[-1])); BREAK;
+        CASE(OP_set_arg1): set_value(ctx, &arg_buf[1], JS_DupValue(ctx, sp[-1])); BREAK;
+        CASE(OP_set_arg2): set_value(ctx, &arg_buf[2], JS_DupValue(ctx, sp[-1])); BREAK;
+        CASE(OP_set_arg3): set_value(ctx, &arg_buf[3], JS_DupValue(ctx, sp[-1])); BREAK;
+        CASE(OP_get_var_ref0): *sp++ = JS_DupValue(ctx, *var_refs[0]->pvalue); BREAK;
+        CASE(OP_get_var_ref1): *sp++ = JS_DupValue(ctx, *var_refs[1]->pvalue); BREAK;
+        CASE(OP_get_var_ref2): *sp++ = JS_DupValue(ctx, *var_refs[2]->pvalue); BREAK;
+        CASE(OP_get_var_ref3): *sp++ = JS_DupValue(ctx, *var_refs[3]->pvalue); BREAK;
+        CASE(OP_put_var_ref0): set_value(ctx, var_refs[0]->pvalue, *--sp); BREAK;
+        CASE(OP_put_var_ref1): set_value(ctx, var_refs[1]->pvalue, *--sp); BREAK;
+        CASE(OP_put_var_ref2): set_value(ctx, var_refs[2]->pvalue, *--sp); BREAK;
+        CASE(OP_put_var_ref3): set_value(ctx, var_refs[3]->pvalue, *--sp); BREAK;
+        CASE(OP_set_var_ref0): set_value(ctx, var_refs[0]->pvalue, JS_DupValue(ctx, sp[-1])); BREAK;
+        CASE(OP_set_var_ref1): set_value(ctx, var_refs[1]->pvalue, JS_DupValue(ctx, sp[-1])); BREAK;
+        CASE(OP_set_var_ref2): set_value(ctx, var_refs[2]->pvalue, JS_DupValue(ctx, sp[-1])); BREAK;
+        CASE(OP_set_var_ref3): set_value(ctx, var_refs[3]->pvalue, JS_DupValue(ctx, sp[-1])); BREAK;
+#endif
+
+        CASE(OP_get_var_ref):
+            {
+                int idx;
+                JSValue val;
+                idx = get_u16(pc);
+                pc += 2;
+                val = *var_refs[idx]->pvalue;
+                sp[0] = JS_DupValue(ctx, val);
+                sp++;
+            }
+            BREAK;
+        CASE(OP_put_var_ref):
+            {
+                int idx;
+                idx = get_u16(pc);
+                pc += 2;
+                set_value(ctx, var_refs[idx]->pvalue, sp[-1]);
+                sp--;
+            }
+            BREAK;
+        CASE(OP_set_var_ref):
+            {
+                int idx;
+                idx = get_u16(pc);
+                pc += 2;
+                set_value(ctx, var_refs[idx]->pvalue, JS_DupValue(ctx, sp[-1]));
+            }
+            BREAK;
+        CASE(OP_get_var_ref_check):
+            {
+                int idx;
+                JSValue val;
+                idx = get_u16(pc);
+                pc += 2;
+                val = *var_refs[idx]->pvalue;
+                if (unlikely(JS_IsUninitialized(val))) {
+                    JS_ThrowReferenceErrorUninitialized(ctx, JS_ATOM_NULL);
+                    goto exception;
+                }
+                sp[0] = JS_DupValue(ctx, val);
+                sp++;
+            }
+            BREAK;
+        CASE(OP_put_var_ref_check):
+            {
+                int idx;
+                idx = get_u16(pc);
+                pc += 2;
+                if (unlikely(JS_IsUninitialized(*var_refs[idx]->pvalue))) {
+                    JS_ThrowReferenceErrorUninitialized(ctx, JS_ATOM_NULL);
+                    goto exception;
+                }
+                set_value(ctx, var_refs[idx]->pvalue, sp[-1]);
+                sp--;
+            }
+            BREAK;
+        CASE(OP_put_var_ref_check_init):
+            {
+                int idx;
+                idx = get_u16(pc);
+                pc += 2;
+                if (unlikely(!JS_IsUninitialized(*var_refs[idx]->pvalue))) {
+                    JS_ThrowReferenceErrorUninitialized(ctx, JS_ATOM_NULL);
+                    goto exception;
+                }
+                set_value(ctx, var_refs[idx]->pvalue, sp[-1]);
+                sp--;
+            }
+            BREAK;
+        CASE(OP_set_loc_uninitialized):
+            {
+                int idx;
+                idx = get_u16(pc);
+                pc += 2;
+                set_value(ctx, &var_buf[idx], JS_UNINITIALIZED);
+            }
+            BREAK;
+        CASE(OP_get_loc_check):
+            {
+                int idx;
+                idx = get_u16(pc);
+                pc += 2;
+                if (unlikely(JS_IsUninitialized(var_buf[idx]))) {
+                    JS_ThrowReferenceErrorUninitialized(ctx, JS_ATOM_NULL);
+                    goto exception;
+                }
+                sp[0] = JS_DupValue(ctx, var_buf[idx]);
+                sp++;
+            }
+            BREAK;
+        CASE(OP_put_loc_check):
+            {
+                int idx;
+                idx = get_u16(pc);
+                pc += 2;
+                if (unlikely(JS_IsUninitialized(var_buf[idx]))) {
+                    JS_ThrowReferenceErrorUninitialized(ctx, JS_ATOM_NULL);
+                    goto exception;
+                }
+                set_value(ctx, &var_buf[idx], sp[-1]);
+                sp--;
+            }
+            BREAK;
+        CASE(OP_put_loc_check_init):
+            {
+                int idx;
+                idx = get_u16(pc);
+                pc += 2;
+                if (unlikely(!JS_IsUninitialized(var_buf[idx]))) {
+                    JS_ThrowReferenceError(ctx, "'this' can be initialized only once");
+                    goto exception;
+                }
+                set_value(ctx, &var_buf[idx], sp[-1]);
+                sp--;
+            }
+            BREAK;
+        CASE(OP_close_loc):
+            {
+                int idx;
+                idx = get_u16(pc);
+                pc += 2;
+                close_lexical_var(ctx, sf, idx, FALSE);
+            }
+            BREAK;
+
+        CASE(OP_make_loc_ref):
+        CASE(OP_make_arg_ref):
+        CASE(OP_make_var_ref_ref):
+            {
+                JSVarRef *var_ref;
+                JSProperty *pr;
+                JSAtom atom;
+                int idx;
+                atom = get_u32(pc);
+                idx = get_u16(pc + 4);
+                pc += 6;
+                *sp++ = JS_NewObjectProto(ctx, JS_NULL);
+                if (unlikely(JS_IsException(sp[-1])))
+                    goto exception;
+                if (opcode == OP_make_var_ref_ref) {
+                    var_ref = var_refs[idx];
+                    var_ref->header.ref_count++;
+                } else {
+                    var_ref = get_var_ref(ctx, sf, idx, opcode == OP_make_arg_ref);
+                    if (!var_ref)
+                        goto exception;
+                }
+                pr = add_property(ctx, JS_VALUE_GET_OBJ(sp[-1]), atom,
+                                  JS_PROP_WRITABLE | JS_PROP_VARREF);
+                if (!pr) {
+                    free_var_ref(ctx->rt, var_ref);
+                    goto exception;
+                }
+                pr->u.var_ref = var_ref;
+                *sp++ = JS_AtomToValue(ctx, atom);
+            }
+            BREAK;
+        CASE(OP_make_var_ref):
+            {
+                JSAtom atom;
+                atom = get_u32(pc);
+                pc += 4;
+
+                if (JS_GetGlobalVarRef(ctx, atom, sp))
+                    goto exception;
+                sp += 2;
+            }
+            BREAK;
+
+        CASE(OP_goto):
+            pc += (int32_t)get_u32(pc);
+            if (unlikely(js_poll_interrupts(ctx)))
+                goto exception;
+            BREAK;
+#if SHORT_OPCODES
+        CASE(OP_goto16):
+            pc += (int16_t)get_u16(pc);
+            if (unlikely(js_poll_interrupts(ctx)))
+                goto exception;
+            BREAK;
+        CASE(OP_goto8):
+            pc += (int8_t)pc[0];
+            if (unlikely(js_poll_interrupts(ctx)))
+                goto exception;
+            BREAK;
+#endif
+        CASE(OP_if_true):
+            {
+                int res;
+                JSValue op1;
+
+                op1 = sp[-1];
+                pc += 4;
+                if ((uint32_t)JS_VALUE_GET_TAG(op1) <= JS_TAG_UNDEFINED) {
+                    res = JS_VALUE_GET_INT(op1);
+                } else {
+                    res = JS_ToBoolFree(ctx, op1);
+                }
+                sp--;
+                if (res) {
+                    pc += (int32_t)get_u32(pc - 4) - 4;
+                }
+                if (unlikely(js_poll_interrupts(ctx)))
+                    goto exception;
+            }
+            BREAK;
+        CASE(OP_if_false):
+            {
+                int res;
+                JSValue op1;
+
+                op1 = sp[-1];
+                pc += 4;
+                if ((uint32_t)JS_VALUE_GET_TAG(op1) <= JS_TAG_UNDEFINED) {
+                    res = JS_VALUE_GET_INT(op1);
+                } else {
+                    res = JS_ToBoolFree(ctx, op1);
+                }
+                sp--;
+                if (!res) {
+                    pc += (int32_t)get_u32(pc - 4) - 4;
+                }
+                if (unlikely(js_poll_interrupts(ctx)))
+                    goto exception;
+            }
+            BREAK;
+#if SHORT_OPCODES
+        CASE(OP_if_true8):
+            {
+                int res;
+                JSValue op1;
+
+                op1 = sp[-1];
+                pc += 1;
+                if ((uint32_t)JS_VALUE_GET_TAG(op1) <= JS_TAG_UNDEFINED) {
+                    res = JS_VALUE_GET_INT(op1);
+                } else {
+                    res = JS_ToBoolFree(ctx, op1);
+                }
+                sp--;
+                if (res) {
+                    pc += (int8_t)pc[-1] - 1;
+                }
+                if (unlikely(js_poll_interrupts(ctx)))
+                    goto exception;
+            }
+            BREAK;
+        CASE(OP_if_false8):
+            {
+                int res;
+                JSValue op1;
+
+                op1 = sp[-1];
+                pc += 1;
+                if ((uint32_t)JS_VALUE_GET_TAG(op1) <= JS_TAG_UNDEFINED) {
+                    res = JS_VALUE_GET_INT(op1);
+                } else {
+                    res = JS_ToBoolFree(ctx, op1);
+                }
+                sp--;
+                if (!res) {
+                    pc += (int8_t)pc[-1] - 1;
+                }
+                if (unlikely(js_poll_interrupts(ctx)))
+                    goto exception;
+            }
+            BREAK;
+#endif
+        CASE(OP_catch):
+            {
+                int32_t diff;
+                diff = get_u32(pc);
+                sp[0] = JS_NewCatchOffset(ctx, pc + diff - b->byte_code_buf);
+                sp++;
+                pc += 4;
+            }
+            BREAK;
+        CASE(OP_gosub):
+            {
+                int32_t diff;
+                diff = get_u32(pc);
+                /* XXX: should have a different tag to avoid security flaw */
+                sp[0] = JS_NewInt32(ctx, pc + 4 - b->byte_code_buf);
+                sp++;
+                pc += diff;
+            }
+            BREAK;
+        CASE(OP_ret):
+            {
+                JSValue op1;
+                uint32_t pos;
+                op1 = sp[-1];
+                if (unlikely(JS_VALUE_GET_TAG(op1) != JS_TAG_INT))
+                    goto ret_fail;
+                pos = JS_VALUE_GET_INT(op1);
+                if (unlikely(pos >= b->byte_code_len)) {
+                ret_fail:
+                    JS_ThrowInternalError(ctx, "invalid ret value");
+                    goto exception;
+                }
+                sp--;
+                pc = b->byte_code_buf + pos;
+            }
+            BREAK;
+
+        CASE(OP_for_in_start):
+            if (js_for_in_start(ctx, sp))
+                goto exception;
+            BREAK;
+        CASE(OP_for_in_next):
+            if (js_for_in_next(ctx, sp))
+                goto exception;
+            sp += 2;
+            BREAK;
+        CASE(OP_for_of_start):
+            if (js_for_of_start(ctx, sp, FALSE))
+                goto exception;
+            sp += 1;
+            *sp++ = JS_NewCatchOffset(ctx, 0);
+            BREAK;
+        CASE(OP_for_of_next):
+            {
+                int offset = -3 - pc[0];
+                pc += 1;
+                if (js_for_of_next(ctx, sp, offset))
+                    goto exception;
+                sp += 2;
+            }
+            BREAK;
+        CASE(OP_for_await_of_start):
+            if (js_for_of_start(ctx, sp, TRUE))
+                goto exception;
+            sp += 1;
+            *sp++ = JS_NewCatchOffset(ctx, 0);
+            BREAK;
+        CASE(OP_for_await_of_next):
+            if (js_for_await_of_next(ctx, sp))
+                goto exception;
+            sp += 1;
+            BREAK;
+        CASE(OP_iterator_get_value_done):
+            if (js_iterator_get_value_done(ctx, sp))
+                goto exception;
+            sp += 1;
+            BREAK;
+
+        CASE(OP_iterator_close):
+            sp--; /* drop the catch offset to avoid getting caught by exception */
+            JS_FreeValue(ctx, sp[-1]); /* drop the next method */
+            sp--;
+            if (!JS_IsUndefined(sp[-1])) {
+                if (JS_IteratorClose(ctx, sp[-1], FALSE))
+                    goto exception;
+                JS_FreeValue(ctx, sp[-1]);
+            }
+            sp--;
+            BREAK;
+        CASE(OP_iterator_close_return):
+            {
+                JSValue ret_val;
+                /* iter_obj next catch_offset ... ret_val ->
+                   ret_eval iter_obj next catch_offset */
+                ret_val = *--sp;
+                while (sp > stack_buf &&
+                       JS_VALUE_GET_TAG(sp[-1]) != JS_TAG_CATCH_OFFSET) {
+                    JS_FreeValue(ctx, *--sp);
+                }
+                if (unlikely(sp < stack_buf + 3)) {
+                    JS_ThrowInternalError(ctx, "iterator_close_return");
+                    JS_FreeValue(ctx, ret_val);
+                    goto exception;
+                }
+                sp[0] = sp[-1];
+                sp[-1] = sp[-2];
+                sp[-2] = sp[-3];
+                sp[-3] = ret_val;
+                sp++;
+            }
+            BREAK;
+
+        CASE(OP_async_iterator_close):
+            /* iter_obj next catch_offset -> value flag */
+            {
+                JSValue ret, method;
+                int ret_flag;
+                method = JS_GetProperty(ctx, sp[-3], JS_ATOM_return);
+                if (JS_IsException(method))
+                    goto exception;
+                if (JS_IsUndefined(method) || JS_IsNull(method)) {
+                    ret = JS_UNDEFINED;
+                    ret_flag = TRUE;
+                } else {
+                    ret = JS_CallFree(ctx, method, sp[-3], 0, NULL);
+                    if (JS_IsException(ret))
+                        goto exception;
+                    ret_flag = FALSE;
+                }
+                JS_FreeValue(ctx, sp[-3]);
+                JS_FreeValue(ctx, sp[-2]);
+                JS_FreeValue(ctx, sp[-1]);
+                sp[-3] = ret;
+                sp[-2] = JS_NewBool(ctx, ret_flag);
+                sp -= 1;
+            }
+            BREAK;
+
+        CASE(OP_async_iterator_next):
+            /* stack: iter_obj next catch_offset val */
+            {
+                JSValue ret;
+                ret = JS_Call(ctx, sp[-3], sp[-4],
+                              1, (JSValueConst *)(sp - 1));
+                if (JS_IsException(ret))
+                    goto exception;
+                JS_FreeValue(ctx, sp[-1]);
+                sp[-1] = ret;
+            }
+            BREAK;
+
+        CASE(OP_async_iterator_get):
+            /* stack: iter_obj next catch_offset val */
+            {
+                JSValue method, ret;
+                BOOL ret_flag;
+                int flags;
+                flags = *pc++;
+                if (flags == 2) {
+                    JS_ThrowTypeError(ctx, "iterator does not have a throw method");
+                    goto exception;
+                }
+                method = JS_GetProperty(ctx, sp[-4], flags ? JS_ATOM_throw : JS_ATOM_return);
+                if (JS_IsException(method))
+                    goto exception;
+                if (JS_IsUndefined(method) || JS_IsNull(method)) {
+                    ret_flag = TRUE;
+                } else {
+                    ret = JS_CallFree(ctx, method, sp[-4],
+                                      1, (JSValueConst *)(sp - 1));
+                    if (JS_IsException(ret))
+                        goto exception;
+                    JS_FreeValue(ctx, sp[-1]);
+                    sp[-1] = ret;
+                    ret_flag = FALSE;
+                }
+                sp[0] = JS_NewBool(ctx, ret_flag);
+                sp += 1;
+            }
+            BREAK;
+
+        CASE(OP_lnot):
+            {
+                int res;
+                JSValue op1;
+
+                op1 = sp[-1];
+                if ((uint32_t)JS_VALUE_GET_TAG(op1) <= JS_TAG_UNDEFINED) {
+                    res = JS_VALUE_GET_INT(op1) != 0;
+                } else {
+                    res = JS_ToBoolFree(ctx, op1);
+                }
+                sp[-1] = JS_NewBool(ctx, !res);
+            }
+            BREAK;
+
+        CASE(OP_get_field):
+            {
+                JSValue val;
+                JSAtom atom;
+                atom = get_u32(pc);
+                pc += 4;
+
+                val = JS_GetProperty(ctx, sp[-1], atom);
+                if (unlikely(JS_IsException(val)))
+                    goto exception;
+                JS_FreeValue(ctx, sp[-1]);
+                sp[-1] = val;
+            }
+            BREAK;
+
+        CASE(OP_get_field2):
+            {
+                JSValue val;
+                JSAtom atom;
+                atom = get_u32(pc);
+                pc += 4;
+
+                val = JS_GetProperty(ctx, sp[-1], atom);
+                if (unlikely(JS_IsException(val)))
+                    goto exception;
+                *sp++ = val;
+            }
+            BREAK;
+
+        CASE(OP_put_field):
+            {
+                int ret;
+                JSAtom atom;
+                atom = get_u32(pc);
+                pc += 4;
+
+                ret = JS_SetPropertyInternal(ctx, sp[-2], atom, sp[-1],
+                                             JS_PROP_THROW_STRICT);
+                JS_FreeValue(ctx, sp[-2]);
+                sp -= 2;
+                if (unlikely(ret < 0))
+                    goto exception;
+            }
+            BREAK;
+
+        CASE(OP_define_field):
+            {
+                int ret;
+                JSAtom atom;
+                atom = get_u32(pc);
+                pc += 4;
+
+                ret = JS_DefinePropertyValue(ctx, sp[-2], atom, sp[-1],
+                                             JS_PROP_C_W_E | JS_PROP_THROW);
+                sp--;
+                if (unlikely(ret < 0))
+                    goto exception;
+            }
+            BREAK;
+
+        CASE(OP_set_name):
+            {
+                int ret;
+                JSAtom atom;
+                atom = get_u32(pc);
+                pc += 4;
+
+                ret = JS_DefineObjectName(ctx, sp[-1], atom, JS_PROP_CONFIGURABLE);
+                if (unlikely(ret < 0))
+                    goto exception;
+            }
+            BREAK;
+        CASE(OP_set_name_computed):
+            {
+                int ret;
+                ret = JS_DefineObjectNameComputed(ctx, sp[-1], sp[-2], JS_PROP_CONFIGURABLE);
+                if (unlikely(ret < 0))
+                    goto exception;
+            }
+            BREAK;
+        CASE(OP_set_proto):
+            {
+                JSValue proto;
+                proto = sp[-1];
+                if (JS_IsObject(proto) || JS_IsNull(proto)) {
+                    if (JS_SetPrototypeInternal(ctx, sp[-2], proto, TRUE) < 0)
+                        goto exception;
+                }
+                JS_FreeValue(ctx, proto);
+                sp--;
+            }
+            BREAK;
+        CASE(OP_define_method):
+        CASE(OP_define_method_computed):
+            {
+                JSValue getter, setter, value;
+                JSValueConst obj;
+                JSAtom atom;
+                int flags, ret, op_flags;
+                BOOL is_computed;
+#define OP_DEFINE_METHOD_METHOD 0
+#define OP_DEFINE_METHOD_GETTER 1
+#define OP_DEFINE_METHOD_SETTER 2
+#define OP_DEFINE_METHOD_ENUMERABLE 4
+
+                is_computed = (opcode == OP_define_method_computed);
+                if (is_computed) {
+                    atom = js_value_to_atom(ctx, sp[-2]);
+                    if (unlikely(atom == JS_ATOM_NULL))
+                        goto exception;
+                    opcode += OP_define_method - OP_define_method_computed;
+                } else {
+                    atom = get_u32(pc);
+                    pc += 4;
+                }
+                op_flags = *pc++;
+
+                obj = sp[-2 - is_computed];
+                flags = JS_PROP_HAS_CONFIGURABLE | JS_PROP_CONFIGURABLE |
+                    JS_PROP_HAS_ENUMERABLE | JS_PROP_THROW;
+                if (op_flags & OP_DEFINE_METHOD_ENUMERABLE)
+                    flags |= JS_PROP_ENUMERABLE;
+                op_flags &= 3;
+                value = JS_UNDEFINED;
+                getter = JS_UNDEFINED;
+                setter = JS_UNDEFINED;
+                if (op_flags == OP_DEFINE_METHOD_METHOD) {
+                    value = sp[-1];
+                    flags |= JS_PROP_HAS_VALUE | JS_PROP_HAS_WRITABLE | JS_PROP_WRITABLE;
+                } else if (op_flags == OP_DEFINE_METHOD_GETTER) {
+                    getter = sp[-1];
+                    flags |= JS_PROP_HAS_GET;
+                } else {
+                    setter = sp[-1];
+                    flags |= JS_PROP_HAS_SET;
+                }
+                ret = js_method_set_properties(ctx, sp[-1], atom, flags, obj);
+                if (ret >= 0) {
+                    ret = JS_DefineProperty(ctx, obj, atom, value,
+                                            getter, setter, flags);
+                }
+                JS_FreeValue(ctx, sp[-1]);
+                if (is_computed) {
+                    JS_FreeAtom(ctx, atom);
+                    JS_FreeValue(ctx, sp[-2]);
+                }
+                sp -= 1 + is_computed;
+                if (unlikely(ret < 0))
+                    goto exception;
+            }
+            BREAK;
+
+        CASE(OP_define_class):
+            {
+                int class_flags;
+
+                class_flags = *pc++;
+                if (js_op_define_class(ctx, sp, class_flags,
+                                       var_refs, sf) < 0)
+                    goto exception;
+            }
+            BREAK;
+
+        CASE(OP_get_array_el):
+            {
+                JSValue val;
+
+                val = JS_GetPropertyValue(ctx, sp[-2], sp[-1]);
+                JS_FreeValue(ctx, sp[-2]);
+                sp[-2] = val;
+                sp--;
+                if (unlikely(JS_IsException(val)))
+                    goto exception;
+            }
+            BREAK;
+
+        CASE(OP_get_array_el2):
+            {
+                JSValue val;
+
+                val = JS_GetPropertyValue(ctx, sp[-2], sp[-1]);
+                sp[-1] = val;
+                if (unlikely(JS_IsException(val)))
+                    goto exception;
+            }
+            BREAK;
+
+        CASE(OP_get_ref_value):
+            {
+                JSValue val;
+                if (unlikely(JS_IsUndefined(sp[-2]))) {
+                    JSAtom atom = js_value_to_atom(ctx, sp[-1]);
+                    if (atom != JS_ATOM_NULL) {
+                        JS_ThrowReferenceErrorNotDefined(ctx, atom);
+                        JS_FreeAtom(ctx, atom);
+                    }
+                    goto exception;
+                }
+                val = JS_GetPropertyValue(ctx, sp[-2],
+                                          JS_DupValue(ctx, sp[-1]));
+                if (unlikely(JS_IsException(val)))
+                    goto exception;
+                sp[0] = val;
+                sp++;
+            }
+            BREAK;
+
+        CASE(OP_get_super_value):
+            {
+                JSValue val;
+                JSAtom atom;
+                atom = js_value_to_atom(ctx, sp[-1]);
+                if (unlikely(atom == JS_ATOM_NULL))
+                    goto exception;
+                val = JS_GetPropertyInternal(ctx, sp[-2], atom, sp[-3], FALSE);
+                JS_FreeAtom(ctx, atom);
+                if (unlikely(JS_IsException(val)))
+                    goto exception;
+                JS_FreeValue(ctx, sp[-1]);
+                JS_FreeValue(ctx, sp[-2]);
+                JS_FreeValue(ctx, sp[-3]);
+                sp[-3] = val;
+                sp -= 2;
+            }
+            BREAK;
+
+        CASE(OP_put_array_el):
+            {
+                int ret;
+
+                ret = JS_SetPropertyValue(ctx, sp[-3], sp[-2], sp[-1], JS_PROP_THROW_STRICT);
+                JS_FreeValue(ctx, sp[-3]);
+                sp -= 3;
+                if (unlikely(ret < 0))
+                    goto exception;
+            }
+            BREAK;
+
+        CASE(OP_put_ref_value):
+            {
+                int ret;
+                if (unlikely(JS_IsUndefined(sp[-3]))) {
+                    if (is_strict_mode(ctx)) {
+                        JSAtom atom = js_value_to_atom(ctx, sp[-2]);
+                        if (atom != JS_ATOM_NULL) {
+                            JS_ThrowReferenceErrorNotDefined(ctx, atom);
+                            JS_FreeAtom(ctx, atom);
+                        }
+                        goto exception;
+                    } else {
+                        sp[-3] = JS_DupValue(ctx, ctx->global_obj);
+                    }
+                }
+                ret = JS_SetPropertyValue(ctx, sp[-3], sp[-2], sp[-1], JS_PROP_THROW_STRICT);
+                JS_FreeValue(ctx, sp[-3]);
+                sp -= 3;
+                if (unlikely(ret < 0))
+                    goto exception;
+            }
+            BREAK;
+
+        CASE(OP_put_super_value):
+            {
+                int ret;
+                JSAtom atom;
+                if (JS_VALUE_GET_TAG(sp[-3]) != JS_TAG_OBJECT) {
+                    JS_ThrowTypeErrorNotAnObject(ctx);
+                    goto exception;
+                }
+                atom = js_value_to_atom(ctx, sp[-2]);
+                if (unlikely(atom == JS_ATOM_NULL))
+                    goto exception;
+                ret = JS_SetPropertyGeneric(ctx, JS_VALUE_GET_OBJ(sp[-3]),
+                                            atom, sp[-1], sp[-4],
+                                            JS_PROP_THROW_STRICT);
+                JS_FreeAtom(ctx, atom);
+                if (ret < 0)
+                    goto exception;
+                JS_FreeValue(ctx, sp[-4]);
+                JS_FreeValue(ctx, sp[-3]);
+                JS_FreeValue(ctx, sp[-2]);
+                sp -= 4;
+            }
+            BREAK;
+
+        CASE(OP_define_array_el):
+            {
+                int ret;
+                ret = JS_DefinePropertyValueValue(ctx, sp[-3], JS_DupValue(ctx, sp[-2]), sp[-1],
+                                                  JS_PROP_C_W_E | JS_PROP_THROW);
+                sp -= 1;
+                if (unlikely(ret < 0))
+                    goto exception;
+            }
+            BREAK;
+
+        CASE(OP_append):    /* array pos enumobj -- array pos */
+            {
+                if (js_append_enumerate(ctx, sp))
+                    goto exception;
+                JS_FreeValue(ctx, *--sp);
+            }
+            BREAK;
+
+        CASE(OP_copy_data_properties):    /* target source excludeList */
+            {
+                /* stack offsets (-1 based):
+                   2 bits for target,
+                   3 bits for source,
+                   2 bits for exclusionList */
+                int mask;
+
+                mask = *pc++;
+                if (JS_CopyDataProperties(ctx, sp[-1 - (mask & 3)],
+                                          sp[-1 - ((mask >> 2) & 7)],
+                                          sp[-1 - ((mask >> 5) & 7)], 0))
+                    goto exception;
+            }
+            BREAK;
+
+        CASE(OP_add):
+            {
+                JSValue op1, op2;
+                op1 = sp[-2];
+                op2 = sp[-1];
+                if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+                    int64_t r;
+                    r = (int64_t)JS_VALUE_GET_INT(op1) + JS_VALUE_GET_INT(op2);
+                    if (unlikely((int)r != r))
+                        goto add_slow;
+                    sp[-2] = JS_NewInt32(ctx, r);
+                    sp--;
+                } else if (JS_VALUE_IS_BOTH_FLOAT(op1, op2)) {
+                    sp[-2] = __JS_NewFloat64(ctx, JS_VALUE_GET_FLOAT64(op1) +
+                                             JS_VALUE_GET_FLOAT64(op2));
+                    sp--;
+                } else {
+                add_slow:
+                    if (js_add_slow(ctx, sp))
+                        goto exception;
+                    sp--;
+                }
+            }
+            BREAK;
+        CASE(OP_add_loc):
+            {
+                JSValue ops[2];
+                int idx;
+                idx = *pc;
+                pc += 1;
+
+                ops[0] = var_buf[idx];
+                ops[1] = sp[-1];
+                if (likely(JS_VALUE_IS_BOTH_INT(ops[0], ops[1]))) {
+                    int64_t r;
+                    r = (int64_t)JS_VALUE_GET_INT(ops[0]) + JS_VALUE_GET_INT(ops[1]);
+                    if (unlikely((int)r != r))
+                        goto add_loc_slow;
+                    var_buf[idx] = JS_NewInt32(ctx, r);
+                    sp--;
+                } else if (JS_VALUE_GET_TAG(ops[0]) == JS_TAG_STRING) {
+                    ops[0] = JS_ConcatString(ctx, ops[0], ops[1]);
+                    sp--;
+                    if (JS_IsException(ops[0])) {
+                        var_buf[idx] = JS_UNDEFINED;
+                        goto exception;
+                    }
+                    var_buf[idx] = ops[0];
+                } else {
+                add_loc_slow:
+                    /* XXX: change API */
+                    if (js_add_slow(ctx, ops + 2))
+                        goto exception;
+                    var_buf[idx] = ops[0];
+                    sp--;
+                }
+            }
+            BREAK;
+        CASE(OP_sub):
+            {
+                JSValue op1, op2;
+                op1 = sp[-2];
+                op2 = sp[-1];
+                if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+                    int64_t r;
+                    r = (int64_t)JS_VALUE_GET_INT(op1) - JS_VALUE_GET_INT(op2);
+                    if (unlikely((int)r != r))
+                        goto binary_arith_slow;
+                    sp[-2] = JS_NewInt32(ctx, r);
+                    sp--;
+                } else if (JS_VALUE_IS_BOTH_FLOAT(op1, op2)) {
+                    sp[-2] = __JS_NewFloat64(ctx, JS_VALUE_GET_FLOAT64(op1) -
+                                             JS_VALUE_GET_FLOAT64(op2));
+                    sp--;
+                } else {
+                    goto binary_arith_slow;
+                }
+            }
+            BREAK;
+        CASE(OP_mul):
+            {
+                JSValue op1, op2;
+                double d;
+                op1 = sp[-2];
+                op2 = sp[-1];
+                if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+                    int32_t v1, v2;
+                    int64_t r;
+                    v1 = JS_VALUE_GET_INT(op1);
+                    v2 = JS_VALUE_GET_INT(op2);
+                    r = (int64_t)v1 * v2;
+#ifdef CONFIG_BIGNUM
+                    if (unlikely((int)r != r) || (r == 0 && !is_bignum_mode(ctx)))
+                        goto binary_arith_slow;
+#else
+                    if (unlikely((int)r != r)) {
+                        d = (double)r;
+                        goto mul_fp_res;
+                    }
+                    /* need to test zero case for -0 result */
+                    if (unlikely(r == 0 && (v1 | v2) < 0)) {
+                        d = -0.0;
+                        goto mul_fp_res;
+                    }
+#endif
+                    sp[-2] = JS_NewInt32(ctx, r);
+                    sp--;
+                } else if (JS_VALUE_IS_BOTH_FLOAT(op1, op2)) {
+                    d = JS_VALUE_GET_FLOAT64(op1) * JS_VALUE_GET_FLOAT64(op2);
+#ifndef CONFIG_BIGNUM
+                mul_fp_res:
+#endif
+                    sp[-2] = __JS_NewFloat64(ctx, d);
+                    sp--;
+                } else {
+                    goto binary_arith_slow;
+                }
+            }
+            BREAK;
+#ifdef CONFIG_BIGNUM
+        CASE(OP_math_div):
+        CASE(OP_div):
+            goto binary_arith_slow;
+#else
+        CASE(OP_div):
+            {
+                JSValue op1, op2;
+                op1 = sp[-2];
+                op2 = sp[-1];
+                if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+                    int v1, v2;
+                    v1 = JS_VALUE_GET_INT(op1);
+                    v2 = JS_VALUE_GET_INT(op2);
+                    sp[-2] = JS_NewFloat64(ctx, (double)v1 / (double)v2);
+                    sp--;
+                } else {
+                    goto binary_arith_slow;
+                }
+            }
+            BREAK;
+#endif
+        CASE(OP_mod):
+#ifdef CONFIG_BIGNUM
+        CASE(OP_math_mod):
+#endif
+            {
+                JSValue op1, op2;
+                op1 = sp[-2];
+                op2 = sp[-1];
+                if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+                    int v1, v2, r;
+                    v1 = JS_VALUE_GET_INT(op1);
+                    v2 = JS_VALUE_GET_INT(op2);
+                    /* We must avoid v2 = 0, v1 = INT32_MIN and v2 =
+                       -1 and the cases where the result is -0. */
+                    if (unlikely(v1 < 0 || v2 <= 0))
+                        goto binary_arith_slow;
+                    r = v1 % v2;
+                    sp[-2] = JS_NewInt32(ctx, r);
+                    sp--;
+                } else {
+                    goto binary_arith_slow;
+                }
+            }
+            BREAK;
+        CASE(OP_pow):
+#ifdef CONFIG_BIGNUM
+        CASE(OP_math_pow):
+#endif
+        binary_arith_slow:
+            if (js_binary_arith_slow(ctx, sp, opcode))
+                goto exception;
+            sp--;
+            BREAK;
+
+        CASE(OP_plus):
+            {
+                JSValue op1;
+                uint32_t tag;
+                op1 = sp[-1];
+                tag = JS_VALUE_GET_TAG(op1);
+                if (tag == JS_TAG_INT || JS_TAG_IS_FLOAT64(tag)) {
+                } else {
+                    if (js_unary_arith_slow(ctx, sp, opcode))
+                        goto exception;
+                }
+            }
+            BREAK;
+        CASE(OP_neg):
+            {
+                JSValue op1;
+                uint32_t tag;
+                int val;
+                double d;
+                op1 = sp[-1];
+                tag = JS_VALUE_GET_TAG(op1);
+                if (tag == JS_TAG_INT) {
+                    val = JS_VALUE_GET_INT(op1);
+#ifdef CONFIG_BIGNUM
+                    if (unlikely(val == INT32_MIN) ||
+                        (val == 0 && !is_bignum_mode(ctx)))
+                        goto slow_neg;
+#else
+                    /* Note: -0 cannot be expressed as integer */
+                    if (unlikely(val == 0)) {
+                        d = -0.0;
+                        goto neg_fp_res;
+                    }
+                    if (unlikely(val == INT32_MIN)) {
+                        d = -(double)val;
+                        goto neg_fp_res;
+                    }
+#endif
+                    sp[-1] = JS_NewInt32(ctx, -val);
+                } else if (JS_TAG_IS_FLOAT64(tag)) {
+                    d = -JS_VALUE_GET_FLOAT64(op1);
+#ifndef CONFIG_BIGNUM
+                neg_fp_res:
+#endif
+                    sp[-1] = __JS_NewFloat64(ctx, d);
+                } else {
+#ifdef CONFIG_BIGNUM
+                slow_neg:
+#endif
+                    if (js_unary_arith_slow(ctx, sp, opcode))
+                        goto exception;
+                }
+            }
+            BREAK;
+        CASE(OP_inc):
+            {
+                JSValue op1;
+                int val;
+                op1 = sp[-1];
+                if (JS_VALUE_GET_TAG(op1) == JS_TAG_INT) {
+                    val = JS_VALUE_GET_INT(op1);
+                    if (unlikely(val == INT32_MAX))
+                        goto inc_slow;
+                    sp[-1] = JS_NewInt32(ctx, val + 1);
+                } else {
+                inc_slow:
+                    if (js_unary_arith_slow(ctx, sp, opcode))
+                        goto exception;
+                }
+            }
+            BREAK;
+        CASE(OP_dec):
+            {
+                JSValue op1;
+                int val;
+                op1 = sp[-1];
+                if (JS_VALUE_GET_TAG(op1) == JS_TAG_INT) {
+                    val = JS_VALUE_GET_INT(op1);
+                    if (unlikely(val == INT32_MIN))
+                        goto dec_slow;
+                    sp[-1] = JS_NewInt32(ctx, val - 1);
+                } else {
+                dec_slow:
+                    if (js_unary_arith_slow(ctx, sp, opcode))
+                        goto exception;
+                }
+            }
+            BREAK;
+        CASE(OP_post_inc):
+        CASE(OP_post_dec):
+            if (js_post_inc_slow(ctx, sp, opcode))
+                goto exception;
+            sp++;
+            BREAK;
+        CASE(OP_inc_loc):
+            {
+                JSValue op1;
+                int val;
+                int idx;
+                idx = *pc;
+                pc += 1;
+
+                op1 = var_buf[idx];
+                if (JS_VALUE_GET_TAG(op1) == JS_TAG_INT) {
+                    val = JS_VALUE_GET_INT(op1);
+                    if (unlikely(val == INT32_MAX))
+                        goto inc_loc_slow;
+                    var_buf[idx] = JS_NewInt32(ctx, val + 1);
+                } else {
+                inc_loc_slow:
+                    if (js_unary_arith_slow(ctx, var_buf + idx + 1, OP_inc))
+                        goto exception;
+                }
+            }
+            BREAK;
+        CASE(OP_dec_loc):
+            {
+                JSValue op1;
+                int val;
+                int idx;
+                idx = *pc;
+                pc += 1;
+
+                op1 = var_buf[idx];
+                if (JS_VALUE_GET_TAG(op1) == JS_TAG_INT) {
+                    val = JS_VALUE_GET_INT(op1);
+                    if (unlikely(val == INT32_MIN))
+                        goto dec_loc_slow;
+                    var_buf[idx] = JS_NewInt32(ctx, val - 1);
+                } else {
+                dec_loc_slow:
+                    if (js_unary_arith_slow(ctx, var_buf + idx + 1, OP_dec))
+                        goto exception;
+                }
+            }
+            BREAK;
+        CASE(OP_not):
+            {
+                JSValue op1;
+                op1 = sp[-1];
+                if (JS_VALUE_GET_TAG(op1) == JS_TAG_INT) {
+                    sp[-1] = JS_NewInt32(ctx, ~JS_VALUE_GET_INT(op1));
+                } else {
+                    if (js_not_slow(ctx, sp))
+                        goto exception;
+                }
+            }
+            BREAK;
+
+        CASE(OP_shl):
+            {
+                JSValue op1, op2;
+                op1 = sp[-2];
+                op2 = sp[-1];
+                if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+                    uint32_t v1, v2;
+                    v1 = JS_VALUE_GET_INT(op1);
+                    v2 = JS_VALUE_GET_INT(op2);
+#ifdef CONFIG_BIGNUM
+                    {
+                        int64_t r;
+                        if (is_bignum_mode(ctx)) {
+                            if (v2 > 0x1f)
+                                goto shl_slow;
+                            r = (int64_t)v1 << v2;
+                            if ((int)r != r)
+                                goto shl_slow;
+                        } else {
+                            v2 &= 0x1f;
+                        }
+                    }
+#else
+                    v2 &= 0x1f;
+#endif
+                    sp[-2] = JS_NewInt32(ctx, v1 << v2);
+                    sp--;
+                } else {
+#ifdef CONFIG_BIGNUM
+                shl_slow:
+#endif
+                    if (js_binary_logic_slow(ctx, sp, opcode))
+                        goto exception;
+                    sp--;
+                }
+            }
+            BREAK;
+        CASE(OP_shr):
+            {
+                JSValue op1, op2;
+                op1 = sp[-2];
+                op2 = sp[-1];
+                if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+                    uint32_t v2;
+                    v2 = JS_VALUE_GET_INT(op2);
+                    /* v1 >>> v2 retains its JS semantics if CONFIG_BIGNUM */
+                    v2 &= 0x1f;
+                    sp[-2] = JS_NewUint32(ctx,
+                                          (uint32_t)JS_VALUE_GET_INT(op1) >>
+                                          v2);
+                    sp--;
+                } else {
+                    if (js_shr_slow(ctx, sp))
+                        goto exception;
+                    sp--;
+                }
+            }
+            BREAK;
+        CASE(OP_sar):
+            {
+                JSValue op1, op2;
+                op1 = sp[-2];
+                op2 = sp[-1];
+                if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+                    uint32_t v2;
+                    v2 = JS_VALUE_GET_INT(op2);
+#ifdef CONFIG_BIGNUM
+                    if (unlikely(v2 > 0x1f)) {
+                        if (is_bignum_mode(ctx))
+                            goto sar_slow;
+                        else
+                            v2 &= 0x1f;
+                    }
+#else
+                    v2 &= 0x1f;
+#endif
+                    sp[-2] = JS_NewInt32(ctx,
+                                          (int)JS_VALUE_GET_INT(op1) >> v2);
+                    sp--;
+                } else {
+#ifdef CONFIG_BIGNUM
+                sar_slow:
+#endif
+                    if (js_binary_logic_slow(ctx, sp, opcode))
+                        goto exception;
+                    sp--;
+                }
+            }
+            BREAK;
+        CASE(OP_and):
+            {
+                JSValue op1, op2;
+                op1 = sp[-2];
+                op2 = sp[-1];
+                if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+                    sp[-2] = JS_NewInt32(ctx,
+                                         JS_VALUE_GET_INT(op1) &
+                                         JS_VALUE_GET_INT(op2));
+                    sp--;
+                } else {
+                    if (js_binary_logic_slow(ctx, sp, opcode))
+                        goto exception;
+                    sp--;
+                }
+            }
+            BREAK;
+        CASE(OP_or):
+            {
+                JSValue op1, op2;
+                op1 = sp[-2];
+                op2 = sp[-1];
+                if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+                    sp[-2] = JS_NewInt32(ctx,
+                                         JS_VALUE_GET_INT(op1) |
+                                         JS_VALUE_GET_INT(op2));
+                    sp--;
+                } else {
+                    if (js_binary_logic_slow(ctx, sp, opcode))
+                        goto exception;
+                    sp--;
+                }
+            }
+            BREAK;
+        CASE(OP_xor):
+            {
+                JSValue op1, op2;
+                op1 = sp[-2];
+                op2 = sp[-1];
+                if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {
+                    sp[-2] = JS_NewInt32(ctx,
+                                         JS_VALUE_GET_INT(op1) ^
+                                         JS_VALUE_GET_INT(op2));
+                    sp--;
+                } else {
+                    if (js_binary_logic_slow(ctx, sp, opcode))
+                        goto exception;
+                    sp--;
+                }
+            }
+            BREAK;
+
+
+#define OP_CMP(opcode, binary_op, slow_call)              \
+            CASE(opcode):                                 \
+                {                                         \
+                JSValue op1, op2;                         \
+                op1 = sp[-2];                             \
+                op2 = sp[-1];                                   \
+                if (likely(JS_VALUE_IS_BOTH_INT(op1, op2))) {           \
+                    sp[-2] = JS_NewBool(ctx, JS_VALUE_GET_INT(op1) binary_op JS_VALUE_GET_INT(op2)); \
+                    sp--;                                               \
+                } else {                                                \
+                    if (slow_call)                                      \
+                        goto exception;                                 \
+                    sp--;                                               \
+                }                                                       \
+                }                                                       \
+            BREAK
+
+            OP_CMP(OP_lt, <, js_relational_slow(ctx, sp, opcode));
+            OP_CMP(OP_lte, <=, js_relational_slow(ctx, sp, opcode));
+            OP_CMP(OP_gt, >, js_relational_slow(ctx, sp, opcode));
+            OP_CMP(OP_gte, >=, js_relational_slow(ctx, sp, opcode));
+            OP_CMP(OP_eq, ==, js_eq_slow(ctx, sp, 0));
+            OP_CMP(OP_neq, !=, js_eq_slow(ctx, sp, 1));
+            OP_CMP(OP_strict_eq, ==, js_strict_eq_slow(ctx, sp, 0));
+            OP_CMP(OP_strict_neq, !=, js_strict_eq_slow(ctx, sp, 1));
+
+#ifdef CONFIG_BIGNUM
+        CASE(OP_mul_pow10):
+            if (js_mul_pow10(ctx, sp))
+                goto exception;
+            sp--;
+            BREAK;
+#endif
+        CASE(OP_in):
+            if (js_operator_in(ctx, sp))
+                goto exception;
+            sp--;
+            BREAK;
+        CASE(OP_instanceof):
+            if (js_operator_instanceof(ctx, sp))
+                goto exception;
+            sp--;
+            BREAK;
+        CASE(OP_typeof):
+            {
+                JSValue op1;
+                JSAtom atom;
+
+                op1 = sp[-1];
+                atom = js_operator_typeof(ctx, op1);
+                JS_FreeValue(ctx, op1);
+                sp[-1] = JS_AtomToString(ctx, atom);
+            }
+            BREAK;
+        CASE(OP_delete):
+            if (js_operator_delete(ctx, sp))
+                goto exception;
+            sp--;
+            BREAK;
+        CASE(OP_delete_var):
+            {
+                JSAtom atom;
+                int ret;
+
+                atom = get_u32(pc);
+                pc += 4;
+
+                ret = JS_DeleteProperty(ctx, ctx->global_obj, atom, 0);
+                if (unlikely(ret < 0))
+                    goto exception;
+                *sp++ = JS_NewBool(ctx, ret);
+            }
+            BREAK;
+
+        CASE(OP_to_object):
+            if (JS_VALUE_GET_TAG(sp[-1]) != JS_TAG_OBJECT) {
+                ret_val = JS_ToObject(ctx, sp[-1]);
+                if (JS_IsException(ret_val))
+                    goto exception;
+                JS_FreeValue(ctx, sp[-1]);
+                sp[-1] = ret_val;
+            }
+            BREAK;
+
+        CASE(OP_to_propkey):
+            switch (JS_VALUE_GET_TAG(sp[-1])) {
+            case JS_TAG_INT:
+            case JS_TAG_STRING:
+            case JS_TAG_SYMBOL:
+                break;
+            default:
+                ret_val = JS_ToPropertyKey(ctx, sp[-1]);
+                if (JS_IsException(ret_val))
+                    goto exception;
+                JS_FreeValue(ctx, sp[-1]);
+                sp[-1] = ret_val;
+                break;
+            }
+            BREAK;
+
+        CASE(OP_to_propkey2):
+            /* must be tested first */
+            if (unlikely(JS_IsUndefined(sp[-2]) || JS_IsNull(sp[-2]))) {
+                JS_ThrowTypeError(ctx, "value has no property");
+                goto exception;
+            }
+            switch (JS_VALUE_GET_TAG(sp[-1])) {
+            case JS_TAG_INT:
+            case JS_TAG_STRING:
+            case JS_TAG_SYMBOL:
+                break;
+            default:
+                ret_val = JS_ToPropertyKey(ctx, sp[-1]);
+                if (JS_IsException(ret_val))
+                    goto exception;
+                JS_FreeValue(ctx, sp[-1]);
+                sp[-1] = ret_val;
+                break;
+            }
+            BREAK;
+#if 0
+        CASE(OP_to_string):
+            if (JS_VALUE_GET_TAG(sp[-1]) != JS_TAG_STRING) {
+                ret_val = JS_ToString(ctx, sp[-1]);
+                if (JS_IsException(ret_val))
+                    goto exception;
+                JS_FreeValue(ctx, sp[-1]);
+                sp[-1] = ret_val;
+            }
+            BREAK;
+#endif
+        CASE(OP_with_get_var):
+        CASE(OP_with_put_var):
+        CASE(OP_with_delete_var):
+        CASE(OP_with_make_ref):
+        CASE(OP_with_get_ref):
+        CASE(OP_with_get_ref_undef):
+            {
+                JSAtom atom;
+                int32_t diff;
+                JSValue obj, val;
+                int ret, is_with;
+                atom = get_u32(pc);
+                diff = get_u32(pc + 4);
+                is_with = pc[8];
+                pc += 9;
+
+                obj = sp[-1];
+                ret = JS_HasProperty(ctx, obj, atom);
+                if (unlikely(ret < 0))
+                    goto exception;
+                if (ret) {
+                    if (is_with) {
+                        ret = js_has_unscopable(ctx, obj, atom);
+                        if (unlikely(ret < 0))
+                            goto exception;
+                        if (ret)
+                            goto no_with;
+                    }
+                    switch (opcode) {
+                    case OP_with_get_var:
+                        val = JS_GetProperty(ctx, obj, atom);
+                        if (unlikely(JS_IsException(val)))
+                            goto exception;
+                        set_value(ctx, &sp[-1], val);
+                        break;
+                    case OP_with_put_var:
+                        ret = JS_SetPropertyInternal(ctx, obj, atom, sp[-2],
+                                                     JS_PROP_THROW_STRICT);
+                        JS_FreeValue(ctx, sp[-1]);
+                        sp -= 2;
+                        if (unlikely(ret < 0))
+                            goto exception;
+                        break;
+                    case OP_with_delete_var:
+                        ret = JS_DeleteProperty(ctx, obj, atom, 0);
+                        if (unlikely(ret < 0))
+                            goto exception;
+                        JS_FreeValue(ctx, sp[-1]);
+                        sp[-1] = JS_NewBool(ctx, ret);
+                        break;
+                    case OP_with_make_ref:
+                        /* produce a pair object/propname on the stack */
+                        *sp++ = JS_AtomToValue(ctx, atom);
+                        break;
+                    case OP_with_get_ref:
+                        /* produce a pair object/method on the stack */
+                        val = JS_GetProperty(ctx, obj, atom);
+                        if (unlikely(JS_IsException(val)))
+                            goto exception;
+                        *sp++ = val;
+                        break;
+                    case OP_with_get_ref_undef:
+                        /* produce a pair undefined/function on the stack */
+                        val = JS_GetProperty(ctx, obj, atom);
+                        if (unlikely(JS_IsException(val)))
+                            goto exception;
+                        JS_FreeValue(ctx, sp[-1]);
+                        sp[-1] = JS_UNDEFINED;
+                        *sp++ = val;
+                        break;
+                    }
+                    pc += diff - 5;
+                } else {
+                no_with:
+                    /* if not jumping, drop the object argument */
+                    JS_FreeValue(ctx, sp[-1]);
+                    sp--;
+                }
+            }
+            BREAK;
+
+        CASE(OP_await):
+            ret_val = JS_NewInt32(ctx, FUNC_RET_AWAIT);
+            goto done_generator;
+        CASE(OP_yield):
+            ret_val = JS_NewInt32(ctx, FUNC_RET_YIELD);
+            goto done_generator;
+        CASE(OP_yield_star):
+        CASE(OP_async_yield_star):
+            ret_val = JS_NewInt32(ctx, FUNC_RET_YIELD_STAR);
+            goto done_generator;
+        CASE(OP_return_async):
+        CASE(OP_initial_yield):
+            ret_val = JS_UNDEFINED;
+            goto done_generator;
+
+        CASE(OP_nop):
+            BREAK;
+#if SHORT_OPCODES
+        CASE(OP_is_undefined):
+            if (JS_VALUE_GET_TAG(sp[-1]) == JS_TAG_UNDEFINED) {
+                goto set_true;
+            } else {
+                goto free_and_set_false;
+            }
+        CASE(OP_is_null):
+            if (JS_VALUE_GET_TAG(sp[-1]) == JS_TAG_NULL) {
+                goto set_true;
+            } else {
+                goto free_and_set_false;
+            }
+        CASE(OP_is_function):
+            if (js_operator_typeof(ctx, sp[-1]) == JS_ATOM_function) {
+                goto free_and_set_true;
+            } else {
+                goto free_and_set_false;
+            }
+        free_and_set_true:
+            JS_FreeValue(ctx, sp[-1]);
+        set_true:
+            sp[-1] = JS_TRUE;
+            BREAK;
+        free_and_set_false:
+            JS_FreeValue(ctx, sp[-1]);
+            sp[-1] = JS_FALSE;
+            BREAK;
+#endif
+        DEFAULT:
+            JS_ThrowInternalError(ctx, "invalid opcode: pc=%u opcode=0x%02x",
+                                  (int)(pc - b->byte_code_buf - 1), opcode);
+            goto exception;
+        }
+    }
+ exception:
+    if (ctx->exception_needs_backtrace) {
+        /* add the backtrace information now (it is not done
+           before if the exception happens in a bytecode
+           operation */
+        build_backtrace(ctx, ctx->current_exception, NULL, 0, pc);
+    }
+    if (!JS_IsUncatchableError(ctx, ctx->current_exception)) {
+        while (sp > stack_buf) {
+            JSValue val = *--sp;
+            JS_FreeValue(ctx, val);
+            if (JS_VALUE_GET_TAG(val) == JS_TAG_CATCH_OFFSET) {
+                int pos = JS_VALUE_GET_INT(val);
+                if (pos == 0) {
+                    /* enumerator: close it with a throw */
+                    JS_FreeValue(ctx, sp[-1]); /* drop the next method */
+                    sp--;
+                    JS_IteratorClose(ctx, sp[-1], TRUE);
+                } else {
+                    *sp++ = ctx->current_exception;
+                    ctx->current_exception = JS_NULL;
+                    pc = b->byte_code_buf + pos;
+                    goto restart;
+                }
+            }
+        }
+    }
+    ret_val = JS_EXCEPTION;
+    /* the local variables are freed by the caller in the generator
+       case. Hence the label 'done' should never be reached in a
+       generator function. */
+    if (b->func_kind != JS_FUNC_NORMAL) {
+    done_generator:
+        sf->cur_pc = pc;
+        sf->cur_sp = sp;
+    } else {
+    done:
+        if (unlikely(!list_empty(&sf->var_ref_list))) {
+            /* variable references reference the stack: must close them */
+            close_var_refs(ctx, sf);
+        }
+        /* free the local variables and stack */
+        for(pval = local_buf; pval < sp; pval++) {
+            JS_FreeValue(ctx, *pval);
+        }
+    }
+    ctx->current_stack_frame = sf->prev_frame;
+    return ret_val;
+}
+
+JSValue JS_Call(JSContext *ctx, JSValueConst func_obj, JSValueConst this_obj,
+                int argc, JSValueConst *argv)
+{
+    return JS_CallInternal(ctx, func_obj, this_obj, JS_UNDEFINED,
+                           argc, (JSValue *)argv, CALL_FLAG_COPY_ARGV);
+}
+
+static JSValue JS_CallFree(JSContext *ctx, JSValue func_obj, JSValueConst this_obj,
+                           int argc, JSValueConst *argv)
+{
+    JSValue res = JS_CallInternal(ctx, func_obj, this_obj, JS_UNDEFINED,
+                                  argc, (JSValue *)argv, CALL_FLAG_COPY_ARGV);
+    JS_FreeValue(ctx, func_obj);
+    return res;
+}
+
+static JSValue js_get_prototype_from_ctor(JSContext *ctx, JSValueConst ctor,
+                                          JSValueConst def_proto)
+{
+    JSValue proto;
+    proto = JS_GetProperty(ctx, ctor, JS_ATOM_prototype);
+    if (JS_IsException(proto))
+        return proto;
+    if (!JS_IsObject(proto)) {
+        JS_FreeValue(ctx, proto);
+        proto = JS_DupValue(ctx, def_proto);
+    }
+    return proto;
+}
+
+static JSValue js_create_from_ctor(JSContext *ctx, JSValueConst ctor,
+                                   int class_id)
+{
+    JSValue proto, obj;
+    if (JS_IsUndefined(ctor)) {
+        proto = JS_DupValue(ctx, ctx->class_proto[class_id]);
+    } else {
+        proto = JS_GetProperty(ctx, ctor, JS_ATOM_prototype);
+        if (JS_IsException(proto))
+            return proto;
+        if (!JS_IsObject(proto)) {
+            JS_FreeValue(ctx, proto);
+            /* check if revoked proxy */
+            {
+                JSProxyData *s = JS_GetOpaque(ctor, JS_CLASS_PROXY);
+                if (s && JS_IsNull(s->handler))
+                    return JS_ThrowTypeError(ctx, "revoked proxy");
+            }
+            /* XXX: should use the ctor realm instead of 'ctx' */
+            proto = JS_DupValue(ctx, ctx->class_proto[class_id]);
+        }
+    }
+    obj = JS_NewObjectProtoClass(ctx, proto, class_id);
+    JS_FreeValue(ctx, proto);
+    return obj;
+}
+
+/* argv[] is modified if (flags & CALL_FLAG_COPY_ARGV) = 0. */
+static JSValue JS_CallConstructorInternal(JSContext *ctx,
+                                          JSValueConst func_obj,
+                                          JSValueConst new_target,
+                                          int argc, JSValue *argv, int flags)
+{
+    JSObject *p;
+    JSFunctionBytecode *b;
+
+    if (js_poll_interrupts(ctx))
+        return JS_EXCEPTION;
+    flags |= CALL_FLAG_CONSTRUCTOR;
+    if (unlikely(JS_VALUE_GET_TAG(func_obj) != JS_TAG_OBJECT))
+        goto not_a_function;
+    p = JS_VALUE_GET_OBJ(func_obj);
+    if (unlikely(!p->is_constructor))
+        return JS_ThrowTypeError(ctx, "not a constructor");
+    if (unlikely(p->class_id != JS_CLASS_BYTECODE_FUNCTION)) {
+        switch(p->class_id) {
+        case JS_CLASS_C_FUNCTION:
+            return js_call_c_function(ctx, func_obj, new_target,
+                                      argc, (JSValueConst *)argv, flags);
+        case JS_CLASS_BOUND_FUNCTION:
+            return js_call_bound_function(ctx, func_obj, new_target, argc,
+                                          (JSValueConst *)argv, flags);
+        case JS_CLASS_PROXY:
+            return js_proxy_call_constructor(ctx, func_obj, new_target, argc,
+                                             (JSValueConst *)argv);
+        default:
+        not_a_function:
+            return JS_ThrowTypeError(ctx, "not a function");
+        }
+    }
+
+    b = p->u.func.function_bytecode;
+    if (b->is_derived_class_constructor) {
+        return JS_CallInternal(ctx, func_obj, JS_UNDEFINED, new_target, argc, argv, flags);
+    } else {
+        JSValue obj, ret;
+        /* legacy constructor behavior */
+        obj = js_create_from_ctor(ctx, new_target, JS_CLASS_OBJECT);
+        if (JS_IsException(obj))
+            return JS_EXCEPTION;
+        ret = JS_CallInternal(ctx, func_obj, obj, new_target, argc, argv, flags);
+        if (JS_VALUE_GET_TAG(ret) == JS_TAG_OBJECT ||
+            JS_IsException(ret)) {
+            JS_FreeValue(ctx, obj);
+            return ret;
+        } else {
+            JS_FreeValue(ctx, ret);
+            return obj;
+        }
+    }
+}
+
+JSValue JS_CallConstructor2(JSContext *ctx, JSValueConst func_obj,
+                            JSValueConst new_target,
+                            int argc, JSValueConst *argv)
+{
+    return JS_CallConstructorInternal(ctx, func_obj, new_target,
+                                      argc, (JSValue *)argv,
+                                      CALL_FLAG_COPY_ARGV);
+}
+
+JSValue JS_CallConstructor(JSContext *ctx, JSValueConst func_obj,
+                           int argc, JSValueConst *argv)
+{
+    return JS_CallConstructorInternal(ctx, func_obj, func_obj,
+                                      argc, (JSValue *)argv,
+                                      CALL_FLAG_COPY_ARGV);
+}
+
+JSValue JS_Invoke(JSContext *ctx, JSValueConst this_val, JSAtom atom,
+                  int argc, JSValueConst *argv)
+{
+    JSValue func_obj;
+    func_obj = JS_GetProperty(ctx, this_val, atom);
+    if (JS_IsException(func_obj))
+        return func_obj;
+    return JS_CallFree(ctx, func_obj, this_val, argc, argv);
+}
+
+static JSValue JS_InvokeFree(JSContext *ctx, JSValue this_val, JSAtom atom,
+                             int argc, JSValueConst *argv)
+{
+    JSValue res = JS_Invoke(ctx, this_val, atom, argc, argv);
+    JS_FreeValue(ctx, this_val);
+    return res;
+}
+
+/* JSAsyncFunctionState (used by generator and async functions) */
+static __exception int async_func_init(JSContext *ctx, JSAsyncFunctionState *s,
+                                       JSValueConst func_obj, JSValueConst this_obj,
+                                       int argc, JSValueConst *argv)
+{
+    JSObject *p;
+    JSFunctionBytecode *b;
+    JSStackFrame *sf;
+    int local_count, i, arg_buf_len, n;
+
+    sf = &s->frame;
+    init_list_head(&sf->var_ref_list);
+    p = JS_VALUE_GET_OBJ(func_obj);
+    b = p->u.func.function_bytecode;
+    sf->js_mode = b->js_mode;
+    sf->cur_pc = b->byte_code_buf;
+    arg_buf_len = max_int(b->arg_count, argc);
+    local_count = arg_buf_len + b->var_count + b->stack_size;
+    sf->arg_buf = js_malloc(ctx, sizeof(JSValue) * local_count);
+    if (!sf->arg_buf && local_count != 0)
+        return -1;
+    sf->cur_func = JS_DupValue(ctx, func_obj);
+    s->this_val = JS_DupValue(ctx, this_obj);
+    s->argc = argc;
+    sf->arg_count = arg_buf_len;
+    sf->var_buf = sf->arg_buf + arg_buf_len;
+    sf->cur_sp = sf->var_buf + b->var_count;
+    for(i = 0; i < argc; i++)
+        sf->arg_buf[i] = JS_DupValue(ctx, argv[i]);
+    n = arg_buf_len + b->var_count;
+    for(i = argc; i < n; i++)
+        sf->arg_buf[i] = JS_UNDEFINED;
+    return 0;
+}
+
+static void async_func_mark(JSRuntime *rt, JSAsyncFunctionState *s,
+                            JS_MarkFunc *mark_func)
+{
+    JSStackFrame *sf;
+    JSValue *sp;
+
+    sf = &s->frame;
+    JS_MarkValue(rt, sf->cur_func, mark_func);
+    JS_MarkValue(rt, s->this_val, mark_func);
+    if (sf->cur_sp) {
+        /* if the function is running, cur_sp is not known so we
+           cannot mark the stack. Marking the variables is not needed
+           because a running function cannot be part of a removable
+           cycle */
+        for(sp = sf->arg_buf; sp < sf->cur_sp; sp++)
+            JS_MarkValue(rt, *sp, mark_func);
+    }
+}
+
+static void async_func_free(JSRuntime *rt, JSAsyncFunctionState *s)
+{
+    JSStackFrame *sf;
+    JSValue *sp;
+
+    sf = &s->frame;
+    if (sf->arg_buf) {
+        /* cannot free the function if it is running */
+        assert(sf->cur_sp != NULL);
+        for(sp = sf->arg_buf; sp < sf->cur_sp; sp++) {
+            JS_FreeValueRT(rt, *sp);
+        }
+        js_free_rt(rt, sf->arg_buf);
+    }
+    JS_FreeValueRT(rt, sf->cur_func);
+    JS_FreeValueRT(rt, s->this_val);
+}
+
+/* close the closure variables */
+static void async_func_detach(JSContext *ctx, JSAsyncFunctionState *s)
+{
+    JSStackFrame *sf = &s->frame;
+    close_var_refs(ctx, sf);
+}
+
+static JSValue async_func_resume(JSContext *ctx, JSAsyncFunctionState *s)
+{
+    JSValue func_obj;
+
+    /* the tag does not matter provided it is not an object */
+    func_obj = JS_MKPTR(JS_TAG_INT, s);
+    return JS_CallInternal(ctx, func_obj, s->this_val, JS_UNDEFINED,
+                           s->argc, s->frame.arg_buf, CALL_FLAG_GENERATOR);
+}
+
+
+/* Generators */
+
+typedef enum JSGeneratorStateEnum {
+    JS_GENERATOR_STATE_SUSPENDED_START,
+    JS_GENERATOR_STATE_SUSPENDED_YIELD,
+    JS_GENERATOR_STATE_SUSPENDED_YIELD_STAR,
+    JS_GENERATOR_STATE_EXECUTING,
+    JS_GENERATOR_STATE_COMPLETED,
+} JSGeneratorStateEnum;
+
+typedef struct JSGeneratorData {
+    JSGeneratorStateEnum state;
+    JSAsyncFunctionState func_state;
+} JSGeneratorData;
+
+static void free_generator_stack_rt(JSRuntime *rt, JSGeneratorData *s)
+{
+    if (s->state == JS_GENERATOR_STATE_COMPLETED)
+        return;
+    async_func_free(rt, &s->func_state);
+    s->state = JS_GENERATOR_STATE_COMPLETED;
+}
+
+static void js_generator_finalizer(JSRuntime *rt, JSValue obj)
+{
+    JSGeneratorData *s = JS_GetOpaque(obj, JS_CLASS_GENERATOR);
+
+    if (s) {
+        free_generator_stack_rt(rt, s);
+        js_free_rt(rt, s);
+    }
+}
+
+static void free_generator_stack(JSContext *ctx, JSGeneratorData *s)
+{
+    if (s->state != JS_GENERATOR_STATE_COMPLETED) {
+        /* detach the closures variables */
+        async_func_detach(ctx, &s->func_state);
+        free_generator_stack_rt(ctx->rt, s);
+    }
+}
+
+static void js_generator_mark(JSRuntime *rt, JSValueConst val,
+                              JS_MarkFunc *mark_func)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    JSGeneratorData *s = p->u.generator_data;
+
+    if (!s || s->state == JS_GENERATOR_STATE_COMPLETED)
+        return;
+    async_func_mark(rt, &s->func_state, mark_func);
+}
+
+/* XXX: use enum */
+#define GEN_MAGIC_NEXT   0
+#define GEN_MAGIC_RETURN 1
+#define GEN_MAGIC_THROW  2
+
+static JSValue js_generator_next(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv,
+                                 BOOL *pdone, int magic)
+{
+    JSGeneratorData *s = JS_GetOpaque(this_val, JS_CLASS_GENERATOR);
+    JSStackFrame *sf;
+    JSValue ret, func_ret;
+    JSValueConst iter_args[1];
+
+    *pdone = TRUE;
+    if (!s)
+        return JS_ThrowTypeError(ctx, "not a generator");
+    sf = &s->func_state.frame;
+ redo:
+    switch(s->state) {
+    default:
+    case JS_GENERATOR_STATE_SUSPENDED_START:
+        if (magic == GEN_MAGIC_NEXT) {
+            goto exec_no_arg;
+        } else {
+            free_generator_stack(ctx, s);
+            goto done;
+        }
+        break;
+    case JS_GENERATOR_STATE_SUSPENDED_YIELD_STAR:
+        {
+            int done;
+            JSValue method, iter_obj;
+
+            iter_obj = sf->cur_sp[-2];
+            if (magic == GEN_MAGIC_NEXT) {
+                method = JS_DupValue(ctx, sf->cur_sp[-1]);
+            } else {
+                method = JS_GetProperty(ctx, iter_obj,
+                                        magic == GEN_MAGIC_RETURN ?
+                                        JS_ATOM_return : JS_ATOM_throw);
+                if (JS_IsException(method))
+                    goto iter_exception;
+            }
+            if (magic != GEN_MAGIC_NEXT &&
+                (JS_IsUndefined(method) || JS_IsNull(method))) {
+                /* default action */
+                if (magic == GEN_MAGIC_RETURN) {
+                    ret = JS_DupValue(ctx, argv[0]);
+                    goto iter_done;
+                } else {
+                    if (JS_IteratorClose(ctx, iter_obj, FALSE))
+                        goto iter_exception;
+                    JS_ThrowTypeError(ctx, "iterator does not have a throw method");
+                    goto iter_exception;
+                }
+            }
+            ret = JS_IteratorNext2(ctx, iter_obj, method, argc, argv, &done);
+            JS_FreeValue(ctx, method);
+            if (JS_IsException(ret)) {
+            iter_exception:
+                goto exec_throw;
+            }
+            /* if not done, the iterator returns the exact object
+               returned by 'method' */
+            if (done == 2) {
+                JSValue done_val, value;
+                done_val = JS_GetProperty(ctx, ret, JS_ATOM_done);
+                if (JS_IsException(done_val)) {
+                    JS_FreeValue(ctx, ret);
+                    goto iter_exception;
+                }
+                done = JS_ToBoolFree(ctx, done_val);
+                if (done) {
+                    value = JS_GetProperty(ctx, ret, JS_ATOM_value);
+                    JS_FreeValue(ctx, ret);
+                    if (JS_IsException(value))
+                        goto iter_exception;
+                    ret = value;
+                    goto iter_done;
+                } else {
+                    *pdone = 2;
+                }
+            } else {
+                if (done) {
+                    /* 'yield *' returns the value associated to done = true */
+                iter_done:
+                    JS_FreeValue(ctx, sf->cur_sp[-2]);
+                    JS_FreeValue(ctx, sf->cur_sp[-1]);
+                    sf->cur_sp--;
+                    goto exec_arg;
+                } else {
+                    *pdone = FALSE;
+                }
+            }
+            break;
+        }
+        break;
+    case JS_GENERATOR_STATE_SUSPENDED_YIELD:
+        /* cur_sp[-1] was set to JS_UNDEFINED in the previous call */
+        ret = JS_DupValue(ctx, argv[0]);
+        if (magic == GEN_MAGIC_THROW) {
+            JS_Throw(ctx, ret);
+        exec_throw:
+            s->func_state.throw_flag = TRUE;
+        } else {
+        exec_arg:
+            sf->cur_sp[-1] = ret;
+            sf->cur_sp[0] = JS_NewBool(ctx, (magic == GEN_MAGIC_RETURN));
+            sf->cur_sp++;
+        exec_no_arg:
+            s->func_state.throw_flag = FALSE;
+        }
+        s->state = JS_GENERATOR_STATE_EXECUTING;
+        func_ret = async_func_resume(ctx, &s->func_state);
+        s->state = JS_GENERATOR_STATE_SUSPENDED_YIELD;
+        if (JS_IsException(func_ret)) {
+            /* finalize the execution in case of exception */
+            free_generator_stack(ctx, s);
+            return func_ret;
+        }
+        if (JS_VALUE_GET_TAG(func_ret) == JS_TAG_INT) {
+            if (JS_VALUE_GET_INT(func_ret) == FUNC_RET_YIELD_STAR) {
+                /* 'yield *' */
+                s->state = JS_GENERATOR_STATE_SUSPENDED_YIELD_STAR;
+                iter_args[0] = JS_UNDEFINED;
+                argc = 1;
+                argv = iter_args;
+                goto redo;
+            } else {
+                /* get the return the yield value at the top of the stack */
+                ret = sf->cur_sp[-1];
+                sf->cur_sp[-1] = JS_UNDEFINED;
+                *pdone = FALSE;
+            }
+        } else {
+            /* end of iterator */
+            ret = sf->cur_sp[-1];
+            sf->cur_sp[-1] = JS_UNDEFINED;
+            JS_FreeValue(ctx, func_ret);
+            free_generator_stack(ctx, s);
+        }
+        break;
+    case JS_GENERATOR_STATE_COMPLETED:
+    done:
+        /* execution is finished */
+        switch(magic) {
+        default:
+        case GEN_MAGIC_NEXT:
+            ret = JS_UNDEFINED;
+            break;
+        case GEN_MAGIC_RETURN:
+            ret = JS_DupValue(ctx, argv[0]);
+            break;
+        case GEN_MAGIC_THROW:
+            ret = JS_Throw(ctx, JS_DupValue(ctx, argv[0]));
+            break;
+        }
+        break;
+    case JS_GENERATOR_STATE_EXECUTING:
+        ret = JS_ThrowTypeError(ctx, "cannot invoke a running generator");
+        break;
+    }
+    return ret;
+}
+
+static JSValue js_generator_function_call(JSContext *ctx, JSValueConst func_obj,
+                                          JSValueConst this_obj,
+                                          int argc, JSValueConst *argv)
+{
+    JSValue obj, func_ret;
+    JSGeneratorData *s;
+
+    s = js_mallocz(ctx, sizeof(*s));
+    if (!s)
+        return JS_EXCEPTION;
+    s->state = JS_GENERATOR_STATE_SUSPENDED_START;
+    if (async_func_init(ctx, &s->func_state, func_obj, this_obj, argc, argv)) {
+        s->state = JS_GENERATOR_STATE_COMPLETED;
+        goto fail;
+    }
+
+    /* execute the function up to 'OP_initial_yield' */
+    func_ret = async_func_resume(ctx, &s->func_state);
+    if (JS_IsException(func_ret))
+        goto fail;
+    JS_FreeValue(ctx, func_ret);
+
+    obj = js_create_from_ctor(ctx, func_obj, JS_CLASS_GENERATOR);
+    if (JS_IsException(obj))
+        goto fail;
+    JS_SetOpaque(obj, s);
+    return obj;
+ fail:
+    free_generator_stack_rt(ctx->rt, s);
+    js_free(ctx, s);
+    return JS_EXCEPTION;
+}
+
+/* AsyncFunction */
+
+static void js_async_function_terminate(JSRuntime *rt, JSContext *ctx,
+                                        JSAsyncFunctionData *s)
+{
+    if (s->is_active) {
+        if (ctx)
+            async_func_detach(ctx, &s->func_state);
+        async_func_free(rt, &s->func_state);
+        s->is_active = FALSE;
+    }
+}
+
+/* ctx can be NULL */
+static void js_async_function_free(JSRuntime *rt, JSContext *ctx,
+                                   JSAsyncFunctionData *s)
+{
+    if (--s->header.ref_count == 0) {
+        js_async_function_terminate(rt, ctx, s);
+        JS_FreeValueRT(rt, s->resolving_funcs[0]);
+        JS_FreeValueRT(rt, s->resolving_funcs[1]);
+        js_free_rt(rt, s);
+    }
+}
+
+static void js_async_function_resolve_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    JSAsyncFunctionData *s = p->u.async_function_data;
+    if (s) {
+        js_async_function_free(rt, NULL, s);
+    }
+}
+
+static void js_async_function_resolve_mark(JSRuntime *rt, JSValueConst val,
+                                           JS_MarkFunc *mark_func)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    JSAsyncFunctionData *s = p->u.async_function_data;
+    if (s) {
+        JS_MarkValue(rt, JS_MKPTR(JS_TAG_ASYNC_FUNCTION, s), mark_func);
+    }
+}
+
+static int js_async_function_resolve_create(JSContext *ctx,
+                                            JSAsyncFunctionData *s,
+                                            JSValue *resolving_funcs)
+{
+    int i;
+    JSObject *p;
+
+    for(i = 0; i < 2; i++) {
+        resolving_funcs[i] =
+            JS_NewObjectProtoClass(ctx, ctx->function_proto,
+                                   JS_CLASS_ASYNC_FUNCTION_RESOLVE + i);
+        if (JS_IsException(resolving_funcs[i])) {
+            if (i == 1)
+                JS_FreeValue(ctx, resolving_funcs[0]);
+            return -1;
+        }
+        p = JS_VALUE_GET_OBJ(resolving_funcs[i]);
+        s->header.ref_count++;
+        p->u.async_function_data = s;
+    }
+    return 0;
+}
+
+static void js_async_function_resume(JSContext *ctx, JSAsyncFunctionData *s)
+{
+    JSValue func_ret, ret2;
+
+    func_ret = async_func_resume(ctx, &s->func_state);
+    if (JS_IsException(func_ret)) {
+        JSValue error;
+    fail:
+        error = JS_GetException(ctx);
+        ret2 = JS_Call(ctx, s->resolving_funcs[1], JS_UNDEFINED,
+                       1, (JSValueConst *)&error);
+        JS_FreeValue(ctx, error);
+        js_async_function_terminate(ctx->rt, ctx, s);
+        JS_FreeValue(ctx, ret2); /* XXX: what to do if exception ? */
+    } else {
+        JSValue value;
+        value = s->func_state.frame.cur_sp[-1];
+        s->func_state.frame.cur_sp[-1] = JS_UNDEFINED;
+        if (JS_IsUndefined(func_ret)) {
+            /* function returned */
+            ret2 = JS_Call(ctx, s->resolving_funcs[0], JS_UNDEFINED,
+                           1, (JSValueConst *)&value);
+            JS_FreeValue(ctx, ret2); /* XXX: what to do if exception ? */
+            JS_FreeValue(ctx, value);
+            js_async_function_terminate(ctx->rt, ctx, s);
+        } else {
+            JSValue promise, resolving_funcs[2], resolving_funcs1[2];
+            int i, res;
+
+            /* await */
+            JS_FreeValue(ctx, func_ret); /* not used */
+            promise = js_new_promise_capability(ctx, resolving_funcs, JS_UNDEFINED);
+            if (JS_IsException(promise))
+                goto fail;
+            ret2 = JS_Call(ctx, resolving_funcs[0], JS_UNDEFINED,
+                           1, (JSValueConst *)&value);
+            JS_FreeValue(ctx, resolving_funcs[0]);
+            JS_FreeValue(ctx, resolving_funcs[1]);
+            JS_FreeValue(ctx, value);
+            if (JS_IsException(ret2)) {
+                JS_FreeValue(ctx, promise);
+                goto fail;
+            }
+            JS_FreeValue(ctx, ret2);
+
+            if (js_async_function_resolve_create(ctx, s, resolving_funcs)) {
+                JS_FreeValue(ctx, promise);
+                goto fail;
+            }
+
+            /* Note: no need to create 'thrownawayCapability' as in
+               the spec */
+            for(i = 0; i < 2; i++)
+                resolving_funcs1[i] = JS_UNDEFINED;
+            res = perform_promise_then(ctx, promise,
+                                       (JSValueConst *)resolving_funcs,
+                                       (JSValueConst *)resolving_funcs1);
+            JS_FreeValue(ctx, promise);
+            for(i = 0; i < 2; i++)
+                JS_FreeValue(ctx, resolving_funcs[i]);
+            if (res)
+                goto fail;
+        }
+    }
+}
+
+static JSValue js_async_function_resolve_call(JSContext *ctx,
+                                              JSValueConst func_obj,
+                                              JSValueConst this_obj,
+                                              int argc, JSValueConst *argv)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(func_obj);
+    JSAsyncFunctionData *s = p->u.async_function_data;
+    BOOL is_reject = p->class_id - JS_CLASS_ASYNC_FUNCTION_RESOLVE;
+    JSValueConst arg;
+
+    if (argc > 0)
+        arg = argv[0];
+    else
+        arg = JS_UNDEFINED;
+    s->func_state.throw_flag = is_reject;
+    if (is_reject) {
+        JS_Throw(ctx, JS_DupValue(ctx, arg));
+    } else {
+        /* return value of await */
+        s->func_state.frame.cur_sp[-1] = JS_DupValue(ctx, arg);
+    }
+    js_async_function_resume(ctx, s);
+    return JS_UNDEFINED;
+}
+
+static JSValue js_async_function_call(JSContext *ctx, JSValueConst func_obj,
+                                      JSValueConst this_obj,
+                                      int argc, JSValueConst *argv)
+{
+    JSValue promise;
+    JSAsyncFunctionData *s;
+
+    s = js_mallocz(ctx, sizeof(*s));
+    if (!s)
+        return JS_EXCEPTION;
+    s->header.ref_count = 1;
+    s->gc_header.mark = 0;
+    s->is_active = FALSE;
+    s->resolving_funcs[0] = JS_UNDEFINED;
+    s->resolving_funcs[1] = JS_UNDEFINED;
+
+    promise = js_new_promise_capability(ctx, s->resolving_funcs, JS_UNDEFINED);
+    if (JS_IsException(promise))
+        goto fail;
+
+    if (async_func_init(ctx, &s->func_state, func_obj, this_obj, argc, argv)) {
+    fail:
+        JS_FreeValue(ctx, promise);
+        js_async_function_free(ctx->rt, ctx, s);
+        return JS_EXCEPTION;
+    }
+    s->is_active = TRUE;
+
+    js_async_function_resume(ctx, s);
+
+    js_async_function_free(ctx->rt, ctx, s);
+
+    return promise;
+}
+
+/* AsyncGenerator */
+
+typedef enum JSAsyncGeneratorStateEnum {
+    JS_ASYNC_GENERATOR_STATE_SUSPENDED_START,
+    JS_ASYNC_GENERATOR_STATE_SUSPENDED_YIELD,
+    JS_ASYNC_GENERATOR_STATE_SUSPENDED_YIELD_STAR,
+    JS_ASYNC_GENERATOR_STATE_EXECUTING,
+    JS_ASYNC_GENERATOR_STATE_AWAITING_RETURN,
+    JS_ASYNC_GENERATOR_STATE_COMPLETED,
+} JSAsyncGeneratorStateEnum;
+
+typedef struct JSAsyncGeneratorRequest {
+    struct list_head link;
+    /* completion */
+    int completion_type; /* GEN_MAGIC_x */
+    JSValue result;
+    /* promise capability */
+    JSValue promise;
+    JSValue resolving_funcs[2];
+} JSAsyncGeneratorRequest;
+
+typedef struct JSAsyncGeneratorData {
+    JSObject *generator; /* back pointer to the object (const) */
+    JSAsyncGeneratorStateEnum state;
+    JSAsyncFunctionState func_state;
+    struct list_head queue; /* list of JSAsyncGeneratorRequest.link */
+} JSAsyncGeneratorData;
+
+static void js_async_generator_free(JSRuntime *rt,
+                                    JSAsyncGeneratorData *s)
+{
+    struct list_head *el, *el1;
+    JSAsyncGeneratorRequest *req;
+
+    list_for_each_safe(el, el1, &s->queue) {
+        req = list_entry(el, JSAsyncGeneratorRequest, link);
+        JS_FreeValueRT(rt, req->result);
+        JS_FreeValueRT(rt, req->promise);
+        JS_FreeValueRT(rt, req->resolving_funcs[0]);
+        JS_FreeValueRT(rt, req->resolving_funcs[1]);
+        js_free_rt(rt, req);
+    }
+    if (s->state != JS_ASYNC_GENERATOR_STATE_COMPLETED &&
+        s->state != JS_ASYNC_GENERATOR_STATE_AWAITING_RETURN) {
+        async_func_free(rt, &s->func_state);
+    }
+    js_free_rt(rt, s);
+}
+
+static void js_async_generator_finalizer(JSRuntime *rt, JSValue obj)
+{
+    JSAsyncGeneratorData *s = JS_GetOpaque(obj, JS_CLASS_ASYNC_GENERATOR);
+
+    if (s) {
+        js_async_generator_free(rt, s);
+    }
+}
+
+static void js_async_generator_mark(JSRuntime *rt, JSValueConst val,
+                                    JS_MarkFunc *mark_func)
+{
+    JSAsyncGeneratorData *s = JS_GetOpaque(val, JS_CLASS_ASYNC_GENERATOR);
+    struct list_head *el;
+    JSAsyncGeneratorRequest *req;
+    if (s) {
+        list_for_each(el, &s->queue) {
+            req = list_entry(el, JSAsyncGeneratorRequest, link);
+            JS_MarkValue(rt, req->result, mark_func);
+            JS_MarkValue(rt, req->promise, mark_func);
+            JS_MarkValue(rt, req->resolving_funcs[0], mark_func);
+            JS_MarkValue(rt, req->resolving_funcs[1], mark_func);
+        }
+        if (s->state != JS_ASYNC_GENERATOR_STATE_COMPLETED &&
+            s->state != JS_ASYNC_GENERATOR_STATE_AWAITING_RETURN) {
+            async_func_mark(rt, &s->func_state, mark_func);
+        }
+    }
+}
+
+static JSValue js_async_generator_resolve_function(JSContext *ctx,
+                                          JSValueConst this_obj,
+                                          int argc, JSValueConst *argv,
+                                          int magic, JSValue *func_data);
+
+static int js_async_generator_resolve_function_create(JSContext *ctx,
+                                                      JSValueConst generator,
+                                                      JSValue *resolving_funcs,
+                                                      BOOL is_resume_next)
+{
+    int i;
+    JSValue func;
+
+    for(i = 0; i < 2; i++) {
+        func = JS_NewCFunctionData(ctx, js_async_generator_resolve_function, 1,
+                                   i + is_resume_next * 2, 1, &generator);
+        if (JS_IsException(func)) {
+            if (i == 1)
+                JS_FreeValue(ctx, resolving_funcs[0]);
+            return -1;
+        }
+        resolving_funcs[i] = func;
+    }
+    return 0;
+}
+
+static int js_async_generator_await(JSContext *ctx,
+                                    JSAsyncGeneratorData *s,
+                                    JSValueConst value)
+{
+    JSValue promise, resolving_funcs[2], resolving_funcs1[2], ret2;
+    int i, res;
+
+    promise = js_new_promise_capability(ctx, resolving_funcs, JS_UNDEFINED);
+    if (JS_IsException(promise))
+        goto fail;
+    ret2 = JS_Call(ctx, resolving_funcs[0], JS_UNDEFINED,
+                   1, &value);
+    JS_FreeValue(ctx, resolving_funcs[0]);
+    JS_FreeValue(ctx, resolving_funcs[1]);
+    if (JS_IsException(ret2)) {
+        JS_FreeValue(ctx, promise);
+        goto fail;
+    }
+    JS_FreeValue(ctx, ret2);
+
+    if (js_async_generator_resolve_function_create(ctx, JS_MKPTR(JS_TAG_OBJECT, s->generator),
+                                                   resolving_funcs, FALSE)) {
+        JS_FreeValue(ctx, promise);
+        goto fail;
+    }
+
+    /* Note: no need to create 'thrownawayCapability' as in
+       the spec */
+    for(i = 0; i < 2; i++)
+        resolving_funcs1[i] = JS_UNDEFINED;
+    res = perform_promise_then(ctx, promise,
+                               (JSValueConst *)resolving_funcs,
+                               (JSValueConst *)resolving_funcs1);
+    JS_FreeValue(ctx, promise);
+    for(i = 0; i < 2; i++)
+        JS_FreeValue(ctx, resolving_funcs[i]);
+    if (res)
+        goto fail;
+    return 0;
+ fail:
+    return -1;
+}
+
+static void js_async_generator_resolve_or_reject(JSContext *ctx,
+                                                 JSAsyncGeneratorData *s,
+                                                 JSValueConst result,
+                                                 int is_reject)
+{
+    JSAsyncGeneratorRequest *next;
+    JSValue ret;
+
+    next = list_entry(s->queue.next, JSAsyncGeneratorRequest, link);
+    list_del(&next->link);
+    ret = JS_Call(ctx, next->resolving_funcs[is_reject], JS_UNDEFINED, 1,
+                  &result);
+    JS_FreeValue(ctx, ret);
+    JS_FreeValue(ctx, next->result);
+    JS_FreeValue(ctx, next->promise);
+    JS_FreeValue(ctx, next->resolving_funcs[0]);
+    JS_FreeValue(ctx, next->resolving_funcs[1]);
+    js_free(ctx, next);
+}
+
+static void js_async_generator_resolve(JSContext *ctx,
+                                       JSAsyncGeneratorData *s,
+                                       JSValueConst value,
+                                       BOOL done)
+{
+    JSValue result;
+    result = js_create_iterator_result(ctx, JS_DupValue(ctx, value), done);
+    /* XXX: better exception handling ? */
+    js_async_generator_resolve_or_reject(ctx, s, result, 0);
+    JS_FreeValue(ctx, result);
+ }
+
+static void js_async_generator_reject(JSContext *ctx,
+                                       JSAsyncGeneratorData *s,
+                                       JSValueConst exception)
+{
+    js_async_generator_resolve_or_reject(ctx, s, exception, 1);
+}
+
+static void js_async_generator_complete(JSContext *ctx,
+                                        JSAsyncGeneratorData *s)
+{
+    if (s->state != JS_ASYNC_GENERATOR_STATE_COMPLETED) {
+        s->state = JS_ASYNC_GENERATOR_STATE_COMPLETED;
+        async_func_detach(ctx, &s->func_state);
+        async_func_free(ctx->rt, &s->func_state);
+    }
+}
+
+static int js_async_generator_completed_return(JSContext *ctx,
+                                               JSAsyncGeneratorData *s,
+                                               JSValueConst value)
+{
+    JSValue promise, resolving_funcs[2], ret, resolving_funcs1[2];
+    int res;
+
+    promise = js_new_promise_capability(ctx, resolving_funcs, JS_UNDEFINED);
+    if (JS_IsException(promise))
+        return -1;
+    ret = JS_Call(ctx, resolving_funcs[0], JS_UNDEFINED, 1, &value);
+    JS_FreeValue(ctx, resolving_funcs[0]);
+    JS_FreeValue(ctx, resolving_funcs[1]);
+    if (JS_IsException(ret)) {
+        JS_FreeValue(ctx, promise);
+        return -1;
+    }
+    JS_FreeValue(ctx, ret);
+    if (js_async_generator_resolve_function_create(ctx,
+                                                   JS_MKPTR(JS_TAG_OBJECT, s->generator),
+                                                   resolving_funcs1,
+                                                   TRUE)) {
+        JS_FreeValue(ctx, promise);
+        return -1;
+    }
+    resolving_funcs[0] = JS_UNDEFINED;
+    resolving_funcs[1] = JS_UNDEFINED;
+    res = perform_promise_then(ctx, promise,
+                               (JSValueConst *)resolving_funcs1,
+                               (JSValueConst *)resolving_funcs);
+    JS_FreeValue(ctx, resolving_funcs1[0]);
+    JS_FreeValue(ctx, resolving_funcs1[1]);
+    JS_FreeValue(ctx, promise);
+    return res;
+}
+
+static void js_async_generator_resume_next(JSContext *ctx,
+                                           JSAsyncGeneratorData *s)
+{
+    JSAsyncGeneratorRequest *next;
+    JSValue func_ret, value;
+
+    for(;;) {
+        if (list_empty(&s->queue))
+            break;
+        next = list_entry(s->queue.next, JSAsyncGeneratorRequest, link);
+        switch(s->state) {
+        case JS_ASYNC_GENERATOR_STATE_EXECUTING:
+            /* only happens when restarting execution after await() */
+            goto resume_exec;
+        case JS_ASYNC_GENERATOR_STATE_AWAITING_RETURN:
+            goto done;
+        case JS_ASYNC_GENERATOR_STATE_SUSPENDED_START:
+            if (next->completion_type == GEN_MAGIC_NEXT) {
+                goto exec_no_arg;
+            } else {
+                js_async_generator_complete(ctx, s);
+            }
+            break;
+        case JS_ASYNC_GENERATOR_STATE_COMPLETED:
+            if (next->completion_type == GEN_MAGIC_NEXT) {
+                js_async_generator_resolve(ctx, s, JS_UNDEFINED, TRUE);
+            } else if (next->completion_type == GEN_MAGIC_RETURN) {
+                s->state = JS_ASYNC_GENERATOR_STATE_AWAITING_RETURN;
+                js_async_generator_completed_return(ctx, s, next->result);
+                goto done;
+            } else {
+                js_async_generator_reject(ctx, s, next->result);
+            }
+            goto done;
+        case JS_ASYNC_GENERATOR_STATE_SUSPENDED_YIELD:
+        case JS_ASYNC_GENERATOR_STATE_SUSPENDED_YIELD_STAR:
+            value = JS_DupValue(ctx, next->result);
+            if (next->completion_type == GEN_MAGIC_THROW &&
+                s->state == JS_ASYNC_GENERATOR_STATE_SUSPENDED_YIELD) {
+                JS_Throw(ctx, value);
+                s->func_state.throw_flag = TRUE;
+            } else {
+                /* 'yield' returns a value. 'yield *' also returns a value
+                   in case the 'throw' method is called */
+                s->func_state.frame.cur_sp[-1] = value;
+                s->func_state.frame.cur_sp[0] =
+                    JS_NewInt32(ctx, next->completion_type);
+                s->func_state.frame.cur_sp++;
+            exec_no_arg:
+                s->func_state.throw_flag = FALSE;
+            }
+            s->state = JS_ASYNC_GENERATOR_STATE_EXECUTING;
+        resume_exec:
+            func_ret = async_func_resume(ctx, &s->func_state);
+            if (JS_IsException(func_ret)) {
+                value = JS_GetException(ctx);
+                js_async_generator_complete(ctx, s);
+                js_async_generator_reject(ctx, s, value);
+                JS_FreeValue(ctx, value);
+            } else if (JS_VALUE_GET_TAG(func_ret) == JS_TAG_INT) {
+                int func_ret_code;
+                value = s->func_state.frame.cur_sp[-1];
+                s->func_state.frame.cur_sp[-1] = JS_UNDEFINED;
+                func_ret_code = JS_VALUE_GET_INT(func_ret);
+                switch(func_ret_code) {
+                case FUNC_RET_YIELD:
+                case FUNC_RET_YIELD_STAR:
+                    if (func_ret_code == FUNC_RET_YIELD_STAR)
+                        s->state = JS_ASYNC_GENERATOR_STATE_SUSPENDED_YIELD_STAR;
+                    else
+                        s->state = JS_ASYNC_GENERATOR_STATE_SUSPENDED_YIELD;
+                    js_async_generator_resolve(ctx, s, value, FALSE);
+                    JS_FreeValue(ctx, value);
+                    break;
+                case FUNC_RET_AWAIT:
+                    js_async_generator_await(ctx, s, value);
+                    JS_FreeValue(ctx, value);
+                    goto done;
+                default:
+                    abort();
+                }
+            } else {
+                assert(JS_IsUndefined(func_ret));
+                /* end of function */
+                value = s->func_state.frame.cur_sp[-1];
+                s->func_state.frame.cur_sp[-1] = JS_UNDEFINED;
+                js_async_generator_complete(ctx, s);
+                js_async_generator_resolve(ctx, s, value, TRUE);
+                JS_FreeValue(ctx, value);
+            }
+            break;
+        default:
+            abort();
+        }
+    }
+ done: ;
+}
+
+static JSValue js_async_generator_resolve_function(JSContext *ctx,
+                                                   JSValueConst this_obj,
+                                                   int argc, JSValueConst *argv,
+                                                   int magic, JSValue *func_data)
+{
+    BOOL is_reject = magic & 1;
+    JSAsyncGeneratorData *s = JS_GetOpaque(func_data[0], JS_CLASS_ASYNC_GENERATOR);
+    JSValueConst arg = argv[0];
+
+    /* XXX: what if s == NULL */
+
+    if (magic >= 2) {
+        /* resume next case in AWAITING_RETURN state */
+        assert(s->state == JS_ASYNC_GENERATOR_STATE_AWAITING_RETURN ||
+               s->state == JS_ASYNC_GENERATOR_STATE_COMPLETED);
+        s->state = JS_ASYNC_GENERATOR_STATE_COMPLETED;
+        if (is_reject) {
+            js_async_generator_reject(ctx, s, arg);
+        } else {
+            js_async_generator_resolve(ctx, s, arg, TRUE);
+        }
+    } else {
+        /* restart function execution after await() */
+        assert(s->state == JS_ASYNC_GENERATOR_STATE_EXECUTING);
+        s->func_state.throw_flag = is_reject;
+        if (is_reject) {
+            JS_Throw(ctx, JS_DupValue(ctx, arg));
+        } else {
+            /* return value of await */
+            s->func_state.frame.cur_sp[-1] = JS_DupValue(ctx, arg);
+        }
+        js_async_generator_resume_next(ctx, s);
+    }
+    return JS_UNDEFINED;
+}
+
+/* magic = GEN_MAGIC_x */
+static JSValue js_async_generator_next(JSContext *ctx, JSValueConst this_val,
+                                       int argc, JSValueConst *argv,
+                                       int magic)
+{
+    JSAsyncGeneratorData *s = JS_GetOpaque(this_val, JS_CLASS_ASYNC_GENERATOR);
+    JSValue promise, resolving_funcs[2];
+    JSAsyncGeneratorRequest *req;
+
+    promise = js_new_promise_capability(ctx, resolving_funcs, JS_UNDEFINED);
+    if (JS_IsException(promise))
+        return JS_EXCEPTION;
+    if (!s) {
+        JSValue err, res2;
+        JS_ThrowTypeError(ctx, "not an AsyncGenerator object");
+        err = JS_GetException(ctx);
+        res2 = JS_Call(ctx, resolving_funcs[1], JS_UNDEFINED,
+                       1, (JSValueConst *)&err);
+        JS_FreeValue(ctx, err);
+        JS_FreeValue(ctx, res2);
+        JS_FreeValue(ctx, resolving_funcs[0]);
+        JS_FreeValue(ctx, resolving_funcs[1]);
+        return promise;
+    }
+    req = js_mallocz(ctx, sizeof(*req));
+    if (!req)
+        goto fail;
+    req->completion_type = magic;
+    req->result = JS_DupValue(ctx, argv[0]);
+    req->promise = JS_DupValue(ctx, promise);
+    req->resolving_funcs[0] = resolving_funcs[0];
+    req->resolving_funcs[1] = resolving_funcs[1];
+    list_add_tail(&req->link, &s->queue);
+    if (s->state != JS_ASYNC_GENERATOR_STATE_EXECUTING) {
+        js_async_generator_resume_next(ctx, s);
+    }
+    return promise;
+ fail:
+    JS_FreeValue(ctx, resolving_funcs[0]);
+    JS_FreeValue(ctx, resolving_funcs[1]);
+    JS_FreeValue(ctx, promise);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_async_generator_function_call(JSContext *ctx, JSValueConst func_obj,
+                                                JSValueConst this_obj,
+                                                int argc, JSValueConst *argv)
+{
+    JSValue obj, func_ret;
+    JSAsyncGeneratorData *s;
+
+    s = js_mallocz(ctx, sizeof(*s));
+    if (!s)
+        return JS_EXCEPTION;
+    s->state = JS_ASYNC_GENERATOR_STATE_SUSPENDED_START;
+    init_list_head(&s->queue);
+    if (async_func_init(ctx, &s->func_state, func_obj, this_obj, argc, argv)) {
+        s->state = JS_ASYNC_GENERATOR_STATE_COMPLETED;
+        goto fail;
+    }
+
+    /* execute the function up to 'OP_initial_yield' (no yield nor
+       await are possible) */
+    func_ret = async_func_resume(ctx, &s->func_state);
+    if (JS_IsException(func_ret))
+        goto fail;
+    JS_FreeValue(ctx, func_ret);
+
+    obj = js_create_from_ctor(ctx, func_obj, JS_CLASS_ASYNC_GENERATOR);
+    if (JS_IsException(obj))
+        goto fail;
+    s->generator = JS_VALUE_GET_OBJ(obj);
+    JS_SetOpaque(obj, s);
+    return obj;
+ fail:
+    js_async_generator_free(ctx->rt, s);
+    return JS_EXCEPTION;
+}
+
+/* JS parser */
+
+enum {
+    TOK_NUMBER = -128,
+    TOK_STRING,
+    TOK_TEMPLATE,
+    TOK_IDENT,
+    TOK_REGEXP,
+    /* warning: order matters (see js_parse_assign_expr) */
+    TOK_MUL_ASSIGN,
+    TOK_DIV_ASSIGN,
+    TOK_MOD_ASSIGN,
+    TOK_PLUS_ASSIGN,
+    TOK_MINUS_ASSIGN,
+    TOK_SHL_ASSIGN,
+    TOK_SAR_ASSIGN,
+    TOK_SHR_ASSIGN,
+    TOK_AND_ASSIGN,
+    TOK_XOR_ASSIGN,
+    TOK_OR_ASSIGN,
+#ifdef CONFIG_BIGNUM
+    TOK_MATH_POW_ASSIGN,
+#endif
+    TOK_POW_ASSIGN,
+    TOK_DEC,
+    TOK_INC,
+    TOK_SHL,
+    TOK_SAR,
+    TOK_SHR,
+    TOK_LT,
+    TOK_LTE,
+    TOK_GT,
+    TOK_GTE,
+    TOK_EQ,
+    TOK_STRICT_EQ,
+    TOK_NEQ,
+    TOK_STRICT_NEQ,
+    TOK_LAND,
+    TOK_LOR,
+#ifdef CONFIG_BIGNUM
+    TOK_MATH_POW,
+#endif
+    TOK_POW,
+    TOK_ARROW,
+    TOK_ELLIPSIS,
+    TOK_ERROR,
+    TOK_EOF,
+    /* keywords: WARNING: same order as atoms */
+    TOK_NULL, /* must be first */
+    TOK_FALSE,
+    TOK_TRUE,
+    TOK_IF,
+    TOK_ELSE,
+    TOK_RETURN,
+    TOK_VAR,
+    TOK_THIS,
+    TOK_DELETE,
+    TOK_VOID,
+    TOK_TYPEOF,
+    TOK_NEW,
+    TOK_IN,
+    TOK_INSTANCEOF,
+    TOK_DO,
+    TOK_WHILE,
+    TOK_FOR,
+    TOK_BREAK,
+    TOK_CONTINUE,
+    TOK_SWITCH,
+    TOK_CASE,
+    TOK_DEFAULT,
+    TOK_THROW,
+    TOK_TRY,
+    TOK_CATCH,
+    TOK_FINALLY,
+    TOK_FUNCTION,
+    TOK_DEBUGGER,
+    TOK_WITH,
+    /* FutureReservedWord */
+    TOK_CLASS,
+    TOK_CONST,
+    TOK_ENUM,
+    TOK_EXPORT,
+    TOK_EXTENDS,
+    TOK_IMPORT,
+    TOK_SUPER,
+    /* FutureReservedWords when parsing strict mode code */
+    TOK_IMPLEMENTS,
+    TOK_INTERFACE,
+    TOK_LET,
+    TOK_PACKAGE,
+    TOK_PRIVATE,
+    TOK_PROTECTED,
+    TOK_PUBLIC,
+    TOK_STATIC,
+    TOK_YIELD,
+    TOK_AWAIT, /* must be last */
+    TOK_OF,     /* only used for js_parse_skip_parens_token() */
+};
+
+#define TOK_FIRST_KEYWORD   TOK_NULL
+#define TOK_LAST_KEYWORD    TOK_AWAIT
+
+/* unicode code points */
+#define CP_NBSP 0x00a0
+#define CP_BOM  0xfeff
+
+#define CP_LS   0x2028
+#define CP_PS   0x2029
+
+typedef struct BlockEnv {
+    struct BlockEnv *prev;
+    JSAtom label_name; /* JS_ATOM_NULL if none */
+    int label_break; /* -1 if none */
+    int label_cont; /* -1 if none */
+    int drop_count; /* number of stack elements to drop */
+    int label_finally; /* -1 if none */
+    int scope_level;
+    int has_iterator;
+} BlockEnv;
+
+typedef struct JSHoistedDef {
+    int cpool_idx; /* -1 means variable global definition */
+    uint8_t force_init : 1; /* initialize to undefined */
+    uint8_t is_lexical : 1; /* global let/const definition */
+    uint8_t is_const   : 1; /* const definition */
+    uint8_t is_for_of  : 1; /* variable defined in for-of */
+    int var_idx;   /* function object index if cpool_idx >= 0 */
+    int scope_level;    /* scope of definition */
+    JSAtom var_name;  /* variable name if cpool_idx < 0 */
+} JSHoistedDef;
+
+typedef struct RelocEntry {
+    struct RelocEntry *next;
+    uint32_t addr; /* address to patch */
+    int size;   /* address size: 1, 2 or 4 bytes */
+} RelocEntry;
+
+typedef struct JumpSlot {
+    int op;
+    int size;
+    int pos;
+    int label;
+} JumpSlot;
+
+typedef struct LabelSlot {
+    int ref_count;
+    int pos;    /* phase 1 address, -1 means not resolved yet */
+    int pos2;   /* phase 2 address, -1 means not resolved yet */
+    int addr;   /* phase 3 address, -1 means not resolved yet */
+    RelocEntry *first_reloc;
+} LabelSlot;
+
+typedef struct LineNumberSlot {
+    uint32_t pc;
+    int line_num;
+} LineNumberSlot;
+
+typedef enum JSParseFunctionEnum {
+    JS_PARSE_FUNC_STATEMENT,
+    JS_PARSE_FUNC_VAR,
+    JS_PARSE_FUNC_EXPR,
+    JS_PARSE_FUNC_ARROW,
+    JS_PARSE_FUNC_GETTER,
+    JS_PARSE_FUNC_SETTER,
+    JS_PARSE_FUNC_METHOD,
+    JS_PARSE_FUNC_CLASS_CONSTRUCTOR,
+    JS_PARSE_FUNC_DERIVED_CLASS_CONSTRUCTOR,
+} JSParseFunctionEnum;
+
+typedef enum JSParseExportEnum {
+    JS_PARSE_EXPORT_NONE,
+    JS_PARSE_EXPORT_NAMED,
+    JS_PARSE_EXPORT_DEFAULT,
+} JSParseExportEnum;
+
+typedef struct JSFunctionDef {
+    JSContext *ctx;
+    struct JSFunctionDef *parent;
+    int parent_cpool_idx; /* index in the constant pool of the parent
+                             or -1 if none */
+    int parent_scope_level; /* scope level in parent at point of definition */
+    struct list_head child_list; /* list of JSFunctionDef.link */
+    struct list_head link;
+
+    BOOL is_eval; /* TRUE if eval code */
+    int eval_type; /* only valid if is_eval = TRUE */
+    BOOL is_global_var; /* TRUE if variables are not defined locally:
+                           eval global, eval module or non strict eval */
+    BOOL is_func_expr; /* TRUE if function expression */
+    BOOL has_home_object; /* TRUE if the home object is available */
+    BOOL has_prototype; /* true if a prototype field is necessary */
+    BOOL has_simple_parameter_list;
+    BOOL has_use_strict; /* to reject directive in special cases */
+    BOOL has_eval_call; /* true if the function contains a call to eval() */
+    BOOL has_arguments_binding; /* true if the 'arguments' binding is
+                                   available in the function */
+    BOOL has_this_binding; /* true if the 'this' and new.target binding are
+                              available in the function */
+    BOOL new_target_allowed; /* true if the 'new.target' does not
+                                throw a syntax error */
+    BOOL super_call_allowed; /* true if super() is allowed */
+    BOOL super_allowed; /* true if super. or super[] is allowed */
+    BOOL is_derived_class_constructor;
+    BOOL in_function_body;
+    JSFunctionKindEnum func_kind : 8;
+    JSParseFunctionEnum func_type : 8;
+    uint8_t js_mode; /* bitmap of JS_MODE_x */
+    JSAtom func_name; /* JS_ATOM_NULL if no name */
+
+    JSVarDef *vars;
+    int var_size; /* allocated size for vars[] */
+    int var_count;
+    JSVarDef *args;
+    int arg_size; /* allocated size for args[] */
+    int arg_count; /* number of arguments */
+    int defined_arg_count;
+    int var_object_idx; /* -1 if none */
+    int arguments_var_idx; /* -1 if none */
+    int func_var_idx; /* variable containing the current function (-1
+                         if none, only used if is_func_expr is true) */
+    int eval_ret_idx; /* variable containing the return value of the eval, -1 if none */
+    int this_var_idx; /* variable containg the 'this' value, -1 if none */
+    int new_target_var_idx; /* variable containg the 'new.target' value, -1 if none */
+    int this_active_func_var_idx; /* variable containg the 'this.active_func' value, -1 if none */
+    int home_object_var_idx;
+
+    int scope_level;    /* index into fd->scopes if the current lexical scope */
+    int scope_first;    /* index into vd->vars of first lexically scoped variable */
+    int scope_size;     /* allocated size of fd->scopes array */
+    int scope_count;    /* number of entries used in the fd->scopes array */
+    JSVarScope *scopes;
+    JSVarScope def_scope_array[4];
+
+    int hoisted_def_count;
+    int hoisted_def_size;
+    JSHoistedDef *hoisted_def;
+
+    DynBuf byte_code;
+    int last_opcode_pos; /* -1 if no last opcode */
+    int last_opcode_line_num;
+
+    LabelSlot *label_slots;
+    int label_size; /* allocated size for label_slots[] */
+    int label_count;
+    BlockEnv *top_break; /* break/continue label stack */
+
+    /* constant pool (strings, functions, numbers) */
+    JSValue *cpool;
+    uint32_t cpool_count;
+    uint32_t cpool_size;
+
+    /* list of variables in the closure */
+    int closure_var_count;
+    int closure_var_size;
+    JSClosureVar *closure_var;
+
+    JumpSlot *jump_slots;
+    int jump_size;
+    int jump_count;
+
+    LineNumberSlot *line_number_slots;
+    int line_number_size;
+    int line_number_count;
+    int line_number_last;
+    int line_number_last_pc;
+
+    /* pc2line table */
+    JSAtom filename;
+    int line_num;
+    DynBuf pc2line;
+
+    char *source;  /* raw source, utf-8 encoded */
+    int source_len;
+
+    JSModuleDef *module; /* != NULL when parsing a module */
+} JSFunctionDef;
+
+typedef struct JSToken {
+    int val;
+    int line_num;   /* line number of token start */
+    const uint8_t *ptr;
+    union {
+        struct {
+            JSValue str;
+            int sep;
+        } str;
+        struct {
+            JSValue val;
+#ifdef CONFIG_BIGNUM
+            slimb_t exponent; /* may be != 0 only if val is a float */
+#endif
+        } num;
+        struct {
+            JSAtom atom;
+            BOOL has_escape;
+            BOOL is_reserved;
+        } ident;
+        struct {
+            JSValue body;
+            JSValue flags;
+        } regexp;
+    } u;
+} JSToken;
+
+typedef struct JSParseState {
+    JSContext *ctx;
+    int last_line_num;  /* line number of last token */
+    int line_num;       /* line number of current offset */
+    const char *filename;
+    JSToken token;
+    BOOL got_lf; /* true if got line feed before the current token */
+    const uint8_t *last_ptr;
+    const uint8_t *buf_ptr;
+    const uint8_t *buf_end;
+
+    /* current function code */
+    JSFunctionDef *cur_func;
+    BOOL is_module; /* parsing a module */
+    BOOL allow_html_comments;
+} JSParseState;
+
+typedef struct JSOpCode {
+#ifdef DUMP_BYTECODE
+    const char *name;
+#endif
+    uint8_t size; /* in bytes */
+    /* the opcodes remove n_pop items from the top of the stack, then
+       pushes n_push items */
+    uint8_t n_pop;
+    uint8_t n_push;
+    uint8_t fmt;
+} JSOpCode;
+
+static const JSOpCode opcode_info[OP_COUNT] = {
+#define FMT(f)
+#ifdef DUMP_BYTECODE
+#define DEF(id, size, n_pop, n_push, f) { #id, size, n_pop, n_push, OP_FMT_ ## f },
+#else
+#define DEF(id, size, n_pop, n_push, f) { size, n_pop, n_push, OP_FMT_ ## f },
+#endif
+#include "quickjs-opcode.h"
+#undef DEF
+#undef FMT
+};
+
+static __exception int next_token(JSParseState *s);
+
+static void free_token(JSParseState *s, JSToken *token)
+{
+    switch(token->val) {
+#ifdef CONFIG_BIGNUM
+    case TOK_NUMBER:
+        JS_FreeValue(s->ctx, token->u.num.val);
+        break;
+#endif
+    case TOK_STRING:
+    case TOK_TEMPLATE:
+        JS_FreeValue(s->ctx, token->u.str.str);
+        break;
+    case TOK_REGEXP:
+        JS_FreeValue(s->ctx, token->u.regexp.body);
+        JS_FreeValue(s->ctx, token->u.regexp.flags);
+        break;
+    case TOK_IDENT:
+#if defined(_MSC_VER)
+	case TOK_NULL: /* must be first */
+    case TOK_FALSE:
+    case TOK_TRUE:
+    case TOK_IF:
+    case TOK_ELSE:
+    case TOK_RETURN:
+    case TOK_VAR:
+    case TOK_THIS:
+    case TOK_DELETE:
+    case TOK_VOID:
+    case TOK_TYPEOF:
+    case TOK_NEW:
+    case TOK_IN:
+    case TOK_INSTANCEOF:
+    case TOK_DO:
+    case TOK_WHILE:
+    case TOK_FOR:
+    case TOK_BREAK:
+    case TOK_CONTINUE:
+    case TOK_SWITCH:
+    case TOK_CASE:
+    case TOK_DEFAULT:
+    case TOK_THROW:
+    case TOK_TRY:
+    case TOK_CATCH:
+    case TOK_FINALLY:
+    case TOK_FUNCTION:
+    case TOK_DEBUGGER:
+    case TOK_WITH:
+    /* FutureReservedWord */
+    case TOK_CLASS:
+    case TOK_CONST:
+    case TOK_ENUM:
+    case TOK_EXPORT:
+    case TOK_EXTENDS:
+    case TOK_IMPORT:
+    case TOK_SUPER:
+    /* FutureReservedWords when parsing strict mode code */
+    case TOK_IMPLEMENTS:
+    case TOK_INTERFACE:
+    case TOK_LET:
+    case TOK_PACKAGE:
+    case TOK_PRIVATE:
+    case TOK_PROTECTED:
+    case TOK_PUBLIC:
+    case TOK_STATIC:
+    case TOK_YIELD:
+    case TOK_AWAIT: /* must be last */
+#else
+    case TOK_FIRST_KEYWORD ... TOK_LAST_KEYWORD:
+#endif
+        JS_FreeAtom(s->ctx, token->u.ident.atom);
+        break;
+    default:
+        break;
+    }
+}
+
+#if defined(_MSC_VER)
+static void dump_token(JSParseState *s,
+                                             const JSToken *token)
+#else
+static void __attribute((unused)) dump_token(JSParseState *s,
+                                             const JSToken *token)
+#endif
+{
+    switch(token->val) {
+    case TOK_NUMBER:
+        {
+            double d;
+            JS_ToFloat64(s->ctx, &d, token->u.num.val);  /* no exception possible */
+            printf("number: %.14g\n", d);
+        }
+        break;
+    case TOK_IDENT:
+    dump_atom:
+        {
+            char buf[ATOM_GET_STR_BUF_SIZE];
+            printf("ident: '%s'\n",
+                   JS_AtomGetStr(s->ctx, buf, sizeof(buf), token->u.ident.atom));
+        }
+        break;
+    case TOK_STRING:
+        {
+            const char *str;
+            /* XXX: quote the string */
+            str = JS_ToCString(s->ctx, token->u.str.str);
+            printf("string: '%s'\n", str);
+            JS_FreeCString(s->ctx, str);
+        }
+        break;
+    case TOK_TEMPLATE:
+        {
+            const char *str;
+            str = JS_ToCString(s->ctx, token->u.str.str);
+            printf("template: `%s`\n", str);
+            JS_FreeCString(s->ctx, str);
+        }
+        break;
+    case TOK_REGEXP:
+        {
+            const char *str, *str2;
+            str = JS_ToCString(s->ctx, token->u.regexp.body);
+            str2 = JS_ToCString(s->ctx, token->u.regexp.flags);
+            printf("regexp: '%s' '%s'\n", str, str2);
+            JS_FreeCString(s->ctx, str);
+            JS_FreeCString(s->ctx, str2);
+        }
+        break;
+    case TOK_EOF:
+        printf("eof\n");
+        break;
+    default:
+        if (s->token.val >= TOK_NULL && s->token.val <= TOK_LAST_KEYWORD) {
+            goto dump_atom;
+        } else if (s->token.val >= 256) {
+            printf("token: %d\n", token->val);
+        } else {
+            printf("token: '%c'\n", token->val);
+        }
+        break;
+    }
+}
+
+#if defined(_MSC_VER)
+int js_parse_error(JSParseState *s, const char *fmt, ...)
+#else
+int __attribute__((format(printf, 2, 3))) js_parse_error(JSParseState *s, const char *fmt, ...)
+#endif
+{
+    JSContext *ctx = s->ctx;
+    va_list ap;
+
+    va_start(ap, fmt);
+    JS_ThrowError(ctx, JS_SYNTAX_ERROR, fmt, ap);
+    va_end(ap);
+
+    build_backtrace(ctx, ctx->current_exception, s->filename, s->line_num, NULL);
+    return -1;
+}
+
+#if defined(_MSC_VER)
+int js_parse_error1(JSParseState *s, JSErrorEnum error_num,
+                                                          const char *fmt, ...)
+#else
+int __attribute__((format(printf, 3, 4))) js_parse_error1(JSParseState *s, JSErrorEnum error_num,
+                                                          const char *fmt, ...)
+#endif
+{
+    JSContext *ctx = s->ctx;
+    va_list ap;
+
+    va_start(ap, fmt);
+    JS_ThrowError(ctx, error_num, fmt, ap);
+    va_end(ap);
+
+    build_backtrace(ctx, ctx->current_exception, s->filename, s->line_num, NULL);
+    return -1;
+}
+
+static int js_parse_expect(JSParseState *s, int tok)
+{
+    if (s->token.val != tok) {
+        /* XXX: dump token correctly in all cases */
+        return js_parse_error(s, "expecting '%c'", tok);
+    }
+    return next_token(s);
+}
+
+static int js_parse_expect_semi(JSParseState *s)
+{
+    if (s->token.val != ';') {
+        /* automatic insertion of ';' */
+        if (s->token.val == TOK_EOF || s->token.val == '}' || s->got_lf) {
+            return 0;
+        }
+        return js_parse_error(s, "expecting '%c'", ';');
+    }
+    return next_token(s);
+}
+
+static int js_parse_error_reserved_identifier(JSParseState *s)
+{
+    char buf1[ATOM_GET_STR_BUF_SIZE];
+    return js_parse_error(s, "'%s' is a reserved identifier",
+                          JS_AtomGetStr(s->ctx, buf1, sizeof(buf1),
+                                        s->token.u.ident.atom));
+}
+
+static __exception int js_parse_template_part(JSParseState *s, const uint8_t *p)
+{
+    uint32_t c;
+    StringBuffer b_s, *b = &b_s;
+
+    /* p points to the first byte of the template part */
+    if (string_buffer_init(s->ctx, b, 32))
+        goto fail;
+    for(;;) {
+        if (p >= s->buf_end)
+            goto unexpected_eof;
+        c = *p++;
+        if (c == '`') {
+            /* template end part */
+            break;
+        }
+        if (c == '$' && *p == '{') {
+            /* template start or middle part */
+            p++;
+            break;
+        }
+        if (c == '\\') {
+            if (string_buffer_putc8(b, c))
+                goto fail;
+            if (p >= s->buf_end)
+                goto unexpected_eof;
+            c = *p++;
+        }
+        /* newline sequences are normalized as single '\n' bytes */
+        if (c == '\r') {
+            if (*p == '\n')
+                p++;
+            c = '\n';
+        }
+        if (c == '\n') {
+            s->line_num++;
+        } else if (c >= 0x80) {
+            const uint8_t *p_next;
+            c = unicode_from_utf8(p - 1, UTF8_CHAR_LEN_MAX, &p_next);
+            if (c > 0x10FFFF) {
+                js_parse_error(s, "invalid UTF-8 sequence");
+                goto fail;
+            }
+            p = p_next;
+        }
+        if (string_buffer_putc(b, c))
+            goto fail;
+    }
+    s->token.val = TOK_TEMPLATE;
+    s->token.u.str.sep = c;
+    s->token.u.str.str = string_buffer_end(b);
+    s->buf_ptr = p;
+    return 0;
+
+ unexpected_eof:
+    js_parse_error(s, "unexpected end of string");
+ fail:
+    string_buffer_free(b);
+    return -1;
+}
+
+static __exception int js_parse_string(JSParseState *s, int sep,
+                                       BOOL do_throw, const uint8_t *p,
+                                       JSToken *token, const uint8_t **pp)
+{
+    int ret;
+    uint32_t c;
+    StringBuffer b_s, *b = &b_s;
+
+    /* string */
+    if (string_buffer_init(s->ctx, b, 32))
+        goto fail;
+    for(;;) {
+        if (p >= s->buf_end)
+            goto invalid_char;
+        c = *p;
+        if (c < 0x20) {
+            if (!s->cur_func) {
+                if (do_throw)
+                    js_parse_error(s, "invalid character in a JSON string");
+                goto fail;
+            }
+            if (sep == '`') {
+                if (c == '\r') {
+                    if (p[1] == '\n')
+                        p++;
+                    c = '\n';
+                }
+                /* do not update s->line_num */
+            } else if (c == '\n' || c == '\r')
+                goto invalid_char;
+        }
+        p++;
+        if (c == sep)
+            break;
+        if (c == '$' && *p == '{' && sep == '`') {
+            /* template start or middle part */
+            p++;
+            break;
+        }
+        if (c == '\\') {
+            c = *p;
+            switch(c) {
+            case '\0':
+                if (p >= s->buf_end)
+                    goto invalid_char;
+                p++;
+                break;
+            case '\'':
+            case '\"':
+            case '\\':
+                p++;
+                break;
+            case '\r':  /* accept DOS and MAC newline sequences */
+                if (p[1] == '\n') {
+                    p++;
+                }
+                /* fall thru */
+            case '\n':
+                /* ignore escaped newline sequence */
+                p++;
+                if (sep != '`')
+                    s->line_num++;
+                continue;
+            default:
+                if (c >= '0' && c <= '7') {
+                    if (!s->cur_func)
+                        goto invalid_octal; /* JSON case */
+                    if (!(s->cur_func->js_mode & JS_MODE_STRICT) && sep != '`')
+                        goto parse_escape;
+                    if (c == '0' && !(p[1] >= '0' && p[1] <= '9')) {
+                        p++;
+                        c = '\0';
+                    } else {
+                    invalid_octal:
+                        if (do_throw)
+                            js_parse_error(s, "invalid octal syntax in strict mode");
+                        goto fail;
+                    }
+                } else if (c >= 0x80) {
+                    const uint8_t *p_next;
+                    c = unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p_next);
+                    if (c > 0x10FFFF) {
+                        goto invalid_utf8;
+                    }
+                    p = p_next;
+                    /* LS or PS are skipped */
+                    if (c == CP_LS || c == CP_PS)
+                        continue;
+                } else {
+                parse_escape:
+                    ret = lre_parse_escape(&p, TRUE);
+                    if (ret == -1) {
+                        if (do_throw)
+                            js_parse_error(s, "malformed escape sequence in string literal");
+                        goto fail;
+                    } else if (ret < 0) {
+                        /* ignore the '\' (could output a warning) */
+                        p++;
+                    } else {
+                        c = ret;
+                    }
+                }
+                break;
+            }
+        } else if (c >= 0x80) {
+            const uint8_t *p_next;
+            c = unicode_from_utf8(p - 1, UTF8_CHAR_LEN_MAX, &p_next);
+            if (c > 0x10FFFF)
+                goto invalid_utf8;
+            p = p_next;
+#ifndef JSON_SUPERSET
+            /* LS or PS are invalid in Javascript string literals, considered
+               as line terminators, but allowed in JSON source and template
+               literals.
+               ECMA 2019 proposal json-superset removes this restriction.
+             */
+            if ((c == CP_LS || c == CP_PS) && sep != '`' && s->cur_func)
+                goto invalid_char;
+#endif
+        }
+        if (string_buffer_putc(b, c))
+            goto fail;
+    }
+    token->val = TOK_STRING;
+    token->u.str.sep = c;
+    token->u.str.str = string_buffer_end(b);
+    *pp = p;
+    return 0;
+
+ invalid_utf8:
+    if (do_throw)
+        js_parse_error(s, "invalid UTF-8 sequence");
+    goto fail;
+ invalid_char:
+    if (do_throw)
+        js_parse_error(s, "unexpected end of string");
+ fail:
+    string_buffer_free(b);
+    return -1;
+}
+
+static inline BOOL token_is_pseudo_keyword(JSParseState *s, JSAtom atom) {
+    return s->token.val == TOK_IDENT && s->token.u.ident.atom == atom &&
+        !s->token.u.ident.has_escape;
+}
+
+/* return TRUE if a regexp literal is allowed after this token */
+static BOOL is_regexp_allowed(JSParseState *s)
+{
+    switch (s->token.val) {
+    case TOK_NUMBER:
+    case TOK_STRING:
+    case TOK_REGEXP:
+    case TOK_DEC:
+    case TOK_INC:
+    case TOK_NULL:
+    case TOK_FALSE:
+    case TOK_TRUE:
+    case TOK_THIS:
+    case ')':
+    case ']':
+    case '}':
+        return FALSE;
+    case TOK_IDENT:
+        return token_is_pseudo_keyword(s, JS_ATOM_of) || token_is_pseudo_keyword(s, JS_ATOM_yield);
+    default:
+        return TRUE;
+    }
+}
+
+static __exception int js_parse_regexp(JSParseState *s)
+{
+    const uint8_t *p;
+    BOOL in_class;
+    StringBuffer b_s, *b = &b_s;
+    StringBuffer b2_s, *b2 = &b2_s;
+    uint32_t c;
+
+    p = s->buf_ptr;
+    p++;
+    in_class = FALSE;
+    if (string_buffer_init(s->ctx, b, 32))
+        return -1;
+    if (string_buffer_init(s->ctx, b2, 1))
+        goto fail;
+    for(;;) {
+        if (p >= s->buf_end) {
+        eof_error:
+            js_parse_error(s, "unexpected end of regexp");
+            goto fail;
+        }
+        c = *p++;
+        if (c == '\n' || c == '\r') {
+            goto eol_error;
+        } else if (c == '/') {
+            if (!in_class)
+                break;
+        } else if (c == '[') {
+            in_class = TRUE;
+        } else if (c == ']') {
+            /* XXX: incorrect as the first character in a class */
+            in_class = FALSE;
+        } else if (c == '\\') {
+            if (string_buffer_putc8(b, c))
+                goto fail;
+            c = *p++;
+            if (c == '\n' || c == '\r')
+                goto eol_error;
+            else if (c == '\0' && p >= s->buf_end)
+                goto eof_error;
+            else if (c >= 0x80) {
+                const uint8_t *p_next;
+                c = unicode_from_utf8(p - 1, UTF8_CHAR_LEN_MAX, &p_next);
+                if (c > 0x10FFFF) {
+                    goto invalid_utf8;
+                }
+                p = p_next;
+                if (c == CP_LS || c == CP_PS)
+                    goto eol_error;
+            }
+        } else if (c >= 0x80) {
+            const uint8_t *p_next;
+            c = unicode_from_utf8(p - 1, UTF8_CHAR_LEN_MAX, &p_next);
+            if (c > 0x10FFFF) {
+            invalid_utf8:
+                js_parse_error(s, "invalid UTF-8 sequence");
+                goto fail;
+            }
+            p = p_next;
+            /* LS or PS are considered as line terminator */
+            if (c == CP_LS || c == CP_PS) {
+            eol_error:
+                js_parse_error(s, "unexpected line terminator in regexp");
+                goto fail;
+            }
+        }
+        if (string_buffer_putc(b, c))
+            goto fail;
+    }
+
+    /* flags */
+    for(;;) {
+        const uint8_t *p_next = p;
+        c = *p_next++;
+        if (c >= 0x80) {
+            c = unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p_next);
+            if (c > 0x10FFFF) {
+                goto invalid_utf8;
+            }
+        }
+        if (!lre_js_is_ident_next(c))
+            break;
+        if (string_buffer_putc(b2, c))
+            goto fail;
+        p = p_next;
+    }
+
+    s->token.val = TOK_REGEXP;
+    s->token.u.regexp.body = string_buffer_end(b);
+    s->token.u.regexp.flags = string_buffer_end(b2);
+    s->buf_ptr = p;
+    return 0;
+ fail:
+    string_buffer_free(b);
+    string_buffer_free(b2);
+    return -1;
+}
+
+static __exception int next_token(JSParseState *s)
+{
+    const uint8_t *p;
+    int c;
+    char buf[4096], *q;
+    BOOL ident_has_escape;
+
+    free_token(s, &s->token);
+
+    p = s->last_ptr = s->buf_ptr;
+    s->got_lf = FALSE;
+    s->last_line_num = s->token.line_num;
+ redo:
+    s->token.line_num = s->line_num;
+    s->token.ptr = p;
+    c = *p;
+    switch(c) {
+    case 0:
+        s->token.val = TOK_EOF;
+        break;
+    case '`':
+        if (!s->cur_func) {
+            /* JSON does not accept templates */
+            goto def_token;
+        }
+        if (js_parse_template_part(s, p + 1))
+            goto fail;
+        p = s->buf_ptr;
+        break;
+    case '\'':
+        if (!s->cur_func) {
+            /* JSON does not accept single quoted strings */
+            goto def_token;
+        }
+        /* fall through */
+    case '\"':
+        if (js_parse_string(s, c, TRUE, p + 1, &s->token, &p))
+            goto fail;
+        break;
+    case '\r':  /* accept DOS and MAC newline sequences */
+        if (p[1] == '\n') {
+            p++;
+        }
+        /* fall thru */
+    case '\n':
+        p++;
+    line_terminator:
+        s->got_lf = TRUE;
+        s->line_num++;
+        goto redo;
+    case '\f':
+    case '\v':
+        if (!s->cur_func) {
+            /* JSONWhitespace does not match <VT>, nor <FF> */
+            goto def_token;
+        }
+        /* fall through */
+    case ' ':
+    case '\t':
+        p++;
+        goto redo;
+    case '/':
+        if (p[1] == '*') {
+            /* comment */
+            p += 2;
+            for(;;) {
+                if (*p == '\0' && p >= s->buf_end) {
+                    js_parse_error(s, "unexpected end of comment");
+                    goto fail;
+                }
+                if (p[0] == '*' && p[1] == '/') {
+                    p += 2;
+                    break;
+                }
+                if (*p == '\n')
+                    s->line_num++;
+                p++;
+            }
+            goto redo;
+        } else if (p[1] == '/') {
+            /* line comment */
+            p += 2;
+        skip_line_comment:
+            for(;;) {
+                if (*p == '\0' && p >= s->buf_end)
+                    break;
+                if (*p == '\r' || *p == '\n')
+                    break;
+                if (*p >= 0x80) {
+                    c = unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p);
+                    /* LS or PS are considered as line terminator */
+                    if (c == CP_LS || c == CP_PS)
+                        break;
+                } else {
+                    p++;
+                }
+            }
+            goto redo;
+        } else if (is_regexp_allowed(s)) {
+            s->buf_ptr = p;
+            if (js_parse_regexp(s))
+                goto fail;
+            p = s->buf_ptr;
+        } else if (p[1] == '=') {
+            p += 2;
+            s->token.val = TOK_DIV_ASSIGN;
+        } else {
+            p++;
+            s->token.val = c;
+        }
+        break;
+    case '\\':
+        if (p[1] == 'u') {
+            const uint8_t *p1 = p + 1;
+            int c1 = lre_parse_escape(&p1, TRUE);
+            if (c1 >= 0 && lre_js_is_ident_first(c1)) {
+                c = c1;
+                p = p1;
+                ident_has_escape = TRUE;
+                goto has_ident;
+            } else {
+                /* XXX: syntax error? */
+            }
+        }
+        goto def_token;
+#if defined(_MSC_VER)
+	case 'a':
+	case 'b':
+	case 'c':
+	case 'd':
+	case 'e':
+	case 'f':
+	case 'g':
+	case 'h':
+	case 'i':
+	case 'j':
+	case 'k':
+	case 'l':
+	case 'm':
+	case 'n':
+	case 'o':
+	case 'p':
+	case 'q':
+	case 'r':
+	case 's':
+	case 't':
+	case 'u':
+	case 'v':
+	case 'w':
+	case 'x':
+	case 'y':
+	case 'z':
+#else
+    case 'a' ... 'z':
+#endif
+#if defined(_MSC_VER)
+	case 'A':
+	case 'B':
+	case 'C':
+	case 'D':
+	case 'E':
+	case 'F':
+	case 'G':
+	case 'H':
+	case 'I':
+	case 'J':
+	case 'K':
+	case 'L':
+	case 'M':
+	case 'N':
+	case 'O':
+	case 'P':
+	case 'Q':
+	case 'R':
+	case 'S':
+	case 'T':
+	case 'U':
+	case 'V':
+	case 'W':
+	case 'X':
+	case 'Y':
+	case 'Z':
+#else
+    case 'A' ... 'Z':
+#endif
+    case '_':
+    case '$':
+        /* identifier */
+        p++;
+        ident_has_escape = FALSE;
+    has_ident:
+        q = buf;
+        for(;;) {
+            const uint8_t *p1 = p;
+
+            if (c < 128) {
+                *q++ = c;
+            } else {
+                q += unicode_to_utf8((uint8_t*)q, c);
+            }
+            c = *p1++;
+            if (c == '\\' && *p1 == 'u') {
+                c = lre_parse_escape(&p1, TRUE);
+                ident_has_escape = TRUE;
+            } else if (c >= 128) {
+                c = unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p1);
+            }
+            /* XXX: check if c >= 0 and c <= 0x10FFFF */
+            if (!lre_js_is_ident_next(c))
+                break;
+            p = p1;
+            if ((q - buf) >= sizeof(buf) - UTF8_CHAR_LEN_MAX) {
+                js_parse_error(s, "identifier too long");
+                goto fail;
+            }
+        }
+        *q = '\0';
+        s->token.u.ident.atom = JS_NewAtomLen(s->ctx, buf, q - buf);
+        s->token.u.ident.has_escape = ident_has_escape;
+        s->token.u.ident.is_reserved = FALSE;
+        if (s->token.u.ident.atom <= JS_ATOM_LAST_KEYWORD ||
+            (s->token.u.ident.atom <= JS_ATOM_LAST_STRICT_KEYWORD &&
+             s->cur_func && (s->cur_func->js_mode & JS_MODE_STRICT)) ||
+            (s->token.u.ident.atom == JS_ATOM_yield && s->cur_func &&
+             ((s->cur_func->func_kind & JS_FUNC_GENERATOR) ||
+              (s->cur_func->func_type == JS_PARSE_FUNC_ARROW &&
+               !s->cur_func->in_function_body && s->cur_func->parent &&
+               (s->cur_func->parent->func_kind & JS_FUNC_GENERATOR)))) ||
+            (s->token.u.ident.atom == JS_ATOM_await &&
+             (s->is_module ||
+              (s->cur_func &&
+               ((s->cur_func->func_kind & JS_FUNC_ASYNC) ||
+                (s->cur_func->func_type == JS_PARSE_FUNC_ARROW &&
+                 !s->cur_func->in_function_body && s->cur_func->parent &&
+                 (s->cur_func->parent->func_kind & JS_FUNC_ASYNC))))))) {
+                  if (ident_has_escape) {
+                      s->token.u.ident.is_reserved = TRUE;
+                      s->token.val = TOK_IDENT;
+                  } else {
+                      /* The keywords atoms are pre allocated */
+                      s->token.val = s->token.u.ident.atom - 1 + TOK_FIRST_KEYWORD;
+                  }
+        } else {
+            s->token.val = TOK_IDENT;
+        }
+        break;
+    case '.':
+        if (p[1] == '.' && p[2] == '.') {
+            p += 3;
+            s->token.val = TOK_ELLIPSIS;
+            break;
+        }
+        if (p[1] >= '0' && p[1] <= '9') {
+            goto parse_number;
+        } else {
+            goto def_token;
+        }
+        break;
+    case '0':
+        /* in strict or JSON parsing mode, octal literals are not accepted */
+        if (is_digit(p[1]) && (!s->cur_func ||
+                               (s->cur_func->js_mode & JS_MODE_STRICT))) {
+            js_parse_error(s, "octal literals are deprecated in strict mode");
+            goto fail;
+        }
+        goto parse_number;
+#if defined(_MSC_VER)
+	case '1':
+	case '2':
+	case '3':
+	case '4':
+	case '5':
+	case '6':
+	case '7':
+	case '8':
+	case '9':
+#else
+    case '1' ... '9':
+#endif
+        /* number */
+    parse_number:
+#ifdef CONFIG_BIGNUM
+        {
+            const uint8_t *p1;
+            int flags;
+            slimb_t exponent;
+            JSValue val;
+
+            s->token.val = TOK_NUMBER;
+            s->token.u.num.val = JS_UNDEFINED;
+            s->token.u.num.exponent = 0;
+            if (!s->cur_func) {
+                /* JSON: use current float precision */
+                flags = BF_ATOF_THROW;
+                if (is_bignum_mode(s->ctx))
+                    flags |= BF_ATOF_INT_PREC_INF;
+                else
+                    flags |= BF_ATOF_FLOAT64;
+                val = js_atof(s->ctx, (const char *)p, (const char **)&p,
+                              10, flags);
+                if (JS_IsException(val))
+                    goto bad_number;
+            } else {
+                bf_t r_s, *r = &r_s;
+                BOOL bigint_mode, is_bigint, is_bigfloat;
+                int res;
+
+                bigint_mode = (s->cur_func->js_mode & JS_MODE_BIGINT) != 0;
+                flags = BF_ATOF_BIN_OCT | BF_ATOF_LEGACY_OCTAL |
+                    BF_ATOF_UNDERSCORE_SEP | BF_ATOF_INT_PREC_INF | BF_RNDZ;
+                if (!bigint_mode)
+                    flags |= BF_ATOF_ONLY_DEC_FLOAT;
+                p += skip_spaces((char *)p);
+                bf_init(s->ctx->bf_ctx, r);
+                res = bf_atof2(r, &exponent, (const char *)p,
+                               (const char **)&p, 0, BF_PREC_INF, flags);
+                if (bf_is_nan(r)) {
+                    bf_delete(r);
+                    goto bad_number;
+                }
+                is_bigint = FALSE;
+                is_bigfloat = FALSE;
+                if (*p == 'n') {
+                    if (!(res & BF_ATOF_ST_INTEGER)) {
+                        bf_delete(r);
+                        goto bad_number;
+                    }
+                    p++;
+                    is_bigint = TRUE;
+                } else if (*p == 'l') {
+                    p++;
+                    is_bigfloat = TRUE;
+                }
+                if ((res & BF_ATOF_ST_INTEGER) && !is_bigfloat &&
+                    (bigint_mode || is_bigint)) {
+                    /* in bigint mode: small integer or bigint
+                       in legacy mode: always a bigint */
+                    val = JS_NewBigInt2(s->ctx, r, bigint_mode ^ 1);
+                } else {
+                    /* `n` suffix is implied in math mode */
+                    if (s->cur_func->js_mode & JS_MODE_MATH)
+                        is_bigfloat = TRUE;
+                    if (is_bigfloat) {
+                        /* infinite precision */
+                        val = JS_NewBigFloat(s->ctx, r);
+                        s->token.u.num.exponent = exponent;
+                    } else {
+                        double d;
+                        d = bf_mul_pow10_to_float64(s->ctx, r, exponent);
+                        bf_delete(r);
+                        val = JS_NewFloat64(s->ctx, d);
+                    }
+                }
+            }
+            s->token.u.num.val = val;
+            if (lre_js_is_ident_next(unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p1))) {
+            bad_number:
+                js_parse_error(s, "invalid number literal");
+                goto fail;
+            }
+        }
+#else
+        {
+            JSValue ret;
+            const uint8_t *p1;
+            int flags, radix;
+            if (!s->cur_func) {
+                flags = ATOD_THROW;
+                radix = 10;
+            } else {
+                flags = ATOD_ACCEPT_BIN_OCT | ATOD_THROW | ATOD_ACCEPT_LEGACY_OCTAL |
+                    ATOD_ACCEPT_UNDERSCORES;
+                radix = 0;
+            }
+            ret = js_atod(s->ctx, (const char *)p, (const char **)&p, radix,
+                          flags);
+            /* reject `10instanceof Number` */
+            if (JS_IsException(ret) ||
+                lre_js_is_ident_next(unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p1))) {
+                js_parse_error(s, "invalid number literal");
+                goto fail;
+            }
+            s->token.val = TOK_NUMBER;
+            s->token.u.num.val = ret;
+        }
+#endif
+        break;
+    case '*':
+        if (p[1] == '=') {
+            p += 2;
+            s->token.val = TOK_MUL_ASSIGN;
+        } else if (p[1] == '*') {
+            if (p[2] == '=') {
+                p += 3;
+                s->token.val = TOK_POW_ASSIGN;
+            } else {
+                p += 2;
+                s->token.val = TOK_POW;
+            }
+        } else {
+            goto def_token;
+        }
+        break;
+    case '%':
+        if (p[1] == '=') {
+            p += 2;
+            s->token.val = TOK_MOD_ASSIGN;
+        } else {
+            goto def_token;
+        }
+        break;
+    case '+':
+        if (p[1] == '=') {
+            p += 2;
+            s->token.val = TOK_PLUS_ASSIGN;
+        } else if (p[1] == '+') {
+            p += 2;
+            s->token.val = TOK_INC;
+        } else {
+            goto def_token;
+        }
+        break;
+    case '-':
+        if (p[1] == '=') {
+            p += 2;
+            s->token.val = TOK_MINUS_ASSIGN;
+        } else if (p[1] == '-') {
+            if (s->allow_html_comments &&
+                p[2] == '>' && s->last_line_num != s->line_num) {
+                /* Annex B: `-->` at beginning of line is an html comment end.
+                   It extends to the end of the line.
+                 */
+                goto skip_line_comment;
+            }
+            p += 2;
+            s->token.val = TOK_DEC;
+        } else {
+            goto def_token;
+        }
+        break;
+    case '<':
+        if (p[1] == '=') {
+            p += 2;
+            s->token.val = TOK_LTE;
+        } else if (p[1] == '<') {
+            if (p[2] == '=') {
+                p += 3;
+                s->token.val = TOK_SHL_ASSIGN;
+            } else {
+                p += 2;
+                s->token.val = TOK_SHL;
+            }
+        } else if (s->allow_html_comments &&
+                   p[1] == '!' && p[2] == '-' && p[3] == '-') {
+            /* Annex B: handle `<!--` single line html comments */
+            goto skip_line_comment;
+        } else {
+            goto def_token;
+        }
+        break;
+    case '>':
+        if (p[1] == '=') {
+            p += 2;
+            s->token.val = TOK_GTE;
+        } else if (p[1] == '>') {
+            if (p[2] == '>') {
+                if (p[3] == '=') {
+                    p += 4;
+                    s->token.val = TOK_SHR_ASSIGN;
+                } else {
+                    p += 3;
+                    s->token.val = TOK_SHR;
+                }
+            } else if (p[2] == '=') {
+                p += 3;
+                s->token.val = TOK_SAR_ASSIGN;
+            } else {
+                p += 2;
+                s->token.val = TOK_SAR;
+            }
+        } else {
+            goto def_token;
+        }
+        break;
+    case '=':
+        if (p[1] == '=') {
+            if (p[2] == '=') {
+                p += 3;
+                s->token.val = TOK_STRICT_EQ;
+            } else {
+                p += 2;
+                s->token.val = TOK_EQ;
+            }
+        } else if (p[1] == '>') {
+            p += 2;
+            s->token.val = TOK_ARROW;
+        } else {
+            goto def_token;
+        }
+        break;
+    case '!':
+        if (p[1] == '=') {
+            if (p[2] == '=') {
+                p += 3;
+                s->token.val = TOK_STRICT_NEQ;
+            } else {
+                p += 2;
+                s->token.val = TOK_NEQ;
+            }
+        } else {
+            goto def_token;
+        }
+        break;
+    case '&':
+        if (p[1] == '=') {
+            p += 2;
+            s->token.val = TOK_AND_ASSIGN;
+        } else if (p[1] == '&') {
+            p += 2;
+            s->token.val = TOK_LAND;
+        } else {
+            goto def_token;
+        }
+        break;
+#ifdef CONFIG_BIGNUM
+        /* in math mode, '^' is the power operator. '^^' is always the
+           xor operator and '**' is always the power operator */
+    case '^':
+        if (p[1] == '=') {
+            p += 2;
+            if (s->cur_func && (s->cur_func->js_mode & JS_MODE_MATH))
+                s->token.val = TOK_MATH_POW_ASSIGN;
+            else
+                s->token.val = TOK_XOR_ASSIGN;
+        } else if (p[1] == '^') {
+            if (p[2] == '=') {
+                p += 3;
+                s->token.val = TOK_XOR_ASSIGN;
+            } else {
+                p += 2;
+                s->token.val = '^';
+            }
+        } else {
+            p++;
+            if (s->cur_func && (s->cur_func->js_mode & JS_MODE_MATH))
+                s->token.val = TOK_MATH_POW;
+            else
+                s->token.val = '^';
+        }
+        break;
+#else
+    case '^':
+        if (p[1] == '=') {
+            p += 2;
+            s->token.val = TOK_XOR_ASSIGN;
+        } else {
+            goto def_token;
+        }
+        break;
+#endif
+    case '|':
+        if (p[1] == '=') {
+            p += 2;
+            s->token.val = TOK_OR_ASSIGN;
+        } else if (p[1] == '|') {
+            p += 2;
+            s->token.val = TOK_LOR;
+        } else {
+            goto def_token;
+        }
+        break;
+    default:
+        if (c >= 128) {
+            /* unicode value */
+            c = unicode_from_utf8(p, UTF8_CHAR_LEN_MAX, &p);
+            switch(c) {
+            case CP_PS:
+            case CP_LS:
+                if (!s->cur_func) {
+                    /* <PS> and <LS> are not JSONWhitespace */
+                    goto def_token;
+                } else {
+                    goto line_terminator;
+                }
+            default:
+                if (lre_is_space(c)) {
+                    if (!s->cur_func) {
+                        /* category z spaces are not JSONWhitespace */
+                        goto def_token;
+                    } else {
+                        goto redo;
+                    }
+                } else if (lre_js_is_ident_first(c)) {
+                    ident_has_escape = FALSE;
+                    goto has_ident;
+                } else {
+                    js_parse_error(s, "unexpected character");
+                    goto fail;
+                }
+            }
+        }
+    def_token:
+        s->token.val = c;
+        p++;
+        break;
+    }
+    s->buf_ptr = p;
+
+    //    dump_token(s, &s->token);
+    return 0;
+
+ fail:
+    s->token.val = TOK_ERROR;
+    return -1;
+}
+
+/* only used for ':' and '=>', 'let' or 'function' look-ahead */
+static int peek_token(JSParseState *s, BOOL no_line_terminator)
+{
+    const uint8_t *p;
+    uint32_t c;
+
+    /* skip spaces and comments */
+    for (p = s->buf_ptr;;) {
+        switch(c = *p++) {
+        case '\r':
+        case '\n':
+            if (no_line_terminator)
+                return '\n';
+            continue;
+        case ' ':
+        case '\t':
+        case '\v':
+        case '\f':
+            continue;
+        case '/':
+            if (*p == '/') {
+                if (no_line_terminator)
+                    return '\n';
+                while (*p && *p != '\r' && *p != '\n')
+                    p++;
+                continue;
+            }
+            if (*p == '*') {
+                while (*++p) {
+                    if ((*p == '\r' || *p == '\n') && no_line_terminator)
+                        return '\n';
+                    if (*p == '*' && p[1] == '/') {
+                        p += 2;
+                        break;
+                    }
+                }
+                continue;
+            }
+            break;
+        case '=':
+            if (*p == '>')
+                return TOK_ARROW;
+            break;
+        default:
+            if (lre_js_is_ident_first(c)) {
+                if (c == 'i' && *p == 'n' && !lre_js_is_ident_next(p[1]))
+                    return TOK_IN;
+                if (c == 'o' && *p == 'f' && !lre_js_is_ident_next(p[1]))
+                    return TOK_OF;
+                else if (c == 'f' && p[0] == 'u' && p[1] == 'n' &&
+                         p[2] == 'c' && p[3] == 't' && p[4] == 'i' &&
+                         p[5] == 'o' && p[6] == 'n' && !lre_js_is_ident_next(p[7]))
+                    return TOK_FUNCTION;
+                else
+                    return TOK_IDENT;
+            }
+            break;
+        }
+        return c;
+    }
+}
+
+static inline int get_prev_opcode(JSFunctionDef *fd) {
+    if (fd->last_opcode_pos < 0)
+        return OP_invalid;
+    else
+        return fd->byte_code.buf[fd->last_opcode_pos];
+}
+
+static BOOL js_is_live_code(JSParseState *s) {
+    switch (get_prev_opcode(s->cur_func)) {
+    case OP_tail_call:
+    case OP_tail_call_method:
+    case OP_return:
+    case OP_return_undef:
+    case OP_return_async:
+    case OP_throw:
+    case OP_throw_var:
+    case OP_goto:
+#if SHORT_OPCODES
+    case OP_goto8:
+    case OP_goto16:
+#endif
+    case OP_ret:
+        return FALSE;
+    default:
+        return TRUE;
+    }
+}
+
+static void emit_u8(JSParseState *s, uint8_t val)
+{
+    dbuf_putc(&s->cur_func->byte_code, val);
+}
+
+static void emit_u16(JSParseState *s, uint16_t val)
+{
+    dbuf_put_u16(&s->cur_func->byte_code, val);
+}
+
+static void emit_u32(JSParseState *s, uint32_t val)
+{
+    dbuf_put_u32(&s->cur_func->byte_code, val);
+}
+
+static void emit_op(JSParseState *s, uint8_t val)
+{
+    JSFunctionDef *fd = s->cur_func;
+    DynBuf *bc = &fd->byte_code;
+
+    /* Use the line number of the last token used, not the next token,
+       nor the current offset in the source file.
+     */
+    if (unlikely(fd->last_opcode_line_num != s->last_line_num)) {
+        dbuf_putc(bc, OP_line_num);
+        dbuf_put_u32(bc, s->last_line_num);
+        fd->last_opcode_line_num = s->last_line_num;
+    }
+    fd->last_opcode_pos = bc->size;
+    dbuf_putc(bc, val);
+}
+
+static void emit_atom(JSParseState *s, JSAtom name)
+{
+    emit_u32(s, JS_DupAtom(s->ctx, name));
+}
+
+static int update_label(JSFunctionDef *s, int label, int delta)
+{
+    LabelSlot *ls;
+
+    assert(label >= 0 && label < s->label_count);
+    ls = &s->label_slots[label];
+    ls->ref_count += delta;
+    assert(ls->ref_count >= 0);
+    return ls->ref_count;
+}
+
+static int new_label_fd(JSFunctionDef *fd, int label)
+{
+    LabelSlot *ls;
+
+    if (label < 0) {
+        if (fd->label_count >= fd->label_size) {
+            int new_size;
+            size_t slack;
+            LabelSlot *new_tab;
+
+            /* XXX: potential arithmetic overflow */
+            new_size = fd->label_size * 3 / 2 + 4;
+            new_tab = js_realloc2(fd->ctx, fd->label_slots, new_size * sizeof(*new_tab), &slack);
+            if (!new_tab)
+                return -1;
+            new_size += slack / sizeof(*new_tab);
+            fd->label_slots = new_tab;
+            fd->label_size = new_size;
+        }
+        label = fd->label_count++;
+        ls = &fd->label_slots[label];
+        ls->ref_count = 0;
+        ls->pos = -1;
+        ls->pos2 = -1;
+        ls->addr = -1;
+        ls->first_reloc = NULL;
+    }
+    return label;
+}
+
+static int new_label(JSParseState *s)
+{
+    return new_label_fd(s->cur_func, -1);
+}
+
+/* return the label ID offset */
+static int emit_label(JSParseState *s, int label)
+{
+    if (label >= 0) {
+        emit_op(s, OP_label);
+        emit_u32(s, label);
+        s->cur_func->label_slots[label].pos = s->cur_func->byte_code.size;
+        return s->cur_func->byte_code.size - 4;
+    } else {
+        return -1;
+    }
+}
+
+/* return label or -1 if dead code */
+static int emit_goto(JSParseState *s, int opcode, int label)
+{
+    if (js_is_live_code(s)) {
+        if (label < 0)
+            label = new_label(s);
+        emit_op(s, opcode);
+        emit_u32(s, label);
+        s->cur_func->label_slots[label].ref_count++;
+        return label;
+    }
+    return -1;
+}
+
+/* return the constant pool index. 'val' is not duplicated. */
+static int cpool_add(JSParseState *s, JSValue val)
+{
+    JSFunctionDef *fd = s->cur_func;
+    if (fd->cpool_count >= fd->cpool_size) {
+        int new_size;
+        size_t slack;
+        JSValue *new_tab;
+        /* XXX: potential arithmetic overflow */
+        new_size = max_int(fd->cpool_count + 1, fd->cpool_size * 3 / 2);
+        new_tab = js_realloc2(s->ctx, fd->cpool, new_size * sizeof(JSValue), &slack);
+        if (!new_tab)
+            return -1;
+        new_size += slack / sizeof(*new_tab);
+        fd->cpool = new_tab;
+        fd->cpool_size = new_size;
+    }
+    fd->cpool[fd->cpool_count++] = val;
+    return fd->cpool_count - 1;
+}
+
+static __exception int emit_push_const(JSParseState *s, JSValueConst val,
+                                       BOOL as_atom)
+{
+    int idx;
+
+    if (JS_VALUE_GET_TAG(val) == JS_TAG_STRING && as_atom) {
+        JSAtom atom;
+        /* warning: JS_NewAtomStr frees the string value */
+        JS_DupValue(s->ctx, val);
+        atom = JS_NewAtomStr(s->ctx, JS_VALUE_GET_STRING(val));
+        if (atom != JS_ATOM_NULL && !__JS_AtomIsTaggedInt(atom)) {
+            emit_op(s, OP_push_atom_value);
+            emit_u32(s, atom);
+            return 0;
+        }
+    }
+
+    idx = cpool_add(s, JS_DupValue(s->ctx, val));
+    if (idx < 0)
+        return -1;
+    emit_op(s, OP_push_const);
+    emit_u32(s, idx);
+    return 0;
+}
+
+/* return the variable index or -1 if not found,
+   add ARGUMENT_VAR_OFFSET for argument variables */
+static int find_arg(JSContext *ctx, JSFunctionDef *fd, JSAtom name)
+{
+    int i;
+    for(i = fd->arg_count; i-- > 0;) {
+        if (fd->args[i].var_name == name)
+            return i | ARGUMENT_VAR_OFFSET;
+    }
+    return -1;
+}
+
+static int find_var(JSContext *ctx, JSFunctionDef *fd, JSAtom name)
+{
+    int i;
+    for(i = fd->var_count; i-- > 0;) {
+        if (fd->vars[i].var_name == name && fd->vars[i].scope_level == 0)
+            return i;
+    }
+    return find_arg(ctx, fd, name);
+}
+
+static JSHoistedDef *find_hoisted_def(JSFunctionDef *fd, JSAtom name)
+{
+    int i;
+    for(i = 0; i < fd->hoisted_def_count; i++) {
+        JSHoistedDef *hf = &fd->hoisted_def[i];
+        if (hf->var_name == name)
+            return hf;
+    }
+    return NULL;
+
+}
+
+static JSHoistedDef *find_lexical_hoisted_def(JSFunctionDef *fd, JSAtom name)
+{
+    JSHoistedDef *hf = find_hoisted_def(fd, name);
+    if (hf && hf->is_lexical)
+        return hf;
+    else
+        return NULL;
+}
+
+static int find_lexical_decl(JSContext *ctx, JSFunctionDef *fd, JSAtom name,
+                             int scope_idx, BOOL check_catch_var)
+{
+    while (scope_idx >= 0) {
+        JSVarDef *vd = &fd->vars[scope_idx];
+        if (vd->var_name == name &&
+            (vd->is_lexical || (vd->is_catch && check_catch_var)))
+            return scope_idx;
+        scope_idx = vd->scope_next;
+    }
+
+    if (fd->is_eval && fd->eval_type == JS_EVAL_TYPE_GLOBAL) {
+        if (find_lexical_hoisted_def(fd, name))
+            return GLOBAL_VAR_OFFSET;
+    }
+    return -1;
+}
+
+static int push_scope(JSParseState *s) {
+    if (s->cur_func) {
+        JSFunctionDef *fd = s->cur_func;
+        int scope = fd->scope_count;
+        /* XXX: should check for scope overflow */
+        if ((fd->scope_count + 1) > fd->scope_size) {
+            int new_size;
+            size_t slack;
+            JSVarScope *new_buf;
+            /* XXX: potential arithmetic overflow */
+            new_size = max_int(fd->scope_count + 1, fd->scope_size * 3 / 2);
+            if (fd->scopes == fd->def_scope_array) {
+                new_buf = js_realloc2(s->ctx, NULL, new_size * sizeof(*fd->scopes), &slack);
+                if (!new_buf)
+                    return -1;
+                memcpy(new_buf, fd->scopes, fd->scope_count * sizeof(*fd->scopes));
+            } else {
+                new_buf = js_realloc2(s->ctx, fd->scopes, new_size * sizeof(*fd->scopes), &slack);
+                if (!new_buf)
+                    return -1;
+            }
+            new_size += slack / sizeof(*new_buf);
+            fd->scopes = new_buf;
+            fd->scope_size = new_size;
+        }
+        fd->scope_count++;
+        fd->scopes[scope].parent = fd->scope_level;
+        fd->scopes[scope].first = fd->scope_first;
+        emit_op(s, OP_enter_scope);
+        emit_u16(s, scope);
+        return fd->scope_level = scope;
+    }
+    return 0;
+}
+
+static int get_first_lexical_var(JSFunctionDef *fd, int scope)
+{
+    while (scope >= 0) {
+        int scope_idx = fd->scopes[scope].first;
+        if (scope_idx >= 0)
+            return scope_idx;
+        scope = fd->scopes[scope].parent;
+    }
+    return -1;
+}
+
+static void pop_scope(JSParseState *s) {
+    if (s->cur_func) {
+        /* disable scoped variables */
+        JSFunctionDef *fd = s->cur_func;
+        int scope = fd->scope_level;
+        emit_op(s, OP_leave_scope);
+        emit_u16(s, scope);
+        fd->scope_level = fd->scopes[scope].parent;
+        fd->scope_first = get_first_lexical_var(fd, fd->scope_level);
+    }
+}
+
+static void close_scopes(JSParseState *s, int scope, int scope_stop)
+{
+    while (scope > scope_stop) {
+        emit_op(s, OP_leave_scope);
+        emit_u16(s, scope);
+        scope = s->cur_func->scopes[scope].parent;
+    }
+}
+
+/* return the variable index or -1 if error */
+static int add_var(JSContext *ctx, JSFunctionDef *fd, JSAtom name)
+{
+    JSVarDef *vd;
+
+    /* the local variable indexes are currently stored on 16 bits */
+    if (fd->var_count >= JS_MAX_LOCAL_VARS) {
+        JS_ThrowInternalError(ctx, "too many local variables");
+        return -1;
+    }
+    if ((fd->var_count + 1) > fd->var_size) {
+        int new_size;
+        size_t slack;
+        JSVarDef *new_buf;
+        new_size = max_int(fd->var_count + 1, fd->var_size * 3 / 2);
+        new_buf = js_realloc2(ctx, fd->vars, new_size * sizeof(*fd->vars), &slack);
+        if (!new_buf)
+            return -1;
+        new_size += slack / sizeof(*new_buf);
+        fd->vars = new_buf;
+        fd->var_size = new_size;
+    }
+    vd = &fd->vars[fd->var_count++];
+    memset(vd, 0, sizeof(*vd));
+    vd->var_name = JS_DupAtom(ctx, name);
+    return fd->var_count - 1;
+}
+
+static int add_func_var(JSContext *ctx, JSFunctionDef *fd, JSAtom name)
+{
+    int idx = fd->func_var_idx;
+    if (idx < 0 && (idx = add_var(ctx, fd, name)) >= 0) {
+        fd->func_var_idx = idx;
+        fd->vars[idx].is_func_var = TRUE;
+        if (fd->js_mode & JS_MODE_STRICT)
+            fd->vars[idx].is_const = TRUE;
+    }
+    return idx;
+}
+
+static int add_arguments_var(JSContext *ctx, JSFunctionDef *fd, JSAtom name)
+{
+    int idx = fd->arguments_var_idx;
+    if (idx < 0 && (idx = add_var(ctx, fd, name)) >= 0) {
+        fd->arguments_var_idx = idx;
+    }
+    return idx;
+}
+
+static int add_arg(JSContext *ctx, JSFunctionDef *fd, JSAtom name)
+{
+    JSVarDef *vd;
+
+    /* the local variable indexes are currently stored on 16 bits */
+    if (fd->arg_count >= JS_MAX_LOCAL_VARS) {
+        JS_ThrowInternalError(ctx, "too many arguments");
+        return -1;
+    }
+    if ((fd->arg_count + 1) > fd->arg_size) {
+        int new_size;
+        size_t slack;
+        JSVarDef *new_buf;
+        new_size = max_int(fd->arg_count + 1, fd->arg_size * 3 / 2);
+        new_buf = js_realloc2(ctx, fd->args, new_size * sizeof(*fd->args), &slack);
+        if (!new_buf)
+            return -1;
+        new_size += slack / sizeof(*new_buf);
+        fd->args = new_buf;
+        fd->arg_size = new_size;
+    }
+    vd = &fd->args[fd->arg_count++];
+    memset(vd, 0, sizeof(*vd));
+    vd->var_name = JS_DupAtom(ctx, name);
+    return fd->arg_count - 1;
+}
+
+/* add a Hoisted definition for a function (cpool_idx >= 0) or a
+   global variable (cpool_idx = -1) */
+static JSHoistedDef *add_hoisted_def(JSContext *ctx,
+                                     JSFunctionDef *s, int cpool_idx,
+                                     JSAtom name, int var_idx, BOOL is_lexical)
+{
+    JSHoistedDef *hf;
+
+    if (s->hoisted_def_count >= s->hoisted_def_size) {
+        int new_size;
+        size_t slack;
+        JSHoistedDef *new_tab;
+        new_size = max_int(s->hoisted_def_count + 1,
+                           s->hoisted_def_size * 3 / 2);
+        new_tab = js_realloc2(ctx, s->hoisted_def, new_size * sizeof(s->hoisted_def[0]), &slack);
+        if (!new_tab)
+            return NULL;
+        new_size += slack / sizeof(*new_tab);
+        s->hoisted_def = new_tab;
+        s->hoisted_def_size = new_size;
+    }
+    hf = &s->hoisted_def[s->hoisted_def_count++];
+    hf->cpool_idx = cpool_idx;
+    hf->force_init = 0;
+    hf->is_lexical = is_lexical;
+    hf->is_const = FALSE;
+    hf->is_for_of = FALSE;
+    hf->var_idx = var_idx;
+    hf->scope_level = s->scope_level;
+    hf->var_name = JS_ATOM_NULL;
+    if (name != JS_ATOM_NULL) {
+        hf->var_name = JS_DupAtom(ctx, name);
+    }
+    return hf;
+}
+
+static int define_var(JSParseState *s, JSFunctionDef *fd, JSAtom name, int tok)
+{
+    JSContext *ctx = s->ctx;
+    JSVarDef *vd;
+    int idx;
+
+    switch (tok) {
+    case TOK_WITH:
+        idx = add_var(ctx, fd, name);
+        if (idx >= 0) {
+            vd = &fd->vars[idx];
+            vd->scope_level = fd->scope_level;
+            vd->scope_next = fd->scope_first;
+            fd->scopes[fd->scope_level].first = idx;
+            fd->scope_first = idx;
+        }
+        break;
+
+    case TOK_LET:
+    case TOK_CONST:
+    case TOK_FUNCTION:
+        idx = find_lexical_decl(ctx, fd, name, fd->scope_first, TRUE);
+        if (idx >= 0) {
+            if ((idx < GLOBAL_VAR_OFFSET &&
+                 (fd->vars[idx].scope_level == fd->scope_level ||
+                  (fd->vars[idx].is_catch && (fd->vars[idx].scope_level + 2) == fd->scope_level))) ||
+                (idx == GLOBAL_VAR_OFFSET && fd->scope_level == 1)) {
+                /* redefining a scoped var in the same scope: error */
+                return js_parse_error(s, "invalid redefinition of lexical identifier");
+            }
+        }
+        if (tok != TOK_FUNCTION &&
+            (fd->func_kind == JS_FUNC_ASYNC ||
+             fd->func_kind == JS_FUNC_GENERATOR ||
+             fd->func_kind == JS_FUNC_ASYNC_GENERATOR ||
+             fd->func_type == JS_PARSE_FUNC_METHOD) &&
+            find_arg(ctx, fd, name) >= 0) {
+            /* lexical variable redefines a parameter name */
+            return js_parse_error(s, "invalid redefinition of parameter name");
+        }
+
+        if (fd->is_eval &&
+            (fd->eval_type == JS_EVAL_TYPE_GLOBAL ||
+             fd->eval_type == JS_EVAL_TYPE_MODULE) &&
+            fd->scope_level == 1) {
+            JSHoistedDef *hf;
+            hf = find_hoisted_def(fd, name);
+            /* XXX: should check scope chain */
+            if (hf && hf->scope_level == fd->scope_level) {
+                return js_parse_error(s, "invalid redefinition of global identifier");
+            }
+            hf = add_hoisted_def(s->ctx, fd, -1, name, -1, TRUE);
+            if (!hf)
+                return -1;
+            hf->is_const = (tok == TOK_CONST);
+            idx = GLOBAL_VAR_OFFSET;
+        } else {
+            if (fd->is_global_var) {
+                JSHoistedDef *hf;
+                hf = find_hoisted_def(fd, name);
+                /* XXX: should check scope chain */
+                if (hf && hf->scope_level == fd->scope_level) {
+                    return js_parse_error(s, "invalid redefinition of global identifier");
+                }
+            }
+            /* XXX: should also fail at scope_level 1 if name duplicates argument or var name */
+            idx = add_var(ctx, fd, name);
+            if (idx >= 0) {
+                vd = &fd->vars[idx];
+                vd->is_lexical = 1;
+                vd->is_function = (tok == TOK_FUNCTION);
+                vd->is_const = (tok == TOK_CONST);
+                vd->scope_level = fd->scope_level;
+                vd->scope_next = fd->scope_first;
+                fd->scopes[fd->scope_level].first = idx;
+                fd->scope_first = idx;
+            }
+        }
+        break;
+
+    case TOK_CATCH:
+        idx = add_var(ctx, fd, name);
+        if (idx >= 0) {
+            vd = &fd->vars[idx];
+            vd->is_catch = 1;
+            vd->scope_level = fd->scope_level;
+            vd->scope_next = fd->scope_first;
+            fd->scopes[fd->scope_level].first = idx;
+            fd->scope_first = idx;
+        }
+        break;
+
+    default:
+        /* TOK_VAR, TOK_FOR (used for for-of variable definition) */
+        if (find_lexical_decl(ctx, fd, name, fd->scope_first,
+                              (tok == TOK_FOR)) >= 0) {
+       invalid_lexical_redefinition:
+            /* error to redefine a var that inside a lexical scope */
+            return js_parse_error(s, "invalid redefinition of lexical identifier");
+        }
+        if (fd->is_global_var) {
+            JSHoistedDef *hf;
+            hf = find_hoisted_def(fd, name);
+            if (hf && hf->is_lexical && hf->scope_level == fd->scope_level &&
+                fd->eval_type == JS_EVAL_TYPE_MODULE) {
+                goto invalid_lexical_redefinition;
+            }
+            hf = add_hoisted_def(s->ctx, fd, -1, name, -1, FALSE);
+            if (!hf)
+                return -1;
+            hf->is_for_of = (tok == TOK_FOR);
+            idx = GLOBAL_VAR_OFFSET;
+        } else {
+            /* if the variable already exists, don't add it again  */
+            idx = find_var(ctx, fd, name);
+            if (idx >= 0)
+                break;
+            idx = add_var(ctx, fd, name);
+            if (idx >= 0) {
+                if (name == JS_ATOM_arguments && fd->has_arguments_binding)
+                    fd->arguments_var_idx = idx;
+            }
+        }
+        break;
+    }
+    return idx;
+}
+
+static __exception int js_parse_expr(JSParseState *s);
+static __exception int js_parse_function_decl(JSParseState *s,
+                                              JSParseFunctionEnum func_type,
+                                              JSFunctionKindEnum func_kind,
+                                              JSAtom func_name, const uint8_t *ptr,
+                                              int start_line);
+static __exception int js_parse_function_decl2(JSParseState *s,
+                                               JSParseFunctionEnum func_type,
+                                               JSFunctionKindEnum func_kind,
+                                               JSAtom func_name,
+                                               const uint8_t *ptr,
+                                               int function_line_num,
+                                               JSParseExportEnum export_flag,
+                                               JSFunctionDef **pfd);
+static __exception int js_parse_assign_expr(JSParseState *s, int in_accepted);
+static __exception int js_parse_unary(JSParseState *s, int exponentiation_flag);
+static void push_break_entry(JSFunctionDef *fd, BlockEnv *be,
+                             JSAtom label_name,
+                             int label_break, int label_cont,
+                             int drop_count);
+static void pop_break_entry(JSFunctionDef *fd);
+static JSExportEntry *add_export_entry(JSParseState *s, JSModuleDef *m,
+                                       JSAtom local_name, JSAtom export_name,
+                                       JSExportTypeEnum export_type);
+
+/* Note: all the fields are already sealed except length */
+static int seal_template_obj(JSContext *ctx, JSValueConst obj)
+{
+    JSObject *p;
+    JSShapeProperty *prs;
+
+    p = JS_VALUE_GET_OBJ(obj);
+    prs = find_own_property1(p, JS_ATOM_length);
+    if (prs) {
+        if (js_update_property_flags(ctx, p, &prs,
+                                     prs->flags & ~(JS_PROP_CONFIGURABLE | JS_PROP_WRITABLE)))
+            return -1;
+    }
+    p->extensible = FALSE;
+    return 0;
+}
+
+static __exception int js_parse_template(JSParseState *s, int call, int *argc)
+{
+    JSContext *ctx = s->ctx;
+    JSValue raw_array, template_object;
+    JSToken cooked;
+    int depth, ret;
+
+    raw_array = JS_UNDEFINED; /* avoid warning */
+    template_object = JS_UNDEFINED; /* avoid warning */
+    if (call) {
+        /* Create a template object: an array of cooked strings */
+        /* Create an array of raw strings and store it to the raw property */
+        template_object = JS_NewArray(ctx);
+        if (JS_IsException(template_object))
+            return -1;
+        //        pool_idx = s->cur_func->cpool_count;
+        ret = emit_push_const(s, template_object, 0);
+        JS_FreeValue(ctx, template_object);
+        if (ret)
+            return -1;
+        raw_array = JS_NewArray(ctx);
+        if (JS_IsException(raw_array))
+            return -1;
+        if (JS_DefinePropertyValue(ctx, template_object, JS_ATOM_raw,
+                                   raw_array, JS_PROP_THROW) < 0) {
+            return -1;
+        }
+    }
+
+    depth = 0;
+    while (s->token.val == TOK_TEMPLATE) {
+        const uint8_t *p = s->token.ptr + 1;
+        cooked = s->token;
+        if (call) {
+            if (JS_DefinePropertyValueUint32(ctx, raw_array, depth,
+                                             JS_DupValue(ctx, s->token.u.str.str),
+                                             JS_PROP_ENUMERABLE | JS_PROP_THROW) < 0) {
+                return -1;
+            }
+            /* re-parse the string with escape sequences but do not throw a
+               syntax error if it contains invalid sequences
+             */
+            if (js_parse_string(s, '`', FALSE, p, &cooked, &p)) {
+                cooked.u.str.str = JS_UNDEFINED;
+            }
+            if (JS_DefinePropertyValueUint32(ctx, template_object, depth,
+                                             cooked.u.str.str,
+                                             JS_PROP_ENUMERABLE | JS_PROP_THROW) < 0) {
+                return -1;
+            }
+        } else {
+            JSString *str;
+            /* re-parse the string with escape sequences and throw a
+               syntax error if it contains invalid sequences
+             */
+            JS_FreeValue(ctx, s->token.u.str.str);
+            s->token.u.str.str = JS_UNDEFINED;
+            if (js_parse_string(s, '`', TRUE, p, &cooked, &p))
+                return -1;
+            str = JS_VALUE_GET_STRING(cooked.u.str.str);
+            if (str->len != 0 || depth == 0) {
+                ret = emit_push_const(s, cooked.u.str.str, 1);
+                JS_FreeValue(s->ctx, cooked.u.str.str);
+                if (ret)
+                    return -1;
+                if (depth == 0) {
+                    if (s->token.u.str.sep == '`')
+                        goto done1;
+                    emit_op(s, OP_get_field2);
+                    emit_atom(s, JS_ATOM_concat);
+                }
+                depth++;
+            } else {
+                JS_FreeValue(s->ctx, cooked.u.str.str);
+            }
+        }
+        if (s->token.u.str.sep == '`')
+            goto done;
+        if (next_token(s))
+            return -1;
+        if (js_parse_assign_expr(s, TRUE))
+            return -1;
+        depth++;
+        if (s->token.val != '}') {
+            return js_parse_error(s, "expected '}' after template expression");
+        }
+        /* XXX: should convert to string at this stage? */
+        free_token(s, &s->token);
+        /* Resume TOK_TEMPLATE parsing (s->token.line_num and s->token.ptr are OK) */
+        s->got_lf = FALSE;
+        s->last_line_num = s->token.line_num;
+        if (js_parse_template_part(s, s->buf_ptr))
+            return -1;
+    }
+    return js_parse_expect(s, TOK_TEMPLATE);
+
+ done:
+    if (call) {
+        /* Seal the objects */
+        seal_template_obj(ctx, raw_array);
+        seal_template_obj(ctx, template_object);
+        *argc = depth + 1;
+    } else {
+        emit_op(s, OP_call_method);
+        emit_u16(s, depth - 1);
+    }
+ done1:
+    return next_token(s);
+}
+
+
+#define PROP_TYPE_IDENT 0
+#define PROP_TYPE_VAR   1
+#define PROP_TYPE_GET   2
+#define PROP_TYPE_SET   3
+#define PROP_TYPE_STAR  4
+#define PROP_TYPE_ASYNC 5
+#define PROP_TYPE_ASYNC_STAR 6
+
+static BOOL token_is_ident(int tok)
+{
+    /* Accept keywords and reserved words as property names */
+    return (tok == TOK_IDENT ||
+            (tok >= TOK_FIRST_KEYWORD &&
+             tok <= TOK_LAST_KEYWORD));
+}
+
+/* if the property is an expression, name = JS_ATOM_NULL */
+static int __exception js_parse_property_name(JSParseState *s,
+                                              JSAtom *pname,
+                                              BOOL allow_method, BOOL allow_var)
+{
+    JSAtom name;
+    int prop_type;
+
+    prop_type = PROP_TYPE_IDENT;
+    if (allow_method) {
+        if (token_is_pseudo_keyword(s, JS_ATOM_get)
+        ||  token_is_pseudo_keyword(s, JS_ATOM_set)) {
+            /* get x(), set x() */
+            name = JS_DupAtom(s->ctx, s->token.u.ident.atom);
+            if (next_token(s))
+                goto fail1;
+            if (s->token.val == ':' || s->token.val == ',' ||
+                s->token.val == '}' || s->token.val == '(')
+                goto done;
+            prop_type = PROP_TYPE_GET + (name == JS_ATOM_set);
+            JS_FreeAtom(s->ctx, name);
+        } else if (s->token.val == '*') {
+            if (next_token(s))
+                goto fail;
+            prop_type = PROP_TYPE_STAR;
+        } else if (token_is_pseudo_keyword(s, JS_ATOM_async) &&
+                   peek_token(s, TRUE) != '\n') {
+            if (next_token(s))
+                goto fail;
+            if (s->token.val == '*') {
+                if (next_token(s))
+                    goto fail;
+                prop_type = PROP_TYPE_ASYNC_STAR;
+            } else {
+                prop_type = PROP_TYPE_ASYNC;
+            }
+        }
+    }
+
+    if (token_is_ident(s->token.val)) {
+        /* variable can only be a non-reserved identifier */
+        if (s->token.val == TOK_IDENT && !s->token.u.ident.is_reserved &&
+            prop_type == PROP_TYPE_IDENT && allow_var) {
+            int tok = peek_token(s, FALSE);
+            if (!(tok == ':' || (tok == '(' && allow_method))) {
+                prop_type = PROP_TYPE_VAR;
+            }
+        }
+        /* keywords and reserved words have a valid atom */
+        name = JS_DupAtom(s->ctx, s->token.u.ident.atom);
+        if (next_token(s))
+            goto fail1;
+    } else if (s->token.val == TOK_STRING) {
+        name = js_value_to_atom(s->ctx, s->token.u.str.str);
+        if (name == JS_ATOM_NULL)
+            goto fail;
+        if (next_token(s))
+            goto fail1;
+    } else if (s->token.val == TOK_NUMBER) {
+        JSValue val;
+        val = s->token.u.num.val;
+#ifdef CONFIG_BIGNUM
+        if (JS_VALUE_GET_TAG(val) == JS_TAG_BIG_FLOAT) {
+            JSBigFloat *p = JS_VALUE_GET_PTR(val);
+            double d;
+            d = bf_mul_pow10_to_float64(s->ctx, &p->num,
+                                        s->token.u.num.exponent);
+            val = __JS_NewFloat64(s->ctx, d);
+            name = js_value_to_atom(s->ctx, val);
+            JS_FreeValue(s->ctx, val);
+        } else
+#endif
+        {
+            name = js_value_to_atom(s->ctx, val);
+        }
+        if (name == JS_ATOM_NULL)
+            goto fail;
+        if (next_token(s))
+            goto fail1;
+    } else if (s->token.val == '[') {
+        if (next_token(s))
+            goto fail;
+        if (js_parse_expr(s))
+            goto fail;
+        if (js_parse_expect(s, ']'))
+            goto fail;
+        name = JS_ATOM_NULL;
+    } else {
+        goto invalid_prop;
+    }
+    if (prop_type != PROP_TYPE_IDENT && prop_type != PROP_TYPE_VAR &&
+        s->token.val != '(') {
+        JS_FreeAtom(s->ctx, name);
+    invalid_prop:
+        js_parse_error(s, "invalid property name");
+        goto fail;
+    }
+ done:
+    *pname = name;
+    return prop_type;
+ fail1:
+    JS_FreeAtom(s->ctx, name);
+ fail:
+    *pname = JS_ATOM_NULL;
+    return -1;
+}
+
+typedef struct JSParsePos {
+    int last_line_num;
+    int line_num;
+    BOOL got_lf;
+    const uint8_t *ptr;
+} JSParsePos;
+
+static int js_parse_get_pos(JSParseState *s, JSParsePos *sp)
+{
+    sp->last_line_num = s->last_line_num;
+    sp->line_num = s->token.line_num;
+    sp->ptr = s->token.ptr;
+    sp->got_lf = s->got_lf;
+    return 0;
+}
+
+static __exception int js_parse_seek_token(JSParseState *s, const JSParsePos *sp)
+{
+    s->token.line_num = sp->last_line_num;
+    s->line_num = sp->line_num;
+    s->buf_ptr = sp->ptr;
+    s->got_lf = sp->got_lf;
+    return next_token(s);
+}
+
+#define SKIP_HAS_SEMI      (1 << 0)
+#define SKIP_HAS_ELLIPSIS  (1 << 1)
+
+/* XXX: improve speed with early bailout */
+static int js_parse_skip_parens_token(JSParseState *s, int *pbits, BOOL no_line_terminator)
+{
+    char state[256];
+    size_t level = 0;
+    JSParsePos pos;
+    int tok = TOK_EOF;
+    int bits = 0;
+
+    /* protect fom underflow */
+    state[level++] = 0;
+
+    js_parse_get_pos(s, &pos);
+    for (;;) {
+        switch(s->token.val) {
+        case '(':
+        case '[':
+        case '{':
+            if (level >= sizeof(state))
+                goto done;
+            state[level++] = s->token.val;
+            break;
+        case ')':
+            if (state[--level] != '(')
+                goto done;
+            break;
+        case ']':
+            if (state[--level] != '[')
+                goto done;
+            break;
+        case '}':
+            if (state[--level] != '{')
+                goto done;
+            break;
+        case TOK_EOF:
+            goto done;
+        case ';':
+            if (level == 2) {
+                bits |= SKIP_HAS_SEMI;
+            }
+            break;
+        case TOK_ELLIPSIS:
+            if (level == 2) {
+                bits |= SKIP_HAS_ELLIPSIS;
+            }
+            break;
+        }
+        if (next_token(s)) {
+            /* XXX: should clear the exception generated by next_token() */
+            break;
+        }
+        if (level <= 1) {
+            tok = s->token.val;
+            if (token_is_pseudo_keyword(s, JS_ATOM_of))
+                tok = TOK_OF;
+            if (no_line_terminator && s->last_line_num != s->token.line_num)
+                tok = '\n';
+            break;
+        }
+    }
+ done:
+    if (pbits) {
+        *pbits = bits;
+    }
+    if (js_parse_seek_token(s, &pos))
+        return -1;
+    return tok;
+}
+
+static BOOL set_object_name(JSParseState *s, JSAtom name)
+{
+    JSFunctionDef *fd = s->cur_func;
+
+    if (get_prev_opcode(fd) == OP_set_name) {
+        /* XXX: should free atom after OP_set_name? */
+        fd->byte_code.size = fd->last_opcode_pos;
+        fd->last_opcode_pos = -1;
+        emit_op(s, OP_set_name);
+        emit_atom(s, name);
+        return TRUE;
+    }
+    return FALSE;
+}
+
+static void set_object_name_computed(JSParseState *s)
+{
+    JSFunctionDef *fd = s->cur_func;
+
+    if (get_prev_opcode(fd) == OP_set_name) {
+        /* XXX: should free atom after OP_set_name? */
+        fd->byte_code.size = fd->last_opcode_pos;
+        fd->last_opcode_pos = -1;
+        emit_op(s, OP_set_name_computed);
+    }
+}
+
+static __exception int js_parse_object_literal(JSParseState *s)
+{
+    JSAtom name = JS_ATOM_NULL;
+    const uint8_t *start_ptr;
+    int start_line, prop_type;
+    BOOL has_proto;
+
+    if (next_token(s))
+        goto fail;
+    /* XXX: add an initial length that will be patched back */
+    emit_op(s, OP_object);
+    has_proto = FALSE;
+    while (s->token.val != '}') {
+        /* specific case for getter/setter */
+        start_ptr = s->token.ptr;
+        start_line = s->token.line_num;
+
+        if (s->token.val == TOK_ELLIPSIS) {
+            if (next_token(s))
+                return -1;
+            if (js_parse_assign_expr(s, TRUE))
+                return -1;
+            emit_op(s, OP_null);  /* dummy excludeList */
+            emit_op(s, OP_copy_data_properties);
+            emit_u8(s, 2 | (1 << 2) | (0 << 5));
+            emit_op(s, OP_drop); /* pop excludeList */
+            emit_op(s, OP_drop); /* pop src object */
+            goto next;
+        }
+
+        prop_type = js_parse_property_name(s, &name, TRUE, TRUE);
+        if (prop_type < 0)
+            goto fail;
+
+        if (prop_type == PROP_TYPE_VAR) {
+            /* shortcut for x: x */
+            emit_op(s, OP_scope_get_var);
+            emit_atom(s, name);
+            emit_u16(s, s->cur_func->scope_level);
+            emit_op(s, OP_define_field);
+            emit_atom(s, name);
+        } else if (s->token.val == '(') {
+            BOOL is_getset = (prop_type == PROP_TYPE_GET ||
+                              prop_type == PROP_TYPE_SET);
+            JSParseFunctionEnum func_type;
+            JSFunctionKindEnum func_kind;
+            int op_flags;
+
+            func_kind = JS_FUNC_NORMAL;
+            if (is_getset) {
+                func_type = JS_PARSE_FUNC_GETTER + prop_type - PROP_TYPE_GET;
+            } else {
+                func_type = JS_PARSE_FUNC_METHOD;
+                if (prop_type == PROP_TYPE_STAR)
+                    func_kind = JS_FUNC_GENERATOR;
+                else if (prop_type == PROP_TYPE_ASYNC)
+                    func_kind = JS_FUNC_ASYNC;
+                else if (prop_type == PROP_TYPE_ASYNC_STAR)
+                    func_kind = JS_FUNC_ASYNC_GENERATOR;
+            }
+            if (js_parse_function_decl(s, func_type, func_kind, JS_ATOM_NULL,
+                                       start_ptr, start_line))
+                goto fail;
+            if (name == JS_ATOM_NULL) {
+                emit_op(s, OP_define_method_computed);
+            } else {
+                emit_op(s, OP_define_method);
+                emit_atom(s, name);
+            }
+            if (is_getset) {
+                op_flags = OP_DEFINE_METHOD_GETTER +
+                    prop_type - PROP_TYPE_GET;
+            } else {
+                op_flags = OP_DEFINE_METHOD_METHOD;
+            }
+            emit_u8(s, op_flags | OP_DEFINE_METHOD_ENUMERABLE);
+        } else {
+            if (js_parse_expect(s, ':'))
+                goto fail;
+            if (js_parse_assign_expr(s, TRUE))
+                goto fail;
+            if (name == JS_ATOM_NULL) {
+                set_object_name_computed(s);
+                emit_op(s, OP_define_array_el);
+                emit_op(s, OP_drop);
+            } else if (name == JS_ATOM___proto__) {
+                if (has_proto) {
+                    js_parse_error(s, "duplicate __proto__ property name");
+                    goto fail;
+                }
+                emit_op(s, OP_set_proto);
+                has_proto = TRUE;
+            } else {
+                set_object_name(s, name);
+                emit_op(s, OP_define_field);
+                emit_atom(s, name);
+            }
+        }
+        JS_FreeAtom(s->ctx, name);
+    next:
+        name = JS_ATOM_NULL;
+        if (s->token.val != ',')
+            break;
+        if (next_token(s))
+            goto fail;
+    }
+    if (js_parse_expect(s, '}'))
+        goto fail;
+    return 0;
+ fail:
+    JS_FreeAtom(s->ctx, name);
+    return -1;
+}
+
+static __exception int js_parse_postfix_expr(JSParseState *s,
+                                             BOOL accept_lparen);
+
+/* XXX: is there is nicer solution ? */
+static __exception int js_parse_class_default_ctor(JSParseState *s,
+                                                   BOOL has_super,
+                                                   JSFunctionDef **pfd)
+{
+    JSParsePos pos;
+    const char *str;
+    int ret, line_num;
+    JSParseFunctionEnum func_type;
+
+    js_parse_get_pos(s, &pos);
+    if (has_super) {
+        str = "(...a){super(...a);}";
+        func_type = JS_PARSE_FUNC_DERIVED_CLASS_CONSTRUCTOR;
+    } else {
+        str = "(){}";
+        func_type = JS_PARSE_FUNC_CLASS_CONSTRUCTOR;
+    }
+    line_num = s->token.line_num;
+    s->buf_ptr = (uint8_t *)str;
+    ret = next_token(s);
+    if (!ret) {
+        ret = js_parse_function_decl2(s, func_type, JS_FUNC_NORMAL,
+                                      JS_ATOM_NULL, (uint8_t *)str,
+                                      line_num, JS_PARSE_EXPORT_NONE, pfd);
+    }
+    ret |= js_parse_seek_token(s, &pos);
+    return ret;
+}
+
+static __exception int js_parse_class(JSParseState *s, BOOL is_class_expr,
+                                      JSParseExportEnum export_flag)
+{
+    JSContext *ctx = s->ctx;
+    JSFunctionDef *fd = s->cur_func;
+    JSAtom name = JS_ATOM_NULL, class_name = JS_ATOM_NULL;
+    JSAtom class_var_name = JS_ATOM_NULL;
+    JSFunctionDef *method_fd, *ctor_fd;
+    int saved_js_mode, class_name_var_idx, prop_type, ctor_cpool_offset;
+    int class_flags = 0;
+    BOOL is_static;
+    const uint8_t *class_start_ptr = s->token.ptr;
+    const uint8_t *start_ptr;
+
+    /* classes are parsed and executed in strict mode */
+    saved_js_mode = fd->js_mode;
+    fd->js_mode |= JS_MODE_STRICT;
+    if (next_token(s))
+        goto fail;
+    if (s->token.val == TOK_IDENT) {
+        if (s->token.u.ident.is_reserved) {
+            js_parse_error_reserved_identifier(s);
+            goto fail;
+        }
+        class_name = JS_DupAtom(ctx, s->token.u.ident.atom);
+        if (next_token(s))
+            goto fail;
+    } else if (!is_class_expr && export_flag != JS_PARSE_EXPORT_DEFAULT) {
+        js_parse_error(s, "class statement requires a name");
+        goto fail;
+    }
+    if (!is_class_expr) {
+        if (class_name == JS_ATOM_NULL)
+            class_var_name = JS_ATOM__default_; /* export default */
+        else
+            class_var_name = class_name;
+        class_var_name = JS_DupAtom(ctx, class_var_name);
+    }
+
+    push_scope(s);
+
+    if (s->token.val == TOK_EXTENDS) {
+        class_flags = JS_DEFINE_CLASS_HAS_HERITAGE;
+        if (next_token(s))
+            goto fail;
+        /* XXX: the grammar only allows LeftHandSideExpression */
+        if (js_parse_postfix_expr(s, TRUE))
+            goto fail;
+    } else {
+        emit_op(s, OP_undefined);
+    }
+
+    /* add a 'const' definition for the class name */
+    if (class_name != JS_ATOM_NULL) {
+        class_name_var_idx = define_var(s, fd, class_name, TOK_CONST);
+        if (class_name_var_idx < 0)
+            goto fail;
+    }
+
+    if (js_parse_expect(s, '{'))
+        goto fail;
+
+    emit_op(s, OP_push_const);
+    ctor_cpool_offset = fd->byte_code.size;
+    emit_u32(s, 0); /* will be patched at the end of the class parsing */
+
+    emit_op(s, OP_define_class);
+    emit_u8(s, class_flags);
+
+    ctor_fd = NULL;
+    while (s->token.val != '}') {
+        if (s->token.val == ';') {
+            if (next_token(s))
+                goto fail;
+            continue;
+        }
+        is_static = (s->token.val == TOK_STATIC);
+        if (is_static) {
+            if (next_token(s))
+                goto fail;
+        }
+        if (is_static)
+            emit_op(s, OP_swap);
+        start_ptr = s->token.ptr;
+        prop_type = js_parse_property_name(s, &name, TRUE, FALSE);
+        if (prop_type < 0)
+            goto fail;
+
+        if ((name == JS_ATOM_constructor && !is_static &&
+             prop_type != PROP_TYPE_IDENT) ||
+            (name == JS_ATOM_prototype && is_static)) {
+            js_parse_error(s, "invalid method name");
+            goto fail;
+        }
+        if (prop_type == PROP_TYPE_GET || prop_type == PROP_TYPE_SET) {
+            BOOL is_set = prop_type - PROP_TYPE_GET;
+            if (js_parse_function_decl(s, JS_PARSE_FUNC_GETTER + is_set,
+                                       JS_FUNC_NORMAL, JS_ATOM_NULL,
+                                       start_ptr, s->token.line_num))
+                goto fail;
+            if (name == JS_ATOM_NULL) {
+                emit_op(s, OP_define_method_computed);
+            } else {
+                emit_op(s, OP_define_method);
+                emit_atom(s, name);
+            }
+            emit_u8(s, OP_DEFINE_METHOD_GETTER + is_set);
+        } else {
+            JSParseFunctionEnum func_type;
+            JSFunctionKindEnum func_kind;
+
+            func_type = JS_PARSE_FUNC_METHOD;
+            func_kind = JS_FUNC_NORMAL;
+            if (prop_type == PROP_TYPE_STAR) {
+                func_kind = JS_FUNC_GENERATOR;
+            } else if (prop_type == PROP_TYPE_ASYNC) {
+                func_kind = JS_FUNC_ASYNC;
+            } else if (prop_type == PROP_TYPE_ASYNC_STAR) {
+                func_kind = JS_FUNC_ASYNC_GENERATOR;
+            } else if (name == JS_ATOM_constructor && !is_static) {
+                if (ctor_fd) {
+                    js_parse_error(s, "property constructor appears more than once");
+                    goto fail;
+                }
+                if (class_flags & JS_DEFINE_CLASS_HAS_HERITAGE)
+                    func_type = JS_PARSE_FUNC_DERIVED_CLASS_CONSTRUCTOR;
+                else
+                    func_type = JS_PARSE_FUNC_CLASS_CONSTRUCTOR;
+            }
+            if (js_parse_function_decl2(s, func_type, func_kind, JS_ATOM_NULL, start_ptr, s->token.line_num, JS_PARSE_EXPORT_NONE, &method_fd))
+                goto fail;
+            if (func_type == JS_PARSE_FUNC_DERIVED_CLASS_CONSTRUCTOR ||
+                func_type == JS_PARSE_FUNC_CLASS_CONSTRUCTOR) {
+                ctor_fd = method_fd;
+            } else {
+                if (name == JS_ATOM_NULL) {
+                    emit_op(s, OP_define_method_computed);
+                } else {
+                    emit_op(s, OP_define_method);
+                    emit_atom(s, name);
+                }
+                emit_u8(s, OP_DEFINE_METHOD_METHOD);
+            }
+        }
+        if (is_static)
+            emit_op(s, OP_swap);
+        JS_FreeAtom(ctx, name);
+        name = JS_ATOM_NULL;
+    }
+
+    if (s->token.val != '}') {
+        js_parse_error(s, "expecting '%c'", '}');
+        goto fail;
+    }
+
+    /* drop the prototype */
+    emit_op(s, OP_drop);
+
+    if (!ctor_fd) {
+        if (js_parse_class_default_ctor(s, class_flags & JS_DEFINE_CLASS_HAS_HERITAGE, &ctor_fd))
+            goto fail;
+    }
+    /* patch the constant pool index for the constructor */
+    put_u32(fd->byte_code.buf + ctor_cpool_offset, ctor_fd->parent_cpool_idx);
+
+    /* store the class source code in the constructor. */
+    if (!(fd->js_mode & JS_MODE_STRIP)) {
+        js_free(ctx, ctor_fd->source);
+        ctor_fd->source_len = s->buf_ptr - class_start_ptr;
+        ctor_fd->source = js_strndup(ctx, (const char *)class_start_ptr,
+                                     ctor_fd->source_len);
+        if (!ctor_fd->source)
+            goto fail;
+    }
+
+    /* consume the '}' */
+    if (next_token(s))
+        goto fail;
+
+    if (class_name != JS_ATOM_NULL) {
+        /* store the class name in the scoped class name variable (it
+           is independent from the class statement variable
+           definition) */
+        emit_op(s, OP_dup);
+        emit_op(s, OP_scope_put_var_init);
+        emit_atom(s, class_name);
+        emit_u16(s, fd->scope_level);
+    }
+    pop_scope(s);
+
+    /* the class statements have a block level scope */
+    if (class_var_name != JS_ATOM_NULL) {
+        emit_op(s, OP_set_name);
+        if (class_name == JS_ATOM_NULL) {
+            /* only happens when export_flag == JS_PARSE_EXPORT_DEFAULT */
+            emit_atom(s, JS_ATOM_default);
+        } else {
+            emit_atom(s, class_name);
+        }
+        if (define_var(s, fd, class_var_name, TOK_LET) < 0)
+            goto fail;
+        emit_op(s, OP_scope_put_var_init);
+        emit_atom(s, class_var_name);
+        emit_u16(s, fd->scope_level);
+    } else {
+        emit_op(s, OP_set_name);
+        emit_atom(s, class_name);
+        /* if class_name = JS_ATOM_NULL, it will be set upon storing into
+           a named variable or property */
+        if (class_name != JS_ATOM_NULL)
+            fd->last_opcode_pos = -1;
+    }
+
+    if (export_flag != JS_PARSE_EXPORT_NONE) {
+        if (!add_export_entry(s, fd->module,
+                              class_var_name,
+                              export_flag == JS_PARSE_EXPORT_NAMED ? class_var_name : JS_ATOM_default,
+                              JS_EXPORT_TYPE_LOCAL))
+            goto fail;
+    }
+
+    JS_FreeAtom(ctx, class_name);
+    JS_FreeAtom(ctx, class_var_name);
+    fd->js_mode = saved_js_mode;
+    return 0;
+ fail:
+    JS_FreeAtom(ctx, name);
+    JS_FreeAtom(ctx, class_name);
+    JS_FreeAtom(ctx, class_var_name);
+    fd->js_mode = saved_js_mode;
+    return -1;
+}
+
+static __exception int js_parse_array_literal(JSParseState *s)
+{
+    uint32_t idx;
+    BOOL need_length;
+
+    if (next_token(s))
+        return -1;
+    /* small regular arrays are created on the stack */
+    idx = 0;
+    while (s->token.val != ']' && idx < 32) {
+        if (s->token.val == ',' || s->token.val == TOK_ELLIPSIS)
+            break;
+        if (js_parse_assign_expr(s, TRUE))
+            return -1;
+        idx++;
+        /* accept trailing comma */
+        if (s->token.val == ',') {
+            if (next_token(s))
+                return -1;
+        } else
+        if (s->token.val != ']')
+            goto done;
+    }
+    emit_op(s, OP_array_from);
+    emit_u16(s, idx);
+
+    /* larger arrays and holes are handled with explicit indices */
+    need_length = FALSE;
+    while (s->token.val != ']' && idx < 0x7fffffff) {
+        if (s->token.val == TOK_ELLIPSIS)
+            break;
+        need_length = TRUE;
+        if (s->token.val != ',') {
+            if (js_parse_assign_expr(s, TRUE))
+                return -1;
+            emit_op(s, OP_define_field);
+            emit_u32(s, __JS_AtomFromUInt32(idx));
+            need_length = FALSE;
+        }
+        idx++;
+        /* accept trailing comma */
+        if (s->token.val == ',') {
+            if (next_token(s))
+                return -1;
+        }
+    }
+    if (s->token.val == ']') {
+        if (need_length) {
+            /* Set the length: Cannot use OP_define_field because
+               length is not configurable */
+            emit_op(s, OP_dup);
+            emit_op(s, OP_push_i32);
+            emit_u32(s, idx);
+            emit_op(s, OP_put_field);
+            emit_atom(s, JS_ATOM_length);
+        }
+        goto done;
+    }
+
+    /* huge arrays and spread elements require a dynamic index on the stack */
+    emit_op(s, OP_push_i32);
+    emit_u32(s, idx);
+
+    /* stack has array, index */
+    while (s->token.val != ']') {
+        if (s->token.val == TOK_ELLIPSIS) {
+            if (next_token(s))
+                return -1;
+            if (js_parse_assign_expr(s, TRUE))
+                return -1;
+#if 1
+            emit_op(s, OP_append);
+#else
+            int label_next, label_done;
+            label_next = new_label(s);
+            label_done = new_label(s);
+            /* enumerate object */
+            emit_op(s, OP_for_of_start);
+            emit_op(s, OP_rot5l);
+            emit_op(s, OP_rot5l);
+            emit_label(s, label_next);
+            /* on stack: enum_rec array idx */
+            emit_op(s, OP_for_of_next);
+            emit_u8(s, 2);
+            emit_goto(s, OP_if_true, label_done);
+            /* append element */
+            /* enum_rec array idx val -> enum_rec array new_idx */
+            emit_op(s, OP_define_array_el);
+            emit_op(s, OP_inc);
+            emit_goto(s, OP_goto, label_next);
+            emit_label(s, label_done);
+            /* close enumeration */
+            emit_op(s, OP_drop); /* drop undef val */
+            emit_op(s, OP_nip1); /* drop enum_rec */
+            emit_op(s, OP_nip1);
+            emit_op(s, OP_nip1);
+#endif
+        } else {
+            need_length = TRUE;
+            if (s->token.val != ',') {
+                if (js_parse_assign_expr(s, TRUE))
+                    return -1;
+                /* a idx val */
+                emit_op(s, OP_define_array_el);
+                need_length = FALSE;
+            }
+            emit_op(s, OP_inc);
+        }
+        if (s->token.val != ',')
+            break;
+        if (next_token(s))
+            return -1;
+    }
+    if (need_length) {
+        /* Set the length: cannot use OP_define_field because
+           length is not configurable */
+        emit_op(s, OP_dup1);    /* array length - array array length */
+        emit_op(s, OP_put_field);
+        emit_atom(s, JS_ATOM_length);
+    } else {
+        emit_op(s, OP_drop);    /* array length - array */
+    }
+done:
+    return js_parse_expect(s, ']');
+}
+
+/* XXX: remove */
+static BOOL has_with_scope(JSFunctionDef *s, int scope_level)
+{
+    /* check if scope chain contains a with statement */
+    while (s) {
+        int scope_idx = s->scopes[scope_level].first;
+        while (scope_idx >= 0) {
+            JSVarDef *vd = &s->vars[scope_idx];
+
+            if (vd->var_name == JS_ATOM__with_)
+                return TRUE;
+            scope_idx = vd->scope_next;
+        }
+        /* check parent scopes */
+        scope_level = s->parent_scope_level;
+        s = s->parent;
+    }
+    return FALSE;
+}
+
+typedef struct JSLValue {
+    int opcode;
+    int scope;
+    int label;
+    int depth;
+    int tok;
+    JSAtom name;
+} JSLValue;
+
+static __exception int get_lvalue(JSParseState *s, int *popcode, int *pscope,
+                                  JSAtom *pname, int *plabel, int *pdepth, BOOL keep,
+                                  int tok)
+{
+    JSFunctionDef *fd;
+    int opcode, scope, label, depth;
+    JSAtom name;
+
+    /* we check the last opcode to get the lvalue type */
+    fd = s->cur_func;
+    scope = 0;
+    name = JS_ATOM_NULL;
+    label = -1;
+    depth = 0;
+    switch(opcode = get_prev_opcode(fd)) {
+    case OP_scope_get_var:
+        name = get_u32(fd->byte_code.buf + fd->last_opcode_pos + 1);
+        scope = get_u16(fd->byte_code.buf + fd->last_opcode_pos + 5);
+        if ((name == JS_ATOM_arguments || name == JS_ATOM_eval) &&
+            (fd->js_mode & JS_MODE_STRICT)) {
+            return js_parse_error(s, "invalid lvalue in strict mode");
+        }
+        if (name == JS_ATOM_this || name == JS_ATOM_new_target)
+            goto invalid_lvalue;
+        depth = 2;  /* will generate OP_get_ref_value */
+        break;
+    case OP_get_field:
+        name = get_u32(fd->byte_code.buf + fd->last_opcode_pos + 1);
+        depth = 1;
+        break;
+    case OP_get_array_el:
+        depth = 2;
+        break;
+    case OP_get_super_value:
+        depth = 3;
+        break;
+    default:
+    invalid_lvalue:
+        if (tok == TOK_FOR) {
+            return js_parse_error(s, "invalid for in/of left hand-side");
+        } else if (tok == TOK_INC || tok == TOK_DEC) {
+            /* Firefox issues a SyntaxError for this */
+            return js_parse_error1(s, JS_REFERENCE_ERROR, "invalid increment/decrement operand");
+        } else if (tok == '[' || tok == '{') {
+            return js_parse_error(s, "invalid destructuring target");
+        } else {
+            return js_parse_error1(s, JS_REFERENCE_ERROR, "invalid assignment left-hand side");
+        }
+    }
+    /* remove the last opcode */
+    fd->byte_code.size = fd->last_opcode_pos;
+    fd->last_opcode_pos = -1;
+
+    if (keep) {
+        /* get the value but keep the object/fields on the stack */
+        switch(opcode) {
+        case OP_scope_get_var:
+            label = new_label(s);
+            emit_op(s, OP_scope_make_ref);
+            emit_atom(s, name);
+            emit_u32(s, label);
+            emit_u16(s, scope);
+            update_label(fd, label, 1);
+            emit_op(s, OP_get_ref_value);
+            opcode = OP_get_ref_value;
+            break;
+        case OP_get_field:
+            emit_op(s, OP_get_field2);
+            emit_atom(s, name);
+            break;
+        case OP_get_array_el:
+            /* XXX: replace by a single opcode ? */
+            emit_op(s, OP_to_propkey2);
+            emit_op(s, OP_dup2);
+            emit_op(s, OP_get_array_el);
+            break;
+        case OP_get_super_value:
+            emit_op(s, OP_to_propkey);
+            emit_op(s, OP_dup3);
+            emit_op(s, OP_get_super_value);
+            break;
+        default:
+            abort();
+        }
+    } else {
+        switch(opcode) {
+        case OP_scope_get_var:
+            label = new_label(s);
+            emit_op(s, OP_scope_make_ref);
+            emit_atom(s, name);
+            emit_u32(s, label);
+            emit_u16(s, scope);
+            update_label(fd, label, 1);
+            opcode = OP_get_ref_value;
+            break;
+        case OP_get_array_el:
+            emit_op(s, OP_to_propkey2);
+            break;
+        case OP_get_super_value:
+            emit_op(s, OP_to_propkey);
+            break;
+        }
+    }
+
+    *popcode = opcode;
+    *pscope = scope;
+    /* name has refcount for OP_get_field and OP_get_ref_value,
+       and JS_ATOM_NULL for other opcodes */
+    *pname = name;
+    *plabel = label;
+    if (pdepth)
+        *pdepth = depth;
+    return 0;
+}
+
+/* if special = TRUE: specific post inc/dec case */
+/* name has a live reference */
+static void put_lvalue(JSParseState *s, int opcode, int scope,
+                       JSAtom name, int label, BOOL special)
+{
+    switch(opcode) {
+    case OP_get_field:
+        if (!special)
+            emit_op(s, OP_insert2); /* obj v -> v obj v */
+        else
+            emit_op(s, OP_perm3); /* obj v0 v -> v0 obj v */
+        emit_op(s, OP_put_field);
+        emit_u32(s, name);  /* name has refcount */
+        break;
+    case OP_get_array_el:
+        if (!special)
+            emit_op(s, OP_insert3); /* obj prop v -> v obj prop v */
+        else
+            emit_op(s, OP_perm4); /* obj prop v0 v -> v0 obj prop v */
+        emit_op(s, OP_put_array_el);
+        break;
+    case OP_get_ref_value:
+        JS_FreeAtom(s->ctx, name);
+        emit_label(s, label);
+        if (!special)
+            emit_op(s, OP_insert3); /* obj prop v -> v obj prop v */
+        else
+            emit_op(s, OP_perm4); /* obj prop v0 v -> v0 obj prop v */
+        emit_op(s, OP_put_ref_value);
+        break;
+    case OP_get_super_value:
+        if (!special)
+            emit_op(s, OP_insert4); /* this obj prop v -> v this obj prop v */
+        else
+            emit_op(s, OP_perm5); /* this obj prop v0 v -> v0 this obj prop v */
+        emit_op(s, OP_put_super_value);
+        break;
+    default:
+        abort();
+    }
+}
+
+static __exception int js_parse_expr_paren(JSParseState *s)
+{
+    if (js_parse_expect(s, '('))
+        return -1;
+    if (js_parse_expr(s))
+        return -1;
+    if (js_parse_expect(s, ')'))
+        return -1;
+    return 0;
+}
+
+static int js_unsupported_keyword(JSParseState *s, JSAtom atom)
+{
+    char buf[ATOM_GET_STR_BUF_SIZE];
+    return js_parse_error(s, "unsupported keyword: %s",
+                          JS_AtomGetStr(s->ctx, buf, sizeof(buf), atom));
+}
+
+static __exception int js_define_var(JSParseState *s, JSAtom name, int tok)
+{
+    JSFunctionDef *fd = s->cur_func;
+
+    if (name == JS_ATOM_yield && fd->func_kind == JS_FUNC_GENERATOR) {
+        return js_parse_error(s, "yield is a reserved identifier");
+    }
+    if ((name == JS_ATOM_arguments || name == JS_ATOM_eval)
+    &&  (fd->js_mode & JS_MODE_STRICT)) {
+        return js_parse_error(s, "invalid variable name in strict mode");
+    }
+    if ((name == JS_ATOM_let || name == JS_ATOM_undefined)
+    &&  (tok == TOK_LET || tok == TOK_CONST)) {
+        return js_parse_error(s, "invalid lexical variable name");
+    }
+    if (define_var(s, fd, name, tok) < 0)
+        return -1;
+    return 0;
+}
+
+static void js_emit_spread_code(JSParseState *s, int depth)
+{
+    int label_rest_next, label_rest_done;
+
+    /* XXX: could check if enum object is an actual array and optimize
+       slice extraction. enumeration record and target array are in a
+       different order from OP_append case. */
+    /* enum_rec xxx -- enum_rec xxx array 0 */
+    emit_op(s, OP_array_from);
+    emit_u16(s, 0);
+    emit_op(s, OP_push_i32);
+    emit_u32(s, 0);
+    emit_label(s, label_rest_next = new_label(s));
+    emit_op(s, OP_for_of_next);
+    emit_u8(s, 2 + depth);
+    label_rest_done = emit_goto(s, OP_if_true, -1);
+    /* array idx val -- array idx */
+    emit_op(s, OP_define_array_el);
+    emit_op(s, OP_inc);
+    emit_goto(s, OP_goto, label_rest_next);
+    emit_label(s, label_rest_done);
+    /* enum_rec xxx array idx undef -- enum_rec xxx array */
+    emit_op(s, OP_drop);
+    emit_op(s, OP_drop);
+}
+
+static int js_parse_check_duplicate_parameter(JSParseState *s, JSAtom name)
+{
+    /* Check for duplicate parameter names */
+    JSFunctionDef *fd = s->cur_func;
+    int i;
+    for (i = 0; i < fd->arg_count; i++) {
+        if (fd->args[i].var_name == name)
+            goto duplicate;
+    }
+    for (i = 0; i < fd->var_count; i++) {
+        if (fd->vars[i].var_name == name)
+            goto duplicate;
+    }
+    return 0;
+
+duplicate:
+    return js_parse_error(s, "duplicate parameter names not allowed in this context");
+}
+
+static JSAtom js_parse_destructing_var(JSParseState *s, int tok, int is_arg)
+{
+    JSAtom name;
+
+    if (!(s->token.val == TOK_IDENT && !s->token.u.ident.is_reserved)
+    ||  ((s->cur_func->js_mode & JS_MODE_STRICT) &&
+         (s->token.u.ident.atom == JS_ATOM_eval || s->token.u.ident.atom == JS_ATOM_arguments))) {
+        js_parse_error(s, "invalid destructuring target");
+        return JS_ATOM_NULL;
+    }
+    name = JS_DupAtom(s->ctx, s->token.u.ident.atom);
+    if (is_arg && js_parse_check_duplicate_parameter(s, name))
+        goto fail;
+    if (next_token(s))
+        goto fail;
+
+    return name;
+fail:
+    JS_FreeAtom(s->ctx, name);
+    return JS_ATOM_NULL;
+}
+
+static int js_parse_destructing_element(JSParseState *s, int tok, int is_arg,
+                                        int hasval, int has_ellipsis)
+{
+    int label_parse, label_assign, label_done, label_lvalue, depth_lvalue;
+    int start_addr, assign_addr;
+    JSAtom prop_name, var_name;
+    int opcode, scope, tok1, skip_bits;
+
+    if (has_ellipsis < 0) {
+        /* pre-parse destructuration target for spread detection */
+        js_parse_skip_parens_token(s, &skip_bits, FALSE);
+        has_ellipsis = skip_bits & SKIP_HAS_ELLIPSIS;
+    }
+
+    label_parse = new_label(s);
+    label_assign = new_label(s);
+
+    start_addr = s->cur_func->byte_code.size;
+    if (hasval) {
+        /* consume value from the stack */
+        emit_op(s, OP_dup);
+        emit_op(s, OP_undefined);
+        emit_op(s, OP_strict_eq);
+        emit_goto(s, OP_if_true, label_parse);
+        emit_label(s, label_assign);
+    } else {
+        emit_goto(s, OP_goto, label_parse);
+        emit_label(s, label_assign);
+        /* leave value on the stack */
+        emit_op(s, OP_dup);
+    }
+    assign_addr = s->cur_func->byte_code.size;
+    if (s->token.val == '{') {
+        if (next_token(s))
+            return -1;
+        /* throw an exception if the value cannot be converted to an object */
+        emit_op(s, OP_to_object);
+        if (has_ellipsis) {
+            /* add excludeList on stack just below src object */
+            emit_op(s, OP_object);
+            emit_op(s, OP_swap);
+        }
+        while (s->token.val != '}') {
+            int prop_type;
+            if (s->token.val == TOK_ELLIPSIS) {
+                if (!has_ellipsis) {
+                    JS_ThrowInternalError(s->ctx, "unexpected ellipsis token");
+                    return -1;
+                }
+                if (next_token(s))
+                    return -1;
+                if (tok) {
+                    var_name = js_parse_destructing_var(s, tok, is_arg);
+                    if (var_name == JS_ATOM_NULL)
+                        return -1;
+                    opcode = OP_scope_get_var;
+                    scope = s->cur_func->scope_level;
+                    label_lvalue = -1;
+                    depth_lvalue = 0;
+                } else {
+                    if (js_parse_postfix_expr(s, TRUE))
+                        return -1;
+
+                    if (get_lvalue(s, &opcode, &scope, &var_name,
+                                   &label_lvalue, &depth_lvalue, FALSE, '{'))
+                        return -1;
+                }
+                if (s->token.val != '}') {
+                    js_parse_error(s, "assignment rest property must be last");
+                    goto var_error;
+                }
+                emit_op(s, OP_object);  /* target */
+                emit_op(s, OP_copy_data_properties);
+                emit_u8(s, 0 | ((depth_lvalue + 1) << 2) | ((depth_lvalue + 2) << 5));
+                goto set_val;
+            }
+            prop_type = js_parse_property_name(s, &prop_name, FALSE, TRUE);
+            if (prop_type < 0)
+                return -1;
+            var_name = JS_ATOM_NULL;
+            opcode = OP_scope_get_var;
+            scope = s->cur_func->scope_level;
+            label_lvalue = -1;
+            depth_lvalue = 0;
+            if (prop_type == PROP_TYPE_IDENT) {
+                if (next_token(s))
+                    goto prop_error;
+                if (s->token.val == '[' || s->token.val == '{') {
+                    if (prop_name == JS_ATOM_NULL) {
+                        /* computed property name on stack */
+                        if (has_ellipsis) {
+                            /* define the property in excludeList */
+                            emit_op(s, OP_to_propkey); /* avoid calling ToString twice */
+                            emit_op(s, OP_perm3); /* TOS: src excludeList prop */
+                            emit_op(s, OP_null); /* TOS: src excludeList prop null */
+                            emit_op(s, OP_define_array_el); /* TOS: src excludeList prop */
+                            emit_op(s, OP_perm3); /* TOS: excludeList src prop */
+                        }
+                        /* get the computed property from the source object */
+                        emit_op(s, OP_get_array_el2);
+                    } else {
+                        /* named property */
+                        if (has_ellipsis) {
+                            /* define the property in excludeList */
+                            emit_op(s, OP_swap); /* TOS: src excludeList */
+                            emit_op(s, OP_null); /* TOS: src excludeList null */
+                            emit_op(s, OP_define_field); /* TOS: src excludeList */
+                            emit_atom(s, prop_name);
+                            emit_op(s, OP_swap); /* TOS: excludeList src */
+                        }
+                        /* get the named property from the source object */
+                        emit_op(s, OP_get_field2);
+                        emit_u32(s, prop_name);
+                    }
+                    if (js_parse_destructing_element(s, tok, is_arg, TRUE, -1))
+                        return -1;
+                    if (s->token.val == '}')
+                        break;
+                    /* accept a trailing comma before the '}' */
+                    if (js_parse_expect(s, ','))
+                        return -1;
+                    continue;
+                }
+                if (prop_name == JS_ATOM_NULL) {
+                    emit_op(s, OP_to_propkey2);
+                    if (has_ellipsis) {
+                        /* define the property in excludeList */
+                        emit_op(s, OP_perm3);
+                        emit_op(s, OP_null);
+                        emit_op(s, OP_define_array_el);
+                        emit_op(s, OP_perm3);
+                    }
+                    /* source prop -- source source prop */
+                    emit_op(s, OP_dup1);
+                } else {
+                    if (has_ellipsis) {
+                        /* define the property in excludeList */
+                        emit_op(s, OP_swap);
+                        emit_op(s, OP_null);
+                        emit_op(s, OP_define_field);
+                        emit_atom(s, prop_name);
+                        emit_op(s, OP_swap);
+                    }
+                    /* source -- source source */
+                    emit_op(s, OP_dup);
+                }
+                if (tok) {
+                    var_name = js_parse_destructing_var(s, tok, is_arg);
+                    if (var_name == JS_ATOM_NULL)
+                        goto prop_error;
+                } else {
+                    if (js_parse_postfix_expr(s, TRUE))
+                        goto prop_error;
+                lvalue:
+                    if (get_lvalue(s, &opcode, &scope, &var_name,
+                                   &label_lvalue, &depth_lvalue, FALSE, '{'))
+                        goto prop_error;
+                    /* swap ref and lvalue object if any */
+                    if (prop_name == JS_ATOM_NULL) {
+                        switch(depth_lvalue) {
+                        case 1:
+                            /* source prop x -> x source prop */
+                            emit_op(s, OP_rot3r);
+                            break;
+                        case 2:
+                            /* source prop x y -> x y source prop */
+                            emit_op(s, OP_swap2);   /* t p2 s p1 */
+                            break;
+                        case 3:
+                            /* source prop x y z -> x y z source prop */
+                            emit_op(s, OP_rot5l);
+                            emit_op(s, OP_rot5l);
+                            break;
+                        }
+                    } else {
+                        switch(depth_lvalue) {
+                        case 1:
+                            /* source x -> x source */
+                            emit_op(s, OP_swap);
+                            break;
+                        case 2:
+                            /* source x y -> x y source */
+                            emit_op(s, OP_rot3l);
+                            break;
+                        case 3:
+                            /* source x y z -> x y z source */
+                            emit_op(s, OP_rot4l);
+                            break;
+                        }
+                    }
+                }
+                if (prop_name == JS_ATOM_NULL) {
+                    /* computed property name on stack */
+                    /* XXX: should have OP_get_array_el2x with depth */
+                    /* source prop -- val */
+                    emit_op(s, OP_get_array_el);
+                } else {
+                    /* named property */
+                    /* XXX: should have OP_get_field2x with depth */
+                    /* source -- val */
+                    emit_op(s, OP_get_field);
+                    emit_u32(s, prop_name);
+                }
+            } else {
+                /* prop_type = PROP_TYPE_VAR, cannot be a computed property */
+                if (is_arg && js_parse_check_duplicate_parameter(s, prop_name))
+                    goto prop_error;
+                if ((s->cur_func->js_mode & JS_MODE_STRICT) &&
+                    (prop_name == JS_ATOM_eval || prop_name == JS_ATOM_arguments)) {
+                    js_parse_error(s, "invalid destructuring target");
+                    goto prop_error;
+                }
+                if (has_ellipsis) {
+                    /* define the property in excludeList */
+                    emit_op(s, OP_swap);
+                    emit_op(s, OP_null);
+                    emit_op(s, OP_define_field);
+                    emit_atom(s, prop_name);
+                    emit_op(s, OP_swap);
+                }
+                if (!tok || tok == TOK_VAR) {
+                    /* generate reference */
+                    /* source -- source source */
+                    emit_op(s, OP_dup);
+                    emit_op(s, OP_scope_get_var);
+                    emit_atom(s, prop_name);
+                    emit_u16(s, s->cur_func->scope_level);
+                    goto lvalue;
+                }
+                var_name = JS_DupAtom(s->ctx, prop_name);
+                /* source -- source val */
+                emit_op(s, OP_get_field2);
+                emit_u32(s, prop_name);
+            }
+        set_val:
+            if (tok) {
+                if (js_define_var(s, var_name, tok))
+                    goto var_error;
+                scope = s->cur_func->scope_level;
+            }
+            if (s->token.val == '=') {  /* handle optional default value */
+                int label_hasval;
+                emit_op(s, OP_dup);
+                emit_op(s, OP_undefined);
+                emit_op(s, OP_strict_eq);
+                label_hasval = emit_goto(s, OP_if_false, -1);
+                if (next_token(s))
+                    goto var_error;
+                emit_op(s, OP_drop);
+                if (js_parse_assign_expr(s, TRUE))
+                    goto var_error;
+                if (opcode == OP_scope_get_var || opcode == OP_get_ref_value)
+                    set_object_name(s, var_name);
+                emit_label(s, label_hasval);
+            }
+            /* store value into lvalue object */
+            /* XXX: should use put_lvalue() with tok and no_keep */
+            switch(opcode) {
+            case OP_scope_get_var:  /* val -- */
+                emit_op(s, (tok == TOK_CONST || tok == TOK_LET) ?
+                        OP_scope_put_var_init : OP_scope_put_var);
+                emit_u32(s, var_name);  /* has refcount */
+                emit_u16(s, scope);
+                break;
+            case OP_get_field:      /* obj val -- */
+                emit_op(s, OP_put_field);
+                emit_u32(s, var_name);  /* has refcount */
+                break;
+            case OP_get_array_el:   /* obj prop val -- */
+                emit_op(s, OP_put_array_el);
+                break;
+            case OP_get_ref_value:   /* obj prop val -- */
+                /* XXX: currently this reference is never optimized */
+                JS_FreeAtom(s->ctx, var_name);
+                emit_label(s, label_lvalue);
+                //emit_op(s, OP_nop);   /* emit 2 bytes for optimizer */
+                emit_op(s, OP_put_ref_value);
+                break;
+            case OP_get_super_value:
+                emit_op(s, OP_put_super_value);
+                break;
+            default:
+                abort();
+            }
+            if (s->token.val == '}')
+                break;
+            /* accept a trailing comma before the '}' */
+            if (js_parse_expect(s, ','))
+                return -1;
+        }
+        /* drop the source object */
+        emit_op(s, OP_drop);
+        if (has_ellipsis) {
+            emit_op(s, OP_drop); /* pop excludeList */
+        }
+        if (next_token(s))
+            return -1;
+    } else if (s->token.val == '[') {
+        BOOL has_spread;
+        int enum_depth;
+        BlockEnv block_env;
+
+        if (next_token(s))
+            return -1;
+        /* the block environment is only needed in generators in case
+           'yield' triggers a 'return' */
+        push_break_entry(s->cur_func, &block_env,
+                         JS_ATOM_NULL, -1, -1, 2);
+        block_env.has_iterator = TRUE;
+        emit_op(s, OP_for_of_start);
+        has_spread = FALSE;
+        while (s->token.val != ']') {
+            /* get the next value */
+            if (s->token.val == TOK_ELLIPSIS) {
+                if (next_token(s))
+                    return -1;
+                if (s->token.val == ',' || s->token.val == ']')
+                    return js_parse_error(s, "missing binding pattern...");
+                has_spread = TRUE;
+            }
+            if (s->token.val == ',') {
+                /* do nothing, skip the value, has_spread is false */
+                emit_op(s, OP_for_of_next);
+                emit_u8(s, 0);
+                emit_op(s, OP_drop);
+                emit_op(s, OP_drop);
+            } else if ((s->token.val == '[' || s->token.val == '{')
+                   &&  ((tok1 = js_parse_skip_parens_token(s, &skip_bits, FALSE)) == ',' ||
+                        tok1 == '=' || tok1 == ']')) {
+                if (has_spread) {
+                    if (tok1 == '=')
+                        return js_parse_error(s, "rest element cannot have a default value");
+                    js_emit_spread_code(s, 0);
+                } else {
+                    emit_op(s, OP_for_of_next);
+                    emit_u8(s, 0);
+                    emit_op(s, OP_drop);
+                }
+                if (js_parse_destructing_element(s, tok, is_arg, TRUE, skip_bits & SKIP_HAS_ELLIPSIS))
+                    return -1;
+            } else {
+                var_name = JS_ATOM_NULL;
+                enum_depth = 0;
+                if (tok) {
+                    var_name = js_parse_destructing_var(s, tok, is_arg);
+                    if (var_name == JS_ATOM_NULL)
+                        goto var_error;
+                    if (js_define_var(s, var_name, tok))
+                        goto var_error;
+                    opcode = OP_scope_get_var;
+                    scope = s->cur_func->scope_level;
+                } else {
+                    if (js_parse_postfix_expr(s, TRUE))
+                        return -1;
+                    if (get_lvalue(s, &opcode, &scope, &var_name,
+                                   &label_lvalue, &enum_depth, FALSE, '[')) {
+                        return -1;
+                    }
+                }
+                if (has_spread) {
+                    js_emit_spread_code(s, enum_depth);
+                } else {
+                    emit_op(s, OP_for_of_next);
+                    emit_u8(s, enum_depth);
+                    emit_op(s, OP_drop);
+                }
+                if (s->token.val == '=' && !has_spread) {
+                    /* handle optional default value */
+                    int label_hasval;
+                    emit_op(s, OP_dup);
+                    emit_op(s, OP_undefined);
+                    emit_op(s, OP_strict_eq);
+                    label_hasval = emit_goto(s, OP_if_false, -1);
+                    if (next_token(s))
+                        goto var_error;
+                    emit_op(s, OP_drop);
+                    if (js_parse_assign_expr(s, TRUE))
+                        goto var_error;
+                    if (opcode == OP_scope_get_var || opcode == OP_get_ref_value)
+                        set_object_name(s, var_name);
+                    emit_label(s, label_hasval);
+                }
+                /* store value into lvalue object */
+                /* XXX: should use put_lvalue() with tok and no_keep */
+                switch(opcode) {
+                case OP_scope_get_var:  /* enum_rec val -- enum_rec */
+                    emit_op(s, (tok == TOK_CONST || tok == TOK_LET) ?
+                            OP_scope_put_var_init : OP_scope_put_var);
+                    emit_u32(s, var_name); /* has refcount */
+                    emit_u16(s, scope);
+                    break;
+                case OP_get_field:      /* enum_rec obj val -- enum_rec */
+                    emit_op(s, OP_put_field);
+                    emit_u32(s, var_name); /* has refcount */
+                    break;
+                case OP_get_array_el:   /* enum_rec obj prop val -- enum_rec */
+                    emit_op(s, OP_put_array_el);
+                    break;
+                case OP_get_ref_value:   /* enum_rec obj prop val -- enum_rec */
+                    /* XXX: this reference is not optimized for global vars */
+                    JS_FreeAtom(s->ctx, var_name);
+                    emit_label(s, label_lvalue);
+                    //emit_op(s, OP_nop);   /* emit 2 bytes for optimizer */
+                    emit_op(s, OP_put_ref_value);
+                    break;
+                case OP_get_super_value:   /* enum_rec this obj prop val -- enum_rec */
+                    emit_op(s, OP_put_super_value);
+                    break;
+                default:
+                    abort();
+                }
+            }
+            if (s->token.val == ']')
+                break;
+            if (has_spread)
+                return js_parse_error(s, "rest element must be the last one");
+            /* accept a trailing comma before the ']' */
+            if (js_parse_expect(s, ','))
+                return -1;
+        }
+        /* close iterator object:
+           if completed, enum_obj has been replaced by undefined */
+        emit_op(s, OP_iterator_close);
+        pop_break_entry(s->cur_func);
+        if (next_token(s))
+            return -1;
+    } else {
+        return js_parse_error(s, "invalid assignment syntax");
+    }
+    if (s->token.val == '=') {
+        label_done = emit_goto(s, OP_goto, -1);
+        if (next_token(s))
+            return -1;
+        emit_label(s, label_parse);
+        if (hasval)
+            emit_op(s, OP_drop);
+        if (js_parse_assign_expr(s, TRUE))
+            return -1;
+        emit_goto(s, OP_goto, label_assign);
+        emit_label(s, label_done);
+    } else {
+        assert(hasval);
+        /* remove test and decrement label ref count */
+        memset(s->cur_func->byte_code.buf + start_addr, OP_nop,
+               assign_addr - start_addr);
+        s->cur_func->label_slots[label_parse].ref_count--;
+    }
+    return 0;
+
+ prop_error:
+    JS_FreeAtom(s->ctx, prop_name);
+ var_error:
+    JS_FreeAtom(s->ctx, var_name);
+    return -1;
+}
+
+typedef enum FuncCallType {
+    FUNC_CALL_NORMAL,
+    FUNC_CALL_NEW,
+    FUNC_CALL_SUPER_CTOR,
+    FUNC_CALL_TEMPLATE,
+} FuncCallType;
+
+static __exception int js_parse_postfix_expr(JSParseState *s, BOOL accept_lparen)
+{
+    FuncCallType call_type;
+
+    call_type = FUNC_CALL_NORMAL;
+    switch(s->token.val) {
+    case TOK_NUMBER:
+        {
+            JSValue val;
+            val = s->token.u.num.val;
+
+            if (JS_VALUE_GET_TAG(val) == JS_TAG_INT) {
+                emit_op(s, OP_push_i32);
+                emit_u32(s, JS_VALUE_GET_INT(val));
+            } else
+#ifdef CONFIG_BIGNUM
+            if (JS_VALUE_GET_TAG(val) == JS_TAG_BIG_FLOAT) {
+                bf_t r_s, *r = &r_s;
+                slimb_t e;
+                int ret;
+
+                /* need a runtime conversion */
+                /* XXX: could add a cache and/or do it once at
+                   the start of the function */
+                if (emit_push_const(s, val, 0) < 0)
+                    return -1;
+                e = s->token.u.num.exponent;
+                if (e == (int32_t)e) {
+                    emit_op(s, OP_push_i32);
+                    emit_u32(s, e);
+                } else {
+                    bf_init(s->ctx->bf_ctx, r);
+                    bf_set_si(r, e);
+                    val = JS_NewBigInt(s->ctx, r);
+                    ret = emit_push_const(s, val, 0);
+                    JS_FreeValue(s->ctx, val);
+                    if (ret < 0)
+                        return -1;
+                }
+                emit_op(s, OP_mul_pow10);
+            } else
+#endif
+            {
+                if (emit_push_const(s, val, 0) < 0)
+                    return -1;
+            }
+        }
+        if (next_token(s))
+            return -1;
+        break;
+    case TOK_TEMPLATE:
+        if (js_parse_template(s, 0, NULL))
+            return -1;
+        break;
+    case TOK_STRING:
+        if (emit_push_const(s, s->token.u.str.str, 1))
+            return -1;
+        if (next_token(s))
+            return -1;
+        break;
+    case TOK_REGEXP:
+        {
+            JSValue str;
+            int ret;
+            if (!s->ctx->compile_regexp)
+                return js_parse_error(s, "RegExp are not supported");
+            ret = emit_push_const(s, s->token.u.regexp.body, 0);
+            str = s->ctx->compile_regexp(s->ctx, s->token.u.regexp.body,
+                                         s->token.u.regexp.flags);
+            if (JS_IsException(str)) {
+                /* add the line number info */
+                build_backtrace(s->ctx, s->ctx->current_exception,
+                                s->filename, s->token.line_num, NULL);
+                return -1;
+            }
+            ret = emit_push_const(s, str, 0);
+            JS_FreeValue(s->ctx, str);
+            if (ret)
+                return -1;
+            /* we use a specific opcode to be sure the correct
+               function is called (otherwise the bytecode would have
+               to be verified by the RegExp constructor) */
+            emit_op(s, OP_regexp);
+            if (next_token(s))
+                return -1;
+        }
+        break;
+    case '(':
+        if (js_parse_skip_parens_token(s, NULL, TRUE) == TOK_ARROW) {
+            if (js_parse_function_decl(s, JS_PARSE_FUNC_ARROW,
+                                       JS_FUNC_NORMAL, JS_ATOM_NULL,
+                                       s->token.ptr, s->token.line_num))
+                return -1;
+        } else {
+            if (js_parse_expr_paren(s))
+                return -1;
+        }
+        break;
+    case TOK_FUNCTION:
+        if (js_parse_function_decl(s, JS_PARSE_FUNC_EXPR,
+                                   JS_FUNC_NORMAL, JS_ATOM_NULL,
+                                   s->token.ptr, s->token.line_num))
+            return -1;
+        break;
+    case TOK_CLASS:
+        if (js_parse_class(s, TRUE, JS_PARSE_EXPORT_NONE))
+            return -1;
+        break;
+    case TOK_NULL:
+        if (next_token(s))
+            return -1;
+        emit_op(s, OP_null);
+        break;
+    case TOK_THIS:
+        if (next_token(s))
+            return -1;
+        emit_op(s, OP_scope_get_var);
+        emit_atom(s, JS_ATOM_this);
+        emit_u16(s, 0);
+        break;
+    case TOK_FALSE:
+        if (next_token(s))
+            return -1;
+        emit_op(s, OP_push_false);
+        break;
+    case TOK_TRUE:
+        if (next_token(s))
+            return -1;
+        emit_op(s, OP_push_true);
+        break;
+    case TOK_IDENT:
+        {
+            JSAtom name;
+            if (s->token.u.ident.is_reserved) {
+                return js_parse_error_reserved_identifier(s);
+            }
+            if (peek_token(s, TRUE) == TOK_ARROW) {
+                if (js_parse_function_decl(s, JS_PARSE_FUNC_ARROW,
+                                           JS_FUNC_NORMAL, JS_ATOM_NULL,
+                                           s->token.ptr, s->token.line_num))
+                    return -1;
+            } else if (token_is_pseudo_keyword(s, JS_ATOM_async) &&
+                       peek_token(s, TRUE) != '\n') {
+                const uint8_t *source_ptr;
+                int source_line_num;
+
+                source_ptr = s->token.ptr;
+                source_line_num = s->token.line_num;
+                if (next_token(s))
+                    return -1;
+                if (s->token.val == TOK_FUNCTION) {
+                    if (js_parse_function_decl(s, JS_PARSE_FUNC_EXPR,
+                                               JS_FUNC_ASYNC, JS_ATOM_NULL,
+                                               source_ptr, source_line_num))
+                        return -1;
+                } else if ((s->token.val == '(' &&
+                            js_parse_skip_parens_token(s, NULL, TRUE) == TOK_ARROW) ||
+                           (s->token.val == TOK_IDENT && !s->token.u.ident.is_reserved &&
+                            peek_token(s, TRUE) == TOK_ARROW)) {
+                    if (js_parse_function_decl(s, JS_PARSE_FUNC_ARROW,
+                                               JS_FUNC_ASYNC, JS_ATOM_NULL,
+                                               source_ptr, source_line_num))
+                        return -1;
+                } else {
+                    name = JS_DupAtom(s->ctx, JS_ATOM_async);
+                    goto do_get_var;
+                }
+            } else {
+                name = JS_DupAtom(s->ctx, s->token.u.ident.atom);
+                if (next_token(s))  /* update line number before emitting code */
+                    return -1;
+            do_get_var:
+                emit_op(s, OP_scope_get_var);
+                emit_u32(s, name);
+                emit_u16(s, s->cur_func->scope_level);
+            }
+        }
+        break;
+    case '{':
+    case '[':
+        {
+            int skip_bits;
+            if (js_parse_skip_parens_token(s, &skip_bits, FALSE) == '=') {
+                if (js_parse_destructing_element(s, 0, 0, FALSE, skip_bits & SKIP_HAS_ELLIPSIS))
+                    return -1;
+            } else {
+                if (s->token.val == '{') {
+                    if (js_parse_object_literal(s))
+                        return -1;
+                } else {
+                    if (js_parse_array_literal(s))
+                        return -1;
+                }
+            }
+        }
+        break;
+    case TOK_NEW:
+        if (next_token(s))
+            return -1;
+        if (s->token.val == '.') {
+            if (next_token(s))
+                return -1;
+            if (!token_is_pseudo_keyword(s, JS_ATOM_target))
+                return js_parse_error(s, "expecting target");
+            if (!s->cur_func->new_target_allowed)
+                return js_parse_error(s, "new.target only allowed within functions");
+            if (next_token(s))
+                return -1;
+            emit_op(s, OP_scope_get_var);
+            emit_atom(s, JS_ATOM_new_target);
+            emit_u16(s, 0);
+        } else {
+            if (js_parse_postfix_expr(s, FALSE))
+                return -1;
+            accept_lparen = TRUE;
+            if (s->token.val != '(') {
+                /* new operator on an object */
+                emit_op(s, OP_dup);
+                emit_op(s, OP_call_constructor);
+                emit_u16(s, 0);
+            } else {
+                call_type = FUNC_CALL_NEW;
+            }
+        }
+        break;
+    case TOK_SUPER:
+        if (next_token(s))
+            return -1;
+        if (s->token.val == '(') {
+            if (!s->cur_func->super_call_allowed)
+                return js_parse_error(s, "super() is only valid in a derived class constructor");
+            call_type = FUNC_CALL_SUPER_CTOR;
+        } else if (s->token.val == '.' || s->token.val == '[') {
+            if (!s->cur_func->super_allowed)
+                return js_parse_error(s, "'super' is only valid in a method");
+            emit_op(s, OP_scope_get_var);
+            emit_atom(s, JS_ATOM_this);
+            emit_u16(s, 0);
+            emit_op(s, OP_scope_get_var);
+            emit_atom(s, JS_ATOM_home_object);
+            emit_u16(s, 0);
+            emit_op(s, OP_get_super);
+        } else {
+            return js_parse_error(s, "invalid use of 'super'");
+        }
+        break;
+    default:
+        return js_parse_error(s, "unexpected token in expression: '%.*s'",
+                              (int)(s->buf_ptr - s->token.ptr), s->token.ptr);
+    }
+
+    for(;;) {
+        JSFunctionDef *fd = s->cur_func;
+
+        if (s->token.val == TOK_TEMPLATE && call_type == FUNC_CALL_NORMAL) {
+            call_type = FUNC_CALL_TEMPLATE;
+            goto parse_func_call;
+        }
+        if (s->token.val == '(' && accept_lparen) {
+            int opcode;
+            int arg_count;
+
+            /* function call */
+            if (next_token(s))
+                return -1;
+
+            if (call_type == FUNC_CALL_NORMAL) {
+            parse_func_call:
+                switch(opcode = get_prev_opcode(fd)) {
+                case OP_get_field:
+                    /* keep the object on the stack */
+                    fd->byte_code.buf[fd->last_opcode_pos] = OP_get_field2;
+                    break;
+                case OP_get_array_el:
+                    /* keep the object on the stack */
+                    fd->byte_code.buf[fd->last_opcode_pos] = OP_get_array_el2;
+                    break;
+                case OP_scope_get_var:
+                    {
+                        JSAtom name;
+                        int scope;
+                        name = get_u32(fd->byte_code.buf + fd->last_opcode_pos + 1);
+                        scope = get_u16(fd->byte_code.buf + fd->last_opcode_pos + 5);
+                        if (name == JS_ATOM_eval && call_type == FUNC_CALL_NORMAL) {
+                            /* direct 'eval' */
+                            JS_FreeAtom(s->ctx, name);
+                            fd->byte_code.size = fd->last_opcode_pos;
+                            fd->last_opcode_pos = -1;
+                            opcode = OP_eval;
+                        } else {
+                            /* verify if function name resolves to a simple
+                               get_loc/get_arg: a function call inside a `with`
+                               statement can resolve to a method call of the
+                               `with` context object
+                             */
+                            /* XXX: always generate the OP_scope_get_ref
+                               and remove it in variable resolution
+                               pass ? */
+                            if (has_with_scope(fd, scope)) {
+                                opcode = OP_scope_get_ref;
+                                fd->byte_code.buf[fd->last_opcode_pos] = opcode;
+                            }
+                        }
+                    }
+                    break;
+                case OP_get_super_value:
+                    fd->byte_code.buf[fd->last_opcode_pos] = OP_get_array_el;
+                    /* on stack: this func_obj */
+                    opcode = OP_get_array_el;
+                    break;
+                default:
+                    opcode = OP_invalid;
+                    break;
+                }
+            } else {
+                opcode = OP_invalid;
+            }
+
+            if (call_type == FUNC_CALL_TEMPLATE) {
+                if (js_parse_template(s, 1, &arg_count))
+                    return -1;
+                goto emit_func_call;
+            } else if (call_type == FUNC_CALL_SUPER_CTOR) {
+                emit_op(s, OP_scope_get_var);
+                emit_atom(s, JS_ATOM_this_active_func);
+                emit_u16(s, 0);
+
+                emit_op(s, OP_get_super_ctor);
+
+                emit_op(s, OP_scope_get_var);
+                emit_atom(s, JS_ATOM_new_target);
+                emit_u16(s, 0);
+            } else if (call_type == FUNC_CALL_NEW) {
+                emit_op(s, OP_dup); /* new.target = function */
+            }
+
+            /* parse arguments */
+            arg_count = 0;
+            while (s->token.val != ')') {
+                if (arg_count >= 65535) {
+                    return js_parse_error(s, "Too many call arguments");
+                }
+                if (s->token.val == TOK_ELLIPSIS)
+                    break;
+                if (js_parse_assign_expr(s, TRUE))
+                    return -1;
+                arg_count++;
+                if (s->token.val == ')')
+                    break;
+                /* accept a trailing comma before the ')' */
+                if (js_parse_expect(s, ','))
+                    return -1;
+            }
+            if (s->token.val == TOK_ELLIPSIS) {
+                emit_op(s, OP_array_from);
+                emit_u16(s, arg_count);
+                emit_op(s, OP_push_i32);
+                emit_u32(s, arg_count);
+
+                /* on stack: array idx */
+                while (s->token.val != ')') {
+                    if (s->token.val == TOK_ELLIPSIS) {
+                        if (next_token(s))
+                            return -1;
+                        if (js_parse_assign_expr(s, TRUE))
+                            return -1;
+#if 1
+                        /* XXX: could pass is_last indicator? */
+                        emit_op(s, OP_append);
+#else
+                        int label_next, label_done;
+                        label_next = new_label(s);
+                        label_done = new_label(s);
+                        /* push enumerate object below array/idx pair */
+                        emit_op(s, OP_for_of_start);
+                        emit_op(s, OP_rot5l);
+                        emit_op(s, OP_rot5l);
+                        emit_label(s, label_next);
+                        /* on stack: enum_rec array idx */
+                        emit_op(s, OP_for_of_next);
+                        emit_u8(s, 2);
+                        emit_goto(s, OP_if_true, label_done);
+                        /* append element */
+                        /* enum_rec array idx val -> enum_rec array new_idx */
+                        emit_op(s, OP_define_array_el);
+                        emit_op(s, OP_inc);
+                        emit_goto(s, OP_goto, label_next);
+                        emit_label(s, label_done);
+                        /* close enumeration, drop enum_rec and idx */
+                        emit_op(s, OP_drop); /* drop undef */
+                        emit_op(s, OP_nip1); /* drop enum_rec */
+                        emit_op(s, OP_nip1);
+                        emit_op(s, OP_nip1);
+#endif
+                    } else {
+                        if (js_parse_assign_expr(s, TRUE))
+                            return -1;
+                        /* array idx val */
+                        emit_op(s, OP_define_array_el);
+                        emit_op(s, OP_inc);
+                    }
+                    if (s->token.val == ')')
+                        break;
+                    /* accept a trailing comma before the ')' */
+                    if (js_parse_expect(s, ','))
+                        return -1;
+                }
+                if (next_token(s))
+                    return -1;
+                /* drop the index */
+                emit_op(s, OP_drop);
+
+                /* apply function call */
+                switch(opcode) {
+                case OP_get_field:
+                case OP_get_array_el:
+                case OP_scope_get_ref:
+                    /* obj func array -> func obj array */
+                    emit_op(s, OP_perm3);
+                    emit_op(s, OP_apply);
+                    emit_u16(s, call_type == FUNC_CALL_NEW);
+                    break;
+                case OP_eval:
+                    /* eval needs a single argument */
+                    emit_op(s, OP_get_field);
+                    emit_atom(s, __JS_AtomFromUInt32(0));
+                    emit_op(s, OP_eval);
+                    emit_u16(s, fd->scope_level);
+                    fd->has_eval_call = TRUE;
+                    break;
+                default:
+                    if (call_type == FUNC_CALL_SUPER_CTOR) {
+                        emit_op(s, OP_apply);
+                        emit_u16(s, 1);
+                        /* set the 'this' value */
+                        emit_op(s, OP_dup);
+                        emit_op(s, OP_scope_put_var_init);
+                        emit_atom(s, JS_ATOM_this);
+                        emit_u16(s, 0);
+                    } else if (call_type == FUNC_CALL_NEW) {
+                        /* obj func array -> func obj array */
+                        emit_op(s, OP_perm3);
+                        emit_op(s, OP_apply);
+                        emit_u16(s, 1);
+                    } else {
+                        /* func array -> func undef array */
+                        emit_op(s, OP_undefined);
+                        emit_op(s, OP_swap);
+                        emit_op(s, OP_apply);
+                        emit_u16(s, 0);
+                    }
+                    break;
+                }
+            } else {
+                if (next_token(s))
+                    return -1;
+            emit_func_call:
+                switch(opcode) {
+                case OP_get_field:
+                case OP_get_array_el:
+                case OP_scope_get_ref:
+                    emit_op(s, OP_call_method);
+                    emit_u16(s, arg_count);
+                    break;
+                case OP_eval:
+                    /* eval needs a single argument */
+                    if (arg_count == 0) {
+                        /* no actual eval call is needed? */
+                        emit_op(s, OP_undefined);
+                    } else {
+                        int i;
+                        /* pop extra arguments. Contrary to ECMA spec,
+                           browsers seem to evaluate extra arguments
+                           to direct eval */
+                        for(i = 1; i < arg_count; i++)
+                            emit_op(s, OP_drop);
+                        emit_op(s, OP_eval);
+                        emit_u16(s, fd->scope_level);
+                        fd->has_eval_call = TRUE;
+                    }
+                    break;
+                default:
+                    if (call_type == FUNC_CALL_SUPER_CTOR) {
+                        emit_op(s, OP_call_constructor);
+                        emit_u16(s, arg_count);
+
+                        /* set the 'this' value */
+                        emit_op(s, OP_dup);
+                        emit_op(s, OP_scope_put_var_init);
+                        emit_atom(s, JS_ATOM_this);
+                        emit_u16(s, 0);
+                    } else if (call_type == FUNC_CALL_NEW) {
+                        emit_op(s, OP_call_constructor);
+                        emit_u16(s, arg_count);
+                    } else {
+                        emit_op(s, OP_call);
+                        emit_u16(s, arg_count);
+                    }
+                    break;
+                }
+            }
+            call_type = FUNC_CALL_NORMAL;
+        } else if (s->token.val == '.') {
+            if (next_token(s))
+                return -1;
+            if (!token_is_ident(s->token.val)) {
+                return js_parse_error(s, "expecting field name");
+            }
+            if (get_prev_opcode(fd) == OP_get_super) {
+                JSValue val;
+                int ret;
+                val = JS_AtomToValue(s->ctx, s->token.u.ident.atom);
+                ret = emit_push_const(s, val, 1);
+                JS_FreeValue(s->ctx, val);
+                if (ret)
+                    return -1;
+                emit_op(s, OP_get_super_value);
+            } else {
+                emit_op(s, OP_get_field);
+                emit_atom(s, s->token.u.ident.atom);
+            }
+            if (next_token(s))
+                return -1;
+        } else if (s->token.val == '[') {
+            int prev_op;
+            if (next_token(s))
+                return -1;
+            prev_op = get_prev_opcode(fd);
+            if (js_parse_expr(s))
+                return -1;
+            if (js_parse_expect(s, ']'))
+                return -1;
+            if (prev_op == OP_get_super) {
+                emit_op(s, OP_get_super_value);
+            } else {
+                emit_op(s, OP_get_array_el);
+            }
+        } else if (!s->got_lf && (s->token.val == TOK_DEC || s->token.val == TOK_INC)) {
+            int opcode, op, scope, label;
+            JSAtom name;
+            op = s->token.val;
+            if (get_lvalue(s, &opcode, &scope, &name, &label, NULL, TRUE, op))
+                return -1;
+            emit_op(s, OP_post_dec + op - TOK_DEC);
+            put_lvalue(s, opcode, scope, name, label, TRUE);
+            if (next_token(s))
+                return -1;
+        } else {
+            break;
+        }
+    }
+    return 0;
+}
+
+static __exception int js_parse_delete(JSParseState *s)
+{
+    JSFunctionDef *fd = s->cur_func;
+    JSAtom name;
+    int opcode;
+
+    if (next_token(s))
+        return -1;
+    if (js_parse_unary(s, -1))
+        return -1;
+    switch(opcode = get_prev_opcode(fd)) {
+    case OP_get_field:
+        {
+            JSValue val;
+            int ret;
+
+            name = get_u32(fd->byte_code.buf + fd->last_opcode_pos + 1);
+            fd->byte_code.size = fd->last_opcode_pos;
+            fd->last_opcode_pos = -1;
+            val = JS_AtomToValue(s->ctx, name);
+            ret = emit_push_const(s, val, 1);
+            JS_FreeValue(s->ctx, val);
+            JS_FreeAtom(s->ctx, name);
+            if (ret)
+                return ret;
+        }
+        goto do_delete;
+    case OP_get_array_el:
+        fd->byte_code.size = fd->last_opcode_pos;
+        fd->last_opcode_pos = -1;
+    do_delete:
+        emit_op(s, OP_delete);
+        break;
+    case OP_scope_get_var:
+        /* 'delete this': this is not a reference */
+        name = get_u32(fd->byte_code.buf + fd->last_opcode_pos + 1);
+        if (name == JS_ATOM_this || name == JS_ATOM_new_target)
+            goto ret_true;
+        if (fd->js_mode & JS_MODE_STRICT) {
+            return js_parse_error(s, "cannot delete a direct reference in strict mode");
+        } else {
+            fd->byte_code.buf[fd->last_opcode_pos] = OP_scope_delete_var;
+        }
+        break;
+    default:
+    ret_true:
+        emit_op(s, OP_drop);
+        emit_op(s, OP_push_true);
+        break;
+    }
+    return 0;
+}
+
+static __exception int js_parse_unary(JSParseState *s, int exponentiation_flag)
+{
+    int op;
+
+    switch(s->token.val) {
+    case '+':
+    case '-':
+    case '!':
+    case '~':
+    case TOK_VOID:
+        op = s->token.val;
+        if (next_token(s))
+            return -1;
+        if (js_parse_unary(s, -1))
+            return -1;
+        switch(op) {
+        case '-':
+            emit_op(s, OP_neg);
+            break;
+        case '+':
+            emit_op(s, OP_plus);
+            break;
+        case '!':
+            emit_op(s, OP_lnot);
+            break;
+        case '~':
+            emit_op(s, OP_not);
+            break;
+        case TOK_VOID:
+            emit_op(s, OP_drop);
+            emit_op(s, OP_undefined);
+            break;
+        default:
+            abort();
+        }
+        exponentiation_flag = 0;
+        break;
+    case TOK_DEC:
+    case TOK_INC:
+        {
+            int opcode, op, scope, label;
+            JSAtom name;
+            op = s->token.val;
+            if (next_token(s))
+                return -1;
+            /* XXX: should parse LeftHandSideExpression */
+            if (js_parse_unary(s, 0))
+                return -1;
+            if (get_lvalue(s, &opcode, &scope, &name, &label, NULL, TRUE, op))
+                return -1;
+            emit_op(s, OP_dec + op - TOK_DEC);
+            put_lvalue(s, opcode, scope, name, label, FALSE);
+        }
+        break;
+    case TOK_TYPEOF:
+        {
+            JSFunctionDef *fd;
+            if (next_token(s))
+                return -1;
+            if (js_parse_unary(s, -1))
+                return -1;
+            /* reference access should not return an exception, so we
+               patch the get_var */
+            fd = s->cur_func;
+            if (get_prev_opcode(fd) == OP_scope_get_var) {
+                fd->byte_code.buf[fd->last_opcode_pos] = OP_scope_get_var_undef;
+            }
+            emit_op(s, OP_typeof);
+            exponentiation_flag = 0;
+        }
+        break;
+    case TOK_DELETE:
+        if (js_parse_delete(s))
+            return -1;
+        exponentiation_flag = 0;
+        break;
+    case TOK_AWAIT:
+        if (!(s->cur_func->func_kind & JS_FUNC_ASYNC))
+            return js_parse_error(s, "unexpected 'await' keyword");
+        if (!s->cur_func->in_function_body)
+            return js_parse_error(s, "await in default expression");
+        if (next_token(s))
+            return -1;
+        if (js_parse_unary(s, -1))
+            return -1;
+        emit_op(s, OP_await);
+        exponentiation_flag = 0;
+        break;
+    default:
+        if (js_parse_postfix_expr(s, TRUE))
+            return -1;
+        break;
+    }
+    if (exponentiation_flag) {
+#ifdef CONFIG_BIGNUM
+        if (s->token.val == TOK_POW || s->token.val == TOK_MATH_POW) {
+            int val = s->token.val;
+            /* Extended exponentiation syntax rules: we extend the ES7
+               grammar in order to have more intuitive semantics:
+               -2**2 evaluates to -4. */
+            if (!(s->cur_func->js_mode & JS_MODE_MATH)) {
+                if (exponentiation_flag < 0) {
+                    JS_ThrowSyntaxError(s->ctx, "unparenthesized unary expression can't appear on the left-hand side of '**'");
+                    return -1;
+                }
+            }
+            if (next_token(s))
+                return -1;
+            if (js_parse_unary(s, 1))
+                return -1;
+            if (val == TOK_POW)
+                emit_op(s, OP_pow);
+            else
+                emit_op(s, OP_math_pow);
+        }
+#else
+        if (s->token.val == TOK_POW) {
+            /* Strict ES7 exponentiation syntax rules: To solve
+               conficting semantics between different implementations
+               regarding the precedence of prefix operators and the
+               postifx exponential, ES7 specifies that -2**2 is a
+               syntax error. */
+            if (exponentiation_flag < 0) {
+                JS_ThrowSyntaxError(s->ctx, "unparenthesized unary expression can't appear on the left-hand side of '**'");
+                return -1;
+            }
+            if (next_token(s))
+                return -1;
+            if (js_parse_unary(s, 1))
+                return -1;
+            emit_op(s, OP_pow);
+        }
+#endif
+    }
+    return 0;
+}
+
+static __exception int js_parse_expr_binary(JSParseState *s, int level,
+                                            BOOL in_accepted)
+{
+    int op, opcode;
+
+    if (level == 0) {
+        return js_parse_unary(s, 1);
+    }
+    if (js_parse_expr_binary(s, level - 1, in_accepted))
+        return -1;
+    for(;;) {
+        op = s->token.val;
+        switch(level) {
+        case 1:
+            switch(op) {
+            case '*':
+                opcode = OP_mul;
+                break;
+            case '/':
+#ifdef CONFIG_BIGNUM
+                if (s->cur_func->js_mode & JS_MODE_MATH)
+                    opcode = OP_math_div;
+                else
+#endif
+                    opcode = OP_div;
+                break;
+            case '%':
+#ifdef CONFIG_BIGNUM
+                if (s->cur_func->js_mode & JS_MODE_MATH)
+                    opcode = OP_math_mod;
+                else
+#endif
+                    opcode = OP_mod;
+                break;
+            default:
+                return 0;
+            }
+            break;
+        case 2:
+            switch(op) {
+            case '+':
+                opcode = OP_add;
+                break;
+            case '-':
+                opcode = OP_sub;
+                break;
+            default:
+                return 0;
+            }
+            break;
+        case 3:
+            switch(op) {
+            case TOK_SHL:
+                opcode = OP_shl;
+                break;
+            case TOK_SAR:
+                opcode = OP_sar;
+                break;
+            case TOK_SHR:
+                opcode = OP_shr;
+                break;
+            default:
+                return 0;
+            }
+            break;
+        case 4:
+            switch(op) {
+            case '<':
+                opcode = OP_lt;
+                break;
+            case '>':
+                opcode = OP_gt;
+                break;
+            case TOK_LTE:
+                opcode = OP_lte;
+                break;
+            case TOK_GTE:
+                opcode = OP_gte;
+                break;
+            case TOK_INSTANCEOF:
+                opcode = OP_instanceof;
+                break;
+            case TOK_IN:
+                if (in_accepted) {
+                    opcode = OP_in;
+                } else {
+                    return 0;
+                }
+                break;
+            default:
+                return 0;
+            }
+            break;
+        case 5:
+            switch(op) {
+            case TOK_EQ:
+                opcode = OP_eq;
+                break;
+            case TOK_NEQ:
+                opcode = OP_neq;
+                break;
+            case TOK_STRICT_EQ:
+                opcode = OP_strict_eq;
+                break;
+            case TOK_STRICT_NEQ:
+                opcode = OP_strict_neq;
+                break;
+            default:
+                return 0;
+            }
+            break;
+        case 6:
+            switch(op) {
+            case '&':
+                opcode = OP_and;
+                break;
+            default:
+                return 0;
+            }
+            break;
+        case 7:
+            switch(op) {
+            case '^':
+                opcode = OP_xor;
+                break;
+            default:
+                return 0;
+            }
+            break;
+        case 8:
+            switch(op) {
+            case '|':
+                opcode = OP_or;
+                break;
+            default:
+                return 0;
+            }
+            break;
+        default:
+            abort();
+        }
+        if (next_token(s))
+            return -1;
+        if (js_parse_expr_binary(s, level - 1, in_accepted))
+            return -1;
+        emit_op(s, opcode);
+    }
+    return 0;
+}
+
+static __exception int js_parse_logical_and_or(JSParseState *s, int op,
+                                               BOOL in_accepted)
+{
+    int label1;
+
+    if (op == TOK_LAND) {
+        if (js_parse_expr_binary(s, 8, in_accepted))
+            return -1;
+    } else {
+        if (js_parse_logical_and_or(s, TOK_LAND, in_accepted))
+            return -1;
+    }
+    if (s->token.val == op) {
+        label1 = new_label(s);
+
+        for(;;) {
+            if (next_token(s))
+                return -1;
+            emit_op(s, OP_dup);
+            emit_goto(s, op == TOK_LAND ? OP_if_false : OP_if_true, label1);
+            emit_op(s, OP_drop);
+
+            if (op == TOK_LAND) {
+                if (js_parse_expr_binary(s, 8, in_accepted))
+                    return -1;
+            } else {
+                if (js_parse_logical_and_or(s, TOK_LAND, in_accepted))
+                    return -1;
+            }
+            if (s->token.val != op)
+                break;
+        }
+
+        emit_label(s, label1);
+    }
+    return 0;
+}
+
+static __exception int js_parse_cond_expr(JSParseState *s, BOOL in_accepted)
+{
+    int label1, label2;
+
+    if (js_parse_logical_and_or(s, TOK_LOR, in_accepted))
+        return -1;
+    if (s->token.val == '?') {
+        if (next_token(s))
+            return -1;
+        label1 = emit_goto(s, OP_if_false, -1);
+
+        if (js_parse_assign_expr(s, TRUE))
+            return -1;
+        if (js_parse_expect(s, ':'))
+            return -1;
+
+        label2 = emit_goto(s, OP_goto, -1);
+
+        emit_label(s, label1);
+
+        if (js_parse_assign_expr(s, in_accepted))
+            return -1;
+
+        emit_label(s, label2);
+    }
+    return 0;
+}
+
+static void emit_return(JSParseState *s, BOOL hasval);
+
+static __exception int js_parse_assign_expr(JSParseState *s, BOOL in_accepted)
+{
+    int opcode, op, scope;
+    JSAtom name0 = JS_ATOM_NULL;
+    JSAtom name;
+
+    if (s->token.val == TOK_YIELD) {
+        BOOL is_star = FALSE;
+        if (!(s->cur_func->func_kind & JS_FUNC_GENERATOR))
+            return js_parse_error(s, "unexpected 'yield' keyword");
+        if (!s->cur_func->in_function_body)
+            return js_parse_error(s, "yield in default expression");
+        if (next_token(s))
+            return -1;
+        /* XXX: is there a better method to detect 'yield' without
+           parameters ? */
+        if (s->token.val != ';' && s->token.val != ')' &&
+            s->token.val != ']' && s->token.val != '}' &&
+            s->token.val != ',' && s->token.val != ':' && !s->got_lf) {
+            if (s->token.val == '*') {
+                is_star = TRUE;
+                if (next_token(s))
+                    return -1;
+            }
+            if (js_parse_assign_expr(s, in_accepted))
+                return -1;
+        } else {
+            emit_op(s, OP_undefined);
+        }
+        if (s->cur_func->func_kind == JS_FUNC_ASYNC_GENERATOR) {
+            int label_loop, label_return, label_next;
+            int label_return1, label_yield, label_throw, label_throw1;
+            int label_throw2;
+
+            if (is_star) {
+                label_loop = new_label(s);
+                label_yield = new_label(s);
+
+                emit_op(s, OP_for_await_of_start);
+
+                /* remove the catch offset (XXX: could avoid pushing back
+                   undefined) */
+                emit_op(s, OP_drop);
+                emit_op(s, OP_undefined);
+
+                emit_op(s, OP_undefined); /* initial value */
+
+                emit_label(s, label_loop);
+                emit_op(s, OP_async_iterator_next);
+                emit_op(s, OP_await);
+                emit_op(s, OP_iterator_get_value_done);
+                label_next = emit_goto(s, OP_if_true, -1); /* end of loop */
+                emit_op(s, OP_await);
+                emit_label(s, label_yield);
+                emit_op(s, OP_async_yield_star);
+                emit_op(s, OP_dup);
+                label_return = emit_goto(s, OP_if_true, -1);
+                emit_op(s, OP_drop);
+                emit_goto(s, OP_goto, label_loop);
+
+                emit_label(s, label_return);
+                emit_op(s, OP_push_i32);
+                emit_u32(s, 2);
+                emit_op(s, OP_strict_eq);
+                label_throw = emit_goto(s, OP_if_true, -1);
+
+                /* return handling */
+                emit_op(s, OP_async_iterator_get);
+                emit_u8(s, 0);
+                label_return1 = emit_goto(s, OP_if_true, -1);
+                emit_op(s, OP_await);
+                emit_op(s, OP_iterator_get_value_done);
+                /* XXX: the spec does not indicate that an await should be
+                   performed in case done = true, but the tests assume it */
+                emit_goto(s, OP_if_false, label_yield);
+
+                emit_label(s, label_return1);
+                emit_op(s, OP_await);
+                emit_op(s, OP_nip);
+                emit_op(s, OP_nip);
+                emit_op(s, OP_nip);
+                emit_return(s, TRUE);
+
+                /* throw handling */
+                emit_label(s, label_throw);
+                emit_op(s, OP_async_iterator_get);
+                emit_u8(s, 1);
+                label_throw1 = emit_goto(s, OP_if_true, -1);
+                emit_op(s, OP_await);
+                emit_op(s, OP_iterator_get_value_done);
+                emit_goto(s, OP_if_false, label_yield);
+                /* XXX: the spec does not indicate that an await should be
+                   performed in case done = true, but the tests assume it */
+                emit_op(s, OP_await);
+                emit_goto(s, OP_goto, label_next);
+                /* close the iterator and throw a type error exception */
+                emit_label(s, label_throw1);
+                emit_op(s, OP_async_iterator_get);
+                emit_u8(s, 0);
+                label_throw2 = emit_goto(s, OP_if_true, -1);
+                emit_op(s, OP_await);
+                emit_label(s, label_throw2);
+                emit_op(s, OP_async_iterator_get);
+                emit_u8(s, 2); /* throw the type error exception */
+                emit_op(s, OP_drop); /* never reached */
+
+                emit_label(s, label_next);
+                emit_op(s, OP_nip); /* keep the value associated with
+                                       done = true */
+                emit_op(s, OP_nip);
+                emit_op(s, OP_nip);
+            } else {
+                emit_op(s, OP_await);
+                emit_op(s, OP_yield);
+                label_next = emit_goto(s, OP_if_false, -1);
+                emit_op(s, OP_await);
+                emit_return(s, TRUE);
+                emit_label(s, label_next);
+            }
+        } else {
+            int label_next;
+            if (is_star) {
+                emit_op(s, OP_for_of_start);
+                emit_op(s, OP_drop);    /* drop the catch offset */
+                emit_op(s, OP_yield_star);
+            } else {
+                emit_op(s, OP_yield);
+            }
+            label_next = emit_goto(s, OP_if_false, -1);
+            emit_return(s, TRUE);
+            emit_label(s, label_next);
+        }
+        return 0;
+    }
+    if (s->token.val == TOK_IDENT) {
+        /* name0 is used to check for OP_set_name pattern, not duplicated */
+        name0 = s->token.u.ident.atom;
+    }
+    if (js_parse_cond_expr(s, in_accepted))
+        return -1;
+
+    op = s->token.val;
+    if (op == '=' || (op >= TOK_MUL_ASSIGN && op <= TOK_POW_ASSIGN)) {
+        int label;
+        if (next_token(s))
+            return -1;
+        if (get_lvalue(s, &opcode, &scope, &name, &label, NULL, (op != '='), op) < 0)
+            return -1;
+
+        if (js_parse_assign_expr(s, in_accepted)) {
+            JS_FreeAtom(s->ctx, name);
+            return -1;
+        }
+
+        if (op == '=') {
+            if (opcode == OP_get_ref_value && name == name0) {
+                set_object_name(s, name);
+            }
+        } else {
+            static const uint8_t assign_opcodes[] = {
+                OP_mul, OP_div, OP_mod, OP_add, OP_sub,
+                OP_shl, OP_sar, OP_shr, OP_and, OP_xor, OP_or,
+#ifdef CONFIG_BIGNUM
+                OP_math_pow,
+#endif
+                OP_pow,
+            };
+            op = assign_opcodes[op - TOK_MUL_ASSIGN];
+#ifdef CONFIG_BIGNUM
+            if (s->cur_func->js_mode & JS_MODE_MATH) {
+                if (op == OP_div)
+                    op = OP_math_div;
+                else if (op == OP_mod)
+                    op = OP_math_mod;
+            }
+#endif
+            emit_op(s, op);
+        }
+        put_lvalue(s, opcode, scope, name, label, FALSE);
+    }
+    return 0;
+}
+
+static __exception int js_parse_expr2(JSParseState *s, BOOL in_accepted)
+{
+    BOOL comma = FALSE;
+    for(;;) {
+        if (js_parse_assign_expr(s, in_accepted))
+            return -1;
+        if (comma) {
+            /* prevent get_lvalue from using the last expression
+               as an lvalue. This also prevents the conversion of
+               of get_var to get_ref for method lookup in function
+               call inside `with` statement.
+             */
+            s->cur_func->last_opcode_pos = -1;
+        }
+        if (s->token.val != ',')
+            break;
+        comma = TRUE;
+        if (next_token(s))
+            return -1;
+        emit_op(s, OP_drop);
+    }
+    return 0;
+}
+
+static __exception int js_parse_expr(JSParseState *s)
+{
+    return js_parse_expr2(s, TRUE);
+}
+
+static void push_break_entry(JSFunctionDef *fd, BlockEnv *be,
+                             JSAtom label_name,
+                             int label_break, int label_cont,
+                             int drop_count)
+{
+    be->prev = fd->top_break;
+    fd->top_break = be;
+    be->label_name = label_name;
+    be->label_break = label_break;
+    be->label_cont = label_cont;
+    be->drop_count = drop_count;
+    be->label_finally = -1;
+    be->scope_level = fd->scope_level;
+    be->has_iterator = FALSE;
+}
+
+static void pop_break_entry(JSFunctionDef *fd)
+{
+    BlockEnv *be;
+    be = fd->top_break;
+    fd->top_break = be->prev;
+}
+
+static __exception int emit_break(JSParseState *s, JSAtom name, int is_cont)
+{
+    BlockEnv *top;
+    int i, scope_level;
+
+    scope_level = s->cur_func->scope_level;
+    top = s->cur_func->top_break;
+    while (top != NULL) {
+        close_scopes(s, scope_level, top->scope_level);
+        scope_level = top->scope_level;
+        if (is_cont &&
+            top->label_cont != -1 &&
+            (name == JS_ATOM_NULL || top->label_name == name)) {
+            /* continue stays inside the same block */
+            emit_goto(s, OP_goto, top->label_cont);
+            return 0;
+        }
+        if (!is_cont &&
+            top->label_break != -1 &&
+            (name == JS_ATOM_NULL || top->label_name == name)) {
+            emit_goto(s, OP_goto, top->label_break);
+            return 0;
+        }
+        i = 0;
+        if (top->has_iterator) {
+            emit_op(s, OP_iterator_close);
+            i += 3;
+        }
+        for(; i < top->drop_count; i++)
+            emit_op(s, OP_drop);
+        if (top->label_finally != -1) {
+            /* must push dummy value to keep same stack depth */
+            emit_op(s, OP_undefined);
+            emit_goto(s, OP_gosub, top->label_finally);
+            emit_op(s, OP_drop);
+        }
+        top = top->prev;
+    }
+    if (name == JS_ATOM_NULL) {
+        if (is_cont)
+            return js_parse_error(s, "continue must be inside loop");
+        else
+            return js_parse_error(s, "break must be inside loop or switch");
+    } else {
+        return js_parse_error(s, "break/continue label not found");
+    }
+}
+
+/* execute the finally blocks before return */
+static void emit_return(JSParseState *s, BOOL hasval)
+{
+    BlockEnv *top;
+    int drop_count;
+
+    drop_count = 0;
+    top = s->cur_func->top_break;
+    while (top != NULL) {
+        /* XXX: emit the appropriate OP_leave_scope opcodes? Probably not
+           required as all local variables will be closed upon returning
+           from JS_CallInternal, but not in the same order. */
+        if (top->has_iterator) {
+            /* with 'yield', the exact number of OP_drop to emit is
+               unknown, so we use a specific operation to look for
+               the catch offset */
+            if (!hasval) {
+                emit_op(s, OP_undefined);
+                hasval = TRUE;
+            }
+            emit_op(s, OP_iterator_close_return);
+            if (s->cur_func->func_kind == JS_FUNC_ASYNC_GENERATOR) {
+                int label_next;
+                emit_op(s, OP_async_iterator_close);
+                label_next = emit_goto(s, OP_if_true, -1);
+                emit_op(s, OP_await);
+                emit_label(s, label_next);
+                emit_op(s, OP_drop);
+            } else {
+                emit_op(s, OP_iterator_close);
+            }
+            drop_count = -3;
+        }
+        drop_count += top->drop_count;
+        if (top->label_finally != -1) {
+            while(drop_count) {
+                /* must keep the stack top if hasval */
+                emit_op(s, hasval ? OP_nip : OP_drop);
+                drop_count--;
+            }
+            if (!hasval) {
+                /* must push return value to keep same stack size */
+                emit_op(s, OP_undefined);
+                hasval = TRUE;
+            }
+            emit_goto(s, OP_gosub, top->label_finally);
+        }
+        top = top->prev;
+    }
+    if (s->cur_func->is_derived_class_constructor) {
+        int label_return;
+
+        /* 'this' can be uninitialized, so it may be accessed only if
+           the derived class constructor does not return an object */
+        if (hasval) {
+            emit_op(s, OP_check_ctor_return);
+            label_return = emit_goto(s, OP_if_false, -1);
+            emit_op(s, OP_drop);
+        } else {
+            label_return = -1;
+        }
+
+        emit_op(s, OP_scope_get_var);
+        emit_atom(s, JS_ATOM_this);
+        emit_u16(s, 0);
+
+        emit_label(s, label_return);
+        emit_op(s, OP_return);
+    } else if (s->cur_func->func_kind != JS_FUNC_NORMAL) {
+        if (!hasval)
+            emit_op(s, OP_undefined);
+        emit_op(s, OP_return_async);
+    } else {
+        emit_op(s, hasval ? OP_return : OP_return_undef);
+    }
+}
+
+#define DECL_MASK_FUNC  (1 << 0) /* allow normal function declaration */
+#define DECL_MASK_LABEL (1 << 1) /* allow labelled statement */
+#define DECL_MASK_OTHER (1 << 2) /* all other declarations */
+#define DECL_MASK_ALL   (DECL_MASK_FUNC | DECL_MASK_LABEL | DECL_MASK_OTHER)
+
+static __exception int js_parse_statement_or_decl(JSParseState *s,
+                                                  int decl_mask);
+
+static __exception int js_parse_statement(JSParseState *s)
+{
+    return js_parse_statement_or_decl(s, 0);
+}
+
+static __exception int js_parse_block(JSParseState *s)
+{
+    if (js_parse_expect(s, '{'))
+        return -1;
+    if (s->token.val != '}') {
+        push_scope(s);
+        for(;;) {
+            if (js_parse_statement_or_decl(s, DECL_MASK_ALL))
+                return -1;
+            if (s->token.val == '}')
+                break;
+        }
+        pop_scope(s);
+    }
+    if (next_token(s))
+        return -1;
+    return 0;
+}
+
+static __exception int js_parse_var(JSParseState *s, BOOL in_accepted, int tok,
+                                    BOOL export_flag)
+{
+    JSContext *ctx = s->ctx;
+    JSFunctionDef *fd = s->cur_func;
+    JSAtom name = JS_ATOM_NULL;
+
+    for (;;) {
+        if (s->token.val == TOK_IDENT) {
+            if (s->token.u.ident.is_reserved) {
+                return js_parse_error_reserved_identifier(s);
+            }
+            name = JS_DupAtom(ctx, s->token.u.ident.atom);
+            if (name == JS_ATOM_let && (tok == TOK_LET || tok == TOK_CONST)) {
+                js_parse_error(s, "'let' is not a valid lexical identifier");
+                goto var_error;
+            }
+            if (next_token(s))
+                goto var_error;
+            if (js_define_var(s, name, tok))
+                goto var_error;
+            if (export_flag) {
+                if (!add_export_entry(s, s->cur_func->module, name, name,
+                                      JS_EXPORT_TYPE_LOCAL))
+                    goto var_error;
+            }
+
+            if (s->token.val == '=') {
+                if (next_token(s))
+                    goto var_error;
+                if (tok == TOK_VAR) {
+                    /* Must make a reference for proper `with` semantics */
+                    int opcode, scope, label;
+                    JSAtom name1;
+
+                    emit_op(s, OP_scope_get_var);
+                    emit_atom(s, name);
+                    emit_u16(s, fd->scope_level);
+                    if (get_lvalue(s, &opcode, &scope, &name1, &label, NULL, FALSE, '=') < 0)
+                        goto var_error;
+                    if (js_parse_assign_expr(s, in_accepted)) {
+                        JS_FreeAtom(ctx, name1);
+                        goto var_error;
+                    }
+                    set_object_name(s, name);
+                    put_lvalue(s, opcode, scope, name1, label, FALSE);
+                    emit_op(s, OP_drop);
+                } else {
+                    if (js_parse_assign_expr(s, in_accepted))
+                        goto var_error;
+                    set_object_name(s, name);
+                    emit_op(s, (tok == TOK_CONST || tok == TOK_LET) ?
+                        OP_scope_put_var_init : OP_scope_put_var);
+                    emit_atom(s, name);
+                    emit_u16(s, fd->scope_level);
+                }
+            } else {
+                if (tok == TOK_CONST) {
+                    js_parse_error(s, "missing initializer for const variable");
+                    goto var_error;
+                }
+                if (tok == TOK_LET) {
+                    /* initialize lexical variable upon entering its scope */
+                    emit_op(s, OP_undefined);
+                    emit_op(s, OP_scope_put_var_init);
+                    emit_atom(s, name);
+                    emit_u16(s, fd->scope_level);
+                }
+            }
+            JS_FreeAtom(ctx, name);
+        } else {
+            int skip_bits;
+            if ((s->token.val == '[' || s->token.val == '{')
+            &&  js_parse_skip_parens_token(s, &skip_bits, FALSE) == '=') {
+                emit_op(s, OP_undefined);
+                if (js_parse_destructing_element(s, tok, 0, TRUE, skip_bits & SKIP_HAS_ELLIPSIS))
+                    return -1;
+            } else {
+                return js_parse_error(s, "variable name expected");
+            }
+        }
+        if (s->token.val != ',')
+            break;
+        if (next_token(s))
+            return -1;
+    }
+    return 0;
+
+ var_error:
+    JS_FreeAtom(ctx, name);
+    return -1;
+}
+
+/* test if the current token is a label. Use simplistic look-ahead scanner */
+static BOOL is_label(JSParseState *s)
+{
+    return (s->token.val == TOK_IDENT && !s->token.u.ident.is_reserved &&
+            peek_token(s, FALSE) == ':');
+}
+
+/* test if the current token is a let keyword. Use simplistic look-ahead scanner */
+static int is_let(JSParseState *s, int decl_mask)
+{
+    int res = FALSE;
+
+    if (token_is_pseudo_keyword(s, JS_ATOM_let)) {
+#if 1
+        JSParsePos pos;
+        js_parse_get_pos(s, &pos);
+        for (;;) {
+            if (next_token(s)) {
+                res = -1;
+                break;
+            }
+            if (s->token.val == '[') {
+                /* let [ is a syntax restriction:
+                   it never introduces an ExpressionStatement */
+                res = TRUE;
+                break;
+            }
+            if (s->token.val == '{' ||
+                (s->token.val == TOK_IDENT && !s->token.u.ident.is_reserved) ||
+                s->token.val == TOK_LET ||
+                s->token.val == TOK_YIELD ||
+                s->token.val == TOK_AWAIT) {
+                /* Check for possible ASI if not scanning for Declaration */
+                /* XXX: should also check that `{` introduces a BindingPattern,
+                   but Firefox does not and rejects eval("let=1;let\n{if(1)2;}") */
+                if (s->last_line_num == s->token.line_num || (decl_mask & DECL_MASK_OTHER)) {
+                    res = TRUE;
+                    break;
+                }
+                break;
+            }
+            break;
+        }
+        if (js_parse_seek_token(s, &pos)) {
+            res = -1;
+        }
+#else
+        int tok = peek_token(s, TRUE);
+        if (tok == '{' || tok == TOK_IDENT || peek_token(s, FALSE) == '[') {
+            res = TRUE;
+        }
+#endif
+    }
+    return res;
+}
+
+/* XXX: handle IteratorClose when exiting the loop before the
+   enumeration is done */
+static __exception int js_parse_for_in_of(JSParseState *s, int label_name,
+                                          BOOL is_async)
+{
+    JSContext *ctx = s->ctx;
+    JSFunctionDef *fd = s->cur_func;
+    JSAtom var_name;
+    BOOL has_initializer, is_for_of;
+    int tok, tok1, opcode, scope, block_scope_level;
+    int label_next, label_expr, label_cont, label_body, label_break;
+    int pos_next, pos_expr;
+    BlockEnv break_entry;
+
+    has_initializer = FALSE;
+    is_for_of = FALSE;
+    block_scope_level = fd->scope_level;
+    label_cont = new_label(s);
+    label_body = new_label(s);
+    label_break = new_label(s);
+    label_next = new_label(s);
+
+    /* create scope for the lexical variables declared in the enumeration
+       expressions. XXX: Not completely correct because of weird capturing
+       semantics in `for (i of o) a.push(function(){return i})` */
+    push_scope(s);
+
+    /* local for_in scope starts here so individual elements
+       can be closed in statement. */
+    push_break_entry(s->cur_func, &break_entry,
+                     label_name, label_break, label_cont, 1);
+    break_entry.scope_level = block_scope_level;
+
+    label_expr = emit_goto(s, OP_goto, -1);
+
+    pos_next = s->cur_func->byte_code.size;
+    emit_label(s, label_next);
+
+    tok = s->token.val;
+    switch (is_let(s, DECL_MASK_OTHER)) {
+    case TRUE:
+        tok = TOK_LET;
+        break;
+    case FALSE:
+        break;
+    default:
+        return -1;
+    }
+    if (tok == TOK_VAR || tok == TOK_LET || tok == TOK_CONST) {
+        if (next_token(s))
+            return -1;
+
+        if (!(s->token.val == TOK_IDENT && !s->token.u.ident.is_reserved)) {
+            if (s->token.val == '[' || s->token.val == '{') {
+                if (js_parse_destructing_element(s, tok, 0, TRUE, -1))
+                    return -1;
+            } else {
+                return js_parse_error(s, "variable name expected");
+            }
+            var_name = JS_ATOM_NULL;
+        } else {
+            var_name = JS_DupAtom(ctx, s->token.u.ident.atom);
+            if (next_token(s)) {
+                JS_FreeAtom(s->ctx, var_name);
+                return -1;
+            }
+            /* Note: if there is a '=' after, it cannot be a for-of. */
+            if (tok == TOK_VAR && token_is_pseudo_keyword(s, JS_ATOM_of))
+                tok = TOK_FOR;
+            if (js_define_var(s, var_name, tok)) {
+                JS_FreeAtom(s->ctx, var_name);
+                return -1;
+            }
+            emit_op(s, (tok == TOK_CONST || tok == TOK_LET) ?
+                    OP_scope_put_var_init : OP_scope_put_var);
+            emit_atom(s, var_name);
+            emit_u16(s, fd->scope_level);
+        }
+    } else {
+        int skip_bits;
+        if ((s->token.val == '[' || s->token.val == '{')
+        &&  ((tok1 = js_parse_skip_parens_token(s, &skip_bits, FALSE)) == TOK_IN || tok1 == TOK_OF)) {
+            if (js_parse_destructing_element(s, 0, 0, TRUE, skip_bits & SKIP_HAS_ELLIPSIS))
+                return -1;
+        } else {
+            int lvalue_label;
+            if (js_parse_postfix_expr(s, TRUE))
+                return -1;
+            if (get_lvalue(s, &opcode, &scope, &var_name, &lvalue_label, NULL, FALSE, TOK_FOR))
+                return -1;
+            /* swap value and lvalue object and store it into lvalue object */
+            /* cannot use put_lvalue() */
+            switch(opcode) {
+            case OP_get_field:
+                /* enum_rec val obj -- enum_rec */
+                emit_op(s, OP_swap);
+                emit_op(s, OP_put_field);
+                emit_u32(s, var_name);  /* has refcount */
+                break;
+            case OP_get_array_el:
+                /* enum_rec val obj prop -- enum_rec obj prop val */
+                emit_op(s, OP_rot3l);
+                /* enum_obj obj prop val -- enum_obj */
+                emit_op(s, OP_put_array_el);
+                break;
+            case OP_get_ref_value:
+                JS_FreeAtom(s->ctx, var_name);
+                emit_label(s, lvalue_label);
+                /* enum_rec val obj prop -- enum_rec obj prop val */
+                emit_op(s, OP_rot3l);
+                emit_op(s, OP_put_ref_value);
+                break;
+            case OP_get_super_value:
+                /* enum_rec val this obj prop -- enum_rec this obj prop val */
+                emit_op(s, OP_rot4l);
+                emit_op(s, OP_put_super_value);
+                break;
+            default:
+                abort();
+            }
+        }
+        var_name = JS_ATOM_NULL;
+    }
+    emit_goto(s, OP_goto, label_body);
+
+    pos_expr = s->cur_func->byte_code.size;
+    emit_label(s, label_expr);
+    if (s->token.val == '=') {
+        /* XXX: potential scoping issue if inside `with` statement */
+        has_initializer = TRUE;
+        /* parse and evaluate initializer prior to evaluating the
+           object (only used with "for in" with a non lexical variable
+           in non strict mode */
+        if (next_token(s) || js_parse_assign_expr(s, FALSE)) {
+            JS_FreeAtom(ctx, var_name);
+            return -1;
+        }
+        if (var_name != JS_ATOM_NULL) {
+            emit_op(s, OP_scope_put_var);
+            emit_atom(s, var_name);
+            emit_u16(s, fd->scope_level);
+        }
+    }
+    JS_FreeAtom(ctx, var_name);
+
+    if (token_is_pseudo_keyword(s, JS_ATOM_of)) {
+        break_entry.has_iterator = is_for_of = TRUE;
+        break_entry.drop_count += 2;
+        if (has_initializer)
+            goto initializer_error;
+    } else if (s->token.val == TOK_IN) {
+        if (is_async)
+            return js_parse_error(s, "'for await' loop should be used with 'of'");
+        if (has_initializer &&
+            (tok != TOK_VAR || (fd->js_mode & JS_MODE_STRICT))) {
+        initializer_error:
+            return js_parse_error(s, "a declaration in the head of a for-%s loop can't have an initializer",
+                                  is_for_of ? "of" : "in");
+        }
+    } else {
+        return js_parse_error(s, "expected 'of' or 'in' in for control expression");
+    }
+    if (next_token(s))
+        return -1;
+    if (is_for_of) {
+        if (js_parse_assign_expr(s, TRUE))
+            return -1;
+    } else {
+        if (js_parse_expr(s))
+            return -1;
+    }
+    /* close the scope after having evaluated the expression so that
+       the TDZ values are in the closures */
+    close_scopes(s, s->cur_func->scope_level, block_scope_level);
+    if (is_for_of) {
+        if (is_async)
+            emit_op(s, OP_for_await_of_start);
+        else
+            emit_op(s, OP_for_of_start);
+        /* on stack: enum_rec */
+    } else {
+        emit_op(s, OP_for_in_start);
+        /* on stack: enum_obj */
+    }
+    emit_goto(s, OP_goto, label_cont);
+
+    if (js_parse_expect(s, ')'))
+        return -1;
+
+    if (OPTIMIZE) {
+        /* move the `next` code here */
+        DynBuf *bc = &s->cur_func->byte_code;
+        int chunk_size = pos_expr - pos_next;
+        int offset = bc->size - pos_next;
+        int i;
+        dbuf_realloc(bc, bc->size + chunk_size);
+        dbuf_put(bc, bc->buf + pos_next, chunk_size);
+        memset(bc->buf + pos_next, OP_nop, chunk_size);
+        /* `next` part ends with a goto */
+        s->cur_func->last_opcode_pos = bc->size - 5;
+        /* relocate labels */
+        for (i = label_cont; i < s->cur_func->label_count; i++) {
+            LabelSlot *ls = &s->cur_func->label_slots[i];
+            if (ls->pos >= pos_next && ls->pos < pos_expr)
+                ls->pos += offset;
+        }
+    }
+
+    emit_label(s, label_body);
+    if (js_parse_statement(s))
+        return -1;
+
+    close_scopes(s, s->cur_func->scope_level, block_scope_level);
+
+    emit_label(s, label_cont);
+    if (is_for_of) {
+        if (is_async) {
+            /* call the next method */
+            emit_op(s, OP_for_await_of_next);
+            /* get the result of the promise */
+            emit_op(s, OP_await);
+            /* unwrap the value and done values */
+            emit_op(s, OP_iterator_get_value_done);
+        } else {
+            emit_op(s, OP_for_of_next);
+            emit_u8(s, 0);
+        }
+    } else {
+        emit_op(s, OP_for_in_next);
+    }
+    /* on stack: enum_rec / enum_obj value bool */
+    emit_goto(s, OP_if_false, label_next);
+    /* drop the undefined value from for_xx_next */
+    emit_op(s, OP_drop);
+
+    emit_label(s, label_break);
+    if (is_for_of) {
+        /* close and drop enum_rec */
+        emit_op(s, OP_iterator_close);
+    } else {
+        emit_op(s, OP_drop);
+    }
+    pop_break_entry(s->cur_func);
+    pop_scope(s);
+    return 0;
+}
+
+static void set_eval_ret_undefined(JSParseState *s)
+{
+    if (s->cur_func->eval_ret_idx >= 0) {
+        emit_op(s, OP_undefined);
+        emit_op(s, OP_put_loc);
+        emit_u16(s, s->cur_func->eval_ret_idx);
+    }
+}
+
+static __exception int js_parse_statement_or_decl(JSParseState *s,
+                                                  int decl_mask)
+{
+    JSContext *ctx = s->ctx;
+    JSAtom label_name;
+    int tok;
+
+    /* specific label handling */
+    /* XXX: support multiple labels on loop statements */
+    label_name = JS_ATOM_NULL;
+    if (is_label(s)) {
+        BlockEnv *be;
+
+        if (!(decl_mask & DECL_MASK_LABEL)) {
+            js_parse_error(s, "functions can only be labelled inside blocks");
+            goto fail;
+        }
+        label_name = JS_DupAtom(ctx, s->token.u.ident.atom);
+
+        for (be = s->cur_func->top_break; be; be = be->prev) {
+            if (be->label_name == label_name) {
+                js_parse_error(s, "duplicate label name");
+                goto fail;
+            }
+        }
+
+        if (next_token(s))
+            goto fail;
+        if (js_parse_expect(s, ':'))
+            goto fail;
+        if (s->token.val != TOK_FOR
+        &&  s->token.val != TOK_DO
+        &&  s->token.val != TOK_WHILE) {
+            /* labelled regular statement */
+            int label_break, mask;
+            BlockEnv break_entry;
+
+            label_break = new_label(s);
+            push_break_entry(s->cur_func, &break_entry,
+                             label_name, label_break, -1, 0);
+            if (s->cur_func->js_mode & JS_MODE_STRICT)
+                mask = 0;
+            else
+                mask = DECL_MASK_FUNC;
+            mask |= DECL_MASK_LABEL;
+            if (js_parse_statement_or_decl(s, mask))
+                goto fail;
+            emit_label(s, label_break);
+            pop_break_entry(s->cur_func);
+            goto done;
+        }
+    }
+
+    switch(tok = s->token.val) {
+    case '{':
+        if (js_parse_block(s))
+            goto fail;
+        break;
+    case TOK_RETURN:
+        if (s->cur_func->is_eval) {
+            js_parse_error(s, "return not in a function");
+            goto fail;
+        }
+        if (next_token(s))
+            goto fail;
+        if (s->token.val != ';' && s->token.val != '}' && !s->got_lf) {
+            if (js_parse_expr(s))
+                goto fail;
+            emit_return(s, TRUE);
+        } else {
+            emit_return(s, FALSE);
+        }
+        if (js_parse_expect_semi(s))
+            goto fail;
+        break;
+    case TOK_THROW:
+        if (next_token(s))
+            goto fail;
+        if (s->got_lf) {
+            js_parse_error(s, "line terminator not allowed after throw");
+            goto fail;
+        }
+        if (js_parse_expr(s))
+            goto fail;
+        emit_op(s, OP_throw);
+        if (js_parse_expect_semi(s))
+            goto fail;
+        break;
+    case TOK_LET:
+    case TOK_CONST:
+    haslet:
+        if (!(decl_mask & DECL_MASK_OTHER)) {
+            js_parse_error(s, "lexical declarations can't appear in single-statement context");
+            goto fail;
+        }
+        /* fall thru */
+    case TOK_VAR:
+        if (next_token(s))
+            goto fail;
+        if (js_parse_var(s, TRUE, tok, FALSE))
+            goto fail;
+        if (js_parse_expect_semi(s))
+            goto fail;
+        break;
+    case TOK_IF:
+        {
+            int label1, label2, mask;
+            if (next_token(s))
+                goto fail;
+            /* create a new scope for `let f;if(1) function f(){}` */
+            push_scope(s);
+            set_eval_ret_undefined(s);
+            if (js_parse_expr_paren(s))
+                goto fail;
+            label1 = emit_goto(s, OP_if_false, -1);
+            if (s->cur_func->js_mode & JS_MODE_STRICT)
+                mask = 0;
+            else
+                mask = DECL_MASK_FUNC; /* Annex B.3.4 */
+
+            if (js_parse_statement_or_decl(s, mask))
+                goto fail;
+
+            if (s->token.val == TOK_ELSE) {
+                label2 = emit_goto(s, OP_goto, -1);
+                if (next_token(s))
+                    goto fail;
+
+                emit_label(s, label1);
+                if (js_parse_statement_or_decl(s, mask))
+                    goto fail;
+
+                label1 = label2;
+            }
+            emit_label(s, label1);
+            pop_scope(s);
+        }
+        break;
+    case TOK_WHILE:
+        {
+            int label_cont, label_break;
+            BlockEnv break_entry;
+
+            label_cont = new_label(s);
+            label_break = new_label(s);
+
+            push_break_entry(s->cur_func, &break_entry,
+                             label_name, label_break, label_cont, 0);
+
+            if (next_token(s))
+                goto fail;
+
+            set_eval_ret_undefined(s);
+
+            emit_label(s, label_cont);
+            if (js_parse_expr_paren(s))
+                goto fail;
+            emit_goto(s, OP_if_false, label_break);
+
+            if (js_parse_statement(s))
+                goto fail;
+            emit_goto(s, OP_goto, label_cont);
+
+            emit_label(s, label_break);
+
+            pop_break_entry(s->cur_func);
+        }
+        break;
+    case TOK_DO:
+        {
+            int label_cont, label_break, label1;
+            BlockEnv break_entry;
+
+            label_cont = new_label(s);
+            label_break = new_label(s);
+            label1 = new_label(s);
+
+            push_break_entry(s->cur_func, &break_entry,
+                             label_name, label_break, label_cont, 0);
+
+            if (next_token(s))
+                goto fail;
+
+            emit_label(s, label1);
+
+            set_eval_ret_undefined(s);
+
+            if (js_parse_statement(s))
+                goto fail;
+
+            emit_label(s, label_cont);
+            if (js_parse_expect(s, TOK_WHILE))
+                goto fail;
+            if (js_parse_expr_paren(s))
+                goto fail;
+            /* Insert semicolon if missing */
+            if (s->token.val == ';') {
+                if (next_token(s))
+                    goto fail;
+            }
+            emit_goto(s, OP_if_true, label1);
+
+            emit_label(s, label_break);
+
+            pop_break_entry(s->cur_func);
+        }
+        break;
+    case TOK_FOR:
+        {
+            int label_cont, label_break, label_body, label_test;
+            int pos_cont, pos_body, block_scope_level;
+            BlockEnv break_entry;
+            int tok, bits;
+            BOOL is_async;
+
+            if (next_token(s))
+                goto fail;
+
+            set_eval_ret_undefined(s);
+            bits = 0;
+            is_async = FALSE;
+            if (s->token.val == '(') {
+                js_parse_skip_parens_token(s, &bits, FALSE);
+            } else if (s->token.val == TOK_AWAIT) {
+                if (!(s->cur_func->func_kind & JS_FUNC_ASYNC)) {
+                    js_parse_error(s, "for await is only valid in asynchronous functions");
+                    goto fail;
+                }
+                is_async = TRUE;
+                if (next_token(s))
+                    goto fail;
+            }
+            if (js_parse_expect(s, '('))
+                goto fail;
+
+            if (!(bits & SKIP_HAS_SEMI)) {
+                /* parse for/in or for/of */
+                if (js_parse_for_in_of(s, label_name, is_async))
+                    goto fail;
+                break;
+            }
+            block_scope_level = s->cur_func->scope_level;
+
+            /* create scope for the lexical variables declared in the initial,
+               test and increment expressions */
+            push_scope(s);
+            /* initial expression */
+            tok = s->token.val;
+            if (tok != ';') {
+                switch (is_let(s, DECL_MASK_OTHER)) {
+                case TRUE:
+                    tok = TOK_LET;
+                    break;
+                case FALSE:
+                    break;
+                default:
+                    goto fail;
+                }
+                if (tok == TOK_VAR || tok == TOK_LET || tok == TOK_CONST) {
+                    if (next_token(s))
+                        goto fail;
+                    if (js_parse_var(s, FALSE, tok, FALSE))
+                        goto fail;
+                } else {
+                    if (js_parse_expr2(s, FALSE))
+                        goto fail;
+                    emit_op(s, OP_drop);
+                }
+
+                /* close the closures before the first iteration */
+                close_scopes(s, s->cur_func->scope_level, block_scope_level);
+            }
+            if (js_parse_expect(s, ';'))
+                goto fail;
+
+            label_test = new_label(s);
+            label_cont = new_label(s);
+            label_body = new_label(s);
+            label_break = new_label(s);
+
+            push_break_entry(s->cur_func, &break_entry,
+                             label_name, label_break, label_cont, 0);
+
+            /* test expression */
+            if (s->token.val == ';') {
+                /* no test expression */
+                label_test = label_body;
+            } else {
+                emit_label(s, label_test);
+                if (js_parse_expr(s))
+                    goto fail;
+                emit_goto(s, OP_if_false, label_break);
+            }
+            if (js_parse_expect(s, ';'))
+                goto fail;
+
+            if (s->token.val == ')') {
+                /* no end expression */
+                break_entry.label_cont = label_cont = label_test;
+                pos_cont = 0; /* avoid warning */
+            } else {
+                /* skip the end expression */
+                emit_goto(s, OP_goto, label_body);
+
+                pos_cont = s->cur_func->byte_code.size;
+                emit_label(s, label_cont);
+                if (js_parse_expr(s))
+                    goto fail;
+                emit_op(s, OP_drop);
+                if (label_test != label_body)
+                    emit_goto(s, OP_goto, label_test);
+            }
+            if (js_parse_expect(s, ')'))
+                goto fail;
+
+            pos_body = s->cur_func->byte_code.size;
+            emit_label(s, label_body);
+            if (js_parse_statement(s))
+                goto fail;
+
+            /* close the closures before the next iteration */
+            /* XXX: check continue case */
+            close_scopes(s, s->cur_func->scope_level, block_scope_level);
+
+            if (OPTIMIZE && label_test != label_body && label_cont != label_test) {
+                /* move the increment code here */
+                DynBuf *bc = &s->cur_func->byte_code;
+                int chunk_size = pos_body - pos_cont;
+                int offset = bc->size - pos_cont;
+                int i;
+                dbuf_realloc(bc, bc->size + chunk_size);
+                dbuf_put(bc, bc->buf + pos_cont, chunk_size);
+                memset(bc->buf + pos_cont, OP_nop, chunk_size);
+                /* increment part ends with a goto */
+                s->cur_func->last_opcode_pos = bc->size - 5;
+                /* relocate labels */
+                for (i = label_cont; i < s->cur_func->label_count; i++) {
+                    LabelSlot *ls = &s->cur_func->label_slots[i];
+                    if (ls->pos >= pos_cont && ls->pos < pos_body)
+                        ls->pos += offset;
+                }
+            } else {
+                emit_goto(s, OP_goto, label_cont);
+            }
+
+            emit_label(s, label_break);
+
+            pop_break_entry(s->cur_func);
+            pop_scope(s);
+        }
+        break;
+    case TOK_BREAK:
+    case TOK_CONTINUE:
+        {
+            int is_cont = s->token.val - TOK_BREAK;
+            int label;
+
+            if (next_token(s))
+                goto fail;
+            if (!s->got_lf && s->token.val == TOK_IDENT && !s->token.u.ident.is_reserved)
+                label = s->token.u.ident.atom;
+            else
+                label = JS_ATOM_NULL;
+            if (emit_break(s, label, is_cont))
+                goto fail;
+            if (label != JS_ATOM_NULL) {
+                if (next_token(s))
+                    goto fail;
+            }
+            if (js_parse_expect_semi(s))
+                goto fail;
+        }
+        break;
+    case TOK_SWITCH:
+        {
+            int label_case, label_break, label1;
+            int default_label_pos;
+            BlockEnv break_entry;
+
+            if (next_token(s))
+                goto fail;
+
+            set_eval_ret_undefined(s);
+            if (js_parse_expr_paren(s))
+                goto fail;
+
+            push_scope(s);
+            label_break = new_label(s);
+            push_break_entry(s->cur_func, &break_entry,
+                             label_name, label_break, -1, 1);
+
+            if (js_parse_expect(s, '{'))
+                goto fail;
+
+            default_label_pos = -1;
+            label_case = -1;
+            while (s->token.val != '}') {
+                if (s->token.val == TOK_CASE) {
+                    label1 = -1;
+                    if (label_case >= 0) {
+                        /* skip the case if needed */
+                        label1 = emit_goto(s, OP_goto, -1);
+                    }
+                    emit_label(s, label_case);
+                    label_case = -1;
+                    for (;;) {
+                        /* parse a sequence of case clauses */
+                        if (next_token(s))
+                            goto fail;
+                        emit_op(s, OP_dup);
+                        if (js_parse_expr(s))
+                            goto fail;
+                        if (js_parse_expect(s, ':'))
+                            goto fail;
+                        emit_op(s, OP_strict_eq);
+                        if (s->token.val == TOK_CASE) {
+                            label1 = emit_goto(s, OP_if_true, label1);
+                        } else {
+                            label_case = emit_goto(s, OP_if_false, -1);
+                            emit_label(s, label1);
+                            break;
+                        }
+                    }
+                } else if (s->token.val == TOK_DEFAULT) {
+                    if (next_token(s))
+                        goto fail;
+                    if (js_parse_expect(s, ':'))
+                        goto fail;
+                    if (default_label_pos >= 0) {
+                        js_parse_error(s, "duplicate default");
+                        goto fail;
+                    }
+                    if (label_case < 0) {
+                        /* falling thru direct from switch expression */
+                        label_case = emit_goto(s, OP_goto, -1);
+                    }
+                    /* Emit a dummy label opcode. Label will be patched after
+                       the end of the switch body. Do not use emit_label(s, 0)
+                       because it would clobber label 0 address, preventing
+                       proper optimizer operation.
+                     */
+                    emit_op(s, OP_label);
+                    emit_u32(s, 0);
+                    default_label_pos = s->cur_func->byte_code.size - 4;
+                } else {
+                    if (label_case < 0) {
+                        /* falling thru direct from switch expression */
+                        js_parse_error(s, "invalid switch statement");
+                        goto fail;
+                    }
+                    if (js_parse_statement_or_decl(s, DECL_MASK_ALL))
+                        goto fail;
+                }
+            }
+            if (js_parse_expect(s, '}'))
+                goto fail;
+            if (default_label_pos >= 0) {
+                /* Ugly patch for the the `default` label, shameful and risky */
+                put_u32(s->cur_func->byte_code.buf + default_label_pos,
+                        label_case);
+                s->cur_func->label_slots[label_case].pos = default_label_pos + 4;
+            } else {
+                emit_label(s, label_case);
+            }
+            emit_label(s, label_break);
+            emit_op(s, OP_drop); /* drop the switch expression */
+
+            pop_break_entry(s->cur_func);
+            pop_scope(s);
+        }
+        break;
+    case TOK_TRY:
+        {
+            int label_catch, label_catch2, label_finally, label_end;
+            JSAtom name;
+            BlockEnv block_env;
+
+            set_eval_ret_undefined(s);
+            if (next_token(s))
+                goto fail;
+            label_catch = new_label(s);
+            label_catch2 = new_label(s);
+            label_finally = new_label(s);
+            label_end = new_label(s);
+
+            emit_goto(s, OP_catch, label_catch);
+
+            push_break_entry(s->cur_func, &block_env,
+                             JS_ATOM_NULL, -1, -1, 1);
+            block_env.label_finally = label_finally;
+
+            if (js_parse_block(s))
+                goto fail;
+
+            pop_break_entry(s->cur_func);
+
+            if (js_is_live_code(s)) {
+                /* drop the catch offset */
+                emit_op(s, OP_drop);
+                /* must push dummy value to keep same stack size */
+                emit_op(s, OP_undefined);
+                emit_goto(s, OP_gosub, label_finally);
+                emit_op(s, OP_drop);
+
+                emit_goto(s, OP_goto, label_end);
+            }
+
+            if (s->token.val == TOK_CATCH) {
+                if (next_token(s))
+                    goto fail;
+
+                push_scope(s);  /* catch variable */
+                emit_label(s, label_catch);
+
+                if (s->token.val == '{') {
+                    /* support optional-catch-binding feature */
+                    emit_op(s, OP_drop);    /* pop the exception object */
+                } else {
+                    if (js_parse_expect(s, '('))
+                        goto fail;
+                    if (!(s->token.val == TOK_IDENT && !s->token.u.ident.is_reserved)) {
+                        if (s->token.val == '[' || s->token.val == '{') {
+                            /* XXX: TOK_LET is not completely correct */
+                            if (js_parse_destructing_element(s, TOK_LET, 0, TRUE, -1))
+                                goto fail;
+                        } else {
+                            js_parse_error(s, "identifier expected");
+                            goto fail;
+                        }
+                    } else {
+                        name = JS_DupAtom(ctx, s->token.u.ident.atom);
+                        if (next_token(s)
+                        ||  js_define_var(s, name, TOK_CATCH) < 0) {
+                            JS_FreeAtom(ctx, name);
+                            goto fail;
+                        }
+                        /* store the exception value in the catch variable */
+                        emit_op(s, OP_scope_put_var);
+                        emit_u32(s, name);
+                        emit_u16(s, s->cur_func->scope_level);
+                    }
+                    if (js_parse_expect(s, ')'))
+                        goto fail;
+                }
+                /* XXX: should keep the address to nop it out if there is no finally block */
+                emit_goto(s, OP_catch, label_catch2);
+
+                push_scope(s);  /* catch block */
+                push_break_entry(s->cur_func, &block_env, JS_ATOM_NULL,
+                                 -1, -1, 1);
+                block_env.label_finally = label_finally;
+
+                if (js_parse_block(s))
+                    goto fail;
+
+                pop_break_entry(s->cur_func);
+                pop_scope(s);  /* catch block */
+                pop_scope(s);  /* catch variable */
+
+                if (js_is_live_code(s)) {
+                    /* drop the catch2 offset */
+                    emit_op(s, OP_drop);
+                    /* XXX: should keep the address to nop it out if there is no finally block */
+                    /* must push dummy value to keep same stack size */
+                    emit_op(s, OP_undefined);
+                    emit_goto(s, OP_gosub, label_finally);
+                    emit_op(s, OP_drop);
+                    emit_goto(s, OP_goto, label_end);
+                }
+                /* catch exceptions thrown in the catch block to execute the
+                 * finally clause and rethrow the exception */
+                emit_label(s, label_catch2);
+                /* catch value is at TOS, no need to push undefined */
+                emit_goto(s, OP_gosub, label_finally);
+                emit_op(s, OP_throw);
+
+            } else if (s->token.val == TOK_FINALLY) {
+                /* finally without catch : execute the finally clause
+                 * and rethrow the exception */
+                emit_label(s, label_catch);
+                /* catch value is at TOS, no need to push undefined */
+                emit_goto(s, OP_gosub, label_finally);
+                emit_op(s, OP_throw);
+            } else {
+                js_parse_error(s, "expecting catch or finally");
+                goto fail;
+            }
+            emit_label(s, label_finally);
+            if (s->token.val == TOK_FINALLY) {
+                int saved_eval_ret_idx;
+                if (next_token(s))
+                    goto fail;
+                /* on the stack: ret_value gosub_ret_value */
+                push_break_entry(s->cur_func, &block_env, JS_ATOM_NULL,
+                                 -1, -1, 2);
+                saved_eval_ret_idx = s->cur_func->eval_ret_idx;
+                s->cur_func->eval_ret_idx = -1;
+                /* 'finally' does not update eval_ret */
+                if (js_parse_block(s))
+                    goto fail;
+                s->cur_func->eval_ret_idx = saved_eval_ret_idx;
+                pop_break_entry(s->cur_func);
+            }
+            emit_op(s, OP_ret);
+            emit_label(s, label_end);
+        }
+        break;
+    case ';':
+        /* empty statement */
+        if (next_token(s))
+            goto fail;
+        break;
+    case TOK_WITH:
+        if (s->cur_func->js_mode & JS_MODE_STRICT) {
+            js_parse_error(s, "invalid keyword: with");
+            goto fail;
+        } else {
+            int with_idx;
+
+            if (next_token(s))
+                goto fail;
+
+            if (js_parse_expr_paren(s))
+                goto fail;
+
+            push_scope(s);
+            with_idx = define_var(s, s->cur_func, JS_ATOM__with_, TOK_WITH);
+            if (with_idx < 0)
+                goto fail;
+            emit_op(s, OP_to_object);
+            emit_op(s, OP_put_loc);
+            emit_u16(s, with_idx);
+
+            set_eval_ret_undefined(s);
+            if (js_parse_statement(s))
+                goto fail;
+
+            /* Popping scope drops lexical context for the with object variable */
+            pop_scope(s);
+        }
+        break;
+    case TOK_FUNCTION:
+        /* ES6 Annex B.3.2 and B.3.3 semantics */
+        if (!(decl_mask & DECL_MASK_FUNC))
+            goto func_decl_error;
+        if (!(decl_mask & DECL_MASK_OTHER) && peek_token(s, FALSE) == '*')
+            goto func_decl_error;
+        goto parse_func_var;
+    case TOK_IDENT:
+        if (s->token.u.ident.is_reserved) {
+            js_parse_error_reserved_identifier(s);
+            goto fail;
+        }
+        /* Determine if `let` introduces a Declaration or an ExpressionStatement */
+        switch (is_let(s, decl_mask)) {
+        case TRUE:
+            tok = TOK_LET;
+            goto haslet;
+        case FALSE:
+            break;
+        default:
+            goto fail;
+        }
+        if (token_is_pseudo_keyword(s, JS_ATOM_async) &&
+            peek_token(s, TRUE) == TOK_FUNCTION) {
+            if (!(decl_mask & DECL_MASK_OTHER)) {
+            func_decl_error:
+                js_parse_error(s, "function declarations can't appear in single-statement context");
+                goto fail;
+            }
+        parse_func_var:
+            if (js_parse_function_decl(s, JS_PARSE_FUNC_VAR,
+                                       JS_FUNC_NORMAL, JS_ATOM_NULL,
+                                       s->token.ptr, s->token.line_num))
+                goto fail;
+            break;
+        }
+        goto hasexpr;
+
+    case TOK_CLASS:
+        if (!(decl_mask & DECL_MASK_OTHER)) {
+            js_parse_error(s, "class declarations can't appear in single-statement context");
+            goto fail;
+        }
+        if (js_parse_class(s, FALSE, JS_PARSE_EXPORT_NONE))
+            return -1;
+        break;
+
+    case TOK_DEBUGGER:
+    case TOK_ENUM:
+    case TOK_EXPORT:
+    case TOK_EXTENDS:
+    case TOK_IMPORT:
+        js_unsupported_keyword(s, s->token.u.ident.atom);
+        goto fail;
+
+    default:
+    hasexpr:
+        if (js_parse_expr(s))
+            goto fail;
+        if (s->cur_func->eval_ret_idx >= 0) {
+            /* store the expression value so that it can be returned
+               by eval() */
+            emit_op(s, OP_put_loc);
+            emit_u16(s, s->cur_func->eval_ret_idx);
+        } else {
+            emit_op(s, OP_drop); /* drop the result */
+        }
+        if (js_parse_expect_semi(s))
+            goto fail;
+        break;
+    }
+done:
+    JS_FreeAtom(ctx, label_name);
+    return 0;
+fail:
+    JS_FreeAtom(ctx, label_name);
+    return -1;
+}
+
+/* 'name' is freed */
+static JSModuleDef *js_new_module_def(JSContext *ctx, JSAtom name)
+{
+    JSModuleDef *m;
+    m = js_mallocz(ctx, sizeof(*m));
+    if (!m) {
+        JS_FreeAtom(ctx, name);
+        return NULL;
+    }
+    m->header.ref_count = 1;
+    m->module_name = name;
+    m->module_ns = JS_UNDEFINED;
+    m->func_obj = JS_UNDEFINED;
+    list_add_tail(&m->link, &ctx->loaded_modules);
+    return m;
+}
+
+static void js_free_module_def(JSContext *ctx, JSModuleDef *m)
+{
+    int i;
+
+    JS_FreeAtom(ctx, m->module_name);
+
+    for(i = 0; i < m->req_module_entries_count; i++) {
+        JSReqModuleEntry *rme = &m->req_module_entries[i];
+        JS_FreeAtom(ctx, rme->module_name);
+    }
+    js_free(ctx, m->req_module_entries);
+
+    for(i = 0; i < m->export_entries_count; i++) {
+        JSExportEntry *me = &m->export_entries[i];
+        if (me->export_type == JS_EXPORT_TYPE_LOCAL)
+            free_var_ref(ctx->rt, me->u.local.var_ref);
+        JS_FreeAtom(ctx, me->export_name);
+        JS_FreeAtom(ctx, me->local_name);
+    }
+    js_free(ctx, m->export_entries);
+
+    js_free(ctx, m->star_export_entries);
+
+    for(i = 0; i < m->import_entries_count; i++) {
+        JSImportEntry *mi = &m->import_entries[i];
+        JS_FreeAtom(ctx, mi->import_name);
+    }
+    js_free(ctx, m->import_entries);
+
+    JS_FreeValue(ctx, m->module_ns);
+    JS_FreeValue(ctx, m->func_obj);
+    list_del(&m->link);
+    js_free(ctx, m);
+}
+
+static int js_resize_array(JSContext *ctx, void **parray, int elem_size,
+                           int *psize, int *pcount, int new_count)
+{
+    if (unlikely(new_count > *psize)) {
+        int new_size;
+        size_t slack;
+        void *new_array;
+        /* XXX: potential arithmetic overflow */
+        new_size = max_int(new_count, *psize * 3 / 2);
+        new_array = js_realloc2(ctx, *parray, new_size * elem_size, &slack);
+        if (!new_array)
+            return -1;
+        new_size += slack / elem_size;
+        *psize = new_size;
+        *parray = new_array;
+    }
+    *pcount = new_count;
+    return 0;
+}
+
+static int add_req_module_entry(JSContext *ctx, JSModuleDef *m,
+                                JSAtom module_name)
+{
+    JSReqModuleEntry *rme;
+    int i;
+
+    /* no need to add the module request if it is already present */
+    for(i = 0; i < m->req_module_entries_count; i++) {
+        rme = &m->req_module_entries[i];
+        if (rme->module_name == module_name)
+            return i;
+    }
+
+    if (js_resize_array(ctx, (void **)&m->req_module_entries,
+                        sizeof(JSReqModuleEntry),
+                        &m->req_module_entries_size, &m->req_module_entries_count,
+                        m->req_module_entries_count + 1))
+        return -1;
+    i = m->req_module_entries_count - 1;
+    rme = &m->req_module_entries[i];
+    rme->module_name = JS_DupAtom(ctx, module_name);
+    rme->module = NULL;
+    return i;
+}
+
+static JSExportEntry *find_export_entry(JSContext *ctx, JSModuleDef *m,
+                                        JSAtom export_name)
+{
+    JSExportEntry *me;
+    int i;
+    for(i = 0; i < m->export_entries_count; i++) {
+        me = &m->export_entries[i];
+        if (me->export_name == export_name)
+            return me;
+    }
+    return NULL;
+}
+
+static JSExportEntry *add_export_entry2(JSContext *ctx,
+                                        JSParseState *s, JSModuleDef *m,
+                                       JSAtom local_name, JSAtom export_name,
+                                       JSExportTypeEnum export_type)
+{
+    JSExportEntry *me;
+
+    if (find_export_entry(ctx, m, export_name)) {
+        char buf1[ATOM_GET_STR_BUF_SIZE];
+        if (s) {
+            js_parse_error(s, "duplicate exported name '%s'",
+                           JS_AtomGetStr(ctx, buf1, sizeof(buf1), export_name));
+        } else {
+            JS_ThrowSyntaxError(ctx, "duplicate exported name '%s'",
+                                JS_AtomGetStr(ctx, buf1, sizeof(buf1), export_name));
+        }
+        return NULL;
+    }
+
+    if (js_resize_array(ctx, (void **)&m->export_entries,
+                        sizeof(JSExportEntry),
+                        &m->export_entries_size, &m->export_entries_count,
+                        m->export_entries_count + 1))
+        return NULL;
+    me = &m->export_entries[m->export_entries_count - 1];
+    memset(me, 0, sizeof(*me));
+    me->local_name = JS_DupAtom(ctx, local_name);
+    me->export_name = JS_DupAtom(ctx, export_name);
+    me->export_type = export_type;
+    return me;
+}
+
+static JSExportEntry *add_export_entry(JSParseState *s, JSModuleDef *m,
+                                       JSAtom local_name, JSAtom export_name,
+                                       JSExportTypeEnum export_type)
+{
+    return add_export_entry2(s->ctx, s, m, local_name, export_name,
+                             export_type);
+}
+
+static int add_star_export_entry(JSContext *ctx, JSModuleDef *m,
+                                 int req_module_idx)
+{
+    JSStarExportEntry *se;
+
+    if (js_resize_array(ctx, (void **)&m->star_export_entries,
+                        sizeof(JSStarExportEntry),
+                        &m->star_export_entries_size, &m->star_export_entries_count,
+                        m->star_export_entries_count + 1))
+        return -1;
+    se = &m->star_export_entries[m->star_export_entries_count - 1];
+    se->req_module_idx = req_module_idx;
+    return 0;
+}
+
+/* create a C module */
+JSModuleDef *JS_NewCModule(JSContext *ctx, const char *name_str,
+                           JSModuleInitFunc *func)
+{
+    JSModuleDef *m;
+    JSAtom name;
+    name = JS_NewAtom(ctx, name_str);
+    if (name == JS_ATOM_NULL)
+        return NULL;
+    m = js_new_module_def(ctx, name);
+    m->init_func = func;
+    return m;
+}
+
+int JS_AddModuleExport(JSContext *ctx, JSModuleDef *m, const char *export_name)
+{
+    JSExportEntry *me;
+    JSAtom name;
+    name = JS_NewAtom(ctx, export_name);
+    if (name == JS_ATOM_NULL)
+        return -1;
+    me = add_export_entry2(ctx, NULL, m, JS_ATOM_NULL, name,
+                           JS_EXPORT_TYPE_LOCAL);
+    JS_FreeAtom(ctx, name);
+    if (!me)
+        return -1;
+    else
+        return 0;
+}
+
+int JS_SetModuleExport(JSContext *ctx, JSModuleDef *m, const char *export_name,
+                       JSValue val)
+{
+    JSExportEntry *me;
+    JSAtom name;
+    name = JS_NewAtom(ctx, export_name);
+    if (name == JS_ATOM_NULL)
+        goto fail;
+    me = find_export_entry(ctx, m, name);
+    JS_FreeAtom(ctx, name);
+    if (!me)
+        goto fail;
+    set_value(ctx, me->u.local.var_ref->pvalue, val);
+    return 0;
+ fail:
+    JS_FreeValue(ctx, val);
+    return -1;
+}
+
+void JS_SetModuleLoaderFunc(JSRuntime *rt,
+                            JSModuleNormalizeFunc *module_normalize,
+                            JSModuleLoaderFunc *module_loader, void *opaque)
+{
+    rt->module_normalize_func = module_normalize;
+    rt->module_loader_func = module_loader;
+    rt->module_loader_opaque = opaque;
+}
+
+/* default module filename normalizer */
+static char *js_default_module_normalize_name(JSContext *ctx,
+                                              const char *base_name,
+                                              const char *name)
+{
+    char *filename, *p;
+    const char *r;
+    int len;
+
+    if (name[0] != '.') {
+        /* if no initial dot, the module name is not modified */
+        return js_strdup(ctx, name);
+    }
+
+    p = strrchr(base_name, '/');
+    if (p)
+        len = p - base_name;
+    else
+        len = 0;
+
+    filename = js_malloc(ctx, len + strlen(name) + 1 + 1);
+    if (!filename)
+        return NULL;
+    memcpy(filename, base_name, len);
+    filename[len] = '\0';
+
+    /* we only normalize the leading '..' or '.' */
+    r = name;
+    for(;;) {
+        if (r[0] == '.' && r[1] == '/') {
+            r += 2;
+        } else if (r[0] == '.' && r[1] == '.' && r[2] == '/') {
+            if (filename[0] == '\0')
+                break;
+            p = strrchr(filename, '/');
+            if (!p)
+                p = filename;
+            *p = '\0';
+            r += 3;
+        } else {
+            break;
+        }
+    }
+    if (filename[0] != '\0')
+        strcat(filename, "/");
+    strcat(filename, r);
+    //    printf("normalize: %s %s -> %s\n", base_name, name, filename);
+    return filename;
+}
+
+/* return NULL in case of exception (e.g. module could not be loaded) */
+static JSModuleDef *js_host_resolve_imported_module(JSContext *ctx,
+                                                    JSModuleDef *base_module,
+                                                    JSAtom module_name1)
+{
+    JSRuntime *rt = ctx->rt;
+    struct list_head *el;
+    JSModuleDef *m;
+    char *cname;
+    const char *base_cname, *cname1;
+    JSAtom module_name;
+
+    base_cname = JS_AtomToCString(ctx, base_module->module_name);
+    if (!base_cname)
+        return NULL;
+    cname1 = JS_AtomToCString(ctx, module_name1);
+    if (!cname1) {
+        JS_FreeCString(ctx, base_cname);
+        return NULL;
+    }
+
+    if (!rt->module_normalize_func) {
+        cname = js_default_module_normalize_name(ctx, base_cname, cname1);
+    } else {
+        cname = rt->module_normalize_func(ctx, base_cname, cname1,
+                                          rt->module_loader_opaque);
+    }
+    JS_FreeCString(ctx, base_cname);
+    JS_FreeCString(ctx, cname1);
+    if (!cname)
+        return NULL;
+
+    module_name = JS_NewAtom(ctx, cname);
+    if (module_name == JS_ATOM_NULL) {
+        js_free(ctx, cname);
+        return NULL;
+    }
+
+    /* first look at the loaded modules */
+    list_for_each(el, &ctx->loaded_modules) {
+        m = list_entry(el, JSModuleDef, link);
+        if (m->module_name == module_name) {
+            js_free(ctx, cname);
+            JS_FreeAtom(ctx, module_name);
+            return m;
+        }
+    }
+
+    JS_FreeAtom(ctx, module_name);
+
+    /* load the module */
+    if (!rt->module_loader_func) {
+        /* XXX: use a syntax error ? */
+        JS_ThrowReferenceError(ctx, "could not load module '%s'",
+                               cname);
+        js_free(ctx, cname);
+        return NULL;
+    }
+
+    m = rt->module_loader_func(ctx, cname, rt->module_loader_opaque);
+    js_free(ctx, cname);
+    return m;
+}
+
+typedef struct JSResolveEntry {
+    JSModuleDef *module;
+    JSAtom name;
+} JSResolveEntry;
+
+typedef struct JSResolveState {
+    JSResolveEntry *array;
+    int size;
+    int count;
+} JSResolveState;
+
+static int find_resolve_entry(JSResolveState *s,
+                              JSModuleDef *m, JSAtom name)
+{
+    int i;
+    for(i = 0; i < s->count; i++) {
+        JSResolveEntry *re = &s->array[i];
+        if (re->module == m && re->name == name)
+            return i;
+    }
+    return -1;
+}
+
+static int add_resolve_entry(JSContext *ctx, JSResolveState *s,
+                             JSModuleDef *m, JSAtom name)
+{
+    JSResolveEntry *re;
+
+    if (js_resize_array(ctx, (void **)&s->array,
+                        sizeof(JSResolveEntry),
+                        &s->size, &s->count,
+                        s->count + 1))
+        return -1;
+    re = &s->array[s->count - 1];
+    re->module = m;
+    re->name = JS_DupAtom(ctx, name);
+    return 0;
+}
+
+typedef enum JSResolveResultEnum {
+    JS_RESOLVE_RES_EXCEPTION = -1, /* memory alloc error */
+    JS_RESOLVE_RES_FOUND = 0,
+    JS_RESOLVE_RES_NOT_FOUND,
+    JS_RESOLVE_RES_CIRCULAR,
+    JS_RESOLVE_RES_AMBIGUOUS,
+} JSResolveResultEnum;
+
+static JSResolveResultEnum js_resolve_export1(JSContext *ctx,
+                                              JSModuleDef **pmodule,
+                                              JSExportEntry **pme,
+                                              JSModuleDef *m,
+                                              JSAtom export_name,
+                                              JSResolveState *s)
+{
+    JSExportEntry *me;
+
+    *pmodule = NULL;
+    *pme = NULL;
+    if (find_resolve_entry(s, m, export_name) >= 0)
+        return JS_RESOLVE_RES_CIRCULAR;
+    if (add_resolve_entry(ctx, s, m, export_name) < 0)
+        return JS_RESOLVE_RES_EXCEPTION;
+    me = find_export_entry(ctx, m, export_name);
+    if (me) {
+        if (me->export_type == JS_EXPORT_TYPE_LOCAL) {
+            /* local export */
+            *pmodule = m;
+            *pme = me;
+            return JS_RESOLVE_RES_FOUND;
+        } else {
+            JSModuleDef *m1;
+            m1 = m->req_module_entries[me->u.req_module_idx].module;
+            return js_resolve_export1(ctx, pmodule, pme, m1,
+                                      me->local_name, s);
+        }
+    } else {
+        if (export_name != JS_ATOM_default) {
+            /* not found in direct or indirect exports: try star exports */
+            int i;
+
+            for(i = 0; i < m->star_export_entries_count; i++) {
+                JSStarExportEntry *se = &m->star_export_entries[i];
+                JSModuleDef *m1, *res_m;
+                JSExportEntry *res_me;
+                JSResolveResultEnum ret;
+
+                m1 = m->req_module_entries[se->req_module_idx].module;
+                ret = js_resolve_export1(ctx, &res_m, &res_me, m1,
+                                         export_name, s);
+                if (ret == JS_RESOLVE_RES_AMBIGUOUS ||
+                    ret == JS_RESOLVE_RES_EXCEPTION) {
+                    return ret;
+                } else if (ret == JS_RESOLVE_RES_FOUND) {
+                    if (*pme != NULL) {
+                        if (*pmodule != res_m ||
+                            res_me->local_name != (*pme)->local_name) {
+                            *pmodule = NULL;
+                            *pme = NULL;
+                            return JS_RESOLVE_RES_AMBIGUOUS;
+                        }
+                    } else {
+                        *pmodule = res_m;
+                        *pme = res_me;
+                    }
+                }
+            }
+            if (*pme != NULL)
+                return JS_RESOLVE_RES_FOUND;
+        }
+        return JS_RESOLVE_RES_NOT_FOUND;
+    }
+}
+
+/* If the return value is JS_RESOLVE_RES_FOUND, return the module
+  (*pmodule) and the corresponding local export entry
+  (*pme). Otherwise return (NULL, NULL) */
+static JSResolveResultEnum js_resolve_export(JSContext *ctx,
+                                             JSModuleDef **pmodule,
+                                             JSExportEntry **pme,
+                                             JSModuleDef *m,
+                                             JSAtom export_name)
+{
+    JSResolveState ss, *s = &ss;
+    int i;
+    JSResolveResultEnum ret;
+
+    s->array = NULL;
+    s->size = 0;
+    s->count = 0;
+
+    ret = js_resolve_export1(ctx, pmodule, pme, m, export_name, s);
+
+    for(i = 0; i < s->count; i++)
+        JS_FreeAtom(ctx, s->array[i].name);
+    js_free(ctx, s->array);
+
+    return ret;
+}
+
+static void js_resolve_export_throw_error(JSContext *ctx,
+                                          JSResolveResultEnum res,
+                                          JSModuleDef *m, JSAtom export_name)
+{
+    char buf1[ATOM_GET_STR_BUF_SIZE];
+    char buf2[ATOM_GET_STR_BUF_SIZE];
+    switch(res) {
+    case JS_RESOLVE_RES_EXCEPTION:
+        break;
+    default:
+    case JS_RESOLVE_RES_NOT_FOUND:
+        JS_ThrowSyntaxError(ctx, "export '%s' in module '%s' is ambiguous",
+                            JS_AtomGetStr(ctx, buf1, sizeof(buf1), export_name),
+                            JS_AtomGetStr(ctx, buf2, sizeof(buf2), m->module_name));
+        break;
+    case JS_RESOLVE_RES_CIRCULAR:
+        JS_ThrowSyntaxError(ctx, "Could not find export '%s' in module '%s'",
+                            JS_AtomGetStr(ctx, buf1, sizeof(buf1), export_name),
+                            JS_AtomGetStr(ctx, buf2, sizeof(buf2), m->module_name));
+        break;
+    case JS_RESOLVE_RES_AMBIGUOUS:
+        JS_ThrowSyntaxError(ctx, "circular reference when looking for export '%s' in module '%s'",
+                            JS_AtomGetStr(ctx, buf1, sizeof(buf1), export_name),
+                            JS_AtomGetStr(ctx, buf2, sizeof(buf2), m->module_name));
+        break;
+    }
+}
+
+
+typedef struct ExportedNameEntry {
+    JSAtom export_name;
+    JSExportEntry *me; /* NULL if not coming from the module */
+    JSVarRef *var_ref;
+} ExportedNameEntry;
+
+typedef struct GetExportNamesState {
+    JSModuleDef **modules;
+    int modules_size;
+    int modules_count;
+
+    ExportedNameEntry *exported_names;
+    int exported_names_size;
+    int exported_names_count;
+} GetExportNamesState;
+
+static int find_exported_name(GetExportNamesState *s, JSAtom name)
+{
+    int i;
+    for(i = 0; i < s->exported_names_count; i++) {
+        if (s->exported_names[i].export_name == name)
+            return i;
+    }
+    return -1;
+}
+
+static __exception int get_exported_names(JSContext *ctx,
+                                          GetExportNamesState *s,
+                                          JSModuleDef *m, BOOL from_star)
+{
+    ExportedNameEntry *en;
+    int i, j;
+
+    /* check circular reference */
+    for(i = 0; i < s->modules_count; i++) {
+        if (s->modules[i] == m)
+            return 0;
+    }
+    if (js_resize_array(ctx, (void **)&s->modules, sizeof(s->modules[0]),
+                        &s->modules_size, &s->modules_count, s->modules_count + 1))
+        return -1;
+    s->modules[s->modules_count - 1] = m;
+
+    for(i = 0; i < m->export_entries_count; i++) {
+        JSExportEntry *me = &m->export_entries[i];
+        if (from_star && me->export_name == JS_ATOM_default)
+            continue;
+        j = find_exported_name(s, me->export_name);
+        if (j < 0) {
+            if (js_resize_array(ctx, (void **)&s->exported_names, sizeof(s->exported_names[0]),
+                                &s->exported_names_size, &s->exported_names_count, s->exported_names_count + 1))
+                return -1;
+            en = &s->exported_names[s->exported_names_count - 1];
+            en->export_name = me->export_name;
+            /* avoid a second lookup for simple module exports */
+            if (from_star || me->export_type != JS_EXPORT_TYPE_LOCAL)
+                en->me = NULL;
+            else
+                en->me = me;
+        } else {
+            en = &s->exported_names[j];
+            en->me = NULL;
+        }
+    }
+    for(i = 0; i < m->star_export_entries_count; i++) {
+        JSStarExportEntry *se = &m->star_export_entries[i];
+        JSModuleDef *m1;
+        m1 = m->req_module_entries[se->req_module_idx].module;
+        if (get_exported_names(ctx, s, m1, TRUE))
+            return -1;
+    }
+    return 0;
+}
+
+/* Unfortunately, the spec gives a different behavior from GetOwnProperty ! */
+static int js_module_ns_has(JSContext *ctx, JSValueConst obj, JSAtom atom)
+{
+    return (find_own_property1(JS_VALUE_GET_OBJ(obj), atom) != NULL);
+}
+
+static const JSClassExoticMethods js_module_ns_exotic_methods = {
+    .has_property = js_module_ns_has,
+};
+
+static int exported_names_cmp(const void *p1, const void *p2, void *opaque)
+{
+    JSContext *ctx = opaque;
+    const ExportedNameEntry *me1 = p1;
+    const ExportedNameEntry *me2 = p2;
+    JSValue str1, str2;
+    int ret;
+
+    /* XXX: should avoid allocation memory in atom comparison */
+    str1 = JS_AtomToString(ctx, me1->export_name);
+    str2 = JS_AtomToString(ctx, me2->export_name);
+    if (JS_IsException(str1) || JS_IsException(str2)) {
+        /* XXX: raise an error ? */
+        ret = 0;
+    } else {
+        ret = js_string_compare(ctx, JS_VALUE_GET_STRING(str1),
+                                JS_VALUE_GET_STRING(str2));
+    }
+    JS_FreeValue(ctx, str1);
+    JS_FreeValue(ctx, str2);
+    return ret;
+}
+
+static JSValue js_build_module_ns(JSContext *ctx, JSModuleDef *m)
+{
+    JSValue obj;
+    JSObject *p;
+    GetExportNamesState s_s, *s = &s_s;
+    int i, ret;
+    JSProperty *pr;
+
+    obj = JS_NewObjectClass(ctx, JS_CLASS_MODULE_NS);
+    if (JS_IsException(obj))
+        return obj;
+    p = JS_VALUE_GET_OBJ(obj);
+
+    memset(s, 0, sizeof(*s));
+    ret = get_exported_names(ctx, s, m, FALSE);
+    js_free(ctx, s->modules);
+    if (ret)
+        goto fail;
+
+    /* Resolve the exported names. The ambiguous exports are removed */
+    for(i = 0; i < s->exported_names_count; i++) {
+        ExportedNameEntry *en = &s->exported_names[i];
+        JSResolveResultEnum res;
+        JSExportEntry *res_me;
+        JSModuleDef *res_m;
+
+        if (en->me) {
+            res_me = en->me; /* fast case: no resolution needed */
+            res_m = m;
+            res = JS_RESOLVE_RES_FOUND;
+        } else {
+            res = js_resolve_export(ctx, &res_m, &res_me, m,
+                                    en->export_name);
+        }
+        if (res != JS_RESOLVE_RES_FOUND) {
+            if (res != JS_RESOLVE_RES_AMBIGUOUS) {
+                js_resolve_export_throw_error(ctx, res, m, en->export_name);
+                goto fail;
+            }
+            en->var_ref = NULL;
+        } else {
+            if (res_me->u.local.var_ref) {
+                en->var_ref = res_me->u.local.var_ref;
+            } else {
+                JSObject *p1 = JS_VALUE_GET_OBJ(res_m->func_obj);
+                p1 = JS_VALUE_GET_OBJ(res_m->func_obj);
+                en->var_ref = p1->u.func.var_refs[res_me->u.local.var_idx];
+            }
+        }
+    }
+
+    /* sort the exported names */
+    rqsort(s->exported_names, s->exported_names_count,
+           sizeof(s->exported_names[0]), exported_names_cmp, ctx);
+
+    for(i = 0; i < s->exported_names_count; i++) {
+        ExportedNameEntry *en = &s->exported_names[i];
+        JSVarRef *var_ref = en->var_ref;
+        if (var_ref != NULL) {
+            pr = add_property(ctx, p, en->export_name,
+                              JS_PROP_ENUMERABLE | JS_PROP_WRITABLE |
+                              JS_PROP_VARREF);
+            if (!pr)
+                goto fail;
+            var_ref->header.ref_count++;
+            pr->u.var_ref = var_ref;
+        }
+    }
+
+    js_free(ctx, s->exported_names);
+
+    JS_DefinePropertyValue(ctx, obj, JS_ATOM_Symbol_toStringTag,
+                           JS_AtomToString(ctx, JS_ATOM_Module),
+                           0);
+
+    p->extensible = FALSE;
+    return obj;
+ fail:
+    js_free(ctx, s->exported_names);
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+/* Load all the required modules for module 'm' */
+static int js_resolve_module(JSContext *ctx, JSModuleDef *m)
+{
+    int i;
+    JSModuleDef *m1;
+
+    if (m->resolved)
+        return 0;
+#ifdef DUMP_MODULE_RESOLVE
+    {
+        char buf1[ATOM_GET_STR_BUF_SIZE];
+        printf("resolving module '%s':\n", JS_AtomGetStr(ctx, buf1, sizeof(buf1), m->module_name));
+    }
+#endif
+    m->resolved = TRUE;
+    /* resolve each requested module */
+    for(i = 0; i < m->req_module_entries_count; i++) {
+        JSReqModuleEntry *rme = &m->req_module_entries[i];
+        m1 = js_host_resolve_imported_module(ctx, m, rme->module_name);
+        if (!m1)
+            return -1;
+        rme->module = m1;
+        /* already done in js_host_resolve_imported_module() except if
+           the module was loaded with JS_EvalBinary() */
+        if (js_resolve_module(ctx, m1) < 0)
+            return -1;
+    }
+    return 0;
+}
+
+static JSVarRef *js_create_module_var(JSContext *ctx, BOOL is_lexical)
+{
+    JSVarRef *var_ref;
+    var_ref = js_malloc(ctx, sizeof(JSVarRef));
+    if (!var_ref)
+        return NULL;
+    var_ref->header.ref_count = 1;
+    var_ref->gc_header.mark = 0;
+    var_ref->link.prev = NULL;
+    var_ref->link.next = NULL;
+    if (is_lexical)
+        var_ref->value = JS_UNINITIALIZED;
+    else
+        var_ref->value = JS_UNDEFINED;
+    var_ref->pvalue = &var_ref->value;
+    return var_ref;
+}
+
+/* Create the <eval> function associated with the module */
+static int js_create_module_function(JSContext *ctx, JSModuleDef *m)
+{
+    JSFunctionBytecode *b;
+    int i;
+    JSVarRef **var_refs;
+    JSValue func_obj, bfunc;
+    JSObject *p;
+
+    bfunc = m->func_obj;
+    func_obj = JS_NewObjectProtoClass(ctx, ctx->function_proto,
+                                      JS_CLASS_BYTECODE_FUNCTION);
+
+    if (JS_IsException(func_obj))
+        return -1;
+    b = JS_VALUE_GET_PTR(bfunc);
+
+    p = JS_VALUE_GET_OBJ(func_obj);
+    p->u.func.function_bytecode = b;
+    b->header.ref_count++;
+    p->u.func.home_object = NULL;
+    p->u.func.var_refs = NULL;
+    if (b->closure_var_count) {
+        var_refs = js_mallocz(ctx, sizeof(var_refs[0]) * b->closure_var_count);
+        if (!var_refs)
+            goto fail;
+        p->u.func.var_refs = var_refs;
+
+        /* create the global variables. The other variables are
+           imported from other modules */
+        for(i = 0; i < b->closure_var_count; i++) {
+            JSClosureVar *cv = &b->closure_var[i];
+            JSVarRef *var_ref;
+            if (cv->is_local) {
+                var_ref = js_create_module_var(ctx, cv->is_lexical);
+                if (!var_ref)
+                    goto fail;
+#ifdef DUMP_MODULE_RESOLVE
+                printf("local %d: %p\n", i, var_ref);
+#endif
+                var_refs[i] = var_ref;
+            }
+        }
+    }
+    m->func_obj = func_obj;
+    JS_FreeValue(ctx, bfunc);
+    return 0;
+ fail:
+    JS_FreeValue(ctx, func_obj);
+    return -1;
+}
+
+/* Prepare a module to be executed by resolving all the imported
+   variables. */
+static int js_instantiate_module(JSContext *ctx, JSModuleDef *m)
+{
+    int i;
+    JSImportEntry *mi;
+    JSModuleDef *m1;
+    JSVarRef **var_refs, *var_ref;
+    JSObject *p;
+    BOOL is_c_module;
+
+    if (m->instantiated)
+        return 0;
+    m->instantiated = TRUE;
+
+    is_c_module = (m->init_func != NULL);
+
+    if (is_c_module) {
+        /* initialize the exported variables */
+        for(i = 0; i < m->export_entries_count; i++) {
+            JSExportEntry *me = &m->export_entries[i];
+            if (me->export_type == JS_EXPORT_TYPE_LOCAL) {
+                var_ref = js_create_module_var(ctx, FALSE);
+                if (!var_ref)
+                    goto fail;
+                me->u.local.var_ref = var_ref;
+            }
+        }
+    } else {
+        if (js_create_module_function(ctx, m) < 0)
+            goto fail;
+    }
+
+    for(i = 0; i < m->req_module_entries_count; i++) {
+        JSReqModuleEntry *rme = &m->req_module_entries[i];
+        if (js_instantiate_module(ctx, rme->module) < 0)
+            goto fail;
+    }
+
+#ifdef DUMP_MODULE_RESOLVE
+    {
+        char buf1[ATOM_GET_STR_BUF_SIZE];
+        printf("instantiating module '%s':\n", JS_AtomGetStr(ctx, buf1, sizeof(buf1), m->module_name));
+    }
+#endif
+    /* check the indirect exports */
+    for(i = 0; i < m->export_entries_count; i++) {
+        JSExportEntry *me = &m->export_entries[i];
+        if (me->export_type == JS_EXPORT_TYPE_INDIRECT) {
+            JSResolveResultEnum ret;
+            JSExportEntry *res_me;
+            JSModuleDef *res_m, *m1;
+            m1 = m->req_module_entries[me->u.req_module_idx].module;
+            ret = js_resolve_export(ctx, &res_m, &res_me, m1, me->local_name);
+            if (ret != JS_RESOLVE_RES_FOUND) {
+                js_resolve_export_throw_error(ctx, ret, m, me->export_name);
+                goto fail;
+            }
+        }
+    }
+
+#ifdef DUMP_MODULE_RESOLVE
+    {
+        printf("exported bindings:\n");
+        for(i = 0; i < m->export_entries_count; i++) {
+            JSExportEntry *me = &m->export_entries[i];
+            printf(" name="); print_atom(ctx, me->export_name);
+            printf(" local="); print_atom(ctx, me->local_name);
+            printf(" type=%d idx=%d\n", me->export_type, me->u.local.var_idx);
+        }
+    }
+#endif
+
+    if (!is_c_module) {
+        p = JS_VALUE_GET_OBJ(m->func_obj);
+        var_refs = p->u.func.var_refs;
+
+        for(i = 0; i < m->import_entries_count; i++) {
+            mi = &m->import_entries[i];
+            m1 = m->req_module_entries[mi->req_module_idx].module;
+            if (mi->import_name == JS_ATOM__star_) {
+                /* name space import */
+                if (JS_IsUndefined(m1->module_ns)) {
+                    JSValue val;
+                    val = js_build_module_ns(ctx, m1);
+                    if (JS_IsException(val))
+                        goto fail;
+                    m1->module_ns = val;
+                }
+                set_value(ctx, &var_refs[mi->var_idx]->value,
+                          JS_DupValue(ctx, m1->module_ns));
+#ifdef DUMP_MODULE_RESOLVE
+                printf("import %d: namespace\n", mi->var_idx);
+#endif
+            } else {
+                JSResolveResultEnum ret;
+                JSExportEntry *res_me;
+                JSModuleDef *res_m;
+                JSObject *p1;
+
+                ret = js_resolve_export(ctx, &res_m,
+                                        &res_me, m1, mi->import_name);
+                if (ret != JS_RESOLVE_RES_FOUND) {
+                    js_resolve_export_throw_error(ctx, ret, m1, mi->import_name);
+                    goto fail;
+                }
+                var_ref = res_me->u.local.var_ref;
+                if (!var_ref) {
+                    p1 = JS_VALUE_GET_OBJ(res_m->func_obj);
+                    var_ref = p1->u.func.var_refs[res_me->u.local.var_idx];
+                }
+                var_ref->header.ref_count++;
+                var_refs[mi->var_idx] = var_ref;
+#ifdef DUMP_MODULE_RESOLVE
+                printf("import %d: %p\n", mi->var_idx, var_ref);
+#endif
+            }
+        }
+
+        /* keep the exported variables in the module export entries (they
+           are used when the eval function is deleted and cannot be
+           initialized before in case imports are exported) */
+        for(i = 0; i < m->export_entries_count; i++) {
+            JSExportEntry *me = &m->export_entries[i];
+            if (me->export_type == JS_EXPORT_TYPE_LOCAL) {
+                var_ref = var_refs[me->u.local.var_idx];
+                var_ref->header.ref_count++;
+                me->u.local.var_ref = var_ref;
+            }
+        }
+    }
+
+#ifdef DUMP_MODULE_RESOLVE
+    printf("done instantiate\n");
+#endif
+    return 0;
+ fail:
+    return -1;
+}
+
+/* Run the <eval> function of the module and of all its requested
+   modules. */
+static JSValue js_evaluate_module(JSContext *ctx, JSModuleDef *m)
+{
+    JSModuleDef *m1;
+    int i;
+    JSValue ret_val;
+
+    if (m->evaluated)
+        return JS_UNDEFINED;
+    m->evaluated = TRUE;
+
+    for(i = 0; i < m->req_module_entries_count; i++) {
+        JSReqModuleEntry *rme = &m->req_module_entries[i];
+        m1 = rme->module; /* already resolved */
+        ret_val = js_evaluate_module(ctx, m1);
+        if (JS_IsException(ret_val))
+            return ret_val;
+        JS_FreeValue(ctx, ret_val);
+    }
+
+    if (m->init_func) {
+        /* C module init */
+        if (m->init_func(ctx, m) < 0)
+            ret_val = JS_EXCEPTION;
+        else
+            ret_val = JS_UNDEFINED;
+    } else {
+        ret_val = JS_CallFree(ctx, m->func_obj, JS_UNDEFINED, 0, NULL);
+        m->func_obj = JS_UNDEFINED;
+    }
+    return ret_val;
+}
+
+static __exception JSAtom js_parse_from_clause(JSParseState *s)
+{
+    JSAtom module_name;
+    if (!token_is_pseudo_keyword(s, JS_ATOM_from)) {
+        js_parse_error(s, "from clause expected");
+        return JS_ATOM_NULL;
+    }
+    if (next_token(s))
+        return JS_ATOM_NULL;
+    if (s->token.val != TOK_STRING) {
+        js_parse_error(s, "string expected");
+        return JS_ATOM_NULL;
+    }
+    module_name = js_value_to_atom(s->ctx, s->token.u.str.str);
+    if (module_name == JS_ATOM_NULL)
+        return JS_ATOM_NULL;
+    if (next_token(s)) {
+        JS_FreeAtom(s->ctx, module_name);
+        return JS_ATOM_NULL;
+    }
+    return module_name;
+}
+
+static __exception int js_parse_export(JSParseState *s)
+{
+    JSContext *ctx = s->ctx;
+    JSModuleDef *m = s->cur_func->module;
+    JSAtom local_name, export_name;
+    int first_export, idx, i, tok;
+    JSAtom module_name;
+    JSExportEntry *me;
+
+    if (next_token(s))
+        return -1;
+
+    tok = s->token.val;
+    if (tok == TOK_CLASS) {
+        return js_parse_class(s, FALSE, JS_PARSE_EXPORT_NAMED);
+    } else if (tok == TOK_FUNCTION ||
+               (token_is_pseudo_keyword(s, JS_ATOM_async) &&
+                peek_token(s, TRUE) == TOK_FUNCTION)) {
+        return js_parse_function_decl2(s, JS_PARSE_FUNC_STATEMENT,
+                                       JS_FUNC_NORMAL, JS_ATOM_NULL,
+                                       s->token.ptr, s->token.line_num,
+                                       JS_PARSE_EXPORT_NAMED, NULL);
+    }
+
+    if (next_token(s))
+        return -1;
+
+    switch(tok) {
+    case '{':
+        first_export = m->export_entries_count;
+        while (s->token.val != '}') {
+            if (!token_is_ident(s->token.val)) {
+                js_parse_error(s, "identifier expected");
+                return -1;
+            }
+            local_name = JS_DupAtom(ctx, s->token.u.ident.atom);
+            export_name = JS_ATOM_NULL;
+            if (next_token(s))
+                goto fail;
+            if (token_is_pseudo_keyword(s, JS_ATOM_as)) {
+                if (next_token(s))
+                    goto fail;
+                if (!token_is_ident(s->token.val)) {
+                    js_parse_error(s, "identifier expected");
+                    goto fail;
+                }
+                export_name = JS_DupAtom(ctx, s->token.u.ident.atom);
+                if (next_token(s)) {
+                fail:
+                    JS_FreeAtom(ctx, local_name);
+                    JS_FreeAtom(ctx, export_name);
+                    return -1;
+                }
+            } else {
+                export_name = JS_DupAtom(ctx, local_name);
+            }
+            me = add_export_entry(s, m, local_name, export_name,
+                                  JS_EXPORT_TYPE_LOCAL);
+            JS_FreeAtom(ctx, local_name);
+            JS_FreeAtom(ctx, export_name);
+            if (!me)
+                return -1;
+            if (s->token.val != ',')
+                break;
+            if (next_token(s))
+                return -1;
+        }
+        if (js_parse_expect(s, '}'))
+            return -1;
+        if (token_is_pseudo_keyword(s, JS_ATOM_from)) {
+            module_name = js_parse_from_clause(s);
+            if (module_name == JS_ATOM_NULL)
+                return -1;
+            idx = add_req_module_entry(ctx, m, module_name);
+            JS_FreeAtom(ctx, module_name);
+            if (idx < 0)
+                return -1;
+            for(i = first_export; i < m->export_entries_count; i++) {
+                me = &m->export_entries[i];
+                me->export_type = JS_EXPORT_TYPE_INDIRECT;
+                me->u.req_module_idx = idx;
+            }
+        }
+        break;
+    case '*':
+        module_name = js_parse_from_clause(s);
+        if (module_name == JS_ATOM_NULL)
+            return -1;
+        idx = add_req_module_entry(ctx, m, module_name);
+        JS_FreeAtom(ctx, module_name);
+        if (idx < 0)
+            return -1;
+        if (add_star_export_entry(ctx, m, idx) < 0)
+            return -1;
+        break;
+    case TOK_DEFAULT:
+        if (s->token.val == TOK_CLASS) {
+            return js_parse_class(s, FALSE, JS_PARSE_EXPORT_DEFAULT);
+        } else if (s->token.val == TOK_FUNCTION ||
+                   (token_is_pseudo_keyword(s, JS_ATOM_async) &&
+                    peek_token(s, TRUE) == TOK_FUNCTION)) {
+            return js_parse_function_decl2(s, JS_PARSE_FUNC_STATEMENT,
+                                           JS_FUNC_NORMAL, JS_ATOM_NULL,
+                                           s->token.ptr, s->token.line_num,
+                                           JS_PARSE_EXPORT_DEFAULT, NULL);
+        } else {
+            if (js_parse_assign_expr(s, TRUE))
+                return -1;
+        }
+        /* set the name of anonymous functions */
+        set_object_name(s, JS_ATOM_default);
+
+        /* store the value in the _default_ global variable and export
+           it */
+        local_name = JS_ATOM__default_;
+        if (define_var(s, s->cur_func, local_name, TOK_LET) < 0)
+            return -1;
+        emit_op(s, OP_scope_put_var_init);
+        emit_atom(s, local_name);
+        emit_u16(s, 0);
+
+        if (add_export_entry(s, m, local_name, JS_ATOM_default,
+                             JS_EXPORT_TYPE_LOCAL) < 0)
+            return -1;
+        break;
+    case TOK_VAR:
+    case TOK_LET:
+    case TOK_CONST:
+        return js_parse_var(s, TRUE, tok, TRUE);
+    default:
+        return js_parse_error(s, "invalid export syntax");
+    }
+    return js_parse_expect_semi(s);
+}
+
+static int add_closure_var(JSContext *ctx, JSFunctionDef *s,
+                           BOOL is_local, BOOL is_arg,
+                           int var_idx, JSAtom var_name,
+                           BOOL is_const, BOOL is_lexical, BOOL is_catch);
+
+static int add_import(JSParseState *s, JSModuleDef *m,
+                      JSAtom local_name, JSAtom import_name)
+{
+    JSContext *ctx = s->ctx;
+    int i, var_idx;
+    JSImportEntry *mi;
+    BOOL is_local;
+
+    if (local_name == JS_ATOM_arguments || local_name == JS_ATOM_eval)
+        return js_parse_error(s, "invalid import binding");
+
+    if (local_name != JS_ATOM_default) {
+        for (i = 0; i < s->cur_func->closure_var_count; i++) {
+            if (s->cur_func->closure_var[i].var_name == local_name)
+                return js_parse_error(s, "duplicate import binding");
+        }
+    }
+
+    is_local = (import_name == JS_ATOM__star_);
+    var_idx = add_closure_var(ctx, s->cur_func, is_local, FALSE,
+                              m->import_entries_count,
+                              local_name, TRUE, TRUE, FALSE);
+    if (var_idx < 0)
+        return -1;
+    if (js_resize_array(ctx, (void **)&m->import_entries,
+                        sizeof(JSImportEntry),
+                        &m->import_entries_size, &m->import_entries_count,
+                        m->import_entries_count + 1))
+        return -1;
+    mi = &m->import_entries[m->import_entries_count - 1];
+    mi->import_name = JS_DupAtom(ctx, import_name);
+    mi->var_idx = var_idx;
+    return 0;
+}
+
+static __exception int js_parse_import(JSParseState *s)
+{
+    JSContext *ctx = s->ctx;
+    JSModuleDef *m = s->cur_func->module;
+    JSAtom local_name, import_name, module_name;
+    int first_import, i, idx;
+
+    if (next_token(s))
+        return -1;
+
+    first_import = m->import_entries_count;
+    if (s->token.val == TOK_STRING) {
+        module_name = js_value_to_atom(ctx, s->token.u.str.str);
+        if (module_name == JS_ATOM_NULL)
+            return -1;
+        if (next_token(s)) {
+            JS_FreeAtom(ctx, module_name);
+            return -1;
+        }
+    } else {
+        if (s->token.val == TOK_IDENT) {
+            if (s->token.u.ident.is_reserved) {
+                return js_parse_error_reserved_identifier(s);
+            }
+            /* "default" import */
+            local_name = JS_DupAtom(ctx, s->token.u.ident.atom);
+            import_name = JS_ATOM_default;
+            if (next_token(s))
+                goto fail;
+            if (add_import(s, m, local_name, import_name))
+                goto fail;
+            JS_FreeAtom(ctx, local_name);
+
+            if (s->token.val != ',')
+                goto end_import_clause;
+            if (next_token(s))
+                return -1;
+        }
+
+        if (s->token.val == '*') {
+            /* name space import */
+            if (next_token(s))
+                return -1;
+            if (!token_is_pseudo_keyword(s, JS_ATOM_as))
+                return js_parse_error(s, "expecting 'as'");
+            if (next_token(s))
+                return -1;
+            local_name = JS_DupAtom(ctx, s->token.u.ident.atom);
+            import_name = JS_ATOM__star_;
+            if (next_token(s))
+                goto fail;
+            if (add_import(s, m, local_name, import_name))
+                goto fail;
+            JS_FreeAtom(ctx, local_name);
+        } else if (s->token.val == '{') {
+            if (next_token(s))
+                return -1;
+
+            while (s->token.val != '}') {
+                if (!token_is_ident(s->token.val)) {
+                    js_parse_error(s, "identifier expected");
+                    return -1;
+                }
+                import_name = JS_DupAtom(ctx, s->token.u.ident.atom);
+                local_name = JS_ATOM_NULL;
+                if (next_token(s))
+                    goto fail;
+                if (token_is_pseudo_keyword(s, JS_ATOM_as)) {
+                    if (next_token(s))
+                        goto fail;
+                    if (!token_is_ident(s->token.val)) {
+                        js_parse_error(s, "identifier expected");
+                        goto fail;
+                    }
+                    local_name = JS_DupAtom(ctx, s->token.u.ident.atom);
+                    if (next_token(s)) {
+                    fail:
+                        JS_FreeAtom(ctx, local_name);
+                        JS_FreeAtom(ctx, import_name);
+                        return -1;
+                    }
+                } else {
+                    local_name = JS_DupAtom(ctx, import_name);
+                }
+                if (add_import(s, m, local_name, import_name))
+                    goto fail;
+                JS_FreeAtom(ctx, local_name);
+                JS_FreeAtom(ctx, import_name);
+                if (s->token.val != ',')
+                    break;
+                if (next_token(s))
+                    return -1;
+            }
+            if (js_parse_expect(s, '}'))
+                return -1;
+        }
+    end_import_clause:
+        module_name = js_parse_from_clause(s);
+        if (module_name == JS_ATOM_NULL)
+            return -1;
+    }
+    idx = add_req_module_entry(ctx, m, module_name);
+    JS_FreeAtom(ctx, module_name);
+    if (idx < 0)
+        return -1;
+    for(i = first_import; i < m->import_entries_count; i++)
+        m->import_entries[i].req_module_idx = idx;
+
+    return js_parse_expect_semi(s);
+}
+
+static __exception int js_parse_source_element(JSParseState *s)
+{
+    JSFunctionDef *fd = s->cur_func;
+
+    if (s->token.val == TOK_FUNCTION ||
+        (token_is_pseudo_keyword(s, JS_ATOM_async) &&
+         peek_token(s, TRUE) == TOK_FUNCTION)) {
+        if (js_parse_function_decl(s, JS_PARSE_FUNC_STATEMENT,
+                                   JS_FUNC_NORMAL, JS_ATOM_NULL,
+                                   s->token.ptr, s->token.line_num))
+            return -1;
+    } else if (s->token.val == TOK_EXPORT && fd->module) {
+        if (js_parse_export(s))
+            return -1;
+    } else if (s->token.val == TOK_IMPORT && fd->module) {
+        if (js_parse_import(s))
+            return -1;
+    } else {
+        if (js_parse_statement_or_decl(s, DECL_MASK_ALL))
+            return -1;
+    }
+    return 0;
+}
+
+static JSFunctionDef *js_new_function_def(JSContext *ctx,
+                                          JSFunctionDef *parent,
+                                          BOOL is_eval,
+                                          BOOL is_func_expr,
+                                          const char *filename, int line_num)
+{
+    JSFunctionDef *fd;
+
+    fd = js_mallocz(ctx, sizeof(*fd));
+    if (!fd)
+        return NULL;
+
+    fd->ctx = ctx;
+    init_list_head(&fd->child_list);
+
+    /* insert in parent list */
+    fd->parent = parent;
+    fd->parent_cpool_idx = -1;
+    if (parent) {
+        list_add_tail(&fd->link, &parent->child_list);
+        fd->js_mode = parent->js_mode;
+        fd->parent_scope_level = parent->scope_level;
+    }
+
+    fd->is_eval = is_eval;
+    fd->is_func_expr = is_func_expr;
+    js_dbuf_init(ctx, &fd->byte_code);
+    fd->last_opcode_pos = -1;
+    fd->func_name = JS_ATOM_NULL;
+    fd->var_object_idx = -1;
+    fd->arguments_var_idx = -1;
+    fd->func_var_idx = -1;
+    fd->eval_ret_idx = -1;
+    fd->this_var_idx = -1;
+    fd->new_target_var_idx = -1;
+    fd->this_active_func_var_idx = -1;
+    fd->home_object_var_idx = -1;
+
+    /* XXX: should distinguish arg, var and var object and body scopes */
+    fd->scope_level = 0;  /* 0: var/arg scope, 1:body scope */
+    fd->scope_first = -1;
+    fd->scopes = fd->def_scope_array;
+    fd->scope_size = countof(fd->def_scope_array);
+    fd->scope_count = 1;
+    fd->scopes[0].first = -1;
+    fd->scopes[0].parent = -1;
+
+    fd->filename = JS_NewAtom(ctx, filename);
+    fd->line_num = line_num;
+
+    js_dbuf_init(ctx, &fd->pc2line);
+    //fd->pc2line_last_line_num = line_num;
+    //fd->pc2line_last_pc = 0;
+    fd->last_opcode_line_num = line_num;
+
+    return fd;
+}
+
+static void free_bytecode_atoms(JSRuntime *rt,
+                                const uint8_t *bc_buf, int bc_len)
+{
+    int pos, len, op;
+    JSAtom atom;
+
+    pos = 0;
+    while (pos < bc_len) {
+        op = bc_buf[pos];
+        len = opcode_info[op].size;
+        switch(opcode_info[op].fmt) {
+        case OP_FMT_atom:
+        case OP_FMT_atom_u8:
+        case OP_FMT_atom_u16:
+        case OP_FMT_atom_label_u8:
+        case OP_FMT_atom_label_u16:
+            atom = get_u32(bc_buf + pos + 1);
+            JS_FreeAtomRT(rt, atom);
+            break;
+        default:
+            break;
+        }
+        pos += len;
+    }
+}
+
+static void js_free_function_def(JSContext *ctx, JSFunctionDef *fd)
+{
+    int i;
+    struct list_head *el, *el1;
+
+    /* free the child functions */
+    list_for_each_safe(el, el1, &fd->child_list) {
+        JSFunctionDef *fd1;
+        fd1 = list_entry(el, JSFunctionDef, link);
+        js_free_function_def(ctx, fd1);
+    }
+
+    free_bytecode_atoms(ctx->rt, fd->byte_code.buf, fd->byte_code.size);
+    dbuf_free(&fd->byte_code);
+    js_free(ctx, fd->jump_slots);
+    js_free(ctx, fd->label_slots);
+    js_free(ctx, fd->line_number_slots);
+
+    for(i = 0; i < fd->cpool_count; i++) {
+        JS_FreeValue(ctx, fd->cpool[i]);
+    }
+    js_free(ctx, fd->cpool);
+
+    JS_FreeAtom(ctx, fd->func_name);
+
+    for(i = 0; i < fd->var_count; i++) {
+        JS_FreeAtom(ctx, fd->vars[i].var_name);
+    }
+    js_free(ctx, fd->vars);
+    for(i = 0; i < fd->arg_count; i++) {
+        JS_FreeAtom(ctx, fd->args[i].var_name);
+    }
+    js_free(ctx, fd->args);
+
+    for(i = 0; i < fd->hoisted_def_count; i++) {
+        JS_FreeAtom(ctx, fd->hoisted_def[i].var_name);
+    }
+    js_free(ctx, fd->hoisted_def);
+
+    for(i = 0; i < fd->closure_var_count; i++) {
+        JSClosureVar *cv = &fd->closure_var[i];
+        JS_FreeAtom(ctx, cv->var_name);
+    }
+    js_free(ctx, fd->closure_var);
+
+    if (fd->scopes != fd->def_scope_array)
+        js_free(ctx, fd->scopes);
+
+    JS_FreeAtom(ctx, fd->filename);
+    dbuf_free(&fd->pc2line);
+
+    js_free(ctx, fd->source);
+
+    if (fd->parent) {
+        /* remove in parent list */
+        list_del(&fd->link);
+    }
+    js_free(ctx, fd);
+}
+
+#ifdef DUMP_BYTECODE
+static const char *skip_lines(const char *p, int n) {
+    while (n-- > 0 && *p) {
+        while (*p && *p++ != '\n')
+            continue;
+    }
+    return p;
+}
+
+static void print_lines(const char *source, int line, int line1) {
+    const char *s = source;
+    const char *p = skip_lines(s, line);
+    if (*p) {
+        while (line++ < line1) {
+            p = skip_lines(s = p, 1);
+            printf(";; %.*s", (int)(p - s), s);
+            if (!*p) {
+                if (p[-1] != '\n')
+                    printf("\n");
+                break;
+            }
+        }
+    }
+}
+
+static void dump_byte_code(JSContext *ctx, int pass,
+                           const uint8_t *tab, int len,
+                           const JSVarDef *args, int arg_count,
+                           const JSVarDef *vars, int var_count,
+                           const JSClosureVar *closure_var, int closure_var_count,
+                           const JSValue *cpool, uint32_t cpool_count,
+                           const char *source, int line_num,
+                           const LabelSlot *label_slots, JSFunctionBytecode *b)
+{
+    const JSOpCode *oi;
+    int pos, pos_next, op, size, idx, addr, line, line1, in_source;
+    uint8_t *bits = js_mallocz(ctx, len * sizeof(*bits));
+
+    /* scan for jump targets */
+    for (pos = 0; pos < len; pos = pos_next) {
+        op = tab[pos];
+        pos_next = pos + opcode_info[op].size;
+        if (op < OP_COUNT) {
+            switch (opcode_info[op].fmt) {
+#if SHORT_OPCODES
+            case OP_FMT_label8:
+                pos++;
+                addr = (int8_t)tab[pos];
+                goto has_addr;
+            case OP_FMT_label16:
+                pos++;
+                addr = (int16_t)get_u16(tab + pos);
+                goto has_addr;
+#endif
+            case OP_FMT_atom_label_u8:
+            case OP_FMT_atom_label_u16:
+                pos += 4;
+                /* fall thru */
+            case OP_FMT_label:
+            case OP_FMT_label_u16:
+                pos++;
+                addr = get_u32(tab + pos);
+                goto has_addr;
+            has_addr:
+                if (pass == 1)
+                    addr = label_slots[addr].pos;
+                if (pass == 2)
+                    addr = label_slots[addr].pos2;
+                if (pass == 3)
+                    addr += pos;
+                if (addr >= 0 && addr < len)
+                    bits[addr] |= 1;
+                break;
+            }
+        }
+    }
+    in_source = 0;
+    if (source) {
+        /* Always print first line: needed if single line */
+        print_lines(source, 0, 1);
+        in_source = 1;
+    }
+    line1 = line = 1;
+    pos = 0;
+    while (pos < len) {
+        op = tab[pos];
+        if (source) {
+            if (b) {
+                line1 = find_line_num(ctx, b, pos) - line_num + 1;
+            } else if (op == OP_line_num) {
+                line1 = get_u32(tab + pos + 1) - line_num + 1;
+            }
+            if (line1 > line) {
+                if (!in_source)
+                    printf("\n");
+                in_source = 1;
+                print_lines(source, line, line1);
+                line = line1;
+                //bits[pos] |= 2;
+            }
+        }
+        if (in_source)
+            printf("\n");
+        in_source = 0;
+        if (op >= OP_COUNT) {
+            printf("invalid opcode (0x%02x)\n", op);
+            pos++;
+            continue;
+        }
+        oi = &opcode_info[op];
+        size = oi->size;
+        if (pos + size > len) {
+            printf("truncated opcode (0x%02x)\n", op);
+            break;
+        }
+#if defined(DUMP_BYTECODE) && (DUMP_BYTECODE & 16)
+        {
+            int i, x, x0;
+            x = x0 = printf("%5d ", pos);
+            for (i = 0; i < size; i++) {
+                if (i == 6) {
+                    printf("\n%*s", x = x0, "");
+                }
+                x += printf(" %02X", tab[pos + i]);
+            }
+            printf("%*s", x0 + 20 - x, "");
+        }
+#endif
+        if (bits[pos]) {
+            printf("%5d:  ", pos);
+        } else {
+            printf("        ");
+        }
+        printf("%s", oi->name);
+        pos++;
+        switch(oi->fmt) {
+        case OP_FMT_none_int:
+            printf(" %d", op - OP_push_0);
+            break;
+        case OP_FMT_npopx:
+            printf(" %d", op - OP_call0);
+            break;
+        case OP_FMT_u8:
+            printf(" %u", get_u8(tab + pos));
+            break;
+        case OP_FMT_i8:
+            printf(" %d", get_i8(tab + pos));
+            break;
+        case OP_FMT_u16:
+        case OP_FMT_npop:
+            printf(" %u", get_u16(tab + pos));
+            break;
+        case OP_FMT_i16:
+            printf(" %d", get_i16(tab + pos));
+            break;
+        case OP_FMT_i32:
+            printf(" %d", get_i32(tab + pos));
+            break;
+        case OP_FMT_u32:
+            printf(" %u", get_u32(tab + pos));
+            break;
+#if SHORT_OPCODES
+        case OP_FMT_label8:
+            addr = get_i8(tab + pos);
+            goto has_addr1;
+        case OP_FMT_label16:
+            addr = get_i16(tab + pos);
+            goto has_addr1;
+#endif
+        case OP_FMT_label:
+            addr = get_u32(tab + pos);
+            goto has_addr1;
+        has_addr1:
+            if (pass == 1)
+                printf(" %u:%u", addr, label_slots[addr].pos);
+            if (pass == 2)
+                printf(" %u:%u", addr, label_slots[addr].pos2);
+            if (pass == 3)
+                printf(" %u", addr + pos);
+            break;
+        case OP_FMT_label_u16:
+            addr = get_u32(tab + pos);
+            if (pass == 1)
+                printf(" %u:%u", addr, label_slots[addr].pos);
+            if (pass == 2)
+                printf(" %u:%u", addr, label_slots[addr].pos2);
+            if (pass == 3)
+                printf(" %u", addr + pos);
+            printf(",%u", get_u16(tab + pos + 4));
+            break;
+#if SHORT_OPCODES
+        case OP_FMT_const8:
+            idx = get_u8(tab + pos);
+            goto has_pool_idx;
+#endif
+        case OP_FMT_const:
+            idx = get_u32(tab + pos);
+            goto has_pool_idx;
+        has_pool_idx:
+            printf(" %u: ", idx);
+            if (idx < cpool_count) {
+                JS_DumpValue(ctx, cpool[idx]);
+            }
+            break;
+        case OP_FMT_atom:
+            printf(" ");
+            print_atom(ctx, get_u32(tab + pos));
+            break;
+        case OP_FMT_atom_u8:
+            printf(" ");
+            print_atom(ctx, get_u32(tab + pos));
+            printf(",%d", get_u8(tab + pos + 4));
+            break;
+        case OP_FMT_atom_u16:
+            printf(" ");
+            print_atom(ctx, get_u32(tab + pos));
+            printf(",%d", get_u16(tab + pos + 4));
+            break;
+        case OP_FMT_atom_label_u8:
+        case OP_FMT_atom_label_u16:
+            printf(" ");
+            print_atom(ctx, get_u32(tab + pos));
+            addr = get_u32(tab + pos + 4);
+            if (pass == 1)
+                printf(",%u:%u", addr, label_slots[addr].pos);
+            if (pass == 2)
+                printf(",%u:%u", addr, label_slots[addr].pos2);
+            if (pass == 3)
+                printf(",%u", addr + pos + 4);
+            if (oi->fmt == OP_FMT_atom_label_u8)
+                printf(",%u", get_u8(tab + pos + 8));
+            else
+                printf(",%u", get_u16(tab + pos + 8));
+            break;
+        case OP_FMT_none_loc:
+            idx = (op - OP_get_loc0) % 4;
+            goto has_loc;
+        case OP_FMT_loc8:
+            idx = get_u8(tab + pos);
+            goto has_loc;
+        case OP_FMT_loc:
+            idx = get_u16(tab + pos);
+        has_loc:
+            printf(" %d: ", idx);
+            if (idx < var_count) {
+                print_atom(ctx, vars[idx].var_name);
+            }
+            break;
+        case OP_FMT_none_arg:
+            idx = (op - OP_get_arg0) % 4;
+            goto has_arg;
+        case OP_FMT_arg:
+            idx = get_u16(tab + pos);
+        has_arg:
+            printf(" %d: ", idx);
+            if (idx < arg_count) {
+                print_atom(ctx, args[idx].var_name);
+            }
+            break;
+        case OP_FMT_none_var_ref:
+            idx = (op - OP_get_var_ref0) % 4;
+            goto has_var_ref;
+        case OP_FMT_var_ref:
+            idx = get_u16(tab + pos);
+        has_var_ref:
+            printf(" %d: ", idx);
+            if (idx < closure_var_count) {
+                print_atom(ctx, closure_var[idx].var_name);
+            }
+            break;
+        default:
+            break;
+        }
+        printf("\n");
+        pos += oi->size - 1;
+    }
+    if (source) {
+        if (!in_source)
+            printf("\n");
+        print_lines(source, line, INT32_MAX);
+    }
+    js_free(ctx, bits);
+}
+
+#if defined(_MSC_VER)
+static void dump_pc2line(JSContext *ctx, const uint8_t *buf, int len,
+                                                 int line_num)
+#else
+static __attribute__((unused)) void dump_pc2line(JSContext *ctx, const uint8_t *buf, int len,
+                                                 int line_num)
+#endif 
+{
+    const uint8_t *p_end, *p_next, *p;
+    int pc, v;
+    unsigned int op;
+
+    if (len <= 0)
+        return;
+
+    printf("%5s %5s\n", "PC", "LINE");
+
+    p = buf;
+    p_end = buf + len;
+    pc = 0;
+    while (p < p_end) {
+        op = *p++;
+        if (op == 0) {
+            v = unicode_from_utf8(p, p_end - p, &p_next);
+            if (v < 0)
+                goto fail;
+            pc += v;
+            p = p_next;
+            v = unicode_from_utf8(p, p_end - p, &p_next);
+            if (v < 0) {
+            fail:
+                printf("invalid pc2line encode pos=%d\n", (int)(p - buf));
+                return;
+            }
+            if (!(v & 1)) {
+                v = v >> 1;
+            } else {
+                v = -(v >> 1) - 1;
+            }
+            line_num += v;
+            p = p_next;
+        } else {
+            op -= PC2LINE_OP_FIRST;
+            pc += (op / PC2LINE_RANGE);
+            line_num += (op % PC2LINE_RANGE) + PC2LINE_BASE;
+        }
+        printf("%5d %5d\n", pc, line_num);
+    }
+}
+
+#if defined(_MSC_VER)
+static void js_dump_function_bytecode(JSContext *ctx, JSFunctionBytecode *b)
+#else
+static __attribute__((unused)) void js_dump_function_bytecode(JSContext *ctx, JSFunctionBytecode *b)
+#endif
+{
+    int i;
+    char atom_buf[ATOM_GET_STR_BUF_SIZE];
+    const char *str;
+
+    if (b->has_debug && b->debug.filename != JS_ATOM_NULL) {
+        str = JS_AtomGetStr(ctx, atom_buf, sizeof(atom_buf), b->debug.filename);
+        printf("%s:%d: ", str, b->debug.line_num);
+    }
+
+    str = JS_AtomGetStr(ctx, atom_buf, sizeof(atom_buf), b->func_name);
+    printf("function: %s%s\n", &"*"[b->func_kind != JS_FUNC_GENERATOR], str);
+    if (b->js_mode) {
+        printf("  mode:");
+        if (b->js_mode & JS_MODE_STRICT)
+            printf(" strict");
+#ifdef CONFIG_BIGNUM
+        if (b->js_mode & JS_MODE_MATH)
+            printf(" math");
+#endif
+        printf("\n");
+    }
+    if (b->arg_count && b->vardefs) {
+        printf("  args:");
+        for(i = 0; i < b->arg_count; i++) {
+            printf(" %s", JS_AtomGetStr(ctx, atom_buf, sizeof(atom_buf),
+                                        b->vardefs[i].var_name));
+        }
+        printf("\n");
+    }
+    if (b->var_count && b->vardefs) {
+        printf("  locals:\n");
+        for(i = 0; i < b->var_count; i++) {
+            JSVarDef *vd = &b->vardefs[b->arg_count + i];
+            printf("%5d: %s %s", i,
+                   vd->is_catch ? "catch" :
+                   vd->is_function ? "function" :
+                   vd->is_const ? "const" :
+                   vd->is_lexical ? "let" : "var",
+                   JS_AtomGetStr(ctx, atom_buf, sizeof(atom_buf), vd->var_name));
+            if (vd->scope_level)
+                printf(" [level:%d next:%d]", vd->scope_level, vd->scope_next);
+            printf("\n");
+        }
+    }
+    if (b->closure_var_count) {
+        printf("  closure vars:\n");
+        for(i = 0; i < b->closure_var_count; i++) {
+            JSClosureVar *cv = &b->closure_var[i];
+            printf("%5d: %s %s:%s%d %s\n", i,
+                   JS_AtomGetStr(ctx, atom_buf, sizeof(atom_buf), cv->var_name),
+                   cv->is_local ? "local" : "parent",
+                   cv->is_arg ? "arg" : "loc", cv->var_idx,
+                   cv->is_const ? "const" :
+                   cv->is_lexical ? "let" : "var");
+        }
+    }
+    printf("  stack_size: %d\n", b->stack_size);
+    printf("  opcodes:\n");
+    dump_byte_code(ctx, 3, b->byte_code_buf, b->byte_code_len,
+                   b->vardefs, b->arg_count,
+                   b->vardefs ? b->vardefs + b->arg_count : NULL, b->var_count,
+                   b->closure_var, b->closure_var_count,
+                   b->cpool, b->cpool_count,
+                   b->has_debug ? b->debug.source : NULL,
+                   b->has_debug ? b->debug.line_num : -1, NULL, b);
+#if defined(DUMP_BYTECODE) && (DUMP_BYTECODE & 32)
+    if (b->has_debug)
+        dump_pc2line(ctx, b->debug.pc2line_buf, b->debug.pc2line_len, b->debug.line_num);
+#endif
+    printf("\n");
+}
+#endif
+
+static int add_closure_var(JSContext *ctx, JSFunctionDef *s,
+                           BOOL is_local, BOOL is_arg,
+                           int var_idx, JSAtom var_name,
+                           BOOL is_const, BOOL is_lexical, BOOL is_catch)
+{
+    JSClosureVar *cv;
+
+    /* the closure variable indexes are currently stored on 16 bits */
+    if (s->closure_var_count >= JS_MAX_LOCAL_VARS) {
+        JS_ThrowInternalError(ctx, "too many closure variables");
+        return -1;
+    }
+
+    if (s->closure_var_count >= s->closure_var_size) {
+        JSClosureVar *new_tab;
+        int new_size;
+        size_t slack;
+        new_size = max_int(s->closure_var_count + 1,
+                           s->closure_var_size * 3 / 2);
+        new_tab = js_realloc2(ctx, s->closure_var,
+                              new_size * sizeof(JSClosureVar), &slack);
+        if (!new_tab)
+            return -1;
+        new_size += slack / sizeof(*new_tab);
+        s->closure_var = new_tab;
+        s->closure_var_size = new_size;
+    }
+    cv = &s->closure_var[s->closure_var_count++];
+    cv->is_local = is_local;
+    cv->is_arg = is_arg;
+    cv->is_const = is_const;
+    cv->is_lexical = is_lexical;
+    cv->is_catch = is_catch;
+    cv->var_idx = var_idx;
+    cv->var_name = JS_DupAtom(ctx, var_name);
+    return s->closure_var_count - 1;
+}
+
+static int find_closure_var(JSContext *ctx, JSFunctionDef *s,
+                            JSAtom var_name)
+{
+    int i;
+    for(i = 0; i < s->closure_var_count; i++) {
+        JSClosureVar *cv = &s->closure_var[i];
+        if (cv->var_name == var_name)
+            return i;
+    }
+    return -1;
+}
+
+/* 'fd' must be a parent of 's'. Create in 's' a closure referencing a
+   local variable (is_local = TRUE) or a closure (is_local = FALSE) in
+   'fd' */
+static int get_closure_var2(JSContext *ctx, JSFunctionDef *s,
+                            JSFunctionDef *fd, BOOL is_local,
+                            BOOL is_arg, int var_idx, JSAtom var_name,
+                            BOOL is_const, BOOL is_lexical, BOOL is_catch)
+{
+    int i;
+
+    if (fd != s->parent) {
+        var_idx = get_closure_var2(ctx, s->parent, fd, is_local,
+                                   is_arg, var_idx, var_name,
+                                   is_const, is_lexical, is_catch);
+        if (var_idx < 0)
+            return -1;
+        is_local = FALSE;
+    }
+    for(i = 0; i < s->closure_var_count; i++) {
+        JSClosureVar *cv = &s->closure_var[i];
+        if (cv->var_idx == var_idx && cv->is_arg == is_arg &&
+            cv->is_local == is_local)
+            return i;
+    }
+    return add_closure_var(ctx, s, is_local, is_arg, var_idx, var_name,
+                           is_const, is_lexical, is_catch);
+}
+
+static int get_closure_var(JSContext *ctx, JSFunctionDef *s,
+                           JSFunctionDef *fd, BOOL is_arg,
+                           int var_idx, JSAtom var_name,
+                           BOOL is_const, BOOL is_lexical,
+                           BOOL is_catch)
+{
+    return get_closure_var2(ctx, s, fd, TRUE, is_arg,
+                            var_idx, var_name, is_const, is_lexical, is_catch);
+}
+
+static int get_with_scope_opcode(int op)
+{
+    if (op == OP_scope_get_var_undef)
+        return OP_with_get_var;
+    else
+        return OP_with_get_var + (op - OP_scope_get_var);
+}
+
+static BOOL can_opt_put_ref_value(const uint8_t *bc_buf, int pos)
+{
+    int opcode = bc_buf[pos];
+    return (bc_buf[pos + 1] == OP_put_ref_value &&
+            (opcode == OP_insert3 ||
+             opcode == OP_perm4 ||
+             //opcode == OP_nop ||
+             opcode == OP_rot3l));
+}
+
+static BOOL can_opt_put_global_ref_value(const uint8_t *bc_buf, int pos)
+{
+    int opcode = bc_buf[pos];
+    return (bc_buf[pos + 1] == OP_put_ref_value &&
+            (opcode == OP_insert3 ||
+             opcode == OP_perm4 ||
+             //opcode == OP_nop ||
+             opcode == OP_rot3l));
+}
+
+static int optimize_scope_make_ref(JSContext *ctx, JSFunctionDef *s,
+                                   DynBuf *bc, uint8_t *bc_buf,
+                                   LabelSlot *ls, int pos_next,
+                                   int get_op, int var_idx)
+{
+    int label_pos, end_pos, pos;
+
+    /* XXX: should optimize `loc(a) += expr` as `expr add_loc(a)`
+       but only if expr does not modify `a`.
+       should scan the code between pos_next and label_pos
+       for operations that can potentially change `a`:
+       OP_scope_make_ref(a), function calls, jumps and gosub.
+     */
+    /* replace the reference get/put with normal variable
+       accesses */
+    if (bc_buf[pos_next] == OP_get_ref_value) {
+        dbuf_putc(bc, get_op);
+        dbuf_put_u16(bc, var_idx);
+        pos_next++;
+    }
+    /* remove the OP_label to make room for replacement */
+    /* label should have a refcount of 0 anyway */
+    /* XXX: should avoid this patch by inserting nops in phase 1 */
+    label_pos = ls->pos;
+    pos = label_pos - 5;
+    assert(bc_buf[pos] == OP_label);
+    /* label points to an instruction pair:
+       - insert3 / put_ref_value
+       - perm4 / put_ref_value
+       - rot3l / put_ref_value
+       - nop / put_ref_value
+     */
+    end_pos = label_pos + 2;
+    if (bc_buf[label_pos] == OP_insert3)
+        bc_buf[pos++] = OP_dup;
+    bc_buf[pos] = get_op + 1;
+    put_u16(bc_buf + pos + 1, var_idx);
+    pos += 3;
+    /* pad with OP_nop */
+    while (pos < end_pos)
+        bc_buf[pos++] = OP_nop;
+    return pos_next;
+}
+
+static int optimize_scope_make_global_ref(JSContext *ctx, JSFunctionDef *s,
+                                          DynBuf *bc, uint8_t *bc_buf,
+                                          LabelSlot *ls, int pos_next,
+                                          JSAtom var_name)
+{
+    int label_pos, end_pos, pos, op;
+    BOOL is_strict;
+    is_strict = ((s->js_mode & JS_MODE_STRICT) != 0);
+
+    /* replace the reference get/put with normal variable
+       accesses */
+    if (is_strict) {
+        /* need to check if the variable exists before evaluating the right
+           expression */
+        /* XXX: need an extra OP_true if destructuring an array */
+        dbuf_putc(bc, OP_check_var);
+        dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+    } else {
+        /* XXX: need 2 extra OP_true if destructuring an array */
+    }
+    if (bc_buf[pos_next] == OP_get_ref_value) {
+        dbuf_putc(bc, OP_get_var);
+        dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+        pos_next++;
+    }
+    /* remove the OP_label to make room for replacement */
+    /* label should have a refcount of 0 anyway */
+    /* XXX: should have emitted several OP_nop to avoid this kludge */
+    label_pos = ls->pos;
+    pos = label_pos - 5;
+    assert(bc_buf[pos] == OP_label);
+    end_pos = label_pos + 2;
+    op = bc_buf[label_pos];
+    if (is_strict) {
+        switch(op) {
+        case OP_insert3:
+            op = OP_insert2;
+            break;
+        case OP_perm4:
+            op = OP_perm3;
+            break;
+        case OP_rot3l:
+            op = OP_swap;
+            break;
+        default:
+            abort();
+        }
+        bc_buf[pos++] = op;
+    } else {
+        if (op == OP_insert3)
+            bc_buf[pos++] = OP_dup;
+    }
+    if (is_strict) {
+        bc_buf[pos] = OP_put_var_strict;
+        /* XXX: need 1 extra OP_drop if destructuring an array */
+    } else {
+        bc_buf[pos] = OP_put_var;
+        /* XXX: need 2 extra OP_drop if destructuring an array */
+    }
+    put_u32(bc_buf + pos + 1, JS_DupAtom(ctx, var_name));
+    pos += 5;
+    /* pad with OP_nop */
+    while (pos < end_pos)
+        bc_buf[pos++] = OP_nop;
+    return pos_next;
+}
+
+static int add_var_this(JSContext *ctx, JSFunctionDef *fd)
+{
+    int idx;
+    idx = add_var(ctx, fd, JS_ATOM_this);
+    if (idx >= 0 && fd->is_derived_class_constructor) {
+        JSVarDef *vd = &fd->vars[idx];
+        /* XXX: should have is_this flag or var type */
+        vd->is_lexical = 1; /* used to trigger 'uninitialized' checks
+                               in a derived class constructor */
+    }
+    return idx;
+}
+
+static int resolve_pseudo_var(JSContext *ctx, JSFunctionDef *s,
+                               JSAtom var_name)
+{
+    int var_idx;
+
+    if (!s->has_this_binding)
+        return -1;
+    switch(var_name) {
+    case JS_ATOM_home_object:
+        /* 'home_object' pseudo variable */
+        var_idx = s->home_object_var_idx = add_var(ctx, s, var_name);
+        break;
+    case JS_ATOM_this_active_func:
+        /* 'this.active_func' pseudo variable */
+        var_idx = s->this_active_func_var_idx = add_var(ctx, s, var_name);
+        break;
+    case JS_ATOM_new_target:
+        /* 'new.target' pseudo variable */
+        var_idx = s->new_target_var_idx = add_var(ctx, s, var_name);
+        break;
+    case JS_ATOM_this:
+        /* 'this' pseudo variable */
+        var_idx = s->this_var_idx = add_var_this(ctx, s);
+        break;
+    default:
+        var_idx = -1;
+        break;
+    }
+    return var_idx;
+}
+
+/* return the position of the next opcode */
+static int resolve_scope_var(JSContext *ctx, JSFunctionDef *s,
+                             JSAtom var_name, int scope_level, int op,
+                             DynBuf *bc, uint8_t *bc_buf,
+                             LabelSlot *ls, int pos_next, int arg_valid)
+{
+    int idx, var_idx, is_put;
+    int label_done;
+    BOOL is_func_var = FALSE;
+    JSFunctionDef *fd;
+    JSVarDef *vd;
+    BOOL is_pseudo_var;
+
+    label_done = -1;
+
+    /* XXX: could be simpler to use a specific function to
+       resolve the pseudo variables */
+    is_pseudo_var = (var_name == JS_ATOM_home_object ||
+                     var_name == JS_ATOM_this_active_func ||
+                     var_name == JS_ATOM_new_target ||
+                     var_name == JS_ATOM_this);
+
+    /* resolve local scoped variables */
+    var_idx = -1;
+    for (idx = s->scopes[scope_level].first; idx >= 0;) {
+        vd = &s->vars[idx];
+        if (vd->var_name == var_name) {
+            if (op == OP_scope_put_var || op == OP_scope_make_ref) {
+                if (vd->is_const) {
+                    dbuf_putc(bc, OP_throw_var);
+                    dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+                    dbuf_putc(bc, JS_THROW_VAR_RO);
+                    goto done;
+                }
+                is_func_var = vd->is_func_var;
+            }
+            var_idx = idx;
+            break;
+        } else
+        if (vd->var_name == JS_ATOM__with_ && !is_pseudo_var) {
+            dbuf_putc(bc, OP_get_loc);
+            dbuf_put_u16(bc, idx);
+            dbuf_putc(bc, get_with_scope_opcode(op));
+            dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+            label_done = new_label_fd(s, label_done);
+            dbuf_put_u32(bc, label_done);
+            dbuf_putc(bc, 1);
+            update_label(s, label_done, 1);
+            s->jump_size++;
+        }
+        idx = vd->scope_next;
+    }
+    if (var_idx < 0) {
+        /* XXX: scoping issues:
+           should not resolve vars from the function body during argument parse,
+           `arguments` and function-name should not be hidden by later vars.
+         */
+        var_idx = find_var(ctx, s, var_name);
+        if (var_idx >= 0) {
+            if (scope_level == 0
+            &&  (var_idx & ARGUMENT_VAR_OFFSET)
+            &&  (var_idx - ARGUMENT_VAR_OFFSET) >= arg_valid) {
+                /* referring to an uninitialized argument */
+                dbuf_putc(bc, OP_throw_var);
+                dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+                dbuf_putc(bc, JS_THROW_VAR_UNINITIALIZED);
+            }
+            if (!(var_idx & ARGUMENT_VAR_OFFSET))
+                is_func_var = s->vars[var_idx].is_func_var;
+        }
+
+        if (var_idx < 0 && is_pseudo_var)
+            var_idx = resolve_pseudo_var(ctx, s, var_name);
+
+        if (var_idx < 0 && var_name == JS_ATOM_arguments &&
+            s->has_arguments_binding) {
+            /* 'arguments' pseudo variable */
+            var_idx = add_arguments_var(ctx, s, var_name);
+        }
+        if (var_idx < 0 && s->is_func_expr && var_name == s->func_name) {
+            /* add a new variable with the function name */
+            var_idx = add_func_var(ctx, s, var_name);
+            is_func_var = TRUE;
+        }
+    }
+    if (var_idx >= 0) {
+        /* OP_scope_put_var_init is only used to initialize a
+           lexical variable, so it is never used in a with or var object. It
+           can be used with a closure (module global variable case). */
+        switch (op) {
+        case OP_scope_make_ref:
+            if (is_func_var) {
+                /* Create a dummy object reference for the func_var */
+                dbuf_putc(bc, OP_object);
+                dbuf_putc(bc, OP_get_loc);
+                dbuf_put_u16(bc, var_idx);
+                dbuf_putc(bc, OP_define_field);
+                dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+                dbuf_putc(bc, OP_push_atom_value);
+                dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+            } else
+            if (label_done == -1 && can_opt_put_ref_value(bc_buf, ls->pos)) {
+                int get_op;
+                if (var_idx & ARGUMENT_VAR_OFFSET) {
+                    get_op = OP_get_arg;
+                    var_idx -= ARGUMENT_VAR_OFFSET;
+                } else {
+                    if (s->vars[var_idx].is_lexical)
+                        get_op = OP_get_loc_check;
+                    else
+                        get_op = OP_get_loc;
+                }
+                pos_next = optimize_scope_make_ref(ctx, s, bc, bc_buf, ls,
+                                                   pos_next, get_op, var_idx);
+            } else {
+                /* Create a dummy object with a named slot that is
+                   a reference to the local variable */
+                if (var_idx & ARGUMENT_VAR_OFFSET) {
+                    dbuf_putc(bc, OP_make_arg_ref);
+                    dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+                    dbuf_put_u16(bc, var_idx - ARGUMENT_VAR_OFFSET);
+                } else {
+                    dbuf_putc(bc, OP_make_loc_ref);
+                    dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+                    dbuf_put_u16(bc, var_idx);
+                }
+            }
+            break;
+        case OP_scope_get_ref:
+            dbuf_putc(bc, OP_undefined);
+            /* fall thru */
+        case OP_scope_get_var_undef:
+        case OP_scope_get_var:
+        case OP_scope_put_var:
+        case OP_scope_put_var_init:
+            is_put = (op == OP_scope_put_var || op == OP_scope_put_var_init);
+            if (var_idx & ARGUMENT_VAR_OFFSET) {
+                dbuf_putc(bc, OP_get_arg + is_put);
+                dbuf_put_u16(bc, var_idx - ARGUMENT_VAR_OFFSET);
+                /* XXX: should test if argument reference needs TDZ check */
+            } else {
+                if (is_put) {
+                    if (s->vars[var_idx].is_lexical) {
+                        if (op == OP_scope_put_var_init) {
+                            /* 'this' can only be initialized once */
+                            if (var_name == JS_ATOM_this)
+                                dbuf_putc(bc, OP_put_loc_check_init);
+                            else
+                                dbuf_putc(bc, OP_put_loc);
+                        } else {
+                            dbuf_putc(bc, OP_put_loc_check);
+                        }
+                    } else {
+                        dbuf_putc(bc, OP_put_loc);
+                    }
+                } else {
+                    if (s->vars[var_idx].is_lexical) {
+                        dbuf_putc(bc, OP_get_loc_check);
+                    } else {
+                        dbuf_putc(bc, OP_get_loc);
+                    }
+                }
+                dbuf_put_u16(bc, var_idx);
+            }
+            break;
+        case OP_scope_delete_var:
+            dbuf_putc(bc, OP_push_false);
+            break;
+        }
+        goto done;
+    }
+    /* check eval object */
+    if (s->var_object_idx >= 0 && !is_pseudo_var) {
+        dbuf_putc(bc, OP_get_loc);
+        dbuf_put_u16(bc, s->var_object_idx);
+        dbuf_putc(bc, get_with_scope_opcode(op));
+        dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+        label_done = new_label_fd(s, label_done);
+        dbuf_put_u32(bc, label_done);
+        dbuf_putc(bc, 0);
+        update_label(s, label_done, 1);
+        s->jump_size++;
+    }
+    /* check parent scopes */
+    for (fd = s; fd->parent;) {
+        scope_level = fd->parent_scope_level;
+        fd = fd->parent;
+        if (scope_level == 0) {
+            /* function is defined as part of the argument parsing: hide vars
+               from the function body.
+               XXX: variables created from argument destructuring might need
+               to be visible, should refine this method.
+             */
+            var_idx = find_arg(ctx, fd, var_name);
+            goto check_idx;
+        }
+        for (idx = fd->scopes[scope_level].first; idx >= 0;) {
+            vd = &fd->vars[idx];
+            if (vd->var_name == var_name) {
+                if (op == OP_scope_put_var || op == OP_scope_make_ref) {
+                    if (vd->is_const) {
+                        dbuf_putc(bc, OP_throw_var);
+                        dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+                        dbuf_putc(bc, JS_THROW_VAR_RO);
+                        goto done;
+                    }
+                    is_func_var = vd->is_func_var;
+                }
+                var_idx = idx;
+                break;
+            } else if (vd->var_name == JS_ATOM__with_ && !is_pseudo_var) {
+                vd->is_captured = 1;
+                idx = get_closure_var(ctx, s, fd, FALSE, idx, vd->var_name, FALSE, FALSE, FALSE);
+                if (idx >= 0) {
+                    dbuf_putc(bc, OP_get_var_ref);
+                    dbuf_put_u16(bc, idx);
+                    dbuf_putc(bc, get_with_scope_opcode(op));
+                    dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+                    label_done = new_label_fd(s, label_done);
+                    dbuf_put_u32(bc, label_done);
+                    dbuf_putc(bc, 1);
+                    update_label(s, label_done, 1);
+                    s->jump_size++;
+                }
+            }
+            idx = vd->scope_next;
+        }
+        if (var_idx >= 0)
+            break;
+
+        var_idx = find_var(ctx, fd, var_name);
+    check_idx:
+        if (var_idx >= 0) {
+            if (!(var_idx & ARGUMENT_VAR_OFFSET))
+                is_func_var = fd->vars[var_idx].is_func_var;
+            break;
+        }
+        if (is_pseudo_var) {
+            var_idx = resolve_pseudo_var(ctx, fd, var_name);
+            if (var_idx >= 0)
+                break;
+        }
+        if (var_name == JS_ATOM_arguments && fd->has_arguments_binding) {
+            var_idx = add_arguments_var(ctx, fd, var_name);
+            break;
+        }
+        if (fd->is_func_expr && fd->func_name == var_name) {
+            /* add a new variable with the function name */
+            var_idx = add_func_var(ctx, fd, var_name);
+            is_func_var = TRUE;
+            break;
+        }
+
+        /* check eval object */
+        if (fd->var_object_idx >= 0 && !is_pseudo_var) {
+            fd->vars[fd->var_object_idx].is_captured = 1;
+            idx = get_closure_var(ctx, s, fd, FALSE,
+                                  fd->var_object_idx, JS_ATOM__var_,
+                                  FALSE, FALSE, FALSE);
+            dbuf_putc(bc, OP_get_var_ref);
+            dbuf_put_u16(bc, idx);
+            dbuf_putc(bc, get_with_scope_opcode(op));
+            dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+            label_done = new_label_fd(s, label_done);
+            dbuf_put_u32(bc, label_done);
+            dbuf_putc(bc, 0);
+            update_label(s, label_done, 1);
+            s->jump_size++;
+        }
+
+        if (fd->is_eval)
+            break; /* it it necessarily the top level function */
+    }
+
+    /* check direct eval scope (in the closure of the eval function
+       which is necessarily at the top level) */
+    if (!fd)
+        fd = s;
+    if (var_idx < 0 && fd->is_eval) {
+        int idx1;
+        for (idx1 = 0; idx1 < fd->closure_var_count; idx1++) {
+            JSClosureVar *cv = &fd->closure_var[idx1];
+            if (var_name == cv->var_name) {
+                if (fd != s) {
+                    idx = get_closure_var2(ctx, s, fd,
+                                           FALSE,
+                                           cv->is_arg, idx1,
+                                           cv->var_name, cv->is_const,
+                                           cv->is_lexical, cv->is_catch);
+                } else {
+                    idx = idx1;
+                }
+                goto has_idx;
+            } else if ((cv->var_name == JS_ATOM__var_ ||
+                        cv->var_name == JS_ATOM__with_) && !is_pseudo_var) {
+                int is_with = (cv->var_name == JS_ATOM__with_);
+                if (fd != s) {
+                    idx = get_closure_var2(ctx, s, fd,
+                                           FALSE,
+                                           cv->is_arg, idx1,
+                                           cv->var_name, FALSE, FALSE, FALSE);
+                } else {
+                    idx = idx1;
+                }
+                dbuf_putc(bc, OP_get_var_ref);
+                dbuf_put_u16(bc, idx);
+                dbuf_putc(bc, get_with_scope_opcode(op));
+                dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+                label_done = new_label_fd(s, label_done);
+                dbuf_put_u32(bc, label_done);
+                dbuf_putc(bc, is_with);
+                update_label(s, label_done, 1);
+                s->jump_size++;
+            }
+        }
+    }
+
+    if (var_idx >= 0) {
+        /* find the corresponding closure variable */
+        if (var_idx & ARGUMENT_VAR_OFFSET) {
+            fd->args[var_idx - ARGUMENT_VAR_OFFSET].is_captured = 1;
+            idx = get_closure_var(ctx, s, fd,
+                                  TRUE, var_idx - ARGUMENT_VAR_OFFSET,
+                                  var_name, FALSE, FALSE, FALSE);
+        } else {
+            fd->vars[var_idx].is_captured = 1;
+            idx = get_closure_var(ctx, s, fd,
+                                  FALSE, var_idx,
+                                  var_name,
+                                  fd->vars[var_idx].is_const,
+                                  fd->vars[var_idx].is_lexical,
+                                  fd->vars[var_idx].is_catch);
+        }
+        if (idx >= 0) {
+        has_idx:
+            if ((op == OP_scope_put_var || op == OP_scope_make_ref) &&
+                s->closure_var[idx].is_const) {
+                dbuf_putc(bc, OP_throw_var);
+                dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+                dbuf_putc(bc, JS_THROW_VAR_RO);
+                goto done;
+            }
+            switch (op) {
+            case OP_scope_make_ref:
+                if (is_func_var) {
+                    /* Create a dummy object reference for the func_var */
+                    dbuf_putc(bc, OP_object);
+                    dbuf_putc(bc, OP_get_var_ref);
+                    dbuf_put_u16(bc, idx);
+                    dbuf_putc(bc, OP_define_field);
+                    dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+                    dbuf_putc(bc, OP_push_atom_value);
+                    dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+                } else
+                if (label_done == -1 &&
+                    can_opt_put_ref_value(bc_buf, ls->pos)) {
+                    int get_op;
+                    if (s->closure_var[idx].is_lexical)
+                        get_op = OP_get_var_ref_check;
+                    else
+                        get_op = OP_get_var_ref;
+                    pos_next = optimize_scope_make_ref(ctx, s, bc, bc_buf, ls,
+                                                       pos_next,
+                                                       get_op, idx);
+                } else {
+                    /* Create a dummy object with a named slot that is
+                       a reference to the closure variable */
+                    dbuf_putc(bc, OP_make_var_ref_ref);
+                    dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+                    dbuf_put_u16(bc, idx);
+                }
+                break;
+            case OP_scope_get_ref:
+                /* XXX: should create a dummy object with a named slot that is
+                   a reference to the closure variable */
+                dbuf_putc(bc, OP_undefined);
+                /* fall thru */
+            case OP_scope_get_var_undef:
+            case OP_scope_get_var:
+            case OP_scope_put_var:
+            case OP_scope_put_var_init:
+                is_put = (op == OP_scope_put_var ||
+                          op == OP_scope_put_var_init);
+                if (is_put) {
+                    if (s->closure_var[idx].is_lexical) {
+                        if (op == OP_scope_put_var_init) {
+                            /* 'this' can only be initialized once */
+                            if (var_name == JS_ATOM_this)
+                                dbuf_putc(bc, OP_put_var_ref_check_init);
+                            else
+                                dbuf_putc(bc, OP_put_var_ref);
+                        } else {
+                            dbuf_putc(bc, OP_put_var_ref_check);
+                        }
+                    } else {
+                        dbuf_putc(bc, OP_put_var_ref);
+                    }
+                } else {
+                    if (s->closure_var[idx].is_lexical) {
+                        dbuf_putc(bc, OP_get_var_ref_check);
+                    } else {
+                        dbuf_putc(bc, OP_get_var_ref);
+                    }
+                }
+                dbuf_put_u16(bc, idx);
+                break;
+            case OP_scope_delete_var:
+                dbuf_putc(bc, OP_push_false);
+                break;
+            }
+            goto done;
+        }
+    }
+
+    /* global variable access */
+
+    switch (op) {
+    case OP_scope_make_ref:
+        if (label_done == -1 && can_opt_put_global_ref_value(bc_buf, ls->pos)) {
+            pos_next = optimize_scope_make_global_ref(ctx, s, bc, bc_buf, ls,
+                                                      pos_next, var_name);
+        } else {
+            dbuf_putc(bc, OP_make_var_ref);
+            dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+        }
+        break;
+    case OP_scope_get_ref:
+        /* XXX: should create a dummy object with a named slot that is
+           a reference to the global variable */
+        dbuf_putc(bc, OP_undefined);
+        dbuf_putc(bc, OP_get_var);
+        dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+        break;
+    case OP_scope_get_var_undef:
+    case OP_scope_get_var:
+    case OP_scope_put_var:
+        dbuf_putc(bc, OP_get_var_undef + (op - OP_scope_get_var_undef));
+        dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+        break;
+    case OP_scope_put_var_init:
+        dbuf_putc(bc, OP_put_var_init);
+        dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+        break;
+    case OP_scope_delete_var:
+        dbuf_putc(bc, OP_delete_var);
+        dbuf_put_u32(bc, JS_DupAtom(ctx, var_name));
+        break;
+    }
+done:
+    if (label_done >= 0) {
+        dbuf_putc(bc, OP_label);
+        dbuf_put_u32(bc, label_done);
+        s->label_slots[label_done].pos2 = bc->size;
+    }
+    return pos_next;
+}
+
+static void mark_eval_captured_variables(JSContext *ctx, JSFunctionDef *s,
+                                         int scope_level)
+{
+    int idx;
+    JSVarDef *vd;
+
+    for (idx = s->scopes[scope_level].first; idx >= 0;) {
+        vd = &s->vars[idx];
+        vd->is_captured = 1;
+        idx = vd->scope_next;
+    }
+}
+
+static void add_eval_variables(JSContext *ctx, JSFunctionDef *s)
+{
+    JSFunctionDef *fd;
+    JSVarDef *vd;
+    int i, scope_level, scope_idx;
+    BOOL has_arguments_binding, has_this_binding;
+
+    /* in non strict mode, variables are created in the caller's
+       environment object */
+    if (!s->is_eval && !(s->js_mode & JS_MODE_STRICT)) {
+        s->var_object_idx = add_var(ctx, s, JS_ATOM__var_);
+    }
+
+    /* eval can potentially use 'arguments' so we must define it */
+    has_this_binding = s->has_this_binding;
+    if (has_this_binding) {
+        if (s->this_var_idx < 0)
+            s->this_var_idx = add_var_this(ctx, s);
+        if (s->new_target_var_idx < 0)
+            s->new_target_var_idx = add_var(ctx, s, JS_ATOM_new_target);
+        if (s->is_derived_class_constructor && s->this_active_func_var_idx < 0)
+            s->this_active_func_var_idx = add_var(ctx, s, JS_ATOM_this_active_func);
+        if (s->has_home_object && s->home_object_var_idx < 0)
+            s->home_object_var_idx = add_var(ctx, s, JS_ATOM_home_object);
+    }
+    has_arguments_binding = s->has_arguments_binding;
+    if (has_arguments_binding)
+        add_arguments_var(ctx, s, JS_ATOM_arguments);
+    if (s->is_func_expr && s->func_name != JS_ATOM_NULL)
+        add_func_var(ctx, s, s->func_name);
+
+    /* eval can use all the variables of the enclosing functions, so
+       they must be all put in the closure. The closure variables are
+       ordered by scope. It works only because no closure are created
+       before. */
+    assert(s->is_eval || s->closure_var_count == 0);
+
+    /* XXX: inefficient, but eval performance is less critical */
+    fd = s;
+    for(;;) {
+        scope_level = fd->parent_scope_level;
+        fd = fd->parent;
+        if (!fd)
+            break;
+        scope_idx = fd->scopes[scope_level].first;
+        /* add 'this' if it was not previously added */
+        if (!has_this_binding && fd->has_this_binding) {
+            if (fd->this_var_idx < 0)
+                fd->this_var_idx = add_var_this(ctx, fd);
+            if (fd->new_target_var_idx < 0)
+                fd->new_target_var_idx = add_var(ctx, fd, JS_ATOM_new_target);
+            if (fd->is_derived_class_constructor && fd->this_active_func_var_idx < 0)
+                fd->this_active_func_var_idx = add_var(ctx, fd, JS_ATOM_this_active_func);
+            if (fd->has_home_object && fd->home_object_var_idx < 0)
+                fd->home_object_var_idx = add_var(ctx, fd, JS_ATOM_home_object);
+            has_this_binding = TRUE;
+        }
+        /* add 'arguments' if it was not previously added */
+        if (!has_arguments_binding && fd->has_arguments_binding) {
+            add_arguments_var(ctx, fd, JS_ATOM_arguments);
+            has_arguments_binding = TRUE;
+        }
+        /* add function name */
+        if (fd->is_func_expr && fd->func_name != JS_ATOM_NULL)
+            add_func_var(ctx, fd, fd->func_name);
+
+        /* add lexical variables */
+        while (scope_idx >= 0) {
+            vd = &fd->vars[scope_idx];
+            vd->is_captured = 1;
+            get_closure_var(ctx, s, fd, FALSE, scope_idx,
+                            vd->var_name, vd->is_const, vd->is_lexical, vd->is_catch);
+            scope_idx = vd->scope_next;
+        }
+        /* add unscoped variables */
+        for(i = 0; i < fd->arg_count; i++) {
+            vd = &fd->args[i];
+            if (vd->var_name != JS_ATOM_NULL) {
+                get_closure_var(ctx, s, fd,
+                                TRUE, i, vd->var_name, FALSE, FALSE, FALSE);
+            }
+        }
+        for(i = 0; i < fd->var_count; i++) {
+            vd = &fd->vars[i];
+            /* do not close top level last result */
+            if (vd->scope_level == 0 &&
+                vd->var_name != JS_ATOM__ret_ &&
+                vd->var_name != JS_ATOM_NULL) {
+                get_closure_var(ctx, s, fd,
+                                FALSE, i, vd->var_name, FALSE, FALSE, FALSE);
+            }
+        }
+        if (fd->is_eval) {
+            int idx;
+            /* add direct eval variables (we are necessarily at the
+               top level) */
+            for (idx = 0; idx < fd->closure_var_count; idx++) {
+                JSClosureVar *cv = &fd->closure_var[idx];
+                get_closure_var2(ctx, s, fd,
+                                 FALSE, cv->is_arg,
+                                 idx, cv->var_name, cv->is_const,
+                                 cv->is_lexical, cv->is_catch);
+            }
+        }
+    }
+}
+
+/* for direct eval compilation: add references to the variables of the
+   calling function */
+static __exception int add_closure_variables(JSContext *ctx, JSFunctionDef *s,
+                                             JSFunctionBytecode *b, int scope_idx)
+{
+    int i, count;
+    JSVarDef *vd;
+
+    count = b->arg_count + b->var_count + b->closure_var_count;
+    s->closure_var = NULL;
+    s->closure_var_count = 0;
+    s->closure_var_size = count;
+    if (count == 0)
+        return 0;
+    s->closure_var = js_malloc(ctx, sizeof(s->closure_var[0]) * count);
+    if (!s->closure_var)
+        return -1;
+    /* Add lexical variables in scope at the point of evaluation */
+    for (i = scope_idx; i >= 0;) {
+        vd = &b->vardefs[b->arg_count + i];
+        if (vd->scope_level > 0) {
+            JSClosureVar *cv = &s->closure_var[s->closure_var_count++];
+            cv->is_local = TRUE;
+            cv->is_arg = FALSE;
+            cv->is_const = vd->is_const;
+            cv->is_lexical = vd->is_lexical;
+            cv->is_catch = vd->is_catch;
+            cv->var_idx = i;
+            cv->var_name = JS_DupAtom(ctx, vd->var_name);
+        }
+        i = vd->scope_next;
+    }
+    /* Add argument variables */
+    for(i = 0; i < b->arg_count; i++) {
+        JSClosureVar *cv = &s->closure_var[s->closure_var_count++];
+        vd = &b->vardefs[i];
+        cv->is_local = TRUE;
+        cv->is_arg = TRUE;
+        cv->is_const = FALSE;
+        cv->is_lexical = FALSE;
+        cv->is_catch = FALSE;
+        cv->var_idx = i;
+        cv->var_name = JS_DupAtom(ctx, vd->var_name);
+    }
+    /* Add local non lexical variables */
+    for(i = 0; i < b->var_count; i++) {
+        vd = &b->vardefs[b->arg_count + i];
+        if (vd->scope_level == 0 && vd->var_name != JS_ATOM__ret_) {
+            JSClosureVar *cv = &s->closure_var[s->closure_var_count++];
+            cv->is_local = TRUE;
+            cv->is_arg = FALSE;
+            cv->is_const = FALSE;
+            cv->is_lexical = FALSE;
+            cv->is_catch = FALSE;
+            cv->var_idx = i;
+            cv->var_name = JS_DupAtom(ctx, vd->var_name);
+        }
+    }
+    for(i = 0; i < b->closure_var_count; i++) {
+        JSClosureVar *cv0 = &b->closure_var[i];
+        JSClosureVar *cv = &s->closure_var[s->closure_var_count++];
+        cv->is_local = FALSE;
+        cv->is_arg = cv0->is_arg;
+        cv->is_const = cv0->is_const;
+        cv->is_lexical = cv0->is_lexical;
+        cv->is_catch = cv0->is_catch;
+        cv->var_idx = i;
+        cv->var_name = JS_DupAtom(ctx, cv0->var_name);
+    }
+    return 0;
+}
+
+typedef struct CodeContext {
+    const uint8_t *bc_buf; /* code buffer */
+    int bc_len;   /* length of the code buffer */
+    int pos;      /* position past the matched code pattern */
+    int line_num; /* last visited OP_line_num parameter or -1 */
+    int op;
+    int idx;
+    int label;
+    int val;
+    JSAtom atom;
+} CodeContext;
+
+#define M2(op1, op2)            ((op1) | ((op2) << 8))
+#define M3(op1, op2, op3)       ((op1) | ((op2) << 8) | ((op3) << 16))
+#define M4(op1, op2, op3, op4)  ((op1) | ((op2) << 8) | ((op3) << 16) | ((op4) << 24))
+
+static BOOL code_match(CodeContext *s, int pos, ...)
+{
+    const uint8_t *tab = s->bc_buf;
+    int op, len, op1, line_num, pos_next;
+    va_list ap;
+    BOOL ret = FALSE;
+
+    line_num = -1;
+    va_start(ap, pos);
+
+    for(;;) {
+        op1 = va_arg(ap, int);
+        if (op1 == -1) {
+            s->pos = pos;
+            s->line_num = line_num;
+            ret = TRUE;
+            break;
+        }
+        for (;;) {
+            if (pos >= s->bc_len)
+                goto done;
+            op = tab[pos];
+            len = opcode_info[op].size;
+            pos_next = pos + len;
+            if (pos_next > s->bc_len)
+                goto done;
+            if (op == OP_line_num) {
+                line_num = get_u32(tab + pos + 1);
+                pos = pos_next;
+            } else {
+                break;
+            }
+        }
+        if (op != op1) {
+            if (op1 == (uint8_t)op1 || !op)
+                break;
+            if (op != (uint8_t)op1
+            &&  op != (uint8_t)(op1 >> 8)
+            &&  op != (uint8_t)(op1 >> 16)
+            &&  op != (uint8_t)(op1 >> 24)) {
+                break;
+            }
+            s->op = op;
+        }
+
+        pos++;
+        switch(opcode_info[op].fmt) {
+        case OP_FMT_loc8:
+        case OP_FMT_u8:
+            {
+                int idx = tab[pos];
+                int arg = va_arg(ap, int);
+                if (arg == -1) {
+                    s->idx = idx;
+                } else {
+                    if (arg != idx)
+                        goto done;
+                }
+                break;
+            }
+        case OP_FMT_u16:
+        case OP_FMT_npop:
+        case OP_FMT_loc:
+        case OP_FMT_arg:
+        case OP_FMT_var_ref:
+            {
+                int idx = get_u16(tab + pos);
+                int arg = va_arg(ap, int);
+                if (arg == -1) {
+                    s->idx = idx;
+                } else {
+                    if (arg != idx)
+                        goto done;
+                }
+                break;
+            }
+        case OP_FMT_i32:
+        case OP_FMT_u32:
+        case OP_FMT_label:
+        case OP_FMT_const:
+            {
+                s->label = get_u32(tab + pos);
+                break;
+            }
+        case OP_FMT_label_u16:
+            {
+                s->label = get_u32(tab + pos);
+                s->val = get_u16(tab + pos + 4);
+                break;
+            }
+        case OP_FMT_atom:
+            {
+                s->atom = get_u32(tab + pos);
+                break;
+            }
+        case OP_FMT_atom_u8:
+            {
+                s->atom = get_u32(tab + pos);
+                s->val = get_u8(tab + pos + 4);
+                break;
+            }
+        case OP_FMT_atom_u16:
+            {
+                s->atom = get_u32(tab + pos);
+                s->val = get_u16(tab + pos + 4);
+                break;
+            }
+        case OP_FMT_atom_label_u8:
+            {
+                s->atom = get_u32(tab + pos);
+                s->label = get_u32(tab + pos + 4);
+                s->val = get_u8(tab + pos + 8);
+                break;
+            }
+        default:
+            break;
+        }
+        pos = pos_next;
+    }
+ done:
+    va_end(ap);
+    return ret;
+}
+
+static void instantiate_hoisted_definitions(JSContext *ctx, JSFunctionDef *s, DynBuf *bc)
+{
+    int i, idx, var_idx;
+
+    /* add the hoisted functions and variables */
+    for(i = 0; i < s->hoisted_def_count; i++) {
+        JSHoistedDef *hf = &s->hoisted_def[i];
+        int has_closure = 0;
+        BOOL force_init = hf->force_init;
+        if (s->is_global_var && hf->var_name != JS_ATOM_NULL) {
+            /* we are in an eval, so the closure contains all the
+               enclosing variables */
+            /* If the outer function has a variable environment,
+               create a property for the variable there */
+            for(idx = 0; idx < s->closure_var_count; idx++) {
+                JSClosureVar *cv = &s->closure_var[idx];
+                if (cv->var_name == hf->var_name) {
+                    has_closure = 2;
+                    force_init = FALSE;
+                    break;
+                }
+                if (cv->var_name == JS_ATOM__var_) {
+                    dbuf_putc(bc, OP_get_var_ref);
+                    dbuf_put_u16(bc, idx);
+                    has_closure = 1;
+                    force_init = TRUE;
+                    break;
+                }
+            }
+            if (!has_closure) {
+                int flags;
+
+                flags = 0;
+                if (s->eval_type != JS_EVAL_TYPE_GLOBAL)
+                    flags |= JS_PROP_CONFIGURABLE;
+                if (hf->cpool_idx >= 0 && !hf->is_lexical) {
+                    /* global function definitions need a specific handling */
+                    dbuf_putc(bc, OP_fclosure);
+                    dbuf_put_u32(bc, hf->cpool_idx);
+
+                    dbuf_putc(bc, OP_define_func);
+                    dbuf_put_u32(bc, JS_DupAtom(ctx, hf->var_name));
+                    dbuf_putc(bc, flags);
+
+                    goto done_hoisted_def;
+                } else {
+                    if (hf->is_lexical) {
+                        flags |= DEFINE_GLOBAL_LEX_VAR;
+                        if (!hf->is_const)
+                            flags |= JS_PROP_WRITABLE;
+                    }
+                    dbuf_putc(bc, OP_define_var);
+                    dbuf_put_u32(bc, JS_DupAtom(ctx, hf->var_name));
+                    dbuf_putc(bc, flags);
+                }
+            }
+        }
+        if (hf->cpool_idx >= 0 || force_init) {
+            if (hf->cpool_idx >= 0) {
+                dbuf_putc(bc, OP_fclosure);
+                dbuf_put_u32(bc, hf->cpool_idx);
+                if (hf->var_name == JS_ATOM__default_) {
+                    /* set default export function name */
+                    dbuf_putc(bc, OP_set_name);
+                    dbuf_put_u32(bc, JS_DupAtom(ctx, JS_ATOM_default));
+                }
+            } else {
+                dbuf_putc(bc, OP_undefined);
+            }
+            if (s->is_global_var) {
+                if (has_closure == 2) {
+                    dbuf_putc(bc, OP_put_var_ref);
+                    dbuf_put_u16(bc, idx);
+                } else if (has_closure == 1) {
+                    dbuf_putc(bc, OP_define_field);
+                    dbuf_put_u32(bc, JS_DupAtom(ctx, hf->var_name));
+                    dbuf_putc(bc, OP_drop);
+                } else {
+                    /* XXX: Check if variable is writable and enumerable */
+                    dbuf_putc(bc, OP_put_var);
+                    dbuf_put_u32(bc, JS_DupAtom(ctx, hf->var_name));
+                }
+            } else {
+                var_idx = hf->var_idx;
+                if (var_idx & ARGUMENT_VAR_OFFSET) {
+                    dbuf_putc(bc, OP_put_arg);
+                    dbuf_put_u16(bc, var_idx - ARGUMENT_VAR_OFFSET);
+                } else {
+                    dbuf_putc(bc, OP_put_loc);
+                    dbuf_put_u16(bc, var_idx);
+                }
+            }
+        }
+    done_hoisted_def:
+        JS_FreeAtom(ctx, hf->var_name);
+    }
+    js_free(ctx, s->hoisted_def);
+    s->hoisted_def = NULL;
+    s->hoisted_def_count = 0;
+    s->hoisted_def_size = 0;
+}
+
+static int skip_dead_code(JSFunctionDef *s, const uint8_t *bc_buf, int bc_len,
+                          int pos, int *linep)
+{
+    int op, len, label;
+
+    for (; pos < bc_len; pos += len) {
+        op = bc_buf[pos];
+        len = opcode_info[op].size;
+        if (op == OP_line_num) {
+            *linep = get_u32(bc_buf + pos + 1);
+        } else
+        if (op == OP_label) {
+            label = get_u32(bc_buf + pos + 1);
+            if (update_label(s, label, 0) > 0)
+                break;
+#if 0
+            if (s->label_slots[label].first_reloc) {
+                printf("line %d: unreferenced label %d:%d has relocations\n",
+                       *linep, label, s->label_slots[label].pos2);
+            }
+#endif
+            assert(s->label_slots[label].first_reloc == NULL);
+        } else {
+            /* XXX: output a warning for unreachable code? */
+            JSAtom atom;
+            switch(opcode_info[op].fmt) {
+            case OP_FMT_label:
+            case OP_FMT_label_u16:
+                label = get_u32(bc_buf + pos + 1);
+                update_label(s, label, -1);
+                break;
+            case OP_FMT_atom_label_u8:
+            case OP_FMT_atom_label_u16:
+                label = get_u32(bc_buf + pos + 5);
+                update_label(s, label, -1);
+                /* fall thru */
+            case OP_FMT_atom:
+            case OP_FMT_atom_u8:
+            case OP_FMT_atom_u16:
+                atom = get_u32(bc_buf + pos + 1);
+                JS_FreeAtom(s->ctx, atom);
+                break;
+            default:
+                break;
+            }
+        }
+    }
+    return pos;
+}
+
+static int get_label_pos(JSFunctionDef *s, int label)
+{
+    int i, pos;
+    for (i = 0; i < 20; i++) {
+        pos = s->label_slots[label].pos;
+        for (;;) {
+            switch (s->byte_code.buf[pos]) {
+            case OP_line_num:
+            case OP_label:
+                pos += 5;
+                continue;
+            case OP_goto:
+                label = get_u32(s->byte_code.buf + pos + 1);
+                break;
+            default:
+                return pos;
+            }
+            break;
+        }
+    }
+    return pos;
+}
+
+/* convert global variable accesses to local variables or closure
+   variables when necessary */
+static __exception int resolve_variables(JSContext *ctx, JSFunctionDef *s)
+{
+    int pos, pos_next, bc_len, op, len, i, idx, arg_valid, line_num;
+    uint8_t *bc_buf;
+    JSAtom var_name;
+    DynBuf bc_out;
+    CodeContext cc;
+    int scope;
+
+    cc.bc_buf = bc_buf = s->byte_code.buf;
+    cc.bc_len = bc_len = s->byte_code.size;
+    js_dbuf_init(ctx, &bc_out);
+
+    /* first pass for runtime checks (must be done before the
+       variables are created) */
+    if (s->is_global_var) {
+        for(i = 0; i < s->hoisted_def_count; i++) {
+            JSHoistedDef *hf = &s->hoisted_def[i];
+            int flags;
+
+            if (hf->var_name != JS_ATOM_NULL) {
+                /* check if global variable (XXX: simplify) */
+                for(idx = 0; idx < s->closure_var_count; idx++) {
+                    JSClosureVar *cv = &s->closure_var[idx];
+                    if (cv->var_name == hf->var_name) {
+                        if (s->eval_type == JS_EVAL_TYPE_DIRECT &&
+                            (cv->is_lexical ||
+                             (cv->is_catch && hf->is_for_of))) {
+                            /* Check if a lexical variable is
+                               redefined as 'var'. XXX: Could abort
+                               compilation here, but for consistency
+                               with the other checks, we delay the
+                               error generation. */
+                            dbuf_putc(&bc_out, OP_throw_var);
+                            dbuf_put_u32(&bc_out, JS_DupAtom(ctx, hf->var_name));
+                            dbuf_putc(&bc_out, JS_THROW_VAR_REDECL);
+                        }
+                        goto next;
+                    }
+                    if (cv->var_name == JS_ATOM__var_)
+                        goto next;
+                }
+
+                dbuf_putc(&bc_out, OP_check_define_var);
+                dbuf_put_u32(&bc_out, JS_DupAtom(ctx, hf->var_name));
+                flags = 0;
+                if (hf->is_lexical)
+                    flags |= DEFINE_GLOBAL_LEX_VAR;
+                if (hf->cpool_idx >= 0)
+                    flags |= DEFINE_GLOBAL_FUNC_VAR;
+                dbuf_putc(&bc_out, flags);
+            }
+        next: ;
+        }
+    }
+
+    arg_valid = 0;
+    line_num = 0; /* avoid warning */
+    for (pos = 0; pos < bc_len; pos = pos_next) {
+        op = bc_buf[pos];
+        len = opcode_info[op].size;
+        pos_next = pos + len;
+        switch(op) {
+        case OP_line_num:
+            line_num = get_u32(bc_buf + pos + 1);
+            s->line_number_size++;
+            goto no_change;
+
+        case OP_set_arg_valid_upto:
+            arg_valid = get_u16(bc_buf + pos + 1);
+            break;
+        case OP_eval: /* convert scope index to adjusted variable index */
+            scope = get_u16(bc_buf + pos + 1);
+            mark_eval_captured_variables(ctx, s, scope);
+            dbuf_putc(&bc_out, op);
+            dbuf_put_u16(&bc_out, s->scopes[scope].first + 1);
+            break;
+        case OP_scope_get_var_undef:
+        case OP_scope_get_var:
+        case OP_scope_put_var:
+        case OP_scope_delete_var:
+        case OP_scope_get_ref:
+        case OP_scope_put_var_init:
+            var_name = get_u32(bc_buf + pos + 1);
+            scope = get_u16(bc_buf + pos + 5);
+            pos_next = resolve_scope_var(ctx, s, var_name, scope, op, &bc_out,
+                                         NULL, NULL, pos_next, arg_valid);
+            JS_FreeAtom(ctx, var_name);
+            break;
+        case OP_scope_make_ref:
+            {
+                int label;
+                LabelSlot *ls;
+                var_name = get_u32(bc_buf + pos + 1);
+                label = get_u32(bc_buf + pos + 5);
+                scope = get_u16(bc_buf + pos + 9);
+                ls = &s->label_slots[label];
+                ls->ref_count--;  /* always remove label reference */
+                pos_next = resolve_scope_var(ctx, s, var_name, scope, op, &bc_out,
+                                             bc_buf, ls, pos_next, arg_valid);
+                JS_FreeAtom(ctx, var_name);
+            }
+            break;
+
+        case OP_gosub:
+            s->jump_size++;
+            if (OPTIMIZE) {
+                /* remove calls to empty finalizers  */
+                int label;
+                LabelSlot *ls;
+
+                label = get_u32(bc_buf + pos + 1);
+                assert(label >= 0 && label < s->label_count);
+                ls = &s->label_slots[label];
+                if (code_match(&cc, ls->pos, OP_ret, -1)) {
+                    ls->ref_count--;
+                    break;
+                }
+            }
+            goto no_change;
+        case OP_drop:
+            if (0) {
+                /* remove drops before return_undef */
+                /* do not perform this optimization in pass2 because
+                   it breaks patterns recognised in resolve_labels */
+                int pos1 = pos_next;
+                int line1 = line_num;
+                while (code_match(&cc, pos1, OP_drop, -1)) {
+                    if (cc.line_num >= 0) line1 = cc.line_num;
+                    pos1 = cc.pos;
+                }
+                if (code_match(&cc, pos1, OP_return_undef, -1)) {
+                    pos_next = pos1;
+                    if (line1 != -1 && line1 != line_num) {
+                        line_num = line1;
+                        s->line_number_size++;
+                        dbuf_putc(&bc_out, OP_line_num);
+                        dbuf_put_u32(&bc_out, line_num);
+                    }
+                    break;
+                }
+            }
+            goto no_change;
+        case OP_insert3:
+            if (OPTIMIZE) {
+                /* Transformation: insert3 put_array_el|put_ref_value drop -> put_array_el|put_ref_value */
+                if (code_match(&cc, pos_next, M2(OP_put_array_el, OP_put_ref_value), OP_drop, -1)) {
+                    dbuf_putc(&bc_out, cc.op);
+                    pos_next = cc.pos;
+                    if (cc.line_num != -1 && cc.line_num != line_num) {
+                        line_num = cc.line_num;
+                        s->line_number_size++;
+                        dbuf_putc(&bc_out, OP_line_num);
+                        dbuf_put_u32(&bc_out, line_num);
+                    }
+                    break;
+                }
+            }
+            goto no_change;
+
+        case OP_goto:
+            s->jump_size++;
+            /* fall thru */
+        case OP_tail_call:
+        case OP_tail_call_method:
+        case OP_return:
+        case OP_return_undef:
+        case OP_throw:
+        case OP_throw_var:
+        case OP_ret:
+            if (OPTIMIZE) {
+                /* remove dead code */
+                int line = -1;
+                dbuf_put(&bc_out, bc_buf + pos, len);
+                pos = skip_dead_code(s, bc_buf, bc_len, pos + len, &line);
+                pos_next = pos;
+                if (pos < bc_len && line >= 0 && line_num != line) {
+                    line_num = line;
+                    s->line_number_size++;
+                    dbuf_putc(&bc_out, OP_line_num);
+                    dbuf_put_u32(&bc_out, line_num);
+                }
+                break;
+            }
+            goto no_change;
+
+        case OP_label:
+            {
+                int label;
+                LabelSlot *ls;
+
+                label = get_u32(bc_buf + pos + 1);
+                assert(label >= 0 && label < s->label_count);
+                ls = &s->label_slots[label];
+                ls->pos2 = bc_out.size + opcode_info[op].size;
+            }
+            goto no_change;
+
+        case OP_enter_scope:
+            {
+                int scope_idx, scope = get_u16(bc_buf + pos + 1);
+
+                if (scope == 1) {
+                    instantiate_hoisted_definitions(ctx, s, &bc_out);
+                }
+
+                for(scope_idx = s->scopes[scope].first; scope_idx >= 0;) {
+                    JSVarDef *vd = &s->vars[scope_idx];
+                    if (vd->scope_level == scope) {
+                        if (vd->is_function) {
+                            /* Initialize lexical variable upon entering scope */
+                            dbuf_putc(&bc_out, OP_fclosure);
+                            dbuf_put_u32(&bc_out, vd->func_pool_idx);
+                            dbuf_putc(&bc_out, OP_put_loc);
+                            dbuf_put_u16(&bc_out, scope_idx);
+                        } else {
+                            /* XXX: should check if variable can be used
+                               before initialization */
+                            dbuf_putc(&bc_out, OP_set_loc_uninitialized);
+                            dbuf_put_u16(&bc_out, scope_idx);
+                        }
+                        scope_idx = vd->scope_next;
+                    } else {
+                        break;
+                    }
+                }
+            }
+            break;
+
+        case OP_leave_scope:
+            {
+                int scope_idx, scope = get_u16(bc_buf + pos + 1);
+
+                for(scope_idx = s->scopes[scope].first; scope_idx >= 0;) {
+                    JSVarDef *vd = &s->vars[scope_idx];
+                    if (vd->scope_level == scope) {
+                        if (vd->is_captured) {
+                            dbuf_putc(&bc_out, OP_close_loc);
+                            dbuf_put_u16(&bc_out, scope_idx);
+                        }
+                        scope_idx = vd->scope_next;
+                    } else {
+                        break;
+                    }
+                }
+            }
+            break;
+
+        case OP_set_name:
+            {
+                /* remove dummy set_name opcodes */
+                JSAtom name = get_u32(bc_buf + pos + 1);
+                if (name == JS_ATOM_NULL)
+                    break;
+            }
+            goto no_change;
+
+        case OP_if_false:
+        case OP_if_true:
+        case OP_catch:
+            s->jump_size++;
+            goto no_change;
+
+        case OP_dup:
+            if (OPTIMIZE) {
+                /* Transformation: dup if_false(l1) drop, l1: if_false(l2) -> if_false(l2) */
+                /* Transformation: dup if_true(l1) drop, l1: if_true(l2) -> if_true(l2) */
+                if (code_match(&cc, pos_next, M2(OP_if_false, OP_if_true), OP_drop, -1)) {
+                    int lab0, lab1, op1, pos1, line1, pos2;
+                    lab0 = lab1 = cc.label;
+                    assert(lab1 >= 0 && lab1 < s->label_count);
+                    op1 = cc.op;
+                    pos1 = cc.pos;
+                    line1 = cc.line_num;
+                    while (code_match(&cc, (pos2 = get_label_pos(s, lab1)), OP_dup, op1, OP_drop, -1)) {
+                        lab1 = cc.label;
+                    }
+                    if (code_match(&cc, pos2, op1, -1)) {
+                        s->jump_size++;
+                        update_label(s, lab0, -1);
+                        update_label(s, cc.label, +1);
+                        dbuf_putc(&bc_out, op1);
+                        dbuf_put_u32(&bc_out, cc.label);
+                        pos_next = pos1;
+                        if (line1 != -1 && line1 != line_num) {
+                            line_num = line1;
+                            s->line_number_size++;
+                            dbuf_putc(&bc_out, OP_line_num);
+                            dbuf_put_u32(&bc_out, line_num);
+                        }
+                        break;
+                    }
+                }
+            }
+            goto no_change;
+
+        case OP_nop:
+            /* remove erased code */
+            break;
+
+        default:
+        no_change:
+            dbuf_put(&bc_out, bc_buf + pos, len);
+            break;
+        }
+    }
+
+    /* set the new byte code */
+    dbuf_free(&s->byte_code);
+    s->byte_code = bc_out;
+    if (dbuf_error(&s->byte_code)) {
+        JS_ThrowOutOfMemory(ctx);
+        return -1;
+    }
+    return 0;
+}
+
+/* the pc2line table gives a line number for each PC value */
+static void add_pc2line_info(JSFunctionDef *s, uint32_t pc, int line_num)
+{
+    if (s->line_number_slots != NULL
+    &&  s->line_number_count < s->line_number_size
+    &&  pc >= s->line_number_last_pc
+    &&  line_num != s->line_number_last) {
+        s->line_number_slots[s->line_number_count].pc = pc;
+        s->line_number_slots[s->line_number_count].line_num = line_num;
+        s->line_number_count++;
+        s->line_number_last_pc = pc;
+        s->line_number_last = line_num;
+    }
+}
+
+static void compute_pc2line_info(JSFunctionDef *s)
+{
+    if (!(s->js_mode & JS_MODE_STRIP) && s->line_number_slots) {
+        int last_line_num = s->line_num;
+        uint32_t last_pc = 0;
+        int i;
+
+        js_dbuf_init(s->ctx, &s->pc2line);
+        for (i = 0; i < s->line_number_count; i++) {
+            uint32_t pc = s->line_number_slots[i].pc;
+            int line_num = s->line_number_slots[i].line_num;
+            int diff_pc, diff_line;
+
+            if (line_num < 0)
+                continue;
+
+            diff_pc = pc - last_pc;
+            diff_line = line_num - last_line_num;
+            if (diff_line == 0 || diff_pc < 0)
+                continue;
+
+            if (diff_line >= PC2LINE_BASE &&
+                diff_line < PC2LINE_BASE + PC2LINE_RANGE &&
+                diff_pc <= PC2LINE_DIFF_PC_MAX) {
+                dbuf_putc(&s->pc2line, (diff_line - PC2LINE_BASE) +
+                          diff_pc * PC2LINE_RANGE + PC2LINE_OP_FIRST);
+            } else {
+                /* longer encoding */
+                dbuf_putc(&s->pc2line, 0);
+                dbuf_put_leb128(&s->pc2line, diff_pc);
+                dbuf_put_sleb128(&s->pc2line, diff_line);
+            }
+            last_pc = pc;
+            last_line_num = line_num;
+        }
+    }
+}
+
+static RelocEntry *add_reloc(JSContext *ctx, LabelSlot *ls, uint32_t addr, int size)
+{
+    RelocEntry *re;
+    re = js_malloc(ctx, sizeof(*re));
+    if (!re)
+        return NULL;
+    re->addr = addr;
+    re->size = size;
+    re->next = ls->first_reloc;
+    ls->first_reloc = re;
+    return re;
+}
+
+static BOOL code_has_label(CodeContext *s, int pos, int label)
+{
+    while (pos < s->bc_len) {
+        int op = s->bc_buf[pos];
+        if (op == OP_line_num) {
+            pos += 5;
+            continue;
+        }
+        if (op == OP_label) {
+            int lab = get_u32(s->bc_buf + pos + 1);
+            if (lab == label)
+                return TRUE;
+            pos += 5;
+            continue;
+        }
+        if (op == OP_goto) {
+            int lab = get_u32(s->bc_buf + pos + 1);
+            if (lab == label)
+                return TRUE;
+        }
+        break;
+    }
+    return FALSE;
+}
+
+/* return the target label, following the OP_goto jumps
+   the first opcode at destination is stored in *pop
+ */
+static int find_jump_target(JSFunctionDef *s, int label, int *pop, int *pline)
+{
+    int i, pos, op;
+
+    update_label(s, label, -1);
+    for (i = 0; i < 10; i++) {
+        assert(label >= 0 && label < s->label_count);
+        pos = s->label_slots[label].pos2;
+        for (;;) {
+            switch(op = s->byte_code.buf[pos]) {
+            case OP_line_num:
+                if (pline)
+                    *pline = get_u32(s->byte_code.buf + pos + 1);
+                /* fall thru */
+            case OP_label:
+                pos += opcode_info[op].size;
+                continue;
+            case OP_goto:
+                label = get_u32(s->byte_code.buf + pos + 1);
+                break;
+            case OP_drop:
+                /* ignore drop opcodes if followed by OP_return_undef */
+                while (s->byte_code.buf[++pos] == OP_drop)
+                    continue;
+                if (s->byte_code.buf[pos] == OP_return_undef)
+                    op = OP_return_undef;
+                /* fall thru */
+            default:
+                goto done;
+            }
+            break;
+        }
+    }
+    /* cycle detected, could issue a warning */
+ done:
+    *pop = op;
+    update_label(s, label, +1);
+    return label;
+}
+
+static void push_short_int(DynBuf *bc_out, int val)
+{
+#if SHORT_OPCODES
+    if (val >= -1 && val <= 7) {
+        dbuf_putc(bc_out, OP_push_0 + val);
+        return;
+    }
+    if (val == (int8_t)val) {
+        dbuf_putc(bc_out, OP_push_i8);
+        dbuf_putc(bc_out, val);
+        return;
+    }
+    if (val == (int16_t)val) {
+        dbuf_putc(bc_out, OP_push_i16);
+        dbuf_put_u16(bc_out, val);
+        return;
+    }
+#endif
+    dbuf_putc(bc_out, OP_push_i32);
+    dbuf_put_u32(bc_out, val);
+}
+
+static void put_short_code(DynBuf *bc_out, int op, int idx)
+{
+#if SHORT_OPCODES
+    if (idx < 4) {
+        switch (op) {
+        case OP_get_loc:
+            dbuf_putc(bc_out, OP_get_loc0 + idx);
+            return;
+        case OP_put_loc:
+            dbuf_putc(bc_out, OP_put_loc0 + idx);
+            return;
+        case OP_set_loc:
+            dbuf_putc(bc_out, OP_set_loc0 + idx);
+            return;
+        case OP_get_arg:
+            dbuf_putc(bc_out, OP_get_arg0 + idx);
+            return;
+        case OP_put_arg:
+            dbuf_putc(bc_out, OP_put_arg0 + idx);
+            return;
+        case OP_set_arg:
+            dbuf_putc(bc_out, OP_set_arg0 + idx);
+            return;
+        case OP_get_var_ref:
+            dbuf_putc(bc_out, OP_get_var_ref0 + idx);
+            return;
+        case OP_put_var_ref:
+            dbuf_putc(bc_out, OP_put_var_ref0 + idx);
+            return;
+        case OP_set_var_ref:
+            dbuf_putc(bc_out, OP_set_var_ref0 + idx);
+            return;
+        case OP_call:
+            dbuf_putc(bc_out, OP_call0 + idx);
+            return;
+        }
+    }
+    if (idx < 256) {
+        switch (op) {
+        case OP_get_loc:
+            dbuf_putc(bc_out, OP_get_loc8);
+            dbuf_putc(bc_out, idx);
+            return;
+        case OP_put_loc:
+            dbuf_putc(bc_out, OP_put_loc8);
+            dbuf_putc(bc_out, idx);
+            return;
+        case OP_set_loc:
+            dbuf_putc(bc_out, OP_set_loc8);
+            dbuf_putc(bc_out, idx);
+            return;
+        }
+    }
+#endif
+    dbuf_putc(bc_out, op);
+    dbuf_put_u16(bc_out, idx);
+}
+
+/* peephole optimizations and resolve goto/labels */
+static __exception int resolve_labels(JSContext *ctx, JSFunctionDef *s)
+{
+    int pos, pos_next, bc_len, op, op1, len, i, line_num;
+    const uint8_t *bc_buf;
+    DynBuf bc_out;
+    LabelSlot *label_slots, *ls;
+    RelocEntry *re, *re_next;
+    CodeContext cc;
+    int label;
+#if SHORT_OPCODES
+    JumpSlot *jp;
+#endif
+
+    label_slots = s->label_slots;
+
+    line_num = s->line_num;
+
+    cc.bc_buf = bc_buf = s->byte_code.buf;
+    cc.bc_len = bc_len = s->byte_code.size;
+    js_dbuf_init(ctx, &bc_out);
+
+#if SHORT_OPCODES
+    if (s->jump_size) {
+        s->jump_slots = js_mallocz(s->ctx, sizeof(*s->jump_slots) * s->jump_size);
+        if (s->jump_slots == NULL)
+            return -1;
+    }
+#endif
+    /* XXX: Should skip this phase if not generating SHORT_OPCODES */
+    if (s->line_number_size && !(s->js_mode & JS_MODE_STRIP)) {
+        s->line_number_slots = js_mallocz(s->ctx, sizeof(*s->line_number_slots) * s->line_number_size);
+        if (s->line_number_slots == NULL)
+            return -1;
+        s->line_number_last = s->line_num;
+        s->line_number_last_pc = 0;
+    }
+
+    /* initialize the 'home_object' variable if needed */
+    if (s->home_object_var_idx >= 0) {
+        dbuf_putc(&bc_out, OP_home_object);
+        put_short_code(&bc_out, OP_put_loc, s->home_object_var_idx);
+    }
+    /* initialize the 'this.active_func' variable if needed */
+    if (s->this_active_func_var_idx >= 0) {
+        dbuf_putc(&bc_out, OP_this_func);
+        put_short_code(&bc_out, OP_put_loc, s->this_active_func_var_idx);
+    }
+    /* initialize the 'new.target' variable if needed */
+    if (s->new_target_var_idx >= 0) {
+        dbuf_putc(&bc_out, OP_new_target);
+        put_short_code(&bc_out, OP_put_loc, s->new_target_var_idx);
+    }
+    /* initialize the 'this' variable if needed. In a derived class
+       constructor, this is initially uninitialized. */
+    if (s->this_var_idx >= 0) {
+        if (s->is_derived_class_constructor) {
+            dbuf_putc(&bc_out, OP_set_loc_uninitialized);
+            dbuf_put_u16(&bc_out, s->this_var_idx);
+        } else {
+            dbuf_putc(&bc_out, OP_push_this);
+            put_short_code(&bc_out, OP_put_loc, s->this_var_idx);
+        }
+    }
+    /* initialize the 'arguments' variable if needed */
+    if (s->arguments_var_idx >= 0) {
+        if ((s->js_mode & JS_MODE_STRICT) || !s->has_simple_parameter_list) {
+            dbuf_putc(&bc_out, OP_arguments);
+            dbuf_putc(&bc_out, 0);
+        } else {
+            dbuf_putc(&bc_out, OP_arguments);
+            dbuf_putc(&bc_out, 1);
+        }
+        put_short_code(&bc_out, OP_put_loc, s->arguments_var_idx);
+    }
+    /* initialize a reference to the current function if needed */
+    if (s->func_var_idx >= 0) {
+        dbuf_putc(&bc_out, OP_this_func);
+        put_short_code(&bc_out, OP_put_loc, s->func_var_idx);
+    }
+    /* initialize the variable environment object if needed */
+    if (s->var_object_idx >= 0) {
+        dbuf_putc(&bc_out, OP_var_object);
+        put_short_code(&bc_out, OP_put_loc, s->var_object_idx);
+    }
+
+    for (pos = 0; pos < bc_len; pos = pos_next) {
+        int val;
+        op = bc_buf[pos];
+        len = opcode_info[op].size;
+        pos_next = pos + len;
+        switch(op) {
+        case OP_close_var_object:
+            {
+                if (s->var_object_idx >= 0) {
+                    /* close the var object and create a new one */
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    dbuf_putc(&bc_out, OP_close_loc);
+                    dbuf_put_u16(&bc_out, s->var_object_idx);
+                    dbuf_putc(&bc_out, OP_var_object);
+                    put_short_code(&bc_out, OP_put_loc, s->var_object_idx);
+                }
+            }
+            break;
+
+        case OP_line_num:
+            /* line number info (for debug). We put it in a separate
+               compressed table to reduce memory usage and get better
+               performance */
+            line_num = get_u32(bc_buf + pos + 1);
+            break;
+
+        case OP_label:
+            {
+                label = get_u32(bc_buf + pos + 1);
+                assert(label >= 0 && label < s->label_count);
+                ls = &label_slots[label];
+                assert(ls->addr == -1);
+                ls->addr = bc_out.size;
+                /* resolve the relocation entries */
+                for(re = ls->first_reloc; re != NULL; re = re_next) {
+                    int diff = ls->addr - re->addr;
+                    re_next = re->next;
+                    switch (re->size) {
+                    case 4:
+                        put_u32(bc_out.buf + re->addr, diff);
+                        break;
+                    case 2:
+                        assert(diff == (int16_t)diff);
+                        put_u16(bc_out.buf + re->addr, diff);
+                        break;
+                    case 1:
+                        assert(diff == (int8_t)diff);
+                        put_u8(bc_out.buf + re->addr, diff);
+                        break;
+                    }
+                    js_free(ctx, re);
+                }
+                ls->first_reloc = NULL;
+            }
+            break;
+
+        case OP_call:
+        case OP_call_method:
+            {
+                /* detect and transform tail calls */
+                int argc;
+                argc = get_u16(bc_buf + pos + 1);
+                if (code_match(&cc, pos_next, OP_return, -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    put_short_code(&bc_out, op + 1, argc);
+                    pos_next = skip_dead_code(s, bc_buf, bc_len, cc.pos, &line_num);
+                    break;
+                }
+                add_pc2line_info(s, bc_out.size, line_num);
+                put_short_code(&bc_out, op, argc);
+                break;
+            }
+            goto no_change;
+
+        case OP_return:
+        case OP_return_undef:
+        case OP_return_async:
+        case OP_throw:
+        case OP_throw_var:
+            pos_next = skip_dead_code(s, bc_buf, bc_len, pos_next, &line_num);
+            goto no_change;
+
+        case OP_goto:
+            label = get_u32(bc_buf + pos + 1);
+        has_goto:
+            if (OPTIMIZE) {
+                int line1 = -1;
+                /* Use custom matcher because multiple labels can follow */
+                label = find_jump_target(s, label, &op1, &line1);
+                if (code_has_label(&cc, pos_next, label)) {
+                    /* jump to next instruction: remove jump */
+                    update_label(s, label, -1);
+                    break;
+                }
+                if (op1 == OP_return || op1 == OP_return_undef || op1 == OP_throw) {
+                    /* jump to return/throw: remove jump, append return/throw */
+                    /* updating the line number obfuscates assembly listing */
+                    //if (line1 >= 0) line_num = line1;
+                    update_label(s, label, -1);
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    dbuf_putc(&bc_out, op1);
+                    pos_next = skip_dead_code(s, bc_buf, bc_len, pos_next, &line_num);
+                    break;
+                }
+                /* XXX: should duplicate single instructions followed by goto or return */
+                /* For example, can match one of these followed by return:
+                   push_i32 / push_const / push_atom_value / get_var /
+                   undefined / null / push_false / push_true / get_ref_value /
+                   get_loc / get_arg / get_var_ref
+                 */
+            }
+            goto has_label;
+
+        case OP_gosub:
+            label = get_u32(bc_buf + pos + 1);
+            if (0 && OPTIMIZE) {
+                label = find_jump_target(s, label, &op1, NULL);
+                if (op1 == OP_ret) {
+                    update_label(s, label, -1);
+                    /* empty finally clause: remove gosub */
+                    break;
+                }
+            }
+            goto has_label;
+
+        case OP_catch:
+            label = get_u32(bc_buf + pos + 1);
+            goto has_label;
+
+        case OP_if_true:
+        case OP_if_false:
+            label = get_u32(bc_buf + pos + 1);
+            if (OPTIMIZE) {
+                label = find_jump_target(s, label, &op1, NULL);
+                /* transform if_false/if_true(l1) label(l1) -> drop label(l1) */
+                if (code_has_label(&cc, pos_next, label)) {
+                    update_label(s, label, -1);
+                    dbuf_putc(&bc_out, OP_drop);
+                    break;
+                }
+                /* transform if_false(l1) goto(l2) label(l1) -> if_false(l2) label(l1) */
+                if (code_match(&cc, pos_next, OP_goto, -1)) {
+                    int pos1 = cc.pos;
+                    int line1 = cc.line_num;
+                    if (code_has_label(&cc, pos1, label)) {
+                        if (line1 >= 0) line_num = line1;
+                        pos_next = pos1;
+                        update_label(s, label, -1);
+                        label = cc.label;
+                        op ^= OP_if_true ^ OP_if_false;
+                    }
+                }
+            }
+        has_label:
+            add_pc2line_info(s, bc_out.size, line_num);
+            if (op == OP_goto) {
+                pos_next = skip_dead_code(s, bc_buf, bc_len, pos_next, &line_num);
+            }
+            assert(label >= 0 && label < s->label_count);
+            ls = &label_slots[label];
+#if SHORT_OPCODES
+            jp = &s->jump_slots[s->jump_count++];
+            jp->op = op;
+            jp->size = 4;
+            jp->pos = bc_out.size + 1;
+            jp->label = label;
+
+            if (ls->addr == -1) {
+                int diff = ls->pos2 - pos - 1;
+                if (diff < 128 && (op == OP_if_false || op == OP_if_true || op == OP_goto)) {
+                    jp->size = 1;
+                    jp->op = OP_if_false8 + (op - OP_if_false);
+                    dbuf_putc(&bc_out, OP_if_false8 + (op - OP_if_false));
+                    dbuf_putc(&bc_out, 0);
+                    if (!add_reloc(ctx, ls, bc_out.size - 1, 1))
+                        goto fail;
+                    break;
+                }
+                if (diff < 32768 && op == OP_goto) {
+                    jp->size = 2;
+                    jp->op = OP_goto16;
+                    dbuf_putc(&bc_out, OP_goto16);
+                    dbuf_put_u16(&bc_out, 0);
+                    if (!add_reloc(ctx, ls, bc_out.size - 2, 2))
+                        goto fail;
+                    break;
+                }
+            } else {
+                int diff = ls->addr - bc_out.size - 1;
+                if (diff == (int8_t)diff && (op == OP_if_false || op == OP_if_true || op == OP_goto)) {
+                    jp->size = 1;
+                    jp->op = OP_if_false8 + (op - OP_if_false);
+                    dbuf_putc(&bc_out, OP_if_false8 + (op - OP_if_false));
+                    dbuf_putc(&bc_out, diff);
+                    break;
+                }
+                if (diff == (int16_t)diff && op == OP_goto) {
+                    jp->size = 2;
+                    jp->op = OP_goto16;
+                    dbuf_putc(&bc_out, OP_goto16);
+                    dbuf_put_u16(&bc_out, diff);
+                    break;
+                }
+            }
+#endif
+            dbuf_putc(&bc_out, op);
+            dbuf_put_u32(&bc_out, ls->addr - bc_out.size);
+            if (ls->addr == -1) {
+                /* unresolved yet: create a new relocation entry */
+                if (!add_reloc(ctx, ls, bc_out.size - 4, 4))
+                    goto fail;
+            }
+            break;
+        case OP_with_get_var:
+        case OP_with_put_var:
+        case OP_with_delete_var:
+        case OP_with_make_ref:
+        case OP_with_get_ref:
+        case OP_with_get_ref_undef:
+            {
+                JSAtom atom;
+                int is_with;
+
+                atom = get_u32(bc_buf + pos + 1);
+                label = get_u32(bc_buf + pos + 5);
+                is_with = bc_buf[pos + 9];
+                if (OPTIMIZE) {
+                    label = find_jump_target(s, label, &op1, NULL);
+                }
+                assert(label >= 0 && label < s->label_count);
+                ls = &label_slots[label];
+                add_pc2line_info(s, bc_out.size, line_num);
+#if SHORT_OPCODES
+                jp = &s->jump_slots[s->jump_count++];
+                jp->op = op;
+                jp->size = 4;
+                jp->pos = bc_out.size + 5;
+                jp->label = label;
+#endif
+                dbuf_putc(&bc_out, op);
+                dbuf_put_u32(&bc_out, atom);
+                dbuf_put_u32(&bc_out, ls->addr - bc_out.size);
+                if (ls->addr == -1) {
+                    /* unresolved yet: create a new relocation entry */
+                    if (!add_reloc(ctx, ls, bc_out.size - 4, 4))
+                        goto fail;
+                }
+                dbuf_putc(&bc_out, is_with);
+            }
+            break;
+
+        case OP_drop:
+            if (OPTIMIZE) {
+                /* remove useless drops before return */
+                if (code_match(&cc, pos_next, OP_return_undef, -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    break;
+                }
+            }
+            goto no_change;
+
+        case OP_null:
+#if SHORT_OPCODES
+            if (OPTIMIZE) {
+                /* transform null strict_eq into is_null */
+                if (code_match(&cc, pos_next, OP_strict_eq, -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    dbuf_putc(&bc_out, OP_is_null);
+                    pos_next = cc.pos;
+                    break;
+                }
+                /* transform null strict_neq if_false/if_true -> is_null if_true/if_false */
+                if (code_match(&cc, pos_next, OP_strict_neq, M2(OP_if_false, OP_if_true), -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    dbuf_putc(&bc_out, OP_is_null);
+                    pos_next = cc.pos;
+                    label = cc.label;
+                    op = cc.op ^ OP_if_false ^ OP_if_true;
+                    goto has_label;
+                }
+            }
+#endif
+            /* fall thru */
+        case OP_push_false:
+        case OP_push_true:
+            if (OPTIMIZE) {
+                val = (op == OP_push_true);
+                if (code_match(&cc, pos_next, M2(OP_if_false, OP_if_true), -1)) {
+                has_constant_test:
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    if (val == cc.op - OP_if_false) {
+                        /* transform null if_false(l1) -> goto l1 */
+                        /* transform false if_false(l1) -> goto l1 */
+                        /* transform true if_true(l1) -> goto l1 */
+                        pos_next = cc.pos;
+                        op = OP_goto;
+                        label = cc.label;
+                        goto has_goto;
+                    } else {
+                        /* transform null if_true(l1) -> nop */
+                        /* transform false if_true(l1) -> nop */
+                        /* transform true if_false(l1) -> nop */
+                        pos_next = cc.pos;
+                        update_label(s, cc.label, -1);
+                        break;
+                    }
+                }
+            }
+            goto no_change;
+
+        case OP_push_i32:
+            if (OPTIMIZE) {
+                /* transform i32(val) neg -> i32(-val) */
+                val = get_i32(bc_buf + pos + 1);
+                if ((val != INT32_MIN && val != 0)
+                &&  code_match(&cc, pos_next, OP_neg, -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    if (code_match(&cc, cc.pos, OP_drop, -1)) {
+                        if (cc.line_num >= 0) line_num = cc.line_num;
+                    } else {
+                        add_pc2line_info(s, bc_out.size, line_num);
+                        push_short_int(&bc_out, -val);
+                    }
+                    pos_next = cc.pos;
+                    break;
+                }
+                /* remove push/drop pairs generated by the parser */
+                if (code_match(&cc, pos_next, OP_drop, -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    pos_next = cc.pos;
+                    break;
+                }
+                /* Optimize constant tests: `if (0)`, `if (1)`, `if (!0)`... */
+                if (code_match(&cc, pos_next, M2(OP_if_false, OP_if_true), -1)) {
+                    val = (val != 0);
+                    goto has_constant_test;
+                }
+                add_pc2line_info(s, bc_out.size, line_num);
+                push_short_int(&bc_out, val);
+                break;
+            }
+            goto no_change;
+
+#if SHORT_OPCODES
+        case OP_push_const:
+        case OP_fclosure:
+            if (OPTIMIZE) {
+                int idx = get_u32(bc_buf + pos + 1);
+                if (idx < 256) {
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    dbuf_putc(&bc_out, OP_push_const8 + op - OP_push_const);
+                    dbuf_putc(&bc_out, idx);
+                    break;
+                }
+            }
+            goto no_change;
+
+        case OP_get_field:
+            if (OPTIMIZE) {
+                JSAtom atom = get_u32(bc_buf + pos + 1);
+                if (atom == JS_ATOM_length) {
+                    JS_FreeAtom(ctx, atom);
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    dbuf_putc(&bc_out, OP_get_length);
+                    break;
+                }
+            }
+            goto no_change;
+        case OP_push_atom_value:
+            if (OPTIMIZE) {
+                JSAtom atom = get_u32(bc_buf + pos + 1);
+                if (atom == JS_ATOM_empty_string) {
+                    JS_FreeAtom(ctx, atom);
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    dbuf_putc(&bc_out, OP_push_empty_string);
+                    break;
+                }
+            }
+            goto no_change;
+#endif
+        case OP_to_propkey:
+        case OP_to_propkey2:
+            if (OPTIMIZE) {
+                /* remove redundant to_propkey/to_propkey2 opcodes when storing simple data */
+                if (code_match(&cc, pos_next, M3(OP_get_loc, OP_get_arg, OP_get_var_ref), -1, OP_put_array_el, -1)
+                ||  code_match(&cc, pos_next, M3(OP_push_i32, OP_push_const, OP_push_atom_value), OP_put_array_el, -1)
+                ||  code_match(&cc, pos_next, M4(OP_undefined, OP_null, OP_push_true, OP_push_false), OP_put_array_el, -1)) {
+                    break;
+                }
+            }
+            goto no_change;
+
+        case OP_undefined:
+            if (OPTIMIZE) {
+                /* remove push/drop pairs generated by the parser */
+                if (code_match(&cc, pos_next, OP_drop, -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    pos_next = cc.pos;
+                    break;
+                }
+                /* transform undefined return -> return_undefined */
+                if (code_match(&cc, pos_next, OP_return, -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    dbuf_putc(&bc_out, OP_return_undef);
+                    pos_next = cc.pos;
+                    break;
+                }
+                /* transform undefined if_true(l1)/if_false(l1) -> nop/goto(l1) */
+                if (code_match(&cc, pos_next, M2(OP_if_false, OP_if_true), -1)) {
+                    val = 0;
+                    goto has_constant_test;
+                }
+#if SHORT_OPCODES
+                /* transform undefined strict_eq -> is_undefined */
+                if (code_match(&cc, pos_next, OP_strict_eq, -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    dbuf_putc(&bc_out, OP_is_undefined);
+                    pos_next = cc.pos;
+                    break;
+                }
+                /* transform undefined strict_neq if_false/if_true -> is_undefined if_true/if_false */
+                if (code_match(&cc, pos_next, OP_strict_neq, M2(OP_if_false, OP_if_true), -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    dbuf_putc(&bc_out, OP_is_undefined);
+                    pos_next = cc.pos;
+                    label = cc.label;
+                    op = cc.op ^ OP_if_false ^ OP_if_true;
+                    goto has_label;
+                }
+#endif
+            }
+            goto no_change;
+
+        case OP_insert2:
+            if (OPTIMIZE) {
+                /* Transformation:
+                   insert2 put_field(a) drop -> put_field(a)
+                   insert2 put_var_strict(a) drop -> put_var_strict(a)
+                */
+                if (code_match(&cc, pos_next, M2(OP_put_field, OP_put_var_strict), OP_drop, -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    dbuf_putc(&bc_out, cc.op);
+                    dbuf_put_u32(&bc_out, cc.atom);
+                    pos_next = cc.pos;
+                    break;
+                }
+            }
+            goto no_change;
+
+        case OP_dup:
+            if (OPTIMIZE) {
+                /* Transformation: dup put_x(n) drop -> put_x(n) */
+                int op1, line2 = -1;
+                /* Transformation: dup put_x(n) -> set_x(n) */
+                if (code_match(&cc, pos_next, M3(OP_put_loc, OP_put_arg, OP_put_var_ref), -1, -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    op1 = cc.op + 1;  /* put_x -> set_x */
+                    pos_next = cc.pos;
+                    if (code_match(&cc, cc.pos, OP_drop, -1)) {
+                        if (cc.line_num >= 0) line_num = cc.line_num;
+                        op1 -= 1; /* set_x drop -> put_x */
+                        pos_next = cc.pos;
+                        if (code_match(&cc, cc.pos, op1 - 1, cc.idx, -1)) {
+                            line2 = cc.line_num; /* delay line number update */
+                            op1 += 1;   /* put_x(n) get_x(n) -> set_x(n) */
+                            pos_next = cc.pos;
+                        }
+                    }
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    put_short_code(&bc_out, op1, cc.idx);
+                    if (line2 >= 0) line_num = line2;
+                    break;
+                }
+            }
+            goto no_change;
+
+        case OP_get_loc:
+            if (OPTIMIZE) {
+                /* transformation:
+                   get_loc(n) post_dec put_loc(n) drop -> dec_loc(n)
+                   get_loc(n) post_inc put_loc(n) drop -> inc_loc(n)
+                   get_loc(n) dec dup put_loc(n) drop -> dec_loc(n)
+                   get_loc(n) inc dup put_loc(n) drop -> inc_loc(n)
+                 */
+                int idx;
+                idx = get_u16(bc_buf + pos + 1);
+                if (idx >= 256)
+                    goto no_change;
+                if (code_match(&cc, pos_next, M2(OP_post_dec, OP_post_inc), OP_put_loc, idx, OP_drop, -1) ||
+                    code_match(&cc, pos_next, M2(OP_dec, OP_inc), OP_dup, OP_put_loc, idx, OP_drop, -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    dbuf_putc(&bc_out, (cc.op == OP_inc || cc.op == OP_post_inc) ? OP_inc_loc : OP_dec_loc);
+                    dbuf_putc(&bc_out, idx);
+                    pos_next = cc.pos;
+                    break;
+                }
+                /* transformation:
+                   get_loc(n) push_atom_value(x) add dup put_loc(n) drop -> push_atom_value(x) add_loc(n)
+                 */
+                if (code_match(&cc, pos_next, OP_push_atom_value, OP_add, OP_dup, OP_put_loc, idx, OP_drop, -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    if (cc.atom == JS_ATOM_empty_string) {
+                        JS_FreeAtom(ctx, cc.atom);
+                        dbuf_putc(&bc_out, OP_push_empty_string);
+                    } else {
+                        dbuf_putc(&bc_out, OP_push_atom_value);
+                        dbuf_put_u32(&bc_out, cc.atom);
+                    }
+                    dbuf_putc(&bc_out, OP_add_loc);
+                    dbuf_putc(&bc_out, idx);
+                    pos_next = cc.pos;
+                    break;
+                }
+                /* transformation:
+                   get_loc(n) push_i32(x) add dup put_loc(n) drop -> push_i32(x) add_loc(n)
+                 */
+                if (code_match(&cc, pos_next, OP_push_i32, OP_add, OP_dup, OP_put_loc, idx, OP_drop, -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    push_short_int(&bc_out, cc.label);
+                    dbuf_putc(&bc_out, OP_add_loc);
+                    dbuf_putc(&bc_out, idx);
+                    pos_next = cc.pos;
+                    break;
+                }
+                /* transformation: XXX: also do these:
+                   get_loc(n) get_loc(x) add dup put_loc(n) drop -> get_loc(x) add_loc(n)
+                   get_loc(n) get_arg(x) add dup put_loc(n) drop -> get_arg(x) add_loc(n)
+                   get_loc(n) get_var_ref(x) add dup put_loc(n) drop -> get_var_ref(x) add_loc(n)
+                 */
+                if (code_match(&cc, pos_next, M3(OP_get_loc, OP_get_arg, OP_get_var_ref), -1, OP_add, OP_dup, OP_put_loc, idx, OP_drop, -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    put_short_code(&bc_out, cc.op, cc.idx);
+                    dbuf_putc(&bc_out, OP_add_loc);
+                    dbuf_putc(&bc_out, idx);
+                    pos_next = cc.pos;
+                    break;
+                }
+                add_pc2line_info(s, bc_out.size, line_num);
+                put_short_code(&bc_out, op, idx);
+                break;
+            }
+            goto no_change;
+#if SHORT_OPCODES
+        case OP_get_arg:
+        case OP_get_var_ref:
+            if (OPTIMIZE) {
+                int idx;
+                idx = get_u16(bc_buf + pos + 1);
+                add_pc2line_info(s, bc_out.size, line_num);
+                put_short_code(&bc_out, op, idx);
+                break;
+            }
+            goto no_change;
+#endif
+        case OP_put_loc:
+        case OP_put_arg:
+        case OP_put_var_ref:
+            if (OPTIMIZE) {
+                /* transformation: put_x(n) get_x(n) -> set_x(n) */
+                int idx;
+                idx = get_u16(bc_buf + pos + 1);
+                if (code_match(&cc, pos_next, op - 1, idx, -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    put_short_code(&bc_out, op + 1, idx);
+                    pos_next = cc.pos;
+                    break;
+                }
+                add_pc2line_info(s, bc_out.size, line_num);
+                put_short_code(&bc_out, op, idx);
+                break;
+            }
+            goto no_change;
+
+        case OP_post_inc:
+        case OP_post_dec:
+            if (OPTIMIZE) {
+                /* transformation:
+                   post_inc put_x drop -> inc put_x
+                   post_inc perm3 put_field drop -> inc put_field
+                   post_inc perm3 put_var_strict drop -> inc put_var_strict
+                   post_inc perm4 put_array_el drop -> inc put_array_el
+                 */
+                int op1, idx;
+                if (code_match(&cc, pos_next, M3(OP_put_loc, OP_put_arg, OP_put_var_ref), -1, OP_drop, -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    op1 = cc.op;
+                    idx = cc.idx;
+                    pos_next = cc.pos;
+                    if (code_match(&cc, cc.pos, op1 - 1, idx, -1)) {
+                        if (cc.line_num >= 0) line_num = cc.line_num;
+                        op1 += 1;   /* put_x(n) get_x(n) -> set_x(n) */
+                        pos_next = cc.pos;
+                    }
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    dbuf_putc(&bc_out, OP_dec + (op - OP_post_dec));
+                    put_short_code(&bc_out, op1, idx);
+                    break;
+                }
+                if (code_match(&cc, pos_next, OP_perm3, M2(OP_put_field, OP_put_var_strict), OP_drop, -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    dbuf_putc(&bc_out, OP_dec + (op - OP_post_dec));
+                    dbuf_putc(&bc_out, cc.op);
+                    dbuf_put_u32(&bc_out, cc.atom);
+                    pos_next = cc.pos;
+                    break;
+                }
+                if (code_match(&cc, pos_next, OP_perm4, OP_put_array_el, OP_drop, -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    add_pc2line_info(s, bc_out.size, line_num);
+                    dbuf_putc(&bc_out, OP_dec + (op - OP_post_dec));
+                    dbuf_putc(&bc_out, OP_put_array_el);
+                    pos_next = cc.pos;
+                    break;
+                }
+            }
+            goto no_change;
+
+        case OP_typeof:
+            if (OPTIMIZE) {
+                /* simplify typeof tests */
+                if (code_match(&cc, pos_next, OP_push_atom_value, M4(OP_strict_eq, OP_strict_neq, OP_eq, OP_neq), -1)) {
+                    if (cc.line_num >= 0) line_num = cc.line_num;
+                    int op1 = (cc.op == OP_strict_eq || cc.op == OP_eq) ? OP_strict_eq : OP_strict_neq;
+#if SHORT_OPCODES
+                    int op2 = -1;
+                    switch (cc.atom) {
+                    case JS_ATOM_undefined:
+                        op2 = OP_is_undefined;
+                        break;
+                    case JS_ATOM_function:
+                        op2 = OP_is_function;
+                        break;
+                    }
+                    if (op2 >= 0) {
+                        /* transform typeof(s) == "<type>" into is_<type> */
+                        if (op1 == OP_strict_eq) {
+                            add_pc2line_info(s, bc_out.size, line_num);
+                            dbuf_putc(&bc_out, op2);
+                            JS_FreeAtom(ctx, cc.atom);
+                            pos_next = cc.pos;
+                            break;
+                        }
+                        if (op1 == OP_strict_neq && code_match(&cc, cc.pos, OP_if_false, -1)) {
+                            /* transform typeof(s) != "<type>" if_false into is_<type> if_true */
+                            if (cc.line_num >= 0) line_num = cc.line_num;
+                            add_pc2line_info(s, bc_out.size, line_num);
+                            dbuf_putc(&bc_out, op2);
+                            JS_FreeAtom(ctx, cc.atom);
+                            pos_next = cc.pos;
+                            label = cc.label;
+                            op = OP_if_true;
+                            goto has_label;
+                        }
+                    }
+#endif
+                    if (cc.atom == JS_ATOM_undefined) {
+                        /* transform typeof(s) == "undefined" into s === void 0 */
+                        add_pc2line_info(s, bc_out.size, line_num);
+                        dbuf_putc(&bc_out, OP_undefined);
+                        dbuf_putc(&bc_out, op1);
+                        JS_FreeAtom(ctx, cc.atom);
+                        pos_next = cc.pos;
+                        break;
+                    }
+                }
+            }
+            goto no_change;
+
+        default:
+        no_change:
+            add_pc2line_info(s, bc_out.size, line_num);
+            dbuf_put(&bc_out, bc_buf + pos, len);
+            break;
+        }
+    }
+
+    /* check that there were no missing labels */
+    for(i = 0; i < s->label_count; i++) {
+        assert(label_slots[i].first_reloc == NULL);
+    }
+#if SHORT_OPCODES
+    if (OPTIMIZE) {
+        /* more jump optimizations */
+        int patch_offsets = 0;
+        for (i = 0, jp = s->jump_slots; i < s->jump_count; i++, jp++) {
+            LabelSlot *ls;
+            JumpSlot *jp1;
+            int j, pos, diff, delta;
+
+            delta = 3;
+            switch (op = jp->op) {
+            case OP_goto16:
+                delta = 1;
+                /* fall thru */
+            case OP_if_false:
+            case OP_if_true:
+            case OP_goto:
+                pos = jp->pos;
+                diff = s->label_slots[jp->label].addr - pos;
+                if (diff >= -128 && diff <= 127 + delta) {
+                    //put_u8(bc_out.buf + pos, diff);
+                    jp->size = 1;
+                    if (op == OP_goto16) {
+                        bc_out.buf[pos - 1] = jp->op = OP_goto8;
+                    } else {
+                        bc_out.buf[pos - 1] = jp->op = OP_if_false8 + (op - OP_if_false);
+                    }
+                    goto shrink;
+                } else
+                if (diff == (int16_t)diff && op == OP_goto) {
+                    //put_u16(bc_out.buf + pos, diff);
+                    jp->size = 2;
+                    delta = 2;
+                    bc_out.buf[pos - 1] = jp->op = OP_goto16;
+                shrink:
+                    /* XXX: should reduce complexity, using 2 finger copy scheme */
+                    memmove(bc_out.buf + pos + jp->size, bc_out.buf + pos + jp->size + delta,
+                            bc_out.size - pos - jp->size - delta);
+                    bc_out.size -= delta;
+                    patch_offsets++;
+                    for (j = 0, ls = s->label_slots; j < s->label_count; j++, ls++) {
+                        if (ls->addr > pos)
+                            ls->addr -= delta;
+                    }
+                    for (j = i + 1, jp1 = jp + 1; j < s->jump_count; j++, jp1++) {
+                        if (jp1->pos > pos)
+                            jp1->pos -= delta;
+                    }
+                    for (j = 0; j < s->line_number_count; j++) {
+                        if (s->line_number_slots[j].pc > pos)
+                            s->line_number_slots[j].pc -= delta;
+                    }
+                    continue;
+                }
+                break;
+            }
+        }
+        if (patch_offsets) {
+            JumpSlot *jp1;
+            int j;
+            for (j = 0, jp1 = s->jump_slots; j < s->jump_count; j++, jp1++) {
+                int diff1 = s->label_slots[jp1->label].addr - jp1->pos;
+                switch (jp1->size) {
+                case 1:
+                    put_u8(bc_out.buf + jp1->pos, diff1);
+                    break;
+                case 2:
+                    put_u16(bc_out.buf + jp1->pos, diff1);
+                    break;
+                case 4:
+                    put_u32(bc_out.buf + jp1->pos, diff1);
+                    break;
+                }
+            }
+        }
+    }
+    js_free(ctx, s->jump_slots);
+    s->jump_slots = NULL;
+#endif
+    js_free(ctx, s->label_slots);
+    s->label_slots = NULL;
+    /* XXX: should delay until copying to runtime bytecode function */
+    compute_pc2line_info(s);
+    js_free(ctx, s->line_number_slots);
+    s->line_number_slots = NULL;
+    /* set the new byte code */
+    dbuf_free(&s->byte_code);
+    s->byte_code = bc_out;
+    if (dbuf_error(&s->byte_code)) {
+        JS_ThrowOutOfMemory(ctx);
+        return -1;
+    }
+    return 0;
+ fail:
+    dbuf_free(&bc_out);
+    return -1;
+}
+
+/* compute the maximum stack size needed by the function */
+
+typedef struct StackSizeState {
+    int stack_len_max;
+    uint16_t *stack_level_tab;
+} StackSizeState;
+
+static __exception int compute_stack_size_rec(JSContext *ctx,
+                                              JSFunctionDef *fd,
+                                              StackSizeState *s,
+                                              int pos, int op, int stack_len)
+{
+    int bc_len, diff, n_pop, pos_next;
+    const JSOpCode *oi;
+    const uint8_t *bc_buf;
+
+    if (stack_len > s->stack_len_max) {
+        s->stack_len_max = stack_len;
+        if (s->stack_len_max > JS_STACK_SIZE_MAX)
+            goto stack_overflow;
+    }
+    bc_buf = fd->byte_code.buf;
+    bc_len = fd->byte_code.size;
+    for(;;) {
+        if ((unsigned)pos >= bc_len)
+            goto buf_overflow;
+#if 0
+        printf("%5d: %d\n", pos, stack_len);
+#endif
+        if (s->stack_level_tab[pos] != 0xffff) {
+            /* already explored: check that the stack size is consistent */
+            if (s->stack_level_tab[pos] != stack_len) {
+                JS_ThrowInternalError(ctx, "unconsistent stack size: %d %d (pc=%d)",
+                                      s->stack_level_tab[pos], stack_len, pos);
+                return -1;
+            } else {
+                return 0;
+            }
+        } else {
+            s->stack_level_tab[pos] = stack_len;
+        }
+
+        op = bc_buf[pos];
+        if (op == 0 || op >= OP_COUNT) {
+            JS_ThrowInternalError(ctx, "invalid opcode (op=%d, pc=%d)", op, pos);
+            return -1;
+        }
+        oi = &opcode_info[op];
+        pos_next = pos + oi->size;
+        if (pos_next > bc_len) {
+        buf_overflow:
+            JS_ThrowInternalError(ctx, "bytecode buffer overflow (op=%d, pc=%d)", op, pos);
+            return -1;
+        }
+        n_pop = oi->n_pop;
+        /* call pops a variable number of arguments */
+        if (oi->fmt == OP_FMT_npop) {
+            n_pop += get_u16(bc_buf + pos + 1);
+        } else {
+#if SHORT_OPCODES
+            if (oi->fmt == OP_FMT_npopx) {
+                n_pop += op - OP_call0;
+            }
+#endif
+        }
+
+        if (stack_len < n_pop) {
+            JS_ThrowInternalError(ctx, "stack underflow (op=%d, pc=%d)", op, pos);
+            return -1;
+        }
+        stack_len += oi->n_push - n_pop;
+        if (stack_len > s->stack_len_max) {
+            s->stack_len_max = stack_len;
+            if (s->stack_len_max > JS_STACK_SIZE_MAX)
+                goto stack_overflow;
+        }
+        switch(op) {
+        case OP_tail_call:
+        case OP_tail_call_method:
+        case OP_return:
+        case OP_return_undef:
+        case OP_return_async:
+        case OP_throw:
+        case OP_throw_var:
+        case OP_ret:
+            goto done;
+        case OP_goto:
+            diff = get_u32(bc_buf + pos + 1);
+            pos_next = pos + 1 + diff;
+            break;
+#if SHORT_OPCODES
+        case OP_goto16:
+            diff = (int16_t)get_u16(bc_buf + pos + 1);
+            pos_next = pos + 1 + diff;
+            break;
+        case OP_goto8:
+            diff = (int8_t)bc_buf[pos + 1];
+            pos_next = pos + 1 + diff;
+            break;
+        case OP_if_true8:
+        case OP_if_false8:
+            diff = (int8_t)bc_buf[pos + 1];
+            if (compute_stack_size_rec(ctx, fd, s, pos + 1 + diff, op, stack_len))
+                return -1;
+            break;
+#endif
+        case OP_if_true:
+        case OP_if_false:
+        case OP_catch:
+            diff = get_u32(bc_buf + pos + 1);
+            if (compute_stack_size_rec(ctx, fd, s, pos + 1 + diff, op, stack_len))
+                return -1;
+            break;
+        case OP_gosub:
+            diff = get_u32(bc_buf + pos + 1);
+            if (compute_stack_size_rec(ctx, fd, s, pos + 1 + diff, op, stack_len + 1))
+                return -1;
+            break;
+        case OP_with_get_var:
+        case OP_with_delete_var:
+            diff = get_u32(bc_buf + pos + 5);
+            if (compute_stack_size_rec(ctx, fd, s, pos + 5 + diff, op, stack_len + 1))
+                return -1;
+            break;
+        case OP_with_make_ref:
+        case OP_with_get_ref:
+        case OP_with_get_ref_undef:
+            diff = get_u32(bc_buf + pos + 5);
+            if (compute_stack_size_rec(ctx, fd, s, pos + 5 + diff, op, stack_len + 2))
+                return -1;
+            break;
+        case OP_with_put_var:
+            diff = get_u32(bc_buf + pos + 5);
+            if (compute_stack_size_rec(ctx, fd, s, pos + 5 + diff, op, stack_len - 1))
+                return -1;
+            break;
+
+        default:
+            break;
+        }
+        pos = pos_next;
+    }
+ done:
+    return 0;
+
+ stack_overflow:
+    JS_ThrowInternalError(ctx, "stack overflow (op=%d, pc=%d)", op, pos);
+    return -1;
+}
+
+static __exception int compute_stack_size(JSContext *ctx,
+                                          JSFunctionDef *fd,
+                                          int *pstack_size)
+{
+    StackSizeState s_s, *s = &s_s;
+    int bc_len, i, ret;
+
+    bc_len = fd->byte_code.size;
+    /* bc_len > 0 */
+    s->stack_level_tab = js_malloc(ctx, sizeof(s->stack_level_tab[0]) * bc_len);
+    if (!s->stack_level_tab)
+        return -1;
+    for(i = 0; i < bc_len; i++)
+        s->stack_level_tab[i] = 0xffff;
+    s->stack_len_max = 0;
+    ret = compute_stack_size_rec(ctx, fd, s, 0, OP_invalid, 0);
+    js_free(ctx, s->stack_level_tab);
+    *pstack_size = s->stack_len_max;
+    return ret;
+}
+
+static int add_module_variables(JSContext *ctx, JSFunctionDef *fd)
+{
+    int i, idx;
+    JSModuleDef *m = fd->module;
+    JSExportEntry *me;
+    JSHoistedDef *hf;
+
+    /* The imported global variables were added as closure variables
+       in js_parse_import(). We add here the module global
+       variables. */
+
+    for(i = 0; i < fd->hoisted_def_count; i++) {
+        hf = &fd->hoisted_def[i];
+        if (add_closure_var(ctx, fd, TRUE, FALSE, i, hf->var_name, hf->is_const,
+                            hf->is_lexical, FALSE) < 0)
+            return -1;
+    }
+
+    /* resolve the variable names of the local exports */
+    for(i = 0; i < m->export_entries_count; i++) {
+        me = &m->export_entries[i];
+        if (me->export_type == JS_EXPORT_TYPE_LOCAL) {
+            idx = find_closure_var(ctx, fd, me->local_name);
+            if (idx < 0) {
+                char buf1[ATOM_GET_STR_BUF_SIZE];
+                JS_ThrowSyntaxError(ctx, "exported variable '%s' does not exist",
+                                    JS_AtomGetStr(ctx, buf1, sizeof(buf1), me->local_name));
+                return -1;
+            }
+            me->u.local.var_idx = idx;
+        }
+    }
+    return 0;
+}
+
+/* create a function object from a function definition. The function
+   definition is freed. All the child functions are also created. It
+   must be done this way to resolve all the variables. */
+static JSValue js_create_function(JSContext *ctx, JSFunctionDef *fd)
+{
+    JSValue func_obj;
+    JSFunctionBytecode *b;
+    struct list_head *el, *el1;
+    int stack_size, scope, idx;
+    int function_size, byte_code_offset, cpool_offset;
+    int closure_var_offset, vardefs_offset;
+
+    /* recompute scope linkage */
+    for (scope = 0; scope < fd->scope_count; scope++) {
+        fd->scopes[scope].first = -1;
+    }
+    for (idx = 0; idx < fd->var_count; idx++) {
+        JSVarDef *vd = &fd->vars[idx];
+        vd->scope_next = fd->scopes[vd->scope_level].first;
+        fd->scopes[vd->scope_level].first = idx;
+    }
+    for (scope = 2; scope < fd->scope_count; scope++) {
+        JSVarScope *sd = &fd->scopes[scope];
+        if (sd->first == -1)
+            sd->first = fd->scopes[sd->parent].first;
+    }
+    for (idx = 0; idx < fd->var_count; idx++) {
+        JSVarDef *vd = &fd->vars[idx];
+        if (vd->scope_next == -1 && vd->scope_level > 1) {
+            scope = fd->scopes[vd->scope_level].parent;
+            vd->scope_next = fd->scopes[scope].first;
+        }
+    }
+
+    /* if the function contains an eval call, the closure variables
+       are used to compile the eval and they must be ordered by scope,
+       so it is necessary to create the closure variables before any
+       other variable lookup is done. */
+    if (fd->has_eval_call)
+        add_eval_variables(ctx, fd);
+
+    /* add the module global variables in the closure */
+    if (fd->module) {
+        if (add_module_variables(ctx, fd))
+            goto fail;
+    }
+
+    /* first create all the child functions */
+    list_for_each_safe(el, el1, &fd->child_list) {
+        JSFunctionDef *fd1;
+        int cpool_idx;
+
+        fd1 = list_entry(el, JSFunctionDef, link);
+        cpool_idx = fd1->parent_cpool_idx;
+        func_obj = js_create_function(ctx, fd1);
+        if (JS_IsException(func_obj))
+            goto fail;
+        /* save it in the constant pool */
+        assert(cpool_idx >= 0);
+        fd->cpool[cpool_idx] = func_obj;
+    }
+
+#if defined(DUMP_BYTECODE) && (DUMP_BYTECODE & 4)
+    if (!(fd->js_mode & JS_MODE_STRIP)) {
+        printf("pass 1\n");
+        dump_byte_code(ctx, 1, fd->byte_code.buf, fd->byte_code.size,
+                       fd->args, fd->arg_count, fd->vars, fd->var_count,
+                       fd->closure_var, fd->closure_var_count,
+                       fd->cpool, fd->cpool_count, fd->source, fd->line_num,
+                       fd->label_slots, NULL);
+        printf("\n");
+    }
+#endif
+
+    if (resolve_variables(ctx, fd))
+        goto fail;
+
+#if defined(DUMP_BYTECODE) && (DUMP_BYTECODE & 2)
+    if (!(fd->js_mode & JS_MODE_STRIP)) {
+        printf("pass 2\n");
+        dump_byte_code(ctx, 2, fd->byte_code.buf, fd->byte_code.size,
+                       fd->args, fd->arg_count, fd->vars, fd->var_count,
+                       fd->closure_var, fd->closure_var_count,
+                       fd->cpool, fd->cpool_count, fd->source, fd->line_num,
+                       fd->label_slots, NULL);
+        printf("\n");
+    }
+#endif
+
+    if (resolve_labels(ctx, fd))
+        goto fail;
+
+    if (compute_stack_size(ctx, fd, &stack_size) < 0)
+        goto fail;
+
+    if (fd->js_mode & JS_MODE_STRIP) {
+        function_size = offsetof(JSFunctionBytecode, debug);
+    } else {
+        function_size = sizeof(*b);
+    }
+    cpool_offset = function_size;
+    function_size += fd->cpool_count * sizeof(*fd->cpool);
+    vardefs_offset = function_size;
+    if (!(fd->js_mode & JS_MODE_STRIP) || fd->has_eval_call) {
+        function_size += (fd->arg_count + fd->var_count) * sizeof(*b->vardefs);
+    }
+    closure_var_offset = function_size;
+    function_size += fd->closure_var_count * sizeof(*fd->closure_var);
+    byte_code_offset = function_size;
+    function_size += fd->byte_code.size;
+
+    b = js_mallocz(ctx, function_size);
+    if (!b)
+        goto fail;
+    b->header.ref_count = 1;
+    b->gc_header.mark = 0;
+
+    b->byte_code_buf = (void *)((uint8_t*)b + byte_code_offset);
+    b->byte_code_len = fd->byte_code.size;
+    memcpy(b->byte_code_buf, fd->byte_code.buf, fd->byte_code.size);
+    js_free(ctx, fd->byte_code.buf);
+    fd->byte_code.buf = NULL;
+
+    b->func_name = fd->func_name;
+    if (fd->arg_count + fd->var_count > 0) {
+        if ((fd->js_mode & JS_MODE_STRIP) && !fd->has_eval_call) {
+            /* Strip variable definitions not needed at runtime */
+            int i;
+            for(i = 0; i < fd->var_count; i++) {
+                JS_FreeAtom(ctx, fd->vars[i].var_name);
+            }
+            for(i = 0; i < fd->arg_count; i++) {
+                JS_FreeAtom(ctx, fd->args[i].var_name);
+            }
+            for(i = 0; i < fd->closure_var_count; i++) {
+                JS_FreeAtom(ctx, fd->closure_var[i].var_name);
+                fd->closure_var[i].var_name = JS_ATOM_NULL;
+            }
+        } else {
+            b->vardefs = (void *)((uint8_t*)b + vardefs_offset);
+            memcpy(b->vardefs, fd->args, fd->arg_count * sizeof(fd->args[0]));
+            memcpy(b->vardefs + fd->arg_count, fd->vars, fd->var_count * sizeof(fd->vars[0]));
+        }
+        b->var_count = fd->var_count;
+        b->arg_count = fd->arg_count;
+        b->defined_arg_count = fd->defined_arg_count;
+        js_free(ctx, fd->args);
+        js_free(ctx, fd->vars);
+    }
+    b->cpool_count = fd->cpool_count;
+    if (b->cpool_count) {
+        b->cpool = (void *)((uint8_t*)b + cpool_offset);
+        memcpy(b->cpool, fd->cpool, b->cpool_count * sizeof(*b->cpool));
+    }
+    js_free(ctx, fd->cpool);
+    fd->cpool = NULL;
+
+    b->stack_size = stack_size;
+
+    if (fd->js_mode & JS_MODE_STRIP) {
+        JS_FreeAtom(ctx, fd->filename);
+        dbuf_free(&fd->pc2line);    // probably useless
+    } else {
+        /* XXX: source and pc2line info should be packed at the end of the
+           JSFunctionBytecode structure, avoiding allocation overhead
+         */
+        b->has_debug = 1;
+        b->debug.filename = fd->filename;
+        b->debug.line_num = fd->line_num;
+
+        //DynBuf pc2line;
+        //compute_pc2line_info(fd, &pc2line);
+        //js_free(ctx, fd->line_number_slots)
+        b->debug.pc2line_buf = js_realloc(ctx, fd->pc2line.buf, fd->pc2line.size);
+        if (!b->debug.pc2line_buf)
+            b->debug.pc2line_buf = fd->pc2line.buf;
+        b->debug.pc2line_len = fd->pc2line.size;
+        b->debug.source = fd->source;
+        b->debug.source_len = fd->source_len;
+    }
+    if (fd->scopes != fd->def_scope_array)
+        js_free(ctx, fd->scopes);
+
+    b->closure_var_count = fd->closure_var_count;
+    if (b->closure_var_count) {
+        b->closure_var = (void *)((uint8_t*)b + closure_var_offset);
+        memcpy(b->closure_var, fd->closure_var, b->closure_var_count * sizeof(*b->closure_var));
+    }
+    js_free(ctx, fd->closure_var);
+    fd->closure_var = NULL;
+
+    b->has_prototype = fd->has_prototype;
+    b->has_simple_parameter_list = fd->has_simple_parameter_list;
+    b->js_mode = fd->js_mode;
+    b->is_derived_class_constructor = fd->is_derived_class_constructor;
+    b->func_kind = fd->func_kind;
+    b->need_home_object = (fd->home_object_var_idx >= 0);
+    b->new_target_allowed = fd->new_target_allowed;
+    b->super_call_allowed = fd->super_call_allowed;
+    b->super_allowed = fd->super_allowed;
+
+#if defined(DUMP_BYTECODE) && (DUMP_BYTECODE & 1)
+    if (!(fd->js_mode & JS_MODE_STRIP)) {
+        js_dump_function_bytecode(ctx, b);
+    }
+#endif
+
+    if (fd->parent) {
+        /* remove from parent list */
+        list_del(&fd->link);
+    }
+
+    js_free(ctx, fd);
+    return JS_MKPTR(JS_TAG_FUNCTION_BYTECODE, b);
+ fail:
+    js_free_function_def(ctx, fd);
+    return JS_EXCEPTION;
+}
+
+static void free_function_bytecode(JSRuntime *rt, JSFunctionBytecode *b)
+{
+    int i;
+
+#if 0
+    {
+        char buf[ATOM_GET_STR_BUF_SIZE];
+        printf("freeing %s\n",
+               JS_AtomGetStrRT(rt, buf, sizeof(buf), b->func_name));
+    }
+#endif
+    free_bytecode_atoms(rt, b->byte_code_buf, b->byte_code_len);
+
+    if (b->vardefs) {
+        for(i = 0; i < b->arg_count + b->var_count; i++) {
+            JS_FreeAtomRT(rt, b->vardefs[i].var_name);
+        }
+    }
+    for(i = 0; i < b->cpool_count; i++)
+        JS_FreeValueRT(rt, b->cpool[i]);
+
+    for(i = 0; i < b->closure_var_count; i++) {
+        JSClosureVar *cv = &b->closure_var[i];
+        JS_FreeAtomRT(rt, cv->var_name);
+    }
+
+    JS_FreeAtomRT(rt, b->func_name);
+    if (b->has_debug) {
+        JS_FreeAtomRT(rt, b->debug.filename);
+        js_free_rt(rt, b->debug.pc2line_buf);
+        js_free_rt(rt, b->debug.source);
+    }
+    js_free_rt(rt, b);
+}
+
+static __exception int js_parse_directives(JSParseState *s)
+{
+    char str[20];
+    JSParsePos pos;
+    BOOL has_semi;
+
+    if (s->token.val != TOK_STRING)
+        return 0;
+
+    js_parse_get_pos(s, &pos);
+
+    while(s->token.val == TOK_STRING) {
+        /* Copy actual source string representation */
+        snprintf(str, sizeof str, "%.*s",
+                 (int)(s->buf_ptr - s->token.ptr - 2), s->token.ptr + 1);
+
+        if (next_token(s))
+            return -1;
+
+        has_semi = FALSE;
+        switch (s->token.val) {
+        case ';':
+            if (next_token(s))
+                return -1;
+            has_semi = TRUE;
+            break;
+        case '}':
+        case TOK_EOF:
+            has_semi = TRUE;
+            break;
+        case TOK_NUMBER:
+        case TOK_STRING:
+        case TOK_TEMPLATE:
+        case TOK_IDENT:
+        case TOK_REGEXP:
+        case TOK_DEC:
+        case TOK_INC:
+        case TOK_NULL:
+        case TOK_FALSE:
+        case TOK_TRUE:
+        case TOK_IF:
+        case TOK_RETURN:
+        case TOK_VAR:
+        case TOK_THIS:
+        case TOK_DELETE:
+        case TOK_TYPEOF:
+        case TOK_NEW:
+        case TOK_DO:
+        case TOK_WHILE:
+        case TOK_FOR:
+        case TOK_SWITCH:
+        case TOK_THROW:
+        case TOK_TRY:
+        case TOK_FUNCTION:
+        case TOK_DEBUGGER:
+        case TOK_WITH:
+        case TOK_CLASS:
+        case TOK_CONST:
+        case TOK_ENUM:
+        case TOK_EXPORT:
+        case TOK_IMPORT:
+        case TOK_SUPER:
+        case TOK_INTERFACE:
+        case TOK_LET:
+        case TOK_PACKAGE:
+        case TOK_PRIVATE:
+        case TOK_PROTECTED:
+        case TOK_PUBLIC:
+        case TOK_STATIC:
+            /* automatic insertion of ';' */
+            if (s->got_lf)
+                has_semi = TRUE;
+            break;
+        default:
+            break;
+        }
+        if (!has_semi)
+            break;
+        if (!strcmp(str, "use strict")) {
+            s->cur_func->has_use_strict = TRUE;
+            s->cur_func->js_mode |= JS_MODE_STRICT;
+        }
+#if !defined(DUMP_BYTECODE) || !(DUMP_BYTECODE & 8)
+        else if (!strcmp(str, "use strip")) {
+            s->cur_func->js_mode |= JS_MODE_STRIP;
+        }
+#endif
+#ifdef CONFIG_BIGNUM
+        else if (!strcmp(str, "use bigint")) {
+            s->cur_func->js_mode |= JS_MODE_BIGINT;
+        }
+        else if (!strcmp(str, "use math")) {
+            s->cur_func->js_mode |= JS_MODE_BIGINT | JS_MODE_MATH;
+        }
+#endif
+    }
+    return js_parse_seek_token(s, &pos);
+}
+
+static int js_parse_function_check_names(JSParseState *s, JSFunctionDef *fd,
+                                         JSAtom func_name)
+{
+    JSAtom name;
+    int i, idx;
+
+    if (fd->js_mode & JS_MODE_STRICT) {
+        if (!fd->has_simple_parameter_list && fd->has_use_strict) {
+            return js_parse_error(s, "\"use strict\" not allowed in function with default or destructuring parameter");
+        }
+        if (func_name == JS_ATOM_eval || func_name == JS_ATOM_arguments) {
+            return js_parse_error(s, "invalid function name in strict code");
+        }
+        for (idx = 0; idx < fd->arg_count; idx++) {
+            name = fd->args[idx].var_name;
+
+            if (name == JS_ATOM_eval || name == JS_ATOM_arguments) {
+                return js_parse_error(s, "invalid argument name in strict code");
+            }
+        }
+    }
+    /* check async_generator case */
+    if ((fd->js_mode & JS_MODE_STRICT)
+    ||  !fd->has_simple_parameter_list
+    ||  (fd->func_type == JS_PARSE_FUNC_METHOD && fd->func_kind == JS_FUNC_ASYNC)
+    ||  fd->func_type == JS_PARSE_FUNC_ARROW) {
+        for (idx = 0; idx < fd->arg_count; idx++) {
+            name = fd->args[idx].var_name;
+            if (name != JS_ATOM_NULL) {
+                for (i = 0; i < idx; i++) {
+                    if (fd->args[i].var_name == name)
+                        goto duplicate;
+                }
+                /* Check if argument name duplicates a destructuring parameter */
+                /* XXX: should have a flag for such variables */
+                for (i = 0; i < fd->var_count; i++) {
+                    if (fd->vars[i].var_name == name)
+                        goto duplicate;
+                }
+            }
+        }
+    }
+    return 0;
+
+duplicate:
+    return js_parse_error(s, "duplicate argument names not allowed in this context");
+}
+
+/* func_name must be JS_ATOM_NULL for JS_PARSE_FUNC_STATEMENT and
+   JS_PARSE_FUNC_EXPR, JS_PARSE_FUNC_ARROW and JS_PARSE_FUNC_VAR */
+static __exception int js_parse_function_decl2(JSParseState *s,
+                                               JSParseFunctionEnum func_type,
+                                               JSFunctionKindEnum func_kind,
+                                               JSAtom func_name,
+                                               const uint8_t *ptr,
+                                               int function_line_num,
+                                               JSParseExportEnum export_flag,
+                                               JSFunctionDef **pfd)
+{
+    JSContext *ctx = s->ctx;
+    JSFunctionDef *fd = s->cur_func;
+    BOOL is_expr;
+    int func_idx, lexical_func_idx = -1;
+    BOOL has_opt_arg;
+    BOOL create_func_var = FALSE;
+
+    is_expr = (func_type != JS_PARSE_FUNC_STATEMENT &&
+               func_type != JS_PARSE_FUNC_VAR);
+
+    if (func_type == JS_PARSE_FUNC_STATEMENT ||
+        func_type == JS_PARSE_FUNC_VAR ||
+        func_type == JS_PARSE_FUNC_EXPR) {
+        if (func_kind == JS_FUNC_NORMAL &&
+            token_is_pseudo_keyword(s, JS_ATOM_async) &&
+            peek_token(s, TRUE) != '\n') {
+            if (next_token(s))
+                return -1;
+            func_kind = JS_FUNC_ASYNC;
+        }
+        if (next_token(s))
+            return -1;
+        if (s->token.val == '*') {
+            if (next_token(s))
+                return -1;
+            func_kind |= JS_FUNC_GENERATOR;
+        }
+
+        if (s->token.val == TOK_IDENT) {
+            if (s->token.u.ident.is_reserved ||
+                (s->token.u.ident.atom == JS_ATOM_yield &&
+                 func_type == JS_PARSE_FUNC_EXPR &&
+                 (func_kind & JS_FUNC_GENERATOR)) ||
+                (s->token.u.ident.atom == JS_ATOM_await &&
+                 func_type == JS_PARSE_FUNC_EXPR &&
+                 (func_kind & JS_FUNC_ASYNC))) {
+                return js_parse_error_reserved_identifier(s);
+            }
+        }
+        if (s->token.val == TOK_IDENT ||
+            (((s->token.val == TOK_YIELD && !(fd->js_mode & JS_MODE_STRICT)) ||
+             (s->token.val == TOK_AWAIT && !s->is_module)) &&
+             func_type == JS_PARSE_FUNC_EXPR)) {
+            func_name = JS_DupAtom(ctx, s->token.u.ident.atom);
+            if (next_token(s)) {
+                JS_FreeAtom(ctx, func_name);
+                return -1;
+            }
+        } else {
+            if (func_type != JS_PARSE_FUNC_EXPR &&
+                export_flag != JS_PARSE_EXPORT_DEFAULT) {
+                return js_parse_error(s, "function name expected");
+            }
+        }
+    } else if (func_type != JS_PARSE_FUNC_ARROW) {
+        func_name = JS_DupAtom(ctx, func_name);
+    }
+
+    if (fd->is_eval && fd->eval_type == JS_EVAL_TYPE_MODULE &&
+        (func_type == JS_PARSE_FUNC_STATEMENT || func_type == JS_PARSE_FUNC_VAR)) {
+        JSHoistedDef *hf;
+        hf = find_hoisted_def(fd, func_name);
+        /* XXX: should check scope chain */
+        if (hf && hf->scope_level == fd->scope_level) {
+            js_parse_error(s, "invalid redefinition of global identifier in module code");
+            JS_FreeAtom(ctx, func_name);
+            return -1;
+        }
+    }
+
+    if (func_type == JS_PARSE_FUNC_VAR) {
+        /* Create lexical name here so function closure contains it */
+        if (!(fd->js_mode & JS_MODE_STRICT)
+        &&  find_lexical_decl(ctx, fd, func_name, fd->scope_first, FALSE) < 0
+        &&  !((func_idx = find_var(ctx, fd, func_name)) >= 0 && (func_idx & ARGUMENT_VAR_OFFSET))
+        &&  !(func_name == JS_ATOM_arguments && fd->has_arguments_binding)) {
+            create_func_var = TRUE;
+        }
+        if (fd->is_eval &&
+            (fd->eval_type == JS_EVAL_TYPE_GLOBAL ||
+             fd->eval_type == JS_EVAL_TYPE_MODULE) &&
+            fd->scope_level == 1) {
+            /* avoid creating a lexical variable in the global
+               scope. XXX: check annex B */
+            JSHoistedDef *hf;
+            hf = find_hoisted_def(fd, func_name);
+            /* XXX: should check scope chain */
+            if (hf && hf->scope_level == fd->scope_level) {
+                js_parse_error(s, "invalid redefinition of global identifier");
+                JS_FreeAtom(ctx, func_name);
+                return -1;
+            }
+        } else {
+            /* Always create a lexical name, fail if at the same scope as
+               existing name */
+            /* Lexical variable will be initialized upon entering scope */
+            lexical_func_idx = define_var(s, fd, func_name, TOK_FUNCTION);
+            if (lexical_func_idx < 0) {
+                JS_FreeAtom(ctx, func_name);
+                return -1;
+            }
+        }
+    }
+
+    fd = js_new_function_def(ctx, fd, FALSE, is_expr,
+                             s->filename, function_line_num);
+    if (!fd) {
+        JS_FreeAtom(ctx, func_name);
+        return -1;
+    }
+    if (pfd)
+        *pfd = fd;
+    s->cur_func = fd;
+    fd->func_name = func_name;
+    /* XXX: test !fd->is_generator is always false */
+    fd->has_prototype = (func_type == JS_PARSE_FUNC_STATEMENT ||
+                         func_type == JS_PARSE_FUNC_VAR ||
+                         func_type == JS_PARSE_FUNC_EXPR) &&
+                        func_kind == JS_FUNC_NORMAL;
+    fd->has_home_object = (func_type == JS_PARSE_FUNC_METHOD ||
+                           func_type == JS_PARSE_FUNC_GETTER ||
+                           func_type == JS_PARSE_FUNC_SETTER ||
+                           func_type == JS_PARSE_FUNC_CLASS_CONSTRUCTOR ||
+                           func_type == JS_PARSE_FUNC_DERIVED_CLASS_CONSTRUCTOR);
+    fd->has_arguments_binding = (func_type != JS_PARSE_FUNC_ARROW);
+    fd->has_this_binding = fd->has_arguments_binding;
+    fd->is_derived_class_constructor = (func_type == JS_PARSE_FUNC_DERIVED_CLASS_CONSTRUCTOR);
+    if (func_type == JS_PARSE_FUNC_ARROW) {
+        fd->new_target_allowed = fd->parent->new_target_allowed;
+        fd->super_call_allowed = fd->parent->super_call_allowed;
+        fd->super_allowed = fd->parent->super_allowed;
+    } else {
+        fd->new_target_allowed = TRUE;
+        fd->super_call_allowed = fd->is_derived_class_constructor;
+        fd->super_allowed = fd->has_home_object;
+    }
+
+    /* fd->in_function_body == FALSE prevents yield/await during the parsing
+       of the arguments in generator/async functions. They are parsed as
+       regular identifiers for other function kinds. */
+    fd->func_kind = func_kind;
+    fd->func_type = func_type;
+
+    if (func_type == JS_PARSE_FUNC_CLASS_CONSTRUCTOR ||
+        func_type == JS_PARSE_FUNC_DERIVED_CLASS_CONSTRUCTOR) {
+        /* error if not invoked as a constructor */
+        emit_op(s, OP_check_ctor);
+    }
+
+    /* parse arguments */
+    fd->has_simple_parameter_list = TRUE;
+    has_opt_arg = FALSE;
+    if (func_type == JS_PARSE_FUNC_ARROW && s->token.val == TOK_IDENT) {
+        JSAtom name;
+        if (s->token.u.ident.is_reserved) {
+            js_parse_error_reserved_identifier(s);
+            goto fail;
+        }
+        name = s->token.u.ident.atom;
+        if (add_arg(ctx, fd, name) < 0)
+            goto fail;
+        fd->defined_arg_count = 1;
+    } else {
+        if (js_parse_expect(s, '('))
+            goto fail;
+
+        while (s->token.val != ')') {
+            JSAtom name;
+            BOOL rest = FALSE;
+            int idx;
+
+            if (s->token.val == TOK_ELLIPSIS) {
+                fd->has_simple_parameter_list = FALSE;
+                rest = TRUE;
+                if (next_token(s))
+                    goto fail;
+            }
+            if (s->token.val == '[' || s->token.val == '{') {
+                fd->has_simple_parameter_list = FALSE;
+                if (rest) {
+                    emit_op(s, OP_rest);
+                    emit_u16(s, fd->arg_count);
+                } else {
+                    /* unnamed arg for destructuring */
+                    idx = add_arg(ctx, fd, JS_ATOM_NULL);
+                    emit_op(s, OP_get_arg);
+                    emit_u16(s, idx);
+                }
+                if (js_parse_destructing_element(s, TOK_VAR, 1, TRUE, -1))
+                    goto fail;
+                /* Close var object: necessary if direct eval call
+                   occurred in the assignment expression or if any
+                   variable was captured and a later direct eval call
+                   may instantiate it in the var object.
+                   The next pass will generate the capture if required.
+                 */
+                emit_op(s, OP_close_var_object);
+            } else if (s->token.val == TOK_IDENT) {
+                if (s->token.u.ident.is_reserved) {
+                    js_parse_error_reserved_identifier(s);
+                    goto fail;
+                }
+                name = s->token.u.ident.atom;
+                if (name == JS_ATOM_yield && fd->func_kind == JS_FUNC_GENERATOR) {
+                    js_parse_error_reserved_identifier(s);
+                    goto fail;
+                }
+                idx = add_arg(ctx, fd, name);
+                if (idx < 0)
+                    goto fail;
+                if (next_token(s))
+                    goto fail;
+                if (rest) {
+                    emit_op(s, OP_rest);
+                    emit_u16(s, idx);
+                    emit_op(s, OP_put_arg);
+                    emit_u16(s, idx);
+                    fd->has_simple_parameter_list = FALSE;
+                    has_opt_arg = TRUE;
+                } else if (s->token.val == '=') {
+                    fd->has_simple_parameter_list = FALSE;
+                    has_opt_arg = TRUE;
+
+                    if (next_token(s))
+                        goto fail;
+
+                    /* optimize `x = void 0` default value: no code needed */
+                    if (s->token.val == TOK_VOID) {
+                        JSParsePos pos;
+                        js_parse_get_pos(s, &pos);
+                        if (next_token(s))
+                            goto fail;
+                        if (s->token.val == TOK_NUMBER) {
+                            if (next_token(s))
+                                goto fail;
+                            if (s->token.val == ',') {
+                                if (next_token(s))
+                                    goto fail;
+                                continue;
+                            }
+                            if (s->token.val == ')') {
+                                continue;
+                            }
+                        }
+                        if (js_parse_seek_token(s, &pos))
+                            goto fail;
+                    }
+#if 0
+                    /* XXX: not correct for eval code */
+                    /* Check for a default value of `undefined`
+                       to omit default argument processing */
+                    if (s->token.val == TOK_IDENT &&
+                        s->token.u.ident.atom == JS_ATOM_undefined &&
+                        fd->parent == NULL &&
+                        ((tok = peek_token(s, FALSE)) == ',' || tok == ')')) {
+                        if (next_token(s))  /* ignore undefined token */
+                            goto fail;
+                    } else
+#endif
+                    {
+                        int label = new_label(s);
+                        if (idx > 0) {
+                            emit_op(s, OP_set_arg_valid_upto);
+                            emit_u16(s, idx);
+                        }
+                        emit_op(s, OP_get_arg);
+                        emit_u16(s, idx);
+                        emit_op(s, OP_undefined);
+                        emit_op(s, OP_strict_eq);
+                        emit_goto(s, OP_if_false, label);
+                        if (js_parse_assign_expr(s, TRUE))
+                            goto fail;
+                        set_object_name(s, name);
+                        emit_op(s, OP_put_arg);
+                        emit_u16(s, idx);
+                        /* Close var object: see above comment. */
+                        emit_op(s, OP_close_var_object);
+                        emit_label(s, label);
+                    }
+                } else if (!has_opt_arg) {
+                    fd->defined_arg_count++;
+                }
+            } else {
+                js_parse_error(s, "missing formal parameter");
+                goto fail;
+            }
+            if (rest && s->token.val != ')') {
+                js_parse_expect(s, ')');
+                goto fail;
+            }
+            if (s->token.val == ',') {
+                if (next_token(s))
+                    goto fail;
+            }
+        }
+        if ((func_type == JS_PARSE_FUNC_GETTER && fd->arg_count != 0) ||
+            (func_type == JS_PARSE_FUNC_SETTER && fd->arg_count != 1)) {
+            js_parse_error(s, "invalid number of arguments for getter or setter");
+            goto fail;
+        }
+    }
+
+    if (next_token(s))
+        goto fail;
+
+    /* generator function: yield after the parameters are evaluated */
+    if (func_kind == JS_FUNC_GENERATOR ||
+        func_kind == JS_FUNC_ASYNC_GENERATOR)
+        emit_op(s, OP_initial_yield);
+
+    /* in generators, yield expression is forbidden during the parsing
+       of the arguments */
+    fd->in_function_body = TRUE;
+    push_scope(s);  /* enter body scope: fd->scope_level = 1 */
+
+    if (s->token.val == TOK_ARROW) {
+        if (next_token(s))
+            goto fail;
+
+        if (s->token.val != '{') {
+            if (js_parse_function_check_names(s, fd, func_name))
+                goto fail;
+
+            if (js_parse_assign_expr(s, TRUE))
+                goto fail;
+
+            if (func_kind != JS_FUNC_NORMAL)
+                emit_op(s, OP_return_async);
+            else
+                emit_op(s, OP_return);
+
+            if (!(fd->js_mode & JS_MODE_STRIP)) {
+                /* save the function source code */
+                /* the end of the function source code is after the last
+                   token of the function source stored into s->last_ptr */
+                fd->source_len = s->last_ptr - ptr;
+                fd->source = js_strndup(ctx, (const char *)ptr, fd->source_len);
+                if (!fd->source)
+                    goto fail;
+            }
+            goto done;
+        }
+    }
+
+    if (js_parse_expect(s, '{'))
+        goto fail;
+
+    if (js_parse_directives(s))
+        goto fail;
+
+    /* in strict_mode, check function and argument names */
+    if (js_parse_function_check_names(s, fd, func_name))
+        goto fail;
+
+    while (s->token.val != '}') {
+        if (js_parse_source_element(s))
+            goto fail;
+    }
+    if (!(fd->js_mode & JS_MODE_STRIP)) {
+        /* save the function source code */
+        fd->source_len = s->buf_ptr - ptr;
+        fd->source = js_strndup(ctx, (const char *)ptr, fd->source_len);
+        if (!fd->source)
+            goto fail;
+    }
+
+    if (next_token(s)) {
+        /* consume the '}' */
+        goto fail;
+    }
+
+    /* in case there is no return, add one */
+    if (js_is_live_code(s)) {
+        emit_return(s, FALSE);
+    }
+done:
+    s->cur_func = fd->parent;
+
+    /* create the function object */
+    {
+        int idx;
+        JSAtom func_name = fd->func_name;
+
+        /* the real object will be set at the end of the compilation */
+        idx = cpool_add(s, JS_NULL);
+        fd->parent_cpool_idx = idx;
+
+        if (is_expr) {
+            /* for constructors, no code needs to be generated here */
+            if (func_type != JS_PARSE_FUNC_CLASS_CONSTRUCTOR &&
+                func_type != JS_PARSE_FUNC_DERIVED_CLASS_CONSTRUCTOR) {
+                /* OP_fclosure creates the function object from the bytecode
+                   and adds the scope information */
+                emit_op(s, OP_fclosure);
+                emit_u32(s, idx);
+                if (func_name == JS_ATOM_NULL) {
+                    emit_op(s, OP_set_name);
+                    emit_u32(s, JS_ATOM_NULL);
+                }
+            }
+        } else if (func_type == JS_PARSE_FUNC_VAR) {
+            emit_op(s, OP_fclosure);
+            emit_u32(s, idx);
+            if (create_func_var) {
+                if (s->cur_func->is_global_var) {
+                    JSHoistedDef *hf;
+                    /* the global variable must be defined at the start of the
+                       function */
+                    hf = add_hoisted_def(ctx, s->cur_func, -1, func_name, -1, FALSE);
+                    if (!hf)
+                        goto fail;
+                    hf->force_init = ((s->cur_func->js_mode & JS_MODE_STRICT) != 0);
+                    /* store directly into global var, bypass lexical scope */
+                    emit_op(s, OP_dup);
+                    emit_op(s, OP_scope_put_var);
+                    emit_atom(s, func_name);
+                    emit_u16(s, 0);
+                } else {
+                    /* do not call define_var to bypass lexical scope check */
+                    func_idx = find_var(ctx, s->cur_func, func_name);
+                    if (func_idx < 0) {
+                        func_idx = add_var(ctx, s->cur_func, func_name);
+                        if (func_idx < 0)
+                            goto fail;
+                    }
+                    /* store directly into local var, bypass lexical catch scope */
+                    emit_op(s, OP_dup);
+                    emit_op(s, OP_scope_put_var);
+                    emit_atom(s, func_name);
+                    emit_u16(s, 0);
+                }
+            }
+            if (lexical_func_idx >= 0) {
+                /* lexical variable will be initialized upon entering scope */
+                s->cur_func->vars[lexical_func_idx].func_pool_idx = idx;
+                emit_op(s, OP_drop);
+            } else {
+                /* store function object into its lexical name */
+                /* XXX: could use OP_put_loc directly */
+                emit_op(s, OP_scope_put_var_init);
+                emit_atom(s, func_name);
+                emit_u16(s, s->cur_func->scope_level);
+            }
+        } else {
+            if (!s->cur_func->is_global_var) {
+                /* define_var should not fail since there is no scope chain
+                   XXX: maybe pass a different token to ensure no failure?
+                 */
+                int var_idx = define_var(s, s->cur_func, func_name, TOK_VAR);
+
+                /* the variable will be assigned at the top of the function */
+                if (!add_hoisted_def(ctx, s->cur_func, idx, JS_ATOM_NULL, var_idx, FALSE))
+                    goto fail;
+            } else {
+                JSAtom func_var_name;
+                if (func_name == JS_ATOM_NULL)
+                    func_var_name = JS_ATOM__default_; /* export default */
+                else
+                    func_var_name = func_name;
+                /* the variable will be assigned at the top of the function */
+                if (!add_hoisted_def(ctx, s->cur_func, idx, func_var_name, -1, FALSE))
+                    goto fail;
+                if (export_flag != JS_PARSE_EXPORT_NONE) {
+                    if (!add_export_entry(s, s->cur_func->module, func_var_name,
+                                          export_flag == JS_PARSE_EXPORT_NAMED ? func_var_name : JS_ATOM_default, JS_EXPORT_TYPE_LOCAL))
+                        goto fail;
+                }
+            }
+        }
+    }
+    return 0;
+ fail:
+    s->cur_func = fd->parent;
+    js_free_function_def(ctx, fd);
+    if (pfd)
+        *pfd = NULL;
+    return -1;
+}
+
+static __exception int js_parse_function_decl(JSParseState *s,
+                                              JSParseFunctionEnum func_type,
+                                              JSFunctionKindEnum func_kind,
+                                              JSAtom func_name,
+                                              const uint8_t *ptr,
+                                              int function_line_num)
+{
+    return js_parse_function_decl2(s, func_type, func_kind, func_name, ptr,
+                                   function_line_num, JS_PARSE_EXPORT_NONE,
+                                   NULL);
+}
+
+static __exception int js_parse_program(JSParseState *s)
+{
+    JSFunctionDef *fd = s->cur_func;
+    int idx;
+
+    if (next_token(s))
+        return -1;
+
+    if (js_parse_directives(s))
+        return -1;
+
+    fd->is_global_var = (fd->eval_type == JS_EVAL_TYPE_GLOBAL) ||
+        (fd->eval_type == JS_EVAL_TYPE_MODULE) ||
+        !(fd->js_mode & JS_MODE_STRICT);
+
+    if (!s->is_module) {
+        /* hidden variable for the return value */
+        fd->eval_ret_idx = idx = add_var(s->ctx, fd, JS_ATOM__ret_);
+        if (idx < 0)
+            return -1;
+    }
+
+    while (s->token.val != TOK_EOF) {
+        if (js_parse_source_element(s))
+            return -1;
+    }
+
+    if (!s->is_module) {
+        /* return the value of the hidden variable eval_ret_idx  */
+        emit_op(s, OP_get_loc);
+        emit_u16(s, fd->eval_ret_idx);
+
+        emit_op(s, OP_return);
+    } else {
+        emit_op(s, OP_return_undef);
+    }
+
+    return 0;
+}
+
+static void js_parse_init(JSContext *ctx, JSParseState *s,
+                          const char *input, size_t input_len,
+                          const char *filename)
+{
+    memset(s, 0, sizeof(*s));
+    s->ctx = ctx;
+    s->filename = filename;
+    s->line_num = 1;
+    s->buf_ptr = (const uint8_t *)input;
+    s->buf_end = s->buf_ptr + input_len;
+    s->token.val = ' ';
+    s->token.line_num = 1;
+}
+
+static JSValue JS_EvalFunctionInternal(JSContext *ctx, JSValue fun_obj,
+                                       JSValueConst this_obj,
+                                       JSVarRef **var_refs, JSStackFrame *sf)
+{
+    JSValue ret_val;
+    uint32_t tag;
+
+    tag = JS_VALUE_GET_TAG(fun_obj);
+    if (tag == JS_TAG_FUNCTION_BYTECODE) {
+        fun_obj = js_closure(ctx, fun_obj, var_refs, sf);
+        ret_val = JS_CallFree(ctx, fun_obj, this_obj, 0, NULL);
+    } else if (tag == JS_TAG_MODULE) {
+        JSModuleDef *m;
+        m = JS_VALUE_GET_PTR(fun_obj);
+        /* the module refcount should be >= 2 */
+        JS_FreeValue(ctx, fun_obj);
+        if (js_instantiate_module(ctx, m) < 0)
+            goto fail;
+        ret_val = js_evaluate_module(ctx, m);
+        if (JS_IsException(ret_val)) {
+        fail:
+            js_free_modules(ctx, JS_FREE_MODULE_NOT_EVALUATED);
+            return JS_EXCEPTION;
+        }
+    } else {
+        JS_FreeValue(ctx, fun_obj);
+        ret_val = JS_ThrowTypeError(ctx, "bytecode function expected");
+    }
+    return ret_val;
+}
+
+JSValue JS_EvalFunction(JSContext *ctx, JSValue fun_obj, JSValueConst this_obj)
+{
+    return JS_EvalFunctionInternal(ctx, fun_obj, this_obj, NULL, NULL);
+}
+
+/* 'input' must be zero terminated i.e. input[input_len] = '\0'. */
+static JSValue __JS_EvalInternal(JSContext *ctx, JSValueConst this_obj,
+                                 const char *input, size_t input_len,
+                                 const char *filename, int flags, int scope_idx)
+{
+    JSParseState s1, *s = &s1;
+    int err, js_mode, eval_type;
+    JSValue fun_obj, ret_val;
+    JSStackFrame *sf;
+    JSVarRef **var_refs;
+    JSFunctionBytecode *b;
+    JSFunctionDef *fd;
+    JSModuleDef *m;
+
+    js_parse_init(ctx, s, input, input_len, filename);
+
+    if (flags & JS_EVAL_FLAG_SHEBANG) {
+        const uint8_t *p = s->buf_ptr;
+        if (p[0] == '#' && p[1] == '!') {
+            p += 2;
+            while (*p != '\0' && *p != '\n')
+                p++;
+            s->buf_ptr = p;
+        }
+    }
+    eval_type = flags & JS_EVAL_TYPE_MASK;
+    m = NULL;
+    if (eval_type == JS_EVAL_TYPE_DIRECT) {
+        JSObject *p;
+        sf = ctx->current_stack_frame;
+        assert(sf != NULL);
+        assert(JS_VALUE_GET_TAG(sf->cur_func) == JS_TAG_OBJECT);
+        p = JS_VALUE_GET_OBJ(sf->cur_func);
+        assert(js_class_has_bytecode(p->class_id));
+        b = p->u.func.function_bytecode;
+        var_refs = p->u.func.var_refs;
+        js_mode = b->js_mode;
+    } else {
+        sf = NULL;
+        b = NULL;
+        var_refs = NULL;
+        js_mode = 0;
+        if (flags & JS_EVAL_FLAG_STRICT)
+            js_mode |= JS_MODE_STRICT;
+        if (flags & JS_EVAL_FLAG_STRIP)
+            js_mode |= JS_MODE_STRIP;
+        if (eval_type == JS_EVAL_TYPE_MODULE) {
+            JSAtom module_name = JS_NewAtom(ctx, filename);
+            if (module_name == JS_ATOM_NULL)
+                return JS_EXCEPTION;
+            m = js_new_module_def(ctx, module_name);
+            if (!m)
+                return JS_EXCEPTION;
+            js_mode |= JS_MODE_STRICT;
+        }
+    }
+    fd = js_new_function_def(ctx, NULL, TRUE, FALSE, filename, 1);
+    if (!fd)
+        goto fail1;
+    s->cur_func = fd;
+    fd->eval_type = eval_type;
+    fd->has_this_binding = (eval_type != JS_EVAL_TYPE_DIRECT);
+    if (eval_type == JS_EVAL_TYPE_DIRECT) {
+        fd->new_target_allowed = b->new_target_allowed;
+        fd->super_call_allowed = b->super_call_allowed;
+        fd->super_allowed = b->super_allowed;
+    } else {
+        fd->new_target_allowed = FALSE;
+        fd->super_call_allowed = FALSE;
+        fd->super_allowed = FALSE;
+    }
+    fd->js_mode = js_mode;
+    fd->func_name = JS_DupAtom(ctx, JS_ATOM__eval_);
+    if (b) {
+        if (add_closure_variables(ctx, fd, b, scope_idx))
+            goto fail;
+    }
+    fd->module = m;
+    s->is_module = (m != NULL);
+    s->allow_html_comments = !s->is_module;
+
+    push_scope(s); /* body scope */
+
+    err = js_parse_program(s);
+    if (err) {
+    fail:
+        free_token(s, &s->token);
+        js_free_function_def(ctx, fd);
+        goto fail1;
+    }
+
+    /* create the function object and all the enclosed functions */
+    fun_obj = js_create_function(ctx, fd);
+    if (JS_IsException(fun_obj))
+        goto fail1;
+    /* Could add a flag to avoid resolution if necessary */
+    if (m) {
+        m->func_obj = fun_obj;
+        if (js_resolve_module(ctx, m) < 0)
+            goto fail1;
+        fun_obj = JS_DupValue(ctx, JS_MKPTR(JS_TAG_MODULE, m));
+    }
+    if (flags & JS_EVAL_FLAG_COMPILE_ONLY) {
+        ret_val = fun_obj;
+    } else {
+        ret_val = JS_EvalFunctionInternal(ctx, fun_obj, this_obj, var_refs, sf);
+    }
+    return ret_val;
+ fail1:
+    /* XXX: should free all the unresolved dependencies */
+    if (m)
+        js_free_module_def(ctx, m);
+    return JS_EXCEPTION;
+}
+
+/* the indirection is needed to make 'eval' optional */
+static JSValue JS_EvalInternal(JSContext *ctx, JSValueConst this_obj,
+                               const char *input, size_t input_len,
+                               const char *filename, int flags, int scope_idx)
+{
+    if (unlikely(!ctx->eval_internal)) {
+        return JS_ThrowTypeError(ctx, "eval is not supported");
+    }
+    return ctx->eval_internal(ctx, this_obj, input, input_len, filename,
+                              flags, scope_idx);
+}
+
+static JSValue JS_EvalObject(JSContext *ctx, JSValueConst this_obj,
+                             JSValueConst val, int flags, int scope_idx)
+{
+    JSValue ret;
+    const char *str;
+    int len;
+
+    if (!JS_IsString(val))
+        return JS_DupValue(ctx, val);
+    str = JS_ToCStringLen(ctx, &len, val, FALSE);
+    if (!str)
+        return JS_EXCEPTION;
+    ret = JS_EvalInternal(ctx, this_obj, str, len, "<input>", flags, scope_idx);
+    JS_FreeCString(ctx, str);
+    return ret;
+
+}
+
+JSValue JS_Eval(JSContext *ctx, const char *input, size_t input_len,
+                const char *filename, int eval_flags)
+{
+    int eval_type = eval_flags & JS_EVAL_TYPE_MASK;
+    JSValue ret;
+
+    assert(eval_type == JS_EVAL_TYPE_GLOBAL ||
+           eval_type == JS_EVAL_TYPE_MODULE);
+    ret = JS_EvalInternal(ctx, ctx->global_obj, input, input_len, filename,
+                          eval_flags, -1);
+    return ret;
+}
+
+JSValue JS_EvalBinary(JSContext *ctx,
+                      const uint8_t *buf, size_t buf_len, int flags)
+{
+    JSValue obj;
+    obj = JS_ReadObject(ctx, buf, buf_len, JS_READ_OBJ_BYTECODE);
+    if (JS_IsException(obj))
+        return obj;
+    if (flags & JS_EVAL_BINARY_LOAD_ONLY) {
+        return obj;
+    } else {
+        /* if a module, we load the dependencies here */
+        if (JS_VALUE_GET_TAG(obj) == JS_TAG_MODULE) {
+            JSModuleDef *m = JS_VALUE_GET_PTR(obj);
+            if (js_resolve_module(ctx, m) < 0) {
+                JS_FreeValue(ctx, obj);
+                js_free_modules(ctx, JS_FREE_MODULE_NOT_RESOLVED);
+                return JS_EXCEPTION;
+            }
+        }
+        return JS_EvalFunction(ctx, obj, ctx->global_obj);
+    }
+}
+
+/*******************************************************************/
+/* binary object writer & reader */
+
+typedef enum BCTagEnum {
+    BC_TAG_NULL = 1,
+    BC_TAG_UNDEFINED,
+    BC_TAG_BOOL_FALSE,
+    BC_TAG_BOOL_TRUE,
+    BC_TAG_INT32,
+    BC_TAG_FLOAT64,
+    BC_TAG_STRING,
+    BC_TAG_OBJECT,
+    BC_TAG_ARRAY,
+    BC_TAG_BIG_INT,
+    BC_TAG_BIG_FLOAT,
+    BC_TAG_TEMPLATE_OBJECT,
+    BC_TAG_FUNCTION_BYTECODE,
+    BC_TAG_MODULE,
+} BCTagEnum;
+
+#ifdef CONFIG_BIGNUM
+#define BC_BASE_VERSION 2
+#else
+#define BC_BASE_VERSION 1
+#endif
+#define BC_BE_VERSION 0x40
+#ifdef WORDS_BIGENDIAN
+#define BC_VERSION (BC_BASE_VERSION | BC_BE_VERSION)
+#else
+#define BC_VERSION BC_BASE_VERSION
+#endif
+
+typedef struct BCWriterState {
+    JSContext *ctx;
+    DynBuf dbuf;
+    BOOL byte_swap;
+    BOOL allow_bytecode;
+    uint32_t first_atom;
+    uint32_t *atom_to_idx;
+    int atom_to_idx_size;
+    JSAtom *idx_to_atom;
+    int idx_to_atom_count;
+    int idx_to_atom_size;
+} BCWriterState;
+
+#ifdef DUMP_READ_OBJECT
+static const char * const bc_tag_str[] = {
+    "invalid",
+    "null",
+    "undefined",
+    "false",
+    "true",
+    "int32",
+    "float64",
+    "string",
+    "object",
+    "array",
+    "big_int",
+    "big_float",
+    "template",
+    "function",
+    "module",
+};
+#endif
+
+static void bc_put_u8(BCWriterState *s, uint8_t v)
+{
+    dbuf_putc(&s->dbuf, v);
+}
+
+static void bc_put_u16(BCWriterState *s, uint16_t v)
+{
+    if (s->byte_swap)
+        v = bswap16(v);
+    dbuf_put_u16(&s->dbuf, v);
+}
+
+#if defined(_MSC_VER)
+static void bc_put_u32(BCWriterState *s, uint32_t v)
+#else
+static __attribute__((unused)) void bc_put_u32(BCWriterState *s, uint32_t v)
+#endif
+{
+    if (s->byte_swap)
+        v = bswap32(v);
+    dbuf_put_u32(&s->dbuf, v);
+}
+
+static void bc_put_u64(BCWriterState *s, uint64_t v)
+{
+    if (s->byte_swap)
+        v = bswap64(v);
+    dbuf_put(&s->dbuf, (uint8_t *)&v, sizeof(v));
+}
+
+static void bc_put_leb128(BCWriterState *s, uint32_t v)
+{
+    dbuf_put_leb128(&s->dbuf, v);
+}
+
+static void bc_put_sleb128(BCWriterState *s, int32_t v)
+{
+    dbuf_put_sleb128(&s->dbuf, v);
+}
+
+static void bc_set_flags(uint32_t *pflags, int *pidx, uint32_t val, int n)
+{
+    *pflags = *pflags | (val << *pidx);
+    *pidx += n;
+}
+
+static int bc_atom_to_idx(BCWriterState *s, uint32_t *pres, JSAtom atom)
+{
+    uint32_t v;
+
+    if (atom < s->first_atom || __JS_AtomIsTaggedInt(atom)) {
+        *pres = atom;
+        return 0;
+    }
+    atom -= s->first_atom;
+    if (atom < s->atom_to_idx_size && s->atom_to_idx[atom] != 0) {
+        *pres = s->atom_to_idx[atom];
+        return 0;
+    }
+    if (atom >= s->atom_to_idx_size) {
+        size_t new_size, i, slack;
+        uint32_t *new_tab;
+        /* XXX: potential arithmetic overflow */
+        new_size = s->atom_to_idx_size * 3 / 2;
+        if ((atom + 1) > new_size)
+            new_size = atom + 1;
+        new_tab = js_realloc2(s->ctx, s->atom_to_idx,
+                              new_size * sizeof(s->atom_to_idx[0]), &slack);
+        if (!new_tab)
+            goto fail;
+        new_size += slack / sizeof(*new_tab);
+        for(i = s->atom_to_idx_size; i < new_size; i++)
+            new_tab[i] = 0;
+        s->atom_to_idx = new_tab;
+        s->atom_to_idx_size = new_size;
+    }
+    if ((s->idx_to_atom_count + 1) > s->idx_to_atom_size) {
+        size_t new_size, slack;
+        JSAtom *new_tab;
+        new_size = s->idx_to_atom_size * 3 / 2;
+        if ((s->idx_to_atom_count + 1) > new_size)
+            new_size = s->idx_to_atom_count + 1;
+        new_tab = js_realloc2(s->ctx, s->idx_to_atom,
+                              new_size * sizeof(s->idx_to_atom[0]), &slack);
+        if (!new_tab)
+            goto fail;
+        new_size += slack / sizeof(*new_tab);
+        s->idx_to_atom = new_tab;
+        s->idx_to_atom_size = new_size;
+    }
+
+    v = s->idx_to_atom_count++;
+    s->idx_to_atom[v] = atom + s->first_atom;
+    v += s->first_atom;
+    s->atom_to_idx[atom] = v;
+    *pres = v;
+    return 0;
+ fail:
+    *pres = 0;
+    return -1;
+}
+
+static int bc_put_atom(BCWriterState *s, JSAtom atom)
+{
+    uint32_t v;
+
+    if (__JS_AtomIsTaggedInt(atom)) {
+        v = (__JS_AtomToUInt32(atom) << 1) | 1;
+    } else {
+        if (bc_atom_to_idx(s, &v, atom))
+            return -1;
+        v <<= 1;
+    }
+    bc_put_leb128(s, v);
+    return 0;
+}
+
+static void bc_byte_swap(uint8_t *bc_buf, int bc_len)
+{
+    int pos, len, op, fmt;
+
+    pos = 0;
+    while (pos < bc_len) {
+        op = bc_buf[pos];
+        len = opcode_info[op].size;
+        fmt = opcode_info[op].fmt;
+        switch(fmt) {
+        case OP_FMT_u16:
+        case OP_FMT_i16:
+        case OP_FMT_label16:
+        case OP_FMT_npop:
+        case OP_FMT_loc:
+        case OP_FMT_arg:
+        case OP_FMT_var_ref:
+            put_u16(bc_buf + pos + 1,
+                    bswap16(get_u16(bc_buf + pos + 1)));
+            break;
+        case OP_FMT_i32:
+        case OP_FMT_u32:
+        case OP_FMT_const:
+        case OP_FMT_label:
+        case OP_FMT_atom:
+        case OP_FMT_atom_u8:
+            put_u32(bc_buf + pos + 1,
+                    bswap32(get_u32(bc_buf + pos + 1)));
+            break;
+        case OP_FMT_atom_u16:
+        case OP_FMT_label_u16:
+            put_u32(bc_buf + pos + 1,
+                    bswap32(get_u32(bc_buf + pos + 1)));
+            put_u16(bc_buf + pos + 1 + 4,
+                    bswap16(get_u16(bc_buf + pos + 1 + 4)));
+            break;
+        case OP_FMT_atom_label_u8:
+        case OP_FMT_atom_label_u16:
+            put_u32(bc_buf + pos + 1,
+                    bswap32(get_u32(bc_buf + pos + 1)));
+            put_u32(bc_buf + pos + 1 + 4,
+                    bswap32(get_u32(bc_buf + pos + 1 + 4)));
+            if (fmt == OP_FMT_atom_label_u16) {
+                put_u16(bc_buf + pos + 1 + 4 + 4,
+                        bswap16(get_u16(bc_buf + pos + 1 + 4 + 4)));
+            }
+            break;
+        default:
+            break;
+        }
+        pos += len;
+    }
+}
+
+static int JS_WriteFunctionBytecode(BCWriterState *s,
+                                    const uint8_t *bc_buf1, int bc_len)
+{
+    int pos, len, op;
+    JSAtom atom;
+    uint8_t *bc_buf;
+    uint32_t val;
+
+    bc_buf = js_malloc(s->ctx, bc_len);
+    if (!bc_buf)
+        return -1;
+    memcpy(bc_buf, bc_buf1, bc_len);
+
+    pos = 0;
+    while (pos < bc_len) {
+        op = bc_buf[pos];
+        len = opcode_info[op].size;
+        switch(opcode_info[op].fmt) {
+        case OP_FMT_atom:
+        case OP_FMT_atom_u8:
+        case OP_FMT_atom_u16:
+        case OP_FMT_atom_label_u8:
+        case OP_FMT_atom_label_u16:
+            atom = get_u32(bc_buf + pos + 1);
+            if (bc_atom_to_idx(s, &val, atom))
+                goto fail;
+            put_u32(bc_buf + pos + 1, val);
+            break;
+        default:
+            break;
+        }
+        pos += len;
+    }
+
+    if (s->byte_swap)
+        bc_byte_swap(bc_buf, bc_len);
+
+    dbuf_put(&s->dbuf, bc_buf, bc_len);
+
+    js_free(s->ctx, bc_buf);
+    return 0;
+ fail:
+    js_free(s->ctx, bc_buf);
+    return -1;
+}
+
+static void JS_WriteString(BCWriterState *s, JSString *p)
+{
+    int i;
+    bc_put_leb128(s, ((uint32_t)p->len << 1) | p->is_wide_char);
+    if (p->is_wide_char) {
+        for(i = 0; i < p->len; i++)
+            bc_put_u16(s, p->u.str16[i]);
+    } else {
+        dbuf_put(&s->dbuf, p->u.str8, p->len);
+    }
+}
+
+static int JS_WriteObjectRec(BCWriterState *s, JSValueConst obj)
+{
+    uint32_t tag = JS_VALUE_GET_NORM_TAG(obj);
+
+    switch(tag) {
+    case JS_TAG_NULL:
+        bc_put_u8(s, BC_TAG_NULL);
+        break;
+    case JS_TAG_UNDEFINED:
+        bc_put_u8(s, BC_TAG_UNDEFINED);
+        break;
+    case JS_TAG_BOOL:
+        bc_put_u8(s, BC_TAG_BOOL_FALSE + JS_VALUE_GET_INT(obj));
+        break;
+    case JS_TAG_INT:
+        bc_put_u8(s, BC_TAG_INT32);
+        bc_put_sleb128(s, JS_VALUE_GET_INT(obj));
+        break;
+    case JS_TAG_FLOAT64:
+        {
+            JSFloat64Union u;
+            bc_put_u8(s, BC_TAG_FLOAT64);
+            u.d = JS_VALUE_GET_FLOAT64(obj);
+            bc_put_u64(s, u.u64);
+        }
+        break;
+    case JS_TAG_STRING:
+        {
+            JSString *p = JS_VALUE_GET_STRING(obj);
+            bc_put_u8(s, BC_TAG_STRING);
+            JS_WriteString(s, p);
+        }
+        break;
+    case JS_TAG_FUNCTION_BYTECODE:
+        {
+            JSFunctionBytecode *b = JS_VALUE_GET_PTR(obj);
+            uint32_t flags;
+            int idx, i;
+
+            if (!s->allow_bytecode)
+                goto invalid_tag;
+            bc_put_u8(s, BC_TAG_FUNCTION_BYTECODE);
+            flags = idx = 0;
+            bc_set_flags(&flags, &idx, b->has_prototype, 1);
+            bc_set_flags(&flags, &idx, b->has_simple_parameter_list, 1);
+            bc_set_flags(&flags, &idx, b->is_derived_class_constructor, 1);
+            bc_set_flags(&flags, &idx, b->need_home_object, 1);
+            bc_set_flags(&flags, &idx, b->func_kind, 2);
+            bc_set_flags(&flags, &idx, b->new_target_allowed, 1);
+            bc_set_flags(&flags, &idx, b->super_call_allowed, 1);
+            bc_set_flags(&flags, &idx, b->super_allowed, 1);
+            bc_set_flags(&flags, &idx, b->has_debug, 1);
+            assert(idx <= 16);
+            bc_put_u16(s, flags);
+            bc_put_u8(s, b->js_mode);
+            bc_put_atom(s, b->func_name);
+
+            bc_put_leb128(s, b->arg_count);
+            bc_put_leb128(s, b->var_count);
+            bc_put_leb128(s, b->defined_arg_count);
+            bc_put_leb128(s, b->stack_size);
+            bc_put_leb128(s, b->closure_var_count);
+            bc_put_leb128(s, b->cpool_count);
+            bc_put_leb128(s, b->byte_code_len);
+            if (b->vardefs) {
+                bc_put_leb128(s, b->arg_count + b->var_count);
+                for(i = 0; i < b->arg_count + b->var_count; i++) {
+                    JSVarDef *vd = &b->vardefs[i];
+                    bc_put_atom(s, vd->var_name);
+                    bc_put_leb128(s, vd->scope_level);
+                    bc_put_leb128(s, vd->scope_next + 1);
+                    flags = idx = 0;
+                    bc_set_flags(&flags, &idx, vd->is_catch, 1);
+                    bc_set_flags(&flags, &idx, vd->is_function, 1);
+                    bc_set_flags(&flags, &idx, vd->is_func_var, 1);
+                    bc_set_flags(&flags, &idx, vd->is_const, 1);
+                    bc_set_flags(&flags, &idx, vd->is_lexical, 1);
+                    bc_set_flags(&flags, &idx, vd->is_captured, 1);
+                    assert(idx <= 8);
+                    bc_put_u8(s, flags);
+                }
+            } else {
+                bc_put_leb128(s, 0);
+            }
+
+            for(i = 0; i < b->closure_var_count; i++) {
+                JSClosureVar *cv = &b->closure_var[i];
+                bc_put_atom(s, cv->var_name);
+                bc_put_leb128(s, cv->var_idx);
+                flags = idx = 0;
+                bc_set_flags(&flags, &idx, cv->is_local, 1);
+                bc_set_flags(&flags, &idx, cv->is_arg, 1);
+                bc_set_flags(&flags, &idx, cv->is_const, 1);
+                bc_set_flags(&flags, &idx, cv->is_lexical, 1);
+                bc_set_flags(&flags, &idx, cv->is_catch, 1);
+                assert(idx <= 8);
+                bc_put_u8(s, flags);
+            }
+
+            if (JS_WriteFunctionBytecode(s, b->byte_code_buf, b->byte_code_len))
+                goto fail;
+
+            if (b->has_debug) {
+                bc_put_atom(s, b->debug.filename);
+                bc_put_leb128(s, b->debug.line_num);
+                bc_put_leb128(s, b->debug.pc2line_len);
+                dbuf_put(&s->dbuf, b->debug.pc2line_buf, b->debug.pc2line_len);
+            }
+
+            for(i = 0; i < b->cpool_count; i++) {
+                if (JS_WriteObjectRec(s, b->cpool[i]))
+                    goto fail;
+            }
+        }
+        break;
+    case JS_TAG_MODULE:
+        {
+            JSModuleDef *m = JS_VALUE_GET_PTR(obj);
+            int i;
+
+            if (!s->allow_bytecode)
+                goto invalid_tag;
+            bc_put_u8(s, BC_TAG_MODULE);
+            bc_put_atom(s, m->module_name);
+
+            bc_put_leb128(s, m->req_module_entries_count);
+            for(i = 0; i < m->req_module_entries_count; i++) {
+                JSReqModuleEntry *rme = &m->req_module_entries[i];
+                bc_put_atom(s, rme->module_name);
+            }
+
+            bc_put_leb128(s, m->export_entries_count);
+            for(i = 0; i < m->export_entries_count; i++) {
+                JSExportEntry *me = &m->export_entries[i];
+                bc_put_u8(s, me->export_type);
+                if (me->export_type == JS_EXPORT_TYPE_LOCAL) {
+                    bc_put_leb128(s, me->u.local.var_idx);
+                } else {
+                    bc_put_leb128(s, me->u.req_module_idx);
+                    bc_put_atom(s, me->local_name);
+                }
+                bc_put_atom(s, me->export_name);
+            }
+
+            bc_put_leb128(s, m->star_export_entries_count);
+            for(i = 0; i < m->star_export_entries_count; i++) {
+                JSStarExportEntry *se = &m->star_export_entries[i];
+                bc_put_leb128(s, se->req_module_idx);
+            }
+
+            bc_put_leb128(s, m->import_entries_count);
+            for(i = 0; i < m->import_entries_count; i++) {
+                JSImportEntry *mi = &m->import_entries[i];
+                bc_put_leb128(s, mi->var_idx);
+                bc_put_atom(s, mi->import_name);
+                bc_put_leb128(s, mi->req_module_idx);
+            }
+
+            if (JS_WriteObjectRec(s, m->func_obj))
+                goto fail;
+        }
+        break;
+    case JS_TAG_OBJECT:
+        {
+            JSObject *p = JS_VALUE_GET_OBJ(obj);
+            uint32_t i, prop_count, len;
+            JSShape *sh;
+            JSShapeProperty *pr;
+            JSValue val;
+            int ret, pass;
+            BOOL is_template;
+            JSAtom atom;
+
+            if (p->class_id != JS_CLASS_ARRAY &&
+                p->class_id != JS_CLASS_OBJECT) {
+                JS_ThrowTypeError(s->ctx, "unsupported object class");
+                goto fail;
+            }
+            if (p->tmp_mark) {
+                JS_ThrowTypeError(s->ctx, "circular reference");
+                goto fail;
+            }
+            p->tmp_mark = 1;
+            if (p->class_id == JS_CLASS_ARRAY) {
+                if (s->allow_bytecode && !p->extensible) {
+                    /* not extensible array: we consider it is a
+                       template when we are saving bytecode */
+                    bc_put_u8(s, BC_TAG_TEMPLATE_OBJECT);
+                    is_template = TRUE;
+                } else {
+                    bc_put_u8(s, BC_TAG_ARRAY);
+                    is_template = FALSE;
+                }
+                if (js_get_length32(s->ctx, &len, obj))
+                    goto fail1;
+                bc_put_leb128(s, len);
+                for(i = 0; i < len; i++) {
+                    val = JS_GetPropertyUint32(s->ctx, obj, i);
+                    if (JS_IsException(val))
+                        goto fail1;
+                    ret = JS_WriteObjectRec(s, val);
+                    JS_FreeValue(s->ctx, val);
+                    if (ret)
+                        goto fail1;
+                }
+                if (is_template) {
+                    val = JS_GetProperty(s->ctx, obj, JS_ATOM_raw);
+                    if (JS_IsException(val))
+                        goto fail1;
+                    ret = JS_WriteObjectRec(s, val);
+                    JS_FreeValue(s->ctx, val);
+                    if (ret)
+                        goto fail1;
+                }
+            } else {
+                bc_put_u8(s, BC_TAG_OBJECT);
+                prop_count = 0;
+                sh = p->shape;
+                for(pass = 0; pass < 2; pass++) {
+                    if (pass == 1)
+                        bc_put_leb128(s, prop_count);
+                    for(i = 0, pr = get_shape_prop(sh); i < sh->prop_count; i++, pr++) {
+                        atom = pr->atom;
+                        if (atom != JS_ATOM_NULL &&
+                            JS_AtomIsString(s->ctx, atom) &&
+                            (pr->flags & JS_PROP_ENUMERABLE)) {
+                            if (pr->flags & JS_PROP_TMASK) {
+                                JS_ThrowTypeError(s->ctx, "only value properties are supported");
+                                goto fail;
+                            }
+                            if (pass == 0) {
+                                prop_count++;
+                            } else {
+                                bc_put_atom(s, atom);
+                                if (JS_WriteObjectRec(s, p->prop[i].u.value)) {
+                                fail1:
+                                    p->tmp_mark = 0;
+                                    goto fail;
+                                }
+                            }
+                        }
+                    }
+                }
+            }
+            p->tmp_mark = 0;
+        }
+        break;
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_INT:
+    case JS_TAG_BIG_FLOAT:
+        {
+            int32_t e;
+            JSBigFloat *bf = JS_VALUE_GET_PTR(obj);
+            bf_t *a = &bf->num;
+            size_t len, i, n1, j;
+            limb_t v;
+
+            bc_put_u8(s, tag == JS_TAG_BIG_INT ? BC_TAG_BIG_INT :
+                      BC_TAG_BIG_FLOAT);
+            if (a->len != 0) {
+                i = 0;
+                while (i < a->len && a->tab[i] == 0)
+                    i++;
+                assert(i < a->len);
+                v = a->tab[i];
+                n1 = sizeof(limb_t);
+                while ((v & 0xff) == 0) {
+                    n1--;
+                    v >>= 8;
+                }
+                i++;
+                len = (a->len - i) * sizeof(limb_t) + n1;
+                if (len > INT32_MAX) {
+                    JS_ThrowInternalError(s->ctx, "bignum is too large");
+                    goto fail;
+                }
+                /* XXX: it would be slightly more efficient to put the
+                   sign in the MSB of the mantissa */
+                bc_put_leb128(s, len * 2 + a->sign);
+                /* always saved in byte based little endian representation */
+                for(j = 0; j < n1; j++) {
+                    dbuf_putc(&s->dbuf, v >> (j * 8));
+                }
+                for(; i < a->len; i++) {
+                    limb_t v = a->tab[i];
+#if LIMB_BITS == 32
+#ifdef WORDS_BIGENDIAN
+                    v = bswap32(v);
+#endif
+                    dbuf_put_u32(&s->dbuf, v);
+#else
+#ifdef WORDS_BIGENDIAN
+                    v = bswap64(v);
+#endif
+                    dbuf_put_u64(&s->dbuf, v);
+#endif
+                }
+#if LIMB_BITS != 32
+                if (a->expn <= INT32_MIN || a->expn >= (INT32_MAX - 1)) {
+                    JS_ThrowInternalError(s->ctx, "bignum exponent is too large");
+                    goto fail;
+                }
+#endif
+                bc_put_sleb128(s, a->expn);
+            } else {
+                bc_put_leb128(s, a->sign); /* length + sign */
+                if (tag == JS_TAG_BIG_FLOAT) {
+                    /* special numbers */
+                    if (a->expn == BF_EXP_ZERO) {
+                        e = 0;
+                    } else if (a->expn == BF_EXP_INF) {
+                        e = 1;
+                    } else {
+                        e = 2;
+                    }
+                    bc_put_u8(s, e);
+                }
+            }
+        }
+        break;
+#endif
+    default:
+    invalid_tag:
+        JS_ThrowInternalError(s->ctx, "unsupported tag (%d)", tag);
+        goto fail;
+    }
+    return 0;
+
+ fail:
+    return -1;
+}
+
+/* create the atom table */
+static int JS_WriteObjectAtoms(BCWriterState *s)
+{
+    JSRuntime *rt = s->ctx->rt;
+    DynBuf dbuf1;
+    int i, atoms_size;
+    uint8_t version;
+
+    dbuf1 = s->dbuf;
+    js_dbuf_init(s->ctx, &s->dbuf);
+
+    version = BC_VERSION;
+    if (s->byte_swap)
+        version ^= BC_BE_VERSION;
+    bc_put_u8(s, version);
+
+    bc_put_leb128(s, s->idx_to_atom_count);
+    for(i = 0; i < s->idx_to_atom_count; i++) {
+        JSAtomStruct *p = rt->atom_array[s->idx_to_atom[i]];
+        JS_WriteString(s, p);
+    }
+    /* XXX: should check for OOM in above phase */
+
+    /* move the atoms at the start */
+    /* XXX: could just append dbuf1 data, but it uses more memory if
+       dbuf1 is larger than dbuf */
+    atoms_size = s->dbuf.size;
+    if (dbuf_realloc(&dbuf1, dbuf1.size + atoms_size))
+        goto fail;
+    memmove(dbuf1.buf + atoms_size, dbuf1.buf, dbuf1.size);
+    memcpy(dbuf1.buf, s->dbuf.buf, atoms_size);
+    dbuf1.size += atoms_size;
+    dbuf_free(&s->dbuf);
+    s->dbuf = dbuf1;
+    return 0;
+ fail:
+    dbuf_free(&dbuf1);
+    return -1;
+}
+
+uint8_t *JS_WriteObject(JSContext *ctx, size_t *psize, JSValueConst obj,
+                        int flags)
+{
+    BCWriterState ss, *s = &ss;
+
+    memset(s, 0, sizeof(*s));
+    s->ctx = ctx;
+    /* XXX: byte swapped output is untested */
+    s->byte_swap = ((flags & JS_WRITE_OBJ_BSWAP) != 0);
+    s->allow_bytecode = ((flags & JS_WRITE_OBJ_BYTECODE) != 0);
+    /* XXX: could use a different version when bytecode is included */
+    if (s->allow_bytecode)
+        s->first_atom = JS_ATOM_END;
+    else
+        s->first_atom = 1;
+    js_dbuf_init(ctx, &s->dbuf);
+
+    if (JS_WriteObjectRec(s, obj))
+        goto fail;
+    if (JS_WriteObjectAtoms(s))
+        goto fail;
+    js_free(ctx, s->atom_to_idx);
+    js_free(ctx, s->idx_to_atom);
+    *psize = s->dbuf.size;
+    return s->dbuf.buf;
+ fail:
+    js_free(ctx, s->atom_to_idx);
+    js_free(ctx, s->idx_to_atom);
+    dbuf_free(&s->dbuf);
+    *psize = 0;
+    return NULL;
+}
+
+typedef struct BCReaderState {
+    JSContext *ctx;
+    const uint8_t *buf_start, *ptr, *buf_end;
+    uint32_t first_atom;
+    uint32_t idx_to_atom_count;
+    JSAtom *idx_to_atom;
+    int error_state;
+    BOOL allow_bytecode;
+    BOOL is_rom_data;
+#ifdef DUMP_READ_OBJECT
+    const uint8_t *ptr_last;
+    int level;
+#endif
+} BCReaderState;
+
+#ifdef DUMP_READ_OBJECT
+#if defined(_MSC_VER)
+static void bc_read_trace(BCReaderState *s, const char *fmt, ...) {
+#else
+static void __attribute__((format(printf, 2, 3))) bc_read_trace(BCReaderState *s, const char *fmt, ...) {
+#endif
+    va_list ap;
+    int i, n, n0;
+
+    if (!s->ptr_last)
+        s->ptr_last = s->buf_start;
+
+    n = n0 = 0;
+    if (s->ptr > s->ptr_last || s->ptr == s->buf_start) {
+        n0 = printf("%04x: ", (int)(s->ptr_last - s->buf_start));
+        n += n0;
+    }
+    for (i = 0; s->ptr_last < s->ptr; i++) {
+        if ((i & 7) == 0 && i > 0) {
+            printf("\n%*s", n0, "");
+            n = n0;
+        }
+        n += printf(" %02x", *s->ptr_last++);
+    }
+    if (*fmt == '}')
+        s->level--;
+    if (n < 32 + s->level * 2) {
+        printf("%*s", 32 + s->level * 2 - n, "");
+    }
+    va_start(ap, fmt);
+    vfprintf(stdout, fmt, ap);
+    va_end(ap);
+    if (strchr(fmt, '{'))
+        s->level++;
+}
+#else
+#define bc_read_trace(...)
+#endif
+
+static int bc_read_error_end(BCReaderState *s)
+{
+    if (!s->error_state) {
+        JS_ThrowSyntaxError(s->ctx, "read after the end of the buffer");
+    }
+    return s->error_state = -1;
+}
+
+static int bc_get_u8(BCReaderState *s, uint8_t *pval)
+{
+    if (unlikely(s->buf_end - s->ptr < 1)) {
+        *pval = 0; /* avoid warning */
+        return bc_read_error_end(s);
+    }
+    *pval = *s->ptr++;
+    return 0;
+}
+
+static int bc_get_u16(BCReaderState *s, uint16_t *pval)
+{
+    if (unlikely(s->buf_end - s->ptr < 2)) {
+        *pval = 0; /* avoid warning */
+        return bc_read_error_end(s);
+    }
+    *pval = get_u16(s->ptr);
+    s->ptr += 2;
+    return 0;
+}
+
+#if defined(_MSC_VER)
+static int bc_get_u32(BCReaderState *s, uint32_t *pval)
+#else
+static __attribute__((unused)) int bc_get_u32(BCReaderState *s, uint32_t *pval)
+#endif
+{
+    if (unlikely(s->buf_end - s->ptr < 4)) {
+        *pval = 0; /* avoid warning */
+        return bc_read_error_end(s);
+    }
+    *pval = get_u32(s->ptr);
+    s->ptr += 4;
+    return 0;
+}
+
+static int bc_get_u64(BCReaderState *s, uint64_t *pval)
+{
+    if (unlikely(s->buf_end - s->ptr < 8)) {
+        *pval = 0; /* avoid warning */
+        return bc_read_error_end(s);
+    }
+    *pval = get_u64(s->ptr);
+    s->ptr += 8;
+    return 0;
+}
+
+static int bc_get_leb128(BCReaderState *s, uint32_t *pval)
+{
+    int ret;
+    ret = get_leb128(pval, s->ptr, s->buf_end);
+    if (unlikely(ret < 0))
+        return bc_read_error_end(s);
+    s->ptr += ret;
+    return 0;
+}
+
+static int bc_get_sleb128(BCReaderState *s, int32_t *pval)
+{
+    int ret;
+    ret = get_sleb128(pval, s->ptr, s->buf_end);
+    if (unlikely(ret < 0))
+        return bc_read_error_end(s);
+    s->ptr += ret;
+    return 0;
+}
+
+/* XXX: used to read an `int` with a positive value */
+static int bc_get_leb128_int(BCReaderState *s, int *pval)
+{
+    return bc_get_leb128(s, (uint32_t *)pval);
+}
+
+static int bc_get_leb128_u16(BCReaderState *s, uint16_t *pval)
+{
+    uint32_t val;
+    if (bc_get_leb128(s, &val)) {
+        *pval = 0;
+        return -1;
+    }
+    *pval = val;
+    return 0;
+}
+
+static int bc_get_buf(BCReaderState *s, uint8_t *buf, uint32_t buf_len)
+{
+    if (buf_len != 0) {
+        if (unlikely(!buf || s->buf_end - s->ptr < buf_len))
+            return bc_read_error_end(s);
+        memcpy(buf, s->ptr, buf_len);
+        s->ptr += buf_len;
+    }
+    return 0;
+}
+
+static int bc_idx_to_atom(BCReaderState *s, JSAtom *patom, uint32_t idx)
+{
+    JSAtom atom;
+
+    if (__JS_AtomIsTaggedInt(idx)) {
+        atom = idx;
+    } else if (idx < s->first_atom) {
+        atom = JS_DupAtom(s->ctx, idx);
+    } else {
+        idx -= s->first_atom;
+        if (idx >= s->idx_to_atom_count) {
+            JS_ThrowSyntaxError(s->ctx, "invalid atom index (pos=%u)",
+                                (unsigned int)(s->ptr - s->buf_start));
+            *patom = JS_ATOM_NULL;
+            return s->error_state = -1;
+        }
+        atom = JS_DupAtom(s->ctx, s->idx_to_atom[idx]);
+    }
+    *patom = atom;
+    return 0;
+}
+
+static int bc_get_atom(BCReaderState *s, JSAtom *patom)
+{
+    uint32_t v;
+    if (bc_get_leb128(s, &v))
+        return -1;
+    if (v & 1) {
+        *patom = __JS_AtomFromUInt32(v >> 1);
+        return 0;
+    } else {
+        return bc_idx_to_atom(s, patom, v >> 1);
+    }
+}
+
+static JSString *JS_ReadString(BCReaderState *s)
+{
+    uint32_t len;
+    size_t size;
+    BOOL is_wide_char;
+    JSString *p;
+
+    if (bc_get_leb128(s, &len))
+        return NULL;
+    is_wide_char = len & 1;
+    len >>= 1;
+    p = js_alloc_string(s->ctx, len, is_wide_char);
+    if (!p) {
+        s->error_state = -1;
+        return NULL;
+    }
+    size = (size_t)len << is_wide_char;
+    if ((s->buf_end - s->ptr) < size) {
+        bc_read_error_end(s);
+        js_free_string(s->ctx->rt, p);
+        return NULL;
+    }
+    memcpy(p->u.str8, s->ptr, size);
+    s->ptr += size;
+    if (!is_wide_char) {
+        p->u.str8[size] = '\0'; /* add the trailing zero for 8 bit strings */
+    }
+#ifdef DUMP_READ_OBJECT
+    bc_read_trace(s, "string: "); JS_DumpString(s->ctx->rt, p); printf("\n");
+#endif
+    return p;
+}
+
+static uint32_t bc_get_flags(uint32_t flags, int *pidx, int n)
+{
+    uint32_t val;
+    /* XXX: this does not work for n == 32 */
+    val = (flags >> *pidx) & ((1U << n) - 1);
+    *pidx += n;
+    return val;
+}
+
+static int JS_ReadFunctionBytecode(BCReaderState *s, JSFunctionBytecode *b,
+                                   int byte_code_offset, uint32_t bc_len)
+{
+    uint8_t *bc_buf;
+    int pos, len, op;
+    JSAtom atom;
+    uint32_t idx;
+
+    if (s->is_rom_data) {
+        /* directly use the input buffer */
+        if (unlikely(s->buf_end - s->ptr < bc_len))
+            return bc_read_error_end(s);
+        bc_buf = (uint8_t *)s->ptr;
+        s->ptr += bc_len;
+    } else {
+        bc_buf = (void *)((uint8_t*)b + byte_code_offset);
+        if (bc_get_buf(s, bc_buf, bc_len))
+            return -1;
+    }
+    b->byte_code_buf = bc_buf;
+
+    pos = 0;
+    while (pos < bc_len) {
+        op = bc_buf[pos];
+        len = opcode_info[op].size;
+        switch(opcode_info[op].fmt) {
+        case OP_FMT_atom:
+        case OP_FMT_atom_u8:
+        case OP_FMT_atom_u16:
+        case OP_FMT_atom_label_u8:
+        case OP_FMT_atom_label_u16:
+            idx = get_u32(bc_buf + pos + 1);
+            if (s->is_rom_data) {
+                /* just increment the reference count of the atom */
+                JS_DupAtom(s->ctx, (JSAtom)idx);
+            } else {
+                if (bc_idx_to_atom(s, &atom, idx)) {
+                    /* Note: the atoms will be freed up to this position */
+                    b->byte_code_len = pos;
+                    return -1;
+                }
+                put_u32(bc_buf + pos + 1, atom);
+#ifdef DUMP_READ_OBJECT
+                bc_read_trace(s, "at %d, fixup atom: ", pos + 1); print_atom(s->ctx, atom); printf("\n");
+#endif
+            }
+            break;
+        default:
+            break;
+        }
+        pos += len;
+    }
+    return 0;
+}
+
+static JSValue JS_ReadObjectRec(BCReaderState *s)
+{
+    JSContext *ctx = s->ctx;
+    uint8_t tag;
+    JSValue obj = JS_UNDEFINED;
+    JSModuleDef *m = NULL;
+
+    if (bc_get_u8(s, &tag))
+        return JS_EXCEPTION;
+
+    switch(tag) {
+    case BC_TAG_NULL:
+        bc_read_trace(s, "null\n");
+        obj = JS_NULL;
+        break;
+    case BC_TAG_UNDEFINED:
+        bc_read_trace(s, "undefined\n");
+        obj = JS_UNDEFINED;
+        break;
+    case BC_TAG_BOOL_FALSE:
+    case BC_TAG_BOOL_TRUE:
+        bc_read_trace(s, "%s\n", bc_tag_str[tag]);
+        obj = JS_NewBool(ctx, tag - BC_TAG_BOOL_FALSE);
+        break;
+    case BC_TAG_INT32:
+        {
+            int32_t val;
+            if (bc_get_sleb128(s, &val))
+                return JS_EXCEPTION;
+            bc_read_trace(s, "int32 %d\n", val);
+            obj = JS_NewInt32(ctx, val);
+        }
+        break;
+    case BC_TAG_FLOAT64:
+        {
+            JSFloat64Union u;
+            if (bc_get_u64(s, &u.u64))
+                return JS_EXCEPTION;
+            bc_read_trace(s, "float64 %g\n", u.d);
+            obj = __JS_NewFloat64(ctx, u.d);
+        }
+        break;
+    case BC_TAG_STRING:
+        {
+            JSString *p;
+            p = JS_ReadString(s);
+            if (!p)
+                return JS_EXCEPTION;
+            obj = JS_MKPTR(JS_TAG_STRING, p);
+        }
+        break;
+    case BC_TAG_FUNCTION_BYTECODE:
+        {
+            JSFunctionBytecode bc, *b;
+            uint16_t v16;
+            uint8_t v8;
+            int idx, i, local_count;
+            int function_size, cpool_offset, byte_code_offset;
+            int closure_var_offset, vardefs_offset;
+
+            if (!s->allow_bytecode)
+                goto invalid_tag;
+            bc_read_trace(s, "%s {\n", bc_tag_str[tag]);
+
+            memset(&bc, 0, sizeof(bc));
+            bc.header.ref_count = 1;
+            //bc.gc_header.mark = 0;
+
+            if (bc_get_u16(s, &v16))
+                goto fail;
+            idx = 0;
+            bc.has_prototype = bc_get_flags(v16, &idx, 1);
+            bc.has_simple_parameter_list = bc_get_flags(v16, &idx, 1);
+            bc.is_derived_class_constructor = bc_get_flags(v16, &idx, 1);
+            bc.need_home_object = bc_get_flags(v16, &idx, 1);
+            bc.func_kind = bc_get_flags(v16, &idx, 2);
+            bc.new_target_allowed = bc_get_flags(v16, &idx, 1);
+            bc.super_call_allowed = bc_get_flags(v16, &idx, 1);
+            bc.super_allowed = bc_get_flags(v16, &idx, 1);
+            bc.has_debug = bc_get_flags(v16, &idx, 1);
+            bc.read_only_bytecode = s->is_rom_data;
+            if (bc_get_u8(s, &v8))
+                goto fail;
+            bc.js_mode = v8;
+            if (bc_get_atom(s, &bc.func_name))  //@ atom leak if failure
+                goto fail;
+            if (bc_get_leb128_u16(s, &bc.arg_count))
+                goto fail;
+            if (bc_get_leb128_u16(s, &bc.var_count))
+                goto fail;
+            if (bc_get_leb128_u16(s, &bc.defined_arg_count))
+                goto fail;
+            if (bc_get_leb128_u16(s, &bc.stack_size))
+                goto fail;
+            if (bc_get_leb128_int(s, &bc.closure_var_count))
+                goto fail;
+            if (bc_get_leb128_int(s, &bc.cpool_count))
+                goto fail;
+            if (bc_get_leb128_int(s, &bc.byte_code_len))
+                goto fail;
+            if (bc_get_leb128_int(s, &local_count))
+                goto fail;
+
+            if (bc.has_debug) {
+                function_size = sizeof(*b);
+            } else {
+                function_size = offsetof(JSFunctionBytecode, debug);
+            }
+            cpool_offset = function_size;
+            function_size += bc.cpool_count * sizeof(*bc.cpool);
+            vardefs_offset = function_size;
+            function_size += local_count * sizeof(*bc.vardefs);
+            closure_var_offset = function_size;
+            function_size += bc.closure_var_count * sizeof(*bc.closure_var);
+            byte_code_offset = function_size;
+            if (!bc.read_only_bytecode) {
+                function_size += bc.byte_code_len;
+            }
+
+            b = js_mallocz(ctx, function_size);
+            if (!b)
+                return JS_EXCEPTION;
+
+            memcpy(b, &bc, offsetof(JSFunctionBytecode, debug));
+            obj = JS_MKPTR(JS_TAG_FUNCTION_BYTECODE, b);
+
+#ifdef DUMP_READ_OBJECT
+            bc_read_trace(s, "name: "); print_atom(s->ctx, b->func_name); printf("\n");
+#endif
+            bc_read_trace(s, "args=%d vars=%d defargs=%d closures=%d cpool=%d\n",
+                          b->arg_count, b->var_count, b->defined_arg_count,
+                          b->closure_var_count, b->cpool_count);
+            bc_read_trace(s, "stack=%d bclen=%d locals=%d\n",
+                          b->stack_size, b->byte_code_len, local_count);
+
+            if (local_count != 0) {
+                bc_read_trace(s, "vars {\n");
+                b->vardefs = (void *)((uint8_t*)b + vardefs_offset);
+                for(i = 0; i < local_count; i++) {
+                    JSVarDef *vd = &b->vardefs[i];
+                    if (bc_get_atom(s, &vd->var_name))
+                        goto fail;
+                    if (bc_get_leb128_int(s, &vd->scope_level))
+                        goto fail;
+                    if (bc_get_leb128_int(s, &vd->scope_next))
+                        goto fail;
+                    vd->scope_next--;
+                    if (bc_get_u8(s, &v8))
+                        goto fail;
+                    idx = 0;
+                    vd->is_catch = bc_get_flags(v8, &idx, 1);
+                    vd->is_function = bc_get_flags(v8, &idx, 1);
+                    vd->is_func_var = bc_get_flags(v8, &idx, 1);
+                    vd->is_const = bc_get_flags(v8, &idx, 1);
+                    vd->is_lexical = bc_get_flags(v8, &idx, 1);
+                    vd->is_captured = bc_get_flags(v8, &idx, 1);
+#ifdef DUMP_READ_OBJECT
+                    bc_read_trace(s, "name: "); print_atom(s->ctx, vd->var_name); printf("\n");
+#endif
+                }
+                bc_read_trace(s, "}\n");
+            }
+            if (b->closure_var_count != 0) {
+                bc_read_trace(s, "closure vars {\n");
+                b->closure_var = (void *)((uint8_t*)b + closure_var_offset);
+                for(i = 0; i < b->closure_var_count; i++) {
+                    JSClosureVar *cv = &b->closure_var[i];
+                    int var_idx;
+                    if (bc_get_atom(s, &cv->var_name))
+                        goto fail;
+                    if (bc_get_leb128_int(s, &var_idx))
+                        goto fail;
+                    cv->var_idx = var_idx;
+                    if (bc_get_u8(s, &v8))
+                        goto fail;
+                    idx = 0;
+                    cv->is_local = bc_get_flags(v8, &idx, 1);
+                    cv->is_arg = bc_get_flags(v8, &idx, 1);
+                    cv->is_const = bc_get_flags(v8, &idx, 1);
+                    cv->is_lexical = bc_get_flags(v8, &idx, 1);
+                    cv->is_catch = bc_get_flags(v8, &idx, 1);
+#ifdef DUMP_READ_OBJECT
+                    bc_read_trace(s, "name: "); print_atom(s->ctx, cv->var_name); printf("\n");
+#endif
+                }
+                bc_read_trace(s, "}\n");
+            }
+            {
+                bc_read_trace(s, "bytecode {\n");
+                if (JS_ReadFunctionBytecode(s, b, byte_code_offset, b->byte_code_len))
+                    goto fail;
+                bc_read_trace(s, "}\n");
+            }
+            if (b->has_debug) {
+                /* read optional debug information */
+                bc_read_trace(s, "debug {\n");
+                if (bc_get_atom(s, &b->debug.filename))
+                    goto fail;
+                if (bc_get_leb128_int(s, &b->debug.line_num))
+                    goto fail;
+                if (bc_get_leb128_int(s, &b->debug.pc2line_len))
+                    goto fail;
+                if (b->debug.pc2line_len) {
+                    b->debug.pc2line_buf = js_mallocz(ctx, b->debug.pc2line_len);
+                    if (!b->debug.pc2line_buf)
+                        goto fail;
+                    if (bc_get_buf(s, b->debug.pc2line_buf, b->debug.pc2line_len))
+                        goto fail;
+                }
+#ifdef DUMP_READ_OBJECT
+                bc_read_trace(s, "filename: "); print_atom(s->ctx, b->debug.filename); printf("\n");
+#endif
+                bc_read_trace(s, "}\n");
+            }
+            if (b->cpool_count != 0) {
+                bc_read_trace(s, "cpool {\n");
+                b->cpool = (void *)((uint8_t*)b + cpool_offset);
+                for(i = 0; i < b->cpool_count; i++) {
+                    JSValue val;
+                    val = JS_ReadObjectRec(s);
+                    if (JS_IsException(val))
+                        goto fail;
+                    b->cpool[i] = val;
+                }
+                bc_read_trace(s, "}\n");
+            }
+            bc_read_trace(s, "}\n");
+        }
+        break;
+    case BC_TAG_MODULE:
+        {
+            JSAtom module_name;
+            int i;
+            uint8_t v8;
+
+            if (!s->allow_bytecode)
+                goto invalid_tag;
+            bc_read_trace(s, "%s {\n", bc_tag_str[tag]);
+            if (bc_get_atom(s, &module_name))
+                goto fail;
+#ifdef DUMP_READ_OBJECT
+            bc_read_trace(s, "name: "); print_atom(s->ctx, module_name); printf("\n");
+#endif
+            m = js_new_module_def(ctx, module_name);
+            if (!m)
+                goto fail;
+            obj = JS_DupValue(ctx, JS_MKPTR(JS_TAG_MODULE, m));
+            if (bc_get_leb128_int(s, &m->req_module_entries_count))
+                goto fail;
+            if (m->req_module_entries_count != 0) {
+                m->req_module_entries_size = m->req_module_entries_count;
+                m->req_module_entries = js_mallocz(ctx, sizeof(m->req_module_entries[0]) * m->req_module_entries_size);
+                if (!m->req_module_entries)
+                    goto fail;
+                for(i = 0; i < m->req_module_entries_count; i++) {
+                    JSReqModuleEntry *rme = &m->req_module_entries[i];
+                    if (bc_get_atom(s, &rme->module_name))
+                        goto fail;
+                }
+            }
+
+            if (bc_get_leb128_int(s, &m->export_entries_count))
+                goto fail;
+            if (m->export_entries_count != 0) {
+                m->export_entries_size = m->export_entries_count;
+                m->export_entries = js_mallocz(ctx, sizeof(m->export_entries[0]) * m->export_entries_size);
+                if (!m->export_entries)
+                    goto fail;
+                for(i = 0; i < m->export_entries_count; i++) {
+                    JSExportEntry *me = &m->export_entries[i];
+                    if (bc_get_u8(s, &v8))
+                        goto fail;
+                    me->export_type = v8;
+                    if (me->export_type == JS_EXPORT_TYPE_LOCAL) {
+                        if (bc_get_leb128_int(s, &me->u.local.var_idx))
+                            goto fail;
+                    } else {
+                        if (bc_get_leb128_int(s, &me->u.req_module_idx))
+                            goto fail;
+                        if (bc_get_atom(s, &me->local_name))
+                            goto fail;
+                    }
+                    if (bc_get_atom(s, &me->export_name))
+                        goto fail;
+                }
+            }
+
+            if (bc_get_leb128_int(s, &m->star_export_entries_count))
+                goto fail;
+            if (m->star_export_entries_count != 0) {
+                m->star_export_entries_size = m->star_export_entries_count;
+                m->star_export_entries = js_mallocz(ctx, sizeof(m->star_export_entries[0]) * m->star_export_entries_size);
+                if (!m->star_export_entries)
+                    goto fail;
+                for(i = 0; i < m->star_export_entries_count; i++) {
+                    JSStarExportEntry *se = &m->star_export_entries[i];
+                    if (bc_get_leb128_int(s, &se->req_module_idx))
+                        goto fail;
+                }
+            }
+
+            if (bc_get_leb128_int(s, &m->import_entries_count))
+                goto fail;
+            if (m->import_entries_count != 0) {
+                m->import_entries_size = m->import_entries_count;
+                m->import_entries = js_mallocz(ctx, sizeof(m->import_entries[0]) * m->import_entries_size);
+                if (!m->import_entries)
+                    goto fail;
+                for(i = 0; i < m->import_entries_count; i++) {
+                    JSImportEntry *mi = &m->import_entries[i];
+                    if (bc_get_leb128_int(s, &mi->var_idx))
+                        goto fail;
+                    if (bc_get_atom(s, &mi->import_name))
+                        goto fail;
+                    if (bc_get_leb128_int(s, &mi->req_module_idx))
+                        goto fail;
+                }
+            }
+
+            m->func_obj = JS_ReadObjectRec(s);
+            if (JS_IsException(m->func_obj))
+                goto fail;
+            bc_read_trace(s, "}\n");
+        }
+        break;
+    case BC_TAG_OBJECT:
+        {
+            uint32_t prop_count, i;
+            JSAtom atom;
+            JSValue val;
+            int ret;
+
+            bc_read_trace(s, "%s {\n", bc_tag_str[tag]);
+
+            obj = JS_NewObject(ctx);
+            if (bc_get_leb128(s, &prop_count))
+                goto fail;
+            for(i = 0; i < prop_count; i++) {
+                if (bc_get_atom(s, &atom))
+                    goto fail;
+#ifdef DUMP_READ_OBJECT
+                bc_read_trace(s, "propname: "); print_atom(s->ctx, atom); printf("\n");
+#endif
+                val = JS_ReadObjectRec(s);
+                if (JS_IsException(val)) {
+                    JS_FreeAtom(ctx, atom);
+                    goto fail;
+                }
+                ret = JS_DefinePropertyValue(ctx, obj, atom, val, JS_PROP_C_W_E);
+                JS_FreeAtom(ctx, atom);
+                if (ret < 0)
+                    goto fail;
+            }
+            bc_read_trace(s, "}\n");
+        }
+        break;
+    case BC_TAG_ARRAY:
+    case BC_TAG_TEMPLATE_OBJECT:
+        {
+            uint32_t len, i;
+            JSValue val;
+            int ret, prop_flags;
+            BOOL is_template;
+
+            bc_read_trace(s, "%s {\n", bc_tag_str[tag]);
+
+            obj = JS_NewArray(ctx);
+            is_template = (tag == BC_TAG_TEMPLATE_OBJECT);
+            if (bc_get_leb128(s, &len))
+                goto fail;
+            for(i = 0; i < len; i++) {
+                val = JS_ReadObjectRec(s);
+                if (JS_IsException(val))
+                    goto fail;
+                if (is_template)
+                    prop_flags = JS_PROP_ENUMERABLE;
+                else
+                    prop_flags = JS_PROP_C_W_E;
+                ret = JS_DefinePropertyValueUint32(ctx, obj, i, val,
+                                                   prop_flags);
+                if (ret < 0)
+                    goto fail;
+            }
+            if (is_template) {
+                val = JS_ReadObjectRec(s);
+                if (JS_IsException(val))
+                    goto fail;
+                if (!JS_IsUndefined(val)) {
+                    ret = JS_DefinePropertyValue(ctx, obj, JS_ATOM_raw, val, 0);
+                    if (ret < 0)
+                        goto fail;
+                }
+                JS_PreventExtensions(ctx, obj);
+            }
+            bc_read_trace(s, "}\n");
+        }
+        break;
+#ifdef CONFIG_BIGNUM
+    case BC_TAG_BIG_INT:
+    case BC_TAG_BIG_FLOAT:
+        {
+            uint8_t sign, v8;
+            int32_t e;
+            uint32_t len;
+            limb_t l, i, n;
+            JSBigFloat *p;
+            bf_t *a;
+
+            bc_read_trace(s, "%s {\n", bc_tag_str[tag]);
+
+            if (bc_get_leb128(s, &len))
+                goto fail;
+            sign = len & 1;
+            len >>= 1;
+            p = js_new_bf(s->ctx);
+            if (!p)
+                goto fail;
+            if (tag == BC_TAG_BIG_INT)
+                obj = JS_MKPTR(JS_TAG_BIG_INT, p);
+            else
+                obj = JS_MKPTR(JS_TAG_BIG_FLOAT, p);
+            l = (len + sizeof(limb_t) - 1) / sizeof(limb_t);
+            a = &p->num;
+            bf_resize(a, l);
+            a->sign = sign;
+            if (len == 0) {
+                if (tag == BC_TAG_BIG_INT) {
+                    a->expn = BF_EXP_ZERO;
+                } else {
+                    if (bc_get_u8(s, &v8))
+                        goto fail;
+                    switch(v8) {
+                    case 0:
+                        a->expn = BF_EXP_ZERO;
+                        break;
+                    case 1:
+                        a->expn = BF_EXP_INF;
+                        break;
+                    default:
+                    case 2:
+                        a->expn = BF_EXP_NAN;
+                        break;
+                    }
+                }
+            } else {
+                n = len & (sizeof(limb_t) - 1);
+                if (n != 0) {
+                    limb_t v;
+                    v = 0;
+                    for(i = 0; i < n; i++) {
+                        if (bc_get_u8(s, &v8))
+                            goto fail;
+                        v |= (limb_t)v8 << ((sizeof(limb_t) - n + i) * 8);
+                    }
+                    a->tab[0] = v;
+                    i = 1;
+                } else {
+                    i = 0;
+                }
+                for(; i < l; i++) {
+                    limb_t v;
+#if LIMB_BITS == 32
+                    if (bc_get_u32(s, &v))
+                        goto fail;
+#ifdef WORDS_BIGENDIAN
+                    v = bswap32(v);
+#endif
+#else
+                    if (bc_get_u64(s, &v))
+                        goto fail;
+#ifdef WORDS_BIGENDIAN
+                    v = bswap64(v);
+#endif
+#endif
+                    a->tab[i] = v;
+                }
+                if (bc_get_sleb128(s, &e))
+                    goto fail;
+                a->expn = e;
+            }
+            bc_read_trace(s, "}\n");
+        }
+        break;
+#endif
+    default:
+    invalid_tag:
+        return JS_ThrowSyntaxError(ctx, "invalid tag (tag=%d pos=%u)",
+                                   tag, (unsigned int)(s->ptr - s->buf_start));
+    }
+    return obj;
+ fail:
+    if (m) {
+        js_free_module_def(ctx, m);
+    }
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+static int JS_ReadObjectAtoms(BCReaderState *s)
+{
+    uint8_t v8;
+    JSString *p;
+    int i;
+    JSAtom atom;
+
+    if (bc_get_u8(s, &v8))
+        return -1;
+    /* XXX: could support byte swapped input */
+    if (v8 != BC_VERSION) {
+        JS_ThrowSyntaxError(s->ctx, "invalid version (%d expected=%d)",
+                            v8, BC_VERSION);
+        return -1;
+    }
+    if (bc_get_leb128(s, &s->idx_to_atom_count))
+        return -1;
+
+    bc_read_trace(s, "%d atom indexes {\n", s->idx_to_atom_count);
+
+    if (s->idx_to_atom_count != 0) {
+        s->idx_to_atom = js_mallocz(s->ctx, s->idx_to_atom_count *
+                                    sizeof(s->idx_to_atom[0]));
+        if (!s->idx_to_atom)
+            return s->error_state = -1;
+    }
+    for(i = 0; i < s->idx_to_atom_count; i++) {
+        p = JS_ReadString(s);
+        if (!p)
+            return -1;
+        atom = JS_NewAtomStr(s->ctx, p);
+        if (atom == JS_ATOM_NULL)
+            return s->error_state = -1;
+        s->idx_to_atom[i] = atom;
+        if (s->is_rom_data && (atom != (i + s->first_atom)))
+            s->is_rom_data = FALSE; /* atoms must be relocated */
+    }
+    bc_read_trace(s, "}\n");
+    return 0;
+}
+
+static void bc_reader_free(BCReaderState *s)
+{
+    int i;
+    if (s->idx_to_atom) {
+        for(i = 0; i < s->idx_to_atom_count; i++) {
+            JS_FreeAtom(s->ctx, s->idx_to_atom[i]);
+        }
+        js_free(s->ctx, s->idx_to_atom);
+    }
+}
+
+JSValue JS_ReadObject(JSContext *ctx, const uint8_t *buf, size_t buf_len,
+                      int flags)
+{
+    BCReaderState ss, *s = &ss;
+    JSValue obj;
+
+    ctx->binary_object_count += 1;
+    ctx->binary_object_size += buf_len;
+
+    memset(s, 0, sizeof(*s));
+    s->ctx = ctx;
+    s->buf_start = buf;
+    s->buf_end = buf + buf_len;
+    s->ptr = buf;
+    s->allow_bytecode = ((flags & JS_READ_OBJ_BYTECODE) != 0);
+    s->is_rom_data = ((flags & JS_READ_OBJ_ROM_DATA) != 0);
+    if (s->allow_bytecode)
+        s->first_atom = JS_ATOM_END;
+    else
+        s->first_atom = 1;
+    if (JS_ReadObjectAtoms(s)) {
+        obj = JS_EXCEPTION;
+    } else {
+        obj = JS_ReadObjectRec(s);
+    }
+    bc_reader_free(s);
+    return obj;
+}
+
+/*******************************************************************/
+/* runtime functions & objects */
+
+static JSValue js_string_constructor(JSContext *ctx, JSValueConst this_val,
+                                     int argc, JSValueConst *argv);
+static JSValue js_boolean_constructor(JSContext *ctx, JSValueConst this_val,
+                                      int argc, JSValueConst *argv);
+static JSValue js_number_constructor(JSContext *ctx, JSValueConst this_val,
+                                     int argc, JSValueConst *argv);
+
+static int check_function(JSContext *ctx, JSValueConst obj)
+{
+    if (likely(JS_IsFunction(ctx, obj)))
+        return 0;
+    JS_ThrowTypeError(ctx, "not a function");
+    return -1;
+}
+
+static int check_exception_free(JSContext *ctx, JSValue obj)
+{
+    JS_FreeValue(ctx, obj);
+    return JS_IsException(obj);
+}
+
+static JSAtom find_atom(JSContext *ctx, const char *name)
+{
+    JSAtom atom;
+    int len;
+
+    if (*name == '[') {
+        name++;
+        len = strlen(name) - 1;
+        /* We assume 8 bit non null strings, which is the case for these
+           symbols */
+        for(atom = JS_ATOM_Symbol_toPrimitive; atom < JS_ATOM_END; atom++) {
+            JSAtomStruct *p = ctx->rt->atom_array[atom];
+            JSString *str = p;
+            if (str->len == len && !memcmp(str->u.str8, name, len))
+                return JS_DupAtom(ctx, atom);
+        }
+        abort();
+    } else {
+        atom = JS_NewAtom(ctx, name);
+    }
+    return atom;
+}
+
+static int JS_InstantiateFunctionListItem(JSContext *ctx, JSObject *p,
+                                          JSAtom atom, void *opaque)
+{
+    const JSCFunctionListEntry *e = opaque;
+    JSValueConst obj = JS_MKPTR(JS_TAG_OBJECT, p);
+    JSValue val;
+    int prop_flags = e->prop_flags;
+
+    switch(e->def_type) {
+    case JS_DEF_ALIAS:
+        {
+            JSAtom atom1 = find_atom(ctx, e->u.alias.name);
+            switch (e->u.alias.base) {
+            case -1:
+                val = JS_GetProperty(ctx, obj, atom1);
+                break;
+            case 0:
+                val = JS_GetProperty(ctx, ctx->global_obj, atom1);
+                break;
+            case 1:
+                val = JS_GetProperty(ctx, ctx->class_proto[JS_CLASS_ARRAY], atom1);
+                break;
+            default:
+                abort();
+            }
+            JS_FreeAtom(ctx, atom1);
+            goto setval;
+        }
+    case JS_DEF_CFUNC:
+        val = JS_NewCFunction2(ctx, e->u.func.cfunc.generic,
+                               e->name, e->u.func.length, e->u.func.cproto, e->magic);
+    setval:
+        if (atom == JS_ATOM_Symbol_toPrimitive) {
+            /* Symbol.toPrimitive functions are not writable */
+            prop_flags = JS_PROP_CONFIGURABLE;
+        } else if (atom == JS_ATOM_Symbol_hasInstance) {
+            /* Function.prototype[Symbol.hasInstance] is not writable nor configurable */
+            prop_flags = 0;
+        }
+        break;
+    case JS_DEF_CGETSET:
+    case JS_DEF_CGETSET_MAGIC:
+        {
+            JSValue getter, setter;
+            char buf[64];
+
+            getter = JS_UNDEFINED;
+            if (e->u.getset.get.generic) {
+                snprintf(buf, sizeof(buf), "get %s", e->name);
+                getter = JS_NewCFunction2(ctx, e->u.getset.get.generic,
+                                          buf, 0, e->def_type == JS_DEF_CGETSET_MAGIC ? JS_CFUNC_getter_magic : JS_CFUNC_getter,
+                                          e->magic);
+            }
+            setter = JS_UNDEFINED;
+            if (e->u.getset.set.generic) {
+                snprintf(buf, sizeof(buf), "set %s", e->name);
+                setter = JS_NewCFunction2(ctx, e->u.getset.set.generic,
+                                          buf, 1, e->def_type == JS_DEF_CGETSET_MAGIC ? JS_CFUNC_setter_magic : JS_CFUNC_setter,
+                                          e->magic);
+            }
+            JS_DefinePropertyGetSet(ctx, obj, atom, getter, setter, prop_flags);
+            return 0;
+        }
+        break;
+    case JS_DEF_PROP_STRING:
+        val = JS_NewAtomString(ctx, e->u.str);
+        break;
+    case JS_DEF_PROP_INT32:
+        val = JS_NewInt32(ctx, e->u.i32);
+        break;
+    case JS_DEF_PROP_INT64:
+        val = JS_NewInt64(ctx, e->u.i64);
+        break;
+    case JS_DEF_PROP_DOUBLE:
+        val = __JS_NewFloat64(ctx, e->u.f64);
+        break;
+    case JS_DEF_PROP_UNDEFINED:
+        val = JS_UNDEFINED;
+        break;
+    case JS_DEF_OBJECT:
+        val = JS_NewObject(ctx);
+        JS_SetPropertyFunctionList(ctx, val, e->u.prop_list.tab, e->u.prop_list.len);
+        break;
+    default:
+        abort();
+    }
+    JS_DefinePropertyValue(ctx, obj, atom, val, prop_flags);
+    return 0;
+}
+
+void JS_SetPropertyFunctionList(JSContext *ctx, JSValueConst obj,
+                                const JSCFunctionListEntry *tab, int len)
+{
+    int i, prop_flags;
+
+    for (i = 0; i < len; i++) {
+        const JSCFunctionListEntry *e = &tab[i];
+        JSAtom atom = find_atom(ctx, e->name);
+
+        switch (e->def_type) {
+        case JS_DEF_CFUNC:
+        case JS_DEF_CGETSET:
+        case JS_DEF_CGETSET_MAGIC:
+        case JS_DEF_PROP_STRING:
+        case JS_DEF_ALIAS:
+        case JS_DEF_OBJECT:
+            prop_flags = JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE | (e->prop_flags & JS_PROP_ENUMERABLE);
+            JS_DefineAutoInitProperty(ctx, obj, atom,
+                                      JS_InstantiateFunctionListItem,
+                                      (void *)e, prop_flags);
+            break;
+        case JS_DEF_PROP_INT32:
+        case JS_DEF_PROP_INT64:
+        case JS_DEF_PROP_DOUBLE:
+        case JS_DEF_PROP_UNDEFINED:
+            {
+                JSObject *p = JS_VALUE_GET_OBJ(obj);
+                JS_InstantiateFunctionListItem(ctx, p, atom, (void *)e);
+            }
+            break;
+        default:
+            abort();
+        }
+        JS_FreeAtom(ctx, atom);
+    }
+}
+
+int JS_AddModuleExportList(JSContext *ctx, JSModuleDef *m,
+                           const JSCFunctionListEntry *tab, int len)
+{
+    int i;
+    for(i = 0; i < len; i++) {
+        if (JS_AddModuleExport(ctx, m, tab[i].name))
+            return -1;
+    }
+    return 0;
+}
+
+int JS_SetModuleExportList(JSContext *ctx, JSModuleDef *m,
+                           const JSCFunctionListEntry *tab, int len)
+{
+    int i;
+    JSValue val;
+
+    for(i = 0; i < len; i++) {
+        const JSCFunctionListEntry *e = &tab[i];
+        switch(e->def_type) {
+        case JS_DEF_CFUNC:
+            val = JS_NewCFunction2(ctx, e->u.func.cfunc.generic,
+                                   e->name, e->u.func.length, e->u.func.cproto, e->magic);
+            break;
+        case JS_DEF_PROP_STRING:
+            val = JS_NewString(ctx, e->u.str);
+            break;
+        case JS_DEF_PROP_INT32:
+            val = JS_NewInt32(ctx, e->u.i32);
+            break;
+        case JS_DEF_PROP_INT64:
+            val = JS_NewInt64(ctx, e->u.i64);
+            break;
+        case JS_DEF_PROP_DOUBLE:
+            val = __JS_NewFloat64(ctx, e->u.f64);
+            break;
+        default:
+            abort();
+        }
+        if (JS_SetModuleExport(ctx, m, e->name, val))
+            return -1;
+    }
+    return 0;
+}
+
+/* Note: 'func_obj' is not necessarily a constructor */
+static void JS_SetConstructor2(JSContext *ctx,
+                               JSValueConst func_obj,
+                               JSValueConst proto,
+                               int proto_flags, int ctor_flags)
+{
+    JS_DefinePropertyValue(ctx, func_obj, JS_ATOM_prototype,
+                           JS_DupValue(ctx, proto), proto_flags);
+    JS_DefinePropertyValue(ctx, proto, JS_ATOM_constructor,
+                           JS_DupValue(ctx, func_obj),
+                           ctor_flags);
+    set_cycle_flag(ctx, func_obj);
+    set_cycle_flag(ctx, proto);
+}
+
+static void JS_SetConstructor(JSContext *ctx,
+                              JSValueConst func_obj,
+                              JSValueConst proto)
+{
+    JS_SetConstructor2(ctx, func_obj, proto,
+                       0, JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+}
+
+static void JS_NewGlobalCConstructor2(JSContext *ctx,
+                                      JSValue func_obj,
+                                      const char *name,
+                                      JSValueConst proto)
+{
+    JS_DefinePropertyValueStr(ctx, ctx->global_obj, name,
+                           JS_DupValue(ctx, func_obj),
+                           JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+    JS_SetConstructor(ctx, func_obj, proto);
+    JS_FreeValue(ctx, func_obj);
+}
+
+static JSValueConst JS_NewGlobalCConstructor(JSContext *ctx, const char *name,
+                                             JSCFunction *func, int length,
+                                             JSValueConst proto)
+{
+    JSValue func_obj;
+    func_obj = JS_NewCFunction2(ctx, func, name, length, JS_CFUNC_constructor_or_func, 0);
+    JS_NewGlobalCConstructor2(ctx, func_obj, name, proto);
+    return func_obj;
+}
+
+static JSValueConst JS_NewGlobalCConstructorOnly(JSContext *ctx, const char *name,
+                                                 JSCFunction *func, int length,
+                                                 JSValueConst proto)
+{
+    JSValue func_obj;
+    func_obj = JS_NewCFunction2(ctx, func, name, length, JS_CFUNC_constructor, 0);
+    JS_NewGlobalCConstructor2(ctx, func_obj, name, proto);
+    return func_obj;
+}
+
+static JSValue js_global_eval(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv)
+{
+    return JS_EvalObject(ctx, ctx->global_obj, argv[0], JS_EVAL_TYPE_INDIRECT, -1);
+}
+
+static JSValue js_global_isNaN(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv)
+{
+    double d;
+
+    /* XXX: does this work for bigfloat? */
+    if (unlikely(JS_ToFloat64(ctx, &d, argv[0])))
+        return JS_EXCEPTION;
+    return JS_NewBool(ctx, isnan(d));
+}
+
+#ifdef CONFIG_BIGNUM
+static BOOL js_number_is_finite(JSContext *ctx, JSValueConst val)
+{
+    BOOL res;
+    uint32_t tag;
+
+    tag = JS_VALUE_GET_NORM_TAG(val);
+    switch(tag) {
+    case JS_TAG_FLOAT64:
+        res = isfinite(JS_VALUE_GET_FLOAT64(val));
+        break;
+    case JS_TAG_BIG_FLOAT:
+        {
+            JSBigFloat *p = JS_VALUE_GET_PTR(val);
+            res = bf_is_finite(&p->num);
+        }
+        break;
+    default:
+        res = TRUE;
+        break;
+    }
+    return res;
+}
+#endif
+
+static JSValue js_global_isFinite(JSContext *ctx, JSValueConst this_val,
+                                  int argc, JSValueConst *argv)
+{
+    BOOL res;
+#ifdef CONFIG_BIGNUM
+    JSValue val;
+
+    val = JS_ToNumber(ctx, argv[0]);
+    if (JS_IsException(val))
+        return val;
+    res = js_number_is_finite(ctx, val);
+    JS_FreeValue(ctx, val);
+#else
+    double d;
+    if (unlikely(JS_ToFloat64(ctx, &d, argv[0])))
+        return JS_EXCEPTION;
+    res = isfinite(d);
+#endif
+    return JS_NewBool(ctx, res);
+}
+
+/* Object class */
+
+static JSValue JS_ToObject(JSContext *ctx, JSValueConst val)
+{
+    int tag = JS_VALUE_GET_NORM_TAG(val);
+    JSValue obj;
+
+    switch(tag) {
+    default:
+    case JS_TAG_NULL:
+    case JS_TAG_UNDEFINED:
+        return JS_ThrowTypeError(ctx, "cannot convert to object");
+    case JS_TAG_OBJECT:
+    case JS_TAG_EXCEPTION:
+        return JS_DupValue(ctx, val);
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_INT:
+        if (is_bignum_mode(ctx))
+            obj = JS_NewObjectClass(ctx, JS_CLASS_BIG_INT);
+        else
+            obj = JS_NewObjectClass(ctx, JS_CLASS_NUMBER);
+        goto set_value;
+    case JS_TAG_BIG_INT:
+        obj = JS_NewObjectClass(ctx, JS_CLASS_BIG_INT);
+        goto set_value;
+    case JS_TAG_FLOAT64:
+        obj = JS_NewObjectClass(ctx, JS_CLASS_NUMBER);
+        goto set_value;
+    case JS_TAG_BIG_FLOAT:
+        obj = JS_NewObjectClass(ctx, JS_CLASS_BIG_FLOAT);
+        goto set_value;
+#else
+    case JS_TAG_INT:
+    case JS_TAG_FLOAT64:
+        obj = JS_NewObjectClass(ctx, JS_CLASS_NUMBER);
+        goto set_value;
+#endif
+    case JS_TAG_STRING:
+        /* XXX: should call the string constructor */
+        {
+            JSString *p1 = JS_VALUE_GET_STRING(val);
+            obj = JS_NewObjectClass(ctx, JS_CLASS_STRING);
+            JS_DefinePropertyValue(ctx, obj, JS_ATOM_length, JS_NewInt32(ctx, p1->len), 0);
+        }
+        goto set_value;
+    case JS_TAG_BOOL:
+        obj = JS_NewObjectClass(ctx, JS_CLASS_BOOLEAN);
+        goto set_value;
+    case JS_TAG_SYMBOL:
+        obj = JS_NewObjectClass(ctx, JS_CLASS_SYMBOL);
+    set_value:
+        if (!JS_IsException(obj))
+            JS_SetObjectData(ctx, obj, JS_DupValue(ctx, val));
+        return obj;
+    }
+}
+
+static JSValue JS_ToObjectFree(JSContext *ctx, JSValue val)
+{
+    JSValue obj = JS_ToObject(ctx, val);
+    JS_FreeValue(ctx, val);
+    return obj;
+}
+
+static int js_obj_to_desc(JSContext *ctx, JSPropertyDescriptor *d,
+                          JSValueConst desc)
+{
+    JSValue val, getter, setter;
+    int flags;
+
+    if (!JS_IsObject(desc)) {
+        JS_ThrowTypeErrorNotAnObject(ctx);
+        return -1;
+    }
+    flags = 0;
+    val = JS_UNDEFINED;
+    getter = JS_UNDEFINED;
+    setter = JS_UNDEFINED;
+    if (JS_HasProperty(ctx, desc, JS_ATOM_configurable)) {
+        JSValue prop = JS_GetProperty(ctx, desc, JS_ATOM_configurable);
+        if (JS_IsException(prop))
+            goto fail;
+        flags |= JS_PROP_HAS_CONFIGURABLE;
+        if (JS_ToBoolFree(ctx, prop))
+            flags |= JS_PROP_CONFIGURABLE;
+    }
+    if (JS_HasProperty(ctx, desc, JS_ATOM_writable)) {
+        JSValue prop = JS_GetProperty(ctx, desc, JS_ATOM_writable);
+        if (JS_IsException(prop))
+            goto fail;
+        flags |= JS_PROP_HAS_WRITABLE;
+        if (JS_ToBoolFree(ctx, prop))
+            flags |= JS_PROP_WRITABLE;
+    }
+    if (JS_HasProperty(ctx, desc, JS_ATOM_enumerable)) {
+        JSValue prop = JS_GetProperty(ctx, desc, JS_ATOM_enumerable);
+        if (JS_IsException(prop))
+            goto fail;
+        flags |= JS_PROP_HAS_ENUMERABLE;
+        if (JS_ToBoolFree(ctx, prop))
+            flags |= JS_PROP_ENUMERABLE;
+    }
+    if (JS_HasProperty(ctx, desc, JS_ATOM_value)) {
+        flags |= JS_PROP_HAS_VALUE;
+        val = JS_GetProperty(ctx, desc, JS_ATOM_value);
+        if (JS_IsException(val))
+            goto fail;
+    }
+    if (JS_HasProperty(ctx, desc, JS_ATOM_get)) {
+        flags |= JS_PROP_HAS_GET;
+        getter = JS_GetProperty(ctx, desc, JS_ATOM_get);
+        if (JS_IsException(getter) ||
+            !(JS_IsUndefined(getter) || JS_IsFunction(ctx, getter))) {
+            JS_ThrowTypeError(ctx, "invalid getter");
+            goto fail;
+        }
+    }
+    if (JS_HasProperty(ctx, desc, JS_ATOM_set)) {
+        flags |= JS_PROP_HAS_SET;
+        setter = JS_GetProperty(ctx, desc, JS_ATOM_set);
+        if (JS_IsException(setter) ||
+            !(JS_IsUndefined(setter) || JS_IsFunction(ctx, setter))) {
+            JS_ThrowTypeError(ctx, "invalid setter");
+            goto fail;
+        }
+    }
+    if ((flags & (JS_PROP_HAS_SET | JS_PROP_HAS_GET)) &&
+        (flags & (JS_PROP_HAS_VALUE | JS_PROP_HAS_WRITABLE))) {
+        JS_ThrowTypeError(ctx, "cannot have setter/getter and value or writable");
+        goto fail;
+    }
+    d->flags = flags;
+    d->value = val;
+    d->getter = getter;
+    d->setter = setter;
+    return 0;
+ fail:
+    JS_FreeValue(ctx, val);
+    JS_FreeValue(ctx, getter);
+    JS_FreeValue(ctx, setter);
+    return -1;
+}
+
+static __exception int JS_DefinePropertyDesc(JSContext *ctx, JSValueConst obj,
+                                             JSAtom prop, JSValueConst desc,
+                                             int flags)
+{
+    JSPropertyDescriptor d;
+    int ret;
+
+    if (js_obj_to_desc(ctx, &d, desc) < 0)
+        return -1;
+
+    ret = JS_DefineProperty(ctx, obj, prop,
+                            d.value, d.getter, d.setter, d.flags | flags);
+    js_free_desc(ctx, &d);
+    return ret;
+}
+
+static __exception int JS_ObjectDefineProperties(JSContext *ctx,
+                                                 JSValueConst obj,
+                                                 JSValueConst properties)
+{
+    JSValue props, desc;
+    JSObject *p;
+    JSPropertyEnum *atoms;
+    uint32_t len, i;
+    int ret = -1;
+
+    if (!JS_IsObject(obj)) {
+        JS_ThrowTypeErrorNotAnObject(ctx);
+        return -1;
+    }
+    desc = JS_UNDEFINED;
+    props = JS_ToObject(ctx, properties);
+    if (JS_IsException(props))
+        return -1;
+    p = JS_VALUE_GET_OBJ(props);
+    if (JS_GetOwnPropertyNames(ctx, &atoms, &len, p, JS_GPN_ENUM_ONLY | JS_GPN_STRING_MASK) < 0)
+        goto exception;
+    for(i = 0; i < len; i++) {
+        JS_FreeValue(ctx, desc);
+        desc = JS_GetProperty(ctx, props, atoms[i].atom);
+        if (JS_IsException(desc))
+            goto exception;
+        if (JS_DefinePropertyDesc(ctx, obj, atoms[i].atom, desc, JS_PROP_THROW) < 0)
+            goto exception;
+    }
+    ret = 0;
+
+exception:
+    js_free_prop_enum(ctx, atoms, len);
+    JS_FreeValue(ctx, props);
+    JS_FreeValue(ctx, desc);
+    return ret;
+}
+
+static JSValue js_object_constructor(JSContext *ctx, JSValueConst new_target,
+                                     int argc, JSValueConst *argv)
+{
+    JSValue ret;
+    if (!JS_IsUndefined(new_target) &&
+        JS_VALUE_GET_OBJ(new_target) !=
+        JS_VALUE_GET_OBJ(JS_GetActiveFunction(ctx))) {
+        ret = js_create_from_ctor(ctx, new_target, JS_CLASS_OBJECT);
+    } else {
+        int tag = JS_VALUE_GET_NORM_TAG(argv[0]);
+        switch(tag) {
+        case JS_TAG_NULL:
+        case JS_TAG_UNDEFINED:
+            ret = JS_NewObject(ctx);
+            break;
+        default:
+            ret = JS_ToObject(ctx, argv[0]);
+            break;
+        }
+    }
+    return ret;
+}
+
+static JSValue js_object_create(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    JSValueConst proto, props;
+    JSValue obj;
+
+    proto = argv[0];
+    if (!JS_IsObject(proto) && !JS_IsNull(proto))
+        return JS_ThrowTypeError(ctx, "not a prototype");
+    obj = JS_NewObjectProto(ctx, proto);
+    if (JS_IsException(obj))
+        return JS_EXCEPTION;
+    props = argv[1];
+    if (!JS_IsUndefined(props)) {
+        if (JS_ObjectDefineProperties(ctx, obj, props)) {
+            JS_FreeValue(ctx, obj);
+            return JS_EXCEPTION;
+        }
+    }
+    return obj;
+}
+
+static JSValue js_object_getPrototypeOf(JSContext *ctx, JSValueConst this_val,
+                                        int argc, JSValueConst *argv, int magic)
+{
+    JSValueConst val;
+
+    val = argv[0];
+    if (JS_VALUE_GET_TAG(val) != JS_TAG_OBJECT) {
+        /* ES6 feature non compatible with ES5.1: primitive types are
+           accepted */
+        if (magic || JS_VALUE_GET_TAG(val) == JS_TAG_NULL ||
+            JS_VALUE_GET_TAG(val) == JS_TAG_UNDEFINED)
+            return JS_ThrowTypeErrorNotAnObject(ctx);
+    }
+    return JS_DupValue(ctx, JS_GetPrototype(ctx, val));
+}
+
+static JSValue js_object_setPrototypeOf(JSContext *ctx, JSValueConst this_val,
+                                        int argc, JSValueConst *argv)
+{
+    JSValueConst obj;
+    obj = argv[0];
+    if (JS_SetPrototypeInternal(ctx, obj, argv[1], TRUE) < 0)
+        return JS_EXCEPTION;
+    return JS_DupValue(ctx, obj);
+}
+
+/* magic = 1 if called as Reflect.defineProperty */
+static JSValue js_object_defineProperty(JSContext *ctx, JSValueConst this_val,
+                                        int argc, JSValueConst *argv, int magic)
+{
+    JSValueConst obj, prop, desc;
+    int ret, flags;
+    JSAtom atom;
+
+    obj = argv[0];
+    prop = argv[1];
+    desc = argv[2];
+
+    if (JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT)
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+    atom = js_value_to_atom(ctx, prop);
+    if (unlikely(atom == JS_ATOM_NULL))
+        return JS_EXCEPTION;
+    flags = 0;
+    if (!magic)
+        flags |= JS_PROP_THROW;
+    ret = JS_DefinePropertyDesc(ctx, obj, atom, desc, flags);
+    JS_FreeAtom(ctx, atom);
+    if (ret < 0) {
+        return JS_EXCEPTION;
+    } else if (magic) {
+        return JS_NewBool(ctx, ret);
+    } else {
+        return JS_DupValue(ctx, obj);
+    }
+}
+
+static JSValue js_object_defineProperties(JSContext *ctx, JSValueConst this_val,
+                                          int argc, JSValueConst *argv)
+{
+    // defineProperties(obj, properties)
+    JSValueConst obj = argv[0];
+
+    if (JS_ObjectDefineProperties(ctx, obj, argv[1]))
+        return JS_EXCEPTION;
+    else
+        return JS_DupValue(ctx, obj);
+}
+
+/* magic = 1 if called as __defineSetter__ */
+static JSValue js_object___defineGetter__(JSContext *ctx, JSValueConst this_val,
+                                          int argc, JSValueConst *argv, int magic)
+{
+    JSValue obj;
+    JSValueConst prop, value, get, set;
+    int ret, flags;
+    JSAtom atom;
+
+    prop = argv[0];
+    value = argv[1];
+
+    obj = JS_ToObject(ctx, this_val);
+    if (JS_IsException(obj))
+        return JS_EXCEPTION;
+
+    if (check_function(ctx, value)) {
+        JS_FreeValue(ctx, obj);
+        return JS_EXCEPTION;
+    }
+    atom = js_value_to_atom(ctx, prop);
+    if (unlikely(atom == JS_ATOM_NULL)) {
+        JS_FreeValue(ctx, obj);
+        return JS_EXCEPTION;
+    }
+    flags = JS_PROP_THROW |
+        JS_PROP_HAS_ENUMERABLE | JS_PROP_ENUMERABLE |
+        JS_PROP_HAS_CONFIGURABLE | JS_PROP_CONFIGURABLE;
+    if (magic) {
+        get = JS_UNDEFINED;
+        set = value;
+        flags |= JS_PROP_HAS_SET;
+    } else {
+        get = value;
+        set = JS_UNDEFINED;
+        flags |= JS_PROP_HAS_GET;
+    }
+    ret = JS_DefineProperty(ctx, obj, atom, JS_UNDEFINED, get, set, flags);
+    JS_FreeValue(ctx, obj);
+    JS_FreeAtom(ctx, atom);
+    if (ret < 0) {
+        return JS_EXCEPTION;
+    } else {
+        return JS_UNDEFINED;
+    }
+}
+
+/* Note: corresponds to ECMA spec: CreateDataPropertyOrThrow() */
+static JSValue js_object___setOwnProperty(JSContext *ctx, JSValueConst this_val,
+                                          int argc, JSValueConst *argv)
+{
+    int ret;
+    ret = JS_DefinePropertyValueValue(ctx, argv[0], JS_DupValue(ctx, argv[1]),
+                                      JS_DupValue(ctx, argv[2]),
+                                      JS_PROP_C_W_E | JS_PROP_THROW);
+    if (ret < 0)
+        return JS_EXCEPTION;
+    else
+        return JS_NewBool(ctx, ret);
+}
+
+static JSValue js_object_getOwnPropertyDescriptor(JSContext *ctx, JSValueConst this_val,
+                                                  int argc, JSValueConst *argv, int magic)
+{
+    JSValueConst obj, prop;
+    JSAtom atom;
+    JSValue ret;
+    JSPropertyDescriptor desc;
+    int res, flags;
+
+    obj = argv[0];
+    if (JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT) {
+        /* ES6 feature non compatible with ES5.1: obj can be a primitive type */
+        if (magic || JS_VALUE_GET_TAG(obj) == JS_TAG_NULL ||
+            JS_VALUE_GET_TAG(obj) == JS_TAG_UNDEFINED)
+            return JS_ThrowTypeErrorNotAnObject(ctx);
+    }
+    prop = argv[1];
+    atom = js_value_to_atom(ctx, prop);
+    if (unlikely(atom == JS_ATOM_NULL))
+        return JS_EXCEPTION;
+    ret = JS_UNDEFINED;
+    if (JS_VALUE_GET_TAG(obj) == JS_TAG_OBJECT) {
+        res = JS_GetOwnProperty(ctx, &desc, JS_VALUE_GET_OBJ(obj), atom);
+        if (res < 0)
+            goto exception;
+        if (res) {
+            ret = JS_NewObject(ctx);
+            if (JS_IsException(ret))
+                goto exception1;
+            flags = JS_PROP_C_W_E | JS_PROP_THROW;
+            if (desc.flags & JS_PROP_GETSET) {
+                if (JS_DefinePropertyValue(ctx, ret, JS_ATOM_get, JS_DupValue(ctx, desc.getter), flags) < 0
+                ||  JS_DefinePropertyValue(ctx, ret, JS_ATOM_set, JS_DupValue(ctx, desc.setter), flags) < 0)
+                    goto exception1;
+            } else {
+                if (JS_DefinePropertyValue(ctx, ret, JS_ATOM_value, JS_DupValue(ctx, desc.value), flags) < 0
+                ||  JS_DefinePropertyValue(ctx, ret, JS_ATOM_writable,
+                                           JS_NewBool(ctx, (desc.flags & JS_PROP_WRITABLE) != 0), flags) < 0)
+                    goto exception1;
+            }
+            if (JS_DefinePropertyValue(ctx, ret, JS_ATOM_enumerable,
+                                       JS_NewBool(ctx, (desc.flags & JS_PROP_ENUMERABLE) != 0), flags) < 0
+            ||  JS_DefinePropertyValue(ctx, ret, JS_ATOM_configurable,
+                                       JS_NewBool(ctx, (desc.flags & JS_PROP_CONFIGURABLE) != 0), flags) < 0)
+                goto exception1;
+            js_free_desc(ctx, &desc);
+        }
+    }
+    JS_FreeAtom(ctx, atom);
+    return ret;
+
+exception1:
+    js_free_desc(ctx, &desc);
+    JS_FreeValue(ctx, ret);
+exception:
+    JS_FreeAtom(ctx, atom);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_object_getOwnPropertyDescriptors(JSContext *ctx, JSValueConst this_val,
+                                                   int argc, JSValueConst *argv)
+{
+    //getOwnPropertyDescriptors(obj)
+    JSValue obj, r;
+    JSObject *p;
+    JSPropertyEnum *props;
+    uint32_t len, i;
+
+    r = JS_UNDEFINED;
+    obj = JS_ToObject(ctx, argv[0]);
+    if (JS_IsException(obj))
+        return JS_EXCEPTION;
+
+    p = JS_VALUE_GET_OBJ(obj);
+    if (JS_GetOwnPropertyNames(ctx, &props, &len, p,
+                               JS_GPN_STRING_MASK | JS_GPN_SYMBOL_MASK))
+        goto exception;
+    r = JS_NewObject(ctx);
+    if (JS_IsException(r))
+        goto exception;
+    for(i = 0; i < len; i++) {
+        JSValue atomValue, desc;
+        JSValueConst args[2];
+
+        atomValue = JS_AtomToValue(ctx, props[i].atom);
+        if (JS_IsException(atomValue))
+            goto exception;
+        args[0] = obj;
+        args[1] = atomValue;
+        desc = js_object_getOwnPropertyDescriptor(ctx, JS_UNDEFINED, 2, args, 0);
+        JS_FreeValue(ctx, atomValue);
+        if (JS_IsException(desc))
+            goto exception;
+        if (!JS_IsUndefined(desc)) {
+            if (JS_DefinePropertyValue(ctx, r, props[i].atom, desc,
+                                       JS_PROP_C_W_E | JS_PROP_THROW) < 0)
+                goto exception;
+        }
+    }
+    js_free_prop_enum(ctx, props, len);
+    JS_FreeValue(ctx, obj);
+    return r;
+
+exception:
+    js_free_prop_enum(ctx, props, len);
+    JS_FreeValue(ctx, obj);
+    JS_FreeValue(ctx, r);
+    return JS_EXCEPTION;
+}
+
+static JSValue JS_GetOwnPropertyNames2(JSContext *ctx, JSValueConst obj1,
+                                       int flags, int kind)
+{
+    JSValue obj, r, val, key, value;
+    JSObject *p;
+    JSPropertyEnum *atoms;
+    uint32_t len, i, j;
+
+    r = JS_UNDEFINED;
+    val = JS_UNDEFINED;
+    obj = JS_ToObject(ctx, obj1);
+    if (JS_IsException(obj))
+        return JS_EXCEPTION;
+    p = JS_VALUE_GET_OBJ(obj);
+    if (JS_GetOwnPropertyNames(ctx, &atoms, &len, p, flags & ~JS_GPN_ENUM_ONLY))
+        goto exception;
+    r = JS_NewArray(ctx);
+    if (JS_IsException(r))
+        goto exception;
+    for(j = i = 0; i < len; i++) {
+        JSAtom atom = atoms[i].atom;
+        if (flags & JS_GPN_ENUM_ONLY) {
+            JSPropertyDescriptor desc;
+            int res;
+
+            /* Check if property is still enumerable */
+            res = JS_GetOwnProperty(ctx, &desc, p, atom);
+            if (res < 0)
+                goto exception;
+            if (!res)
+                continue;
+            js_free_desc(ctx, &desc);
+            if (!(desc.flags & JS_PROP_ENUMERABLE))
+                continue;
+        }
+        switch(kind) {
+        default:
+        case JS_ITERATOR_KIND_KEY:
+            val = JS_AtomToValue(ctx, atom);
+            if (JS_IsException(val))
+                goto exception;
+            break;
+        case JS_ITERATOR_KIND_VALUE:
+            val = JS_GetProperty(ctx, obj, atom);
+            if (JS_IsException(val))
+                goto exception;
+            break;
+        case JS_ITERATOR_KIND_KEY_AND_VALUE:
+            val = JS_NewArray(ctx);
+            if (JS_IsException(val))
+                goto exception;
+            key = JS_AtomToValue(ctx, atom);
+            if (JS_IsException(key))
+                goto exception1;
+            if (JS_CreateDataPropertyUint32(ctx, val, 0, key, JS_PROP_THROW) < 0)
+                goto exception1;
+            value = JS_GetProperty(ctx, obj, atom);
+            if (JS_IsException(value))
+                goto exception1;
+            if (JS_CreateDataPropertyUint32(ctx, val, 1, value, JS_PROP_THROW) < 0)
+                goto exception1;
+            break;
+        }
+        if (JS_CreateDataPropertyUint32(ctx, r, j++, val, 0) < 0)
+            goto exception;
+    }
+    goto done;
+
+exception1:
+    JS_FreeValue(ctx, val);
+exception:
+    JS_FreeValue(ctx, r);
+    r = JS_EXCEPTION;
+done:
+    js_free_prop_enum(ctx, atoms, len);
+    JS_FreeValue(ctx, obj);
+    return r;
+}
+
+static JSValue js_object_getOwnPropertyNames(JSContext *ctx, JSValueConst this_val,
+                                             int argc, JSValueConst *argv)
+{
+    return JS_GetOwnPropertyNames2(ctx, argv[0],
+                                   JS_GPN_STRING_MASK, JS_ITERATOR_KIND_KEY);
+}
+
+static JSValue js_object_getOwnPropertySymbols(JSContext *ctx, JSValueConst this_val,
+                                             int argc, JSValueConst *argv)
+{
+    return JS_GetOwnPropertyNames2(ctx, argv[0],
+                                   JS_GPN_SYMBOL_MASK, JS_ITERATOR_KIND_KEY);
+}
+
+static JSValue js_object_keys(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv, int kind)
+{
+    return JS_GetOwnPropertyNames2(ctx, argv[0],
+                                   JS_GPN_ENUM_ONLY | JS_GPN_STRING_MASK, kind);
+}
+
+static JSValue js_object_isExtensible(JSContext *ctx, JSValueConst this_val,
+                                      int argc, JSValueConst *argv, int reflect)
+{
+    JSValueConst obj;
+    int ret;
+
+    obj = argv[0];
+    if (JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT) {
+        if (reflect)
+            return JS_ThrowTypeErrorNotAnObject(ctx);
+        else
+            return JS_FALSE;
+    }
+    ret = JS_IsExtensible(ctx, obj);
+    if (ret < 0)
+        return JS_EXCEPTION;
+    else
+        return JS_NewBool(ctx, ret);
+}
+
+static JSValue js_object_preventExtensions(JSContext *ctx, JSValueConst this_val,
+                                           int argc, JSValueConst *argv, int reflect)
+{
+    JSValueConst obj;
+    int ret;
+
+    obj = argv[0];
+    if (JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT) {
+        if (reflect)
+            return JS_ThrowTypeErrorNotAnObject(ctx);
+        else
+            return JS_DupValue(ctx, obj);
+    }
+    ret = JS_PreventExtensions(ctx, obj);
+    if (ret < 0)
+        return JS_EXCEPTION;
+    if (reflect)
+        return JS_NewBool(ctx, ret);
+    else
+        return JS_DupValue(ctx, obj);
+}
+
+static JSValue js_object_hasOwnProperty(JSContext *ctx, JSValueConst this_val,
+                                        int argc, JSValueConst *argv)
+{
+    JSValue obj;
+    JSAtom atom;
+    JSObject *p;
+    BOOL ret;
+
+    atom = js_value_to_atom(ctx, argv[0]); /* must be done first */
+    if (unlikely(atom == JS_ATOM_NULL))
+        return JS_EXCEPTION;
+    obj = JS_ToObject(ctx, this_val);
+    if (JS_IsException(obj)) {
+        JS_FreeAtom(ctx, atom);
+        return obj;
+    }
+    p = JS_VALUE_GET_OBJ(obj);
+    ret = JS_GetOwnProperty(ctx, NULL, p, atom);
+    JS_FreeAtom(ctx, atom);
+    JS_FreeValue(ctx, obj);
+    if (ret < 0)
+        return JS_EXCEPTION;
+    else
+        return JS_NewBool(ctx, ret);
+}
+
+static JSValue js_object_valueOf(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv)
+{
+    return JS_ToObject(ctx, this_val);
+}
+
+static JSValue js_object_toString(JSContext *ctx, JSValueConst this_val,
+                                  int argc, JSValueConst *argv)
+{
+    JSValue obj, tag;
+    int is_array;
+    JSAtom atom;
+    JSObject *p;
+
+    if (JS_IsNull(this_val)) {
+        tag = JS_NewString(ctx, "Null");
+    } else if (JS_IsUndefined(this_val)) {
+        tag = JS_NewString(ctx, "Undefined");
+    } else {
+        obj = JS_ToObject(ctx, this_val);
+        if (JS_IsException(obj))
+            return obj;
+        is_array = JS_IsArray(ctx, obj);
+        if (is_array < 0) {
+            JS_FreeValue(ctx, obj);
+            return JS_EXCEPTION;
+        }
+        if (is_array) {
+            atom = JS_ATOM_Array;
+        } else if (JS_IsFunction(ctx, obj)) {
+            atom = JS_ATOM_Function;
+        } else {
+            p = JS_VALUE_GET_OBJ(obj);
+            switch(p->class_id) {
+            case JS_CLASS_STRING:
+            case JS_CLASS_ARGUMENTS:
+            case JS_CLASS_MAPPED_ARGUMENTS:
+            case JS_CLASS_ERROR:
+            case JS_CLASS_BOOLEAN:
+            case JS_CLASS_NUMBER:
+            case JS_CLASS_DATE:
+            case JS_CLASS_REGEXP:
+                atom = ctx->rt->class_array[p->class_id].class_name;
+                break;
+            default:
+                atom = JS_ATOM_Object;
+                break;
+            }
+        }
+        tag = JS_GetProperty(ctx, obj, JS_ATOM_Symbol_toStringTag);
+        JS_FreeValue(ctx, obj);
+        if (JS_IsException(tag))
+            return JS_EXCEPTION;
+        if (!JS_IsString(tag)) {
+            JS_FreeValue(ctx, tag);
+            tag = JS_AtomToString(ctx, atom);
+        }
+    }
+    return JS_ConcatString3(ctx, "[object ", tag, "]");
+}
+
+static JSValue js_object_toLocaleString(JSContext *ctx, JSValueConst this_val,
+                                        int argc, JSValueConst *argv)
+{
+    return JS_Invoke(ctx, this_val, JS_ATOM_toString, 0, NULL);
+}
+
+static JSValue js_object_assign(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    // Object.assign(obj, source1)
+    JSValue obj, s;
+    int i;
+
+    s = JS_UNDEFINED;
+    obj = JS_ToObject(ctx, argv[0]);
+    if (JS_IsException(obj))
+        goto exception;
+    for (i = 1; i < argc; i++) {
+        if (!JS_IsNull(argv[i]) && !JS_IsUndefined(argv[i])) {
+            s = JS_ToObject(ctx, argv[i]);
+            if (JS_IsException(s))
+                goto exception;
+            if (JS_CopyDataProperties(ctx, obj, s, JS_UNDEFINED, TRUE))
+                goto exception;
+            JS_FreeValue(ctx, s);
+        }
+    }
+    return obj;
+exception:
+    JS_FreeValue(ctx, obj);
+    JS_FreeValue(ctx, s);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_object_seal(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv, int freeze_flag)
+{
+    JSValueConst obj = argv[0];
+    JSObject *p;
+    JSPropertyEnum *props;
+    uint32_t len, i;
+    int flags, desc_flags, res;
+
+    if (!JS_IsObject(obj))
+        return JS_DupValue(ctx, obj);
+
+    p = JS_VALUE_GET_OBJ(obj);
+    flags = JS_GPN_STRING_MASK | JS_GPN_SYMBOL_MASK;
+    if (JS_GetOwnPropertyNames(ctx, &props, &len, p, flags))
+        return JS_EXCEPTION;
+
+    for(i = 0; i < len; i++) {
+        JSPropertyDescriptor desc;
+        JSAtom prop = props[i].atom;
+
+        desc_flags = JS_PROP_THROW | JS_PROP_HAS_CONFIGURABLE;
+        if (freeze_flag) {
+            res = JS_GetOwnProperty(ctx, &desc, p, prop);
+            if (res < 0)
+                goto exception;
+            if (res) {
+                if (desc.flags & JS_PROP_WRITABLE)
+                    desc_flags |= JS_PROP_HAS_WRITABLE;
+                js_free_desc(ctx, &desc);
+            }
+        }
+        if (JS_DefineProperty(ctx, obj, prop, JS_UNDEFINED,
+                              JS_UNDEFINED, JS_UNDEFINED, desc_flags) < 0)
+            goto exception;
+    }
+    js_free_prop_enum(ctx, props, len);
+    return js_object_preventExtensions(ctx, JS_UNDEFINED, 1, argv, 0);
+
+ exception:
+    js_free_prop_enum(ctx, props, len);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_object_isSealed(JSContext *ctx, JSValueConst this_val,
+                                  int argc, JSValueConst *argv, int is_frozen)
+{
+    JSValueConst obj = argv[0];
+    JSObject *p;
+    JSPropertyEnum *props;
+    uint32_t len, i;
+    int flags, res;
+    
+    if (!JS_IsObject(obj))
+        return JS_TRUE;
+
+    p = JS_VALUE_GET_OBJ(obj);
+    flags = JS_GPN_STRING_MASK | JS_GPN_SYMBOL_MASK;
+    if (JS_GetOwnPropertyNames(ctx, &props, &len, p, flags))
+        return JS_EXCEPTION;
+
+    for(i = 0; i < len; i++) {
+        JSPropertyDescriptor desc;
+        JSAtom prop = props[i].atom;
+
+        res = JS_GetOwnProperty(ctx, &desc, p, prop);
+        if (res < 0)
+            goto exception;
+        if (res) {
+            js_free_desc(ctx, &desc);
+            if ((desc.flags & JS_PROP_CONFIGURABLE)
+            ||  (is_frozen && (desc.flags & JS_PROP_WRITABLE))) {
+                res = FALSE;
+                goto done;
+            }
+        }
+    }
+    res = JS_IsExtensible(ctx, obj);
+    if (res < 0)
+        return JS_EXCEPTION;
+    res ^= 1;
+done:        
+    js_free_prop_enum(ctx, props, len);
+    return JS_NewBool(ctx, res);
+
+exception:
+    js_free_prop_enum(ctx, props, len);
+    return JS_EXCEPTION;
+}
+
+#if 0
+static JSValue js_object___toObject(JSContext *ctx, JSValueConst this_val,
+                                    int argc, JSValueConst *argv)
+{
+    return JS_ToObject(ctx, argv[0]);
+}
+
+static JSValue js_object___toPrimitive(JSContext *ctx, JSValueConst this_val,
+                                       int argc, JSValueConst *argv)
+{
+    int hint = HINT_NONE;
+
+    if (JS_VALUE_GET_TAG(argv[1]) == JS_TAG_INT)
+        hint = JS_VALUE_GET_INT(argv[1]);
+
+    return JS_ToPrimitive(ctx, argv[0], hint);
+}
+#endif
+
+/* return an empty string if not an object */
+static JSValue js_object___getClass(JSContext *ctx, JSValueConst this_val,
+                                    int argc, JSValueConst *argv)
+{
+    JSAtom atom;
+    JSObject *p;
+    uint32_t tag;
+    int class_id;
+
+    tag = JS_VALUE_GET_NORM_TAG(argv[0]);
+    if (tag == JS_TAG_OBJECT) {
+        p = JS_VALUE_GET_OBJ(argv[0]);
+        class_id = p->class_id;
+        if (class_id == JS_CLASS_PROXY && JS_IsFunction(ctx, argv[0]))
+            class_id = JS_CLASS_BYTECODE_FUNCTION;
+        atom = ctx->rt->class_array[class_id].class_name;
+    } else {
+        atom = JS_ATOM_empty_string;
+    }
+    return JS_AtomToString(ctx, atom);
+}
+
+static JSValue js_object_is(JSContext *ctx, JSValueConst this_val,
+                            int argc, JSValueConst *argv)
+{
+    return JS_NewBool(ctx, js_same_value(ctx, argv[0], argv[1]));
+}
+
+#if 0
+static JSValue js_object___getObjectData(JSContext *ctx, JSValueConst this_val,
+                                         int argc, JSValueConst *argv)
+{
+    return JS_GetObjectData(ctx, argv[0]);
+}
+
+static JSValue js_object___setObjectData(JSContext *ctx, JSValueConst this_val,
+                                         int argc, JSValueConst *argv)
+{
+    if (JS_SetObjectData(ctx, argv[0], JS_DupValue(ctx, argv[1])))
+        return JS_EXCEPTION;
+    return JS_DupValue(ctx, argv[1]);
+}
+
+static JSValue js_object___toPropertyKey(JSContext *ctx, JSValueConst this_val,
+                                         int argc, JSValueConst *argv)
+{
+    return JS_ToPropertyKey(ctx, argv[0]);
+}
+
+static JSValue js_object___isObject(JSContext *ctx, JSValueConst this_val,
+                                    int argc, JSValueConst *argv)
+{
+    return JS_NewBool(ctx, JS_IsObject(argv[0]));
+}
+
+static JSValue js_object___isSameValueZero(JSContext *ctx, JSValueConst this_val,
+                                           int argc, JSValueConst *argv)
+{
+    return JS_NewBool(ctx, js_same_value_zero(ctx, argv[0], argv[1]));
+}
+
+static JSValue js_object___isConstructor(JSContext *ctx, JSValueConst this_val,
+                                         int argc, JSValueConst *argv)
+{
+    return JS_NewBool(ctx, JS_IsConstructor(ctx, argv[0]));
+}
+#endif
+
+static JSValue JS_SpeciesConstructor(JSContext *ctx, JSValueConst obj,
+                                     JSValueConst defaultConstructor)
+{
+    JSValue ctor, species;
+
+    if (!JS_IsObject(obj))
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+    ctor = JS_GetProperty(ctx, obj, JS_ATOM_constructor);
+    if (JS_IsException(ctor))
+        return ctor;
+    if (JS_IsUndefined(ctor))
+        return JS_DupValue(ctx, defaultConstructor);
+    if (!JS_IsObject(ctor)) {
+        JS_FreeValue(ctx, ctor);
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+    }
+    species = JS_GetProperty(ctx, ctor, JS_ATOM_Symbol_species);
+    JS_FreeValue(ctx, ctor);
+    if (JS_IsException(species))
+        return species;
+    if (JS_IsUndefined(species) || JS_IsNull(species))
+        return JS_DupValue(ctx, defaultConstructor);
+    if (!JS_IsConstructor(ctx, species)) {
+        JS_FreeValue(ctx, species);
+        return JS_ThrowTypeError(ctx, "not a constructor");
+    }
+    return species;
+}
+
+#if 0
+static JSValue js_object___speciesConstructor(JSContext *ctx, JSValueConst this_val,
+                                              int argc, JSValueConst *argv)
+{
+    return JS_SpeciesConstructor(ctx, argv[0], argv[1]);
+}
+#endif
+
+static JSValue js_object_get___proto__(JSContext *ctx, JSValueConst this_val)
+{
+    JSValue val, ret;
+
+    val = JS_ToObject(ctx, this_val);
+    if (JS_IsException(val))
+        return val;
+    ret = JS_DupValue(ctx, JS_GetPrototype(ctx, val));
+    JS_FreeValue(ctx, val);
+    return ret;
+}
+
+static JSValue js_object_set___proto__(JSContext *ctx, JSValueConst this_val,
+                                       JSValueConst proto)
+{
+    if (JS_IsUndefined(this_val) || JS_IsNull(this_val))
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+    if (!JS_IsObject(proto) && !JS_IsNull(proto))
+        return JS_UNDEFINED;
+    if (JS_SetPrototypeInternal(ctx, this_val, proto, TRUE) < 0)
+        return JS_EXCEPTION;
+    else
+        return JS_UNDEFINED;
+}
+
+static JSValue js_object_isPrototypeOf(JSContext *ctx, JSValueConst this_val,
+                                       int argc, JSValueConst *argv)
+{
+    JSValue obj;
+    JSValueConst v;
+    int max_depth = 1000, res = -1;
+
+    v = argv[0];
+    if (!JS_IsObject(v))
+        return JS_FALSE;
+    obj = JS_ToObject(ctx, this_val);
+    if (JS_IsException(obj))
+        return JS_EXCEPTION;
+    while (--max_depth > 0) {
+        v = JS_GetPrototype(ctx, v);
+        if (JS_IsException(v))
+            goto exception;
+        if (JS_IsNull(v)) {
+            res = FALSE;
+            break;
+        }
+        if (js_strict_eq2(ctx, JS_DupValue(ctx, obj), JS_DupValue(ctx, v),
+                          JS_EQ_STRICT)) {
+            res = TRUE;
+            break;
+        }
+    }
+    JS_FreeValue(ctx, obj);
+    if (res < 0)
+        return JS_ThrowInternalError(ctx, "prototype chain cycle");
+    else
+        return JS_NewBool(ctx, res);
+
+exception:
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_object_propertyIsEnumerable(JSContext *ctx, JSValueConst this_val,
+                                              int argc, JSValueConst *argv)
+{
+    JSValue obj, res = JS_EXCEPTION;
+    JSAtom prop = JS_ATOM_NULL;
+    JSPropertyDescriptor desc;
+    int has_prop;
+
+    obj = JS_ToObject(ctx, this_val);
+    if (JS_IsException(obj))
+        goto exception;
+    prop = js_value_to_atom(ctx, argv[0]);
+    if (unlikely(prop == JS_ATOM_NULL))
+        goto exception;
+
+    has_prop = JS_GetOwnProperty(ctx, &desc, JS_VALUE_GET_OBJ(obj), prop);
+    if (has_prop < 0)
+        goto exception;
+    if (has_prop) {
+        res = JS_NewBool(ctx, (desc.flags & JS_PROP_ENUMERABLE) != 0);
+        js_free_desc(ctx, &desc);
+    } else {
+        res = JS_FALSE;
+    }
+
+exception:
+    JS_FreeAtom(ctx, prop);
+    JS_FreeValue(ctx, obj);
+    return res;
+}
+
+static JSValue js_object___lookupGetter__(JSContext *ctx, JSValueConst this_val,
+                                          int argc, JSValueConst *argv, int setter)
+{
+    JSValue obj, res = JS_EXCEPTION;
+    JSValueConst v;
+    JSAtom prop = JS_ATOM_NULL;
+    JSPropertyDescriptor desc;
+    int has_prop;
+
+    obj = JS_ToObject(ctx, this_val);
+    if (JS_IsException(obj))
+        goto exception;
+    prop = js_value_to_atom(ctx, argv[0]);
+    if (unlikely(prop == JS_ATOM_NULL))
+        goto exception;
+
+    for (v = obj;;) {
+        has_prop = JS_GetOwnProperty(ctx, &desc, JS_VALUE_GET_OBJ(v), prop);
+        if (has_prop < 0)
+            goto exception;
+        if (has_prop) {
+            if (desc.flags & JS_PROP_GETSET)
+                res = JS_DupValue(ctx, setter ? desc.setter : desc.getter);
+            else
+                res = JS_UNDEFINED;
+            js_free_desc(ctx, &desc);
+            break;
+        }
+        v = JS_GetPrototype(ctx, v);
+        if (JS_IsException(v))
+            goto exception;
+        if (JS_IsNull(v)) {
+            res = JS_UNDEFINED;
+            break;
+        }
+    }
+
+exception:
+    JS_FreeAtom(ctx, prop);
+    JS_FreeValue(ctx, obj);
+    return res;
+}
+
+static const JSCFunctionListEntry js_object_funcs[] = {
+    JS_CFUNC_DEF("create", 2, js_object_create ),
+    JS_CFUNC_MAGIC_DEF("getPrototypeOf", 1, js_object_getPrototypeOf, 0 ),
+    JS_CFUNC_DEF("setPrototypeOf", 2, js_object_setPrototypeOf ),
+    JS_CFUNC_MAGIC_DEF("defineProperty", 3, js_object_defineProperty, 0 ),
+    JS_CFUNC_DEF("defineProperties", 2, js_object_defineProperties ),
+    JS_CFUNC_DEF("getOwnPropertyNames", 1, js_object_getOwnPropertyNames ),
+    JS_CFUNC_DEF("getOwnPropertySymbols", 1, js_object_getOwnPropertySymbols ),
+    JS_CFUNC_MAGIC_DEF("keys", 1, js_object_keys, JS_ITERATOR_KIND_KEY ),
+    JS_CFUNC_MAGIC_DEF("values", 1, js_object_keys, JS_ITERATOR_KIND_VALUE ),
+    JS_CFUNC_MAGIC_DEF("entries", 1, js_object_keys, JS_ITERATOR_KIND_KEY_AND_VALUE ),
+    JS_CFUNC_MAGIC_DEF("isExtensible", 1, js_object_isExtensible, 0 ),
+    JS_CFUNC_MAGIC_DEF("preventExtensions", 1, js_object_preventExtensions, 0 ),
+    JS_CFUNC_MAGIC_DEF("getOwnPropertyDescriptor", 2, js_object_getOwnPropertyDescriptor, 0 ),
+    JS_CFUNC_DEF("getOwnPropertyDescriptors", 1, js_object_getOwnPropertyDescriptors ),
+    JS_CFUNC_DEF("is", 2, js_object_is ),
+    JS_CFUNC_DEF("assign", 2, js_object_assign ),
+    JS_CFUNC_MAGIC_DEF("seal", 1, js_object_seal, 0 ),
+    JS_CFUNC_MAGIC_DEF("freeze", 1, js_object_seal, 1 ),
+    JS_CFUNC_MAGIC_DEF("isSealed", 1, js_object_isSealed, 0 ),
+    JS_CFUNC_MAGIC_DEF("isFrozen", 1, js_object_isSealed, 1 ),
+    JS_CFUNC_DEF("__getClass", 1, js_object___getClass ),
+    //JS_CFUNC_DEF("__isObject", 1, js_object___isObject ),
+    //JS_CFUNC_DEF("__isConstructor", 1, js_object___isConstructor ),
+    //JS_CFUNC_DEF("__toObject", 1, js_object___toObject ),
+    JS_CFUNC_DEF("__setOwnProperty", 3, js_object___setOwnProperty ),
+    //JS_CFUNC_DEF("__toPrimitive", 2, js_object___toPrimitive ),
+    //JS_CFUNC_DEF("__toPropertyKey", 1, js_object___toPropertyKey ),
+    //JS_CFUNC_DEF("__speciesConstructor", 2, js_object___speciesConstructor ),
+    //JS_CFUNC_DEF("__isSameValueZero", 2, js_object___isSameValueZero ),
+    //JS_CFUNC_DEF("__getObjectData", 1, js_object___getObjectData ),
+    //JS_CFUNC_DEF("__setObjectData", 2, js_object___setObjectData ),
+};
+
+static const JSCFunctionListEntry js_object_proto_funcs[] = {
+    JS_CFUNC_DEF("toString", 0, js_object_toString ),
+    JS_CFUNC_DEF("toLocaleString", 0, js_object_toLocaleString ),
+    JS_CFUNC_DEF("valueOf", 0, js_object_valueOf ),
+    JS_CFUNC_DEF("hasOwnProperty", 1, js_object_hasOwnProperty ),
+    JS_CFUNC_DEF("isPrototypeOf", 1, js_object_isPrototypeOf ),
+    JS_CFUNC_DEF("propertyIsEnumerable", 1, js_object_propertyIsEnumerable ),
+    JS_CGETSET_DEF("__proto__", js_object_get___proto__, js_object_set___proto__ ),
+    JS_CFUNC_MAGIC_DEF("__defineGetter__", 2, js_object___defineGetter__, 0 ),
+    JS_CFUNC_MAGIC_DEF("__defineSetter__", 2, js_object___defineGetter__, 1 ),
+    JS_CFUNC_MAGIC_DEF("__lookupGetter__", 1, js_object___lookupGetter__, 0 ),
+    JS_CFUNC_MAGIC_DEF("__lookupSetter__", 1, js_object___lookupGetter__, 1 ),
+};
+
+/* Function class */
+
+static JSValue js_function_proto(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv)
+{
+    return JS_UNDEFINED;
+}
+
+static JSValue js_function_constructor(JSContext *ctx, JSValueConst new_target,
+                                       int argc, JSValueConst *argv, int magic)
+{
+    JSFunctionKindEnum func_kind = magic;
+    int i, n, ret;
+    JSValue s, proto, obj = JS_UNDEFINED;
+    StringBuffer b_s, *b = &b_s;
+
+    string_buffer_init(ctx, b, 0);
+    string_buffer_putc8(b, '(');
+
+    if (func_kind == JS_FUNC_ASYNC || func_kind == JS_FUNC_ASYNC_GENERATOR) {
+        string_buffer_puts8(b, "async ");
+    }
+    string_buffer_puts8(b, "function");
+
+    if (func_kind == JS_FUNC_GENERATOR || func_kind == JS_FUNC_ASYNC_GENERATOR) {
+        string_buffer_putc8(b, '*');
+    }
+    string_buffer_puts8(b, " anonymous(");
+
+    n = argc - 1;
+    for(i = 0; i < n; i++) {
+        if (i != 0) {
+            string_buffer_putc8(b, ',');
+        }
+        if (string_buffer_concat_value(b, argv[i]))
+            goto fail;
+    }
+    string_buffer_puts8(b, "\n) {\n");
+    if (n >= 0) {
+        if (string_buffer_concat_value(b, argv[n]))
+            goto fail;
+    }
+    string_buffer_puts8(b, "\n})");
+    s = string_buffer_end(b);
+    if (JS_IsException(s))
+        goto fail1;
+
+    obj = JS_EvalObject(ctx, ctx->global_obj, s, JS_EVAL_TYPE_INDIRECT, -1);
+    JS_FreeValue(ctx, s);
+    if (JS_IsException(obj))
+        goto fail1;
+    if (!JS_IsUndefined(new_target)) {
+        /* set the prototype */
+        proto = js_get_prototype_from_ctor(ctx, new_target, JS_UNDEFINED);
+        if (JS_IsException(proto))
+            goto fail1;
+        if (!JS_IsUndefined(proto)) {
+            ret = JS_SetPrototypeInternal(ctx, obj, proto, TRUE);
+            JS_FreeValue(ctx, proto);
+            if (ret < 0)
+                goto fail1;
+        }
+    }
+    return obj;
+
+ fail:
+    string_buffer_free(b);
+ fail1:
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+static __exception int js_get_length32(JSContext *ctx, uint32_t *pres,
+                                       JSValueConst obj)
+{
+    JSValue len_val;
+    len_val = JS_GetProperty(ctx, obj, JS_ATOM_length);
+    if (JS_IsException(len_val)) {
+        *pres = 0;
+        return -1;
+    }
+    return JS_ToUint32Free(ctx, pres, len_val);
+}
+
+static __exception int js_get_length64(JSContext *ctx, int64_t *pres,
+                                       JSValueConst obj)
+{
+    JSValue len_val;
+    len_val = JS_GetProperty(ctx, obj, JS_ATOM_length);
+    if (JS_IsException(len_val)) {
+        *pres = 0;
+        return -1;
+    }
+    return JS_ToLengthFree(ctx, pres, len_val);
+}
+
+static void free_arg_list(JSContext *ctx, JSValue *tab, uint32_t len)
+{
+    uint32_t i;
+    for(i = 0; i < len; i++) {
+        JS_FreeValue(ctx, tab[i]);
+    }
+    js_free(ctx, tab);
+}
+
+/* XXX: should use ValueArray */
+static JSValue *build_arg_list(JSContext *ctx, uint32_t *plen,
+                               JSValueConst array_arg)
+{
+    uint32_t len, i;
+    JSValue *tab, ret;
+    JSObject *p;
+
+    if (JS_VALUE_GET_TAG(array_arg) != JS_TAG_OBJECT) {
+        JS_ThrowTypeError(ctx, "not a object");
+        return NULL;
+    }
+    if (js_get_length32(ctx, &len, array_arg))
+        return NULL;
+    /* avoid allocating 0 bytes */
+    tab = js_mallocz(ctx, sizeof(tab[0]) * max_uint32(1, len));
+    if (!tab)
+        return NULL;
+    p = JS_VALUE_GET_OBJ(array_arg);
+    if ((p->class_id == JS_CLASS_ARRAY || p->class_id == JS_CLASS_ARGUMENTS) &&
+        p->fast_array &&
+        len == p->u.array.count) {
+        for(i = 0; i < len; i++) {
+            tab[i] = JS_DupValue(ctx, p->u.array.u.values[i]);
+        }
+    } else {
+        for(i = 0; i < len; i++) {
+            ret = JS_GetPropertyUint32(ctx, array_arg, i);
+            if (JS_IsException(ret)) {
+                free_arg_list(ctx, tab, i);
+                return NULL;
+            }
+            tab[i] = ret;
+        }
+    }
+    *plen = len;
+    return tab;
+}
+
+static JSValue js_function_apply(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv, int magic)
+{
+    JSValueConst this_arg, array_arg;
+    uint32_t len;
+    JSValue *tab, ret;
+
+    if (check_function(ctx, this_val))
+        return JS_EXCEPTION;
+    this_arg = argv[0];
+    array_arg = argv[1];
+    if (JS_VALUE_GET_TAG(array_arg) == JS_TAG_UNDEFINED ||
+        JS_VALUE_GET_TAG(array_arg) == JS_TAG_NULL) {
+        return JS_Call(ctx, this_val, this_arg, 0, NULL);
+    }
+    tab = build_arg_list(ctx, &len, array_arg);
+    if (!tab)
+        return JS_EXCEPTION;
+    if (magic) {
+        ret = JS_CallConstructor2(ctx, this_val, this_arg, len, (JSValueConst *)tab);
+    } else {
+        ret = JS_Call(ctx, this_val, this_arg, len, (JSValueConst *)tab);
+    }
+    free_arg_list(ctx, tab, len);
+    return ret;
+}
+
+static JSValue js_function_call(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    if (argc <= 0) {
+        return JS_Call(ctx, this_val, JS_UNDEFINED, 0, NULL);
+    } else {
+        return JS_Call(ctx, this_val, argv[0], argc - 1, argv + 1);
+    }
+}
+
+static JSValue js_function_bind(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    JSBoundFunction *bf;
+    JSValue func_obj, name1;
+    JSObject *p;
+    int arg_count, i;
+    uint32_t len1;
+
+    if (check_function(ctx, this_val))
+        return JS_EXCEPTION;
+
+    func_obj = JS_NewObjectProtoClass(ctx, ctx->function_proto,
+                                 JS_CLASS_BOUND_FUNCTION);
+    if (JS_IsException(func_obj))
+        return JS_EXCEPTION;
+    p = JS_VALUE_GET_OBJ(func_obj);
+    p->is_constructor = JS_IsConstructor(ctx, this_val);
+    arg_count = max_int(0, argc - 1);
+    bf = js_malloc(ctx, sizeof(*bf) + arg_count * sizeof(JSValue));
+    if (!bf)
+        goto exception;
+    bf->func_obj = JS_DupValue(ctx, this_val);
+    bf->this_val = JS_DupValue(ctx, argv[0]);
+    bf->argc = arg_count;
+    for(i = 0; i < arg_count; i++) {
+        bf->argv[i] = JS_DupValue(ctx, argv[i + 1]);
+    }
+    p->u.bound_function = bf;
+
+    name1 = JS_GetProperty(ctx, this_val, JS_ATOM_name);
+    if (JS_IsException(name1))
+        goto exception;
+    if (!JS_IsString(name1)) {
+        JS_FreeValue(ctx, name1);
+        name1 = JS_AtomToString(ctx, JS_ATOM_empty_string);
+    }
+    name1 = JS_ConcatString3(ctx, "bound ", name1, "");
+    if (JS_IsException(name1))
+        goto exception;
+    JS_DefinePropertyValue(ctx, func_obj, JS_ATOM_name, name1,
+                           JS_PROP_CONFIGURABLE);
+    if (js_get_length32(ctx, &len1, this_val))
+        goto exception;
+    if (len1 <= (uint32_t)arg_count)
+        len1 = 0;
+    else
+        len1 -= arg_count;
+    JS_DefinePropertyValue(ctx, func_obj, JS_ATOM_length,
+                           JS_NewUint32(ctx, len1),
+                           JS_PROP_CONFIGURABLE);
+    return func_obj;
+ exception:
+    JS_FreeValue(ctx, func_obj);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_function_toString(JSContext *ctx, JSValueConst this_val,
+                                    int argc, JSValueConst *argv)
+{
+    JSObject *p;
+    JSFunctionKindEnum func_kind = JS_FUNC_NORMAL;
+
+    if (check_function(ctx, this_val))
+        return JS_EXCEPTION;
+
+    p = JS_VALUE_GET_OBJ(this_val);
+    if (js_class_has_bytecode(p->class_id)) {
+        JSFunctionBytecode *b = p->u.func.function_bytecode;
+        if (b->has_debug && b->debug.source) {
+            return JS_NewStringLen(ctx, b->debug.source, b->debug.source_len);
+        }
+        func_kind = b->func_kind;
+    }
+    {
+        JSValue name;
+        const char *pref, *suff;
+
+        if (p->is_class) {
+            pref = "class ";
+            suff = " {\n    [native code]\n}";
+        } else {
+            switch(func_kind) {
+            default:
+            case JS_FUNC_NORMAL:
+                pref = "function ";
+                break;
+            case JS_FUNC_GENERATOR:
+                pref = "function *";
+                break;
+            case JS_FUNC_ASYNC:
+                pref = "async function ";
+                break;
+            case JS_FUNC_ASYNC_GENERATOR:
+                pref = "async function *";
+                break;
+            }
+            suff = "() {\n    [native code]\n}";
+        }
+        name = JS_GetProperty(ctx, this_val, JS_ATOM_name);
+        if (JS_IsUndefined(name))
+            name = JS_AtomToString(ctx, JS_ATOM_empty_string);
+        return JS_ConcatString3(ctx, pref, name, suff);
+    }
+}
+
+static JSValue js_function_hasInstance(JSContext *ctx, JSValueConst this_val,
+                                       int argc, JSValueConst *argv)
+{
+    int ret;
+    ret = JS_OrdinaryIsInstanceOf(ctx, argv[0], this_val);
+    if (ret < 0)
+        return JS_EXCEPTION;
+    else
+        return JS_NewBool(ctx, ret);
+}
+
+static const JSCFunctionListEntry js_function_proto_funcs[] = {
+    JS_CFUNC_DEF("call", 1, js_function_call ),
+    JS_CFUNC_MAGIC_DEF("apply", 2, js_function_apply, 0 ),
+    JS_CFUNC_DEF("bind", 1, js_function_bind ),
+    JS_CFUNC_DEF("toString", 0, js_function_toString ),
+    JS_CFUNC_DEF("[Symbol.hasInstance]", 1, js_function_hasInstance ),
+    JS_CGETSET_DEF("fileName", js_function_proto_fileName, NULL ),
+    JS_CGETSET_DEF("lineNumber", js_function_proto_lineNumber, NULL ),
+};
+
+/* Error class */
+
+static JSValue js_error_constructor(JSContext *ctx, JSValueConst new_target,
+                                    int argc, JSValueConst *argv, int magic)
+{
+    JSValue obj, msg, proto;
+    JSValueConst proto1;
+
+    if (JS_IsUndefined(new_target))
+        new_target = JS_GetActiveFunction(ctx);
+    if (magic < 0) {
+        proto1 = ctx->class_proto[JS_CLASS_ERROR];
+    } else {
+        proto1 = ctx->native_error_proto[magic];
+    }
+    proto = js_get_prototype_from_ctor(ctx, new_target, proto1);
+    if (JS_IsException(proto))
+        return proto;
+    obj = JS_NewObjectProtoClass(ctx, proto, JS_CLASS_ERROR);
+    JS_FreeValue(ctx, proto);
+    if (!JS_IsException(obj) && !JS_IsUndefined(argv[0])) {
+        msg = JS_ToString(ctx, argv[0]);
+        if (unlikely(JS_IsException(msg))) {
+            JS_FreeValue(ctx, obj);
+            return JS_EXCEPTION;
+        }
+        JS_DefinePropertyValue(ctx, obj, JS_ATOM_message, msg,
+                               JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+    }
+    return obj;
+}
+
+static JSValue js_error_toString(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv)
+{
+    JSValue name, msg;
+
+    name = JS_GetProperty(ctx, this_val, JS_ATOM_name);
+    if (JS_IsUndefined(name))
+        name = JS_AtomToString(ctx, JS_ATOM_Error);
+    else
+        name = JS_ToStringFree(ctx, name);
+    if (JS_IsException(name))
+        return JS_EXCEPTION;
+
+    msg = JS_GetProperty(ctx, this_val, JS_ATOM_message);
+    if (JS_IsUndefined(msg))
+        msg = JS_AtomToString(ctx, JS_ATOM_empty_string);
+    else
+        msg = JS_ToStringFree(ctx, msg);
+    if (JS_IsException(msg)) {
+        JS_FreeValue(ctx, name);
+        return JS_EXCEPTION;
+    }
+    if (!JS_IsEmptyString(name) && !JS_IsEmptyString(msg))
+        name = JS_ConcatString3(ctx, "", name, ": ");
+    return JS_ConcatString(ctx, name, msg);
+}
+
+static const JSCFunctionListEntry js_error_proto_funcs[] = {
+    JS_CFUNC_DEF("toString", 0, js_error_toString ),
+    JS_PROP_STRING_DEF("name", "Error", JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE ),
+    JS_PROP_STRING_DEF("message", "", JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE ),
+};
+
+/* Array */
+
+static int JS_CopySubArray(JSContext *ctx,
+                           JSValueConst obj, int64_t to_pos,
+                           int64_t from_pos, int64_t count, int dir)
+{
+    int64_t i, from, to;
+    JSValue val;
+    int fromPresent;
+
+    /* XXX: should special case fast arrays */
+    for (i = 0; i < count; i++) {
+        if (dir < 0) {
+            from = from_pos + count - i - 1;
+            to = to_pos + count - i - 1;
+        } else {
+            from = from_pos + i;
+            to = to_pos + i;
+        }
+        fromPresent = JS_TryGetPropertyInt64(ctx, obj, from, &val);
+        if (fromPresent < 0)
+            goto exception;
+
+        if (fromPresent) {
+            if (JS_SetPropertyInt64(ctx, obj, to, val) < 0)
+                goto exception;
+        } else {
+            if (JS_DeletePropertyInt64(ctx, obj, to, JS_PROP_THROW) < 0)
+                goto exception;
+        }
+    }
+    return 0;
+
+ exception:
+    return -1;
+}
+
+static JSValue js_array_constructor(JSContext *ctx, JSValueConst new_target,
+                                    int argc, JSValueConst *argv)
+{
+    JSValue obj;
+    int i;
+
+    obj = js_create_from_ctor(ctx, new_target, JS_CLASS_ARRAY);
+    if (JS_IsException(obj))
+        return obj;
+    if (argc == 1 && JS_IsNumber(argv[0])) {
+        uint32_t len;
+        if (JS_ToArrayLengthFree(ctx, &len, JS_DupValue(ctx, argv[0])))
+            goto fail;
+        if (JS_SetProperty(ctx, obj, JS_ATOM_length, JS_NewUint32(ctx, len)) < 0)
+            goto fail;
+    } else {
+        for(i = 0; i < argc; i++) {
+            if (JS_SetPropertyUint32(ctx, obj, i, JS_DupValue(ctx, argv[i])) < 0)
+                goto fail;
+        }
+    }
+    return obj;
+fail:
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_array_from(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv)
+{
+    // from(items, mapfn = void 0, this_arg = void 0)
+    JSValueConst items = argv[0], mapfn, this_arg;
+    JSValueConst args[2];
+    JSValue stack[2];
+    JSValue iter, r, v, v2, arrayLike;
+    int64_t k, len;
+    int done, mapping;
+
+    mapping = FALSE;
+    mapfn = JS_UNDEFINED;
+    this_arg = JS_UNDEFINED;
+    r = JS_UNDEFINED;
+    arrayLike = JS_UNDEFINED;
+    stack[0] = JS_UNDEFINED;
+    stack[1] = JS_UNDEFINED;
+
+    if (argc > 1) {
+        mapfn = argv[1];
+        if (!JS_IsUndefined(mapfn)) {
+            if (check_function(ctx, mapfn))
+                goto exception;
+            mapping = 1;
+            if (argc > 2)
+                this_arg = argv[2];
+        }
+    }
+    iter = JS_GetProperty(ctx, items, JS_ATOM_Symbol_iterator);
+    if (JS_IsException(iter))
+        goto exception;
+    if (!JS_IsUndefined(iter)) {
+        JS_FreeValue(ctx, iter);
+        if (JS_IsConstructor(ctx, this_val))
+            r = JS_CallConstructor(ctx, this_val, 0, NULL);
+        else
+            r = JS_NewArray(ctx);
+        if (JS_IsException(r))
+            goto exception;
+        stack[0] = JS_DupValue(ctx, items);
+        if (js_for_of_start(ctx, &stack[1], FALSE))
+            goto exception;
+        for (k = 0;; k++) {
+            v = JS_IteratorNext(ctx, stack[0], stack[1], 0, NULL, &done);
+            if (JS_IsException(v))
+                goto exception_close;
+            if (done)
+                break;
+            if (mapping) {
+                args[0] = v;
+                args[1] = JS_NewInt32(ctx, k);
+                v2 = JS_Call(ctx, mapfn, this_arg, 2, args);
+                JS_FreeValue(ctx, v);
+                v = v2;
+                if (JS_IsException(v))
+                    goto exception_close;
+            }
+            if (JS_DefinePropertyValueInt64(ctx, r, k, v,
+                                            JS_PROP_C_W_E | JS_PROP_THROW) < 0)
+                goto exception_close;
+        }
+    } else {
+        arrayLike = JS_ToObject(ctx, items);
+        if (JS_IsException(arrayLike))
+            goto exception;
+        if (js_get_length64(ctx, &len, arrayLike) < 0)
+            goto exception;
+        v = JS_NewInt64(ctx, len);
+        args[0] = v;
+        if (JS_IsConstructor(ctx, this_val)) {
+            r = JS_CallConstructor(ctx, this_val, 1, args);
+        } else {
+            r = js_array_constructor(ctx, JS_UNDEFINED, 1, args);
+        }
+        JS_FreeValue(ctx, v);
+        if (JS_IsException(r))
+            goto exception;
+        for(k = 0; k < len; k++) {
+            v = JS_GetPropertyInt64(ctx, arrayLike, k);
+            if (JS_IsException(v))
+                goto exception;
+            if (mapping) {
+                args[0] = v;
+                args[1] = JS_NewInt32(ctx, k);
+                v2 = JS_Call(ctx, mapfn, this_arg, 2, args);
+                JS_FreeValue(ctx, v);
+                v = v2;
+                if (JS_IsException(v))
+                    goto exception;
+            }
+            if (JS_DefinePropertyValueInt64(ctx, r, k, v,
+                                            JS_PROP_C_W_E | JS_PROP_THROW) < 0)
+                goto exception;
+        }
+    }
+    if (JS_SetProperty(ctx, r, JS_ATOM_length, JS_NewUint32(ctx, k)) < 0)
+        goto exception;
+    goto done;
+
+ exception_close:
+    if (!JS_IsUndefined(stack[0]))
+        JS_IteratorClose(ctx, stack[0], TRUE);
+ exception:
+    JS_FreeValue(ctx, r);
+    r = JS_EXCEPTION;
+ done:
+    JS_FreeValue(ctx, arrayLike);
+    JS_FreeValue(ctx, stack[0]);
+    JS_FreeValue(ctx, stack[1]);
+    return r;
+}
+
+static JSValue js_array_of(JSContext *ctx, JSValueConst this_val,
+                           int argc, JSValueConst *argv)
+{
+    JSValue obj, args[1];
+    int i;
+
+    if (JS_IsConstructor(ctx, this_val)) {
+        args[0] = JS_NewInt32(ctx, argc);
+        obj = JS_CallConstructor(ctx, this_val, 1, (JSValueConst *)args);
+    } else {
+        obj = JS_NewArray(ctx);
+    }
+    if (JS_IsException(obj))
+        return JS_EXCEPTION;
+    for(i = 0; i < argc; i++) {
+        if (JS_CreateDataPropertyUint32(ctx, obj, i, JS_DupValue(ctx, argv[i]),
+                                        JS_PROP_THROW) < 0) {
+            goto fail;
+        }
+    }
+    if (JS_SetProperty(ctx, obj, JS_ATOM_length, JS_NewUint32(ctx, argc)) < 0) {
+    fail:
+        JS_FreeValue(ctx, obj);
+        return JS_EXCEPTION;
+    }
+    return obj;
+}
+
+static JSValue js_array_isArray(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    int ret;
+    ret = JS_IsArray(ctx, argv[0]);
+    if (ret < 0)
+        return JS_EXCEPTION;
+    else
+        return JS_NewBool(ctx, ret);
+}
+
+static JSValue js_get_this(JSContext *ctx,
+                           JSValueConst this_val)
+{
+    return JS_DupValue(ctx, this_val);
+}
+
+static JSValue JS_ArraySpeciesCreate(JSContext *ctx, JSValueConst obj,
+                                     JSValueConst len_val)
+{
+    JSValue ctor, ret;
+    int res;
+
+    res = JS_IsArray(ctx, obj);
+    if (res < 0)
+        return JS_EXCEPTION;
+    if (!res)
+        return js_array_constructor(ctx, JS_UNDEFINED, 1, &len_val);
+    ctor = JS_SpeciesConstructor(ctx, obj, JS_UNDEFINED);
+    if (JS_IsException(ctor))
+        return JS_EXCEPTION;
+    if (JS_IsUndefined(ctor))
+        return js_array_constructor(ctx, JS_UNDEFINED, 1, &len_val);
+    ret = JS_CallConstructor(ctx, ctor, 1, &len_val);
+    JS_FreeValue(ctx, ctor);
+    return ret;
+}
+
+static const JSCFunctionListEntry js_array_funcs[] = {
+    JS_CFUNC_DEF("isArray", 1, js_array_isArray ),
+    JS_CFUNC_DEF("from", 1, js_array_from ),
+    JS_CFUNC_DEF("of", 0, js_array_of ),
+    JS_CGETSET_DEF("[Symbol.species]", js_get_this, NULL ),
+};
+
+static int JS_isConcatSpreadable(JSContext *ctx, JSValueConst obj)
+{
+    JSValue val;
+
+    if (!JS_IsObject(obj))
+        return FALSE;
+    val = JS_GetProperty(ctx, obj, JS_ATOM_Symbol_isConcatSpreadable);
+    if (JS_IsException(val))
+        return -1;
+    if (!JS_IsUndefined(val))
+        return JS_ToBoolFree(ctx, val);
+    return JS_IsArray(ctx, obj);
+}
+
+static JSValue js_array_concat(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv)
+{
+    JSValue obj, arr, val;
+    JSValueConst e;
+    int64_t len, k, n;
+    int i, res;
+
+    arr = JS_UNDEFINED;
+    obj = JS_ToObject(ctx, this_val);
+    if (JS_IsException(obj))
+        goto exception;
+
+    arr = JS_ArraySpeciesCreate(ctx, obj, JS_NewInt32(ctx, 0));
+    if (JS_IsException(arr))
+        goto exception;
+    n = 0;
+    for (i = -1; i < argc; i++) {
+        if (i < 0)
+            e = obj;
+        else
+            e = argv[i];
+
+        res = JS_isConcatSpreadable(ctx, e);
+        if (res < 0)
+            goto exception;
+        if (res) {
+            if (js_get_length64(ctx, &len, e))
+                goto exception;
+            if (n + len >= MAX_SAFE_INTEGER) {
+                JS_ThrowTypeError(ctx, "Array loo long");
+                goto exception;
+            }
+            for (k = 0; k < len; k++, n++) {
+                res = JS_TryGetPropertyInt64(ctx, e, k, &val);
+                if (res < 0)
+                    goto exception;
+                if (res) {
+                    if (JS_DefinePropertyValueInt64(ctx, arr, n, val,
+                                                    JS_PROP_C_W_E | JS_PROP_THROW) < 0)
+                        goto exception;
+                }
+            }
+        } else {
+            if (n >= MAX_SAFE_INTEGER) {
+                JS_ThrowTypeError(ctx, "Array loo long");
+                goto exception;
+            }
+            if (JS_DefinePropertyValueInt64(ctx, arr, n, JS_DupValue(ctx, e),
+                                            JS_PROP_C_W_E | JS_PROP_THROW) < 0)
+                goto exception;
+            n++;
+        }
+    }
+    if (JS_SetProperty(ctx, arr, JS_ATOM_length, JS_NewInt64(ctx, n)) < 0)
+        goto exception;
+
+    JS_FreeValue(ctx, obj);
+    return arr;
+
+exception:
+    JS_FreeValue(ctx, arr);
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+#define special_every    0
+#define special_some     1
+#define special_forEach  2
+#define special_map      3
+#define special_filter   4
+#define special_TA       8
+
+static int js_typed_array_get_length_internal(JSContext *ctx, JSValueConst obj);
+
+static JSValue js_typed_array___speciesCreate(JSContext *ctx,
+                                              JSValueConst this_val,
+                                              int argc, JSValueConst *argv);
+
+static JSValue js_array_every(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv, int special)
+{
+    JSValue obj, val, index_val, res, ret;
+    JSValueConst args[3];
+    JSValueConst func, this_arg;
+    int64_t len, k, n;
+    int present;
+
+    ret = JS_UNDEFINED;
+    val = JS_UNDEFINED;
+    if (special & special_TA) {
+        obj = JS_DupValue(ctx, this_val);
+        len = js_typed_array_get_length_internal(ctx, obj);
+        if (len < 0)
+            goto exception;
+    } else {
+        obj = JS_ToObject(ctx, this_val);
+        if (js_get_length64(ctx, &len, obj))
+            goto exception;
+    }
+    func = argv[0];
+    this_arg = JS_UNDEFINED;
+    if (argc > 1)
+        this_arg = argv[1];
+        
+    if (check_function(ctx, func))
+        goto exception;
+
+    switch (special) {
+    case special_every:
+    case special_every | special_TA:
+        ret = JS_TRUE;
+        break;
+    case special_some:
+    case special_some | special_TA:
+        ret = JS_FALSE;
+        break;
+    case special_map:
+        /* XXX: JS_ArraySpeciesCreate should take int64_t */
+        ret = JS_ArraySpeciesCreate(ctx, obj, JS_NewInt64(ctx, len));
+        if (JS_IsException(ret))
+            goto exception;
+        break;
+    case special_filter:
+        ret = JS_ArraySpeciesCreate(ctx, obj, JS_NewInt32(ctx, 0));
+        if (JS_IsException(ret))
+            goto exception;
+        break;
+    case special_map | special_TA:
+        args[0] = obj;
+        args[1] = JS_NewInt32(ctx, len);
+        ret = js_typed_array___speciesCreate(ctx, JS_UNDEFINED, 2, args);
+        if (JS_IsException(ret))
+            goto exception;
+        break;
+    case special_filter | special_TA:
+        ret = JS_NewArray(ctx);
+        if (JS_IsException(ret))
+            goto exception;
+        break;
+    }
+    n = 0;
+
+    for(k = 0; k < len; k++) {
+        present = JS_TryGetPropertyInt64(ctx, obj, k, &val);
+        if (present < 0)
+            goto exception;
+        if (present) {
+            index_val = JS_NewInt64(ctx, k);
+            if (JS_IsException(index_val))
+                goto exception;
+            args[0] = val;
+            args[1] = index_val;
+            args[2] = obj;
+            res = JS_Call(ctx, func, this_arg, 3, args);
+            JS_FreeValue(ctx, index_val);
+            if (JS_IsException(res))
+                goto exception;
+            switch (special) {
+            case special_every:
+            case special_every | special_TA:
+                if (!JS_ToBoolFree(ctx, res)) {
+                    ret = JS_FALSE;
+                    goto done;
+                }
+                break;
+            case special_some:
+            case special_some | special_TA:
+                if (JS_ToBoolFree(ctx, res)) {
+                    ret = JS_TRUE;
+                    goto done;
+                }
+                break;
+            case special_map:
+                if (JS_DefinePropertyValueInt64(ctx, ret, k, res,
+                                                JS_PROP_C_W_E | JS_PROP_THROW) < 0)
+                    goto exception;
+                break;
+            case special_map | special_TA:
+                if (JS_SetPropertyValue(ctx, ret, JS_NewInt32(ctx, k), res, JS_PROP_THROW) < 0)
+                    goto exception;
+                break;
+            case special_filter:
+            case special_filter | special_TA:
+                if (JS_ToBoolFree(ctx, res)) {
+                    if (JS_DefinePropertyValueInt64(ctx, ret, n++, JS_DupValue(ctx, val),
+                                                    JS_PROP_C_W_E | JS_PROP_THROW) < 0)
+                        goto exception;
+                }
+                break;
+            default:
+                JS_FreeValue(ctx, res);
+                break;
+            }
+            JS_FreeValue(ctx, val);
+            val = JS_UNDEFINED;
+        }
+    }
+done:
+    if (special == (special_filter | special_TA)) {
+        JSValue arr;
+        args[0] = obj;
+        args[1] = JS_NewInt32(ctx, n);
+        arr = js_typed_array___speciesCreate(ctx, JS_UNDEFINED, 2, args);
+        if (JS_IsException(arr))
+            goto exception;
+        args[0] = ret;
+        res = JS_Invoke(ctx, arr, JS_ATOM_set, 1, args);
+        if (check_exception_free(ctx, res))
+            goto exception;
+        JS_FreeValue(ctx, ret);
+        ret = arr;
+    }
+    JS_FreeValue(ctx, val);
+    JS_FreeValue(ctx, obj);
+    return ret;
+
+exception:
+    JS_FreeValue(ctx, ret);
+    JS_FreeValue(ctx, val);
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+#define special_reduce       0
+#define special_reduceRight  1
+
+static JSValue js_array_reduce(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv, int special)
+{
+    JSValue obj, val, index_val, acc, acc1;
+    JSValueConst args[4];
+    JSValueConst func;
+    int64_t len, k, k1;
+    int present;
+
+    acc = JS_UNDEFINED;
+    val = JS_UNDEFINED;
+    if (special & special_TA) {
+        obj = JS_DupValue(ctx, this_val);
+        len = js_typed_array_get_length_internal(ctx, obj);
+        if (len < 0)
+            goto exception;
+    } else {
+        obj = JS_ToObject(ctx, this_val);
+        if (js_get_length64(ctx, &len, obj))
+            goto exception;
+    }
+    func = argv[0];
+
+    if (check_function(ctx, func))
+        goto exception;
+
+    k = 0;
+    if (argc > 1) {
+        acc = JS_DupValue(ctx, argv[1]);
+    } else {
+        for(;;) {
+            if (k >= len) {
+                JS_ThrowTypeError(ctx, "empty array");
+                goto exception;
+            }
+            k1 = (special & special_reduceRight) ? len - k - 1 : k;
+            k++;
+            present = JS_TryGetPropertyInt64(ctx, obj, k1, &acc);
+            if (present < 0)
+                goto exception;
+            if (present)
+                break;
+        }
+    }
+    for (; k < len; k++) {
+        k1 = (special & special_reduceRight) ? len - k - 1 : k;
+        present = JS_TryGetPropertyInt64(ctx, obj, k1, &val);
+        if (present < 0)
+            goto exception;
+        if (present) {
+            index_val = JS_NewInt64(ctx, k1);
+            if (JS_IsException(index_val))
+                goto exception;
+            args[0] = acc;
+            args[1] = val;
+            args[2] = index_val;
+            args[3] = obj;
+            acc1 = JS_Call(ctx, func, JS_UNDEFINED, 4, args);
+            JS_FreeValue(ctx, index_val);
+            JS_FreeValue(ctx, val);
+            val = JS_UNDEFINED;
+            if (JS_IsException(acc1))
+                goto exception;
+            JS_FreeValue(ctx, acc);
+            acc = acc1;
+        }
+    }
+    JS_FreeValue(ctx, obj);
+    return acc;
+
+exception:
+    JS_FreeValue(ctx, acc);
+    JS_FreeValue(ctx, val);
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_array_fill(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv)
+{
+    JSValue obj;
+    int64_t len, start, end;
+
+    obj = JS_ToObject(ctx, this_val);
+    if (js_get_length64(ctx, &len, obj))
+        goto exception;
+
+    start = 0;
+    if (argc > 1 && !JS_IsUndefined(argv[1])) {
+        if (JS_ToInt64Clamp(ctx, &start, argv[1], 0, len, len))
+            goto exception;
+    }
+
+    end = len;
+    if (argc > 2 && !JS_IsUndefined(argv[2])) {
+        if (JS_ToInt64Clamp(ctx, &end, argv[2], 0, len, len))
+            goto exception;
+    }
+
+    /* XXX: should special case fast arrays */
+    while (start < end) {
+        if (JS_SetPropertyInt64(ctx, obj, start,
+                                JS_DupValue(ctx, argv[0])) < 0)
+            goto exception;
+        start++;
+    }
+    return obj;
+
+ exception:
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_array_includes(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv)
+{
+    JSValue obj, val;
+    int64_t len, n, res;
+    JSValue *arrp;
+    uint32_t count;
+
+    obj = JS_ToObject(ctx, this_val);
+    if (js_get_length64(ctx, &len, obj))
+        goto exception;
+
+    res = FALSE;
+    if (len > 0) {
+        n = 0;
+        if (argc > 1) {
+            if (JS_ToInt64Clamp(ctx, &n, argv[1], 0, len, len))
+                goto exception;
+        }
+        if (js_get_fast_array(ctx, obj, &arrp, &count)) {
+            for (; n < count; n++) {
+                if (js_strict_eq2(ctx, JS_DupValue(ctx, argv[0]),
+                                  JS_DupValue(ctx, arrp[n]),
+                                  JS_EQ_SAME_VALUE_ZERO)) {
+                    res = TRUE;
+                    goto done;
+                }
+            }
+        }
+        for (; n < len; n++) {
+            val = JS_GetPropertyInt64(ctx, obj, n);
+            if (JS_IsException(val))
+                goto exception;
+            if (js_strict_eq2(ctx, JS_DupValue(ctx, argv[0]), val,
+                              JS_EQ_SAME_VALUE_ZERO)) {
+                res = TRUE;
+                break;
+            }
+        }
+    }
+ done:
+    JS_FreeValue(ctx, obj);
+    return JS_NewBool(ctx, res);
+
+ exception:
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_array_indexOf(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    JSValue obj, val;
+    int64_t len, n, res;
+    JSValue *arrp;
+    uint32_t count;
+
+    obj = JS_ToObject(ctx, this_val);
+    if (js_get_length64(ctx, &len, obj))
+        goto exception;
+
+    res = -1;
+    if (len > 0) {
+        n = 0;
+        if (argc > 1) {
+            if (JS_ToInt64Clamp(ctx, &n, argv[1], 0, len, len))
+                goto exception;
+        }
+        if (js_get_fast_array(ctx, obj, &arrp, &count)) {
+            for (; n < count; n++) {
+                if (js_strict_eq2(ctx, JS_DupValue(ctx, argv[0]),
+                                  JS_DupValue(ctx, arrp[n]), JS_EQ_STRICT)) {
+                    res = n;
+                    goto done;
+                }
+            }
+        }
+        for (; n < len; n++) {
+            int present = JS_TryGetPropertyInt64(ctx, obj, n, &val);
+            if (present < 0)
+                goto exception;
+            if (present) {
+                if (js_strict_eq2(ctx, JS_DupValue(ctx, argv[0]), val, JS_EQ_STRICT)) {
+                    res = n;
+                    break;
+                }
+            }
+        }
+    }
+ done:
+    JS_FreeValue(ctx, obj);
+    return JS_NewInt64(ctx, res);
+
+ exception:
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_array_lastIndexOf(JSContext *ctx, JSValueConst this_val,
+                                    int argc, JSValueConst *argv)
+{
+    JSValue obj, val;
+    int64_t len, n, res;
+    int present;
+
+    obj = JS_ToObject(ctx, this_val);
+    if (js_get_length64(ctx, &len, obj))
+        goto exception;
+
+    res = -1;
+    if (len > 0) {
+        n = len - 1;
+        if (argc > 1) {
+            if (JS_ToInt64Clamp(ctx, &n, argv[1], -1, len - 1, len))
+                goto exception;
+        }
+        /* XXX: should special case fast arrays */
+        for (; n >= 0; n--) {
+            present = JS_TryGetPropertyInt64(ctx, obj, n, &val);
+            if (present < 0)
+                goto exception;
+            if (present) {
+                if (js_strict_eq2(ctx, JS_DupValue(ctx, argv[0]), val, JS_EQ_STRICT)) {
+                    res = n;
+                    break;
+                }
+            }
+        }
+    }
+    JS_FreeValue(ctx, obj);
+    return JS_NewInt64(ctx, res);
+
+ exception:
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_array_find(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv, int findIndex)
+{
+    JSValueConst func, this_arg;
+    JSValueConst args[3];
+    JSValue obj, val, index_val, res;
+    int64_t len, k;
+
+    index_val = JS_UNDEFINED;
+    val = JS_UNDEFINED;
+    obj = JS_ToObject(ctx, this_val);
+    if (js_get_length64(ctx, &len, obj))
+        goto exception;
+
+    func = argv[0];
+    if (check_function(ctx, func))
+        goto exception;
+
+    this_arg = JS_UNDEFINED;
+    if (argc > 1)
+        this_arg = argv[1];
+
+    for(k = 0; k < len; k++) {
+        index_val = JS_NewInt64(ctx, k);
+        if (JS_IsException(index_val))
+            goto exception;
+        val = JS_GetPropertyValue(ctx, obj, index_val);
+        if (JS_IsException(val))
+            goto exception;
+        args[0] = val;
+        args[1] = index_val;
+        args[2] = this_val;
+        res = JS_Call(ctx, func, this_arg, 3, args);
+        if (JS_IsException(res))
+            goto exception;
+        if (JS_ToBoolFree(ctx, res)) {
+            if (findIndex) {
+                JS_FreeValue(ctx, val);
+                JS_FreeValue(ctx, obj);
+                return index_val;
+            } else {
+                JS_FreeValue(ctx, index_val);
+                JS_FreeValue(ctx, obj);
+                return val;
+            }
+        }
+        JS_FreeValue(ctx, val);
+        JS_FreeValue(ctx, index_val);
+    }
+    JS_FreeValue(ctx, obj);
+    if (findIndex)
+        return JS_NewInt32(ctx, -1);
+    else
+        return JS_UNDEFINED;
+
+exception:
+    JS_FreeValue(ctx, index_val);
+    JS_FreeValue(ctx, val);
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_array_toString(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv)
+{
+    JSValue obj, method, ret;
+
+    obj = JS_ToObject(ctx, this_val);
+    if (JS_IsException(obj))
+        return JS_EXCEPTION;
+    method = JS_GetProperty(ctx, obj, JS_ATOM_join);
+    if (JS_IsException(method)) {
+        ret = JS_EXCEPTION;
+    } else
+    if (!JS_IsFunction(ctx, method)) {
+        /* Use intrinsic Object.prototype.toString */
+        JS_FreeValue(ctx, method);
+        ret = js_object_toString(ctx, obj, 0, NULL);
+    } else {
+        ret = JS_CallFree(ctx, method, obj, 0, NULL);
+    }
+    JS_FreeValue(ctx, obj);
+    return ret;
+}
+
+static JSValue js_array_join(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv, int toLocaleString)
+{
+    JSValue obj, sep = JS_UNDEFINED, el;
+    StringBuffer b_s, *b = &b_s;
+    JSString *p = NULL;
+    int64_t i, n;
+    int c;
+
+    obj = JS_ToObject(ctx, this_val);
+    if (js_get_length64(ctx, &n, obj))
+        goto exception;
+
+    c = ',';    /* default separator */
+    if (!toLocaleString && argc > 0 && !JS_IsUndefined(argv[0])) {
+        sep = JS_ToString(ctx, argv[0]);
+        if (JS_IsException(sep))
+            goto exception;
+        p = JS_VALUE_GET_STRING(sep);
+        if (p->len == 1 && !p->is_wide_char)
+            c = p->u.str8[0];
+        else
+            c = -1;
+    }
+    string_buffer_init(ctx, b, 0);
+
+    for(i = 0; i < n; i++) {
+        if (i > 0) {
+            if (c >= 0) {
+                string_buffer_putc8(b, c);
+            } else {
+                string_buffer_concat(b, p, 0, p->len);
+            }
+        }
+        el = JS_GetPropertyUint32(ctx, obj, i);
+        if (JS_IsException(el))
+            goto fail;
+        if (!JS_IsNull(el) && !JS_IsUndefined(el)) {
+            if (toLocaleString) {
+                el = JS_ToLocaleStringFree(ctx, el);
+            }
+            if (string_buffer_concat_value_free(b, el))
+                goto fail;
+        }
+    }
+    JS_FreeValue(ctx, sep);
+    JS_FreeValue(ctx, obj);
+    return string_buffer_end(b);
+
+fail:
+    string_buffer_free(b);
+    JS_FreeValue(ctx, sep);
+exception:
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_array_pop(JSContext *ctx, JSValueConst this_val,
+                            int argc, JSValueConst *argv, int shift)
+{
+    JSValue obj, res = JS_UNDEFINED;
+    int64_t len, newLen;
+    JSValue *arrp;
+    uint32_t count32;
+
+    obj = JS_ToObject(ctx, this_val);
+    if (js_get_length64(ctx, &len, obj))
+        goto exception;
+    newLen = 0;
+    if (len > 0) {
+        newLen = len - 1;
+        /* Special case fast arrays */
+        if (js_get_fast_array(ctx, obj, &arrp, &count32) && count32 == len) {
+            JSObject *p = JS_VALUE_GET_OBJ(obj);
+            if (shift) {
+                res = arrp[0];
+                memmove(arrp, arrp + 1, (count32 - 1) * sizeof(*arrp));
+                p->u.array.count--;
+            } else {
+                res = arrp[count32 - 1];
+                p->u.array.count--;
+            }
+        } else {
+            if (shift) {
+                res = JS_GetPropertyInt64(ctx, obj, 0);
+                if (JS_IsException(res))
+                    goto exception;
+                if (JS_CopySubArray(ctx, obj, 0, 1, len - 1, +1))
+                    goto exception;
+            } else {
+                res = JS_GetPropertyInt64(ctx, obj, newLen);
+                if (JS_IsException(res))
+                    goto exception;
+            }
+            if (JS_DeletePropertyInt64(ctx, obj, newLen, JS_PROP_THROW) < 0)
+                goto exception;
+        }
+    }
+    if (JS_SetProperty(ctx, obj, JS_ATOM_length, JS_NewInt64(ctx, newLen)) < 0)
+        goto exception;
+
+    JS_FreeValue(ctx, obj);
+    return res;
+
+ exception:
+    JS_FreeValue(ctx, res);
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_array_push(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv, int unshift)
+{
+    JSValue obj;
+    int i;
+    int64_t len, from, newLen;
+
+    obj = JS_ToObject(ctx, this_val);
+    if (js_get_length64(ctx, &len, obj))
+        goto exception;
+    newLen = len + argc;
+    if (newLen > MAX_SAFE_INTEGER) {
+        JS_ThrowTypeError(ctx, "Array loo long");
+        goto exception;
+    }
+    from = len;
+    if (unshift && argc > 0) {
+        if (JS_CopySubArray(ctx, obj, argc, 0, len, -1))
+            goto exception;
+        from = 0;
+    }
+    for(i = 0; i < argc; i++) {
+        if (JS_SetPropertyInt64(ctx, obj, from + i,
+                                JS_DupValue(ctx, argv[i])) < 0)
+            goto exception;
+    }
+    if (JS_SetProperty(ctx, obj, JS_ATOM_length, JS_NewInt64(ctx, newLen)) < 0)
+        goto exception;
+
+    JS_FreeValue(ctx, obj);
+    return JS_NewInt64(ctx, newLen);
+
+ exception:
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_array_reverse(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    JSValue obj, lval, hval;
+    JSValue *arrp;
+    int64_t len, l, h;
+    int l_present, h_present;
+    uint32_t count32;
+
+    lval = JS_UNDEFINED;
+    obj = JS_ToObject(ctx, this_val);
+    if (js_get_length64(ctx, &len, obj))
+        goto exception;
+
+    /* Special case fast arrays */
+    if (js_get_fast_array(ctx, obj, &arrp, &count32) && count32 == len) {
+        uint32_t ll, hh;
+
+        if (count32 > 1) {
+            for (ll = 0, hh = count32 - 1; ll < hh; ll++, hh--) {
+                lval = arrp[ll];
+                arrp[ll] = arrp[hh];
+                arrp[hh] = lval;
+            }
+        }
+        return obj;
+    }
+
+    for (l = 0, h = len - 1; l < h; l++, h--) {
+        l_present = JS_TryGetPropertyInt64(ctx, obj, l, &lval);
+        if (l_present < 0)
+            goto exception;
+        h_present = JS_TryGetPropertyInt64(ctx, obj, h, &hval);
+        if (h_present < 0)
+            goto exception;
+        if (h_present) {
+            if (JS_SetPropertyInt64(ctx, obj, l, hval) < 0)
+                goto exception;
+
+            if (l_present) {
+                if (JS_SetPropertyInt64(ctx, obj, h, lval) < 0) {
+                    lval = JS_UNDEFINED;
+                    goto exception;
+                }
+                lval = JS_UNDEFINED;
+            } else {
+                if (JS_DeletePropertyInt64(ctx, obj, h, JS_PROP_THROW) < 0)
+                    goto exception;
+            }
+        } else {
+            if (l_present) {
+                if (JS_DeletePropertyInt64(ctx, obj, l, JS_PROP_THROW) < 0)
+                    goto exception;
+                if (JS_SetPropertyInt64(ctx, obj, h, lval) < 0) {
+                    lval = JS_UNDEFINED;
+                    goto exception;
+                }
+                lval = JS_UNDEFINED;
+            }
+        }
+    }
+    return obj;
+
+ exception:
+    JS_FreeValue(ctx, lval);
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_array_slice(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv, int splice)
+{
+    JSValue obj, arr, val, len_val;
+    int64_t len, start, k, final, n, count, del_count, new_len;
+    int kPresent;
+    JSValue *arrp;
+    uint32_t count32, i, item_count;
+
+    arr = JS_UNDEFINED;
+    obj = JS_ToObject(ctx, this_val);
+    if (js_get_length64(ctx, &len, obj))
+        goto exception;
+
+    if (JS_ToInt64Clamp(ctx, &start, argv[0], 0, len, len))
+        goto exception;
+
+    if (splice) {
+        if (argc == 0) {
+            item_count = 0;
+            del_count = 0;
+        } else
+        if (argc == 1) {
+            item_count = 0;
+            del_count = len - start;
+        } else {
+            item_count = argc - 2;
+            if (JS_ToInt64Clamp(ctx, &del_count, argv[1], 0, len - start, 0))
+                goto exception;
+        }
+        if (len + item_count - del_count > MAX_SAFE_INTEGER) {
+            JS_ThrowTypeError(ctx, "Array loo long");
+            goto exception;
+        }
+        count = del_count;
+    } else {
+        item_count = 0; /* avoid warning */
+        final = len;
+        if (!JS_IsUndefined(argv[1])) {
+            if (JS_ToInt64Clamp(ctx, &final, argv[1], 0, len, len))
+                goto exception;
+        }
+        count = max_int64(final - start, 0);
+    }
+    len_val = JS_NewInt64(ctx, count);
+    arr = JS_ArraySpeciesCreate(ctx, obj, len_val);
+    JS_FreeValue(ctx, len_val);
+    if (JS_IsException(arr))
+        goto exception;
+
+    k = start;
+    final = start + count;
+    n = 0;
+    /* Special case fast arrays */
+    if (js_get_fast_array(ctx, obj, &arrp, &count32)) {
+        /* XXX: should share code with fast array constructor */
+        /* XXX: this may crash if the new array has a custom property
+           handler that modifies the original array */
+        for (; k < final && k < count32; k++, n++) {
+            if (JS_CreateDataPropertyUint32(ctx, arr, n, JS_DupValue(ctx, arrp[k]), JS_PROP_THROW) < 0)
+                goto exception;
+        }
+    }
+    /* Copy the remaining elements if any (handle case of inherited properties) */
+    for (; k < final; k++, n++) {
+        kPresent = JS_TryGetPropertyInt64(ctx, obj, k, &val);
+        if (kPresent < 0)
+            goto exception;
+        if (kPresent) {
+            if (JS_CreateDataPropertyUint32(ctx, arr, n, val, JS_PROP_THROW) < 0)
+                goto exception;
+        }
+    }
+    if (JS_SetProperty(ctx, arr, JS_ATOM_length, JS_NewInt64(ctx, n)) < 0)
+        goto exception;
+
+    if (splice) {
+        new_len = len + item_count - del_count;
+        if (item_count != del_count) {
+            if (JS_CopySubArray(ctx, obj, start + item_count,
+                                start + del_count, len - (start + del_count),
+                                item_count <= del_count ? +1 : -1) < 0)
+                goto exception;
+
+            for (k = len; k-- > new_len; ) {
+                if (JS_DeletePropertyInt64(ctx, obj, k, JS_PROP_THROW) < 0)
+                    goto exception;
+            }
+        }
+        for (i = 0; i < item_count; i++) {
+            if (JS_SetPropertyInt64(ctx, obj, start + i, JS_DupValue(ctx, argv[i + 2])) < 0)
+                goto exception;
+        }
+        if (JS_SetProperty(ctx, obj, JS_ATOM_length, JS_NewInt64(ctx, new_len)) < 0)
+            goto exception;
+    }
+    JS_FreeValue(ctx, obj);
+    return arr;
+
+ exception:
+    JS_FreeValue(ctx, obj);
+    JS_FreeValue(ctx, arr);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_array_copyWithin(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv)
+{
+    JSValue obj;
+    int64_t len, from, to, final, count;
+
+    obj = JS_ToObject(ctx, this_val);
+    if (js_get_length64(ctx, &len, obj))
+        goto exception;
+
+    if (JS_ToInt64Clamp(ctx, &to, argv[0], 0, len, len))
+        goto exception;
+
+    if (JS_ToInt64Clamp(ctx, &from, argv[1], 0, len, len))
+        goto exception;
+
+    final = len;
+    if (argc > 2 && !JS_IsUndefined(argv[2])) {
+        if (JS_ToInt64Clamp(ctx, &final, argv[2], 0, len, len))
+            goto exception;
+    }
+
+    count = min_int64(final - from, len - to);
+
+    if (JS_CopySubArray(ctx, obj, to, from, count,
+                        (from < to && to < from + count) ? -1 : +1))
+        goto exception;
+
+    return obj;
+
+ exception:
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+static int64_t JS_FlattenIntoArray(JSContext *ctx, JSValueConst target,
+                                   JSValueConst source, int64_t sourceLen,
+                                   int64_t targetIndex, int depth,
+                                   JSValueConst mapperFunction,
+                                   JSValueConst thisArg)
+{
+    JSValue element;
+    int64_t sourceIndex, elementLen;
+    int present, is_array;
+
+    for (sourceIndex = 0; sourceIndex < sourceLen; sourceIndex++) {
+        present = JS_TryGetPropertyInt64(ctx, source, sourceIndex, &element);
+        if (present < 0)
+            return -1;
+        if (!present)
+            continue;
+        if (!JS_IsUndefined(mapperFunction)) {
+            JSValueConst args[3] = { element, JS_NewInt64(ctx, sourceIndex), source };
+            element = JS_Call(ctx, mapperFunction, thisArg, 3, args);
+            JS_FreeValue(ctx, CastToJSValue(args[0]));
+            JS_FreeValue(ctx, CastToJSValue(args[1]));
+            if (JS_IsException(element))
+                return -1;
+        }
+        if (depth > 0) {
+            is_array = JS_IsArray(ctx, element);
+            if (is_array < 0)
+                goto fail;
+            if (is_array) {
+                if (js_get_length64(ctx, &elementLen, element) < 0)
+                    goto fail;
+                targetIndex = JS_FlattenIntoArray(ctx, target, element,
+                                                  elementLen, targetIndex,
+                                                  depth - 1,
+                                                  JS_UNDEFINED, JS_UNDEFINED);
+                if (targetIndex < 0)
+                    goto fail;
+                JS_FreeValue(ctx, element);
+                continue;
+            }
+        }
+        if (targetIndex >= MAX_SAFE_INTEGER) {
+            JS_ThrowTypeError(ctx, "Array too long");
+            goto fail;
+        }
+        if (JS_SetPropertyInt64(ctx, target, targetIndex, element) < 0)
+            return -1;
+        targetIndex++;
+    }
+    return targetIndex;
+
+fail:
+    JS_FreeValue(ctx, element);
+    return -1;
+}
+
+static JSValue js_array_flatten(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv, int map)
+{
+    JSValue obj, arr;
+    JSValueConst mapperFunction, thisArg;
+    int64_t sourceLen;
+    int depthNum;
+
+    arr = JS_UNDEFINED;
+    obj = JS_ToObject(ctx, this_val);
+    if (js_get_length64(ctx, &sourceLen, obj))
+        goto exception;
+
+    depthNum = 1;
+    mapperFunction = JS_UNDEFINED;
+    thisArg = JS_UNDEFINED;
+    if (map) {
+        mapperFunction = argv[0];
+        if (argc > 1) {
+            thisArg = argv[1];
+        }
+        if (check_function(ctx, mapperFunction))
+            goto exception;
+    } else {
+        if (argc > 0 && !JS_IsUndefined(argv[0])) {
+            if (JS_ToInt32Sat(ctx, &depthNum, argv[0]) < 0)
+                goto exception;
+        }
+    }
+    arr = JS_ArraySpeciesCreate(ctx, obj, JS_NewInt32(ctx, 0));
+    if (JS_IsException(arr))
+        goto exception;
+    if (JS_FlattenIntoArray(ctx, arr, obj, sourceLen, 0, depthNum,
+                            mapperFunction, thisArg) < 0)
+        goto exception;
+    JS_FreeValue(ctx, obj);
+    return arr;
+
+exception:
+    JS_FreeValue(ctx, obj);
+    JS_FreeValue(ctx, arr);
+    return JS_EXCEPTION;
+}
+
+/* Array sort */
+
+typedef struct ValueSlot {
+    JSValue val;
+    JSString *str;
+    int64_t pos;
+} ValueSlot;
+
+struct array_sort_context {
+    JSContext *ctx;
+    int exception;
+    int has_method;
+    JSValueConst method;
+};
+
+static int js_array_cmp_generic(const void *a, const void *b, void *opaque) {
+    struct array_sort_context *psc = opaque;
+    JSContext *ctx = psc->ctx;
+    JSValueConst argv[2];
+    JSValue res;
+    ValueSlot *ap = (ValueSlot *)(void *)a;
+    ValueSlot *bp = (ValueSlot *)(void *)b;
+    int cmp;
+
+    if (psc->exception)
+        return 0;
+
+    if (psc->has_method) {
+        /* custom sort function is specified as returning 0 for identical
+         * objects: avoid method call overhead.
+         */
+        if (!memcmp(&ap->val, &bp->val, sizeof(ap->val)))
+            goto cmp_same;
+        argv[0] = ap->val;
+        argv[1] = bp->val;
+        res = JS_Call(ctx, psc->method, JS_UNDEFINED, 2, argv);
+        if (JS_IsException(res))
+            goto exception;
+        if (JS_VALUE_GET_TAG(res) == JS_TAG_INT) {
+            int val = JS_VALUE_GET_INT(res);
+            cmp = (val > 0) - (val < 0);
+        } else {
+            double val;
+            if (JS_ToFloat64Free(ctx, &val, res) < 0)
+                goto exception;
+            cmp = (val > 0) - (val < 0);
+        }
+    } else {
+        /* Not supposed to bypass ToString even for identical objects as
+         * tested in test262/test/built-ins/Array/prototype/sort/bug_596_1.js
+         */
+        if (!ap->str) {
+            JSValue str = JS_ToString(ctx, ap->val);
+            if (JS_IsException(str))
+                goto exception;
+            ap->str = JS_VALUE_GET_STRING(str);
+        }
+        if (!bp->str) {
+            JSValue str = JS_ToString(ctx, bp->val);
+            if (JS_IsException(str))
+                goto exception;
+            bp->str = JS_VALUE_GET_STRING(str);
+        }
+        cmp = js_string_compare(ctx, ap->str, bp->str);
+    }
+    if (cmp != 0)
+        return cmp;
+cmp_same:
+    /* make sort stable: compare array offsets */
+    return (ap->pos > bp->pos) - (ap->pos < bp->pos);
+
+exception:
+    psc->exception = 1;
+    return 0;
+}
+
+static JSValue js_array_sort(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv)
+{
+    struct array_sort_context asc = { ctx, 0, 0, argv[0] };
+    JSValue obj = JS_UNDEFINED;
+    ValueSlot *array = NULL;
+    size_t array_size = 0, pos = 0, n = 0;
+    int64_t i, len, undefined_count = 0;
+    int present;
+
+    if (!JS_IsUndefined(asc.method)) {
+        if (check_function(ctx, asc.method))
+            goto exception;
+        asc.has_method = 1;
+    }
+    obj = JS_ToObject(ctx, this_val);
+    if (js_get_length64(ctx, &len, obj))
+        goto exception;
+
+    /* XXX: should special case fast arrays */
+    for (i = 0; i < len; i++) {
+        if (pos >= array_size) {
+            size_t new_size, slack;
+            ValueSlot *new_array;
+            new_size = (array_size + (array_size >> 1) + 31) & ~15;
+            new_array = js_realloc2(ctx, array, new_size * sizeof(*array), &slack);
+            if (new_array == NULL)
+                goto exception;
+            new_size += slack / sizeof(*new_array);
+            array = new_array;
+            array_size = new_size;
+        }
+        present = JS_TryGetPropertyInt64(ctx, obj, i, &array[pos].val);
+        if (present < 0)
+            goto exception;
+        if (present == 0)
+            continue;
+        if (JS_IsUndefined(array[pos].val)) {
+            undefined_count++;
+            continue;
+        }
+        array[pos].str = NULL;
+        array[pos].pos = i;
+        pos++;
+    }
+    rqsort(array, pos, sizeof(*array), js_array_cmp_generic, &asc);
+    if (asc.exception)
+        goto exception;
+
+    /* XXX: should special case fast arrays */
+    while (n < pos) {
+        if (array[n].str)
+            JS_FreeValue(ctx, JS_MKPTR(JS_TAG_STRING, array[n].str));
+        if (array[n].pos == n) {
+            JS_FreeValue(ctx, array[n].val);
+        } else {
+            if (JS_SetPropertyInt64(ctx, obj, n, array[n].val) < 0) {
+                n++;
+                goto exception;
+            }
+        }
+        n++;
+    }
+    js_free(ctx, array);
+    for (i = n; undefined_count-- > 0; i++) {
+        if (JS_SetPropertyInt64(ctx, obj, i, JS_UNDEFINED) < 0)
+            goto fail;
+    }
+    for (; i < len; i++) {
+        if (JS_DeletePropertyInt64(ctx, obj, i, JS_PROP_THROW) < 0)
+            goto fail;
+    }
+    return obj;
+
+exception:
+    for (n = 0; n < pos; n++) {
+        JS_FreeValue(ctx, array[n].val);
+        if (array[n].str)
+            JS_FreeValue(ctx, JS_MKPTR(JS_TAG_STRING, array[n].str));
+    }
+    js_free(ctx, array);
+fail:
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+typedef struct JSArrayIteratorData {
+    JSValue obj;
+    JSIteratorKindEnum kind;
+    uint32_t idx;
+} JSArrayIteratorData;
+
+static void js_array_iterator_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    JSArrayIteratorData *it = p->u.array_iterator_data;
+    if (it) {
+        JS_FreeValueRT(rt, it->obj);
+        js_free_rt(rt, it);
+    }
+}
+
+static void js_array_iterator_mark(JSRuntime *rt, JSValueConst val,
+                                   JS_MarkFunc *mark_func)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    JSArrayIteratorData *it = p->u.array_iterator_data;
+    if (it) {
+        JS_MarkValue(rt, it->obj, mark_func);
+    }
+}
+
+static JSValue js_create_array(JSContext *ctx, int len, JSValueConst *tab)
+{
+    JSValue obj;
+    int i;
+
+    obj = JS_NewArray(ctx);
+    if (JS_IsException(obj))
+        return JS_EXCEPTION;
+    for(i = 0; i < len; i++) {
+        if (JS_CreateDataPropertyUint32(ctx, obj, i, JS_DupValue(ctx, tab[i]), 0) < 0) {
+            JS_FreeValue(ctx, obj);
+            return JS_EXCEPTION;
+        }
+    }
+    return obj;
+}
+
+static JSValue js_create_array_iterator(JSContext *ctx, JSValueConst this_val,
+                                        int argc, JSValueConst *argv, int magic)
+{
+    JSValue enum_obj, arr;
+    JSArrayIteratorData *it;
+    JSIteratorKindEnum kind;
+    int class_id;
+
+    kind = magic & 3;
+    if (magic & 4) {
+        /* string iterator case */
+        arr = JS_ToStringCheckObject(ctx, this_val);
+        class_id = JS_CLASS_STRING_ITERATOR;
+    } else {
+        arr = JS_ToObject(ctx, this_val);
+        class_id = JS_CLASS_ARRAY_ITERATOR;
+    }
+    if (JS_IsException(arr))
+        goto fail;
+    enum_obj = JS_NewObjectClass(ctx, class_id);
+    if (JS_IsException(enum_obj))
+        goto fail;
+    it = js_malloc(ctx, sizeof(*it));
+    if (!it)
+        goto fail1;
+    it->obj = arr;
+    it->kind = kind;
+    it->idx = 0;
+    JS_SetOpaque(enum_obj, it);
+    return enum_obj;
+ fail1:
+    JS_FreeValue(ctx, enum_obj);
+ fail:
+    JS_FreeValue(ctx, arr);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_array_iterator_next(JSContext *ctx, JSValueConst this_val,
+                                      int argc, JSValueConst *argv,
+                                      BOOL *pdone, int magic)
+{
+    JSArrayIteratorData *it;
+    uint32_t len, idx;
+    JSValue val, obj;
+    JSObject *p;
+
+    it = JS_GetOpaque2(ctx, this_val, JS_CLASS_ARRAY_ITERATOR);
+    if (!it)
+        goto fail1;
+    if (JS_IsUndefined(it->obj))
+        goto done;
+    p = JS_VALUE_GET_OBJ(it->obj);
+    if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+        p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+        if (typed_array_is_detached(ctx, p)) {
+            JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+            goto fail1;
+        }
+        len = p->u.array.count;
+    } else {
+        if (js_get_length32(ctx, &len, it->obj)) {
+        fail1:
+            *pdone = FALSE;
+            return JS_EXCEPTION;
+        }
+    }
+    idx = it->idx;
+    if (idx >= len) {
+        JS_FreeValue(ctx, it->obj);
+        it->obj = JS_UNDEFINED;
+    done:
+        *pdone = TRUE;
+        return JS_UNDEFINED;
+    }
+    it->idx = idx + 1;
+    *pdone = FALSE;
+    if (it->kind == JS_ITERATOR_KIND_KEY) {
+        return JS_NewUint32(ctx, idx);
+    } else {
+        val = JS_GetPropertyUint32(ctx, it->obj, idx);
+        if (JS_IsException(val))
+            return JS_EXCEPTION;
+        if (it->kind == JS_ITERATOR_KIND_VALUE) {
+            return val;
+        } else {
+            JSValueConst args[2];
+            JSValue num;
+            num = JS_NewUint32(ctx, idx);
+            args[0] = num;
+            args[1] = val;
+            obj = js_create_array(ctx, 2, args);
+            JS_FreeValue(ctx, val);
+            JS_FreeValue(ctx, num);
+            return obj;
+        }
+    }
+}
+
+static JSValue js_iterator_proto_iterator(JSContext *ctx, JSValueConst this_val,
+                                          int argc, JSValueConst *argv)
+{
+    return JS_DupValue(ctx, this_val);
+}
+
+static const JSCFunctionListEntry js_iterator_proto_funcs[] = {
+    JS_CFUNC_DEF("[Symbol.iterator]", 0, js_iterator_proto_iterator ),
+};
+
+static const JSCFunctionListEntry js_array_proto_funcs[] = {
+    JS_CFUNC_DEF("concat", 1, js_array_concat ),
+    JS_CFUNC_MAGIC_DEF("every", 1, js_array_every, special_every ),
+    JS_CFUNC_MAGIC_DEF("some", 1, js_array_every, special_some ),
+    JS_CFUNC_MAGIC_DEF("forEach", 1, js_array_every, special_forEach ),
+    JS_CFUNC_MAGIC_DEF("map", 1, js_array_every, special_map ),
+    JS_CFUNC_MAGIC_DEF("filter", 1, js_array_every, special_filter ),
+    JS_CFUNC_MAGIC_DEF("reduce", 1, js_array_reduce, special_reduce ),
+    JS_CFUNC_MAGIC_DEF("reduceRight", 1, js_array_reduce, special_reduceRight ),
+    JS_CFUNC_DEF("fill", 1, js_array_fill ),
+    JS_CFUNC_MAGIC_DEF("find", 1, js_array_find, 0 ),
+    JS_CFUNC_MAGIC_DEF("findIndex", 1, js_array_find, 1 ),
+    JS_CFUNC_DEF("indexOf", 1, js_array_indexOf ),
+    JS_CFUNC_DEF("lastIndexOf", 1, js_array_lastIndexOf ),
+    JS_CFUNC_DEF("includes", 1, js_array_includes ),
+    JS_CFUNC_MAGIC_DEF("join", 1, js_array_join, 0 ),
+    JS_CFUNC_DEF("toString", 0, js_array_toString ),
+    JS_CFUNC_MAGIC_DEF("toLocaleString", 0, js_array_join, 1 ),
+    JS_CFUNC_MAGIC_DEF("pop", 0, js_array_pop, 0 ),
+    JS_CFUNC_MAGIC_DEF("push", 1, js_array_push, 0 ),
+    JS_CFUNC_MAGIC_DEF("shift", 0, js_array_pop, 1 ),
+    JS_CFUNC_MAGIC_DEF("unshift", 1, js_array_push, 1 ),
+    JS_CFUNC_DEF("reverse", 0, js_array_reverse ),
+    JS_CFUNC_DEF("sort", 1, js_array_sort ),
+    JS_CFUNC_MAGIC_DEF("slice", 2, js_array_slice, 0 ),
+    JS_CFUNC_MAGIC_DEF("splice", 2, js_array_slice, 1 ),
+    JS_CFUNC_DEF("copyWithin", 2, js_array_copyWithin ),
+    JS_CFUNC_MAGIC_DEF("flatMap", 1, js_array_flatten, 1 ),
+    JS_CFUNC_MAGIC_DEF("flat", 0, js_array_flatten, 0 ),
+    JS_CFUNC_MAGIC_DEF("flatten", 0, js_array_flatten, 0 ),
+    JS_CFUNC_MAGIC_DEF("values", 0, js_create_array_iterator, JS_ITERATOR_KIND_VALUE ),
+    JS_ALIAS_DEF("[Symbol.iterator]", "values" ),
+    JS_CFUNC_MAGIC_DEF("keys", 0, js_create_array_iterator, JS_ITERATOR_KIND_KEY ),
+    JS_CFUNC_MAGIC_DEF("entries", 0, js_create_array_iterator, JS_ITERATOR_KIND_KEY_AND_VALUE ),
+};
+
+static const JSCFunctionListEntry js_array_iterator_proto_funcs[] = {
+    JS_ITERATOR_NEXT_DEF("next", 0, js_array_iterator_next, 0 ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "Array Iterator", JS_PROP_CONFIGURABLE ),
+};
+
+/* Number */
+
+static JSValue js_number_constructor(JSContext *ctx, JSValueConst new_target,
+                                     int argc, JSValueConst *argv)
+{
+    JSValue val, obj;
+#ifdef CONFIG_BIGNUM
+    if (argc == 0) {
+        if (is_bignum_mode(ctx))
+            val = __JS_NewFloat64(ctx, 0);
+        else
+            val = JS_NewInt32(ctx, 0);
+    } else {
+        val = JS_ToNumeric(ctx, argv[0]);
+        if (JS_IsException(val))
+            return val;
+        switch(JS_VALUE_GET_TAG(val)) {
+        case JS_TAG_BIG_INT:
+        case JS_TAG_BIG_FLOAT:
+            {
+                JSBigFloat *p = JS_VALUE_GET_PTR(val);
+                double d;
+                bf_get_float64(&p->num, &d, BF_RNDN);
+                JS_FreeValue(ctx, val);
+                val = __JS_NewFloat64(ctx, d);
+            }
+            break;
+        case JS_TAG_INT:
+            if (is_bignum_mode(ctx)) {
+                /* always return a number in bignum mode */
+                val = __JS_NewFloat64(ctx, JS_VALUE_GET_INT(val));
+            }
+            break;
+        default:
+            break;
+        }
+    }
+#else
+    if (argc == 0) {
+        val = JS_NewInt32(ctx, 0);
+    } else {
+        val = JS_ToNumber(ctx, argv[0]);
+        if (JS_IsException(val))
+            return val;
+    }
+#endif
+    if (!JS_IsUndefined(new_target)) {
+        obj = js_create_from_ctor(ctx, new_target, JS_CLASS_NUMBER);
+        if (!JS_IsException(obj))
+            JS_SetObjectData(ctx, obj, val);
+        return obj;
+    } else {
+        return val;
+    }
+}
+
+#if 0
+static JSValue js_number___toInteger(JSContext *ctx, JSValueConst this_val,
+                                     int argc, JSValueConst *argv)
+{
+    return JS_ToIntegerFree(ctx, JS_DupValue(ctx, argv[0]));
+}
+
+static JSValue js_number___toLength(JSContext *ctx, JSValueConst this_val,
+                                    int argc, JSValueConst *argv)
+{
+    int64_t v;
+    if (JS_ToLengthFree(ctx, &v, JS_DupValue(ctx, argv[0])))
+        return JS_EXCEPTION;
+    return JS_NewInt64(ctx, v);
+}
+#endif
+
+static JSValue js_number_isNaN(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv)
+{
+    /* XXX: should just check for float and big_float */
+    if (!JS_IsNumber(argv[0]))
+        return JS_FALSE;
+    return js_global_isNaN(ctx, this_val, argc, argv);
+}
+
+static JSValue js_number_isFinite(JSContext *ctx, JSValueConst this_val,
+                                  int argc, JSValueConst *argv)
+{
+    if (!JS_IsNumber(argv[0]))
+        return JS_FALSE;
+    return js_global_isFinite(ctx, this_val, argc, argv);
+}
+
+static JSValue js_number_isInteger(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv)
+{
+    int ret;
+    ret = JS_NumberIsInteger(ctx, argv[0]);
+    if (ret < 0)
+        return JS_EXCEPTION;
+    else
+        return JS_NewBool(ctx, ret);
+}
+
+static JSValue js_number_isSafeInteger(JSContext *ctx, JSValueConst this_val,
+                                       int argc, JSValueConst *argv)
+{
+    double d;
+    if (!JS_IsNumber(argv[0]))
+        return JS_FALSE;
+    if (unlikely(JS_ToFloat64(ctx, &d, argv[0])))
+        return JS_EXCEPTION;
+    return JS_NewBool(ctx, isfinite(d) && floor(d) == d &&
+                      fabs(d) <= (double)MAX_SAFE_INTEGER);
+}
+
+static const JSCFunctionListEntry js_number_funcs[] = {
+    /* global ParseInt and parseFloat should be defined already or delayed */
+    JS_ALIAS_BASE_DEF("parseInt", "parseInt", 0 ),
+    JS_ALIAS_BASE_DEF("parseFloat", "parseFloat", 0 ),
+    JS_CFUNC_DEF("isNaN", 1, js_number_isNaN ),
+    JS_CFUNC_DEF("isFinite", 1, js_number_isFinite ),
+    JS_CFUNC_DEF("isInteger", 1, js_number_isInteger ),
+    JS_CFUNC_DEF("isSafeInteger", 1, js_number_isSafeInteger ),
+    JS_PROP_DOUBLE_DEF("MAX_VALUE", 1.7976931348623157e+308, 0 ),
+    JS_PROP_DOUBLE_DEF("MIN_VALUE", 5e-324, 0 ),
+    JS_PROP_DOUBLE_DEF("NaN", NAN, 0 ),
+    JS_PROP_DOUBLE_DEF("NEGATIVE_INFINITY", -INFINITY, 0 ),
+    JS_PROP_DOUBLE_DEF("POSITIVE_INFINITY", INFINITY, 0 ),
+    JS_PROP_DOUBLE_DEF("EPSILON", 2.220446049250313e-16, 0 ), /* ES6 */
+    JS_PROP_DOUBLE_DEF("MAX_SAFE_INTEGER", 9007199254740991.0, 0 ), /* ES6 */
+    JS_PROP_DOUBLE_DEF("MIN_SAFE_INTEGER", -9007199254740991.0, 0 ), /* ES6 */
+    //JS_CFUNC_DEF("__toInteger", 1, js_number___toInteger ),
+    //JS_CFUNC_DEF("__toLength", 1, js_number___toLength ),
+};
+
+static JSValue js_thisNumberValue(JSContext *ctx, JSValueConst this_val)
+{
+    if (JS_IsNumber(this_val))
+        return JS_DupValue(ctx, this_val);
+
+    if (JS_VALUE_GET_TAG(this_val) == JS_TAG_OBJECT) {
+        JSObject *p = JS_VALUE_GET_OBJ(this_val);
+        if (p->class_id == JS_CLASS_NUMBER) {
+            if (JS_IsNumber(p->u.object_data))
+                return JS_DupValue(ctx, p->u.object_data);
+        }
+    }
+    return JS_ThrowTypeError(ctx, "not a number");
+}
+
+static JSValue js_number_valueOf(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv)
+{
+    return js_thisNumberValue(ctx, this_val);
+}
+
+static JSValue js_number_toString(JSContext *ctx, JSValueConst this_val,
+                                  int argc, JSValueConst *argv, int magic)
+{
+    JSValue val;
+    int base;
+
+    val = js_thisNumberValue(ctx, this_val);
+    if (JS_IsException(val))
+        return val;
+    if (magic || JS_IsUndefined(argv[0])) {
+        base = 10;
+    } else {
+        if (JS_ToInt32Sat(ctx, &base, argv[0]))
+            goto fail;
+        if (base < 2 || base > 36) {
+            JS_ThrowRangeError(ctx, "radix must be between 2 and 36");
+            goto fail;
+        }
+    }
+#ifdef CONFIG_BIGNUM
+    {
+        JSValue ret = js_ftoa(ctx, val, base, 0, BF_RNDN | BF_FTOA_FORMAT_FREE_MIN);
+        JS_FreeValue(ctx, val);
+        return ret;
+    }
+#else
+    {
+        double d;
+        if (JS_ToFloat64Free(ctx, &d, val))
+            return JS_EXCEPTION;
+        return js_dtoa(ctx, d, base, 0, JS_DTOA_VAR_FORMAT);
+    }
+#endif
+ fail:
+    JS_FreeValue(ctx, val);
+    return JS_EXCEPTION;
+}
+
+#ifdef CONFIG_BIGNUM
+
+static JSValue js_thisBigFloatValue(JSContext *ctx, JSValueConst this_val);
+
+static int64_t js_number_get_prec_max(JSContext *ctx, int magic)
+{
+    if (magic)
+        return BF_PREC_MAX;
+    else
+        return 100;
+}
+
+static int get_rnd_mode(JSContext *ctx, JSValueConst val)
+{
+    int rnd_mode;
+    if (JS_ToInt32Sat(ctx, &rnd_mode, val))
+        return -1;
+    if (rnd_mode < BF_RNDN || rnd_mode > BF_RNDF) {
+        JS_ThrowRangeError(ctx, "invalid rounding mode");
+        return -1;
+    }
+    return rnd_mode;
+}
+
+static JSValue js_number_toFixed(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv, int magic)
+{
+    JSValue val, ret;
+    int64_t f;
+    int res, rnd_mode;
+    bf_t a_s, *a, b;
+    BOOL is_float;
+
+    if (magic)
+        val = js_thisBigFloatValue(ctx, this_val);
+    else
+        val = js_thisNumberValue(ctx, this_val);
+    if (JS_IsException(val))
+        return val;
+    if (JS_ToInt64Sat(ctx, &f, argv[0]))
+        goto fail;
+    if (f < 0 || f > js_number_get_prec_max(ctx, magic)) {
+        JS_ThrowRangeError(ctx, "invalid number of digits");
+        goto fail;
+    }
+    rnd_mode = BF_RNDNA;
+    if (magic && argc > 1) {
+        rnd_mode = get_rnd_mode(ctx, argv[1]);
+        if (rnd_mode < 0)
+            goto fail;
+    }
+
+    a = JS_ToBigFloat(ctx, &is_float, &a_s, val);
+    if (!a)
+        goto fail;
+    bf_init(ctx->bf_ctx, &b);
+    bf_set_float64(&b, 1e21);
+    res = bf_cmpu(a, &b);
+    bf_delete(&b);
+    if (a == &a_s)
+        bf_delete(a);
+    if (res >= 0) {
+        ret = JS_ToString(ctx, val);
+    } else {
+        ret = js_ftoa(ctx, val, 10, f, rnd_mode | BF_FTOA_FORMAT_FRAC);
+    }
+    JS_FreeValue(ctx, val);
+    return ret;
+ fail:
+    JS_FreeValue(ctx, val);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_number_toExponential(JSContext *ctx, JSValueConst this_val,
+                                       int argc, JSValueConst *argv, int magic)
+{
+    JSValue val, ret;
+    int64_t f;
+    int rnd_mode;
+
+    if (magic)
+        val = js_thisBigFloatValue(ctx, this_val);
+    else
+        val = js_thisNumberValue(ctx, this_val);
+    if (JS_IsException(val))
+        return val;
+    if (JS_ToInt64Sat(ctx, &f, argv[0]))
+        goto fail;
+    if (!js_number_is_finite(ctx, val)) {
+        ret = JS_ToString(ctx, val);
+    } else if (JS_IsUndefined(argv[0])) {
+        ret = js_ftoa(ctx, val, 10, 0,
+                      BF_RNDN | BF_FTOA_FORMAT_FREE_MIN | BF_FTOA_FORCE_EXP);
+    } else {
+        if (f < 0 || f > js_number_get_prec_max(ctx, magic)) {
+            JS_ThrowRangeError(ctx, "invalid number of digits");
+            goto fail;
+        }
+        rnd_mode = BF_RNDNA;
+        if (magic && argc > 1) {
+            rnd_mode = get_rnd_mode(ctx, argv[1]);
+            if (rnd_mode < 0)
+                goto fail;
+        }
+        ret = js_ftoa(ctx, val, 10, f + 1,
+                      rnd_mode | BF_FTOA_FORMAT_FIXED | BF_FTOA_FORCE_EXP);
+    }
+    JS_FreeValue(ctx, val);
+    return ret;
+ fail:
+    JS_FreeValue(ctx, val);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_number_toPrecision(JSContext *ctx, JSValueConst this_val,
+                                     int argc, JSValueConst *argv, int magic)
+{
+    JSValue val, ret;
+    int64_t p;
+    int rnd_mode;
+
+    if (magic)
+        val = js_thisBigFloatValue(ctx, this_val);
+    else
+        val = js_thisNumberValue(ctx, this_val);
+    if (JS_IsException(val))
+        return val;
+    if (JS_IsUndefined(argv[0]))
+        goto to_string;
+    if (JS_ToInt64Sat(ctx, &p, argv[0]))
+        goto fail;
+    if (!js_number_is_finite(ctx, val)) {
+    to_string:
+        ret = JS_ToString(ctx, this_val);
+    } else {
+        if (p < 1 || p > js_number_get_prec_max(ctx, magic)) {
+            JS_ThrowRangeError(ctx, "invalid number of digits");
+            goto fail;
+        }
+        rnd_mode = BF_RNDNA;
+        if (magic && argc > 1) {
+            rnd_mode = get_rnd_mode(ctx, argv[1]);
+            if (rnd_mode < 0)
+                goto fail;
+        }
+        ret = js_ftoa(ctx, val, 10, p, rnd_mode | BF_FTOA_FORMAT_FIXED);
+    }
+    JS_FreeValue(ctx, val);
+    return ret;
+ fail:
+    JS_FreeValue(ctx, val);
+    return JS_EXCEPTION;
+
+}
+
+static const JSCFunctionListEntry js_number_proto_funcs[] = {
+    JS_CFUNC_MAGIC_DEF("toExponential", 1, js_number_toExponential, 0 ),
+    JS_CFUNC_MAGIC_DEF("toFixed", 1, js_number_toFixed, 0 ),
+    JS_CFUNC_MAGIC_DEF("toPrecision", 1, js_number_toPrecision, 0 ),
+    JS_CFUNC_MAGIC_DEF("toString", 1, js_number_toString, 0 ),
+    JS_CFUNC_MAGIC_DEF("toLocaleString", 0, js_number_toString, 1 ),
+    JS_CFUNC_DEF("valueOf", 0, js_number_valueOf ),
+};
+
+#else /* !CONFIG_BIGNUM */
+
+static JSValue js_number_toFixed(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv)
+{
+    JSValue val;
+    int f;
+    double d;
+
+    val = js_thisNumberValue(ctx, this_val);
+    if (JS_IsException(val))
+        return val;
+    if (JS_ToFloat64Free(ctx, &d, val))
+        return JS_EXCEPTION;
+    if (JS_ToInt32Sat(ctx, &f, argv[0]))
+        return JS_EXCEPTION;
+    if (f < 0 || f > 100)
+        return JS_ThrowRangeError(ctx, "invalid number of digits");
+    if (fabs(d) >= 1e21) {
+        return JS_ToStringFree(ctx, __JS_NewFloat64(ctx, d));
+    } else {
+        return js_dtoa(ctx, d, 10, f, JS_DTOA_FRAC_FORMAT);
+    }
+}
+
+static JSValue js_number_toExponential(JSContext *ctx, JSValueConst this_val,
+                                       int argc, JSValueConst *argv)
+{
+    JSValue val;
+    int f, flags;
+    double d;
+
+    val = js_thisNumberValue(ctx, this_val);
+    if (JS_IsException(val))
+        return val;
+    if (JS_ToFloat64Free(ctx, &d, val))
+        return JS_EXCEPTION;
+    if (JS_ToInt32Sat(ctx, &f, argv[0]))
+        return JS_EXCEPTION;
+    if (!isfinite(d)) {
+        return JS_ToStringFree(ctx,  __JS_NewFloat64(ctx, d));
+    }
+    if (JS_IsUndefined(argv[0])) {
+        flags = 0;
+        f = 0;
+    } else {
+        if (f < 0 || f > 100)
+            return JS_ThrowRangeError(ctx, "invalid number of digits");
+        f++;
+        flags = JS_DTOA_FIXED_FORMAT;
+    }
+    return js_dtoa(ctx, d, 10, f, flags | JS_DTOA_FORCE_EXP);
+}
+
+static JSValue js_number_toPrecision(JSContext *ctx, JSValueConst this_val,
+                                     int argc, JSValueConst *argv)
+{
+    JSValue val;
+    int p;
+    double d;
+
+    val = js_thisNumberValue(ctx, this_val);
+    if (JS_IsException(val))
+        return val;
+    if (JS_ToFloat64Free(ctx, &d, val))
+        return JS_EXCEPTION;
+    if (JS_IsUndefined(argv[0]))
+        goto to_string;
+    if (JS_ToInt32Sat(ctx, &p, argv[0]))
+        return JS_EXCEPTION;
+    if (!isfinite(d)) {
+    to_string:
+        return JS_ToStringFree(ctx,  __JS_NewFloat64(ctx, d));
+    }
+    if (p < 1 || p > 100)
+        return JS_ThrowRangeError(ctx, "invalid number of digits");
+    return js_dtoa(ctx, d, 10, p, JS_DTOA_FIXED_FORMAT);
+}
+
+static const JSCFunctionListEntry js_number_proto_funcs[] = {
+    JS_CFUNC_DEF("toExponential", 1, js_number_toExponential ),
+    JS_CFUNC_DEF("toFixed", 1, js_number_toFixed ),
+    JS_CFUNC_DEF("toPrecision", 1, js_number_toPrecision ),
+    JS_CFUNC_MAGIC_DEF("toString", 1, js_number_toString, 0 ),
+    JS_CFUNC_MAGIC_DEF("toLocaleString", 0, js_number_toString, 1 ),
+    JS_CFUNC_DEF("valueOf", 0, js_number_valueOf ),
+};
+
+#endif /* !CONFIG_BIGNUM */
+
+
+static JSValue js_parseInt(JSContext *ctx, JSValueConst this_val,
+                           int argc, JSValueConst *argv)
+{
+    const char *str;
+    int radix;
+    JSValue ret;
+
+    str = JS_ToCString(ctx, argv[0]);
+    if (!str)
+        return JS_EXCEPTION;
+    if (JS_ToInt32(ctx, &radix, argv[1])) {
+        JS_FreeCString(ctx, str);
+        return JS_EXCEPTION;
+    }
+    if (radix != 0 && (radix < 2 || radix > 36)) {
+        ret = JS_NAN;
+    } else {
+#ifdef CONFIG_BIGNUM
+        int flags;
+        flags = BF_ATOF_INT_ONLY | BF_ATOF_NAN_IF_EMPTY | BF_ATOF_FLOAT64;
+        if (is_bignum_mode(ctx))
+            flags |= BF_ATOF_INT_PREC_INF;
+        ret = js_atof(ctx, str, NULL, radix, flags);
+#else
+        ret = js_atod(ctx, str, NULL, radix, ATOD_INT_ONLY | ATOD_NAN_IF_EMPTY);
+#endif
+    }
+    JS_FreeCString(ctx, str);
+    return ret;
+}
+
+static JSValue js_parseFloat(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv)
+{
+    const char *str;
+    JSValue ret;
+
+    str = JS_ToCString(ctx, argv[0]);
+    if (!str)
+        return JS_EXCEPTION;
+#ifdef CONFIG_BIGNUM
+    ret = js_atof(ctx, str, NULL, 10,
+                  BF_ATOF_JS_QUIRKS | BF_ATOF_NAN_IF_EMPTY | BF_ATOF_FLOAT64);
+#else
+    ret = js_atod(ctx, str, NULL, 10, ATOD_NAN_IF_EMPTY);
+#endif
+    JS_FreeCString(ctx, str);
+    return ret;
+}
+
+/* Boolean */
+static JSValue js_boolean_constructor(JSContext *ctx, JSValueConst new_target,
+                                     int argc, JSValueConst *argv)
+{
+    JSValue val, obj;
+    val = JS_NewBool(ctx, JS_ToBool(ctx, argv[0]));
+    if (!JS_IsUndefined(new_target)) {
+        obj = js_create_from_ctor(ctx, new_target, JS_CLASS_BOOLEAN);
+        if (!JS_IsException(obj))
+            JS_SetObjectData(ctx, obj, val);
+        return obj;
+    } else {
+        return val;
+    }
+}
+
+static JSValue js_thisBooleanValue(JSContext *ctx, JSValueConst this_val)
+{
+    if (JS_VALUE_GET_TAG(this_val) == JS_TAG_BOOL)
+        return JS_DupValue(ctx, this_val);
+
+    if (JS_VALUE_GET_TAG(this_val) == JS_TAG_OBJECT) {
+        JSObject *p = JS_VALUE_GET_OBJ(this_val);
+        if (p->class_id == JS_CLASS_BOOLEAN) {
+            if (JS_VALUE_GET_TAG(p->u.object_data) == JS_TAG_BOOL)
+                return p->u.object_data;
+        }
+    }
+    return JS_ThrowTypeError(ctx, "not a boolean");
+}
+
+static JSValue js_boolean_toString(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv)
+{
+    JSValue val = js_thisBooleanValue(ctx, this_val);
+    if (JS_IsException(val))
+        return val;
+    return JS_AtomToString(ctx, JS_VALUE_GET_BOOL(val) ?
+                       JS_ATOM_true : JS_ATOM_false);
+}
+
+static JSValue js_boolean_valueOf(JSContext *ctx, JSValueConst this_val,
+                                  int argc, JSValueConst *argv)
+{
+    return js_thisBooleanValue(ctx, this_val);
+}
+
+static const JSCFunctionListEntry js_boolean_proto_funcs[] = {
+    JS_CFUNC_DEF("toString", 0, js_boolean_toString ),
+    JS_CFUNC_DEF("valueOf", 0, js_boolean_valueOf ),
+};
+
+/* String */
+
+static int js_string_get_own_property(JSContext *ctx,
+                                      JSPropertyDescriptor *desc,
+                                      JSValueConst obj, JSAtom prop)
+{
+    JSObject *p;
+    JSString *p1;
+    uint32_t idx, ch;
+
+    /* This is a class exotic method: obj class_id is JS_CLASS_STRING */
+    if (__JS_AtomIsTaggedInt(prop)) {
+        p = JS_VALUE_GET_OBJ(obj);
+        if (JS_VALUE_GET_TAG(p->u.object_data) == JS_TAG_STRING) {
+            p1 = JS_VALUE_GET_STRING(p->u.object_data);
+            idx = __JS_AtomToUInt32(prop);
+            if (idx < p1->len) {
+                if (desc) {
+                    if (p1->is_wide_char)
+                        ch = p1->u.str16[idx];
+                    else
+                        ch = p1->u.str8[idx];
+                    desc->flags = JS_PROP_ENUMERABLE;
+                    desc->value = js_new_string_char(ctx, ch);
+                    desc->getter = JS_UNDEFINED;
+                    desc->setter = JS_UNDEFINED;
+                }
+                return TRUE;
+            }
+        }
+    }
+    return FALSE;
+}
+
+static uint32_t js_string_obj_get_length(JSContext *ctx,
+                                         JSValueConst obj)
+{
+    JSObject *p;
+    JSString *p1;
+    uint32_t len = 0;
+
+    /* This is a class exotic method: obj class_id is JS_CLASS_STRING */
+    p = JS_VALUE_GET_OBJ(obj);
+    if (JS_VALUE_GET_TAG(p->u.object_data) == JS_TAG_STRING) {
+        p1 = JS_VALUE_GET_STRING(p->u.object_data);
+        len = p1->len;
+    }
+    return len;
+}
+
+static int js_string_get_own_property_names(JSContext *ctx,
+                                            JSPropertyEnum **ptab,
+                                            uint32_t *plen,
+                                            JSValueConst obj)
+{
+    JSPropertyEnum *tab;
+    uint32_t len, i;
+
+    len = js_string_obj_get_length(ctx, obj);
+    tab = NULL;
+    if (len > 0) {
+        /* do not allocate 0 bytes */
+        tab = js_malloc(ctx, sizeof(JSPropertyEnum) * len);
+        if (!tab)
+            return -1;
+        for(i = 0; i < len; i++) {
+            tab[i].atom = __JS_AtomFromUInt32(i);
+        }
+    }
+    *ptab = tab;
+    *plen = len;
+    return 0;
+}
+
+static int js_string_define_own_property(JSContext *ctx,
+                                         JSValueConst this_obj,
+                                         JSAtom prop, JSValueConst val,
+                                         JSValueConst getter,
+                                         JSValueConst setter, int flags)
+{
+    uint32_t idx;
+
+    if (__JS_AtomIsTaggedInt(prop)) {
+        idx = __JS_AtomToUInt32(prop);
+        if (idx >= js_string_obj_get_length(ctx, this_obj))
+            goto def;
+        if (!check_define_prop_flags(JS_PROP_ENUMERABLE, flags))
+            return JS_ThrowTypeErrorOrFalse(ctx, flags, "property is not configurable");
+        /* XXX: should check if same value is configured */
+        return TRUE;
+    } else {
+    def:
+        return JS_DefineProperty(ctx, this_obj, prop, val, getter, setter,
+                                 flags | JS_PROP_NO_EXOTIC);
+    }
+}
+
+static int js_string_delete_property(JSContext *ctx,
+                                     JSValueConst obj, JSAtom prop)
+{
+    uint32_t idx;
+
+    if (__JS_AtomIsTaggedInt(prop)) {
+        idx = __JS_AtomToUInt32(prop);
+        if (idx < js_string_obj_get_length(ctx, obj)) {
+            return FALSE;
+        }
+    }
+    return TRUE;
+}
+
+static const JSClassExoticMethods js_string_exotic_methods = {
+    .get_own_property = js_string_get_own_property,
+    .get_own_property_names = js_string_get_own_property_names,
+    .define_own_property = js_string_define_own_property,
+    .delete_property = js_string_delete_property,
+};
+
+static JSValue js_string_constructor(JSContext *ctx, JSValueConst new_target,
+                                     int argc, JSValueConst *argv)
+{
+    JSValue val, obj;
+    if (argc == 0) {
+        val = JS_AtomToString(ctx, JS_ATOM_empty_string);
+    } else {
+        if (JS_IsUndefined(new_target) && JS_IsSymbol(argv[0])) {
+            JSAtomStruct *p = JS_VALUE_GET_PTR(argv[0]);
+            val = JS_ConcatString3(ctx, "Symbol(", JS_AtomToString(ctx, js_get_atom_index(ctx->rt, p)), ")");
+        } else {
+            val = JS_ToString(ctx, argv[0]);
+        }
+        if (JS_IsException(val))
+            return val;
+    }
+    if (!JS_IsUndefined(new_target)) {
+        JSString *p1 = JS_VALUE_GET_STRING(val);
+
+        obj = js_create_from_ctor(ctx, new_target, JS_CLASS_STRING);
+        if (!JS_IsException(obj)) {
+            JS_SetObjectData(ctx, obj, val);
+            JS_DefinePropertyValue(ctx, obj, JS_ATOM_length, JS_NewInt32(ctx, p1->len), 0);
+        }
+        return obj;
+    } else {
+        return val;
+    }
+}
+
+static JSValue js_thisStringValue(JSContext *ctx, JSValueConst this_val)
+{
+    if (JS_VALUE_GET_TAG(this_val) == JS_TAG_STRING)
+        return JS_DupValue(ctx, this_val);
+
+    if (JS_VALUE_GET_TAG(this_val) == JS_TAG_OBJECT) {
+        JSObject *p = JS_VALUE_GET_OBJ(this_val);
+        if (p->class_id == JS_CLASS_STRING) {
+            if (JS_VALUE_GET_TAG(p->u.object_data) == JS_TAG_STRING)
+                return JS_DupValue(ctx, p->u.object_data);
+        }
+    }
+    return JS_ThrowTypeError(ctx, "not a string");
+}
+
+static JSValue js_string_fromCharCode(JSContext *ctx, JSValueConst this_val,
+                                      int argc, JSValueConst *argv)
+{
+    int i;
+    StringBuffer b_s, *b = &b_s;
+
+    string_buffer_init(ctx, b, argc);
+
+    for(i = 0; i < argc; i++) {
+        int32_t c;
+        if (JS_ToInt32(ctx, &c, argv[i]) || string_buffer_putc16(b, c & 0xffff)) {
+            string_buffer_free(b);
+            return JS_EXCEPTION;
+        }
+    }
+    return string_buffer_end(b);
+}
+
+static JSValue js_string_fromCodePoint(JSContext *ctx, JSValueConst this_val,
+                                       int argc, JSValueConst *argv)
+{
+    double d;
+    int i, c;
+    StringBuffer b_s, *b = &b_s;
+
+    /* XXX: could pre-compute string length if all arguments are JS_TAG_INT */
+
+    if (string_buffer_init(ctx, b, argc))
+        goto fail;
+    for(i = 0; i < argc; i++) {
+        if (JS_VALUE_GET_TAG(argv[i]) == JS_TAG_INT) {
+            c = JS_VALUE_GET_INT(argv[i]);
+            if (c < 0 || c > 0x10ffff)
+                goto range_error;
+        } else {
+            if (JS_ToFloat64(ctx, &d, argv[i]))
+                goto fail;
+            if (d < 0 || d > 0x10ffff || (c = (int)d) != d)
+                goto range_error;
+        }
+        if (string_buffer_putc(b, c))
+            goto fail;
+    }
+    return string_buffer_end(b);
+
+ range_error:
+    JS_ThrowRangeError(ctx, "invalid code point");
+ fail:
+    string_buffer_free(b);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_string_raw(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv)
+{
+    // raw(temp,...a)
+    JSValue cooked, val, raw;
+    StringBuffer b_s, *b = &b_s;
+    int64_t i, n;
+
+    string_buffer_init(ctx, b, 0);
+    raw = JS_UNDEFINED;
+    cooked = JS_ToObject(ctx, argv[0]);
+    if (JS_IsException(cooked))
+        goto exception;
+    raw = JS_ToObjectFree(ctx, JS_GetProperty(ctx, cooked, JS_ATOM_raw));
+    if (JS_IsException(raw))
+        goto exception;
+    if (js_get_length64(ctx, &n, raw) < 0)
+        goto exception;
+        
+    for (i = 0; i < n; i++) {
+        val = JS_ToStringFree(ctx, JS_GetPropertyInt64(ctx, raw, i));
+        if (JS_IsException(val))
+            goto exception;
+        string_buffer_concat_value_free(b, val);
+        if (i < n - 1 && i + 1 < argc) {
+            if (string_buffer_concat_value(b, argv[i + 1]))
+                goto exception;
+        }
+    }
+    JS_FreeValue(ctx, cooked);
+    JS_FreeValue(ctx, raw);
+    return string_buffer_end(b);
+
+exception:
+    JS_FreeValue(ctx, cooked);
+    JS_FreeValue(ctx, raw);
+    string_buffer_free(b);
+    return JS_EXCEPTION;
+}
+
+/* only used in test262 */
+JSValue js_string_codePointRange(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv)
+{
+    uint32_t start, end, i, n;
+    StringBuffer b_s, *b = &b_s;
+
+    if (JS_ToUint32(ctx, &start, argv[0]) ||
+        JS_ToUint32(ctx, &end, argv[1]))
+        return JS_EXCEPTION;
+    end = min_uint32(end, 0x10ffff + 1);
+
+    if (start > end) {
+        start = end;
+    }
+    n = end - start;
+    if (end > 0x10000) {
+        n += end - max_uint32(start, 0x10000);
+    }
+    if (string_buffer_init2(ctx, b, n, end >= 0x100))
+        return JS_EXCEPTION;
+    for(i = start; i < end; i++) {
+        string_buffer_putc(b, i);
+    }
+    return string_buffer_end(b);
+}
+
+#if 0
+static JSValue js_string___isSpace(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv)
+{
+    int c;
+    if (JS_ToInt32(ctx, &c, argv[0]))
+        return JS_EXCEPTION;
+    return JS_NewBool(ctx, lre_is_space(c));
+}
+#endif
+
+static JSValue js_string_charCodeAt(JSContext *ctx, JSValueConst this_val,
+                                     int argc, JSValueConst *argv)
+{
+    JSValue val, ret;
+    JSString *p;
+    int idx, c;
+
+    val = JS_ToStringCheckObject(ctx, this_val);
+    if (JS_IsException(val))
+        return val;
+    p = JS_VALUE_GET_STRING(val);
+    if (JS_ToInt32Sat(ctx, &idx, argv[0])) {
+        JS_FreeValue(ctx, val);
+        return JS_EXCEPTION;
+    }
+    if (idx < 0 || idx >= p->len) {
+        ret = JS_NAN;
+    } else {
+        if (p->is_wide_char)
+            c = p->u.str16[idx];
+        else
+            c = p->u.str8[idx];
+        ret = JS_NewInt32(ctx, c);
+    }
+    JS_FreeValue(ctx, val);
+    return ret;
+}
+
+static JSValue js_string_charAt(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    JSValue val, ret;
+    JSString *p;
+    int idx, c;
+
+    val = JS_ToStringCheckObject(ctx, this_val);
+    if (JS_IsException(val))
+        return val;
+    p = JS_VALUE_GET_STRING(val);
+    if (JS_ToInt32Sat(ctx, &idx, argv[0])) {
+        JS_FreeValue(ctx, val);
+        return JS_EXCEPTION;
+    }
+    if (idx < 0 || idx >= p->len) {
+        ret = js_new_string8(ctx, NULL, 0);
+    } else {
+        if (p->is_wide_char)
+            c = p->u.str16[idx];
+        else
+            c = p->u.str8[idx];
+        ret = js_new_string_char(ctx, c);
+    }
+    JS_FreeValue(ctx, val);
+    return ret;
+}
+
+static int string_getc(JSString *p, int *pidx)
+{
+    int idx, c, c1;
+    idx = *pidx;
+    if (p->is_wide_char) {
+        c = p->u.str16[idx++];
+        if (c >= 0xd800 && c < 0xdc00 && idx < p->len) {
+            c1 = p->u.str16[idx];
+            if (c1 >= 0xdc00 && c1 < 0xe000) {
+                c = (((c & 0x3ff) << 10) | (c1 & 0x3ff)) + 0x10000;
+                idx++;
+            }
+        }
+    } else {
+        c = p->u.str8[idx++];
+    }
+    *pidx = idx;
+    return c;
+}
+
+static JSValue js_string_codePointAt(JSContext *ctx, JSValueConst this_val,
+                                     int argc, JSValueConst *argv)
+{
+    JSValue val, ret;
+    JSString *p;
+    int idx, c;
+
+    val = JS_ToStringCheckObject(ctx, this_val);
+    if (JS_IsException(val))
+        return val;
+    p = JS_VALUE_GET_STRING(val);
+    if (JS_ToInt32Sat(ctx, &idx, argv[0])) {
+        JS_FreeValue(ctx, val);
+        return JS_EXCEPTION;
+    }
+    if (idx < 0 || idx >= p->len) {
+        ret = JS_UNDEFINED;
+    } else {
+        c = string_getc(p, &idx);
+        ret = JS_NewInt32(ctx, c);
+    }
+    JS_FreeValue(ctx, val);
+    return ret;
+}
+
+static JSValue js_string_concat(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    JSValue r;
+    int i;
+
+    /* XXX: Use more efficient method */
+    /* XXX: This method is OK if r has a single refcount */
+    /* XXX: should use string_buffer? */
+    r = JS_ToStringCheckObject(ctx, this_val);
+    for (i = 0; i < argc; i++) {
+        if (JS_IsException(r))
+            break;
+        r = JS_ConcatString(ctx, r, JS_DupValue(ctx, argv[i]));
+    }
+    return r;
+}
+
+static int string_cmp(JSString *p1, JSString *p2, int x1, int x2, int len)
+{
+    int i, c1, c2;
+    for (i = 0; i < len; i++) {
+        if ((c1 = string_get(p1, x1 + i)) != (c2 = string_get(p2, x2 + i)))
+            return c1 - c2;
+    }
+    return 0;
+}
+
+static int string_indexof_char(JSString *p, int c, int from)
+{
+    /* assuming 0 <= from <= p->len */
+    int i, len = p->len;
+    if (p->is_wide_char) {
+        for (i = from; i < len; i++) {
+            if (p->u.str16[i] == c)
+                return i;
+        }
+    } else {
+        if ((c & ~0xff) == 0) {
+            for (i = from; i < len; i++) {
+                if (p->u.str8[i] == (uint8_t)c)
+                    return i;
+            }
+        }
+    }
+    return -1;
+}
+
+static int string_indexof(JSString *p1, JSString *p2, int from)
+{
+    /* assuming 0 <= from <= p1->len */
+    int c, i, j, len1 = p1->len, len2 = p2->len;
+    if (len2 == 0)
+        return from;
+    for (i = from, c = string_get(p2, 0); i + len2 <= len1; i = j + 1) {
+        j = string_indexof_char(p1, c, i);
+        if (j < 0 || j + len2 > len1)
+            break;
+        if (!string_cmp(p1, p2, j + 1, 1, len2 - 1))
+            return j;
+    }
+    return -1;
+}
+
+static int string_advance_index(JSString *p, int index, BOOL unicode)
+{
+    if (!unicode || (unsigned)index >= p->len || !p->is_wide_char) {
+        index++;
+    } else {
+        string_getc(p, &index);
+    }
+    return index;
+}
+
+static JSValue js_string_indexOf(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv, int lastIndexOf)
+{
+    JSValue str, v;
+    int i, len, v_len, pos, start, stop, ret, inc;
+    JSString *p;
+    JSString *p1;
+
+    str = JS_ToStringCheckObject(ctx, this_val);
+    if (JS_IsException(str))
+        return str;
+    v = JS_ToString(ctx, argv[0]);
+    if (JS_IsException(v))
+        goto fail;
+    p = JS_VALUE_GET_STRING(str);
+    p1 = JS_VALUE_GET_STRING(v);
+    len = p->len;
+    v_len = p1->len;
+    if (lastIndexOf) {
+        pos = len - v_len;
+        if (argc > 1) {
+            double d;
+            if (JS_ToFloat64(ctx, &d, argv[1]))
+                goto fail;
+            if (!isnan(d)) {
+                if (d <= 0)
+                    pos = 0;
+                else if (d < pos)
+                    pos = d;
+            }
+        }
+        start = pos;
+        stop = 0;
+        inc = -1;
+    } else {
+        pos = 0;
+        if (argc > 1) {
+            if (JS_ToInt32Clamp(ctx, &pos, argv[1], 0, len, 0))
+                goto fail;
+        }
+        start = pos;
+        stop = len - v_len;
+        inc = 1;
+    }
+    ret = -1;
+    if (len >= v_len && inc * (stop - start) >= 0) {
+        for (i = start;; i += inc) {
+            if (!string_cmp(p, p1, i, 0, v_len)) {
+                ret = i;
+                break;
+            }
+            if (i == stop)
+                break;
+        }
+    }
+    JS_FreeValue(ctx, str);
+    JS_FreeValue(ctx, v);
+    return JS_NewInt32(ctx, ret);
+
+fail:
+    JS_FreeValue(ctx, str);
+    JS_FreeValue(ctx, v);
+    return JS_EXCEPTION;
+}
+
+/* return < 0 if exception or TRUE/FALSE */
+static int js_is_regexp(JSContext *ctx, JSValueConst obj);
+
+static JSValue js_string_includes(JSContext *ctx, JSValueConst this_val,
+                                  int argc, JSValueConst *argv, int magic)
+{
+    JSValue str, v = JS_UNDEFINED;
+    int i, len, v_len, pos, start, stop, ret;
+    JSString *p;
+    JSString *p1;
+
+    str = JS_ToStringCheckObject(ctx, this_val);
+    if (JS_IsException(str))
+        return str;
+    ret = js_is_regexp(ctx, argv[0]);
+    if (ret) {
+        if (ret > 0)
+            JS_ThrowTypeError(ctx, "regex not supported");
+        goto fail;
+    }
+    v = JS_ToString(ctx, argv[0]);
+    if (JS_IsException(v))
+        goto fail;
+    p = JS_VALUE_GET_STRING(str);
+    p1 = JS_VALUE_GET_STRING(v);
+    len = p->len;
+    v_len = p1->len;
+    pos = (magic & 2) ? len : 0;
+    if (argc > 1 && !JS_IsUndefined(argv[1])) {
+        if (JS_ToInt32Clamp(ctx, &pos, argv[1], 0, len, 0))
+            goto fail;
+    }
+    len -= v_len;
+    start = pos;
+    stop = len;
+    if (magic & 1) {
+        stop = pos;
+    }
+    if (magic & 2) {
+        pos -= v_len;
+        start = stop = pos;
+    }
+    ret = 0;
+    if (start >= 0 && start <= stop) {
+        for (i = start;; i++) {
+            if (!string_cmp(p, p1, i, 0, v_len)) {
+                ret = 1;
+                break;
+            }
+            if (i == stop)
+                break;
+        }
+    }
+    JS_FreeValue(ctx, str);
+    JS_FreeValue(ctx, v);
+    return JS_NewBool(ctx, ret);
+
+fail:
+    JS_FreeValue(ctx, str);
+    JS_FreeValue(ctx, v);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_string_match(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv, int atom)
+{
+    // match(rx) and search(rx)
+    // atom is JS_ATOM_Symbol_match or JS_ATOM_Symbol_search
+    JSValueConst O = this_val, regexp = argv[0];
+    JSValue matcher, S, rx, result;
+
+    if (JS_IsUndefined(O) || JS_IsNull(O))
+        return JS_ThrowTypeError(ctx, "cannot convert to object");
+
+    if (!JS_IsUndefined(regexp) && !JS_IsNull(regexp)) {
+        matcher = JS_GetProperty(ctx, regexp, atom);
+        if (JS_IsException(matcher))
+            return JS_EXCEPTION;
+        if (!JS_IsUndefined(matcher) && !JS_IsNull(matcher)) {
+            return JS_CallFree(ctx, matcher, regexp, 1, &O);
+        }
+    }
+    S = JS_ToString(ctx, O);
+    if (JS_IsException(S))
+        return JS_EXCEPTION;
+    rx = JS_CallConstructor(ctx, ctx->regexp_ctor, 1, &regexp);
+    if (JS_IsException(rx)) {
+        JS_FreeValue(ctx, S);
+        return JS_EXCEPTION;
+    }
+    result = JS_InvokeFree(ctx, rx, atom, 1, (JSValueConst *)&S);
+    JS_FreeValue(ctx, S);
+    return result;
+}
+
+static JSValue js_string___GetSubstitution(JSContext *ctx, JSValueConst this_val,
+                                           int argc, JSValueConst *argv)
+{
+    // GetSubstitution(matched, str, position, captures, namedCaptures, rep)
+    JSValueConst matched, str, captures, namedCaptures, rep;
+    JSValue capture, name, s;
+    uint32_t position, len, matched_len, captures_len;
+    int i, j, j0, k, k1;
+    int c, c1;
+    StringBuffer b_s, *b = &b_s;
+    JSString *sp, *rp;
+
+    matched = argv[0];
+    str = argv[1];
+    captures = argv[3];
+    namedCaptures = argv[4];
+    rep = argv[5];
+
+    if (!JS_IsString(rep) || !JS_IsString(str))
+        return JS_ThrowTypeError(ctx, "not a string");
+
+    sp = JS_VALUE_GET_STRING(str);
+    rp = JS_VALUE_GET_STRING(rep);
+
+    string_buffer_init(ctx, b, 0);
+
+    captures_len = 0;
+    if (!JS_IsUndefined(captures)) {
+        if (js_get_length32(ctx, &captures_len, captures))
+            goto exception;
+    }
+    if (js_get_length32(ctx, &matched_len, matched))
+        goto exception;
+    if (JS_ToUint32(ctx, &position, argv[2]) < 0)
+        goto exception;
+
+    len = rp->len;
+    i = 0;
+    for(;;) {
+        j = string_indexof_char(rp, '$', i);
+        if (j < 0 || j + 1 >= len)
+            break;
+        string_buffer_concat(b, rp, i, j);
+        j0 = j++;
+        c = string_get(rp, j++);
+        if (c == '$') {
+            string_buffer_putc8(b, '$');
+        } else if (c == '&') {
+            if (string_buffer_concat_value(b, matched))
+                goto exception;
+        } else if (c == '`') {
+            string_buffer_concat(b, sp, 0, position);
+        } else if (c == '\'') {
+            string_buffer_concat(b, sp, position + matched_len, sp->len);
+        } else if (c >= '0' && c <= '9') {
+            k = c - '0';
+            c1 = string_get(rp, j);
+            if (c1 >= '0' && c1 <= '9') {
+                /* This behavior is specified in ES6 and refined in ECMA 2019 */
+                /* ECMA 2019 does not have the extra test, but
+                   Test262 S15.5.4.11_A3_T1..3 require this behavior */
+                k1 = k * 10 + c1 - '0';
+                if (k1 >= 1 && k1 < captures_len) {
+                    k = k1;
+                    j++;
+                }
+            }
+            if (k >= 1 && k < captures_len) {
+                s = JS_GetPropertyInt64(ctx, captures, k);
+                if (JS_IsException(s))
+                    goto exception;
+                if (!JS_IsUndefined(s)) {
+                    if (string_buffer_concat_value_free(b, s))
+                        goto exception;
+                }
+            } else {
+                goto norep;
+            }
+        } else if (c == '<' && !JS_IsUndefined(namedCaptures)) {
+            k = string_indexof_char(rp, '>', j);
+            if (k < 0)
+                goto norep;
+            name = js_sub_string(ctx, rp, j, k);
+            if (JS_IsException(name))
+                goto exception;
+            capture = JS_GetPropertyValue(ctx, namedCaptures, name);
+            if (JS_IsException(capture))
+                goto exception;
+            if (!JS_IsUndefined(capture)) {
+                if (string_buffer_concat_value_free(b, capture))
+                    goto exception;
+            }
+            j = k + 1;
+        } else {
+        norep:
+            string_buffer_concat(b, rp, j0, j);
+        }
+        i = j;
+    }
+    string_buffer_concat(b, rp, i, rp->len);
+    return string_buffer_end(b);
+exception:
+    string_buffer_free(b);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_string_replace(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv)
+{
+    // replace(rx, rep)
+    JSValueConst O = this_val, searchValue = argv[0], replaceValue = argv[1];
+    JSValueConst args[6];
+    JSValue str, search_str, replaceValue_str, repl_str;
+    JSString *sp, *searchp;
+    StringBuffer b_s, *b = &b_s;
+    int pos, functionalReplace;
+
+    if (JS_IsUndefined(O) || JS_IsNull(O))
+        return JS_ThrowTypeError(ctx, "cannot convert to object");
+
+    search_str = JS_UNDEFINED;
+    replaceValue_str = JS_UNDEFINED;
+    repl_str = JS_UNDEFINED;
+
+    if (!JS_IsUndefined(searchValue) && !JS_IsNull(searchValue)) {
+        JSValue replacer;
+        replacer = JS_GetProperty(ctx, searchValue, JS_ATOM_Symbol_replace);
+        if (JS_IsException(replacer))
+            return JS_EXCEPTION;
+        if (!JS_IsUndefined(replacer)) {
+            args[0] = O;
+            args[1] = replaceValue;
+            return JS_CallFree(ctx, replacer, searchValue, 2, args);
+        }
+    }
+    string_buffer_init(ctx, b, 0);
+
+    str = JS_ToString(ctx, O);
+    if (JS_IsException(str))
+        goto exception;
+    search_str = JS_ToString(ctx, searchValue);
+    if (JS_IsException(search_str))
+        goto exception;
+    functionalReplace = JS_IsFunction(ctx, replaceValue);
+    if (!functionalReplace) {
+        replaceValue_str = JS_ToString(ctx, replaceValue);
+        if (JS_IsException(replaceValue_str))
+            goto exception;
+    }
+
+    sp = JS_VALUE_GET_STRING(str);
+    searchp = JS_VALUE_GET_STRING(search_str);
+
+    pos = string_indexof(sp, searchp, 0);
+    if (pos < 0) {
+        JS_FreeValue(ctx, search_str);
+        JS_FreeValue(ctx, replaceValue_str);
+        return str;
+    }
+    if (functionalReplace) {
+        args[0] = search_str;
+        args[1] = JS_NewInt32(ctx, pos);
+        args[2] = str;
+        repl_str = JS_ToStringFree(ctx, JS_Call(ctx, replaceValue, JS_UNDEFINED, 3, args));
+    } else {
+        args[0] = search_str;
+        args[1] = str;
+        args[2] = JS_NewInt32(ctx, pos);
+        args[3] = JS_UNDEFINED;
+        args[4] = JS_UNDEFINED;
+        args[5] = replaceValue_str;
+        repl_str = js_string___GetSubstitution(ctx, JS_UNDEFINED, 6, args);
+    }
+    if (JS_IsException(repl_str))
+        goto exception;
+
+    string_buffer_concat(b, sp, 0, pos);
+    string_buffer_concat_value_free(b, repl_str);
+    string_buffer_concat(b, sp, pos + searchp->len, sp->len);
+    JS_FreeValue(ctx, search_str);
+    JS_FreeValue(ctx, replaceValue_str);
+    JS_FreeValue(ctx, str);
+    return string_buffer_end(b);
+
+exception:
+    string_buffer_free(b);
+    JS_FreeValue(ctx, search_str);
+    JS_FreeValue(ctx, replaceValue_str);
+    JS_FreeValue(ctx, str);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_string_split(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv)
+{
+    // split(sep, limit)
+    JSValueConst O = this_val, separator = argv[0], limit = argv[1];
+    JSValueConst args[2];
+    JSValue S, A, R, T;
+    uint32_t lim, lengthA;
+    int64_t p, q, s, r, e;
+    JSString *sp, *rp;
+
+    if (JS_IsUndefined(O) || JS_IsNull(O))
+        return JS_ThrowTypeError(ctx, "cannot convert to object");
+
+    S = JS_UNDEFINED;
+    A = JS_UNDEFINED;
+    R = JS_UNDEFINED;
+
+    if (!JS_IsUndefined(separator) && !JS_IsNull(separator)) {
+        JSValue splitter;
+        splitter = JS_GetProperty(ctx, separator, JS_ATOM_Symbol_split);
+        if (JS_IsException(splitter))
+            return JS_EXCEPTION;
+        if (!JS_IsUndefined(splitter) && !JS_IsNull(splitter)) {
+            args[0] = O;
+            args[1] = limit;
+            return JS_CallFree(ctx, splitter, separator, 2, args);
+        }
+    }
+    S = JS_ToString(ctx, O);
+    if (JS_IsException(S))
+        goto exception;
+    A = JS_NewArray(ctx);
+    if (JS_IsException(A))
+        goto exception;
+    lengthA = 0;
+    if (JS_IsUndefined(limit)) {
+        lim = 0xffffffff;
+    } else {
+        if (JS_ToUint32(ctx, &lim, limit) < 0)
+            goto exception;
+    }
+    sp = JS_VALUE_GET_STRING(S);
+    s = sp->len;
+    R = JS_ToString(ctx, separator);
+    if (JS_IsException(R))
+        goto exception;
+    rp = JS_VALUE_GET_STRING(R);
+    r = rp->len;
+    p = 0;
+    if (lim == 0)
+        goto done;
+    if (JS_IsUndefined(separator))
+        goto add_tail;
+    if (s == 0) {
+        if (r != 0)
+            goto add_tail;
+        goto done;
+    }
+    q = p;
+    for (q = p; (q += !r) <= s - r - !r; q = p = e + r) {
+        e = string_indexof(sp, rp, q);
+        if (e < 0)
+            break;
+        T = js_sub_string(ctx, sp, p, e);
+        if (JS_IsException(T))
+            goto exception;
+        if (JS_CreateDataPropertyUint32(ctx, A, lengthA++, T, 0) < 0)
+            goto exception;
+        if (lengthA == lim)
+            goto done;
+    }
+add_tail:
+    T = js_sub_string(ctx, sp, p, s);
+    if (JS_IsException(T))
+        goto exception;
+    if (JS_CreateDataPropertyUint32(ctx, A, lengthA++, T,0 ) < 0)
+        goto exception;
+done:
+    JS_FreeValue(ctx, S);
+    JS_FreeValue(ctx, R);
+    return A;
+
+exception:
+    JS_FreeValue(ctx, A);
+    JS_FreeValue(ctx, S);
+    JS_FreeValue(ctx, R);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_string_substring(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv)
+{
+    JSValue str, ret;
+    int a, b, start, end;
+    JSString *p;
+
+    str = JS_ToStringCheckObject(ctx, this_val);
+    if (JS_IsException(str))
+        return str;
+    p = JS_VALUE_GET_STRING(str);
+    if (JS_ToInt32Clamp(ctx, &a, argv[0], 0, p->len, 0)) {
+        JS_FreeValue(ctx, str);
+        return JS_EXCEPTION;
+    }
+    b = p->len;
+    if (!JS_IsUndefined(argv[1])) {
+        if (JS_ToInt32Clamp(ctx, &b, argv[1], 0, p->len, 0)) {
+            JS_FreeValue(ctx, str);
+            return JS_EXCEPTION;
+        }
+    }
+    if (a < b) {
+        start = a;
+        end = b;
+    } else {
+        start = b;
+        end = a;
+    }
+    ret = js_sub_string(ctx, p, start, end);
+    JS_FreeValue(ctx, str);
+    return ret;
+}
+
+static JSValue js_string_substr(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    JSValue str, ret;
+    int a, len, n;
+    JSString *p;
+
+    str = JS_ToStringCheckObject(ctx, this_val);
+    if (JS_IsException(str))
+        return str;
+    p = JS_VALUE_GET_STRING(str);
+    len = p->len;
+    if (JS_ToInt32Clamp(ctx, &a, argv[0], 0, len, len)) {
+        JS_FreeValue(ctx, str);
+        return JS_EXCEPTION;
+    }
+    n = len - a;
+    if (!JS_IsUndefined(argv[1])) {
+        if (JS_ToInt32Clamp(ctx, &n, argv[1], 0, len - a, 0)) {
+            JS_FreeValue(ctx, str);
+            return JS_EXCEPTION;
+        }
+    }
+    ret = js_sub_string(ctx, p, a, a + n);
+    JS_FreeValue(ctx, str);
+    return ret;
+}
+
+static JSValue js_string_slice(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv)
+{
+    JSValue str, ret;
+    int len, start, end;
+    JSString *p;
+
+    str = JS_ToStringCheckObject(ctx, this_val);
+    if (JS_IsException(str))
+        return str;
+    p = JS_VALUE_GET_STRING(str);
+    len = p->len;
+    if (JS_ToInt32Clamp(ctx, &start, argv[0], 0, len, len)) {
+        JS_FreeValue(ctx, str);
+        return JS_EXCEPTION;
+    }
+    end = len;
+    if (!JS_IsUndefined(argv[1])) {
+        if (JS_ToInt32Clamp(ctx, &end, argv[1], 0, len, len)) {
+            JS_FreeValue(ctx, str);
+            return JS_EXCEPTION;
+        }
+    }
+    ret = js_sub_string(ctx, p, start, max_int(end, start));
+    JS_FreeValue(ctx, str);
+    return ret;
+}
+
+static JSValue js_string_pad(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv, int padEnd)
+{
+    JSValue str, v = JS_UNDEFINED;
+    StringBuffer b_s, *b = &b_s;
+    JSString *p, *p1 = NULL;
+    int n, len, c = ' ';
+
+    str = JS_ToStringCheckObject(ctx, this_val);
+    if (JS_IsException(str))
+        goto fail1;
+    if (JS_ToInt32Sat(ctx, &n, argv[0]))
+        goto fail2;
+    p = JS_VALUE_GET_STRING(str);
+    len = p->len;
+    if (len >= n)
+        return str;
+    if (n > JS_STRING_LEN_MAX) {
+        JS_ThrowInternalError(ctx, "string too long");
+        goto fail2;
+    }
+    if (argc > 1 && !JS_IsUndefined(argv[1])) {
+        v = JS_ToString(ctx, argv[1]);
+        if (JS_IsException(v))
+            goto fail2;
+        p1 = JS_VALUE_GET_STRING(v);
+        if (p1->len == 0) {
+            JS_FreeValue(ctx, v);
+            return str;
+        }
+        if (p1->len == 1) {
+            c = string_get(p1, 0);
+            p1 = NULL;
+        }
+    }
+    if (string_buffer_init(ctx, b, n))
+        goto fail3;
+    n -= len;
+    if (padEnd) {
+        if (string_buffer_concat(b, p, 0, len))
+            goto fail;
+    }
+    if (p1) {
+        while (n > 0) {
+            int chunk = min_int(n, p1->len);
+            if (string_buffer_concat(b, p1, 0, chunk))
+                goto fail;
+            n -= chunk;
+        }
+    } else {
+        if (string_buffer_fill(b, c, n))
+            goto fail;
+    }
+    if (!padEnd) {
+        if (string_buffer_concat(b, p, 0, len))
+            goto fail;
+    }
+    JS_FreeValue(ctx, v);
+    JS_FreeValue(ctx, str);
+    return string_buffer_end(b);
+
+fail:
+    string_buffer_free(b);
+fail3:
+    JS_FreeValue(ctx, v);
+fail2:
+    JS_FreeValue(ctx, str);
+fail1:
+    return JS_EXCEPTION;
+}
+
+static JSValue js_string_repeat(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    JSValue str;
+    StringBuffer b_s, *b = &b_s;
+    JSString *p;
+    int64_t val;
+    int n, len;
+
+    str = JS_ToStringCheckObject(ctx, this_val);
+    if (JS_IsException(str))
+        goto fail;
+    if (JS_ToInt64Sat(ctx, &val, argv[0]))
+        goto fail;
+    if (val < 0 || val > 2147483647) {
+        JS_ThrowRangeError(ctx, "invalid repeat count");
+        goto fail;
+    }
+    n = val;
+    p = JS_VALUE_GET_STRING(str);
+    len = p->len;
+    if (len == 0 || n == 1)
+        return str;
+    if (val * len > JS_STRING_LEN_MAX) {
+        JS_ThrowInternalError(ctx, "string too long");
+        goto fail;
+    }
+    if (string_buffer_init2(ctx, b, n * len, p->is_wide_char))
+        goto fail;
+    if (len == 1) {
+        string_buffer_fill(b, string_get(p, 0), n);
+    } else {
+        while (n-- > 0) {
+            string_buffer_concat(b, p, 0, len);
+        }
+    }
+    JS_FreeValue(ctx, str);
+    return string_buffer_end(b);
+
+fail:
+    JS_FreeValue(ctx, str);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_string_trim(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv, int magic)
+{
+    JSValue str, ret;
+    int a, b, len;
+    JSString *p;
+
+    str = JS_ToStringCheckObject(ctx, this_val);
+    if (JS_IsException(str))
+        return str;
+    p = JS_VALUE_GET_STRING(str);
+    a = 0;
+    b = len = p->len;
+    if (magic & 1) {
+        while (a < len && lre_is_space(string_get(p, a)))
+            a++;
+    }
+    if (magic & 2) {
+        while (b > a && lre_is_space(string_get(p, b - 1)))
+            b--;
+    }
+    ret = js_sub_string(ctx, p, a, b);
+    JS_FreeValue(ctx, str);
+    return ret;
+}
+
+static JSValue js_string___quote(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv)
+{
+    return JS_ToQuotedString(ctx, this_val);
+}
+
+/* return 0 if before the first char */
+static int string_prevc(JSString *p, int *pidx)
+{
+    int idx, c, c1;
+
+    idx = *pidx;
+    if (idx <= 0)
+        return 0;
+    idx--;
+    if (p->is_wide_char) {
+        c = p->u.str16[idx];
+        if (c >= 0xdc00 && c < 0xe000 && idx > 0) {
+            c1 = p->u.str16[idx - 1];
+            if (c1 >= 0xd800 && c1 <= 0xdc00) {
+                c = (((c1 & 0x3ff) << 10) | (c & 0x3ff)) + 0x10000;
+                idx--;
+            }
+        }
+    } else {
+        c = p->u.str8[idx];
+    }
+    *pidx = idx;
+    return c;
+}
+
+static BOOL test_final_sigma(JSString *p, int sigma_pos)
+{
+    int k, c1;
+
+    /* before C: skip case ignorable chars and check there is
+       a cased letter */
+    k = sigma_pos;
+    for(;;) {
+        c1 = string_prevc(p, &k);
+        if (!lre_is_case_ignorable(c1))
+            break;
+    }
+    if (!lre_is_cased(c1))
+        return FALSE;
+
+    /* after C: skip case ignorable chars and check there is
+       no cased letter */
+    k = sigma_pos + 1;
+    for(;;) {
+        if (k >= p->len)
+            return TRUE;
+        c1 = string_getc(p, &k);
+        if (!lre_is_case_ignorable(c1))
+            break;
+    }
+    return !lre_is_cased(c1);
+}
+
+static JSValue js_string_localeCompare(JSContext *ctx, JSValueConst this_val,
+                                       int argc, JSValueConst *argv)
+{
+    JSValue a, b;
+    int cmp;
+
+    a = JS_ToStringCheckObject(ctx, this_val);
+    if (JS_IsException(a))
+        return JS_EXCEPTION;
+    b = JS_ToString(ctx, argv[0]);
+    if (JS_IsException(b)) {
+        JS_FreeValue(ctx, a);
+        return JS_EXCEPTION;
+    }
+    cmp = js_string_compare(ctx, JS_VALUE_GET_STRING(a), JS_VALUE_GET_STRING(b));
+    JS_FreeValue(ctx, a);
+    JS_FreeValue(ctx, b);
+    return JS_NewInt32(ctx, cmp);
+}
+
+static JSValue js_string_toLowerCase(JSContext *ctx, JSValueConst this_val,
+                                     int argc, JSValueConst *argv, int to_lower)
+{
+    JSValue val;
+    StringBuffer b_s, *b = &b_s;
+    JSString *p;
+    int i, c, j, l;
+    uint32_t res[LRE_CC_RES_LEN_MAX];
+
+    val = JS_ToStringCheckObject(ctx, this_val);
+    if (JS_IsException(val))
+        return val;
+    p = JS_VALUE_GET_STRING(val);
+    if (p->len == 0)
+        return val;
+    if (string_buffer_init(ctx, b, p->len))
+        goto fail;
+    for(i = 0; i < p->len;) {
+        c = string_getc(p, &i);
+        if (c == 0x3a3 && to_lower && test_final_sigma(p, i - 1)) {
+            res[0] = 0x3c2; /* final sigma */
+            l = 1;
+        } else {
+            l = lre_case_conv(res, c, to_lower);
+        }
+        for(j = 0; j < l; j++) {
+            if (string_buffer_putc(b, res[j]))
+                goto fail;
+        }
+    }
+    JS_FreeValue(ctx, val);
+    return string_buffer_end(b);
+ fail:
+    JS_FreeValue(ctx, val);
+    string_buffer_free(b);
+    return JS_EXCEPTION;
+}
+
+#ifdef CONFIG_ALL_UNICODE
+
+/* return (-1, NULL) if exception, otherwise (len, buf) */
+static int JS_ToUTF32String(JSContext *ctx, uint32_t **pbuf, JSValueConst val1)
+{
+    JSValue val;
+    JSString *p;
+    uint32_t *buf;
+    int i, j, len;
+
+    val = JS_ToString(ctx, val1);
+    if (JS_IsException(val))
+        return -1;
+    p = JS_VALUE_GET_STRING(val);
+    len = p->len;
+    /* UTF32 buffer length is len minus the number of correct surrogates pairs */
+    buf = js_malloc(ctx, sizeof(buf[0]) * len);
+    if (!buf) {
+        JS_FreeValue(ctx, val);
+        goto fail;
+    }
+    for(i = j = 0; i < len;)
+        buf[j++] = string_getc(p, &i);
+    JS_FreeValue(ctx, val);
+    *pbuf = buf;
+    return j;
+ fail:
+    *pbuf = NULL;
+    return -1;
+}
+
+static JSValue JS_NewUTF32String(JSContext *ctx, const uint32_t *buf, int len)
+{
+    int i;
+    StringBuffer b_s, *b = &b_s;
+    if (string_buffer_init(ctx, b, len))
+        return JS_EXCEPTION;
+    for(i = 0; i < len; i++) {
+        if (string_buffer_putc(b, buf[i]))
+            goto fail;
+    }
+    return string_buffer_end(b);
+ fail:
+    string_buffer_free(b);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_string_normalize(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv)
+{
+    const char *form, *p;
+    int form_len, is_compat, buf_len, out_len;
+    UnicodeNormalizationEnum n_type;
+    JSValue val;
+    uint32_t *buf, *out_buf;
+
+    val = JS_ToStringCheckObject(ctx, this_val);
+    if (JS_IsException(val))
+        return val;
+    buf_len = JS_ToUTF32String(ctx, &buf, val);
+    JS_FreeValue(ctx, val);
+    if (buf_len < 0)
+        return JS_EXCEPTION;
+
+    if (argc == 0 || JS_IsUndefined(argv[0])) {
+        n_type = UNICODE_NFC;
+    } else {
+        form = JS_ToCStringLen(ctx, &form_len, argv[0], FALSE);
+        if (!form)
+            goto fail1;
+        p = form;
+        if (p[0] != 'N' || p[1] != 'F')
+            goto bad_form;
+        p += 2;
+        is_compat = FALSE;
+        if (*p == 'K') {
+            is_compat = TRUE;
+            p++;
+        }
+        if (*p == 'C' || *p == 'D') {
+            n_type = UNICODE_NFC + is_compat * 2 + (*p - 'C');
+            if ((p + 1 - form) != form_len)
+                goto bad_form;
+        } else {
+        bad_form:
+            JS_FreeCString(ctx, form);
+            JS_ThrowRangeError(ctx, "bad normalization form");
+        fail1:
+            js_free(ctx, buf);
+            return JS_EXCEPTION;
+        }
+        JS_FreeCString(ctx, form);
+    }
+
+    out_len = unicode_normalize(&out_buf, buf, buf_len, n_type,
+                                ctx->rt, (DynBufReallocFunc *)js_realloc_rt);
+    js_free(ctx, buf);
+    if (out_len < 0)
+        return JS_EXCEPTION;
+    val = JS_NewUTF32String(ctx, out_buf, out_len);
+    js_free(ctx, out_buf);
+    return val;
+}
+#endif /* CONFIG_ALL_UNICODE */
+
+/* also used for String.prototype.valueOf */
+static JSValue js_string_toString(JSContext *ctx, JSValueConst this_val,
+                                  int argc, JSValueConst *argv)
+{
+    return js_thisStringValue(ctx, this_val);
+}
+
+#if 0
+static JSValue js_string___toStringCheckObject(JSContext *ctx, JSValueConst this_val,
+                                               int argc, JSValueConst *argv)
+{
+    return JS_ToStringCheckObject(ctx, argv[0]);
+}
+
+static JSValue js_string___toString(JSContext *ctx, JSValueConst this_val,
+                                    int argc, JSValueConst *argv)
+{
+    return JS_ToString(ctx, argv[0]);
+}
+
+static JSValue js_string___advanceStringIndex(JSContext *ctx, JSValueConst
+                                              this_val,
+                                              int argc, JSValueConst *argv)
+{
+    JSValue str;
+    int idx;
+    BOOL is_unicode;
+    JSString *p;
+
+    str = JS_ToString(ctx, argv[0]);
+    if (JS_IsException(str))
+        return str;
+    if (JS_ToInt32Sat(ctx, &idx, argv[1])) {
+        JS_FreeValue(ctx, str);
+        return JS_EXCEPTION;
+    }
+    is_unicode = JS_ToBool(ctx, argv[2]);
+    p = JS_VALUE_GET_STRING(str);
+    if (!is_unicode || (unsigned)idx >= p->len || !p->is_wide_char) {
+        idx++;
+    } else {
+        string_getc(p, &idx);
+    }
+    JS_FreeValue(ctx, str);
+    return JS_NewInt32(ctx, idx);
+}
+#endif
+
+/* String Iterator */
+
+static JSValue js_string_iterator_next(JSContext *ctx, JSValueConst this_val,
+                                       int argc, JSValueConst *argv,
+                                       BOOL *pdone, int magic)
+{
+    JSArrayIteratorData *it;
+    uint32_t idx, c, start;
+    JSString *p;
+
+    it = JS_GetOpaque2(ctx, this_val, JS_CLASS_STRING_ITERATOR);
+    if (!it) {
+        *pdone = FALSE;
+        return JS_EXCEPTION;
+    }
+    if (JS_IsUndefined(it->obj))
+        goto done;
+    p = JS_VALUE_GET_STRING(it->obj);
+    idx = it->idx;
+    if (idx >= p->len) {
+        JS_FreeValue(ctx, it->obj);
+        it->obj = JS_UNDEFINED;
+    done:
+        *pdone = TRUE;
+        return JS_UNDEFINED;
+    }
+
+    start = idx;
+    c = string_getc(p, (int *)&idx);
+    it->idx = idx;
+    *pdone = FALSE;
+    if (c <= 0xffff) {
+        return js_new_string_char(ctx, c);
+    } else {
+        return js_new_string16(ctx, p->u.str16 + start, 2);
+    }
+}
+
+/* ES6 Annex B 2.3.2 etc. */
+enum {
+    magic_string_anchor,
+    magic_string_big,
+    magic_string_blink,
+    magic_string_bold,
+    magic_string_fixed,
+    magic_string_fontcolor,
+    magic_string_fontsize,
+    magic_string_italics,
+    magic_string_link,
+    magic_string_small,
+    magic_string_strike,
+    magic_string_sub,
+    magic_string_sup,
+};
+
+static JSValue js_string_CreateHTML(JSContext *ctx, JSValueConst this_val,
+                                    int argc, JSValueConst *argv, int magic)
+{
+    JSValue str;
+    const JSString *p;
+    StringBuffer b_s, *b = &b_s;
+    static struct { const char *tag, *attr; } const defs[] = {
+        { "a", "name" }, { "big", NULL }, { "blink", NULL }, { "b", NULL },
+        { "tt", NULL }, { "font", "color" }, { "font", "size" }, { "i", NULL },
+        { "a", "href" }, { "small", NULL }, { "strike", NULL }, 
+        { "sub", NULL }, { "sup", NULL },
+    };
+
+    str = JS_ToStringCheckObject(ctx, this_val);
+    if (JS_IsException(str))
+        return JS_EXCEPTION;
+    string_buffer_init(ctx, b, 7);
+    string_buffer_putc8(b, '<');
+    string_buffer_puts8(b, defs[magic].tag);
+    if (defs[magic].attr) {
+        // r += " " + attr + "=\"" + value + "\"";
+        JSValue value;
+        int i;
+
+        string_buffer_putc8(b, ' ');
+        string_buffer_puts8(b, defs[magic].attr);
+        string_buffer_puts8(b, "=\"");
+        value = JS_ToStringCheckObject(ctx, argv[0]);
+        if (JS_IsException(value)) {
+            JS_FreeValue(ctx, str);
+            string_buffer_free(b);
+            return JS_EXCEPTION;
+        }
+        p = JS_VALUE_GET_STRING(value);
+        for (i = 0; i < p->len; i++) {
+            int c = string_get(p, i);
+            if (c == '"') {
+                string_buffer_puts8(b, "&quot;");
+            } else {
+                string_buffer_putc16(b, c);
+            }
+        }
+        JS_FreeValue(ctx, value);
+        string_buffer_putc8(b, '\"');
+    }
+    // return r + ">" + str + "</" + tag + ">";
+    string_buffer_putc8(b, '>');
+    string_buffer_concat_value_free(b, str);
+    string_buffer_puts8(b, "</");
+    string_buffer_puts8(b, defs[magic].tag);
+    string_buffer_putc8(b, '>');
+    return string_buffer_end(b);
+}
+
+static const JSCFunctionListEntry js_string_funcs[] = {
+    JS_CFUNC_DEF("fromCharCode", 1, js_string_fromCharCode ),
+    JS_CFUNC_DEF("fromCodePoint", 1, js_string_fromCodePoint ),
+    JS_CFUNC_DEF("raw", 1, js_string_raw ),
+    //JS_CFUNC_DEF("__toString", 1, js_string___toString ),
+    //JS_CFUNC_DEF("__isSpace", 1, js_string___isSpace ),
+    //JS_CFUNC_DEF("__toStringCheckObject", 1, js_string___toStringCheckObject ),
+    //JS_CFUNC_DEF("__advanceStringIndex", 3, js_string___advanceStringIndex ),
+    //JS_CFUNC_DEF("__GetSubstitution", 6, js_string___GetSubstitution ),
+};
+
+static const JSCFunctionListEntry js_string_proto_funcs[] = {
+    JS_PROP_INT32_DEF("length", 0, JS_PROP_CONFIGURABLE ),
+    JS_CFUNC_DEF("charCodeAt", 1, js_string_charCodeAt ),
+    JS_CFUNC_DEF("charAt", 1, js_string_charAt ),
+    JS_CFUNC_DEF("concat", 1, js_string_concat ),
+    JS_CFUNC_DEF("codePointAt", 1, js_string_codePointAt ),
+    JS_CFUNC_MAGIC_DEF("indexOf", 1, js_string_indexOf, 0 ),
+    JS_CFUNC_MAGIC_DEF("lastIndexOf", 1, js_string_indexOf, 1 ),
+    JS_CFUNC_MAGIC_DEF("includes", 1, js_string_includes, 0 ),
+    JS_CFUNC_MAGIC_DEF("endsWith", 1, js_string_includes, 2 ),
+    JS_CFUNC_MAGIC_DEF("startsWith", 1, js_string_includes, 1 ),
+    JS_CFUNC_MAGIC_DEF("match", 1, js_string_match, JS_ATOM_Symbol_match ),
+    JS_CFUNC_MAGIC_DEF("search", 1, js_string_match, JS_ATOM_Symbol_search ),
+    JS_CFUNC_DEF("split", 2, js_string_split ),
+    JS_CFUNC_DEF("substring", 2, js_string_substring ),
+    JS_CFUNC_DEF("substr", 2, js_string_substr ),
+    JS_CFUNC_DEF("slice", 2, js_string_slice ),
+    JS_CFUNC_DEF("repeat", 1, js_string_repeat ),
+    JS_CFUNC_DEF("replace", 2, js_string_replace ),
+    JS_CFUNC_MAGIC_DEF("padEnd", 1, js_string_pad, 1 ),
+    JS_CFUNC_MAGIC_DEF("padStart", 1, js_string_pad, 0 ),
+    JS_CFUNC_MAGIC_DEF("trim", 0, js_string_trim, 3 ),
+    JS_CFUNC_MAGIC_DEF("trimEnd", 0, js_string_trim, 2 ),
+    JS_ALIAS_DEF("trimRight", "trimEnd" ),
+    JS_CFUNC_MAGIC_DEF("trimStart", 0, js_string_trim, 1 ),
+    JS_ALIAS_DEF("trimLeft", "trimStart" ),
+    JS_CFUNC_DEF("toString", 0, js_string_toString ),
+    JS_CFUNC_DEF("valueOf", 0, js_string_toString ),
+    JS_CFUNC_DEF("__quote", 1, js_string___quote ),
+    JS_CFUNC_DEF("localeCompare", 1, js_string_localeCompare ),
+    JS_CFUNC_MAGIC_DEF("toLowerCase", 0, js_string_toLowerCase, 1 ),
+    JS_CFUNC_MAGIC_DEF("toUpperCase", 0, js_string_toLowerCase, 0 ),
+    JS_CFUNC_MAGIC_DEF("toLocaleLowerCase", 0, js_string_toLowerCase, 1 ),
+    JS_CFUNC_MAGIC_DEF("toLocaleUpperCase", 0, js_string_toLowerCase, 0 ),
+    JS_CFUNC_MAGIC_DEF("[Symbol.iterator]", 0, js_create_array_iterator, JS_ITERATOR_KIND_VALUE | 4 ),
+    /* ES6 Annex B 2.3.2 etc. */
+    JS_CFUNC_MAGIC_DEF("anchor", 1, js_string_CreateHTML, magic_string_anchor ),
+    JS_CFUNC_MAGIC_DEF("big", 0, js_string_CreateHTML, magic_string_big ),
+    JS_CFUNC_MAGIC_DEF("blink", 0, js_string_CreateHTML, magic_string_blink ),
+    JS_CFUNC_MAGIC_DEF("bold", 0, js_string_CreateHTML, magic_string_bold ),
+    JS_CFUNC_MAGIC_DEF("fixed", 0, js_string_CreateHTML, magic_string_fixed ),
+    JS_CFUNC_MAGIC_DEF("fontcolor", 1, js_string_CreateHTML, magic_string_fontcolor ),
+    JS_CFUNC_MAGIC_DEF("fontsize", 1, js_string_CreateHTML, magic_string_fontsize ),
+    JS_CFUNC_MAGIC_DEF("italics", 0, js_string_CreateHTML, magic_string_italics ),
+    JS_CFUNC_MAGIC_DEF("link", 1, js_string_CreateHTML, magic_string_link ),
+    JS_CFUNC_MAGIC_DEF("small", 0, js_string_CreateHTML, magic_string_small ),
+    JS_CFUNC_MAGIC_DEF("strike", 0, js_string_CreateHTML, magic_string_strike ),
+    JS_CFUNC_MAGIC_DEF("sub", 0, js_string_CreateHTML, magic_string_sub ),
+    JS_CFUNC_MAGIC_DEF("sup", 0, js_string_CreateHTML, magic_string_sup ),
+};
+
+static const JSCFunctionListEntry js_string_iterator_proto_funcs[] = {
+    JS_ITERATOR_NEXT_DEF("next", 0, js_string_iterator_next, 0 ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "String Iterator", JS_PROP_CONFIGURABLE ),
+};
+
+#ifdef CONFIG_ALL_UNICODE
+static const JSCFunctionListEntry js_string_proto_normalize[] = {
+    JS_CFUNC_DEF("normalize", 0, js_string_normalize ),
+};
+#endif
+
+void JS_AddIntrinsicStringNormalize(JSContext *ctx)
+{
+#ifdef CONFIG_ALL_UNICODE
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_STRING], js_string_proto_normalize,
+                               countof(js_string_proto_normalize));
+#endif
+}
+
+/* Math */
+
+/* precondition: a and b are not NaN */
+static double js_fmin(double a, double b)
+{
+    if (a == 0 && b == 0) {
+        JSFloat64Union a1, b1;
+        a1.d = a;
+        b1.d = b;
+        a1.u64 |= b1.u64;
+        return a1.d;
+    } else {
+        return fmin(a, b);
+    }
+}
+
+/* precondition: a and b are not NaN */
+static double js_fmax(double a, double b)
+{
+    if (a == 0 && b == 0) {
+        JSFloat64Union a1, b1;
+        a1.d = a;
+        b1.d = b;
+        a1.u64 &= b1.u64;
+        return a1.d;
+    } else {
+        return fmax(a, b);
+    }
+}
+
+#ifdef CONFIG_BIGNUM
+
+enum {
+    MATH_OP_ABS,
+    MATH_OP_FLOOR,
+    MATH_OP_CEIL,
+    MATH_OP_ROUND,
+    MATH_OP_TRUNC,
+    MATH_OP_SQRT,
+    MATH_OP_FPROUND,
+    MATH_OP_ACOS,
+    MATH_OP_ASIN,
+    MATH_OP_ATAN,
+    MATH_OP_ATAN2,
+    MATH_OP_COS,
+    MATH_OP_EXP,
+    MATH_OP_LOG,
+    MATH_OP_POW,
+    MATH_OP_SIN,
+    MATH_OP_TAN,
+    MATH_OP_FMOD,
+    MATH_OP_REM,
+    MATH_OP_SIGN,
+
+    MATH_OP_ADD,
+    MATH_OP_SUB,
+    MATH_OP_MUL,
+    MATH_OP_DIV,
+};
+
+static JSValue js_math_fop(JSContext *ctx, JSValueConst this_val,
+                           int argc, JSValueConst *argv, int magic)
+{
+    bf_t a_s, *a, r_s, *r = &r_s;
+    BOOL is_float;
+    JSFloatEnv *fe;
+    int rnd_mode;
+    JSValue op1;
+
+    op1 = JS_ToNumber(ctx, argv[0]);
+    if (JS_IsException(op1))
+        return op1;
+    a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+    fe = &ctx->fp_env;
+    if (argc > 1) {
+        fe = JS_GetOpaque2(ctx, argv[1], JS_CLASS_FLOAT_ENV);
+        if (!fe) {
+            if (a == &a_s)
+                bf_delete(a);
+            JS_FreeValue(ctx, op1);
+            return JS_EXCEPTION;
+        }
+    }
+
+    bf_init(ctx->bf_ctx, r);
+    switch (magic) {
+    case MATH_OP_ABS:
+        bf_set(r, a);
+        r->sign = 0;
+        break;
+    case MATH_OP_FLOOR:
+        rnd_mode = BF_RNDD;
+        goto rint;
+    case MATH_OP_CEIL:
+        rnd_mode = BF_RNDU;
+        goto rint;
+    case MATH_OP_ROUND:
+        rnd_mode = BF_RNDNU;
+        goto rint;
+    case MATH_OP_TRUNC:
+        rnd_mode = BF_RNDZ;
+    rint:
+        bf_set(r, a);
+        fe->status |= bf_rint(r, fe->prec,
+                              (fe->flags & ~BF_RND_MASK) | rnd_mode);
+        break;
+    case MATH_OP_SQRT:
+        fe->status |= bf_sqrt(r, a, fe->prec, fe->flags);
+        break;
+    case MATH_OP_FPROUND:
+        bf_set(r, a);
+        fe->status |= bf_round(r, fe->prec, fe->flags);
+        break;
+    case MATH_OP_ACOS:
+        fe->status |= bf_acos(r, a, fe->prec, fe->flags);
+        break;
+    case MATH_OP_ASIN:
+        fe->status |= bf_asin(r, a, fe->prec, fe->flags);
+        break;
+    case MATH_OP_ATAN:
+        fe->status |= bf_atan(r, a, fe->prec, fe->flags);
+        break;
+    case MATH_OP_COS:
+        fe->status |= bf_cos(r, a, fe->prec, fe->flags);
+        break;
+    case MATH_OP_EXP:
+        fe->status |= bf_exp(r, a, fe->prec, fe->flags);
+        break;
+    case MATH_OP_LOG:
+        fe->status |= bf_log(r, a, fe->prec, fe->flags);
+        break;
+    case MATH_OP_SIN:
+        fe->status |= bf_sin(r, a, fe->prec, fe->flags);
+        break;
+    case MATH_OP_TAN:
+        fe->status |= bf_tan(r, a, fe->prec, fe->flags);
+        break;
+    case MATH_OP_SIGN:
+        if (bf_is_nan(a) || bf_is_zero(a)) {
+            bf_set(r, a);
+        } else {
+            bf_set_si(r, 1 - 2 * a->sign);
+        }
+        break;
+    default:
+        abort();
+    }
+    if (a == &a_s)
+        bf_delete(a);
+    JS_FreeValue(ctx, op1);
+    return JS_NewBigFloat(ctx, r);
+}
+
+static JSValue js_math_fop2(JSContext *ctx, JSValueConst this_val,
+                            int argc, JSValueConst *argv, int magic)
+{
+    bf_t a_s, *a, b_s, *b, r_s, *r = &r_s;
+    BOOL is_float;
+    JSFloatEnv *fe;
+    JSValue op1, op2;
+
+    op1 = JS_ToNumber(ctx, argv[0]);
+    if (JS_IsException(op1))
+        return op1;
+    op2 = JS_ToNumber(ctx, argv[1]);
+    if (JS_IsException(op2)) {
+        JS_FreeValue(ctx, op1);
+        return op2;
+    }
+    a = JS_ToBigFloat(ctx, &is_float, &a_s, op1);
+    b = JS_ToBigFloat(ctx, &is_float, &b_s, op2);
+    fe = &ctx->fp_env;
+    if (argc > 2) {
+        fe = JS_GetOpaque2(ctx, argv[2], JS_CLASS_FLOAT_ENV);
+        if (!fe) {
+            if (a == &a_s)
+                bf_delete(a);
+            if (b == &b_s)
+                bf_delete(b);
+            JS_FreeValue(ctx, op1);
+            JS_FreeValue(ctx, op2);
+            return JS_EXCEPTION;
+        }
+    }
+
+    bf_init(ctx->bf_ctx, r);
+    switch (magic) {
+    case MATH_OP_ATAN2:
+        fe->status |= bf_atan2(r, a, b, fe->prec, fe->flags);
+        break;
+    case MATH_OP_POW:
+        fe->status |= bf_pow(r, a, b, fe->prec, fe->flags | BF_POW_JS_QUICKS);
+        break;
+    case MATH_OP_FMOD:
+        fe->status |= bf_fmod(r, a, b, fe->prec, fe->flags);
+        break;
+    case MATH_OP_REM:
+        fe->status |= bf_remainder(r, a, b, fe->prec, fe->flags);
+        break;
+    case MATH_OP_ADD:
+        fe->status |= bf_add(r, a, b, fe->prec, fe->flags);
+        break;
+    case MATH_OP_SUB:
+        fe->status |= bf_sub(r, a, b, fe->prec, fe->flags);
+        break;
+    case MATH_OP_MUL:
+        fe->status |= bf_mul(r, a, b, fe->prec, fe->flags);
+        break;
+    case MATH_OP_DIV:
+        fe->status |= bf_div(r, a, b, fe->prec, fe->flags);
+        break;
+    default:
+        abort();
+    }
+    if (a == &a_s)
+        bf_delete(a);
+    if (b == &b_s)
+        bf_delete(b);
+    JS_FreeValue(ctx, op1);
+    JS_FreeValue(ctx, op2);
+    return JS_NewBigFloat(ctx, r);
+}
+
+static JSValue js_math_min_max(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv, int magic)
+{
+    BOOL is_max = magic;
+    JSValue val, ret;
+    int i;
+    uint32_t tag;
+
+    if (unlikely(argc == 0)) {
+        return __JS_NewFloat64(ctx, is_max ? -1.0 / 0.0 : 1.0 / 0.0);
+    }
+
+    tag = JS_VALUE_GET_TAG(argv[0]);
+    if (tag == JS_TAG_INT) {
+        int a1, r1 = JS_VALUE_GET_INT(argv[0]);
+        for(i = 1; i < argc; i++) {
+            tag = JS_VALUE_GET_TAG(argv[i]);
+            if (tag != JS_TAG_INT) {
+                ret = JS_NewInt32(ctx, r1);
+                goto generic_case;
+            }
+            a1 = JS_VALUE_GET_INT(argv[i]);
+            if (is_max)
+                r1 = max_int(r1, a1);
+            else
+                r1 = min_int(r1, a1);
+        }
+        ret = JS_NewInt32(ctx, r1);
+    } else {
+        ret = JS_ToNumber(ctx, argv[0]);
+        if (JS_IsException(ret))
+            return ret;
+        i = 1;
+    generic_case:
+        for(; i < argc; i++) {
+            val = JS_ToNumber(ctx, argv[i]);
+            if (JS_IsException(val)) {
+                JS_FreeValue(ctx, ret);
+                return val;
+            }
+            if (JS_TAG_IS_FLOAT64(JS_VALUE_GET_TAG(ret)) &&
+                JS_TAG_IS_FLOAT64(JS_VALUE_GET_TAG(val))) {
+                double r, a;
+                r = JS_VALUE_GET_FLOAT64(ret);
+                a = JS_VALUE_GET_FLOAT64(val);
+                if (!isnan(r)) {
+                    if (isnan(a)) {
+                        r = a;
+                    } else {
+                        if (is_max)
+                            r = js_fmax(r, a);
+                        else
+                            r = js_fmin(r, a);
+                    }
+                    ret = __JS_NewFloat64(ctx, r);
+                }
+            } else {
+                bf_t a_s, *a, r_s, *r;
+                BOOL is_float;
+                int res;
+
+                r = JS_ToBigFloat(ctx, &is_float, &r_s, ret);
+                if (!bf_is_nan(r)) {
+                    a = JS_ToBigFloat(ctx, &is_float, &a_s, val);
+                    res = bf_cmp_full(a, r);
+                    if (is_max)
+                        res = -res;
+                    if (bf_is_nan(a) || res < 0) {
+                        JS_FreeValue(ctx, ret);
+                        ret = JS_DupValue(ctx, val);
+                    }
+                    if (a == &a_s)
+                        bf_delete(a);
+                }
+                if (r == &r_s)
+                    bf_delete(r);
+            }
+        }
+    }
+    return ret;
+}
+
+static JSValue js_math_abs(JSContext *ctx, JSValueConst this_val,
+                           int argc, JSValueConst *argv)
+{
+    JSValue val;
+    uint32_t tag;
+
+    val = JS_ToNumeric(ctx, argv[0]);
+    tag = JS_VALUE_GET_NORM_TAG(val);
+    switch(tag) {
+    case JS_TAG_INT:
+        if (JS_VALUE_GET_INT(val) < 0)
+            val = JS_NewInt64(ctx, -(int64_t)JS_VALUE_GET_INT(val));
+        break;
+    case JS_TAG_FLOAT64:
+        val = __JS_NewFloat64(ctx, fabs(JS_VALUE_GET_FLOAT64(val)));
+        break;
+    case JS_TAG_BIG_FLOAT:
+    case JS_TAG_BIG_INT:
+        {
+            JSBigFloat *p = JS_VALUE_GET_PTR(val);
+            bf_t r_s, *r = &r_s;
+            bf_init(ctx->bf_ctx, r);
+            bf_set(r, &p->num);
+            r->sign = 0;
+            JS_FreeValue(ctx, val);
+            if (tag == JS_TAG_BIG_FLOAT)
+                val = JS_NewBigFloat(ctx, r);
+            else
+                val = JS_NewBigInt2(ctx, r, TRUE);
+        }
+        break;
+    default:
+        break;
+    }
+    return val;
+}
+
+#if 0
+/* XXX: should give exact rounding */
+/* XXX: correct NaN/Infinity handling */
+static JSValue js_math_hypot(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv)
+{
+    bf_t a_s, *a, r_s, *r = &r_s, r2_s, *r2 = &r2_s;
+    JSValue val;
+    int i;
+    BOOL is_float;
+
+    bf_init(ctx->bf_ctx, r);
+    bf_set_si(r, 0);
+    for(i = 0; i < argc; i++) {
+        val = JS_ToNumber(ctx, argv[i]);
+        if (JS_IsException(val)) {
+            bf_delete(r);
+            return val;
+        }
+        a = JS_ToBigFloat(ctx, &is_float, &a_s, val);
+        bf_add(r, r, a, ctx->fp_env.prec, ctx->fp_env.flags);
+        if (a == &a_s)
+            bf_delete(a);
+    }
+    bf_init(ctx->bf_ctx, r2);
+    bf_sqrt(r2, r, ctx->fp_env.prec, ctx->fp_env.flags);
+    bf_delete(r);
+    return JS_NewBigFloat(ctx, r2);
+}
+#endif
+
+#else
+
+static JSValue js_math_min_max(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv, int magic)
+{
+    BOOL is_max = magic;
+    double r, a;
+    int i;
+    uint32_t tag;
+
+    if (unlikely(argc == 0)) {
+#if defined(_MSC_VER)
+		return __JS_NewFloat64(ctx, is_max ? -Infinite() : Infinite());
+#else
+        return __JS_NewFloat64(ctx, is_max ? -1.0 / 0.0 : 1.0 / 0.0);
+#endif
+    }
+
+    tag = JS_VALUE_GET_TAG(argv[0]);
+    if (tag == JS_TAG_INT) {
+        int a1, r1 = JS_VALUE_GET_INT(argv[0]);
+        for(i = 1; i < argc; i++) {
+            tag = JS_VALUE_GET_TAG(argv[i]);
+            if (tag != JS_TAG_INT) {
+                r = r1;
+                goto generic_case;
+            }
+            a1 = JS_VALUE_GET_INT(argv[i]);
+            if (is_max)
+                r1 = max_int(r1, a1);
+            else
+                r1 = min_int(r1, a1);
+
+        }
+        return JS_NewInt32(ctx, r1);
+    } else {
+        if (JS_ToFloat64(ctx, &r, argv[0]))
+            return JS_EXCEPTION;
+        i = 1;
+    generic_case:
+        while (i < argc) {
+            if (JS_ToFloat64(ctx, &a, argv[i]))
+                return JS_EXCEPTION;
+            if (!isnan(r)) {
+                if (isnan(a)) {
+                    r = a;
+                } else {
+                    if (is_max)
+                        r = js_fmax(r, a);
+                    else
+                        r = js_fmin(r, a);
+                }
+            }
+            i++;
+        }
+        return JS_NewFloat64(ctx, r);
+    }
+}
+
+#endif /* !CONFIG_BIGNUM */
+
+static double js_math_sign(double a)
+{
+    if (isnan(a) || a == 0.0)
+        return a;
+    if (a < 0)
+        return -1;
+    else
+        return 1;
+}
+
+static double js_math_round(double a)
+{
+    JSFloat64Union u;
+    uint64_t frac_mask, one;
+    unsigned int e, s;
+
+    u.d = a;
+    e = (u.u64 >> 52) & 0x7ff;
+    if (e < 1023) {
+        /* abs(a) < 1 */
+        if (e == (1023 - 1) && u.u64 != 0xbfe0000000000000) {
+            /* abs(a) > 0.5 or a = 0.5: return +/-1.0 */
+            u.u64 = (u.u64 & ((uint64_t)1 << 63)) | ((uint64_t)1023 << 52);
+        } else {
+            /* return +/-0.0 */
+            u.u64 &= (uint64_t)1 << 63;
+        }
+    } else if (e < (1023 + 52)) {
+        s = u.u64 >> 63;
+        one = (uint64_t)1 << (52 - (e - 1023));
+        frac_mask = one - 1;
+        u.u64 += (one >> 1) - s;
+        u.u64 &= ~frac_mask; /* truncate to an integer */
+    }
+    /* otherwise: abs(a) >= 2^52, or NaN, +/-Infinity: no change */
+    return u.d;
+}
+
+static JSValue js_math_hypot(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv)
+{
+    double r, a, b;
+    int i;
+
+    if (argc == 2) {
+        /* use the more precise built-in function when possible */
+        if (JS_ToFloat64(ctx, &a, argv[0]))
+            return JS_EXCEPTION;
+        if (JS_ToFloat64(ctx, &b, argv[1]))
+            return JS_EXCEPTION;
+        r = hypot(a, b);
+    } else {
+        r = 0;
+        for(i = 0; i < argc; i++) {
+            if (JS_ToFloat64(ctx, &a, argv[i]))
+                return JS_EXCEPTION;
+            r += a;
+        }
+        r = sqrt(r);
+    }
+    return JS_NewFloat64(ctx, r);
+}
+
+static double js_math_fround(double a)
+{
+    return (float)a;
+}
+
+static JSValue js_math_imul(JSContext *ctx, JSValueConst this_val,
+                            int argc, JSValueConst *argv)
+{
+    int a, b;
+
+    if (JS_ToInt32(ctx, &a, argv[0]))
+        return JS_EXCEPTION;
+    if (JS_ToInt32(ctx, &b, argv[1]))
+        return JS_EXCEPTION;
+    /* purposely ignoring overflow */
+    return JS_NewInt32(ctx, a * b);
+}
+
+static JSValue js_math_clz32(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv)
+{
+    uint32_t a, r;
+
+    if (JS_ToUint32(ctx, &a, argv[0]))
+        return JS_EXCEPTION;
+    if (a == 0)
+        r = 32;
+    else
+        r = clz32(a);
+    return JS_NewInt32(ctx, r);
+}
+
+/* xorshift* random number generator by Marsaglia */
+static uint64_t xorshift64star(uint64_t *pstate)
+{
+    uint64_t x;
+    x = *pstate;
+    x ^= x >> 12;
+    x ^= x << 25;
+    x ^= x >> 27;
+    *pstate = x;
+    return x * 0x2545F4914F6CDD1D;
+}
+
+static void js_random_init(JSContext *ctx)
+{
+    //struct timeval tv;
+    //gettimeofday(&tv, NULL);
+    //ctx->random_state = ((int64_t)tv.tv_sec * 1000000) + tv.tv_usec;
+	ctx->random_state = 0;
+    /* the state must be non zero */
+    if (ctx->random_state == 0)
+        ctx->random_state = 1;
+}
+
+static JSValue js_math_random(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv)
+{
+    JSFloat64Union u;
+    uint64_t v;
+
+    v = xorshift64star(&ctx->random_state);
+    /* 1.0 <= u.d < 2 */
+    u.u64 = ((uint64_t)0x3ff << 52) | (v >> 12);
+    return __JS_NewFloat64(ctx, u.d - 1.0);
+}
+
+static double floor_proxy(double val)
+{
+	return floor(val);
+}
+
+static double ceil_proxy(double val)
+{
+	return ceil(val);
+}
+
+static const JSCFunctionListEntry js_math_funcs[] = {
+    JS_CFUNC_MAGIC_DEF("min", 2, js_math_min_max, 0 ),
+    JS_CFUNC_MAGIC_DEF("max", 2, js_math_min_max, 1 ),
+#ifdef CONFIG_BIGNUM
+    JS_CFUNC_DEF("abs", 1, js_math_abs ),
+#else
+    JS_CFUNC_SPECIAL_DEF("abs", 1, f_f, fabs ),
+#endif
+    JS_CFUNC_SPECIAL_DEF("floor", 1, f_f, &floor_proxy ),
+    JS_CFUNC_SPECIAL_DEF("ceil", 1, f_f, &ceil_proxy ),
+    JS_CFUNC_SPECIAL_DEF("round", 1, f_f, js_math_round ),
+    JS_CFUNC_SPECIAL_DEF("sqrt", 1, f_f, sqrt ),
+
+    JS_CFUNC_SPECIAL_DEF("acos", 1, f_f, acos ),
+    JS_CFUNC_SPECIAL_DEF("asin", 1, f_f, asin ),
+    JS_CFUNC_SPECIAL_DEF("atan", 1, f_f, atan ),
+    JS_CFUNC_SPECIAL_DEF("atan2", 2, f_f_f, atan2 ),
+    JS_CFUNC_SPECIAL_DEF("cos", 1, f_f, cos ),
+    JS_CFUNC_SPECIAL_DEF("exp", 1, f_f, exp ),
+    JS_CFUNC_SPECIAL_DEF("log", 1, f_f, log ),
+    JS_CFUNC_SPECIAL_DEF("pow", 2, f_f_f, js_pow ),
+    JS_CFUNC_SPECIAL_DEF("sin", 1, f_f, sin ),
+    JS_CFUNC_SPECIAL_DEF("tan", 1, f_f, tan ),
+    /* ES6 */
+    JS_CFUNC_SPECIAL_DEF("trunc", 1, f_f, trunc ),
+    JS_CFUNC_SPECIAL_DEF("sign", 1, f_f, js_math_sign ),
+    JS_CFUNC_SPECIAL_DEF("cosh", 1, f_f, cosh ),
+    JS_CFUNC_SPECIAL_DEF("sinh", 1, f_f, sinh ),
+    JS_CFUNC_SPECIAL_DEF("tanh", 1, f_f, tanh ),
+    JS_CFUNC_SPECIAL_DEF("acosh", 1, f_f, acosh ),
+    JS_CFUNC_SPECIAL_DEF("asinh", 1, f_f, asinh ),
+    JS_CFUNC_SPECIAL_DEF("atanh", 1, f_f, atanh ),
+    JS_CFUNC_SPECIAL_DEF("expm1", 1, f_f, expm1 ),
+    JS_CFUNC_SPECIAL_DEF("log1p", 1, f_f, log1p ),
+    JS_CFUNC_SPECIAL_DEF("log2", 1, f_f, log2 ),
+    JS_CFUNC_SPECIAL_DEF("log10", 1, f_f, log10 ),
+    JS_CFUNC_SPECIAL_DEF("cbrt", 1, f_f, cbrt ),
+    JS_CFUNC_DEF("hypot", 2, js_math_hypot ),
+    JS_CFUNC_DEF("random", 0, js_math_random ),
+    JS_CFUNC_SPECIAL_DEF("fround", 1, f_f, js_math_fround ),
+    JS_CFUNC_DEF("imul", 2, js_math_imul ),
+    JS_CFUNC_DEF("clz32", 1, js_math_clz32 ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "Math", JS_PROP_CONFIGURABLE ),
+    JS_PROP_DOUBLE_DEF("E", 2.718281828459045, 0 ),
+    JS_PROP_DOUBLE_DEF("LN10", 2.302585092994046, 0 ),
+    JS_PROP_DOUBLE_DEF("LN2", 0.6931471805599453, 0 ),
+    JS_PROP_DOUBLE_DEF("LOG2E", 1.4426950408889634, 0 ),
+    JS_PROP_DOUBLE_DEF("LOG10E", 0.4342944819032518, 0 ),
+    JS_PROP_DOUBLE_DEF("PI", 3.141592653589793, 0 ),
+    JS_PROP_DOUBLE_DEF("SQRT1_2", 0.7071067811865476, 0 ),
+    JS_PROP_DOUBLE_DEF("SQRT2", 1.4142135623730951, 0 ),
+};
+
+static const JSCFunctionListEntry js_math_obj[] = {
+    JS_OBJECT_DEF("Math", js_math_funcs, countof(js_math_funcs), JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE ),
+};
+
+/* Date */
+
+#if 0
+/* OS dependent: return the UTC time in ms since 1970. */
+static JSValue js___date_now(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv)
+{
+    int64_t d;
+    //struct timeval tv;
+    //gettimeofday(&tv, NULL);
+    //d = (int64_t)tv.tv_sec * 1000 + (tv.tv_usec / 1000);
+	d = 0;
+    return JS_NewInt64(ctx, d);
+}
+#endif
+
+/* OS dependent: return the UTC time in microseconds since 1970. */
+static JSValue js___date_clock(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv)
+{
+    int64_t d;
+    //struct timeval tv;
+    //gettimeofday(&tv, NULL);
+    //d = (int64_t)tv.tv_sec * 1000000 + tv.tv_usec;
+	d = 0;
+    return JS_NewInt64(ctx, d);
+}
+
+/* OS dependent. d = argv[0] is in ms from 1970. Return the difference
+   between local time and UTC time 'd' in minutes */
+static int getTimezoneOffset(int64_t time) {
+#if defined(_WIN32)
+    /* XXX: TODO */
+    return 0;
+#else
+    time_t ti;
+    struct tm tm;
+
+    time /= 1000; /* convert to seconds */
+    if (sizeof(time_t) == 4) {
+        /* on 32-bit systems, we need to clamp the time value to the
+           range of `time_t`. This is better than truncating values to
+           32 bits and hopefully provides the same result as 64-bit
+           implementation of localtime_r.
+         */
+        if ((time_t)-1 < 0) {
+            if (time < INT32_MIN) {
+                time = INT32_MIN;
+            } else if (time > INT32_MAX) {
+                time = INT32_MAX;
+            }
+        } else {
+            if (time < 0) {
+                time = 0;
+            } else if (time > UINT32_MAX) {
+                time = UINT32_MAX;
+            }
+        }
+    }
+    ti = time;
+    localtime_r(&ti, &tm);
+    return -tm.tm_gmtoff / 60;
+#endif
+}
+
+#if 0
+static JSValue js___date_getTimezoneOffset(JSContext *ctx, JSValueConst this_val,
+                                           int argc, JSValueConst *argv)
+{
+    double dd;
+
+    if (JS_ToFloat64(ctx, &dd, argv[0]))
+        return JS_EXCEPTION;
+    if (isnan(dd))
+        return __JS_NewFloat64(ctx, dd);
+    else
+        return JS_NewInt32(ctx, getTimezoneOffset((int64_t)dd));
+}
+
+/* create a new date object */
+static JSValue js___date_create(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    JSValue obj, proto;
+    proto = js_get_prototype_from_ctor(ctx, argv[0], argv[1]);
+    if (JS_IsException(proto))
+        return proto;
+    obj = JS_NewObjectProtoClass(ctx, proto, JS_CLASS_DATE);
+    JS_FreeValue(ctx, proto);
+    if (!JS_IsException(obj))
+        JS_SetObjectData(ctx, obj, JS_DupValue(ctx, argv[2]));
+    return obj;
+}
+#endif
+
+/* RegExp */
+
+static void js_regexp_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    JSRegExp *re = &p->u.regexp;
+    JS_FreeValueRT(rt, JS_MKPTR(JS_TAG_STRING, re->bytecode));
+    JS_FreeValueRT(rt, JS_MKPTR(JS_TAG_STRING, re->pattern));
+}
+
+/* create a string containing the RegExp bytecode */
+static JSValue js_compile_regexp(JSContext *ctx, JSValueConst pattern,
+                                 JSValueConst flags)
+{
+    const char *str;
+    int re_flags, mask;
+    uint8_t *re_bytecode_buf;
+    int re_bytecode_len, i, len;
+    JSValue ret;
+    char error_msg[64];
+
+    re_flags = 0;
+    if (!JS_IsUndefined(flags)) {
+        str = JS_ToCStringLen(ctx, &len, flags, FALSE);
+        if (!str)
+            return JS_EXCEPTION;
+        /* XXX: re_flags = LRE_FLAG_OCTAL unless strict mode? */
+        for (i = 0; i < len; i++) {
+            switch(str[i]) {
+            case 'g':
+                mask = LRE_FLAG_GLOBAL;
+                break;
+            case 'i':
+                mask = LRE_FLAG_IGNORECASE;
+                break;
+            case 'm':
+                mask = LRE_FLAG_MULTILINE;
+                break;
+            case 's':
+                mask = LRE_FLAG_DOTALL;
+                break;
+            case 'u':
+                mask = LRE_FLAG_UTF16;
+                break;
+            case 'y':
+                mask = LRE_FLAG_STICKY;
+                break;
+            default:
+                goto bad_flags;
+            }
+            if ((re_flags & mask) != 0) {
+            bad_flags:
+                JS_FreeCString(ctx, str);
+                return JS_ThrowSyntaxError(ctx, "invalid regular expression flags");
+            }
+            re_flags |= mask;
+        }
+        JS_FreeCString(ctx, str);
+    }
+
+    str = JS_ToCStringLen(ctx, &len, pattern, !(re_flags & LRE_FLAG_UTF16));
+    if (!str)
+        return JS_EXCEPTION;
+    re_bytecode_buf = lre_compile(&re_bytecode_len, error_msg,
+                                  sizeof(error_msg), str, len, re_flags, ctx);
+    JS_FreeCString(ctx, str);
+    if (!re_bytecode_buf) {
+        JS_ThrowSyntaxError(ctx, "%s", error_msg);
+        return JS_EXCEPTION;
+    }
+
+    ret = js_new_string8(ctx, re_bytecode_buf, re_bytecode_len);
+    js_free(ctx, re_bytecode_buf);
+    return ret;
+}
+
+/* create a RegExp object from a string containing the RegExp bytecode
+   and the source pattern */
+static JSValue js_regexp_constructor_internal(JSContext *ctx, JSValueConst ctor,
+                                              JSValue pattern, JSValue bc)
+{
+    JSValue obj;
+    JSObject *p;
+    JSRegExp *re;
+
+    /* sanity check */
+    if (JS_VALUE_GET_TAG(bc) != JS_TAG_STRING ||
+        JS_VALUE_GET_TAG(pattern) != JS_TAG_STRING) {
+        JS_ThrowTypeError(ctx, "string expected");
+    fail:
+        JS_FreeValue(ctx, bc);
+        JS_FreeValue(ctx, pattern);
+        return JS_EXCEPTION;
+    }
+
+    obj = js_create_from_ctor(ctx, ctor, JS_CLASS_REGEXP);
+    if (JS_IsException(obj))
+        goto fail;
+    p = JS_VALUE_GET_OBJ(obj);
+    re = &p->u.regexp;
+    re->pattern = JS_VALUE_GET_STRING(pattern);
+    re->bytecode = JS_VALUE_GET_STRING(bc);
+    JS_DefinePropertyValue(ctx, obj, JS_ATOM_lastIndex, JS_NewInt32(ctx, 0),
+                           JS_PROP_WRITABLE);
+    return obj;
+}
+
+static JSRegExp *js_get_regexp(JSContext *ctx, JSValueConst obj, BOOL throw_error)
+{
+    if (JS_VALUE_GET_TAG(obj) == JS_TAG_OBJECT) {
+        JSObject *p = JS_VALUE_GET_OBJ(obj);
+        if (p->class_id == JS_CLASS_REGEXP)
+            return &p->u.regexp;
+    }
+    if (throw_error) {
+        JS_ThrowTypeErrorInvalidClass(ctx, JS_CLASS_REGEXP);
+    }
+    return NULL;
+}
+
+/* return < 0 if exception or TRUE/FALSE */
+static int js_is_regexp(JSContext *ctx, JSValueConst obj)
+{
+    JSValue m;
+
+    if (!JS_IsObject(obj))
+        return FALSE;
+    m = JS_GetProperty(ctx, obj, JS_ATOM_Symbol_match);
+    if (JS_IsException(m))
+        return -1;
+    if (!JS_IsUndefined(m))
+        return JS_ToBoolFree(ctx, m);
+    return js_get_regexp(ctx, obj, FALSE) != NULL;
+}
+
+static JSValue js_regexp_constructor(JSContext *ctx, JSValueConst new_target,
+                                     int argc, JSValueConst *argv)
+{
+    JSValue pattern, flags, bc, val;
+    JSValueConst pat, flags1;
+    JSRegExp *re;
+    int pat_is_regexp;
+
+    pat = argv[0];
+    flags1 = argv[1];
+    pat_is_regexp = js_is_regexp(ctx, pat);
+    if (pat_is_regexp < 0)
+        return JS_EXCEPTION;
+    if (JS_IsUndefined(new_target)) {
+        /* called as a function */
+        new_target = JS_GetActiveFunction(ctx);
+        if (pat_is_regexp && JS_IsUndefined(flags1)) {
+            JSValue ctor;
+            BOOL res;
+            ctor = JS_GetProperty(ctx, pat, JS_ATOM_constructor);
+            if (JS_IsException(ctor))
+                return ctor;
+            res = js_same_value(ctx, ctor, new_target);
+            JS_FreeValue(ctx, ctor);
+            if (res)
+                return JS_DupValue(ctx, pat);
+        }
+    }
+    re = js_get_regexp(ctx, pat, FALSE);
+    if (re) {
+        pattern = JS_DupValue(ctx, JS_MKPTR(JS_TAG_STRING, re->pattern));
+        if (JS_IsUndefined(flags1)) {
+            bc = JS_DupValue(ctx, JS_MKPTR(JS_TAG_STRING, re->bytecode));
+            goto no_compilation;
+        } else {
+            flags = JS_ToString(ctx, flags1);
+            if (JS_IsException(flags))
+                goto fail;
+        }
+    } else {
+        flags = JS_UNDEFINED;
+        if (pat_is_regexp) {
+            pattern = JS_GetProperty(ctx, pat, JS_ATOM_source);
+            if (JS_IsException(pattern))
+                goto fail;
+            if (JS_IsUndefined(flags1)) {
+                flags = JS_GetProperty(ctx, pat, JS_ATOM_flags);
+                if (JS_IsException(flags))
+                    goto fail;
+            } else {
+                flags = JS_DupValue(ctx, flags1);
+            }
+        } else {
+            pattern = JS_DupValue(ctx, pat);
+            flags = JS_DupValue(ctx, flags1);
+        }
+        if (JS_IsUndefined(pattern)) {
+            pattern = JS_AtomToString(ctx, JS_ATOM_empty_string);
+        } else {
+            val = pattern;
+            pattern = JS_ToString(ctx, val);
+            JS_FreeValue(ctx, val);
+            if (JS_IsException(pattern))
+                goto fail;
+        }
+    }
+    bc = js_compile_regexp(ctx, pattern, flags);
+    if (JS_IsException(bc))
+        goto fail;
+    JS_FreeValue(ctx, flags);
+ no_compilation:
+    return js_regexp_constructor_internal(ctx, new_target, pattern, bc);
+ fail:
+    JS_FreeValue(ctx, pattern);
+    JS_FreeValue(ctx, flags);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_regexp_compile(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv)
+{
+    JSRegExp *re1, *re;
+    JSValueConst pattern1, flags1;
+    JSValue bc, pattern;
+
+    re = js_get_regexp(ctx, this_val, TRUE);
+    if (!re)
+        return JS_EXCEPTION;
+    pattern1 = argv[0];
+    flags1 = argv[1];
+    re1 = js_get_regexp(ctx, pattern1, FALSE);
+    if (re1) {
+        if (!JS_IsUndefined(flags1))
+            return JS_ThrowTypeError(ctx, "flags must be undefined");
+        pattern = JS_DupValue(ctx, JS_MKPTR(JS_TAG_STRING, re1->pattern));
+        bc = JS_DupValue(ctx, JS_MKPTR(JS_TAG_STRING, re1->bytecode));
+    } else {
+        bc = JS_UNDEFINED;
+        if (JS_IsUndefined(pattern1))
+            pattern = JS_AtomToString(ctx, JS_ATOM_empty_string);
+        else
+            pattern = JS_ToString(ctx, pattern1);
+        if (JS_IsException(pattern))
+            goto fail;
+        bc = js_compile_regexp(ctx, pattern, flags1);
+        if (JS_IsException(bc))
+            goto fail;
+    }
+    JS_FreeValue(ctx, JS_MKPTR(JS_TAG_STRING, re->pattern));
+    JS_FreeValue(ctx, JS_MKPTR(JS_TAG_STRING, re->bytecode));
+    re->pattern = JS_VALUE_GET_STRING(pattern);
+    re->bytecode = JS_VALUE_GET_STRING(bc);
+    if (JS_SetProperty(ctx, this_val, JS_ATOM_lastIndex,
+                       JS_NewInt32(ctx, 0)) < 0)
+        return JS_EXCEPTION;
+    return JS_DupValue(ctx, this_val);
+ fail:
+    JS_FreeValue(ctx, pattern);
+    JS_FreeValue(ctx, bc);
+    return JS_EXCEPTION;
+}
+
+#if 0
+static JSValue js_regexp_get___source(JSContext *ctx, JSValueConst this_val)
+{
+    JSRegExp *re = js_get_regexp(ctx, this_val, TRUE);
+    if (!re)
+        return JS_EXCEPTION;
+    return JS_DupValue(ctx, JS_MKPTR(JS_TAG_STRING, re->pattern));
+}
+
+static JSValue js_regexp_get___flags(JSContext *ctx, JSValueConst this_val)
+{
+    JSRegExp *re = js_get_regexp(ctx, this_val, TRUE);
+    int flags;
+
+    if (!re)
+        return JS_EXCEPTION;
+    flags = lre_get_flags(re->bytecode->u.str8);
+    return JS_NewInt32(ctx, flags);
+}
+#endif
+
+static JSValue js_regexp_get_source(JSContext *ctx, JSValueConst this_val)
+{
+    JSRegExp *re;
+    JSString *p;
+    StringBuffer b_s, *b = &b_s;
+    int i, n, c, c2, bra;
+
+    if (JS_VALUE_GET_TAG(this_val) != JS_TAG_OBJECT)
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+
+    if (js_same_value(ctx, this_val, ctx->class_proto[JS_CLASS_REGEXP]))
+        goto empty_regex;
+
+    re = js_get_regexp(ctx, this_val, TRUE);
+    if (!re)
+        return JS_EXCEPTION;
+
+    p = re->pattern;
+
+    if (p->len == 0) {
+    empty_regex:
+        return JS_NewString(ctx, "(?:)");
+    }    
+    string_buffer_init2(ctx, b, p->len, p->is_wide_char);
+
+    /* Escape '/' and newline sequences as needed */
+    bra = 0;
+    for (i = 0, n = p->len; i < n;) {
+        c2 = -1;
+        switch (c = string_get(p, i++)) {
+        case '\\':
+            if (i < n)
+                c2 = string_get(p, i++);
+            break;
+        case ']':
+            bra = 0;
+            break;
+        case '[':
+            if (!bra) {
+                if (i < n && string_get(p, i) == ']')
+                    c2 = string_get(p, i++);
+                bra = 1;
+            }
+            break;
+        case '\n':
+            c = '\\';
+            c2 = 'n';
+            break;
+        case '\r':
+            c = '\\';
+            c2 = 'r';
+            break;
+        case '/':
+            if (!bra) {
+                c = '\\';
+                c2 = '/';
+            }
+            break;
+        }
+        string_buffer_putc16(b, c);
+        if (c2 >= 0)
+            string_buffer_putc16(b, c2);
+    }
+    return string_buffer_end(b);
+}
+
+static JSValue js_regexp_get_flag(JSContext *ctx, JSValueConst this_val, int mask)
+{
+    JSRegExp *re;
+    int flags;
+
+    if (JS_VALUE_GET_TAG(this_val) != JS_TAG_OBJECT)
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+
+    if (js_same_value(ctx, this_val, ctx->class_proto[JS_CLASS_REGEXP]))
+        return JS_UNDEFINED;
+
+    re = js_get_regexp(ctx, this_val, TRUE);
+    if (!re)
+        return JS_EXCEPTION;
+
+    flags = lre_get_flags(re->bytecode->u.str8);
+    return JS_NewBool(ctx, (flags & mask) != 0);
+}
+
+static JSValue js_regexp_get_flags(JSContext *ctx, JSValueConst this_val)
+{
+    char str[8], *p = str;
+    int res;
+
+    if (JS_VALUE_GET_TAG(this_val) != JS_TAG_OBJECT)
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+
+    res = JS_ToBoolFree(ctx, JS_GetProperty(ctx, this_val, JS_ATOM_global));
+    if (res < 0)
+        goto exception;
+    if (res)
+        *p++ = 'g';
+    res = JS_ToBoolFree(ctx, JS_GetPropertyStr(ctx, this_val, "ignoreCase"));
+    if (res < 0)
+        goto exception;
+    if (res)
+        *p++ = 'i';
+    res = JS_ToBoolFree(ctx, JS_GetPropertyStr(ctx, this_val, "multiline"));
+    if (res < 0)
+        goto exception;
+    if (res)
+        *p++ = 'm';
+    res = JS_ToBoolFree(ctx, JS_GetPropertyStr(ctx, this_val, "dotAll"));
+    if (res < 0)
+        goto exception;
+    if (res)
+        *p++ = 's';
+    res = JS_ToBoolFree(ctx, JS_GetProperty(ctx, this_val, JS_ATOM_unicode));
+    if (res < 0)
+        goto exception;
+    if (res)
+        *p++ = 'u';
+    res = JS_ToBoolFree(ctx, JS_GetPropertyStr(ctx, this_val, "sticky"));
+    if (res < 0)
+        goto exception;
+    if (res)
+        *p++ = 'y';
+    return JS_NewStringLen(ctx, str, p - str);
+
+exception:
+    return JS_EXCEPTION;
+}
+
+static JSValue js_regexp_toString(JSContext *ctx, JSValueConst this_val,
+                                  int argc, JSValueConst *argv)
+{
+    JSValue pattern, flags;
+    StringBuffer b_s, *b = &b_s;
+
+    if (!JS_IsObject(this_val))
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+
+    string_buffer_init(ctx, b, 0);
+    string_buffer_putc8(b, '/');
+    pattern = JS_GetProperty(ctx, this_val, JS_ATOM_source);
+    if (string_buffer_concat_value_free(b, pattern))
+        goto fail;
+    string_buffer_putc8(b, '/');
+    flags = JS_GetProperty(ctx, this_val, JS_ATOM_flags);
+    if (string_buffer_concat_value_free(b, flags))
+        goto fail;
+    return string_buffer_end(b);
+
+fail:
+    string_buffer_free(b);
+    return JS_EXCEPTION;
+}
+
+BOOL lre_check_stack_overflow(void *opaque, size_t alloca_size)
+{
+    JSContext *ctx = opaque;
+    return js_check_stack_overflow(ctx, alloca_size);
+}
+
+void *lre_realloc(void *opaque, void *ptr, size_t size)
+{
+    JSContext *ctx = opaque;
+    /* No JS exception is raised here */
+    return js_realloc_rt(ctx->rt, ptr, size);
+}
+
+static JSValue js_regexp_exec(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv)
+{
+    JSRegExp *re = js_get_regexp(ctx, this_val, TRUE);
+    JSString *str;
+    JSValue str_val, obj, val, groups = JS_UNDEFINED;
+    uint8_t *re_bytecode;
+    int ret;
+    uint8_t **capture, *str_buf;
+    int capture_count, shift, i, re_flags;
+    int64_t last_index;
+    const char *group_name_ptr;
+
+    if (!re)
+        return JS_EXCEPTION;
+    str_val = JS_ToString(ctx, argv[0]);
+    if (JS_IsException(str_val))
+        return str_val;
+    val = JS_GetProperty(ctx, this_val, JS_ATOM_lastIndex);
+    if (JS_IsException(val) ||
+        JS_ToLengthFree(ctx, &last_index, val)) {
+        JS_FreeValue(ctx, str_val);
+        return JS_EXCEPTION;
+    }
+    re_bytecode = re->bytecode->u.str8;
+    re_flags = lre_get_flags(re_bytecode);
+    if ((re_flags & (LRE_FLAG_GLOBAL | LRE_FLAG_STICKY)) == 0) {
+        last_index = 0;
+    }
+    str = JS_VALUE_GET_STRING(str_val);
+    capture_count = lre_get_capture_count(re_bytecode);
+    capture = NULL;
+    if (capture_count > 0) {
+        capture = js_malloc(ctx, sizeof(capture[0]) * capture_count * 2);
+        if (!capture) {
+            JS_FreeValue(ctx, str_val);
+            return JS_EXCEPTION;
+        }
+    }
+    shift = str->is_wide_char;
+    str_buf = str->u.str8;
+    if (last_index > str->len) {
+        ret = 2;
+    } else {
+        ret = lre_exec(capture, re_bytecode,
+                       str_buf, last_index, str->len,
+                       shift, ctx);
+    }
+    obj = JS_NULL;
+    if (ret != 1) {
+        if (ret >= 0) {
+            if (ret == 2 || (re_flags & (LRE_FLAG_GLOBAL | LRE_FLAG_STICKY))) {
+                if (JS_SetProperty(ctx, this_val, JS_ATOM_lastIndex,
+                                   JS_NewInt32(ctx, 0)) < 0)
+                    goto fail;
+            }
+        } else {
+            JS_ThrowInternalError(ctx, "out of memory in regexp execution");
+            goto fail;
+        }
+        JS_FreeValue(ctx, str_val);
+    } else {
+        int prop_flags;
+        if (re_flags & (LRE_FLAG_GLOBAL | LRE_FLAG_STICKY)) {
+            if (JS_SetProperty(ctx, this_val, JS_ATOM_lastIndex,
+                               JS_NewInt32(ctx, (capture[1] - str_buf) >> shift)) < 0)
+                goto fail;
+        }
+        obj = JS_NewArray(ctx);
+        if (JS_IsException(obj))
+            goto fail;
+        prop_flags = JS_PROP_C_W_E | JS_PROP_THROW;
+        group_name_ptr = NULL;
+        if (re_flags & LRE_FLAG_NAMED_GROUPS) {
+            uint32_t re_bytecode_len;
+            groups = JS_NewObjectProto(ctx, JS_NULL);
+            if (JS_IsException(groups))
+                goto fail;
+            re_bytecode_len = get_u32(re_bytecode + 3);
+            group_name_ptr = (char *)(re_bytecode + 7 + re_bytecode_len);
+        }
+
+        for(i = 0; i < capture_count; i++) {
+            int start, end;
+            JSValue val;
+            if (capture[2 * i] == NULL ||
+                capture[2 * i + 1] == NULL) {
+                val = JS_UNDEFINED;
+            } else {
+                start = (capture[2 * i] - str_buf) >> shift;
+                end = (capture[2 * i + 1] - str_buf) >> shift;
+                val = js_sub_string(ctx, str, start, end);
+                if (JS_IsException(val))
+                    goto fail;
+            }
+            if (group_name_ptr && i > 0) {
+                if (*group_name_ptr) {
+                    if (JS_DefinePropertyValueStr(ctx, groups, group_name_ptr,
+                                                  JS_DupValue(ctx, val),
+                                                  prop_flags) < 0) {
+                        JS_FreeValue(ctx, val);
+                        goto fail;
+                    }
+                }
+                group_name_ptr += strlen(group_name_ptr) + 1;
+            }
+            if (JS_DefinePropertyValueUint32(ctx, obj, i, val, prop_flags) < 0)
+                goto fail;
+        }
+        if (JS_DefinePropertyValue(ctx, obj, JS_ATOM_groups,
+                                   groups, prop_flags) < 0)
+            goto fail;
+        if (JS_DefinePropertyValue(ctx, obj, JS_ATOM_index,
+                                   JS_NewInt32(ctx, (capture[0] - str_buf) >> shift), prop_flags) < 0)
+            goto fail;
+        if (JS_DefinePropertyValue(ctx, obj, JS_ATOM_input, str_val, prop_flags) < 0)
+            goto fail1;
+    }
+    js_free(ctx, capture);
+    return obj;
+fail:
+    JS_FreeValue(ctx, groups);
+    JS_FreeValue(ctx, str_val);
+fail1:
+    JS_FreeValue(ctx, obj);
+    js_free(ctx, capture);
+    return JS_EXCEPTION;
+}
+
+/* delete partions of a string that match a given regex */
+static JSValue JS_RegExpDelete(JSContext *ctx, JSValueConst this_val, JSValueConst arg)
+{
+    JSRegExp *re = js_get_regexp(ctx, this_val, TRUE);
+    JSString *str;
+    JSValue str_val, val;
+    uint8_t *re_bytecode;
+    int ret;
+    uint8_t **capture, *str_buf;
+    int capture_count, shift, re_flags;
+    int next_src_pos, start, end;
+    int64_t last_index;
+    StringBuffer b_s, *b = &b_s;
+
+    if (!re)
+        return JS_EXCEPTION;
+
+    string_buffer_init(ctx, b, 0);
+
+    capture = NULL;
+    str_val = JS_ToString(ctx, arg);
+    if (JS_IsException(str_val))
+        goto fail;
+    str = JS_VALUE_GET_STRING(str_val);
+    re_bytecode = re->bytecode->u.str8;
+    re_flags = lre_get_flags(re_bytecode);
+    if ((re_flags & (LRE_FLAG_GLOBAL | LRE_FLAG_STICKY)) == 0) {
+        last_index = 0;
+    } else {
+        val = JS_GetProperty(ctx, this_val, JS_ATOM_lastIndex);
+        if (JS_IsException(val) || JS_ToLengthFree(ctx, &last_index, val))
+            goto fail;
+    }
+    capture_count = lre_get_capture_count(re_bytecode);
+    if (capture_count > 0) {
+        capture = js_malloc(ctx, sizeof(capture[0]) * capture_count * 2);
+        if (!capture)
+            goto fail;
+    }
+    shift = str->is_wide_char;
+    str_buf = str->u.str8;
+    next_src_pos = 0;
+    for (;;) {
+        if (last_index > str->len)
+            break;
+
+        ret = lre_exec(capture, re_bytecode,
+                       str_buf, last_index, str->len, shift, ctx);
+        if (ret != 1) {
+            if (ret >= 0) {
+                if (ret == 2 || (re_flags & (LRE_FLAG_GLOBAL | LRE_FLAG_STICKY))) {
+                    if (JS_SetProperty(ctx, this_val, JS_ATOM_lastIndex,
+                                       JS_NewInt32(ctx, 0)) < 0)
+                        goto fail;
+                }
+            } else {
+                JS_ThrowInternalError(ctx, "out of memory in regexp execution");
+                goto fail;
+            }
+            break;
+        }
+        start = (capture[0] - str_buf) >> shift;
+        end = (capture[1] - str_buf) >> shift;
+        last_index = end;
+        if (next_src_pos < start) {
+            if (string_buffer_concat(b, str, next_src_pos, start))
+                goto fail;
+        }
+        next_src_pos = end;
+        if (!(re_flags & LRE_FLAG_GLOBAL)) {
+            if (JS_SetProperty(ctx, this_val, JS_ATOM_lastIndex,
+                               JS_NewInt32(ctx, end)) < 0)
+                goto fail;
+            break;
+        }
+        if (end == start) {
+            if (!(re_flags & LRE_FLAG_UTF16) || (unsigned)end >= str->len || !str->is_wide_char) {
+                end++;
+            } else {
+                string_getc(str, &end);
+            }
+        }
+        last_index = end;
+    }
+    if (string_buffer_concat(b, str, next_src_pos, str->len))
+        goto fail;
+    JS_FreeValue(ctx, str_val);
+    js_free(ctx, capture);
+    return string_buffer_end(b);
+fail:
+    JS_FreeValue(ctx, str_val);
+    js_free(ctx, capture);
+    string_buffer_free(b);
+    return JS_EXCEPTION;
+}
+
+static JSValue JS_RegExpExec(JSContext *ctx, JSValueConst r, JSValueConst s)
+{
+    JSValue method, ret;
+
+    method = JS_GetProperty(ctx, r, JS_ATOM_exec);
+    if (JS_IsException(method))
+        return method;
+    if (JS_IsFunction(ctx, method)) {
+        ret = JS_CallFree(ctx, method, r, 1, &s);
+        if (JS_IsException(ret))
+            return ret;
+        if (!JS_IsObject(ret) && !JS_IsNull(ret)) {
+            JS_FreeValue(ctx, ret);
+            return JS_ThrowTypeError(ctx, "RegExp exec method must return an object or null");
+        }
+        return ret;
+    }
+    JS_FreeValue(ctx, method);
+    return js_regexp_exec(ctx, r, 1, &s);
+}
+
+#if 0
+static JSValue js_regexp___RegExpExec(JSContext *ctx, JSValueConst this_val,
+                                      int argc, JSValueConst *argv)
+{
+    return JS_RegExpExec(ctx, argv[0], argv[1]);
+}
+static JSValue js_regexp___RegExpDelete(JSContext *ctx, JSValueConst this_val,
+                                        int argc, JSValueConst *argv)
+{
+    return JS_RegExpDelete(ctx, argv[0], argv[1]);
+}
+#endif
+
+static JSValue js_regexp_test(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv)
+{
+    JSValue val;
+    BOOL ret;
+
+    val = JS_RegExpExec(ctx, this_val, argv[0]);
+    if (JS_IsException(val))
+        return JS_EXCEPTION;
+    ret = !JS_IsNull(val);
+    JS_FreeValue(ctx, val);
+    return JS_NewBool(ctx, ret);
+}
+
+static JSValue js_regexp_Symbol_match(JSContext *ctx, JSValueConst this_val,
+                                      int argc, JSValueConst *argv)
+{
+    // [Symbol.match](str)
+    JSValueConst rx = this_val;
+    JSValue A, S, result, matchStr;
+    int global, n, fullUnicode, isEmpty;
+    JSString *p;
+
+    if (!JS_IsObject(rx))
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+
+    A = JS_UNDEFINED;
+    result = JS_UNDEFINED;
+    matchStr = JS_UNDEFINED;
+    S = JS_ToString(ctx, argv[0]);
+    if (JS_IsException(S))
+        goto exception;
+
+    global = JS_ToBoolFree(ctx, JS_GetProperty(ctx, rx, JS_ATOM_global));
+    if (global < 0)
+        goto exception;
+
+    if (!global) {
+        A = JS_RegExpExec(ctx, rx, S);
+    } else {
+        fullUnicode = JS_ToBoolFree(ctx, JS_GetProperty(ctx, rx, JS_ATOM_unicode));
+        if (fullUnicode < 0)
+            goto exception;
+
+        if (JS_SetProperty(ctx, rx, JS_ATOM_lastIndex, JS_NewInt32(ctx, 0)) < 0)
+            goto exception;
+        A = JS_NewArray(ctx);
+        if (JS_IsException(A))
+            goto exception;
+        n = 0;
+        for(;;) {
+            JS_FreeValue(ctx, result);
+            result = JS_RegExpExec(ctx, rx, S);
+            if (JS_IsException(result))
+                goto exception;
+            if (JS_IsNull(result))
+                break;
+            matchStr = JS_ToStringFree(ctx, JS_GetPropertyInt64(ctx, result, 0));
+            if (JS_IsException(matchStr))
+                goto exception;
+            isEmpty = JS_IsEmptyString(matchStr);
+            if (JS_SetPropertyInt64(ctx, A, n++, matchStr) < 0)
+                goto exception;
+            if (isEmpty) {
+                int64_t thisIndex, nextIndex;
+                if (JS_ToLengthFree(ctx, &thisIndex,
+                                    JS_GetProperty(ctx, rx, JS_ATOM_lastIndex)) < 0)
+                    goto exception;
+                p = JS_VALUE_GET_STRING(S);
+                nextIndex = thisIndex + 1;
+                if (thisIndex < p->len)
+                    nextIndex = string_advance_index(p, thisIndex, fullUnicode);
+                if (JS_SetProperty(ctx, rx, JS_ATOM_lastIndex, JS_NewInt64(ctx, nextIndex)) < 0)
+                    goto exception;
+            }
+        }
+        if (n == 0) {
+            JS_FreeValue(ctx, A);
+            A = JS_NULL;
+        }
+    }
+    JS_FreeValue(ctx, result);
+    JS_FreeValue(ctx, S);
+    return A;
+
+exception:
+    JS_FreeValue(ctx, A);
+    JS_FreeValue(ctx, result);
+    JS_FreeValue(ctx, S);
+    return JS_EXCEPTION;
+}
+
+typedef struct ValueBuffer {
+    JSContext *ctx;
+    JSValue *arr;
+    JSValue def[4];
+    int len;
+    int size;
+    int error_status;
+} ValueBuffer;
+
+static int value_buffer_init(JSContext *ctx, ValueBuffer *b)
+{
+    b->ctx = ctx;
+    b->len = 0;
+    b->size = 4;
+    b->error_status = 0;
+    b->arr = b->def;
+    return 0;
+}
+
+static void value_buffer_free(ValueBuffer *b)
+{
+    while (b->len > 0)
+        JS_FreeValue(b->ctx, b->arr[--b->len]);
+    if (b->arr != b->def)
+        js_free(b->ctx, b->arr);
+    b->arr = b->def;
+    b->size = 4;
+}
+
+static int value_buffer_append(ValueBuffer *b, JSValue val)
+{
+    if (b->error_status)
+        return -1;
+
+    if (b->len >= b->size) {
+        int new_size = (b->len + (b->len >> 1) + 31) & ~16;
+        size_t slack;
+        JSValue *new_arr;
+
+        if (b->arr == b->def) {
+            new_arr = js_realloc2(b->ctx, NULL, sizeof(*b->arr) * new_size, &slack);
+            if (new_arr)
+                memcpy(new_arr, b->def, sizeof b->def);
+        } else {
+            new_arr = js_realloc2(b->ctx, b->arr, sizeof(*b->arr) * new_size, &slack);
+        }
+        if (!new_arr) {
+            value_buffer_free(b);
+            JS_FreeValue(b->ctx, val);
+            b->error_status = -1;
+            return -1;
+        }
+        new_size += slack / sizeof(*new_arr);
+        b->arr = new_arr;
+        b->size = new_size;
+    }
+    b->arr[b->len++] = val;
+    return 0;
+}
+
+static int js_is_standard_regexp(JSContext *ctx, JSValueConst rx)
+{
+    JSValue val;
+    int res;
+
+    val = JS_GetProperty(ctx, rx, JS_ATOM_constructor);
+    if (JS_IsException(val))
+        return -1;
+    // rx.constructor === RegExp
+    res = js_same_value(ctx, val, ctx->regexp_ctor);
+    JS_FreeValue(ctx, val);
+    if (res) {
+        val = JS_GetProperty(ctx, rx, JS_ATOM_exec);
+        if (JS_IsException(val))
+            return -1;
+        // rx.exec === RE_exec
+        res = JS_IsCFunction(ctx, val, js_regexp_exec, 0);
+        JS_FreeValue(ctx, val);
+    }
+    return res;
+}
+
+static JSValue js_regexp_Symbol_replace(JSContext *ctx, JSValueConst this_val,
+                                        int argc, JSValueConst *argv)
+{
+    // [Symbol.replace](str, rep)
+    JSValueConst rx = this_val, rep = argv[1];
+    JSValueConst args[6];
+    JSValue str, rep_val, matched, tab, rep_str, namedCaptures, res;
+    JSString *sp, *rp;
+    StringBuffer b_s, *b = &b_s;
+    ValueBuffer v_b, *results = &v_b;
+    int nextSourcePosition, n, j, functionalReplace, is_global, fullUnicode;
+    uint32_t nCaptures;
+    int64_t position;
+
+    if (!JS_IsObject(rx))
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+
+    string_buffer_init(ctx, b, 0);
+    value_buffer_init(ctx, results);
+
+    rep_val = JS_UNDEFINED;
+    matched = JS_UNDEFINED;
+    tab = JS_UNDEFINED;
+    rep_str = JS_UNDEFINED;
+    namedCaptures = JS_UNDEFINED;
+
+    str = JS_ToString(ctx, argv[0]);
+    if (JS_IsException(str))
+        goto exception;
+        
+    sp = JS_VALUE_GET_STRING(str);
+    rp = NULL;
+    functionalReplace = JS_IsFunction(ctx, rep);
+    if (!functionalReplace) {
+        rep_val = JS_ToString(ctx, rep);
+        if (JS_IsException(rep_val))
+            goto exception;
+        rp = JS_VALUE_GET_STRING(rep_val);
+    }
+    fullUnicode = 0;
+    is_global = JS_ToBoolFree(ctx, JS_GetProperty(ctx, rx, JS_ATOM_global));
+    if (is_global < 0)
+        goto exception;
+    if (is_global) {
+        fullUnicode = JS_ToBoolFree(ctx, JS_GetProperty(ctx, rx, JS_ATOM_unicode));
+        if (fullUnicode < 0)
+            goto exception;
+        if (JS_SetProperty(ctx, rx, JS_ATOM_lastIndex, JS_NewInt32(ctx, 0)) < 0)
+            goto exception;
+    }
+
+    if (rp && rp->len == 0 && is_global && js_is_standard_regexp(ctx, rx)) {
+        /* use faster version for simple cases */
+        res = JS_RegExpDelete(ctx, rx, str);
+        goto done;
+    }
+    for(;;) {
+        JSValue result;
+        result = JS_RegExpExec(ctx, rx, str);
+        if (JS_IsException(result))
+            goto exception;
+        if (JS_IsNull(result))
+            break;
+        if (value_buffer_append(results, result) < 0)
+            goto exception;
+        if (!is_global)
+            break;
+        JS_FreeValue(ctx, matched);
+        matched = JS_ToStringFree(ctx, JS_GetPropertyInt64(ctx, result, 0));
+        if (JS_IsException(matched))
+            goto exception;
+        if (JS_IsEmptyString(matched)) {
+            /* always advance of at least one char */
+            int64_t thisIndex, nextIndex;
+            if (JS_ToLengthFree(ctx, &thisIndex, JS_GetProperty(ctx, rx, JS_ATOM_lastIndex)) < 0)
+                goto exception;
+            nextIndex = string_advance_index(sp, thisIndex, fullUnicode);
+            if (JS_SetProperty(ctx, rx, JS_ATOM_lastIndex, JS_NewInt32(ctx, nextIndex)) < 0)
+                goto exception;
+        }
+    }
+    nextSourcePosition = 0;
+    for(j = 0; j < results->len; j++) {
+        JSValueConst result;
+        result = results->arr[j];
+        if (js_get_length32(ctx, &nCaptures, result) < 0)
+            goto exception;
+        JS_FreeValue(ctx, matched);
+        matched = JS_ToStringFree(ctx, JS_GetPropertyInt64(ctx, result, 0));
+        if (JS_IsException(matched))
+            goto exception;
+        if (JS_ToLengthFree(ctx, &position, JS_GetProperty(ctx, result, JS_ATOM_index)))
+            goto exception;
+        if (position > sp->len)
+            position = sp->len;
+        else if (position < 0)
+            position = 0;
+        /* ignore substition if going backward (can happen
+           with custom regexp object) */
+        JS_FreeValue(ctx, tab);
+        tab = JS_NewArray(ctx);
+        if (JS_IsException(tab))
+            goto exception;
+        if (JS_SetPropertyInt64(ctx, tab, 0, JS_DupValue(ctx, matched)) < 0)
+            goto exception;
+        for(n = 1; n < nCaptures; n++) {
+            JSValue capN;
+            capN = JS_GetPropertyInt64(ctx, result, n);
+            if (JS_IsException(capN))
+                goto exception;
+            if (!JS_IsUndefined(capN)) {
+                capN = JS_ToStringFree(ctx, capN);
+                if (JS_IsException(capN))
+                    goto exception;
+            }
+            if (JS_SetPropertyInt64(ctx, tab, n, capN) < 0)
+                goto exception;
+        }
+        JS_FreeValue(ctx, namedCaptures);
+        namedCaptures = JS_GetProperty(ctx, result, JS_ATOM_groups);
+        if (JS_IsException(namedCaptures))
+            goto exception;
+        if (functionalReplace) {
+            if (JS_SetPropertyInt64(ctx, tab, n++, JS_NewInt32(ctx, position)) < 0)
+                goto exception;
+            if (JS_SetPropertyInt64(ctx, tab, n++, JS_DupValue(ctx, str)) < 0)
+                goto exception;
+            if (!JS_IsUndefined(namedCaptures)) {
+                if (JS_SetPropertyInt64(ctx, tab, n++, JS_DupValue(ctx, namedCaptures)) < 0)
+                    goto exception;
+            }
+            args[0] = JS_UNDEFINED;
+            args[1] = tab;
+            JS_FreeValue(ctx, rep_str);
+            rep_str = JS_ToStringFree(ctx, js_function_apply(ctx, rep, 2, args, 0));
+        } else {
+            args[0] = matched;
+            args[1] = str;
+            args[2] = JS_NewInt32(ctx, position);
+            args[3] = tab;
+            args[4] = namedCaptures;
+            args[5] = rep_val;
+            JS_FreeValue(ctx, rep_str);
+            rep_str = js_string___GetSubstitution(ctx, JS_UNDEFINED, 6, args);
+        }
+        if (JS_IsException(rep_str))
+            goto exception;
+        if (position >= nextSourcePosition) {
+            string_buffer_concat(b, sp, nextSourcePosition, position);
+            string_buffer_concat_value(b, rep_str);
+            nextSourcePosition = position + JS_VALUE_GET_STRING(matched)->len;
+        }
+    }
+    string_buffer_concat(b, sp, nextSourcePosition, sp->len);
+    res = string_buffer_end(b);
+    goto done1;
+
+exception:
+    res = JS_EXCEPTION;
+done:
+    string_buffer_free(b);
+done1:
+    value_buffer_free(results);
+    JS_FreeValue(ctx, rep_val);
+    JS_FreeValue(ctx, matched);
+    JS_FreeValue(ctx, tab);
+    JS_FreeValue(ctx, rep_str);
+    JS_FreeValue(ctx, namedCaptures);
+    JS_FreeValue(ctx, str);
+    return res;
+}
+
+static JSValue js_regexp_Symbol_search(JSContext *ctx, JSValueConst this_val,
+                                       int argc, JSValueConst *argv)
+{
+    JSValueConst rx = this_val;
+    JSValue str, previousLastIndex, currentLastIndex, result, index;
+
+    if (!JS_IsObject(rx))
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+
+    result = JS_UNDEFINED;
+    currentLastIndex = JS_UNDEFINED;
+    previousLastIndex = JS_UNDEFINED;
+    str = JS_ToString(ctx, argv[0]);
+    if (JS_IsException(str))
+        goto exception;
+
+    previousLastIndex = JS_GetProperty(ctx, rx, JS_ATOM_lastIndex);
+    if (JS_IsException(previousLastIndex))
+        goto exception;
+
+    if (!js_same_value(ctx, previousLastIndex, JS_NewInt32(ctx, 0))) {
+        if (JS_SetProperty(ctx, rx, JS_ATOM_lastIndex, JS_NewInt32(ctx, 0)) < 0) {
+            goto exception;
+        }
+    }
+    result = JS_RegExpExec(ctx, rx, str);
+    if (JS_IsException(result))
+        goto exception;
+    currentLastIndex = JS_GetProperty(ctx, rx, JS_ATOM_lastIndex);
+    if (JS_IsException(currentLastIndex))
+        goto exception;
+    if (js_same_value(ctx, currentLastIndex, previousLastIndex)) {
+        JS_FreeValue(ctx, previousLastIndex);
+    } else {
+        if (JS_SetProperty(ctx, rx, JS_ATOM_lastIndex, previousLastIndex) < 0)
+            goto exception;
+    }
+    JS_FreeValue(ctx, str);
+    JS_FreeValue(ctx, currentLastIndex);
+
+    if (JS_IsNull(result)) {
+        return JS_NewInt32(ctx, -1);
+    } else {
+        index = JS_GetProperty(ctx, result, JS_ATOM_index);
+        JS_FreeValue(ctx, result);
+        return index;
+    }
+
+exception:
+    JS_FreeValue(ctx, result);
+    JS_FreeValue(ctx, str);
+    JS_FreeValue(ctx, currentLastIndex);
+    JS_FreeValue(ctx, previousLastIndex);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_regexp_Symbol_split(JSContext *ctx, JSValueConst this_val,
+                                       int argc, JSValueConst *argv)
+{
+    // [Symbol.split](str, limit)
+    JSValueConst rx = this_val;
+    JSValueConst args[2];
+    JSValue str, ctor, splitter, A, flags, z, sub;
+    JSString *strp;
+    uint32_t lim, size, p, q;
+    int unicodeMatching;
+    int64_t lengthA, e, numberOfCaptures, i;
+
+    if (!JS_IsObject(rx))
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+
+    ctor = JS_UNDEFINED;
+    splitter = JS_UNDEFINED;
+    A = JS_UNDEFINED;
+    flags = JS_UNDEFINED;
+    z = JS_UNDEFINED;
+    str = JS_ToString(ctx, argv[0]);
+    if (JS_IsException(str))
+        goto exception;
+    ctor = JS_SpeciesConstructor(ctx, rx, ctx->regexp_ctor);
+    if (JS_IsException(ctor))
+        goto exception;
+    flags = JS_ToStringFree(ctx, JS_GetProperty(ctx, rx, JS_ATOM_flags));
+    if (JS_IsException(flags))
+        goto exception;
+    strp = JS_VALUE_GET_STRING(flags);
+    unicodeMatching = string_indexof_char(strp, 'u', 0) >= 0;
+    if (string_indexof_char(strp, 'y', 0) < 0) {
+        flags = JS_ConcatString3(ctx, "", flags, "y");
+        if (JS_IsException(flags))
+            goto exception;
+    }
+    args[0] = rx;
+    args[1] = flags;
+    splitter = JS_CallConstructor(ctx, ctor, 2, args);
+    if (JS_IsException(splitter))
+        goto exception;
+    A = JS_NewArray(ctx);
+    if (JS_IsException(A))
+        goto exception;
+    lengthA = 0;
+    if (JS_IsUndefined(argv[1])) {
+        lim = 0xffffffff;
+    } else {
+        if (JS_ToUint32(ctx, &lim, argv[1]) < 0)
+            goto exception;
+        if (lim == 0)
+            goto done;
+    }
+    strp = JS_VALUE_GET_STRING(str);
+    p = q = 0;
+    size = strp->len;
+    if (size == 0) {
+        z = JS_RegExpExec(ctx, splitter, str);
+        if (JS_IsException(z))
+            goto exception;
+        if (JS_IsNull(z))
+            goto add_tail;
+        goto done;
+    }
+    while (q < size) {
+        if (JS_SetProperty(ctx, splitter, JS_ATOM_lastIndex, JS_NewInt32(ctx, q)) < 0)
+            goto exception;
+        JS_FreeValue(ctx, z);    
+        z = JS_RegExpExec(ctx, splitter, str);
+        if (JS_IsException(z))
+            goto exception;
+        if (JS_IsNull(z)) {
+            q = string_advance_index(strp, q, unicodeMatching);
+        } else {
+            if (JS_ToLengthFree(ctx, &e, JS_GetProperty(ctx, splitter, JS_ATOM_lastIndex)))
+                goto exception;
+            if (e > size)
+                e = size;
+            if (e == p) {
+                q = string_advance_index(strp, q, unicodeMatching);
+            } else {
+                sub = js_sub_string(ctx, strp, p, q);
+                if (JS_IsException(sub))
+                    goto exception;
+                if (JS_SetPropertyInt64(ctx, A, lengthA++, sub) < 0)
+                    goto exception;
+                if (lengthA == lim)
+                    goto done;
+                p = e;
+                if (js_get_length64(ctx, &numberOfCaptures, z))
+                    goto exception;
+                for(i = 1; i < numberOfCaptures; i++) {
+                    sub = JS_ToStringFree(ctx, JS_GetPropertyInt64(ctx, z, i));
+                    if (JS_IsException(sub))
+                        goto exception;
+                    if (JS_SetPropertyInt64(ctx, A, lengthA++, sub) < 0)
+                        goto exception;
+                    if (lengthA == lim)
+                        goto done;
+                }
+                q = p;
+            }
+        }
+    }
+add_tail:
+    if (p > size)
+        p = size;
+    sub = js_sub_string(ctx, strp, p, size);
+    if (JS_IsException(sub))
+        goto exception;
+    if (JS_SetPropertyInt64(ctx, A, lengthA++, sub) < 0)
+        goto exception;
+    goto done;
+exception:
+    JS_FreeValue(ctx, A);
+    A = JS_EXCEPTION;
+done:
+    JS_FreeValue(ctx, str);
+    JS_FreeValue(ctx, ctor);
+    JS_FreeValue(ctx, splitter);
+    JS_FreeValue(ctx, flags);
+    JS_FreeValue(ctx, z);    
+    return A;
+}
+
+static const JSCFunctionListEntry js_regexp_funcs[] = {
+    JS_CGETSET_DEF("[Symbol.species]", js_get_this, NULL ),
+    //JS_CFUNC_DEF("__RegExpExec", 2, js_regexp___RegExpExec ),
+    //JS_CFUNC_DEF("__RegExpDelete", 2, js_regexp___RegExpDelete ),
+};
+
+static const JSCFunctionListEntry js_regexp_proto_funcs[] = {
+    JS_CGETSET_DEF("flags", js_regexp_get_flags, NULL ),
+    JS_CGETSET_DEF("source", js_regexp_get_source, NULL ),
+    JS_CGETSET_MAGIC_DEF("global", js_regexp_get_flag, NULL, 1 ),
+    JS_CGETSET_MAGIC_DEF("ignoreCase", js_regexp_get_flag, NULL, 2 ),
+    JS_CGETSET_MAGIC_DEF("multiline", js_regexp_get_flag, NULL, 4 ),
+    JS_CGETSET_MAGIC_DEF("dotAll", js_regexp_get_flag, NULL, 8 ),
+    JS_CGETSET_MAGIC_DEF("unicode", js_regexp_get_flag, NULL, 16 ),
+    JS_CGETSET_MAGIC_DEF("sticky", js_regexp_get_flag, NULL, 32 ),
+    JS_CFUNC_DEF("exec", 1, js_regexp_exec ),
+    JS_CFUNC_DEF("compile", 2, js_regexp_compile ),
+    JS_CFUNC_DEF("test", 1, js_regexp_test ),
+    JS_CFUNC_DEF("toString", 0, js_regexp_toString ),
+    JS_CFUNC_DEF("[Symbol.replace]", 2, js_regexp_Symbol_replace ),
+    JS_CFUNC_DEF("[Symbol.match]", 1, js_regexp_Symbol_match ),
+    JS_CFUNC_DEF("[Symbol.search]", 1, js_regexp_Symbol_search ),
+    JS_CFUNC_DEF("[Symbol.split]", 2, js_regexp_Symbol_split ),
+    //JS_CGETSET_DEF("__source", js_regexp_get___source, NULL ),
+    //JS_CGETSET_DEF("__flags", js_regexp_get___flags, NULL ),
+};
+
+void JS_AddIntrinsicRegExpCompiler(JSContext *ctx)
+{
+    ctx->compile_regexp = js_compile_regexp;
+}
+
+void JS_AddIntrinsicRegExp(JSContext *ctx)
+{
+    JSValueConst obj;
+
+    JS_AddIntrinsicRegExpCompiler(ctx);
+
+    ctx->class_proto[JS_CLASS_REGEXP] = JS_NewObject(ctx);
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_REGEXP], js_regexp_proto_funcs,
+                               countof(js_regexp_proto_funcs));
+    obj = JS_NewGlobalCConstructor(ctx, "RegExp", js_regexp_constructor, 2,
+                                   ctx->class_proto[JS_CLASS_REGEXP]);
+    ctx->regexp_ctor = JS_DupValue(ctx, obj);
+    JS_SetPropertyFunctionList(ctx, obj, js_regexp_funcs, countof(js_regexp_funcs));
+}
+
+/* JSON */
+
+/* XXX: this parser is less strict than the JSON standard because we
+   reuse the Javascript tokenizer. It could be improved by adding a
+   specific JSON parse flag. */
+static JSValue json_parse_value(JSParseState *s)
+{
+    JSContext *ctx = s->ctx;
+    JSValue val = JS_NULL;
+    BOOL is_neg;
+    int ret;
+
+    switch(s->token.val) {
+    case '{':
+        {
+            JSValue prop_val, prop_str;
+
+            if (next_token(s))
+                goto fail;
+            val = JS_NewObject(ctx);
+            if (JS_IsException(val))
+                goto fail;
+            if (s->token.val != '}') {
+                for(;;) {
+                    if (s->token.val != TOK_STRING) {
+                        js_parse_error(s, "expecting property name");
+                        goto fail;
+                    }
+                    prop_str = JS_DupValue(ctx, s->token.u.str.str);
+                    if (next_token(s)) {
+                        JS_FreeValue(ctx, prop_str);
+                        goto fail;
+                    }
+                    if (js_parse_expect(s, ':')) {
+                        JS_FreeValue(ctx, prop_str);
+                        goto fail;
+                    }
+                    prop_val = json_parse_value(s);
+                    if (JS_IsException(prop_val)) {
+                        JS_FreeValue(ctx, prop_str);
+                        goto fail;
+                    }
+                    ret = JS_DefinePropertyValueValue(ctx, val, prop_str,
+                                                      prop_val, JS_PROP_C_W_E);
+                    if (ret < 0)
+                        goto fail;
+
+                    if (s->token.val != ',')
+                        break;
+                    if (next_token(s))
+                        goto fail;
+                }
+            }
+            if (js_parse_expect(s, '}'))
+                goto fail;
+        }
+        break;
+    case '[':
+        {
+            JSValue el;
+            uint32_t idx;
+
+            if (next_token(s))
+                goto fail;
+            val = JS_NewArray(ctx);
+            if (JS_IsException(val))
+                goto fail;
+            if (s->token.val != ']') {
+                idx = 0;
+                for(;;) {
+                    el = json_parse_value(s);
+                    if (JS_IsException(el))
+                        goto fail;
+                    ret = JS_DefinePropertyValueUint32(ctx, val, idx, el, JS_PROP_C_W_E);
+                    if (ret < 0)
+                        goto fail;
+                    if (s->token.val != ',')
+                        break;
+                    if (next_token(s))
+                        goto fail;
+                    idx++;
+                }
+            }
+            if (js_parse_expect(s, ']'))
+                goto fail;
+        }
+        break;
+    case TOK_STRING:
+        val = JS_DupValue(ctx, s->token.u.str.str);
+        if (next_token(s))
+            goto fail;
+        break;
+    case TOK_NUMBER:
+        is_neg = 0;
+        goto number;
+    case '-':
+        if (next_token(s))
+            goto fail;
+        if (s->token.val != TOK_NUMBER) {
+            js_parse_error(s, "number expected");
+            goto fail;
+        }
+        is_neg = 1;
+    number:
+#ifdef CONFIG_BIGNUM
+        val = JS_DupValue(ctx, s->token.u.num.val);
+        if (is_neg) {
+            switch(JS_VALUE_GET_NORM_TAG(val)) {
+            case JS_TAG_BIG_INT:
+            case JS_TAG_BIG_FLOAT:
+                {
+                    JSBigFloat *p;
+                    p = JS_VALUE_GET_PTR(val);
+                    bf_neg(&p->num);
+                }
+                break;
+            case JS_TAG_FLOAT64:
+                {
+                    double d;
+                    d = JS_VALUE_GET_FLOAT64(val);
+                    val = __JS_NewFloat64(ctx, -d);
+                }
+                break;
+            default:
+            case JS_TAG_INT:
+                {
+                    int v;
+                    v = JS_VALUE_GET_INT(val);
+                    val = JS_NewInt64(ctx, -(int64_t)v);
+                }
+                break;
+            }
+        }
+#else
+        val = s->token.u.num.val;
+        if (is_neg) {
+            double d;
+            JS_ToFloat64(ctx, &d, val);  /* no exception possible */
+            val = JS_NewFloat64(ctx, -d);
+        }
+#endif
+        if (next_token(s))
+            goto fail;
+        break;
+    case TOK_FALSE:
+    case TOK_TRUE:
+        val = JS_NewBool(ctx, s->token.val - TOK_FALSE);
+        if (next_token(s))
+            goto fail;
+        break;
+    case TOK_NULL:
+        if (next_token(s))
+            goto fail;
+        break;
+    default:
+        if (s->token.val == TOK_EOF) {
+            js_parse_error(s, "unexpected end of input");
+        } else {
+            js_parse_error(s, "unexpected token: '%.*s'",
+                           (int)(s->buf_ptr - s->token.ptr), s->token.ptr);
+        }
+        goto fail;
+    }
+    return val;
+ fail:
+    JS_FreeValue(ctx, val);
+    return JS_EXCEPTION;
+}
+
+JSValue JS_ParseJSON(JSContext *ctx, const char *buf, size_t buf_len,
+                     const char *filename)
+{
+    JSParseState s1, *s = &s1;
+    JSValue val;
+
+    js_parse_init(ctx, s, buf, buf_len, filename);
+
+    if (next_token(s))
+        goto fail;
+    val = json_parse_value(s);
+    if (JS_IsException(val))
+        goto fail;
+    if (s->token.val != TOK_EOF) {
+        if (js_parse_error(s, "unexpected data at the end"))
+            goto fail;
+    }
+    return val;
+ fail:
+    free_token(s, &s->token);
+    return JS_EXCEPTION;
+}
+
+/* XXX: check stack limit ? */
+static JSValue internalize_json_property(JSContext *ctx, JSValueConst holder,
+                                         JSAtom name, JSValueConst reviver)
+{
+    JSValue val, new_el, name_val, res;
+    JSValueConst args[2];
+    int ret, is_array;
+    uint32_t i, len = 0;
+    JSAtom prop;
+    JSPropertyEnum *atoms = NULL;
+
+    val = JS_GetProperty(ctx, holder, name);
+    if (JS_IsException(val))
+        return val;
+    if (JS_IsObject(val)) {
+        is_array = JS_IsArray(ctx, val);
+        if (is_array < 0)
+            goto fail;
+        if (is_array) {
+            if (js_get_length32(ctx, &len, val))
+                goto fail;
+        } else {
+            ret = JS_GetOwnPropertyNames(ctx, &atoms, &len, JS_VALUE_GET_OBJ(val), JS_GPN_ENUM_ONLY | JS_GPN_STRING_MASK);
+            if (ret < 0)
+                goto fail;
+        }
+        for(i = 0; i < len; i++) {
+            if (is_array) {
+                prop = JS_NewAtomUInt32(ctx, i);
+                if (prop == JS_ATOM_NULL)
+                    goto fail;
+            } else {
+                prop = JS_DupAtom(ctx, atoms[i].atom);
+            }
+            new_el = internalize_json_property(ctx, val, prop, reviver);
+            if (JS_IsException(new_el)) {
+                JS_FreeAtom(ctx, prop);
+                goto fail;
+            }
+            if (JS_IsUndefined(new_el)) {
+                ret = JS_DeleteProperty(ctx, val, prop, 0);
+            } else {
+                ret = JS_DefinePropertyValue(ctx, val, prop, new_el, JS_PROP_C_W_E);
+            }
+            JS_FreeAtom(ctx, prop);
+            if (ret < 0)
+                goto fail;
+        }
+    }
+    js_free_prop_enum(ctx, atoms, len);
+    atoms = NULL;
+    name_val = JS_AtomToValue(ctx, name);
+    if (JS_IsException(name_val))
+        goto fail;
+    args[0] = name_val;
+    args[1] = val;
+    res = JS_Call(ctx, reviver, holder, 2, args);
+    JS_FreeValue(ctx, name_val);
+    JS_FreeValue(ctx, val);
+    return res;
+ fail:
+    js_free_prop_enum(ctx, atoms, len);
+    JS_FreeValue(ctx, val);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_json_parse(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv)
+{
+    JSValue obj, root;
+    JSValueConst reviver;
+    const char *str;
+    int len;
+
+    str = JS_ToCStringLen(ctx, &len, argv[0], FALSE);
+    if (!str)
+        return JS_EXCEPTION;
+    obj = JS_ParseJSON(ctx, str, len, "<input>");
+    JS_FreeCString(ctx, str);
+    if (JS_IsException(obj))
+        return obj;
+    if (argc > 1 && JS_IsFunction(ctx, argv[1])) {
+        reviver = argv[1];
+        root = JS_NewObject(ctx);
+        if (JS_IsException(root)) {
+            JS_FreeValue(ctx, obj);
+            return JS_EXCEPTION;
+        }
+        if (JS_DefinePropertyValue(ctx, root, JS_ATOM_empty_string, obj,
+                                   JS_PROP_C_W_E) < 0) {
+            JS_FreeValue(ctx, root);
+            return JS_EXCEPTION;
+        }
+        obj = internalize_json_property(ctx, root, JS_ATOM_empty_string,
+                                        reviver);
+        JS_FreeValue(ctx, root);
+    }
+    return obj;
+}
+
+typedef struct JSONStringifyContext {
+    JSValueConst replacer_func;
+    JSValue stack;
+    JSValue property_list;
+    JSValue gap;
+    JSValue empty;
+    StringBuffer *b;
+} JSONStringifyContext;
+
+static JSValue JS_ToQuotedStringFree(JSContext *ctx, JSValue val) {
+    JSValue r = JS_ToQuotedString(ctx, val);
+    JS_FreeValue(ctx, val);
+    return r;
+}
+
+static JSValue js_json_unbox(JSContext *ctx, JSValue val) {
+    if (JS_IsObject(val)) {
+        JSObject *p = JS_VALUE_GET_OBJ(val);
+        if (p->class_id == JS_CLASS_STRING || p->class_id == JS_CLASS_NUMBER) {
+            JSValue r = JS_DupValue(ctx, p->u.object_data);
+            JS_FreeValue(ctx, val);
+            val = r;
+        }
+    }
+    return val;
+}
+
+#ifdef CONFIG_BIGNUM
+static inline BOOL JS_IsBigInt(JSContext *ctx, JSValueConst v);
+#endif
+
+static JSValue js_json_check(JSContext *ctx, JSONStringifyContext *jsc,
+                             JSValueConst holder, JSValue val, JSValueConst key)
+{
+    JSValue v;
+    JSValueConst args[2];
+
+    if (JS_IsObject(val)
+#ifdef CONFIG_BIGNUM
+    ||  JS_IsBigInt(ctx, val)   /* XXX: probably useless */
+#endif
+        ) {
+            JSValue f = JS_GetProperty(ctx, val, JS_ATOM_toJSON);
+            if (JS_IsException(f))
+                goto exception;
+            if (JS_IsFunction(ctx, f)) {
+                v = JS_CallFree(ctx, f, val, 1, &key);
+                JS_FreeValue(ctx, val);
+                val = v;
+                if (JS_IsException(val))
+                    goto exception;
+            } else {
+                JS_FreeValue(ctx, f);
+            }
+        }
+
+    if (!JS_IsUndefined(jsc->replacer_func)) {
+        args[0] = key;
+        args[1] = val;
+        v = JS_Call(ctx, jsc->replacer_func, holder, 2, args);
+        JS_FreeValue(ctx, val);
+        val = v;
+        if (JS_IsException(val))
+            goto exception;
+    }
+
+    switch (JS_VALUE_GET_NORM_TAG(val)) {
+    case JS_TAG_OBJECT:
+        if (JS_IsFunction(ctx, val))
+            break;
+    case JS_TAG_STRING:
+    case JS_TAG_INT:
+    case JS_TAG_FLOAT64:
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_FLOAT:
+#endif
+    case JS_TAG_BOOL:
+    case JS_TAG_NULL:
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_INT:
+#endif
+    case JS_TAG_EXCEPTION:
+        return val;
+    default:
+        break;
+    }
+    JS_FreeValue(ctx, val);
+    return JS_UNDEFINED;
+
+exception:
+    JS_FreeValue(ctx, val);
+    return JS_EXCEPTION;
+}
+
+static int js_json_to_str(JSContext *ctx, JSONStringifyContext *jsc,
+                          JSValueConst holder, JSValue val,
+                          JSValueConst key, JSValueConst indent)
+{
+    JSValue indent1, sep, sep1, tab, v, prop;
+    JSObject *p;
+    int64_t i, len;
+    int cl, res;
+
+    indent1 = JS_UNDEFINED;
+    sep = JS_UNDEFINED;
+    sep1 = JS_UNDEFINED;
+    tab = JS_UNDEFINED;
+    prop = JS_UNDEFINED;
+
+    switch (JS_VALUE_GET_NORM_TAG(val)) {
+    case JS_TAG_OBJECT:
+        p = JS_VALUE_GET_OBJ(val);
+        cl = p->class_id;
+        if (cl == JS_CLASS_STRING) {
+            val = JS_InvokeFree(ctx, val, JS_ATOM_toString, 0, NULL);
+            if (JS_IsException(val))
+                goto exception;
+            val = JS_ToQuotedStringFree(ctx, val);
+            if (JS_IsException(val))
+                goto exception;
+            return string_buffer_concat_value_free(jsc->b, val);
+        } else if (cl == JS_CLASS_NUMBER || cl == JS_CLASS_BOOLEAN) {
+            return string_buffer_concat_value_free(jsc->b, val);
+        }
+#ifdef CONFIG_BIGNUM
+        else if (cl == JS_CLASS_BIG_FLOAT) {
+            return string_buffer_concat_value_free(jsc->b, val);
+        } else if (cl == JS_CLASS_BIG_INT) {
+            JS_ThrowTypeError(ctx, "bigint are forbidden in JSON.stringify");
+            goto exception;
+        }
+#endif
+        res = JS_ToBoolFree(ctx, js_array_includes(ctx, jsc->stack, 1, (JSValueConst *)&val));
+        if (res < 0)
+            goto exception;
+        if (res) {
+            JS_ThrowTypeError(ctx, "circular reference");
+            goto exception;
+        }
+        indent1 = JS_ConcatString(ctx, JS_DupValue(ctx, indent), JS_DupValue(ctx, jsc->gap));
+        if (JS_IsException(indent1))
+            goto exception;
+        if (!JS_IsEmptyString(jsc->gap)) {
+            sep = JS_ConcatString3(ctx, "\n", JS_DupValue(ctx, indent), "");
+            if (JS_IsException(sep))
+                goto exception;
+            sep1 = JS_NewString(ctx, " ");
+            if (JS_IsException(sep1))
+                goto exception;
+        } else {
+            sep = JS_DupValue(ctx, jsc->empty);
+            sep1 = JS_DupValue(ctx, jsc->empty);
+        }
+        v = js_array_push(ctx, jsc->stack, 1, (JSValueConst *)&val, 0);
+        if (check_exception_free(ctx, v))
+            goto exception;
+        if (JS_IsArray(ctx, val)) {
+            if (js_get_length64(ctx, &len, val))
+                goto exception;
+            string_buffer_putc8(jsc->b, '[');
+            for(i = 0; i < len; i++) {
+                if (i > 0)
+                    string_buffer_putc8(jsc->b, ',');
+                string_buffer_concat_value(jsc->b, sep);
+                v = JS_GetPropertyInt64(ctx, val, i);
+                if (JS_IsException(v))
+                    goto exception;
+                v = js_json_check(ctx, jsc, val, v, JS_NewInt32(ctx, i));
+                if (JS_IsException(v))
+                    goto exception;
+                if (JS_IsUndefined(v))
+                    v = JS_NULL;
+                if (js_json_to_str(ctx, jsc, val, v, JS_NewInt32(ctx, i), indent1))
+                    goto exception;
+            }
+            if (len > 0 && !JS_IsEmptyString(jsc->gap)) {
+                string_buffer_putc8(jsc->b, '\n');
+                string_buffer_concat_value(jsc->b, indent);
+            }
+            string_buffer_putc8(jsc->b, ']');
+        } else {
+            if (!JS_IsUndefined(jsc->property_list))
+                tab = JS_DupValue(ctx, jsc->property_list);
+            else
+                tab = js_object_keys(ctx, JS_UNDEFINED, 1, (JSValueConst *)&val, JS_ITERATOR_KIND_KEY);
+            if (JS_IsException(tab))
+                goto exception;
+            if (js_get_length64(ctx, &len, tab))
+                goto exception;
+            string_buffer_putc8(jsc->b, '{');
+            for(i = 0; i < len; i++) {
+                JS_FreeValue(ctx, prop);
+                prop = JS_GetPropertyInt64(ctx, tab, i);
+                if (JS_IsException(prop))
+                    goto exception;
+                v = JS_GetPropertyValue(ctx, val, JS_DupValue(ctx, prop));
+                if (JS_IsException(v))
+                    goto exception;
+                v = js_json_check(ctx, jsc, val, v, prop);
+                if (JS_IsException(v))
+                    goto exception;
+                if (!JS_IsUndefined(v)) {
+                    if (i > 0)
+                        string_buffer_putc8(jsc->b, ',');
+                    prop = JS_ToQuotedStringFree(ctx, prop);
+                    if (JS_IsException(prop)) {
+                        JS_FreeValue(ctx, v);
+                        goto exception;
+                    }
+                    string_buffer_concat_value(jsc->b, sep);
+                    string_buffer_concat_value(jsc->b, prop);
+                    string_buffer_putc8(jsc->b, ':');
+                    string_buffer_concat_value(jsc->b, sep1);
+                    if (js_json_to_str(ctx, jsc, val, v, prop, indent1))
+                        goto exception;
+                }
+            }
+            if (len > 0 && JS_VALUE_GET_STRING(jsc->gap)->len != 0) {
+                string_buffer_putc8(jsc->b, '\n');
+                string_buffer_concat_value(jsc->b, indent);
+            }
+            string_buffer_putc8(jsc->b, '}');
+        }
+        if (check_exception_free(ctx, js_array_pop(ctx, jsc->stack, 0, NULL, 0)))
+            goto exception;
+        JS_FreeValue(ctx, val);
+        JS_FreeValue(ctx, tab);
+        JS_FreeValue(ctx, sep);
+        JS_FreeValue(ctx, sep1);
+        JS_FreeValue(ctx, indent1);
+        JS_FreeValue(ctx, prop);
+        return 0;
+    case JS_TAG_STRING:
+        val = JS_ToQuotedStringFree(ctx, val);
+        if (JS_IsException(val))
+            goto exception;
+        /* fall thru */
+    case JS_TAG_INT:
+    case JS_TAG_FLOAT64:
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_FLOAT:
+#endif
+    case JS_TAG_BOOL:
+    case JS_TAG_NULL:
+        return string_buffer_concat_value_free(jsc->b, val);
+#ifdef CONFIG_BIGNUM
+    case JS_TAG_BIG_INT:
+        JS_ThrowTypeError(ctx, "bigint are forbidden in JSON.stringify");
+        goto exception;
+#endif
+    default:
+        JS_FreeValue(ctx, val);
+        return 0;
+    }
+    
+exception:
+    JS_FreeValue(ctx, val);
+    JS_FreeValue(ctx, tab);
+    JS_FreeValue(ctx, sep);
+    JS_FreeValue(ctx, sep1);
+    JS_FreeValue(ctx, indent1);
+    JS_FreeValue(ctx, prop);
+    return -1;
+}
+
+static JSValue js_json_stringify(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv)
+{
+    // stringify(val, replacer, space)
+    StringBuffer b_s;
+    JSONStringifyContext jsc_s, *jsc = &jsc_s;
+    JSValueConst replacer = argv[1];
+    JSValue val, v, space, ret;
+    int res;
+    int64_t i, j, n;
+
+    jsc->replacer_func = JS_UNDEFINED;
+    jsc->stack = JS_UNDEFINED;
+    jsc->property_list = JS_UNDEFINED;
+    jsc->gap = JS_UNDEFINED;
+    jsc->b = &b_s;
+    jsc->empty = JS_AtomToString(ctx, JS_ATOM_empty_string);
+    ret = JS_UNDEFINED;
+
+    string_buffer_init(ctx, jsc->b, 0);
+    jsc->stack = JS_NewArray(ctx);
+    if (JS_IsException(jsc->stack))
+        goto exception;
+    if (JS_IsFunction(ctx, replacer)) {
+        jsc->replacer_func = replacer;
+    } else {
+        res = JS_IsArray(ctx, replacer);
+        if (res < 0)
+            goto exception;
+        if (res) {
+            /* XXX: enumeration is not fully correct */
+            jsc->property_list = JS_NewArray(ctx);
+            if (JS_IsException(jsc->property_list))
+                goto exception;
+            if (js_get_length64(ctx, &n, replacer))
+                goto exception;
+            for (i = j = 0; i < n; i++) {
+                v = JS_GetPropertyInt64(ctx, replacer, i);
+                if (JS_IsException(v))
+                    goto exception;
+                v = js_json_unbox(ctx, v);
+                if (JS_IsNumber(v)) {
+                    v = JS_ToStringFree(ctx, v);
+                } else if (!JS_IsString(v)) {
+                    JS_FreeValue(ctx, v);
+                    continue;
+                }
+                JS_SetPropertyInt64(ctx, jsc->property_list, j++, v);
+            }
+        }
+    }
+    space = js_json_unbox(ctx, JS_DupValue(ctx, argv[2]));
+    if (JS_IsNumber(space)) {
+        int n;
+        if (JS_ToInt32Clamp(ctx, &n, space, 0, 10, 0))
+            goto exception;
+        jsc->gap = JS_NewStringLen(ctx, "          ", n);
+    } else if (JS_IsString(space)) {
+        JSString *p = JS_VALUE_GET_STRING(space);
+        jsc->gap = js_sub_string(ctx, p, 0, min_int(p->len, 10));
+    } else {
+        jsc->gap = JS_DupValue(ctx, jsc->empty);
+    }
+    JS_FreeValue(ctx, space);
+    if (JS_IsException(jsc->gap))
+        goto exception;
+    val = JS_DupValue(ctx, argv[0]);
+    val = js_json_check(ctx, jsc, JS_NULL, val, jsc->empty);
+    if (JS_IsException(val))
+        goto exception;
+    if (JS_IsUndefined(val)) {
+        ret = JS_UNDEFINED;
+        goto done1;
+    }
+    if (js_json_to_str(ctx, jsc, JS_NULL, val, jsc->empty, jsc->empty))
+        goto exception;
+
+    ret = string_buffer_end(jsc->b);
+    goto done;
+
+exception:
+    ret = JS_EXCEPTION;
+done1:
+    string_buffer_free(jsc->b);
+done:
+    JS_FreeValue(ctx, jsc->empty);
+    JS_FreeValue(ctx, jsc->gap);
+    JS_FreeValue(ctx, jsc->property_list);
+    JS_FreeValue(ctx, jsc->stack);
+    return ret;
+}
+
+static const JSCFunctionListEntry js_json_funcs[] = {
+    JS_CFUNC_DEF("parse", 2, js_json_parse ),
+    JS_CFUNC_DEF("stringify", 3, js_json_stringify ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "JSON", JS_PROP_CONFIGURABLE ),
+};
+
+static const JSCFunctionListEntry js_json_obj[] = {
+    JS_OBJECT_DEF("JSON", js_json_funcs, countof(js_json_funcs), JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE ),
+};
+
+void JS_AddIntrinsicJSON(JSContext *ctx)
+{
+    /* add JSON as autoinit object */
+    JS_SetPropertyFunctionList(ctx, ctx->global_obj, js_json_obj, countof(js_json_obj));
+}
+
+/* Reflect */
+
+static JSValue js_reflect_apply(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    return js_function_apply(ctx, argv[0], max_int(0, argc - 1), argv + 1, 0);
+}
+
+static JSValue js_reflect_construct(JSContext *ctx, JSValueConst this_val,
+                                    int argc, JSValueConst *argv)
+{
+    JSValueConst func, array_arg, new_target;
+    JSValue *tab, ret;
+    uint32_t len;
+
+    func = argv[0];
+    array_arg = argv[1];
+    if (argc > 2) {
+        new_target = argv[2];
+        if (!JS_IsConstructor(ctx, new_target))
+            return JS_ThrowTypeError(ctx, "not a constructor");
+    } else {
+        new_target = func;
+    }
+    tab = build_arg_list(ctx, &len, array_arg);
+    if (!tab)
+        return JS_EXCEPTION;
+    ret = JS_CallConstructor2(ctx, func, new_target, len, (JSValueConst *)tab);
+    free_arg_list(ctx, tab, len);
+    return ret;
+}
+
+static JSValue js_reflect_deleteProperty(JSContext *ctx, JSValueConst this_val,
+                                         int argc, JSValueConst *argv)
+{
+    JSValueConst obj;
+    JSAtom atom;
+    int ret;
+
+    obj = argv[0];
+    if (JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT)
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+    atom = js_value_to_atom(ctx, argv[1]);
+    if (unlikely(atom == JS_ATOM_NULL))
+        return JS_EXCEPTION;
+    ret = JS_DeleteProperty(ctx, obj, atom, 0);
+    JS_FreeAtom(ctx, atom);
+    if (ret < 0)
+        return JS_EXCEPTION;
+    else
+        return JS_NewBool(ctx, ret);
+}
+
+static JSValue js_reflect_get(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv)
+{
+    JSValueConst obj, prop, receiver;
+    JSAtom atom;
+    JSValue ret;
+
+    obj = argv[0];
+    prop = argv[1];
+    if (JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT)
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+    if (argc > 2)
+        receiver = argv[2];
+    else
+        receiver = obj;
+    atom = js_value_to_atom(ctx, prop);
+    if (unlikely(atom == JS_ATOM_NULL))
+        return JS_EXCEPTION;
+    ret = JS_GetPropertyInternal(ctx, obj, atom, receiver, FALSE);
+    JS_FreeAtom(ctx, atom);
+    return ret;
+}
+
+static JSValue js_reflect_has(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv)
+{
+    JSValueConst obj, prop;
+    JSAtom atom;
+    int ret;
+
+    obj = argv[0];
+    prop = argv[1];
+    if (JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT)
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+    atom = js_value_to_atom(ctx, prop);
+    if (unlikely(atom == JS_ATOM_NULL))
+        return JS_EXCEPTION;
+    ret = JS_HasProperty(ctx, obj, atom);
+    JS_FreeAtom(ctx, atom);
+    if (ret < 0)
+        return JS_EXCEPTION;
+    else
+        return JS_NewBool(ctx, ret);
+}
+
+static JSValue js_reflect_set(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv)
+{
+    JSValueConst obj, prop, val, receiver;
+    int ret;
+    JSAtom atom;
+
+    obj = argv[0];
+    prop = argv[1];
+    val = argv[2];
+    if (argc > 3)
+        receiver = argv[3];
+    else
+        receiver = obj;
+    if (JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT)
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+    atom = js_value_to_atom(ctx, prop);
+    if (unlikely(atom == JS_ATOM_NULL))
+        return JS_EXCEPTION;
+    ret = JS_SetPropertyGeneric(ctx, JS_VALUE_GET_OBJ(obj), atom,
+                                JS_DupValue(ctx, val), receiver, 0);
+    JS_FreeAtom(ctx, atom);
+    if (ret < 0)
+        return JS_EXCEPTION;
+    else
+        return JS_NewBool(ctx, ret);
+}
+
+static JSValue js_reflect_setPrototypeOf(JSContext *ctx, JSValueConst this_val,
+                                         int argc, JSValueConst *argv)
+{
+    int ret;
+    ret = JS_SetPrototypeInternal(ctx, argv[0], argv[1], FALSE);
+    if (ret < 0)
+        return JS_EXCEPTION;
+    else
+        return JS_NewBool(ctx, ret);
+}
+
+static JSValue js_reflect_ownKeys(JSContext *ctx, JSValueConst this_val,
+                                  int argc, JSValueConst *argv)
+{
+    if (JS_VALUE_GET_TAG(argv[0]) != JS_TAG_OBJECT)
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+    return JS_GetOwnPropertyNames2(ctx, argv[0],
+                                   JS_GPN_STRING_MASK | JS_GPN_SYMBOL_MASK,
+                                   JS_ITERATOR_KIND_KEY);
+}
+
+static const JSCFunctionListEntry js_reflect_funcs[] = {
+    JS_CFUNC_DEF("apply", 3, js_reflect_apply ),
+    JS_CFUNC_DEF("construct", 2, js_reflect_construct ),
+    JS_CFUNC_MAGIC_DEF("defineProperty", 3, js_object_defineProperty, 1 ),
+    JS_CFUNC_DEF("deleteProperty", 2, js_reflect_deleteProperty ),
+    JS_CFUNC_DEF("get", 2, js_reflect_get ),
+    JS_CFUNC_MAGIC_DEF("getOwnPropertyDescriptor", 2, js_object_getOwnPropertyDescriptor, 1 ),
+    JS_CFUNC_MAGIC_DEF("getPrototypeOf", 1, js_object_getPrototypeOf, 1 ),
+    JS_CFUNC_DEF("has", 2, js_reflect_has ),
+    JS_CFUNC_MAGIC_DEF("isExtensible", 1, js_object_isExtensible, 1 ),
+    JS_CFUNC_DEF("ownKeys", 1, js_reflect_ownKeys ),
+    JS_CFUNC_MAGIC_DEF("preventExtensions", 1, js_object_preventExtensions, 1 ),
+    JS_CFUNC_DEF("set", 3, js_reflect_set ),
+    JS_CFUNC_DEF("setPrototypeOf", 2, js_reflect_setPrototypeOf ),
+};
+
+static const JSCFunctionListEntry js_reflect_obj[] = {
+    JS_OBJECT_DEF("Reflect", js_reflect_funcs, countof(js_reflect_funcs), JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE ),
+};
+
+/* Proxy */
+
+static void js_proxy_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSProxyData *s = JS_GetOpaque(val, JS_CLASS_PROXY);
+    if (s) {
+        JS_FreeValueRT(rt, s->target);
+        JS_FreeValueRT(rt, s->handler);
+        JS_FreeValueRT(rt, s->proto);
+        js_free_rt(rt, s);
+    }
+}
+
+static void js_proxy_mark(JSRuntime *rt, JSValueConst val,
+                          JS_MarkFunc *mark_func)
+{
+    JSProxyData *s = JS_GetOpaque(val, JS_CLASS_PROXY);
+    if (s) {
+        JS_MarkValue(rt, s->target, mark_func);
+        JS_MarkValue(rt, s->handler, mark_func);
+        JS_MarkValue(rt, s->proto, mark_func);
+    }
+}
+
+static JSProxyData *get_proxy_method(JSContext *ctx, JSValue *pmethod,
+                                     JSValueConst obj, JSAtom name)
+{
+    JSProxyData *s = JS_GetOpaque(obj, JS_CLASS_PROXY);
+    JSValue method;
+
+    /* 's' should never be NULL */
+    if (JS_IsNull(s->handler)) {
+        JS_ThrowTypeError(ctx, "revoked proxy");
+        return NULL;
+    }
+    method = JS_GetProperty(ctx, s->handler, name);
+    if (JS_IsException(method))
+        return NULL;
+    if (JS_IsNull(method))
+        method = JS_UNDEFINED;
+    *pmethod = method;
+    return s;
+}
+
+static JSValueConst js_proxy_getPrototypeOf(JSContext *ctx, JSValueConst obj)
+{
+    JSProxyData *s;
+    JSValue method, ret;
+    JSValueConst proto1;
+    int res;
+
+    /* must check for timeout to avoid infinite loop in instanceof */
+    if (js_poll_interrupts(ctx))
+        return JS_EXCEPTION;
+
+    s = get_proxy_method(ctx, &method, obj, JS_ATOM_getPrototypeOf);
+    if (!s)
+        return JS_EXCEPTION;
+    if (JS_IsUndefined(method))
+        return JS_GetPrototype(ctx, s->target);
+    ret = JS_CallFree(ctx, method, s->handler, 1, (JSValueConst *)&s->target);
+    if (JS_IsException(ret))
+        return ret;
+    if (JS_VALUE_GET_TAG(ret) != JS_TAG_NULL &&
+        JS_VALUE_GET_TAG(ret) != JS_TAG_OBJECT) {
+        goto fail;
+    }
+    res = JS_IsExtensible(ctx, s->target);
+    if (res < 0) {
+        JS_FreeValue(ctx, ret);
+        return JS_EXCEPTION;
+    }
+    if (!res) {
+        /* check invariant */
+        proto1 = JS_GetPrototype(ctx, s->target);
+        if (JS_IsException(proto1)) {
+            JS_FreeValue(ctx, ret);
+            return JS_EXCEPTION;
+        }
+        if (JS_VALUE_GET_OBJ(proto1) != JS_VALUE_GET_OBJ(ret)) {
+        fail:
+            JS_FreeValue(ctx, ret);
+            return JS_ThrowTypeError(ctx, "proxy: inconsistent prototype");
+        }
+    }
+    /* store the prototype in the proxy so that its refcount is at least 1 */
+    set_value(ctx, &s->proto, ret);
+    return CastToJSValueConst(ret);
+}
+
+static int js_proxy_setPrototypeOf(JSContext *ctx, JSValueConst obj,
+                                   JSValueConst proto_val, BOOL throw_flag)
+{
+    JSProxyData *s;
+    JSValue method, ret;
+    JSValueConst args[2], proto1;
+    BOOL res;
+    int res2;
+
+    s = get_proxy_method(ctx, &method, obj, JS_ATOM_setPrototypeOf);
+    if (!s)
+        return -1;
+    if (JS_IsUndefined(method))
+        return JS_SetPrototypeInternal(ctx, s->target, proto_val, throw_flag);
+    args[0] = s->target;
+    args[1] = proto_val;
+    ret = JS_CallFree(ctx, method, s->handler, 2, args);
+    if (JS_IsException(ret))
+        return -1;
+    res = JS_ToBoolFree(ctx, ret);
+    if (!res) {
+        if (throw_flag) {
+            JS_ThrowTypeError(ctx, "proxy: bad prototype");
+            return -1;
+        } else {
+            return FALSE;
+        }
+    }
+    res2 = JS_IsExtensible(ctx, s->target);
+    if (res2 < 0)
+        return -1;
+    if (!res2) {
+        proto1 = JS_GetPrototype(ctx, s->target);
+        if (JS_IsException(proto1))
+            return -1;
+        if (JS_VALUE_GET_OBJ(proto_val) != JS_VALUE_GET_OBJ(proto1)) {
+            JS_ThrowTypeError(ctx, "proxy: inconsistent prototype");
+            return -1;
+        }
+    }
+    return TRUE;
+}
+
+static int js_proxy_isExtensible(JSContext *ctx, JSValueConst obj)
+{
+    JSProxyData *s;
+    JSValue method, ret;
+    BOOL res;
+    int res2;
+
+    s = get_proxy_method(ctx, &method, obj, JS_ATOM_isExtensible);
+    if (!s)
+        return -1;
+    if (JS_IsUndefined(method))
+        return JS_IsExtensible(ctx, s->target);
+    ret = JS_CallFree(ctx, method, s->handler, 1, (JSValueConst *)&s->target);
+    if (JS_IsException(ret))
+        return -1;
+    res = JS_ToBoolFree(ctx, ret);
+    res2 = JS_IsExtensible(ctx, s->target);
+    if (res2 < 0)
+        return res2;
+    if (res != res2) {
+        JS_ThrowTypeError(ctx, "proxy: inconsistent isExtensible");
+        return -1;
+    }
+    return res;
+}
+
+static int js_proxy_preventExtensions(JSContext *ctx, JSValueConst obj)
+{
+    JSProxyData *s;
+    JSValue method, ret;
+    BOOL res;
+    int res2;
+
+    s = get_proxy_method(ctx, &method, obj, JS_ATOM_preventExtensions);
+    if (!s)
+        return -1;
+    if (JS_IsUndefined(method))
+        return JS_PreventExtensions(ctx, s->target);
+    ret = JS_CallFree(ctx, method, s->handler, 1, (JSValueConst *)&s->target);
+    if (JS_IsException(ret))
+        return -1;
+    res = JS_ToBoolFree(ctx, ret);
+    if (res) {
+        res2 = JS_IsExtensible(ctx, s->target);
+        if (res2 < 0)
+            return res2;
+        if (res2) {
+            JS_ThrowTypeError(ctx, "proxy: inconsistent preventExtensions");
+            return -1;
+        }
+    }
+    return res;
+}
+
+static int js_proxy_has(JSContext *ctx, JSValueConst obj, JSAtom atom)
+{
+    JSProxyData *s;
+    JSValue method, ret1, atom_val;
+    int ret, res;
+    JSObject *p;
+    JSValueConst args[2];
+    BOOL res2;
+
+    s = get_proxy_method(ctx, &method, obj, JS_ATOM_has);
+    if (!s)
+        return -1;
+    if (JS_IsUndefined(method))
+        return JS_HasProperty(ctx, s->target, atom);
+    atom_val = JS_AtomToValue(ctx, atom);
+    if (JS_IsException(atom_val)) {
+        JS_FreeValue(ctx, method);
+        return -1;
+    }
+    args[0] = s->target;
+    args[1] = atom_val;
+    ret1 = JS_CallFree(ctx, method, s->handler, 2, args);
+    JS_FreeValue(ctx, atom_val);
+    if (JS_IsException(ret1))
+        return -1;
+    ret = JS_ToBoolFree(ctx, ret1);
+    if (!ret) {
+        JSPropertyDescriptor desc;
+        p = JS_VALUE_GET_OBJ(s->target);
+        res = JS_GetOwnProperty(ctx, &desc, p, atom);
+        if (res < 0)
+            return -1;
+        if (res) {
+            res2 = !(desc.flags & JS_PROP_CONFIGURABLE);
+            js_free_desc(ctx, &desc);
+            if (res2 || !p->extensible) {
+                JS_ThrowTypeError(ctx, "proxy: inconsistent has");
+                return -1;
+            }
+        }
+    }
+    return ret;
+}
+
+static JSValue js_proxy_get(JSContext *ctx, JSValueConst obj, JSAtom atom,
+                            JSValueConst receiver)
+{
+    JSProxyData *s;
+    JSValue method, ret, atom_val;
+    int res;
+    JSValueConst args[3];
+    JSPropertyDescriptor desc;
+
+    s = get_proxy_method(ctx, &method, obj, JS_ATOM_get);
+    if (!s)
+        return JS_EXCEPTION;
+    if (JS_IsUndefined(method))
+        return JS_GetPropertyInternal(ctx, s->target, atom, receiver, FALSE);
+    atom_val = JS_AtomToValue(ctx, atom);
+    if (JS_IsException(atom_val)) {
+        JS_FreeValue(ctx, method);
+        return JS_EXCEPTION;
+    }
+    args[0] = s->target;
+    args[1] = atom_val;
+    args[2] = receiver;
+    ret = JS_CallFree(ctx, method, s->handler, 3, args);
+    JS_FreeValue(ctx, atom_val);
+    if (JS_IsException(ret))
+        return JS_EXCEPTION;
+    res = JS_GetOwnProperty(ctx, &desc, JS_VALUE_GET_OBJ(s->target), atom);
+    if (res < 0)
+        return JS_EXCEPTION;
+    if (res) {
+        if ((desc.flags & (JS_PROP_GETSET | JS_PROP_CONFIGURABLE | JS_PROP_WRITABLE)) == 0) {
+            if (!js_same_value(ctx, desc.value, ret)) {
+                goto fail;
+            }
+        } else if ((desc.flags & (JS_PROP_GETSET | JS_PROP_CONFIGURABLE)) == JS_PROP_GETSET) {
+            if (JS_IsUndefined(desc.getter) && !JS_IsUndefined(ret)) {
+            fail:
+                js_free_desc(ctx, &desc);
+                JS_FreeValue(ctx, ret);
+                return JS_ThrowTypeError(ctx, "proxy: inconsistent get");
+            }
+        }
+        js_free_desc(ctx, &desc);
+    }
+    return ret;
+}
+
+static int js_proxy_set(JSContext *ctx, JSValueConst obj, JSAtom atom,
+                        JSValueConst value, JSValueConst receiver, int flags)
+{
+    JSProxyData *s;
+    JSValue method, ret1, atom_val;
+    int ret, res;
+    JSValueConst args[4];
+
+    s = get_proxy_method(ctx, &method, obj, JS_ATOM_set);
+    if (!s)
+        return -1;
+    if (JS_IsUndefined(method)) {
+        return JS_SetPropertyGeneric(ctx, JS_VALUE_GET_OBJ(s->target), atom,
+                                     JS_DupValue(ctx, value), receiver,
+                                     flags);
+    }
+    atom_val = JS_AtomToValue(ctx, atom);
+    if (JS_IsException(atom_val)) {
+        JS_FreeValue(ctx, method);
+        return -1;
+    }
+    args[0] = s->target;
+    args[1] = atom_val;
+    args[2] = value;
+    args[3] = receiver;
+    ret1 = JS_CallFree(ctx, method, s->handler, 4, args);
+    JS_FreeValue(ctx, atom_val);
+    if (JS_IsException(ret1))
+        return -1;
+    ret = JS_ToBoolFree(ctx, ret1);
+    if (ret) {
+        JSPropertyDescriptor desc;
+        res = JS_GetOwnProperty(ctx, &desc, JS_VALUE_GET_OBJ(s->target), atom);
+        if (res < 0)
+            return -1;
+        if (res) {
+            if ((desc.flags & (JS_PROP_GETSET | JS_PROP_CONFIGURABLE | JS_PROP_WRITABLE)) == 0) {
+                if (!js_same_value(ctx, desc.value, value)) {
+                    goto fail;
+                }
+            } else if ((desc.flags & (JS_PROP_GETSET | JS_PROP_CONFIGURABLE)) == JS_PROP_GETSET && JS_IsUndefined(desc.setter)) {
+                fail:
+                    js_free_desc(ctx, &desc);
+                    JS_ThrowTypeError(ctx, "proxy: inconsistent set");
+                    return -1;
+            }
+            js_free_desc(ctx, &desc);
+        }
+    } else {
+        if ((flags & JS_PROP_THROW) ||
+            ((flags & JS_PROP_THROW_STRICT) && is_strict_mode(ctx))) {
+            JS_ThrowTypeError(ctx, "proxy: cannot set property");
+            return -1;
+        }
+    }
+    return ret;
+}
+
+static JSValue js_create_desc(JSContext *ctx, JSValueConst val,
+                              JSValueConst getter, JSValueConst setter,
+                              int flags)
+{
+    JSValue ret;
+    ret = JS_NewObject(ctx);
+    if (JS_IsException(ret))
+        return ret;
+    if (flags & JS_PROP_HAS_GET) {
+        JS_DefinePropertyValue(ctx, ret, JS_ATOM_get, JS_DupValue(ctx, getter),
+                               JS_PROP_C_W_E);
+    }
+    if (flags & JS_PROP_HAS_SET) {
+        JS_DefinePropertyValue(ctx, ret, JS_ATOM_set, JS_DupValue(ctx, setter),
+                               JS_PROP_C_W_E);
+    }
+    if (flags & JS_PROP_HAS_VALUE) {
+        JS_DefinePropertyValue(ctx, ret, JS_ATOM_value, JS_DupValue(ctx, val),
+                               JS_PROP_C_W_E);
+    }
+    if (flags & JS_PROP_HAS_WRITABLE) {
+        JS_DefinePropertyValue(ctx, ret, JS_ATOM_writable,
+                               JS_NewBool(ctx, (flags & JS_PROP_WRITABLE) != 0),
+                               JS_PROP_C_W_E);
+    }
+    if (flags & JS_PROP_HAS_ENUMERABLE) {
+        JS_DefinePropertyValue(ctx, ret, JS_ATOM_enumerable,
+                               JS_NewBool(ctx, (flags & JS_PROP_ENUMERABLE) != 0),
+                               JS_PROP_C_W_E);
+    }
+    if (flags & JS_PROP_HAS_CONFIGURABLE) {
+        JS_DefinePropertyValue(ctx, ret, JS_ATOM_configurable,
+                               JS_NewBool(ctx, (flags & JS_PROP_CONFIGURABLE) != 0),
+                               JS_PROP_C_W_E);
+    }
+    return ret;
+}
+
+static int js_proxy_get_own_property(JSContext *ctx, JSPropertyDescriptor *pdesc,
+                                     JSValueConst obj, JSAtom prop)
+{
+    JSProxyData *s;
+    JSValue method, ret1, prop_val;
+    int res, target_res, ret;
+    JSObject *p;
+    JSValueConst args[2];
+    JSPropertyDescriptor desc, target_desc;
+
+    s = get_proxy_method(ctx, &method, obj, JS_ATOM_getOwnPropertyDescriptor);
+    if (!s)
+        return -1;
+    p = JS_VALUE_GET_OBJ(s->target);
+    if (JS_IsUndefined(method)) {
+        return JS_GetOwnProperty(ctx, pdesc, p, prop);
+    }
+    prop_val = JS_AtomToValue(ctx, prop);
+    if (JS_IsException(prop_val)) {
+        JS_FreeValue(ctx, method);
+        return -1;
+    }
+    args[0] = s->target;
+    args[1] = prop_val;
+    ret1 = JS_CallFree(ctx, method, s->handler, 2, args);
+    JS_FreeValue(ctx, prop_val);
+    if (JS_IsException(ret1))
+        return -1;
+    if (!JS_IsObject(ret1) && !JS_IsUndefined(ret1)) {
+        JS_FreeValue(ctx, ret1);
+        goto fail;
+    }
+    target_res = JS_GetOwnProperty(ctx, &target_desc, p, prop);
+    if (target_res < 0) {
+        JS_FreeValue(ctx, ret1);
+        return -1;
+    }
+    if (target_res)
+        js_free_desc(ctx, &target_desc);
+    if (JS_IsUndefined(ret1)) {
+        if (target_res) {
+            if (!(target_desc.flags & JS_PROP_CONFIGURABLE) || !p->extensible)
+                goto fail;
+        }
+        ret = FALSE;
+    } else {
+        int flags1;
+
+        res = js_obj_to_desc(ctx, &desc, ret1);
+        JS_FreeValue(ctx, ret1);
+        if (res < 0)
+            return -1;
+        if (target_res) {
+            /* convert desc.flags to defineProperty flags */
+            flags1 = desc.flags | JS_PROP_HAS_CONFIGURABLE | JS_PROP_HAS_ENUMERABLE;
+            if (desc.flags & JS_PROP_GETSET)
+                flags1 |= JS_PROP_HAS_GET | JS_PROP_HAS_SET;
+            else
+                flags1 |= JS_PROP_HAS_VALUE | JS_PROP_HAS_WRITABLE;
+            /* XXX: not complete check: need to compare value &
+               getter/setter as in defineproperty */
+            if (!check_define_prop_flags(target_desc.flags, flags1))
+                goto fail1;
+        } else {
+            if (!p->extensible)
+                goto fail1;
+        }
+        res = (!(desc.flags & JS_PROP_CONFIGURABLE) &&
+               (!target_res || (target_desc.flags & JS_PROP_CONFIGURABLE)));
+        if (res) {
+        fail1:
+            js_free_desc(ctx, &desc);
+        fail:
+            JS_ThrowTypeError(ctx, "proxy: inconsistent getOwnPropertyDescriptor");
+            return -1;
+        }
+        ret = TRUE;
+        if (pdesc) {
+            *pdesc = desc;
+        } else {
+            js_free_desc(ctx, &desc);
+        }
+    }
+    return ret;
+}
+
+static int js_proxy_define_own_property(JSContext *ctx, JSValueConst obj,
+                                        JSAtom prop, JSValueConst val,
+                                        JSValueConst getter, JSValueConst setter,
+                                        int flags)
+{
+    JSProxyData *s;
+    JSValue method, ret1, prop_val, desc_val;
+    int res, ret;
+    JSObject *p;
+    JSValueConst args[3];
+    JSPropertyDescriptor desc;
+    BOOL setting_not_configurable;
+
+    s = get_proxy_method(ctx, &method, obj, JS_ATOM_defineProperty);
+    if (!s)
+        return -1;
+    if (JS_IsUndefined(method)) {
+        return JS_DefineProperty(ctx, s->target, prop, val, getter, setter, flags);
+    }
+    prop_val = JS_AtomToValue(ctx, prop);
+    if (JS_IsException(prop_val)) {
+        JS_FreeValue(ctx, method);
+        return -1;
+    }
+    desc_val = js_create_desc(ctx, val, getter, setter, flags);
+    if (JS_IsException(desc_val)) {
+        JS_FreeValue(ctx, prop_val);
+        JS_FreeValue(ctx, method);
+        return -1;
+    }
+    args[0] = s->target;
+    args[1] = prop_val;
+    args[2] = desc_val;
+    ret1 = JS_CallFree(ctx, method, s->handler, 3, args);
+    JS_FreeValue(ctx, prop_val);
+    JS_FreeValue(ctx, desc_val);
+    if (JS_IsException(ret1))
+        return -1;
+    ret = JS_ToBoolFree(ctx, ret1);
+    if (!ret) {
+        if (flags & JS_PROP_THROW) {
+            JS_ThrowTypeError(ctx, "proxy: defineProperty exception");
+            return -1;
+        } else {
+            return 0;
+        }
+    }
+    p = JS_VALUE_GET_OBJ(s->target);
+    res = JS_GetOwnProperty(ctx, &desc, p, prop);
+    if (res < 0)
+        return -1;
+    setting_not_configurable = ((flags & (JS_PROP_HAS_CONFIGURABLE |
+                                          JS_PROP_CONFIGURABLE)) ==
+                                JS_PROP_HAS_CONFIGURABLE);
+    if (!res) {
+        if (!p->extensible || setting_not_configurable)
+            goto fail;
+    } else {
+        if (!check_define_prop_flags(desc.flags, flags) ||
+            ((desc.flags & JS_PROP_CONFIGURABLE) && setting_not_configurable)) {
+            goto fail1;
+        }
+        if (flags & (JS_PROP_HAS_GET | JS_PROP_HAS_SET)) {
+            if ((desc.flags & (JS_PROP_GETSET | JS_PROP_CONFIGURABLE)) ==
+                JS_PROP_GETSET) {
+                if ((flags & JS_PROP_HAS_GET) &&
+                    !js_same_value(ctx, getter, desc.getter)) {
+                    goto fail1;
+                }
+                if ((flags & JS_PROP_HAS_SET) &&
+                    !js_same_value(ctx, setter, desc.setter)) {
+                    goto fail1;
+                }
+            }
+        } else if (flags & JS_PROP_HAS_VALUE) {
+            if ((desc.flags & (JS_PROP_CONFIGURABLE | JS_PROP_WRITABLE)) == 0 &&
+                !js_same_value(ctx, val, desc.value)) {
+            fail1:
+                js_free_desc(ctx, &desc);
+            fail:
+                JS_ThrowTypeError(ctx, "proxy: inconsistent defineProperty");
+                return -1;
+            }
+        }
+        js_free_desc(ctx, &desc);
+    }
+    return 1;
+}
+
+static int js_proxy_delete_property(JSContext *ctx, JSValueConst obj,
+                                    JSAtom atom)
+{
+    JSProxyData *s;
+    JSValue method, ret, atom_val;
+    int res, res2;
+    JSValueConst args[2];
+
+    s = get_proxy_method(ctx, &method, obj, JS_ATOM_deleteProperty);
+    if (!s)
+        return -1;
+    if (JS_IsUndefined(method)) {
+        return JS_DeleteProperty(ctx, s->target, atom, 0);
+    }
+    atom_val = JS_AtomToValue(ctx, atom);;
+    if (JS_IsException(atom_val)) {
+        JS_FreeValue(ctx, method);
+        return -1;
+    }
+    args[0] = s->target;
+    args[1] = atom_val;
+    ret = JS_CallFree(ctx, method, s->handler, 2, args);
+    JS_FreeValue(ctx, atom_val);
+    if (JS_IsException(ret))
+        return -1;
+    res = JS_ToBoolFree(ctx, ret);
+    if (res) {
+        JSPropertyDescriptor desc;
+        res2 = JS_GetOwnProperty(ctx, &desc, JS_VALUE_GET_OBJ(s->target), atom);
+        if (res2 < 0)
+            return -1;
+        if (res2) {
+            res2 = !(desc.flags & JS_PROP_CONFIGURABLE);
+            js_free_desc(ctx, &desc);
+            if (res2) {
+                JS_ThrowTypeError(ctx, "proxy: inconsistent deleteProperty");
+                return -1;
+            }
+        }
+    }
+    return res;
+}
+
+/* return the index of the property or -1 if not found */
+static int find_prop_key(const JSPropertyEnum *tab, int n, JSAtom atom)
+{
+    int i;
+    for(i = 0; i < n; i++) {
+        if (tab[i].atom == atom)
+            return i;
+    }
+    return -1;
+}
+
+static int js_proxy_get_own_property_names(JSContext *ctx,
+                                           JSPropertyEnum **ptab,
+                                           uint32_t *plen,
+                                           JSValueConst obj)
+{
+    JSProxyData *s;
+    JSValue method, prop_array, val;
+    uint32_t len, i, len2;
+    JSPropertyEnum *tab, *tab2;
+    JSAtom atom;
+    JSPropertyDescriptor desc;
+    int res, is_extensible, idx;
+
+    s = get_proxy_method(ctx, &method, obj, JS_ATOM_ownKeys);
+    if (!s)
+        return -1;
+    if (JS_IsUndefined(method)) {
+        return JS_GetOwnPropertyNames(ctx, ptab, plen,
+                                      JS_VALUE_GET_OBJ(s->target),
+                                      JS_GPN_STRING_MASK | JS_GPN_SYMBOL_MASK);
+    }
+    prop_array = JS_CallFree(ctx, method, s->handler, 1, (JSValueConst *)&s->target);
+    if (JS_IsException(prop_array))
+        return -1;
+    tab = NULL;
+    len = 0;
+    tab2 = NULL;
+    len2 = 0;
+    if (js_get_length32(ctx, &len, prop_array))
+        goto fail;
+    if (len == 0)
+        goto done;
+    tab = js_mallocz(ctx, sizeof(tab[0]) * len);
+    if (!tab)
+        goto fail;
+    for(i = 0; i < len; i++) {
+        val = JS_GetPropertyUint32(ctx, prop_array, i);
+        if (JS_IsException(val))
+            goto fail;
+        if (!JS_IsString(val) && !JS_IsSymbol(val)) {
+            JS_FreeValue(ctx, val);
+            JS_ThrowTypeError(ctx, "proxy: properties must be strings or symbols");
+            goto fail;
+        }
+        atom = js_value_to_atom(ctx, val);
+        JS_FreeValue(ctx, val);
+        if (atom == JS_ATOM_NULL)
+            goto fail;
+        tab[i].atom = atom;
+        tab[i].is_enumerable = FALSE; /* XXX: redundant? */
+    }
+
+    /* check duplicate properties (XXX: inefficient, could store the
+     * properties an a temporary object to use the hash) */
+    for(i = 1; i < len; i++) {
+        if (find_prop_key(tab, i, tab[i].atom) >= 0) {
+            JS_ThrowTypeError(ctx, "proxy: duplicate property");
+            goto fail;
+        }
+    }
+
+    is_extensible = JS_IsExtensible(ctx, s->target);
+    if (is_extensible < 0)
+        goto fail;
+
+    /* check if there are non configurable properties */
+    if (JS_IsNull(s->handler)) {
+        JS_ThrowTypeError(ctx, "revoked proxy");
+        goto fail;
+    }
+    if (JS_GetOwnPropertyNames(ctx, &tab2, &len2, JS_VALUE_GET_OBJ(s->target),
+                               JS_GPN_STRING_MASK | JS_GPN_SYMBOL_MASK))
+        goto fail;
+    for(i = 0; i < len2; i++) {
+        if (JS_IsNull(s->handler)) {
+            JS_ThrowTypeError(ctx, "revoked proxy");
+            goto fail;
+        }
+        res = JS_GetOwnProperty(ctx, &desc, JS_VALUE_GET_OBJ(s->target),
+                                tab2[i].atom);
+        if (res < 0)
+            goto fail;
+        if (res) {  /* safety, property should be found */
+            js_free_desc(ctx, &desc);
+            if (!(desc.flags & JS_PROP_CONFIGURABLE) || !is_extensible) {
+                idx = find_prop_key(tab, len, tab2[i].atom);
+                if (idx < 0) {
+                    JS_ThrowTypeError(ctx, "proxy: target property must be present in proxy ownKeys");
+                    goto fail;
+                }
+                /* mark the property as found */
+                if (!is_extensible)
+                    tab[idx].is_enumerable = TRUE;
+            }
+        }
+    }
+    if (!is_extensible) {
+        /* check that all property in 'tab' were checked */
+        for(i = 0; i < len; i++) {
+            if (!tab[i].is_enumerable) {
+                JS_ThrowTypeError(ctx, "proxy: property not present in target were returned by non extensible proxy");
+                goto fail;
+            }
+        }
+    }
+
+ done:
+    js_free_prop_enum(ctx, tab2, len2);
+    JS_FreeValue(ctx, prop_array);
+    *ptab = tab;
+    *plen = len;
+    return 0;
+ fail:
+    js_free_prop_enum(ctx, tab2, len2);
+    js_free_prop_enum(ctx, tab, len);
+    JS_FreeValue(ctx, prop_array);
+    return -1;
+}
+
+static JSValue js_proxy_call(JSContext *ctx, JSValueConst func_obj,
+                             JSValueConst this_obj,
+                             int argc, JSValueConst *argv)
+{
+    JSProxyData *s;
+    JSValue method, arg_array, ret;
+    JSValueConst args[3];
+
+    s = get_proxy_method(ctx, &method, func_obj, JS_ATOM_apply);
+    if (!s)
+        return JS_EXCEPTION;
+    if (!s->is_func)
+        return JS_ThrowTypeError(ctx, "not a function");
+    if (JS_IsUndefined(method))
+        return JS_Call(ctx, s->target, this_obj, argc, argv);
+    arg_array = js_create_array(ctx, argc, argv);
+    if (JS_IsException(arg_array)) {
+        ret = JS_EXCEPTION;
+        goto fail;
+    }
+    args[0] = s->target;
+    args[1] = this_obj;
+    args[2] = arg_array;
+    ret = JS_Call(ctx, method, s->handler, 3, args);
+ fail:
+    JS_FreeValue(ctx, method);
+    JS_FreeValue(ctx, arg_array);
+    return ret;
+}
+
+static JSValue js_proxy_call_constructor(JSContext *ctx, JSValueConst func_obj,
+                                         JSValueConst new_target,
+                                         int argc, JSValueConst *argv)
+{
+    JSProxyData *s;
+    JSValue method, arg_array, ret;
+    JSValueConst args[3];
+
+    s = get_proxy_method(ctx, &method, func_obj, JS_ATOM_construct);
+    if (!s)
+        return JS_EXCEPTION;
+    if (!JS_IsConstructor(ctx, s->target))
+        return JS_ThrowTypeError(ctx, "not a constructor");
+    if (JS_IsUndefined(method))
+        return JS_CallConstructor2(ctx, s->target, new_target, argc, argv);
+    arg_array = js_create_array(ctx, argc, argv);
+    if (JS_IsException(arg_array)) {
+        ret = JS_EXCEPTION;
+        goto fail;
+    }
+    args[0] = s->target;
+    args[1] = arg_array;
+    args[2] = new_target;
+    ret = JS_Call(ctx, method, s->handler, 3, args);
+    if (!JS_IsException(ret) && JS_VALUE_GET_TAG(ret) != JS_TAG_OBJECT) {
+        JS_FreeValue(ctx, ret);
+        ret = JS_ThrowTypeErrorNotAnObject(ctx);
+    }
+ fail:
+    JS_FreeValue(ctx, method);
+    JS_FreeValue(ctx, arg_array);
+    return ret;
+}
+
+static int js_proxy_isArray(JSContext *ctx, JSValueConst obj)
+{
+    JSProxyData *s = JS_GetOpaque(obj, JS_CLASS_PROXY);
+    if (!s)
+        return FALSE;
+    if (JS_IsNull(s->handler)) {
+        JS_ThrowTypeError(ctx, "revoked proxy");
+        return -1;
+    }
+    return JS_IsArray(ctx, s->target);
+}
+
+static const JSClassExoticMethods js_proxy_exotic_methods = {
+    .get_own_property = js_proxy_get_own_property,
+    .define_own_property = js_proxy_define_own_property,
+    .delete_property = js_proxy_delete_property,
+    .get_own_property_names = js_proxy_get_own_property_names,
+    .has_property = js_proxy_has,
+    .get_property = js_proxy_get,
+    .set_property = js_proxy_set,
+};
+
+static JSValue js_proxy_constructor(JSContext *ctx, JSValueConst this_val,
+                                    int argc, JSValueConst *argv)
+{
+    JSValueConst target, handler;
+    JSValue obj;
+    JSProxyData *s;
+
+    target = argv[0];
+    handler = argv[1];
+    if (JS_VALUE_GET_TAG(target) != JS_TAG_OBJECT ||
+        JS_VALUE_GET_TAG(handler) != JS_TAG_OBJECT)
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+    s = JS_GetOpaque(target, JS_CLASS_PROXY);
+    if (s && JS_IsNull(s->handler))
+        goto revoked_proxy;
+    s = JS_GetOpaque(handler, JS_CLASS_PROXY);
+    if (s && JS_IsNull(s->handler)) {
+    revoked_proxy:
+        return JS_ThrowTypeError(ctx, "revoked proxy");
+    }
+
+    obj = JS_NewObjectProtoClass(ctx, JS_NULL, JS_CLASS_PROXY);
+    if (JS_IsException(obj))
+        return obj;
+    s = js_malloc(ctx, sizeof(JSProxyData));
+    if (!s) {
+        JS_FreeValue(ctx, obj);
+        return JS_EXCEPTION;
+    }
+    s->target = JS_DupValue(ctx, target);
+    s->handler = JS_DupValue(ctx, handler);
+    s->proto = JS_NULL;
+    s->is_func = JS_IsFunction(ctx, target);
+    JS_SetOpaque(obj, s);
+    JS_SetConstructorBit(ctx, obj, JS_IsConstructor(ctx, target));
+    return obj;
+}
+
+static JSValue js_proxy_revoke(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv, int magic,
+                               JSValue *func_data)
+{
+    JSProxyData *s = JS_GetOpaque(func_data[0], JS_CLASS_PROXY);
+    if (s) {
+        /* Note: we keep s->target so that the proxy handlers can still be
+           executed if the revocation is done inside a Proxy callback */
+        JS_FreeValue(ctx, s->handler);
+        s->handler = JS_NULL;
+        JS_FreeValue(ctx, func_data[0]);
+        func_data[0] = JS_NULL;
+    }
+    return JS_UNDEFINED;
+}
+
+static JSValue js_proxy_revoke_constructor(JSContext *ctx,
+                                           JSValueConst proxy_obj)
+{
+    return JS_NewCFunctionData(ctx, js_proxy_revoke, 0, 0, 1, &proxy_obj);
+}
+
+static JSValue js_proxy_revocable(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv)
+{
+    JSValue proxy_obj, revoke_obj = JS_UNDEFINED, obj;
+
+    proxy_obj = js_proxy_constructor(ctx, JS_UNDEFINED, argc, argv);
+    if (JS_IsException(proxy_obj))
+        goto fail;
+    revoke_obj = js_proxy_revoke_constructor(ctx, proxy_obj);
+    if (JS_IsException(revoke_obj))
+        goto fail;
+    obj = JS_NewObject(ctx);
+    if (JS_IsException(obj))
+        goto fail;
+    // XXX: exceptions?
+    JS_DefinePropertyValue(ctx, obj, JS_ATOM_proxy, proxy_obj, JS_PROP_C_W_E);
+    JS_DefinePropertyValue(ctx, obj, JS_ATOM_revoke, revoke_obj, JS_PROP_C_W_E);
+    return obj;
+ fail:
+    JS_FreeValue(ctx, proxy_obj);
+    JS_FreeValue(ctx, revoke_obj);
+    return JS_EXCEPTION;
+}
+
+static const JSCFunctionListEntry js_proxy_funcs[] = {
+    JS_CFUNC_DEF("revocable", 2, js_proxy_revocable ),
+};
+
+static const JSClassShortDef js_proxy_class_def[] = {
+    { JS_ATOM_Object, js_proxy_finalizer, js_proxy_mark }, /* JS_CLASS_PROXY */
+};
+
+void JS_AddIntrinsicProxy(JSContext *ctx)
+{
+    JSRuntime *rt = ctx->rt;
+    JSValue obj1;
+
+    if (!JS_IsRegisteredClass(rt, JS_CLASS_PROXY)) {
+        init_class_range(rt, js_proxy_class_def, JS_CLASS_PROXY,
+                         countof(js_proxy_class_def));
+        rt->class_array[JS_CLASS_PROXY].exotic = &js_proxy_exotic_methods;
+        rt->class_array[JS_CLASS_PROXY].call = js_proxy_call;
+    }
+
+    obj1 = JS_NewCFunction2(ctx, js_proxy_constructor, "Proxy", 2,
+                            JS_CFUNC_constructor, 0);
+    JS_SetConstructorBit(ctx, obj1, TRUE);
+    JS_SetPropertyFunctionList(ctx, obj1, js_proxy_funcs,
+                               countof(js_proxy_funcs));
+    JS_DefinePropertyValueStr(ctx, ctx->global_obj, "Proxy",
+                              obj1, JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+}
+
+/* Symbol */
+
+static JSValue js_symbol_constructor(JSContext *ctx, JSValueConst new_target,
+                                     int argc, JSValueConst *argv)
+{
+    JSValue str;
+    JSString *p;
+
+    if (!JS_IsUndefined(new_target))
+        return JS_ThrowTypeError(ctx, "not a constructor");
+    if (argc == 0 || JS_IsUndefined(argv[0])) {
+        p = NULL;
+    } else {
+        str = JS_ToString(ctx, argv[0]);
+        if (JS_IsException(str))
+            return JS_EXCEPTION;
+        p = JS_VALUE_GET_STRING(str);
+    }
+    return JS_NewSymbol(ctx, p, JS_ATOM_TYPE_SYMBOL);
+}
+
+static JSValue js_thisSymbolValue(JSContext *ctx, JSValueConst this_val)
+{
+    if (JS_VALUE_GET_TAG(this_val) == JS_TAG_SYMBOL)
+        return JS_DupValue(ctx, this_val);
+
+    if (JS_VALUE_GET_TAG(this_val) == JS_TAG_OBJECT) {
+        JSObject *p = JS_VALUE_GET_OBJ(this_val);
+        if (p->class_id == JS_CLASS_SYMBOL) {
+            if (JS_VALUE_GET_TAG(p->u.object_data) == JS_TAG_SYMBOL)
+                return JS_DupValue(ctx, p->u.object_data);
+        }
+    }
+    return JS_ThrowTypeError(ctx, "not a symbol");
+}
+
+static JSValue js_symbol_toString(JSContext *ctx, JSValueConst this_val,
+                                  int argc, JSValueConst *argv)
+{
+    JSValue val, ret;
+    val = js_thisSymbolValue(ctx, this_val);
+    if (JS_IsException(val))
+        return val;
+    /* XXX: use JS_ToStringInternal() with a flags */
+    ret = js_string_constructor(ctx, JS_UNDEFINED, 1, (JSValueConst *)&val);
+    JS_FreeValue(ctx, val);
+    return ret;
+}
+
+static JSValue js_symbol_valueOf(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv)
+{
+    return js_thisSymbolValue(ctx, this_val);
+}
+
+static JSValue js_symbol_get_description(JSContext *ctx, JSValueConst this_val)
+{
+    JSValue val, ret;
+    JSAtomStruct *p;
+
+    val = js_thisSymbolValue(ctx, this_val);
+    if (JS_IsException(val))
+        return val;
+    p = JS_VALUE_GET_PTR(val);
+    if (p->len == 0 && p->is_wide_char != 0) {
+        ret = JS_UNDEFINED;
+    } else {
+        ret = JS_AtomToString(ctx, js_get_atom_index(ctx->rt, p));
+    }
+    JS_FreeValue(ctx, val);
+    return ret;
+}
+
+static const JSCFunctionListEntry js_symbol_proto_funcs[] = {
+    JS_CFUNC_DEF("toString", 0, js_symbol_toString ),
+    JS_CFUNC_DEF("valueOf", 0, js_symbol_valueOf ),
+    // XXX: should have writable: false
+    JS_CFUNC_DEF("[Symbol.toPrimitive]", 1, js_symbol_valueOf ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "Symbol", JS_PROP_CONFIGURABLE ),
+    JS_CGETSET_DEF("description", js_symbol_get_description, NULL ),
+};
+
+static JSValue js_symbol_for(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv)
+{
+    JSValue str;
+
+    str = JS_ToString(ctx, argv[0]);
+    if (JS_IsException(str))
+        return JS_EXCEPTION;
+    return JS_NewSymbol(ctx, JS_VALUE_GET_STRING(str), JS_ATOM_TYPE_GLOBAL_SYMBOL);
+}
+
+static JSValue js_symbol_keyFor(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    JSAtomStruct *p;
+
+    if (!JS_IsSymbol(argv[0]))
+        return JS_ThrowTypeError(ctx, "not a symbol");
+    p = JS_VALUE_GET_PTR(argv[0]);
+    if (p->atom_type != JS_ATOM_TYPE_GLOBAL_SYMBOL)
+        return JS_UNDEFINED;
+    return JS_DupValue(ctx, JS_MKPTR(JS_TAG_STRING, p));
+}
+
+static const JSCFunctionListEntry js_symbol_funcs[] = {
+    JS_CFUNC_DEF("for", 1, js_symbol_for ),
+    JS_CFUNC_DEF("keyFor", 1, js_symbol_keyFor ),
+};
+
+/* Set/Map/WeakSet/WeakMap */
+
+typedef struct JSMapRecord {
+    int ref_count; /* used during enumeration to avoid freeing the record */
+    BOOL empty; /* TRUE if the record is deleted */
+    struct JSMapState *map;
+    struct JSMapRecord *next_weak_ref;
+    struct list_head link;
+    struct list_head hash_link;
+    JSValue key;
+    JSValue value;
+} JSMapRecord;
+
+typedef struct JSMapState {
+    BOOL is_weak; /* TRUE if WeakSet/WeakMap */
+    struct list_head records; /* list of JSMapRecord.link */
+    uint32_t record_count;
+    struct list_head *hash_table;
+    uint32_t hash_size; /* must be a power of two */
+    uint32_t record_count_threshold; /* count at which a hash table
+                                        resize is needed */
+} JSMapState;
+
+#define MAGIC_SET (1 << 0)
+#define MAGIC_WEAK (1 << 1)
+
+static JSValue js_map_constructor(JSContext *ctx, JSValueConst new_target,
+                                  int argc, JSValueConst *argv, int magic)
+{
+    JSMapState *s;
+    JSValue obj, adder = JS_UNDEFINED, iter = JS_UNDEFINED, next_method = JS_UNDEFINED;
+    JSValueConst arr;
+    BOOL is_set, is_weak;
+
+    is_set = magic & MAGIC_SET;
+    is_weak = ((magic & MAGIC_WEAK) != 0);
+    obj = js_create_from_ctor(ctx, new_target, JS_CLASS_MAP + magic);
+    if (JS_IsException(obj))
+        return JS_EXCEPTION;
+    s = js_mallocz(ctx, sizeof(*s));
+    if (!s)
+        goto fail;
+    init_list_head(&s->records);
+    s->is_weak = is_weak;
+    JS_SetOpaque(obj, s);
+    s->hash_size = 1;
+    s->hash_table = js_malloc(ctx, sizeof(s->hash_table[0]) * s->hash_size);
+    if (!s->hash_table)
+        goto fail;
+    init_list_head(&s->hash_table[0]);
+    s->record_count_threshold = 4;
+
+    arr = JS_UNDEFINED;
+    if (argc > 0)
+        arr = argv[0];
+    if (!JS_IsUndefined(arr) && !JS_IsNull(arr)) {
+        JSValue item, ret;
+        BOOL done;
+
+        adder = JS_GetProperty(ctx, obj, is_set ? JS_ATOM_add : JS_ATOM_set);
+        if (JS_IsException(adder))
+            goto fail;
+        if (!JS_IsFunction(ctx, adder)) {
+            JS_ThrowTypeError(ctx, "set/add is not a function");
+            goto fail;
+        }
+
+        iter = JS_GetIterator(ctx, arr, FALSE);
+        if (JS_IsException(iter))
+            goto fail;
+        next_method = JS_GetProperty(ctx, iter, JS_ATOM_next);
+        if (JS_IsException(next_method))
+            goto fail;
+
+        for(;;) {
+            item = JS_IteratorNext(ctx, iter, next_method, 0, NULL, &done);
+            if (JS_IsException(item))
+                goto fail;
+            if (done) {
+                JS_FreeValue(ctx, item);
+                break;
+            }
+            if (is_set) {
+                ret = JS_Call(ctx, adder, obj, 1, (JSValueConst *)&item);
+                if (JS_IsException(ret)) {
+                    JS_FreeValue(ctx, item);
+                    goto fail;
+                }
+            } else {
+                JSValue key, value;
+                JSValueConst args[2];
+                key = JS_UNDEFINED;
+                value = JS_UNDEFINED;
+                if (!JS_IsObject(item)) {
+                    JS_ThrowTypeErrorNotAnObject(ctx);
+                    goto fail1;
+                }
+                key = JS_GetPropertyUint32(ctx, item, 0);
+                if (JS_IsException(key))
+                    goto fail1;
+                value = JS_GetPropertyUint32(ctx, item, 1);
+                if (JS_IsException(value))
+                    goto fail1;
+                args[0] = key;
+                args[1] = value;
+                ret = JS_Call(ctx, adder, obj, 2, args);
+                if (JS_IsException(ret)) {
+                fail1:
+                    JS_FreeValue(ctx, item);
+                    JS_FreeValue(ctx, key);
+                    JS_FreeValue(ctx, value);
+                    goto fail;
+                }
+                JS_FreeValue(ctx, key);
+                JS_FreeValue(ctx, value);
+            }
+            JS_FreeValue(ctx, ret);
+            JS_FreeValue(ctx, item);
+        }
+        JS_FreeValue(ctx, next_method);
+        JS_FreeValue(ctx, iter);
+        JS_FreeValue(ctx, adder);
+    }
+    return obj;
+ fail:
+    if (JS_IsObject(iter)) {
+        /* close the iterator object, preserving pending exception */
+        JS_IteratorClose(ctx, iter, TRUE);
+    }
+    JS_FreeValue(ctx, next_method);
+    JS_FreeValue(ctx, iter);
+    JS_FreeValue(ctx, adder);
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+/* XXX: could normalize strings to speed up comparison */
+static JSValueConst map_normalize_key(JSContext *ctx, JSValueConst key)
+{
+    uint32_t tag = JS_VALUE_GET_TAG(key);
+    /* convert -0.0 to +0.0 */
+    if (JS_TAG_IS_FLOAT64(tag) && JS_VALUE_GET_FLOAT64(key) == 0.0) {
+        key = JS_NewInt32(ctx, 0);
+    }
+    return key;
+}
+
+/* XXX: better hash ? */
+static uint32_t map_hash_key(JSContext *ctx, JSValueConst key)
+{
+    uint32_t tag = JS_VALUE_GET_NORM_TAG(key);
+    uint32_t h;
+    double d;
+    JSFloat64Union u;
+
+    switch(tag) {
+    case JS_TAG_BOOL:
+        h = JS_VALUE_GET_INT(key);
+        break;
+    case JS_TAG_STRING:
+        h = hash_string(JS_VALUE_GET_STRING(key), 0);
+        break;
+    case JS_TAG_OBJECT:
+    case JS_TAG_SYMBOL:
+        h = (uintptr_t)JS_VALUE_GET_PTR(key) * 3163;
+        break;
+    case JS_TAG_INT:
+        d = JS_VALUE_GET_INT(key) * 3163;
+        goto hash_float64;
+    case JS_TAG_FLOAT64:
+        d = JS_VALUE_GET_FLOAT64(key);
+        /* normalize the NaN */
+        if (isnan(d))
+            d = JS_FLOAT64_NAN;
+    hash_float64:
+        u.d = d;
+        h = (u.u32[0] ^ u.u32[1]) * 3163;
+        break;
+    default:
+        h = 0; /* XXX: bignum support */
+        break;
+    }
+    h ^= tag;
+    return h;
+}
+
+static JSMapRecord *map_find_record(JSContext *ctx, JSMapState *s,
+                                    JSValueConst key)
+{
+    struct list_head *el;
+    JSMapRecord *mr;
+    uint32_t h;
+    h = map_hash_key(ctx, key) & (s->hash_size - 1);
+    list_for_each(el, &s->hash_table[h]) {
+        mr = list_entry(el, JSMapRecord, hash_link);
+        if (js_same_value_zero(ctx, mr->key, key))
+            return mr;
+    }
+    return NULL;
+}
+
+static void map_hash_resize(JSContext *ctx, JSMapState *s)
+{
+    uint32_t new_hash_size, i, h;
+    size_t slack;
+    struct list_head *new_hash_table, *el;
+    JSMapRecord *mr;
+
+    /* XXX: no reporting of memory allocation failure */
+    if (s->hash_size == 1)
+        new_hash_size = 4;
+    else
+        new_hash_size = s->hash_size * 2;
+    new_hash_table = js_realloc2(ctx, s->hash_table,
+                                 sizeof(new_hash_table[0]) * new_hash_size, &slack);
+    if (!new_hash_table)
+        return;
+    new_hash_size += slack / sizeof(*new_hash_table);
+
+    for(i = 0; i < new_hash_size; i++)
+        init_list_head(&new_hash_table[i]);
+
+    list_for_each(el, &s->records) {
+        mr = list_entry(el, JSMapRecord, link);
+        if (!mr->empty) {
+            h = map_hash_key(ctx, mr->key) & (new_hash_size - 1);
+            list_add_tail(&mr->hash_link, &new_hash_table[h]);
+        }
+    }
+    s->hash_table = new_hash_table;
+    s->hash_size = new_hash_size;
+    s->record_count_threshold = new_hash_size * 2;
+}
+
+static JSMapRecord *map_add_record(JSContext *ctx, JSMapState *s,
+                                   JSValueConst key)
+{
+    uint32_t h;
+    JSMapRecord *mr;
+
+    mr = js_malloc(ctx, sizeof(*mr));
+    if (!mr)
+        return NULL;
+    mr->ref_count = 1;
+    mr->map = s;
+    mr->empty = FALSE;
+    if (s->is_weak) {
+        JSObject *p = JS_VALUE_GET_OBJ(key);
+        /* Add the weak reference */
+        mr->next_weak_ref = p->first_weak_ref;
+        p->first_weak_ref = mr;
+    } else {
+        JS_DupValue(ctx, key);
+    }
+    mr->key = CastToJSValue(key);
+    h = map_hash_key(ctx, key) & (s->hash_size - 1);
+    list_add_tail(&mr->hash_link, &s->hash_table[h]);
+    list_add_tail(&mr->link, &s->records);
+    s->record_count++;
+    if (s->record_count >= s->record_count_threshold) {
+        map_hash_resize(ctx, s);
+    }
+    return mr;
+}
+
+/* Remove the weak reference from the object weak
+   reference list. we don't use a doubly linked list to
+   save space, assuming a given object has few weak
+       references to it */
+static void delete_weak_ref(JSRuntime *rt, JSMapRecord *mr)
+{
+    JSMapRecord **pmr, *mr1;
+    JSObject *p;
+
+    p = JS_VALUE_GET_OBJ(mr->key);
+    pmr = &p->first_weak_ref;
+    for(;;) {
+        mr1 = *pmr;
+        assert(mr1 != NULL);
+        if (mr1 == mr)
+            break;
+        pmr = &mr1->next_weak_ref;
+    }
+    *pmr = mr1->next_weak_ref;
+}
+
+static void map_delete_record(JSRuntime *rt, JSMapState *s, JSMapRecord *mr,
+                              BOOL from_reset_weak)
+{
+    if (mr->empty)
+        return;
+    list_del(&mr->hash_link);
+    if (s->is_weak) {
+        if (!from_reset_weak)
+            delete_weak_ref(rt, mr);
+    } else {
+        JS_FreeValueRT(rt, mr->key);
+    }
+    JS_FreeValueRT(rt, mr->value);
+    if (--mr->ref_count == 0) {
+        list_del(&mr->link);
+        js_free_rt(rt, mr);
+    } else {
+        /* keep a zombie record for iterators */
+        mr->empty = TRUE;
+        mr->key = JS_UNDEFINED;
+        mr->value = JS_UNDEFINED;
+    }
+    s->record_count--;
+}
+
+static void map_decref_record(JSRuntime *rt, JSMapRecord *mr)
+{
+    if (--mr->ref_count == 0) {
+        /* the record can be safely removed */
+        assert(mr->empty);
+        list_del(&mr->link);
+        js_free_rt(rt, mr);
+    }
+}
+
+static void reset_weak_ref(JSRuntime *rt, JSObject *p)
+{
+    JSMapRecord *mr, *mr_next;
+    mr = p->first_weak_ref;
+    while (mr != NULL) {
+        mr_next = mr->next_weak_ref;
+        map_delete_record(rt, mr->map, mr, TRUE);
+        mr = mr_next;
+    }
+    p->first_weak_ref = NULL; /* fail safe */
+}
+
+static JSValue js_map_set(JSContext *ctx, JSValueConst this_val,
+                          int argc, JSValueConst *argv, int magic)
+{
+    JSMapState *s = JS_GetOpaque2(ctx, this_val, JS_CLASS_MAP + magic);
+    JSMapRecord *mr;
+    JSValueConst key, value;
+    BOOL is_weak;
+
+    if (!s)
+        return JS_EXCEPTION;
+    is_weak = magic & MAGIC_WEAK;
+    key = map_normalize_key(ctx, argv[0]);
+    if (is_weak && !JS_IsObject(key))
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+    if (magic & MAGIC_SET)
+        value = JS_UNDEFINED;
+    else
+        value = argv[1];
+    mr = map_find_record(ctx, s, key);
+    if (mr) {
+        JS_FreeValue(ctx, mr->value);
+    } else {
+        mr = map_add_record(ctx, s, key);
+        if (!mr)
+            return JS_EXCEPTION;
+    }
+    mr->value = JS_DupValue(ctx, value);
+    return JS_DupValue(ctx, this_val);
+}
+
+static JSValue js_map_get(JSContext *ctx, JSValueConst this_val,
+                          int argc, JSValueConst *argv, int magic)
+{
+    JSMapState *s = JS_GetOpaque2(ctx, this_val, JS_CLASS_MAP + magic);
+    JSMapRecord *mr;
+    JSValueConst key;
+
+    if (!s)
+        return JS_EXCEPTION;
+    key = map_normalize_key(ctx, argv[0]);
+    mr = map_find_record(ctx, s, key);
+    if (!mr)
+        return JS_UNDEFINED;
+    else
+        return JS_DupValue(ctx, mr->value);
+}
+
+static JSValue js_map_has(JSContext *ctx, JSValueConst this_val,
+                          int argc, JSValueConst *argv, int magic)
+{
+    JSMapState *s = JS_GetOpaque2(ctx, this_val, JS_CLASS_MAP + magic);
+    JSMapRecord *mr;
+    JSValueConst key;
+
+    if (!s)
+        return JS_EXCEPTION;
+    key = map_normalize_key(ctx, argv[0]);
+    mr = map_find_record(ctx, s, key);
+    return JS_NewBool(ctx, (mr != NULL));
+}
+
+static JSValue js_map_delete(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv, int magic)
+{
+    JSMapState *s = JS_GetOpaque2(ctx, this_val, JS_CLASS_MAP + magic);
+    JSMapRecord *mr;
+    JSValueConst key;
+
+    if (!s)
+        return JS_EXCEPTION;
+    key = map_normalize_key(ctx, argv[0]);
+    mr = map_find_record(ctx, s, key);
+    if (!mr)
+        return JS_FALSE;
+    map_delete_record(ctx->rt, s, mr, FALSE);
+    return JS_TRUE;
+}
+
+static JSValue js_map_clear(JSContext *ctx, JSValueConst this_val,
+                            int argc, JSValueConst *argv, int magic)
+{
+    JSMapState *s = JS_GetOpaque2(ctx, this_val, JS_CLASS_MAP + magic);
+    struct list_head *el, *el1;
+    JSMapRecord *mr;
+
+    if (!s)
+        return JS_EXCEPTION;
+    list_for_each_safe(el, el1, &s->records) {
+        mr = list_entry(el, JSMapRecord, link);
+        map_delete_record(ctx->rt, s, mr, FALSE);
+    }
+    return JS_UNDEFINED;
+}
+
+static JSValue js_map_get_size(JSContext *ctx, JSValueConst this_val, int magic)
+{
+    JSMapState *s = JS_GetOpaque2(ctx, this_val, JS_CLASS_MAP + magic);
+    if (!s)
+        return JS_EXCEPTION;
+    return JS_NewUint32(ctx, s->record_count);
+}
+
+static JSValue js_map_forEach(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv, int magic)
+{
+    JSMapState *s = JS_GetOpaque2(ctx, this_val, JS_CLASS_MAP + magic);
+    JSValueConst func, this_arg;
+    JSValue ret, args[3];
+    struct list_head *el;
+    JSMapRecord *mr;
+
+    if (!s)
+        return JS_EXCEPTION;
+    func = argv[0];
+    if (argc > 1)
+        this_arg = argv[1];
+    else
+        this_arg = JS_UNDEFINED;
+    if (check_function(ctx, func))
+        return JS_EXCEPTION;
+    /* Note: the list can be modified while traversing it, but the
+       current element is locked */
+    el = s->records.next;
+    while (el != &s->records) {
+        mr = list_entry(el, JSMapRecord, link);
+        if (!mr->empty) {
+            mr->ref_count++;
+            /* must duplicate in case the record is deleted */
+            args[1] = JS_DupValue(ctx, mr->key);
+            if (magic)
+                args[0] = args[1];
+            else
+                args[0] = JS_DupValue(ctx, mr->value);
+            args[2] = CastToJSValue(this_val);
+            ret = JS_Call(ctx, func, this_arg, 3, (JSValueConst *)args);
+            JS_FreeValue(ctx, args[0]);
+            if (!magic)
+                JS_FreeValue(ctx, args[1]);
+            el = el->next;
+            map_decref_record(ctx->rt, mr);
+            if (JS_IsException(ret))
+                return ret;
+            JS_FreeValue(ctx, ret);
+        } else {
+            el = el->next;
+        }
+    }
+    return JS_UNDEFINED;
+}
+
+static void js_map_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSObject *p;
+    JSMapState *s;
+    struct list_head *el, *el1;
+    JSMapRecord *mr;
+
+    p = JS_VALUE_GET_OBJ(val);
+    s = p->u.map_state;
+    if (s) {
+        /* if the object is deleted we are sure that no iterator is
+           using it */
+        list_for_each_safe(el, el1, &s->records) {
+            mr = list_entry(el, JSMapRecord, link);
+            if (!mr->empty) {
+                if (s->is_weak)
+                    delete_weak_ref(rt, mr);
+                else
+                    JS_FreeValueRT(rt, mr->key);
+                JS_FreeValueRT(rt, mr->value);
+            }
+            js_free_rt(rt, mr);
+        }
+        js_free_rt(rt, s->hash_table);
+        js_free_rt(rt, s);
+    }
+}
+
+static void js_map_mark(JSRuntime *rt, JSValueConst val, JS_MarkFunc *mark_func)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    JSMapState *s;
+    struct list_head *el;
+    JSMapRecord *mr;
+
+    s = p->u.map_state;
+    if (s) {
+        list_for_each(el, &s->records) {
+            mr = list_entry(el, JSMapRecord, link);
+            if (!s->is_weak)
+                JS_MarkValue(rt, mr->key, mark_func);
+            JS_MarkValue(rt, mr->value, mark_func);
+        }
+    }
+}
+
+/* Map Iterator */
+
+typedef struct JSMapIteratorData {
+    JSValue obj;
+    JSIteratorKindEnum kind;
+    JSMapRecord *cur_record;
+} JSMapIteratorData;
+
+static void js_map_iterator_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSObject *p;
+    JSMapIteratorData *it;
+
+    p = JS_VALUE_GET_OBJ(val);
+    it = p->u.map_iterator_data;
+    if (it) {
+        /* During the GC sweep phase the Map finalizer may be
+           called before the Map iterator finalizer */
+        if (JS_IsLiveObject(rt, it->obj) && it->cur_record) {
+            map_decref_record(rt, it->cur_record);
+        }
+        JS_FreeValueRT(rt, it->obj);
+        js_free_rt(rt, it);
+    }
+}
+
+static void js_map_iterator_mark(JSRuntime *rt, JSValueConst val,
+                                 JS_MarkFunc *mark_func)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    JSMapIteratorData *it;
+    it = p->u.map_iterator_data;
+    if (it) {
+        /* the record is already marked by the object */
+        JS_MarkValue(rt, it->obj, mark_func);
+    }
+}
+
+static JSValue js_create_map_iterator(JSContext *ctx, JSValueConst this_val,
+                                      int argc, JSValueConst *argv, int magic)
+{
+    JSIteratorKindEnum kind;
+    JSMapState *s;
+    JSMapIteratorData *it;
+    JSValue enum_obj;
+
+    kind = magic >> 2;
+    magic &= 3;
+    s = JS_GetOpaque2(ctx, this_val, JS_CLASS_MAP + magic);
+    if (!s)
+        return JS_EXCEPTION;
+    enum_obj = JS_NewObjectClass(ctx, JS_CLASS_MAP_ITERATOR + magic);
+    if (JS_IsException(enum_obj))
+        goto fail;
+    it = js_malloc(ctx, sizeof(*it));
+    if (!it) {
+        JS_FreeValue(ctx, enum_obj);
+        goto fail;
+    }
+    it->obj = JS_DupValue(ctx, this_val);
+    it->kind = kind;
+    it->cur_record = NULL;
+    JS_SetOpaque(enum_obj, it);
+    return enum_obj;
+ fail:
+    return JS_EXCEPTION;
+}
+
+static JSValue js_map_iterator_next(JSContext *ctx, JSValueConst this_val,
+                                    int argc, JSValueConst *argv,
+                                    BOOL *pdone, int magic)
+{
+    JSMapIteratorData *it;
+    JSMapState *s;
+    JSMapRecord *mr;
+    struct list_head *el;
+
+    it = JS_GetOpaque2(ctx, this_val, JS_CLASS_MAP_ITERATOR + magic);
+    if (!it) {
+        *pdone = FALSE;
+        return JS_EXCEPTION;
+    }
+    if (JS_IsUndefined(it->obj))
+        goto done;
+    s = JS_GetOpaque(it->obj, JS_CLASS_MAP + magic);
+    assert(s != NULL);
+    if (!it->cur_record) {
+        el = s->records.next;
+    } else {
+        mr = it->cur_record;
+        el = mr->link.next;
+        map_decref_record(ctx->rt, mr); /* the record can be freed here */
+    }
+    for(;;) {
+        if (el == &s->records) {
+            /* no more record  */
+            it->cur_record = NULL;
+            JS_FreeValue(ctx, it->obj);
+            it->obj = JS_UNDEFINED;
+        done:
+            /* end of enumeration */
+            *pdone = TRUE;
+            return JS_UNDEFINED;
+        }
+        mr = list_entry(el, JSMapRecord, link);
+        if (!mr->empty)
+            break;
+        /* get the next record */
+        el = mr->link.next;
+    }
+
+    /* lock the record so that it won't be freed */
+    mr->ref_count++;
+    it->cur_record = mr;
+    *pdone = FALSE;
+
+    if (it->kind == JS_ITERATOR_KIND_KEY) {
+        return JS_DupValue(ctx, mr->key);
+    } else {
+        JSValueConst args[2];
+        args[0] = mr->key;
+        if (magic)
+            args[1] = mr->key;
+        else
+            args[1] = mr->value;
+        if (it->kind == JS_ITERATOR_KIND_VALUE) {
+            return JS_DupValue(ctx, args[1]);
+        } else {
+            return js_create_array(ctx, 2, args);
+        }
+    }
+}
+
+static const JSCFunctionListEntry js_map_funcs[] = {
+    JS_CGETSET_DEF("[Symbol.species]", js_get_this, NULL ),
+};
+
+static const JSCFunctionListEntry js_map_proto_funcs[] = {
+    JS_CFUNC_MAGIC_DEF("set", 2, js_map_set, 0 ),
+    JS_CFUNC_MAGIC_DEF("get", 1, js_map_get, 0 ),
+    JS_CFUNC_MAGIC_DEF("has", 1, js_map_has, 0 ),
+    JS_CFUNC_MAGIC_DEF("delete", 1, js_map_delete, 0 ),
+    JS_CFUNC_MAGIC_DEF("clear", 0, js_map_clear, 0 ),
+    JS_CGETSET_MAGIC_DEF("size", js_map_get_size, NULL, 0),
+    JS_CFUNC_MAGIC_DEF("forEach", 1, js_map_forEach, 0 ),
+    JS_CFUNC_MAGIC_DEF("values", 0, js_create_map_iterator, (JS_ITERATOR_KIND_VALUE << 2) | 0 ),
+    JS_CFUNC_MAGIC_DEF("keys", 0, js_create_map_iterator, (JS_ITERATOR_KIND_KEY << 2) | 0 ),
+    JS_CFUNC_MAGIC_DEF("entries", 0, js_create_map_iterator, (JS_ITERATOR_KIND_KEY_AND_VALUE << 2) | 0 ),
+    JS_ALIAS_DEF("[Symbol.iterator]", "entries" ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "Map", JS_PROP_CONFIGURABLE ),
+};
+
+static const JSCFunctionListEntry js_map_iterator_proto_funcs[] = {
+    JS_ITERATOR_NEXT_DEF("next", 0, js_map_iterator_next, 0 ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "Map Iterator", JS_PROP_CONFIGURABLE ),
+};
+
+static const JSCFunctionListEntry js_set_proto_funcs[] = {
+    JS_CFUNC_MAGIC_DEF("add", 1, js_map_set, MAGIC_SET ),
+    JS_CFUNC_MAGIC_DEF("has", 1, js_map_has, MAGIC_SET ),
+    JS_CFUNC_MAGIC_DEF("delete", 1, js_map_delete, MAGIC_SET ),
+    JS_CFUNC_MAGIC_DEF("clear", 0, js_map_clear, MAGIC_SET ),
+    JS_CGETSET_MAGIC_DEF("size", js_map_get_size, NULL, MAGIC_SET ),
+    JS_CFUNC_MAGIC_DEF("forEach", 1, js_map_forEach, MAGIC_SET ),
+    JS_CFUNC_MAGIC_DEF("values", 0, js_create_map_iterator, (JS_ITERATOR_KIND_KEY << 2) | MAGIC_SET ),
+    JS_ALIAS_DEF("keys", "values" ),
+    JS_ALIAS_DEF("[Symbol.iterator]", "values" ),
+    JS_CFUNC_MAGIC_DEF("entries", 0, js_create_map_iterator, (JS_ITERATOR_KIND_KEY_AND_VALUE << 2) | MAGIC_SET ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "Set", JS_PROP_CONFIGURABLE ),
+};
+
+static const JSCFunctionListEntry js_set_iterator_proto_funcs[] = {
+    JS_ITERATOR_NEXT_DEF("next", 0, js_map_iterator_next, MAGIC_SET ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "Set Iterator", JS_PROP_CONFIGURABLE ),
+};
+
+static const JSCFunctionListEntry js_weak_map_proto_funcs[] = {
+    JS_CFUNC_MAGIC_DEF("set", 2, js_map_set, MAGIC_WEAK ),
+    JS_CFUNC_MAGIC_DEF("get", 1, js_map_get, MAGIC_WEAK ),
+    JS_CFUNC_MAGIC_DEF("has", 1, js_map_has, MAGIC_WEAK ),
+    JS_CFUNC_MAGIC_DEF("delete", 1, js_map_delete, MAGIC_WEAK ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "WeakMap", JS_PROP_CONFIGURABLE ),
+};
+
+static const JSCFunctionListEntry js_weak_set_proto_funcs[] = {
+    JS_CFUNC_MAGIC_DEF("add", 1, js_map_set, MAGIC_SET | MAGIC_WEAK ),
+    JS_CFUNC_MAGIC_DEF("has", 1, js_map_has, MAGIC_SET | MAGIC_WEAK ),
+    JS_CFUNC_MAGIC_DEF("delete", 1, js_map_delete, MAGIC_SET | MAGIC_WEAK ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "WeakSet", JS_PROP_CONFIGURABLE ),
+};
+
+static const JSCFunctionListEntry * const js_map_proto_funcs_ptr[6] = {
+    js_map_proto_funcs,
+    js_set_proto_funcs,
+    js_weak_map_proto_funcs,
+    js_weak_set_proto_funcs,
+    js_map_iterator_proto_funcs,
+    js_set_iterator_proto_funcs,
+};
+
+static const uint8_t js_map_proto_funcs_count[6] = {
+    countof(js_map_proto_funcs),
+    countof(js_set_proto_funcs),
+    countof(js_weak_map_proto_funcs),
+    countof(js_weak_set_proto_funcs),
+    countof(js_map_iterator_proto_funcs),
+    countof(js_set_iterator_proto_funcs),
+};
+
+void JS_AddIntrinsicMapSet(JSContext *ctx)
+{
+    int i;
+    JSValue obj1;
+    char buf[ATOM_GET_STR_BUF_SIZE];
+
+    for(i = 0; i < 4; i++) {
+        const char *name = JS_AtomGetStr(ctx, buf, sizeof(buf),
+                                         JS_ATOM_Map + i);
+        ctx->class_proto[JS_CLASS_MAP + i] = JS_NewObject(ctx);
+        JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_MAP + i],
+                                   js_map_proto_funcs_ptr[i],
+                                   js_map_proto_funcs_count[i]);
+        obj1 = JS_NewCFunctionMagic(ctx, js_map_constructor, name, 0,
+                                    JS_CFUNC_constructor_magic, i);
+        if (i < 2) {
+            JS_SetPropertyFunctionList(ctx, obj1, js_map_funcs,
+                                       countof(js_map_funcs));
+        }
+        JS_NewGlobalCConstructor2(ctx, obj1, name, ctx->class_proto[JS_CLASS_MAP + i]);
+    }
+
+    for(i = 0; i < 2; i++) {
+        ctx->class_proto[JS_CLASS_MAP_ITERATOR + i] =
+            JS_NewObjectProto(ctx, ctx->iterator_proto);
+        JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_MAP_ITERATOR + i],
+                                   js_map_proto_funcs_ptr[i + 4],
+                                   js_map_proto_funcs_count[i + 4]);
+    }
+}
+
+/* Generator */
+static const JSCFunctionListEntry js_generator_function_proto_funcs[] = {
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "GeneratorFunction", JS_PROP_CONFIGURABLE),
+};
+
+static const JSCFunctionListEntry js_generator_proto_funcs[] = {
+    JS_ITERATOR_NEXT_DEF("next", 1, js_generator_next, GEN_MAGIC_NEXT ),
+    JS_ITERATOR_NEXT_DEF("return", 1, js_generator_next, GEN_MAGIC_RETURN ),
+    JS_ITERATOR_NEXT_DEF("throw", 1, js_generator_next, GEN_MAGIC_THROW ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "Generator", JS_PROP_CONFIGURABLE),
+};
+
+/* Promise */
+
+typedef enum JSPromiseStateEnum {
+    JS_PROMISE_PENDING,
+    JS_PROMISE_FULFILLED,
+    JS_PROMISE_REJECTED,
+} JSPromiseStateEnum;
+
+typedef struct JSPromiseData {
+    JSPromiseStateEnum promise_state;
+    /* 0=fulfill, 1=reject, list of JSPromiseReactionData.link */
+    struct list_head promise_reactions[2];
+    BOOL is_handled; /* Note: only useful to debug */
+    JSValue promise_result;
+} JSPromiseData;
+
+typedef struct JSPromiseFunctionDataResolved {
+    int ref_count;
+    BOOL already_resolved;
+} JSPromiseFunctionDataResolved;
+
+typedef struct JSPromiseFunctionData {
+    JSValue promise;
+    JSPromiseFunctionDataResolved *presolved;
+} JSPromiseFunctionData;
+
+typedef struct JSPromiseReactionData {
+    struct list_head link; /* not used in promise_reaction_job */
+    JSValue resolving_funcs[2];
+    JSValue handler;
+} JSPromiseReactionData;
+
+static int js_create_resolving_functions(JSContext *ctx, JSValue *args,
+                                         JSValueConst promise);
+
+static void promise_reaction_data_free(JSRuntime *rt,
+                                       JSPromiseReactionData *rd)
+{
+    JS_FreeValueRT(rt, rd->resolving_funcs[0]);
+    JS_FreeValueRT(rt, rd->resolving_funcs[1]);
+    JS_FreeValueRT(rt, rd->handler);
+    js_free_rt(rt, rd);
+}
+
+static JSValue promise_reaction_job(JSContext *ctx, int argc,
+                                    JSValueConst *argv)
+{
+    JSValueConst handler, arg, func;
+    JSValue res, res2;
+    BOOL is_reject;
+
+    assert(argc == 5);
+    handler = argv[2];
+    is_reject = JS_ToBool(ctx, argv[3]);
+    arg = argv[4];
+#ifdef DUMP_PROMISE
+    printf("promise_reaction_job: is_reject=%d\n", is_reject);
+#endif
+
+    if (JS_IsUndefined(handler)) {
+        if (is_reject) {
+            res = JS_Throw(ctx, JS_DupValue(ctx, arg));
+        } else {
+            res = JS_DupValue(ctx, arg);
+        }
+    } else {
+        res = JS_Call(ctx, handler, JS_UNDEFINED, 1, &arg);
+    }
+    is_reject = JS_IsException(res);
+    if (is_reject)
+        res = JS_GetException(ctx);
+    func = argv[is_reject];
+    /* as an extension, we support undefined as value to avoid
+       creating a dummy promise in the 'await' implementation of async
+       functions */
+    if (!JS_IsUndefined(func)) {
+        res2 = JS_Call(ctx, func, JS_UNDEFINED,
+                       1, (JSValueConst *)&res);
+    } else {
+        res2 = JS_UNDEFINED;
+    }
+    JS_FreeValue(ctx, res);
+
+    return res2;
+}
+
+static void fulfill_or_reject_promise(JSContext *ctx, JSValueConst promise,
+                                      JSValueConst value, BOOL is_reject)
+{
+    JSPromiseData *s = JS_GetOpaque(promise, JS_CLASS_PROMISE);
+    struct list_head *el, *el1;
+    JSPromiseReactionData *rd;
+    JSValueConst args[5];
+
+    if (!s || s->promise_state != JS_PROMISE_PENDING)
+        return; /* should never happen */
+    set_value(ctx, &s->promise_result, JS_DupValue(ctx, value));
+    s->promise_state = JS_PROMISE_FULFILLED + is_reject;
+#ifdef DUMP_PROMISE
+    printf("fulfill_or_reject_promise: is_reject=%d\n", is_reject);
+#endif
+    /* Note: could call HostPromiseRejectTracker */
+    list_for_each_safe(el, el1, &s->promise_reactions[is_reject]) {
+        rd = list_entry(el, JSPromiseReactionData, link);
+        args[0] = rd->resolving_funcs[0];
+        args[1] = rd->resolving_funcs[1];
+        args[2] = rd->handler;
+        args[3] = JS_NewBool(ctx, is_reject);
+        args[4] = value;
+        JS_EnqueueJob(ctx, promise_reaction_job, 5, args);
+        list_del(&rd->link);
+        promise_reaction_data_free(ctx->rt, rd);
+    }
+
+    list_for_each_safe(el, el1, &s->promise_reactions[1 - is_reject]) {
+        rd = list_entry(el, JSPromiseReactionData, link);
+        list_del(&rd->link);
+        promise_reaction_data_free(ctx->rt, rd);
+    }
+}
+
+static void reject_promise(JSContext *ctx, JSValueConst promise,
+                           JSValueConst value)
+{
+    fulfill_or_reject_promise(ctx, promise, value, TRUE);
+}
+
+static JSValue js_promise_resolve_thenable_job(JSContext *ctx,
+                                               int argc, JSValueConst *argv)
+{
+    JSValueConst promise, thenable, then;
+    JSValue args[2], res;
+
+#ifdef DUMP_PROMISE
+    printf("js_promise_resolve_thenable_job\n");
+#endif
+    assert(argc == 3);
+    promise = argv[0];
+    thenable = argv[1];
+    then = argv[2];
+    if (js_create_resolving_functions(ctx, args, promise) < 0)
+        return JS_EXCEPTION;
+    res = JS_Call(ctx, then, thenable, 2, (JSValueConst *)args);
+    if (JS_IsException(res)) {
+        JSValue error = JS_GetException(ctx);
+        res = JS_Call(ctx, args[1], JS_UNDEFINED, 1, (JSValueConst *)&error);
+        JS_FreeValue(ctx, error);
+    }
+    JS_FreeValue(ctx, args[0]);
+    JS_FreeValue(ctx, args[1]);
+    return res;
+}
+
+static void js_promise_resolve_function_free_resolved(JSRuntime *rt,
+                                                      JSPromiseFunctionDataResolved *sr)
+{
+    if (--sr->ref_count == 0) {
+        js_free_rt(rt, sr);
+    }
+}
+
+static int js_create_resolving_functions(JSContext *ctx,
+                                         JSValue *resolving_funcs,
+                                         JSValueConst promise)
+
+{
+    JSValue obj;
+    JSPromiseFunctionData *s;
+    JSPromiseFunctionDataResolved *sr;
+    int i, ret;
+
+    sr = js_malloc(ctx, sizeof(*sr));
+    if (!sr)
+        return -1;
+    sr->ref_count = 1;
+    sr->already_resolved = FALSE; /* must be shared between the two functions */
+    ret = 0;
+    for(i = 0; i < 2; i++) {
+        obj = JS_NewObjectProtoClass(ctx, ctx->function_proto,
+                                     JS_CLASS_PROMISE_RESOLVE_FUNCTION + i);
+        if (JS_IsException(obj))
+            goto fail;
+        s = js_malloc(ctx, sizeof(*s));
+        if (!s) {
+            JS_FreeValue(ctx, obj);
+        fail:
+
+            if (i != 0)
+                JS_FreeValue(ctx, resolving_funcs[0]);
+            ret = -1;
+            break;
+        }
+        sr->ref_count++;
+        s->presolved = sr;
+        s->promise = JS_DupValue(ctx, promise);
+        JS_SetOpaque(obj, s);
+        JS_DefinePropertyValue(ctx, obj, JS_ATOM_length, JS_NewInt32(ctx, 1),
+                               JS_PROP_CONFIGURABLE);
+        resolving_funcs[i] = obj;
+    }
+    js_promise_resolve_function_free_resolved(ctx->rt, sr);
+    return ret;
+}
+
+static void js_promise_resolve_function_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSPromiseFunctionData *s = JS_VALUE_GET_OBJ(val)->u.promise_function_data;
+    if (s) {
+        js_promise_resolve_function_free_resolved(rt, s->presolved);
+        JS_FreeValueRT(rt, s->promise);
+        js_free_rt(rt, s);
+    }
+}
+
+static void js_promise_resolve_function_mark(JSRuntime *rt, JSValueConst val,
+                                             JS_MarkFunc *mark_func)
+{
+    JSPromiseFunctionData *s = JS_VALUE_GET_OBJ(val)->u.promise_function_data;
+    if (s) {
+        JS_MarkValue(rt, s->promise, mark_func);
+    }
+}
+
+static JSValue js_promise_resolve_function_call(JSContext *ctx,
+                                                JSValueConst func_obj,
+                                                JSValueConst this_val,
+                                                int argc, JSValueConst *argv)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(func_obj);
+    JSPromiseFunctionData *s;
+    JSValueConst resolution, args[3];
+    JSValue then;
+    BOOL is_reject;
+
+    s = p->u.promise_function_data;
+    if (!s || s->presolved->already_resolved)
+        return JS_UNDEFINED;
+    s->presolved->already_resolved = TRUE;
+    is_reject = p->class_id - JS_CLASS_PROMISE_RESOLVE_FUNCTION;
+    if (argc > 0)
+        resolution = argv[0];
+    else
+        resolution = JS_UNDEFINED;
+#ifdef DUMP_PROMISE
+    printf("js_promise_resolving_function_call: is_reject=%d resolution=", is_reject);
+    JS_DumpValue(ctx, resolution);
+    printf("\n");
+#endif
+    if (is_reject || !JS_IsObject(resolution)) {
+        goto done;
+    } else if (js_same_value(ctx, resolution, s->promise)) {
+        JS_ThrowTypeError(ctx, "promise self resolution");
+        goto fail_reject;
+    }
+    then = JS_GetProperty(ctx, resolution, JS_ATOM_then);
+    if (JS_IsException(then)) {
+        JSValue error;
+    fail_reject:
+        error = JS_GetException(ctx);
+        reject_promise(ctx, s->promise, error);
+        JS_FreeValue(ctx, error);
+    } else if (!JS_IsFunction(ctx, then)) {
+        JS_FreeValue(ctx, then);
+    done:
+        fulfill_or_reject_promise(ctx, s->promise, resolution, is_reject);
+    } else {
+        args[0] = s->promise;
+        args[1] = resolution;
+        args[2] = then;
+        JS_EnqueueJob(ctx, js_promise_resolve_thenable_job, 3, args);
+        JS_FreeValue(ctx, then);
+    }
+    return JS_UNDEFINED;
+}
+
+static void js_promise_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSPromiseData *s = JS_GetOpaque(val, JS_CLASS_PROMISE);
+    struct list_head *el, *el1;
+    int i;
+
+    if (!s)
+        return;
+    for(i = 0; i < 2; i++) {
+        list_for_each_safe(el, el1, &s->promise_reactions[i]) {
+            JSPromiseReactionData *rd =
+                list_entry(el, JSPromiseReactionData, link);
+            promise_reaction_data_free(rt, rd);
+        }
+    }
+    JS_FreeValueRT(rt, s->promise_result);
+    js_free_rt(rt, s);
+}
+
+static void js_promise_mark(JSRuntime *rt, JSValueConst val,
+                            JS_MarkFunc *mark_func)
+{
+    JSPromiseData *s = JS_GetOpaque(val, JS_CLASS_PROMISE);
+    struct list_head *el;
+    int i;
+
+    if (!s)
+        return;
+    for(i = 0; i < 2; i++) {
+        list_for_each(el, &s->promise_reactions[i]) {
+            JSPromiseReactionData *rd =
+                list_entry(el, JSPromiseReactionData, link);
+            JS_MarkValue(rt, rd->resolving_funcs[0], mark_func);
+            JS_MarkValue(rt, rd->resolving_funcs[1], mark_func);
+            JS_MarkValue(rt, rd->handler, mark_func);
+        }
+    }
+    JS_MarkValue(rt, s->promise_result, mark_func);
+}
+
+static JSValue js_promise_constructor(JSContext *ctx, JSValueConst new_target,
+                                      int argc, JSValueConst *argv)
+{
+    JSValueConst executor;
+    JSValue obj;
+    JSPromiseData *s;
+    JSValue args[2], ret;
+    int i;
+
+    executor = argv[0];
+    if (check_function(ctx, executor))
+        return JS_EXCEPTION;
+    obj = js_create_from_ctor(ctx, new_target, JS_CLASS_PROMISE);
+    if (JS_IsException(obj))
+        return JS_EXCEPTION;
+    s = js_mallocz(ctx, sizeof(*s));
+    if (!s)
+        goto fail;
+    s->promise_state = JS_PROMISE_PENDING;
+    s->is_handled = FALSE;
+    for(i = 0; i < 2; i++)
+        init_list_head(&s->promise_reactions[i]);
+    s->promise_result = JS_UNDEFINED;
+    JS_SetOpaque(obj, s);
+    if (js_create_resolving_functions(ctx, args, obj))
+        goto fail;
+    ret = JS_Call(ctx, executor, JS_UNDEFINED, 2, (JSValueConst *)args);
+    if (JS_IsException(ret)) {
+        JSValue ret2, error;
+        error = JS_GetException(ctx);
+        ret2 = JS_Call(ctx, args[1], JS_UNDEFINED, 1, (JSValueConst *)&error);
+        JS_FreeValue(ctx, error);
+        if (JS_IsException(ret2))
+            goto fail1;
+        JS_FreeValue(ctx, ret2);
+    }
+    JS_FreeValue(ctx, ret);
+    JS_FreeValue(ctx, args[0]);
+    JS_FreeValue(ctx, args[1]);
+    return obj;
+ fail1:
+    JS_FreeValue(ctx, args[0]);
+    JS_FreeValue(ctx, args[1]);
+ fail:
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_promise_executor(JSContext *ctx,
+                                   JSValueConst this_val,
+                                   int argc, JSValueConst *argv,
+                                   int magic, JSValue *func_data)
+{
+    int i;
+
+    for(i = 0; i < 2; i++) {
+        if (!JS_IsUndefined(func_data[i]))
+            return JS_ThrowTypeError(ctx, "resolving function already set");
+        func_data[i] = JS_DupValue(ctx, argv[i]);
+    }
+    return JS_UNDEFINED;
+}
+
+static JSValue js_promise_executor_new(JSContext *ctx)
+{
+    JSValueConst func_data[2];
+
+    func_data[0] = JS_UNDEFINED;
+    func_data[1] = JS_UNDEFINED;
+    return JS_NewCFunctionData(ctx, js_promise_executor, 2,
+                               0, 2, func_data);
+}
+
+static JSValue js_new_promise_capability(JSContext *ctx,
+                                         JSValue *resolving_funcs,
+                                         JSValueConst ctor)
+{
+    JSValue executor, result_promise;
+    JSCFunctionDataRecord *s;
+    int i;
+
+    executor = js_promise_executor_new(ctx);
+    if (JS_IsException(executor))
+        return executor;
+
+    if (JS_IsUndefined(ctor)) {
+        result_promise = js_promise_constructor(ctx, ctor, 1,
+                                                (JSValueConst *)&executor);
+    } else {
+        result_promise = JS_CallConstructor(ctx, ctor, 1,
+                                            (JSValueConst *)&executor);
+    }
+    if (JS_IsException(result_promise))
+        goto fail;
+    s = JS_GetOpaque(executor, JS_CLASS_C_FUNCTION_DATA);
+    for(i = 0; i < 2; i++) {
+        if (check_function(ctx, s->data[i]))
+            goto fail;
+    }
+    for(i = 0; i < 2; i++)
+        resolving_funcs[i] = JS_DupValue(ctx, s->data[i]);
+    JS_FreeValue(ctx, executor);
+    return result_promise;
+ fail:
+    JS_FreeValue(ctx, executor);
+    JS_FreeValue(ctx, result_promise);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_promise_resolve(JSContext *ctx, JSValueConst this_val,
+                                  int argc, JSValueConst *argv, int magic)
+{
+    JSValue result_promise, resolving_funcs[2], ret;
+    BOOL is_reject = magic;
+
+    if (!JS_IsObject(this_val))
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+    if (!is_reject && JS_GetOpaque(argv[0], JS_CLASS_PROMISE)) {
+        JSValue ctor;
+        BOOL is_same;
+        ctor = JS_GetProperty(ctx, argv[0], JS_ATOM_constructor);
+        if (JS_IsException(ctor))
+            return ctor;
+        is_same = js_same_value(ctx, ctor, this_val);
+        JS_FreeValue(ctx, ctor);
+        if (is_same)
+            return JS_DupValue(ctx, argv[0]);
+    }
+    result_promise = js_new_promise_capability(ctx, resolving_funcs, this_val);
+    if (JS_IsException(result_promise))
+        return result_promise;
+    ret = JS_Call(ctx, resolving_funcs[is_reject], JS_UNDEFINED, 1, argv);
+    JS_FreeValue(ctx, resolving_funcs[0]);
+    JS_FreeValue(ctx, resolving_funcs[1]);
+    if (JS_IsException(ret)) {
+        JS_FreeValue(ctx, result_promise);
+        return ret;
+    }
+    JS_FreeValue(ctx, ret);
+    return result_promise;
+}
+
+static JSValue js_promise___newPromiseCapability(JSContext *ctx,
+                                                 JSValueConst this_val,
+                                                 int argc, JSValueConst *argv)
+{
+    JSValue result_promise, resolving_funcs[2], obj;
+    JSValueConst ctor;
+    ctor = argv[0];
+    if (!JS_IsObject(ctor))
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+    result_promise = js_new_promise_capability(ctx, resolving_funcs, ctor);
+    if (JS_IsException(result_promise))
+        return result_promise;
+    obj = JS_NewObject(ctx);
+    if (JS_IsException(obj)) {
+        JS_FreeValue(ctx, resolving_funcs[0]);
+        JS_FreeValue(ctx, resolving_funcs[1]);
+        JS_FreeValue(ctx, result_promise);
+        return JS_EXCEPTION;
+    }
+    JS_DefinePropertyValue(ctx, obj, JS_ATOM_promise, result_promise, JS_PROP_C_W_E);
+    JS_DefinePropertyValue(ctx, obj, JS_ATOM_resolve, resolving_funcs[0], JS_PROP_C_W_E);
+    JS_DefinePropertyValue(ctx, obj, JS_ATOM_reject, resolving_funcs[1], JS_PROP_C_W_E);
+    return obj;
+}
+
+static __exception int remainingElementsCount_add(JSContext *ctx,
+                                                  JSValueConst resolve_element_env,
+                                                  int addend)
+{
+    JSValue val;
+    int remainingElementsCount;
+
+    val = JS_GetPropertyUint32(ctx, resolve_element_env, 0);
+    if (JS_IsException(val))
+        return -1;
+    if (JS_ToInt32Free(ctx, &remainingElementsCount, val))
+        return -1;
+    remainingElementsCount += addend;
+    if (JS_SetPropertyUint32(ctx, resolve_element_env, 0,
+                             JS_NewInt32(ctx, remainingElementsCount)) < 0)
+        return -1;
+    return (remainingElementsCount == 0);
+}
+
+static JSValue js_promise_all_resolve_element(JSContext *ctx,
+                                              JSValueConst this_val,
+                                              int argc, JSValueConst *argv,
+                                              int magic,
+                                              JSValue *func_data)
+{
+    BOOL alreadyCalled = JS_ToBool(ctx, func_data[0]);
+    JSValueConst values = func_data[2];
+    JSValueConst resolve = func_data[3];
+    JSValueConst resolve_element_env = func_data[4];
+    JSValue ret;
+    int is_zero, index;
+
+    if (JS_ToInt32(ctx, &index, func_data[1]))
+        return JS_EXCEPTION;
+    if (alreadyCalled)
+        return JS_UNDEFINED;
+    func_data[0] = JS_NewBool(ctx, TRUE);
+
+    if (JS_DefinePropertyValueUint32(ctx, values, index,
+                                     JS_DupValue(ctx, argv[0]),
+                                     JS_PROP_CONFIGURABLE | JS_PROP_ENUMERABLE | JS_PROP_WRITABLE) < 0)
+        return JS_EXCEPTION;
+    
+    is_zero = remainingElementsCount_add(ctx, resolve_element_env, -1);
+    if (is_zero < 0)
+        return JS_EXCEPTION;
+    if (is_zero) {
+        ret = JS_Call(ctx, resolve, JS_UNDEFINED, 1, (JSValueConst *)&values);
+        if (JS_IsException(ret))
+            return ret;
+        JS_FreeValue(ctx, ret);
+    }
+    return JS_UNDEFINED;
+}
+
+static JSValue js_promise_all(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv)
+{
+    JSValue result_promise, resolving_funcs[2], iter, item, next_promise, ret;
+    JSValue next_method = JS_UNDEFINED, values = JS_UNDEFINED;
+    JSValue resolve_element_env = JS_UNDEFINED, resolve_element;
+    JSValueConst then_args[2], resolve_element_data[5];
+    BOOL done;
+    int index, is_zero;
+    
+    if (!JS_IsObject(this_val))
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+    result_promise = js_new_promise_capability(ctx, resolving_funcs, this_val);
+    if (JS_IsException(result_promise))
+        return result_promise;
+    iter = JS_GetIterator(ctx, argv[0], FALSE);
+    if (JS_IsException(iter)) {
+        JSValue error;
+    fail_reject:
+        error = JS_GetException(ctx);
+        ret = JS_Call(ctx, resolving_funcs[1], JS_UNDEFINED, 1,
+                       (JSValueConst *)&error);
+        JS_FreeValue(ctx, error);
+        if (JS_IsException(ret))
+            goto fail;
+        JS_FreeValue(ctx, ret);
+    } else {
+        next_method = JS_GetProperty(ctx, iter, JS_ATOM_next);
+        if (JS_IsException(next_method))
+            goto fail_reject;
+        values = JS_NewArray(ctx);
+        if (JS_IsException(values))
+            goto fail_reject;
+        resolve_element_env = JS_NewArray(ctx);
+        if (JS_IsException(resolve_element_env))
+            goto fail_reject;
+        /* remainingElementsCount field */
+        if (JS_DefinePropertyValueUint32(ctx, resolve_element_env, 0,
+                                         JS_NewInt32(ctx, 1),
+                                         JS_PROP_CONFIGURABLE | JS_PROP_ENUMERABLE | JS_PROP_WRITABLE) < 0)
+            goto fail_reject;
+        
+        index = 0;
+        for(;;) {
+            /* XXX: conformance: should close the iterator if error on 'done'
+               access, but not on 'value' access */
+            item = JS_IteratorNext(ctx, iter, next_method, 0, NULL, &done);
+            if (JS_IsException(item))
+                goto fail_reject;
+            if (done)
+                break;
+            next_promise = JS_Invoke(ctx, this_val, JS_ATOM_resolve, 1,
+                                     (JSValueConst *)&item);
+            JS_FreeValue(ctx, item);
+            if (JS_IsException(next_promise)) {
+            fail_reject1:
+                JS_IteratorClose(ctx, iter, TRUE);
+                goto fail_reject;
+            }
+            resolve_element_data[0] = JS_NewBool(ctx, FALSE);
+            resolve_element_data[1] = CastToJSValueConst(JS_NewInt32(ctx, index));
+            resolve_element_data[2] = values;
+            resolve_element_data[3] = resolving_funcs[0];
+            resolve_element_data[4] = resolve_element_env;
+            resolve_element =
+                JS_NewCFunctionData(ctx, js_promise_all_resolve_element, 1,
+                                    0, 5, resolve_element_data);
+            if (JS_IsException(resolve_element)) {
+                JS_FreeValue(ctx, next_promise);
+                goto fail_reject1;
+            }
+            
+            if (remainingElementsCount_add(ctx, resolve_element_env, 1) < 0) {
+                JS_FreeValue(ctx, next_promise);
+                JS_FreeValue(ctx, resolve_element);
+                goto fail_reject1;
+            }
+
+            then_args[0] = resolve_element;
+            then_args[1] = resolving_funcs[1];
+            ret = JS_InvokeFree(ctx, next_promise, JS_ATOM_then, 2, then_args);
+            JS_FreeValue(ctx, resolve_element);
+            if (check_exception_free(ctx, ret))
+                goto fail_reject1;
+            index++;
+        }
+
+        is_zero = remainingElementsCount_add(ctx, resolve_element_env, -1);
+        if (is_zero < 0)
+            goto fail_reject;
+        if (is_zero) {
+            ret = JS_Call(ctx, resolving_funcs[0], JS_UNDEFINED,
+                          1, (JSValueConst *)&values);
+            if (check_exception_free(ctx, ret))
+                goto fail_reject;
+        }
+    }
+ done:
+    JS_FreeValue(ctx, resolve_element_env);
+    JS_FreeValue(ctx, values);
+    JS_FreeValue(ctx, next_method);
+    JS_FreeValue(ctx, iter);
+    JS_FreeValue(ctx, resolving_funcs[0]);
+    JS_FreeValue(ctx, resolving_funcs[1]);
+    return result_promise;
+ fail:
+    JS_FreeValue(ctx, result_promise);
+    result_promise = JS_EXCEPTION;
+    goto done;
+}
+
+static JSValue js_promise_race(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv)
+{
+    JSValue result_promise, resolving_funcs[2], iter, item, next_promise, ret;
+    JSValue next_method = JS_UNDEFINED;
+    BOOL done;
+
+    if (!JS_IsObject(this_val))
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+    result_promise = js_new_promise_capability(ctx, resolving_funcs, this_val);
+    if (JS_IsException(result_promise))
+        return result_promise;
+    iter = JS_GetIterator(ctx, argv[0], FALSE);
+    if (JS_IsException(iter)) {
+        JSValue error;
+    fail_reject:
+        error = JS_GetException(ctx);
+        ret = JS_Call(ctx, resolving_funcs[1], JS_UNDEFINED, 1,
+                       (JSValueConst *)&error);
+        JS_FreeValue(ctx, error);
+        if (JS_IsException(ret))
+            goto fail;
+        JS_FreeValue(ctx, ret);
+    } else {
+        next_method = JS_GetProperty(ctx, iter, JS_ATOM_next);
+        if (JS_IsException(next_method))
+            goto fail_reject;
+
+        for(;;) {
+            /* XXX: conformance: should close the iterator if error on 'done'
+               access, but not on 'value' access */
+            item = JS_IteratorNext(ctx, iter, next_method, 0, NULL, &done);
+            if (JS_IsException(item))
+                goto fail_reject;
+            if (done)
+                break;
+            next_promise = JS_Invoke(ctx, this_val, JS_ATOM_resolve, 1,
+                                     (JSValueConst *)&item);
+            JS_FreeValue(ctx, item);
+            if (JS_IsException(next_promise)) {
+            fail_reject1:
+                JS_IteratorClose(ctx, iter, TRUE);
+                goto fail_reject;
+            }
+            ret = JS_InvokeFree(ctx, next_promise, JS_ATOM_then, 2,
+                                (JSValueConst *)resolving_funcs);
+            if (check_exception_free(ctx, ret))
+                goto fail_reject1;
+        }
+    }
+ done:
+    JS_FreeValue(ctx, next_method);
+    JS_FreeValue(ctx, iter);
+    JS_FreeValue(ctx, resolving_funcs[0]);
+    JS_FreeValue(ctx, resolving_funcs[1]);
+    return result_promise;
+ fail:
+    //JS_FreeValue(ctx, next_method); // why not???
+    JS_FreeValue(ctx, result_promise);
+    result_promise = JS_EXCEPTION;
+    goto done;
+}
+
+static __exception int perform_promise_then(JSContext *ctx,
+                                            JSValueConst promise,
+                                            JSValueConst *resolve_reject,
+                                            JSValueConst *cap_resolving_funcs)
+{
+    JSPromiseData *s = JS_GetOpaque(promise, JS_CLASS_PROMISE);
+    JSPromiseReactionData *rd_array[2], *rd;
+    int i, j;
+
+    rd_array[0] = NULL;
+    rd_array[1] = NULL;
+    for(i = 0; i < 2; i++) {
+        JSValueConst handler;
+        rd = js_mallocz(ctx, sizeof(*rd));
+        if (!rd) {
+            if (i == 1)
+                promise_reaction_data_free(ctx->rt, rd_array[0]);
+            return -1;
+        }
+        for(j = 0; j < 2; j++)
+            rd->resolving_funcs[j] = JS_DupValue(ctx, cap_resolving_funcs[j]);
+        handler = resolve_reject[i];
+        if (!JS_IsFunction(ctx, handler))
+            handler = JS_UNDEFINED;
+        rd->handler = JS_DupValue(ctx, handler);
+        rd_array[i] = rd;
+    }
+
+    if (s->promise_state == JS_PROMISE_PENDING) {
+        for(i = 0; i < 2; i++)
+            list_add_tail(&rd_array[i]->link, &s->promise_reactions[i]);
+    } else {
+        JSValueConst args[5];
+        i = s->promise_state - JS_PROMISE_FULFILLED;
+        rd = rd_array[i];
+        args[0] = rd->resolving_funcs[0];
+        args[1] = rd->resolving_funcs[1];
+        args[2] = rd->handler;
+        args[3] = JS_NewBool(ctx, i);
+        args[4] = s->promise_result;
+        JS_EnqueueJob(ctx, promise_reaction_job, 5, args);
+        for(i = 0; i < 2; i++)
+            promise_reaction_data_free(ctx->rt, rd_array[i]);
+    }
+    s->is_handled = TRUE;
+    return 0;
+}
+
+static JSValue js_promise_then(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv)
+{
+    JSValue ctor, result_promise, resolving_funcs[2];
+    JSPromiseData *s;
+    int i, ret;
+
+    s = JS_GetOpaque2(ctx, this_val, JS_CLASS_PROMISE);
+    if (!s)
+        return JS_EXCEPTION;
+
+    ctor = JS_SpeciesConstructor(ctx, this_val, JS_UNDEFINED);
+    if (JS_IsException(ctor))
+        return ctor;
+    result_promise = js_new_promise_capability(ctx, resolving_funcs, ctor);
+    JS_FreeValue(ctx, ctor);
+    if (JS_IsException(result_promise))
+        return result_promise;
+    ret = perform_promise_then(ctx, this_val, argv,
+                               (JSValueConst *)resolving_funcs);
+    for(i = 0; i < 2; i++)
+        JS_FreeValue(ctx, resolving_funcs[i]);
+    if (ret) {
+        JS_FreeValue(ctx, result_promise);
+        return JS_EXCEPTION;
+    }
+    return result_promise;
+}
+
+static JSValue js_promise_catch(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    JSValueConst args[2];
+    args[0] = JS_UNDEFINED;
+    args[1] = argv[0];
+    return JS_Invoke(ctx, this_val, JS_ATOM_then, 2, args);
+}
+
+static JSValue js_promise_finally_value_thunk(JSContext *ctx, JSValueConst this_val,
+                                              int argc, JSValueConst *argv,
+                                              int magic, JSValue *func_data)
+{
+    return JS_DupValue(ctx, func_data[0]);
+}
+
+static JSValue js_promise_finally_thrower(JSContext *ctx, JSValueConst this_val,
+                                          int argc, JSValueConst *argv,
+                                          int magic, JSValue *func_data)
+{
+    return JS_Throw(ctx, JS_DupValue(ctx, func_data[0]));
+}
+
+static JSValue js_promise_then_finally_func(JSContext *ctx, JSValueConst this_val,
+                                            int argc, JSValueConst *argv,
+                                            int magic, JSValue *func_data)
+{
+    JSValueConst ctor = func_data[0];
+    JSValueConst onFinally = func_data[1];
+    JSValue res, promise, resolving_funcs[2], ret, then_func;
+
+    res = JS_Call(ctx, onFinally, JS_UNDEFINED, 0, NULL);
+    if (JS_IsException(res))
+        return res;
+    promise = js_new_promise_capability(ctx, resolving_funcs, ctor);
+    if (JS_IsException(promise)) {
+        JS_FreeValue(ctx, res);
+        return JS_EXCEPTION;
+    }
+    ret = JS_Call(ctx, resolving_funcs[0], JS_UNDEFINED,
+                  1, (JSValueConst*)&res);
+    JS_FreeValue(ctx, res);
+    JS_FreeValue(ctx, resolving_funcs[0]);
+    JS_FreeValue(ctx, resolving_funcs[1]);
+    if (JS_IsException(ret)) {
+        JS_FreeValue(ctx, promise);
+        return ret;
+    }
+    JS_FreeValue(ctx, ret);
+    if (magic == 0) {
+        then_func = JS_NewCFunctionData(ctx, js_promise_finally_value_thunk, 1,
+                                        0, 1, argv);
+    } else {
+        then_func = JS_NewCFunctionData(ctx, js_promise_finally_thrower, 1,
+                                        0, 1, argv);
+    }
+    if (JS_IsException(then_func)) {
+        JS_FreeValue(ctx, promise);
+        return then_func;
+    }
+    ret = JS_InvokeFree(ctx, promise, JS_ATOM_then, 1, (JSValueConst *)&then_func);
+    JS_FreeValue(ctx, then_func);
+    return ret;
+}
+
+static JSValue js_promise_finally(JSContext *ctx, JSValueConst this_val,
+                                  int argc, JSValueConst *argv)
+{
+    JSValueConst onFinally = argv[0];
+    JSValue ctor, ret;
+    JSValue then_funcs[2];
+    JSValueConst func_data[2];
+    int i;
+
+    ctor = JS_SpeciesConstructor(ctx, this_val, JS_UNDEFINED);
+    if (JS_IsException(ctor))
+        return ctor;
+    if (!JS_IsFunction(ctx, onFinally)) {
+        then_funcs[0] = JS_DupValue(ctx, onFinally);
+        then_funcs[1] = JS_DupValue(ctx, onFinally);
+    } else {
+        func_data[0] = ctor;
+        func_data[1] = onFinally;
+        for(i = 0; i < 2; i++) {
+            then_funcs[i] = JS_NewCFunctionData(ctx, js_promise_then_finally_func, 1, i, 2, func_data);
+            if (JS_IsException(then_funcs[i])) {
+                if (i == 1)
+                    JS_FreeValue(ctx, then_funcs[0]);
+                JS_FreeValue(ctx, ctor);
+                return JS_EXCEPTION;
+            }
+        }
+    }
+    JS_FreeValue(ctx, ctor);
+    ret = JS_Invoke(ctx, this_val, JS_ATOM_then, 2, (JSValueConst *)then_funcs);
+    JS_FreeValue(ctx, then_funcs[0]);
+    JS_FreeValue(ctx, then_funcs[1]);
+    return ret;
+}
+
+static const JSCFunctionListEntry js_promise_funcs[] = {
+    JS_CFUNC_MAGIC_DEF("resolve", 1, js_promise_resolve, 0 ),
+    JS_CFUNC_MAGIC_DEF("reject", 1, js_promise_resolve, 1 ),
+    JS_CFUNC_DEF("all", 1, js_promise_all ),
+    JS_CFUNC_DEF("race", 1, js_promise_race ),
+    JS_CFUNC_DEF("__newPromiseCapability", 1, js_promise___newPromiseCapability ),
+    JS_CGETSET_DEF("[Symbol.species]", js_get_this, NULL),
+};
+
+static const JSCFunctionListEntry js_promise_proto_funcs[] = {
+    JS_CFUNC_DEF("then", 2, js_promise_then ),
+    JS_CFUNC_DEF("catch", 1, js_promise_catch ),
+    JS_CFUNC_DEF("finally", 1, js_promise_finally ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "Promise", JS_PROP_CONFIGURABLE ),
+};
+
+/* AsyncFunction */
+static const JSCFunctionListEntry js_async_function_proto_funcs[] = {
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "AsyncFunction", JS_PROP_CONFIGURABLE ),
+};
+
+static JSValue js_async_from_async_iterator_unwrap(JSContext *ctx,
+                                                   JSValueConst this_val,
+                                                   int argc, JSValueConst *argv,
+                                                   int magic, JSValue *func_data)
+{
+    return js_create_iterator_result(ctx, JS_DupValue(ctx, func_data[0]),
+                                     JS_ToBool(ctx, func_data[1]));
+}
+
+static JSValue js_async_from_async_iterator_unwrap_func_create(JSContext *ctx,
+                                                JSValueConst value,
+                                                BOOL done)
+{
+    JSValueConst func_data[2];
+
+    func_data[0] = value;
+    func_data[1] = CastToJSValueConst(JS_NewBool(ctx, done));
+    return JS_NewCFunctionData(ctx, js_async_from_async_iterator_unwrap,
+                               0, 0, 2, func_data);
+}
+
+/* AsyncIteratorPrototype */
+
+static const JSCFunctionListEntry js_async_iterator_proto_funcs[] = {
+    JS_CFUNC_DEF("[Symbol.asyncIterator]", 0, js_iterator_proto_iterator ),
+};
+
+/* AsyncFromSyncIteratorPrototype */
+
+typedef struct JSAsyncFromSyncIteratorData {
+    JSValue sync_iter;
+    JSValue next_method;
+} JSAsyncFromSyncIteratorData;
+
+static void js_async_from_sync_iterator_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSAsyncFromSyncIteratorData *s =
+        JS_GetOpaque(val, JS_CLASS_ASYNC_FROM_SYNC_ITERATOR);
+    if (s) {
+        JS_FreeValueRT(rt, s->sync_iter);
+        JS_FreeValueRT(rt, s->next_method);
+        js_free_rt(rt, s);
+    }
+}
+
+static void js_async_from_sync_iterator_mark(JSRuntime *rt, JSValueConst val,
+                                             JS_MarkFunc *mark_func)
+{
+    JSAsyncFromSyncIteratorData *s =
+        JS_GetOpaque(val, JS_CLASS_ASYNC_FROM_SYNC_ITERATOR);
+    if (s) {
+        JS_MarkValue(rt, s->sync_iter, mark_func);
+        JS_MarkValue(rt, s->next_method, mark_func);
+    }
+}
+
+static JSValue JS_CreateAsyncFromSyncIterator(JSContext *ctx,
+                                              JSValueConst sync_iter)
+{
+    JSValue async_iter, ret, next_method;
+    JSAsyncFromSyncIteratorData *s;
+
+    next_method = JS_GetProperty(ctx, sync_iter, JS_ATOM_next);
+    if (JS_IsException(next_method))
+        return JS_EXCEPTION;
+    async_iter = JS_NewObjectClass(ctx, JS_CLASS_ASYNC_FROM_SYNC_ITERATOR);
+    if (JS_IsException(async_iter)) {
+        JS_FreeValue(ctx, next_method);
+        return async_iter;
+    }
+    s = js_mallocz(ctx, sizeof(*s));
+    if (!s) {
+        JS_FreeValue(ctx, async_iter);
+        JS_FreeValue(ctx, next_method);
+        return JS_EXCEPTION;
+    }
+    s->sync_iter = JS_DupValue(ctx, sync_iter);
+    s->next_method = next_method;
+    JS_SetOpaque(async_iter, s);
+
+    ret = JS_GetIterator(ctx, async_iter, TRUE);
+    JS_FreeValue(ctx, async_iter);
+    return ret;
+}
+
+static JSValue js_async_from_sync_iterator_next(JSContext *ctx, JSValueConst this_val,
+                                                int argc, JSValueConst *argv,
+                                                int magic)
+{
+    JSValue promise, resolving_funcs[2], value, err, method;
+    JSAsyncFromSyncIteratorData *s;
+    int done;
+    int is_reject;
+
+    promise = js_new_promise_capability(ctx, resolving_funcs, JS_UNDEFINED);
+    if (JS_IsException(promise))
+        return JS_EXCEPTION;
+    s = JS_GetOpaque(this_val, JS_CLASS_ASYNC_FROM_SYNC_ITERATOR);
+    if (!s) {
+        JS_ThrowTypeError(ctx, "not an Async-from-Sync Iterator");
+        goto reject;
+    }
+
+    if (magic == GEN_MAGIC_NEXT) {
+        method = JS_DupValue(ctx, s->next_method);
+    } else {
+        method = JS_GetProperty(ctx, s->sync_iter,
+                                magic == GEN_MAGIC_RETURN ? JS_ATOM_return :
+                                JS_ATOM_throw);
+        if (JS_IsException(method))
+            goto reject;
+        if (JS_IsUndefined(method) || JS_IsNull(method)) {
+            if (magic == GEN_MAGIC_RETURN) {
+                err = js_create_iterator_result(ctx, JS_DupValue(ctx, argv[0]), TRUE);
+                is_reject = 0;
+            } else {
+                err = JS_DupValue(ctx, argv[0]);
+                is_reject = 1;
+            }
+            goto done_resolve;
+        }
+    }
+    value = JS_IteratorNext2(ctx, s->sync_iter, method, 1, argv, &done);
+    JS_FreeValue(ctx, method);
+    if (JS_IsException(value))
+        goto reject;
+    if (done == 2) {
+        JSValue obj = value;
+        value = JS_IteratorGetCompleteValue(ctx, obj, &done);
+        JS_FreeValue(ctx, obj);
+        if (JS_IsException(value))
+            goto reject;
+    }
+
+    if (JS_IsException(value)) {
+        JSValue res2;
+    reject:
+        err = JS_GetException(ctx);
+        is_reject = 1;
+    done_resolve:
+        res2 = JS_Call(ctx, resolving_funcs[is_reject], JS_UNDEFINED,
+                       1, (JSValueConst *)&err);
+        JS_FreeValue(ctx, err);
+        JS_FreeValue(ctx, res2);
+        JS_FreeValue(ctx, resolving_funcs[0]);
+        JS_FreeValue(ctx, resolving_funcs[1]);
+        return promise;
+    }
+    {
+        JSValue value_wrapper_resolving_funcs[2], value_wrapper_promise;
+        JSValue resolve_reject[2], ret;
+        int res;
+
+        value_wrapper_promise =
+            js_new_promise_capability(ctx, value_wrapper_resolving_funcs, JS_UNDEFINED);
+        if (JS_IsException(value_wrapper_promise))
+            goto fail;
+
+        ret = JS_Call(ctx, value_wrapper_resolving_funcs[0], JS_UNDEFINED, 1,
+                      (JSValueConst *)&value);
+        JS_FreeValue(ctx, value_wrapper_resolving_funcs[0]);
+        JS_FreeValue(ctx, value_wrapper_resolving_funcs[1]);
+        if (JS_IsException(ret)) {
+            JS_FreeValue(ctx, value_wrapper_promise);
+            goto fail;
+        }
+        JS_FreeValue(ctx, ret);
+
+        resolve_reject[0] = js_async_from_async_iterator_unwrap_func_create(ctx, value, done);
+        if (JS_IsException(resolve_reject[0])) {
+            JS_FreeValue(ctx, value_wrapper_promise);
+            goto fail;
+        }
+        JS_FreeValue(ctx, value);
+        resolve_reject[1] = JS_UNDEFINED;
+
+        res = perform_promise_then(ctx, value_wrapper_promise,
+                                   (JSValueConst *)resolve_reject,
+                                   (JSValueConst *)resolving_funcs);
+        JS_FreeValue(ctx, resolve_reject[0]);
+        JS_FreeValue(ctx, value_wrapper_promise);
+        JS_FreeValue(ctx, resolving_funcs[0]);
+        JS_FreeValue(ctx, resolving_funcs[1]);
+        if (res) {
+            JS_FreeValue(ctx, promise);
+            return JS_EXCEPTION;
+        }
+    }
+    return promise;
+ fail:
+    JS_FreeValue(ctx, value);
+    JS_FreeValue(ctx, resolving_funcs[0]);
+    JS_FreeValue(ctx, resolving_funcs[1]);
+    JS_FreeValue(ctx, promise);
+    return JS_EXCEPTION;
+}
+
+static const JSCFunctionListEntry js_async_from_sync_iterator_proto_funcs[] = {
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "Async-from-Sync Iterator", JS_PROP_CONFIGURABLE ),
+    JS_CFUNC_MAGIC_DEF("next", 1, js_async_from_sync_iterator_next, GEN_MAGIC_NEXT ),
+    JS_CFUNC_MAGIC_DEF("return", 1, js_async_from_sync_iterator_next, GEN_MAGIC_RETURN ),
+    JS_CFUNC_MAGIC_DEF("throw", 1, js_async_from_sync_iterator_next, GEN_MAGIC_THROW ),
+};
+
+/* AsyncGeneratorFunction */
+
+static const JSCFunctionListEntry js_async_generator_function_proto_funcs[] = {
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "AsyncGeneratorFunction", JS_PROP_CONFIGURABLE ),
+};
+
+/* AsyncGenerator prototype */
+
+static const JSCFunctionListEntry js_async_generator_proto_funcs[] = {
+    JS_CFUNC_MAGIC_DEF("next", 1, js_async_generator_next, GEN_MAGIC_NEXT ),
+    JS_CFUNC_MAGIC_DEF("return", 1, js_async_generator_next, GEN_MAGIC_RETURN ),
+    JS_CFUNC_MAGIC_DEF("throw", 1, js_async_generator_next, GEN_MAGIC_THROW ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "AsyncGenerator", JS_PROP_CONFIGURABLE ),
+};
+
+static JSClassShortDef const js_async_class_def[] = {
+    { JS_ATOM_Promise, js_promise_finalizer, js_promise_mark },                      /* JS_CLASS_PROMISE */
+    { JS_ATOM_PromiseResolveFunction, js_promise_resolve_function_finalizer, js_promise_resolve_function_mark }, /* JS_CLASS_PROMISE_RESOLVE_FUNCTION */
+    { JS_ATOM_PromiseRejectFunction, js_promise_resolve_function_finalizer, js_promise_resolve_function_mark }, /* JS_CLASS_PROMISE_REJECT_FUNCTION */
+    { JS_ATOM_AsyncFunction, js_bytecode_function_finalizer, js_bytecode_function_mark },  /* JS_CLASS_ASYNC_FUNCTION */
+    { JS_ATOM_AsyncFunctionResolve, js_async_function_resolve_finalizer, js_async_function_resolve_mark }, /* JS_CLASS_ASYNC_FUNCTION_RESOLVE */
+    { JS_ATOM_AsyncFunctionReject, js_async_function_resolve_finalizer, js_async_function_resolve_mark }, /* JS_CLASS_ASYNC_FUNCTION_REJECT */
+    { JS_ATOM_empty_string, js_async_from_sync_iterator_finalizer, js_async_from_sync_iterator_mark }, /* JS_CLASS_ASYNC_FROM_SYNC_ITERATOR */
+    { JS_ATOM_AsyncGeneratorFunction, js_bytecode_function_finalizer, js_bytecode_function_mark },  /* JS_CLASS_ASYNC_GENERATOR_FUNCTION */
+    { JS_ATOM_AsyncGenerator, js_async_generator_finalizer, js_async_generator_mark },  /* JS_CLASS_ASYNC_GENERATOR */
+};
+
+void JS_AddIntrinsicPromise(JSContext *ctx)
+{
+    JSRuntime *rt = ctx->rt;
+    JSValue obj1;
+
+    if (!JS_IsRegisteredClass(rt, JS_CLASS_PROMISE)) {
+        init_class_range(rt, js_async_class_def, JS_CLASS_PROMISE,
+                         countof(js_async_class_def));
+        rt->class_array[JS_CLASS_PROMISE_RESOLVE_FUNCTION].call = js_promise_resolve_function_call;
+        rt->class_array[JS_CLASS_PROMISE_REJECT_FUNCTION].call = js_promise_resolve_function_call;
+        rt->class_array[JS_CLASS_ASYNC_FUNCTION].call = js_async_function_call;
+        rt->class_array[JS_CLASS_ASYNC_FUNCTION_RESOLVE].call = js_async_function_resolve_call;
+        rt->class_array[JS_CLASS_ASYNC_FUNCTION_REJECT].call = js_async_function_resolve_call;
+        rt->class_array[JS_CLASS_ASYNC_GENERATOR_FUNCTION].call = js_async_generator_function_call;
+    }
+
+    /* Promise */
+    ctx->class_proto[JS_CLASS_PROMISE] = JS_NewObject(ctx);
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_PROMISE],
+                               js_promise_proto_funcs,
+                               countof(js_promise_proto_funcs));
+    obj1 = JS_NewCFunction2(ctx, js_promise_constructor, "Promise", 1,
+                            JS_CFUNC_constructor, 0);
+    JS_SetPropertyFunctionList(ctx, obj1,
+                               js_promise_funcs,
+                               countof(js_promise_funcs));
+    JS_NewGlobalCConstructor2(ctx, obj1, "Promise",
+                              ctx->class_proto[JS_CLASS_PROMISE]);
+
+    /* AsyncFunction */
+    ctx->class_proto[JS_CLASS_ASYNC_FUNCTION] = JS_NewObjectProto(ctx, ctx->function_proto);
+    obj1 = JS_NewCFunction3(ctx, (JSCFunction *)js_function_constructor,
+                            "AsyncFunction", 1,
+                            JS_CFUNC_constructor_or_func_magic, JS_FUNC_ASYNC,
+                            ctx->function_ctor);
+    JS_SetPropertyFunctionList(ctx,
+                               ctx->class_proto[JS_CLASS_ASYNC_FUNCTION],
+                               js_async_function_proto_funcs,
+                               countof(js_async_function_proto_funcs));
+    JS_SetConstructor2(ctx, obj1, ctx->class_proto[JS_CLASS_ASYNC_FUNCTION],
+                       0, JS_PROP_CONFIGURABLE);
+    JS_FreeValue(ctx, obj1);
+
+    /* AsyncIteratorPrototype */
+    ctx->async_iterator_proto = JS_NewObject(ctx);
+    JS_SetPropertyFunctionList(ctx, ctx->async_iterator_proto,
+                               js_async_iterator_proto_funcs,
+                               countof(js_async_iterator_proto_funcs));
+
+    /* AsyncFromSyncIteratorPrototype */
+    ctx->class_proto[JS_CLASS_ASYNC_FROM_SYNC_ITERATOR] =
+        JS_NewObjectProto(ctx, ctx->async_iterator_proto);
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_ASYNC_FROM_SYNC_ITERATOR],
+                               js_async_from_sync_iterator_proto_funcs,
+                               countof(js_async_from_sync_iterator_proto_funcs));
+
+    /* AsyncGeneratorPrototype */
+    ctx->class_proto[JS_CLASS_ASYNC_GENERATOR] =
+        JS_NewObjectProto(ctx, ctx->async_iterator_proto);
+    JS_SetPropertyFunctionList(ctx,
+                               ctx->class_proto[JS_CLASS_ASYNC_GENERATOR],
+                               js_async_generator_proto_funcs,
+                               countof(js_async_generator_proto_funcs));
+
+    /* AsyncGeneratorFunction */
+    ctx->class_proto[JS_CLASS_ASYNC_GENERATOR_FUNCTION] =
+        JS_NewObjectProto(ctx, ctx->function_proto);
+    obj1 = JS_NewCFunction3(ctx, (JSCFunction *)js_function_constructor,
+                            "AsyncGeneratorFunction", 1,
+                            JS_CFUNC_constructor_or_func_magic,
+                            JS_FUNC_ASYNC_GENERATOR,
+                            ctx->function_ctor);
+    JS_SetPropertyFunctionList(ctx,
+                               ctx->class_proto[JS_CLASS_ASYNC_GENERATOR_FUNCTION],
+                               js_async_generator_function_proto_funcs,
+                               countof(js_async_generator_function_proto_funcs));
+    JS_SetConstructor2(ctx, ctx->class_proto[JS_CLASS_ASYNC_GENERATOR_FUNCTION],
+                       ctx->class_proto[JS_CLASS_ASYNC_GENERATOR],
+                       JS_PROP_CONFIGURABLE, JS_PROP_CONFIGURABLE);
+    JS_SetConstructor2(ctx, obj1, ctx->class_proto[JS_CLASS_ASYNC_GENERATOR_FUNCTION],
+                       0, JS_PROP_CONFIGURABLE);
+    JS_FreeValue(ctx, obj1);
+}
+
+/* URI handling */
+
+static int string_get_hex(JSString *p, int k, int n) {
+    int c = 0, h;
+    while (n-- > 0) {
+        if ((h = from_hex(string_get(p, k++))) < 0)
+            return -1;
+        c = (c << 4) | h;
+    }
+    return c;
+}
+
+static int isURIReserved(int c) {
+    return c < 0x100 && memchr(";/?:@&=+$,#", c, sizeof(";/?:@&=+$,#") - 1) != NULL;
+}
+
+#if defined(_MSC_VER)
+static int js_throw_URIError(JSContext *ctx, const char *fmt, ...)
+#else
+static int __attribute__((format(printf, 2, 3))) js_throw_URIError(JSContext *ctx, const char *fmt, ...)
+#endif
+{
+    va_list ap;
+
+    va_start(ap, fmt);
+    JS_ThrowError(ctx, JS_URI_ERROR, fmt, ap);
+    va_end(ap);
+    return -1;
+}
+
+static int hex_decode(JSContext *ctx, JSString *p, int k) {
+    int c;
+
+    if (k >= p->len || string_get(p, k) != '%')
+        return js_throw_URIError(ctx, "expecting %%");
+    if (k + 2 >= p->len || (c = string_get_hex(p, k + 1, 2)) < 0)
+        return js_throw_URIError(ctx, "expecting hex digit");
+
+    return c;
+}
+
+static JSValue js_global_decodeURI(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv, int isComponent)
+{
+    JSValue str;
+    StringBuffer b_s, *b = &b_s;
+    JSString *p;
+    int k, c, c1, n, c_min;
+
+    str = JS_ToString(ctx, argv[0]);
+    if (JS_IsException(str))
+        return str;
+
+    string_buffer_init(ctx, b, 0);
+
+    p = JS_VALUE_GET_STRING(str);
+    for (k = 0; k < p->len;) {
+        c = string_get(p, k);
+        if (c == '%') {
+            c = hex_decode(ctx, p, k);
+            if (c < 0)
+                goto fail;
+            k += 3;
+            if (c < 0x80) {
+                if (!isComponent && isURIReserved(c)) {
+                    c = '%';
+                    k -= 2;
+                }
+            } else {
+                /* Decode URI-encoded UTF-8 sequence */
+                if (c >= 0xc0 && c <= 0xdf) {
+                    n = 1;
+                    c_min = 0x80;
+                    c &= 0x1f;
+                } else if (c >= 0xe0 && c <= 0xef) {
+                    n = 2;
+                    c_min = 0x800;
+                    c &= 0xf;
+                } else if (c >= 0xf0 && c <= 0xf7) {
+                    n = 3;
+                    c_min = 0x10000;
+                    c &= 0x7;
+                } else {
+                    n = 0;
+                    c_min = 1;
+                    c = 0;
+                }
+                while (n-- > 0) {
+                    c1 = hex_decode(ctx, p, k);
+                    if (c1 < 0)
+                        goto fail;
+                    k += 3;
+                    if ((c1 & 0xc0) != 0x80) {
+                        c = 0;
+                        break;
+                    }
+                    c = (c << 6) | (c1 & 0x3f);
+                }
+                if (c < c_min || c > 0x10FFFF) {
+                    js_throw_URIError(ctx, "malformed UTF-8");
+                    goto fail;
+                }
+            }
+        } else {
+            k++;
+        }
+        string_buffer_putc(b, c);
+    }
+    JS_FreeValue(ctx, str);
+    return string_buffer_end(b);
+
+fail:
+    JS_FreeValue(ctx, str);
+    string_buffer_free(b);
+    return JS_EXCEPTION;
+}
+
+static int isUnescaped(int c) {
+    static char const unescaped_chars[] =
+        "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
+        "abcdefghijklmnopqrstuvwxyz"
+        "0123456789"
+        "@*_+-./";
+    return c < 0x100 &&
+        memchr(unescaped_chars, c, sizeof(unescaped_chars) - 1);
+}
+
+static int isURIUnescaped(int c, int isComponent) {
+    return c < 0x100 &&
+        ((c >= 0x61 && c <= 0x7a) ||
+         (c >= 0x41 && c <= 0x5a) ||
+         (c >= 0x30 && c <= 0x39) ||
+         memchr("-_.!~*'()", c, sizeof("-_.!~*'()") - 1) != NULL ||
+         (!isComponent && isURIReserved(c)));
+}
+
+static int encodeURI_hex(StringBuffer *b, int c) {
+    uint8_t buf[6];
+    int n = 0;
+    const char *hex = "0123456789ABCDEF";
+
+    buf[n++] = '%';
+    if (c >= 256) {
+        buf[n++] = 'u';
+        buf[n++] = hex[(c >> 12) & 15];
+        buf[n++] = hex[(c >>  8) & 15];
+    }
+    buf[n++] = hex[(c >> 4) & 15];
+    buf[n++] = hex[(c >> 0) & 15];
+    return string_buffer_write8(b, buf, n);
+}
+
+static JSValue js_global_encodeURI(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv,
+                                   int isComponent)
+{
+    JSValue str;
+    StringBuffer b_s, *b = &b_s;
+    JSString *p;
+    int k, c, c1;
+
+    str = JS_ToString(ctx, argv[0]);
+    if (JS_IsException(str))
+        return str;
+
+    p = JS_VALUE_GET_STRING(str);
+    string_buffer_init(ctx, b, p->len);
+    for (k = 0; k < p->len;) {
+        c = string_get(p, k);
+        k++;
+        if (isURIUnescaped(c, isComponent)) {
+            string_buffer_putc16(b, c);
+        } else {
+            if (c >= 0xdc00 && c <= 0xdfff) {
+                js_throw_URIError(ctx, "invalid character");
+                goto fail;
+            } else if (c >= 0xd800 && c <= 0xdbff) {
+                if (k >= p->len) {
+                    js_throw_URIError(ctx, "expecting surrogate pair");
+                    goto fail;
+                }
+                c1 = string_get(p, k);
+                k++;
+                if (c1 < 0xdc00 || c1 > 0xdfff) {
+                    js_throw_URIError(ctx, "expecting surrogate pair");
+                    goto fail;
+                }
+                c = (((c & 0x3ff) << 10) | (c1 & 0x3ff)) + 0x10000;
+            }
+            if (c < 0x80) {
+                encodeURI_hex(b, c);
+            } else {
+                /* XXX: use C UTF-8 conversion ? */
+                if (c < 0x800) {
+                    encodeURI_hex(b, (c >> 6) | 0xc0);
+                } else {
+                    if (c < 0x10000) {
+                        encodeURI_hex(b, (c >> 12) | 0xe0);
+                    } else {
+                        encodeURI_hex(b, (c >> 18) | 0xf0);
+                        encodeURI_hex(b, ((c >> 12) & 0x3f) | 0x80);
+                    }
+                    encodeURI_hex(b, ((c >> 6) & 0x3f) | 0x80);
+                }
+                encodeURI_hex(b, (c & 0x3f) | 0x80);
+            }
+        }
+    }
+    JS_FreeValue(ctx, str);
+    return string_buffer_end(b);
+
+fail:
+    JS_FreeValue(ctx, str);
+    string_buffer_free(b);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_global_escape(JSContext *ctx, JSValueConst this_val,
+                                int argc, JSValueConst *argv)
+{
+    JSValue str;
+    StringBuffer b_s, *b = &b_s;
+    JSString *p;
+    int i, len, c;
+
+    str = JS_ToStringCheckObject(ctx, argv[0]);
+    if (JS_IsException(str))
+        return str;
+
+    p = JS_VALUE_GET_STRING(str);
+    string_buffer_init(ctx, b, p->len);
+    for (i = 0, len = p->len; i < len; i++) {
+        c = string_get(p, i);
+        if (isUnescaped(c)) {
+            string_buffer_putc16(b, c);
+        } else {
+            encodeURI_hex(b, c);
+        }
+    }
+    JS_FreeValue(ctx, str);
+    return string_buffer_end(b);
+}
+
+static JSValue js_global_unescape(JSContext *ctx, JSValueConst this_val,
+                                  int argc, JSValueConst *argv)
+{
+    JSValue str;
+    StringBuffer b_s, *b = &b_s;
+    JSString *p;
+    int i, len, c, n;
+
+    str = JS_ToStringCheckObject(ctx, argv[0]);
+    if (JS_IsException(str))
+        return str;
+
+    string_buffer_init(ctx, b, 0);
+    p = JS_VALUE_GET_STRING(str);
+    for (i = 0, len = p->len; i < len; i++) {
+        c = string_get(p, i);
+        if (c == '%') {
+            if (i + 6 <= len
+            &&  string_get(p, i + 1) == 'u'
+            &&  (n = string_get_hex(p, i + 2, 4)) >= 0) {
+                c = n;
+                i += 6 - 1;
+            } else
+            if (i + 3 <= len
+            &&  (n = string_get_hex(p, i + 1, 2)) >= 0) {
+                c = n;
+                i += 3 - 1;
+            }
+        }
+        string_buffer_putc16(b, c);
+    }
+    JS_FreeValue(ctx, str);
+    return string_buffer_end(b);
+}
+
+/* global object */
+
+static const JSCFunctionListEntry js_global_funcs[] = {
+    JS_CFUNC_DEF("parseInt", 2, js_parseInt ),
+    JS_CFUNC_DEF("parseFloat", 1, js_parseFloat ),
+    JS_CFUNC_DEF("isNaN", 1, js_global_isNaN ),
+    JS_CFUNC_DEF("isFinite", 1, js_global_isFinite ),
+    JS_CFUNC_DEF("eval", 1, js_global_eval ),
+
+    JS_CFUNC_MAGIC_DEF("decodeURI", 1, js_global_decodeURI, 0 ),
+    JS_CFUNC_MAGIC_DEF("decodeURIComponent", 1, js_global_decodeURI, 1 ),
+    JS_CFUNC_MAGIC_DEF("encodeURI", 1, js_global_encodeURI, 0 ),
+    JS_CFUNC_MAGIC_DEF("encodeURIComponent", 1, js_global_encodeURI, 1 ),
+    JS_CFUNC_DEF("escape", 1, js_global_escape ),
+    JS_CFUNC_DEF("unescape", 1, js_global_unescape ),
+    JS_PROP_DOUBLE_DEF("Infinity", 1.0 / 0.0, 0 ),
+    JS_PROP_DOUBLE_DEF("NaN", NAN, 0 ),
+    JS_PROP_UNDEFINED_DEF("undefined", 0 ),
+
+    /* for the 'Date' implementation */
+    JS_CFUNC_DEF("__date_clock", 0, js___date_clock ),
+    //JS_CFUNC_DEF("__date_now", 0, js___date_now ),
+    //JS_CFUNC_DEF("__date_getTimezoneOffset", 1, js___date_getTimezoneOffset ),
+    //JS_CFUNC_DEF("__date_create", 3, js___date_create ),
+};
+
+/* Date */
+
+#if 0
+
+static int64_t math_mod(int64_t a, int64_t b) {
+    /* return positive modulo */
+    int64_t m = a % b;
+    return m + (m < 0) * b;
+}
+
+static int64_t floor_div(int64_t a, int64_t b) {
+    /* integer division rounding toward -Infinity */
+    int64_t m = a % b;
+    return (a - (m + (m < 0) * b)) / b;
+}
+
+static JSValue js_Date_parse(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv);
+
+static __exception int JS_ThisTimeValue(JSContext *ctx, double *valp, JSValueConst this_val)
+{
+    if (JS_VALUE_GET_TAG(this_val) == JS_TAG_OBJECT) {
+        JSObject *p = JS_VALUE_GET_OBJ(this_val);
+        if (p->class_id == JS_CLASS_DATE && JS_IsNumber(p->u.object_data))
+            return JS_ToFloat64(ctx, valp, p->u.object_data);
+    }
+    JS_ThrowTypeError(ctx, "not a Date object");
+    return -1;
+}
+
+static JSValue JS_SetThisTimeValue(JSContext *ctx, JSValueConst this_val, double v)
+{
+    if (JS_VALUE_GET_TAG(this_val) == JS_TAG_OBJECT) {
+        JSObject *p = JS_VALUE_GET_OBJ(this_val);
+        if (p->class_id == JS_CLASS_DATE) {
+            JS_FreeValue(ctx, p->u.object_data);
+            p->u.object_data = __JS_NewFloat64(ctx, v);
+            return JS_DupValue(ctx, p->u.object_data);
+        }
+    }
+    return JS_ThrowTypeError(ctx, "not a Date object");
+}
+
+static int64_t days_from_year(int64_t y) {
+    return 365 * (y - 1970) + floor_div(y - 1969, 4) -
+        floor_div(y - 1901, 100) + floor_div(y - 1601, 400);
+}
+
+static int64_t days_in_year(int64_t y) {
+    return 365 + !(y % 4) - !(y % 100) + !(y % 400);
+}
+
+/* return the year, update days */
+static int64_t year_from_days(int64_t *days) {
+    int64_t y, d1, nd, d = *days;
+    y = floor_div(d * 10000, 3652425) + 1970;
+    /* the initial approximation is very good, so only a few
+       iterations are necessary */
+    for(;;) {
+        d1 = d - days_from_year(y);
+        if (d1 < 0) {
+            y--;
+            d1 += days_in_year(y);
+        } else {
+            nd = days_in_year(y);
+            if (d1 < nd)
+                break;
+            d1 -= nd;
+            y++;
+        }
+    }
+    *days = d1;
+    return y;
+}
+
+static int const month_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
+static char const month_names[] = "JanFebMarAprMayJunJulAugSepOctNovDec";
+static char const day_names[] = "SunMonTueWedThuFriSat";
+
+static __exception int get_date_fields(JSContext *ctx, JSValueConst obj,
+                                       int64_t fields[9], int is_local, int force)
+{
+    double dval;
+    int64_t d, days, wd, y, i, md, h, m, s, ms, tz = 0;
+
+    if (JS_ThisTimeValue(ctx, &dval, obj))
+        return -1;
+
+    if (isnan(dval)) {
+        if (!force)
+            return FALSE; /* NaN */
+        d = 0;        /* initialize all fields to 0 */
+    } else {
+        d = dval;
+        if (is_local) {
+            tz = -getTimezoneOffset(d);
+            d += tz * 60000;
+        }
+    }
+
+    /* result is >= 0, we can use % */
+    h = math_mod(d, 86400000);
+    days = (d - h) / 86400000;
+    ms = h % 1000;
+    h = (h - ms) / 1000;
+    s = h % 60;
+    h = (h - s) / 60;
+    m = h % 60;
+    h = (h - m) / 60;
+    wd = math_mod(days + 4, 7); /* week day */
+    y = year_from_days(&days);
+
+    for(i = 0; i < 11; i++) {
+        md = month_days[i];
+        if (i == 1)
+            md += days_in_year(y) - 365;
+        if (days < md)
+            break;
+        days -= md;
+    }
+    fields[0] = y;
+    fields[1] = i;
+    fields[2] = days + 1;
+    fields[3] = h;
+    fields[4] = m;
+    fields[5] = s;
+    fields[6] = ms;
+    fields[7] = wd;
+    fields[8] = tz;
+    return TRUE;
+}
+
+static double time_clip(double t) {
+    if (t >= -8.64e15 && t <= 8.64e15)
+        return trunc(t) + 0.0;  /* convert -0 to +0 */
+    else
+        return NAN;
+}
+
+static double set_date_fields(int64_t fields[], int is_local) {
+    int64_t days, y, m, md, h, d, i;
+
+    i = fields[1];
+    m = math_mod(i, 12);
+    y = fields[0] + (i - m) / 12;
+    days = days_from_year(y);
+
+    for(i = 0; i < m; i++) {
+        md = month_days[i];
+        if (i == 1)
+            md += days_in_year(y) - 365;
+        days += md;
+    }
+    days += fields[2] - 1;
+    h = ((fields[3] * 60 + fields[4]) * 60 + fields[5]) * 1000 + fields[6];
+    d = days * 86400000 + h;
+    if (is_local)
+        d += getTimezoneOffset(d) * 60000;
+    return time_clip(d);
+}
+
+static JSValue get_date_field(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv, int magic)
+{
+    // get_date_field(obj, n, is_local)
+    int64_t fields[9];
+    int res, n, is_local;
+
+    is_local = magic & 0x0F;
+    n = (magic >> 4) & 0x0F;
+    res = get_date_fields(ctx, this_val, fields, is_local, 0);
+    if (res < 0)
+        return JS_EXCEPTION;
+    if (!res)
+        return JS_NAN;
+
+    if (magic & 0x100) {    // getYear
+        fields[0] -= 1900;
+    }
+    return JS_NewInt64(ctx, fields[n]);
+}
+
+static JSValue set_date_field(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv, int magic)
+{
+    // _field(obj, first_field, end_field, args, is_local)
+    int64_t fields[9];
+    int res, first_field, end_field, is_local, i, n;
+    double d, a;
+
+    d = NAN;
+    first_field = (magic >> 8) & 0x0F;
+    end_field = (magic >> 4) & 0x0F;
+    is_local = magic & 0x0F;
+
+    res = get_date_fields(ctx, this_val, fields, is_local, first_field == 0);
+    if (res < 0)
+        return JS_EXCEPTION;
+    if (res && argc > 0) {
+        n = end_field - first_field;
+        if (argc < n)
+            n = argc;
+        for(i = 0; i < n; i++) {
+            if (JS_ToFloat64(ctx, &a, argv[i]))
+                return JS_EXCEPTION;
+            if (!isfinite(a))
+                goto done;
+            fields[first_field + i] = trunc(a);
+        }
+        d = set_date_fields(fields, is_local);
+    }
+done:
+    return JS_SetThisTimeValue(ctx, this_val, d);
+}
+
+/* fmt:
+   0: toUTCString: "Tue, 02 Jan 2018 23:04:46 GMT"
+   1: toString: "Wed Jan 03 2018 00:05:22 GMT+0100 (CET)"
+   2: toISOString: "2018-01-02T23:02:56.927Z"
+   3: toLocaleString: "1/2/2018, 11:40:40 PM"
+   part: 1=date, 2=time 3=all
+   XXX: should use a variant of strftime().
+ */
+static JSValue get_date_string(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv, int magic)
+{
+    // _string(obj, fmt, part)
+    char buf[64];
+    int64_t fields[9];
+    int res, fmt, part, pos;
+    int y, mon, d, h, m, s, ms, wd, tz;
+
+    fmt = (magic >> 4) & 0x0F;
+    part = magic & 0x0F;
+
+    res = get_date_fields(ctx, this_val, fields, fmt & 1, 0);
+    if (res < 0)
+        return JS_EXCEPTION;
+    if (!res) {
+        if (fmt == 2)
+            return JS_ThrowRangeError(ctx, "Date value is NaN");
+        else
+            return JS_NewString(ctx, "Invalid Date");
+    }
+
+    y = fields[0];
+    mon = fields[1];
+    d = fields[2];
+    h = fields[3];
+    m = fields[4];
+    s = fields[5];
+    ms = fields[6];
+    wd = fields[7];
+    tz = fields[8];
+
+    pos = 0;
+
+    if (part & 1) { /* date part */
+        switch(fmt) {
+        case 0:
+            pos += snprintf(buf + pos, sizeof(buf) - pos,
+                            "%.3s, %02d %.3s %04d ",
+                            day_names + wd * 3, d,
+                            month_names + mon * 3, y);
+            break;
+        case 1:
+            pos += snprintf(buf + pos, sizeof(buf) - pos,
+                            "%.3s %.3s %02d %04d",
+                            day_names + wd * 3,
+                            month_names + mon * 3, d, y);
+            if (part == 3) {
+                buf[pos++] = ' ';
+            }
+            break;
+        case 2:
+            if (y >= 0 && y <= 9999) {
+                pos += snprintf(buf + pos, sizeof(buf) - pos,
+                                "%04d", y);
+            } else {
+                pos += snprintf(buf + pos, sizeof(buf) - pos,
+                                "%+07d", y);
+            }
+            pos += snprintf(buf + pos, sizeof(buf) - pos,
+                            "-%02d-%02dT", mon + 1, d);
+            break;
+        case 3:
+            pos += snprintf(buf + pos, sizeof(buf) - pos,
+                            "%02d/%02d/%04d", mon + 1, d, y);
+            if (part == 3) {
+                buf[pos++] = ',';
+                buf[pos++] = ' ';
+            }
+            break;
+        }
+    }
+    if (part & 2) { /* time part */
+        switch(fmt) {
+        case 0:
+            pos += snprintf(buf + pos, sizeof(buf) - pos,
+                            "%02d:%02d:%02d GMT", h, m, s);
+            break;
+        case 1:
+            pos += snprintf(buf + pos, sizeof(buf) - pos,
+                            "%02d:%02d:%02d GMT", h, m, s);
+            if (tz < 0) {
+                buf[pos++] = '-';
+                tz = -tz;
+            } else {
+                buf[pos++] = '+';
+            }
+            /* tz is >= 0, can use % */
+            pos += snprintf(buf + pos, sizeof(buf) - pos,
+                            "%02d%02d", tz / 60, tz % 60);
+            /* XXX: tack the time zone code? */
+            break;
+        case 2:
+            pos += snprintf(buf + pos, sizeof(buf) - pos,
+                            "%02d:%02d:%02d.%03dZ", h, m, s, ms);
+            break;
+        case 3:
+            pos += snprintf(buf + pos, sizeof(buf) - pos,
+                            "%02d:%02d:%02d %cM", (h + 1) % 12 - 1, m, s,
+                            (h < 12) ? 'A' : 'P');
+            break;
+        }
+    }
+    return JS_NewStringLen(ctx, buf, pos);
+}
+
+/* OS dependent: return the UTC time in ms since 1970. */
+static int64_t date_now(void) {
+    struct timeval tv;
+    gettimeofday(&tv, NULL);
+    return (int64_t)tv.tv_sec * 1000 + (tv.tv_usec / 1000);
+}
+
+static JSValue js_date_constructor(JSContext *ctx, JSValueConst new_target,
+                                   int argc, JSValueConst *argv)
+{
+    // Date(y, mon, d, h, m, s, ms)
+    JSValue rv;
+    int i, n;
+    double a, val;
+
+    if (JS_IsUndefined(new_target)) {
+        /* invoked as function */
+        argc = 0;
+    }
+    n = argc;
+    if (n == 0) {
+        val = date_now();
+    } else if (n == 1) {
+        JSValue v, dv;
+        if (JS_VALUE_GET_TAG(argv[0]) == JS_TAG_OBJECT) {
+            JSObject *p = JS_VALUE_GET_OBJ(argv[0]);
+            if (p->class_id == JS_CLASS_DATE && JS_IsNumber(p->u.object_data)) {
+                if (JS_ToFloat64(ctx, &val, p->u.object_data))
+                    return JS_EXCEPTION;
+                val = time_clip(val);
+                goto has_val;
+            }
+        }
+        v = JS_ToPrimitive(ctx, argv[0], HINT_NONE);
+        if (JS_IsString(v)) {
+            dv = js_Date_parse(ctx, JS_UNDEFINED, 1, (JSValueConst *)&v);
+            JS_FreeValue(ctx, v);
+            if (JS_IsException(dv))
+                return JS_EXCEPTION;
+            if (JS_ToFloat64Free(ctx, &val, dv))
+                return JS_EXCEPTION;
+        } else {
+            if (JS_ToFloat64Free(ctx, &val, v))
+                return JS_EXCEPTION;
+        }
+        val = time_clip(val);
+    } else {
+        int64_t fields[] = { 0, 0, 1, 0, 0, 0, 0 };
+        if (n > 7)
+            n = 7;
+        for(i = 0; i < n; i++) {
+            if (JS_ToFloat64(ctx, &a, argv[i]))
+                return JS_EXCEPTION;
+            if (!isfinite(a))
+                break;
+            fields[i] = trunc(a);
+            if (i == 0 && fields[0] >= 0 && fields[0] < 100)
+                fields[0] += 1900;
+        }
+        val = (i == n) ? set_date_fields(fields, 1) : NAN;
+    }
+has_val:
+#if 0
+    JSValueConst args[3];
+    args[0] = new_target;
+    args[1] = ctx->class_proto[JS_CLASS_DATE];
+    args[2] = __JS_NewFloat64(ctx, val);
+    rv = js___date_create(ctx, JS_UNDEFINED, 3, args);
+#else
+    rv = js_create_from_ctor(ctx, new_target, JS_CLASS_DATE);
+    if (!JS_IsException(rv))
+        JS_SetObjectData(ctx, rv, __JS_NewFloat64(ctx, val));
+#endif
+    if (!JS_IsException(rv) && JS_IsUndefined(new_target)) {
+        /* invoked as a function, return (new Date()).toString(); */
+        JSValue s;
+        s = get_date_string(ctx, rv, 0, NULL, 0x13);
+        JS_FreeValue(ctx, rv);
+        rv = s;
+    }
+    return rv;
+}
+
+static JSValue js_Date_UTC(JSContext *ctx, JSValueConst this_val,
+                           int argc, JSValueConst *argv)
+{
+    // UTC(y, mon, d, h, m, s, ms)
+    int64_t fields[] = { 0, 0, 1, 0, 0, 0, 0 };
+    int i, n;
+    double a;
+
+    n = argc;
+    if (n == 0)
+        return JS_NAN;
+    if (n > 7)
+        n = 7;
+    for(i = 0; i < n; i++) {
+        if (JS_ToFloat64(ctx, &a, argv[i]))
+            return JS_EXCEPTION;
+        if (!isfinite(a))
+            return JS_NAN;
+        fields[i] = trunc(a);
+        if (i == 0 && fields[0] >= 0 && fields[0] < 100)
+            fields[0] += 1900;
+    }
+    return __JS_NewFloat64(ctx, set_date_fields(fields, 0));
+}
+
+static void string_skip_spaces(JSString *sp, int *pp) {
+    while (*pp < sp->len && string_get(sp, *pp) == ' ')
+        *pp += 1;
+}
+
+static void string_skip_non_spaces(JSString *sp, int *pp) {
+    while (*pp < sp->len && string_get(sp, *pp) != ' ')
+        *pp += 1;
+}
+
+/* parse a numeric field */
+static int string_get_field(JSString *sp, int *pp, int64_t *pval) {
+    int64_t v = 0;
+    int c, p = *pp;
+
+    /* skip non digits, should only skip spaces? */
+    while (p < sp->len) {
+        c = string_get(sp, p);
+        if (c >= '0' && c <= '9')
+            break;
+        p++;
+    }
+    if (p >= sp->len)
+        return -1;
+    while (p < sp->len) {
+        c = string_get(sp, p);
+        if (!(c >= '0' && c <= '9'))
+            break;
+        v = v * 10 + c - '0';
+        p++;
+    }
+    *pval = v;
+    *pp = p;
+    return 0;
+}
+
+/* parse a fixed width numeric field */
+static int string_get_digits(JSString *sp, int *pp, int n, int64_t *pval) {
+    int64_t v = 0;
+    int i, c, p = *pp;
+
+    for(i = 0; i < n; i++) {
+        if (p >= sp->len)
+            return -1;
+        c = string_get(sp, p);
+        if (!(c >= '0' && c <= '9'))
+            return -1;
+        v = v * 10 + c - '0';
+        p++;
+    }
+    *pval = v;
+    *pp = p;
+    return 0;
+}
+
+/* parse a signed numeric field */
+static int string_get_signed_field(JSString *sp, int *pp, int64_t *pval) {
+    int sgn, res;
+
+    if (*pp >= sp->len)
+        return -1;
+
+    sgn = string_get(sp, *pp);
+    if (sgn == '-' || sgn == '+')
+        *pp += 1;
+
+    res = string_get_field(sp, pp, pval);
+    if (res == 0 && sgn == '-')
+        *pval = -*pval;
+    return res;
+}
+
+static int find_abbrev(JSString *sp, int p, const char *list, int count) {
+    int n, i;
+
+    if (p + 3 <= sp->len) {
+        for (n = 0; n < count; n++) {
+            for (i = 0; i < 3; i++) {
+                if (string_get(sp, p + i) != month_names[n * 3 + i])
+                    goto next;
+            }
+            return n;
+        next:;
+        }
+    }
+    return -1;
+}
+
+static int string_get_month(JSString *sp, int *pp, int64_t *pval) {
+    int n;
+
+    string_skip_spaces(sp, pp);
+    n = find_abbrev(sp, *pp, month_names, 12);
+    if (n < 0)
+        return -1;
+
+    *pval = n;
+    *pp += 3;
+    return 0;
+}
+
+static JSValue js_Date_parse(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv)
+{
+    // parse(s)
+    JSValue s, rv;
+    int64_t fields[] = { 0, 1, 1, 0, 0, 0, 0 };
+    int64_t tz, hh, mm;
+    double d;
+    int p, i, c, sgn;
+    JSString *sp;
+
+    rv = JS_NAN;
+
+    s = JS_ToString(ctx, argv[0]);
+    if (JS_IsException(s))
+        return JS_EXCEPTION;
+    
+    sp = JS_VALUE_GET_STRING(s);
+    p = 0;
+    if (p < sp->len && (((c = string_get(sp, p)) >= '0' && c <= '9') || c == '+' || c == '-')) {
+        /* ISO format */
+        /* year field can be negative */
+        /* XXX: could be stricter */
+        if (string_get_signed_field(sp, &p, &fields[0]))
+            goto done;
+
+        for(i = 1; i < 7; i++) {
+            if (string_get_field(sp, &p, &fields[i]))
+                break;
+        }
+        fields[1] -= 1;
+
+        /* parse the time zone offset if present: [+-]HH:mm */
+        tz = 0;
+        if (p < sp->len && ((sgn = string_get(sp, p)) == '+' || sgn == '-')) {
+            if (string_get_field(sp, &p, &hh))
+                goto done;
+            if (string_get_field(sp, &p, &mm))
+                goto done;
+            tz = hh * 60 + mm;
+            if (sgn == '-')
+                tz = -tz;
+        }
+    } else {
+        /* toString or toUTCString format */
+        /* skip the day of the week */
+        string_skip_non_spaces(sp, &p);
+        string_skip_spaces(sp, &p);
+        if (p >= sp->len)
+            goto done;
+        c = string_get(sp, p);
+        if (c >= '0' && c <= '9') {
+            /* day of month first */
+            if (string_get_field(sp, &p, &fields[2]))
+                goto done;
+            if (string_get_month(sp, &p, &fields[1]))
+                goto done;
+        } else {
+            /* month first */
+            if (string_get_month(sp, &p, &fields[1]))
+                goto done;
+            if (string_get_field(sp, &p, &fields[2]))
+                goto done;
+        }
+        string_skip_spaces(sp, &p);
+        if (string_get_signed_field(sp, &p, &fields[0]))
+            goto done;
+
+        /* hour, min, seconds */
+        for(i = 0; i < 3; i++) {
+            if (string_get_field(sp, &p, &fields[3 + i]))
+                goto done;
+        }
+
+        /* parse the time zone offset if present: [+-]HHmm */
+        tz = 0;
+        for (tz = 0; p < sp->len; p++) {
+            sgn = string_get(sp, p);
+            if (sgn == '+' || sgn == '-') {
+                p++;
+                if (string_get_digits(sp, &p, 2, &hh))
+                    goto done;
+                if (string_get_digits(sp, &p, 2, &mm))
+                    goto done;
+                tz = hh * 60 + mm;
+                if (sgn == '-')
+                    tz = -tz;
+                break;
+            }
+        }
+    }
+    d = set_date_fields(fields, 0) - tz * 60000;
+    rv = __JS_NewFloat64(ctx, d);
+
+done:
+    JS_FreeValue(ctx, s);
+    return rv;
+}
+
+static JSValue js_Date_now(JSContext *ctx, JSValueConst this_val,
+                           int argc, JSValueConst *argv)
+{
+    // now()
+    return JS_NewInt64(ctx, date_now());
+}
+
+static JSValue js_date_Symbol_toPrimitive(JSContext *ctx, JSValueConst this_val,
+                                          int argc, JSValueConst *argv)
+{
+    // Symbol_toPrimitive(hint)
+    JSValueConst obj = this_val;
+    JSAtom hint = JS_ATOM_NULL;
+    int hint_num;
+
+    if (!JS_IsObject(obj))
+        return JS_ThrowTypeErrorNotAnObject(ctx);
+
+    if (JS_IsString(argv[0])) {
+        hint = js_value_to_atom(ctx, argv[0]);
+        if (hint == JS_ATOM_NULL)
+            return JS_EXCEPTION;
+        JS_FreeAtom(ctx, hint);
+    }
+    switch (hint) {
+    case JS_ATOM_number:
+#ifdef CONFIG_BIGNUM
+    case JS_ATOM_integer:
+#endif
+        hint_num = HINT_NUMBER;
+        break;
+    case JS_ATOM_string:
+    case JS_ATOM_default:
+        hint_num = HINT_STRING;
+        break;
+    default:
+        return JS_ThrowTypeError(ctx, "invalid hint");
+    }
+    return JS_ToPrimitive(ctx, obj, hint_num | HINT_FORCE_ORDINARY);
+}
+
+static JSValue js_date_getTimezoneOffset(JSContext *ctx, JSValueConst this_val,
+                                         int argc, JSValueConst *argv)
+{
+    // getTimezoneOffset()
+    double v;
+
+    if (JS_ThisTimeValue(ctx, &v, this_val))
+        return JS_EXCEPTION;
+    if (isnan(v))
+        return JS_NAN;
+    else
+        return JS_NewInt64(ctx, getTimezoneOffset((int64_t)trunc(v)));
+}
+
+static JSValue js_date_getTime(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv)
+{
+    // getTime()
+    double v;
+
+    if (JS_ThisTimeValue(ctx, &v, this_val))
+        return JS_EXCEPTION;
+    return __JS_NewFloat64(ctx, v);
+}
+
+static JSValue js_date_setTime(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv)
+{
+    // setTime(v)
+    double v;
+
+    if (JS_ThisTimeValue(ctx, &v, this_val) || JS_ToFloat64(ctx, &v, argv[0]))
+        return JS_EXCEPTION;
+    return JS_SetThisTimeValue(ctx, this_val, time_clip(v));
+}
+
+static JSValue js_date_setYear(JSContext *ctx, JSValueConst this_val,
+                               int argc, JSValueConst *argv)
+{
+    // setYear(y)
+    double y;
+    JSValueConst args[1];
+
+    if (JS_ThisTimeValue(ctx, &y, this_val) || JS_ToFloat64(ctx, &y, argv[0]))
+        return JS_EXCEPTION;
+    y = +y;
+    if (isfinite(y)) {
+        y = trunc(y);
+        if (y >= 0 && y < 100)
+            y += 1900;
+    }
+    args[0] = __JS_NewFloat64(ctx, y);
+    return set_date_field(ctx, this_val, 1, args, 0x011);
+}
+
+static JSValue js_date_toJSON(JSContext *ctx, JSValueConst this_val,
+                              int argc, JSValueConst *argv)
+{
+    // toJSON(key)
+    JSValue obj, tv, method, rv;
+    double d;
+
+    rv = JS_EXCEPTION;
+    tv = JS_UNDEFINED;
+
+    obj = JS_ToObject(ctx, this_val);
+    tv = JS_ToPrimitive(ctx, obj, HINT_NUMBER);
+    if (JS_IsException(tv))
+        goto exception;
+    if (JS_IsNumber(tv)) {
+        if (JS_ToFloat64(ctx, &d, tv) < 0)
+            goto exception;
+        if (!isfinite(d)) {
+            rv = JS_NULL;
+            goto done;
+        }
+    }
+    method = JS_GetPropertyStr(ctx, obj, "toISOString");
+    if (JS_IsException(method))
+        goto exception;
+    if (!JS_IsFunction(ctx, method)) {
+        JS_ThrowTypeError(ctx, "object needs toISOString method");
+        JS_FreeValue(ctx, method);
+        goto exception;
+    }
+    rv = JS_CallFree(ctx, method, obj, 0, NULL);
+exception:
+done:
+    JS_FreeValue(ctx, obj);
+    JS_FreeValue(ctx, tv);
+    return rv;
+}
+
+static const JSCFunctionListEntry js_date_funcs[] = {
+    JS_CFUNC_DEF("now", 0, js_Date_now ),
+    JS_CFUNC_DEF("parse", 1, js_Date_parse ),
+    JS_CFUNC_DEF("UTC", 7, js_Date_UTC ),
+};
+
+static const JSCFunctionListEntry js_date_proto_funcs[] = {
+    JS_CFUNC_DEF("valueOf", 0, js_date_getTime ),
+    JS_CFUNC_MAGIC_DEF("toString", 0, get_date_string, 0x13 ),
+    JS_CFUNC_DEF("[Symbol.toPrimitive]", 1, js_date_Symbol_toPrimitive ),
+    JS_CFUNC_MAGIC_DEF("toUTCString", 0, get_date_string, 0x03 ),
+    JS_ALIAS_DEF("toGMTString", "toUTCString" ),
+    JS_CFUNC_MAGIC_DEF("toISOString", 0, get_date_string, 0x23 ),
+    JS_CFUNC_MAGIC_DEF("toDateString", 0, get_date_string, 0x11 ),
+    JS_CFUNC_MAGIC_DEF("toTimeString", 0, get_date_string, 0x12 ),
+    JS_CFUNC_MAGIC_DEF("toLocaleString", 0, get_date_string, 0x33 ),
+    JS_CFUNC_MAGIC_DEF("toLocaleDateString", 0, get_date_string, 0x31 ),
+    JS_CFUNC_MAGIC_DEF("toLocaleTimeString", 0, get_date_string, 0x32 ),
+    JS_CFUNC_DEF("getTimezoneOffset", 0, js_date_getTimezoneOffset ),
+    JS_CFUNC_DEF("getTime", 0, js_date_getTime ),
+    JS_CFUNC_MAGIC_DEF("getYear", 0, get_date_field, 0x101 ),
+    JS_CFUNC_MAGIC_DEF("getFullYear", 0, get_date_field, 0x01 ),
+    JS_CFUNC_MAGIC_DEF("getUTCFullYear", 0, get_date_field, 0x00 ),
+    JS_CFUNC_MAGIC_DEF("getMonth", 0, get_date_field, 0x11 ),
+    JS_CFUNC_MAGIC_DEF("getUTCMonth", 0, get_date_field, 0x10 ),
+    JS_CFUNC_MAGIC_DEF("getDate", 0, get_date_field, 0x21 ),
+    JS_CFUNC_MAGIC_DEF("getUTCDate", 0, get_date_field, 0x20 ),
+    JS_CFUNC_MAGIC_DEF("getHours", 0, get_date_field, 0x31 ),
+    JS_CFUNC_MAGIC_DEF("getUTCHours", 0, get_date_field, 0x30 ),
+    JS_CFUNC_MAGIC_DEF("getMinutes", 0, get_date_field, 0x41 ),
+    JS_CFUNC_MAGIC_DEF("getUTCMinutes", 0, get_date_field, 0x40 ),
+    JS_CFUNC_MAGIC_DEF("getSeconds", 0, get_date_field, 0x51 ),
+    JS_CFUNC_MAGIC_DEF("getUTCSeconds", 0, get_date_field, 0x50 ),
+    JS_CFUNC_MAGIC_DEF("getMilliseconds", 0, get_date_field, 0x61 ),
+    JS_CFUNC_MAGIC_DEF("getUTCMilliseconds", 0, get_date_field, 0x60 ),
+    JS_CFUNC_MAGIC_DEF("getDay", 0, get_date_field, 0x71 ),
+    JS_CFUNC_MAGIC_DEF("getUTCDay", 0, get_date_field, 0x70 ),
+    JS_CFUNC_DEF("setTime", 1, js_date_setTime ),
+    JS_CFUNC_MAGIC_DEF("setMilliseconds", 1, set_date_field, 0x671 ),
+    JS_CFUNC_MAGIC_DEF("setUTCMilliseconds", 1, set_date_field, 0x670 ),
+    JS_CFUNC_MAGIC_DEF("setSeconds", 2, set_date_field, 0x571 ),
+    JS_CFUNC_MAGIC_DEF("setUTCSeconds", 2, set_date_field, 0x570 ),
+    JS_CFUNC_MAGIC_DEF("setMinutes", 3, set_date_field, 0x471 ),
+    JS_CFUNC_MAGIC_DEF("setUTCMinutes", 3, set_date_field, 0x470 ),
+    JS_CFUNC_MAGIC_DEF("setHours", 4, set_date_field, 0x371 ),
+    JS_CFUNC_MAGIC_DEF("setUTCHours", 4, set_date_field, 0x370 ),
+    JS_CFUNC_MAGIC_DEF("setDate", 1, set_date_field, 0x231 ),
+    JS_CFUNC_MAGIC_DEF("setUTCDate", 1, set_date_field, 0x230 ),
+    JS_CFUNC_MAGIC_DEF("setMonth", 2, set_date_field, 0x131 ),
+    JS_CFUNC_MAGIC_DEF("setUTCMonth", 2, set_date_field, 0x130 ),
+    JS_CFUNC_DEF("setYear", 1, js_date_setYear ),
+    JS_CFUNC_MAGIC_DEF("setFullYear", 3, set_date_field, 0x031 ),
+    JS_CFUNC_MAGIC_DEF("setUTCFullYear", 3, set_date_field, 0x030 ),
+    JS_CFUNC_DEF("toJSON", 1, js_date_toJSON ),
+};
+
+void JS_AddIntrinsicDate(JSContext *ctx)
+{
+    JSValueConst obj;
+
+    /* Date */
+    ctx->class_proto[JS_CLASS_DATE] = JS_NewObject(ctx);
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_DATE], js_date_proto_funcs,
+                               countof(js_date_proto_funcs));
+    obj = JS_NewGlobalCConstructor(ctx, "Date", js_date_constructor, 7,
+                                   ctx->class_proto[JS_CLASS_DATE]);
+    JS_SetPropertyFunctionList(ctx, obj, js_date_funcs, countof(js_date_funcs));
+}
+
+#endif
+
+/* eval */
+
+void JS_AddIntrinsicEval(JSContext *ctx)
+{
+    ctx->eval_internal = __JS_EvalInternal;
+}
+
+#ifdef CONFIG_BIGNUM
+
+static JSValue JS_ToBigIntCtorFree(JSContext *ctx, JSValue val)
+{
+    uint32_t tag;
+    BOOL is_legacy;
+    int ret;
+
+    is_legacy = is_bignum_mode(ctx) ^ 1;
+ redo:
+    tag = JS_VALUE_GET_NORM_TAG(val);
+    switch(tag) {
+    case JS_TAG_INT:
+    case JS_TAG_BOOL:
+        if (is_legacy) {
+            bf_t r_s, *r = &r_s;
+            bf_init(ctx->bf_ctx, r);
+            bf_set_si(r, JS_VALUE_GET_INT(val));
+            val = JS_NewBigInt2(ctx, r, TRUE);
+        } else {
+            val = JS_NewInt32(ctx, JS_VALUE_GET_INT(val));
+        }
+        break;
+    case JS_TAG_BIG_INT:
+        break;
+    case JS_TAG_FLOAT64:
+    case JS_TAG_BIG_FLOAT:
+        {
+            bf_t *a, a_s, r_s, *r = &r_s;
+            BOOL is_float;
+            a = JS_ToBigFloat(ctx, &is_float, &a_s, val);
+            bf_init(ctx->bf_ctx, r);
+            if (!bf_is_finite(a)) {
+                JS_FreeValue(ctx, val);
+                val = JS_ThrowRangeError(ctx, "cannot convert NaN or Infinity to bigint");
+            } else {
+                bf_set(r, a);
+                ret = bf_rint(r, BF_PREC_INF, BF_RNDZ);
+                JS_FreeValue(ctx, val);
+                if (is_legacy && (ret & BF_ST_INEXACT)) {
+                    bf_delete(r);
+                    val = JS_ThrowRangeError(ctx, "cannot convert to bigint: not an integer");
+                } else {
+                    val = JS_NewBigInt2(ctx, r, is_legacy);
+                }
+            }
+            if (a == &a_s)
+                bf_delete(a);
+        }
+        break;
+    case JS_TAG_STRING:
+        val = JS_StringToBigIntErr(ctx, val);
+        if (JS_IsException(val))
+            break;
+        goto redo;
+    case JS_TAG_OBJECT:
+        val = JS_ToPrimitiveFree(ctx, val,
+                                 is_legacy ? HINT_NUMBER : HINT_INTEGER);
+        if (JS_IsException(val))
+            break;
+        goto redo;
+    case JS_TAG_NULL:
+    case JS_TAG_UNDEFINED:
+    default:
+        JS_FreeValue(ctx, val);
+        return JS_ThrowTypeError(ctx, "cannot convert to bigint");
+    }
+    return val;
+}
+
+static JSValue js_bigint_constructor(JSContext *ctx,
+                                     JSValueConst this_val,
+                                     int argc, JSValueConst *argv)
+{
+    return JS_ToBigIntCtorFree(ctx, JS_DupValue(ctx, argv[0]));
+}
+
+static inline BOOL JS_IsBigInt(JSContext *ctx, JSValueConst v)
+{
+    int tag = JS_VALUE_GET_TAG(v);
+    if (tag == JS_TAG_BIG_INT)
+        return TRUE;
+    if (is_bignum_mode(ctx))
+        return tag == JS_TAG_INT;
+    else
+        return FALSE;
+}
+
+static JSValue js_thisBigIntValue(JSContext *ctx, JSValueConst this_val)
+{
+    if (JS_IsBigInt(ctx, this_val))
+        return JS_DupValue(ctx, this_val);
+
+    if (JS_VALUE_GET_TAG(this_val) == JS_TAG_OBJECT) {
+        JSObject *p = JS_VALUE_GET_OBJ(this_val);
+        if (p->class_id == JS_CLASS_BIG_INT) {
+            /* XXX: may relax the check in case the object comes from
+               bignum mode */
+            if (JS_IsBigInt(ctx, p->u.object_data))
+                return JS_DupValue(ctx, p->u.object_data);
+        }
+    }
+    return JS_ThrowTypeError(ctx, "not a bigint");
+}
+
+static JSValue js_bigint_toString(JSContext *ctx, JSValueConst this_val,
+                                  int argc, JSValueConst *argv)
+{
+    JSValue val;
+    int base;
+    JSValue ret;
+
+    val = js_thisBigIntValue(ctx, this_val);
+    if (JS_IsException(val))
+        return val;
+    if (argc == 0 || JS_IsUndefined(argv[0])) {
+        base = 10;
+    } else {
+        if (JS_ToInt32Sat(ctx, &base, argv[0]))
+            goto fail;
+        if (base < 2 || base > 36) {
+            JS_ThrowRangeError(ctx, "radix must be between 2 and 36");
+            goto fail;
+        }
+    }
+    ret = js_ftoa(ctx, val, base, 0, BF_RNDN | BF_FTOA_FORMAT_FREE_MIN);
+    JS_FreeValue(ctx, val);
+    return ret;
+ fail:
+    JS_FreeValue(ctx, val);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_bigint_valueOf(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv)
+{
+    return js_thisBigIntValue(ctx, this_val);
+}
+
+static JSValue js_integer_div(JSContext *ctx,
+                              JSValueConst this_val,
+                              int argc, JSValueConst *argv, int magic)
+{
+    bf_t a_s, b_s, *a, *b, r_s, *r = &r_s, q_s, *q = &q_s;
+    int status;
+
+    b = NULL;
+    a = JS_ToBigInt(ctx, &a_s, argv[0]);
+    if (!a)
+        return JS_EXCEPTION;
+    b = JS_ToBigInt(ctx, &b_s, argv[1]);
+    if (!b) {
+        JS_FreeBigInt(ctx, a, &a_s);
+        return JS_EXCEPTION;
+    }
+    bf_init(ctx->bf_ctx, q);
+    bf_init(ctx->bf_ctx, r);
+    status = bf_divrem(q, r, a, b, BF_PREC_INF, BF_RNDZ, magic & 0xf);
+    JS_FreeBigInt(ctx, a, &a_s);
+    JS_FreeBigInt(ctx, b, &b_s);
+    if (unlikely(status)) {
+        bf_delete(q);
+        bf_delete(r);
+        throw_bf_exception(ctx, status);
+        return JS_EXCEPTION;
+    }
+    if (magic & 0x10) {
+        JSValue ret;
+        /* XXX: handle exceptions */
+        ret = JS_NewArray(ctx);
+        JS_SetPropertyUint32(ctx, ret, 0, JS_NewBigInt(ctx, q));
+        JS_SetPropertyUint32(ctx, ret, 1, JS_NewBigInt(ctx, r));
+        return ret;
+    } else {
+        bf_delete(r);
+        return JS_NewBigInt(ctx, q);
+    }
+}
+
+static JSValue js_integer_sqrt(JSContext *ctx,
+                               JSValueConst this_val,
+                               int argc, JSValueConst *argv, int magic)
+{
+    bf_t a_s, *a, r_s, *r = &r_s, rem_s, *rem = &rem_s;
+    int status;
+
+    a = JS_ToBigInt(ctx, &a_s, argv[0]);
+    if (!a)
+        return JS_EXCEPTION;
+    bf_init(ctx->bf_ctx, r);
+    bf_init(ctx->bf_ctx, rem);
+    status = bf_sqrtrem(r, rem, a);
+    JS_FreeBigInt(ctx, a, &a_s);
+    if (unlikely(status & ~BF_ST_INEXACT)) {
+        bf_delete(r);
+        bf_delete(rem);
+        return throw_bf_exception(ctx, status);
+    }
+    if (magic) {
+        JSValue ret;
+        /* XXX: handle exceptions */
+        ret = JS_NewArray(ctx);
+        JS_SetPropertyUint32(ctx, ret, 0, JS_NewBigInt(ctx, r));
+        JS_SetPropertyUint32(ctx, ret, 1, JS_NewBigInt(ctx, rem));
+        return ret;
+    } else {
+        bf_delete(rem);
+        return JS_NewBigInt(ctx, r);
+    }
+}
+
+static JSValue js_integer_op1(JSContext *ctx,
+                              JSValueConst this_val,
+                              int argc, JSValueConst *argv,
+                              int magic)
+{
+    bf_t a_s, *a;
+    int64_t res;
+
+    a = JS_ToBigInt(ctx, &a_s, argv[0]);
+    if (!a)
+        return JS_EXCEPTION;
+    switch(magic) {
+    case 0: /* floorLog2 */
+        if (a->sign || a->expn <= 0) {
+            res = -1;
+        } else {
+            res = a->expn - 1;
+        }
+        break;
+    case 1: /* ctz */
+        if (bf_is_zero(a)) {
+            res = -1;
+        } else {
+            res = bf_get_exp_min(a);
+        }
+        break;
+    default:
+        abort();
+    }
+    JS_FreeBigInt(ctx, a, &a_s);
+    return JS_NewInt64(ctx, res);
+}
+
+static JSValue js_integer_asUintN(JSContext *ctx,
+                                  JSValueConst this_val,
+                                  int argc, JSValueConst *argv, int asIntN)
+{
+    uint64_t bits;
+    bf_t a_s, *a = &a_s, r_s, *r = &r_s, mask_s, *mask = &mask_s;
+    BOOL is_legacy;
+
+    if (JS_ToIndex(ctx, &bits, argv[0]))
+        return JS_EXCEPTION;
+    a = JS_ToBigInt(ctx, &a_s, argv[1]);
+    if (!a)
+        return JS_EXCEPTION;
+    /* XXX: optimize */
+    bf_init(ctx->bf_ctx, r);
+    bf_init(ctx->bf_ctx, mask);
+    bf_set_ui(mask, 1);
+    bf_mul_2exp(mask, bits, BF_PREC_INF, BF_RNDZ);
+    bf_add_si(mask, mask, -1, BF_PREC_INF, BF_RNDZ);
+    bf_logic_and(r, a, mask);
+    if (asIntN && bits != 0) {
+        bf_set_ui(mask, 1);
+        bf_mul_2exp(mask, bits - 1, BF_PREC_INF, BF_RNDZ);
+        if (bf_cmpu(r, mask) >= 0) {
+            bf_set_ui(mask, 1);
+            bf_mul_2exp(mask, bits, BF_PREC_INF, BF_RNDZ);
+            bf_sub(r, r, mask, BF_PREC_INF, BF_RNDZ);
+        }
+    }
+    bf_delete(mask);
+    JS_FreeBigInt(ctx, a, &a_s);
+    is_legacy = is_bignum_mode(ctx) ^ 1;
+    return JS_NewBigInt2(ctx, r, is_legacy);
+}
+
+static const JSCFunctionListEntry js_integer_funcs[] = {
+    JS_CFUNC_MAGIC_DEF("tdiv", 2, js_integer_div, BF_RNDZ ),
+    JS_CFUNC_MAGIC_DEF("fdiv", 2, js_integer_div, BF_RNDD ),
+    JS_CFUNC_MAGIC_DEF("cdiv", 2, js_integer_div, BF_RNDU ),
+    JS_CFUNC_MAGIC_DEF("ediv", 2, js_integer_div, BF_DIVREM_EUCLIDIAN ),
+    JS_CFUNC_MAGIC_DEF("tdivrem", 2, js_integer_div, BF_RNDZ | 0x10 ),
+    JS_CFUNC_MAGIC_DEF("fdivrem", 2, js_integer_div, BF_RNDD | 0x10 ),
+    JS_CFUNC_MAGIC_DEF("cdivrem", 2, js_integer_div, BF_RNDU | 0x10 ),
+    JS_CFUNC_MAGIC_DEF("edivrem", 2, js_integer_div, BF_DIVREM_EUCLIDIAN | 0x10 ),
+    JS_CFUNC_MAGIC_DEF("sqrt", 1, js_integer_sqrt, 0 ),
+    JS_CFUNC_MAGIC_DEF("sqrtrem", 1, js_integer_sqrt, 1 ),
+    JS_CFUNC_MAGIC_DEF("floorLog2", 1, js_integer_op1, 0 ),
+    JS_CFUNC_MAGIC_DEF("ctz", 1, js_integer_op1, 1 ),
+    JS_CFUNC_MAGIC_DEF("asUintN", 2, js_integer_asUintN, 0 ),
+    JS_CFUNC_MAGIC_DEF("asIntN", 2, js_integer_asUintN, 1 ),
+};
+
+static const JSCFunctionListEntry js_bigint_proto_funcs[] = {
+    JS_CFUNC_DEF("toString", 0, js_bigint_toString ),
+    JS_CFUNC_DEF("valueOf", 0, js_bigint_valueOf ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "BigInt", JS_PROP_CONFIGURABLE ),
+};
+
+static JSValue js_thisBigFloatValue(JSContext *ctx, JSValueConst this_val)
+{
+    if (JS_IsBigFloat(this_val))
+        return JS_DupValue(ctx, this_val);
+
+    if (JS_VALUE_GET_TAG(this_val) == JS_TAG_OBJECT) {
+        JSObject *p = JS_VALUE_GET_OBJ(this_val);
+        if (p->class_id == JS_CLASS_BIG_FLOAT) {
+            if (JS_IsBigFloat(p->u.object_data))
+                return JS_DupValue(ctx, p->u.object_data);
+        }
+    }
+    return JS_ThrowTypeError(ctx, "not a bigfloat");
+}
+
+static JSValue js_bigfloat_toString(JSContext *ctx, JSValueConst this_val,
+                                    int argc, JSValueConst *argv)
+{
+    JSValue val;
+    int base;
+    JSValue ret;
+
+    val = js_thisBigFloatValue(ctx, this_val);
+    if (JS_IsException(val))
+        return val;
+    if (argc == 0 || JS_IsUndefined(argv[0])) {
+        base = 10;
+    } else {
+        if (JS_ToInt32Sat(ctx, &base, argv[0]))
+            goto fail;
+        if (base < 2 || base > 36) {
+            JS_ThrowRangeError(ctx, "radix must be between 2 and 36");
+            goto fail;
+        }
+    }
+    ret = js_ftoa(ctx, val, base, 0, BF_RNDN | BF_FTOA_FORMAT_FREE_MIN);
+    JS_FreeValue(ctx, val);
+    return ret;
+ fail:
+    JS_FreeValue(ctx, val);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_bigfloat_valueOf(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv)
+{
+    return js_thisBigFloatValue(ctx, this_val);
+}
+
+static const JSCFunctionListEntry js_bigfloat_proto_funcs[] = {
+    JS_CFUNC_DEF("toString", 0, js_bigfloat_toString ),
+    JS_CFUNC_DEF("valueOf", 0, js_bigfloat_valueOf ),
+    JS_CFUNC_MAGIC_DEF("toPrecision", 1, js_number_toPrecision, 1 ),
+    JS_CFUNC_MAGIC_DEF("toFixed", 1, js_number_toFixed, 1 ),
+    JS_CFUNC_MAGIC_DEF("toExponential", 1, js_number_toExponential, 1 ),
+};
+
+static JSValue js_bigfloat_constructor(JSContext *ctx,
+                                       JSValueConst this_val,
+                                       int argc, JSValueConst *argv)
+{
+    JSValue val;
+    if (argc == 0) {
+        bf_t r_s, *r = &r_s;
+        bf_init(ctx->bf_ctx, r);
+        bf_set_zero(r, 0);
+        val = JS_NewBigFloat(ctx, r);
+    } else {
+        val = JS_DupValue(ctx, argv[0]);
+    redo:
+        switch(JS_VALUE_GET_NORM_TAG(val)) {
+        case JS_TAG_BIG_FLOAT:
+            break;
+        case JS_TAG_FLOAT64:
+            {
+                bf_t r_s, *r = &r_s;
+                bf_init(ctx->bf_ctx, r);
+                bf_set_float64(r, JS_VALUE_GET_FLOAT64(val));
+                val = JS_NewBigFloat(ctx, r);
+            }
+            break;
+        case JS_TAG_INT:
+            {
+                bf_t r_s, *r = &r_s;
+                bf_init(ctx->bf_ctx, r);
+                bf_set_si(r, JS_VALUE_GET_INT(val));
+                val = JS_NewBigFloat(ctx, r);
+            }
+            break;
+        case JS_TAG_BIG_INT:
+            /* We keep the full precision of the integer */
+            {
+                JSBigFloat *p = JS_VALUE_GET_PTR(val);
+                val = JS_MKPTR(JS_TAG_BIG_FLOAT, p);
+            }
+            break;
+        case JS_TAG_STRING:
+            {
+                const char *str, *p;
+                int err;
+
+                str = JS_ToCString(ctx, val);
+                JS_FreeValue(ctx, val);
+                if (!str)
+                    return JS_EXCEPTION;
+                val = js_atof(ctx, str, &p, 0, BF_ATOF_BIN_OCT |
+                              BF_ATOF_NO_PREFIX_AFTER_SIGN |
+                              BF_ATOF_JS_QUIRKS);
+                p += skip_spaces(p);
+                err = (*p != '\0');
+                JS_FreeCString(ctx, str);
+                if (err) {
+                    JS_FreeValue(ctx, val);
+                    return JS_ThrowSyntaxError(ctx, "invalid bigfloat literal");
+                }
+            }
+            break;
+        case JS_TAG_OBJECT:
+            val = JS_ToPrimitiveFree(ctx, val, HINT_NUMBER);
+            if (JS_IsException(val))
+                break;
+            goto redo;
+        case JS_TAG_NULL:
+        case JS_TAG_UNDEFINED:
+        default:
+            JS_FreeValue(ctx, val);
+            return JS_ThrowTypeError(ctx, "cannot convert to bigfloat");
+        }
+    }
+    return val;
+}
+
+static JSValue js_float_get_const(JSContext *ctx,
+                                  JSValueConst this_val, int magic)
+{
+    bf_t r_s, *r = &r_s;
+    bf_init(ctx->bf_ctx, r);
+    switch(magic) {
+    case 0: /* PI */
+        bf_const_pi(r, ctx->fp_env.prec, ctx->fp_env.flags);
+        break;
+    case 1: /* LN2 */
+        bf_const_log2(r, ctx->fp_env.prec, ctx->fp_env.flags);
+        break;
+    case 2: /* MIN_VALUE */
+    case 3: /* MAX_VALUE */
+        {
+            slimb_t e_range, e;
+            e_range = (limb_t)1 << (bf_get_exp_bits(ctx->fp_env.flags) - 1);
+            bf_set_ui(r, 1);
+            if (magic == 2) {
+                e = -e_range + 2;
+                if (ctx->fp_env.flags & BF_FLAG_SUBNORMAL)
+                    e -= ctx->fp_env.prec - 1;
+                bf_mul_2exp(r, e, ctx->fp_env.prec, ctx->fp_env.flags);
+            } else {
+                bf_mul_2exp(r, ctx->fp_env.prec, ctx->fp_env.prec,
+                            ctx->fp_env.flags);
+                bf_add_si(r, r, -1, ctx->fp_env.prec, ctx->fp_env.flags);
+                bf_mul_2exp(r, e_range - ctx->fp_env.prec, ctx->fp_env.prec,
+                            ctx->fp_env.flags);
+            }
+        }
+        break;
+    case 4: /* EPSILON */
+        bf_set_ui(r, 1);
+        bf_mul_2exp(r, 1 - ctx->fp_env.prec,
+                    ctx->fp_env.prec, ctx->fp_env.flags);
+        break;
+    default:
+        abort();
+    }
+    return JS_NewBigFloat(ctx, r);
+}
+
+static JSValue js_float_parseFloat(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv)
+{
+    bf_t a_s, *a = &a_s;
+    const char *str;
+    JSValue ret;
+    int radix;
+    JSFloatEnv *fe;
+
+    str = JS_ToCString(ctx, argv[0]);
+    if (!str)
+        return JS_EXCEPTION;
+    if (JS_ToInt32(ctx, &radix, argv[1])) {
+    fail:
+        JS_FreeCString(ctx, str);
+        return JS_EXCEPTION;
+    }
+    if (radix != 0 && (radix < 2 || radix > 36)) {
+        JS_ThrowRangeError(ctx, "radix must be between 2 and 36");
+        goto fail;
+    }
+    fe = &ctx->fp_env;
+    if (argc > 2) {
+        fe = JS_GetOpaque2(ctx, argv[2], JS_CLASS_FLOAT_ENV);
+        if (!fe)
+            goto fail;
+    }
+    bf_init(ctx->bf_ctx, a);
+    bf_atof(a, str, NULL, radix, fe->prec, BF_ATOF_JS_QUIRKS | fe->flags);
+    ret = JS_NewBigFloat(ctx, a);
+    JS_FreeCString(ctx, str);
+    return ret;
+}
+
+static const JSCFunctionListEntry js_bigfloat_funcs[] = {
+    JS_CGETSET_MAGIC_DEF("PI", js_float_get_const, NULL, 0 ),
+    JS_CGETSET_MAGIC_DEF("LN2", js_float_get_const, NULL, 1 ),
+    JS_CGETSET_MAGIC_DEF("MIN_VALUE", js_float_get_const, NULL, 2 ),
+    JS_CGETSET_MAGIC_DEF("MAX_VALUE", js_float_get_const, NULL, 3 ),
+    JS_CGETSET_MAGIC_DEF("EPSILON", js_float_get_const, NULL, 4 ),
+    JS_CFUNC_DEF("parseFloat", 1, js_float_parseFloat ),
+    JS_CFUNC_MAGIC_DEF("abs", 1, js_math_fop, MATH_OP_ABS ),
+    JS_CFUNC_MAGIC_DEF("fpRound", 1, js_math_fop, MATH_OP_FPROUND ),
+    JS_CFUNC_MAGIC_DEF("floor", 1, js_math_fop, MATH_OP_FLOOR ),
+    JS_CFUNC_MAGIC_DEF("ceil", 1, js_math_fop, MATH_OP_CEIL ),
+    JS_CFUNC_MAGIC_DEF("round", 1, js_math_fop, MATH_OP_ROUND ),
+    JS_CFUNC_MAGIC_DEF("trunc", 1, js_math_fop, MATH_OP_TRUNC ),
+    JS_CFUNC_MAGIC_DEF("sqrt", 1, js_math_fop, MATH_OP_SQRT ),
+    JS_CFUNC_MAGIC_DEF("acos", 1, js_math_fop, MATH_OP_ACOS ),
+    JS_CFUNC_MAGIC_DEF("asin", 1, js_math_fop, MATH_OP_ASIN ),
+    JS_CFUNC_MAGIC_DEF("atan", 1, js_math_fop, MATH_OP_ATAN ),
+    JS_CFUNC_MAGIC_DEF("atan2", 2, js_math_fop2, MATH_OP_ATAN2 ),
+    JS_CFUNC_MAGIC_DEF("cos", 1, js_math_fop, MATH_OP_COS ),
+    JS_CFUNC_MAGIC_DEF("exp", 1, js_math_fop, MATH_OP_EXP ),
+    JS_CFUNC_MAGIC_DEF("log", 1, js_math_fop, MATH_OP_LOG ),
+    JS_CFUNC_MAGIC_DEF("pow", 2, js_math_fop2, MATH_OP_POW ),
+    JS_CFUNC_MAGIC_DEF("sin", 1, js_math_fop, MATH_OP_SIN ),
+    JS_CFUNC_MAGIC_DEF("tan", 1, js_math_fop, MATH_OP_TAN ),
+    JS_CFUNC_MAGIC_DEF("sign", 1, js_math_fop, MATH_OP_SIGN ),
+    JS_CFUNC_MAGIC_DEF("add", 2, js_math_fop2, MATH_OP_ADD ),
+    JS_CFUNC_MAGIC_DEF("sub", 2, js_math_fop2, MATH_OP_SUB ),
+    JS_CFUNC_MAGIC_DEF("mul", 2, js_math_fop2, MATH_OP_MUL ),
+    JS_CFUNC_MAGIC_DEF("div", 2, js_math_fop2, MATH_OP_DIV ),
+    JS_CFUNC_MAGIC_DEF("fmod", 2, js_math_fop2, MATH_OP_FMOD ),
+    JS_CFUNC_MAGIC_DEF("remainder", 2, js_math_fop2, MATH_OP_REM ),
+};
+
+/* FloatEnv */
+
+static JSValue js_float_env_constructor(JSContext *ctx,
+                                        JSValueConst new_target,
+                                        int argc, JSValueConst *argv)
+{
+    JSValue obj;
+    JSFloatEnv *fe;
+    int64_t prec;
+    int flags, rndmode;
+
+    prec = ctx->fp_env.prec;
+    flags = ctx->fp_env.flags;
+    if (!JS_IsUndefined(argv[0])) {
+        if (JS_ToInt64Sat(ctx, &prec, argv[0]))
+            return JS_EXCEPTION;
+        if (prec < BF_PREC_MIN || prec > BF_PREC_MAX)
+            return JS_ThrowRangeError(ctx, "invalid precision");
+        flags = BF_RNDN; /* RNDN, max exponent size, no subnormal */
+        if (argc > 1 && !JS_IsUndefined(argv[1])) {
+            if (JS_ToInt32Sat(ctx, &rndmode, argv[1]))
+                return JS_EXCEPTION;
+            if (rndmode < BF_RNDN || rndmode > BF_RNDF)
+                return JS_ThrowRangeError(ctx, "invalid rounding mode");
+            flags = rndmode;
+        }
+    }
+
+    obj = JS_NewObjectClass(ctx, JS_CLASS_FLOAT_ENV);
+    if (JS_IsException(obj))
+        return JS_EXCEPTION;
+    fe = js_malloc(ctx, sizeof(*fe));
+    if (!fe)
+        return JS_EXCEPTION;
+    fe->prec = prec;
+    fe->flags = flags;
+    fe->status = 0;
+    JS_SetOpaque(obj, fe);
+    return obj;
+}
+
+static void js_float_env_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSFloatEnv *fe = JS_GetOpaque(val, JS_CLASS_FLOAT_ENV);
+    js_free_rt(rt, fe);
+}
+
+static JSValue js_float_env_get_prec(JSContext *ctx, JSValueConst this_val)
+{
+    return JS_NewInt64(ctx, ctx->fp_env.prec);
+}
+
+static JSValue js_float_env_get_expBits(JSContext *ctx, JSValueConst this_val)
+{
+    return JS_NewInt32(ctx, bf_get_exp_bits(ctx->fp_env.flags));
+}
+
+/* temporary fix for string conversion overflows */
+#define BF_EXP_BITS_MAX1 (BF_EXP_BITS_MAX - 1)
+
+static JSValue js_float_env_setPrec(JSContext *ctx,
+                                    JSValueConst this_val,
+                                    int argc, JSValueConst *argv)
+{
+    JSValueConst func;
+    int exp_bits, flags, saved_flags;
+    JSValue ret;
+    limb_t saved_prec;
+    int64_t prec;
+
+    func = argv[0];
+    if (JS_ToInt64Sat(ctx, &prec, argv[1]))
+        return JS_EXCEPTION;
+    if (prec < BF_PREC_MIN || prec > BF_PREC_MAX)
+        return JS_ThrowRangeError(ctx, "invalid precision");
+    exp_bits = BF_EXP_BITS_MAX1;
+
+    if (argc > 2 && !JS_IsUndefined(argv[2])) {
+        if (JS_ToInt32Sat(ctx, &exp_bits, argv[2]))
+            return JS_EXCEPTION;
+        if (exp_bits < BF_EXP_BITS_MIN || exp_bits > BF_EXP_BITS_MAX1)
+            return JS_ThrowRangeError(ctx, "invalid number of exponent bits");
+    }
+
+    flags = BF_RNDN | bf_set_exp_bits(exp_bits);
+    if (exp_bits != BF_EXP_BITS_MAX1)
+        flags |= BF_FLAG_SUBNORMAL;
+
+    saved_prec = ctx->fp_env.prec;
+    saved_flags = ctx->fp_env.flags;
+
+    ctx->fp_env.prec = prec;
+    ctx->fp_env.flags = flags;
+
+    ret = JS_Call(ctx, func, JS_UNDEFINED, 0, NULL);
+    /* always restore the floating point precision */
+    ctx->fp_env.prec = saved_prec;
+    ctx->fp_env.flags = saved_flags;
+    return ret;
+}
+
+#define FE_PREC      (-1)
+#define FE_EXP       (-2)
+#define FE_RNDMODE   (-3)
+#define FE_SUBNORMAL (-4)
+
+static JSValue js_float_env_proto_get_status(JSContext *ctx, JSValueConst this_val, int magic)
+{
+    JSFloatEnv *fe;
+    fe = JS_GetOpaque2(ctx, this_val, JS_CLASS_FLOAT_ENV);
+    if (!fe)
+        return JS_EXCEPTION;
+    switch(magic) {
+    case FE_PREC:
+        return JS_NewInt64(ctx, fe->prec);
+    case FE_EXP:
+        return JS_NewInt32(ctx, bf_get_exp_bits(fe->flags));
+    case FE_RNDMODE:
+        return JS_NewInt32(ctx, fe->flags & BF_RND_MASK);
+    case FE_SUBNORMAL:
+        return JS_NewBool(ctx, (fe->flags & BF_FLAG_SUBNORMAL) != 0);
+    default:
+        return JS_NewBool(ctx, (fe->status & magic) != 0);
+    }
+}
+
+static JSValue js_float_env_proto_set_status(JSContext *ctx, JSValueConst this_val, JSValue val, int magic)
+{
+    JSFloatEnv *fe;
+    int b;
+    int64_t prec;
+
+    fe = JS_GetOpaque2(ctx, this_val, JS_CLASS_FLOAT_ENV);
+    if (!fe)
+        return JS_EXCEPTION;
+    switch(magic) {
+    case FE_PREC:
+        if (JS_ToInt64Sat(ctx, &prec, val))
+            return JS_EXCEPTION;
+        if (prec < BF_PREC_MIN || prec > BF_PREC_MAX)
+            return JS_ThrowRangeError(ctx, "invalid precision");
+        fe->prec = prec;
+        break;
+    case FE_EXP:
+        if (JS_ToInt32Sat(ctx, &b, val))
+            return JS_EXCEPTION;
+        if (b < BF_EXP_BITS_MIN || b > BF_EXP_BITS_MAX1)
+            return JS_ThrowRangeError(ctx, "invalid number of exponent bits");
+        if (b == BF_EXP_BITS_MAX1)
+            fe->flags &= ~BF_FLAG_SUBNORMAL;
+        fe->flags = (fe->flags & ~(BF_EXP_BITS_MASK << BF_EXP_BITS_SHIFT)) |
+            bf_set_exp_bits(b);
+        break;
+    case FE_RNDMODE:
+        b = get_rnd_mode(ctx, val);
+        if (b < 0)
+            return JS_EXCEPTION;
+        fe->flags = (fe->flags & ~BF_RND_MASK) | b;
+        break;
+    case FE_SUBNORMAL:
+        b = JS_ToBool(ctx, val);
+        if (bf_get_exp_bits(fe->flags) != BF_EXP_BITS_MAX1) {
+            fe->flags = (fe->flags & ~BF_FLAG_SUBNORMAL) | (b ? BF_FLAG_SUBNORMAL: 0);
+        }
+        break;
+    default:
+        b = JS_ToBool(ctx, val);
+        fe->status = (fe->status & ~magic) & ((-b) & magic);
+        break;
+    }
+    return JS_UNDEFINED;
+}
+
+static JSValue js_float_env_clearStatus(JSContext *ctx,
+                                        JSValueConst this_val,
+                                        int argc, JSValueConst *argv)
+{
+    JSFloatEnv *fe = JS_GetOpaque2(ctx, this_val, JS_CLASS_FLOAT_ENV);
+    if (!fe)
+        return JS_EXCEPTION;
+    fe->status = 0;
+    return JS_UNDEFINED;
+}
+
+static const JSCFunctionListEntry js_float_env_funcs[] = {
+    JS_CGETSET_DEF("prec", js_float_env_get_prec, NULL ),
+    JS_CGETSET_DEF("expBits", js_float_env_get_expBits, NULL ),
+    JS_CFUNC_DEF("setPrec", 2, js_float_env_setPrec ),
+    JS_PROP_INT32_DEF("RNDN", BF_RNDN, 0 ),
+    JS_PROP_INT32_DEF("RNDZ", BF_RNDZ, 0 ),
+    JS_PROP_INT32_DEF("RNDU", BF_RNDU, 0 ),
+    JS_PROP_INT32_DEF("RNDD", BF_RNDD, 0 ),
+    JS_PROP_INT32_DEF("RNDNA", BF_RNDNA, 0 ),
+    JS_PROP_INT32_DEF("RNDNU", BF_RNDNU, 0 ),
+    JS_PROP_INT32_DEF("RNDF", BF_RNDF, 0 ),
+    JS_PROP_INT32_DEF("precMin", BF_PREC_MIN, 0 ),
+    JS_PROP_INT64_DEF("precMax", BF_PREC_MAX, 0 ),
+    JS_PROP_INT32_DEF("expBitsMin", BF_EXP_BITS_MIN, 0 ),
+    JS_PROP_INT32_DEF("expBitsMax", BF_EXP_BITS_MAX1, 0 ),
+};
+
+static const JSCFunctionListEntry js_float_env_proto_funcs[] = {
+    JS_CGETSET_MAGIC_DEF("prec", js_float_env_proto_get_status,
+                         js_float_env_proto_set_status, FE_PREC ),
+    JS_CGETSET_MAGIC_DEF("expBits", js_float_env_proto_get_status,
+                         js_float_env_proto_set_status, FE_EXP ),
+    JS_CGETSET_MAGIC_DEF("rndMode", js_float_env_proto_get_status,
+                         js_float_env_proto_set_status, FE_RNDMODE ),
+    JS_CGETSET_MAGIC_DEF("subnormal", js_float_env_proto_get_status,
+                         js_float_env_proto_set_status, FE_SUBNORMAL ),
+    JS_CGETSET_MAGIC_DEF("invalidOperation", js_float_env_proto_get_status,
+                         js_float_env_proto_set_status, BF_ST_INVALID_OP ),
+    JS_CGETSET_MAGIC_DEF("divideByZero", js_float_env_proto_get_status,
+                         js_float_env_proto_set_status, BF_ST_DIVIDE_ZERO ),
+    JS_CGETSET_MAGIC_DEF("overflow", js_float_env_proto_get_status,
+                         js_float_env_proto_set_status, BF_ST_OVERFLOW ),
+    JS_CGETSET_MAGIC_DEF("underflow", js_float_env_proto_get_status,
+                         js_float_env_proto_set_status, BF_ST_UNDERFLOW ),
+    JS_CGETSET_MAGIC_DEF("inexact", js_float_env_proto_get_status,
+                         js_float_env_proto_set_status, BF_ST_INEXACT ),
+    JS_CFUNC_DEF("clearStatus", 0, js_float_env_clearStatus ),
+};
+
+#endif /* CONFIG_BIGNUM */
+
+static const char * const native_error_name[JS_NATIVE_ERROR_COUNT] = {
+    "EvalError", "RangeError", "ReferenceError",
+    "SyntaxError", "TypeError", "URIError",
+    "InternalError",
+};
+
+/* Minimum amount of objects to be able to compile code and display
+   error messages. No JSAtom should be allocated by this function. */
+static void JS_AddIntrinsicBasicObjects(JSContext *ctx)
+{
+    JSValue proto;
+    int i;
+
+    ctx->class_proto[JS_CLASS_OBJECT] = JS_NewObjectProto(ctx, JS_NULL);
+    ctx->function_proto = JS_NewCFunction3(ctx, js_function_proto, "", 0,
+                                           JS_CFUNC_generic, 0,
+                                           ctx->class_proto[JS_CLASS_OBJECT]);
+    ctx->class_proto[JS_CLASS_BYTECODE_FUNCTION] = JS_DupValue(ctx, ctx->function_proto);
+    ctx->class_proto[JS_CLASS_ERROR] = JS_NewObject(ctx);
+#if 0
+    /* these are auto-initialized from js_error_proto_funcs,
+       but delaying might be a problem */
+    JS_DefinePropertyValue(ctx, ctx->class_proto[JS_CLASS_ERROR], JS_ATOM_name,
+                           JS_AtomToString(ctx, JS_ATOM_Error),
+                           JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+    JS_DefinePropertyValue(ctx, ctx->class_proto[JS_CLASS_ERROR], JS_ATOM_message,
+                           JS_AtomToString(ctx, JS_ATOM_empty_string),
+                           JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+#endif
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_ERROR],
+                               js_error_proto_funcs,
+                               countof(js_error_proto_funcs));
+
+    for(i = 0; i < JS_NATIVE_ERROR_COUNT; i++) {
+        proto = JS_NewObjectProto(ctx, ctx->class_proto[JS_CLASS_ERROR]);
+        JS_DefinePropertyValue(ctx, proto, JS_ATOM_name,
+                               JS_NewAtomString(ctx, native_error_name[i]),
+                               JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+        JS_DefinePropertyValue(ctx, proto, JS_ATOM_message,
+                               JS_AtomToString(ctx, JS_ATOM_empty_string),
+                               JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+        ctx->native_error_proto[i] = proto;
+    }
+
+    /* the array prototype is an array */
+    ctx->class_proto[JS_CLASS_ARRAY] =
+        JS_NewObjectProtoClass(ctx, ctx->class_proto[JS_CLASS_OBJECT],
+                               JS_CLASS_ARRAY);
+
+    ctx->array_shape = js_new_shape2(ctx, get_proto_obj(ctx->class_proto[JS_CLASS_ARRAY]),
+                                     JS_PROP_INITIAL_HASH_SIZE, 1);
+    add_shape_property(ctx, &ctx->array_shape, NULL,
+                       JS_ATOM_length, JS_PROP_WRITABLE | JS_PROP_LENGTH);
+
+    assert(ctx->rt->atom_count == JS_ATOM_END);
+}
+
+void JS_AddIntrinsicBaseObjects(JSContext *ctx)
+{
+    int i;
+    JSValueConst obj, number_obj;
+    JSValue obj1;	
+
+    ctx->throw_type_error = JS_NewCFunction(ctx, js_throw_type_error, NULL, 0);
+	
+    /* add caller and arguments properties to throw a TypeError */
+    obj1 = JS_NewCFunction(ctx, js_function_proto_caller, "get caller", 0);
+    JS_DefineProperty(ctx, ctx->function_proto, JS_ATOM_caller, JS_UNDEFINED,
+                      obj1, ctx->throw_type_error,
+                      JS_PROP_HAS_GET | JS_PROP_HAS_SET |
+                      JS_PROP_HAS_CONFIGURABLE | JS_PROP_CONFIGURABLE);
+    JS_FreeValue(ctx, obj1);
+    JS_DefineProperty(ctx, ctx->function_proto, JS_ATOM_arguments, JS_UNDEFINED,
+                      ctx->throw_type_error, ctx->throw_type_error,
+                      JS_PROP_HAS_GET | JS_PROP_HAS_SET |
+                      JS_PROP_HAS_CONFIGURABLE | JS_PROP_CONFIGURABLE);
+    JS_FreeValue(ctx, js_object_seal(ctx, JS_UNDEFINED, 1, (JSValueConst *)&ctx->throw_type_error, 1));
+
+    ctx->global_obj = JS_NewObject(ctx);
+    ctx->global_var_obj = JS_NewObjectProto(ctx, JS_NULL);
+
+    /* Object */
+    obj = JS_NewGlobalCConstructor(ctx, "Object", js_object_constructor, 1,
+                                   ctx->class_proto[JS_CLASS_OBJECT]);
+    JS_SetPropertyFunctionList(ctx, obj, js_object_funcs, countof(js_object_funcs));
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_OBJECT],
+                               js_object_proto_funcs, countof(js_object_proto_funcs));
+
+    /* Function */
+    JS_SetPropertyFunctionList(ctx, ctx->function_proto, js_function_proto_funcs, countof(js_function_proto_funcs));
+    ctx->function_ctor = JS_NewCFunctionMagic(ctx, js_function_constructor,
+                                              "Function", 1, JS_CFUNC_constructor_or_func_magic,
+                                              JS_FUNC_NORMAL);
+    JS_NewGlobalCConstructor2(ctx, JS_DupValue(ctx, ctx->function_ctor), "Function",
+                              ctx->function_proto);
+
+    /* Error */
+    obj1 = JS_NewCFunctionMagic(ctx, js_error_constructor,
+                                "Error", 1, JS_CFUNC_constructor_or_func_magic, -1);
+    JS_NewGlobalCConstructor2(ctx, obj1,
+                              "Error", ctx->class_proto[JS_CLASS_ERROR]);
+
+    for(i = 0; i < JS_NATIVE_ERROR_COUNT; i++) {
+        JSValue func_obj = JS_NewCFunction3(ctx, (JSCFunction *)js_error_constructor,
+                                            native_error_name[i], 1,
+                                            JS_CFUNC_constructor_or_func_magic, i, obj1);
+        JS_NewGlobalCConstructor2(ctx, func_obj, native_error_name[i],
+                                  ctx->native_error_proto[i]);
+    }
+
+    /* Iterator prototype */
+    ctx->iterator_proto = JS_NewObject(ctx);
+    JS_SetPropertyFunctionList(ctx, ctx->iterator_proto,
+                               js_iterator_proto_funcs,
+                               countof(js_iterator_proto_funcs));
+
+    /* Array */
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_ARRAY],
+                               js_array_proto_funcs,
+                               countof(js_array_proto_funcs));
+
+    obj = JS_NewGlobalCConstructor(ctx, "Array", js_array_constructor, 1,
+                                   ctx->class_proto[JS_CLASS_ARRAY]);
+    JS_SetPropertyFunctionList(ctx, obj, js_array_funcs,
+                               countof(js_array_funcs));
+
+    /* XXX: create auto_initializer */
+    {
+        /* initialize Array.prototype[Symbol.unscopables] */
+        char const unscopables[] = "copyWithin" "\0" "entries" "\0" "fill" "\0" "find" "\0"
+            "findIndex" "\0" "includes" "\0" "keys" "\0" "values" "\0";
+        const char *p = unscopables;
+        obj1 = JS_NewObjectProto(ctx, JS_NULL);
+        for(p = unscopables; *p; p += strlen(p) + 1) {
+            JS_DefinePropertyValueStr(ctx, obj1, p, JS_TRUE, JS_PROP_C_W_E);
+        }
+        JS_DefinePropertyValue(ctx, ctx->class_proto[JS_CLASS_ARRAY],
+                               JS_ATOM_Symbol_unscopables, obj1,
+                               JS_PROP_CONFIGURABLE);
+    }
+
+    /* needed to initialize arguments[Symbol.iterator] */
+    ctx->array_proto_values =
+        JS_GetProperty(ctx, ctx->class_proto[JS_CLASS_ARRAY], JS_ATOM_values);
+
+    ctx->class_proto[JS_CLASS_ARRAY_ITERATOR] = JS_NewObjectProto(ctx, ctx->iterator_proto);
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_ARRAY_ITERATOR],
+                               js_array_iterator_proto_funcs,
+                               countof(js_array_iterator_proto_funcs));
+
+    /* Number */
+    ctx->class_proto[JS_CLASS_NUMBER] = JS_NewObjectProtoClass(ctx, ctx->class_proto[JS_CLASS_OBJECT],
+                                                               JS_CLASS_NUMBER);
+    JS_SetObjectData(ctx, ctx->class_proto[JS_CLASS_NUMBER], JS_NewInt32(ctx, 0));
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_NUMBER],
+                               js_number_proto_funcs,
+                               countof(js_number_proto_funcs));
+    number_obj = JS_NewGlobalCConstructor(ctx, "Number", js_number_constructor, 1,
+                                          ctx->class_proto[JS_CLASS_NUMBER]);
+    JS_SetPropertyFunctionList(ctx, number_obj, js_number_funcs, countof(js_number_funcs));
+
+    /* Boolean */
+    ctx->class_proto[JS_CLASS_BOOLEAN] = JS_NewObjectProtoClass(ctx, ctx->class_proto[JS_CLASS_OBJECT],
+                                                                JS_CLASS_BOOLEAN);
+    JS_SetObjectData(ctx, ctx->class_proto[JS_CLASS_BOOLEAN], JS_NewBool(ctx, FALSE));
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_BOOLEAN], js_boolean_proto_funcs,
+                               countof(js_boolean_proto_funcs));
+    JS_NewGlobalCConstructor(ctx, "Boolean", js_boolean_constructor, 1,
+                             ctx->class_proto[JS_CLASS_BOOLEAN]);
+
+    /* String */
+    ctx->class_proto[JS_CLASS_STRING] = JS_NewObjectProtoClass(ctx, ctx->class_proto[JS_CLASS_OBJECT],
+                                                               JS_CLASS_STRING);
+    JS_SetObjectData(ctx, ctx->class_proto[JS_CLASS_STRING], JS_AtomToString(ctx, JS_ATOM_empty_string));
+    obj = JS_NewGlobalCConstructor(ctx, "String", js_string_constructor, 1,
+                                   ctx->class_proto[JS_CLASS_STRING]);
+    JS_SetPropertyFunctionList(ctx, obj, js_string_funcs,
+                               countof(js_string_funcs));
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_STRING], js_string_proto_funcs,
+                               countof(js_string_proto_funcs));
+
+    ctx->class_proto[JS_CLASS_STRING_ITERATOR] = JS_NewObjectProto(ctx, ctx->iterator_proto);
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_STRING_ITERATOR],
+                               js_string_iterator_proto_funcs,
+                               countof(js_string_iterator_proto_funcs));
+
+    /* Math: create as autoinit object */
+    js_random_init(ctx);
+    JS_SetPropertyFunctionList(ctx, ctx->global_obj, js_math_obj, countof(js_math_obj));
+
+    /* ES6 Reflect: create as autoinit object */
+    JS_SetPropertyFunctionList(ctx, ctx->global_obj, js_reflect_obj, countof(js_reflect_obj));
+
+    /* ES6 Symbol */
+    ctx->class_proto[JS_CLASS_SYMBOL] = JS_NewObject(ctx);
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_SYMBOL], js_symbol_proto_funcs,
+                               countof(js_symbol_proto_funcs));
+    obj = JS_NewGlobalCConstructor(ctx, "Symbol", js_symbol_constructor, 0,
+                                   ctx->class_proto[JS_CLASS_SYMBOL]);
+    JS_SetPropertyFunctionList(ctx, obj, js_symbol_funcs,
+                               countof(js_symbol_funcs));
+    for(i = JS_ATOM_Symbol_toPrimitive; i < JS_ATOM_END; i++) {
+        char buf[ATOM_GET_STR_BUF_SIZE];
+        const char *str, *p;
+        str = JS_AtomGetStr(ctx, buf, sizeof(buf), i);
+        /* skip "Symbol." */
+        p = strchr(str, '.');
+        if (p)
+            str = p + 1;
+        JS_DefinePropertyValueStr(ctx, obj, str, JS_AtomToValue(ctx, i), 0);
+    }
+
+    /* ES6 Generator */
+    ctx->class_proto[JS_CLASS_GENERATOR] = JS_NewObjectProto(ctx, ctx->iterator_proto);
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_GENERATOR],
+                               js_generator_proto_funcs,
+                               countof(js_generator_proto_funcs));
+
+    ctx->class_proto[JS_CLASS_GENERATOR_FUNCTION] = JS_NewObjectProto(ctx, ctx->function_proto);
+    obj1 = JS_NewCFunctionMagic(ctx, js_function_constructor,
+                                "GeneratorFunction", 1,
+                                JS_CFUNC_constructor_or_func_magic, JS_FUNC_GENERATOR);
+    JS_SetPropertyFunctionList(ctx,
+                               ctx->class_proto[JS_CLASS_GENERATOR_FUNCTION],
+                               js_generator_function_proto_funcs,
+                               countof(js_generator_function_proto_funcs));
+    JS_SetConstructor2(ctx, ctx->class_proto[JS_CLASS_GENERATOR_FUNCTION],
+                       ctx->class_proto[JS_CLASS_GENERATOR],
+                       JS_PROP_CONFIGURABLE, JS_PROP_CONFIGURABLE);
+    JS_SetConstructor2(ctx, obj1, ctx->class_proto[JS_CLASS_GENERATOR_FUNCTION],
+                       0, JS_PROP_CONFIGURABLE);
+    JS_FreeValue(ctx, obj1);
+
+#ifdef CONFIG_BIGNUM
+    ctx->class_proto[JS_CLASS_BIG_INT] = JS_NewObject(ctx);
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_BIG_INT],
+                               js_bigint_proto_funcs,
+                               countof(js_bigint_proto_funcs));
+    obj1 = JS_NewCFunction(ctx, js_bigint_constructor, "BigInt", 1);
+    JS_NewGlobalCConstructor2(ctx, obj1, "BigInt",
+                              ctx->class_proto[JS_CLASS_BIG_INT]);
+    JS_SetPropertyFunctionList(ctx, obj1, js_integer_funcs,
+                               countof(js_integer_funcs));
+
+    ctx->class_proto[JS_CLASS_BIG_FLOAT] = JS_NewObject(ctx);
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_BIG_FLOAT],
+                               js_bigfloat_proto_funcs,
+                               countof(js_bigfloat_proto_funcs));
+    obj1 = JS_NewCFunction(ctx, js_bigfloat_constructor, "BigFloat", 1);
+    JS_NewGlobalCConstructor2(ctx, obj1, "BigFloat",
+                              ctx->class_proto[JS_CLASS_BIG_FLOAT]);
+    JS_SetPropertyFunctionList(ctx, obj1, js_bigfloat_funcs,
+                               countof(js_bigfloat_funcs));
+
+    ctx->class_proto[JS_CLASS_FLOAT_ENV] = JS_NewObject(ctx);
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_FLOAT_ENV],
+                               js_float_env_proto_funcs,
+                               countof(js_float_env_proto_funcs));
+    obj1 = JS_NewGlobalCConstructorOnly(ctx, "BigFloatEnv",
+                                        js_float_env_constructor, 1,
+                                        ctx->class_proto[JS_CLASS_FLOAT_ENV]);
+    JS_SetPropertyFunctionList(ctx, obj1, js_float_env_funcs,
+                               countof(js_float_env_funcs));
+#endif
+    /* global properties */
+    JS_SetPropertyFunctionList(ctx, ctx->global_obj, js_global_funcs,
+                               countof(js_global_funcs));
+}
+
+/* Typed Arrays */
+
+static uint8_t const typed_array_size_log2[JS_TYPED_ARRAY_COUNT] = {
+    0, 0, 0, 1, 1, 2, 2,
+#ifdef CONFIG_BIGNUM
+    3, 3, /* BigInt64Array, BigUint64Array */
+#endif
+    2, 3
+};
+
+static JSValue js_array_buffer_constructor3(JSContext *ctx,
+                                            JSValueConst new_target,
+                                            uint64_t len, JSClassID class_id,
+                                            uint8_t *buf,
+                                            JSFreeArrayBufferDataFunc *free_func,
+                                            void *opaque, BOOL alloc_flag)
+{
+    JSValue obj;
+    JSArrayBuffer *abuf = NULL;
+
+    obj = js_create_from_ctor(ctx, new_target, class_id);
+    if (JS_IsException(obj))
+        return obj;
+    /* XXX: we are currently limited to 2 GB */
+    if (len > INT32_MAX) {
+        JS_ThrowRangeError(ctx, "invalid array buffer length");
+        goto fail;
+    }
+    abuf = js_malloc(ctx, sizeof(*abuf));
+    if (!abuf)
+        goto fail;
+    abuf->byte_length = len;
+    if (alloc_flag) {
+        /* the allocation must be done after the object creation */
+        abuf->data = js_mallocz(ctx, max_int(len, 1));
+        if (!abuf->data)
+            goto fail;
+    } else {
+        abuf->data = buf;
+    }
+    init_list_head(&abuf->array_list);
+    abuf->detached = FALSE;
+    abuf->shared = (class_id == JS_CLASS_SHARED_ARRAY_BUFFER);
+    abuf->opaque = opaque;
+    abuf->free_func = free_func;
+    if (alloc_flag && buf)
+        memcpy(abuf->data, buf, len);
+    JS_SetOpaque(obj, abuf);
+    return obj;
+ fail:
+    JS_FreeValue(ctx, obj);
+    js_free(ctx, abuf);
+    return JS_EXCEPTION;
+}
+
+static void js_array_buffer_free(JSRuntime *rt, void *opaque, void *ptr)
+{
+    js_free_rt(rt, ptr);
+}
+
+static JSValue js_array_buffer_constructor2(JSContext *ctx,
+                                            JSValueConst new_target,
+                                            uint64_t len, JSClassID class_id)
+{
+    return js_array_buffer_constructor3(ctx, new_target, len, class_id,
+                                        NULL, js_array_buffer_free, NULL,
+                                        TRUE);
+}
+
+static JSValue js_array_buffer_constructor1(JSContext *ctx,
+                                            JSValueConst new_target,
+                                            uint64_t len)
+{
+    return js_array_buffer_constructor2(ctx, new_target, len,
+                                        JS_CLASS_ARRAY_BUFFER);
+}
+
+JSValue JS_NewArrayBuffer(JSContext *ctx, uint8_t *buf, size_t len,
+                          JSFreeArrayBufferDataFunc *free_func, void *opaque,
+                          BOOL is_shared)
+{
+    return js_array_buffer_constructor3(ctx, JS_UNDEFINED, len,
+                                        is_shared ? JS_CLASS_SHARED_ARRAY_BUFFER : JS_CLASS_ARRAY_BUFFER,
+                                        buf, free_func, opaque, FALSE);
+}
+
+/* create a new ArrayBuffer of length 'len' and copy 'buf' to it */
+JSValue JS_NewArrayBufferCopy(JSContext *ctx, const uint8_t *buf, size_t len)
+{
+    return js_array_buffer_constructor3(ctx, JS_UNDEFINED, len,
+                                        JS_CLASS_ARRAY_BUFFER,
+                                        (uint8_t *)buf,
+                                        js_array_buffer_free, NULL,
+                                        TRUE);
+}
+
+static JSValue js_array_buffer_constructor(JSContext *ctx,
+                                           JSValueConst new_target,
+                                           int argc, JSValueConst *argv)
+{
+    uint64_t len;
+    if (JS_ToIndex(ctx, &len, argv[0]))
+        return JS_EXCEPTION;
+    return js_array_buffer_constructor1(ctx, new_target, len);
+}
+
+static JSValue js_shared_array_buffer_constructor(JSContext *ctx,
+                                                  JSValueConst new_target,
+                                                  int argc, JSValueConst *argv)
+{
+    uint64_t len;
+    if (JS_ToIndex(ctx, &len, argv[0]))
+        return JS_EXCEPTION;
+    return js_array_buffer_constructor2(ctx, new_target, len,
+                                        JS_CLASS_SHARED_ARRAY_BUFFER);
+}
+
+/* also used for SharedArrayBuffer */
+static void js_array_buffer_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    JSArrayBuffer *abuf = p->u.array_buffer;
+    if (abuf) {
+        /* During the GC sweep phase the ArrayBuffer finalizer may be
+           called before the typed array finalizers using it, so
+           abuf->array_list is not necessarily empty. */
+        if (!JS_IsInGCSweep(rt)) {
+            assert(list_empty(&abuf->array_list));
+        }
+        if (abuf->free_func)
+            abuf->free_func(rt, abuf->opaque, abuf->data);
+        js_free_rt(rt, abuf);
+    }
+}
+
+static JSValue js_array_buffer_isView(JSContext *ctx,
+                                      JSValueConst this_val,
+                                      int argc, JSValueConst *argv)
+{
+    JSObject *p;
+    BOOL res;
+    res = FALSE;
+    if (JS_VALUE_GET_TAG(argv[0]) == JS_TAG_OBJECT) {
+        p = JS_VALUE_GET_OBJ(argv[0]);
+        if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+            p->class_id <= JS_CLASS_DATAVIEW) {
+            res = TRUE;
+        }
+    }
+    return JS_NewBool(ctx, res);
+}
+
+static const JSCFunctionListEntry js_array_buffer_funcs[] = {
+    JS_CFUNC_DEF("isView", 1, js_array_buffer_isView ),
+    JS_CGETSET_DEF("[Symbol.species]", js_get_this, NULL ),
+};
+
+static JSValue JS_ThrowTypeErrorDetachedArrayBuffer(JSContext *ctx)
+{
+    return JS_ThrowTypeError(ctx, "ArrayBuffer is detached");
+}
+
+static JSValue js_array_buffer_get_byteLength(JSContext *ctx,
+                                              JSValueConst this_val,
+                                              int class_id)
+{
+    JSArrayBuffer *abuf = JS_GetOpaque2(ctx, this_val, class_id);
+    if (!abuf)
+        return JS_EXCEPTION;
+    if (abuf->detached)
+        return JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+    return JS_NewUint32(ctx, abuf->byte_length);
+}
+
+void JS_DetachArrayBuffer(JSContext *ctx, JSValueConst obj)
+{
+    JSArrayBuffer *abuf = JS_GetOpaque(obj, JS_CLASS_ARRAY_BUFFER);
+    struct list_head *el;
+
+    if (!abuf || abuf->detached)
+        return;
+    if (abuf->free_func)
+        abuf->free_func(ctx->rt, abuf->opaque, abuf->data);
+    abuf->data = NULL;
+    abuf->byte_length = 0;
+    abuf->detached = TRUE;
+
+    list_for_each(el, &abuf->array_list) {
+        JSTypedArray *ta;
+        JSObject *p;
+
+        ta = list_entry(el, JSTypedArray, link);
+        p = ta->obj;
+        /* Note: the typed array length and offset fields are not modified */
+        if (p->class_id != JS_CLASS_DATAVIEW) {
+            p->u.array.count = 0;
+            p->u.array.u.ptr = NULL;
+        }
+    }
+}
+
+/* get an ArrayBuffer or SharedArrayBuffer */
+static JSArrayBuffer *js_get_array_buffer(JSContext *ctx, JSValueConst obj)
+{
+    JSObject *p;
+    if (JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT)
+        goto fail;
+    p = JS_VALUE_GET_OBJ(obj);
+    if (p->class_id != JS_CLASS_ARRAY_BUFFER &&
+        p->class_id != JS_CLASS_SHARED_ARRAY_BUFFER) {
+    fail:
+        JS_ThrowTypeErrorInvalidClass(ctx, JS_CLASS_ARRAY_BUFFER);
+        return NULL;
+    }
+    return p->u.array_buffer;
+}
+
+/* return NULL if exception. WARNING: any JS call can detach the
+   buffer and render the returned pointer invalid */
+uint8_t *JS_GetArrayBuffer(JSContext *ctx, size_t *psize, JSValueConst obj)
+{
+    JSArrayBuffer *abuf = js_get_array_buffer(ctx, obj);
+    if (!abuf)
+        goto fail;
+    if (abuf->detached) {
+        JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+        goto fail;
+    }
+    *psize = abuf->byte_length;
+    return abuf->data;
+ fail:
+    *psize = 0;
+    return NULL;
+}
+
+static JSValue js_array_buffer_slice(JSContext *ctx,
+                                     JSValueConst this_val,
+                                     int argc, JSValueConst *argv, int class_id)
+{
+    JSArrayBuffer *abuf, *new_abuf;
+    int64_t len, start, end, new_len;
+    JSValue ctor, new_obj;
+
+    abuf = JS_GetOpaque2(ctx, this_val, class_id);
+    if (!abuf)
+        return JS_EXCEPTION;
+    if (abuf->detached)
+        return JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+    len = abuf->byte_length;
+
+    if (JS_ToInt64Clamp(ctx, &start, argv[0], 0, len, len))
+        return JS_EXCEPTION;
+
+    end = len;
+    if (!JS_IsUndefined(argv[1])) {
+        if (JS_ToInt64Clamp(ctx, &end, argv[1], 0, len, len))
+            return JS_EXCEPTION;
+    }
+    new_len = max_int64(end - start, 0);
+    ctor = JS_SpeciesConstructor(ctx, this_val, JS_UNDEFINED);
+    if (JS_IsException(ctor))
+        return ctor;
+    if (JS_IsUndefined(ctor)) {
+        new_obj = js_array_buffer_constructor2(ctx, JS_UNDEFINED, new_len,
+                                               class_id);
+    } else {
+        JSValue args[1];
+        args[0] = JS_NewInt64(ctx, new_len);
+        new_obj = JS_CallConstructor(ctx, ctor, 1, (JSValueConst *)args);
+        JS_FreeValue(ctx, ctor);
+        JS_FreeValue(ctx, args[0]);
+    }
+    if (JS_IsException(new_obj))
+        return new_obj;
+    new_abuf = JS_GetOpaque2(ctx, new_obj, class_id);
+    if (!new_abuf)
+        goto fail;
+    if (js_same_value(ctx, new_obj, this_val)) {
+        JS_ThrowTypeError(ctx, "cannot use identical ArrayBuffer");
+        goto fail;
+    }
+    if (new_abuf->detached) {
+        JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+        goto fail;
+    }
+    if (new_abuf->byte_length < new_len) {
+        JS_ThrowTypeError(ctx, "new ArrayBuffer is too small");
+        goto fail;
+    }
+    /* must test again because of side effects */
+    if (abuf->detached) {
+        JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+        goto fail;
+    }
+    memcpy(new_abuf->data, abuf->data + start, new_len);
+    return new_obj;
+ fail:
+    JS_FreeValue(ctx, new_obj);
+    return JS_EXCEPTION;
+}
+
+static const JSCFunctionListEntry js_array_buffer_proto_funcs[] = {
+    JS_CGETSET_MAGIC_DEF("byteLength", js_array_buffer_get_byteLength, NULL, JS_CLASS_ARRAY_BUFFER ),
+    JS_CFUNC_MAGIC_DEF("slice", 2, js_array_buffer_slice, JS_CLASS_ARRAY_BUFFER ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "ArrayBuffer", JS_PROP_CONFIGURABLE ),
+};
+
+/* SharedArrayBuffer */
+
+static const JSCFunctionListEntry js_shared_array_buffer_funcs[] = {
+    JS_CGETSET_DEF("[Symbol.species]", js_get_this, NULL ),
+};
+
+static const JSCFunctionListEntry js_shared_array_buffer_proto_funcs[] = {
+    JS_CGETSET_MAGIC_DEF("byteLength", js_array_buffer_get_byteLength, NULL, JS_CLASS_SHARED_ARRAY_BUFFER ),
+    JS_CFUNC_MAGIC_DEF("slice", 2, js_array_buffer_slice, JS_CLASS_SHARED_ARRAY_BUFFER ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "SharedArrayBuffer", JS_PROP_CONFIGURABLE ),
+};
+
+static JSObject *get_typed_array(JSContext *ctx,
+                                 JSValueConst this_val,
+                                 int is_dataview)
+{
+    JSObject *p;
+    if (JS_VALUE_GET_TAG(this_val) != JS_TAG_OBJECT)
+        goto fail;
+    p = JS_VALUE_GET_OBJ(this_val);
+    if (is_dataview) {
+        if (p->class_id != JS_CLASS_DATAVIEW)
+            goto fail;
+    } else {
+        if (!(p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+              p->class_id <= JS_CLASS_FLOAT64_ARRAY)) {
+        fail:
+            JS_ThrowTypeError(ctx, "not a %s", is_dataview ? "DataView" : "TypedArray");
+            return NULL;
+        }
+    }
+    return p;
+}
+
+/* WARNING: 'p' must be a typed array */
+static BOOL typed_array_is_detached(JSContext *ctx, JSObject *p)
+{
+    JSTypedArray *ta = p->u.typed_array;
+    JSArrayBuffer *abuf = ta->buffer->u.array_buffer;
+    /* XXX: could simplify test by ensuring that
+       p->u.array.u.ptr is NULL iff it is detached */
+    return abuf->detached;
+}
+
+/* WARNING: 'p' must be a typed array. Works even if the array buffer
+   is detached */
+static uint32_t typed_array_get_length(JSContext *ctx, JSObject *p)
+{
+    JSTypedArray *ta = p->u.typed_array;
+    int size_log2 = typed_array_size_log2(p->class_id);
+    return ta->length >> size_log2;
+}
+
+static int validate_typed_array(JSContext *ctx, JSValueConst this_val)
+{
+    JSObject *p;
+    p = get_typed_array(ctx, this_val, 0);
+    if (!p)
+        return -1;
+    if (typed_array_is_detached(ctx, p)) {
+        JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+        return -1;
+    }
+    return 0;
+}
+
+static JSValue js_typed_array_get_length(JSContext *ctx,
+                                         JSValueConst this_val)
+{
+    JSObject *p;
+    p = get_typed_array(ctx, this_val, 0);
+    if (!p)
+        return JS_EXCEPTION;
+    return JS_NewInt32(ctx, p->u.array.count);
+}
+
+static JSValue js_typed_array_get_buffer(JSContext *ctx,
+                                         JSValueConst this_val, int is_dataview)
+{
+    JSObject *p;
+    JSTypedArray *ta;
+    p = get_typed_array(ctx, this_val, is_dataview);
+    if (!p)
+        return JS_EXCEPTION;
+    ta = p->u.typed_array;
+    return JS_DupValue(ctx, JS_MKPTR(JS_TAG_OBJECT, ta->buffer));
+}
+
+static JSValue js_typed_array_get_byteLength(JSContext *ctx,
+                                             JSValueConst this_val,
+                                             int is_dataview)
+{
+    JSObject *p;
+    JSTypedArray *ta;
+    p = get_typed_array(ctx, this_val, is_dataview);
+    if (!p)
+        return JS_EXCEPTION;
+    if (typed_array_is_detached(ctx, p)) {
+        if (is_dataview) {
+            return JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+        } else {
+            return JS_NewInt32(ctx, 0);
+        }
+    }
+    ta = p->u.typed_array;
+    return JS_NewInt32(ctx, ta->length);
+}
+
+static JSValue js_typed_array_get_byteOffset(JSContext *ctx,
+                                             JSValueConst this_val,
+                                             int is_dataview)
+{
+    JSObject *p;
+    JSTypedArray *ta;
+    p = get_typed_array(ctx, this_val, is_dataview);
+    if (!p)
+        return JS_EXCEPTION;
+    if (typed_array_is_detached(ctx, p)) {
+        if (is_dataview) {
+            return JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+        } else {
+            return JS_NewInt32(ctx, 0);
+        }
+    }
+    ta = p->u.typed_array;
+    return JS_NewInt32(ctx, ta->offset);
+}
+
+static JSValue js_typed_array_get_toStringTag(JSContext *ctx,
+                                              JSValueConst this_val)
+{
+    JSObject *p;
+    if (JS_VALUE_GET_TAG(this_val) != JS_TAG_OBJECT)
+        return JS_UNDEFINED;
+    p = JS_VALUE_GET_OBJ(this_val);
+    if (!(p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+          p->class_id <= JS_CLASS_FLOAT64_ARRAY))
+        return JS_UNDEFINED;
+    return JS_AtomToString(ctx, ctx->rt->class_array[p->class_id].class_name);
+}
+
+static JSValue js_typed_array_set_internal(JSContext *ctx,
+                                           JSValueConst dst,
+                                           JSValueConst src,
+                                           JSValueConst off)
+{
+    JSObject *p;
+    JSObject *src_p;
+    uint32_t i;
+    int64_t src_len, offset;
+    JSValue val, src_obj = JS_UNDEFINED;
+
+    p = get_typed_array(ctx, dst, 0);
+    if (!p)
+        goto fail;
+    if (JS_ToInt64Sat(ctx, &offset, off))
+        goto fail;
+    if (offset < 0)
+        goto range_error;
+    if (typed_array_is_detached(ctx, p)) {
+    detached:
+        JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+        goto fail;
+    }
+    src_obj = JS_ToObject(ctx, src);
+    if (JS_IsException(src_obj))
+        goto fail;
+    src_p = JS_VALUE_GET_OBJ(src_obj);
+    if (src_p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+        src_p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+        JSTypedArray *dest_ta = p->u.typed_array;
+        JSArrayBuffer *dest_abuf = dest_ta->buffer->u.array_buffer;
+        JSTypedArray *src_ta = src_p->u.typed_array;
+        JSArrayBuffer *src_abuf = src_ta->buffer->u.array_buffer;
+        int shift = typed_array_size_log2(p->class_id);
+
+        if (src_abuf->detached)
+            goto detached;
+
+        src_len = src_p->u.array.count;
+        if (offset > (int64_t)(p->u.array.count - src_len))
+            goto range_error;
+
+        /* copying between typed objects */
+        if (src_p->class_id == p->class_id) {
+            /* same type, use memmove */
+            memmove(dest_abuf->data + dest_ta->offset + (offset << shift),
+                    src_abuf->data + src_ta->offset, src_len << shift);
+            goto done;
+        }
+        if (dest_abuf->data == src_abuf->data) {
+            /* copying between the same buffer using different types of mappings
+               would require a temporary buffer */
+        }
+        /* otherwise, default behavior is slow but correct */
+    } else {
+        if (js_get_length64(ctx, &src_len, src_obj))
+            goto fail;
+        if (offset > (int64_t)(p->u.array.count - src_len)) {
+        range_error:
+            JS_ThrowRangeError(ctx, "invalid array length");
+            goto fail;
+        }
+    }
+    for(i = 0; i < src_len; i++) {
+        val = JS_GetPropertyUint32(ctx, src_obj, i);
+        if (JS_IsException(val))
+            goto fail;
+        if (JS_SetPropertyUint32(ctx, dst, offset + i, val) < 0)
+            goto fail;
+    }
+done:
+    JS_FreeValue(ctx, src_obj);
+    return JS_UNDEFINED;
+fail:
+    JS_FreeValue(ctx, src_obj);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_typed_array_set(JSContext *ctx,
+                                  JSValueConst this_val,
+                                  int argc, JSValueConst *argv)
+{
+    JSValueConst offset = JS_UNDEFINED;
+    if (argc > 1) {
+        offset = argv[1];
+    }
+    return js_typed_array_set_internal(ctx, this_val, argv[0], offset);
+}
+
+static JSValue js_create_typed_array_iterator(JSContext *ctx, JSValueConst this_val,
+                                              int argc, JSValueConst *argv, int magic)
+{
+    if (validate_typed_array(ctx, this_val))
+        return JS_EXCEPTION;
+    return js_create_array_iterator(ctx, this_val, argc, argv, magic);
+}
+
+/* return < 0 if exception */
+static int js_typed_array_get_length_internal(JSContext *ctx,
+                                              JSValueConst obj)
+{
+    JSObject *p;
+    p = get_typed_array(ctx, obj, 0);
+    if (!p)
+        return -1;
+    if (typed_array_is_detached(ctx, p)) {
+        JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+        return -1;
+    }
+    return p->u.array.count;
+}
+
+#if 0
+/* validate a typed array and return its length */
+static JSValue js_typed_array___getLength(JSContext *ctx,
+                                          JSValueConst this_val,
+                                          int argc, JSValueConst *argv)
+{
+    BOOL ignore_detached = JS_ToBool(ctx, argv[1]);
+
+    if (ignore_detached) {
+        return js_typed_array_get_length(ctx, argv[0]);
+    } else {
+        int len;
+        len = js_typed_array_get_length_internal(ctx, argv[0]);
+        if (len < 0)
+            return JS_EXCEPTION;
+        return JS_NewInt32(ctx, len);
+    }
+}
+#endif
+
+static JSValue js_typed_array_constructor(JSContext *ctx,
+                                          JSValueConst this_val,
+                                          int argc, JSValueConst *argv,
+                                          int classid);
+
+static JSValue js_typed_array_create(JSContext *ctx, JSValueConst ctor,
+                                     int argc, JSValueConst *argv)
+{
+    JSValue ret;
+    int new_len;
+    int64_t len;
+
+    ret = JS_CallConstructor(ctx, ctor, argc, argv);
+    if (JS_IsException(ret))
+        return ret;
+    /* validate the typed array */
+    new_len = js_typed_array_get_length_internal(ctx, ret);
+    if (new_len < 0)
+        goto fail;
+    if (argc == 1) {
+        /* ensure that it is large enough */
+        if (JS_ToLengthFree(ctx, &len, JS_DupValue(ctx, argv[0])))
+            goto fail;
+        if (new_len < len) {
+            JS_ThrowTypeError(ctx, "TypedArray length is too small");
+        fail:
+            JS_FreeValue(ctx, ret);
+            return JS_EXCEPTION;
+        }
+    }
+    return ret;
+}
+
+#if 0
+static JSValue js_typed_array___create(JSContext *ctx,
+                                       JSValueConst this_val,
+                                       int argc, JSValueConst *argv)
+{
+    return js_typed_array_create(ctx, argv[0], max_int(argc - 1, 0), argv + 1);
+}
+#endif
+
+static JSValue js_typed_array___speciesCreate(JSContext *ctx,
+                                              JSValueConst this_val,
+                                              int argc, JSValueConst *argv)
+{
+    JSValueConst obj;
+    JSObject *p;
+    JSValue ctor, ret;
+    int argc1;
+
+    obj = argv[0];
+    p = get_typed_array(ctx, obj, 0);
+    if (!p)
+        return JS_EXCEPTION;
+    ctor = JS_SpeciesConstructor(ctx, obj, JS_UNDEFINED);
+    if (JS_IsException(ctor))
+        return ctor;
+    argc1 = max_int(argc - 1, 0);
+    if (JS_IsUndefined(ctor)) {
+        ret = js_typed_array_constructor(ctx, JS_UNDEFINED, argc1, argv + 1,
+                                         p->class_id);
+    } else {
+        ret = js_typed_array_create(ctx, ctor, argc1, argv + 1);
+        JS_FreeValue(ctx, ctor);
+    }
+    return ret;
+}
+
+static JSValue js_typed_array_from(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv)
+{
+    // from(items, mapfn = void 0, this_arg = void 0)
+    JSValueConst items = argv[0], mapfn, this_arg;
+    JSValueConst args[2];
+    JSValue stack[2];
+    JSValue iter, arr, r, v, v2;
+    int64_t k, len;
+    int done, mapping;
+
+    mapping = FALSE;
+    mapfn = JS_UNDEFINED;
+    this_arg = JS_UNDEFINED;
+    r = JS_UNDEFINED;
+    arr = JS_UNDEFINED;
+    stack[0] = JS_UNDEFINED;
+    stack[1] = JS_UNDEFINED;
+
+    if (argc > 1) {
+        mapfn = argv[1];
+        if (!JS_IsUndefined(mapfn)) {
+            if (check_function(ctx, mapfn))
+                goto exception;
+            mapping = 1;
+            if (argc > 2)
+                this_arg = argv[2];
+        }
+    }
+    iter = JS_GetProperty(ctx, items, JS_ATOM_Symbol_iterator);
+    if (JS_IsException(iter))
+        goto exception;
+    if (!JS_IsUndefined(iter)) {
+        JS_FreeValue(ctx, iter);
+        arr = JS_NewArray(ctx);
+        if (JS_IsException(arr))
+            goto exception;
+        stack[0] = JS_DupValue(ctx, items);
+        if (js_for_of_start(ctx, &stack[1], FALSE))
+            goto exception;
+        for (k = 0;; k++) {
+            v = JS_IteratorNext(ctx, stack[0], stack[1], 0, NULL, &done);
+            if (JS_IsException(v))
+                goto exception_close;
+            if (done)
+                break;
+            if (JS_DefinePropertyValueInt64(ctx, arr, k, v, JS_PROP_C_W_E | JS_PROP_THROW) < 0)
+                goto exception_close;
+        }
+    } else {
+        arr = JS_ToObject(ctx, items);
+        if (JS_IsException(arr))
+            goto exception;
+    }
+    if (js_get_length64(ctx, &len, arr) < 0)
+        goto exception;
+    v = JS_NewInt64(ctx, len);
+    args[0] = v;
+    r = js_typed_array_create(ctx, this_val, 1, args);
+    JS_FreeValue(ctx, v);
+    if (JS_IsException(r))
+        goto exception;
+    for(k = 0; k < len; k++) {
+        v = JS_GetPropertyInt64(ctx, arr, k);
+        if (JS_IsException(v))
+            goto exception;
+        if (mapping) {
+            args[0] = v;
+            args[1] = JS_NewInt32(ctx, k);
+            v2 = JS_Call(ctx, mapfn, this_arg, 2, args);
+            JS_FreeValue(ctx, v);
+            v = v2;
+            if (JS_IsException(v))
+                goto exception;
+        }
+        if (JS_SetPropertyInt64(ctx, r, k, v) < 0)
+            goto exception;
+    }
+    goto done;
+
+ exception_close:
+    if (!JS_IsUndefined(stack[0]))
+        JS_IteratorClose(ctx, stack[0], TRUE);
+ exception:
+    JS_FreeValue(ctx, r);
+    r = JS_EXCEPTION;
+ done:
+    JS_FreeValue(ctx, arr);
+    JS_FreeValue(ctx, stack[0]);
+    JS_FreeValue(ctx, stack[1]);
+    return r;
+}
+
+static JSValue js_typed_array_of(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv)
+{
+    JSValue obj;
+    JSValueConst args[1];
+    int i;
+
+    args[0] = JS_NewInt32(ctx, argc);
+    obj = js_typed_array_create(ctx, this_val, 1, args);
+    if (JS_IsException(obj))
+        return obj;
+
+    for(i = 0; i < argc; i++) {
+        if (JS_SetPropertyUint32(ctx, obj, i, JS_DupValue(ctx, argv[i])) < 0) {
+            JS_FreeValue(ctx, obj);
+            return JS_EXCEPTION;
+        }
+    }
+    return obj;
+}
+
+static JSValue js_typed_array_copyWithin(JSContext *ctx, JSValueConst this_val,
+                                         int argc, JSValueConst *argv)
+{
+    JSObject *p;
+    int len, to, from, final, count, shift;
+
+    len = js_typed_array_get_length_internal(ctx, this_val);
+    if (len < 0)
+        return JS_EXCEPTION;
+
+    if (JS_ToInt32Clamp(ctx, &to, argv[0], 0, len, len))
+        return JS_EXCEPTION;
+
+    if (JS_ToInt32Clamp(ctx, &from, argv[1], 0, len, len))
+        return JS_EXCEPTION;
+
+    final = len;
+    if (argc > 2 && !JS_IsUndefined(argv[2])) {
+        if (JS_ToInt32Clamp(ctx, &final, argv[2], 0, len, len))
+            return JS_EXCEPTION;
+    }
+
+    count = min_int(final - from, len - to);
+    if (count > 0) {
+        p = JS_VALUE_GET_OBJ(this_val);
+        shift = typed_array_size_log2(p->class_id);
+        memmove(p->u.array.u.uint8_ptr + (to << shift),
+                p->u.array.u.uint8_ptr + (from << shift),
+                count << shift);
+    }
+    return JS_DupValue(ctx, this_val);
+}
+
+static JSValue js_typed_array_fill(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv)
+{
+    JSObject *p;
+    int len, k, final, shift;
+    uint64_t v64;
+
+    len = js_typed_array_get_length_internal(ctx, this_val);
+    if (len < 0)
+        return JS_EXCEPTION;
+    p = JS_VALUE_GET_OBJ(this_val);
+
+    if (p->class_id == JS_CLASS_UINT8C_ARRAY) {
+        int32_t v;
+        if (JS_ToUint8ClampFree(ctx, &v, JS_DupValue(ctx, argv[0])))
+            return JS_EXCEPTION;
+        v64 = v;
+    } else if (p->class_id <= JS_CLASS_UINT32_ARRAY) {
+        uint32_t v;
+        if (JS_ToUint32(ctx, &v, argv[0]))
+            return JS_EXCEPTION;
+        v64 = v;
+    } else
+#ifdef CONFIG_BIGNUM
+    if (p->class_id <= JS_CLASS_BIG_UINT64_ARRAY) {
+        if (JS_ToBigInt64(ctx, (int64_t *)&v64, argv[0]))
+            return JS_EXCEPTION;
+    } else
+#endif
+    {
+        double d;
+        if (JS_ToFloat64(ctx, &d, argv[0]))
+            return JS_EXCEPTION;
+        if (p->class_id == JS_CLASS_FLOAT32_ARRAY) {
+            union {
+                float f;
+                uint32_t u32;
+            } u;
+            u.f = d;
+            v64 = u.u32;
+        } else {
+            JSFloat64Union u;
+            u.d = d;
+            v64 = u.u64;
+        }
+    }
+
+    k = 0;
+    if (argc > 1) {
+        if (JS_ToInt32Clamp(ctx, &k, argv[1], 0, len, len))
+            return JS_EXCEPTION;
+    }
+
+    final = len;
+    if (argc > 2 && !JS_IsUndefined(argv[2])) {
+        if (JS_ToInt32Clamp(ctx, &final, argv[2], 0, len, len))
+            return JS_EXCEPTION;
+    }
+
+    shift = typed_array_size_log2(p->class_id);
+    switch(shift) {
+    case 0:
+        if (k < final) {
+            memset(p->u.array.u.uint8_ptr + k, v64, final - k);
+        }
+        break;
+    case 1:
+        for(; k < final; k++) {
+            p->u.array.u.uint16_ptr[k] = v64;
+        }
+        break;
+    case 2:
+        for(; k < final; k++) {
+            p->u.array.u.uint32_ptr[k] = v64;
+        }
+        break;
+    case 3:
+        for(; k < final; k++) {
+            p->u.array.u.uint64_ptr[k] = v64;
+        }
+        break;
+    default:
+        abort();
+    }
+    return JS_DupValue(ctx, this_val);
+}
+
+static JSValue js_typed_array_find(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv, int findIndex)
+{
+    JSValueConst func, this_arg;
+    JSValueConst args[3];
+    JSValue val, index_val, res;
+    int len, k;
+
+    val = JS_UNDEFINED;
+    len = js_typed_array_get_length_internal(ctx, this_val);
+    if (len < 0)
+        goto exception;
+
+    func = argv[0];
+    if (check_function(ctx, func))
+        goto exception;
+
+    this_arg = JS_UNDEFINED;
+    if (argc > 1)
+        this_arg = argv[1];
+
+    for(k = 0; k < len; k++) {
+        index_val = JS_NewInt32(ctx, k);
+        val = JS_GetPropertyValue(ctx, this_val, index_val);
+        if (JS_IsException(val))
+            goto exception;
+        args[0] = val;
+        args[1] = index_val;
+        args[2] = this_val;
+        res = JS_Call(ctx, func, this_arg, 3, args);
+        if (JS_IsException(res))
+            goto exception;
+        if (JS_ToBoolFree(ctx, res)) {
+            if (findIndex) {
+                JS_FreeValue(ctx, val);
+                return index_val;
+            } else {
+                return val;
+            }
+        }
+        JS_FreeValue(ctx, val);
+    }
+    if (findIndex)
+        return JS_NewInt32(ctx, -1);
+    else
+        return JS_UNDEFINED;
+
+exception:
+    JS_FreeValue(ctx, val);
+    return JS_EXCEPTION;
+}
+
+#define special_indexOf 0
+#define special_lastIndexOf 1
+#define special_includes -1
+
+static JSValue js_typed_array_indexOf(JSContext *ctx, JSValueConst this_val,
+                                      int argc, JSValueConst *argv, int special)
+{
+    JSObject *p;
+    int len, tag, is_int, is_big, k, stop, inc, res = -1;
+    int64_t v64;
+    double d;
+    float f;
+
+    len = js_typed_array_get_length_internal(ctx, this_val);
+    if (len < 0)
+        goto exception;
+    if (len == 0)
+        goto done;
+
+    if (special == special_lastIndexOf) {
+        k = len - 1;
+        if (argc > 1) {
+            if (JS_ToFloat64(ctx, &d, argv[1]))
+                goto exception;
+            if (isnan(d)) {
+                k = 0;
+            } else {
+                if (d >= 0) {
+                    if (d < k) {
+                        k = d;
+                    }
+                } else {
+                    d += len;
+                    if (d < 0)
+                        goto done;
+                    k = d;
+                }
+            }
+        }
+        stop = -1;
+        inc = -1;
+    } else {
+        k = 0;
+        if (argc > 1) {
+            if (JS_ToInt32Clamp(ctx, &k, argv[1], 0, len, len))
+                goto exception;
+        }
+        stop = len;
+        inc = 1;
+    }
+
+    is_big = 0;
+    is_int = 0; /* avoid warning */
+    v64 = 0; /* avoid warning */
+    tag = JS_VALUE_GET_NORM_TAG(argv[0]);
+    if (tag == JS_TAG_INT) {
+        is_int = 1;
+        v64 = JS_VALUE_GET_INT(argv[0]);
+        d = v64;
+    } else
+    if (tag == JS_TAG_FLOAT64) {
+        d = JS_VALUE_GET_FLOAT64(argv[0]);
+        v64 = d;
+        is_int = (v64 == d);
+    } else
+#ifdef CONFIG_BIGNUM
+    if (tag == JS_TAG_BIG_INT || tag == JS_TAG_BIG_FLOAT) {
+        /* will a generic loop for bigint and bigfloat */
+        /* XXX: should use the generic loop in math_mode? */
+        is_big = 1;
+    } else
+#endif
+    {
+        goto done;
+    }
+
+    p = JS_VALUE_GET_OBJ(this_val);
+    switch (p->class_id) {
+    case JS_CLASS_INT8_ARRAY:
+        if (is_int && (int8_t)v64 == v64)
+            goto scan8;
+        break;
+    case JS_CLASS_UINT8C_ARRAY:
+    case JS_CLASS_UINT8_ARRAY:
+        if (is_int && (uint8_t)v64 == v64) {
+            const uint8_t *pv, *pp;
+            uint16_t v;
+        scan8:
+            pv = p->u.array.u.uint8_ptr;
+            v = v64;
+            if (inc > 0) {
+                pp = memchr(pv + k, v, len - k);
+                if (pp)
+                    res = pp - pv;
+            } else {
+                for (; k != stop; k += inc) {
+                    if (pv[k] == v) {
+                        res = k;
+                        break;
+                    }
+                }
+            }
+        }
+        break;
+    case JS_CLASS_INT16_ARRAY:
+        if (is_int && (int16_t)v64 == v64)
+            goto scan16;
+        break;
+    case JS_CLASS_UINT16_ARRAY:
+        if (is_int && (uint16_t)v64 == v64) {
+            const uint16_t *pv;
+            uint16_t v;
+        scan16:
+            pv = p->u.array.u.uint16_ptr;
+            v = v64;
+            for (; k != stop; k += inc) {
+                if (pv[k] == v) {
+                    res = k;
+                    break;
+                }
+            }
+        }
+        break;
+    case JS_CLASS_INT32_ARRAY:
+        if (is_int && (int32_t)v64 == v64)
+            goto scan32;
+        break;
+    case JS_CLASS_UINT32_ARRAY:
+        if (is_int && (uint32_t)v64 == v64) {
+            const uint32_t *pv;
+            uint32_t v;
+        scan32:
+            pv = p->u.array.u.uint32_ptr;
+            v = v64;
+            for (; k != stop; k += inc) {
+                if (pv[k] == v) {
+                    res = k;
+                    break;
+                }
+            }
+        }
+        break;
+    case JS_CLASS_FLOAT32_ARRAY:
+        if (is_big)
+            break;
+        if (isnan(d)) {
+            const float *pv = p->u.array.u.float_ptr;
+            /* special case: indexOf returns -1, includes finds NaN */
+            if (special != special_includes)
+                goto done;
+            for (; k != stop; k += inc) {
+                if (isnan(pv[k])) {
+                    res = k;
+                    break;
+                }
+            }
+        } else if ((f = (float)d) == d) {
+            const float *pv = p->u.array.u.float_ptr;
+            for (; k != stop; k += inc) {
+                if (pv[k] == f) {
+                    res = k;
+                    break;
+                }
+            }
+        }
+        break;
+    case JS_CLASS_FLOAT64_ARRAY:
+        if (is_big)
+            break;
+        if (isnan(d)) {
+            const double *pv = p->u.array.u.double_ptr;
+            /* special case: indexOf returns -1, includes finds NaN */
+            if (special != special_includes)
+                goto done;
+            for (; k != stop; k += inc) {
+                if (isnan(pv[k])) {
+                    res = k;
+                    break;
+                }
+            }
+        } else {
+            const double *pv = p->u.array.u.double_ptr;
+            for (; k != stop; k += inc) {
+                if (pv[k] == d) {
+                    res = k;
+                    break;
+                }
+            }
+        }
+        break;
+#ifdef CONFIG_BIGNUM
+    case JS_CLASS_BIG_INT64_ARRAY:
+    case JS_CLASS_BIG_UINT64_ARRAY:
+        if (is_big || is_strict_mode(ctx)) {
+            /* generic loop for bignums, argv[0] is a bignum != NaN */
+            /* XXX: optimize with explicit values */
+            for (; k != stop; k += inc) {
+                JSValue v = JS_GetPropertyUint32(ctx, this_val, k);
+                int ret;
+                if (JS_IsException(v))
+                    goto exception;
+                ret = js_same_value_zero(ctx, v, argv[0]);
+                JS_FreeValue(ctx, v);
+                if (ret) {
+                    if (ret < 0)
+                        goto exception;
+                    res = k;
+                    break;
+                }
+            }
+        }
+        break;
+#endif
+    }
+
+done:
+    if (special == special_includes)
+        return JS_NewBool(ctx, res >= 0);
+    else
+        return JS_NewInt32(ctx, res);
+
+exception:
+    return JS_EXCEPTION;
+}
+
+static JSValue js_typed_array_join(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv, int toLocaleString)
+{
+    JSValue sep = JS_UNDEFINED, el;
+    StringBuffer b_s, *b = &b_s;
+    JSString *p = NULL;
+    int i, n;
+    int c;
+
+    n = js_typed_array_get_length_internal(ctx, this_val);
+    if (n < 0)
+        goto exception;
+
+    c = ',';    /* default separator */
+    if (!toLocaleString && argc > 0 && !JS_IsUndefined(argv[0])) {
+        sep = JS_ToString(ctx, argv[0]);
+        if (JS_IsException(sep))
+            goto exception;
+        p = JS_VALUE_GET_STRING(sep);
+        if (p->len == 1 && !p->is_wide_char)
+            c = p->u.str8[0];
+        else
+            c = -1;
+    }
+    string_buffer_init(ctx, b, 0);
+
+    /* XXX: optimize with direct access */
+    for(i = 0; i < n; i++) {
+        if (i > 0) {
+            if (c >= 0) {
+                if (string_buffer_putc8(b, c))
+                    goto fail;
+            } else {
+                if (string_buffer_concat(b, p, 0, p->len))
+                    goto fail;
+            }
+        }
+        el = JS_GetPropertyUint32(ctx, this_val, i);
+        if (JS_IsException(el))
+            goto fail;
+        if (toLocaleString) {
+            el = JS_ToLocaleStringFree(ctx, el);
+        }
+        if (string_buffer_concat_value_free(b, el))
+            goto fail;
+    }
+    JS_FreeValue(ctx, sep);
+    return string_buffer_end(b);
+
+fail:
+    string_buffer_free(b);
+    JS_FreeValue(ctx, sep);
+exception:
+    return JS_EXCEPTION;
+}
+
+static JSValue js_typed_array_reverse(JSContext *ctx, JSValueConst this_val,
+                                      int argc, JSValueConst *argv)
+{
+    JSObject *p;
+    int len;
+
+    len = js_typed_array_get_length_internal(ctx, this_val);
+    if (len < 0)
+        return JS_EXCEPTION;
+    if (len > 0) {
+        p = JS_VALUE_GET_OBJ(this_val);
+        switch (typed_array_size_log2(p->class_id)) {
+        case 0:
+            {
+                uint8_t *p1 = p->u.array.u.uint8_ptr;
+                uint8_t *p2 = p1 + len - 1;
+                while (p1 < p2) {
+                    uint8_t v = *p1;
+                    *p1++ = *p2;
+                    *p2-- = v;
+                }
+            }
+            break;
+        case 1:
+            {
+                uint16_t *p1 = p->u.array.u.uint16_ptr;
+                uint16_t *p2 = p1 + len - 1;
+                while (p1 < p2) {
+                    uint16_t v = *p1;
+                    *p1++ = *p2;
+                    *p2-- = v;
+                }
+            }
+            break;
+        case 2:
+            {
+                uint32_t *p1 = p->u.array.u.uint32_ptr;
+                uint32_t *p2 = p1 + len - 1;
+                while (p1 < p2) {
+                    uint32_t v = *p1;
+                    *p1++ = *p2;
+                    *p2-- = v;
+                }
+            }
+            break;
+        case 3:
+            {
+                uint64_t *p1 = p->u.array.u.uint64_ptr;
+                uint64_t *p2 = p1 + len - 1;
+                while (p1 < p2) {
+                    uint64_t v = *p1;
+                    *p1++ = *p2;
+                    *p2-- = v;
+                }
+            }
+            break;
+        default:
+            abort();
+        }
+    }
+    return JS_DupValue(ctx, this_val);
+}
+
+static JSValue js_typed_array_slice(JSContext *ctx, JSValueConst this_val,
+                                    int argc, JSValueConst *argv)
+{
+    JSValueConst args[2];
+    JSValue arr, val;
+    JSObject *p, *p1;
+    int n, len, start, final, count, shift;
+
+    arr = JS_UNDEFINED;
+    len = js_typed_array_get_length_internal(ctx, this_val);
+    if (len < 0)
+        goto exception;
+
+    if (JS_ToInt32Clamp(ctx, &start, argv[0], 0, len, len))
+        goto exception;
+    final = len;
+    if (!JS_IsUndefined(argv[1])) {
+        if (JS_ToInt32Clamp(ctx, &final, argv[1], 0, len, len))
+            goto exception;
+    }
+    count = max_int(final - start, 0);
+
+    p = get_typed_array(ctx, this_val, 0);
+    if (p == NULL)
+        goto exception;
+    shift = typed_array_size_log2(p->class_id);
+
+    args[0] = this_val;
+    args[1] = JS_NewInt32(ctx, count);
+    arr = js_typed_array___speciesCreate(ctx, JS_UNDEFINED, 2, args);
+    if (JS_IsException(arr))
+        goto exception;
+
+    if (count > 0) {
+        if (validate_typed_array(ctx, this_val)
+        ||  validate_typed_array(ctx, arr))
+            goto exception;
+
+        p1 = get_typed_array(ctx, arr, 0);
+        if (p1 != NULL && p->class_id == p1->class_id &&
+            typed_array_get_length(ctx, p1) >= count &&
+            typed_array_get_length(ctx, p) >= start + count) {
+            memcpy(p1->u.array.u.uint8_ptr,
+                   p->u.array.u.uint8_ptr + (start << shift),
+                   count << shift);
+        } else {
+            for (n = 0; n < count; n++) {
+                val = JS_GetPropertyValue(ctx, this_val, JS_NewInt32(ctx, start + n));
+                if (JS_IsException(val))
+                    goto exception;
+                if (JS_SetPropertyValue(ctx, arr, JS_NewInt32(ctx, n), val,
+                                        JS_PROP_THROW) < 0)
+                    goto exception;
+            }
+        }
+    }
+    return arr;
+
+ exception:
+    JS_FreeValue(ctx, arr);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_typed_array_subarray(JSContext *ctx, JSValueConst this_val,
+                                       int argc, JSValueConst *argv)
+{
+    JSValueConst args[4];
+    JSValue arr, byteOffset, ta_buffer;
+    JSObject *p;
+    int len, start, final, count, shift, offset;
+
+    p = get_typed_array(ctx, this_val, 0);
+    if (!p)
+        goto exception;
+    len = p->u.array.count;
+    if (JS_ToInt32Clamp(ctx, &start, argv[0], 0, len, len))
+        goto exception;
+
+    final = len;
+    if (!JS_IsUndefined(argv[1])) {
+        if (JS_ToInt32Clamp(ctx, &final, argv[1], 0, len, len))
+            goto exception;
+    }
+    count = max_int(final - start, 0);
+    byteOffset = js_typed_array_get_byteOffset(ctx, this_val, 0);
+    if (JS_IsException(byteOffset))
+        goto exception;
+    shift = typed_array_size_log2(p->class_id);
+    offset = JS_VALUE_GET_INT(byteOffset) + (start << shift);
+    JS_FreeValue(ctx, byteOffset);
+    ta_buffer = js_typed_array_get_buffer(ctx, this_val, 0);
+    if (JS_IsException(ta_buffer))
+        goto exception;
+    args[0] = this_val;
+    args[1] = ta_buffer;
+    args[2] = JS_NewInt32(ctx, offset);
+    args[3] = JS_NewInt32(ctx, count);
+    arr = js_typed_array___speciesCreate(ctx, JS_UNDEFINED, 4, args);
+    JS_FreeValue(ctx, ta_buffer);
+    return arr;
+
+ exception:
+    return JS_EXCEPTION;
+}
+
+/* TypedArray.prototype.sort */
+
+static int js_cmp_doubles(double x, double y)
+{
+    if (isnan(x))    return isnan(y) ? 0 : +1;
+    if (isnan(y))    return -1;
+    if (x < y)       return -1;
+    if (x > y)       return 1;
+    if (x != 0)      return 0;
+    if (signbit(x))  return signbit(y) ? 0 : -1;
+    else             return signbit(y) ? -1 : 0;
+}
+
+static int js_TA_cmp_int8(const void *a, const void *b, void *opaque) {
+    return *(const int8_t *)a - *(const int8_t *)b;
+}
+
+static int js_TA_cmp_uint8(const void *a, const void *b, void *opaque) {
+    return *(const uint8_t *)a - *(const uint8_t *)b;
+}
+
+static int js_TA_cmp_int16(const void *a, const void *b, void *opaque) {
+    return *(const int16_t *)a - *(const int16_t *)b;
+}
+
+static int js_TA_cmp_uint16(const void *a, const void *b, void *opaque) {
+    return *(const uint16_t *)a - *(const uint16_t *)b;
+}
+
+static int js_TA_cmp_int32(const void *a, const void *b, void *opaque) {
+    int32_t x = *(const int32_t *)a;
+    int32_t y = *(const int32_t *)b;
+    return (y < x) - (y > x);
+}
+
+static int js_TA_cmp_uint32(const void *a, const void *b, void *opaque) {
+    uint32_t x = *(const uint32_t *)a;
+    uint32_t y = *(const uint32_t *)b;
+    return (y < x) - (y > x);
+}
+
+#ifdef CONFIG_BIGNUM
+static int js_TA_cmp_int64(const void *a, const void *b, void *opaque) {
+    int64_t x = *(const int64_t *)a;
+    int64_t y = *(const int64_t *)b;
+    return (y < x) - (y > x);
+}
+
+static int js_TA_cmp_uint64(const void *a, const void *b, void *opaque) {
+    uint64_t x = *(const uint64_t *)a;
+    uint64_t y = *(const uint64_t *)b;
+    return (y < x) - (y > x);
+}
+#endif
+
+static int js_TA_cmp_float32(const void *a, const void *b, void *opaque) {
+    return js_cmp_doubles(*(const float *)a, *(const float *)b);
+}
+
+static int js_TA_cmp_float64(const void *a, const void *b, void *opaque) {
+    return js_cmp_doubles(*(const double *)a, *(const double *)b);
+}
+
+static JSValue js_TA_get_int8(JSContext *ctx, const void *a) {
+    return JS_NewInt32(ctx, *(const int8_t *)a);
+}
+
+static JSValue js_TA_get_uint8(JSContext *ctx, const void *a) {
+    return JS_NewInt32(ctx, *(const uint8_t *)a);
+}
+
+static JSValue js_TA_get_int16(JSContext *ctx, const void *a) {
+    return JS_NewInt32(ctx, *(const int16_t *)a);
+}
+
+static JSValue js_TA_get_uint16(JSContext *ctx, const void *a) {
+    return JS_NewInt32(ctx, *(const uint16_t *)a);
+}
+
+static JSValue js_TA_get_int32(JSContext *ctx, const void *a) {
+    return JS_NewInt32(ctx, *(const int32_t *)a);
+}
+
+static JSValue js_TA_get_uint32(JSContext *ctx, const void *a) {
+    return JS_NewUint32(ctx, *(const uint32_t *)a);
+}
+
+#ifdef CONFIG_BIGNUM
+static JSValue js_TA_get_int64(JSContext *ctx, const void *a) {
+    return JS_NewBigInt64(ctx, *(int64_t *)a);
+}
+
+static JSValue js_TA_get_uint64(JSContext *ctx, const void *a) {
+    return JS_NewBigUint64(ctx, *(uint64_t *)a);
+}
+#endif
+
+static JSValue js_TA_get_float32(JSContext *ctx, const void *a) {
+    return __JS_NewFloat64(ctx, *(const float *)a);
+}
+
+static JSValue js_TA_get_float64(JSContext *ctx, const void *a) {
+    return __JS_NewFloat64(ctx, *(const double *)a);
+}
+
+static void js_TA_swap_uint8(void *a, void *b) {
+    uint8_t x = *(uint8_t *)a;
+    *(uint8_t *)a = *(uint8_t *)b;
+    *(uint8_t *)b = x;
+}
+
+static void js_TA_swap_uint16(void *a, void *b) {
+    uint16_t x = *(uint16_t *)a;
+    *(uint16_t *)a = *(uint16_t *)b;
+    *(uint16_t *)b = x;
+}
+
+static void js_TA_swap_uint32(void *a, void *b) {
+    uint32_t x = *(uint32_t *)a;
+    *(uint32_t *)a = *(uint32_t *)b;
+    *(uint32_t *)b = x;
+}
+
+static void js_TA_swap_uint64(void *a, void *b) {
+    uint64_t x = *(uint64_t *)a;
+    *(uint64_t *)a = *(uint64_t *)b;
+    *(uint64_t *)b = x;
+}
+
+struct TA_sort_context {
+    JSContext *ctx;
+    int exception;
+    JSValueConst arr;
+    JSValueConst cmp;
+    JSValue (*getfun)(JSContext *ctx, const void *a);
+    int (*cmpfun)(const void *a, const void *b, void *opaque);
+    void (*swapfun)(void *a, void *b);
+};
+
+static int js_TA_cmp_generic(const void *a, const void *b, void *opaque) {
+    struct TA_sort_context *psc = opaque;
+    JSContext *ctx = psc->ctx;
+    JSValueConst argv[2];
+    JSValue res;
+    int cmp;
+
+    cmp = 0;
+    if (!psc->exception) {
+        argv[0] = psc->getfun(ctx, a);
+        argv[1] = psc->getfun(ctx, b);
+        res = JS_Call(ctx, psc->cmp, JS_UNDEFINED, 2, argv);
+        if (JS_IsException(res)) {
+            psc->exception = 1;
+        } else
+        if (validate_typed_array(ctx, psc->arr) < 0) {
+            JS_FreeValue(ctx, res);
+            psc->exception = 1;
+        } else
+        if (JS_VALUE_GET_TAG(res) == JS_TAG_INT) {
+            int val = JS_VALUE_GET_INT(res);
+            cmp = (val > 0) - (val < 0);
+        } else {
+            double val;
+            if (JS_ToFloat64Free(ctx, &val, res) < 0)
+                psc->exception = 1;
+            else
+                cmp = (val > 0) - (val < 0);
+        }
+        JS_FreeValue(ctx, CastToJSValue(argv[0]));
+        JS_FreeValue(ctx, CastToJSValue(argv[1]));
+    }
+    return cmp;
+}
+
+static JSValue js_typed_array_sort(JSContext *ctx, JSValueConst this_val,
+                                   int argc, JSValueConst *argv)
+{
+    JSObject *p;
+    int len, elt_size;
+    struct TA_sort_context tsc;
+    void *array_ptr, *array_copy = NULL, *array_org;
+    int (*cmpfun)(const void *a, const void *b, void *opaque);
+
+    tsc.ctx = ctx;
+    tsc.exception = 0;
+    tsc.arr = this_val;
+    tsc.cmp = argv[0];
+
+    len = js_typed_array_get_length_internal(ctx, this_val);
+    if (len < 0)
+        return JS_EXCEPTION;
+    if (!JS_IsUndefined(tsc.cmp) && check_function(ctx, tsc.cmp))
+        return JS_EXCEPTION;
+
+    if (len > 1) {
+        p = JS_VALUE_GET_OBJ(this_val);
+        switch (p->class_id) {
+        case JS_CLASS_INT8_ARRAY:
+            tsc.getfun = js_TA_get_int8;
+            tsc.cmpfun = js_TA_cmp_int8;
+            tsc.swapfun = js_TA_swap_uint8;
+            break;
+        case JS_CLASS_UINT8C_ARRAY:
+        case JS_CLASS_UINT8_ARRAY:
+            tsc.getfun = js_TA_get_uint8;
+            tsc.cmpfun = js_TA_cmp_uint8;
+            tsc.swapfun = js_TA_swap_uint8;
+            break;
+        case JS_CLASS_INT16_ARRAY:
+            tsc.getfun = js_TA_get_int16;
+            tsc.cmpfun = js_TA_cmp_int16;
+            tsc.swapfun = js_TA_swap_uint16;
+            break;
+        case JS_CLASS_UINT16_ARRAY:
+            tsc.getfun = js_TA_get_uint16;
+            tsc.cmpfun = js_TA_cmp_uint16;
+            tsc.swapfun = js_TA_swap_uint16;
+            break;
+        case JS_CLASS_INT32_ARRAY:
+            tsc.getfun = js_TA_get_int32;
+            tsc.cmpfun = js_TA_cmp_int32;
+            tsc.swapfun = js_TA_swap_uint32;
+            break;
+        case JS_CLASS_UINT32_ARRAY:
+            tsc.getfun = js_TA_get_uint32;
+            tsc.cmpfun = js_TA_cmp_uint32;
+            tsc.swapfun = js_TA_swap_uint32;
+            break;
+#ifdef CONFIG_BIGNUM
+        case JS_CLASS_BIG_INT64_ARRAY:
+            tsc.getfun = js_TA_get_int64;
+            tsc.cmpfun = js_TA_cmp_int64;
+            tsc.swapfun = js_TA_swap_uint64;
+            break;
+        case JS_CLASS_BIG_UINT64_ARRAY:
+            tsc.getfun = js_TA_get_uint64;
+            tsc.cmpfun = js_TA_cmp_uint64;
+            tsc.swapfun = js_TA_swap_uint64;
+            break;
+#endif
+        case JS_CLASS_FLOAT32_ARRAY:
+            tsc.getfun = js_TA_get_float32;
+            tsc.cmpfun = js_TA_cmp_float32;
+            tsc.swapfun = js_TA_swap_uint32;
+            break;
+        case JS_CLASS_FLOAT64_ARRAY:
+            tsc.getfun = js_TA_get_float64;
+            tsc.cmpfun = js_TA_cmp_float64;
+            tsc.swapfun = js_TA_swap_uint64;
+            break;
+        default:
+            abort();
+        }
+        array_ptr = array_org = p->u.array.u.ptr;
+        elt_size = 1 << typed_array_size_log2(p->class_id);
+        cmpfun = tsc.cmpfun;
+        if (!JS_IsUndefined(tsc.cmp)) {
+            /* must copy internal array if user defined comparison function to
+               avoid crash if the array gets reallocated by the compare function */
+            array_copy = js_malloc(ctx, len * elt_size);
+            if (array_copy == NULL)
+                return JS_EXCEPTION;
+            array_ptr = memcpy(array_copy, array_ptr, len * elt_size);
+            cmpfun = js_TA_cmp_generic;
+        }
+        rqsort(array_ptr, len, elt_size, cmpfun, &tsc);
+        if (tsc.exception) {
+            js_free(ctx, array_copy);
+            return JS_EXCEPTION;
+        }
+        if (array_ptr == array_copy) {
+            if (array_org == p->u.array.u.ptr)
+                memcpy(array_org, array_copy, len * elt_size);
+            js_free(ctx, array_copy);
+        }
+    }
+    return JS_DupValue(ctx, this_val);
+}
+
+static const JSCFunctionListEntry js_typed_array_base_funcs[] = {
+    JS_CFUNC_DEF("from", 1, js_typed_array_from ),
+    JS_CFUNC_DEF("of", 0, js_typed_array_of ),
+    JS_CGETSET_DEF("[Symbol.species]", js_get_this, NULL ),
+    //JS_CFUNC_DEF("__getLength", 2, js_typed_array___getLength ),
+    //JS_CFUNC_DEF("__create", 2, js_typed_array___create ),
+    //JS_CFUNC_DEF("__speciesCreate", 2, js_typed_array___speciesCreate ),
+};
+
+static const JSCFunctionListEntry js_typed_array_base_proto_funcs[] = {
+    JS_CGETSET_DEF("length", js_typed_array_get_length, NULL ),
+    JS_CGETSET_MAGIC_DEF("buffer", js_typed_array_get_buffer, NULL, 0 ),
+    JS_CGETSET_MAGIC_DEF("byteLength", js_typed_array_get_byteLength, NULL, 0 ),
+    JS_CGETSET_MAGIC_DEF("byteOffset", js_typed_array_get_byteOffset, NULL, 0 ),
+    JS_CFUNC_DEF("set", 1, js_typed_array_set ),
+    JS_CFUNC_MAGIC_DEF("values", 0, js_create_typed_array_iterator, JS_ITERATOR_KIND_VALUE ),
+    JS_ALIAS_DEF("[Symbol.iterator]", "values" ),
+    JS_CFUNC_MAGIC_DEF("keys", 0, js_create_typed_array_iterator, JS_ITERATOR_KIND_KEY ),
+    JS_CFUNC_MAGIC_DEF("entries", 0, js_create_typed_array_iterator, JS_ITERATOR_KIND_KEY_AND_VALUE ),
+    JS_CGETSET_DEF("[Symbol.toStringTag]", js_typed_array_get_toStringTag, NULL ),
+    JS_CFUNC_DEF("copyWithin", 2, js_typed_array_copyWithin ),
+    JS_CFUNC_MAGIC_DEF("every", 1, js_array_every, special_every | special_TA ),
+    JS_CFUNC_MAGIC_DEF("some", 1, js_array_every, special_some | special_TA ),
+    JS_CFUNC_MAGIC_DEF("forEach", 1, js_array_every, special_forEach | special_TA ),
+    JS_CFUNC_MAGIC_DEF("map", 1, js_array_every, special_map | special_TA ),
+    JS_CFUNC_MAGIC_DEF("filter", 1, js_array_every, special_filter | special_TA ),
+    JS_CFUNC_MAGIC_DEF("reduce", 1, js_array_reduce, special_reduce | special_TA ),
+    JS_CFUNC_MAGIC_DEF("reduceRight", 1, js_array_reduce, special_reduceRight | special_TA ),
+    JS_CFUNC_DEF("fill", 1, js_typed_array_fill ),
+    JS_CFUNC_MAGIC_DEF("find", 1, js_typed_array_find, 0 ),
+    JS_CFUNC_MAGIC_DEF("findIndex", 1, js_typed_array_find, 1 ),
+    JS_CFUNC_DEF("reverse", 0, js_typed_array_reverse ),
+    JS_CFUNC_DEF("slice", 2, js_typed_array_slice ),
+    JS_CFUNC_DEF("subarray", 2, js_typed_array_subarray ),
+    JS_CFUNC_DEF("sort", 1, js_typed_array_sort ),
+    JS_CFUNC_MAGIC_DEF("join", 1, js_typed_array_join, 0 ),
+    JS_CFUNC_MAGIC_DEF("toLocaleString", 0, js_typed_array_join, 1 ),
+    JS_CFUNC_MAGIC_DEF("indexOf", 1, js_typed_array_indexOf, special_indexOf ),
+    JS_CFUNC_MAGIC_DEF("lastIndexOf", 1, js_typed_array_indexOf, special_lastIndexOf ),
+    JS_CFUNC_MAGIC_DEF("includes", 1, js_typed_array_indexOf, special_includes ),
+    //JS_ALIAS_BASE_DEF("toString", "toString", 2 /* Array.prototype. */), @@@
+};
+
+static JSValue js_typed_array_base_constructor(JSContext *ctx,
+                                               JSValueConst this_val,
+                                               int argc, JSValueConst *argv)
+{
+    return JS_ThrowTypeError(ctx, "cannot be called");
+}
+
+/* 'obj' must be an allocated typed array object */
+static int typed_array_init(JSContext *ctx, JSValueConst obj,
+                            JSValue buffer, uint64_t offset, uint64_t len)
+{
+    JSTypedArray *ta;
+    JSObject *p, *pbuffer;
+    JSArrayBuffer *abuf;
+    int size_log2;
+
+    p = JS_VALUE_GET_OBJ(obj);
+    size_log2 = typed_array_size_log2(p->class_id);
+    ta = js_malloc(ctx, sizeof(*ta));
+    if (!ta) {
+        JS_FreeValue(ctx, buffer);
+        return -1;
+    }
+    pbuffer = JS_VALUE_GET_OBJ(buffer);
+    abuf = pbuffer->u.array_buffer;
+    ta->obj = p;
+    ta->buffer = pbuffer;
+    ta->offset = offset;
+    ta->length = len << size_log2;
+    list_add_tail(&ta->link, &abuf->array_list);
+    p->u.typed_array = ta;
+    p->u.array.count = len;
+    p->u.array.u.ptr = abuf->data + offset;
+    return 0;
+}
+
+
+static JSValue js_array_from_iterator(JSContext *ctx, uint32_t *plen,
+                                      JSValueConst obj, JSValueConst method)
+{
+    JSValue arr, iter, next_method = JS_UNDEFINED, val;
+    BOOL done;
+    uint32_t k;
+
+    *plen = 0;
+    arr = JS_NewArray(ctx);
+    if (JS_IsException(arr))
+        return arr;
+    iter = JS_GetIterator2(ctx, obj, method);
+    if (JS_IsException(iter))
+        goto fail;
+    next_method = JS_GetProperty(ctx, iter, JS_ATOM_next);
+    if (JS_IsException(next_method))
+        goto fail;
+    k = 0;
+    for(;;) {
+        val = JS_IteratorNext(ctx, iter, next_method, 0, NULL, &done);
+        if (JS_IsException(val))
+            goto fail;
+        if (done) {
+            JS_FreeValue(ctx, val);
+            break;
+        }
+        if (JS_CreateDataPropertyUint32(ctx, arr, k, val, JS_PROP_THROW) < 0)
+            goto fail;
+        k++;
+    }
+    JS_FreeValue(ctx, next_method);
+    JS_FreeValue(ctx, iter);
+    *plen = k;
+    return arr;
+ fail:
+    JS_FreeValue(ctx, next_method);
+    JS_FreeValue(ctx, iter);
+    JS_FreeValue(ctx, arr);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_typed_array_constructor_obj(JSContext *ctx,
+                                              JSValueConst new_target,
+                                              JSValueConst obj,
+                                              int classid)
+{
+    JSValue iter, ret, arr = JS_UNDEFINED, val, buffer;
+    uint32_t i;
+    int size_log2;
+    int64_t len;
+
+    size_log2 = typed_array_size_log2(classid);
+    ret = js_create_from_ctor(ctx, new_target, classid);
+    if (JS_IsException(ret))
+        return JS_EXCEPTION;
+
+    iter = JS_GetProperty(ctx, obj, JS_ATOM_Symbol_iterator);
+    if (JS_IsException(iter))
+        goto fail;
+    if (!JS_IsUndefined(iter) && !JS_IsNull(iter)) {
+        uint32_t len1;
+        arr = js_array_from_iterator(ctx, &len1, obj, iter);
+        JS_FreeValue(ctx, iter);
+        if (JS_IsException(arr))
+            goto fail;
+        len = len1;
+    } else {
+        if (js_get_length64(ctx, &len, obj))
+            goto fail;
+        arr = JS_DupValue(ctx, obj);
+    }
+
+    buffer = js_array_buffer_constructor1(ctx, JS_UNDEFINED,
+                                          len << size_log2);
+    if (JS_IsException(buffer))
+        goto fail;
+    if (typed_array_init(ctx, ret, buffer, 0, len))
+        goto fail;
+
+    for(i = 0; i < len; i++) {
+        val = JS_GetPropertyUint32(ctx, arr, i);
+        if (JS_IsException(val))
+            goto fail;
+        if (JS_SetPropertyUint32(ctx, ret, i, val) < 0)
+            goto fail;
+    }
+    JS_FreeValue(ctx, arr);
+    return ret;
+ fail:
+    JS_FreeValue(ctx, arr);
+    JS_FreeValue(ctx, ret);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_typed_array_constructor_ta(JSContext *ctx,
+                                             JSValueConst new_target,
+                                             JSValueConst src_obj,
+                                             int classid)
+{
+    JSObject *p, *src_buffer;
+    JSTypedArray *ta;
+    JSValue ctor, obj, buffer;
+    uint32_t len, i;
+    int size_log2;
+    JSArrayBuffer *src_abuf, *abuf;
+
+    obj = js_create_from_ctor(ctx, new_target, classid);
+    if (JS_IsException(obj))
+        return obj;
+    p = JS_VALUE_GET_OBJ(src_obj);
+    if (typed_array_is_detached(ctx, p)) {
+        JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+        goto fail;
+    }
+    ta = p->u.typed_array;
+    len = p->u.array.count;
+    src_buffer = ta->buffer;
+    src_abuf = src_buffer->u.array_buffer;
+    if (!src_abuf->shared) {
+        ctor = JS_SpeciesConstructor(ctx, JS_MKPTR(JS_TAG_OBJECT, src_buffer),
+                                     JS_UNDEFINED);
+        if (JS_IsException(ctor))
+            goto fail;
+    } else {
+        /* force ArrayBuffer default constructor */
+        ctor = JS_UNDEFINED;
+    }
+    size_log2 = typed_array_size_log2(classid);
+    buffer = js_array_buffer_constructor1(ctx, ctor,
+                                          (uint64_t)len << size_log2);
+    JS_FreeValue(ctx, ctor);
+    if (JS_IsException(buffer))
+        goto fail;
+    /* necessary because it could have been detached */
+    if (typed_array_is_detached(ctx, p)) {
+        JS_FreeValue(ctx, buffer);
+        JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+        goto fail;
+    }
+    abuf = JS_GetOpaque(buffer, JS_CLASS_ARRAY_BUFFER);
+    if (typed_array_init(ctx, obj, buffer, 0, len))
+        goto fail;
+    if (p->class_id == classid) {
+        /* same type: copy the content */
+        memcpy(abuf->data, src_abuf->data + ta->offset, abuf->byte_length);
+    } else {
+        for(i = 0; i < len; i++) {
+            JSValue val;
+            val = JS_GetPropertyUint32(ctx, src_obj, i);
+            if (JS_IsException(val))
+                goto fail;
+            if (JS_SetPropertyUint32(ctx, obj, i, val) < 0)
+                goto fail;
+        }
+    }
+    return obj;
+ fail:
+    JS_FreeValue(ctx, obj);
+    return JS_EXCEPTION;
+}
+
+static JSValue js_typed_array_constructor(JSContext *ctx,
+                                          JSValueConst new_target,
+                                          int argc, JSValueConst *argv,
+                                          int classid)
+{
+    JSValue buffer, obj;
+    JSArrayBuffer *abuf;
+    int size_log2;
+    uint64_t len, offset;
+
+    size_log2 = typed_array_size_log2(classid);
+    if (JS_VALUE_GET_TAG(argv[0]) != JS_TAG_OBJECT) {
+        if (JS_ToIndex(ctx, &len, argv[0]))
+            return JS_EXCEPTION;
+        buffer = js_array_buffer_constructor1(ctx, JS_UNDEFINED,
+                                              len << size_log2);
+        if (JS_IsException(buffer))
+            return JS_EXCEPTION;
+        offset = 0;
+    } else {
+        JSObject *p = JS_VALUE_GET_OBJ(argv[0]);
+        if (p->class_id == JS_CLASS_ARRAY_BUFFER ||
+            p->class_id == JS_CLASS_SHARED_ARRAY_BUFFER) {
+            abuf = p->u.array_buffer;
+            if (JS_ToIndex(ctx, &offset, argv[1]))
+                return JS_EXCEPTION;
+            if (abuf->detached)
+                return JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+            if ((offset & ((1 << size_log2) - 1)) != 0 ||
+                offset > abuf->byte_length)
+                return JS_ThrowRangeError(ctx, "invalid offset");
+            if (JS_IsUndefined(argv[2])) {
+                if ((abuf->byte_length & ((1 << size_log2) - 1)) != 0)
+                    goto invalid_length;
+                len = (abuf->byte_length - offset) >> size_log2;
+            } else {
+                if (JS_ToIndex(ctx, &len, argv[2]))
+                    return JS_EXCEPTION;
+                if (abuf->detached)
+                    return JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+                if ((offset + (len << size_log2)) > abuf->byte_length) {
+                invalid_length:
+                    return JS_ThrowRangeError(ctx, "invalid length");
+                }
+            }
+            buffer = JS_DupValue(ctx, argv[0]);
+        } else {
+            if (p->class_id >= JS_CLASS_UINT8C_ARRAY &&
+                p->class_id <= JS_CLASS_FLOAT64_ARRAY) {
+                return js_typed_array_constructor_ta(ctx, new_target, argv[0], classid);
+            } else {
+                return js_typed_array_constructor_obj(ctx, new_target, argv[0], classid);
+            }
+        }
+    }
+
+    obj = js_create_from_ctor(ctx, new_target, classid);
+    if (JS_IsException(obj)) {
+        JS_FreeValue(ctx, buffer);
+        return JS_EXCEPTION;
+    }
+    if (typed_array_init(ctx, obj, buffer, offset, len)) {
+        JS_FreeValue(ctx, obj);
+        return JS_EXCEPTION;
+    }
+    return obj;
+}
+
+static void js_typed_array_finalizer(JSRuntime *rt, JSValue val)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    JSTypedArray *ta = p->u.typed_array;
+    if (ta) {
+        /* during the GC the finalizers are called in an arbitrary
+           order so the ArrayBuffer finalizer may have been called */
+        if (JS_IsLiveObject(rt, JS_MKPTR(JS_TAG_OBJECT, ta->buffer))) {
+            list_del(&ta->link);
+        }
+        JS_FreeValueRT(rt, JS_MKPTR(JS_TAG_OBJECT, ta->buffer));
+        js_free_rt(rt, ta);
+    }
+}
+
+static void js_typed_array_mark(JSRuntime *rt, JSValueConst val,
+                                JS_MarkFunc *mark_func)
+{
+    JSObject *p = JS_VALUE_GET_OBJ(val);
+    JSTypedArray *ta = p->u.typed_array;
+    if (ta) {
+        JS_MarkValue(rt, JS_MKPTR(JS_TAG_OBJECT, ta->buffer), mark_func);
+    }
+}
+
+static JSValue js_dataview_constructor(JSContext *ctx,
+                                       JSValueConst new_target,
+                                       int argc, JSValueConst *argv)
+{
+    JSArrayBuffer *abuf;
+    uint64_t offset;
+    uint32_t len;
+    JSValueConst buffer;
+    JSValue obj;
+    JSTypedArray *ta;
+    JSObject *p;
+
+    buffer = argv[0];
+    abuf = js_get_array_buffer(ctx, buffer);
+    if (!abuf)
+        return JS_EXCEPTION;
+    offset = 0;
+    if (argc > 1) {
+        if (JS_ToIndex(ctx, &offset, argv[1]))
+            return JS_EXCEPTION;
+    }
+    if (abuf->detached)
+        return JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+    if (offset > abuf->byte_length)
+        return JS_ThrowRangeError(ctx, "invalid byteOffset");
+    len = abuf->byte_length - offset;
+    if (argc > 2 && !JS_IsUndefined(argv[2])) {
+        uint64_t l;
+        if (JS_ToIndex(ctx, &l, argv[2]))
+            return JS_EXCEPTION;
+        if (l > len)
+            return JS_ThrowRangeError(ctx, "invalid byteLength");
+        len = l;
+    }
+
+    obj = js_create_from_ctor(ctx, new_target, JS_CLASS_DATAVIEW);
+    if (JS_IsException(obj))
+        return JS_EXCEPTION;
+    if (abuf->detached) {
+        /* could have been detached in js_create_from_ctor() */
+        JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+        goto fail;
+    }
+    ta = js_malloc(ctx, sizeof(*ta));
+    if (!ta) {
+    fail:
+        JS_FreeValue(ctx, obj);
+        return JS_EXCEPTION;
+    }
+    p = JS_VALUE_GET_OBJ(obj);
+    ta->obj = p;
+    ta->buffer = JS_VALUE_GET_OBJ(JS_DupValue(ctx, buffer));
+    ta->offset = offset;
+    ta->length = len;
+    list_add_tail(&ta->link, &abuf->array_list);
+    p->u.typed_array = ta;
+    return obj;
+}
+
+static JSValue js_dataview_getValue(JSContext *ctx,
+                                    JSValueConst this_obj,
+                                    int argc, JSValueConst *argv, int class_id)
+{
+    JSTypedArray *ta;
+    JSArrayBuffer *abuf;
+    int is_swap, size;
+    uint8_t *ptr;
+    uint32_t v;
+    uint64_t pos;
+
+    ta = JS_GetOpaque2(ctx, this_obj, JS_CLASS_DATAVIEW);
+    if (!ta)
+        return JS_EXCEPTION;
+    size = 1 << typed_array_size_log2(class_id);
+    if (JS_ToIndex(ctx, &pos, argv[0]))
+        return JS_EXCEPTION;
+    is_swap = FALSE;
+    if (argc > 1)
+        is_swap = JS_ToBool(ctx, argv[1]);
+#ifndef WORDS_BIGENDIAN
+    is_swap ^= 1;
+#endif
+    abuf = ta->buffer->u.array_buffer;
+    if (abuf->detached)
+        return JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+    if ((pos + size) > ta->length)
+        return JS_ThrowRangeError(ctx, "out of bound");
+    ptr = abuf->data + ta->offset + pos;
+
+    switch(class_id) {
+    case JS_CLASS_INT8_ARRAY:
+        return JS_NewInt32(ctx, *(int8_t *)ptr);
+    case JS_CLASS_UINT8_ARRAY:
+        return JS_NewInt32(ctx, *(uint8_t *)ptr);
+    case JS_CLASS_INT16_ARRAY:
+        v = get_u16(ptr);
+        if (is_swap)
+            v = bswap16(v);
+        return JS_NewInt32(ctx, (int16_t)v);
+    case JS_CLASS_UINT16_ARRAY:
+        v = get_u16(ptr);
+        if (is_swap)
+            v = bswap16(v);
+        return JS_NewInt32(ctx, v);
+    case JS_CLASS_INT32_ARRAY:
+        v = get_u32(ptr);
+        if (is_swap)
+            v = bswap32(v);
+        return JS_NewInt32(ctx, v);
+    case JS_CLASS_UINT32_ARRAY:
+        v = get_u32(ptr);
+        if (is_swap)
+            v = bswap32(v);
+        return JS_NewUint32(ctx, v);
+#ifdef CONFIG_BIGNUM
+    case JS_CLASS_BIG_INT64_ARRAY:
+        {
+            uint64_t v;
+            v = get_u64(ptr);
+            if (is_swap)
+                v = bswap64(v);
+            return JS_NewBigInt64(ctx, v);
+        }
+        break;
+    case JS_CLASS_BIG_UINT64_ARRAY:
+        {
+            uint64_t v;
+            v = get_u64(ptr);
+            if (is_swap)
+                v = bswap64(v);
+            return JS_NewBigUint64(ctx, v);
+        }
+        break;
+#endif
+    case JS_CLASS_FLOAT32_ARRAY:
+        {
+            union {
+                float f;
+                uint32_t i;
+            } u;
+            v = get_u32(ptr);
+            if (is_swap)
+                v = bswap32(v);
+            u.i = v;
+            return __JS_NewFloat64(ctx, u.f);
+        }
+    case JS_CLASS_FLOAT64_ARRAY:
+        {
+            union {
+                double f;
+                uint64_t i;
+            } u;
+            u.i = get_u64(ptr);
+            if (is_swap)
+                u.i = bswap64(u.i);
+            return __JS_NewFloat64(ctx, u.f);
+        }
+    default:
+        abort();
+    }
+}
+
+static JSValue js_dataview_setValue(JSContext *ctx,
+                                    JSValueConst this_obj,
+                                    int argc, JSValueConst *argv, int class_id)
+{
+    JSTypedArray *ta;
+    JSArrayBuffer *abuf;
+    int is_swap, size;
+    uint8_t *ptr;
+    uint64_t v64;
+    uint32_t v;
+    uint64_t pos;
+    JSValueConst val;
+
+    ta = JS_GetOpaque2(ctx, this_obj, JS_CLASS_DATAVIEW);
+    if (!ta)
+        return JS_EXCEPTION;
+    size = 1 << typed_array_size_log2(class_id);
+    if (JS_ToIndex(ctx, &pos, argv[0]))
+        return JS_EXCEPTION;
+    val = argv[1];
+    v = 0; /* avoid warning */
+    v64 = 0; /* avoid warning */
+    if (class_id <= JS_CLASS_UINT32_ARRAY) {
+        if (JS_ToUint32(ctx, &v, val))
+            return JS_EXCEPTION;
+    } else
+#ifdef CONFIG_BIGNUM
+    if (class_id <= JS_CLASS_BIG_UINT64_ARRAY) {
+        if (JS_ToBigInt64(ctx, (int64_t *)&v64, val))
+            return JS_EXCEPTION;
+    } else
+#endif
+    {
+        double d;
+        if (JS_ToFloat64(ctx, &d, val))
+            return JS_EXCEPTION;
+        if (class_id == JS_CLASS_FLOAT32_ARRAY) {
+            union {
+                float f;
+                uint32_t i;
+            } u;
+            u.f = d;
+            v = u.i;
+        } else {
+            JSFloat64Union u;
+            u.d = d;
+            v64 = u.u64;
+        }
+    }
+    is_swap = FALSE;
+    if (argc > 2)
+        is_swap = JS_ToBool(ctx, argv[2]);
+#ifndef WORDS_BIGENDIAN
+    is_swap ^= 1;
+#endif
+    abuf = ta->buffer->u.array_buffer;
+    if (abuf->detached)
+        return JS_ThrowTypeErrorDetachedArrayBuffer(ctx);
+    if ((pos + size) > ta->length)
+        return JS_ThrowRangeError(ctx, "out of bound");
+    ptr = abuf->data + ta->offset + pos;
+
+    switch(class_id) {
+    case JS_CLASS_INT8_ARRAY:
+    case JS_CLASS_UINT8_ARRAY:
+        *ptr = v;
+        break;
+    case JS_CLASS_INT16_ARRAY:
+    case JS_CLASS_UINT16_ARRAY:
+        if (is_swap)
+            v = bswap16(v);
+        put_u16(ptr, v);
+        break;
+    case JS_CLASS_INT32_ARRAY:
+    case JS_CLASS_UINT32_ARRAY:
+    case JS_CLASS_FLOAT32_ARRAY:
+        if (is_swap)
+            v = bswap32(v);
+        put_u32(ptr, v);
+        break;
+#ifdef CONFIG_BIGNUM
+    case JS_CLASS_BIG_INT64_ARRAY:
+    case JS_CLASS_BIG_UINT64_ARRAY:
+#endif
+    case JS_CLASS_FLOAT64_ARRAY:
+        if (is_swap)
+            v64 = bswap64(v64);
+        put_u64(ptr, v64);
+        break;
+    default:
+        abort();
+    }
+    return JS_UNDEFINED;
+}
+
+static const JSCFunctionListEntry js_dataview_proto_funcs[] = {
+    JS_CGETSET_MAGIC_DEF("buffer", js_typed_array_get_buffer, NULL, 1 ),
+    JS_CGETSET_MAGIC_DEF("byteLength", js_typed_array_get_byteLength, NULL, 1 ),
+    JS_CGETSET_MAGIC_DEF("byteOffset", js_typed_array_get_byteOffset, NULL, 1 ),
+    JS_CFUNC_MAGIC_DEF("getInt8", 1, js_dataview_getValue, JS_CLASS_INT8_ARRAY ),
+    JS_CFUNC_MAGIC_DEF("getUint8", 1, js_dataview_getValue, JS_CLASS_UINT8_ARRAY ),
+    JS_CFUNC_MAGIC_DEF("getInt16", 1, js_dataview_getValue, JS_CLASS_INT16_ARRAY ),
+    JS_CFUNC_MAGIC_DEF("getUint16", 1, js_dataview_getValue, JS_CLASS_UINT16_ARRAY ),
+    JS_CFUNC_MAGIC_DEF("getInt32", 1, js_dataview_getValue, JS_CLASS_INT32_ARRAY ),
+    JS_CFUNC_MAGIC_DEF("getUint32", 1, js_dataview_getValue, JS_CLASS_UINT32_ARRAY ),
+#ifdef CONFIG_BIGNUM
+    JS_CFUNC_MAGIC_DEF("getBigInt64", 1, js_dataview_getValue, JS_CLASS_BIG_INT64_ARRAY ),
+    JS_CFUNC_MAGIC_DEF("getBigUint64", 1, js_dataview_getValue, JS_CLASS_BIG_UINT64_ARRAY ),
+#endif
+    JS_CFUNC_MAGIC_DEF("getFloat32", 1, js_dataview_getValue, JS_CLASS_FLOAT32_ARRAY ),
+    JS_CFUNC_MAGIC_DEF("getFloat64", 1, js_dataview_getValue, JS_CLASS_FLOAT64_ARRAY ),
+    JS_CFUNC_MAGIC_DEF("setInt8", 2, js_dataview_setValue, JS_CLASS_INT8_ARRAY ),
+    JS_CFUNC_MAGIC_DEF("setUint8", 2, js_dataview_setValue, JS_CLASS_UINT8_ARRAY ),
+    JS_CFUNC_MAGIC_DEF("setInt16", 2, js_dataview_setValue, JS_CLASS_INT16_ARRAY ),
+    JS_CFUNC_MAGIC_DEF("setUint16", 2, js_dataview_setValue, JS_CLASS_UINT16_ARRAY ),
+    JS_CFUNC_MAGIC_DEF("setInt32", 2, js_dataview_setValue, JS_CLASS_INT32_ARRAY ),
+    JS_CFUNC_MAGIC_DEF("setUint32", 2, js_dataview_setValue, JS_CLASS_UINT32_ARRAY ),
+#ifdef CONFIG_BIGNUM
+    JS_CFUNC_MAGIC_DEF("setBigInt64", 2, js_dataview_setValue, JS_CLASS_BIG_INT64_ARRAY ),
+    JS_CFUNC_MAGIC_DEF("setBigUint64", 2, js_dataview_setValue, JS_CLASS_BIG_UINT64_ARRAY ),
+#endif
+    JS_CFUNC_MAGIC_DEF("setFloat32", 2, js_dataview_setValue, JS_CLASS_FLOAT32_ARRAY ),
+    JS_CFUNC_MAGIC_DEF("setFloat64", 2, js_dataview_setValue, JS_CLASS_FLOAT64_ARRAY ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "DataView", JS_PROP_CONFIGURABLE ),
+};
+
+/* Atomics */
+#ifdef CONFIG_ATOMICS
+
+typedef enum AtomicsOpEnum {
+    ATOMICS_OP_ADD,
+    ATOMICS_OP_AND,
+    ATOMICS_OP_OR,
+    ATOMICS_OP_SUB,
+    ATOMICS_OP_XOR,
+    ATOMICS_OP_EXCHANGE,
+    ATOMICS_OP_COMPARE_EXCHANGE,
+    ATOMICS_OP_LOAD,
+} AtomicsOpEnum;
+
+static void *js_atomics_get_ptr(JSContext *ctx,
+                                int *psize_log2, JSClassID *pclass_id,
+                                JSValueConst obj, JSValueConst idx_val,
+                                BOOL is_int32_array)
+{
+    JSObject *p;
+    JSTypedArray *ta;
+    JSArrayBuffer *abuf;
+    void *ptr;
+    uint64_t idx;
+    BOOL err;
+    int size_log2;
+
+    if (JS_VALUE_GET_TAG(obj) != JS_TAG_OBJECT)
+        goto fail;
+    p = JS_VALUE_GET_OBJ(obj);
+    if (is_int32_array)
+        err = (p->class_id != JS_CLASS_INT32_ARRAY);
+    else
+        err = !(p->class_id >= JS_CLASS_INT8_ARRAY &&
+                p->class_id <= JS_CLASS_UINT32_ARRAY);
+    if (err) {
+    fail:
+        JS_ThrowTypeError(ctx, "integer TypedArray expected");
+        return NULL;
+    }
+    ta = p->u.typed_array;
+    abuf = ta->buffer->u.array_buffer;
+    if (!abuf->shared) {
+        JS_ThrowTypeError(ctx, "not a SharedArrayBuffer TypedArray");
+        return NULL;
+    }
+    if (JS_ToIndex(ctx, &idx, idx_val)) {
+        return NULL;
+    }
+    if (idx >= p->u.array.count) {
+        JS_ThrowRangeError(ctx, "out-of-bound access");
+        return NULL;
+    }
+    size_log2 = typed_array_size_log2(p->class_id);
+    ptr = p->u.array.u.uint8_ptr + ((uintptr_t)idx << size_log2);
+    if (psize_log2)
+        *psize_log2 = size_log2;
+    if (pclass_id)
+        *pclass_id = p->class_id;
+    return ptr;
+}
+
+static JSValue js_atomics_op(JSContext *ctx,
+                             JSValueConst this_obj,
+                             int argc, JSValueConst *argv, int op)
+{
+    int size_log2;
+    uint32_t v, a, rep_val;
+    void *ptr;
+    JSValue ret;
+    JSClassID class_id;
+
+    ptr = js_atomics_get_ptr(ctx, &size_log2, &class_id,
+                             argv[0], argv[1], FALSE);
+    if (!ptr)
+        return JS_EXCEPTION;
+    rep_val = 0;
+    if (op == ATOMICS_OP_LOAD) {
+        v = 0;
+    } else {
+        if (JS_ToUint32(ctx, &v, argv[2]))
+            return JS_EXCEPTION;
+        if (op == ATOMICS_OP_COMPARE_EXCHANGE) {
+            if (JS_ToUint32(ctx, &rep_val, argv[3]))
+                return JS_EXCEPTION;
+        }
+    }
+    switch(op | (size_log2 << 3)) {
+
+#define OP(op_name, func_name)                          \
+    case ATOMICS_OP_ ## op_name | (0 << 3):             \
+       a = func_name((_Atomic(uint8_t) *)ptr, v);       \
+       break;                                           \
+    case ATOMICS_OP_ ## op_name | (1 << 3):             \
+        a = func_name((_Atomic(uint16_t) *)ptr, v);     \
+        break;                                          \
+    case ATOMICS_OP_ ## op_name | (2 << 3):             \
+        a = func_name((_Atomic(uint32_t) *)ptr, v);     \
+        break;
+
+        OP(ADD, atomic_fetch_add)
+        OP(AND, atomic_fetch_and)
+        OP(OR, atomic_fetch_or)
+        OP(SUB, atomic_fetch_sub)
+        OP(XOR, atomic_fetch_xor)
+        OP(EXCHANGE, atomic_exchange)
+#undef OP
+
+    case ATOMICS_OP_LOAD | (0 << 3):
+        a = atomic_load((_Atomic(uint8_t) *)ptr);
+        break;
+    case ATOMICS_OP_LOAD | (1 << 3):
+        a = atomic_load((_Atomic(uint16_t) *)ptr);
+        break;
+    case ATOMICS_OP_LOAD | (2 << 3):
+        a = atomic_load((_Atomic(uint32_t) *)ptr);
+        break;
+
+    case ATOMICS_OP_COMPARE_EXCHANGE | (0 << 3):
+        {
+            uint8_t v1 = v;
+            atomic_compare_exchange_strong((_Atomic(uint8_t) *)ptr, &v1, rep_val);
+            a = v1;
+        }
+        break;
+    case ATOMICS_OP_COMPARE_EXCHANGE | (1 << 3):
+        {
+            uint16_t v1 = v;
+            atomic_compare_exchange_strong((_Atomic(uint16_t) *)ptr, &v1, rep_val);
+            a = v1;
+        }
+        break;
+    case ATOMICS_OP_COMPARE_EXCHANGE | (2 << 3):
+        {
+            uint32_t v1 = v;
+            atomic_compare_exchange_strong((_Atomic(uint32_t) *)ptr, &v1, rep_val);
+            a = v1;
+        }
+        break;
+    default:
+        abort();
+    }
+    switch(class_id) {
+    case JS_CLASS_INT8_ARRAY:
+        a = (int8_t)a;
+        goto done;
+    case JS_CLASS_UINT8_ARRAY:
+        a = (uint8_t)a;
+        goto done;
+    case JS_CLASS_INT16_ARRAY:
+        a = (int16_t)a;
+        goto done;
+    case JS_CLASS_UINT16_ARRAY:
+        a = (uint16_t)a;
+        goto done;
+    case JS_CLASS_INT32_ARRAY:
+    done:
+        ret = JS_NewInt32(ctx, a);
+        break;
+    case JS_CLASS_UINT32_ARRAY:
+        ret = JS_NewUint32(ctx, a);
+        break;
+    default:
+        abort();
+    }
+    return ret;
+}
+
+static JSValue js_atomics_store(JSContext *ctx,
+                                JSValueConst this_obj,
+                                int argc, JSValueConst *argv)
+{
+    int size_log2;
+    uint32_t v;
+    void *ptr;
+    JSValue ret;
+
+    ptr = js_atomics_get_ptr(ctx, &size_log2, NULL, argv[0], argv[1], FALSE);
+    if (!ptr)
+        return JS_EXCEPTION;
+    /* XXX: spec, would be simpler to return the written value */
+    ret = JS_ToIntegerFree(ctx, JS_DupValue(ctx, argv[2]));
+    if (JS_IsException(ret))
+        return ret;
+    if (JS_ToUint32(ctx, &v, ret)) {
+        JS_FreeValue(ctx, ret);
+        return JS_EXCEPTION;
+    }
+    switch(size_log2) {
+    case 0:
+        atomic_store((_Atomic(uint8_t) *)ptr, v);
+        break;
+    case 1:
+        atomic_store((_Atomic(uint16_t) *)ptr, v);
+        break;
+    case 2:
+        atomic_store((_Atomic(uint32_t) *)ptr, v);
+        break;
+    default:
+        abort();
+    }
+    return ret;
+}
+
+static JSValue js_atomics_isLockFree(JSContext *ctx,
+                                     JSValueConst this_obj,
+                                     int argc, JSValueConst *argv)
+{
+    int v, ret;
+    if (JS_ToInt32Sat(ctx, &v, argv[0]))
+        return JS_EXCEPTION;
+    ret = (v == 1 || v == 2 || v == 4);
+    return JS_NewBool(ctx, ret);
+}
+
+typedef struct JSAtomicsWaiter {
+    struct list_head link;
+    BOOL linked;
+    pthread_cond_t cond;
+    int32_t *ptr;
+} JSAtomicsWaiter;
+
+static pthread_mutex_t js_atomics_mutex = PTHREAD_MUTEX_INITIALIZER;
+static struct list_head js_atomics_waiter_list =
+    LIST_HEAD_INIT(js_atomics_waiter_list);
+
+static JSValue js_atomics_wait(JSContext *ctx,
+                               JSValueConst this_obj,
+                               int argc, JSValueConst *argv)
+{
+    int32_t v, *ptr;
+    int64_t timeout;
+    struct timespec ts;
+    JSAtomicsWaiter waiter_s, *waiter;
+    int ret;
+    double d;
+
+    ptr = js_atomics_get_ptr(ctx, NULL, NULL, argv[0], argv[1], TRUE);
+    if (!ptr)
+        return JS_EXCEPTION;
+    if (JS_ToInt32(ctx, &v, argv[2]))
+        return JS_EXCEPTION;
+    if (JS_ToFloat64(ctx, &d, argv[3]))
+        return JS_EXCEPTION;
+    if (isnan(d) || d > INT64_MAX)
+        timeout = INT64_MAX;
+    else if (d < 0)
+        timeout = 0;
+    else
+        timeout = (int64_t)d;
+    if (!ctx->rt->can_block)
+        return JS_ThrowTypeError(ctx, "cannot block in this thread");
+
+    /* XXX: inefficient if large number of waiters, should hash on
+       'ptr' value */
+    /* XXX: use Linux futexes when available ? */
+    pthread_mutex_lock(&js_atomics_mutex);
+    if (*ptr != v) {
+        pthread_mutex_unlock(&js_atomics_mutex);
+        return JS_AtomToString(ctx, JS_ATOM_not_equal);
+    }
+
+    waiter = &waiter_s;
+    waiter->ptr = ptr;
+    pthread_cond_init(&waiter->cond, NULL);
+    waiter->linked = TRUE;
+    list_add_tail(&waiter->link, &js_atomics_waiter_list);
+
+    if (timeout == INT64_MAX) {
+        pthread_cond_wait(&waiter->cond, &js_atomics_mutex);
+        ret = 0;
+    } else {
+        /* XXX: use clock monotonic */
+        clock_gettime(CLOCK_REALTIME, &ts);
+        ts.tv_sec += timeout / 1000;
+        ts.tv_nsec += (timeout % 1000) * 1000000;
+        if (ts.tv_nsec >= 1000000000) {
+            ts.tv_nsec -= 1000000000;
+            ts.tv_sec++;
+        }
+        ret = pthread_cond_timedwait(&waiter->cond, &js_atomics_mutex,
+                                     &ts);
+    }
+    if (waiter->linked)
+        list_del(&waiter->link);
+    pthread_mutex_unlock(&js_atomics_mutex);
+    pthread_cond_destroy(&waiter->cond);
+    if (ret == ETIMEDOUT) {
+        return JS_AtomToString(ctx, JS_ATOM_timed_out);
+    } else {
+        return JS_AtomToString(ctx, JS_ATOM_ok);
+    }
+}
+
+static JSValue js_atomics_wake(JSContext *ctx,
+                               JSValueConst this_obj,
+                               int argc, JSValueConst *argv)
+{
+    struct list_head *el, *el1, waiter_list;
+    int32_t count, n, *ptr;
+    JSAtomicsWaiter *waiter;
+
+    ptr = js_atomics_get_ptr(ctx, NULL, NULL, argv[0], argv[1], TRUE);
+    if (!ptr)
+        return JS_EXCEPTION;
+
+    if (JS_IsUndefined(argv[2])) {
+        count = INT32_MAX;
+    } else {
+        if (JS_ToInt32Clamp(ctx, &count, argv[2], 0, INT32_MAX, 0))
+            return JS_EXCEPTION;
+    }
+
+    n = 0;
+    if (count > 0) {
+        pthread_mutex_lock(&js_atomics_mutex);
+        init_list_head(&waiter_list);
+        list_for_each_safe(el, el1, &js_atomics_waiter_list) {
+            waiter = list_entry(el, JSAtomicsWaiter, link);
+            if (waiter->ptr == ptr) {
+                list_del(&waiter->link);
+                waiter->linked = FALSE;
+                list_add_tail(&waiter->link, &waiter_list);
+                n++;
+                if (n >= count)
+                    break;
+            }
+        }
+        list_for_each(el, &waiter_list) {
+            waiter = list_entry(el, JSAtomicsWaiter, link);
+            pthread_cond_signal(&waiter->cond);
+        }
+        pthread_mutex_unlock(&js_atomics_mutex);
+    }
+    return JS_NewInt32(ctx, n);
+}
+
+static const JSCFunctionListEntry js_atomics_funcs[] = {
+    JS_CFUNC_MAGIC_DEF("add", 3, js_atomics_op, ATOMICS_OP_ADD ),
+    JS_CFUNC_MAGIC_DEF("and", 3, js_atomics_op, ATOMICS_OP_AND ),
+    JS_CFUNC_MAGIC_DEF("or", 3, js_atomics_op, ATOMICS_OP_OR ),
+    JS_CFUNC_MAGIC_DEF("sub", 3, js_atomics_op, ATOMICS_OP_SUB ),
+    JS_CFUNC_MAGIC_DEF("xor", 3, js_atomics_op, ATOMICS_OP_XOR ),
+    JS_CFUNC_MAGIC_DEF("exchange", 3, js_atomics_op, ATOMICS_OP_EXCHANGE ),
+    JS_CFUNC_MAGIC_DEF("compareExchange", 4, js_atomics_op, ATOMICS_OP_COMPARE_EXCHANGE ),
+    JS_CFUNC_MAGIC_DEF("load", 2, js_atomics_op, ATOMICS_OP_LOAD ),
+    JS_CFUNC_DEF("store", 3, js_atomics_store ),
+    JS_CFUNC_DEF("isLockFree", 1, js_atomics_isLockFree ),
+    JS_CFUNC_DEF("wait", 4, js_atomics_wait ),
+    JS_CFUNC_DEF("wake", 3, js_atomics_wake ),
+    JS_PROP_STRING_DEF("[Symbol.toStringTag]", "Atomics", JS_PROP_CONFIGURABLE ),
+};
+
+static const JSCFunctionListEntry js_atomics_obj[] = {
+    JS_OBJECT_DEF("Atomics", js_atomics_funcs, countof(js_atomics_funcs), JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE ),
+};
+
+void JS_AddIntrinsicAtomics(JSContext *ctx)
+{
+    /* add Atomics as autoinit object */
+    JS_SetPropertyFunctionList(ctx, ctx->global_obj, js_atomics_obj, countof(js_atomics_obj));
+}
+
+#endif /* CONFIG_ATOMICS */
+
+void JS_AddIntrinsicTypedArrays(JSContext *ctx)
+{
+    JSValue typed_array_base_proto, typed_array_base_func;
+    JSValueConst array_buffer_func, shared_array_buffer_func;
+    int i;
+
+    ctx->class_proto[JS_CLASS_ARRAY_BUFFER] = JS_NewObject(ctx);
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_ARRAY_BUFFER],
+                               js_array_buffer_proto_funcs,
+                               countof(js_array_buffer_proto_funcs));
+
+    array_buffer_func = JS_NewGlobalCConstructorOnly(ctx, "ArrayBuffer",
+                                                 js_array_buffer_constructor, 1,
+                                                 ctx->class_proto[JS_CLASS_ARRAY_BUFFER]);
+    JS_SetPropertyFunctionList(ctx, array_buffer_func,
+                               js_array_buffer_funcs,
+                               countof(js_array_buffer_funcs));
+
+    ctx->class_proto[JS_CLASS_SHARED_ARRAY_BUFFER] = JS_NewObject(ctx);
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_SHARED_ARRAY_BUFFER],
+                               js_shared_array_buffer_proto_funcs,
+                               countof(js_shared_array_buffer_proto_funcs));
+
+    shared_array_buffer_func = JS_NewGlobalCConstructorOnly(ctx, "SharedArrayBuffer",
+                                                 js_shared_array_buffer_constructor, 1,
+                                                 ctx->class_proto[JS_CLASS_SHARED_ARRAY_BUFFER]);
+    JS_SetPropertyFunctionList(ctx, shared_array_buffer_func,
+                               js_shared_array_buffer_funcs,
+                               countof(js_shared_array_buffer_funcs));
+
+    typed_array_base_proto = JS_NewObject(ctx);
+    JS_SetPropertyFunctionList(ctx, typed_array_base_proto,
+                               js_typed_array_base_proto_funcs,
+                               countof(js_typed_array_base_proto_funcs));
+
+    /* TypedArray.prototype.toString must be the same object as Array.prototype.toString */
+    JSValue obj = JS_GetProperty(ctx, ctx->class_proto[JS_CLASS_ARRAY], JS_ATOM_toString);
+    /* XXX: should use alias method in JSCFunctionListEntry */ //@@@
+    JS_DefinePropertyValue(ctx, typed_array_base_proto, JS_ATOM_toString, obj,
+                           JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+
+    typed_array_base_func = JS_NewCFunction(ctx, js_typed_array_base_constructor,
+                                            "TypedArray", 0);
+    JS_SetPropertyFunctionList(ctx, typed_array_base_func,
+                               js_typed_array_base_funcs,
+                               countof(js_typed_array_base_funcs));
+    JS_SetConstructor(ctx, typed_array_base_func, typed_array_base_proto);
+
+    for(i = JS_CLASS_UINT8C_ARRAY; i < JS_CLASS_UINT8C_ARRAY + JS_TYPED_ARRAY_COUNT; i++) {
+        JSValue func_obj;
+        char buf[ATOM_GET_STR_BUF_SIZE];
+        const char *name;
+
+        ctx->class_proto[i] = JS_NewObjectProto(ctx, typed_array_base_proto);
+        JS_DefinePropertyValueStr(ctx, ctx->class_proto[i],
+                                  "BYTES_PER_ELEMENT",
+                                  JS_NewInt32(ctx, 1 << typed_array_size_log2(i)),
+                                  0);
+        name = JS_AtomGetStr(ctx, buf, sizeof(buf),
+                             JS_ATOM_Uint8ClampedArray + i - JS_CLASS_UINT8C_ARRAY);
+        func_obj = JS_NewCFunction3(ctx, (JSCFunction *)js_typed_array_constructor,
+                                    name, 3, JS_CFUNC_constructor_magic, i,
+                                    typed_array_base_func);
+        JS_NewGlobalCConstructor2(ctx, func_obj, name, ctx->class_proto[i]);
+        JS_DefinePropertyValueStr(ctx, func_obj,
+                                  "BYTES_PER_ELEMENT",
+                                  JS_NewInt32(ctx, 1 << typed_array_size_log2(i)),
+                                  0);
+    }
+    JS_FreeValue(ctx, typed_array_base_proto);
+    JS_FreeValue(ctx, typed_array_base_func);
+
+    /* DataView */
+    ctx->class_proto[JS_CLASS_DATAVIEW] = JS_NewObject(ctx);
+    JS_SetPropertyFunctionList(ctx, ctx->class_proto[JS_CLASS_DATAVIEW],
+                               js_dataview_proto_funcs,
+                               countof(js_dataview_proto_funcs));
+    JS_NewGlobalCConstructorOnly(ctx, "DataView",
+                                 js_dataview_constructor, 1,
+                                 ctx->class_proto[JS_CLASS_DATAVIEW]);
+    /* Atomics */
+#ifdef CONFIG_ATOMICS
+    JS_AddIntrinsicAtomics(ctx);
+#endif
+}
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs.h
new file mode 100755
index 00000000..87152d47
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/quickjs.h
@@ -0,0 +1,909 @@
+/*
+ * QuickJS Javascript Engine
+ *
+ * Copyright (c) 2017-2019 Fabrice Bellard
+ * Copyright (c) 2017-2019 Charlie Gordon
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#ifndef QUICKJS_H
+#define QUICKJS_H
+
+#include <stdio.h>
+#include <stdint.h>
+
+#if defined(_WIN64)
+#define CastToJSValue(v)            v
+#define CastToJSValueConst(v)       v
+#else
+#define CastToJSValue(v)            (JSValue)v
+#define CastToJSValueConst(v)       (JSValueConst)v
+#endif
+
+#if defined(__GNUC__) || defined(__clang__)
+#define js_likely(x)          __builtin_expect(!!(x), 1)
+#define js_unlikely(x)        __builtin_expect(!!(x), 0)
+#define js_force_inline       inline __attribute__((always_inline))
+#define __js_printf_like(f, a)   __attribute__((format(printf, f, a)))
+#else
+#define js_likely(x)     (x)
+#define js_unlikely(x)   (x)
+#define js_force_inline  inline
+#define __js_printf_like(a, b)
+#endif
+
+#define JS_BOOL int
+
+typedef struct JSRuntime JSRuntime;
+typedef struct JSContext JSContext;
+typedef struct JSObject JSObject;
+typedef struct JSClass JSClass;
+typedef uint32_t JSClassID;
+typedef uint32_t JSAtom;
+
+#if defined(__x86_64__) || defined(__aarch64__) || defined(_WIN64)
+#define JS_PTR64
+#define JS_PTR64_DEF(a) a
+#else
+#define JS_PTR64_DEF(a)
+#endif
+
+#ifndef JS_PTR64
+#define JS_NAN_BOXING
+#endif
+
+enum {
+    /* all tags with a reference count are negative */
+    JS_TAG_FIRST       = -10, /* first negative tag */
+    JS_TAG_BIG_INT     = -10,
+    JS_TAG_BIG_FLOAT   = -9,
+    JS_TAG_SYMBOL      = -8,
+    JS_TAG_STRING      = -7,
+    JS_TAG_SHAPE       = -6, /* used internally during GC */
+    JS_TAG_ASYNC_FUNCTION = -5, /* used internally during GC */
+    JS_TAG_VAR_REF     = -4, /* used internally during GC */
+    JS_TAG_MODULE      = -3, /* used internally */
+    JS_TAG_FUNCTION_BYTECODE = -2, /* used internally */
+    JS_TAG_OBJECT      = -1,
+
+    JS_TAG_INT         = 0,
+    JS_TAG_BOOL        = 1,
+    JS_TAG_NULL        = 2,
+    JS_TAG_UNDEFINED   = 3,
+    JS_TAG_UNINITIALIZED = 4,
+    JS_TAG_CATCH_OFFSET = 5,
+    JS_TAG_EXCEPTION   = 6,
+    JS_TAG_FLOAT64     = 7,
+    /* any larger tag is FLOAT64 if JS_NAN_BOXING */
+};
+
+typedef struct JSRefCountHeader {
+    int ref_count;
+} JSRefCountHeader;
+
+#define JS_FLOAT64_NAN NAN
+
+#ifdef CONFIG_CHECK_JSVALUE
+/* JSValue consistency : it is not possible to run the code in this
+   mode, but it is useful to detect simple reference counting
+   errors. It would be interesting to modify a static C analyzer to
+   handle specific annotations (clang has such annotations but only
+   for objective C) */
+typedef struct __JSValue *JSValue;
+typedef const struct __JSValue *JSValueConst;
+
+#define JS_VALUE_GET_TAG(v) (int)((uintptr_t)(v) & 0xf)
+/* same as JS_VALUE_GET_TAG, but return JS_TAG_FLOAT64 with NaN boxing */
+#define JS_VALUE_GET_NORM_TAG(v) JS_VALUE_GET_TAG(v)
+#define JS_VALUE_GET_INT(v) (int)((intptr_t)(v) >> 4)
+#define JS_VALUE_GET_BOOL(v) JS_VALUE_GET_INT(v)
+#define JS_VALUE_GET_FLOAT64(v) (double)JS_VALUE_GET_INT(v)
+#define JS_VALUE_GET_PTR(v) (void *)((intptr_t)(v) & ~0xf)
+
+#define JS_MKVAL(tag, val) (JSValue)(intptr_t)(((val) << 4) | (tag))
+#define JS_MKPTR(tag, p) (JSValue)((intptr_t)(p) | (tag))
+
+#define JS_TAG_IS_FLOAT64(tag) ((unsigned)(tag) == JS_TAG_FLOAT64)
+
+#define JS_NAN JS_MKVAL(JS_TAG_FLOAT64, 1)
+
+static inline JSValue __JS_NewFloat64(JSContext *ctx, double d)
+{
+    return JS_MKVAL(JS_TAG_FLOAT64, (int)d);
+}
+
+#elif defined(JS_NAN_BOXING)
+
+typedef uint64_t JSValue;
+
+#define JSValueConst JSValue
+
+#define JS_VALUE_GET_TAG(v) (int)((v) >> 32)
+#define JS_VALUE_GET_INT(v) (int)(v)
+#define JS_VALUE_GET_BOOL(v) (int)(v)
+#define JS_VALUE_GET_PTR(v) (void *)(intptr_t)(v)
+
+#define JS_MKVAL(tag, val) (((uint64_t)(tag) << 32) | (uint32_t)(val))
+#define JS_MKPTR(tag, ptr) (((uint64_t)(tag) << 32) | (uintptr_t)(ptr))
+
+#define JS_FLOAT64_TAG_ADDEND (0x7ff80000 - JS_TAG_FIRST + 1) /* quiet NaN encoding */
+
+static inline double JS_VALUE_GET_FLOAT64(JSValue v)
+{
+    union {
+        JSValue v;
+        double d;
+    } u;
+    u.v = v;
+    u.v += (uint64_t)JS_FLOAT64_TAG_ADDEND << 32;
+    return u.d;
+}
+
+#define JS_NAN (0x7ff8000000000000 - ((uint64_t)JS_FLOAT64_TAG_ADDEND << 32))
+
+static inline JSValue __JS_NewFloat64(JSContext *ctx, double d)
+{
+    union {
+        double d;
+        uint64_t u64;
+    } u;
+    JSValue v;
+    u.d = d;
+    /* normalize NaN */
+    if (js_unlikely((u.u64 & 0x7fffffffffffffff) > 0x7ff0000000000000))
+        v = JS_NAN;
+    else
+        v = u.u64 - ((uint64_t)JS_FLOAT64_TAG_ADDEND << 32);
+    return v;
+}
+
+#define JS_TAG_IS_FLOAT64(tag) ((unsigned)((tag) - JS_TAG_FIRST) >= (JS_TAG_FLOAT64 - JS_TAG_FIRST))
+
+/* same as JS_VALUE_GET_TAG, but return JS_TAG_FLOAT64 with NaN boxing */
+static inline int JS_VALUE_GET_NORM_TAG(JSValue v)
+{
+    uint32_t tag;
+    tag = JS_VALUE_GET_TAG(v);
+    if (JS_TAG_IS_FLOAT64(tag))
+        return JS_TAG_FLOAT64;
+    else
+        return tag;
+}
+
+#else /* !JS_NAN_BOXING */
+
+typedef union JSValueUnion {
+    int32_t int32;
+    double float64;
+    void *ptr;
+} JSValueUnion;
+
+typedef struct JSValue {
+    JSValueUnion u;
+    int64_t tag;
+} JSValue;
+
+#define JSValueConst JSValue
+
+#define JS_VALUE_GET_TAG(v) ((int32_t)(v).tag)
+/* same as JS_VALUE_GET_TAG, but return JS_TAG_FLOAT64 with NaN boxing */
+#define JS_VALUE_GET_NORM_TAG(v) JS_VALUE_GET_TAG(v)
+#define JS_VALUE_GET_INT(v) ((v).u.int32)
+#define JS_VALUE_GET_BOOL(v) ((v).u.int32)
+#define JS_VALUE_GET_FLOAT64(v) ((v).u.float64)
+#define JS_VALUE_GET_PTR(v) ((v).u.ptr)
+
+//#define JS_MKVAL(tag, val) (JSValue){ .u.int32 = val, tag }
+static inline JSValue JS_MKVAL(uint64_t tag, int32_t val)
+{
+    JSValue value = {0};
+    value.u.int32 = val;
+    value.tag = tag;
+    return value;
+    
+}
+//#define JS_MKPTR(tag, p) (JSValue){ .u.ptr = p, tag }
+static inline JSValue JS_MKPTR(uint64_t tag, void *ptr)
+{
+    JSValue value = {0};
+    value.u.ptr = ptr;
+    value.tag = tag;
+    return value;
+}
+
+#define JS_TAG_IS_FLOAT64(tag) ((unsigned)(tag) == JS_TAG_FLOAT64)
+
+#define JS_NAN (JSValue){ .u.float64 = JS_FLOAT64_NAN, JS_TAG_FLOAT64 }
+/*
+static inline JSValue JS_NAN_()
+{
+    JSValue value = {};
+    value.u.float64 = JS_FLOAT64_NAN;
+    value.tag = JS_TAG_FLOAT64;
+    return value;
+}
+#define JS_NAN JS_NAN_()
+*/
+
+static inline JSValue __JS_NewFloat64(JSContext *ctx, double d)
+{
+    JSValue v;
+    v.tag = JS_TAG_FLOAT64;
+    v.u.float64 = d;
+    return v;
+}
+
+#endif /* !JS_NAN_BOXING */
+
+#define JS_VALUE_IS_BOTH_INT(v1, v2) ((JS_VALUE_GET_TAG(v1) | JS_VALUE_GET_TAG(v2)) == 0)
+#define JS_VALUE_IS_BOTH_FLOAT(v1, v2) (JS_TAG_IS_FLOAT64(JS_VALUE_GET_TAG(v1)) && JS_TAG_IS_FLOAT64(JS_VALUE_GET_TAG(v2)))
+
+#define JS_VALUE_GET_OBJ(v) ((JSObject *)JS_VALUE_GET_PTR(v))
+#define JS_VALUE_GET_STRING(v) ((JSString *)JS_VALUE_GET_PTR(v))
+#define JS_VALUE_HAS_REF_COUNT(v) ((unsigned)JS_VALUE_GET_TAG(v) >= (unsigned)JS_TAG_FIRST)
+
+/* special values */
+#define JS_NULL      JS_MKVAL(JS_TAG_NULL, 0)
+#define JS_UNDEFINED JS_MKVAL(JS_TAG_UNDEFINED, 0)
+#define JS_FALSE     JS_MKVAL(JS_TAG_BOOL, 0)
+#define JS_TRUE      JS_MKVAL(JS_TAG_BOOL, 1)
+#define JS_EXCEPTION JS_MKVAL(JS_TAG_EXCEPTION, 0)
+#define JS_UNINITIALIZED JS_MKVAL(JS_TAG_UNINITIALIZED, 0)
+
+/* flags for object properties */
+#define JS_PROP_CONFIGURABLE  (1 << 0)
+#define JS_PROP_WRITABLE      (1 << 1)
+#define JS_PROP_ENUMERABLE    (1 << 2)
+#define JS_PROP_C_W_E         (JS_PROP_CONFIGURABLE | JS_PROP_WRITABLE | JS_PROP_ENUMERABLE)
+#define JS_PROP_LENGTH        (1 << 3) /* used internally in Arrays */
+#define JS_PROP_TMASK         (3 << 4) /* mask for NORMAL, GETSET, VARREF, AUTOINIT */
+#define JS_PROP_NORMAL         (0 << 4)
+#define JS_PROP_GETSET         (1 << 4)
+#define JS_PROP_VARREF         (2 << 4) /* used internally */
+#define JS_PROP_AUTOINIT       (3 << 4) /* used internally */
+
+/* flags for JS_DefineProperty */
+#define JS_PROP_HAS_SHIFT        8
+#define JS_PROP_HAS_CONFIGURABLE (1 << 8)
+#define JS_PROP_HAS_WRITABLE     (1 << 9)
+#define JS_PROP_HAS_ENUMERABLE   (1 << 10)
+#define JS_PROP_HAS_GET          (1 << 11)
+#define JS_PROP_HAS_SET          (1 << 12)
+#define JS_PROP_HAS_VALUE        (1 << 13)
+
+/* throw an exception if false would be returned
+   (JS_DefineProperty/JS_SetProperty) */
+#define JS_PROP_THROW            (1 << 14)
+/* throw an exception if false would be returned in strict mode
+   (JS_SetProperty) */
+#define JS_PROP_THROW_STRICT     (1 << 15)
+
+#define JS_PROP_NO_ADD           (1 << 16) /* internal use */
+#define JS_PROP_NO_EXOTIC        (1 << 17) /* internal use */
+
+#define JS_DEFAULT_STACK_SIZE (256 * 1024)
+
+/* JS_Eval() flags */
+#define JS_EVAL_TYPE_GLOBAL   (0 << 0) /* global code (default) */
+#define JS_EVAL_TYPE_MODULE   (1 << 0) /* module code */
+#define JS_EVAL_TYPE_DIRECT   (2 << 0) /* direct call (internal use) */
+#define JS_EVAL_TYPE_INDIRECT (3 << 0) /* indirect call (internal use) */
+#define JS_EVAL_TYPE_MASK     (3 << 0)
+
+#define JS_EVAL_FLAG_SHEBANG  (1 << 2) /* skip first line beginning with '#!' */
+#define JS_EVAL_FLAG_STRICT   (1 << 3) /* force 'strict' mode */
+#define JS_EVAL_FLAG_STRIP    (1 << 4) /* force 'strip' mode */
+#define JS_EVAL_FLAG_COMPILE_ONLY (1 << 5) /* internal use */
+
+typedef JSValue JSCFunction(JSContext *ctx, JSValueConst this_val, int argc, JSValueConst *argv);
+typedef JSValue JSCFunctionMagic(JSContext *ctx, JSValueConst this_val, int argc, JSValueConst *argv, int magic);
+typedef JSValue JSCFunctionData(JSContext *ctx, JSValueConst this_val, int argc, JSValueConst *argv, int magic, JSValue *func_data);
+
+typedef struct JSMallocState {
+    size_t malloc_count;
+    size_t malloc_size;
+    size_t malloc_limit;
+    void *opaque; /* user opaque */
+} JSMallocState;
+
+typedef struct JSMallocFunctions {
+    void *(*js_malloc)(JSMallocState *s, size_t size);
+    void (*js_free)(JSMallocState *s, void *ptr);
+    void *(*js_realloc)(JSMallocState *s, void *ptr, size_t size);
+    size_t (*js_malloc_usable_size)(const void *ptr);
+} JSMallocFunctions;
+
+JSRuntime *JS_NewRuntime(void);
+/* info lifetime must exceed that of rt */
+void JS_SetRuntimeInfo(JSRuntime *rt, const char *info);
+void JS_SetMemoryLimit(JSRuntime *rt, size_t limit);
+void JS_SetGCThreshold(JSRuntime *rt, size_t gc_threshold);
+JSRuntime *JS_NewRuntime2(const JSMallocFunctions *mf, void *opaque);
+void JS_FreeRuntime(JSRuntime *rt);
+typedef void JS_MarkFunc(JSRuntime *rt, JSValueConst val);
+void JS_MarkValue(JSRuntime *rt, JSValueConst val, JS_MarkFunc *mark_func);
+void JS_RunGC(JSRuntime *rt);
+JS_BOOL JS_IsLiveObject(JSRuntime *rt, JSValueConst obj);
+JS_BOOL JS_IsInGCSweep(JSRuntime *rt);
+
+JSContext *JS_NewContext(JSRuntime *rt);
+void JS_FreeContext(JSContext *s);
+void *JS_GetContextOpaque(JSContext *ctx);
+void JS_SetContextOpaque(JSContext *ctx, void *opaque);
+JSRuntime *JS_GetRuntime(JSContext *ctx);
+void JS_SetMaxStackSize(JSContext *ctx, size_t stack_size);
+void JS_SetClassProto(JSContext *ctx, JSClassID class_id, JSValue obj);
+JSValue JS_GetClassProto(JSContext *ctx, JSClassID class_id);
+
+/* the following functions are used to select the intrinsic object to
+   save memory */
+JSContext *JS_NewContextRaw(JSRuntime *rt);
+void JS_AddIntrinsicBaseObjects(JSContext *ctx);
+void JS_AddIntrinsicDate(JSContext *ctx);
+void JS_AddIntrinsicEval(JSContext *ctx);
+void JS_AddIntrinsicStringNormalize(JSContext *ctx);
+void JS_AddIntrinsicRegExpCompiler(JSContext *ctx);
+void JS_AddIntrinsicRegExp(JSContext *ctx);
+void JS_AddIntrinsicJSON(JSContext *ctx);
+void JS_AddIntrinsicProxy(JSContext *ctx);
+void JS_AddIntrinsicMapSet(JSContext *ctx);
+void JS_AddIntrinsicTypedArrays(JSContext *ctx);
+void JS_AddIntrinsicPromise(JSContext *ctx);
+JSValue js_string_codePointRange(JSContext *ctx, JSValueConst this_val,
+                                 int argc, JSValueConst *argv);
+
+void *js_malloc_rt(JSRuntime *rt, size_t size);
+void js_free_rt(JSRuntime *rt, void *ptr);
+void *js_realloc_rt(JSRuntime *rt, void *ptr, size_t size);
+size_t js_malloc_usable_size_rt(JSRuntime *rt, const void *ptr);
+void *js_mallocz_rt(JSRuntime *rt, size_t size);
+
+void *js_malloc(JSContext *ctx, size_t size);
+void js_free(JSContext *ctx, void *ptr);
+void *js_realloc(JSContext *ctx, void *ptr, size_t size);
+size_t js_malloc_usable_size(JSContext *ctx, const void *ptr);
+void *js_realloc2(JSContext *ctx, void *ptr, size_t size, size_t *pslack);
+void *js_mallocz(JSContext *ctx, size_t size);
+char *js_strdup(JSContext *ctx, const char *str);
+char *js_strndup(JSContext *ctx, const char *s, size_t n);
+
+typedef struct JSMemoryUsage {
+    int64_t malloc_size, malloc_limit, memory_used_size;
+    int64_t malloc_count;
+    int64_t memory_used_count;
+    int64_t atom_count, atom_size;
+    int64_t str_count, str_size;
+    int64_t obj_count, obj_size;
+    int64_t prop_count, prop_size;
+    int64_t shape_count, shape_size;
+    int64_t js_func_count, js_func_size, js_func_code_size;
+    int64_t js_func_pc2line_count, js_func_pc2line_size;
+    int64_t c_func_count, array_count;
+    int64_t fast_array_count, fast_array_elements;
+    int64_t binary_object_count, binary_object_size;
+} JSMemoryUsage;
+
+void JS_ComputeMemoryUsage(JSRuntime *rt, JSMemoryUsage *s);
+void JS_DumpMemoryUsage(FILE *fp, const JSMemoryUsage *s, JSRuntime *rt);
+
+/* atom support */
+JSAtom JS_NewAtomLen(JSContext *ctx, const char *str, int len);
+JSAtom JS_NewAtom(JSContext *ctx, const char *str);
+JSAtom JS_NewAtomUInt32(JSContext *ctx, uint32_t n);
+JSAtom JS_DupAtom(JSContext *ctx, JSAtom v);
+void JS_FreeAtom(JSContext *ctx, JSAtom v);
+void JS_FreeAtomRT(JSRuntime *rt, JSAtom v);
+JSValue JS_AtomToValue(JSContext *ctx, JSAtom atom);
+JSValue JS_AtomToString(JSContext *ctx, JSAtom atom);
+const char *JS_AtomToCString(JSContext *ctx, JSAtom atom);
+
+/* object class support */
+
+typedef struct JSPropertyEnum {
+    JS_BOOL is_enumerable;
+    JSAtom atom;
+} JSPropertyEnum;
+
+typedef struct JSPropertyDescriptor {
+    int flags;
+    JSValue value;
+    JSValue getter;
+    JSValue setter;
+} JSPropertyDescriptor;
+
+typedef struct JSClassExoticMethods {
+    /* Return -1 if exception (can only happen in case of Proxy object),
+       FALSE if the property does not exists, TRUE if it exists. If 1 is
+       returned, the property descriptor 'desc' is filled if != NULL. */
+    int (*get_own_property)(JSContext *ctx, JSPropertyDescriptor *desc,
+                             JSValueConst obj, JSAtom prop);
+    /* '*ptab' should hold the '*plen' property keys. Return 0 if OK,
+       -1 if exception. The 'is_enumerable' field is ignored.
+    */
+    int (*get_own_property_names)(JSContext *ctx, JSPropertyEnum **ptab,
+                                  uint32_t *plen,
+                                  JSValueConst obj);
+    /* return < 0 if exception, or TRUE/FALSE */
+    int (*delete_property)(JSContext *ctx, JSValueConst obj, JSAtom prop);
+    /* return < 0 if exception or TRUE/FALSE */
+    int (*define_own_property)(JSContext *ctx, JSValueConst this_obj,
+                               JSAtom prop, JSValueConst val,
+                               JSValueConst getter, JSValueConst setter,
+                               int flags);
+    /* The following methods can be emulated with the previous ones,
+       so they are usually not needed */
+    /* return < 0 if exception or TRUE/FALSE */
+    int (*has_property)(JSContext *ctx, JSValueConst obj, JSAtom atom);
+    JSValue (*get_property)(JSContext *ctx, JSValueConst obj, JSAtom atom,
+                            JSValueConst receiver);
+    /* return < 0 if exception or TRUE/FALSE */
+    int (*set_property)(JSContext *ctx, JSValueConst obj, JSAtom atom,
+                        JSValueConst value, JSValueConst receiver, int flags);
+} JSClassExoticMethods;
+
+typedef void JSClassFinalizer(JSRuntime *rt, JSValue val);
+typedef void JSClassGCMark(JSRuntime *rt, JSValueConst val,
+                           JS_MarkFunc *mark_func);
+typedef JSValue JSClassCall(JSContext *ctx, JSValueConst func_obj,
+                            JSValueConst this_val, int argc, JSValueConst *argv);
+
+typedef struct JSClassDef {
+    const char *class_name;
+    JSClassFinalizer *finalizer;
+    JSClassGCMark *gc_mark;
+    JSClassCall *call;
+    /* XXX: suppress this indirection ? It is here only to save memory
+       because only a few classes need these methods */
+    JSClassExoticMethods *exotic;
+} JSClassDef;
+
+JSClassID JS_NewClassID(JSClassID *pclass_id);
+int JS_NewClass(JSRuntime *rt, JSClassID class_id, const JSClassDef *class_def);
+int JS_IsRegisteredClass(JSRuntime *rt, JSClassID class_id);
+
+/* value handling */
+
+static js_force_inline JSValue JS_NewBool(JSContext *ctx, JS_BOOL val)
+{
+    return JS_MKVAL(JS_TAG_BOOL, val);
+}
+
+static js_force_inline JSValue JS_NewInt32(JSContext *ctx, int32_t val)
+{
+    return JS_MKVAL(JS_TAG_INT, val);
+}
+
+static js_force_inline JSValue JS_NewCatchOffset(JSContext *ctx, int32_t val)
+{
+    return JS_MKVAL(JS_TAG_CATCH_OFFSET, val);
+}
+
+JSValue JS_NewInt64(JSContext *ctx, int64_t v);
+
+static js_force_inline JSValue JS_NewFloat64(JSContext *ctx, double d)
+{
+    JSValue v;
+    int32_t val;
+    union {
+        double d;
+        uint64_t u;
+    } u, t;
+    u.d = d;
+    val = (int32_t)d;
+    t.d = val;
+    /* -0 cannot be represented as integer, so we compare the bit
+        representation */
+    if (u.u == t.u) {
+        v = JS_MKVAL(JS_TAG_INT, val);
+    } else {
+        v = __JS_NewFloat64(ctx, d);
+    }
+    return v;
+}
+
+JS_BOOL JS_IsNumber(JSValueConst v);
+
+static inline JS_BOOL JS_IsInteger(JSValueConst v)
+{
+    int tag = JS_VALUE_GET_TAG(v);
+    return tag == JS_TAG_INT || tag == JS_TAG_BIG_INT;
+}
+
+static inline JS_BOOL JS_IsBigFloat(JSValueConst v)
+{
+    int tag = JS_VALUE_GET_TAG(v);
+    return tag == JS_TAG_BIG_FLOAT;
+}
+
+static inline JS_BOOL JS_IsBool(JSValueConst v)
+{
+    return JS_VALUE_GET_TAG(v) == JS_TAG_BOOL;
+}
+
+static inline JS_BOOL JS_IsNull(JSValueConst v)
+{
+    return JS_VALUE_GET_TAG(v) == JS_TAG_NULL;
+}
+
+static inline JS_BOOL JS_IsUndefined(JSValueConst v)
+{
+    return JS_VALUE_GET_TAG(v) == JS_TAG_UNDEFINED;
+}
+
+static inline JS_BOOL JS_IsException(JSValueConst v)
+{
+    return js_unlikely(JS_VALUE_GET_TAG(v) == JS_TAG_EXCEPTION);
+}
+
+static inline JS_BOOL JS_IsUninitialized(JSValueConst v)
+{
+    return js_unlikely(JS_VALUE_GET_TAG(v) == JS_TAG_UNINITIALIZED);
+}
+
+static inline JS_BOOL JS_IsString(JSValueConst v)
+{
+    return JS_VALUE_GET_TAG(v) == JS_TAG_STRING;
+}
+
+static inline JS_BOOL JS_IsSymbol(JSValueConst v)
+{
+    return JS_VALUE_GET_TAG(v) == JS_TAG_SYMBOL;
+}
+
+static inline JS_BOOL JS_IsObject(JSValueConst v)
+{
+    return JS_VALUE_GET_TAG(v) == JS_TAG_OBJECT;
+}
+
+JSValue JS_Throw(JSContext *ctx, JSValue obj);
+JSValue JS_GetException(JSContext *ctx);
+JS_BOOL JS_IsError(JSContext *ctx, JSValueConst val);
+void JS_EnableIsErrorProperty(JSContext *ctx, JS_BOOL enable);
+void JS_ResetUncatchableError(JSContext *ctx);
+JSValue JS_NewError(JSContext *ctx);
+JSValue __js_printf_like(2, 3) JS_ThrowSyntaxError(JSContext *ctx, const char *fmt, ...);
+JSValue __js_printf_like(2, 3) JS_ThrowTypeError(JSContext *ctx, const char *fmt, ...);
+JSValue __js_printf_like(2, 3) JS_ThrowReferenceError(JSContext *ctx, const char *fmt, ...);
+JSValue __js_printf_like(2, 3) JS_ThrowRangeError(JSContext *ctx, const char *fmt, ...);
+JSValue __js_printf_like(2, 3) JS_ThrowInternalError(JSContext *ctx, const char *fmt, ...);
+JSValue JS_ThrowOutOfMemory(JSContext *ctx);
+
+void __JS_FreeValue(JSContext *ctx, JSValue v);
+static inline void JS_FreeValue(JSContext *ctx, JSValue v)
+{
+    if (JS_VALUE_HAS_REF_COUNT(v)) {
+        JSRefCountHeader *p = (JSRefCountHeader *)JS_VALUE_GET_PTR(v);
+        if (--p->ref_count <= 0) {
+            __JS_FreeValue(ctx, v);
+        }
+    }
+}
+void __JS_FreeValueRT(JSRuntime *rt, JSValue v);
+static inline void JS_FreeValueRT(JSRuntime *rt, JSValue v)
+{
+    if (JS_VALUE_HAS_REF_COUNT(v)) {
+        JSRefCountHeader *p = (JSRefCountHeader *)JS_VALUE_GET_PTR(v);
+        if (--p->ref_count <= 0) {
+            __JS_FreeValueRT(rt, v);
+        }
+    }
+}
+
+static inline JSValue JS_DupValue(JSContext *ctx, JSValueConst v)
+{
+    if (JS_VALUE_HAS_REF_COUNT(v)) {
+        JSRefCountHeader *p = (JSRefCountHeader *)JS_VALUE_GET_PTR(v);
+        p->ref_count++;
+    }
+    return CastToJSValue(v);
+}
+
+int JS_ToBool(JSContext *ctx, JSValueConst val); /* return -1 for JS_EXCEPTION */
+int JS_ToInt32(JSContext *ctx, int32_t *pres, JSValueConst val);
+static int inline JS_ToUint32(JSContext *ctx, uint32_t *pres, JSValueConst val)
+{
+    return JS_ToInt32(ctx, (int32_t*)pres, val);
+}
+int JS_ToInt64(JSContext *ctx, int64_t *pres, JSValueConst val);
+int JS_ToIndex(JSContext *ctx, uint64_t *plen, JSValueConst val);
+int JS_ToFloat64(JSContext *ctx, double *pres, JSValueConst val);
+
+JSValue JS_NewStringLen(JSContext *ctx, const char *str1, int len1);
+JSValue JS_NewString(JSContext *ctx, const char *str);
+JSValue JS_NewAtomString(JSContext *ctx, const char *str);
+JSValue JS_ToString(JSContext *ctx, JSValueConst val);
+JSValue JS_ToPropertyKey(JSContext *ctx, JSValueConst val);
+const char *JS_ToCStringLen(JSContext *ctx, int *plen, JSValueConst val1, JS_BOOL cesu8);
+static inline const char *JS_ToCString(JSContext *ctx, JSValueConst val1)
+{
+    return JS_ToCStringLen(ctx, NULL, val1, 0);
+}
+void JS_FreeCString(JSContext *ctx, const char *ptr);
+
+JSValue JS_NewObjectProtoClass(JSContext *ctx, JSValueConst proto, JSClassID class_id);
+JSValue JS_NewObjectClass(JSContext *ctx, int class_id);
+JSValue JS_NewObjectProto(JSContext *ctx, JSValueConst proto);
+JSValue JS_NewObject(JSContext *ctx);
+
+JS_BOOL JS_IsFunction(JSContext* ctx, JSValueConst val);
+JS_BOOL JS_IsConstructor(JSContext* ctx, JSValueConst val);
+
+JSValue JS_NewArray(JSContext *ctx);
+int JS_IsArray(JSContext *ctx, JSValueConst val);
+
+JSValue JS_GetPropertyInternal(JSContext *ctx, JSValueConst obj,
+                               JSAtom prop, JSValueConst receiver,
+                               JS_BOOL throw_ref_error);
+static js_force_inline JSValue JS_GetProperty(JSContext *ctx, JSValueConst this_obj,
+                                              JSAtom prop)
+{
+    return JS_GetPropertyInternal(ctx, this_obj, prop, this_obj, 0);
+}
+JSValue JS_GetPropertyStr(JSContext *ctx, JSValueConst this_obj,
+                          const char *prop);
+JSValue JS_GetPropertyUint32(JSContext *ctx, JSValueConst this_obj,
+                             uint32_t idx);
+
+int JS_SetPropertyInternal(JSContext *ctx, JSValueConst this_obj,
+                           JSAtom prop, JSValue val,
+                           int flags);
+static inline int JS_SetProperty(JSContext *ctx, JSValueConst this_obj,
+                                 JSAtom prop, JSValue val)
+{
+    return JS_SetPropertyInternal(ctx, this_obj, prop, val, JS_PROP_THROW);
+}
+int JS_SetPropertyUint32(JSContext *ctx, JSValueConst this_obj,
+                         uint32_t idx, JSValue val);
+int JS_SetPropertyInt64(JSContext *ctx, JSValueConst this_obj,
+                        int64_t idx, JSValue val);
+int JS_SetPropertyStr(JSContext *ctx, JSValueConst this_obj,
+                      const char *prop, JSValue val);
+int JS_HasProperty(JSContext *ctx, JSValueConst this_obj, JSAtom prop);
+int JS_IsExtensible(JSContext *ctx, JSValueConst obj);
+int JS_PreventExtensions(JSContext *ctx, JSValueConst obj);
+int JS_DeleteProperty(JSContext *ctx, JSValueConst obj, JSAtom prop, int flags);
+int JS_SetPrototype(JSContext *ctx, JSValueConst obj, JSValueConst proto_val);
+JSValueConst JS_GetPrototype(JSContext *ctx, JSValueConst val);
+
+JSValue JS_ParseJSON(JSContext *ctx, const char *buf, size_t buf_len,
+                     const char *filename);
+JSValue JS_Call(JSContext *ctx, JSValueConst func_obj, JSValueConst this_obj,
+                int argc, JSValueConst *argv);
+JSValue JS_Invoke(JSContext *ctx, JSValueConst this_val, JSAtom atom,
+                  int argc, JSValueConst *argv);
+JSValue JS_CallConstructor(JSContext *ctx, JSValueConst func_obj,
+                           int argc, JSValueConst *argv);
+JSValue JS_CallConstructor2(JSContext *ctx, JSValueConst func_obj,
+                            JSValueConst new_target,
+                            int argc, JSValueConst *argv);
+JSValue JS_Eval(JSContext *ctx, const char *input, size_t input_len,
+                const char *filename, int eval_flags);
+#define JS_EVAL_BINARY_LOAD_ONLY (1 << 0) /* only load the module */
+JSValue JS_EvalBinary(JSContext *ctx,
+                      const uint8_t *buf, size_t buf_len, int flags);
+JSValue JS_GetGlobalObject(JSContext *ctx);
+int JS_IsInstanceOf(JSContext *ctx, JSValueConst val, JSValueConst obj);
+int JS_DefineProperty(JSContext *ctx, JSValueConst this_obj,
+                      JSAtom prop, JSValueConst val,
+                      JSValueConst getter, JSValueConst setter, int flags);
+int JS_DefinePropertyValue(JSContext *ctx, JSValueConst this_obj,
+                           JSAtom prop, JSValue val, int flags);
+int JS_DefinePropertyValueUint32(JSContext *ctx, JSValueConst this_obj,
+                                 uint32_t idx, JSValue val, int flags);
+int JS_DefinePropertyValueStr(JSContext *ctx, JSValueConst this_obj,
+                              const char *prop, JSValue val, int flags);
+int JS_DefinePropertyGetSet(JSContext *ctx, JSValueConst this_obj,
+                            JSAtom prop, JSValue getter, JSValue setter,
+                            int flags);
+void JS_SetOpaque(JSValue obj, void *opaque);
+void *JS_GetOpaque(JSValueConst obj, JSClassID class_id);
+void *JS_GetOpaque2(JSContext *ctx, JSValueConst obj, JSClassID class_id);
+
+typedef void JSFreeArrayBufferDataFunc(JSRuntime *rt, void *opaque, void *ptr);
+JSValue JS_NewArrayBuffer(JSContext *ctx, uint8_t *buf, size_t len,
+                          JSFreeArrayBufferDataFunc *free_func, void *opaque,
+                          JS_BOOL is_shared);
+JSValue JS_NewArrayBufferCopy(JSContext *ctx, const uint8_t *buf, size_t len);
+void JS_DetachArrayBuffer(JSContext *ctx, JSValueConst obj);
+uint8_t *JS_GetArrayBuffer(JSContext *ctx, size_t *psize, JSValueConst obj);
+
+/* return != 0 if the JS code needs to be interrupted */
+typedef int JSInterruptHandler(JSRuntime *rt, void *opaque);
+void JS_SetInterruptHandler(JSRuntime *rt, JSInterruptHandler *cb, void *opaque);
+/* if can_block is TRUE, Atomics.wait() can be used */
+void JS_SetCanBlock(JSRuntime *rt, JS_BOOL can_block);
+
+typedef struct JSModuleDef JSModuleDef;
+
+/* return the module specifier (allocated with js_malloc()) or NULL if
+   exception */
+typedef char *JSModuleNormalizeFunc(JSContext *ctx,
+                                    const char *module_base_name,
+                                    const char *module_name, void *opaque);
+typedef JSModuleDef *JSModuleLoaderFunc(JSContext *ctx,
+                                        const char *module_name, void *opaque);
+
+/* module_normalize = NULL is allowed and invokes the default module
+   filename normalizer */
+void JS_SetModuleLoaderFunc(JSRuntime *rt,
+                            JSModuleNormalizeFunc *module_normalize,
+                            JSModuleLoaderFunc *module_loader, void *opaque);
+
+/* JS Job support */
+
+typedef JSValue JSJobFunc(JSContext *ctx, int argc, JSValueConst *argv);
+int JS_EnqueueJob(JSContext *ctx, JSJobFunc *job_func, int argc, JSValueConst *argv);
+
+JS_BOOL JS_IsJobPending(JSRuntime *rt);
+int JS_ExecutePendingJob(JSRuntime *rt, JSContext **pctx);
+
+/* Object Writer/Reader (currently only used to handle precompiled code) */
+#define JS_WRITE_OBJ_BYTECODE (1 << 0) /* allow function/module */
+#define JS_WRITE_OBJ_BSWAP    (1 << 1) /* byte swapped output */
+uint8_t *JS_WriteObject(JSContext *ctx, size_t *psize, JSValueConst obj,
+                        int flags);
+#define JS_READ_OBJ_BYTECODE  (1 << 0) /* allow function/module */
+#define JS_READ_OBJ_ROM_DATA  (1 << 1) /* avoid duplicating 'buf' data */
+JSValue JS_ReadObject(JSContext *ctx, const uint8_t *buf, size_t buf_len,
+                      int flags);
+JSValue JS_EvalFunction(JSContext *ctx, JSValue fun_obj, JSValueConst this_obj);
+
+/* C function definition */
+typedef enum JSCFunctionEnum {  /* XXX: should rename for namespace isolation */
+    JS_CFUNC_generic,
+    JS_CFUNC_generic_magic,
+    JS_CFUNC_constructor,
+    JS_CFUNC_constructor_magic,
+    JS_CFUNC_constructor_or_func,
+    JS_CFUNC_constructor_or_func_magic,
+    JS_CFUNC_f_f,
+    JS_CFUNC_f_f_f,
+    JS_CFUNC_getter,
+    JS_CFUNC_setter,
+    JS_CFUNC_getter_magic,
+    JS_CFUNC_setter_magic,
+    JS_CFUNC_iterator_next,
+} JSCFunctionEnum;
+
+typedef union JSCFunctionType {
+    JSCFunction *generic;
+    JSValue (*generic_magic)(JSContext *ctx, JSValueConst this_val, int argc, JSValueConst *argv, int magic);
+    JSCFunction *constructor;
+    JSValue (*constructor_magic)(JSContext *ctx, JSValueConst new_target, int argc, JSValueConst *argv, int magic);
+    JSCFunction *constructor_or_func;
+    double (*f_f)(double);
+    double (*f_f_f)(double, double);
+    JSValue (*getter)(JSContext *ctx, JSValueConst this_val);
+    JSValue (*setter)(JSContext *ctx, JSValueConst this_val, JSValueConst val);
+    JSValue (*getter_magic)(JSContext *ctx, JSValueConst this_val, int magic);
+    JSValue (*setter_magic)(JSContext *ctx, JSValueConst this_val, JSValueConst val, int magic);
+    JSValue (*iterator_next)(JSContext *ctx, JSValueConst this_val,
+                             int argc, JSValueConst *argv, int *pdone, int magic);
+} JSCFunctionType;
+
+JSValue JS_NewCFunction2(JSContext *ctx, JSCFunction *func,
+                         const char *name,
+                         int length, JSCFunctionEnum cproto, int magic);
+JSValue JS_NewCFunctionData(JSContext *ctx, JSCFunctionData *func,
+                            int length, int magic, int data_len,
+                            JSValueConst *data);
+
+static inline JSValue JS_NewCFunction(JSContext *ctx, JSCFunction *func, const char *name,
+                                      int length)
+{
+    return JS_NewCFunction2(ctx, func, name, length, JS_CFUNC_generic, 0);
+}
+
+static inline JSValue JS_NewCFunctionMagic(JSContext *ctx, JSCFunctionMagic *func,
+                                           const char *name,
+                                           int length, JSCFunctionEnum cproto, int magic)
+{
+    return JS_NewCFunction2(ctx, (JSCFunction *)func, name, length, cproto, magic);
+}
+
+/* C property definition */
+
+typedef struct JSCFunctionListEntry {
+    const char *name;
+    uint8_t prop_flags;
+    uint8_t def_type;
+    int16_t magic;
+    union {
+        struct {
+            uint8_t length; /* XXX: should move outside union */
+            uint8_t cproto; /* XXX: should move outside union */
+            JSCFunctionType cfunc;
+        } func;
+        struct {
+            JSCFunctionType get;
+            JSCFunctionType set;
+        } getset;
+        struct {
+            const char *name;
+            int base;
+        } alias;
+        struct {
+            const struct JSCFunctionListEntry *tab;
+            int len;
+        } prop_list;
+        const char *str;
+        int32_t i32;
+        int64_t i64;
+        double f64;
+    } u;
+} JSCFunctionListEntry;
+
+#define JS_DEF_CFUNC          0
+#define JS_DEF_CGETSET        1
+#define JS_DEF_CGETSET_MAGIC  2
+#define JS_DEF_PROP_STRING    3
+#define JS_DEF_PROP_INT32     4
+#define JS_DEF_PROP_INT64     5
+#define JS_DEF_PROP_DOUBLE    6
+#define JS_DEF_PROP_UNDEFINED  7
+#define JS_DEF_OBJECT         8
+#define JS_DEF_ALIAS          9
+
+#define JS_CFUNC_DEF(name, length, func1) { name, JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE, JS_DEF_CFUNC, 0, .u.func = { length, JS_CFUNC_generic, { .generic = func1 } } }
+#define JS_CFUNC_MAGIC_DEF(name, length, func1, magic) { name, JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE, JS_DEF_CFUNC, magic, .u.func = { length, JS_CFUNC_generic_magic, { .generic_magic = func1 } } }
+#if defined(_MSC_VER)
+#define JS_CFUNC_SPECIAL_DEF(name, length, cproto, func1) { name, JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE, JS_DEF_CFUNC, 0, /*.u.func = */{ length, JS_CFUNC_ ## cproto, { /*.cproto = */func1 } } }
+#else
+#define JS_CFUNC_SPECIAL_DEF(name, length, cproto, func1) { name, JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE, JS_DEF_CFUNC, 0, .u.func = { length, JS_CFUNC_ ## cproto, { .cproto = func1 } } }
+#endif
+#define JS_ITERATOR_NEXT_DEF(name, length, func1, magic) { name, JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE, JS_DEF_CFUNC, magic, .u.func = { length, JS_CFUNC_iterator_next, { .iterator_next = func1 } } }
+#define JS_CGETSET_DEF(name, fgetter, fsetter) { name, JS_PROP_CONFIGURABLE, JS_DEF_CGETSET, 0, .u.getset.get.getter = fgetter, .u.getset.set.setter = fsetter }
+#define JS_CGETSET_MAGIC_DEF(name, fgetter, fsetter, magic) { name, JS_PROP_CONFIGURABLE, JS_DEF_CGETSET_MAGIC, magic, .u.getset.get.getter_magic = fgetter, .u.getset.set.setter_magic = fsetter }
+#define JS_PROP_STRING_DEF(name, cstr, prop_flags) { name, prop_flags, JS_DEF_PROP_STRING, 0, .u.str = cstr }
+#define JS_PROP_INT32_DEF(name, val, prop_flags) { name, prop_flags, JS_DEF_PROP_INT32, 0, .u.i32 = val }
+#define JS_PROP_INT64_DEF(name, val, prop_flags) { name, prop_flags, JS_DEF_PROP_INT64, 0, .u.i64 = val }
+#define JS_PROP_DOUBLE_DEF(name, val, prop_flags) { name, prop_flags, JS_DEF_PROP_DOUBLE, 0, .u.f64 = val }
+#define JS_PROP_UNDEFINED_DEF(name, prop_flags) { name, prop_flags, JS_DEF_PROP_UNDEFINED, 0, .u.i32 = 0 }
+#define JS_OBJECT_DEF(name, tab, len, prop_flags) { name, prop_flags, JS_DEF_OBJECT, 0, .u.prop_list = { tab, len } }
+#define JS_ALIAS_DEF(name, from) { name, JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE, JS_DEF_ALIAS, 0, .u.alias = { from, -1 } }
+#define JS_ALIAS_BASE_DEF(name, from, base) { name, JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE, JS_DEF_ALIAS, 0, .u.alias = { from, base } }
+
+void JS_SetPropertyFunctionList(JSContext *ctx, JSValueConst obj,
+                                const JSCFunctionListEntry *tab,
+                                int len);
+
+/* C module definition */
+
+typedef int JSModuleInitFunc(JSContext *ctx, JSModuleDef *m);
+
+JSModuleDef *JS_NewCModule(JSContext *ctx, const char *name_str,
+                           JSModuleInitFunc *func);
+/* can only be called before the module is instantiated */
+int JS_AddModuleExport(JSContext *ctx, JSModuleDef *m, const char *name_str);
+int JS_AddModuleExportList(JSContext *ctx, JSModuleDef *m,
+                           const JSCFunctionListEntry *tab, int len);
+/* can only be called after the module is instantiated */
+int JS_SetModuleExport(JSContext *ctx, JSModuleDef *m, const char *export_name,
+                       JSValue val);
+int JS_SetModuleExportList(JSContext *ctx, JSModuleDef *m,
+                           const JSCFunctionListEntry *tab, int len);
+
+#undef js_unlikely
+#undef js_force_inline
+
+// https://www.freelists.org/post/quickjs-devel/how-to-iterator-over-a-JSValue-object,1
+int js_get_fast_array(JSContext *ctx, JSValueConst obj,
+                              JSValue **arrpp, uint32_t *countp);
+
+#endif /* QUICKJS_H */
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/readme.txt b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/readme.txt
new file mode 100755
index 00000000..789521d5
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/readme.txt
@@ -0,0 +1 @@
+The main documentation is in doc/quickjs.pdf or doc/quickjs.html.
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/release.sh b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/release.sh
new file mode 100755
index 00000000..8bce1d3f
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/release.sh
@@ -0,0 +1,85 @@
+#!/bin/sh
+# Release the QuickJS source code
+
+set -e
+
+version=`cat VERSION`
+
+if [ "$1" = "-h" ] ; then
+    echo "release.sh [all]"
+    echo ""
+    echo "all: build all the archives. Otherwise only build the quickjs source archive."
+    exit 1
+fi
+
+    
+if [ "$1" = "all" ] ; then
+
+#################################################"
+# unicode data
+
+d="quickjs-${version}"
+name="quickjs-unicode-data-${version}"
+outdir="/tmp/${d}"
+
+rm -rf $outdir
+mkdir -p $outdir $outdir/unicode
+
+cp unicode/* $outdir/unicode
+
+( cd /tmp && tar Jcvf /tmp/${name}.tar.xz ${d} )
+
+#################################################"
+# all tests
+
+d="quickjs-${version}"
+name="quickjs-tests-${version}"
+outdir="/tmp/${d}"
+
+rm -rf $outdir
+mkdir -p $outdir $outdir/test262o $outdir/test262 $outdir/tests 
+
+cp -a test262o/test $outdir/test262o
+
+cp -a test262/test test262/harness $outdir/test262
+
+cp -a tests/bench-v8 $outdir/tests
+
+( cd /tmp && tar Jcvf /tmp/${name}.tar.xz ${d} )
+
+fi # all
+
+#################################################"
+# quickjs
+
+make build_doc
+
+d="quickjs-${version}"
+outdir="/tmp/${d}"
+
+rm -rf $outdir
+mkdir -p $outdir $outdir/doc $outdir/tests $outdir/examples
+
+cp Makefile VERSION TODO readme.txt release.sh \
+   qjs.c qjsc.c qjscalc.js repl.js \
+   quickjs.c quickjs.h quickjs-atom.h \
+   quickjs-libc.c quickjs-libc.h quickjs-opcode.h \
+   cutils.c cutils.h list.h \
+   libregexp.c libregexp.h libregexp-opcode.h \
+   libunicode.c libunicode.h libunicode-table.h \
+   libbf.c libbf.h \
+   jscompress.c unicode_gen.c unicode_gen_def.h \
+   bjson.c \
+   run-test262.c test262o.conf test262.conf test262bn.conf \
+   test262o_errors.txt test262_errors.txt test262bn_errors.txt \
+   $outdir
+
+cp tests/*.js tests/*.patch $outdir/tests
+
+cp examples/*.js examples/*.c $outdir/examples
+
+cp doc/quickjs.texi doc/quickjs.pdf doc/quickjs.html \
+   doc/jsbignum.texi doc/jsbignum.html doc/jsbignum.pdf \
+   $outdir/doc 
+
+( cd /tmp && tar Jcvf /tmp/${d}.tar.xz ${d} )
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/repl.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/repl.js
new file mode 100755
index 00000000..b4d4b006
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/repl.js
@@ -0,0 +1,1504 @@
+/*
+ * QuickJS Read Eval Print Loop
+ * 
+ * Copyright (c) 2017-2019 Fabrice Bellard
+ * Copyright (c) 2017-2019 Charlie Gordon
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+"use strip";
+
+import * as std from "std";
+import * as os from "os";
+
+(function(g) {
+    /* add a 'global' binding */
+    g.global = std.global;
+    
+    /* close global objects */
+    var Object = g.Object;
+    var String = g.String;
+    var Array = g.Array;
+    var Date = g.Date;
+    var Math = g.Math;
+    var isFinite = g.isFinite;
+    var parseFloat = g.parseFloat;
+
+    /* XXX: use preprocessor ? */
+    var config_numcalc = (typeof os.open === "undefined");
+    var has_jscalc = (typeof Fraction === "function");
+    var has_bignum = (typeof BigFloat === "function");
+    
+    var colors = {
+        none:    "\x1b[0m",
+        black:   "\x1b[30m",
+        red:     "\x1b[31m",
+        green:   "\x1b[32m",
+        yellow:  "\x1b[33m",
+        blue:    "\x1b[34m",
+        magenta: "\x1b[35m",
+        cyan:    "\x1b[36m",
+        white:   "\x1b[37m",
+        gray:    "\x1b[30;1m",
+        grey:    "\x1b[30;1m",
+        bright_red:     "\x1b[31;1m",
+        bright_green:   "\x1b[32;1m",
+        bright_yellow:  "\x1b[33;1m",
+        bright_blue:    "\x1b[34;1m",
+        bright_magenta: "\x1b[35;1m",
+        bright_cyan:    "\x1b[36;1m",
+        bright_white:   "\x1b[37;1m",
+    };
+
+    var styles;
+    if (config_numcalc) {
+        styles = {
+            'default':    'black',
+            'comment':    'white',
+            'string':     'green',
+            'regex':      'cyan',
+            'number':     'green',
+            'keyword':    'blue',
+            'function':   'gray',
+            'type':       'bright_magenta',
+            'identifier': 'yellow',
+            'error':      'bright_red',
+            'result':     'black',
+            'error_msg':  'bright_red',
+        };
+    } else {
+        styles = {
+            'default':    'bright_green',
+            'comment':    'white',
+            'string':     'bright_cyan',
+            'regex':      'cyan',
+            'number':     'green',
+            'keyword':    'bright_white',
+            'function':   'bright_yellow',
+            'type':       'bright_magenta',
+            'identifier': 'bright_green',
+            'error':      'red',
+            'result':     'bright_white',
+            'error_msg':  'bright_red',
+        };
+    }
+
+    var history = [];
+    var clip_board = "";
+    var prec;
+    var expBits;
+    var log2_10;
+    
+    var pstate = "";
+    var prompt = "";
+    var plen = 0;
+    var ps1;
+    if (config_numcalc)
+        ps1 = "> ";
+    else
+        ps1 = "qjs > ";
+    var ps2 = "  ... ";
+    var utf8 = true;
+    var show_time = false;
+    var show_colors = true;
+    var eval_time = 0;
+    
+    var mexpr = "";
+    var level = 0;
+    var cmd = "";
+    var cursor_pos = 0;
+    var last_cmd = "";
+    var last_cursor_pos = 0;
+    var history_index;
+    var this_fun, last_fun;
+    var quote_flag = false;
+
+    var utf8_state = 0;
+    var utf8_val = 0;
+
+    var term_fd;
+    var term_read_buf;
+    var term_width;
+    /* current X position of the cursor in the terminal */
+    var term_cursor_x = 0; 
+    
+    function termInit() {
+        var tab;
+        term_fd = std.in.fileno();
+        
+        /* get the terminal size */
+        term_width = 80;
+        if (os.isatty(term_fd)) {
+            if (os.ttyGetWinSize) {
+                tab = os.ttyGetWinSize(term_fd);
+                if (tab)
+                    term_width = tab[0];
+            }
+            if (os.ttySetRaw) {
+                /* set the TTY to raw mode */
+                os.ttySetRaw(term_fd);
+            }
+        }
+
+        /* install a Ctrl-C signal handler */
+        os.signal(os.SIGINT, sigint_handler);
+
+        /* install a handler to read stdin */
+        term_read_buf = new Uint8Array(64);
+        os.setReadHandler(term_fd, term_read_handler);
+    }
+
+    function sigint_handler() {
+        /* send Ctrl-C to readline */
+        handle_byte(3);
+    }
+    
+    function term_read_handler() {
+        var l, i;
+        l = os.read(term_fd, term_read_buf.buffer, 0, term_read_buf.length);
+        for(i = 0; i < l; i++)
+            handle_byte(term_read_buf[i]);
+    }
+    
+    function handle_byte(c) {
+        if (!utf8) {
+            handle_char(c);
+        } else if (utf8_state !== 0 && (c >= 0x80 && c < 0xc0)) {
+            utf8_val = (utf8_val << 6) | (c & 0x3F);
+            utf8_state--;
+            if (utf8_state === 0) {
+                handle_char(utf8_val);
+            }
+        } else if (c >= 0xc0 && c < 0xf8) {
+            utf8_state = 1 + (c >= 0xe0) + (c >= 0xf0);
+            utf8_val = c & ((1 << (6 - utf8_state)) - 1);
+        } else {
+            utf8_state = 0;
+            handle_char(c);
+        }
+    }
+    
+    function is_alpha(c) {
+        return typeof c === "string" &&
+            ((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z'));
+    }
+    
+    function is_digit(c) {
+        return typeof c === "string" && (c >= '0' && c <= '9');
+    }
+
+    function is_word(c) {
+        return typeof c === "string" &&
+            (is_alpha(c) || is_digit(c) || c == '_' || c == '$');
+    }
+
+    function is_balanced(a, b) {
+        switch (a + b) {
+        case "()":
+        case "[]":
+        case "{}":
+            return true;
+        }
+        return false;
+    }
+
+    function print_color_text(str, start, style_names) {
+        var i, j;
+        for (j = start; j < str.length;) {
+            var style = style_names[i = j];
+            while (++j < str.length && style_names[j] == style)
+                continue;
+            std.puts(colors[styles[style] || 'default']);
+            std.puts(str.substring(i, j));
+            std.puts(colors['none']);
+        }
+    }
+
+    function print_csi(n, code) {
+        std.puts("\x1b[" + ((n != 1) ? n : "") + code);
+    }
+
+    function move_cursor(delta) {
+        var i, l;
+        if (delta > 0) {
+            while (delta != 0) {
+                if (term_cursor_x == (term_width - 1)) {
+                    std.puts("\n"); /* translated to CRLF */
+                    term_cursor_x = 0;
+                    delta--;
+                } else {
+                    l = Math.min(term_width - 1 - term_cursor_x, delta);
+                    print_csi(l, "C"); /* right */
+                    delta -= l; 
+                    term_cursor_x += l;
+                }
+            }
+        } else {
+            delta = -delta;
+            while (delta != 0) {
+                if (term_cursor_x == 0) {
+                    print_csi(1, "A"); /* up */
+                    print_csi(term_width - 1, "C"); /* right */
+                    delta--;
+                    term_cursor_x = term_width - 1;
+                } else {
+                    l = Math.min(delta, term_cursor_x);
+                    print_csi(l, "D"); /* left */
+                    delta -= l;
+                    term_cursor_x -= l;
+                }
+            }
+        }
+    }
+
+    function update() {
+        var i;
+
+        if (cmd != last_cmd) {
+            if (!show_colors && last_cmd.substring(0, last_cursor_pos) == cmd.substring(0, last_cursor_pos)) {
+                /* optimize common case */
+                std.puts(cmd.substring(last_cursor_pos));
+            } else {
+                /* goto the start of the line */
+                move_cursor(-last_cursor_pos);
+                if (show_colors) {
+                    var str = mexpr ? mexpr + '\n' + cmd : cmd;
+                    var start = str.length - cmd.length;
+                    var colorstate = colorize_js(str);
+                    print_color_text(str, start, colorstate[2]);
+                } else {
+                    std.puts(cmd);
+                }
+            }
+            /* Note: assuming no surrogate pairs */
+            term_cursor_x = (term_cursor_x + cmd.length) % term_width;
+            if (term_cursor_x == 0) {
+                /* show the cursor on the next line */
+                std.puts(" \x08");
+            }
+            /* remove the trailing characters */
+            std.puts("\x1b[J");
+            last_cmd = cmd;
+            last_cursor_pos = cmd.length;
+        }
+        move_cursor(cursor_pos - last_cursor_pos);
+        last_cursor_pos = cursor_pos;
+        std.out.flush();
+    }
+
+    /* editing commands */
+    function insert(str) {
+        if (str) {
+            cmd = cmd.substring(0, cursor_pos) + str + cmd.substring(cursor_pos);
+            cursor_pos += str.length;
+        }
+    }
+
+    function quoted_insert() {
+        quote_flag = true;
+    }
+
+    function abort() {
+        cmd = "";
+        cursor_pos = 0;
+        return -2;
+    }
+
+    function alert() {
+    }
+
+    function beginning_of_line() {
+        cursor_pos = 0;
+    }
+
+    function end_of_line() {
+        cursor_pos = cmd.length;
+    }
+
+    function forward_char() {
+        if (cursor_pos < cmd.length)
+            cursor_pos++;
+    }
+
+    function backward_char() {
+        if (cursor_pos > 0)
+            cursor_pos--;
+    }
+
+    function skip_word_forward(pos) {
+        while (pos < cmd.length && !is_word(cmd.charAt(pos)))
+            pos++;
+        while (pos < cmd.length && is_word(cmd.charAt(pos)))
+            pos++;
+        return pos;
+    }
+
+    function skip_word_backward(pos) {
+        while (pos > 0 && !is_word(cmd.charAt(pos - 1)))
+            pos--;
+        while (pos > 0 && is_word(cmd.charAt(pos - 1)))
+            pos--;
+        return pos;
+    }
+
+    function forward_word() {
+        cursor_pos = skip_word_forward(cursor_pos);
+    }
+
+    function backward_word() {
+        cursor_pos = skip_word_backward(cursor_pos);
+    }        
+
+    function accept_line() {
+        std.puts("\n");
+        history_add(cmd);
+        return -1;
+    }
+
+    function history_add(str) {
+        if (str) {
+            history.push(str);
+        }
+        history_index = history.length;
+    }
+
+    function previous_history() {
+        if (history_index > 0) {
+            if (history_index == history.length) {
+                history.push(cmd);
+            }
+            history_index--;
+            cmd = history[history_index];
+            cursor_pos = cmd.length;
+        }
+    }
+
+    function next_history() {
+        if (history_index < history.length - 1) {
+            history_index++;
+            cmd = history[history_index];
+            cursor_pos = cmd.length;
+        }
+    }
+
+    function history_search(dir) {
+        var pos = cursor_pos;
+        for (var i = 1; i <= history.length; i++) {
+            var index = (history.length + i * dir + history_index) % history.length;
+            if (history[index].substring(0, pos) == cmd.substring(0, pos)) {
+                history_index = index;
+                cmd = history[index];
+                return;
+            }
+        }
+    }
+
+    function history_search_backward() {
+        return history_search(-1);
+    }
+
+    function history_search_forward() {
+        return history_search(1);
+    }
+
+    function delete_char_dir(dir) {
+        var start = cursor_pos - (dir < 0);
+        var end = start + 1;
+        if (start >= 0 && start < cmd.length) {
+            if (last_fun === kill_region) {
+                kill_region(start, end, dir);
+            } else {
+                cmd = cmd.substring(0, start) + cmd.substring(end);
+                cursor_pos = start;
+            }
+        }
+    }
+
+    function delete_char() {
+        delete_char_dir(1);
+    }
+
+    function control_d() {
+        if (cmd.length == 0) {
+            std.puts("\n");
+            return -3; /* exit read eval print loop */
+        } else {
+            delete_char_dir(1);
+        }
+    }
+
+    function backward_delete_char() {
+        delete_char_dir(-1);
+    }
+
+    function transpose_chars() {
+        var pos = cursor_pos;
+        if (cmd.length > 1 && pos > 0) {
+            if (pos == cmd.length)
+                pos--;
+            cmd = cmd.substring(0, pos - 1) + cmd.substring(pos, pos + 1) +
+                cmd.substring(pos - 1, pos) + cmd.substring(pos + 1);
+            cursor_pos = pos + 1;
+        }
+    }
+
+    function transpose_words() {
+        var p1 = skip_word_backward(cursor_pos);
+        var p2 = skip_word_forward(p1);
+        var p4 = skip_word_forward(cursor_pos);
+        var p3 = skip_word_backward(p4);
+
+        if (p1 < p2 && p2 <= cursor_pos && cursor_pos <= p3 && p3 < p4) {
+            cmd = cmd.substring(0, p1) + cmd.substring(p3, p4) +
+            cmd.substring(p2, p3) + cmd.substring(p1, p2);
+            cursor_pos = p4;
+        }
+    }
+
+    function upcase_word() {
+        var end = skip_word_forward(cursor_pos);
+        cmd = cmd.substring(0, cursor_pos) +
+            cmd.substring(cursor_pos, end).toUpperCase() +
+            cmd.substring(end);
+    }
+
+    function downcase_word() {
+        var end = skip_word_forward(cursor_pos);
+        cmd = cmd.substring(0, cursor_pos) +
+            cmd.substring(cursor_pos, end).toLowerCase() +
+            cmd.substring(end);
+    }
+
+    function kill_region(start, end, dir) {
+        var s = cmd.substring(start, end);
+        if (last_fun !== kill_region)
+            clip_board = s;
+        else if (dir < 0)
+            clip_board = s + clip_board;
+        else
+            clip_board = clip_board + s;
+
+        cmd = cmd.substring(0, start) + cmd.substring(end);
+        if (cursor_pos > end)
+            cursor_pos -= end - start;
+        else if (cursor_pos > start)
+            cursor_pos = start;
+        this_fun = kill_region;
+    }
+
+    function kill_line() {
+        kill_region(cursor_pos, cmd.length, 1);
+    }
+
+    function backward_kill_line() {
+        kill_region(0, cursor_pos, -1);
+    }
+
+    function kill_word() {
+        kill_region(cursor_pos, skip_word_forward(cursor_pos), 1);
+    }
+
+    function backward_kill_word() {
+        kill_region(skip_word_backward(cursor_pos), cursor_pos, -1);
+    }
+
+    function yank() {
+        insert(clip_board);
+    }
+
+    function control_c() {
+        if (last_fun === control_c) {
+            std.puts("\n");
+            std.exit(0);
+        } else {
+            std.puts("\n(Press Ctrl-C again to quit)\n");
+            readline_print_prompt();
+        }
+    }
+    
+    function reset() {
+        cmd = "";
+        cursor_pos = 0;
+    }
+
+    function get_context_word(line, pos) {
+        var s = "";
+        while (pos > 0 && is_word(line[pos - 1])) {
+            pos--;
+            s = line[pos] + s;
+        }
+        return s;
+    }
+    function get_context_object(line, pos) {
+        var obj, base, c;
+        if (pos <= 0 || " ~!%^&*(-+={[|:;,<>?/".indexOf(line[pos - 1]) >= 0)
+            return g;
+        if (pos >= 2 && line[pos - 1] === ".") {
+            pos--;
+            obj = {};
+            switch (c = line[pos - 1]) {
+            case '\'':
+            case '\"':
+                return "a";
+            case ']':
+                return [];
+            case '}':
+                return {};
+            case '/':
+                return / /;
+            default:
+                if (is_word(c)) {
+                    base = get_context_word(line, pos);
+                    if (["true", "false", "null", "this"].includes(base) || !isNaN(+base))
+                        return eval(base);
+                    obj = get_context_object(line, pos - base.length);
+                    if (obj === null || obj === void 0)
+                        return obj;
+                    else
+                        return obj[base];
+                }
+                return {};
+            }
+        }
+        return void 0;
+    }
+
+    function get_completions(line, pos) {
+        var s, obj, ctx_obj, r, i, j, paren;
+
+        s = get_context_word(line, pos);
+        ctx_obj = get_context_object(line, pos - s.length);
+        r = [];
+        /* enumerate properties from object and its prototype chain,
+           add non-numeric regular properties with s as e prefix
+         */
+        for (i = 0, obj = ctx_obj; i < 10 && obj !== null && obj !== void 0; i++) {
+            var props = Object.getOwnPropertyNames(obj);
+            /* add non-numeric regular properties */
+            for (j = 0; j < props.length; j++) {
+                var prop = props[j];
+                if (typeof prop == "string" && ""+(+prop) != prop && prop.startsWith(s))
+                    r.push(prop);
+            }
+            obj = Object.getPrototypeOf(obj);
+        }
+        if (r.length > 1) {
+            /* sort list with internal names last and remove duplicates */
+            function symcmp(a, b) {
+                if (a[0] != b[0]) {
+                    if (a[0] == '_')
+                        return 1;
+                    if (b[0] == '_')
+                        return -1;
+                }
+                if (a < b)
+                    return -1;
+                if (a > b)
+                    return +1;
+                return 0;
+            }
+            r.sort(symcmp);
+            for(i = j = 1; i < r.length; i++) {
+                if (r[i] != r[i - 1])
+                    r[j++] = r[i];
+            }
+            r.length = j;
+        }
+        /* 'tab' = list of completions, 'pos' = cursor position inside
+           the completions */
+        return { tab: r, pos: s.length, ctx: ctx_obj };
+    }
+
+    function completion() {
+        var tab, res, s, i, j, len, t, max_width, col, n_cols, row, n_rows;
+        res = get_completions(cmd, cursor_pos);
+        tab = res.tab;
+        if (tab.length === 0)
+            return;
+        s = tab[0];
+        len = s.length;
+        /* add the chars which are identical in all the completions */
+        for(i = 1; i < tab.length; i++) {
+            t = tab[i];
+            for(j = 0; j < len; j++) {
+                if (t[j] !== s[j]) {
+                    len = j;
+                    break;
+                }
+            }
+        }
+        for(i = res.pos; i < len; i++) {
+            insert(s[i]);
+        }
+        if (last_fun === completion && tab.length == 1) {
+            /* append parentheses to function names */
+            var m = res.ctx[tab[0]];
+            if (typeof m == "function") {
+                insert('(');
+                if (m.length == 0)
+                    insert(')');
+            } else if (typeof m == "object") {
+                insert('.');
+            }
+        }
+        /* show the possible completions */
+        if (last_fun === completion && tab.length >= 2) {
+            max_width = 0;
+            for(i = 0; i < tab.length; i++)
+                max_width = Math.max(max_width, tab[i].length);
+            max_width += 2;
+            n_cols = Math.max(1, Math.floor((term_width + 1) / max_width));
+            n_rows = Math.ceil(tab.length / n_cols);
+            std.puts("\n");
+            /* display the sorted list column-wise */
+            for (row = 0; row < n_rows; row++) {
+                for (col = 0; col < n_cols; col++) {
+                    i = col * n_rows + row;
+                    if (i >= tab.length)
+                        break;
+                    s = tab[i];
+                    if (col != n_cols - 1)
+                        s = s.padEnd(max_width);
+                    std.puts(s);
+                }
+                std.puts("\n");
+            }
+            /* show a new prompt */
+            readline_print_prompt();
+        }
+    }
+    
+    var commands = {        /* command table */
+        "\x01":     beginning_of_line,      /* ^A - bol */
+        "\x02":     backward_char,          /* ^B - backward-char */
+        "\x03":     control_c,              /* ^C - abort */
+        "\x04":     control_d,              /* ^D - delete-char or exit */
+        "\x05":     end_of_line,            /* ^E - eol */
+        "\x06":     forward_char,           /* ^F - forward-char */
+        "\x07":     abort,                  /* ^G - bell */
+        "\x08":     backward_delete_char,   /* ^H - backspace */
+        "\x09":     completion,             /* ^I - history-search-backward */
+        "\x0a":     accept_line,            /* ^J - newline */
+        "\x0b":     kill_line,              /* ^K - delete to end of line */
+        "\x0d":     accept_line,            /* ^M - enter */
+        "\x0e":     next_history,           /* ^N - down */
+        "\x10":     previous_history,       /* ^P - up */
+        "\x11":     quoted_insert,          /* ^Q - quoted-insert */
+        "\x12":     alert,                  /* ^R - reverse-search */
+        "\x13":     alert,                  /* ^S - search */
+        "\x14":     transpose_chars,        /* ^T - transpose */
+        "\x18":     reset,                  /* ^X - cancel */
+        "\x19":     yank,                   /* ^Y - yank */
+        "\x1bOA":   previous_history,       /* ^[OA - up */
+        "\x1bOB":   next_history,           /* ^[OB - down */
+        "\x1bOC":   forward_char,           /* ^[OC - right */
+        "\x1bOD":   backward_char,          /* ^[OD - left */
+        "\x1bOF":   forward_word,           /* ^[OF - ctrl-right */
+        "\x1bOH":   backward_word,          /* ^[OH - ctrl-left */
+        "\x1b[1;5C": forward_word,          /* ^[[1;5C - ctrl-right */
+        "\x1b[1;5D": backward_word,         /* ^[[1;5D - ctrl-left */
+        "\x1b[1~":  beginning_of_line,      /* ^[[1~ - bol */
+        "\x1b[3~":  delete_char,            /* ^[[3~ - delete */
+        "\x1b[4~":  end_of_line,            /* ^[[4~ - eol */
+        "\x1b[5~":  history_search_backward,/* ^[[5~ - page up */
+        "\x1b[6~":  history_search_forward, /* ^[[5~ - page down */
+        "\x1b[A":   previous_history,       /* ^[[A - up */
+        "\x1b[B":   next_history,           /* ^[[B - down */
+        "\x1b[C":   forward_char,           /* ^[[C - right */
+        "\x1b[D":   backward_char,          /* ^[[D - left */
+        "\x1b[F":   end_of_line,            /* ^[[F - end */
+        "\x1b[H":   beginning_of_line,      /* ^[[H - home */
+        "\x1b\x7f": backward_kill_word,     /* M-C-? - backward_kill_word */
+        "\x1bb":    backward_word,          /* M-b - backward_word */
+        "\x1bd":    kill_word,              /* M-d - kill_word */
+        "\x1bf":    forward_word,           /* M-f - backward_word */
+        "\x1bk":    backward_kill_line,     /* M-k - backward_kill_line */
+        "\x1bl":    downcase_word,          /* M-l - downcase_word */
+        "\x1bt":    transpose_words,        /* M-t - transpose_words */
+        "\x1bu":    upcase_word,            /* M-u - upcase_word */
+        "\x7f":     backward_delete_char,   /* ^? - delete */
+    };
+
+    function dupstr(str, count) {
+        var res = "";
+        while (count-- > 0)
+            res += str;
+        return res;
+    }
+
+    var readline_keys;
+    var readline_state;
+    var readline_cb;
+
+    function readline_print_prompt()
+    {
+        std.puts(prompt);
+        term_cursor_x = prompt.length % term_width;
+        last_cmd = "";
+        last_cursor_pos = 0;
+    }
+
+    function readline_start(defstr, cb) {
+        cmd = defstr || "";
+        cursor_pos = cmd.length;
+        history_index = history.length;
+        readline_cb = cb;
+        
+        prompt = pstate;
+    
+        if (mexpr) {
+            prompt += dupstr(" ", plen - prompt.length);
+            prompt += ps2;
+        } else {
+            if (show_time) {
+                var t = Math.round(eval_time) + " ";
+                eval_time = 0;
+                t = dupstr("0", 5 - t.length) + t;
+                prompt += t.substring(0, t.length - 4) + "." + t.substring(t.length - 4);
+            }
+            plen = prompt.length;
+            prompt += ps1;
+        }
+        readline_print_prompt();
+        update();
+        readline_state = 0;
+    }
+
+    function handle_char(c1) {
+        var c;
+        c = String.fromCharCode(c1);
+        switch(readline_state) {
+        case 0:
+            if (c == '\x1b') {  /* '^[' - ESC */
+                readline_keys = c;
+                readline_state = 1;
+            } else {
+                handle_key(c);
+            }
+            break;
+        case 1: /* '^[ */
+            readline_keys += c;
+            if (c == '[') {
+                readline_state = 2;
+            } else if (c == 'O') {
+                readline_state = 3;
+            } else {
+                handle_key(readline_keys);
+                readline_state = 0;
+            }
+            break;
+        case 2: /* '^[[' - CSI */
+            readline_keys += c;
+            if (!(c == ';' || (c >= '0' && c <= '9'))) {
+                handle_key(readline_keys);
+                readline_state = 0;
+            }
+            break;
+        case 3: /* '^[O' - ESC2 */
+            readline_keys += c;
+            handle_key(readline_keys);
+            readline_state = 0;
+            break;
+        }
+    }
+
+    function handle_key(keys) {
+        var fun;
+
+        if (quote_flag) {
+            if (keys.length === 1)
+                insert(keys);
+            quote_flag = false;
+        } else if (fun = commands[keys]) {
+            this_fun = fun;
+            switch (fun(keys)) {
+            case -1:
+                readline_cb(cmd);
+                return;
+            case -2:
+                readline_cb(null);
+                return;
+            case -3:
+                /* uninstall a Ctrl-C signal handler */
+                os.signal(os.SIGINT, null);
+                /* uninstall the stdin read handler */
+                os.setReadHandler(term_fd, null);
+                return;
+            }
+            last_fun = this_fun;
+        } else if (keys.length === 1 && keys >= ' ') {
+            insert(keys);
+            last_fun = insert;
+        } else {
+            alert(); /* beep! */
+        }
+        
+        cursor_pos = (cursor_pos < 0) ? 0 :
+            (cursor_pos > cmd.length) ? cmd.length : cursor_pos;
+        update();
+    }
+
+    var hex_mode = false;
+    var eval_mode = "std";
+
+    function bignum_typeof(a) {
+        "use bigint";
+        return typeof a;
+    }
+
+    function eval_mode_typeof(a) {
+        if (eval_mode === "std")
+            return typeof a;
+        else
+            return bignum_typeof(a);
+    }
+    
+    function number_to_string(a, radix) {
+        var s;
+        if (!isFinite(a)) {
+            /* NaN, Infinite */
+            if (typeof a === "bigfloat" && eval_mode !== "math") {
+                return "BigFloat(" + a.toString() + ")";
+            } else {
+                return a.toString();
+            }
+        } else {
+            if (a == 0) {
+                if (1 / a < 0)
+                    s = "-0";
+                else
+                    s = "0";
+            } else {
+                if (radix == 16) {
+                    var s;
+                    if (a < 0) {
+                        a = -a;
+                        s = "-";
+                    } else {
+                        s = "";
+                    }
+                    s += "0x" + a.toString(16);
+                } else {
+                    s = a.toString();
+                }
+            }
+            if (typeof a === "bigfloat" && eval_mode !== "math") {
+                s += "l";
+            } else if (eval_mode !== "std" && s.indexOf(".") < 0 &&
+                ((radix == 16 && s.indexOf("p") < 0) ||
+                 (radix == 10 && s.indexOf("e") < 0))) {
+                /* add a decimal point so that the floating point type
+                   is visible */
+                s += ".0";
+            }
+            return s;
+        }
+    }
+
+    function bigint_to_string(a, radix) {
+        var s;
+        if (radix == 16) {
+            var s;
+            if (a < 0) {
+                a = -a;
+                s = "-";
+            } else {
+                s = "";
+            }
+            s += "0x" + a.toString(16);
+        } else {
+            s = a.toString();
+        }
+        if (eval_mode === "std")
+            s += "n";
+        return s;
+    }
+    
+    function print(a) {
+        var stack = [];
+
+        function print_rec(a) {
+            var n, i, keys, key, type, s;
+            
+            type = eval_mode_typeof(a);
+            if (type === "object") {
+                if (a === null) {
+                    std.puts(a);
+                } else if (stack.indexOf(a) >= 0) {
+                    std.puts("[circular]");
+                } else if (has_jscalc && (a instanceof Fraction ||
+                                        a instanceof Complex ||
+                                        a instanceof Mod ||
+                                        a instanceof Polynomial ||
+                                        a instanceof PolyMod ||
+                                        a instanceof RationalFunction ||
+                                        a instanceof Series)) {
+                    std.puts(a.toString());
+                } else {
+                    stack.push(a);
+                    if (Array.isArray(a)) {
+                        n = a.length;
+                        std.puts("[ ");
+                        for(i = 0; i < n; i++) {
+                            if (i !== 0)
+                                std.puts(", ");
+                            if (i in a) {
+                                print_rec(a[i]);
+                            } else {
+                                std.puts("<empty>");
+                            }
+                            if (i > 20) {
+                                std.puts("...");
+                                break;
+                            }
+                        }
+                        std.puts(" ]");
+                    } else if (Object.__getClass(a) === "RegExp") {
+                        std.puts(a.toString());
+                    } else {
+                        keys = Object.keys(a);
+                        n = keys.length;
+                        std.puts("{ ");
+                        for(i = 0; i < n; i++) {
+                            if (i !== 0)
+                                std.puts(", ");
+                            key = keys[i];
+                            std.puts(key, ": ");
+                            print_rec(a[key]);
+                        }
+                        std.puts(" }");
+                    }
+                    stack.pop(a);
+                }
+            } else if (type === "string") {
+                s = a.__quote();
+                if (s.length > 79)
+                    s = s.substring(0, 75) + "...\"";
+                std.puts(s);
+            } else if (type === "number" || type === "bigfloat") {
+                std.puts(number_to_string(a, hex_mode ? 16 : 10));
+            } else if (type === "bigint") {
+                std.puts(bigint_to_string(a, hex_mode ? 16 : 10));
+            } else if (type === "symbol") {
+                std.puts(String(a));
+            } else if (type === "function") {
+                std.puts("function " + a.name + "()");
+            } else {
+                std.puts(a);
+            }
+        }
+        print_rec(a);
+    }
+    
+    function extract_directive(a) {
+        var pos;
+        if (a[0] !== '\\')
+            return "";
+        for (pos = 1; pos < a.length; pos++) {
+            if (!is_alpha(a[pos]))
+                break;
+        }
+        return a.substring(1, pos);
+    }
+
+    /* return true if the string after cmd can be evaluted as JS */
+    function handle_directive(cmd, expr) {
+        var param, prec1, expBits1;
+        
+        if (cmd === "h" || cmd === "?" || cmd == "help") {
+            help();
+        } else if (cmd === "load") {
+            var filename = expr.substring(cmd.length + 1).trim();
+            if (filename.lastIndexOf(".") <= filename.lastIndexOf("/"))
+                filename += ".js";
+            std.loadScript(filename);
+            return false;
+        } else if (cmd === "x") {
+            hex_mode = true;
+        } else if (cmd === "d") {
+            hex_mode = false;
+        } else if (cmd === "t") {
+            show_time = !show_time;
+        } else if (has_bignum && cmd === "p") {
+            param = expr.substring(cmd.length + 1).trim().split(" ");
+            if (param.length === 1 && param[0] === "") {
+                std.puts("BigFloat precision=" + prec + " bits (~" +
+                          Math.floor(prec / log2_10) +
+                          " digits), exponent size=" + expBits + " bits\n");
+            } else if (param[0] === "f16") {
+                prec = 11;
+                expBits = 5;
+            } else if (param[0] === "f32") {
+                prec = 24;
+                expBits = 8;
+            } else if (param[0] === "f64") {
+                prec = 53;
+                expBits = 11;
+            } else if (param[0] === "f128") {
+                prec = 113;
+                expBits = 15;
+            } else {
+                prec1 = parseInt(param[0]);
+                if (param.length >= 2)
+                    expBits1 = parseInt(param[1]);
+                else
+                    expBits1 = BigFloatEnv.expBitsMax;
+                if (Number.isNaN(prec1) ||
+                    prec1 < BigFloatEnv.precMin ||
+                    prec1 > BigFloatEnv.precMax) {
+                    std.puts("Invalid precision\n");
+                    return false;
+                }
+                if (Number.isNaN(expBits1) ||
+                    expBits1 < BigFloatEnv.expBitsMin ||
+                    expBits1 > BigFloatEnv.expBitsMax) {
+                    std.puts("Invalid exponent bits\n");
+                    return false;
+                }
+                prec = prec1;
+                expBits = expBits1;
+            }
+            return false;
+        } else if (has_bignum && cmd === "digits") {
+            param = expr.substring(cmd.length + 1).trim();
+            prec1 = Math.ceil(parseFloat(param) * log2_10);
+            if (prec1 < BigFloatEnv.precMin ||
+                prec1 > BigFloatEnv.precMax) {
+                std.puts("Invalid precision\n");
+                return false;
+            }
+            prec = prec1;
+            expBits = BigFloatEnv.expBitsMax;
+            return false;
+        } else if (has_bignum && cmd === "mode") {
+            param = expr.substring(cmd.length + 1).trim();
+            if (param === "") {
+                std.puts("Running mode=" + eval_mode + "\n");
+            } else if (param === "std" || param === "math" ||
+                       param === "bigint") {
+                eval_mode = param;
+            } else {
+                std.puts("Invalid mode\n");
+            }
+            return false;
+        } else if (cmd === "clear") {
+            std.puts("\x1b[H\x1b[J");
+        } else if (cmd === "q") {
+            std.exit(0);
+        } else if (cmd === "a") {
+            algebraicMode = true;
+        } else if (cmd === "n") {
+            algebraicMode = false;
+        } else {
+            std.puts("Unknown directive: " + cmd + "\n");
+            return false;
+        }
+        return true;
+    }
+
+    if (config_numcalc) {
+        /* called by the GUI */
+        g.execCmd = function (cmd) {
+            switch(cmd) {
+            case "dec":
+                hex_mode = false;
+                break;
+            case "hex":
+                hex_mode = true;
+                break;
+            case "num":
+                algebraicMode = false;
+                break;
+            case "alg":
+                algebraicMode = true;
+                break;
+            }
+        }
+    }
+    
+    function help() {
+        function sel(n) {
+            return n ? "*": " ";
+        }
+        std.puts("\\h          this help\n" +
+                 "\\x         " + sel(hex_mode) + "hexadecimal number display\n" +
+                 "\\d         " + sel(!hex_mode) + "decimal number display\n" +
+                 "\\t         " + sel(show_time) + "toggle timing display\n" +
+                  "\\clear      clear the terminal\n");
+        if (has_jscalc) {
+            std.puts("\\a         " + sel(algebraicMode) + "algegraic mode\n" +
+                     "\\n         " + sel(!algebraicMode) + "numeric mode\n");
+        }
+        if (has_bignum) {
+            std.puts("\\p [m [e]]  set the BigFloat precision to 'm' bits\n" +
+                     "\\digits n   set the BigFloat precision to 'ceil(n*log2(10))' bits\n");
+            if (!has_jscalc) {
+                std.puts("\\mode [std|bigint|math] change the running mode (current = " + eval_mode + ")\n");
+            }
+        }
+        if (!config_numcalc) {
+            std.puts("\\q          exit\n");
+        }
+    }
+
+    function eval_and_print(expr) {
+        var result;
+        
+        try {
+            if (eval_mode === "math")
+                expr = '"use math"; void 0;' + expr;
+            else if (eval_mode === "bigint")
+                expr = '"use bigint"; void 0;' + expr;
+            var now = (new Date).getTime();
+            /* eval as a script */
+            result = std.evalScript(expr);
+            eval_time = (new Date).getTime() - now;
+            std.puts(colors[styles.result]);
+            print(result);
+            std.puts("\n");
+            std.puts(colors.none);
+            /* set the last result */
+            g._ = result;
+        } catch (error) {
+            std.puts(colors[styles.error_msg]);
+            if (error instanceof Error) {
+                console.log(error);
+                if (error.stack) {
+                    std.puts(error.stack);
+                }
+            } else {
+                std.puts("Throw: ");
+                console.log(error);
+            }
+            std.puts(colors.none);
+        }
+    }
+
+    function cmd_start() {
+        if (!config_numcalc) {
+            if (has_jscalc)
+                std.puts('QJSCalc - Type "\\h" for help\n');
+            else
+                std.puts('QuickJS - Type "\\h" for help\n');
+        }
+        if (has_bignum) {
+            log2_10 = Math.log(10) / Math.log(2);
+            if (has_jscalc) {
+                prec = 113;
+                expBits = 15;
+                eval_mode = "math";
+                /* XXX: numeric mode should always be the default ? */
+                g.algebraicMode = config_numcalc;
+            } else {
+                prec = 53;
+                expBits = 11;
+            }
+        }
+
+        cmd_readline_start();
+    }
+
+    function cmd_readline_start() {
+        readline_start(dupstr("    ", level), readline_handle_cmd);
+    }
+    
+    function readline_handle_cmd(expr) {
+        handle_cmd(expr);
+        cmd_readline_start();
+    }
+
+    function handle_cmd(expr) {
+        var colorstate, cmd;
+        
+        if (expr === null) {
+            expr = "";
+            return;
+        }
+        if (expr === "?") {
+            help();
+            return;
+        }
+        cmd = extract_directive(expr);
+        if (cmd.length > 0) {
+            if (!handle_directive(cmd, expr))
+                return;
+            expr = expr.substring(cmd.length + 1);
+        }
+        if (expr === "")
+            return;
+        
+        if (mexpr)
+            expr = mexpr + '\n' + expr;
+        colorstate = colorize_js(expr);
+        pstate = colorstate[0];
+        level = colorstate[1];
+        if (pstate) {
+            mexpr = expr;
+            return;
+        }
+        mexpr = "";
+        
+        if (has_bignum) {
+            BigFloatEnv.setPrec(eval_and_print.bind(null, expr),
+                                prec, expBits);
+        } else {
+            eval_and_print(expr);
+        }
+        level = 0;
+        
+        /* run the garbage collector after each command */
+        std.gc();
+    }
+
+    function colorize_js(str) {
+        var i, c, start, n = str.length;
+        var style, state = "", level = 0;
+        var primary, can_regex = 1;
+        var r = [];
+
+        function push_state(c) { state += c; }
+        function last_state(c) { return state.substring(state.length - 1); }
+        function pop_state(c) {
+            var c = last_state();
+            state = state.substring(0, state.length - 1);
+            return c;
+        }
+
+        function parse_block_comment() {
+            style = 'comment';
+            push_state('/');
+            for (i++; i < n - 1; i++) {
+                if (str[i] == '*' && str[i + 1] == '/') {
+                    i += 2;
+                    pop_state('/');
+                    break;
+                }
+            }
+        }
+
+        function parse_line_comment() {
+            style = 'comment';
+            for (i++; i < n; i++) {
+                if (str[i] == '\n') {
+                    break;
+                }
+            }
+        }
+
+        function parse_string(delim) {
+            style = 'string';
+            push_state(delim);
+            while (i < n) {
+                c = str[i++];
+                if (c == '\n') {
+                    style = 'error';
+                    continue;
+                }
+                if (c == '\\') {
+                    if (i >= n)
+                        break;
+                    i++;
+                } else
+                if (c == delim) {
+                    pop_state();
+                    break;
+                }
+            }
+        }
+
+        function parse_regex() {
+            style = 'regex';
+            push_state('/');
+            while (i < n) {
+                c = str[i++];
+                if (c == '\n') {
+                    style = 'error';
+                    continue;
+                }
+                if (c == '\\') {
+                    if (i < n) {
+                        i++;
+                    }
+                    continue;
+                }
+                if (last_state() == '[') {
+                    if (c == ']') {
+                        pop_state()
+                    }
+                    // ECMA 5: ignore '/' inside char classes
+                    continue;
+                }
+                if (c == '[') {
+                    push_state('[');
+                    if (str[i] == '[' || str[i] == ']')
+                        i++;
+                    continue;
+                }
+                if (c == '/') {
+                    pop_state();
+                    while (i < n && is_word(str[i]))
+                        i++;
+                    break;
+                }
+            }
+        }
+
+        function parse_number() {
+            style = 'number';
+            while (i < n && (is_word(str[i]) || (str[i] == '.' && (i == n - 1 || str[i + 1] != '.')))) {
+                i++;
+            }
+        }
+
+        var js_keywords = "|" +
+            "break|case|catch|continue|debugger|default|delete|do|" +
+            "else|finally|for|function|if|in|instanceof|new|" +
+            "return|switch|this|throw|try|typeof|while|with|" +
+            "class|const|enum|import|export|extends|super|" +
+            "implements|interface|let|package|private|protected|" +
+            "public|static|yield|" +
+            "undefined|null|true|false|Infinity|NaN|" +
+            "eval|arguments|" +
+            "await|";
+
+        var js_no_regex = "|this|super|undefined|null|true|false|Infinity|NaN|arguments|";
+        var js_types = "|void|var|";
+
+        function parse_identifier() {
+            can_regex = 1;
+
+            while (i < n && is_word(str[i]))
+                i++;
+
+            var w = '|' + str.substring(start, i) + '|';
+
+            if (js_keywords.indexOf(w) >= 0) {
+                style = 'keyword';
+                if (js_no_regex.indexOf(w) >= 0)
+                    can_regex = 0;
+                return;
+            }
+
+            var i1 = i;
+            while (i1 < n && str[i1] == ' ')
+                i1++;
+
+            if (i1 < n && str[i1] == '(') {
+                style = 'function';
+                return;
+            }
+
+            if (js_types.indexOf(w) >= 0) {
+                style = 'type';
+                return;
+            }
+
+            style = 'identifier';
+            can_regex = 0;
+        }
+
+        function set_style(from, to) {
+            while (r.length < from)
+                r.push('default');
+            while (r.length < to)
+                r.push(style);
+        }
+
+        for (i = 0; i < n;) {
+            style = null;
+            start = i;
+            switch (c = str[i++]) {
+            case ' ':
+            case '\t':
+            case '\r':
+            case '\n':
+                continue;
+            case '+':
+            case '-':
+                if (i < n && str[i] == c) {
+                    i++;
+                    continue;
+                }
+                can_regex = 1;
+                continue;
+            case '/':
+                if (i < n && str[i] == '*') { // block comment
+                    parse_block_comment();
+                    break;
+                }
+                if (i < n && str[i] == '/') { // line comment
+                    parse_line_comment();
+                    break;
+                }
+                if (can_regex) {
+                    parse_regex();
+                    can_regex = 0;
+                    break;
+                }
+                can_regex = 1;
+                continue;
+            case '\'':
+            case '\"':
+            case '`':
+                parse_string(c);
+                can_regex = 0;
+                break;
+            case '(':
+            case '[':
+            case '{':
+                can_regex = 1;
+                level++;
+                push_state(c);
+                continue;
+            case ')':
+            case ']':
+            case '}':
+                can_regex = 0;
+                if (level > 0 && is_balanced(last_state(), c)) {
+                    level--;
+                    pop_state();
+                    continue;
+                }
+                style = 'error';
+                break;
+            default:
+                if (is_digit(c)) {
+                    parse_number();
+                    can_regex = 0;
+                    break;
+                }
+                if (is_word(c) || c == '$') {
+                    parse_identifier();
+                    break;
+                }
+                can_regex = 1;
+                continue;
+            }
+            if (style)
+                set_style(start, i);
+        }
+        set_style(n, n);
+        return [ state, level, r ];
+    }
+
+    termInit();
+    
+    cmd_start();
+
+})(std.global);
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/run-test262.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/run-test262.c
new file mode 100755
index 00000000..3c8addaa
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/run-test262.c
@@ -0,0 +1,1970 @@
+/*
+ * ECMA Test 262 Runner for QuickJS
+ * 
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ * Copyright (c) 2017-2018 Charlie Gordon
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include <stdlib.h>
+#include <stdio.h>
+#include <stdarg.h>
+#include <inttypes.h>
+#include <string.h>
+#include <assert.h>
+#include <ctype.h>
+#include <unistd.h>
+#include <errno.h>
+#include <time.h>
+#include <dirent.h>
+#include <ftw.h>
+
+#include "cutils.h"
+#include "list.h"
+#include "quickjs-libc.h"
+
+/* enable test262 thread support to test SharedArrayBuffer and Atomics */
+#define CONFIG_AGENT
+
+#define CMD_NAME "run-test262"
+
+typedef struct namelist_t {
+    char **array;
+    int count;
+    int size;
+    unsigned int sorted : 1;
+} namelist_t;
+
+namelist_t test_list;
+namelist_t exclude_list;
+namelist_t exclude_dir_list;
+
+FILE *outfile;
+enum test_mode_t {
+    TEST_DEFAULT_NOSTRICT, /* run tests as nostrict unless test is flagged as strictonly */
+    TEST_DEFAULT_STRICT,   /* run tests as strict unless test is flagged as nostrict */
+    TEST_NOSTRICT,         /* run tests as nostrict, skip strictonly tests */
+    TEST_STRICT,           /* run tests as strict, skip nostrict tests */
+    TEST_ALL,              /* run tests in both strict and nostrict, unless restricted by spec */
+} test_mode = TEST_DEFAULT_NOSTRICT;
+int skip_async;
+int skip_module;
+int new_style;
+int dump_memory;
+int stats_count;
+JSMemoryUsage stats_all, stats_avg, stats_min, stats_max;
+char *stats_min_filename;
+char *stats_max_filename;
+int verbose;
+char *harness_dir;
+char *harness_exclude;
+char *harness_features;
+char *harness_skip_features;
+char *error_filename;
+char *error_file;
+FILE *error_out;
+char *report_filename;
+int update_errors;
+int test_count, test_failed, test_index, test_skipped, test_excluded;
+int new_errors, changed_errors, fixed_errors;
+
+void warning(const char *, ...) __attribute__((__format__(__printf__, 1, 2)));
+void fatal(int, const char *, ...) __attribute__((__format__(__printf__, 2, 3)));
+
+void warning(const char *fmt, ...)
+{
+    va_list ap;
+
+    fflush(stdout);
+    fprintf(stderr, "%s: ", CMD_NAME);
+    va_start(ap, fmt);
+    vfprintf(stderr, fmt, ap);
+    va_end(ap);
+    fputc('\n', stderr);
+}
+
+void fatal(int errcode, const char *fmt, ...)
+{
+    va_list ap;
+
+    fflush(stdout);
+    fprintf(stderr, "%s: ", CMD_NAME);
+    va_start(ap, fmt);
+    vfprintf(stderr, fmt, ap);
+    va_end(ap);
+    fputc('\n', stderr);
+
+    exit(errcode);
+}
+
+void perror_exit(int errcode, const char *s)
+{
+    fflush(stdout);
+    fprintf(stderr, "%s: ", CMD_NAME);
+    perror(s);
+    exit(errcode);
+}
+
+char *strdup_len(const char *str, int len)
+{
+    char *p = malloc(len + 1);
+    memcpy(p, str, len);
+    p[len] = '\0';
+    return p;
+}
+
+static inline int str_equal(const char *a, const char *b) {
+    return !strcmp(a, b);
+}
+
+char *str_append(char **pp, const char *sep, const char *str) {
+    char *res, *p;
+    size_t len = 0;
+    p = *pp;
+    if (p) {
+        len = strlen(p) + strlen(sep);
+    }
+    res = malloc(len + strlen(str) + 1);
+    if (p) {
+        strcpy(res, p);
+        strcat(res, sep);
+    }
+    strcpy(res + len, str);
+    free(p);
+    return *pp = res;
+}
+
+char *str_strip(char *p)
+{
+    size_t len = strlen(p);
+    while (len > 0 && isspace((unsigned char)p[len - 1]))
+        p[--len] = '\0';
+    while (isspace((unsigned char)*p))
+        p++;
+    return p;
+}
+
+int has_prefix(const char *str, const char *prefix)
+{
+    return !strncmp(str, prefix, strlen(prefix));
+}
+
+char *skip_prefix(const char *str, const char *prefix)
+{
+    int i;
+    for (i = 0;; i++) {
+        if (prefix[i] == '\0') {  /* skip the prefix */
+            str += i;
+            break;
+        }
+        if (str[i] != prefix[i])
+            break;
+    }
+    return (char *)str;
+}
+
+char *get_basename(const char *filename)
+{
+    char *p;
+
+    p = strrchr(filename, '/');
+    if (!p)
+        return NULL;
+    return strdup_len(filename, p - filename);
+}
+
+char *compose_path(const char *path, const char *name)
+{
+    int path_len, name_len;
+    char *d, *q;
+
+    if (!path || path[0] == '\0' || *name == '/') {
+        d = strdup(name);
+    } else {
+        path_len = strlen(path);
+        name_len = strlen(name);
+        d = malloc(path_len + 1 + name_len + 1);
+        if (d) {
+            q = d;
+            memcpy(q, path, path_len);
+            q += path_len;
+            if (path[path_len - 1] != '/')
+                *q++ = '/';
+            memcpy(q, name, name_len + 1);
+        }
+    }
+    return d;
+}
+
+int namelist_cmp(const char *a, const char *b)
+{
+    /* compare strings in modified lexicographical order */
+    for (;;) {
+        int ca = (unsigned char)*a++;
+        int cb = (unsigned char)*b++;
+        if (isdigit(ca) && isdigit(cb)) {
+            int na = ca - '0';
+            int nb = cb - '0';
+            while (isdigit(ca = (unsigned char)*a++))
+                na = na * 10 + ca - '0';
+            while (isdigit(cb = (unsigned char)*b++))
+                nb = nb * 10 + cb - '0';
+            if (na < nb)
+                return -1;
+            if (na > nb)
+                return +1;
+        }
+        if (ca < cb)
+            return -1;
+        if (ca > cb)
+            return +1;
+        if (ca == '\0')
+            return 0;
+    }
+}
+
+int namelist_cmp_indirect(const void *a, const void *b)
+{
+    return namelist_cmp(*(const char **)a, *(const char **)b);
+}
+
+void namelist_sort(namelist_t *lp)
+{
+    int i, count;
+    if (lp->count > 1) {
+        qsort(lp->array, lp->count, sizeof(*lp->array), namelist_cmp_indirect);
+        /* remove duplicates */
+        for (count = i = 1; i < lp->count; i++) {
+            if (namelist_cmp(lp->array[count - 1], lp->array[i]) == 0) {
+                free(lp->array[i]);
+            } else {
+                lp->array[count++] = lp->array[i];
+            }
+        }
+        lp->count = count;
+    }
+    lp->sorted = 1;
+}
+
+int namelist_find(namelist_t *lp, const char *name)
+{
+    int a, b, m, cmp;
+
+    if (!lp->sorted) {
+        namelist_sort(lp);
+    }
+    for (a = 0, b = lp->count; a < b;) {
+        m = a + (b - a) / 2;
+        cmp = namelist_cmp(lp->array[m], name);
+        if (cmp < 0)
+            a = m + 1;
+        else if (cmp > 0)
+            b = m;
+        else
+            return m;
+    }
+    return -1;
+}
+
+void namelist_add(namelist_t *lp, const char *base, const char *name)
+{
+    char *s;
+
+    s = compose_path(base, name);
+    if (!s)
+        goto fail;
+    if (lp->count == lp->size) {
+        size_t newsize = lp->size + (lp->size >> 1) + 4;
+        char **a = realloc(lp->array, sizeof(lp->array[0]) * newsize);
+        if (!a)
+            goto fail;
+        lp->array = a;
+        lp->size = newsize;
+    }
+    lp->array[lp->count] = s;
+    lp->count++;
+    return;
+fail:
+    fatal(1, "allocation failure\n");
+}
+
+void namelist_load(namelist_t *lp, const char *filename)
+{
+    char buf[1024];
+    char *base_name;
+    FILE *f;
+
+    f = fopen(filename, "rb");
+    if (!f) {
+        perror_exit(1, filename);
+    }
+    base_name = get_basename(filename);
+
+    while (fgets(buf, sizeof(buf), f) != NULL) {
+        char *p = str_strip(buf);
+        if (*p == '#' || *p == ';' || *p == '\0')
+            continue;  /* line comment */
+        
+        namelist_add(lp, base_name, p);
+    }
+    free(base_name);
+    fclose(f);
+}
+
+void namelist_add_from_error_file(namelist_t *lp, const char *file)
+{
+    const char *p, *p0;
+    char *pp;
+
+    for (p = file; (p = strstr(p, ".js:")) != NULL; p++) {
+        for (p0 = p; p0 > file && p0[-1] != '\n'; p0--)
+            continue;
+        pp = strdup_len(p0, p + 3 - p0);
+        namelist_add(lp, NULL, pp);
+        free(pp);
+    }
+}
+
+void namelist_free(namelist_t *lp)
+{
+    while (lp->count > 0) {
+        free(lp->array[--lp->count]);
+    }
+    free(lp->array);
+    lp->array = NULL;
+    lp->size = 0;
+}
+
+static int add_test_file(const char *filename, const struct stat *ptr, int flag)
+{
+    namelist_t *lp = &test_list;
+    if (has_suffix(filename, ".js") && !has_suffix(filename, "_FIXTURE.js"))
+        namelist_add(lp, NULL, filename);
+    return 0;
+}
+
+/* find js files from the directory tree and sort the list */
+static void enumerate_tests(const char *path)
+{
+    namelist_t *lp = &test_list;
+    int start = lp->count;
+    ftw(path, add_test_file, 100);
+    qsort(lp->array + start, lp->count - start, sizeof(*lp->array),
+          namelist_cmp_indirect);
+}
+
+static JSValue js_print(JSContext *ctx, JSValueConst this_val,
+                        int argc, JSValueConst *argv)
+{
+    int i;
+    const char *str;
+
+    if (outfile) {
+        for (i = 0; i < argc; i++) {
+            if (i != 0)
+                fputc(' ', outfile);
+            str = JS_ToCString(ctx, argv[i]);
+            if (!str)
+                return JS_EXCEPTION;
+            fputs(str, outfile);
+            JS_FreeCString(ctx, str);
+        }
+        fputc('\n', outfile);
+    }
+    return JS_UNDEFINED;
+}
+
+static JSValue js_detachArrayBuffer(JSContext *ctx, JSValue this_val,
+                                    int argc, JSValue *argv)
+{
+    JS_DetachArrayBuffer(ctx, argv[0]);
+    return JS_UNDEFINED;
+}
+
+static JSValue js_evalScript(JSContext *ctx, JSValue this_val,
+                             int argc, JSValue *argv)
+{
+    const char *str;
+    int len;
+    JSValue ret;
+    str = JS_ToCStringLen(ctx, &len, argv[0], FALSE);
+    if (!str)
+        return JS_EXCEPTION;
+    ret = JS_Eval(ctx, str, len, "<evalScript>", JS_EVAL_TYPE_GLOBAL);
+    JS_FreeCString(ctx, str);
+    return ret;
+}
+
+#ifdef CONFIG_AGENT
+
+#include <pthread.h>
+
+typedef struct {
+    struct list_head link;
+    pthread_t tid;
+    char *script;
+    JSValue broadcast_func;
+    BOOL broadcast_pending;
+    JSValue broadcast_sab; /* in the main context */
+    uint8_t *broadcast_sab_buf;
+    size_t broadcast_sab_size;
+    int32_t broadcast_val;
+} Test262Agent;
+
+typedef struct {
+    struct list_head link;
+    char *str;
+} AgentReport;
+
+static void add_helpers(JSContext *ctx, int argc, char **argv);
+
+static pthread_mutex_t agent_mutex = PTHREAD_MUTEX_INITIALIZER;
+static pthread_cond_t agent_cond = PTHREAD_COND_INITIALIZER;
+/* list of Test262Agent.link */
+static struct list_head agent_list = LIST_HEAD_INIT(agent_list);
+
+static pthread_mutex_t report_mutex = PTHREAD_MUTEX_INITIALIZER;
+/* list of AgentReport.link */
+static struct list_head report_list = LIST_HEAD_INIT(report_list);
+
+static void *agent_start(void *arg)
+{
+    Test262Agent *agent = arg;
+    JSRuntime *rt;
+    JSContext *ctx;
+    JSValue ret_val;
+    int ret;
+    
+    rt = JS_NewRuntime();
+    if (rt == NULL) {
+        fatal(1, "JS_NewRuntime failure");
+    }        
+    ctx = JS_NewContext(rt);
+    if (ctx == NULL) {
+        JS_FreeRuntime(rt);
+        fatal(1, "JS_NewContext failure");
+    }
+    JS_SetContextOpaque(ctx, agent);
+    JS_SetRuntimeInfo(rt, "agent");
+    JS_SetCanBlock(rt, TRUE);
+    
+    add_helpers(ctx, 0, NULL);
+    ret_val = JS_Eval(ctx, agent->script, strlen(agent->script),
+                      "<evalScript>", JS_EVAL_TYPE_GLOBAL);
+    free(agent->script);
+    agent->script = NULL;
+    if (JS_IsException(ret_val))
+        js_std_dump_error(ctx);
+    JS_FreeValue(ctx, ret_val);
+    
+    for(;;) {
+        JSContext *ctx1;
+        ret = JS_ExecutePendingJob(JS_GetRuntime(ctx), &ctx1);
+        if (ret < 0) {
+            js_std_dump_error(ctx);
+            break;
+        } else if (ret == 0) {
+            if (JS_IsUndefined(agent->broadcast_func)) {
+                break;
+            } else {
+                JSValue args[2];
+                
+                pthread_mutex_lock(&agent_mutex);
+                while (!agent->broadcast_pending) {
+                    pthread_cond_wait(&agent_cond, &agent_mutex);
+                }
+                
+                agent->broadcast_pending = FALSE;
+                pthread_cond_signal(&agent_cond);
+
+                pthread_mutex_unlock(&agent_mutex);
+
+                args[0] = JS_NewArrayBuffer(ctx, agent->broadcast_sab_buf,
+                                            agent->broadcast_sab_size,
+                                            NULL, NULL, TRUE);
+                args[1] = JS_NewInt32(ctx, agent->broadcast_val);
+                ret_val = JS_Call(ctx, agent->broadcast_func, JS_UNDEFINED,
+                                  2, (JSValueConst *)args);
+                JS_FreeValue(ctx, args[0]);
+                JS_FreeValue(ctx, args[1]);
+                if (JS_IsException(ret_val))
+                    js_std_dump_error(ctx);
+                JS_FreeValue(ctx, ret_val);
+                JS_FreeValue(ctx, agent->broadcast_func);
+                agent->broadcast_func = JS_UNDEFINED;
+            }
+        }
+    }
+    JS_FreeValue(ctx, agent->broadcast_func);
+
+    JS_FreeContext(ctx);
+    JS_FreeRuntime(rt);
+    return NULL;
+}
+
+static JSValue js_agent_start(JSContext *ctx, JSValue this_val,
+                              int argc, JSValue *argv)
+{
+    const char *script;
+    Test262Agent *agent;
+
+    if (JS_GetContextOpaque(ctx) != NULL)
+        return JS_ThrowTypeError(ctx, "cannot be called inside an agent");
+    
+    script = JS_ToCString(ctx, argv[0]);
+    if (!script)
+        return JS_EXCEPTION;
+    agent = malloc(sizeof(*agent));
+    memset(agent, 0, sizeof(*agent));
+    agent->broadcast_func = JS_UNDEFINED;
+    agent->broadcast_sab = JS_UNDEFINED;
+    agent->script = strdup(script);
+    JS_FreeCString(ctx, script);
+    list_add_tail(&agent->link, &agent_list);
+    pthread_create(&agent->tid, NULL, agent_start, agent);
+    return JS_UNDEFINED;
+}
+
+static void js_agent_free(JSContext *ctx)
+{
+    struct list_head *el, *el1;
+    Test262Agent *agent;
+    
+    list_for_each_safe(el, el1, &agent_list) {
+        agent = list_entry(el, Test262Agent, link);
+        pthread_join(agent->tid, NULL);
+        JS_FreeValue(ctx, agent->broadcast_sab);
+        list_del(&agent->link);
+        free(agent);
+    }
+}
+ 
+static JSValue js_agent_leaving(JSContext *ctx, JSValue this_val,
+                                int argc, JSValue *argv)
+{
+    Test262Agent *agent = JS_GetContextOpaque(ctx);
+    if (!agent)
+        return JS_ThrowTypeError(ctx, "must be called inside an agent");
+    /* nothing to do */
+    return JS_UNDEFINED;
+}
+
+static BOOL is_broadcast_pending(void)
+{
+    struct list_head *el;
+    Test262Agent *agent;
+    list_for_each(el, &agent_list) {
+        agent = list_entry(el, Test262Agent, link);
+        if (agent->broadcast_pending)
+            return TRUE;
+    }
+    return FALSE;
+}
+
+static JSValue js_agent_broadcast(JSContext *ctx, JSValue this_val,
+                                  int argc, JSValue *argv)
+{
+    JSValueConst sab = argv[0];
+    struct list_head *el;
+    Test262Agent *agent;
+    uint8_t *buf;
+    size_t buf_size;
+    int32_t val;
+    
+    if (JS_GetContextOpaque(ctx) != NULL)
+        return JS_ThrowTypeError(ctx, "cannot be called inside an agent");
+    
+    buf = JS_GetArrayBuffer(ctx, &buf_size, sab);
+    if (!buf)
+        return JS_EXCEPTION;
+    if (JS_ToInt32(ctx, &val, argv[1]))
+        return JS_EXCEPTION;
+    
+    /* broadcast the values and wait until all agents have started
+       calling their callbacks */
+    pthread_mutex_lock(&agent_mutex);
+    list_for_each(el, &agent_list) {
+        agent = list_entry(el, Test262Agent, link);
+        agent->broadcast_pending = TRUE;
+        /* the shared array buffer is used by the thread, so increment
+           its refcount */
+        agent->broadcast_sab = JS_DupValue(ctx, sab);
+        agent->broadcast_sab_buf = buf;
+        agent->broadcast_sab_size = buf_size;
+        agent->broadcast_val = val;
+    }
+    pthread_cond_broadcast(&agent_cond);
+
+    while (is_broadcast_pending()) {
+        pthread_cond_wait(&agent_cond, &agent_mutex);
+    }
+    pthread_mutex_unlock(&agent_mutex);
+    return JS_UNDEFINED;
+}
+
+static JSValue js_agent_receiveBroadcast(JSContext *ctx, JSValue this_val,
+                                         int argc, JSValue *argv)
+{
+    Test262Agent *agent = JS_GetContextOpaque(ctx);
+    if (!agent)
+        return JS_ThrowTypeError(ctx, "must be called inside an agent");
+    if (!JS_IsFunction(ctx, argv[0]))
+        return JS_ThrowTypeError(ctx, "expecting function");
+    JS_FreeValue(ctx, agent->broadcast_func);
+    agent->broadcast_func = JS_DupValue(ctx, argv[0]);
+    return JS_UNDEFINED;
+}
+
+static JSValue js_agent_sleep(JSContext *ctx, JSValue this_val,
+                              int argc, JSValue *argv)
+{
+    uint32_t duration;
+    if (JS_ToUint32(ctx, &duration, argv[0]))
+        return JS_EXCEPTION;
+    usleep(duration * 1000);
+    return JS_UNDEFINED;
+}
+
+static JSValue js_agent_monotonicNow(JSContext *ctx, JSValue this_val,
+                                     int argc, JSValue *argv)
+{
+    struct timespec ts;
+    clock_gettime(CLOCK_MONOTONIC, &ts);
+    return JS_NewInt64(ctx, (uint64_t)ts.tv_sec * 1000 +
+                       (ts.tv_nsec / 1000000));
+}
+
+static JSValue js_agent_getReport(JSContext *ctx, JSValue this_val,
+                                  int argc, JSValue *argv)
+{
+    AgentReport *rep;
+    JSValue ret;
+
+    pthread_mutex_lock(&report_mutex);
+    if (list_empty(&report_list)) {
+        rep = NULL;
+    } else {
+        rep = list_entry(report_list.next, AgentReport, link);
+        list_del(&rep->link);
+    }
+    pthread_mutex_unlock(&report_mutex);
+    if (rep) {
+        ret = JS_NewString(ctx, rep->str);
+        free(rep->str);
+        free(rep);
+    } else {
+        ret = JS_NULL;
+    }
+    return ret;
+}
+
+static JSValue js_agent_report(JSContext *ctx, JSValue this_val,
+                               int argc, JSValue *argv)
+{
+    const char *str;
+    AgentReport *rep;
+
+    str = JS_ToCString(ctx, argv[0]);
+    if (!str)
+        return JS_EXCEPTION;
+    rep = malloc(sizeof(*rep));
+    rep->str = strdup(str);
+    JS_FreeCString(ctx, str);
+    
+    pthread_mutex_lock(&report_mutex);
+    list_add_tail(&rep->link, &report_list);
+    pthread_mutex_unlock(&report_mutex);
+    return JS_UNDEFINED;
+}
+
+static const JSCFunctionListEntry js_agent_funcs[] = {
+    /* only in main */
+    JS_CFUNC_DEF("start", 1, js_agent_start ),
+    JS_CFUNC_DEF("getReport", 0, js_agent_getReport ),
+    JS_CFUNC_DEF("broadcast", 2, js_agent_broadcast ),
+    /* only in agent */
+    JS_CFUNC_DEF("report", 1, js_agent_report ),
+    JS_CFUNC_DEF("leaving", 0, js_agent_leaving ),
+    JS_CFUNC_DEF("receiveBroadcast", 1, js_agent_receiveBroadcast ),
+    /* in both */
+    JS_CFUNC_DEF("sleep", 1, js_agent_sleep ),
+    JS_CFUNC_DEF("monotonicNow", 0, js_agent_monotonicNow ),
+};
+    
+static JSValue js_new_agent(JSContext *ctx)
+{
+    JSValue agent;
+    agent = JS_NewObject(ctx);
+    JS_SetPropertyFunctionList(ctx, agent, js_agent_funcs,
+                               countof(js_agent_funcs));
+    return agent;
+}
+#endif
+
+static void add_helpers(JSContext *ctx, int argc, char **argv)
+{
+    JSValue global_obj;
+    JSValue obj262;
+    
+    global_obj = JS_GetGlobalObject(ctx);
+
+    JS_SetPropertyStr(ctx, global_obj, "print",
+                      JS_NewCFunction(ctx, js_print, "print", 1));
+
+    /* $262 special object used by the tests */
+    obj262 = JS_NewObject(ctx);
+    JS_SetPropertyStr(ctx, obj262, "detachArrayBuffer",
+                      JS_NewCFunction(ctx, js_detachArrayBuffer,
+                                      "detachArrayBuffer", 1));
+    JS_SetPropertyStr(ctx, obj262, "evalScript",
+                      JS_NewCFunction(ctx, js_evalScript,
+                                      "evalScript", 1));
+    JS_SetPropertyStr(ctx, obj262, "codePointRange",
+                      JS_NewCFunction(ctx, js_string_codePointRange,
+                                      "codePointRange", 2));
+#ifdef CONFIG_AGENT
+    JS_SetPropertyStr(ctx, obj262, "agent", js_new_agent(ctx));
+#endif
+
+    JS_SetPropertyStr(ctx, global_obj, "$262", obj262);
+    
+    JS_FreeValue(ctx, global_obj);
+}
+
+static char *load_file(const char *filename, size_t *lenp)
+{
+    char *buf;
+    size_t buf_len;
+    buf = (char *)js_load_file(NULL, &buf_len, filename);
+    if (!buf)
+        perror_exit(1, filename);
+    if (lenp)
+        *lenp = buf_len;
+    return buf;
+}
+
+static JSModuleDef *js_module_loader_test(JSContext *ctx,
+                                          const char *module_name, void *opaque)
+{
+    size_t buf_len;
+    uint8_t *buf;
+    JSModuleDef *m;
+    JSValue func_val;
+    
+    buf = js_load_file(ctx, &buf_len, module_name);
+    if (!buf) {
+        JS_ThrowReferenceError(ctx, "could not load module filename '%s'",
+                               module_name);
+        return NULL;
+    }
+    
+    /* compile the module */
+    func_val = JS_Eval(ctx, (char *)buf, buf_len, module_name,
+                       JS_EVAL_TYPE_MODULE | JS_EVAL_FLAG_COMPILE_ONLY);
+    js_free(ctx, buf);
+    if (JS_IsException(func_val))
+        return NULL;
+    /* the module is already referenced, so we must free it */
+    m = JS_VALUE_GET_PTR(func_val);
+    JS_FreeValue(ctx, func_val);
+    return m;
+}
+
+int is_line_sep(char c)
+{
+    return (c == '\0' || c == '\n' || c == '\r');
+}
+
+char *find_line(const char *str, const char *line)
+{
+    if (str) {
+        const char *p;
+        int len = strlen(line);
+        for (p = str; (p = strstr(p, line)) != NULL; p += len + 1) {
+            if ((p == str || is_line_sep(p[-1])) && is_line_sep(p[len]))
+                return (char *)p;
+        }
+    }
+    return NULL;
+}
+
+int is_word_sep(char c)
+{
+    return (c == '\0' || isspace((unsigned char)c) || c == ',');
+}
+
+char *find_word(const char *str, const char *word)
+{
+    const char *p;
+    int len = strlen(word);
+    if (str && len) {
+        for (p = str; (p = strstr(p, word)) != NULL; p += len) {
+            if ((p == str || is_word_sep(p[-1])) && is_word_sep(p[len]))
+                return (char *)p;
+        }
+    }
+    return NULL;
+}
+
+/* handle exclude directories */
+void update_exclude_dirs(void)
+{
+    namelist_t *lp = &test_list;
+    namelist_t *ep = &exclude_list;
+    namelist_t *dp = &exclude_dir_list;
+    char *name;
+    int i, j, count;
+
+    /* split directpries from exclude_list */
+    for (count = i = 0; i < ep->count; i++) {
+        name = ep->array[i];
+        if (has_suffix(name, "/")) {
+            namelist_add(dp, NULL, name);
+            free(name);
+        } else {
+            ep->array[count++] = name;
+        }
+    }
+    ep->count = count;
+
+    namelist_sort(dp);
+
+    /* filter out excluded directories */
+    for (count = i = 0; i < lp->count; i++) {
+        name = lp->array[i];
+        for (j = 0; j < dp->count; j++) {
+            if (has_prefix(name, dp->array[j])) {
+                test_excluded++;
+                free(name);
+                name = NULL;
+                break;
+            }
+        }
+        if (name) {
+            lp->array[count++] = name;
+        }
+    }
+    lp->count = count;
+}
+
+void load_config(const char *filename)
+{
+    char buf[1024];
+    FILE *f;
+    char *base_name;
+    enum {
+        SECTION_NONE = 0,
+        SECTION_CONFIG,
+        SECTION_EXCLUDE,
+        SECTION_FEATURES,
+        SECTION_TESTS,
+    } section = SECTION_NONE;
+    int lineno = 0;
+
+    f = fopen(filename, "rb");
+    if (!f) {
+        perror_exit(1, filename);
+    }
+    base_name = get_basename(filename);
+    
+    while (fgets(buf, sizeof(buf), f) != NULL) {
+        char *p, *q;
+        lineno++;
+        p = str_strip(buf);
+        if (*p == '#' || *p == ';' || *p == '\0')
+            continue;  /* line comment */
+        
+        if (*p == "[]"[0]) {
+            /* new section */
+            p++;
+            p[strcspn(p, "]")] = '\0';
+            if (str_equal(p, "config"))
+                section = SECTION_CONFIG;
+            else if (str_equal(p, "exclude"))
+                section = SECTION_EXCLUDE;
+            else if (str_equal(p, "features"))
+                section = SECTION_FEATURES;
+            else if (str_equal(p, "tests"))
+                section = SECTION_TESTS;
+            else
+                section = SECTION_NONE;
+            continue;
+        }
+        q = strchr(p, '=');
+        if (q) {
+            /* setting: name=value */
+            *q++ = '\0';
+            q = str_strip(q);
+        }
+        switch (section) {
+        case SECTION_CONFIG:
+            if (!q) {
+                printf("%s:%d: syntax error\n", filename, lineno);
+                continue;
+            }
+            if (str_equal(p, "style")) {
+                new_style = str_equal(q, "new");
+                continue;
+            }
+            if (str_equal(p, "testdir")) {
+                char *testdir = compose_path(base_name, q);
+                enumerate_tests(testdir);
+                free(testdir);
+                continue;
+            }
+            if (str_equal(p, "harnessdir")) {
+                harness_dir = compose_path(base_name, q);
+                continue;
+            }
+            if (str_equal(p, "harnessexclude")) {
+                str_append(&harness_exclude, " ", q);
+                continue;
+            }
+            if (str_equal(p, "features")) {
+                str_append(&harness_features, " ", q);
+                continue;
+            }
+            if (str_equal(p, "skip-features")) {
+                str_append(&harness_skip_features, " ", q);
+                continue;
+            }
+            if (str_equal(p, "mode")) {
+                if (str_equal(q, "default") || str_equal(q, "default-nostrict"))
+                    test_mode = TEST_DEFAULT_NOSTRICT;
+                else if (str_equal(q, "default-strict"))
+                    test_mode = TEST_DEFAULT_STRICT;
+                else if (str_equal(q, "nostrict"))
+                    test_mode = TEST_NOSTRICT;
+                else if (str_equal(q, "strict"))
+                    test_mode = TEST_STRICT;
+                else if (str_equal(q, "all") || str_equal(q, "both"))
+                    test_mode = TEST_ALL;
+                else 
+                    fatal(2, "unknown test mode: %s", q);
+                continue;
+            }
+            if (str_equal(p, "strict")) {
+                if (str_equal(q, "skip") || str_equal(q, "no"))
+                    test_mode = TEST_NOSTRICT;
+                continue;
+            }
+            if (str_equal(p, "nostrict")) {
+                if (str_equal(q, "skip") || str_equal(q, "no"))
+                    test_mode = TEST_STRICT;
+                continue;
+            }
+            if (str_equal(p, "async")) {
+                skip_async = !str_equal(q, "yes");
+                continue;
+            }
+            if (str_equal(p, "module")) {
+                skip_module = !str_equal(q, "yes");
+                continue;
+            }
+            if (str_equal(p, "verbose")) {
+                verbose = str_equal(q, "yes");
+                continue;
+            }
+            if (str_equal(p, "errorfile")) {
+                error_filename = compose_path(base_name, q);
+                continue;
+            }
+            if (str_equal(p, "excludefile")) {
+                char *path = compose_path(base_name, q);
+                namelist_load(&exclude_list, path);
+                free(path);
+                continue;
+            }
+            if (str_equal(p, "reportfile")) {
+                report_filename = compose_path(base_name, q);
+                continue;
+            }
+        case SECTION_EXCLUDE:
+            namelist_add(&exclude_list, base_name, p);
+            break;
+        case SECTION_FEATURES:
+            if (!q || str_equal(q, "yes"))
+                str_append(&harness_features, " ", p);
+            else
+                str_append(&harness_skip_features, " ", p);
+            break;
+        case SECTION_TESTS:
+            namelist_add(&test_list, base_name, p);
+            break;
+        default:
+            /* ignore settings in other sections */
+            break;
+        }
+    }
+    fclose(f);
+    free(base_name);
+}
+
+char *find_error(const char *filename, int *pline, int is_strict)
+{
+    if (error_file) {
+        size_t len = strlen(filename);
+        const char *p, *q, *r;
+        int line;
+
+        for (p = error_file; (p = strstr(p, filename)) != NULL; p += len) {
+            if ((p == error_file || p[-1] == '\n' || p[-1] == '(') && p[len] == ':') {
+                q = p + len;
+                line = 1;
+                if (*q == ':') {
+                    line = strtol(q + 1, (char**)&q, 10);
+                    if (*q == ':')
+                        q++;
+                }
+                while (*q == ' ') {
+                    q++;
+                }
+                /* check strict mode indicator */
+                if (!strstart(q, "strict mode: ", &q) != !is_strict)
+                    continue;
+                r = q = skip_prefix(q, "unexpected error: ");
+                r += strcspn(r, "\n");
+                while (r[0] == '\n' && r[1] && strncmp(r + 1, filename, 8)) {
+                    r++;
+                    r += strcspn(r, "\n");
+                }
+                if (pline)
+                    *pline = line;
+                return strdup_len(q, r - q);
+            }
+        }
+    }
+    return NULL;
+}
+
+int skip_comments(const char *str, int line, int *pline)
+{
+    const char *p;
+    int c;
+
+    p = str;
+    while ((c = (unsigned char)*p++) != '\0') {
+        if (isspace(c)) {
+            if (c == '\n')
+                line++;
+            continue;
+        }
+        if (c == '/' && *p == '/') {
+            while (*++p && *p != '\n')
+                continue;
+            continue;
+        }
+        if (c == '/' && *p == '*') {
+            for (p += 1; *p; p++) {
+                if (*p == '\n') {
+                    line++;
+                    continue;
+                }
+                if (*p == '*' && p[1] == '/') {
+                    p += 2;
+                    break;
+                }
+            }
+            continue;
+        }
+        break;
+    }
+    if (pline)
+        *pline = line;
+
+    return p - str;
+}
+
+int longest_match(const char *str, const char *find, int pos, int *ppos, int line, int *pline)
+{
+    int len, maxlen;
+
+    maxlen = 0;
+    
+    if (*find) {
+        const char *p;
+        for (p = str + pos; *p; p++) {
+            if (*p == *find) {
+                for (len = 1; p[len] && p[len] == find[len]; len++)
+                    continue;
+                if (len > maxlen) {
+                    maxlen = len;
+                    if (ppos)
+                        *ppos = p - str;
+                    if (pline)
+                        *pline = line;
+                    if (!find[len])
+                        break;
+                }
+            }
+            if (*p == '\n')
+                line++;
+        }
+    }
+    return maxlen;
+}
+
+static int eval_buf(JSContext *ctx, const char *buf, size_t buf_len,
+                    const char *filename, int is_test, int is_negative,
+                    const char *error_type, FILE *outfile, int eval_flags,
+                    int is_async)
+{
+    JSValue res_val, exception_val;
+    int ret, error_line, pos, pos_line;
+    BOOL is_error, has_error_line;
+    const char *error_name;
+    
+    pos = skip_comments(buf, 1, &pos_line);
+    error_line = pos_line;
+    has_error_line = FALSE;
+    exception_val = JS_UNDEFINED;
+    error_name = NULL;
+
+    res_val = JS_Eval(ctx, buf, buf_len, filename, eval_flags);
+
+    if (is_async && !JS_IsException(res_val)) {
+        JS_FreeValue(ctx, res_val);
+        for(;;) {
+            JSContext *ctx1;
+            ret = JS_ExecutePendingJob(JS_GetRuntime(ctx), &ctx1);
+            if (ret < 0) {
+                res_val = JS_EXCEPTION;
+                break;
+            } else if (ret == 0) {
+                JSValue global;
+                /* test if the test called $DONE() */
+                global = JS_GetGlobalObject(ctx);
+                res_val = JS_GetPropertyStr(ctx, global, "$async_done");
+                JS_FreeValue(ctx, global);
+                if (!JS_IsException(res_val) && JS_IsUndefined(res_val)) {
+                    res_val = JS_ThrowTypeError(ctx, "$DONE() not called");
+                }
+                break;
+            }
+        }
+    }
+
+    if (JS_IsException(res_val)) {
+        exception_val = JS_GetException(ctx);
+        is_error = JS_IsError(ctx, exception_val);
+        /* XXX: should get the filename and line number */
+        if (outfile) {
+            if (!is_error)
+                fprintf(outfile, "%sThrow: ", (eval_flags & JS_EVAL_FLAG_STRICT) ?
+                        "strict mode: " : "");
+            js_print(ctx, JS_NULL, 1, &exception_val);
+        }
+        if (is_error) {
+            JSValue name, stack;
+            const char *stack_str;
+        
+            name = JS_GetPropertyStr(ctx, exception_val, "name");
+            error_name = JS_ToCString(ctx, name);
+            stack = JS_GetPropertyStr(ctx, exception_val, "stack");
+            if (!JS_IsUndefined(stack)) {
+                stack_str = JS_ToCString(ctx, stack);
+                if (stack_str) {
+                    const char *p;
+                    int len;
+                    
+                    if (outfile)
+                        fprintf(outfile, "%s", stack_str);
+                    
+                    len = strlen(filename);
+                    p = strstr(stack_str, filename);
+                    if (p != NULL && p[len] == ':') {
+                        error_line = atoi(p + len + 1);
+                        has_error_line = TRUE;
+                    }
+                    JS_FreeCString(ctx, stack_str);
+                }
+            }
+            JS_FreeValue(ctx, stack);
+            JS_FreeValue(ctx, name);
+        }
+        if (is_negative) {
+            ret = 0;
+            if (error_type) {
+                char *error_class;
+                const char *msg;
+            
+                msg = JS_ToCString(ctx, exception_val);
+                error_class = strdup_len(msg, strcspn(msg, ":"));
+                if (!str_equal(error_class, error_type))
+                    ret = -1;
+                free(error_class);
+                JS_FreeCString(ctx, msg);
+            }
+        } else {
+            ret = -1;
+        }
+    } else {
+        if (is_negative)
+            ret = -1;
+        else
+            ret = 0;
+    }
+
+    if (verbose && is_test) {
+        JSValue msg_val = JS_UNDEFINED;
+        const char *msg = NULL;
+        int s_line;
+        char *s = find_error(filename, &s_line, eval_flags & JS_EVAL_FLAG_STRICT);
+        const char *strict_mode = (eval_flags & JS_EVAL_FLAG_STRICT) ? "strict mode: " : "";
+
+        if (!JS_IsUndefined(exception_val)) {
+            msg_val = JS_ToString(ctx, exception_val);
+            msg = JS_ToCString(ctx, msg_val);
+        }
+        if (is_negative) {  // expect error
+            if (ret == 0) {
+                if (msg && s &&
+                    (str_equal(s, "expected error") ||
+                     strstart(s, "unexpected error type:", NULL) ||
+                     str_equal(s, msg))) {     // did not have error yet
+                    if (!has_error_line) {
+                        longest_match(buf, msg, pos, &pos, pos_line, &error_line);
+                    }
+                    printf("%s:%d: %sOK, now has error %s\n",
+                           filename, error_line, strict_mode, msg);
+                    fixed_errors++;
+                }
+            } else {
+                if (!s) {   // not yet reported
+                    if (msg) {
+                        fprintf(error_out, "%s:%d: %sunexpected error type: %s\n",
+                                filename, error_line, strict_mode, msg);
+                    } else {
+                        fprintf(error_out, "%s:%d: %sexpected error\n",
+                                filename, error_line, strict_mode);
+                    }
+                    new_errors++;
+                }
+            }
+        } else {            // should not have error
+            if (msg) {
+                if (!s || !str_equal(s, msg)) {
+                    if (!has_error_line) {
+                        char *p = skip_prefix(msg, "Test262 Error: ");
+                        if (strstr(p, "Test case returned non-true value!")) {
+                            longest_match(buf, "runTestCase", pos, &pos, pos_line, &error_line);
+                        } else {
+                            longest_match(buf, p, pos, &pos, pos_line, &error_line);
+                        }
+                    }
+                    fprintf(error_out, "%s:%d: %s%s%s\n", filename, error_line, strict_mode,
+                            error_file ? "unexpected error: " : "", msg);
+
+                    if (s && (!str_equal(s, msg) || error_line != s_line)) {
+                        printf("%s:%d: %sprevious error: %s\n", filename, s_line, strict_mode, s);
+                        changed_errors++;
+                    } else {
+                        new_errors++;
+                    }
+                }
+            } else {
+                if (s) {
+                    printf("%s:%d: %sOK, fixed error: %s\n", filename, s_line, strict_mode, s);
+                    fixed_errors++;
+                }
+            }
+        }
+        JS_FreeValue(ctx, msg_val);
+        JS_FreeCString(ctx, msg);
+        free(s);
+    }
+    JS_FreeCString(ctx, error_name);
+    JS_FreeValue(ctx, exception_val);
+    JS_FreeValue(ctx, res_val);
+    return ret;
+}
+
+static int eval_file(JSContext *ctx, const char *base, const char *p,
+                     int eval_flags)
+{
+    char *buf;
+    size_t buf_len;
+    char *filename = compose_path(base, p);
+
+    buf = load_file(filename, &buf_len);
+    if (!buf) {
+        warning("cannot load %s", filename);
+        goto fail;
+    }
+    if (eval_buf(ctx, buf, buf_len, filename, FALSE, FALSE, NULL, stderr,
+                 eval_flags, FALSE)) {
+        warning("error evaluating %s", filename);
+        goto fail;
+    }
+    free(buf);
+    free(filename);
+    return 0;
+
+fail:
+    free(buf);
+    free(filename);
+    return 1;
+}
+
+char *extract_desc(const char *buf, char style)
+{
+    const char *p, *desc_start;
+    char *desc;
+    int len;
+    
+    p = buf;
+    while (*p != '\0') {
+        if (p[0] == '/' && p[1] == '*' && p[2] == style && p[3] != '/') {
+            p += 3;
+            desc_start = p;
+            while (*p != '\0' && (p[0] != '*' || p[1] != '/'))
+                p++;
+            if (*p == '\0') {
+                warning("Expecting end of desc comment");
+                return NULL;
+            }
+            len = p - desc_start;
+            desc = malloc(len + 1);
+            memcpy(desc, desc_start, len);
+            desc[len] = '\0';
+            return desc;
+        } else {
+            p++;
+        }
+    }
+    return NULL;
+}
+
+static char *find_tag(char *desc, const char *tag, int *state)
+{
+    char *p;
+    p = strstr(desc, tag);
+    if (p) {
+        p += strlen(tag);
+        *state = 0;
+    }
+    return p;
+}
+
+static char *get_option(char **pp, int *state)
+{
+    char *p, *p0, *option = NULL;
+    if (*pp) {
+        for (p = *pp;; p++) {
+            switch (*p) {
+            case '[':
+                *state += 1;
+                continue;
+            case ']':
+                *state -= 1;
+                if (*state > 0)
+                    continue;
+                p = NULL;
+                break;
+            case ' ':
+            case '\t':
+            case '\r':
+            case ',':
+            case '-':
+                continue;
+            case '\n':
+                if (*state > 0 || p[1] == ' ')
+                    continue;
+                p = NULL;
+                break;
+            case '\0':
+                p = NULL;
+                break;
+            default:
+                p0 = p;
+                p += strcspn(p0, " \t\r\n,]");
+                option = strdup_len(p0, p - p0);
+                break;
+            }
+            break;
+        }
+        *pp = p;
+    }
+    return option;
+}
+
+void update_stats(JSRuntime *rt, const char *filename) {
+    JSMemoryUsage stats;
+    JS_ComputeMemoryUsage(rt, &stats);
+    if (stats_count++ == 0) {
+        stats_avg = stats_all = stats_min = stats_max = stats;
+        stats_min_filename = strdup(filename);
+        stats_max_filename = strdup(filename);
+    } else {
+        if (stats_max.malloc_size < stats.malloc_size) {
+            stats_max = stats;
+            free(stats_max_filename);
+            stats_max_filename = strdup(filename);
+        }
+        if (stats_min.malloc_size > stats.malloc_size) {
+            stats_min = stats;
+            free(stats_min_filename);
+            stats_min_filename = strdup(filename);
+        }
+
+#define update(f)  stats_avg.f = (stats_all.f += stats.f) / stats_count
+        update(malloc_count);
+        update(malloc_size);
+        update(memory_used_count);
+        update(memory_used_size);
+        update(atom_count);
+        update(atom_size);
+        update(str_count);
+        update(str_size);
+        update(obj_count);
+        update(obj_size);
+        update(prop_count);
+        update(prop_size);
+        update(shape_count);
+        update(shape_size);
+        update(js_func_count);
+        update(js_func_size);
+        update(js_func_code_size);
+        update(js_func_pc2line_count);
+        update(js_func_pc2line_size);
+        update(c_func_count);
+        update(array_count);
+        update(fast_array_count);
+        update(fast_array_elements);
+    }
+#undef update
+}
+
+int run_test_buf(const char *filename, char *harness, namelist_t *ip,
+                 char *buf, size_t buf_len, const char* error_type,
+                 int eval_flags, BOOL is_negative, BOOL is_async,
+                 BOOL can_block)
+{
+    JSRuntime *rt;
+    JSContext *ctx;
+    int i, ret;
+        
+    rt = JS_NewRuntime();
+    if (rt == NULL) {
+        fatal(1, "JS_NewRuntime failure");
+    }        
+    ctx = JS_NewContext(rt);
+    if (ctx == NULL) {
+        JS_FreeRuntime(rt);
+        fatal(1, "JS_NewContext failure");
+    }
+    JS_SetRuntimeInfo(rt, filename);
+
+    JS_SetCanBlock(rt, can_block);
+    
+    /* loader for ES6 modules */
+    JS_SetModuleLoaderFunc(rt, NULL, js_module_loader_test, NULL);
+        
+    add_helpers(ctx, 0, NULL);
+
+    /* add backtrace if the isError property is present in a thrown
+       object */
+    JS_EnableIsErrorProperty(ctx, TRUE);
+
+    /* a few tests use it, probably a bug in the tests */
+    {
+        JSValue global_obj = JS_GetGlobalObject(ctx);
+        JS_DefinePropertyValueStr(ctx, global_obj, "global",
+                                  global_obj,
+                                  JS_PROP_WRITABLE | JS_PROP_CONFIGURABLE);
+    }
+    
+    for (i = 0; i < ip->count; i++) {
+        if (eval_file(ctx, harness, ip->array[i],
+                      JS_EVAL_TYPE_GLOBAL | JS_EVAL_FLAG_STRIP)) {
+            fatal(1, "error including %s for %s", ip->array[i], filename);
+        }
+    }
+
+    ret = eval_buf(ctx, buf, buf_len, filename, TRUE, is_negative,
+                   error_type, outfile, eval_flags, is_async);
+    ret = (ret != 0);
+        
+    if (dump_memory) {
+        update_stats(rt, filename);
+    }
+#ifdef CONFIG_AGENT
+    js_agent_free(ctx);
+#endif
+    JS_FreeContext(ctx);
+    JS_FreeRuntime(rt);
+
+    test_count++;
+    if (ret) {
+        test_failed++;
+        if (outfile) {
+            /* do not output a failure number to minimize diff */
+            fprintf(outfile, "  FAILED\n");
+        }
+    }
+    return ret;
+}
+
+int run_test(const char *filename, int index)
+{
+    char harnessbuf[1024];
+    char *harness;
+    char *buf;
+    size_t buf_len;
+    char *desc, *p;
+    char *error_type;
+    int ret, eval_flags, use_strict, use_nostrict;
+    BOOL is_negative, is_nostrict, is_onlystrict, is_async, is_module, skip;
+    BOOL can_block;
+    namelist_t include_list = { 0 }, *ip = &include_list;
+    
+    is_nostrict = is_onlystrict = is_negative = is_async = is_module = skip = FALSE;
+    can_block = FALSE;
+    error_type = NULL;
+    buf = load_file(filename, &buf_len);
+
+    harness = harness_dir;
+
+    if (new_style) {
+        if (!harness) {
+            p = strstr(filename, "test/");
+            if (p) {
+                snprintf(harnessbuf, sizeof(harnessbuf), "%.*s%s",
+                         (int)(p - filename), filename, "harness");
+            }
+            harness = harnessbuf;
+        }
+        namelist_add(ip, NULL, "sta.js");
+        namelist_add(ip, NULL, "assert.js");
+        /* extract the YAML frontmatter */
+        desc = extract_desc(buf, '-');
+        if (desc) {
+            char *ifile, *option;
+            int state;
+            p = find_tag(desc, "includes:", &state);
+            if (p) {
+                while ((ifile = get_option(&p, &state)) != NULL) {
+                    // skip unsupported harness files
+                    if (find_word(harness_exclude, ifile)) {
+                        skip |= 1;
+                    } else {
+                        namelist_add(ip, NULL, ifile);
+                    }
+                    free(ifile);
+                }
+            }
+            p = find_tag(desc, "flags:", &state);
+            if (p) {
+                while ((option = get_option(&p, &state)) != NULL) {
+                    if (str_equal(option, "noStrict")) {
+                        is_nostrict = TRUE;
+                        skip |= (test_mode == TEST_STRICT);
+                    }
+                    else if (str_equal(option, "onlyStrict")) {
+                        is_onlystrict = TRUE;
+                        skip |= (test_mode == TEST_NOSTRICT);
+                    }
+                    else if (str_equal(option, "async")) {
+                        is_async = TRUE;
+                        skip |= skip_async;
+                    }
+                    else if (str_equal(option, "module")) {
+                        is_module = TRUE;
+                        skip |= skip_module;
+                    }
+                    else if (str_equal(option, "CanBlockIsTrue")) {
+                        can_block = TRUE;
+                    }
+                    free(option);
+                }
+            }
+            p = find_tag(desc, "negative:", &state);
+            if (p) {
+                /* XXX: should extract the phase */
+                char *q = find_tag(p, "type:", &state);
+                if (q) {
+                    while (isspace(*q))
+                        q++;
+                    error_type = strdup_len(q, strcspn(q, " \n"));
+                }
+                is_negative = TRUE;
+            }
+            p = find_tag(desc, "features:", &state);
+            if (p) {
+                while ((option = get_option(&p, &state)) != NULL) {
+                    if (find_word(harness_features, option)) {
+                        /* feature is enabled */
+                    } else if (find_word(harness_skip_features, option)) {
+                        /* skip disabled feature */
+                        skip |= 1;
+                    } else {
+                        /* feature is not listed: skip and warn */
+                        printf("%s:%d: unknown feature: %s\n", filename, 1, option);
+                        skip |= 1;
+                    }
+                    free(option);
+                }
+            }
+            free(desc);
+        }
+        if (is_async)
+            namelist_add(ip, NULL, "doneprintHandle.js");
+    } else {
+        char *ifile;
+
+        if (!harness) {
+            p = strstr(filename, "test/");
+            if (p) {
+                snprintf(harnessbuf, sizeof(harnessbuf), "%.*s%s",
+                         (int)(p - filename), filename, "test/harness");
+            }
+            harness = harnessbuf;
+        }
+
+        namelist_add(ip, NULL, "sta.js");
+
+        /* include extra harness files */
+        for (p = buf; (p = strstr(p, "$INCLUDE(\"")) != NULL; p++) {
+            p += 10;
+            ifile = strdup_len(p, strcspn(p, "\""));
+            // skip unsupported harness files
+            if (find_word(harness_exclude, ifile)) {
+                skip |= 1;
+            } else {
+                namelist_add(ip, NULL, ifile);
+            }
+            free(ifile);
+        }
+
+        /* locate the old style configuration comment */
+        desc = extract_desc(buf, '*');
+        if (desc) {
+            if (strstr(desc, "@noStrict")) {
+                is_nostrict = TRUE;
+                skip |= (test_mode == TEST_STRICT);
+            }
+            if (strstr(desc, "@onlyStrict")) {
+                is_onlystrict = TRUE;
+                skip |= (test_mode == TEST_NOSTRICT);
+            }
+            if (strstr(desc, "@negative")) {
+                /* XXX: should extract the regex to check error type */
+                is_negative = TRUE;
+            }
+            free(desc);
+        }
+    }
+
+    if (outfile && index >= 0) {
+        fprintf(outfile, "%d: %s%s%s%s%s%s%s\n", index, filename,
+                is_nostrict ? "  @noStrict" : "",
+                is_onlystrict ? "  @onlyStrict" : "",
+                is_async ? "  async" : "",
+                is_module ? "  module" : "",
+                is_negative ? "  @negative" : "",
+                skip ? "  SKIPPED" : "");
+        fflush(outfile);
+    }
+
+    use_strict = use_nostrict = 0;
+    switch (test_mode) {
+    case TEST_DEFAULT_NOSTRICT:
+        if (is_onlystrict)
+            use_strict = 1;
+        else
+            use_nostrict = 1;
+        break;
+    case TEST_DEFAULT_STRICT:
+        if (is_nostrict)
+            use_nostrict = 1;
+        else
+            use_strict = 1;
+        break;
+    case TEST_NOSTRICT:
+        if (!is_onlystrict)
+            use_nostrict = 1;
+        break;
+    case TEST_STRICT:
+        if (!is_nostrict)
+            use_strict = 1;
+        break;
+    case TEST_ALL:
+        if (!is_nostrict)
+            use_strict = 1;
+        if (!is_onlystrict)
+            use_nostrict = 1;
+        break;
+    }
+
+    if (skip || use_strict + use_nostrict == 0) {
+        test_skipped++;
+        ret = -2;
+    } else {
+        clock_t clocks;
+
+        if (is_module) {
+            eval_flags = JS_EVAL_TYPE_MODULE;
+        } else {
+            eval_flags = JS_EVAL_TYPE_GLOBAL;
+        }
+        clocks = clock();
+        ret = 0;
+        if (use_nostrict) {
+            ret = run_test_buf(filename, harness, ip, buf, buf_len,
+                               error_type, eval_flags, is_negative, is_async,
+                               can_block);
+        }
+        if (use_strict) {
+            ret |= run_test_buf(filename, harness, ip, buf, buf_len,
+                                error_type, eval_flags | JS_EVAL_FLAG_STRICT,
+                                is_negative, is_async, can_block);
+        }
+        clocks = clock() - clocks;
+        if (outfile && index >= 0 && clocks >= CLOCKS_PER_SEC / 10) {
+            /* output timings for tests that take more than 100 ms */
+            fprintf(outfile, " time: %d ms\n", (int)(clocks * 1000LL / CLOCKS_PER_SEC));
+        }
+    }
+    namelist_free(&include_list);
+    free(error_type);
+    free(buf);
+
+    return ret;
+}
+
+clock_t last_clock;
+
+void show_progress(int force) {
+    clock_t t = clock();
+    if (force || !last_clock || (t - last_clock) > CLOCKS_PER_SEC / 20) {
+        last_clock = t;
+        /* output progress indicator: erase end of line and return to col 0 */
+        fprintf(stderr, "%d/%d/%d\033[K\r",
+                test_failed, test_count, test_skipped);
+        fflush(stderr);
+    }
+}
+
+void run_test_dir_list(namelist_t *lp, int start_index, int stop_index)
+{
+    int i;
+
+    namelist_sort(lp);
+    for (i = 0; i < lp->count; i++) {
+        const char *p = lp->array[i];
+        if (namelist_find(&exclude_list, p) >= 0) {
+            test_excluded++;
+        } else if (test_index < start_index) {
+            test_skipped++;
+        } else if (stop_index >= 0 && test_index > stop_index) {
+            test_skipped++;
+        } else {
+            run_test(p, test_index);
+            show_progress(FALSE);
+        }
+        test_index++;
+    }
+    show_progress(TRUE);
+}
+
+void help(void)
+{
+    printf("usage: run-test262 [options] {-f file ... | [dir_list] [index range]}\n"
+           "-h             help\n"
+           "-a             run tests in strict and nostrict modes\n"
+           "-m             print memory usage summary\n"
+           "-n             use new style harness\n"
+           "-s             run tests in strict mode, skip @nostrict tests\n"
+           "-u             update error file\n"
+           "-v             verbose: output error messages\n"
+           "-c file        read configuration from 'file'\n"
+           "-d dir         run all test files in directory tree 'dir'\n"
+           "-e file        load the known errors from 'file'\n"
+           "-f file        execute single test from 'file'\n"
+           "-r file        set the report file name (default=none)\n"
+           "-x file        exclude tests listed in 'file'\n");
+    exit(1);
+}
+
+char *get_opt_arg(const char *option, char *arg)
+{
+    if (!arg) {
+        fatal(2, "missing argument for option %s", option);
+    }
+    return arg;
+}
+
+int main(int argc, char **argv)
+{
+    int optind, start_index, stop_index;
+    BOOL is_dir_list;
+    BOOL only_check_errors = FALSE;
+    const char *filename;
+    
+#if !defined(_WIN32)
+    /* Date tests assume California local time */
+    setenv("TZ", "America/Los_Angeles", 1);
+#endif
+
+    /* cannot use getopt because we want to pass the command line to
+       the script */
+    optind = 1;
+    is_dir_list = TRUE;
+    while (optind < argc) {
+        char *arg = argv[optind];
+        if (*arg != '-')
+            break;
+        optind++;
+        if (str_equal(arg, "-h")) {
+            help();
+        } else if (str_equal(arg, "-m")) {
+            dump_memory++;
+        } else if (str_equal(arg, "-n")) {
+            new_style++;
+        } else if (str_equal(arg, "-s")) {
+            test_mode = TEST_STRICT;
+        } else if (str_equal(arg, "-a")) {
+            test_mode = TEST_ALL;
+        } else if (str_equal(arg, "-u")) {
+            update_errors++;
+        } else if (str_equal(arg, "-v")) {
+            verbose++;
+        } else if (str_equal(arg, "-c")) {
+            load_config(get_opt_arg(arg, argv[optind++]));
+        } else if (str_equal(arg, "-d")) {
+            enumerate_tests(get_opt_arg(arg, argv[optind++]));
+        } else if (str_equal(arg, "-e")) {
+            error_filename = get_opt_arg(arg, argv[optind++]);
+        } else if (str_equal(arg, "-x")) {
+            namelist_load(&exclude_list, get_opt_arg(arg, argv[optind++]));
+        } else if (str_equal(arg, "-f")) {
+            is_dir_list = FALSE;
+        } else if (str_equal(arg, "-r")) {
+            report_filename = get_opt_arg(arg, argv[optind++]);
+        } else if (str_equal(arg, "-E")) {
+            only_check_errors = TRUE;
+        } else {
+            fatal(1, "unknown option: %s", arg);
+            break;
+        }
+    }
+    
+    if (optind >= argc && !test_list.count)
+        help();
+
+    error_out = stdout;
+    if (error_filename) {
+        error_file = load_file(error_filename, NULL);
+        if (only_check_errors && error_file) {
+            namelist_free(&test_list);
+            namelist_add_from_error_file(&test_list, error_file);
+        }
+        if (update_errors) {
+            free(error_file);
+            error_file = NULL;
+            error_out = fopen(error_filename, "w");
+            if (!error_out) {
+                perror_exit(1, error_filename);
+            }
+        }
+    }
+
+    update_exclude_dirs();
+
+    if (is_dir_list) {
+        if (optind < argc && !isdigit(argv[optind][0])) {
+            filename = argv[optind++];
+            namelist_load(&test_list, filename);
+        }
+        start_index = 0;
+        stop_index = -1;
+        if (optind < argc) {
+            start_index = atoi(argv[optind++]);
+            if (optind < argc) {
+                stop_index = atoi(argv[optind++]);
+            }
+        }
+        if (!report_filename || str_equal(report_filename, "none")) {
+            outfile = NULL;
+        } else if (str_equal(report_filename, "-")) {
+            outfile = stdout;
+        } else {
+            outfile = fopen(report_filename, "wb");
+            if (!outfile) {
+                perror_exit(1, report_filename);
+            }
+        }
+        run_test_dir_list(&test_list, start_index, stop_index);
+
+        if (outfile && outfile != stdout) {
+            fclose(outfile);
+            outfile = NULL;
+        }
+    } else {
+        outfile = stdout;
+        while (optind < argc) {
+            run_test(argv[optind++], -1);
+        }
+    }
+
+    if (dump_memory) {
+        if (dump_memory > 1 && stats_count > 1) {
+            printf("\nMininum memory statistics for %s:\n\n", stats_min_filename);
+            JS_DumpMemoryUsage(stdout, &stats_min, NULL);
+            printf("\nMaximum memory statistics for %s:\n\n", stats_max_filename);
+            JS_DumpMemoryUsage(stdout, &stats_max, NULL);
+        }
+        printf("\nAverage memory statistics for %d tests:\n\n", stats_count);
+        JS_DumpMemoryUsage(stdout, &stats_avg, NULL);
+        printf("\n");
+    }
+
+    if (is_dir_list) {
+        fprintf(stderr, "Result: %d/%d error%s",
+                test_failed, test_count, test_count != 1 ? "s" : "");
+        if (test_excluded)
+            fprintf(stderr, ", %d excluded", test_excluded);
+        if (test_skipped)
+            fprintf(stderr, ", %d skipped", test_skipped);
+        if (error_file) {
+            if (new_errors)
+                fprintf(stderr, ", %d new", new_errors);
+            if (changed_errors)
+                fprintf(stderr, ", %d changed", changed_errors);
+            if (fixed_errors)
+                fprintf(stderr, ", %d fixed", fixed_errors);
+        }
+        fprintf(stderr, "\n");
+    }
+
+    if (error_out && error_out != stdout) {
+        fclose(error_out);
+        error_out = NULL;
+    }
+
+    namelist_free(&test_list);
+    namelist_free(&exclude_list);
+    namelist_free(&exclude_dir_list);
+    free(harness_dir);
+    free(harness_features);
+    free(harness_exclude);
+    free(error_file);
+
+    return 0;
+}
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262.conf b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262.conf
new file mode 100755
index 00000000..8a66cf19
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262.conf
@@ -0,0 +1,173 @@
+[config]
+# general settings for test262 ES6 version
+
+# framework style: old, new
+style=new
+
+# handle tests tagged as [noStrict]: yes, no, skip
+nostrict=yes
+
+# handle tests tagged as [strictOnly]: yes, no, skip
+strict=yes
+
+# test mode: default, default-nostrict, default-strict, strict, nostrict, both, all
+mode=default
+
+# handle tests flagged as [async]: yes, no, skip
+# for these, load 'harness/doneprintHandle.js' prior to test
+# and expect `print('Test262:AsyncTestComplete')` to be called for 
+# successful termination
+async=yes
+
+# handle tests flagged as [module]: yes, no, skip
+module=yes
+
+# output error messages: yes, no
+verbose=yes
+
+# load harness files from this directory
+harnessdir=test262/harness
+
+# names of harness include files to skip
+#harnessexclude=
+
+# name of the error file for known errors
+errorfile=test262_errors.txt
+
+# exclude tests enumerated in this file (see also [exclude] section)
+#excludefile=test262_exclude.txt
+
+# report test results to this file
+reportfile=test262_report.txt
+
+# enumerate tests from this directory
+testdir=test262/test
+
+[features]
+# Standard language features and proposed extensions
+# list the features that are included
+# skipped features are tagged as such to avoid warnings
+
+Array.prototype.flat
+Array.prototype.flatMap
+Array.prototype.flatten
+Array.prototype.values
+ArrayBuffer
+arrow-function
+async-functions
+async-iteration
+Atomics
+BigInt=skip
+caller
+class
+class-fields-private=skip
+class-fields-public=skip
+computed-property-names
+const
+cross-realm=skip
+DataView
+DataView.prototype.getFloat32
+DataView.prototype.getFloat64
+DataView.prototype.getInt16
+DataView.prototype.getInt32
+DataView.prototype.getInt8
+DataView.prototype.getUint16
+DataView.prototype.getUint32
+DataView.prototype.setUint8
+default-arg
+default-parameters
+destructuring-assignment
+destructuring-binding
+export-star-as-namespace-from-module=skip
+Float32Array
+Float64Array
+for-of
+generators
+global
+Int8Array
+IsHTMLDDA=skip
+json-superset
+let
+Map
+new.target
+numeric-separator-literal
+object-rest
+object-spread
+Object.is
+optional-catch-binding
+Promise.prototype.finally
+Proxy
+Reflect
+Reflect.construct
+Reflect.set
+Reflect.setPrototypeOf
+regexp-dotall
+regexp-lookbehind
+regexp-named-groups
+regexp-unicode-property-escapes
+Set
+SharedArrayBuffer
+string-trimming
+String.fromCodePoint
+String.prototype.endsWith
+String.prototype.includes
+String.prototype.matchAll=skip
+String.prototype.trimEnd
+String.prototype.trimStart
+super
+Symbol
+Symbol.asyncIterator
+Symbol.hasInstance
+Symbol.isConcatSpreadable
+Symbol.iterator
+Symbol.match
+Symbol.matchAll=skip
+Symbol.prototype.description
+Symbol.replace
+Symbol.search
+Symbol.species
+Symbol.split
+Symbol.toPrimitive
+Symbol.toStringTag
+Symbol.unscopables
+tail-call-optimization=skip
+template
+TypedArray
+u180e
+Uint16Array
+Uint8Array
+Uint8ClampedArray
+WeakMap
+WeakSet
+
+[exclude]
+# list excluded tests and directories here
+
+# intl not supported
+test262/test/intl402/
+
+# these builtins are not supported:
+test262/test/built-ins/BigInt/
+
+# mislabelled feature Symbol.match -> Symbol.matchAll
+test262/test/built-ins/Symbol/matchAll/prop-desc.js
+
+# incompatible with the "caller" feature
+test262/test/built-ins/Function/prototype/restricted-property-caller.js
+test262/test/built-ins/ThrowTypeError/unique-per-realm-function-proto.js
+
+# no debugger keyword support
+test262/test/language/statements/debugger/statement.js
+
+# bogus html close comment test with syntax error
+test262/test/annexB/built-ins/Function/createdynfn-html-close-comment-params.js
+
+# bogus test #14 compares 2 consecutive calls to Date(), may be different if unlucky
+#test262/test/built-ins/Date/S15.9.2.1_A2.js
+
+# slow tests
+#test262/test/built-ins/RegExp/CharacterClassEscapes/
+#test262/test/built-ins/RegExp/property-escapes/
+
+[tests]
+# list test files or use config.testdir
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262_errors.txt b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262_errors.txt
new file mode 100755
index 00000000..e69de29b
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262bn.conf b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262bn.conf
new file mode 100755
index 00000000..46019be5
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262bn.conf
@@ -0,0 +1,175 @@
+[config]
+# general settings for test262 ES6 bignum version
+
+# framework style: old, new
+style=new
+
+# handle tests tagged as [noStrict]: yes, no, skip
+nostrict=yes
+
+# handle tests tagged as [strictOnly]: yes, no, skip
+strict=yes
+
+# test mode: default, default-nostrict, default-strict, strict, nostrict, both, all
+mode=default
+
+# handle tests flagged as [async]: yes, no, skip
+# for these, load 'harness/doneprintHandle.js' prior to test
+# and expect `print('Test262:AsyncTestComplete')` to be called for 
+# successful termination
+async=yes
+
+# handle tests flagged as [module]: yes, no, skip
+module=yes
+
+# output error messages: yes, no
+verbose=yes
+
+# load harness files from this directory
+harnessdir=test262/harness
+
+# names of harness include files to skip
+# bignum version does not support Atomics
+harnessexclude=testAtomics.js
+
+# name of the error file for known errors
+errorfile=test262bn_errors.txt
+
+# exclude tests enumerated in this file (see also [exclude] section)
+#excludefile=test262bn_exclude.txt
+
+# report test results to this file
+reportfile=test262bn_report.txt
+
+# enumerate tests from this directory
+testdir=test262/test
+
+[features]
+# Standard language features and proposed extensions
+# list the features that are included
+# skipped features are tagged as such to avoid warnings
+
+Array.prototype.flat
+Array.prototype.flatMap
+Array.prototype.flatten
+Array.prototype.values
+ArrayBuffer
+arrow-function
+async-functions
+async-iteration
+Atomics=skip
+BigInt
+caller
+class
+class-fields-private=skip
+class-fields-public=skip
+computed-property-names
+const
+cross-realm=skip
+DataView
+DataView.prototype.getFloat32
+DataView.prototype.getFloat64
+DataView.prototype.getInt16
+DataView.prototype.getInt32
+DataView.prototype.getInt8
+DataView.prototype.getUint16
+DataView.prototype.getUint32
+DataView.prototype.setUint8
+default-arg
+default-parameters
+destructuring-assignment
+destructuring-binding
+export-star-as-namespace-from-module=skip
+Float32Array
+Float64Array
+for-of
+generators
+global
+Int8Array
+IsHTMLDDA=skip
+json-superset
+let
+Map
+new.target
+numeric-separator-literal
+object-rest
+object-spread
+Object.is
+optional-catch-binding
+Promise.prototype.finally
+Proxy
+Reflect
+Reflect.construct
+Reflect.set
+Reflect.setPrototypeOf
+regexp-dotall
+regexp-lookbehind
+regexp-named-groups
+regexp-unicode-property-escapes
+Set
+SharedArrayBuffer=skip
+string-trimming
+String.fromCodePoint
+String.prototype.endsWith
+String.prototype.includes
+String.prototype.matchAll=skip
+String.prototype.trimEnd
+String.prototype.trimStart
+super
+Symbol
+Symbol.asyncIterator
+Symbol.hasInstance
+Symbol.isConcatSpreadable
+Symbol.iterator
+Symbol.match
+Symbol.matchAll=skip
+Symbol.prototype.description
+Symbol.replace
+Symbol.search
+Symbol.species
+Symbol.split
+Symbol.toPrimitive
+Symbol.toStringTag
+Symbol.unscopables
+tail-call-optimization=skip
+template
+TypedArray
+u180e
+Uint16Array
+Uint8Array
+Uint8ClampedArray
+WeakMap
+WeakSet
+
+[exclude]
+# list excluded tests and directories here
+
+# intl not supported
+test262/test/intl402/
+
+# these builtins are not supported:
+test262/test/built-ins/Atomics/
+test262/test/built-ins/SharedArrayBuffer/
+
+# mislabelled feature Symbol.match -> Symbol.matchAll
+test262/test/built-ins/Symbol/matchAll/prop-desc.js
+
+# incompatible with the "caller" feature
+test262/test/built-ins/Function/prototype/restricted-property-caller.js
+test262/test/built-ins/ThrowTypeError/unique-per-realm-function-proto.js
+
+# no debugger keyword support
+test262/test/language/statements/debugger/statement.js
+
+# bogus html close comment test with syntax error
+test262/test/annexB/built-ins/Function/createdynfn-html-close-comment-params.js
+
+# bogus test #14 compares 2 consecutive calls to Date(), may be different if unlucky
+#test262/test/built-ins/Date/S15.9.2.1_A2.js
+
+# slow tests
+#test262/test/built-ins/RegExp/CharacterClassEscapes/
+#test262/test/built-ins/RegExp/property-escapes/
+
+[tests]
+# list test files or use config.testdir
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262bn_errors.txt b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262bn_errors.txt
new file mode 100755
index 00000000..e69de29b
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262o.conf b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262o.conf
new file mode 100755
index 00000000..952f3207
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262o.conf
@@ -0,0 +1,404 @@
+[config]
+# general settings for test262 ES5 version
+
+# framework style: old, new
+style=old
+
+# handle tests tagged as @noStrict: yes, no, skip
+nostrict=yes
+
+# handle tests tagged as @strictOnly: yes, no, skip
+strict=yes
+
+# test mode: default, default-nostrict, default-strict, strict, nostrict, both, all
+mode=default
+
+# output error messages: yes, no
+verbose=yes
+
+# load harness files this directory
+harnessdir=test262o/test/harness
+
+# name of the error file for known errors
+errorfile=test262o_errors.txt
+
+# exclude tests enumerated in this file
+#excludefile=test262o_excluded.txt
+
+# report test results to this file
+reportfile=test262o_report.txt
+
+# enumerate tests from this directory
+testdir=test262o/test/suite
+
+[exclude]
+# list excluded tests and directories here
+
+# intl not supported
+test262o/test/suite/intl402/
+
+# ES6 != ES5: block scoped function definitions allowed in strict mode
+test262o/test/suite/bestPractice/Sbp_A1_T1.js
+test262o/test/suite/bestPractice/Sbp_A2_T1.js
+test262o/test/suite/bestPractice/Sbp_A2_T2.js
+test262o/test/suite/bestPractice/Sbp_A3_T1.js
+test262o/test/suite/bestPractice/Sbp_A3_T2.js
+test262o/test/suite/bestPractice/Sbp_A4_T1.js
+test262o/test/suite/bestPractice/Sbp_A4_T2.js
+test262o/test/suite/bestPractice/Sbp_A5_T2.js
+
+# ES6 != ES5: `y={x};` is shorthand for `y={x:x}`
+test262o/test/suite/ch12/12.1/S12.1_A4_T2.js
+test262o/test/suite/ch12/12.6/12.6.4/S12.6.4_A15.js
+
+# ES6 != ES5: function length property is configurable
+test262o/test/suite/ch11/11.4/11.4.1/11.4.1-5-a-28-s.js
+test262o/test/suite/ch13/13.2/13.2-15-1.js
+test262o/test/suite/ch15/15.1/15.1.2/15.1.2.1/S15.1.2.1_A4.2.js
+test262o/test/suite/ch15/15.1/15.1.2/15.1.2.2/S15.1.2.2_A9.2.js
+test262o/test/suite/ch15/15.1/15.1.2/15.1.2.3/S15.1.2.3_A7.2.js
+test262o/test/suite/ch15/15.1/15.1.2/15.1.2.4/S15.1.2.4_A2.2.js
+test262o/test/suite/ch15/15.1/15.1.2/15.1.2.5/S15.1.2.5_A2.2.js
+test262o/test/suite/ch15/15.1/15.1.3/15.1.3.1/S15.1.3.1_A5.2.js
+test262o/test/suite/ch15/15.1/15.1.3/15.1.3.2/S15.1.3.2_A5.2.js
+test262o/test/suite/ch15/15.1/15.1.3/15.1.3.3/S15.1.3.3_A5.2.js
+test262o/test/suite/ch15/15.1/15.1.3/15.1.3.4/S15.1.3.4_A5.2.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.3/15.2.3.3-4-186.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.3/15.2.3.3-4-187.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.3/15.2.3.3-4-191.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.3/15.2.3.3-4-194.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.3/15.2.3.3-4-201.js
+test262o/test/suite/ch15/15.2/15.2.4/15.2.4.2/S15.2.4.2_A9.js
+test262o/test/suite/ch15/15.2/15.2.4/15.2.4.3/S15.2.4.3_A9.js
+test262o/test/suite/ch15/15.2/15.2.4/15.2.4.4/S15.2.4.4_A9.js
+test262o/test/suite/ch15/15.2/15.2.4/15.2.4.5/S15.2.4.5_A9.js
+test262o/test/suite/ch15/15.2/15.2.4/15.2.4.6/S15.2.4.6_A9.js
+test262o/test/suite/ch15/15.2/15.2.4/15.2.4.7/S15.2.4.7_A9.js
+test262o/test/suite/ch15/15.3/15.3.3/15.3.3.2/15.3.3.2-1.js
+test262o/test/suite/ch15/15.3/15.3.4/15.3.4.2/S15.3.4.2_A9.js
+test262o/test/suite/ch15/15.3/15.3.4/15.3.4.3/S15.3.4.3_A9.js
+test262o/test/suite/ch15/15.3/15.3.4/15.3.4.4/S15.3.4.4_A9.js
+test262o/test/suite/ch15/15.3/15.3.4/15.3.4.5/15.3.4.5-15-2.js
+test262o/test/suite/ch15/15.3/15.3.5/S15.3.5.1_A2_T1.js
+test262o/test/suite/ch15/15.3/15.3.5/S15.3.5.1_A2_T2.js
+test262o/test/suite/ch15/15.3/15.3.5/S15.3.5.1_A2_T3.js
+test262o/test/suite/ch15/15.4/15.4.3/S15.4.3_A2.2.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.2/S15.4.4.2_A4.2.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.3/S15.4.4.3_A4.2.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.4/S15.4.4.4_A4.2.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.5/S15.4.4.5_A6.2.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.6/S15.4.4.6_A5.2.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.7/S15.4.4.7_A6.2.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.8/S15.4.4.8_A5.2.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.9/S15.4.4.9_A5.2.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.10/S15.4.4.10_A5.2.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.11/S15.4.4.11_A7.2.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.12/S15.4.4.12_A5.2.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.13/S15.4.4.13_A5.2.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.4/S15.5.4.4_A9.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.5/S15.5.4.5_A9.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.6/S15.5.4.6_A9.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.7/S15.5.4.7_A9.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.8/S15.5.4.8_A9.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.9/S15.5.4.9_A9.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.10/S15.5.4.10_A9.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.11/S15.5.4.11_A9.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.12/S15.5.4.12_A9.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.13/S15.5.4.13_A9.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.14/S15.5.4.14_A9.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.15/S15.5.4.15_A9.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.16/S15.5.4.16_A9.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.17/S15.5.4.17_A9.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.18/S15.5.4.18_A9.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.19/S15.5.4.19_A9.js
+test262o/test/suite/ch15/15.9/15.9.4/15.9.4.2/S15.9.4.2_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.4/15.9.4.3/S15.9.4.3_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.1/S15.9.5.1_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.2/S15.9.5.2_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.3/S15.9.5.3_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.4/S15.9.5.4_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.5/S15.9.5.5_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.6/S15.9.5.6_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.7/S15.9.5.7_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.8/S15.9.5.8_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.9/S15.9.5.9_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.10/S15.9.5.10_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.11/S15.9.5.11_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.12/S15.9.5.12_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.13/S15.9.5.13_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.14/S15.9.5.14_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.15/S15.9.5.15_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.16/S15.9.5.16_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.17/S15.9.5.17_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.18/S15.9.5.18_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.19/S15.9.5.19_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.20/S15.9.5.20_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.21/S15.9.5.21_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.22/S15.9.5.22_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.23/S15.9.5.23_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.24/S15.9.5.24_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.25/S15.9.5.25_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.26/S15.9.5.26_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.27/S15.9.5.27_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.28/S15.9.5.28_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.29/S15.9.5.29_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.30/S15.9.5.30_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.31/S15.9.5.31_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.32/S15.9.5.32_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.33/S15.9.5.33_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.34/S15.9.5.34_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.35/S15.9.5.35_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.36/S15.9.5.36_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.37/S15.9.5.37_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.38/S15.9.5.38_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.39/S15.9.5.39_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.40/S15.9.5.40_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.41/S15.9.5.41_A3_T2.js
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.42/S15.9.5.42_A3_T2.js
+test262o/test/suite/ch15/15.10/15.10.6/15.10.6.2/S15.10.6.2_A9.js
+test262o/test/suite/ch15/15.10/15.10.6/15.10.6.3/S15.10.6.3_A9.js
+test262o/test/suite/ch15/15.10/15.10.6/15.10.6.4/S15.10.6.4_A9.js
+
+# ES6 != ES5: object literals may have duplicates
+test262o/test/suite/ch11/11.1/11.1.5/11.1.5-4-4-a-1-s.js
+test262o/test/suite/ch11/11.1/11.1.5/11.1.5_4-4-b-1.js
+test262o/test/suite/ch11/11.1/11.1.5/11.1.5_4-4-b-2.js
+test262o/test/suite/ch11/11.1/11.1.5/11.1.5_4-4-c-1.js
+test262o/test/suite/ch11/11.1/11.1.5/11.1.5_4-4-c-2.js
+test262o/test/suite/ch11/11.1/11.1.5/11.1.5_4-4-d-1.js
+test262o/test/suite/ch11/11.1/11.1.5/11.1.5_4-4-d-2.js
+test262o/test/suite/ch11/11.1/11.1.5/11.1.5_4-4-d-3.js
+test262o/test/suite/ch11/11.1/11.1.5/11.1.5_4-4-d-4.js
+
+# ES6 != ES5: Date.prototype is no longer an instance of Date
+test262o/test/suite/ch15/15.9/15.9.5/15.9.5.40/15.9.5.40_1.js
+
+# ES6 != ES5: Object.getPrototypeOf converts argument to object
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.2/15.2.3.2-1-3.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.2/15.2.3.2-1-4.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.2/15.2.3.2-1.js
+
+# ES6 != ES5: Object.getPrototypeOf(NativeError)
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.2/15.2.3.2-2-12.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.2/15.2.3.2-2-13.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.2/15.2.3.2-2-14.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.2/15.2.3.2-2-15.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.2/15.2.3.2-2-16.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.2/15.2.3.2-2-17.js
+
+# ES6 != ES5: Object.getOwnPropertyDescriptor converts argument to object
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.3/15.2.3.3-1-3.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.3/15.2.3.3-1-4.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.3/15.2.3.3-1.js
+
+# ES6 != ES5: Object.getOwnPropertyNames converts argument to object
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.4/15.2.3.4-1-4.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.4/15.2.3.4-1-5.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.4/15.2.3.4-1.js
+
+# ES6 != ES5: Object.seal accepts all types
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.8/15.2.3.8-1-1.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.8/15.2.3.8-1-2.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.8/15.2.3.8-1-3.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.8/15.2.3.8-1-4.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.8/15.2.3.8-1.js
+
+# ES6 != ES5: Object.freeze accepts all types
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.9/15.2.3.9-1-1.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.9/15.2.3.9-1-2.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.9/15.2.3.9-1-3.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.9/15.2.3.9-1-4.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.9/15.2.3.9-1.js
+
+# ES6 != ES5: Object.preventExtensions accepts all types
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.10/15.2.3.10-1-1.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.10/15.2.3.10-1-2.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.10/15.2.3.10-1-3.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.10/15.2.3.10-1-4.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.10/15.2.3.10-1.js
+
+# ES6 != ES5: Object.isSealed accepts all types
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.11/15.2.3.11-1.js
+
+# ES6 != ES5: Object.isFrozen accepts all types
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.12/15.2.3.12-1-1.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.12/15.2.3.12-1-2.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.12/15.2.3.12-1-3.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.12/15.2.3.12-1-4.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.12/15.2.3.12-1.js
+
+# ES6 != ES5: Object.isExtensible accepts all types
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.13/15.2.3.13-1-1.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.13/15.2.3.13-1-2.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.13/15.2.3.13-1-3.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.13/15.2.3.13-1-4.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.13/15.2.3.13-1.js
+
+# ES6 != ES5: Object.keys converts argument to object
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.14/15.2.3.14-1-1.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.14/15.2.3.14-1-2.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.14/15.2.3.14-1-3.js
+
+# ES6 != ES5: source and other properties of RegExp.prototype are not own properties
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.3/15.2.3.3-4-212.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.3/15.2.3.3-4-213.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.3/15.2.3.3-4-214.js
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.3/15.2.3.3-4-215.js
+
+# ES6 != ES5: String numeric object properties are enumerated first
+test262o/test/suite/ch15/15.2/15.2.3/15.2.3.4/15.2.3.4-4-44.js
+
+# ES6: new RegExp(regex, flags) is valid
+test262o/test/suite/ch15/15.10/15.10.3/S15.10.3.1_A2_T1.js
+test262o/test/suite/ch15/15.10/15.10.3/S15.10.3.1_A2_T2.js
+test262o/test/suite/ch15/15.10/15.10.4/15.10.4.1/15.10.4.1-1.js
+test262o/test/suite/ch15/15.10/15.10.4/S15.10.4.1_A2_T1.js
+test262o/test/suite/ch15/15.10/15.10.4/S15.10.4.1_A2_T2.js
+
+# ES6 != ES5: RegExp.prototype.test behavior
+test262o/test/suite/ch15/15.10/15.10.6/15.10.6.2/S15.10.6.2_A5_T3.js
+
+# ES6 != ES5: source, global, ignoreCase, multiline, lastIndex are not data properties
+# of RegExp objects and RegExp.prototype is not a RegExp object
+test262o/test/suite/ch15/15.10/15.10.6/15.10.6.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.1/15.10.7.1-1.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.1/15.10.7.1-2.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.1/S15.10.7.1_A8.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.1/S15.10.7.1_A9.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.1/S15.10.7.1_A10.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.2/15.10.7.2-1.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.2/15.10.7.2-2.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.2/S15.10.7.2_A8.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.2/S15.10.7.2_A9.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.2/S15.10.7.2_A10.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.3/15.10.7.3-1.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.3/15.10.7.3-2.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.3/S15.10.7.3_A8.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.3/S15.10.7.3_A9.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.3/S15.10.7.3_A10.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.4/15.10.7.4-1.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.4/15.10.7.4-2.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.4/S15.10.7.4_A8.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.4/S15.10.7.4_A9.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.4/S15.10.7.4_A10.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.5/15.10.7.5-1.js
+test262o/test/suite/ch15/15.10/15.10.7/15.10.7.5/15.10.7.5-2.js
+
+# ES6 != ES5: Error.prototype is a normal object
+test262o/test/suite/ch15/15.11/15.11.4/S15.11.4_A2.js
+
+# ES6 different ToLength() semantics
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.5/S15.4.4.5_A4_T3.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.6/S15.4.4.6_A2_T2.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.6/S15.4.4.6_A3_T1.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.6/S15.4.4.6_A3_T2.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.6/S15.4.4.6_A3_T3.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.7/S15.4.4.7_A2_T2.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.7/S15.4.4.7_A4_T1.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.7/S15.4.4.7_A4_T3.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.8/S15.4.4.8_A3_T3.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.9/S15.4.4.9_A3_T3.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.10/S15.4.4.10_A3_T1.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.10/S15.4.4.10_A3_T2.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.10/S15.4.4.10_A3_T3.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.11/S15.4.4.11_A4_T3.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.12/S15.4.4.12_A3_T1.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.12/S15.4.4.12_A3_T3.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.13/S15.4.4.13_A3_T2.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.14/15.4.4.14-3-7.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.14/15.4.4.14-3-8.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.14/15.4.4.14-3-12.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.14/15.4.4.14-3-14.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.14/15.4.4.14-3-25.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.14/15.4.4.14-3-28.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.14/15.4.4.14-3-29.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.15/15.4.4.15-3-7.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.15/15.4.4.15-3-12.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.15/15.4.4.15-3-25.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.15/15.4.4.15-3-28.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.16/15.4.4.16-3-7.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.16/15.4.4.16-3-8.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.16/15.4.4.16-3-12.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.16/15.4.4.16-3-14.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.16/15.4.4.16-3-25.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.16/15.4.4.16-3-29.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.17/15.4.4.17-3-7.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.17/15.4.4.17-3-8.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.17/15.4.4.17-3-12.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.17/15.4.4.17-3-14.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.17/15.4.4.17-3-25.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.17/15.4.4.17-3-28.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.17/15.4.4.17-3-29.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.18/15.4.4.18-3-7.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.18/15.4.4.18-3-12.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.18/15.4.4.18-3-25.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.19/15.4.4.19-3-7.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.19/15.4.4.19-3-8.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.19/15.4.4.19-3-12.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.19/15.4.4.19-3-14.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.19/15.4.4.19-3-25.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.19/15.4.4.19-3-28.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.19/15.4.4.19-3-29.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.20/15.4.4.20-3-7.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.20/15.4.4.20-3-12.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.20/15.4.4.20-3-25.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.21/15.4.4.21-3-7.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.21/15.4.4.21-3-12.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.21/15.4.4.21-3-25.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.22/15.4.4.22-3-7.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.22/15.4.4.22-3-12.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.22/15.4.4.22-3-25.js
+
+# ES6 different ToLength() semantics causes near infinite runtime
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.15/15.4.4.15-3-14.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.18/15.4.4.18-3-14.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.20/15.4.4.20-3-14.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.21/15.4.4.21-3-14.js
+test262o/test/suite/ch15/15.4/15.4.4/15.4.4.22/15.4.4.22-3-14.js
+
+# ES6 arguments/caller changes
+test262o/test/suite/ch10/10.6/10.6-13-b-1-s.js
+test262o/test/suite/ch10/10.6/10.6-13-b-2-s.js
+test262o/test/suite/ch10/10.6/10.6-13-b-3-s.js
+test262o/test/suite/ch10/10.6/10.6-14-1-s.js
+test262o/test/suite/ch10/10.6/10.6-14-b-1-s.js
+test262o/test/suite/ch10/10.6/10.6-14-b-4-s.js
+test262o/test/suite/ch13/13.2/13.2-29-s.js
+test262o/test/suite/ch13/13.2/13.2-30-s.js
+test262o/test/suite/ch13/13.2/13.2-31-s.js
+test262o/test/suite/ch13/13.2/13.2-32-s.js
+test262o/test/suite/ch13/13.2/13.2-33-s.js
+test262o/test/suite/ch13/13.2/13.2-34-s.js
+test262o/test/suite/ch13/13.2/13.2-35-s.js
+test262o/test/suite/ch13/13.2/13.2-36-s.js
+test262o/test/suite/ch13/13.2/S13.2.3_A1.js
+test262o/test/suite/ch15/15.3/15.3.4/15.3.4.5/15.3.4.5-20-1.js
+test262o/test/suite/ch15/15.3/15.3.4/15.3.4.5/15.3.4.5-20-4.js
+test262o/test/suite/ch15/15.3/15.3.4/15.3.4.5/15.3.4.5-20-5.js
+test262o/test/suite/ch15/15.3/15.3.4/15.3.4.5/15.3.4.5-21-1.js
+test262o/test/suite/ch15/15.3/15.3.4/15.3.4.5/15.3.4.5-21-4.js
+test262o/test/suite/ch15/15.3/15.3.4/15.3.4.5/15.3.4.5-21-5.js
+
+# u180e is no longer considered as a space
+test262o/test/suite/ch09/9.3/9.3.1/S9.3.1_A2.js
+test262o/test/suite/ch09/9.3/9.3.1/S9.3.1_A3_T1.js
+test262o/test/suite/ch09/9.3/9.3.1/S9.3.1_A3_T2.js
+test262o/test/suite/ch15/15.1/15.1.2/15.1.2.2/S15.1.2.2_A2_T10.js
+test262o/test/suite/ch15/15.1/15.1.2/15.1.2.3/S15.1.2.3_A2_T10.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.20/15.5.4.20-3-2.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.20/15.5.4.20-3-3.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.20/15.5.4.20-3-4.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.20/15.5.4.20-3-5.js
+test262o/test/suite/ch15/15.5/15.5.4/15.5.4.20/15.5.4.20-3-6.js
+test262o/test/suite/ch15/15.10/15.10.2/15.10.2.12/S15.10.2.12_A1_T1.js
+test262o/test/suite/ch15/15.10/15.10.2/15.10.2.12/S15.10.2.12_A2_T1.js
+
+# E6 eval return value is different
+test262o/test/suite/ch12/12.6/12.6.3/S12.6.3_A9.js
+test262o/test/suite/ch12/12.6/12.6.3/S12.6.3_A9.1.js
+
+# ECMA 2019 optional-catch-binding feature allows try{}catch{}
+test262o/test/suite/ch12/12.14/S12.14_A16_T4.js
+
+[tests]
+# list test files or use config.testdir
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262o_errors.txt b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/test262o_errors.txt
new file mode 100755
index 00000000..e69de29b
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/microbench.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/microbench.js
new file mode 100755
index 00000000..1b19de4f
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/microbench.js
@@ -0,0 +1,1004 @@
+/*
+ * Javascript Micro benchmark
+ *
+ * Copyright (c) 2017-2019 Fabrice Bellard
+ * Copyright (c) 2017-2019 Charlie Gordon
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+
+"use strict";
+
+function pad(str, n) {
+    str += "";
+    while (str.length < n)
+        str += " ";
+    return str;
+}
+
+function pad_left(str, n) {
+    str += "";
+    while (str.length < n)
+        str = " " + str;
+    return str;
+}
+
+function pad_center(str, n) {
+    str += "";
+    while (str.length < n) {
+        if ((n - str.length) & 1)
+            str = str + " ";
+        else
+            str = " " + str;
+    }
+    return str;
+}
+
+function toPrec(n, prec) {
+    var i, s;
+    for (i = 0; i < prec; i++)
+        n *= 10;
+    s = "" + Math.round(n);
+    for (i = s.length - prec; i <= 0; i++)
+        s = "0" + s;
+    if (prec > 0)
+        s = s.substring(0, i) + "." + s.substring(i);
+    return s;
+}
+                
+var ref_data;
+var log_data;
+
+var heads  = [ "TEST", "N", "TIME (ns)", "REF (ns)", "SCORE (%)" ];
+var widths = [    22,   10,          9,     9,       9 ];
+var precs  = [     0,   0,           2,     2,       2 ];
+var total  = [     0,   0,           0,     0,       0 ];
+var total_score = 0;
+var total_scale = 0;
+
+if (typeof console == "undefined") {
+    var console = { log: print };
+}
+
+function log_line() {
+    var i, n, s, a;
+    s = "";
+    for (i = 0, n = arguments.length; i < n; i++) {
+        if (i > 0)
+            s += " ";
+        a = arguments[i];
+        if (typeof a == "number") {
+            total[i] += a;
+            a = toPrec(a, precs[i]);
+            s += pad_left(a, widths[i]);
+        } else {
+            s += pad_left(a, widths[i]);
+        }
+    }
+    console.log(s);
+}
+
+var clocks_per_sec = 1000000;
+var max_iterations = 100;
+var clock_threshold = 2000;  /* favoring short measuring spans */
+var min_n_argument = 1;
+var __date_clock;
+
+if (typeof __date_clock != "function") {
+    console.log("using fallback millisecond clock");
+    clocks_per_sec = 1000;
+    max_iterations = 10;
+    clock_threshold = 100;
+}
+
+function log_one(text, n, ti) {
+    var ref;
+
+    if (ref_data)
+        ref = ref_data[text];
+    else
+        ref = null;
+
+    ti = Math.round(ti * 100) / 100;
+    log_data[text] = ti;
+    if (typeof ref === "number") {
+        log_line(text, n, ti, ref, ti * 100 / ref);
+        total_score += ti * 100 / ref;
+        total_scale += 100;
+    } else {
+        log_line(text, n, ti);
+        total_score += 100;
+        total_scale += 100;
+    }
+}
+
+function bench(f, text)
+{
+    var i, j, n, t, t1, ti, nb_its, ref, ti_n, ti_n1, min_ti;
+
+    nb_its = n = 1;
+    if (f.bench) {
+        ti_n = f(text);
+    } else {
+        var clock = __date_clock;
+        if (typeof clock != "function")
+            clock = Date.now;
+        ti_n = 1000000000;
+        min_ti = clock_threshold / 10;
+        for(i = 0; i < 30; i++) {
+            ti = 1000000000;
+            for (j = 0; j < max_iterations; j++) {
+                t = clock();
+                while ((t1 = clock()) == t)
+                    continue;
+                nb_its = f(n);
+                if (nb_its < 0)
+                    return; // test failure
+                t1 = clock() - t1;
+                if (ti > t1)
+                    ti = t1;
+            }
+            if (ti >= min_ti) {
+                ti_n1 = ti / nb_its;
+                if (ti_n > ti_n1)
+                    ti_n = ti_n1;
+            }
+            if (ti >= clock_threshold && n >= min_n_argument)
+                break;
+
+            n = n * [ 2, 2.5, 2 ][i % 3];
+        }
+        // to use only the best timing from the last loop, uncomment below
+        //ti_n = ti / nb_its;
+    }
+    /* nano seconds per iteration */
+    log_one(text, n, ti_n * 1e9 / clocks_per_sec);
+}
+
+var global_res; /* to be sure the code is not optimized */
+
+function empty_loop(n) {
+    var j;
+    for(j = 0; j < n; j++) {
+    }
+    return n;
+}
+
+function date_now(n) {
+    var j;
+    for(j = 0; j < n; j++) {
+        Date.now();
+    }
+    return n;
+}
+
+function prop_read(n)
+{
+    var obj, sum, j;
+    obj = {a: 1, b: 2, c:3, d:4 };
+    sum = 0;
+    for(j = 0; j < n; j++) {
+        sum += obj.a;
+        sum += obj.b;
+        sum += obj.c;
+        sum += obj.d;
+    }
+    global_res = sum;
+    return n * 4;
+}
+
+function prop_write(n)
+{
+    var obj, j;
+    obj = {a: 1, b: 2, c:3, d:4 };
+    for(j = 0; j < n; j++) {
+        obj.a = j;
+        obj.b = j;
+        obj.c = j;
+        obj.d = j;
+    }
+    return n * 4;
+}
+
+function prop_create(n)
+{
+    var obj, j;
+    for(j = 0; j < n; j++) {
+        obj = new Object();
+        obj.a = 1;
+        obj.b = 2;
+        obj.c = 3;
+        obj.d = 4;
+    }
+    return n * 4;
+}
+
+function array_read(n)
+{
+    var tab, len, sum, i, j;
+    tab = [];
+    len = 10;
+    for(i = 0; i < len; i++)
+        tab[i] = i;
+    sum = 0;
+    for(j = 0; j < n; j++) {
+        sum += tab[0];
+        sum += tab[1];
+        sum += tab[2];
+        sum += tab[3];
+        sum += tab[4];
+        sum += tab[5];
+        sum += tab[6];
+        sum += tab[7];
+        sum += tab[8];
+        sum += tab[9];
+    }
+    global_res = sum;
+    return len * n;
+}
+
+function array_write(n)
+{
+    var tab, len, i, j;
+    tab = [];
+    len = 10;
+    for(i = 0; i < len; i++)
+        tab[i] = i;
+    for(j = 0; j < n; j++) {
+        tab[0] = j;
+        tab[1] = j;
+        tab[2] = j;
+        tab[3] = j;
+        tab[4] = j;
+        tab[5] = j;
+        tab[6] = j;
+        tab[7] = j;
+        tab[8] = j;
+        tab[9] = j;
+    }
+    return len * n;
+}
+
+function array_prop_create(n)
+{
+    var tab, i, j, len;
+    len = 1000;
+    for(j = 0; j < n; j++) {
+        tab = [];
+        for(i = 0; i < len; i++)
+            tab[i] = i;
+    }
+    return len * n;
+}
+
+function array_length_decr(n)
+{
+    var tab, i, j, len;
+    len = 1000;
+    tab = [];
+    for(i = 0; i < len; i++)
+        tab[i] = i;
+    for(j = 0; j < n; j++) {
+        for(i = len - 1; i >= 0; i--)
+            tab.length = i;
+    }
+    return len * n;
+}
+
+function array_hole_length_decr(n)
+{
+    var tab, i, j, len;
+    len = 1000;
+    tab = [];
+    for(i = 0; i < len; i++) {
+        if (i != 3)
+            tab[i] = i;
+    }
+    for(j = 0; j < n; j++) {
+        for(i = len - 1; i >= 0; i--)
+            tab.length = i;
+    }
+    return len * n;
+}
+
+function array_push(n)
+{
+    var tab, i, j, len;
+    len = 500;
+    for(j = 0; j < n; j++) {
+        tab = [];
+        for(i = 0; i < len; i++)
+            tab.push(i);
+    }
+    return len * n;
+}
+
+function array_pop(n)
+{
+    var tab, i, j, len, sum;
+    len = 500;
+    for(j = 0; j < n; j++) {
+        tab = [];
+        for(i = 0; i < len; i++)
+            tab[i] = i;
+        sum = 0;
+        for(i = 0; i < len; i++)
+            sum += tab.pop();
+        global_res = sum;
+    }
+    return len * n;
+}
+
+function typed_array_read(n)
+{
+    var tab, len, sum, i, j;
+    len = 10;
+    tab = new Int32Array(len);
+    for(i = 0; i < len; i++)
+        tab[i] = i;
+    sum = 0;
+    for(j = 0; j < n; j++) {
+        sum += tab[0];
+        sum += tab[1];
+        sum += tab[2];
+        sum += tab[3];
+        sum += tab[4];
+        sum += tab[5];
+        sum += tab[6];
+        sum += tab[7];
+        sum += tab[8];
+        sum += tab[9];
+    }
+    global_res = sum;
+    return len * n;
+}
+
+function typed_array_write(n)
+{
+    var tab, len, i, j;
+    len = 10;
+    tab = new Int32Array(len);
+    for(i = 0; i < len; i++)
+        tab[i] = i;
+    for(j = 0; j < n; j++) {
+        tab[0] = j;
+        tab[1] = j;
+        tab[2] = j;
+        tab[3] = j;
+        tab[4] = j;
+        tab[5] = j;
+        tab[6] = j;
+        tab[7] = j;
+        tab[8] = j;
+        tab[9] = j;
+    }
+    return len * n;
+}
+
+var global_var0;
+
+function global_read(n)
+{
+    var sum, j;
+    global_var0 = 0;
+    sum = 0;
+    for(j = 0; j < n; j++) {
+        sum += global_var0;
+        sum += global_var0;
+        sum += global_var0;
+        sum += global_var0;
+    }
+    global_res = sum;
+    return n * 4;
+}
+
+var global_write =
+    (1, eval)(`(function global_write(n)
+           {
+               var j;
+               for(j = 0; j < n; j++) {
+                   global_var0 = j;
+                   global_var0 = j;
+                   global_var0 = j;
+                   global_var0 = j;
+               }
+               return n * 4;
+           })`);
+
+function global_write_strict(n)
+{
+    var j;
+    for(j = 0; j < n; j++) {
+        global_var0 = j;
+        global_var0 = j;
+        global_var0 = j;
+        global_var0 = j;
+    }
+    return n * 4;
+}
+
+function local_destruct(n)
+{
+    var j, v1, v2, v3, v4;
+    var array = [ 1, 2, 3, 4, 5];
+    var o = { a:1, b:2, c:3, d:4 };
+    var a, b, c, d;
+    for(j = 0; j < n; j++) {
+        [ v1, v2,, v3, ...v4] = array;
+        ({ a, b, c, d } = o);
+        ({ a: a, b: b, c: c, d: d } = o);
+    }
+    return n * 12;
+}
+
+var global_v1, global_v2, global_v3, global_v4;
+var global_a, global_b, global_c, global_d;
+
+var global_destruct =
+    (1, eval)(`(function global_destruct(n)
+           {
+               var j, v1, v2, v3, v4;
+               var array = [ 1, 2, 3, 4, 5 ];
+               var o = { a:1, b:2, c:3, d:4 };
+               var a, b, c, d;
+               for(j = 0; j < n; j++) {
+                   [ global_v1, global_v2,, global_v3, ...global_v4] = array;
+                   ({ a: global_a, b: global_b, c: global_c, d: global_d } = o);
+               }
+               return n * 8;
+          })`);
+
+function global_destruct_strict(n)
+{
+    var j, v1, v2, v3, v4;
+    var array = [ 1, 2, 3, 4, 5 ];
+    var o = { a:1, b:2, c:3, d:4 };
+    var a, b, c, d;
+    for(j = 0; j < n; j++) {
+        [ global_v1, global_v2,, global_v3, ...global_v4] = array;
+        ({ a: global_a, b: global_b, c: global_c, d: global_d } = o);
+    }
+    return n * 8;
+}
+
+function func_call(n)
+{
+    function f(a)
+    {
+        return 1;
+    }
+
+    var j, sum;
+    sum = 0;
+    for(j = 0; j < n; j++) {
+        sum += f(j);
+        sum += f(j);
+        sum += f(j);
+        sum += f(j);
+    }
+    global_res = sum;
+    return n * 4;
+}
+
+function closure_var(n)
+{
+    function f(a)
+    {
+        sum++;
+    }
+
+    var j, sum;
+    sum = 0;
+    for(j = 0; j < n; j++) {
+        f(j);
+        f(j);
+        f(j);
+        f(j);
+    }
+    global_res = sum;
+    return n * 4;
+}
+
+function int_arith(n)
+{
+    var i, j, sum;
+    global_res = 0;
+    for(j = 0; j < n; j++) {
+        sum = 0;
+        for(i = 0; i < 1000; i++) {
+            sum += i * i;
+        }
+        global_res += sum;
+    }
+    return n * 1000;
+}
+
+function float_arith(n)
+{
+    var i, j, sum, a, incr, a0;
+    global_res = 0;
+    a0 = 0.1;
+    incr = 1.1;
+    for(j = 0; j < n; j++) {
+        sum = 0;
+        a = a0;
+        for(i = 0; i < 1000; i++) {
+            sum += a * a;
+            a += incr;
+        }
+        global_res += sum;
+    }
+    return n * 1000;
+}
+
+function bigfloat_arith(n)
+{
+    var i, j, sum, a, incr, a0;
+    global_res = 0;
+    a0 = BigFloat("0.1");
+    incr = BigFloat("1.1");
+    for(j = 0; j < n; j++) {
+        sum = 0;
+        a = a0;
+        for(i = 0; i < 1000; i++) {
+            sum += a * a;
+            a += incr;
+        }
+        global_res += sum;
+    }
+    return n * 1000;
+}
+
+function float256_arith(n)
+{
+    return BigFloatEnv.setPrec(bigfloat_arith.bind(null, n), 237, 19);
+}
+
+function bigint_arith(n, bits)
+{
+    var i, j, sum, a, incr, a0, sum0;
+    sum0 = global_res = BigInt(0);
+    a0 = BigInt(1) << BigInt(Math.floor((bits - 10) * 0.5));
+    incr = BigInt(1);
+    for(j = 0; j < n; j++) {
+        sum = sum0;
+        a = a0;
+        for(i = 0; i < 1000; i++) {
+            sum += a * a;
+            a += incr;
+        }
+        global_res += sum;
+    }
+    return n * 1000;
+}
+
+function bigint64_arith(n)
+{
+    return bigint_arith(n, 64);
+}
+
+function bigint256_arith(n)
+{
+    return bigint_arith(n, 256);
+}
+
+function set_collection_add(n)
+{
+    var s, i, j, len = 100;
+    s = new Set();
+    for(j = 0; j < n; j++) {
+        for(i = 0; i < len; i++) {
+            s.add(String(i), i);
+        }
+        for(i = 0; i < len; i++) {
+            if (!s.has(String(i)))
+                throw Error("bug in Set");
+        }
+    }
+    return n * len;
+}
+
+function array_for(n)
+{
+    var r, i, j, sum;
+    r = [];
+    for(i = 0; i < 100; i++)
+        r[i] = i;
+    for(j = 0; j < n; j++) {
+        sum = 0;
+        for(i = 0; i < 100; i++) {
+            sum += r[i];
+        }
+        global_res = sum;
+    }
+    return n * 100;
+}
+
+function array_for_in(n)
+{
+    var r, i, j, sum;
+    r = [];
+    for(i = 0; i < 100; i++)
+        r[i] = i;
+    for(j = 0; j < n; j++) {
+        sum = 0;
+        for(i in r) {
+            sum += r[i];
+        }
+        global_res = sum;
+    }
+    return n * 100;
+}
+
+function array_for_of(n)
+{
+    var r, i, j, sum;
+    r = [];
+    for(i = 0; i < 100; i++)
+        r[i] = i;
+    for(j = 0; j < n; j++) {
+        sum = 0;
+        for(i of r) {
+            sum += i;
+        }
+        global_res = sum;
+    }
+    return n * 100;
+}
+
+function math_min(n)
+{
+    var i, j, r;
+    r = 0;
+    for(j = 0; j < n; j++) {
+        for(i = 0; i < 1000; i++)
+            r = Math.min(i, 500);
+        global_res = r;
+    }
+    return n * 1000;
+}
+
+/* incremental string contruction as local var */
+function string_build1(n)
+{
+    var i, j, r;
+    r = "";
+    for(j = 0; j < n; j++) {
+        for(i = 0; i < 100; i++)
+            r += "x";
+        global_res = r;
+    }
+    return n * 100;
+}
+
+/* incremental string contruction as arg */
+function string_build2(n, r)
+{
+    var i, j;
+    r = "";
+    for(j = 0; j < n; j++) {
+        for(i = 0; i < 100; i++)
+            r += "x";
+        global_res = r;
+    }
+    return n * 100;
+}
+
+/* incremental string contruction by prepending */
+function string_build3(n, r)
+{
+    var i, j;
+    r = "";
+    for(j = 0; j < n; j++) {
+        for(i = 0; i < 100; i++)
+            r = "x" + r;
+        global_res = r;
+    }
+    return n * 100;
+}
+
+/* incremental string contruction with multiple reference */
+function string_build4(n)
+{
+    var i, j, r, s;
+    r = "";
+    for(j = 0; j < n; j++) {
+        for(i = 0; i < 100; i++) {
+            s = r;
+            r += "x";
+        }
+        global_res = r;
+    }
+    return n * 100;
+}
+
+/* sort bench */
+
+function sort_bench(text) {
+    function random(arr, n, def) {
+        for (var i = 0; i < n; i++)
+            arr[i] = def[(Math.random() * n) >> 0];
+    }
+    function random8(arr, n, def) {
+        for (var i = 0; i < n; i++)
+            arr[i] = def[(Math.random() * 256) >> 0];
+    }
+    function random1(arr, n, def) {
+        for (var i = 0; i < n; i++)
+            arr[i] = def[(Math.random() * 2) >> 0];
+    }
+    function hill(arr, n, def) {
+        var mid = n >> 1;
+        for (var i = 0; i < mid; i++)
+            arr[i] = def[i];
+        for (var i = mid; i < n; i++)
+            arr[i] = def[n - i];
+    }
+    function comb(arr, n, def) {
+        for (var i = 0; i < n; i++)
+            arr[i] = def[(i & 1) * i];
+    }
+    function crisscross(arr, n, def) {
+        for (var i = 0; i < n; i++)
+            arr[i] = def[(i & 1) ? n - i : i];
+    }
+    function zero(arr, n, def) {
+        for (var i = 0; i < n; i++)
+            arr[i] = def[0];
+    }
+    function increasing(arr, n, def) {
+        for (var i = 0; i < n; i++)
+            arr[i] = def[i];
+    }
+    function decreasing(arr, n, def) {
+        for (var i = 0; i < n; i++)
+            arr[i] = def[n - 1 - i];
+    }
+    function alternate(arr, n, def) {
+        for (var i = 0; i < n; i++)
+            arr[i] = def[i ^ 1];
+    }
+    function jigsaw(arr, n, def) {
+        for (var i = 0; i < n; i++)
+            arr[i] = def[i % (n >> 4)];
+    }
+    function incbutone(arr, n, def) {
+        for (var i = 0; i < n; i++)
+            arr[i] = def[i];
+        if (n > 0)
+            arr[n >> 2] = def[n];
+    }
+    function incbutfirst(arr, n, def) {
+        if (n > 0)
+            arr[0] = def[n];
+        for (var i = 1; i < n; i++)
+            arr[i] = def[i];
+    }
+    function incbutlast(arr, n, def) {
+        for (var i = 0; i < n - 1; i++)
+            arr[i] = def[i + 1];
+        if (n > 0)
+            arr[n - 1] = def[0];
+    }
+
+    var sort_cases = [ random, random8, random1, jigsaw, hill, comb,
+                      crisscross, zero, increasing, decreasing, alternate,
+                      incbutone, incbutlast, incbutfirst ];
+
+    var n = sort_bench.array_size || 10000;
+    var array_type = sort_bench.array_type || Array;
+    var def, arr;
+    var i, j, x, y;
+    var total = 0;
+
+    var save_total_score = total_score;
+    var save_total_scale = total_scale;
+
+    // initialize default sorted array (n + 1 elements)
+    def = new array_type(n + 1);
+    if (array_type == Array) {
+        for (i = 0; i <= n; i++) {
+            def[i] = i + "";
+        }
+    } else {
+        for (i = 0; i <= n; i++) {
+            def[i] = i;
+        }
+    }
+    def.sort();
+    for (var f of sort_cases) {
+        var ti = 0, tx = 0;
+        for (j = 0; j < 100; j++) {
+            arr = new array_type(n);
+            f(arr, n, def);
+            var t1 = __date_clock();
+            arr.sort();
+            t1 = __date_clock() - t1;
+            tx += t1;
+            if (!ti || ti > t1)
+                ti = t1;
+            if (tx >= clocks_per_sec)
+                break;
+        }
+        total += ti;
+
+        i = 0;
+        x = arr[0];
+        if (x !== void 0) {
+            for (i = 1; i < n; i++) {
+                y = arr[i];
+                if (y === void 0)
+                    break;
+                if (x > y)
+                    break;
+                x = y;
+            }
+        }
+        while (i < n && arr[i] === void 0)
+            i++;
+        if (i < n) {
+            console.log("sort_bench: out of order error for " + f.name +
+                        " at offset " + (i - 1) +
+                        ": " + arr[i - 1] + " > " + arr[i]);
+        }
+        if (sort_bench.verbose)
+            log_one("sort_" + f.name, n, ti, n * 100);
+    }
+    total_score = save_total_score;
+    total_scale = save_total_scale;
+    return total / n / 1000;
+}
+sort_bench.bench = true;
+sort_bench.verbose = false;
+
+function load_result(filename)
+{
+    var f, str, res;
+    if (typeof std === "undefined")
+        return null;
+    try {
+        f = std.open(filename, "r");
+    } catch(e) {
+        return null;
+    }
+    str = f.readAsString();
+    res = JSON.parse(str);
+    f.close();
+    return res;
+}
+
+function save_result(filename, obj)
+{
+    var f;
+    if (typeof std === "undefined")
+        return;
+    f = std.open(filename, "w");
+    f.puts(JSON.stringify(obj, null, 2));
+    f.puts("\n");
+    f.close();
+}
+
+function main(argc, argv, g)
+{
+    var test_list = [
+        empty_loop,
+        date_now,
+        prop_read,
+        prop_write,
+        prop_create,
+        array_read,
+        array_write,
+        array_prop_create,
+        array_length_decr,
+        array_hole_length_decr,
+        array_push,
+        array_pop,
+        typed_array_read,
+        typed_array_write,
+        global_read,
+        global_write,
+        global_write_strict,
+        local_destruct,
+        global_destruct,
+        global_destruct_strict,
+        func_call,
+        closure_var,
+        int_arith,
+        float_arith,
+        set_collection_add,
+        array_for,
+        array_for_in,
+        array_for_of,
+        math_min,
+        string_build1,
+        string_build2,
+        //string_build3,
+        //string_build4,
+        sort_bench,
+    ];
+    var tests = [];
+    var i, j, n, f, name;
+    
+    if (typeof BigInt == "function") {
+        /* BigInt test */
+        test_list.push(bigint64_arith);
+        test_list.push(bigint256_arith);
+    }
+    if (typeof BigFloat == "function") {
+        /* BigFloat test */
+        test_list.push(float256_arith);
+    }
+    
+    for (i = 1; i < argc;) {
+        name = argv[i++];
+        if (name == "-a") {
+            sort_bench.verbose = true;
+            continue;
+        }
+        if (name == "-t") {
+            name = argv[i++];
+            sort_bench.array_type = g[name];
+            if (typeof sort_bench.array_type != "function") {
+                console.log("unknown array type: " + name);
+                return 1;
+            }
+            continue;
+        }
+        if (name == "-n") {
+            sort_bench.array_size = +argv[i++];
+            continue;
+        }
+        for (j = 0; j < test_list.length; j++) {
+            f = test_list[j];
+            if (name === f.name) {
+                tests.push(f);
+                break;
+            }
+        }
+        if (j == test_list.length) {
+            console.log("unknown benchmark: " + name);
+            return 1;
+        }
+    }
+    if (tests.length == 0)
+        tests = test_list;
+
+    ref_data = load_result("microbench.txt");
+    log_data = {};
+    log_line.apply(null, heads);
+    n = 0;
+
+    for(i = 0; i < tests.length; i++) {
+        f = tests[i];
+        bench(f, f.name, ref_data, log_data);
+        if (ref_data && ref_data[f.name])
+            n++;
+    }
+    if (ref_data)
+        log_line("total", "", total[2], total[3], total_score * 100 / total_scale);
+    else
+        log_line("total", "", total[2]);
+        
+    if (tests == test_list)
+        save_result("microbench-new.txt", log_data);
+}
+
+if (!scriptArgs)
+    scriptArgs = [];
+main(scriptArgs.length, scriptArgs, this);
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test262.patch b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test262.patch
new file mode 100755
index 00000000..1d746619
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test262.patch
@@ -0,0 +1,683 @@
+diff --git a/harness/doneprintHandle.js b/harness/doneprintHandle.js
+index 2b4ab88..6c95f9f 100644
+--- a/harness/doneprintHandle.js
++++ b/harness/doneprintHandle.js
+@@ -11,7 +11,7 @@ function __consolePrintHandle__(msg){
+ 
+ function $DONE(){
+   if(!arguments[0])
+-    __consolePrintHandle__('Test262:AsyncTestComplete');
++    $async_done = true;
+   else
+-    __consolePrintHandle__('Test262:AsyncTestFailure:' + arguments[0]);
++    __consolePrintHandle__('Error:' + arguments[0]);
+ }
+diff --git a/harness/regExpUtils.js b/harness/regExpUtils.js
+index 362a6d16..d3dde03 100644
+--- a/harness/regExpUtils.js
++++ b/harness/regExpUtils.js
+@@ -5,6 +5,7 @@ description: |
+     Collection of functions used to assert the correctness of RegExp objects.
+ ---*/
+ 
++/*
+ function buildString({ loneCodePoints, ranges }) {
+   const CHUNK_SIZE = 10000;
+   let result = String.fromCodePoint(...loneCodePoints);
+@@ -21,6 +22,32 @@ function buildString({ loneCodePoints, ranges }) {
+   }
+   return result;
+ }
++*/
++
++var codePointRange;
++
++if ($262 && typeof $262.codePointRange === "function") {
++    /* use C function to build the codePointRange (much faster with
++       slow JS engines) */
++    codePointRange = $262.codePointRange;
++} else {
++    codePointRange = function codePointRange(start, end) {
++        const codePoints = [];
++        let length = 0;
++        for (codePoint = start; codePoint < end; codePoint++) {
++            codePoints[length++] = codePoint;
++        }
++        return String.fromCodePoint.apply(null, codePoints);
++    }
++}
++
++function buildString({ loneCodePoints, ranges }) {
++    let result = String.fromCodePoint.apply(null, loneCodePoints);
++    for (const [start, end] of ranges) {
++        result += codePointRange(start, end + 1);
++    }
++    return result;
++}
+ 
+ function testPropertyEscapes(regex, string, expression) {
+   if (!regex.test(string)) {
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-digit-class-escape-flags-u.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-digit-class-escape-flags-u.js
+index 652ef43..8d1a7ed 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-digit-class-escape-flags-u.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-digit-class-escape-flags-u.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0x10ffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0x10FFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0x10ffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\d/ug;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-digit-class-escape-plus-quantifier-flags-u.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-digit-class-escape-plus-quantifier-flags-u.js
+index 8683600..36d9f1c 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-digit-class-escape-plus-quantifier-flags-u.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-digit-class-escape-plus-quantifier-flags-u.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0x10ffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0x10FFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0x10ffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\d+/ug;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-digit-class-escape-plus-quantifier.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-digit-class-escape-plus-quantifier.js
+index 20d6b38..e9c91f8 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-digit-class-escape-plus-quantifier.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-digit-class-escape-plus-quantifier.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0xffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0xFFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0xffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\d+/g;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-digit-class-escape.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-digit-class-escape.js
+index d3aef45..b2c949b 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-digit-class-escape.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-digit-class-escape.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0xffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0xFFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0xffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\d/g;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-digit-class-escape-flags-u.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-digit-class-escape-flags-u.js
+index ead3d68..beaf9cf 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-digit-class-escape-flags-u.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-digit-class-escape-flags-u.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0x10ffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0x10FFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0x10ffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\D/ug;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-digit-class-escape-plus-quantifier-flags-u.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-digit-class-escape-plus-quantifier-flags-u.js
+index 5c02690..0030b23 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-digit-class-escape-plus-quantifier-flags-u.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-digit-class-escape-plus-quantifier-flags-u.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0x10ffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0x10FFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0x10ffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\D+/ug;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-digit-class-escape-plus-quantifier.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-digit-class-escape-plus-quantifier.js
+index 960d9cf..b663be0 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-digit-class-escape-plus-quantifier.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-digit-class-escape-plus-quantifier.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0xffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0xFFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0xffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\D+/g;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-digit-class-escape.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-digit-class-escape.js
+index 85b1dcc..dcbd2eb 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-digit-class-escape.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-digit-class-escape.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0xffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0xFFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0xffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\D/g;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-whitespace-class-escape-flags-u.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-whitespace-class-escape-flags-u.js
+index eda913b..cb57074 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-whitespace-class-escape-flags-u.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-whitespace-class-escape-flags-u.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0x10ffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0x10FFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0x10ffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\S/ug;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-whitespace-class-escape-plus-quantifier-flags-u.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-whitespace-class-escape-plus-quantifier-flags-u.js
+index 8e21a55..026309c 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-whitespace-class-escape-plus-quantifier-flags-u.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-whitespace-class-escape-plus-quantifier-flags-u.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0x10ffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0x10FFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0x10ffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\S+/ug;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-whitespace-class-escape-plus-quantifier.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-whitespace-class-escape-plus-quantifier.js
+index f7cc4a3..98cfdff 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-whitespace-class-escape-plus-quantifier.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-whitespace-class-escape-plus-quantifier.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0xffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0xFFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0xffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\S+/g;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-whitespace-class-escape.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-whitespace-class-escape.js
+index 3bca8ae..4ec88be 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-whitespace-class-escape.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-whitespace-class-escape.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0xffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0xFFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0xffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\S/g;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-word-class-escape-flags-u.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-word-class-escape-flags-u.js
+index 3da454a..0a94a16 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-word-class-escape-flags-u.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-word-class-escape-flags-u.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0x10ffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0x10FFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0x10ffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\W/ug;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-word-class-escape-plus-quantifier-flags-u.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-word-class-escape-plus-quantifier-flags-u.js
+index 7e7faad..0a10667 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-word-class-escape-plus-quantifier-flags-u.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-word-class-escape-plus-quantifier-flags-u.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0x10ffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0x10FFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0x10ffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\W+/ug;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-word-class-escape-plus-quantifier.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-word-class-escape-plus-quantifier.js
+index 41ffa53..55447f8 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-word-class-escape-plus-quantifier.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-word-class-escape-plus-quantifier.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0xffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0xFFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0xffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\W+/g;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-word-class-escape.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-word-class-escape.js
+index ca47608..c1580cb 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-word-class-escape.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-non-word-class-escape.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0xffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0xFFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0xffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\W/g;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-whitespace-class-escape-flags-u.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-whitespace-class-escape-flags-u.js
+index 82bb950..ac17d3b 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-whitespace-class-escape-flags-u.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-whitespace-class-escape-flags-u.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0x10ffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0x10FFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0x10ffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\s/ug;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-whitespace-class-escape-plus-quantifier-flags-u.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-whitespace-class-escape-plus-quantifier-flags-u.js
+index 7a3b57d..f74a350 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-whitespace-class-escape-plus-quantifier-flags-u.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-whitespace-class-escape-plus-quantifier-flags-u.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0x10ffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0x10FFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0x10ffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\s+/ug;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-whitespace-class-escape-plus-quantifier.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-whitespace-class-escape-plus-quantifier.js
+index e1084ff..ba93158 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-whitespace-class-escape-plus-quantifier.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-whitespace-class-escape-plus-quantifier.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0xffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0xFFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0xffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\s+/g;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-whitespace-class-escape.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-whitespace-class-escape.js
+index d1a3fda..0de155f 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-whitespace-class-escape.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-whitespace-class-escape.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0xffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0xFFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0xffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\s/g;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-word-class-escape-flags-u.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-word-class-escape-flags-u.js
+index 0b8b183..2ccf8bf 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-word-class-escape-flags-u.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-word-class-escape-flags-u.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0x10ffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0x10FFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0x10ffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\w/ug;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-word-class-escape-plus-quantifier-flags-u.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-word-class-escape-plus-quantifier-flags-u.js
+index d824426..b389118 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-word-class-escape-plus-quantifier-flags-u.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-word-class-escape-plus-quantifier-flags-u.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0x10ffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0x10FFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0x10ffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\w+/ug;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-word-class-escape-plus-quantifier.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-word-class-escape-plus-quantifier.js
+index bafffd7..334290d 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-word-class-escape-plus-quantifier.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-word-class-escape-plus-quantifier.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0xffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0xFFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0xffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\w+/g;
+diff --git a/test/built-ins/RegExp/CharacterClassEscapes/character-class-word-class-escape.js b/test/built-ins/RegExp/CharacterClassEscapes/character-class-word-class-escape.js
+index cba30b0..afc5615 100644
+--- a/test/built-ins/RegExp/CharacterClassEscapes/character-class-word-class-escape.js
++++ b/test/built-ins/RegExp/CharacterClassEscapes/character-class-word-class-escape.js
+@@ -33,14 +33,16 @@ info: |
+     The production CharacterClassEscape :: W evaluates as follows:
+         Return the set of all characters not included in the set returned by CharacterClassEscape :: w.
+ features: [String.fromCodePoint]
++includes: [regExpUtils.js]
+ ---*/
+ 
+ const chunks = [];
+-const totalChunks = Math.ceil(0xffff / 0x10000);
+-
+-for (let codePoint = 0; codePoint < 0xFFFF; codePoint++) {
+-    // split strings to avoid a super long one;
+-    chunks[codePoint % totalChunks] += String.fromCodePoint(codePoint);
++const lastCodePoint = 0xffff;
++let codePoint = 0;
++while (codePoint <= lastCodePoint) {
++   let n = Math.min(0x10000, lastCodePoint - codePoint + 1);
++   chunks.push(codePointRange(codePoint, codePoint + n));
++   codePoint += n;
+ }
+ 
+ const re = /\w/g;
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_bignum.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_bignum.js
new file mode 100755
index 00000000..344aaf9d
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_bignum.js
@@ -0,0 +1,269 @@
+"use math";
+"use strict";
+
+function assert(actual, expected, message) {
+    if (arguments.length == 1)
+        expected = true;
+
+    if (actual === expected)
+        return;
+
+    if (actual !== null && expected !== null
+    &&  typeof actual == 'object' && typeof expected == 'object'
+    &&  actual.toString() === expected.toString())
+        return;
+
+    throw Error("assertion failed: got |" + actual + "|" +
+                ", expected |" + expected + "|" +
+                (message ? " (" + message + ")" : ""));
+}
+
+// load more elaborate version of assert if available
+try { __loadScript("test_assert.js"); } catch(e) {}
+
+/*----------------*/
+
+function pow(a, n)
+{
+    var r, i;
+    r = 1;
+    for(i = 0; i < n; i++)
+        r *= a;
+    return r;
+}
+
+function test_integer()
+{
+    var a, r;
+    a = pow(3, 100);
+    assert((a - 1) != a);
+    assert(a == 515377520732011331036461129765621272702107522001);
+    assert(a == 0x5a4653ca673768565b41f775d6947d55cf3813d1);
+    assert(Integer.isInteger(1) === true);
+    assert(Integer.isInteger(1.0) === false);
+
+    assert(Integer.floorLog2(0) === -1);
+    assert(Integer.floorLog2(7) === 2);
+
+    r = 1 << 31;
+    assert(r, 2147483648, "1 << 31 === 2147483648");
+    
+    r = 1 << 32;
+    assert(r, 4294967296, "1 << 32 === 4294967296");
+    
+    r = (1 << 31) < 0;
+    assert(r, false, "(1 << 31) < 0 === false");
+}
+
+function test_divrem(div1, a, b, q)
+{
+    var div, divrem, t;
+    div = Integer[div1];
+    divrem = Integer[div1 + "rem"];
+    assert(div(a, b) == q);
+    t = divrem(a, b);
+    assert(t[0] == q);
+    assert(a == b * q + t[1]);
+}
+
+function test_idiv1(div, a, b, r)
+{
+    test_divrem(div, a, b, r[0]);
+    test_divrem(div, -a, b, r[1]);
+    test_divrem(div, a, -b, r[2]);
+    test_divrem(div, -a, -b, r[3]);
+}
+
+function test_idiv()
+{
+    test_idiv1("tdiv", 3, 2, [1, -1, -1, 1]);
+    test_idiv1("fdiv", 3, 2, [1, -2, -2, 1]);
+    test_idiv1("cdiv", 3, 2, [2, -1, -1, 2]);
+    test_idiv1("ediv", 3, 2, [1, -2, -1, 2]);
+}
+
+function test_float()
+{
+    var e, a, b, sqrt2;
+    
+    assert(typeof 1 === "bigint");
+    assert(typeof 1.0 === "bigfloat");
+    assert(1 == 1.0);
+    assert(1 !== 1.0);
+    
+    e = new BigFloatEnv(128);
+    assert(e.prec == 128);
+    a = BigFloat.sqrt(2, e);
+    assert(a == BigFloat.parseFloat("0x1.6a09e667f3bcc908b2fb1366ea957d3e", 0, e));
+    assert(e.inexact === true);
+    assert(BigFloat.fpRound(a) == 0x1.6a09e667f3bcd);
+    
+    b = BigFloatEnv.setPrec(BigFloat.sqrt.bind(null, 2), 128);
+    assert(a == b);
+}
+
+/* jscalc tests */
+
+function test_modulo()
+{
+    var i, p, a, b;
+
+    /* Euclidian modulo operator */
+    assert((-3) % 2 == 1);
+    assert(3 % (-2) == 1);
+
+    p = 101;
+    for(i = 1; i < p; i++) {
+        a = Integer.invmod(i, p);
+        assert(a >= 0 && a < p);
+        assert((i * a) % p == 1);
+    }
+
+    assert(Integer.isPrime(2^107-1));
+    assert(!Integer.isPrime((2^107-1) * (2^89-1)));
+    a = Integer.factor((2^89-1)*2^3*11*13^2*1009);
+    assert(a == [ 2,2,2,11,13,13,1009,618970019642690137449562111 ]);
+}
+
+function test_mod()
+{
+    var a, b, p;
+    
+    a = Mod(3, 101);
+    b = Mod(-1, 101);
+    assert((a + b) == Mod(2, 101));
+    assert(a ^ 100 == Mod(1, 101));
+
+    p = 2 ^ 607 - 1; /* mersenne prime */
+    a = Mod(3, p) ^ (p - 1);
+    assert(a == Mod(1, p));
+}
+
+function test_polynomial()
+{
+    var a, b, q, r, t, i;
+    a = (1 + X) ^ 4;
+    assert(a == X^4+4*X^3+6*X^2+4*X+1);
+    
+    r = (1 + X);
+    q = (1+X+X^2);
+    b = (1 - X^2);
+    a = q * b + r;
+    t = Polynomial.divrem(a, b);
+    assert(t[0] == q);
+    assert(t[1] == r);
+
+    a = 1 + 2*X + 3*X^2;
+    assert(a.apply(0.1) == 1.23);
+
+    a = 1-2*X^2+2*X^3;
+    assert(deriv(a) == (6*X^2-4*X));
+    assert(deriv(integ(a)) == a);
+
+    a = (X-1)*(X-2)*(X-3)*(X-4)*(X-0.1);
+    r = polroots(a);
+    for(i = 0; i < r.length; i++) {
+        b = abs(a.apply(r[i]));
+        assert(b <= 1e-13);
+    }
+}
+
+function test_poly_mod()
+{
+    var a, p;
+
+    /* modulo using polynomials */
+    p = X^2 + X + 1;
+    a = PolyMod(3+X, p) ^ 10;
+    assert(a == PolyMod(-3725*X-18357, p));
+
+    a = PolyMod(1/X, 1+X^2);
+    assert(a == PolyMod(-X, X^2+1));
+}
+
+function test_rfunc()
+{
+    var a;
+    a = (X+1)/((X+1)*(X-1));
+    assert(a == 1/(X-1));
+    a = (X + 2) / (X - 2);
+    assert(a.apply(1/3) == -7/5);
+
+    assert(deriv((X^2-X+1)/(X-1)) == (X^2-2*X)/(X^2-2*X+1));
+}
+
+function test_series()
+{
+    var a, b;
+    a = 1+X+O(X^5);
+    b = a.inverse();
+    assert(b == 1-X+X^2-X^3+X^4+O(X^5));
+    assert(deriv(b) == -1+2*X-3*X^2+4*X^3+O(X^4));
+    assert(deriv(integ(b)) == b);
+
+    a = Series(1/(1-X), 5);
+    assert(a == 1+X+X^2+X^3+X^4+O(X^5));
+    b = a.apply(0.1);
+    assert(b == 1.1111);
+
+    assert(exp(3*X^2+O(X^10)) == 1+3*X^2+9/2*X^4+9/2*X^6+27/8*X^8+O(X^10));
+    assert(sin(X+O(X^6)) == X-1/6*X^3+1/120*X^5+O(X^6));
+    assert(cos(X+O(X^6)) == 1-1/2*X^2+1/24*X^4+O(X^6));
+    assert(tan(X+O(X^8)) == X+1/3*X^3+2/15*X^5+17/315*X^7+O(X^8));
+    assert((1+X+O(X^6))^(2+X) == 1+2*X+2*X^2+3/2*X^3+5/6*X^4+5/12*X^5+O(X^6));
+}
+
+function test_matrix()
+{
+    var a, b, r;
+    a = [[1, 2],[3, 4]];
+    b = [3, 4];
+    r = a * b;
+    assert(r == [11, 25]);
+    r = (a^-1) * 2;
+    assert(r == [[-4, 2],[3, -1]]);
+
+    assert(norm2([1,2,3]) == 14);
+
+    assert(diag([1,2,3]) == [ [ 1, 0, 0 ], [ 0, 2, 0 ], [ 0, 0, 3 ] ]);
+    assert(trans(a) == [ [ 1, 3 ], [ 2, 4 ] ]);
+    assert(trans([1,2,3]) == [[1,2,3]]);
+    assert(trace(a) == 5);
+
+    assert(charpoly(Matrix.hilbert(4)) == X^4-176/105*X^3+3341/12600*X^2-41/23625*X+1/6048000);
+    assert(det(Matrix.hilbert(4)) == 1/6048000);
+
+    a = [[1,2,1],[-2,-3,1],[3,5,0]];
+    assert(rank(a) == 2);
+    assert(ker(a) == [ [ 5 ], [ -3 ], [ 1 ] ]);
+
+    assert(dp([1, 2, 3], [3, -4, -7]) === -26);
+    assert(cp([1, 2, 3], [3, -4, -7]) == [ -2, 16, -10 ]);
+}
+
+function assert_eq(a, ref)
+{
+    assert(abs(a / ref - 1.0) <= 1e-15);
+}
+
+function test_trig()
+{
+    assert_eq(sin(1/2), 0.479425538604203);
+    assert_eq(sin(2+3*I), 9.154499146911428-4.168906959966565*I);
+    assert_eq(cos(2+3*I), -4.189625690968807-9.109227893755337*I);
+    assert_eq((2+0.5*I)^(1.1-0.5*I), 2.494363021357619-0.23076804554558092*I);
+    assert_eq(sqrt(2*I), 1 + I);
+}
+
+test_integer();
+test_idiv();
+test_float();
+
+test_modulo();
+test_mod();
+test_polynomial();
+test_poly_mod();
+test_rfunc();
+test_series();
+test_matrix();
+test_trig();
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_bjson.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_bjson.js
new file mode 100755
index 00000000..bd371204
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_bjson.js
@@ -0,0 +1,119 @@
+import * as bjson from "../bjson.so";
+
+function assert(b, str)
+{
+    if (b) {
+        return;
+    } else {
+        throw Error("assertion failed: " + str);
+    }
+}
+
+function toHex(a)
+{
+    var i, s = "", tab, v;
+    tab = new Uint8Array(a);
+    for(i = 0; i < tab.length; i++) {
+        v = tab[i].toString(16);
+        if (v.length < 2)
+            v = "0" + v;
+        if (i !== 0)
+            s += " ";
+        s += v;
+    }
+    return s;
+}
+
+function toStr(a)
+{
+    var s, i, props, prop;
+
+    switch(typeof(a)) {
+    case "object":
+        if (a === null)
+            return "null";
+        if (Array.isArray(a)) {
+            s = "[";
+            for(i = 0; i < a.length; i++) {
+                if (i != 0)
+                    s += ",";
+                s += toStr(a[i]);
+            }
+            s += "]";
+        } else {
+            props = Object.keys(a);
+            s = "{";
+            for(i = 0; i < props.length; i++) {
+                if (i != 0)
+                    s += ",";
+                prop = props[i];
+                s += prop + ":" + toStr(a[prop]);
+            }
+            s += "}";
+        }
+        return s;
+    case "undefined":
+        return "undefined";
+    case "string":
+        return a.__quote();
+    case "number":
+    case "bigfloat":
+        if (a == 0 && 1 / a < 0)
+            return "-0";
+        else
+            return a.toString();
+        break;
+    default:
+        return a.toString();
+    }
+}
+
+function bjson_test(a)
+{
+    var buf, r, a_str, r_str;
+    a_str = toStr(a);
+    buf = bjson.write(a);
+    if (0) {
+        print(a_str, "->", toHex(buf));
+    }
+    r = bjson.read(buf, 0, buf.byteLength);
+    r_str = toStr(r);
+    if (a_str != r_str) {
+        print(a_str);
+        print(r_str);
+        assert(false);
+    }
+}
+
+function bjson_test_all()
+{
+    var obj;
+    
+    bjson_test({x:1, y:2, if:3});
+    bjson_test([1, 2, 3]);
+    bjson_test([1.0, "aa", true, false, undefined, null, NaN, -Infinity, -0.0]);
+    if (typeof BigInt !== "undefined") {
+        bjson_test([BigInt("1"), -BigInt("0x123456789"),
+               BigInt("0x123456789abcdef123456789abcdef")]);
+    }
+    if (typeof BigFloat !== "undefined") {
+        BigFloatEnv.setPrec(function () {
+            bjson_test([BigFloat("0.1"), BigFloat("-1e30"), BigFloat("0"),
+                   BigFloat("-0"), BigFloat("Infinity"), BigFloat("-Infinity"),
+                   0.0 / BigFloat("0"), BigFloat.MAX_VALUE,
+                   BigFloat.MIN_VALUE]);
+        }, 113, 15);
+    }
+
+    /* tested with a circular reference */
+    obj = {};
+    obj.x = obj;
+    try {
+        bjson.write(obj);
+        assert(false);
+    } catch(e) {
+        assert(e instanceof TypeError);
+    }
+}
+
+bjson_test_all();
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_builtin.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_builtin.js
new file mode 100755
index 00000000..f986b3dc
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_builtin.js
@@ -0,0 +1,598 @@
+"use strict";
+
+function assert(actual, expected, message) {
+    if (arguments.length == 1)
+        expected = true;
+
+    if (actual === expected)
+        return;
+
+    if (actual !== null && expected !== null
+    &&  typeof actual == 'object' && typeof expected == 'object'
+    &&  actual.toString() === expected.toString())
+        return;
+
+    throw Error("assertion failed: got |" + actual + "|" +
+                ", expected |" + expected + "|" +
+                (message ? " (" + message + ")" : ""));
+}
+
+// load more elaborate version of assert if available
+try { __loadScript("test_assert.js"); } catch(e) {}
+
+/*----------------*/
+
+function my_func(a, b)
+{
+    return a + b;
+}
+
+function test_function()
+{
+    function f(a, b) {
+        var i, tab = [];
+        tab.push(this);
+        for(i = 0; i < arguments.length; i++)
+            tab.push(arguments[i]);
+        return tab;
+    }
+    function constructor1(a) {
+        this.x = a;
+    }
+    
+    var r, g;
+    
+    r = my_func.call(null, 1, 2);
+    assert(r, 3, "call");
+
+    r = my_func.apply(null, [1, 2]);
+    assert(r, 3, "apply");
+
+    r = new Function("a", "b", "return a + b;");
+    assert(r(2,3), 5, "function");
+    
+    g = f.bind(1, 2);
+    assert(g.length, 1);
+    assert(g.name, "bound f");
+    assert(g(3), [1,2,3]);
+
+    g = constructor1.bind(null, 1);
+    r = new g();
+    assert(r.x, 1);
+}
+
+function test()
+{
+    var r, a, b, c, err;
+
+    r = Error("hello");
+    assert(r.message, "hello", "Error");
+
+    a = new Object();
+    a.x = 1;
+    assert(a.x, 1, "Object");
+
+    assert(Object.getPrototypeOf(a), Object.prototype, "getPrototypeOf");
+    Object.defineProperty(a, "y", { value: 3, writable: true, configurable: true, enumerable: true });
+    assert(a.y, 3, "defineProperty");
+
+    Object.defineProperty(a, "z", { get: function () { return 4; }, set: function(val) { this.z_val = val; }, configurable: true, enumerable: true });
+    assert(a.z, 4, "get");
+    a.z = 5;
+    assert(a.z_val, 5, "set");
+    
+    a = { get z() { return 4; }, set z(val) { this.z_val = val; } };
+    assert(a.z, 4, "get");
+    a.z = 5;
+    assert(a.z_val, 5, "set");
+
+    b = Object.create(a);
+    assert(Object.getPrototypeOf(b), a, "create");
+    c = {u:2};
+    /* XXX: refcount bug in 'b' instead of 'a' */
+    Object.setPrototypeOf(a, c);
+    assert(Object.getPrototypeOf(a), c, "setPrototypeOf");
+
+    a = {};
+    assert(a.toString(), "[object Object]", "toString");
+
+    a = {x:1};
+    assert(Object.isExtensible(a), true, "extensible");
+    Object.preventExtensions(a);
+
+    err = false;
+    try {
+        a.y = 2;
+    } catch(e) {
+        err = true;
+    }
+    assert(Object.isExtensible(a), false, "extensible");
+    assert(typeof a.y, "undefined", "extensible");
+    assert(err, true, "extensible");
+}
+
+function test_enum()
+{
+    var a, tab;
+    a = {x:1,
+         "18014398509481984": 1,
+         "9007199254740992": 1,
+         "9007199254740991": 1,
+         "4294967296": 1,
+         "4294967295": 1,
+         y:1,
+         "4294967294": 1,
+         "1": 2};
+    tab = Object.keys(a);
+//    console.log("tab=" + tab.toString());
+    assert(tab, ["1","4294967294","4294967295","4294967296","9007199254740991","x","18014398509481984","9007199254740992","y"], "keys");
+}
+
+function test_array()
+{
+    var a, err;
+
+    a = [1, 2, 3];
+    assert(a.length, 3, "array");
+    assert(a[2], 3, "array1");
+
+    a = new Array(10);
+    assert(a.length, 10, "array2");
+
+    a = new Array(1, 2);
+    assert(a.length === 2 && a[0] === 1 && a[1] === 2, true, "array3");
+
+    a = [1, 2, 3];
+    a.length = 2;
+    assert(a.length === 2 && a[0] === 1 && a[1] === 2, true, "array4");
+
+    a = [];
+    a[1] = 10;
+    a[4] = 3;
+    assert(a.length, 5);
+
+    a = [1,2];
+    a.length = 5;
+    a[4] = 1;
+    a.length = 4;
+    assert(a[4] !== 1, true, "array5");
+
+    a = [1,2];
+    a.push(3,4);
+    assert(a.join(), "1,2,3,4", "join");
+
+    a = [1,2,3,4,5];
+    Object.defineProperty(a, "3", { configurable: false });
+    err = false;
+    try {
+        a.length = 2;
+    } catch(e) {
+        err = true;
+    }
+    assert(err && a.toString() === "1,2,3,4");
+}
+
+function test_string()
+{
+    var a;
+    a = String("abc");
+    assert(a.length, 3, "string");
+    assert(a[1], "b", "string");
+    assert(a.charCodeAt(1), 0x62, "string");
+    assert(String.fromCharCode(65), "A", "string");
+    assert(String.fromCharCode.apply(null, [65, 66, 67]), "ABC", "string");
+    assert(a.charAt(1), "b");
+    assert(a.charAt(-1), "");
+    assert(a.charAt(3), "");
+    
+    a = "abcd";
+    assert(a.substring(1, 3), "bc", "substring");
+    a = String.fromCharCode(0x20ac);
+    assert(a.charCodeAt(0), 0x20ac, "unicode");
+    assert(a, "€", "unicode");
+    assert(a, "\u20ac", "unicode");
+    assert(a, "\u{20ac}", "unicode");
+    assert("a", "\x61", "unicode");
+        
+    a = "\u{10ffff}";
+    assert(a.length, 2, "unicode");
+    assert(a, "\u{dbff}\u{dfff}", "unicode");
+    assert(a.codePointAt(0), 0x10ffff);
+    assert(String.fromCodePoint(0x10ffff), a);
+
+    assert("a".concat("b", "c"), "abc");
+
+    assert("abcabc".indexOf("cab"), 2);
+    assert("abcabc".indexOf("cab2"), -1);
+    assert("abc".indexOf("c"), 2);
+
+    assert("aaa".indexOf("a"), 0);
+    assert("aaa".indexOf("a", NaN), 0);
+    assert("aaa".indexOf("a", -Infinity), 0);
+    assert("aaa".indexOf("a", -1), 0);
+    assert("aaa".indexOf("a", -0), 0);
+    assert("aaa".indexOf("a", 0), 0);
+    assert("aaa".indexOf("a", 1), 1);
+    assert("aaa".indexOf("a", 2), 2);
+    assert("aaa".indexOf("a", 3), -1);
+    assert("aaa".indexOf("a", 4), -1);
+    assert("aaa".indexOf("a", Infinity), -1);
+
+    assert("aaa".indexOf(""), 0);
+    assert("aaa".indexOf("", NaN), 0);
+    assert("aaa".indexOf("", -Infinity), 0);
+    assert("aaa".indexOf("", -1), 0);
+    assert("aaa".indexOf("", -0), 0);
+    assert("aaa".indexOf("", 0), 0);
+    assert("aaa".indexOf("", 1), 1);
+    assert("aaa".indexOf("", 2), 2);
+    assert("aaa".indexOf("", 3), 3);
+    assert("aaa".indexOf("", 4), 3);
+    assert("aaa".indexOf("", Infinity), 3);
+
+    assert("aaa".lastIndexOf("a"), 2);
+    assert("aaa".lastIndexOf("a", NaN), 2);
+    assert("aaa".lastIndexOf("a", -Infinity), 0);
+    assert("aaa".lastIndexOf("a", -1), 0);
+    assert("aaa".lastIndexOf("a", -0), 0);
+    assert("aaa".lastIndexOf("a", 0), 0);
+    assert("aaa".lastIndexOf("a", 1), 1);
+    assert("aaa".lastIndexOf("a", 2), 2);
+    assert("aaa".lastIndexOf("a", 3), 2);
+    assert("aaa".lastIndexOf("a", 4), 2);
+    assert("aaa".lastIndexOf("a", Infinity), 2);
+
+    assert("aaa".lastIndexOf(""), 3);
+    assert("aaa".lastIndexOf("", NaN), 3);
+    assert("aaa".lastIndexOf("", -Infinity), 0);
+    assert("aaa".lastIndexOf("", -1), 0);
+    assert("aaa".lastIndexOf("", -0), 0);
+    assert("aaa".lastIndexOf("", 0), 0);
+    assert("aaa".lastIndexOf("", 1), 1);
+    assert("aaa".lastIndexOf("", 2), 2);
+    assert("aaa".lastIndexOf("", 3), 3);
+    assert("aaa".lastIndexOf("", 4), 3);
+    assert("aaa".lastIndexOf("", Infinity), 3);
+
+    assert("a,b,c".split(","), ["a","b","c"]);
+    assert(",b,c".split(","), ["","b","c"]);
+    assert("a,b,".split(","), ["a","b",""]);
+
+    assert("aaaa".split(), [ "aaaa" ]);
+    assert("aaaa".split(undefined, 0), [ ]);
+    assert("aaaa".split(""), [ "a", "a", "a", "a" ]);
+    assert("aaaa".split("", 0), [ ]);
+    assert("aaaa".split("", 1), [ "a" ]);
+    assert("aaaa".split("", 2), [ "a", "a" ]);
+    assert("aaaa".split("a"), [ "", "", "", "", "" ]);
+    assert("aaaa".split("a", 2), [ "", "" ]);
+    assert("aaaa".split("aa"), [ "", "", "" ]);
+    assert("aaaa".split("aa", 0), [ ]);
+    assert("aaaa".split("aa", 1), [ "" ]);
+    assert("aaaa".split("aa", 2), [ "", "" ]);
+    assert("aaaa".split("aaa"), [ "", "a" ]);
+    assert("aaaa".split("aaaa"), [ "", "" ]);
+    assert("aaaa".split("aaaaa"), [ "aaaa" ]);
+    assert("aaaa".split("aaaaa", 0), [  ]);
+    assert("aaaa".split("aaaaa", 1), [ "aaaa" ]);
+
+    assert(eval('"\0"'), "\0");
+}
+
+function test_math()
+{
+    var a;
+    a = 1.4;
+    assert(Math.floor(a), 1);
+    assert(Math.ceil(a), 2);
+    assert(Math.imul(0x12345678, 123), -1088058456);
+    assert(Math.fround(0.1), 0.10000000149011612);
+}
+
+function test_number()
+{
+    assert(parseInt("123"), 123);
+    assert(parseInt("  123r"), 123);
+    assert(parseInt("0x123"), 0x123);
+    assert(parseInt("0o123"), 0);
+    assert(+"  123   ", 123);
+    assert(+"0b111", 7);
+    assert(+"0o123", 83);
+    assert(parseFloat("0x1234"), 0);
+    assert(parseFloat("Infinity"), Infinity);
+    assert(parseFloat("-Infinity"), -Infinity);
+    assert(parseFloat("123.2"), 123.2);
+    assert(parseFloat("123.2e3"), 123200);
+
+    assert((25).toExponential(0), "3e+1");
+    assert((-25).toExponential(0), "-3e+1");
+    assert((2.5).toPrecision(1), "3");
+    assert((-2.5).toPrecision(1), "-3");
+    assert((1.125).toFixed(2), "1.13");
+    assert((-1.125).toFixed(2), "-1.13");
+}
+
+function test_eval()
+{
+    function f(b) {
+        var x = 1;
+        return eval(b);
+    }
+    var r, a;
+
+    r = eval("1+1;");
+    assert(r, 2, "eval");
+
+    r = eval("var my_var=2; my_var;");
+    assert(r, 2, "eval");
+    assert(typeof my_var, "undefined");
+
+    assert(eval("if (1) 2; else 3;"), 2);
+    assert(eval("if (0) 2; else 3;"), 3);
+
+    assert(f.call(1, "this"), 1);
+    
+    a = 2;
+    assert(eval("a"), 2);
+
+    eval("a = 3");
+    assert(a, 3);
+
+    assert(f("arguments.length", 1), 2);
+    assert(f("arguments[1]", 1), 1);
+
+    a = 4;
+    assert(f("a"), 4);
+    f("a=3");
+    assert(a, 3);
+}
+
+function test_typed_array()
+{
+    var buffer, a, i;
+
+    a = new Uint8Array(4);
+    assert(a.length, 4);
+    for(i = 0; i < a.length; i++)
+        a[i] = i;
+    assert(a.join(","), "0,1,2,3");
+    a[0] = -1;
+    assert(a[0], 255);
+
+    a = new Int8Array(3);
+    a[0] = 255;
+    assert(a[0], -1);
+
+    a = new Int32Array(3);
+    a[0] = Math.pow(2, 32) - 1;
+    assert(a[0], -1);
+    assert(a.BYTES_PER_ELEMENT, 4);
+
+    a = new Uint8ClampedArray(4);
+    a[0] = -100;
+    a[1] = 1.5;
+    a[2] = 0.5;
+    a[3] = 1233.5;
+    assert(a.toString(), "0,2,0,255");
+    
+    buffer = new ArrayBuffer(16);
+    assert(buffer.byteLength, 16);
+    a = new Uint32Array(buffer, 12, 1);
+    assert(a.length, 1);
+    a[0] = -1;
+
+    a = new Uint16Array(buffer, 2);
+    a[0] = -1;
+
+    a = new Float32Array(buffer, 8, 1);
+    a[0] = 1;
+    
+    a = new Uint8Array(buffer);
+    
+    assert(a.toString(), "0,0,255,255,0,0,0,0,0,0,128,63,255,255,255,255");
+
+    assert(a.buffer, buffer);
+
+    a = new Uint8Array([1, 2, 3, 4]);
+    assert(a.toString(), "1,2,3,4");
+    a.set([10, 11], 2);
+    assert(a.toString(), "1,2,10,11");
+}
+
+function test_json()
+{
+    var a, s;
+    s = '{"x":1,"y":true,"z":null,"a":[1,2,3],"s":"str"}';
+    a = JSON.parse(s);
+    assert(a.x, 1);
+    assert(a.y, true);
+    assert(a.z, null);
+    assert(JSON.stringify(a), s);
+}
+
+function test_date()
+{
+    var d = new Date(1506098258091), a;
+    assert(d.toISOString(), "2017-09-22T16:37:38.091Z");
+    d.setUTCHours(18, 10, 11);
+    assert(d.toISOString(), "2017-09-22T18:10:11.091Z");
+    a = Date.parse(d.toISOString());
+    assert((new Date(a)).toISOString(), d.toISOString());
+}
+
+function test_regexp()
+{
+    var a, str;
+    str = "abbbbbc";
+    a = /(b+)c/.exec(str);
+    assert(a[0], "bbbbbc");
+    assert(a[1], "bbbbb");
+    assert(a.index, 1);
+    assert(a.input, str);
+    a = /(b+)c/.test(str);
+    assert(a, true);
+    assert(/\x61/.exec("a")[0], "a");
+    assert(/\u0061/.exec("a")[0], "a");
+    assert(/\ca/.exec("\x01")[0], "\x01");
+    assert(/\\a/.exec("\\a")[0], "\\a");
+    assert(/\c0/.exec("\\c0")[0], "\\c0");
+
+    a = /(\.(?=com|org)|\/)/.exec("ah.com");
+    assert(a.index === 2 && a[0] === ".");
+
+    a = /(\.(?!com|org)|\/)/.exec("ah.com");
+    assert(a, null);
+    
+    a = /(?=(a+))/.exec("baaabac");
+    assert(a.index === 1 && a[0] === "" && a[1] === "aaa");
+
+    a = /(z)((a+)?(b+)?(c))*/.exec("zaacbbbcac");
+    assert(a, ["zaacbbbcac","z","ac","a",,"c"]);
+
+    a = eval("/\0a/");
+    assert(a.toString(), "/\0a/");
+    assert(a.exec("\0a")[0], "\0a");
+}
+
+function test_symbol()
+{
+    var a, b, obj, c;
+    a = Symbol("abc");
+    obj = {};
+    obj[a] = 2;
+    assert(obj[a], 2);
+    assert(typeof obj["abc"], "undefined");
+    assert(String(a), "Symbol(abc)");
+    b = Symbol("abc");
+    assert(a == a);
+    assert(a === a);
+    assert(a != b);
+    assert(a !== b);
+
+    b = Symbol.for("abc");
+    c = Symbol.for("abc");
+    assert(b === c);
+    assert(b !== a);
+
+    assert(Symbol.keyFor(b), "abc");
+    assert(Symbol.keyFor(a), undefined);
+
+    a = Symbol("aaa");
+    assert(a.valueOf(), a);
+    assert(a.toString(), "Symbol(aaa)");
+
+    b = Object(a);
+    assert(b.valueOf(), a);
+    assert(b.toString(), "Symbol(aaa)");
+}
+
+function test_map()
+{
+    var a, i, n, tab, o, v;
+    n = 1000;
+    a = new Map();
+    tab = [];
+    for(i = 0; i < n; i++) {
+        v = { };
+        o = { id: i };
+        tab[i] = [o, v];
+        a.set(o, v);
+    }
+
+    assert(a.size, n);
+    for(i = 0; i < n; i++) {
+        assert(a.get(tab[i][0]), tab[i][1]);
+    }
+
+    i = 0;
+    a.forEach(function (v, o) { 
+        assert(o, tab[i++][0]);
+        assert(a.has(o));
+        assert(a.delete(o));
+        assert(!a.has(o));
+    });
+
+    assert(a.size, 0);
+}
+
+function test_weak_map()
+{
+    var a, i, n, tab, o, v, n2;
+    a = new WeakMap();
+    n = 10;
+    tab = [];
+    for(i = 0; i < n; i++) {
+        v = { };
+        o = { id: i };
+        tab[i] = [o, v];
+        a.set(o, v);
+    }
+    o = null;
+    
+    n2 = n >> 1;
+    for(i = 0; i < n2; i++) {
+        a.delete(tab[i][0]);
+    }
+    for(i = n2; i < n; i++) {
+        tab[i][0] = null; /* should remove the object from the WeakMap too */
+    }
+    /* the WeakMap should be empty here */
+}
+
+function test_generator()
+{
+    function *f() {
+        var ret;
+        yield 1;
+        ret = yield 2;
+        assert(ret, "next_arg");
+        return 3;
+    }
+    function *f2() {
+        yield 1;
+        yield 2;
+        return "ret_val";
+    }
+    function *f1() {
+        var ret = yield *f2();
+        assert(ret, "ret_val");
+        return 3;
+    }
+    var g, v;
+    g = f();
+    v = g.next();
+    assert(v.value === 1 && v.done === false);
+    v = g.next();
+    assert(v.value === 2 && v.done === false);
+    v = g.next("next_arg");
+    assert(v.value === 3 && v.done === true);
+    v = g.next();
+    assert(v.value === undefined && v.done === true);
+
+    g = f1();
+    v = g.next();
+    assert(v.value === 1 && v.done === false);
+    v = g.next();
+    assert(v.value === 2 && v.done === false);
+    v = g.next();
+    assert(v.value === 3 && v.done === true);
+    v = g.next();
+    assert(v.value === undefined && v.done === true);
+}
+
+test();
+test_function();
+test_enum();
+test_array();
+test_string();
+test_math();
+test_number();
+test_eval();
+test_typed_array();
+test_json();
+test_date();
+test_regexp();
+test_symbol();
+test_map();
+test_weak_map();
+test_generator();
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_closure.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_closure.js
new file mode 100755
index 00000000..aa1d17ed
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_closure.js
@@ -0,0 +1,221 @@
+function assert(actual, expected, message) {
+    if (arguments.length == 1)
+        expected = true;
+
+    if (actual === expected)
+        return;
+
+    if (actual !== null && expected !== null
+    &&  typeof actual == 'object' && typeof expected == 'object'
+    &&  actual.toString() === expected.toString())
+        return;
+
+    throw Error("assertion failed: got |" + actual + "|" +
+                ", expected |" + expected + "|" +
+                (message ? " (" + message + ")" : ""));
+}
+
+// load more elaborate version of assert if available
+try { __loadScript("test_assert.js"); } catch(e) {}
+
+/*----------------*/
+
+var log_str = "";
+
+function log(str)
+{
+    log_str += str + ",";
+}
+
+function f(a, b, c)
+{
+    var x = 10;
+    log("a="+a);
+    function g(d) {
+        function h() {
+            log("d=" + d);
+            log("x=" + x);
+        }
+        log("b=" + b);
+        log("c=" + c);
+        h();
+    }
+    g(4);
+    return g;
+}
+
+var g1 = f(1, 2, 3);
+g1(5);
+
+assert(log_str, "a=1,b=2,c=3,d=4,x=10,b=2,c=3,d=5,x=10,", "closure1");
+
+function test_closure1()
+{
+    function f2()
+    {
+        var val = 1;
+        
+        function set(a) {
+            val = a;
+        }
+        function get(a) {
+            return val;
+        }
+        return { "set": set, "get": get };
+    }
+    
+    var obj = f2();
+    obj.set(10);
+    var r;
+    r = obj.get();
+    assert(r, 10, "closure2");
+}
+
+function test_closure2()
+{
+    var expr_func = function myfunc1(n) {
+        function myfunc2(n) {
+            return myfunc1(n - 1);
+        }
+        if (n == 0)
+            return 0;
+        else
+            return myfunc2(n);
+    };
+    var r;
+    r = expr_func(1);
+    assert(r, 0, "expr_func");
+}
+
+function test_closure3()
+{
+    function fib(n)
+    {
+        if (n <= 0)
+            return 0;
+        else if (n == 1)
+            return 1;
+        else
+            return fib(n - 1) + fib(n - 2);
+    }
+
+    var fib_func = function fib1(n)
+    {
+        if (n <= 0)
+            return 0;
+        else if (n == 1)
+            return 1;
+        else
+            return fib1(n - 1) + fib1(n - 2);
+    };
+
+    assert(fib(6), 8, "fib");
+    assert(fib_func(6), 8, "fib_func");
+}
+
+function test_arrow_function()
+{
+    "use strict";
+
+    function f1() {
+        return (() => arguments)();
+    }
+    function f2() {
+        return (() => this)();
+    }
+    function f3() {
+        return (() => eval("this"))();
+    }
+    function f4() {
+        return (() => eval("new.target"))();
+    }
+    var a;
+
+    a = f1(1, 2);
+    assert(a.length, 2);
+    assert(a[0] === 1 && a[1] === 2);
+
+    assert(f2.call("this_val") === "this_val");
+    assert(f3.call("this_val") === "this_val");
+    assert(new f4() === f4);
+
+    var o1 = { f() { return this; } };
+    var o2 = { f() {
+        return (() => eval("super.f()"))();
+    } };
+    o2.__proto__ = o1;
+
+    assert(o2.f() === o2);
+}
+
+function test_with()
+{
+    var o1 = { x: "o1", y: "o1" };
+    var x = "local";
+    eval('var z="var_obj";');
+    assert(z === "var_obj");
+    with (o1) {
+        assert(x === "o1");
+        assert(eval("x") === "o1");
+        var f = function () {
+            o2 = { x: "o2" };
+            with (o2) {
+                assert(x === "o2");
+                assert(y === "o1");
+                assert(z === "var_obj");
+                assert(eval("x") === "o2");
+                assert(eval("y") === "o1");
+                assert(eval("z") === "var_obj");
+                assert(eval('eval("x")') === "o2");
+            }
+        };
+        f();
+    }
+}
+
+function test_eval_closure()
+{
+    var tab;
+
+    tab = [];
+    for(let i = 0; i < 3; i++) {
+        eval("tab.push(function g1() { return i; })");
+    }
+    for(let i = 0; i < 3; i++) {
+        assert(tab[i]() === i);
+    }
+
+    tab = [];
+    for(let i = 0; i < 3; i++) {
+        let f = function f() {
+            eval("tab.push(function g2() { return i; })");
+        };
+        f();
+    }
+    for(let i = 0; i < 3; i++) {
+        assert(tab[i]() === i);
+    }
+}
+
+function test_eval_const()
+{
+    const a = 1;
+    var success = false;
+    var f = function () {
+        eval("a = 1");
+    };
+    try {
+        f();
+    } catch(e) {
+        success = (e instanceof TypeError);
+    }
+    assert(success);
+}
+
+test_closure1();
+test_closure2();
+test_closure3();
+test_arrow_function();
+test_with();
+test_eval_closure();
+test_eval_const();
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_loop.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_loop.js
new file mode 100755
index 00000000..5fda9d8e
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_loop.js
@@ -0,0 +1,368 @@
+function assert(actual, expected, message) {
+    if (arguments.length == 1)
+        expected = true;
+
+    if (actual === expected)
+        return;
+
+    if (actual !== null && expected !== null
+    &&  typeof actual == 'object' && typeof expected == 'object'
+    &&  actual.toString() === expected.toString())
+        return;
+
+    throw Error("assertion failed: got |" + actual + "|" +
+                ", expected |" + expected + "|" +
+                (message ? " (" + message + ")" : ""));
+}
+
+// load more elaborate version of assert if available
+try { __loadScript("test_assert.js"); } catch(e) {}
+
+/*----------------*/
+
+function test_while()
+{
+    var i, c;
+    i = 0;
+    c = 0;
+    while (i < 3) {
+        c++;
+        i++;
+    }
+    assert(c === 3);
+}
+
+function test_while_break()
+{
+    var i, c;
+    i = 0;
+    c = 0;
+    while (i < 3) {
+        c++;
+        if (i == 1)
+            break;
+        i++;
+    }
+    assert(c === 2 && i === 1);
+}
+
+function test_do_while()
+{
+    var i, c;
+    i = 0;
+    c = 0;
+    do {
+        c++;
+        i++;
+    } while (i < 3);
+    assert(c === 3 && i === 3);
+}
+
+function test_for()
+{
+    var i, c;
+    c = 0;
+    for(i = 0; i < 3; i++) {
+        c++;
+    }
+    assert(c === 3 && i === 3);
+
+    c = 0;
+    for(var j = 0; j < 3; j++) {
+        c++;
+    }
+    assert(c === 3 && j === 3);
+}
+
+function test_for_in()
+{
+    var i, tab, a, b;
+
+    tab = [];
+    for(i in {x:1, y: 2}) {
+        tab.push(i);
+    }
+    assert(tab.toString(), "x,y", "for_in");
+
+    /* prototype chain test */
+    a = {x:2, y: 2, "1": 3};
+    b = {"4" : 3 };
+    Object.setPrototypeOf(a, b);
+    tab = [];
+    for(i in a) {
+        tab.push(i);
+    }
+    assert(tab.toString(), "1,x,y,4", "for_in");
+
+    /* non enumerable properties hide enumerables ones in the
+       prototype chain */
+    a = {y: 2, "1": 3};
+    Object.defineProperty(a, "x", { value: 1 });
+    b = {"x" : 3 };
+    Object.setPrototypeOf(a, b);
+    tab = [];
+    for(i in a) {
+        tab.push(i);
+    }
+    assert(tab.toString(), "1,y", "for_in");
+
+    /* array optimization */
+    a = [];
+    for(i = 0; i < 10; i++)
+        a.push(i);
+    tab = [];
+    for(i in a) {
+        tab.push(i);
+    }
+    assert(tab.toString(), "0,1,2,3,4,5,6,7,8,9", "for_in");
+
+    /* iterate with a field */
+    a={x:0};
+    tab = [];
+    for(a.x in {x:1, y: 2}) {
+        tab.push(a.x);
+    }
+    assert(tab.toString(), "x,y", "for_in");
+
+    /* iterate with a variable field */
+    a=[0];
+    tab = [];
+    for(a[0] in {x:1, y: 2}) {
+        tab.push(a[0]);
+    }
+    assert(tab.toString(), "x,y", "for_in");
+
+    /* variable definition in the for in */
+    tab = [];
+    for(var j in {x:1, y: 2}) {
+        tab.push(j);
+    }
+    assert(tab.toString(), "x,y", "for_in");
+
+    /* variable assigment in the for in */
+    tab = [];
+    for(var k = 2 in {x:1, y: 2}) {
+        tab.push(k);
+    }
+    assert(tab.toString(), "x,y", "for_in");
+}
+
+function test_for_in2()
+{
+    var i;
+    tab = [];
+    for(i in {x:1, y: 2, z:3}) {
+        if (i === "y")
+            continue;
+        tab.push(i);
+    }
+    assert(tab.toString() == "x,z");
+
+    tab = [];
+    for(i in {x:1, y: 2, z:3}) {
+        if (i === "z")
+            break;
+        tab.push(i);
+    }
+    assert(tab.toString() == "x,y");
+}
+
+function test_for_break()
+{
+    var i, c;
+    c = 0;
+    L1: for(i = 0; i < 3; i++) {
+        c++;
+        if (i == 0)
+            continue;
+        while (1) {
+            break L1;
+        }
+    }
+    assert(c === 2 && i === 1);
+}
+
+function test_switch1()
+{
+    var i, a, s;
+    s = "";
+    for(i = 0; i < 3; i++) {
+        a = "?";
+        switch(i) {
+        case 0:
+            a = "a";
+            break;
+        case 1:
+            a = "b";
+            break;
+        default:
+            a = "c";
+            break;
+        }
+        s += a;
+    }
+    assert(s === "abc" && i === 3);
+}
+
+function test_switch2()
+{
+    var i, a, s;
+    s = "";
+    for(i = 0; i < 4; i++) {
+        a = "?";
+        switch(i) {
+        case 0:
+            a = "a";
+            break;
+        case 1:
+            a = "b";
+            break;
+        case 2:
+            continue;
+        default:
+            a = "" + i;
+            break;
+        }
+        s += a;
+    }
+    assert(s === "ab3" && i === 4);
+}
+
+function test_try_catch1()
+{
+    try {
+        throw "hello";
+    } catch (e) {
+        assert(e, "hello", "catch");
+        return;
+    }
+    assert(false, "catch");
+}
+
+function test_try_catch2()
+{
+    var a;
+    try {
+        a = 1;
+    } catch (e) {
+        a = 2;
+    }
+    assert(a, 1, "catch");
+}
+
+function test_try_catch3()
+{
+    var s;
+    s = "";
+    try {
+        s += "t";
+    } catch (e) {
+        s += "c";
+    } finally {
+        s += "f";
+    }
+    assert(s, "tf", "catch");
+}
+
+function test_try_catch4()
+{
+    var s;
+    s = "";
+    try {
+        s += "t";
+        throw "c";
+    } catch (e) {
+        s += e;
+    } finally {
+        s += "f";
+    }
+    assert(s, "tcf", "catch");
+}
+
+function test_try_catch5()
+{
+    var s;
+    s = "";
+    for(;;) {
+        try {
+            s += "t";
+            break;
+            s += "b";
+        } finally {
+            s += "f";
+        }
+    }
+    assert(s, "tf", "catch");
+}
+
+function test_try_catch6()
+{
+    function f() {
+        try {
+            s += 't';
+            return 1;
+        } finally {
+            s += "f";
+        }
+    }
+    var s = "";
+    assert(f() === 1);
+    assert(s, "tf", "catch6");
+}
+
+function test_try_catch7()
+{
+    var s;
+    s = "";
+
+    try {
+        try {
+            s += "t";
+            throw "a";
+        } finally {
+            s += "f";
+        }
+    } catch(e) {
+        s += e;
+    } finally {
+        s += "g";
+    }
+    assert(s, "tfag", "catch");
+}
+
+function test_try_catch8()
+{
+    var i, s;
+    
+    s = "";
+    for(var i in {x:1, y:2}) {
+        try {
+            s += i;
+            throw "a";
+        } catch (e) {
+            s += e;
+        } finally {
+            s += "f";
+        }
+    }
+    assert(s === "xafyaf");
+}
+
+test_while();
+test_while_break();
+test_do_while();
+test_for();
+test_for_break();
+test_switch1();
+test_switch2();
+test_for_in();
+test_for_in2();
+
+test_try_catch1();
+test_try_catch2();
+test_try_catch3();
+test_try_catch4();
+test_try_catch5();
+test_try_catch6();
+test_try_catch7();
+test_try_catch8();
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_op.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_op.js
new file mode 100755
index 00000000..1b99dcc7
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_op.js
@@ -0,0 +1,302 @@
+function assert(actual, expected, message) {
+    if (arguments.length == 1)
+        expected = true;
+
+    if (actual === expected)
+        return;
+
+    if (actual !== null && expected !== null
+    &&  typeof actual == 'object' && typeof expected == 'object'
+    &&  actual.toString() === expected.toString())
+        return;
+
+    throw Error("assertion failed: got |" + actual + "|" +
+                ", expected |" + expected + "|" +
+                (message ? " (" + message + ")" : ""));
+}
+
+// load more elaborate version of assert if available
+try { __loadScript("test_assert.js"); } catch(e) {}
+
+/*----------------*/
+
+function test_op1()
+{
+    var r, a;
+    r = 1 + 2;
+    assert(r, 3, "1 + 2 === 3");
+
+    r = 1 - 2;
+    assert(r, -1, "1 - 2 === -1");
+
+    r = -1;
+    assert(r, -1, "-1 === -1");
+
+    r = +2;
+    assert(r, 2, "+2 === 2");
+
+    r = 2 * 3;
+    assert(r, 6, "2 * 3 === 6");
+
+    r = 4 / 2;
+    assert(r, 2, "4 / 2 === 2");
+
+    r = 4 % 3;
+    assert(r, 1, "4 % 3 === 3");
+
+    r = 4 << 2;
+    assert(r, 16, "4 << 2 === 16");
+
+    r = 1 << 0;
+    assert(r, 1, "1 << 0 === 1");
+
+    r = 1 << 31;
+    assert(r, -2147483648, "1 << 31 === -2147483648");
+    
+    r = 1 << 32;
+    assert(r, 1, "1 << 32 === 1");
+    
+    r = (1 << 31) < 0;
+    assert(r, true, "(1 << 31) < 0 === true");
+
+    r = -4 >> 1;
+    assert(r, -2, "-4 >> 1 === -2");
+
+    r = -4 >>> 1;
+    assert(r, 0x7ffffffe, "-4 >>> 1 === 0x7ffffffe");
+
+    r = 1 & 1;
+    assert(r, 1, "1 & 1 === 1");
+
+    r = 0 | 1;
+    assert(r, 1, "0 | 1 === 1");
+
+    r = 1 ^ 1;
+    assert(r, 0, "1 ^ 1 === 0");
+
+    r = ~1;
+    assert(r, -2, "~1 === -2");
+
+    r = !1;
+    assert(r, false, "!1 === false");
+
+    assert((1 < 2), true, "(1 < 2) === true");
+
+    assert((2 > 1), true, "(2 > 1) === true");
+
+    assert(('b' > 'a'), true, "('b' > 'a') === true");
+
+    assert(2 ** 8, 256, "2 ** 8 === 256");
+}
+
+function test_cvt()
+{
+    assert((NaN | 0) === 0);
+    assert((Infinity | 0) === 0);
+    assert(((-Infinity) | 0) === 0);
+    assert(("12345" | 0) === 12345);
+    assert(("0x12345" | 0) === 0x12345);
+    assert(((4294967296 * 3 - 4) | 0) === -4);
+    
+    assert(("12345" >>> 0) === 12345);
+    assert(("0x12345" >>> 0) === 0x12345);
+    assert((NaN >>> 0) === 0);
+    assert((Infinity >>> 0) === 0);
+    assert(((-Infinity) >>> 0) === 0);
+    assert(((4294967296 * 3 - 4) >>> 0) === (4294967296 - 4));
+}
+
+function test_eq()
+{
+    assert(null == undefined);
+    assert(undefined == null);
+    assert(true == 1);
+    assert(0 == false);
+    assert("" == 0);
+    assert("123" == 123);
+    assert("122" != 123);
+    assert((new Number(1)) == 1);
+    assert(2 == (new Number(2)));
+    assert((new String("abc")) == "abc");
+    assert({} != "abc");
+}
+
+function test_inc_dec()
+{
+    var a, r;
+    
+    a = 1;
+    r = a++;
+    assert(r === 1 && a === 2, true, "++");
+
+    a = 1;
+    r = ++a;
+    assert(r === 2 && a === 2, true, "++");
+
+    a = 1;
+    r = a--;
+    assert(r === 1 && a === 0, true, "--");
+
+    a = 1;
+    r = --a;
+    assert(r === 0 && a === 0, true, "--");
+
+    a = {x:true};
+    a.x++;
+    assert(a.x, 2, "++");
+
+    a = {x:true};
+    a.x--;
+    assert(a.x, 0, "--");
+
+    a = [true];
+    a[0]++;
+    assert(a[0], 2, "++");
+    
+    a = {x:true};
+    r = a.x++;
+    assert(r === 1 && a.x === 2, true, "++");
+    
+    a = {x:true};
+    r = a.x--;
+    assert(r === 1 && a.x === 0, true, "--");
+    
+    a = [true];
+    r = a[0]++;
+    assert(r === 1 && a[0] === 2, true, "++");
+    
+    a = [true];
+    r = a[0]--;
+    assert(r === 1 && a[0] === 0, true, "--");
+}
+
+function F(x)
+{
+    this.x = x;
+}
+
+function test_op2()
+{
+    var a, b;
+    a = new Object;
+    a.x = 1;
+    assert(a.x, 1, "new");
+    b = new F(2);
+    assert(b.x, 2, "new");
+
+    a = {x : 2};
+    assert(("x" in a), true, "in");
+    assert(("y" in a), false, "in");
+
+    a = {};
+    assert((a instanceof Object), true, "instanceof");
+    assert((a instanceof String), false, "instanceof");
+
+    assert((typeof 1), "number", "typeof");
+    assert((typeof Object), "function", "typeof");
+    assert((typeof null), "object", "typeof");
+    assert((typeof unknown_var), "undefined", "typeof");
+    
+    a = {x: 1, y: 1};
+    assert((delete a.x), true, "delete");
+    assert(("x" in a), false, "delete");
+
+    a = {x: 1, if: 2};
+    assert(a.if === 2);
+}
+
+function test_prototype()
+{
+    function f() { }
+    assert(f.prototype.constructor, f, "prototype");
+}
+
+function test_arguments()
+{
+    function f2() {
+        assert(arguments.length, 2, "arguments");
+        assert(arguments[0], 1, "arguments");
+        assert(arguments[1], 3, "arguments");
+    }
+    f2(1, 3);
+}
+
+function test_class()
+{
+    var o;
+    class C {
+        constructor() {
+            this.x = 10;
+        }
+        f() {
+            return 1;
+        }
+        static F() {
+            return -1;
+        }
+        get y() {
+            return 12;
+        }
+    };
+    class D extends C {
+        constructor() {
+            super();
+            this.z = 20;
+        }
+        g() {
+            return 2;
+        }
+        static G() {
+            return -2;
+        }
+        h() {
+            return super.f();
+        }
+        static H() {
+            return super["F"]();
+        }
+    }
+
+    assert(C.F() === -1);
+    assert(Object.getOwnPropertyDescriptor(C.prototype, "y").get.name === "get y");
+
+    o = new C();
+    assert(o.f() === 1);
+    assert(o.x === 10);
+    
+    assert(D.F() === -1);
+    assert(D.G() === -2);
+    assert(D.H() === -1);
+
+    o = new D();
+    assert(o.f() === 1);
+    assert(o.g() === 2);
+    assert(o.x === 10);
+    assert(o.z === 20);
+    assert(o.h() === 1);
+
+    /* test class name scope */
+    var E1 = class E { static F() { return E; } };
+    assert(E1 === E1.F());
+};
+
+function test_template()
+{
+    var a, b;
+    b = 123;
+    a = `abc${b}d`;
+    assert(a === "abc123d");
+
+    a = String.raw `abc${b}d`;
+    assert(a === "abc123d");
+}
+
+test_op1();
+test_cvt();
+test_eq();
+test_inc_dec();
+test_op2();
+test_prototype();
+test_arguments();
+test_class();
+test_template();
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_std.js b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_std.js
new file mode 100755
index 00000000..180a6f17
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/tests/test_std.js
@@ -0,0 +1,147 @@
+import * as std from "std";
+import * as os from "os";
+
+function assert(actual, expected, message) {
+    if (arguments.length == 1)
+        expected = true;
+
+    if (actual === expected)
+        return;
+
+    if (actual !== null && expected !== null
+    &&  typeof actual == 'object' && typeof expected == 'object'
+    &&  actual.toString() === expected.toString())
+        return;
+
+    throw Error("assertion failed: got |" + actual + "|" +
+                ", expected |" + expected + "|" +
+                (message ? " (" + message + ")" : ""));
+}
+
+// load more elaborate version of assert if available
+try { std.loadScript("test_assert.js"); } catch(e) {}
+
+/*----------------*/
+
+function test_printf()
+{
+    assert(std.sprintf("a=%d s=%s", 123, "abc"), "a=123 s=abc");
+}
+
+function test_file1()
+{
+    var f, len, str, size, buf, ret, i, str1;
+
+    f = std.tmpfile();
+    str = "hello world\n";
+    f.puts(str);
+
+    f.seek(0, std.SEEK_SET);
+    str1 = f.readAsString();
+    assert(str1 === str);
+    
+    f.seek(0, std.SEEK_END);
+    size = f.tell();
+    assert(size === str.length);
+
+    f.seek(0, std.SEEK_SET);
+
+    buf = new Uint8Array(size);
+    ret = f.read(buf.buffer, 0, size);
+    assert(ret === size);
+    for(i = 0; i < size; i++)
+        assert(buf[i] === str.charCodeAt(i));
+
+    f.close();
+}
+
+function test_file2()
+{
+    var f, str, i, size;
+    f = std.tmpfile();
+    str = "hello world\n";
+    size = str.length;
+    for(i = 0; i < size; i++)
+        f.putByte(str.charCodeAt(i));
+    f.seek(0, std.SEEK_SET);
+    for(i = 0; i < size; i++) {
+        assert(str.charCodeAt(i) === f.getByte());
+    }
+    assert(f.getByte() === -1);
+    f.close();
+}
+
+function test_getline()
+{
+    var f, line, line_count, lines, i;
+    
+    lines = ["hello world", "line 1", "line 2" ];
+    f = std.tmpfile();
+    for(i = 0; i < lines.length; i++) {
+        f.puts(lines[i], "\n");
+    }
+
+    f.seek(0, std.SEEK_SET);
+    assert(!f.eof());
+    line_count = 0;
+    for(;;) {
+        line = f.getline();
+        if (line === null)
+            break;
+        assert(line == lines[line_count]);
+        line_count++;
+    }
+    assert(f.eof());
+    assert(line_count === lines.length);
+
+    f.close();
+}
+ 
+function test_os()
+{
+    var fd, fname, buf, buf2, i;
+
+    assert(os.isatty(0));
+
+    fname = "tmp_file.txt";
+    fd = os.open(fname, os.O_RDWR | os.O_CREAT | os.O_TRUNC);
+    assert(fd >= 0);
+    
+    buf = new Uint8Array(10);
+    for(i = 0; i < buf.length; i++)
+        buf[i] = i;
+    assert(os.write(fd, buf.buffer, 0, buf.length) === buf.length);
+
+    assert(os.seek(fd, 0, os.SEEK_SET) === 0);
+    buf2 = new Uint8Array(buf.length);
+    assert(os.read(fd, buf2.buffer, 0, buf2.length) === buf2.length);
+    
+    for(i = 0; i < buf.length; i++)
+        assert(buf[i] == buf2[i]);
+    
+    assert(os.close(fd) === 0);
+
+    assert(os.remove(fname) === 0);
+
+    fd = os.open(fname, os.O_RDONLY);
+    assert(fd < 0);
+}
+
+function test_timer()
+{
+    var th, i;
+
+    /* just test that a timer can be inserted and removed */
+    th = [];
+    for(i = 0; i < 3; i++)
+        th[i] = os.setTimeout(1000, function () { });
+    for(i = 0; i < 3; i++)
+        os.clearTimeout(th[i]);
+}
+
+test_printf();
+test_file1();
+test_file2();
+test_getline();
+test_os();
+test_timer();
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/unicode_gen.c b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/unicode_gen.c
new file mode 100755
index 00000000..f99908e6
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/unicode_gen.c
@@ -0,0 +1,3056 @@
+/*
+ * Generation of Unicode tables
+ * 
+ * Copyright (c) 2017-2018 Fabrice Bellard
+ * Copyright (c) 2017-2018 Charlie Gordon
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+#include <stdlib.h>
+#include <stdio.h>
+#include <stdarg.h>
+#include <inttypes.h>
+#include <string.h>
+#include <assert.h>
+#include <ctype.h>
+#include <time.h>
+
+#include "cutils.h"
+
+/* define it to be able to test unicode.c */
+//#define USE_TEST
+/* profile tests */
+//#define PROFILE
+
+//#define DUMP_CASE_CONV_TABLE
+//#define DUMP_TABLE_SIZE
+//#define DUMP_CC_TABLE
+//#define DUMP_DECOMP_TABLE
+
+/* Ideas:
+   - Generalize run length encoding + index for all tables
+   - remove redundant tables for ID_start, ID_continue, Case_Ignorable, Cased
+
+   Case conversion:
+   - use a single entry for consecutive U/LF runs
+   - allow EXT runs of length > 1
+
+   Decomposition:
+   - Greek lower case (+1f10/1f10) ?
+   - allow holes in B runs
+   - suppress more upper / lower case redundancy
+*/
+
+#ifdef USE_TEST
+#include "libunicode.c"
+#endif
+
+#define CHARCODE_MAX 0x10ffff
+#define CC_LEN_MAX 3
+
+void *mallocz(size_t size)
+{
+    void *ptr;
+    ptr = malloc(size);
+    memset(ptr, 0, size);
+    return ptr;
+}
+
+const char *get_field(const char *p, int n)
+{
+    int i;
+    for(i = 0; i < n; i++) {
+        while (*p != ';' && *p != '\0')
+            p++;
+        if (*p == '\0')
+            return NULL;
+        p++;
+    }
+    return p;
+}
+
+const char *get_field_buf(char *buf, size_t buf_size, const char *p, int n)
+{
+    char *q;
+    p = get_field(p, n);
+    q = buf;
+    while (*p != ';' && *p != '\0') {
+        if ((q - buf) < buf_size - 1)
+            *q++ = *p;
+        p++;
+    }
+    *q = '\0';
+    return buf;
+}
+
+void add_char(int **pbuf, int *psize, int *plen, int c)
+{
+    int len, size, *buf;
+    buf = *pbuf;
+    size = *psize;
+    len = *plen;
+    if (len >= size) {
+        size = *psize;
+        size = max_int(len + 1, size * 3 / 2);
+        buf = realloc(buf, sizeof(buf[0]) * size);
+        *pbuf = buf;
+        *psize = size;
+    }
+    buf[len++] = c;
+    *plen = len;
+}
+
+int *get_field_str(int *plen, const char *str, int n)
+{
+    const char *p;
+    int *buf, len, size;
+    p = get_field(str, n);
+    if (!p) {
+        *plen = 0;
+        return NULL;
+    }
+    len = 0;
+    size = 0;
+    buf = NULL;
+    for(;;) {
+        while (isspace(*p))
+            p++;
+        if (!isxdigit(*p))
+            break;
+        add_char(&buf, &size, &len, strtoul(p, (char **)&p, 16));
+    }
+    *plen = len;
+    return buf;
+}
+
+char *get_line(char *buf, int buf_size, FILE *f)
+{
+    int len;
+    if (!fgets(buf, buf_size, f))
+        return NULL;
+    len = strlen(buf);
+    if (len > 0 && buf[len - 1] == '\n')
+        buf[len - 1] = '\0';
+    return buf;
+}
+
+#define UNICODE_GENERAL_CATEGORY
+
+typedef enum {
+#define DEF(id, str) GCAT_ ## id,
+#include "unicode_gen_def.h"
+#undef DEF
+    GCAT_COUNT,
+} UnicodeGCEnum1;
+
+static const char *unicode_gc_name[] = {
+#define DEF(id, str) #id,
+#include "unicode_gen_def.h"
+#undef DEF
+};
+
+static const char *unicode_gc_short_name[] = {
+#define DEF(id, str) str,
+#include "unicode_gen_def.h"
+#undef DEF
+};
+
+#undef UNICODE_GENERAL_CATEGORY
+
+#define UNICODE_SCRIPT
+
+typedef enum {
+#define DEF(id, str) SCRIPT_ ## id,
+#include "unicode_gen_def.h"
+#undef DEF
+    SCRIPT_COUNT,
+} UnicodeScriptEnum1;
+
+static const char *unicode_script_name[] = {
+#define DEF(id, str) #id,
+#include "unicode_gen_def.h"
+#undef DEF
+};
+
+const char *unicode_script_short_name[] = {
+#define DEF(id, str) str,
+#include "unicode_gen_def.h"
+#undef DEF
+};
+
+#undef UNICODE_SCRIPT
+
+#define UNICODE_PROP_LIST
+
+typedef enum {
+#define DEF(id, str) PROP_ ## id,
+#include "unicode_gen_def.h"
+#undef DEF
+    PROP_COUNT,
+} UnicodePropEnum1;
+
+static const char *unicode_prop_name[] = {
+#define DEF(id, str) #id,
+#include "unicode_gen_def.h"
+#undef DEF
+};
+
+static const char *unicode_prop_short_name[] = {
+#define DEF(id, str) str,
+#include "unicode_gen_def.h"
+#undef DEF
+};
+
+#undef UNICODE_SPROP_LIST
+
+typedef struct {
+    /* case conv */
+    uint8_t u_len;
+    uint8_t l_len;
+    int u_data[CC_LEN_MAX];
+    int l_data[CC_LEN_MAX];
+    int f_code;
+
+    uint8_t combining_class;
+    uint8_t is_compat:1;
+    uint8_t is_excluded:1;
+    uint8_t general_category;
+    uint8_t script;
+    uint8_t script_ext_len;
+    uint8_t *script_ext;
+    uint32_t prop_bitmap_tab[3];
+    /* decomposition */
+    int decomp_len;
+    int *decomp_data;
+} CCInfo;
+
+CCInfo *unicode_db;
+
+int find_name(const char **tab, int tab_len, const char *name)
+{
+    int i, len, name_len;
+    const char *p, *r;
+
+    name_len = strlen(name);
+    for(i = 0; i < tab_len; i++) {
+        p = tab[i];
+        for(;;) {
+            r = strchr(p, ',');
+            if (!r)
+                len = strlen(p);
+            else
+                len = r - p;
+            if (len == name_len && memcmp(p, name, len) == 0)
+                return i;
+            if (!r)
+                break;
+            p = r + 1;
+        }
+    }
+    return -1;
+}
+
+static int get_prop(uint32_t c, int prop_idx)
+{
+    return (unicode_db[c].prop_bitmap_tab[prop_idx >> 5] >> (prop_idx & 0x1f)) & 1;
+}
+
+static void set_prop(uint32_t c, int prop_idx, int val)
+{
+    uint32_t mask;
+    mask = 1U << (prop_idx & 0x1f);
+    if (val)
+        unicode_db[c].prop_bitmap_tab[prop_idx >> 5] |= mask;
+    else
+        unicode_db[c].prop_bitmap_tab[prop_idx >> 5]  &= ~mask;
+}
+
+void parse_unicode_data(const char *filename)
+{
+    FILE *f;
+    char line[1024];
+    char buf1[256];
+    const char *p;
+    int code, lc, uc, last_code;
+    CCInfo *ci, *tab = unicode_db;
+    
+    f = fopen(filename, "rb");
+    if (!f) {
+        perror(filename);
+        exit(1);
+    }
+
+    for(;;) {
+        if (!get_line(line, sizeof(line), f))
+            break;
+        p = line;
+        while (isspace(*p))
+            p++;
+        if (*p == '#')
+            continue;
+
+        p = get_field(line, 0);
+        if (!p)
+            continue;
+        code = strtoul(p, NULL, 16);
+        lc = 0;
+        uc = 0;
+        
+        p = get_field(line, 12);
+        if (p && *p != ';') {
+            uc = strtoul(p, NULL, 16);
+        }
+
+        p = get_field(line, 13);
+        if (p && *p != ';') {
+            lc = strtoul(p, NULL, 16);
+        }
+        ci = &tab[code];
+        if (uc > 0 || lc > 0) {
+            assert(code <= CHARCODE_MAX);
+            if (uc > 0) {
+                assert(ci->u_len == 0);
+                ci->u_len = 1;
+                ci->u_data[0] = uc;
+            }
+            if (lc > 0) {
+                assert(ci->l_len == 0);
+                ci->l_len = 1;
+                ci->l_data[0] = lc;
+            }
+        }
+
+        {
+            int i;
+            get_field_buf(buf1, sizeof(buf1), line, 2);
+            i = find_name(unicode_gc_name, countof(unicode_gc_name), buf1);
+            if (i < 0) {
+                fprintf(stderr, "General category '%s' not found\n",
+                        buf1);
+                exit(1);
+            }
+            ci->general_category = i;
+        }
+        
+        p = get_field(line, 3);
+        if (p && *p != ';' && *p != '\0') {
+            int cc;
+            cc = strtoul(p, NULL, 0);
+            if (cc != 0) {
+                assert(code <= CHARCODE_MAX);
+                ci->combining_class = cc;
+                //                printf("%05x: %d\n", code, ci->combining_class);
+            }
+        }
+
+        p = get_field(line, 5);
+        if (p && *p != ';' && *p != '\0') {
+            int size;
+            assert(code <= CHARCODE_MAX);
+            ci->is_compat = 0;
+            if (*p == '<') {
+                while (*p != '\0' && *p != '>')
+                    p++;
+                if (*p == '>')
+                    p++;
+                ci->is_compat = 1;
+            }
+            size = 0;
+            for(;;) {
+                while (isspace(*p))
+                    p++;
+                if (!isxdigit(*p))
+                    break;
+                add_char(&ci->decomp_data, &size, &ci->decomp_len, strtoul(p, (char **)&p, 16));
+            }
+#if 0
+            {
+                int i;
+                static int count, d_count;
+
+                printf("%05x: %c", code, ci->is_compat ? 'C': ' ');
+                for(i = 0; i < ci->decomp_len; i++)
+                    printf(" %05x", ci->decomp_data[i]);
+                printf("\n");
+                count++;
+                d_count += ci->decomp_len;
+                //                printf("%d %d\n", count, d_count);
+            }
+#endif
+        }
+
+        p = get_field(line, 9);
+        if (p && *p == 'Y') {
+            set_prop(code, PROP_Bidi_Mirrored, 1);
+        }
+        
+        /* handle ranges */
+        get_field_buf(buf1, sizeof(buf1), line, 1);
+        if (strstr(buf1, " Last>")) {
+            int i;
+            //            printf("range: 0x%x-%0x\n", last_code, code);
+            assert(ci->decomp_len == 0);
+            assert(ci->script_ext_len == 0);
+            for(i = last_code + 1; i < code; i++) {
+                unicode_db[i] = *ci;
+            }
+        }
+        last_code = code;
+    }
+        
+    fclose(f);
+}
+
+void parse_special_casing(CCInfo *tab, const char *filename)
+{
+    FILE *f;
+    char line[1024];
+    const char *p;
+    int code;
+    CCInfo *ci;
+    
+    f = fopen(filename, "rb");
+    if (!f) {
+        perror(filename);
+        exit(1);
+    }
+
+    for(;;) {
+        if (!get_line(line, sizeof(line), f))
+            break;
+        p = line;
+        while (isspace(*p))
+            p++;
+        if (*p == '#')
+            continue;
+
+        p = get_field(line, 0);
+        if (!p)
+            continue;
+        code = strtoul(p, NULL, 16);
+        assert(code <= CHARCODE_MAX);
+        ci = &tab[code];
+
+        p = get_field(line, 4);
+        if (p) {
+            /* locale dependent casing */
+            while (isspace(*p))
+                p++;
+            if (*p != '#' && *p != '\0')
+                continue;
+        }
+            
+        
+        p = get_field(line, 1);
+        if (p && *p != ';') {
+            ci->l_len = 0;
+            for(;;) {
+                while (isspace(*p))
+                    p++;
+                if (*p == ';')
+                    break;
+                assert(ci->l_len < CC_LEN_MAX);
+                ci->l_data[ci->l_len++] = strtoul(p, (char **)&p, 16);
+            }
+
+            if (ci->l_len == 1 && ci->l_data[0] == code)
+                ci->l_len = 0;
+        }
+
+        p = get_field(line, 3);
+        if (p && *p != ';') {
+            ci->u_len = 0;
+            for(;;) {
+                while (isspace(*p))
+                    p++;
+                if (*p == ';')
+                    break;
+                assert(ci->u_len < CC_LEN_MAX);
+                ci->u_data[ci->u_len++] = strtoul(p, (char **)&p, 16);
+            }
+
+            if (ci->u_len == 1 && ci->u_data[0] == code)
+                ci->u_len = 0;
+        }
+    }
+        
+    fclose(f);
+}
+
+void parse_case_folding(CCInfo *tab, const char *filename)
+{
+    FILE *f;
+    char line[1024];
+    const char *p;
+    int code;
+    CCInfo *ci;
+    
+    f = fopen(filename, "rb");
+    if (!f) {
+        perror(filename);
+        exit(1);
+    }
+
+    for(;;) {
+        if (!get_line(line, sizeof(line), f))
+            break;
+        p = line;
+        while (isspace(*p))
+            p++;
+        if (*p == '#')
+            continue;
+
+        p = get_field(line, 0);
+        if (!p)
+            continue;
+        code = strtoul(p, NULL, 16);
+        assert(code <= CHARCODE_MAX);
+        ci = &tab[code];
+
+        p = get_field(line, 1);
+        if (!p)
+            continue;
+        /* locale dependent casing */
+        while (isspace(*p))
+            p++;
+        if (*p != 'C' && *p != 'S')
+            continue;
+        
+        p = get_field(line, 2);
+        assert(p != 0);
+        assert(ci->f_code == 0);
+        ci->f_code = strtoul(p, NULL, 16);
+        assert(ci->f_code != 0 && ci->f_code != code);
+    }
+        
+    fclose(f);
+}
+
+void parse_composition_exclusions(const char *filename)
+{
+    FILE *f;
+    char line[4096], *p;
+    uint32_t c0;
+    
+    f = fopen(filename, "rb");
+    if (!f) {
+        perror(filename);
+        exit(1);
+    }
+
+    for(;;) {
+        if (!get_line(line, sizeof(line), f))
+            break;
+        p = line;
+        while (isspace(*p))
+            p++;
+        if (*p == '#' || *p == '@' || *p == '\0')
+            continue;
+        c0 = strtoul(p, (char **)&p, 16);
+        assert(c0 > 0 && c0 <= CHARCODE_MAX);
+        unicode_db[c0].is_excluded = TRUE;
+    }
+    fclose(f);
+}
+
+void parse_derived_core_properties(const char *filename)
+{
+    FILE *f;
+    char line[4096], *p, buf[256], *q;
+    uint32_t c0, c1, c;
+    int i;
+    
+    f = fopen(filename, "rb");
+    if (!f) {
+        perror(filename);
+        exit(1);
+    }
+
+    for(;;) {
+        if (!get_line(line, sizeof(line), f))
+            break;
+        p = line;
+        while (isspace(*p))
+            p++;
+        if (*p == '#' || *p == '@' || *p == '\0')
+            continue;
+        c0 = strtoul(p, (char **)&p, 16);
+        if (*p == '.' && p[1] == '.') {
+            p += 2;
+            c1 = strtoul(p, (char **)&p, 16);
+        } else {
+            c1 = c0;
+        }
+        assert(c1 <= CHARCODE_MAX);
+        p += strspn(p, " \t");
+        if (*p == ';') {
+            p++;
+            p += strspn(p, " \t");
+            q = buf;
+            while (*p != '\0' && *p != ' ' && *p != '#' && *p != '\t') {
+                if ((q - buf) < sizeof(buf) - 1)
+                    *q++ = *p;
+                p++;
+            }
+            *q = '\0';
+            i = find_name(unicode_prop_name,
+                          countof(unicode_prop_name), buf);
+            if (i < 0) {
+                if (!strcmp(buf, "Grapheme_Link"))
+                    goto next;
+                fprintf(stderr, "Property not found: %s\n", buf);
+                exit(1);
+            }
+            for(c = c0; c <= c1; c++) {
+                set_prop(c, i, 1);
+            }
+next: ;
+        }
+    }
+    fclose(f);
+}
+
+void parse_derived_norm_properties(const char *filename)
+{
+    FILE *f;
+    char line[4096], *p, buf[256], *q;
+    uint32_t c0, c1, c;
+    
+    f = fopen(filename, "rb");
+    if (!f) {
+        perror(filename);
+        exit(1);
+    }
+
+    for(;;) {
+        if (!get_line(line, sizeof(line), f))
+            break;
+        p = line;
+        while (isspace(*p))
+            p++;
+        if (*p == '#' || *p == '@' || *p == '\0')
+            continue;
+        c0 = strtoul(p, (char **)&p, 16);
+        if (*p == '.' && p[1] == '.') {
+            p += 2;
+            c1 = strtoul(p, (char **)&p, 16);
+        } else {
+            c1 = c0;
+        }
+        assert(c1 <= CHARCODE_MAX);
+        p += strspn(p, " \t");
+        if (*p == ';') {
+            p++;
+            p += strspn(p, " \t");
+            q = buf;
+            while (*p != '\0' && *p != ' ' && *p != '#' && *p != '\t') {
+                if ((q - buf) < sizeof(buf) - 1)
+                    *q++ = *p;
+                p++;
+            }
+            *q = '\0';
+            if (!strcmp(buf, "Changes_When_NFKC_Casefolded")) {
+                for(c = c0; c <= c1; c++) {
+                    set_prop(c, PROP_Changes_When_NFKC_Casefolded, 1);
+                }
+            }
+        }
+    }
+    fclose(f);
+}
+
+void parse_prop_list(const char *filename)
+{
+    FILE *f;
+    char line[4096], *p, buf[256], *q;
+    uint32_t c0, c1, c;
+    int i;
+    
+    f = fopen(filename, "rb");
+    if (!f) {
+        perror(filename);
+        exit(1);
+    }
+
+    for(;;) {
+        if (!get_line(line, sizeof(line), f))
+            break;
+        p = line;
+        while (isspace(*p))
+            p++;
+        if (*p == '#' || *p == '@' || *p == '\0')
+            continue;
+        c0 = strtoul(p, (char **)&p, 16);
+        if (*p == '.' && p[1] == '.') {
+            p += 2;
+            c1 = strtoul(p, (char **)&p, 16);
+        } else {
+            c1 = c0;
+        }
+        assert(c1 <= CHARCODE_MAX);
+        p += strspn(p, " \t");
+        if (*p == ';') {
+            p++;
+            p += strspn(p, " \t");
+            q = buf;
+            while (*p != '\0' && *p != ' ' && *p != '#' && *p != '\t') {
+                if ((q - buf) < sizeof(buf) - 1)
+                    *q++ = *p;
+                p++;
+            }
+            *q = '\0';
+            i = find_name(unicode_prop_name,
+                          countof(unicode_prop_name), buf);
+            if (i < 0) {
+                fprintf(stderr, "Property not found: %s\n", buf);
+                exit(1);
+            }
+            for(c = c0; c <= c1; c++) {
+                set_prop(c, i, 1);
+            }
+        }
+    }
+    fclose(f);
+}
+
+void parse_scripts(const char *filename)
+{
+    FILE *f;
+    char line[4096], *p, buf[256], *q;
+    uint32_t c0, c1, c;
+    int i;
+    
+    f = fopen(filename, "rb");
+    if (!f) {
+        perror(filename);
+        exit(1);
+    }
+
+    for(;;) {
+        if (!get_line(line, sizeof(line), f))
+            break;
+        p = line;
+        while (isspace(*p))
+            p++;
+        if (*p == '#' || *p == '@' || *p == '\0')
+            continue;
+        c0 = strtoul(p, (char **)&p, 16);
+        if (*p == '.' && p[1] == '.') {
+            p += 2;
+            c1 = strtoul(p, (char **)&p, 16);
+        } else {
+            c1 = c0;
+        }
+        assert(c1 <= CHARCODE_MAX);
+        p += strspn(p, " \t");
+        if (*p == ';') {
+            p++;
+            p += strspn(p, " \t");
+            q = buf;
+            while (*p != '\0' && *p != ' ' && *p != '#' && *p != '\t') {
+                if ((q - buf) < sizeof(buf) - 1)
+                    *q++ = *p;
+                p++;
+            }
+            *q = '\0';
+            i = find_name(unicode_script_name,
+                          countof(unicode_script_name), buf);
+            if (i < 0) {
+                fprintf(stderr, "Unknown script: '%s'\n", buf);
+                exit(1);
+            }
+            for(c = c0; c <= c1; c++)
+                unicode_db[c].script = i;
+        }
+    }
+    fclose(f);
+}
+
+void parse_script_extensions(const char *filename)
+{
+    FILE *f;
+    char line[4096], *p, buf[256], *q;
+    uint32_t c0, c1, c;
+    int i;
+    uint8_t script_ext[255];
+    int script_ext_len;
+    
+    f = fopen(filename, "rb");
+    if (!f) {
+        perror(filename);
+        exit(1);
+    }
+
+    for(;;) {
+        if (!get_line(line, sizeof(line), f))
+            break;
+        p = line;
+        while (isspace(*p))
+            p++;
+        if (*p == '#' || *p == '@' || *p == '\0')
+            continue;
+        c0 = strtoul(p, (char **)&p, 16);
+        if (*p == '.' && p[1] == '.') {
+            p += 2;
+            c1 = strtoul(p, (char **)&p, 16);
+        } else {
+            c1 = c0;
+        }
+        assert(c1 <= CHARCODE_MAX);
+        p += strspn(p, " \t");
+        script_ext_len = 0;
+        if (*p == ';') {
+            p++;
+            for(;;) {
+                p += strspn(p, " \t");
+                q = buf;
+                while (*p != '\0' && *p != ' ' && *p != '#' && *p != '\t') {
+                    if ((q - buf) < sizeof(buf) - 1)
+                        *q++ = *p;
+                    p++;
+                }
+                *q = '\0';
+                if (buf[0] == '\0')
+                    break;
+                i = find_name(unicode_script_short_name,
+                              countof(unicode_script_short_name), buf);
+                if (i < 0) {
+                    fprintf(stderr, "Script not found: %s\n", buf);
+                    exit(1);
+                }
+                assert(script_ext_len < sizeof(script_ext));
+                script_ext[script_ext_len++] = i;
+            }
+            for(c = c0; c <= c1; c++) {
+                CCInfo *ci = &unicode_db[c];
+                ci->script_ext_len = script_ext_len;
+                ci->script_ext = malloc(sizeof(ci->script_ext[0]) * script_ext_len);
+                for(i = 0; i < script_ext_len; i++)
+                    ci->script_ext[i] = script_ext[i];
+            }
+        }
+    }
+    fclose(f);
+}
+
+void dump_cc_info(CCInfo *ci, int i)
+{
+    int j;
+    printf("%05x:", i);
+    if (ci->u_len != 0) {
+        printf(" U:");
+        for(j = 0; j < ci->u_len; j++)
+            printf(" %05x", ci->u_data[j]);
+    }
+    if (ci->l_len != 0) {
+        printf(" L:");
+        for(j = 0; j < ci->l_len; j++)
+            printf(" %05x", ci->l_data[j]);
+    }
+    if (ci->f_code != 0) {
+        printf(" F: %05x", ci->f_code);
+    }
+    printf("\n");
+}
+
+void dump_data(CCInfo *tab)
+{
+    int i;
+    CCInfo *ci;
+    for(i = 0; i <= CHARCODE_MAX; i++) {
+        ci = &tab[i];
+        if (ci->u_len != 0 || ci->l_len != 0 || ci->f_code != 0) {
+            dump_cc_info(ci, i);
+        }
+    }
+}
+
+BOOL is_complicated_case(const CCInfo *ci)
+{
+    return (ci->u_len > 1 || ci->l_len > 1 ||
+            (ci->u_len > 0 && ci->l_len > 0) ||
+            (ci->f_code != 0) != ci->l_len ||
+            (ci->f_code != 0 && ci->l_data[0] != ci->f_code));
+}
+
+#ifndef USE_TEST
+enum {
+    RUN_TYPE_U,
+    RUN_TYPE_L,
+    RUN_TYPE_UF,
+    RUN_TYPE_LF,
+    RUN_TYPE_UL,
+    RUN_TYPE_LSU,
+    RUN_TYPE_U2L_399_EXT2,
+    RUN_TYPE_UF_D20,
+    RUN_TYPE_UF_D1_EXT,
+    RUN_TYPE_U_EXT,
+    RUN_TYPE_LF_EXT,
+    RUN_TYPE_U_EXT2,
+    RUN_TYPE_L_EXT2,
+    RUN_TYPE_U_EXT3,
+};
+#endif
+
+const char *run_type_str[] = {
+    "U",
+    "L",
+    "UF",
+    "LF",
+    "UL",
+    "LSU",
+    "U2L_399_EXT2",
+    "UF_D20",
+    "UF_D1_EXT",
+    "U_EXT",
+    "LF_EXT",
+    "U_EXT2",
+    "L_EXT2",
+    "U_EXT3",
+};
+
+typedef struct {
+    int code;
+    int len;
+    int type;
+    int data;
+    int ext_len;
+    int ext_data[3];
+    int data_index; /* 'data' coming from the table */
+} TableEntry;
+
+/* code (17), len (7), type (4) */
+
+void find_run_type(TableEntry *te, CCInfo *tab, int code)
+{
+    int is_lower, len;
+    CCInfo *ci, *ci1, *ci2;
+
+    ci = &tab[code];
+    ci1 = &tab[code + 1];
+    ci2 = &tab[code + 2];
+    te->code = code;
+    
+    if (ci->l_len == 1 && ci->l_data[0] == code + 2 &&
+        ci->f_code == ci->l_data[0] &&
+        ci->u_len == 0 &&
+
+        ci1->l_len == 1 && ci1->l_data[0] == code + 2 &&
+        ci1->f_code == ci1->l_data[0] &&
+        ci1->u_len == 1 && ci1->u_data[0] == code &&
+
+        ci2->l_len == 0 &&
+        ci2->f_code == 0 &&
+        ci2->u_len == 1 && ci2->u_data[0] == code) {
+        te->len = 3;
+        te->data = 0;
+        te->type = RUN_TYPE_LSU;
+        return;
+    }
+
+    if (is_complicated_case(ci)) {
+        len = 1;
+        while (code + len <= CHARCODE_MAX) {
+            ci1 = &tab[code + len];
+            if (ci1->u_len != 1 ||
+                ci1->u_data[0] != ci->u_data[0] + len ||
+                ci1->l_len != 0 ||
+                ci1->f_code != ci1->u_data[0])
+                break;
+            len++;
+        }
+        if (len > 1) {
+            te->len = len;
+            te->type = RUN_TYPE_UF;
+            te->data = ci->u_data[0];
+            return;
+        }
+
+        if (ci->u_len == 2 && ci->u_data[1] == 0x399 &&
+            ci->f_code == 0 && ci->l_len == 0) {
+            len = 1;
+            while (code + len <= CHARCODE_MAX) {
+                ci1 = &tab[code + len];
+                if (!(ci1->u_len == 2 &&
+                    ci1->u_data[1] == 0x399 &&
+                      ci1->u_data[0] == ci->u_data[0] + len &&
+                      ci1->f_code == 0 &&
+                      ci1->l_len == 0))
+                    break;
+                len++;
+            }
+            te->len = len;
+            te->type = RUN_TYPE_U_EXT2;
+            te->ext_data[0] = ci->u_data[0];
+            te->ext_data[1] = ci->u_data[1];
+            te->ext_len = 2;
+            return;
+        }
+
+        if (ci->u_len == 2 && ci->u_data[1] == 0x399 &&
+            ci->l_len == 1 && ci->f_code == ci->l_data[0]) {
+            len = 1;
+            while (code + len <= CHARCODE_MAX) {
+                ci1 = &tab[code + len];
+                if (!(ci1->u_len == 2 &&
+                      ci1->u_data[1] == 0x399 &&
+                      ci1->u_data[0] == ci->u_data[0] + len &&
+                      ci1->l_len == 1 &&
+                      ci1->l_data[0] == ci->l_data[0] + len &&
+                      ci1->f_code == ci1->l_data[0]))
+                    break;
+                len++;
+            }
+            te->len = len;
+            te->type = RUN_TYPE_U2L_399_EXT2;
+            te->ext_data[0] = ci->u_data[0];
+            te->ext_data[1] = ci->l_data[0];
+            te->ext_len = 2;
+            return;
+        }
+
+        if (ci->l_len == 1 && ci->u_len == 0 && ci->f_code == 0) {
+            len = 1;
+            while (code + len <= CHARCODE_MAX) {
+                ci1 = &tab[code + len];
+                if (!(ci1->l_len == 1 &&
+                      ci1->l_data[0] == ci->l_data[0] + len &&
+                      ci1->u_len == 0 && ci1->f_code == 0))
+                    break;
+                len++;
+            }
+            te->len = len;
+            te->type = RUN_TYPE_L;
+            te->data = ci->l_data[0];
+            return;
+        }
+
+        if (ci->l_len == 0 &&
+            ci->u_len == 1 &&
+            ci->u_data[0] < 0x1000 &&
+            ci->f_code == ci->u_data[0] + 0x20) {
+            te->len = 1;
+            te->type = RUN_TYPE_UF_D20;
+            te->data = ci->u_data[0];
+        } else if (ci->l_len == 0 &&
+            ci->u_len == 1 &&
+            ci->f_code == ci->u_data[0] + 1) {
+            te->len = 1;
+            te->type = RUN_TYPE_UF_D1_EXT;
+            te->ext_data[0] = ci->u_data[0];
+            te->ext_len = 1;
+        } else if (ci->l_len == 2 && ci->u_len == 0 && ci->f_code == 0) {
+            te->len = 1;
+            te->type = RUN_TYPE_L_EXT2;
+            te->ext_data[0] = ci->l_data[0];
+            te->ext_data[1] = ci->l_data[1];
+            te->ext_len = 2;
+        } else if (ci->u_len == 2 && ci->l_len == 0 && ci->f_code == 0) {
+            te->len = 1;
+            te->type = RUN_TYPE_U_EXT2;
+            te->ext_data[0] = ci->u_data[0];
+            te->ext_data[1] = ci->u_data[1];
+            te->ext_len = 2;
+        } else if (ci->u_len == 3 && ci->l_len == 0 && ci->f_code == 0) {
+            te->len = 1;
+            te->type = RUN_TYPE_U_EXT3;
+            te->ext_data[0] = ci->u_data[0];
+            te->ext_data[1] = ci->u_data[1];
+            te->ext_data[2] = ci->u_data[2];
+            te->ext_len = 3;
+        } else {
+            printf("unsupported encoding case:\n");
+            dump_cc_info(ci, code);
+            abort();
+        }
+    } else {
+        /* look for a run of identical conversions */
+        len = 0;
+        for(;;) {
+            if (code >= CHARCODE_MAX || len >= 126)
+                break;
+            ci = &tab[code + len];
+            ci1 = &tab[code + len + 1];
+            if (is_complicated_case(ci) || is_complicated_case(ci1)) {
+                break;
+            }
+            if (ci->l_len != 1 || ci->l_data[0] != code + len + 1)
+                break;
+            if (ci1->u_len != 1 || ci1->u_data[0] != code + len)
+                break;
+            len += 2;
+        }
+        if (len > 0) {
+            te->len = len;
+            te->type = RUN_TYPE_UL;
+            te->data = 0;
+            return;
+        }
+        
+        ci = &tab[code];
+        is_lower = ci->l_len > 0;
+        len = 1;
+        while (code + len <= CHARCODE_MAX) {
+            ci1 = &tab[code + len];
+            if (is_complicated_case(ci1))
+                break;
+            if (is_lower) {
+                if (ci1->l_len != 1 ||
+                    ci1->l_data[0] != ci->l_data[0] + len)
+                    break;
+            } else {
+                if (ci1->u_len != 1 ||
+                    ci1->u_data[0] != ci->u_data[0] + len)
+                    break;
+            }
+            len++;
+        }
+        te->len = len;
+        if (is_lower) {
+            te->type = RUN_TYPE_LF;
+            te->data = ci->l_data[0];
+        } else {
+            te->type = RUN_TYPE_U;
+            te->data = ci->u_data[0];
+        }
+    }
+}
+
+TableEntry conv_table[1000];
+int conv_table_len;
+int ext_data[1000];
+int ext_data_len;
+
+void dump_case_conv_table1(void)
+{
+    int i, j;
+    const TableEntry *te;
+
+    for(i = 0; i < conv_table_len; i++) {
+        te = &conv_table[i];
+        printf("%05x %02x %-10s %05x",
+               te->code, te->len, run_type_str[te->type], te->data);
+        for(j = 0; j < te->ext_len; j++) {
+            printf(" %05x", te->ext_data[j]);
+        }
+        printf("\n");
+    }
+    printf("table_len=%d ext_len=%d\n", conv_table_len, ext_data_len);
+}
+
+int find_data_index(const TableEntry *conv_table, int len, int data)
+{
+    int i;
+    const TableEntry *te;
+    for(i = 0; i < len; i++) {
+        te = &conv_table[i];
+        if (te->code == data)
+            return i;
+    }
+    return -1;
+}
+
+int find_ext_data_index(int data)
+{
+    int i;
+    for(i = 0; i < ext_data_len; i++) {
+        if (ext_data[i] == data)
+            return i;
+    }
+    assert(ext_data_len < countof(ext_data));
+    ext_data[ext_data_len++] = data;
+    return ext_data_len - 1;
+}
+
+void build_conv_table(CCInfo *tab)
+{
+    int code, i, j;
+    CCInfo *ci;
+    TableEntry *te;
+                          
+    te = conv_table;
+    for(code = 0; code <= CHARCODE_MAX; code++) {
+        ci = &tab[code];
+        if (ci->u_len == 0 && ci->l_len == 0 && ci->f_code == 0)
+            continue;
+        assert(te - conv_table < countof(conv_table));
+        find_run_type(te, tab, code);
+#if 0
+        if (te->type == RUN_TYPE_TODO) {
+            printf("TODO: ");
+            dump_cc_info(ci, code);
+        }
+#endif
+        assert(te->len <= 127);
+        code += te->len - 1;
+        te++;
+    }
+    conv_table_len = te - conv_table;
+
+    /* find the data index */
+    for(i = 0; i < conv_table_len; i++) {
+        int data_index;
+        te = &conv_table[i];
+        
+        switch(te->type) {
+        case RUN_TYPE_U:
+        case RUN_TYPE_L:
+        case RUN_TYPE_UF:
+        case RUN_TYPE_LF:
+            data_index = find_data_index(conv_table, conv_table_len, te->data);
+            if (data_index < 0) {
+                switch(te->type) {
+                case RUN_TYPE_U:
+                    te->type = RUN_TYPE_U_EXT;
+                    te->ext_len = 1;
+                    te->ext_data[0] = te->data;
+                    break;
+                case RUN_TYPE_LF:
+                    te->type = RUN_TYPE_LF_EXT;
+                    te->ext_len = 1;
+                    te->ext_data[0] = te->data;
+                    break;
+                default:
+                    printf("%05x: index not found\n", te->code);
+                    exit(1);
+                }
+            } else {
+                te->data_index = data_index;
+            }
+            break;
+        case RUN_TYPE_UF_D20:
+            te->data_index = te->data;
+            break;
+        }
+    }
+
+    /* find the data index for ext_data */
+    for(i = 0; i < conv_table_len; i++) {
+        te = &conv_table[i];
+        if (te->type == RUN_TYPE_U_EXT3) {
+            int p, v;
+            v = 0;
+            for(j = 0; j < 3; j++) {
+                p = find_ext_data_index(te->ext_data[j]);
+                assert(p < 16);
+                v = (v << 4) | p;
+            }
+            te->data_index = v;
+        }
+    }
+
+    for(i = 0; i < conv_table_len; i++) {
+        te = &conv_table[i];
+        if (te->type == RUN_TYPE_L_EXT2 ||
+            te->type == RUN_TYPE_U_EXT2 ||
+            te->type == RUN_TYPE_U2L_399_EXT2) {
+            int p, v;
+            v = 0;
+            for(j = 0; j < 2; j++) {
+                p = find_ext_data_index(te->ext_data[j]);
+                assert(p < 64);
+                v = (v << 6) | p;
+            }
+            te->data_index = v;
+        }
+    }
+
+    for(i = 0; i < conv_table_len; i++) {
+        te = &conv_table[i];
+        if (te->type == RUN_TYPE_UF_D1_EXT ||
+            te->type == RUN_TYPE_U_EXT ||
+            te->type == RUN_TYPE_LF_EXT) {
+            te->data_index = find_ext_data_index(te->ext_data[0]);
+        }
+    }
+#ifdef DUMP_CASE_CONV_TABLE
+    dump_case_conv_table1();
+#endif
+}
+
+void dump_case_conv_table(FILE *f)
+{
+    int i;
+    uint32_t v;
+    const TableEntry *te;
+
+    fprintf(f, "static const uint32_t case_conv_table1[%u] = {", conv_table_len);
+    for(i = 0; i < conv_table_len; i++) {
+        if (i % 4 == 0)
+            fprintf(f, "\n   ");
+        te = &conv_table[i];
+        v = te->code << (32 - 17);
+        v |= te->len << (32 - 17 - 7);
+        v |= te->type << (32 - 17 - 7 - 4);
+        v |= te->data_index >> 8;
+        fprintf(f, " 0x%08x,", v);
+    }
+    fprintf(f, "\n};\n\n");
+
+    fprintf(f, "static const uint8_t case_conv_table2[%u] = {", conv_table_len);
+    for(i = 0; i < conv_table_len; i++) {
+        if (i % 8 == 0)
+            fprintf(f, "\n   ");
+        te = &conv_table[i];
+        fprintf(f, " 0x%02x,", te->data_index & 0xff);
+    }
+    fprintf(f, "\n};\n\n");
+
+    fprintf(f, "static const uint16_t case_conv_ext[%u] = {", ext_data_len);
+    for(i = 0; i < ext_data_len; i++) {
+        if (i % 8 == 0)
+            fprintf(f, "\n   ");
+        fprintf(f, " 0x%04x,", ext_data[i]);
+    }
+    fprintf(f, "\n};\n\n");
+}
+
+int tabcmp(const int *tab1, const int *tab2, int n)
+{
+    int i;
+    for(i = 0; i < n; i++) {
+        if (tab1[i] != tab2[i])
+            return -1;
+    }
+    return 0;
+}
+
+void dump_str(const char *str, const int *buf, int len)
+{
+    int i;
+    printf("%s=", str);
+    for(i = 0; i < len; i++)
+        printf(" %05x", buf[i]);
+    printf("\n");
+}
+
+void compute_internal_props(void)
+{
+    int i;
+    BOOL has_ul;
+
+    for(i = 0; i <= CHARCODE_MAX; i++) {
+        CCInfo *ci = &unicode_db[i];
+        has_ul = (ci->u_len != 0 || ci->l_len != 0 || ci->f_code != 0);
+        if (has_ul) {
+            assert(get_prop(i, PROP_Cased));
+        } else {
+            set_prop(i, PROP_Cased1, get_prop(i, PROP_Cased));
+        }
+        set_prop(i, PROP_ID_Continue1,
+                 get_prop(i, PROP_ID_Continue) & (get_prop(i, PROP_ID_Start) ^ 1));
+        set_prop(i, PROP_XID_Start1,
+                 get_prop(i, PROP_ID_Start) ^ get_prop(i, PROP_XID_Start));
+        set_prop(i, PROP_XID_Continue1,
+                 get_prop(i, PROP_ID_Continue) ^ get_prop(i, PROP_XID_Continue));
+        set_prop(i, PROP_Changes_When_Titlecased1,
+                 get_prop(i, PROP_Changes_When_Titlecased) ^ (ci->u_len != 0));
+        set_prop(i, PROP_Changes_When_Casefolded1,
+                 get_prop(i, PROP_Changes_When_Casefolded) ^ (ci->f_code != 0));
+        /* XXX: reduce table size (438 bytes) */
+        set_prop(i, PROP_Changes_When_NFKC_Casefolded1,
+                 get_prop(i, PROP_Changes_When_NFKC_Casefolded) ^ (ci->f_code != 0));
+#if 0
+        /* TEST */
+#define M(x) (1U << GCAT_ ## x)
+        {
+            int b;
+            b = ((M(Mn) | M(Cf) | M(Lm) | M(Sk)) >>
+                 unicode_db[i].general_category) & 1;
+            set_prop(i, PROP_Cased1,
+                     get_prop(i, PROP_Case_Ignorable) ^ b);
+        }
+#undef M
+#endif
+    }
+}
+
+void dump_byte_table(FILE *f, const char *cname, const uint8_t *tab, int len)
+{
+    int i;
+    fprintf(f, "static const uint8_t %s[%d] = {", cname, len);
+    for(i = 0; i < len; i++) {
+        if (i % 8 == 0)
+            fprintf(f, "\n   ");
+        fprintf(f, " 0x%02x,", tab[i]);
+    }
+    fprintf(f, "\n};\n\n");
+}
+
+#define PROP_BLOCK_LEN 32
+
+void build_prop_table(FILE *f, int prop_index, BOOL add_index)
+{
+    int i, j, n, v, offset, code;
+    DynBuf dbuf_s, *dbuf = &dbuf_s;
+    DynBuf dbuf1_s, *dbuf1 = &dbuf1_s;
+    DynBuf dbuf2_s, *dbuf2 = &dbuf2_s;
+    const uint32_t *buf;
+    int buf_len, block_end_pos, bit;
+    char cname[128];
+    
+    dbuf_init(dbuf1);
+
+    for(i = 0; i <= CHARCODE_MAX;) {
+        v = get_prop(i, prop_index);
+        j = i + 1;
+        while (j <= CHARCODE_MAX && get_prop(j, prop_index) == v) {
+            j++;
+        }
+        n = j - i;
+        if (j == (CHARCODE_MAX + 1) && v == 0)
+            break; /* no need to encode last zero run */
+        //printf("%05x: %d %d\n", i, n, v);
+        dbuf_put_u32(dbuf1, n - 1);
+        i += n;
+    }
+    
+    dbuf_init(dbuf);
+    dbuf_init(dbuf2);
+    buf = (uint32_t *)dbuf1->buf;
+    buf_len = dbuf1->size / sizeof(buf[0]);
+    
+    /* the first value is assumed to be 0 */
+    assert(get_prop(0, prop_index) == 0);
+    
+    block_end_pos = PROP_BLOCK_LEN;
+    i = 0;
+    code = 0;
+    bit = 0;
+    while (i < buf_len) {
+        if (add_index && dbuf->size >= block_end_pos && bit == 0) {
+            offset = (dbuf->size - block_end_pos);
+            /* XXX: offset could be larger in case of runs of small
+               lengths. Could add code to change the encoding to
+               prevent it at the expense of one byte loss */
+            assert(offset <= 7);
+            v = code | (offset << 21);
+            dbuf_putc(dbuf2, v);
+            dbuf_putc(dbuf2, v >> 8);
+            dbuf_putc(dbuf2, v >> 16);
+            block_end_pos += PROP_BLOCK_LEN;
+        }
+
+        v = buf[i];
+        code += v + 1;
+        bit ^= 1;
+        if (v < 8 && (i + 1) < buf_len && buf[i + 1] < 8) {
+            code += buf[i + 1] + 1;
+            bit ^= 1;
+            dbuf_putc(dbuf, (v << 3) | buf[i + 1]);
+            i += 2;
+        } else if (v < 128) {
+            dbuf_putc(dbuf, 0x80 + v);
+            i++;
+        } else if (v < (1 << 13)) {
+            dbuf_putc(dbuf, 0x40 + (v >> 8));
+            dbuf_putc(dbuf, v);
+            i++;
+        } else {
+            assert(v < (1 << 21));
+            dbuf_putc(dbuf, 0x60 + (v >> 16));
+            dbuf_putc(dbuf, v >> 8);
+            dbuf_putc(dbuf, v);
+            i++;
+        }
+    }
+
+    if (add_index) {
+        /* last index entry */
+        v = code;
+        dbuf_putc(dbuf2, v);
+        dbuf_putc(dbuf2, v >> 8);
+        dbuf_putc(dbuf2, v >> 16);
+    }
+
+#ifdef DUMP_TABLE_SIZE
+    printf("prop %s: length=%d bytes\n", unicode_prop_name[prop_index],
+           (int)(dbuf->size + dbuf2->size));
+#endif
+    snprintf(cname, sizeof(cname), "unicode_prop_%s_table", unicode_prop_name[prop_index]);
+    dump_byte_table(f, cname, dbuf->buf, dbuf->size);
+    if (add_index) {
+        snprintf(cname, sizeof(cname), "unicode_prop_%s_index", unicode_prop_name[prop_index]);
+        dump_byte_table(f, cname, dbuf2->buf, dbuf2->size);
+    }
+    
+    dbuf_free(dbuf);
+    dbuf_free(dbuf1);
+    dbuf_free(dbuf2);
+}
+
+void build_flags_tables(FILE *f)
+{
+    build_prop_table(f, PROP_Cased1, TRUE);
+    build_prop_table(f, PROP_Case_Ignorable, TRUE);
+    build_prop_table(f, PROP_ID_Start, TRUE);
+    build_prop_table(f, PROP_ID_Continue1, TRUE);
+}
+
+void dump_name_table(FILE *f, const char *cname, const char **tab_name, int len,
+                     const char **tab_short_name)
+{
+    int i, w, maxw;
+
+    maxw = 0;
+    for(i = 0; i < len; i++) {
+        w = strlen(tab_name[i]);
+        if (tab_short_name[i][0] != '\0') {
+            w += 1 + strlen(tab_short_name[i]);
+        }
+        if (maxw < w)
+            maxw = w;
+    }
+
+    /* generate a sequence of strings terminated by an empty string */
+    fprintf(f, "static const char %s[] =\n", cname);
+    for(i = 0; i < len; i++) {
+        fprintf(f, "    \"");
+        w = fprintf(f, "%s", tab_name[i]);
+        if (tab_short_name[i][0] != '\0') {
+            w += fprintf(f, ",%s", tab_short_name[i]);
+        }
+        fprintf(f, "\"%*s\"\\0\"\n", 1 + maxw - w, "");
+    }
+    fprintf(f, ";\n\n");
+}
+
+void build_general_category_table(FILE *f)
+{
+    int i, v, j, n, n1;
+    DynBuf dbuf_s, *dbuf = &dbuf_s;
+    int cw_count, cw_len_count[4], cw_start;
+
+    fprintf(f, "typedef enum {\n");
+    for(i = 0; i < GCAT_COUNT; i++)
+        fprintf(f, "    UNICODE_GC_%s,\n", unicode_gc_name[i]);
+    fprintf(f, "    UNICODE_GC_COUNT,\n");
+    fprintf(f, "} UnicodeGCEnum;\n\n");
+
+    dump_name_table(f, "unicode_gc_name_table",
+                    unicode_gc_name, GCAT_COUNT,
+                    unicode_gc_short_name);
+
+
+    dbuf_init(dbuf);
+    cw_count = 0;
+    for(i = 0; i < 4; i++)
+        cw_len_count[i] = 0;
+    for(i = 0; i <= CHARCODE_MAX;) {
+        v = unicode_db[i].general_category;
+        j = i + 1;
+        while (j <= CHARCODE_MAX && unicode_db[j].general_category == v)
+            j++;
+        n = j - i;
+        /* compress Lu/Ll runs */
+        if (v == GCAT_Lu) {
+            n1 = 1;
+            while ((i + n1) <= CHARCODE_MAX && unicode_db[i + n1].general_category == (v + (n1 & 1))) {
+                n1++;
+            }
+            if (n1 > n) {
+                v = 31;
+                n = n1;
+            }
+        }
+        //        printf("%05x %05x %d\n", i, n, v);
+        cw_count++;
+        n--;
+        cw_start = dbuf->size;
+        if (n < 7) {
+            dbuf_putc(dbuf, (n << 5) | v);
+        } else if (n < 7 + 128) {
+            n1 = n - 7;
+            assert(n1 < 128);
+            dbuf_putc(dbuf, (0xf << 5) | v);
+            dbuf_putc(dbuf, n1);
+        } else if (n < 7 + 128 + (1 << 14)) {
+            n1 = n - (7 + 128);
+            assert(n1 < (1 << 14));
+            dbuf_putc(dbuf, (0xf << 5) | v);
+            dbuf_putc(dbuf, (n1 >> 8) + 128);
+            dbuf_putc(dbuf, n1);
+        } else {
+            n1 = n - (7 + 128 + (1 << 14));
+            assert(n1 < (1 << 22));
+            dbuf_putc(dbuf, (0xf << 5) | v);
+            dbuf_putc(dbuf, (n1 >> 16) + 128 + 64);
+            dbuf_putc(dbuf, n1 >> 8);
+            dbuf_putc(dbuf, n1);
+        }
+        cw_len_count[dbuf->size - cw_start - 1]++;
+        i += n + 1;
+    }
+#ifdef DUMP_TABLE_SIZE
+    printf("general category: %d entries [",
+           cw_count);
+    for(i = 0; i < 4; i++)
+        printf(" %d", cw_len_count[i]);
+    printf(" ], length=%d bytes\n", (int)dbuf->size);
+#endif
+    
+    dump_byte_table(f, "unicode_gc_table", dbuf->buf, dbuf->size);
+
+    dbuf_free(dbuf);
+}
+
+void build_script_table(FILE *f)
+{
+    int i, v, j, n, n1, type;
+    DynBuf dbuf_s, *dbuf = &dbuf_s;
+    int cw_count, cw_len_count[4], cw_start;
+
+    fprintf(f, "typedef enum {\n");
+    for(i = 0; i < SCRIPT_COUNT; i++)
+        fprintf(f, "    UNICODE_SCRIPT_%s,\n", unicode_script_name[i]);
+    fprintf(f, "    UNICODE_SCRIPT_COUNT,\n");
+    fprintf(f, "} UnicodeScriptEnum;\n\n");
+
+    i = 1;
+    dump_name_table(f, "unicode_script_name_table",
+                    unicode_script_name + i, SCRIPT_COUNT - i,
+                    unicode_script_short_name + i);
+
+    dbuf_init(dbuf);
+    cw_count = 0;
+    for(i = 0; i < 4; i++)
+        cw_len_count[i] = 0;
+    for(i = 0; i <= CHARCODE_MAX;) {
+        v = unicode_db[i].script;
+        j = i + 1;
+        while (j <= CHARCODE_MAX && unicode_db[j].script == v)
+            j++;
+        n = j - i;
+        if (v == 0 && j == (CHARCODE_MAX + 1))
+            break;
+        //        printf("%05x %05x %d\n", i, n, v);
+        cw_count++;
+        n--;
+        cw_start = dbuf->size;
+        if (v == 0)
+            type = 0;
+        else
+            type = 1;
+        if (n < 96) {
+            dbuf_putc(dbuf, n | (type << 7));
+        } else if (n < 96 + (1 << 12)) {
+            n1 = n - 96;
+            assert(n1 < (1 << 12));
+            dbuf_putc(dbuf, ((n1 >> 8) + 96) | (type << 7));
+            dbuf_putc(dbuf, n1);
+        } else {
+            n1 = n - (96 + (1 << 12));
+            assert(n1 < (1 << 20));
+            dbuf_putc(dbuf, ((n1 >> 16) + 112) | (type << 7));
+            dbuf_putc(dbuf, n1 >> 8);
+            dbuf_putc(dbuf, n1);
+        }
+        if (type != 0)
+            dbuf_putc(dbuf, v);
+
+        cw_len_count[dbuf->size - cw_start - 1]++;
+        i += n + 1;
+    }
+#if defined(DUMP_TABLE_SIZE)
+    printf("script: %d entries [",
+           cw_count);
+    for(i = 0; i < 4; i++)
+        printf(" %d", cw_len_count[i]);
+    printf(" ], length=%d bytes\n", (int)dbuf->size);
+#endif
+    
+    dump_byte_table(f, "unicode_script_table", dbuf->buf, dbuf->size);
+
+    dbuf_free(dbuf);
+}
+
+void build_script_ext_table(FILE *f)
+{
+    int i, j, n, n1, script_ext_len;
+    DynBuf dbuf_s, *dbuf = &dbuf_s;
+    int cw_count;
+
+    dbuf_init(dbuf);
+    cw_count = 0;
+    for(i = 0; i <= CHARCODE_MAX;) {
+        script_ext_len = unicode_db[i].script_ext_len;
+        j = i + 1;
+        while (j <= CHARCODE_MAX &&
+               unicode_db[j].script_ext_len == script_ext_len &&
+               !memcmp(unicode_db[j].script_ext, unicode_db[i].script_ext,
+                       script_ext_len)) {
+            j++;
+        }
+        n = j - i;
+        cw_count++;
+        n--;
+        if (n < 128) {
+            dbuf_putc(dbuf, n);
+        } else if (n < 128 + (1 << 14)) {
+            n1 = n - 128;
+            assert(n1 < (1 << 14));
+            dbuf_putc(dbuf, (n1 >> 8) + 128);
+            dbuf_putc(dbuf, n1);
+        } else {
+            n1 = n - (128 + (1 << 14));
+            assert(n1 < (1 << 22));
+            dbuf_putc(dbuf, (n1 >> 16) + 128 + 64);
+            dbuf_putc(dbuf, n1 >> 8);
+            dbuf_putc(dbuf, n1);
+        }
+        dbuf_putc(dbuf, script_ext_len);
+        for(j = 0; j < script_ext_len; j++)
+            dbuf_putc(dbuf, unicode_db[i].script_ext[j]);
+        i += n + 1;
+    }
+#ifdef DUMP_TABLE_SIZE
+    printf("script_ext: %d entries",
+           cw_count);
+    printf(", length=%d bytes\n", (int)dbuf->size);
+#endif
+    
+    dump_byte_table(f, "unicode_script_ext_table", dbuf->buf, dbuf->size);
+
+    dbuf_free(dbuf);
+}
+
+/* the following properties are synthetized so no table is necessary */
+#define PROP_TABLE_COUNT PROP_ASCII
+
+void build_prop_list_table(FILE *f)
+{
+    int i;
+    
+    for(i = 0; i < PROP_TABLE_COUNT; i++) {
+        if (i == PROP_ID_Start ||
+            i == PROP_Case_Ignorable ||
+            i == PROP_ID_Continue1) {
+            /* already generated */
+        } else {
+            build_prop_table(f, i, FALSE);
+        }
+    }
+    
+    fprintf(f, "typedef enum {\n");
+    for(i = 0; i < PROP_COUNT; i++)
+        fprintf(f, "    UNICODE_PROP_%s,\n", unicode_prop_name[i]);
+    fprintf(f, "    UNICODE_PROP_COUNT,\n");
+    fprintf(f, "} UnicodePropertyEnum;\n\n");
+
+    i = PROP_ASCII_Hex_Digit;
+    dump_name_table(f, "unicode_prop_name_table",
+                    unicode_prop_name + i, PROP_XID_Start - i + 1,
+                    unicode_prop_short_name + i);
+
+    fprintf(f, "static const uint8_t * const unicode_prop_table[] = {\n");
+    for(i = 0; i < PROP_TABLE_COUNT; i++) {
+        fprintf(f, "    unicode_prop_%s_table,\n", unicode_prop_name[i]);
+    }
+    fprintf(f, "};\n\n");
+
+    fprintf(f, "static const uint16_t unicode_prop_len_table[] = {\n");
+    for(i = 0; i < PROP_TABLE_COUNT; i++) {
+        fprintf(f, "    countof(unicode_prop_%s_table),\n", unicode_prop_name[i]);
+    }
+    fprintf(f, "};\n\n");
+}
+
+#ifdef USE_TEST
+int check_conv(uint32_t *res, uint32_t c, int conv_type)
+{
+    return lre_case_conv(res, c, conv_type);
+}
+
+void check_case_conv(void)
+{
+    CCInfo *tab = unicode_db;
+    uint32_t res[3];
+    int l, error;
+    CCInfo ci_s, *ci1, *ci = &ci_s;
+    int code;
+    
+    for(code = 0; code <= CHARCODE_MAX; code++) {
+        ci1 = &tab[code];
+        *ci = *ci1;
+        if (ci->l_len == 0) {
+            ci->l_len = 1;
+            ci->l_data[0] = code;
+        }
+        if (ci->u_len == 0) {
+            ci->u_len = 1;
+            ci->u_data[0] = code;
+        }
+        if (ci->f_code == 0)
+            ci->f_code = code;
+
+        error = 0;
+        l = check_conv(res, code, 0);
+        if (l != ci->u_len || tabcmp((int *)res, ci->u_data, l)) {
+            printf("ERROR: L\n");
+            error++;
+        }
+        l = check_conv(res, code, 1);
+        if (l != ci->l_len || tabcmp((int *)res, ci->l_data, l)) {
+            printf("ERROR: U\n");
+            error++;
+        }
+        l = check_conv(res, code, 2);
+        if (l != 1 || res[0] != ci->f_code) {
+            printf("ERROR: F\n");
+            error++;
+        }
+        if (error) {
+            dump_cc_info(ci, code);
+            exit(1);
+        }
+    }
+}
+
+#ifdef PROFILE
+static int64_t get_time_ns(void)
+{
+    struct timespec ts;
+    clock_gettime(CLOCK_MONOTONIC, &ts);
+    return (int64_t)ts.tv_sec * 1000000000 + ts.tv_nsec;
+}
+#endif
+
+
+void check_flags(void)
+{
+    int c;
+    BOOL flag_ref, flag;
+    for(c = 0; c <= CHARCODE_MAX; c++) {
+        flag_ref = get_prop(c, PROP_Cased);
+        flag = lre_is_cased(c);
+        if (flag != flag_ref) {
+            printf("ERROR: c=%05x cased=%d ref=%d\n",
+                   c, flag, flag_ref);
+            exit(1);
+        }
+
+        flag_ref = get_prop(c, PROP_Case_Ignorable);
+        flag = lre_is_case_ignorable(c);
+        if (flag != flag_ref) {
+            printf("ERROR: c=%05x case_ignorable=%d ref=%d\n",
+                   c, flag, flag_ref);
+            exit(1);
+        }
+
+        flag_ref = get_prop(c, PROP_ID_Start);
+        flag = lre_is_id_start(c);
+        if (flag != flag_ref) {
+            printf("ERROR: c=%05x id_start=%d ref=%d\n",
+                   c, flag, flag_ref);
+            exit(1);
+        }
+
+        flag_ref = get_prop(c, PROP_ID_Continue);
+        flag = lre_is_id_continue(c);
+        if (flag != flag_ref) {
+            printf("ERROR: c=%05x id_cont=%d ref=%d\n",
+                   c, flag, flag_ref);
+            exit(1);
+        }
+    }
+#ifdef PROFILE
+    {
+        int64_t ti, count;
+        ti = get_time_ns();
+        count = 0;
+        for(c = 0x20; c <= 0xffff; c++) {
+            flag_ref = get_prop(c, PROP_ID_Start);
+            flag = lre_is_id_start(c);
+            assert(flag == flag_ref);
+            count++;
+        }
+        ti = get_time_ns() - ti;
+        printf("flags time=%0.1f ns/char\n",
+               (double)ti / count);
+    }
+#endif
+}
+
+#endif
+
+#define CC_BLOCK_LEN 32
+
+void build_cc_table(FILE *f)
+{
+    int i, cc, n, cc_table_len, type, n1;
+    DynBuf dbuf_s, *dbuf = &dbuf_s;
+    DynBuf dbuf1_s, *dbuf1 = &dbuf1_s;
+    int cw_len_tab[3], cw_start, block_end_pos;
+    uint32_t v;
+    
+    dbuf_init(dbuf);
+    dbuf_init(dbuf1);
+    cc_table_len = 0;
+    for(i = 0; i < countof(cw_len_tab); i++)
+        cw_len_tab[i] = 0;
+    block_end_pos = CC_BLOCK_LEN;
+    for(i = 0; i <= CHARCODE_MAX;) {
+        cc = unicode_db[i].combining_class;
+        assert(cc <= 255);
+        /* check increasing values */
+        n = 1;
+        while ((i + n) <= CHARCODE_MAX &&
+               unicode_db[i + n].combining_class == (cc + n))
+            n++;
+        if (n >= 2) {
+            type = 1;
+        } else {
+            type = 0;
+            n = 1;
+            while ((i + n) <= CHARCODE_MAX &&
+                   unicode_db[i + n].combining_class == cc)
+                n++;
+        }
+        /* no need to encode the last run */
+        if (cc == 0 && (i + n - 1) == CHARCODE_MAX)
+            break;
+#ifdef DUMP_CC_TABLE
+        printf("%05x %6d %d %d\n", i, n, type, cc);
+#endif
+        if (type == 0) {
+            if (cc == 0)
+                type = 2;
+            else if (cc == 230)
+                type = 3;
+        }
+        n1 = n - 1;
+
+        /* add an entry to the index if necessary */
+        if (dbuf->size >= block_end_pos) {
+            v = i | ((dbuf->size - block_end_pos) << 21);
+            dbuf_putc(dbuf1, v);
+            dbuf_putc(dbuf1, v >> 8);
+            dbuf_putc(dbuf1, v >> 16);
+            block_end_pos += CC_BLOCK_LEN;
+        }
+        cw_start = dbuf->size;
+        if (n1 < 48) {
+            dbuf_putc(dbuf, n1 | (type << 6));
+        } else if (n1 < 48 + (1 << 11)) {
+            n1 -= 48;
+            dbuf_putc(dbuf, ((n1 >> 8) + 48) | (type << 6));
+            dbuf_putc(dbuf, n1);
+        } else {
+            n1 -= 48 + (1 << 11);
+            assert(n1 < (1 << 20));
+            dbuf_putc(dbuf, ((n1 >> 16) + 56) | (type << 6));
+            dbuf_putc(dbuf, n1 >> 8);
+            dbuf_putc(dbuf, n1);
+        }
+        cw_len_tab[dbuf->size - cw_start - 1]++;
+        if (type == 0 || type == 1)
+            dbuf_putc(dbuf, cc);
+        cc_table_len++;
+        i += n;
+    }
+
+    /* last index entry */
+    v = i;
+    dbuf_putc(dbuf1, v);
+    dbuf_putc(dbuf1, v >> 8);
+    dbuf_putc(dbuf1, v >> 16);
+    
+    dump_byte_table(f, "unicode_cc_table", dbuf->buf, dbuf->size);
+    dump_byte_table(f, "unicode_cc_index", dbuf1->buf, dbuf1->size);
+
+#if defined(DUMP_CC_TABLE) || defined(DUMP_TABLE_SIZE)
+    printf("CC table: size=%d (%d entries) [",
+           (int)(dbuf->size + dbuf1->size),
+           cc_table_len);
+    for(i = 0; i < countof(cw_len_tab); i++)
+        printf(" %d", cw_len_tab[i]);
+    printf(" ]\n");
+#endif
+    dbuf_free(dbuf);
+    dbuf_free(dbuf1);
+}
+
+/* maximum length of decomposition: 18 chars (1), then 8 */
+#ifndef USE_TEST
+typedef enum {
+    DECOMP_TYPE_C1, /* 16 bit char */
+    DECOMP_TYPE_L1, /* 16 bit char table */
+    DECOMP_TYPE_L2,
+    DECOMP_TYPE_L3,
+    DECOMP_TYPE_L4,
+    DECOMP_TYPE_L5, /* XXX: not used */
+    DECOMP_TYPE_L6, /* XXX: could remove */
+    DECOMP_TYPE_L7, /* XXX: could remove */
+    DECOMP_TYPE_LL1, /* 18 bit char table */
+    DECOMP_TYPE_LL2,
+    DECOMP_TYPE_S1, /* 8 bit char table */
+    DECOMP_TYPE_S2,
+    DECOMP_TYPE_S3,
+    DECOMP_TYPE_S4,
+    DECOMP_TYPE_S5,
+    DECOMP_TYPE_I1, /* increment 16 bit char value */
+    DECOMP_TYPE_I2_0,
+    DECOMP_TYPE_I2_1,
+    DECOMP_TYPE_I3_1,
+    DECOMP_TYPE_I3_2,
+    DECOMP_TYPE_I4_1,
+    DECOMP_TYPE_I4_2,
+    DECOMP_TYPE_B1, /* 16 bit base + 8 bit offset */
+    DECOMP_TYPE_B2,
+    DECOMP_TYPE_B3,
+    DECOMP_TYPE_B4,
+    DECOMP_TYPE_B5,
+    DECOMP_TYPE_B6,
+    DECOMP_TYPE_B7,
+    DECOMP_TYPE_B8,
+    DECOMP_TYPE_B18,
+    DECOMP_TYPE_LS2,
+    DECOMP_TYPE_PAT3,
+    DECOMP_TYPE_S2_UL,
+    DECOMP_TYPE_LS2_UL,
+} DecompTypeEnum;
+#endif
+
+const char *decomp_type_str[] = {
+    "C1",
+    "L1",
+    "L2",
+    "L3",
+    "L4",
+    "L5",
+    "L6",
+    "L7",
+    "LL1",
+    "LL2",
+    "S1",
+    "S2",
+    "S3",
+    "S4",
+    "S5",
+    "I1",
+    "I2_0",
+    "I2_1",
+    "I3_1",
+    "I3_2",
+    "I4_1",
+    "I4_2",
+    "B1",
+    "B2",
+    "B3",
+    "B4",
+    "B5",
+    "B6",
+    "B7",
+    "B8",
+    "B18",
+    "LS2",
+    "PAT3",
+    "S2_UL",
+    "LS2_UL",
+};
+
+const int decomp_incr_tab[4][4] = {
+    { DECOMP_TYPE_I1, 0, -1 },
+    { DECOMP_TYPE_I2_0, 0, 1, -1 },
+    { DECOMP_TYPE_I3_1, 1, 2, -1 },
+    { DECOMP_TYPE_I4_1, 1, 2, -1 },
+};
+
+/*
+  entry size:
+  type   bits
+  code   18 
+  len    7
+  compat 1
+  type   5
+  index  16
+  total  47
+*/
+
+typedef struct {
+    int code;
+    uint8_t len;
+    uint8_t type;
+    uint8_t c_len;
+    uint16_t c_min;
+    uint16_t data_index;
+    int cost; /* size in bytes from this entry to the end */
+} DecompEntry;
+
+int get_decomp_run_size(const DecompEntry *de)
+{
+    int s;
+    s = 6;
+    if (de->type <= DECOMP_TYPE_C1) {
+        /* nothing more */
+    } else if (de->type <= DECOMP_TYPE_L7) {
+        s += de->len * de->c_len * 2;
+    } else if (de->type <= DECOMP_TYPE_LL2) {
+        /* 18 bits per char */
+        s += (de->len * de->c_len * 18 + 7) / 8;
+    } else if (de->type <= DECOMP_TYPE_S5) {
+        s += de->len * de->c_len;
+    } else if (de->type <= DECOMP_TYPE_I4_2) {
+        s += de->c_len * 2;
+    } else if (de->type <= DECOMP_TYPE_B18) {
+        s += 2 + de->len * de->c_len;
+    } else if (de->type <= DECOMP_TYPE_LS2) {
+        s += de->len * 3;
+    } else if (de->type <= DECOMP_TYPE_PAT3) {
+        s += 4 + de->len * 2;
+    } else if (de->type <= DECOMP_TYPE_S2_UL) {
+        s += de->len;
+    } else if (de->type <= DECOMP_TYPE_LS2_UL) {
+        s += (de->len / 2) * 3;
+    } else {
+        abort();
+    }
+    return s;
+}
+
+static const uint16_t unicode_short_table[2] = { 0x2044, 0x2215 };
+
+/* return -1 if not found */
+int get_short_code(int c)
+{
+    int i;
+    if (c < 0x80) {
+        return c;
+    } else if (c >= 0x300 && c < 0x350) {
+        return c - 0x300 + 0x80;
+    } else {
+        for(i = 0; i < countof(unicode_short_table); i++) {
+            if (c == unicode_short_table[i])
+                return i + 0x80 + 0x50;
+        }
+        return -1;
+    }
+}
+
+static BOOL is_short(int code)
+{
+    return get_short_code(code) >= 0;
+}
+
+static BOOL is_short_tab(const int *tab, int len)
+{
+    int i;
+    for(i = 0; i < len; i++) {
+        if (!is_short(tab[i]))
+            return FALSE;
+    }
+    return TRUE;
+}
+
+static BOOL is_16bit(const int *tab, int len)
+{
+    int i;
+    for(i = 0; i < len; i++) {
+        if (tab[i] > 0xffff)
+            return FALSE;
+    }
+    return TRUE;
+}
+
+static uint32_t to_lower_simple(uint32_t c)
+{
+    /* Latin1 and Cyrillic */
+    if (c < 0x100 || (c >= 0x410 && c <= 0x42f))
+        c += 0x20;
+    else
+        c++;
+    return c;
+}
+
+/* select best encoding with dynamic programming */
+void find_decomp_run(DecompEntry *tab_de, int i)
+{
+    DecompEntry de_s, *de = &de_s;
+    CCInfo *ci, *ci1, *ci2;
+    int l, j, n, len_max;
+    
+    ci = &unicode_db[i];
+    l = ci->decomp_len;
+    if (l == 0) {
+        tab_de[i].cost = tab_de[i + 1].cost;
+        return;
+    }
+
+    /* the offset for the compose table has only 6 bits, so we must
+       limit if it can be used by the compose table */
+    if (!ci->is_compat && !ci->is_excluded && l == 2)
+        len_max = 64; 
+    else
+        len_max = 127;
+    
+    tab_de[i].cost = 0x7fffffff;
+    
+    if (!is_16bit(ci->decomp_data, l)) {
+        assert(l <= 2);
+
+        n = 1;
+        for(;;) {
+            de->code = i;
+            de->len = n;
+            de->type = DECOMP_TYPE_LL1 + l - 1;
+            de->c_len = l;
+            de->cost = get_decomp_run_size(de) + tab_de[i + n].cost;
+            if (de->cost < tab_de[i].cost) {
+                tab_de[i] = *de;
+            }
+            if (!((i + n) <= CHARCODE_MAX && n < len_max))
+                break;
+            ci1 = &unicode_db[i + n];
+            /* Note: we accept a hole */
+            if (!(ci1->decomp_len == 0 ||
+                  (ci1->decomp_len == l &&
+                   ci1->is_compat == ci->is_compat)))
+                break;
+            n++;
+        }
+        return;
+    }
+
+    if (l <= 7) {
+        n = 1;
+        for(;;) {
+            de->code = i;
+            de->len = n;
+            if (l == 1 && n == 1) {
+                de->type = DECOMP_TYPE_C1;
+            } else {
+                assert(l <= 8);
+                de->type = DECOMP_TYPE_L1 + l - 1;
+            }
+            de->c_len = l;
+            de->cost = get_decomp_run_size(de) + tab_de[i + n].cost;
+            if (de->cost < tab_de[i].cost) {
+                tab_de[i] = *de;
+            }
+            
+            if (!((i + n) <= CHARCODE_MAX && n < len_max))
+                break;
+            ci1 = &unicode_db[i + n];
+            /* Note: we accept a hole */
+            if (!(ci1->decomp_len == 0 ||
+                  (ci1->decomp_len == l &&
+                   ci1->is_compat == ci->is_compat &&
+                   is_16bit(ci1->decomp_data, l))))
+                break;
+            n++;
+        }
+    }
+    
+    if (l <= 8 || l == 18) {
+        int c_min, c_max, c;
+        c_min = c_max = -1;
+        n = 1;
+        for(;;) {
+            ci1 = &unicode_db[i + n - 1];
+            for(j = 0; j < l; j++) {
+                c = ci1->decomp_data[j];
+                if (c == 0x20) {
+                    /* we accept space for Arabic */
+                } else if (c_min == -1) {
+                    c_min = c_max = c;
+                } else {
+                    c_min = min_int(c_min, c);
+                    c_max = max_int(c_max, c);
+                }
+            }
+            if ((c_max - c_min) > 254)
+                break;
+            de->code = i;
+            de->len = n;
+            if (l == 18)
+                de->type = DECOMP_TYPE_B18;
+            else
+                de->type = DECOMP_TYPE_B1 + l - 1;
+            de->c_len = l;
+            de->c_min = c_min;
+            de->cost = get_decomp_run_size(de) + tab_de[i + n].cost;
+            if (de->cost < tab_de[i].cost) {
+                tab_de[i] = *de;
+            }
+            if (!((i + n) <= CHARCODE_MAX && n < len_max))
+                break;
+            ci1 = &unicode_db[i + n];
+            if (!(ci1->decomp_len == l &&
+                  ci1->is_compat == ci->is_compat))
+                break;
+            n++;
+        }
+    }
+
+    /* find an ascii run */
+    if (l <= 5 && is_short_tab(ci->decomp_data, l)) {
+        n = 1;
+        for(;;) {
+            de->code = i;
+            de->len = n;
+            de->type = DECOMP_TYPE_S1 + l - 1;
+            de->c_len = l;
+            de->cost = get_decomp_run_size(de) + tab_de[i + n].cost;
+            if (de->cost < tab_de[i].cost) {
+                tab_de[i] = *de;
+            }
+
+            if (!((i + n) <= CHARCODE_MAX && n < len_max))
+                break;
+            ci1 = &unicode_db[i + n];
+            /* Note: we accept a hole */
+            if (!(ci1->decomp_len == 0 ||
+                  (ci1->decomp_len == l &&
+                   ci1->is_compat == ci->is_compat &&
+                   is_short_tab(ci1->decomp_data, l))))
+                break;
+            n++;
+        }
+    }
+
+    /* check if a single char is increasing */
+    if (l <= 4) {
+        int idx1, idx;
+        
+        for(idx1 = 1; (idx = decomp_incr_tab[l - 1][idx1]) >= 0; idx1++) {
+            n = 1;
+            for(;;) {
+                de->code = i;
+                de->len = n;
+                de->type = decomp_incr_tab[l - 1][0] + idx1 - 1;
+                de->c_len = l;
+                de->cost = get_decomp_run_size(de) + tab_de[i + n].cost;
+                if (de->cost < tab_de[i].cost) {
+                    tab_de[i] = *de;
+                }
+
+                if (!((i + n) <= CHARCODE_MAX && n < len_max))
+                    break;
+                ci1 = &unicode_db[i + n];
+                if (!(ci1->decomp_len == l &&
+                      ci1->is_compat == ci->is_compat))
+                    goto next1;
+                for(j = 0; j < l; j++) {
+                    if (j == idx) {
+                        if (ci1->decomp_data[j] != ci->decomp_data[j] + n)
+                            goto next1;
+                    } else {
+                        if (ci1->decomp_data[j] != ci->decomp_data[j])
+                            goto next1;
+                    }
+                }
+                n++;
+            }
+        next1: ;
+        }
+    }
+
+    if (l == 3) {
+        n = 1;
+        for(;;) {
+            de->code = i;
+            de->len = n;
+            de->type = DECOMP_TYPE_PAT3;
+            de->c_len = l;
+            de->cost = get_decomp_run_size(de) + tab_de[i + n].cost;
+            if (de->cost < tab_de[i].cost) {
+                tab_de[i] = *de;
+            }
+            if (!((i + n) <= CHARCODE_MAX && n < len_max))
+                break;
+            ci1 = &unicode_db[i + n];
+            if (!(ci1->decomp_len == l &&
+                  ci1->is_compat == ci->is_compat &&
+                  ci1->decomp_data[1] <= 0xffff &&
+                  ci1->decomp_data[0] == ci->decomp_data[0] &&
+                  ci1->decomp_data[l - 1] == ci->decomp_data[l - 1]))
+                break;
+            n++;
+        }
+    }
+
+    if (l == 2 && is_short(ci->decomp_data[1])) {
+        n = 1;
+        for(;;) {
+            de->code = i;
+            de->len = n;
+            de->type = DECOMP_TYPE_LS2;
+            de->c_len = l;
+            de->cost = get_decomp_run_size(de) + tab_de[i + n].cost;
+            if (de->cost < tab_de[i].cost) {
+                tab_de[i] = *de;
+            }
+            if (!((i + n) <= CHARCODE_MAX && n < len_max))
+                break;
+            ci1 = &unicode_db[i + n];
+            if (!(ci1->decomp_len == 0 ||
+                  (ci1->decomp_len == l &&
+                   ci1->is_compat == ci->is_compat &&
+                   ci1->decomp_data[0] <= 0xffff &&
+                   is_short(ci1->decomp_data[1]))))
+                break;
+            n++;
+        }
+    }
+
+    if (l == 2) {
+        BOOL is_16bit;
+        
+        n = 0;
+        is_16bit = FALSE;
+        for(;;) {
+            if (!((i + n + 1) <= CHARCODE_MAX && n + 2 <= len_max))
+                break;
+            ci1 = &unicode_db[i + n];
+            if (!(ci1->decomp_len == l &&
+                  ci1->is_compat == ci->is_compat &&
+                  is_short(ci1->decomp_data[1])))
+                break;
+            if (!is_16bit && !is_short(ci1->decomp_data[0]))
+                is_16bit = TRUE;
+            ci2 = &unicode_db[i + n + 1];
+            if (!(ci2->decomp_len == l &&
+                  ci2->is_compat == ci->is_compat &&
+                  ci2->decomp_data[0] == to_lower_simple(ci1->decomp_data[0])  &&
+                  ci2->decomp_data[1] == ci1->decomp_data[1]))
+                break;
+            n += 2;
+            de->code = i;
+            de->len = n;
+            de->type = DECOMP_TYPE_S2_UL + is_16bit;
+            de->c_len = l;
+            de->cost = get_decomp_run_size(de) + tab_de[i + n].cost;
+            if (de->cost < tab_de[i].cost) {
+                tab_de[i] = *de;
+            }
+        }
+    }
+}
+
+void put16(uint8_t *data_buf, int *pidx, uint16_t c)
+{
+    int idx;
+    idx = *pidx;
+    data_buf[idx++] = c;
+    data_buf[idx++] = c >> 8;
+    *pidx = idx;
+}
+
+void add_decomp_data(uint8_t *data_buf, int *pidx, DecompEntry *de)
+{
+    int i, j, idx, c;
+    CCInfo *ci;
+    
+    idx = *pidx;
+    de->data_index = idx;
+    if (de->type <= DECOMP_TYPE_C1) {
+        ci = &unicode_db[de->code];
+        assert(ci->decomp_len == 1);
+        de->data_index = ci->decomp_data[0];
+    } else if (de->type <= DECOMP_TYPE_L7) {
+        for(i = 0; i < de->len; i++) {
+            ci = &unicode_db[de->code + i];
+            for(j = 0; j < de->c_len; j++) {
+                if (ci->decomp_len == 0)
+                    c = 0;
+                else
+                    c = ci->decomp_data[j];
+                put16(data_buf, &idx,  c);
+            }
+        }
+    } else if (de->type <= DECOMP_TYPE_LL2) {
+        int n, p, k;
+        n = (de->len * de->c_len * 18 + 7) / 8;
+        p = de->len * de->c_len * 2;
+        memset(data_buf + idx, 0, n);
+        k = 0;
+        for(i = 0; i < de->len; i++) {
+            ci = &unicode_db[de->code + i];
+            for(j = 0; j < de->c_len; j++) {
+                if (ci->decomp_len == 0)
+                    c = 0;
+                else
+                    c = ci->decomp_data[j];
+                data_buf[idx + k * 2] = c;
+                data_buf[idx + k * 2 + 1] = c >> 8;
+                data_buf[idx + p + (k / 4)] |= (c >> 16) << ((k % 4) * 2);
+                k++;
+            }
+        }
+        idx += n;
+    } else if (de->type <= DECOMP_TYPE_S5) {
+        for(i = 0; i < de->len; i++) {
+            ci = &unicode_db[de->code + i];
+            for(j = 0; j < de->c_len; j++) {
+                if (ci->decomp_len == 0)
+                    c = 0;
+                else
+                    c = ci->decomp_data[j];
+                c = get_short_code(c);
+                assert(c >= 0);
+                data_buf[idx++] = c;
+            }
+        }
+    } else if (de->type <= DECOMP_TYPE_I4_2) {
+        ci = &unicode_db[de->code];
+        assert(ci->decomp_len == de->c_len);
+        for(j = 0; j < de->c_len; j++)
+            put16(data_buf, &idx, ci->decomp_data[j]);
+    } else if (de->type <= DECOMP_TYPE_B18) {
+        c = de->c_min;
+        data_buf[idx++] = c;
+        data_buf[idx++] = c >> 8;
+        for(i = 0; i < de->len; i++) {
+            ci = &unicode_db[de->code + i];
+            for(j = 0; j < de->c_len; j++) {
+                assert(ci->decomp_len == de->c_len);
+                c = ci->decomp_data[j];
+                if (c == 0x20) {
+                    c = 0xff;
+                } else {
+                    c -= de->c_min;
+                    assert((uint32_t)c <= 254);
+                }
+                data_buf[idx++] = c;
+            }
+        }
+    } else if (de->type <= DECOMP_TYPE_LS2) {
+        assert(de->c_len == 2);
+        for(i = 0; i < de->len; i++) {
+            ci = &unicode_db[de->code + i];
+            if (ci->decomp_len == 0)
+                c = 0;
+            else
+                c = ci->decomp_data[0];
+            put16(data_buf, &idx,  c);
+
+            if (ci->decomp_len == 0)
+                c = 0;
+            else
+                c = ci->decomp_data[1];
+            c = get_short_code(c);
+            assert(c >= 0);
+            data_buf[idx++] = c;
+        }
+    } else if (de->type <= DECOMP_TYPE_PAT3) {
+        ci = &unicode_db[de->code];
+        assert(ci->decomp_len == 3);
+        put16(data_buf, &idx,  ci->decomp_data[0]);
+        put16(data_buf, &idx,  ci->decomp_data[2]);
+        for(i = 0; i < de->len; i++) {
+            ci = &unicode_db[de->code + i];
+            assert(ci->decomp_len == 3);
+            put16(data_buf, &idx,  ci->decomp_data[1]);
+        }
+    } else if (de->type <= DECOMP_TYPE_S2_UL) {
+        for(i = 0; i < de->len; i += 2) {
+            ci = &unicode_db[de->code + i];
+            c = ci->decomp_data[0];
+            c = get_short_code(c);
+            assert(c >= 0);
+            data_buf[idx++] = c;
+            c = ci->decomp_data[1];
+            c = get_short_code(c);
+            assert(c >= 0);
+            data_buf[idx++] = c;
+        }
+    } else if (de->type <= DECOMP_TYPE_LS2_UL) {
+        for(i = 0; i < de->len; i += 2) {
+            ci = &unicode_db[de->code + i];
+            c = ci->decomp_data[0];
+            put16(data_buf, &idx,  c);
+            c = ci->decomp_data[1];
+            c = get_short_code(c);
+            assert(c >= 0);
+            data_buf[idx++] = c;
+        }
+    } else {
+        abort();
+    }
+    *pidx = idx;
+}
+
+#if 0
+void dump_large_char(void)
+{
+    int i, j;
+    for(i = 0; i <= CHARCODE_MAX; i++) {
+        CCInfo *ci = &unicode_db[i];
+        for(j = 0; j < ci->decomp_len; j++) {
+            if (ci->decomp_data[j] > 0xffff)
+                printf("%05x\n", ci->decomp_data[j]);
+        }
+    }
+}
+#endif
+
+void build_compose_table(FILE *f, const DecompEntry *tab_de);
+
+void build_decompose_table(FILE *f)
+{
+    int i, array_len, code_max, data_len, count;
+    DecompEntry *tab_de, de_s, *de = &de_s;
+    uint8_t *data_buf;
+    
+    code_max = CHARCODE_MAX;
+    
+    tab_de = mallocz((code_max + 2) * sizeof(*tab_de));
+
+    for(i = code_max; i >= 0; i--) {
+        find_decomp_run(tab_de, i);
+    }
+
+    /* build the data buffer */
+    data_buf = malloc(100000);
+    data_len = 0;
+    array_len = 0;
+    for(i = 0; i <= code_max; i++) {
+        de = &tab_de[i];
+        if (de->len != 0) {
+            add_decomp_data(data_buf, &data_len, de);
+            i += de->len - 1;
+            array_len++;
+        }
+    }
+
+#ifdef DUMP_DECOMP_TABLE
+    /* dump */
+    {
+        int size, size1;
+        
+        printf("START LEN   TYPE  L C SIZE\n");
+        size = 0;
+        for(i = 0; i <= code_max; i++) {
+            de = &tab_de[i];
+            if (de->len != 0) {
+                size1 = get_decomp_run_size(de);
+                printf("%05x %3d %6s %2d %1d %4d\n", i, de->len,
+                       decomp_type_str[de->type], de->c_len,
+                       unicode_db[i].is_compat, size1);
+                i += de->len - 1;
+                size += size1;
+            }
+        }
+        
+        printf("array_len=%d estimated size=%d bytes actual=%d bytes\n",
+               array_len, size, array_len * 6 + data_len);
+    }
+#endif
+
+    fprintf(f, "static const uint32_t unicode_decomp_table1[%u] = {",
+            array_len);
+    count = 0;
+    for(i = 0; i <= code_max; i++) {
+        de = &tab_de[i];
+        if (de->len != 0) {
+            uint32_t v;
+            if (count++ % 4 == 0)
+                fprintf(f, "\n   ");
+            v = (de->code << (32 - 18)) |
+                (de->len << (32 - 18 - 7)) |
+                (de->type << (32 - 18 - 7 - 6)) |
+                unicode_db[de->code].is_compat;
+            fprintf(f, " 0x%08x,", v);
+            i += de->len - 1;
+        }
+    }
+    fprintf(f, "\n};\n\n");
+
+    fprintf(f, "static const uint16_t unicode_decomp_table2[%u] = {",
+            array_len);
+    count = 0;
+    for(i = 0; i <= code_max; i++) {
+        de = &tab_de[i];
+        if (de->len != 0) {
+            if (count++ % 8 == 0)
+                fprintf(f, "\n   ");
+            fprintf(f, " 0x%04x,", de->data_index);
+            i += de->len - 1;
+        }
+    }
+    fprintf(f, "\n};\n\n");
+    
+    fprintf(f, "static const uint8_t unicode_decomp_data[%u] = {",
+            data_len);
+    for(i = 0; i < data_len; i++) {
+        if (i % 8 == 0)
+            fprintf(f, "\n   ");
+        fprintf(f, " 0x%02x,", data_buf[i]);
+    }
+    fprintf(f, "\n};\n\n");
+
+    build_compose_table(f, tab_de);
+
+    free(data_buf);
+    
+    free(tab_de);
+}
+
+typedef struct {
+    uint32_t c[2];
+    uint32_t p;
+} ComposeEntry;
+
+#define COMPOSE_LEN_MAX 10000
+
+static int ce_cmp(const void *p1, const void *p2)
+{
+    const ComposeEntry *ce1 = p1;
+    const ComposeEntry *ce2 = p2;
+    int i;
+
+    for(i = 0; i < 2; i++) {
+        if (ce1->c[i] < ce2->c[i])
+            return -1;
+        else if (ce1->c[i] > ce2->c[i])
+            return 1;
+    }
+    return 0;
+}
+
+
+static int get_decomp_pos(const DecompEntry *tab_de, int c)
+{
+    int i, v, k;
+    const DecompEntry *de;
+    
+    k = 0;
+    for(i = 0; i <= CHARCODE_MAX; i++) {
+        de = &tab_de[i];
+        if (de->len != 0) {
+            if (c >= de->code && c < de->code + de->len) {
+                v = c - de->code;
+                assert(v < 64);
+                v |= k << 6;
+                assert(v < 65536);
+                return v;
+            }
+            i += de->len - 1;
+            k++;
+        }
+    }
+    return -1;
+}
+
+void build_compose_table(FILE *f, const DecompEntry *tab_de)
+{
+    int i, v, tab_ce_len;
+    ComposeEntry *ce, *tab_ce;
+    
+    tab_ce = malloc(sizeof(*tab_ce) * COMPOSE_LEN_MAX);
+    tab_ce_len = 0;
+    for(i = 0; i <= CHARCODE_MAX; i++) {
+        CCInfo *ci = &unicode_db[i];
+        if (ci->decomp_len == 2 && !ci->is_compat &&
+            !ci->is_excluded) {
+            assert(tab_ce_len < COMPOSE_LEN_MAX); 
+            ce = &tab_ce[tab_ce_len++];
+            ce->c[0] = ci->decomp_data[0];
+            ce->c[1] = ci->decomp_data[1];
+            ce->p = i;
+        }
+    }
+    qsort(tab_ce, tab_ce_len, sizeof(*tab_ce), ce_cmp);
+
+#if 0
+    {
+        printf("tab_ce_len=%d\n", tab_ce_len);
+        for(i = 0; i < tab_ce_len; i++) {
+            ce = &tab_ce[i];
+            printf("%05x %05x %05x\n", ce->c[0], ce->c[1], ce->p);
+        }
+    }
+#endif
+    
+    fprintf(f, "static const uint16_t unicode_comp_table[%u] = {",
+            tab_ce_len);
+    for(i = 0; i < tab_ce_len; i++) {
+        if (i % 8 == 0)
+            fprintf(f, "\n   ");
+        v = get_decomp_pos(tab_de, tab_ce[i].p);
+        if (v < 0) {
+            printf("ERROR: entry for c=%04x not found\n",
+                   tab_ce[i].p);
+            exit(1);
+        }
+        fprintf(f, " 0x%04x,", v);
+    }
+    fprintf(f, "\n};\n\n");
+    
+    free(tab_ce);
+}
+
+#ifdef USE_TEST
+void check_decompose_table(void)
+{
+    int c;
+    CCInfo *ci;
+    int res[UNICODE_DECOMP_LEN_MAX], *ref;
+    int len, ref_len, is_compat;
+
+    for(is_compat = 0; is_compat <= 1; is_compat++) {
+        for(c = 0; c < CHARCODE_MAX; c++) {
+            ci = &unicode_db[c];
+            ref_len = ci->decomp_len;
+            ref = ci->decomp_data;
+            if (!is_compat && ci->is_compat) {
+                ref_len = 0;
+            }
+            len = unicode_decomp_char((uint32_t *)res, c, is_compat);
+            if (len != ref_len ||
+                tabcmp(res, ref, ref_len) != 0) {
+                printf("ERROR c=%05x compat=%d\n", c, is_compat);
+                dump_str("res", res, len);
+                dump_str("ref", ref, ref_len);
+                exit(1);
+            }
+        }
+    }
+}
+
+void check_compose_table(void)
+{
+    int i, p;
+    /* XXX: we don't test all the cases */
+
+    for(i = 0; i <= CHARCODE_MAX; i++) {
+        CCInfo *ci = &unicode_db[i];
+        if (ci->decomp_len == 2 && !ci->is_compat &&
+            !ci->is_excluded) {
+            p = unicode_compose_pair(ci->decomp_data[0], ci->decomp_data[1]);
+            if (p != i) {
+                printf("ERROR compose: c=%05x %05x -> %05x ref=%05x\n",
+                       ci->decomp_data[0], ci->decomp_data[1], p, i);
+                exit(1);
+            }
+        }
+    }
+    
+
+
+}
+
+#endif
+
+
+
+#ifdef USE_TEST
+
+void check_str(const char *msg, int num, const int *in_buf, int in_len,
+               const int *buf1, int len1,
+               const int *buf2, int len2)
+{
+    if (len1 != len2 || tabcmp(buf1, buf2, len1) != 0) {
+        printf("%d: ERROR %s:\n", num, msg);
+        dump_str(" in", in_buf, in_len);
+        dump_str("res", buf1, len1);
+        dump_str("ref", buf2, len2);
+        exit(1);
+    }
+}
+
+void check_cc_table(void)
+{
+    int cc, cc_ref, c;
+
+    for(c = 0; c <= CHARCODE_MAX; c++) {
+        cc_ref = unicode_db[c].combining_class;
+        cc = unicode_get_cc(c);
+        if (cc != cc_ref) {
+            printf("ERROR: c=%04x cc=%d cc_ref=%d\n",
+                   c, cc, cc_ref);
+            exit(1);
+        }
+    }
+#ifdef PROFILE
+    {
+        int64_t ti, count;
+    
+        ti = get_time_ns();
+        count = 0;
+        /* only do it on meaningful chars */
+        for(c = 0x20; c <= 0xffff; c++) {
+            cc_ref = unicode_db[c].combining_class;
+            cc = unicode_get_cc(c);
+            count++;
+        }
+        ti = get_time_ns() - ti;
+        printf("cc time=%0.1f ns/char\n",
+               (double)ti / count);
+    }
+#endif
+}
+
+void normalization_test(const char *filename)
+{
+    FILE *f;
+    char line[4096], *p;
+    int *in_str, *nfc_str, *nfd_str, *nfkc_str, *nfkd_str;
+    int in_len, nfc_len, nfd_len, nfkc_len, nfkd_len;
+    int *buf, buf_len, pos;
+    
+    f = fopen(filename, "rb");
+    if (!f) {
+        perror(filename);
+        exit(1);
+    }
+    pos = 0;
+    for(;;) {
+        if (!get_line(line, sizeof(line), f))
+            break;
+        pos++;
+        p = line;
+        while (isspace(*p))
+            p++;
+        if (*p == '#' || *p == '@')
+            continue;
+        in_str = get_field_str(&in_len, p, 0);
+        nfc_str = get_field_str(&nfc_len, p, 1);
+        nfd_str = get_field_str(&nfd_len, p, 2);
+        nfkc_str = get_field_str(&nfkc_len, p, 3);
+        nfkd_str = get_field_str(&nfkd_len, p, 4);
+
+        //        dump_str("in", in_str, in_len);
+
+        buf_len = unicode_normalize((uint32_t **)&buf, (uint32_t *)in_str, in_len, UNICODE_NFD, NULL, NULL);
+        check_str("nfd", pos, in_str, in_len, buf, buf_len, nfd_str, nfd_len);
+        free(buf);
+
+        buf_len = unicode_normalize((uint32_t **)&buf, (uint32_t *)in_str, in_len, UNICODE_NFKD, NULL, NULL);
+        check_str("nfkd", pos, in_str, in_len, buf, buf_len, nfkd_str, nfkd_len);
+        free(buf);
+        
+        buf_len = unicode_normalize((uint32_t **)&buf, (uint32_t *)in_str, in_len, UNICODE_NFC, NULL, NULL);
+        check_str("nfc", pos, in_str, in_len, buf, buf_len, nfc_str, nfc_len);
+        free(buf);
+
+        buf_len = unicode_normalize((uint32_t **)&buf, (uint32_t *)in_str, in_len, UNICODE_NFKC, NULL, NULL);
+        check_str("nfkc", pos, in_str, in_len, buf, buf_len, nfkc_str, nfkc_len);
+        free(buf);
+
+        free(in_str);
+        free(nfc_str);
+        free(nfd_str);
+        free(nfkc_str);
+        free(nfkd_str);
+    }
+    fclose(f);
+}
+#endif
+
+int main(int argc, char **argv)
+{
+    const char *unicode_db_path, *outfilename;
+    char filename[1024];
+    
+    if (argc < 2) {
+        printf("usage: %s unicode_db_path [output_file]\n"
+               "\n"
+               "If no output_file is given, a self test is done using the current unicode library\n",
+               argv[0]);
+        exit(1);
+    }
+    unicode_db_path = argv[1];
+    outfilename = NULL;
+    if (argc >= 3)
+        outfilename = argv[2];
+
+    unicode_db = mallocz(sizeof(unicode_db[0]) * (CHARCODE_MAX + 1));
+
+    snprintf(filename, sizeof(filename), "%s/UnicodeData.txt", unicode_db_path);
+
+    parse_unicode_data(filename);
+
+    snprintf(filename, sizeof(filename), "%s/SpecialCasing.txt", unicode_db_path);
+    parse_special_casing(unicode_db, filename);
+    
+    snprintf(filename, sizeof(filename), "%s/CaseFolding.txt", unicode_db_path);
+    parse_case_folding(unicode_db, filename);
+
+    snprintf(filename, sizeof(filename), "%s/CompositionExclusions.txt", unicode_db_path);
+    parse_composition_exclusions(filename);
+    
+    snprintf(filename, sizeof(filename), "%s/DerivedCoreProperties.txt", unicode_db_path);
+    parse_derived_core_properties(filename);
+
+    snprintf(filename, sizeof(filename), "%s/DerivedNormalizationProps.txt", unicode_db_path);
+    parse_derived_norm_properties(filename);
+
+    snprintf(filename, sizeof(filename), "%s/PropList.txt", unicode_db_path);
+    parse_prop_list(filename);
+
+    snprintf(filename, sizeof(filename), "%s/Scripts.txt", unicode_db_path);
+    parse_scripts(filename);
+
+    snprintf(filename, sizeof(filename), "%s/ScriptExtensions.txt",
+             unicode_db_path);
+    parse_script_extensions(filename);
+                        
+    snprintf(filename, sizeof(filename), "%s/emoji-data.txt",
+             unicode_db_path);
+    parse_prop_list(filename);
+
+    //    dump_data(unicode_db);
+
+    build_conv_table(unicode_db);
+    
+    //    dump_table();
+
+    if (!outfilename) {
+#ifdef USE_TEST
+        check_case_conv();
+        check_flags();
+        check_decompose_table();
+        check_compose_table();
+        check_cc_table();
+        snprintf(filename, sizeof(filename), "%s/NormalizationTest.txt", unicode_db_path);
+        normalization_test(filename);
+#else
+        fprintf(stderr, "Tests are not compiled\n");
+        exit(1);
+#endif
+    } else
+    {
+        FILE *fo = fopen(outfilename, "wb");
+        
+        if (!fo) {
+            perror(outfilename);
+            exit(1);
+        }
+        fprintf(fo,
+                "/* Compressed unicode tables */\n"
+                "/* Automatically generated file - do not edit */\n"
+                "\n"
+                "#include <stdint.h>\n"
+                "\n");
+        dump_case_conv_table(fo);
+        compute_internal_props();
+        build_flags_tables(fo);
+        fprintf(fo, "#ifdef CONFIG_ALL_UNICODE\n\n");
+        build_cc_table(fo);
+        build_decompose_table(fo);
+        build_general_category_table(fo);
+        build_script_table(fo);
+        build_script_ext_table(fo);
+        build_prop_list_table(fo);
+        fprintf(fo, "#endif /* CONFIG_ALL_UNICODE */\n");
+        fclose(fo);
+    }
+    return 0;
+}
diff --git a/thirdparty/quickjs/quickjs-2019-07-09-dust3d/unicode_gen_def.h b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/unicode_gen_def.h
new file mode 100755
index 00000000..3149e474
--- /dev/null
+++ b/thirdparty/quickjs/quickjs-2019-07-09-dust3d/unicode_gen_def.h
@@ -0,0 +1,275 @@
+#ifdef UNICODE_GENERAL_CATEGORY
+DEF(Cn, "Unassigned") /* must be zero */
+DEF(Lu, "Uppercase_Letter")
+DEF(Ll, "Lowercase_Letter")
+DEF(Lt, "Titlecase_Letter")
+DEF(Lm, "Modifier_Letter")
+DEF(Lo, "Other_Letter")
+DEF(Mn, "Nonspacing_Mark")
+DEF(Mc, "Spacing_Mark")
+DEF(Me, "Enclosing_Mark")
+DEF(Nd, "Decimal_Number,digit")
+DEF(Nl, "Letter_Number")
+DEF(No, "Other_Number")
+DEF(Sm, "Math_Symbol")
+DEF(Sc, "Currency_Symbol")
+DEF(Sk, "Modifier_Symbol")
+DEF(So, "Other_Symbol")
+DEF(Pc, "Connector_Punctuation")
+DEF(Pd, "Dash_Punctuation")
+DEF(Ps, "Open_Punctuation")
+DEF(Pe, "Close_Punctuation")
+DEF(Pi, "Initial_Punctuation")
+DEF(Pf, "Final_Punctuation")
+DEF(Po, "Other_Punctuation")
+DEF(Zs, "Space_Separator")
+DEF(Zl, "Line_Separator")
+DEF(Zp, "Paragraph_Separator")
+DEF(Cc, "Control,cntrl")
+DEF(Cf, "Format")
+DEF(Cs, "Surrogate")
+DEF(Co, "Private_Use")
+/* synthetic properties */
+DEF(LC, "Cased_Letter")
+DEF(L, "Letter")
+DEF(M, "Mark,Combining_Mark")
+DEF(N, "Number")
+DEF(S, "Symbol")
+DEF(P, "Punctuation,punct")
+DEF(Z, "Separator")
+DEF(C, "Other")
+#endif
+
+#ifdef UNICODE_SCRIPT
+DEF(Unknown, "Zzzz")
+DEF(Adlam, "Adlm")
+DEF(Ahom, "Ahom")
+DEF(Anatolian_Hieroglyphs, "Hluw")
+DEF(Arabic, "Arab")
+DEF(Armenian, "Armn")
+DEF(Avestan, "Avst")
+DEF(Balinese, "Bali")
+DEF(Bamum, "Bamu")
+DEF(Bassa_Vah, "Bass")
+DEF(Batak, "Batk")
+DEF(Bengali, "Beng")
+DEF(Bhaiksuki, "Bhks")
+DEF(Bopomofo, "Bopo")
+DEF(Brahmi, "Brah")
+DEF(Braille, "Brai")
+DEF(Buginese, "Bugi")
+DEF(Buhid, "Buhd")
+DEF(Canadian_Aboriginal, "Cans")
+DEF(Carian, "Cari")
+DEF(Caucasian_Albanian, "Aghb")
+DEF(Chakma, "Cakm")
+DEF(Cham, "Cham")
+DEF(Cherokee, "Cher")
+DEF(Common, "Zyyy")
+DEF(Coptic, "Copt,Qaac")
+DEF(Cuneiform, "Xsux")
+DEF(Cypriot, "Cprt")
+DEF(Cyrillic, "Cyrl")
+DEF(Deseret, "Dsrt")
+DEF(Devanagari, "Deva")
+DEF(Dogra, "Dogr")
+DEF(Duployan, "Dupl")
+DEF(Egyptian_Hieroglyphs, "Egyp")
+DEF(Elbasan, "Elba")
+DEF(Ethiopic, "Ethi")
+DEF(Georgian, "Geor")
+DEF(Glagolitic, "Glag")
+DEF(Gothic, "Goth")
+DEF(Grantha, "Gran")
+DEF(Greek, "Grek")
+DEF(Gujarati, "Gujr")
+DEF(Gunjala_Gondi, "Gong")
+DEF(Gurmukhi, "Guru")
+DEF(Han, "Hani")
+DEF(Hangul, "Hang")
+DEF(Hanifi_Rohingya, "Rohg")
+DEF(Hanunoo, "Hano")
+DEF(Hatran, "Hatr")
+DEF(Hebrew, "Hebr")
+DEF(Hiragana, "Hira")
+DEF(Imperial_Aramaic, "Armi")
+DEF(Inherited, "Zinh,Qaai")
+DEF(Inscriptional_Pahlavi, "Phli")
+DEF(Inscriptional_Parthian, "Prti")
+DEF(Javanese, "Java")
+DEF(Kaithi, "Kthi")
+DEF(Kannada, "Knda")
+DEF(Katakana, "Kana")
+DEF(Kayah_Li, "Kali")
+DEF(Kharoshthi, "Khar")
+DEF(Khmer, "Khmr")
+DEF(Khojki, "Khoj")
+DEF(Khudawadi, "Sind")
+DEF(Lao, "Laoo")
+DEF(Latin, "Latn")
+DEF(Lepcha, "Lepc")
+DEF(Limbu, "Limb")
+DEF(Linear_A, "Lina")
+DEF(Linear_B, "Linb")
+DEF(Lisu, "Lisu")
+DEF(Lycian, "Lyci")
+DEF(Lydian, "Lydi")
+DEF(Makasar, "Maka")
+DEF(Mahajani, "Mahj")
+DEF(Malayalam, "Mlym")
+DEF(Mandaic, "Mand")
+DEF(Manichaean, "Mani")
+DEF(Marchen, "Marc")
+DEF(Masaram_Gondi, "Gonm")
+DEF(Medefaidrin, "Medf")
+DEF(Meetei_Mayek, "Mtei")
+DEF(Mende_Kikakui, "Mend")
+DEF(Meroitic_Cursive, "Merc")
+DEF(Meroitic_Hieroglyphs, "Mero")
+DEF(Miao, "Plrd")
+DEF(Modi, "Modi")
+DEF(Mongolian, "Mong")
+DEF(Mro, "Mroo")
+DEF(Multani, "Mult")
+DEF(Myanmar, "Mymr")
+DEF(Nabataean, "Nbat")
+DEF(New_Tai_Lue, "Talu")
+DEF(Newa, "Newa")
+DEF(Nko, "Nkoo")
+DEF(Nushu, "Nshu")
+DEF(Ogham, "Ogam")
+DEF(Ol_Chiki, "Olck")
+DEF(Old_Hungarian, "Hung")
+DEF(Old_Italic, "Ital")
+DEF(Old_North_Arabian, "Narb")
+DEF(Old_Permic, "Perm")
+DEF(Old_Persian, "Xpeo")
+DEF(Old_Sogdian, "Sogo")
+DEF(Old_South_Arabian, "Sarb")
+DEF(Old_Turkic, "Orkh")
+DEF(Oriya, "Orya")
+DEF(Osage, "Osge")
+DEF(Osmanya, "Osma")
+DEF(Pahawh_Hmong, "Hmng")
+DEF(Palmyrene, "Palm")
+DEF(Pau_Cin_Hau, "Pauc")
+DEF(Phags_Pa, "Phag")
+DEF(Phoenician, "Phnx")
+DEF(Psalter_Pahlavi, "Phlp")
+DEF(Rejang, "Rjng")
+DEF(Runic, "Runr")
+DEF(Samaritan, "Samr")
+DEF(Saurashtra, "Saur")
+DEF(Sharada, "Shrd")
+DEF(Shavian, "Shaw")
+DEF(Siddham, "Sidd")
+DEF(SignWriting, "Sgnw")
+DEF(Sinhala, "Sinh")
+DEF(Sogdian, "Sogd")
+DEF(Sora_Sompeng, "Sora")
+DEF(Soyombo, "Soyo")
+DEF(Sundanese, "Sund")
+DEF(Syloti_Nagri, "Sylo")
+DEF(Syriac, "Syrc")
+DEF(Tagalog, "Tglg")
+DEF(Tagbanwa, "Tagb")
+DEF(Tai_Le, "Tale")
+DEF(Tai_Tham, "Lana")
+DEF(Tai_Viet, "Tavt")
+DEF(Takri, "Takr")
+DEF(Tamil, "Taml")
+DEF(Tangut, "Tang")
+DEF(Telugu, "Telu")
+DEF(Thaana, "Thaa")
+DEF(Thai, "Thai")
+DEF(Tibetan, "Tibt")
+DEF(Tifinagh, "Tfng")
+DEF(Tirhuta, "Tirh")
+DEF(Ugaritic, "Ugar")
+DEF(Vai, "Vaii")
+DEF(Warang_Citi, "Wara")
+DEF(Yi, "Yiii")
+DEF(Zanabazar_Square, "Zanb")
+#endif
+
+#ifdef UNICODE_PROP_LIST
+/* Prop list not exported to regexp */
+DEF(Hyphen, "")
+DEF(Other_Math, "")
+DEF(Other_Alphabetic, "")
+DEF(Other_Lowercase, "")
+DEF(Other_Uppercase, "")
+DEF(Other_Grapheme_Extend, "")
+DEF(Other_Default_Ignorable_Code_Point, "")
+DEF(Other_ID_Start, "")
+DEF(Other_ID_Continue, "")
+DEF(Prepended_Concatenation_Mark, "")
+/* additional computed properties for smaller tables */
+DEF(ID_Continue1, "")
+DEF(XID_Start1, "")
+DEF(XID_Continue1, "")
+DEF(Changes_When_Titlecased1, "")
+DEF(Changes_When_Casefolded1, "")
+DEF(Changes_When_NFKC_Casefolded1, "")
+
+/* Prop list exported to JS */
+DEF(ASCII_Hex_Digit, "AHex")
+DEF(Bidi_Control, "Bidi_C")
+DEF(Dash, "")
+DEF(Deprecated, "Dep")
+DEF(Diacritic, "Dia")
+DEF(Extender, "Ext")
+DEF(Hex_Digit, "Hex")
+DEF(IDS_Binary_Operator, "IDSB")
+DEF(IDS_Trinary_Operator, "IDST")
+DEF(Ideographic, "Ideo")
+DEF(Join_Control, "Join_C")
+DEF(Logical_Order_Exception, "LOE")
+DEF(Noncharacter_Code_Point, "NChar")
+DEF(Pattern_Syntax, "Pat_Syn")
+DEF(Pattern_White_Space, "Pat_WS")
+DEF(Quotation_Mark, "QMark")
+DEF(Radical, "")
+DEF(Regional_Indicator, "RI")
+DEF(Sentence_Terminal, "STerm")
+DEF(Soft_Dotted, "SD")
+DEF(Terminal_Punctuation, "Term")
+DEF(Unified_Ideograph, "UIdeo")
+DEF(Variation_Selector, "VS")
+DEF(White_Space, "space")
+DEF(Bidi_Mirrored, "Bidi_M")
+DEF(Emoji, "")
+DEF(Emoji_Component, "")
+DEF(Emoji_Modifier, "")
+DEF(Emoji_Modifier_Base, "")
+DEF(Emoji_Presentation, "")
+DEF(Extended_Pictographic, "")
+DEF(Default_Ignorable_Code_Point, "DI")
+DEF(ID_Start, "IDS")
+DEF(Case_Ignorable, "CI")
+
+/* other binary properties */
+DEF(ASCII,"")
+DEF(Alphabetic, "Alpha")
+DEF(Any, "")
+DEF(Assigned,"")
+DEF(Cased, "")
+DEF(Changes_When_Casefolded, "CWCF")
+DEF(Changes_When_Casemapped, "CWCM")
+DEF(Changes_When_Lowercased, "CWL")
+DEF(Changes_When_NFKC_Casefolded, "CWKCF")
+DEF(Changes_When_Titlecased, "CWT")
+DEF(Changes_When_Uppercased, "CWU")
+DEF(Grapheme_Base, "Gr_Base")
+DEF(Grapheme_Extend, "Gr_Ext")
+DEF(ID_Continue, "IDC")
+DEF(Lowercase, "Lower")
+DEF(Math, "")
+DEF(Uppercase, "Upper")
+DEF(XID_Continue, "XIDC")
+DEF(XID_Start, "XIDS")
+
+/* internal tables with index */
+DEF(Cased1, "")
+
+#endif
diff --git a/thirdparty/three.js/LICENSE b/thirdparty/three.js/LICENSE
new file mode 100755
index 00000000..d3400897
--- /dev/null
+++ b/thirdparty/three.js/LICENSE
@@ -0,0 +1,21 @@
+The MIT License
+
+Copyright © 2010-2019 three.js authors
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/thirdparty/three.js/README.md b/thirdparty/three.js/README.md
new file mode 100755
index 00000000..788179fc
--- /dev/null
+++ b/thirdparty/three.js/README.md
@@ -0,0 +1 @@
+This is a modified version, which only includes limited 3D Math libraries for Dust3D, please check [three.js](https://threejs.org/) for full version.
diff --git a/thirdparty/three.js/dust3d.three.js b/thirdparty/three.js/dust3d.three.js
new file mode 100755
index 00000000..1e657dd6
--- /dev/null
+++ b/thirdparty/three.js/dust3d.three.js
@@ -0,0 +1,1455 @@
+var _Math = {};
+var Vector3 = {};
+var Quaternion = {};
+
+_Math = {
+
+	DEG2RAD: Math.PI / 180,
+	RAD2DEG: 180 / Math.PI,
+
+	generateUUID: ( function () {
+
+		// http://stackoverflow.com/questions/105034/how-to-create-a-guid-uuid-in-javascript/21963136#21963136
+
+		var lut = [];
+
+		for ( var i = 0; i < 256; i ++ ) {
+
+			lut[ i ] = ( i < 16 ? '0' : '' ) + ( i ).toString( 16 );
+
+		}
+
+		return function generateUUID() {
+
+			var d0 = Math.random() * 0xffffffff | 0;
+			var d1 = Math.random() * 0xffffffff | 0;
+			var d2 = Math.random() * 0xffffffff | 0;
+			var d3 = Math.random() * 0xffffffff | 0;
+			var uuid = lut[ d0 & 0xff ] + lut[ d0 >> 8 & 0xff ] + lut[ d0 >> 16 & 0xff ] + lut[ d0 >> 24 & 0xff ] + '-' +
+				lut[ d1 & 0xff ] + lut[ d1 >> 8 & 0xff ] + '-' + lut[ d1 >> 16 & 0x0f | 0x40 ] + lut[ d1 >> 24 & 0xff ] + '-' +
+				lut[ d2 & 0x3f | 0x80 ] + lut[ d2 >> 8 & 0xff ] + '-' + lut[ d2 >> 16 & 0xff ] + lut[ d2 >> 24 & 0xff ] +
+				lut[ d3 & 0xff ] + lut[ d3 >> 8 & 0xff ] + lut[ d3 >> 16 & 0xff ] + lut[ d3 >> 24 & 0xff ];
+
+			// .toUpperCase() here flattens concatenated strings to save heap memory space.
+			return uuid.toUpperCase();
+
+		};
+
+	} )(),
+
+	clamp: function ( value, min, max ) {
+
+		return Math.max( min, Math.min( max, value ) );
+
+	},
+
+	// compute euclidian modulo of m % n
+	// https://en.wikipedia.org/wiki/Modulo_operation
+
+	euclideanModulo: function ( n, m ) {
+
+		return ( ( n % m ) + m ) % m;
+
+	},
+
+	// Linear mapping from range <a1, a2> to range <b1, b2>
+
+	mapLinear: function ( x, a1, a2, b1, b2 ) {
+
+		return b1 + ( x - a1 ) * ( b2 - b1 ) / ( a2 - a1 );
+
+	},
+
+	// https://en.wikipedia.org/wiki/Linear_interpolation
+
+	lerp: function ( x, y, t ) {
+
+		return ( 1 - t ) * x + t * y;
+
+	},
+
+	// http://en.wikipedia.org/wiki/Smoothstep
+
+	smoothstep: function ( x, min, max ) {
+
+		if ( x <= min ) return 0;
+		if ( x >= max ) return 1;
+
+		x = ( x - min ) / ( max - min );
+
+		return x * x * ( 3 - 2 * x );
+
+	},
+
+	smootherstep: function ( x, min, max ) {
+
+		if ( x <= min ) return 0;
+		if ( x >= max ) return 1;
+
+		x = ( x - min ) / ( max - min );
+
+		return x * x * x * ( x * ( x * 6 - 15 ) + 10 );
+
+	},
+
+	// Random integer from <low, high> interval
+
+	randInt: function ( low, high ) {
+
+		return low + Math.floor( Math.random() * ( high - low + 1 ) );
+
+	},
+
+	// Random float from <low, high> interval
+
+	randFloat: function ( low, high ) {
+
+		return low + Math.random() * ( high - low );
+
+	},
+
+	// Random float from <-range/2, range/2> interval
+
+	randFloatSpread: function ( range ) {
+
+		return range * ( 0.5 - Math.random() );
+
+	},
+
+	degToRad: function ( degrees ) {
+
+		return degrees * _Math.DEG2RAD;
+
+	},
+
+	radToDeg: function ( radians ) {
+
+		return radians * _Math.RAD2DEG;
+
+	},
+
+	isPowerOfTwo: function ( value ) {
+
+		return ( value & ( value - 1 ) ) === 0 && value !== 0;
+
+	},
+
+	ceilPowerOfTwo: function ( value ) {
+
+		return Math.pow( 2, Math.ceil( Math.log( value ) / Math.LN2 ) );
+
+	},
+
+	floorPowerOfTwo: function ( value ) {
+
+		return Math.pow( 2, Math.floor( Math.log( value ) / Math.LN2 ) );
+
+	}
+
+};
+
+//////////////////////////////////////////////////////////////////////////////
+
+Quaternion = function ( x, y, z, w ) {
+
+	this._x = x || 0;
+	this._y = y || 0;
+	this._z = z || 0;
+	this._w = ( w !== undefined ) ? w : 1;
+
+	this.slerp = function ( qa, qb, qm, t ) {
+
+		return qm.copy( qa ).slerp( qb, t );
+
+	},
+
+	this.slerpFlat = function ( dst, dstOffset, src0, srcOffset0, src1, srcOffset1, t ) {
+
+		// fuzz-free, array-based Quaternion SLERP operation
+
+		var x0 = src0[ srcOffset0 + 0 ],
+			y0 = src0[ srcOffset0 + 1 ],
+			z0 = src0[ srcOffset0 + 2 ],
+			w0 = src0[ srcOffset0 + 3 ],
+
+			x1 = src1[ srcOffset1 + 0 ],
+			y1 = src1[ srcOffset1 + 1 ],
+			z1 = src1[ srcOffset1 + 2 ],
+			w1 = src1[ srcOffset1 + 3 ];
+
+		if ( w0 !== w1 || x0 !== x1 || y0 !== y1 || z0 !== z1 ) {
+
+			var s = 1 - t,
+
+				cos = x0 * x1 + y0 * y1 + z0 * z1 + w0 * w1,
+
+				dir = ( cos >= 0 ? 1 : - 1 ),
+				sqrSin = 1 - cos * cos;
+
+			// Skip the Slerp for tiny steps to avoid numeric problems:
+			if ( sqrSin > Number.EPSILON ) {
+
+				var sin = Math.sqrt( sqrSin ),
+					len = Math.atan2( sin, cos * dir );
+
+				s = Math.sin( s * len ) / sin;
+				t = Math.sin( t * len ) / sin;
+
+			}
+
+			var tDir = t * dir;
+
+			x0 = x0 * s + x1 * tDir;
+			y0 = y0 * s + y1 * tDir;
+			z0 = z0 * s + z1 * tDir;
+			w0 = w0 * s + w1 * tDir;
+
+			// Normalize in case we just did a lerp:
+			if ( s === 1 - t ) {
+
+				var f = 1 / Math.sqrt( x0 * x0 + y0 * y0 + z0 * z0 + w0 * w0 );
+
+				x0 *= f;
+				y0 *= f;
+				z0 *= f;
+				w0 *= f;
+
+			}
+
+		}
+
+		dst[ dstOffset ] = x0;
+		dst[ dstOffset + 1 ] = y0;
+		dst[ dstOffset + 2 ] = z0;
+		dst[ dstOffset + 3 ] = w0;
+
+	};
+
+    this.isQuaternion = true;
+
+	this.set = function ( x, y, z, w ) {
+
+		this._x = x;
+		this._y = y;
+		this._z = z;
+		this._w = w;
+
+		return this;
+
+	};
+
+	this.clone = function () {
+
+		return new this.constructor( this._x, this._y, this._z, this._w );
+
+	};
+
+	this.copy = function ( quaternion ) {
+
+		this._x = quaternion.x;
+		this._y = quaternion.y;
+		this._z = quaternion.z;
+		this._w = quaternion.w;
+
+		return this;
+
+	};
+
+	this.setFromEuler = function ( euler, update ) {
+
+		if ( ! ( euler && euler.isEuler ) ) {
+
+			throw new Error( 'Quaternion: .setFromEuler() now expects an Euler rotation rather than a Vector3 and order.' );
+
+		}
+
+		var x = euler._x, y = euler._y, z = euler._z, order = euler.order;
+
+		// http://www.mathworks.com/matlabcentral/fileexchange/
+		// 	20696-function-to-convert-between-dcm-euler-angles-quaternions-and-euler-vectors/
+		//	content/SpinCalc.m
+
+		var cos = Math.cos;
+		var sin = Math.sin;
+
+		var c1 = cos( x / 2 );
+		var c2 = cos( y / 2 );
+		var c3 = cos( z / 2 );
+
+		var s1 = sin( x / 2 );
+		var s2 = sin( y / 2 );
+		var s3 = sin( z / 2 );
+
+		if ( order === 'XYZ' ) {
+
+			this._x = s1 * c2 * c3 + c1 * s2 * s3;
+			this._y = c1 * s2 * c3 - s1 * c2 * s3;
+			this._z = c1 * c2 * s3 + s1 * s2 * c3;
+			this._w = c1 * c2 * c3 - s1 * s2 * s3;
+
+		} else if ( order === 'YXZ' ) {
+
+			this._x = s1 * c2 * c3 + c1 * s2 * s3;
+			this._y = c1 * s2 * c3 - s1 * c2 * s3;
+			this._z = c1 * c2 * s3 - s1 * s2 * c3;
+			this._w = c1 * c2 * c3 + s1 * s2 * s3;
+
+		} else if ( order === 'ZXY' ) {
+
+			this._x = s1 * c2 * c3 - c1 * s2 * s3;
+			this._y = c1 * s2 * c3 + s1 * c2 * s3;
+			this._z = c1 * c2 * s3 + s1 * s2 * c3;
+			this._w = c1 * c2 * c3 - s1 * s2 * s3;
+
+		} else if ( order === 'ZYX' ) {
+
+			this._x = s1 * c2 * c3 - c1 * s2 * s3;
+			this._y = c1 * s2 * c3 + s1 * c2 * s3;
+			this._z = c1 * c2 * s3 - s1 * s2 * c3;
+			this._w = c1 * c2 * c3 + s1 * s2 * s3;
+
+		} else if ( order === 'YZX' ) {
+
+			this._x = s1 * c2 * c3 + c1 * s2 * s3;
+			this._y = c1 * s2 * c3 + s1 * c2 * s3;
+			this._z = c1 * c2 * s3 - s1 * s2 * c3;
+			this._w = c1 * c2 * c3 - s1 * s2 * s3;
+
+		} else if ( order === 'XZY' ) {
+
+			this._x = s1 * c2 * c3 - c1 * s2 * s3;
+			this._y = c1 * s2 * c3 - s1 * c2 * s3;
+			this._z = c1 * c2 * s3 + s1 * s2 * c3;
+			this._w = c1 * c2 * c3 + s1 * s2 * s3;
+
+		}
+
+		return this;
+
+	};
+
+	this.setFromAxisAngle = function ( axis, angle ) {
+
+		// http://www.euclideanspace.com/maths/geometry/rotations/conversions/angleToQuaternion/index.htm
+
+		// assumes axis is normalized
+
+		var halfAngle = angle / 2, s = Math.sin( halfAngle );
+
+		this._x = axis.x * s;
+		this._y = axis.y * s;
+		this._z = axis.z * s;
+		this._w = Math.cos( halfAngle );
+
+		return this;
+
+	};
+
+	this.setFromRotationMatrix = function ( m ) {
+
+		// http://www.euclideanspace.com/maths/geometry/rotations/conversions/matrixToQuaternion/index.htm
+
+		// assumes the upper 3x3 of m is a pure rotation matrix (i.e, unscaled)
+
+		var te = m.elements,
+
+			m11 = te[ 0 ], m12 = te[ 4 ], m13 = te[ 8 ],
+			m21 = te[ 1 ], m22 = te[ 5 ], m23 = te[ 9 ],
+			m31 = te[ 2 ], m32 = te[ 6 ], m33 = te[ 10 ],
+
+			trace = m11 + m22 + m33,
+			s;
+
+		if ( trace > 0 ) {
+
+			s = 0.5 / Math.sqrt( trace + 1.0 );
+
+			this._w = 0.25 / s;
+			this._x = ( m32 - m23 ) * s;
+			this._y = ( m13 - m31 ) * s;
+			this._z = ( m21 - m12 ) * s;
+
+		} else if ( m11 > m22 && m11 > m33 ) {
+
+			s = 2.0 * Math.sqrt( 1.0 + m11 - m22 - m33 );
+
+			this._w = ( m32 - m23 ) / s;
+			this._x = 0.25 * s;
+			this._y = ( m12 + m21 ) / s;
+			this._z = ( m13 + m31 ) / s;
+
+		} else if ( m22 > m33 ) {
+
+			s = 2.0 * Math.sqrt( 1.0 + m22 - m11 - m33 );
+
+			this._w = ( m13 - m31 ) / s;
+			this._x = ( m12 + m21 ) / s;
+			this._y = 0.25 * s;
+			this._z = ( m23 + m32 ) / s;
+
+		} else {
+
+			s = 2.0 * Math.sqrt( 1.0 + m33 - m11 - m22 );
+
+			this._w = ( m21 - m12 ) / s;
+			this._x = ( m13 + m31 ) / s;
+			this._y = ( m23 + m32 ) / s;
+			this._z = 0.25 * s;
+
+		}
+
+		return this;
+
+	};
+
+	this.setFromUnitVectors = function ( vFrom, vTo ) {
+
+		// assumes direction vectors vFrom and vTo are normalized
+
+		var EPS = 0.000001;
+
+		var r = vFrom.dot( vTo ) + 1;
+
+		if ( r < EPS ) {
+
+			r = 0;
+
+			if ( Math.abs( vFrom.x ) > Math.abs( vFrom.z ) ) {
+
+				this._x = - vFrom.y;
+				this._y = vFrom.x;
+				this._z = 0;
+				this._w = r;
+
+			} else {
+
+				this._x = 0;
+				this._y = - vFrom.z;
+				this._z = vFrom.y;
+				this._w = r;
+
+			}
+
+		} else {
+
+			// crossVectors( vFrom, vTo ); // inlined to avoid cyclic dependency on Vector3
+
+			this._x = vFrom.y * vTo.z - vFrom.z * vTo.y;
+			this._y = vFrom.z * vTo.x - vFrom.x * vTo.z;
+			this._z = vFrom.x * vTo.y - vFrom.y * vTo.x;
+			this._w = r;
+
+		}
+
+		return this.normalize();
+
+	};
+
+	this.angleTo = function ( q ) {
+
+		return 2 * Math.acos( Math.abs( _Math.clamp( this.dot( q ), - 1, 1 ) ) );
+
+	};
+
+	this.rotateTowards = function ( q, step ) {
+
+		var angle = this.angleTo( q );
+
+		if ( angle === 0 ) return this;
+
+		var t = Math.min( 1, step / angle );
+
+		this.slerp( q, t );
+
+		return this;
+
+	};
+
+	this.inverse = function () {
+
+		// quaternion is assumed to have unit length
+
+		return this.conjugate();
+
+	};
+
+	this.conjugate = function () {
+
+		this._x *= - 1;
+		this._y *= - 1;
+		this._z *= - 1;
+
+		return this;
+
+	};
+
+	this.dot = function ( v ) {
+
+		return this._x * v._x + this._y * v._y + this._z * v._z + this._w * v._w;
+
+	};
+
+	this.lengthSq = function () {
+
+		return this._x * this._x + this._y * this._y + this._z * this._z + this._w * this._w;
+
+	};
+
+	this.length = function () {
+
+		return Math.sqrt( this._x * this._x + this._y * this._y + this._z * this._z + this._w * this._w );
+
+	};
+
+	this.normalize = function () {
+
+		var l = this.length();
+
+		if ( l === 0 ) {
+
+			this._x = 0;
+			this._y = 0;
+			this._z = 0;
+			this._w = 1;
+
+		} else {
+
+			l = 1 / l;
+
+			this._x = this._x * l;
+			this._y = this._y * l;
+			this._z = this._z * l;
+			this._w = this._w * l;
+
+		}
+
+		return this;
+
+	};
+
+	this.multiply = function ( q, p ) {
+
+		if ( p !== undefined ) {
+
+			console.warn( 'Quaternion: .multiply() now only accepts one argument. Use .multiplyQuaternions( a, b ) instead.' );
+			return this.multiplyQuaternions( q, p );
+
+		}
+
+		return this.multiplyQuaternions( this, q );
+
+	};
+
+	this.premultiply = function ( q ) {
+
+		return this.multiplyQuaternions( q, this );
+
+	};
+
+	this.multiplyQuaternions = function ( a, b ) {
+
+		// from http://www.euclideanspace.com/maths/algebra/realNormedAlgebra/quaternions/code/index.htm
+
+		var qax = a._x, qay = a._y, qaz = a._z, qaw = a._w;
+		var qbx = b._x, qby = b._y, qbz = b._z, qbw = b._w;
+
+		this._x = qax * qbw + qaw * qbx + qay * qbz - qaz * qby;
+		this._y = qay * qbw + qaw * qby + qaz * qbx - qax * qbz;
+		this._z = qaz * qbw + qaw * qbz + qax * qby - qay * qbx;
+		this._w = qaw * qbw - qax * qbx - qay * qby - qaz * qbz;
+
+		return this;
+
+	};
+
+	this.slerp = function ( qb, t ) {
+
+		if ( t === 0 ) return this;
+		if ( t === 1 ) return this.copy( qb );
+
+		var x = this._x, y = this._y, z = this._z, w = this._w;
+
+		// http://www.euclideanspace.com/maths/algebra/realNormedAlgebra/quaternions/slerp/
+
+		var cosHalfTheta = w * qb._w + x * qb._x + y * qb._y + z * qb._z;
+
+		if ( cosHalfTheta < 0 ) {
+
+			this._w = - qb._w;
+			this._x = - qb._x;
+			this._y = - qb._y;
+			this._z = - qb._z;
+
+			cosHalfTheta = - cosHalfTheta;
+
+		} else {
+
+			this.copy( qb );
+
+		}
+
+		if ( cosHalfTheta >= 1.0 ) {
+
+			this._w = w;
+			this._x = x;
+			this._y = y;
+			this._z = z;
+
+			return this;
+
+		}
+
+		var sqrSinHalfTheta = 1.0 - cosHalfTheta * cosHalfTheta;
+
+		if ( sqrSinHalfTheta <= Number.EPSILON ) {
+
+			var s = 1 - t;
+			this._w = s * w + t * this._w;
+			this._x = s * x + t * this._x;
+			this._y = s * y + t * this._y;
+			this._z = s * z + t * this._z;
+
+			this.normalize();
+
+			return this;
+
+		}
+
+		var sinHalfTheta = Math.sqrt( sqrSinHalfTheta );
+		var halfTheta = Math.atan2( sinHalfTheta, cosHalfTheta );
+		var ratioA = Math.sin( ( 1 - t ) * halfTheta ) / sinHalfTheta,
+			ratioB = Math.sin( t * halfTheta ) / sinHalfTheta;
+
+		this._w = ( w * ratioA + this._w * ratioB );
+		this._x = ( x * ratioA + this._x * ratioB );
+		this._y = ( y * ratioA + this._y * ratioB );
+		this._z = ( z * ratioA + this._z * ratioB );
+
+		return this;
+
+	};
+
+	this.equals = function ( quaternion ) {
+
+		return ( quaternion._x === this._x ) && ( quaternion._y === this._y ) && ( quaternion._z === this._z ) && ( quaternion._w === this._w );
+
+	};
+
+	this.fromArray = function ( array, offset ) {
+
+		if ( offset === undefined ) offset = 0;
+
+		this._x = array[ offset ];
+		this._y = array[ offset + 1 ];
+		this._z = array[ offset + 2 ];
+		this._w = array[ offset + 3 ];
+
+		return this;
+
+	};
+
+	this.toArray = function ( array, offset ) {
+
+		if ( array === undefined ) array = [];
+		if ( offset === undefined ) offset = 0;
+
+		array[ offset ] = this._x;
+		array[ offset + 1 ] = this._y;
+		array[ offset + 2 ] = this._z;
+		array[ offset + 3 ] = this._w;
+
+		return array;
+
+	};
+};
+
+Object.defineProperties( Quaternion.prototype, {
+
+	x: {
+
+		get: function () {
+
+			return this._x;
+
+		},
+
+		set: function ( value ) {
+
+			this._x = value;
+
+		}
+
+	},
+
+	y: {
+
+		get: function () {
+
+			return this._y;
+
+		},
+
+		set: function ( value ) {
+
+			this._y = value;
+
+		}
+
+	},
+
+	z: {
+
+		get: function () {
+
+			return this._z;
+
+		},
+
+		set: function ( value ) {
+
+			this._z = value;
+
+		}
+
+	},
+
+	w: {
+
+		get: function () {
+
+			return this._w;
+
+		},
+
+		set: function ( value ) {
+
+			this._w = value;
+
+		}
+
+	}
+
+} );
+
+///////////////////////////////////////////////////////////////
+
+Vector3 = function( x, y, z ) {
+
+	this.x = x || 0;
+	this.y = y || 0;
+	this.z = z || 0;
+
+    this.isVector3 = true;
+
+	this.set = function ( x, y, z ) {
+
+		this.x = x;
+		this.y = y;
+		this.z = z;
+
+		return this;
+
+	};
+
+	this.setScalar = function ( scalar ) {
+
+		this.x = scalar;
+		this.y = scalar;
+		this.z = scalar;
+
+		return this;
+
+	};
+
+	this.setX = function ( x ) {
+
+		this.x = x;
+
+		return this;
+
+	};
+
+	this.setY = function ( y ) {
+
+		this.y = y;
+
+		return this;
+
+	};
+
+	this.setZ = function ( z ) {
+
+		this.z = z;
+
+		return this;
+
+	};
+
+	this.setComponent = function ( index, value ) {
+
+		switch ( index ) {
+
+			case 0: this.x = value; break;
+			case 1: this.y = value; break;
+			case 2: this.z = value; break;
+			default: throw new Error( 'index is out of range: ' + index );
+
+		}
+
+		return this;
+
+	};
+
+	this.getComponent = function ( index ) {
+
+		switch ( index ) {
+
+			case 0: return this.x;
+			case 1: return this.y;
+			case 2: return this.z;
+			default: throw new Error( 'index is out of range: ' + index );
+
+		}
+
+	};
+
+	this.clone = function () {
+
+		return new this.constructor( this.x, this.y, this.z );
+
+	};
+
+	this.copy = function ( v ) {
+
+		this.x = v.x;
+		this.y = v.y;
+		this.z = v.z;
+
+		return this;
+
+	};
+
+	this.add = function ( v, w ) {
+
+		if ( w !== undefined ) {
+
+			console.warn( 'Vector3: .add() now only accepts one argument. Use .addVectors( a, b ) instead.' );
+			return this.addVectors( v, w );
+
+		}
+
+		this.x += v.x;
+		this.y += v.y;
+		this.z += v.z;
+
+		return this;
+
+	};
+
+	this.addScalar = function ( s ) {
+
+		this.x += s;
+		this.y += s;
+		this.z += s;
+
+		return this;
+
+	};
+
+	this.addVectors = function ( a, b ) {
+
+		this.x = a.x + b.x;
+		this.y = a.y + b.y;
+		this.z = a.z + b.z;
+
+		return this;
+
+	};
+
+	this.addScaledVector = function ( v, s ) {
+
+		this.x += v.x * s;
+		this.y += v.y * s;
+		this.z += v.z * s;
+
+		return this;
+
+	};
+
+	this.sub = function ( v, w ) {
+
+		if ( w !== undefined ) {
+
+			console.warn( 'Vector3: .sub() now only accepts one argument. Use .subVectors( a, b ) instead.' );
+			return this.subVectors( v, w );
+
+		}
+
+		this.x -= v.x;
+		this.y -= v.y;
+		this.z -= v.z;
+
+		return this;
+
+	};
+
+	this.subScalar = function ( s ) {
+
+		this.x -= s;
+		this.y -= s;
+		this.z -= s;
+
+		return this;
+
+	};
+
+	this.subVectors = function ( a, b ) {
+
+		this.x = a.x - b.x;
+		this.y = a.y - b.y;
+		this.z = a.z - b.z;
+
+		return this;
+
+	};
+
+	this.multiply = function ( v, w ) {
+
+		if ( w !== undefined ) {
+
+			console.warn( 'Vector3: .multiply() now only accepts one argument. Use .multiplyVectors( a, b ) instead.' );
+			return this.multiplyVectors( v, w );
+
+		}
+
+		this.x *= v.x;
+		this.y *= v.y;
+		this.z *= v.z;
+
+		return this;
+
+	};
+
+	this.multiplyScalar = function ( scalar ) {
+
+		this.x *= scalar;
+		this.y *= scalar;
+		this.z *= scalar;
+
+		return this;
+
+	};
+
+	this.multiplyVectors = function ( a, b ) {
+
+		this.x = a.x * b.x;
+		this.y = a.y * b.y;
+		this.z = a.z * b.z;
+
+		return this;
+
+	};
+
+    /*
+	this.applyEuler = function () {
+
+		var quaternion = new Quaternion();
+
+		return function applyEuler( euler ) {
+
+			if ( ! ( euler && euler.isEuler ) ) {
+
+				console.error( 'Vector3: .applyEuler() now expects an Euler rotation rather than a Vector3 and order.' );
+
+			}
+
+			return this.applyQuaternion( quaternion.setFromEuler( euler ) );
+
+		};
+
+	}();
+
+	this.applyAxisAngle = function () {
+
+		var quaternion = new Quaternion();
+
+		return function applyAxisAngle( axis, angle ) {
+
+			return this.applyQuaternion( quaternion.setFromAxisAngle( axis, angle ) );
+
+		};
+
+	}();
+    */
+
+	this.applyMatrix3 = function ( m ) {
+
+		var x = this.x, y = this.y, z = this.z;
+		var e = m.elements;
+
+		this.x = e[ 0 ] * x + e[ 3 ] * y + e[ 6 ] * z;
+		this.y = e[ 1 ] * x + e[ 4 ] * y + e[ 7 ] * z;
+		this.z = e[ 2 ] * x + e[ 5 ] * y + e[ 8 ] * z;
+
+		return this;
+
+	};
+
+	this.applyMatrix4 = function ( m ) {
+
+		var x = this.x, y = this.y, z = this.z;
+		var e = m.elements;
+
+		var w = 1 / ( e[ 3 ] * x + e[ 7 ] * y + e[ 11 ] * z + e[ 15 ] );
+
+		this.x = ( e[ 0 ] * x + e[ 4 ] * y + e[ 8 ] * z + e[ 12 ] ) * w;
+		this.y = ( e[ 1 ] * x + e[ 5 ] * y + e[ 9 ] * z + e[ 13 ] ) * w;
+		this.z = ( e[ 2 ] * x + e[ 6 ] * y + e[ 10 ] * z + e[ 14 ] ) * w;
+
+		return this;
+
+	};
+
+	this.applyQuaternion = function ( q ) {
+
+		var x = this.x, y = this.y, z = this.z;
+		var qx = q.x, qy = q.y, qz = q.z, qw = q.w;
+
+		// calculate quat * vector
+
+		var ix = qw * x + qy * z - qz * y;
+		var iy = qw * y + qz * x - qx * z;
+		var iz = qw * z + qx * y - qy * x;
+		var iw = - qx * x - qy * y - qz * z;
+
+		// calculate result * inverse quat
+
+		this.x = ix * qw + iw * - qx + iy * - qz - iz * - qy;
+		this.y = iy * qw + iw * - qy + iz * - qx - ix * - qz;
+		this.z = iz * qw + iw * - qz + ix * - qy - iy * - qx;
+
+		return this;
+
+	};
+
+	this.project = function ( camera ) {
+
+        console.error( 'Vector3: .project() is not supported in modified version' );
+
+		return this;
+
+	};
+
+	this.unproject = function ( camera ) {
+
+		console.error( 'Vector3: .unproject() is not supported in modified version' );
+
+        return this;
+
+	};
+
+	this.transformDirection = function ( m ) {
+
+		// input: Matrix4 affine matrix
+		// vector interpreted as a direction
+
+		var x = this.x, y = this.y, z = this.z;
+		var e = m.elements;
+
+		this.x = e[ 0 ] * x + e[ 4 ] * y + e[ 8 ] * z;
+		this.y = e[ 1 ] * x + e[ 5 ] * y + e[ 9 ] * z;
+		this.z = e[ 2 ] * x + e[ 6 ] * y + e[ 10 ] * z;
+
+		return this.normalize();
+
+	};
+
+	this.divide = function ( v ) {
+
+		this.x /= v.x;
+		this.y /= v.y;
+		this.z /= v.z;
+
+		return this;
+
+	};
+
+	this.divideScalar = function ( scalar ) {
+
+		return this.multiplyScalar( 1 / scalar );
+
+	};
+
+	this.min = function ( v ) {
+
+		this.x = Math.min( this.x, v.x );
+		this.y = Math.min( this.y, v.y );
+		this.z = Math.min( this.z, v.z );
+
+		return this;
+
+	};
+
+	this.max = function ( v ) {
+
+		this.x = Math.max( this.x, v.x );
+		this.y = Math.max( this.y, v.y );
+		this.z = Math.max( this.z, v.z );
+
+		return this;
+
+	};
+
+	this.clamp = function ( min, max ) {
+
+		// assumes min < max, componentwise
+
+		this.x = Math.max( min.x, Math.min( max.x, this.x ) );
+		this.y = Math.max( min.y, Math.min( max.y, this.y ) );
+		this.z = Math.max( min.z, Math.min( max.z, this.z ) );
+
+		return this;
+
+	};
+
+	this.clampScalar = function ( minVal, maxVal ) {
+
+		this.x = Math.max( minVal, Math.min( maxVal, this.x ) );
+		this.y = Math.max( minVal, Math.min( maxVal, this.y ) );
+		this.z = Math.max( minVal, Math.min( maxVal, this.z ) );
+
+		return this;
+
+	};
+
+	this.clampLength = function ( min, max ) {
+
+		var length = this.length();
+
+		return this.divideScalar( length || 1 ).multiplyScalar( Math.max( min, Math.min( max, length ) ) );
+
+	};
+
+	this.floor = function () {
+
+		this.x = Math.floor( this.x );
+		this.y = Math.floor( this.y );
+		this.z = Math.floor( this.z );
+
+		return this;
+
+	};
+
+	this.ceil = function () {
+
+		this.x = Math.ceil( this.x );
+		this.y = Math.ceil( this.y );
+		this.z = Math.ceil( this.z );
+
+		return this;
+
+	};
+
+	this.round = function () {
+
+		this.x = Math.round( this.x );
+		this.y = Math.round( this.y );
+		this.z = Math.round( this.z );
+
+		return this;
+
+	};
+
+	this.roundToZero = function () {
+
+		this.x = ( this.x < 0 ) ? Math.ceil( this.x ) : Math.floor( this.x );
+		this.y = ( this.y < 0 ) ? Math.ceil( this.y ) : Math.floor( this.y );
+		this.z = ( this.z < 0 ) ? Math.ceil( this.z ) : Math.floor( this.z );
+
+		return this;
+
+	};
+
+	this.negate = function () {
+
+		this.x = - this.x;
+		this.y = - this.y;
+		this.z = - this.z;
+
+		return this;
+
+	};
+
+	this.dot = function ( v ) {
+
+		return this.x * v.x + this.y * v.y + this.z * v.z;
+
+	};
+
+	// TODO lengthSquared?
+
+	this.lengthSq = function () {
+
+		return this.x * this.x + this.y * this.y + this.z * this.z;
+
+	};
+
+	this.length = function () {
+
+		return Math.sqrt( this.x * this.x + this.y * this.y + this.z * this.z );
+
+	};
+
+	this.manhattanLength = function () {
+
+		return Math.abs( this.x ) + Math.abs( this.y ) + Math.abs( this.z );
+
+	};
+
+	this.normalize = function () {
+
+		return this.divideScalar( this.length() || 1 );
+
+	};
+
+	this.setLength = function ( length ) {
+
+		return this.normalize().multiplyScalar( length );
+
+	};
+
+	this.lerp = function ( v, alpha ) {
+
+		this.x += ( v.x - this.x ) * alpha;
+		this.y += ( v.y - this.y ) * alpha;
+		this.z += ( v.z - this.z ) * alpha;
+
+		return this;
+
+	};
+
+	this.lerpVectors = function ( v1, v2, alpha ) {
+
+		return this.subVectors( v2, v1 ).multiplyScalar( alpha ).add( v1 );
+
+	};
+
+	this.cross = function ( v, w ) {
+
+		if ( w !== undefined ) {
+
+			console.warn( 'Vector3: .cross() now only accepts one argument. Use .crossVectors( a, b ) instead.' );
+			return this.crossVectors( v, w );
+
+		}
+
+		return this.crossVectors( this, v );
+
+	};
+
+	this.crossVectors = function ( a, b ) {
+
+		var ax = a.x, ay = a.y, az = a.z;
+		var bx = b.x, by = b.y, bz = b.z;
+
+		this.x = ay * bz - az * by;
+		this.y = az * bx - ax * bz;
+		this.z = ax * by - ay * bx;
+
+		return this;
+
+	};
+
+	this.projectOnVector = function ( vector ) {
+
+		var scalar = vector.dot( this ) / vector.lengthSq();
+
+		return this.copy( vector ).multiplyScalar( scalar );
+
+	};
+
+    /*
+	this.projectOnPlane = function () {
+
+		var v1 = new Vector3();
+
+		return function projectOnPlane( planeNormal ) {
+
+			v1.copy( this ).projectOnVector( planeNormal );
+
+			return this.sub( v1 );
+
+		};
+
+	}();
+    */
+
+    /*
+	this.reflect = function () {
+
+		// reflect incident vector off plane orthogonal to normal
+		// normal is assumed to have unit length
+
+		var v1 = new Vector3();
+
+		return function reflect( normal ) {
+
+			return this.sub( v1.copy( normal ).multiplyScalar( 2 * this.dot( normal ) ) );
+
+		};
+
+	}();
+    */
+
+	this.angleTo = function ( v ) {
+
+		var theta = this.dot( v ) / ( Math.sqrt( this.lengthSq() * v.lengthSq() ) );
+
+		// clamp, to handle numerical problems
+
+		return Math.acos( _Math.clamp( theta, - 1, 1 ) );
+
+	};
+
+	this.distanceTo = function ( v ) {
+
+		return Math.sqrt( this.distanceToSquared( v ) );
+
+	};
+
+	this.distanceToSquared = function ( v ) {
+
+		var dx = this.x - v.x, dy = this.y - v.y, dz = this.z - v.z;
+
+		return dx * dx + dy * dy + dz * dz;
+
+	};
+
+	this.manhattanDistanceTo = function ( v ) {
+
+		return Math.abs( this.x - v.x ) + Math.abs( this.y - v.y ) + Math.abs( this.z - v.z );
+
+	};
+
+	this.setFromSpherical = function ( s ) {
+
+		return this.setFromSphericalCoords( s.radius, s.phi, s.theta );
+
+	};
+
+	this.setFromSphericalCoords = function ( radius, phi, theta ) {
+
+		var sinPhiRadius = Math.sin( phi ) * radius;
+
+		this.x = sinPhiRadius * Math.sin( theta );
+		this.y = Math.cos( phi ) * radius;
+		this.z = sinPhiRadius * Math.cos( theta );
+
+		return this;
+
+	};
+
+	this.setFromCylindrical = function ( c ) {
+
+		console.error( 'Vector3: .setFromCylindrical() is not supported in modified version' );
+
+        return this;
+
+	};
+
+	this.setFromCylindricalCoords = function ( radius, theta, y ) {
+
+		this.x = radius * Math.sin( theta );
+		this.y = y;
+		this.z = radius * Math.cos( theta );
+
+		return this;
+
+	};
+
+	this.setFromMatrixPosition = function ( m ) {
+
+		var e = m.elements;
+
+		this.x = e[ 12 ];
+		this.y = e[ 13 ];
+		this.z = e[ 14 ];
+
+		return this;
+
+	};
+
+	this.setFromMatrixScale = function ( m ) {
+
+		var sx = this.setFromMatrixColumn( m, 0 ).length();
+		var sy = this.setFromMatrixColumn( m, 1 ).length();
+		var sz = this.setFromMatrixColumn( m, 2 ).length();
+
+		this.x = sx;
+		this.y = sy;
+		this.z = sz;
+
+		return this;
+
+	};
+
+	this.setFromMatrixColumn = function ( m, index ) {
+
+		return this.fromArray( m.elements, index * 4 );
+
+	};
+
+	this.equals = function ( v ) {
+
+		return ( ( v.x === this.x ) && ( v.y === this.y ) && ( v.z === this.z ) );
+
+	};
+
+	this.fromArray = function ( array, offset ) {
+
+		if ( offset === undefined ) offset = 0;
+
+		this.x = array[ offset ];
+		this.y = array[ offset + 1 ];
+		this.z = array[ offset + 2 ];
+
+		return this;
+
+	};
+
+	this.toArray = function ( array, offset ) {
+
+		if ( array === undefined ) array = [];
+		if ( offset === undefined ) offset = 0;
+
+		array[ offset ] = this.x;
+		array[ offset + 1 ] = this.y;
+		array[ offset + 2 ] = this.z;
+
+		return array;
+
+	};
+
+	this.fromBufferAttribute = function ( attribute, index, offset ) {
+
+		if ( offset !== undefined ) {
+
+			console.warn( 'Vector3: offset has been removed from .fromBufferAttribute().' );
+
+		}
+
+		this.x = attribute.getX( index );
+		this.y = attribute.getY( index );
+		this.z = attribute.getZ( index );
+
+		return this;
+
+	};
+
+};
+
+////////////////////////////////////////////////////////////////////
+
+THREE._Math = _Math;
+THREE.Vector3 = Vector3;
+THREE.Quaternion = Quaternion;