QuickJS: regex/string optimizations & workers uaf fix

 * Optimize String replace, args object creation, regex exec: bellard/quickjs@9f11034

 * Optimize regex backgracking bellard/quickjs@7ab2341

 * Fix use-after-free error in worker cleanup (we don't use this): bellard/quickjs@728ed94

Author: nickva

src/couch_quickjs/patches/01-spidermonkey-185-mode.patch

@@ -1,6 +1,6 @@
---- quickjs-master/quickjs.c	2025-11-15 08:52:50
-+++ quickjs/quickjs.c	2025-11-17 17:35:22
-@@ -31337,10 +31337,24 @@
+--- quickjs-master/quickjs.c	2025-11-22 06:10:55.000000000 -0500
++++ quickjs/quickjs.c	2025-11-22 12:45:37.890107480 -0500
+@@ -31420,10 +31420,24 @@
      if (s->token.val == TOK_FUNCTION ||
          (token_is_pseudo_keyword(s, JS_ATOM_async) &&
           peek_token(s, TRUE) == TOK_FUNCTION)) {

src/couch_quickjs/patches/02-test262-errors.patch

@@ -1,5 +1,5 @@
---- quickjs-master/test262_errors.txt	2025-11-15 08:52:50
-+++ quickjs/test262_errors.txt	2025-11-17 17:35:22
+--- quickjs-master/test262_errors.txt	2025-11-22 06:10:55.000000000 -0500
++++ quickjs/test262_errors.txt	2025-11-22 12:45:37.894107458 -0500
 @@ -19,6 +19,8 @@
  test262/test/language/expressions/compound-assignment/S11.13.2_A6.10_T1.js:24: Test262Error: #1: innerX === 2. Actual: 5
  test262/test/language/expressions/compound-assignment/S11.13.2_A6.11_T1.js:24: Test262Error: #1: innerX === 2. Actual: 5

src/couch_quickjs/quickjs/Changelog

@@ -1,4 +1,4 @@
-- micro optimizations (15% faster on bench-v8)
+- micro optimizations (30% faster on bench-v8)
 - added resizable array buffers
 - added ArrayBuffer.prototype.transfer
 - added the Iterator object and methods

src/couch_quickjs/quickjs/libregexp-opcode.h

@@ -39,12 +39,13 @@ DEF(goto, 5)
 DEF(split_goto_first, 5)
 DEF(split_next_first, 5)
 DEF(match, 1)
+DEF(lookahead_match, 1)
+DEF(negative_lookahead_match, 1) /* must come after */
 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(loop, 6) /* decrement the top the stack and goto if != 0 */
+DEF(push_i32, 6) /* push integer on the stack */
 DEF(word_boundary, 1)
 DEF(word_boundary_i, 1)
 DEF(not_word_boundary, 1)
@@ -58,10 +59,9 @@ DEF(range_i, 3) /* variable length */
 DEF(range32, 3) /* variable length */
 DEF(range32_i, 3) /* variable length */
 DEF(lookahead, 5)
-DEF(negative_lookahead, 5)
-DEF(push_char_pos, 1) /* push the character position on the stack */
-DEF(check_advance, 1) /* pop one stack element and check that it is different from the character position */
+DEF(negative_lookahead, 5) /* must come after */
+DEF(push_char_pos, 2) /* push the character position on the stack */
+DEF(check_advance, 2) /* pop one stack element and check that it is different from the character position */
 DEF(prev, 1) /* go to the previous char */
-DEF(simple_greedy_quant, 17)
 
 #endif /* DEF */