更新到2019-07-28版本

Author: llgoer

Changelog

@@ -1,3 +1,15 @@
+2019-07-28:
+
+- added dynamic import
+- added Promise.allSettled
+- added String.prototype.matchAll
+- added Object.fromEntries
+- reduced number of ticks in await
+- added BigInt support in Atomics
+- exported JS_NewPromiseCapability()
+- misc async function and async generator fixes
+- enabled hashbang support by default
+
 2019-07-21:
 
 - updated test262 tests

Makefile

@@ -11,8 +11,6 @@
 - 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 Atomics support
 
 Memory:
 - test border cases for max number of atoms, object properties, string length
@@ -78,6 +76,6 @@ REPL:
 - close all predefined methods in repl.js and jscalc.js
 
 Test262o:   0/11262 errors, 463 excluded
-Test262:   51/56682 errors, 787 excluded, 6289 skipped
-Test262bn: 56/58017 errors, 1007 excluded, 5398 skipped
-test262 commit: 51d1abadce1de0b38594b7c9972ee60762f35dd0
+Test262:   33/58145 errors, 785 excluded, 5576 skipped
+Test262bn: 39/60250 errors, 718 excluded, 4587 skipped
+test262 commit: 2ee3864136747ee69401b2d266e234cdd0a95965

TODO

@@ -1 +1 @@
-2019-07-21
+2019-07-28

VERSION

@@ -20,7 +20,7 @@
 @chapter Introduction
 
 QuickJS is a small and embeddable Javascript engine. It supports the
-ES2019 specification including modules, asynchronous
+ES2020 specification including modules, asynchronous
 generators and proxies.
 
 It optionally supports mathematical extensions such as big integers
@@ -33,9 +33,9 @@ overloading.
 
 @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 Fast interpreter with very low startup time: runs the 58000 tests of the ECMAScript Test Suite@footnote{@url{https://github.com/tc39/test262}} in about 85 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
+@item Almost complete ES2020 support including modules, asynchronous
 generators and full Annex B support (legacy web compatibility).
 
 @item Passes nearly 100% of the ECMAScript Test Suite tests.
@@ -207,7 +207,6 @@ Alternatively, the test262 tests can be installed with:
 @example
 git clone https://github.com/tc39/test262.git test262
 cd test262
-git checkout 51d1abadce1de0b38594b7c9972ee60762f35dd0
 patch -p1 < ../tests/test262.patch
 cd ..
 @end example
@@ -230,9 +229,9 @@ the test262 runner. The configuration files @code{test262.conf} and
 
 @section Language support
 
-@subsection ES2019 support
+@subsection ES2020 support
 
-The ES2019 specification
+The ES2020 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
@@ -773,7 +772,7 @@ 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
+and efficient and supports all the ES2020 features including the
 Unicode properties. As the Javascript compiler, it directly generates
 bytecode without a parse tree.
 

bjson.c

@@ -2522,11 +2522,12 @@ int bf_atof2(bf_t *r, slimb_t *pexponent,
                    radix == 0 && (flags & BF_ATOF_BIN_OCT)) {
             p += 2;
             radix = 2;
-        } else if ((p[1] >= '0' && p[1] <= '7') &&
+        } else if ((p[1] >= '0' && p[1] <= '9') &&
                    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++)
+            sep = 256;
+            for (i = 1; (p[i] >= '0' && p[i] <= '7'); i++)
                 continue;
             if (p[i] == '8' || p[i] == '9')
                 goto no_prefix;

cutils.c

@@ -2511,7 +2511,8 @@ int main(int argc, char **argv)
         printf("usage: %s regexp input\n", argv[0]);
         exit(1);
     }
-    bc = lre_compile(&len, error_msg, sizeof(error_msg), argv[1], 0, 0, NULL);
+    bc = lre_compile(&len, error_msg, sizeof(error_msg), argv[1],
+                     strlen(argv[1]), 0, NULL);
     if (!bc) {
         fprintf(stderr, "error: %s\n", error_msg);
         exit(1);

cutils.h

@@ -414,7 +414,6 @@ int main(int argc, char **argv)
                 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;
         }

doc/jsbignum.html

@@ -250,7 +250,7 @@ static void compile_file(JSContext *ctx, FILE *fo,
         fprintf(stderr, "Could not load '%s'\n", filename);
         exit(1);
     }
-    eval_flags = JS_EVAL_FLAG_SHEBANG | JS_EVAL_FLAG_COMPILE_ONLY;
+    eval_flags = JS_EVAL_FLAG_COMPILE_ONLY;
     if (is_module)
         eval_flags |= JS_EVAL_TYPE_MODULE;
     else

doc/jsbignum.pdf

@@ -158,6 +158,8 @@ DEF(revoke, "revoke")
 DEF(async, "async")
 DEF(exec, "exec")
 DEF(groups, "groups")
+DEF(status, "status")
+DEF(reason, "reason")
 #ifdef CONFIG_BIGNUM
 DEF(bigint, "bigint")
 DEF(bigfloat, "bigfloat")
@@ -214,6 +216,7 @@ DEF(Map_Iterator, "Map Iterator")
 DEF(Set_Iterator, "Set Iterator")
 DEF(Array_Iterator, "Array Iterator")
 DEF(String_Iterator, "String Iterator")
+DEF(RegExp_String_Iterator, "RegExp String Iterator")
 DEF(Generator, "Generator")
 DEF(Proxy, "Proxy")
 DEF(Promise, "Promise")
@@ -236,6 +239,7 @@ DEF(InternalError, "InternalError")
 DEF(Symbol_toPrimitive, "Symbol.toPrimitive")
 DEF(Symbol_iterator, "Symbol.iterator")
 DEF(Symbol_match, "Symbol.match")
+DEF(Symbol_matchAll, "Symbol.matchAll")
 DEF(Symbol_replace, "Symbol.replace")
 DEF(Symbol_search, "Symbol.search")
 DEF(Symbol_split, "Symbol.split")

doc/jsbignum.texi

@@ -336,7 +336,7 @@ static JSValue js_loadScript(JSContext *ctx, JSValueConst this_val,
         return JS_EXCEPTION;
     }
     ret = JS_Eval(ctx, (char *)buf, buf_len, filename,
-                  JS_EVAL_TYPE_GLOBAL | JS_EVAL_FLAG_SHEBANG);
+                  JS_EVAL_TYPE_GLOBAL);
     js_free(ctx, buf);
     JS_FreeCString(ctx, filename);
     return ret;

doc/quickjs.html

@@ -75,11 +75,8 @@ 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( special_object, 2, 0, 1, u8) /* 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 */
@@ -120,6 +117,7 @@ DEF(         regexp, 1, 2, 1, none) /* create a RegExp object from the pattern a
                                        bytecode string */
 DEF( get_super_ctor, 1, 1, 1, none)
 DEF(      get_super, 1, 1, 1, none)
+DEF(         import, 1, 1, 1, none) /* dynamic module import */
 
 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 */